cloog-0.18.2/0000775000175000017500000000000012254314447007716 500000000000000cloog-0.18.2/test/0000775000175000017500000000000012254314447010675 500000000000000cloog-0.18.2/test/check_run.sh0000775000175000017500000000626512254312305013115 00000000000000#!/bin/sh # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** check_run.sh ** # **-------------------------------------------------------------------** # ** First version: November 18th 2011 ** # **-------------------------------------------------------------------**/ # #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ # Refactor $SPECIAL_OPTIONS list to remove quotes and to replace spaces in # individual tests with %, e.g., "'file1 -f -1' 'file2'" becomes # "file1%-f%-1 file2". special_refactored=`echo "$SPECIAL_OPTIONS" | \ sed "s/' '/#/g" | \ sed 's/ /%/g' | \ sed "s/#/ /g" | \ sed "s/'//g"` $CHECKER "RUN C" "$FINITE_CLOOGTEST_C" "" "cloog" "c" "1" failedtest=$?; $CHECKER "RUN SPECIAL" "$special_refactored" "" "cloog" "c" "1" failedtest=`expr $failedtest + $?`; $CHECKER "RUN SPECIAL -sh 1" "$special_refactored" "-sh 1" "cloog" "c" "1" failedtest=`expr $failedtest + $?`; return $failedtest; cloog-0.18.2/test/param-split.cloog0000664000175000017500000000011012254312305014052 00000000000000c 0 3 0 2 1 2 4 1 1 0 0 1 -1 1 0 0 0 0 1 1 4 0 1 0 0 0 0 0 0 0 cloog-0.18.2/test/mode.cloog0000664000175000017500000000057212254312305012561 00000000000000# language: C c # parameters n m 1 4 # n m 1 1 0 0 1 0 2 # Number of statements 1 # S2 {i, j | 0<=i<=n; 0<=j<=i} 4 6 # i j n m 1 1 1 0 0 0 0 1 -1 0 1 0 0 1 0 1 0 0 0 1 1 -1 0 0 0 0 0 0 1 # S2 {i, j | 0<=i<=n; 0<=j<=m} 4 6 # i j n m 1 1 1 0 0 0 0 1 -1 0 1 0 0 1 0 1 0 0 0 1 0 -1 0 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/guide.c0000664000175000017500000000031112254312305012040 00000000000000/* Generated from ../../../git/cloog/test/guide.cloog by CLooG 0.14.0-245-gd8c1718 gmp bits in 0.00s. */ if (N >= 1) { for (i=1;i<=N;i++) { S1(i); } for (i=N+1;i<=2*N;i++) { S2(i); } } cloog-0.18.2/test/walters3.cloog0000664000175000017500000000077312254312305013404 00000000000000# language: C c # parameters 1 2 1 1 1 2 1 15 5 1 -1 0 0 10 1 -1 0 0 8 1 -1 0 2 1 1 1 0 -2 0 1 -1 0 2 0 1 0 0 1 -1 1 1 -2 0 0 1 -1 2 0 1 1 1 0 0 -1 1 -1 0 0 10 0 1 -2 0 0 1 1 -2 0 0 1 -1 2 0 1 1 1 0 -2 0 1 -1 0 2 1 0 0 0 1 7 5 1 1 0 0 -1 1 -1 0 0 10 0 1 -2 0 0 1 1 -2 0 0 1 -1 2 0 1 1 1 0 -2 0 1 -1 0 2 1 0 0 0 1 j a b #-------- SCATTERING ------------- 0 # no scattering function cloog-0.18.2/test/esced.c0000664000175000017500000000046012254312305012033 00000000000000/* Generated from ../../../git/cloog/test/esced.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (m >= 1) { if (n >= 1) { for (i=1;i<=m;i++) { S1(i) ; for (j=1;j<=n;j++) { S2(i,j) ; } } } if (n <= 0) { for (i=1;i<=m;i++) { S1(i) ; } } } cloog-0.18.2/test/walters3.good.c0000664000175000017500000000121512254312305013442 00000000000000/* Generated from ../../../git/cloog/test/walters3.cloog by CLooG 0.14.0-338-g99c7504 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(j,a,b) { hash(1); hash(j); hash(a); hash(b); } #define S2(j,a,b) { hash(2); hash(j); hash(a); hash(b); } void test() { /* Original iterators. */ int j, a, b; for (j=2;j<=8;j++) { if (j%2 == 0) { S1(j,j/2,j/2); S2(j,j/2,j/2); } } S2(10,5,5); } cloog-0.18.2/test/vivien2.good.c0000664000175000017500000003447512254312305013276 00000000000000/* Generated from ../../../git/cloog/test/vivien2.cloog by CLooG 0.14.0-76-gef19709 gmp bits in 0.58s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i) { hash(3); hash(i); } #define S4(i,j) { hash(4); hash(i); hash(j); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } #define S6(i,j) { hash(6); hash(i); hash(j); } void test(int n) { /* Scattering iterators. */ int p1, p2, p3; /* Original iterators. */ int i, j, k; for (p1=-54*n+4;p1<=4;p1++) { if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } } S3(1) ; S4(1,2) ; S1(2) ; S6(1,2) ; for (p1=7;p1<=9;p1++) { for (p2=ceild(-p1+2,4);p2<=-1;p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } if (p1%2 == 0) { j = (p1-2)/2 ; S6(1,(p1-2)/2) ; } if ((p1+1)%2 == 0) { i = (p1-3)/2 ; S2((p1-3)/2,1) ; } } S4(2,3) ; S4(1,4) ; S5(2,3,1) ; S6(2,3) ; S1(4) ; S6(1,4) ; for (p1=11;p1<=12;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=-1;p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } if (p1%2 == 0) { j = (p1-4)/2 ; S6(2,(p1-4)/2) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } if (p1%2 == 0) { j = (p1-2)/2 ; S6(1,(p1-2)/2) ; } if ((p1+1)%2 == 0) { i = (p1-3)/2 ; S2((p1-3)/2,1) ; } for (p2=2;p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } S3(3) ; S2(5,1) ; S2(4,2) ; for (p1=14;p1<=2*n+2;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } p2 = floord(-p1+9,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+10,4);p2<=-1;p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } if (p1%2 == 0) { j = (p1-4)/2 ; S6(2,(p1-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } if (p1%2 == 0) { j = (p1-2)/2 ; S6(1,(p1-2)/2) ; } if ((p1+1)%2 == 0) { i = (p1-3)/2 ; S2((p1-3)/2,1) ; } for (p2=2;p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } p1 = 2*n+3 ; if ((n+1)%2 == 0) { i = (n+1)/2 ; S3((n+1)/2) ; } S2(n,1) ; for (p2=2;p2<=floord(n,2);p2++) { i = -p2+n+1 ; S2(-p2+n+1,p2) ; } p1 = 2*n+4 ; for (p2=ceild(-n-1,2);p2<=floord(-2*n+1,4);p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; } for (p2=ceild(-n+1,2);p2<=floord(-2*n+5,4);p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } for (p2=ceild(-n+3,2);p2<=-2;p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; i = -p2+2 ; j = p2+n ; S6(-p2+2,p2+n) ; for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } j = n-1 ; S6(3,n-1) ; S5(2,n,1) ; S6(2,n) ; i = n+1 ; S1(n+1) ; for (p1=2*n+5;p1<=min(4*n-10,2*n+58);p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } p2 = floord(-p1+9,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+2*n+3,2);p2<=min(floord(-p1+2*n+4,2),-1);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=4*n-9;p1<=min(4*n-8,2*n+58);p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=4*n-7;p1<=min(4*n-6,2*n+58);p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+2*n+1,2);p2<=floord(-p1+9,4);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n+2,2);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=4*n-5;p1<=2*n+58;p1++) { for (p2=ceild(-p1+2,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } } for (p2=max(ceild(-p1+2*n+1,2),ceild(-p1+6,4));p2<=floord(-p1+2*n+2,2);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=max(ceild(-p1+2*n+3,2),ceild(-p1+10,4));p2<=floord(-p1+2*n+4,2);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=2*n+59;p1<=4*n-10;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } p2 = floord(-p1+9,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-9,2*n+59);p1<=4*n-8;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-7,2*n+59);p1<=4*n-6;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+2*n+1,2);p2<=floord(-p1+9,4);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n+2,2);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-5,2*n+59);p1<=4*n-2;p1++) { for (p2=ceild(-p1+2,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } } for (p2=max(ceild(-p1+2*n+1,2),ceild(-p1+6,4));p2<=floord(-p1+2*n+2,2);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=max(ceild(-p1+10,4),ceild(-p1+2*n+3,2));p2<=floord(-p1+2*n+4,2);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } p1 = 4*n-1 ; p2 = n-1 ; j = n-1 ; S2(n,n-1) ; for (p1=4*n;p1<=4*n+1;p1++) { if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } } } cloog-0.18.2/test/merge.cloog0000664000175000017500000000026412254312305012732 00000000000000c 0 2 0 3 1 1 3 0 -1 0 0 0 0 1 2 3 1 1 -2 1 -1 10 0 0 0 1 2 3 1 1 0 1 -1 10 0 0 0 0 3 2 5 0 1 0 -1 0 0 0 1 0 0 2 5 0 1 0 -1 0 0 0 1 0 -1 2 5 0 1 0 -1 0 0 0 1 0 -2 0 cloog-0.18.2/test/ex1.cloog0000664000175000017500000000052612254312305012331 00000000000000# language: C c # parameters {n} 1 3 # n 1 1 1 -25 1 n 2 # Number of statements 1 # {i | 0<=i<=n, 0<=j<=n-15} 4 5 # i j n 1 1 1 0 0 0 1 -1 0 1 0 1 0 1 0 0 1 0 -1 1 -15 0 0 0 1 # {i | 15<=i<=n, 10<=j<=n} 4 5 # i j n 1 1 1 0 0 -15 1 -1 0 1 0 1 0 1 0 -10 1 0 -1 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/check_fortran.sh0000775000175000017500000000507012254312305013755 00000000000000#!/bin/sh # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** check_fortran.sh ** # **-------------------------------------------------------------------** # ** First version: November 17th 2011 ** # **-------------------------------------------------------------------**/ # #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ $CHECKER "FORTRAN" "$CLOOGTEST_FORTRAN" "" "cloog" "f" "0" cloog-0.18.2/test/otl.cloog0000664000175000017500000000530012254312305012425 00000000000000# created: Tue Mar 23 01:51:15 CET 2010 # ---------------------- CONTEXT ---------------------- c # language is C # Context 2 4 1 1 0 -1 1 0 1 -1 1 # set parameter names M N # --------------------- STATEMENTS -------------------- 1 1 # domains per statement 76 10 1 -5 0 0 0 0 0 2 2 -7 1 -20 0 0 0 20 20 0 0 16 1 -40 0 0 0 0 80 0 8 16 1 -4 4 0 0 0 4 0 0 4 1 -20 0 0 0 40 0 0 0 8 1 -20 0 20 0 20 0 0 0 16 1 -20 0 40 0 0 0 0 4 8 1 -20 40 0 0 0 0 0 0 16 1 -4 4 4 0 0 0 0 0 4 1 -20 0 0 0 0 20 4 4 -4 1 -10 0 0 0 10 0 2 0 2 1 -5 0 0 5 0 0 0 0 3 1 -5 5 0 0 0 0 1 0 2 1 -10 0 10 0 0 0 2 2 -2 1 0 -10 -10 10 0 0 0 2 6 1 20 -20 -20 0 0 0 0 4 16 1 0 -10 0 10 0 -10 0 2 6 1 40 -40 0 0 0 -40 0 8 32 1 0 -20 0 10 0 0 0 4 0 1 0 -10 0 0 0 0 2 4 -10 1 40 -80 0 0 0 0 0 16 8 1 0 -10 0 0 0 10 0 2 2 1 0 -5 0 0 5 0 0 0 3 1 0 -10 0 10 0 0 0 0 4 1 0 -5 5 0 0 0 0 1 1 1 20 -20 0 0 0 0 0 0 12 1 0 0 -10 10 -10 0 0 2 8 1 40 0 -40 0 -40 0 0 8 40 1 0 0 -20 10 0 0 0 2 4 1 0 0 -5 0 0 0 1 1 -2 1 40 0 -80 0 0 0 0 8 24 1 0 0 -5 0 0 5 0 0 4 1 0 0 -10 0 10 0 0 0 4 1 0 0 -10 10 0 0 0 0 2 1 0 5 -5 0 0 0 0 0 3 1 40 0 -40 0 0 0 0 0 16 1 0 0 0 -5 0 0 2 2 -6 1 0 0 0 -20 20 20 0 0 20 1 0 0 0 -40 0 80 0 8 24 1 0 20 0 -20 0 20 0 0 24 1 0 0 20 -20 20 0 0 0 20 1 0 0 0 -20 40 0 0 0 12 1 0 0 40 -20 0 0 0 4 12 1 0 40 0 -20 0 0 0 0 20 1 0 20 20 -20 0 0 0 0 24 1 0 0 0 -40 0 40 8 8 0 1 0 0 0 -20 20 0 4 0 8 1 0 0 20 -20 0 0 4 4 0 1 2 0 0 -2 0 0 0 0 2 1 0 10 0 -10 0 0 2 0 6 1 0 0 0 10 -10 -10 0 2 8 1 80 0 0 0 -80 -80 0 16 80 1 0 0 0 10 -20 0 0 4 4 1 0 0 0 0 -10 0 2 4 -8 1 120 0 0 0 -240 0 0 48 72 1 0 0 0 0 -20 20 0 4 8 1 0 0 0 10 -10 0 0 0 6 1 0 0 10 0 -10 0 0 2 4 1 0 1 0 0 -1 0 0 0 1 1 40 0 0 0 -40 0 0 0 32 1 0 0 0 10 0 -20 0 2 4 1 0 0 0 0 0 -5 1 1 -2 1 80 0 0 0 0 -160 0 16 48 1 0 0 0 0 10 -10 0 0 4 1 0 0 0 10 0 -10 0 0 2 1 0 0 5 0 0 -5 0 0 4 1 0 10 0 0 0 -10 0 0 6 1 40 0 0 0 0 -40 0 0 16 1 0 0 0 0 0 4 0 0 0 1 0 0 0 0 20 0 0 0 -8 1 0 0 0 20 0 0 0 0 -12 1 0 0 4 0 0 0 0 0 0 1 0 20 0 0 0 0 0 0 -4 1 80 0 0 0 0 0 0 0 -32 1 0 0 0 0 0 0 0 1 -4 1 0 0 0 0 0 0 1 0 -3 0 0 0 # for future options... 1 # set the iterator names outerTimeTileIter outerProcTileIter1 outerProcTileIter2 innerTimeTileIter innerProcTileIter1 innerProcTileIter2 # --------------------- SCATTERING -------------------- 1 # Scattering functions 6 16 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 # we set the scattering dimension names outerTimeTileScatter outerProcTileScatter1 outerProcTileScatter2 innerTimeTileScatter innerProcTileScatter1 innerProcTileScatter2 cloog-0.18.2/test/checker.sh0000775000175000017500000001336112254312305012553 00000000000000#!/bin/sh # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** checker.sh ** # **-------------------------------------------------------------------** # ** First version: November 16th 2011 ** # **-------------------------------------------------------------------**/ # #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ # This is the main test script of CLooG. It checks that CLooG generates # a convenient output for an input set of tests, according to some # parameters (see below). Two checking policies are possible: simply # compare the generated codes or compare the executions of the generated # codes. The reference output files must be present: if we are checking a # file foo.cloog, either foo.c or foo.f must exist in the case of a simple # code generation checking, and either foo.good.c or foo.good.f must exist # in the case of a run check. TEST_NAME="$1" ## Name of the group of files to test TEST_FILES="$2" ## List of test file prefixes and individual options ## spaces between the elements of one test are ## represented with '%', e.g., "file -f -1" is ## "file%-f%-1". TEST_GLOBAL_OPTIONS="$3" ## Options for all the tests in the group TEST_INPUT_EXTENSION="$4" ## Extension of the input file TEST_OUTPUT_EXTENSION="$5" ## Extension of the generated file TEST_RUN="$6" ## "1" if the checking policy is to generate, ## compile and run, generate only otherwise failedtest=0; cloog=$top_builddir/cloog$EXEEXT echo " /*-----------------------------------------------*" echo " * Testing CLooG: $TEST_NAME test set " echo " *-----------------------------------------------*/" for x in $TEST_FILES; do name=`echo $x | sed 's/%/ /g' | cut -d\ -f1`; individual_options=`echo $x | sed 's/%/ /g' | cut -s -d\ -f2-`; input="$srcdir/$name.$TEST_INPUT_EXTENSION"; output="$srcdir/$name.$TEST_OUTPUT_EXTENSION"; options="$individual_options $TEST_GLOBAL_OPTIONS"; echo "Check file $input \c"; if [ "$options" = " " ]; then echo "(no option), \c" else echo "(options $options), \c"; fi; if [ "$TEST_RUN" = "1" ]; then generate_test=$srcdir/generate_test$EXEEXT test_run=$srcdir/test_run$EXEEXT good="$srcdir/$name.good.$TEST_OUTPUT_EXTENSION"; echo "generating... \c"; $cloog $options -q -callable 1 $input > test_test.c; $generate_test < $input > test_main.c; echo "compiling... \c"; # TODO: (nd Cedric) The following line is to deal with the (F*CKING !!!) # space in PACKAGE_STRING, introduced by AC_INIT and which, for # some reason, seems to be the source of a problem with my shell. # Maybe there is a better way to solve the problem... COMPILE=`echo $COMPILE | sed 's/\\\ /_SPACE_/g'`; $COMPILE -c test_test.c; $COMPILE -Dtest=good -c $good -o test_good.o; $LINK test_main.c test_test.o test_good.o > /dev/null; echo "comparing... \c"; $test_run; result=$?; rm -f $test_run; else echo "generating... \c"; $cloog $options -q $input > cloog_temp; diff -u -w --ignore-matching-lines='CLooG' cloog_temp $output; result=$?; rm -f cloog_temp; fi; if [ "$result" -ne "0" ]; then echo -e "\033[31mFAIL: $output is not the same\033[0m"; failedtest=`expr $failedtest + 1`; else echo "PASS"; fi; done; if [ $failedtest != 0 ]; then echo "\033[31m[CLooG] FAIL: $failedtest tests failed in $TEST_NAME\033[0m"; else echo "[CLooG] PASS: $TEST_NAME passed :-) !"; fi exit $failedtest cloog-0.18.2/test/basic-bounds-1.c0000664000175000017500000000022312254312305013454 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (i=0;i<=2;i++) { S1(i) ; } cloog-0.18.2/test/no_lindep.cloog0000664000175000017500000000032112254312305013574 00000000000000# language C c # 2 parameters 1 4 1 0 0 0 0 # 1 statement 1 # 1 domain # i=n+2 1 1 5 0 -1 0 1 2 0 0 0 0 # 1 scattering function # c1=M+1 # c2=N 1 2 7 0 -1 0 0 1 0 1 0 0 -1 0 0 1 0 0 cloog-0.18.2/test/byu98-1-2-3.good.c0000664000175000017500000000153412254312305013317 00000000000000/* Generated from ../../../git/cloog/test/byu98-1-2-3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test() { /* Original iterators. */ int i, j; for (i=2;i<=3;i++) { for (j=-i+6;j<=6;j++) { S1(i,j) ; } } for (j=3;j<=4;j++) { S1(4,j) ; } S1(4,5) ; S2(4,5) ; S1(4,6) ; S1(5,4) ; S2(5,4) ; for (j=5;j<=6;j++) { S1(5,j) ; } for (i=6;i<=7;i++) { j = -i+9 ; S2(i,-i+9) ; for (j=i-1;j<=6;j++) { S1(i,j) ; } } S2(8,1) ; } cloog-0.18.2/test/block.cloog0000664000175000017500000000032212254312305012720 00000000000000c 0 2 0 3 1 0 2 0 0 0 1 0 2 0 0 0 1 2 3 1 1 0 1 -1 1 0 0 0 0 3 2 4 0 -1 0 0 # c1 = 0 0 0 -1 0 # c2 = 0 2 4 0 -1 0 1 # c1 = 1 0 0 -1 0 # c2 = 0 2 5 0 -1 0 1 0 # c1 = i 0 0 -1 0 1 # c2 = 1 0 cloog-0.18.2/test/levenshtein-1-2-3f.f0000664000175000017500000000120012254312305014073 00000000000000! Generated from ../../../git/cloog/test/levenshtein-1-2-3f.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.11s. S1(0,0) S2(1,0) S3(1,1) DO i=2, N S2(i,0) DO j=1, i-1 S6(i,j) END DO S3(i,i) END DO S7(N+1,0) DO j=1, N S6(N+1,j) S8(N+1,j) END DO DO i=N+2, 2*M-N-2 j = FLOOR(REAL(i-N-1)/REAL(2)) S7(i,j) IF (MOD(i+N, 2) == 0) THEN S5(i,(i-N)/2) S8(i,(i-N)/2) END IF DO j=CEILING(REAL(i-N+1)/REAL(2)), FLOOR(REAL(i+N-1)/REAL(2)) S6(i,j) S8(i,j) END DO IF (MOD(i+N, 2) == 0) THEN S4(i,(i+N)/2) S8(i,(i+N)/2) END IF END DO DO i=2*M-N-1, 2*M-2 DO j=i-M+1, M-1 S6(i,j) END DO END DO cloog-0.18.2/test/otl.c0000664000175000017500000000630312254312305011550 00000000000000/* Generated from ../../../git/cloog/test/otl.cloog by CLooG 0.14.0-278-gcf1f323 gmp bits in 0.26s. */ if ((M >= 3) && (N >= 4)) { for (outerTimeTileScatter=1;outerTimeTileScatter<=floord(2*M+2*N-7,5);outerTimeTileScatter++) { 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++) { 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++) { 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++) { for (innerProcTileScatter1=max(max(max(max(ceild(innerTimeTileScatter,2),ceild(5*innerTimeTileScatter-M-2,5)),ceild(5*outerTimeTileScatter-M-1,5)),outerProcTileScatter1),outerTimeTileScatter-outerProcTileScatter2);innerProcTileScatter1<=min(min(min(min(min(min(min(floord(M+2*N-4,5),floord(5*outerProcTileScatter2+N+2,5)),floord(-5*outerProcTileScatter2+5*innerTimeTileScatter+N+4,5)),floord(5*outerTimeTileScatter-5*outerProcTileScatter2+N+5,5)),floord(5*innerTimeTileScatter+2*N+2,10)),floord(5*outerTimeTileScatter+2*N+3,10)),outerTimeTileScatter),outerProcTileScatter1+1);innerProcTileScatter1++) { for (innerProcTileScatter2=outerProcTileScatter2;innerProcTileScatter2<=outerProcTileScatter2;innerProcTileScatter2++) { for (outerTimeTileIter=outerTimeTileScatter;outerTimeTileIter<=outerTimeTileScatter;outerTimeTileIter++) { for (outerProcTileIter1=outerProcTileScatter1;outerProcTileIter1<=outerProcTileScatter1;outerProcTileIter1++) { for (outerProcTileIter2=outerProcTileScatter2;outerProcTileIter2<=outerProcTileScatter2;outerProcTileIter2++) { for (innerTimeTileIter=innerTimeTileScatter;innerTimeTileIter<=innerTimeTileScatter;innerTimeTileIter++) { for (innerProcTileIter1=innerProcTileScatter1;innerProcTileIter1<=innerProcTileScatter1;innerProcTileIter1++) { for (innerProcTileIter2=outerProcTileScatter2;innerProcTileIter2<=outerProcTileScatter2;innerProcTileIter2++) { S1(outerTimeTileIter,outerProcTileIter1,outerProcTileIter2,innerTimeTileIter,innerProcTileIter1,innerProcTileIter2); } } } } } } } } } } } } } cloog-0.18.2/test/0D-1.cloog0000664000175000017500000000003612254312305012231 00000000000000c 0 2 0 1 1 0 2 0 0 0 0 0 cloog-0.18.2/test/forwardsub-3-1-2.cloog0000664000175000017500000000133012254312305014441 00000000000000# language: C c # Context #{N | 3<=N} 2 3 # M 1 1 1 -3 1 0 1 0 4 # Number of statements 1 #{t1,i | 3<=t1<=N+1; i=1; 3<=N} 5 5 # i j M 1 0 0 1 0 -1 1 0 0 1 -3 1 -1 0 1 1 1 1 0 0 -3 1 0 0 0 1 0 0 0 1 #{t1,i | 2i+1<=t1<=i+N; 2<=i} 4 5 # i j M 1 1 1 -2 0 -1 1 0 1 0 -2 1 -1 1 1 0 1 0 0 0 1 0 0 0 1 #{t1,i | t1=2; i=1; 3<=N} 4 5 # i j M 1 0 1 0 0 -2 0 0 1 0 -1 1 0 0 1 -3 1 0 0 0 1 0 0 0 1 #{t1,i | t1=2i; 2<=i<=N; 3<=N} 5 5 # i j M 1 0 1 -2 0 0 1 0 0 1 -3 1 0 -1 1 0 1 0 1 0 -2 1 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/darte.cloog0000664000175000017500000000127012254312305012730 00000000000000# language: C c # parameters n m 1 3 # n 1 1 0 0 1 n 2 # Number of statements 1 # S1 {i, j, k | 1<=i<=n; 1<=j<=n, 1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 0 0 -1 1 0 0 0 0 1 # S2 {i, j, k | 1<=i<=n; 1<=j<=n, 1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 0 0 -1 1 0 0 0 0 0 2 # Scattering functions 3 9 # c1 c2 c3 i j k n 1 0 1 0 0 -1 1 0 0 0 0 0 1 0 -1 -1 0 0 0 0 0 0 1 -1 -1 -2 0 0 3 9 # c1 c2 c3 i j k n 1 0 1 0 0 -1 1 0 0 -1 0 0 1 0 -1 -1 0 0 -2 0 0 0 1 0 0 -1 0 0 1 t1 t2 t3 cloog-0.18.2/test/dot.cloog0000664000175000017500000000061412254312305012420 00000000000000# language: C c # parameters {M, N | M>=1 N >=1} 2 4 1 1 0 -1 1 0 1 -1 0 2 # Number of statements 1 # {i, j | i=0 0<=i<=N 1<=j<=M} 5 6 0 1 0 0 0 0 1 1 0 0 0 0 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 1 # {i, j | i>=1 0<=i<=N 1<=j<=M} 5 6 1 1 0 0 0 -1 1 1 0 0 0 0 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/walters2.good.c0000664000175000017500000000133512254312305013444 00000000000000/* Generated from /home/skimo/git/cloog/test/walters2.cloog by CLooG 0.14.0-227-g08f253a gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(j,i) { hash(1); hash(j); hash(i); } #define S2(j,i) { hash(2); hash(j); hash(i); } void test() { /* Original iterators. */ int j, i; for (i=0;i<=51;i++) { S2(0,i); } for (j=1;j<=24;j++) { S2(j,0); for (i=1;i<=50;i++) { S1(j,i); } S2(j,51); } for (i=0;i<=51;i++) { if (i >= 0) { S2(25,i); } } } cloog-0.18.2/test/equality2.good.c0000664000175000017500000000243012254312305013615 00000000000000/* Generated from ../../../git/cloog/test/equality2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.05s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i0,i1,i2,i3,i4,i5,i6,i7,i8,i9,i10) { hash(1); hash(i0); hash(i1); hash(i2); hash(i3); hash(i4); hash(i5); hash(i6); hash(i7); hash(i8); hash(i9); hash(i10); } #define S2(i0,i1,i2,i3,i4,i5,i6,i7,i8,i9,i10,i11,i12,i13,i14) { hash(2); hash(i0); hash(i1); hash(i2); hash(i3); hash(i4); hash(i5); hash(i6); hash(i7); hash(i8); hash(i9); hash(i10); hash(i11); hash(i12); hash(i13); hash(i14); } void test() { /* Original iterators. */ int i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14; for (i0=1;i0<=10000;i0++) { for (i1=1000;i1<=1016;i1++) { for (i2=1;i2<=min(-2*i1+2033,2*i1-1999);i2++) { if (2*i1 == i2+1999) { S2(i0,i1,i2,1,i0,2*i1-1000,1,2,i0,i1-499,2*i1-1999,i0,2*i1-1999,i1-999,i1-999) ; } if (i2 == 1) { if (i1%2 == 0) { S1(i0,i1,i2,2,i0,(i1+2)/2,i1-999,i0,i1-999,(i1-998)/2,(i1-998)/2) ; } } } } } } cloog-0.18.2/test/stride4.cloog0000664000175000017500000000064712254312305013216 00000000000000# Language: C c # Context: 1 0 3 0 0 0 1 1 # Parameter name(s) t # Statement number: 1 # Iteration domain of statement 1. 1 6 6 2 0 1 1 0 1 0 16 -1 0 0 0 1 0 -1 0 1 1 0 0 0 0 1 -1 0 0 0 99 1 0 0 0 1 0 1 0 0 0 -1 15 0 0 0 # For future options. 1 # Iterator name(s) i0 i1 # No scattering functions. 0 cloog-0.18.2/test/vasilache.cloog0000664000175000017500000002607512254312305013602 00000000000000# A SCoP from matmul (matmul.B.main.scop1.cloog) to check normalization # # Options: # cloog -f 8 -l 9 vasilache.cloog # # Correct: # S1; # S2; # for (p0=0;p0<=N-1;p0++) { # for (p1=0;p1<=N-1;p1++) { # S4(i = p0,j = p1); # S5(i = p0,j = p1); # } # } # for (p0=0;p0<=N-1;p0++) { # for (p1=0;p1<=N-1;p1++) { # for (p2=0;p2<=floord(N-1,32);p2++) { # S7(i = p0,j = p1,k = p2,l = 32*p2); # for (p3=32*p2+1;p3<=min(N-1,32*p2+31);p3++) { # S6(i = p0,j = p1,k = p2,l = p3-1); # S7(i = p0,j = p1,k = p2,l = p3); # } # if (p2 >= ceild(N-32,32)) { # S6(i = p0,j = p1,k = p2,l = N-1); # } # if (p2 <= floord(N-33,32)) { # S6(i = p0,j = p1,k = p2,l = 32*p2+31); # } # } # } # } # S8; # # # NOT correct: # S1 ; # S2 ; # for (p1=0;p1<=N-1;p1++) { # for (p3=0;p3<=N-1;p3++) { # S4(i = p1,j = p3) ; # S5(i = p1,j = p3) ; # } # } # for (p1=0;p1<=N-1;p1++) { # for (p3=0;p3<=N-1;p3++) { # for (p5=0;p5<=floord(N-1,32);p5++) { # if (p5 <= 0) { # S7(i = p1,j = p3,k = p5,l = 0) ; # } # p7 = 32*p5 ; # l = 32*p5 ; # S7(i = p1,j = p3,k = p5) ; # for (p7=max(32*p5+1,1);p7<=min(32*p5+31,N-1);p7++) { # l = p7-1 ; # S6(i = p1,j = p3,k = p5) ; # S7(i = p1,j = p3,k = p5,l = p7) ; # } # if (p5 >= ceild(N-32,32)) { # l = N-1 ; # S6(i = p1,j = p3,k = p5) ; # } # p7 = 32*p5+32 ; # l = 32*p5+31 ; # S6(i = p1,j = p3,k = p5) ; # } # } # } # S8 ; c # language is C # ---------- CONTEXT ---------- # Context (constraints on parameters) 2 4 # 1 lines, 4 columns 1 -1 0 3 1 0 1 -100 0 # Automatically find parameter names # ---------- STATEMENTS ---------- 8 # Number of statements 1 # Statement has a non resticted domain 1 4 1 0 0 0 0 0 0 1 # Statement has a non resticted domain 1 4 1 0 0 0 0 0 0 1 # Statement has 1 domain 1 4 1 1 0 -79 0 0 0 1 # Statement has 1 domain 4 6 1 1 0 0 0 0 1 -1 0 0 1 -1 1 0 1 0 0 0 1 0 -1 0 1 -1 0 0 0 1 # Statement has 1 domain 4 6 1 1 0 0 0 0 1 -1 0 0 1 -1 1 0 1 0 0 0 1 0 -1 0 1 -1 0 0 0 1 # Statement has 1 domain 8 8 1 1 0 0 0 0 0 0 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 0 1 0 -1 0 0 0 1 -1 1 0 0 0 1 0 0 0 1 0 0 0 -1 0 1 -1 1 0 0 -32 1 0 0 0 1 0 0 32 -1 0 0 31 0 0 0 1 # Statement has 1 domain 8 8 1 1 0 0 0 0 0 0 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 0 1 0 -1 0 0 0 1 -1 1 0 0 0 1 0 0 0 1 0 0 0 -1 0 1 -1 1 0 0 -32 1 0 0 0 1 0 0 32 -1 0 0 31 0 0 0 1 # Statement has a non resticted domain 1 4 1 0 0 0 0 0 0 0 # Automatically find iterator names. # ---------- SCATTERING FUNCTIONS ---------- 8 # Number of scattering functions 9 13 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 # Beta 4 9 13 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 # Beta 4 9 13 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 # Beta 4 9 15 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -3 # Beta 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 # Beta 4 9 15 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -3 # Beta 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 # Beta 4 9 17 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -4 # Beta 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 -1 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 4 9 17 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -4 # Beta 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 # Beta 4 9 13 # p0 p1 p2 p3 p4 p5 p6 p7 p8 0 1 0 0 0 0 0 0 0 0 0 0 -5 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 # Beta 3 0 0 0 0 0 0 0 0 1 0 0 0 0 # Alpha & Gamma 4 0 0 0 0 0 0 0 0 0 1 0 0 0 # Beta 4 1 # Set the scattering parameter names. p0 p1 p2 p3 p4 p5 p6 p7 p8 cloog-0.18.2/test/wavefront.good.c0000664000175000017500000000127312254312305013715 00000000000000/* Generated from ../../../git/cloog/test/wavefront.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int n, int m) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j; if ((n >= 1) && (m >= 1)) { for (c1=2;c1<=n+m;c1++) { for (c2=max(1,c1-m);c2<=min(n,c1-1);c2++) { j = c1-c2 ; S1(c2,c1-c2) ; } } } } cloog-0.18.2/test/stride.good.c0000664000175000017500000000120412254312305013166 00000000000000/* Generated from stride.cloog by CLooG 0.14.0-200-g26bdb56 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test() { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j; for (c1=3;c1<=100;c1++) { if (c1 == 25) { S1(25); } if (c1%3 == 0) { S2(c1,c1/3); } } } cloog-0.18.2/test/gauss.c0000664000175000017500000000060612254312305012074 00000000000000/* Generated from ../../../git/cloog/test/gauss.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.03s. */ if (M >= 2) { for (c2=2;c2<=M;c2++) { for (j=2;j<=M;j++) { S2(1,j,c2) ; } } for (c1=2;c1<=M-1;c1++) { for (c2=c1+1;c2<=M;c2++) { for (j=1;j<=c1-1;j++) { S1(c1,j,c2) ; } for (j=c1+1;j<=M;j++) { S2(c1,j,c2) ; } } } } cloog-0.18.2/test/largeur.c0000664000175000017500000000031612254312305012411 00000000000000/* Generated from ../../../git/cloog/test/largeur.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ if (M >= 1) { for (c1=1;c1<=M;c1++) { for (c2=1;c2<=c1;c2++) { S1(c2,c1) ; } } } cloog-0.18.2/test/dot.c0000664000175000017500000000031212254312305011532 00000000000000/* Generated from ../../../git/cloog/test/dot.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (j=1;j<=M;j++) { S1(0,j) ; } for (i=1;i<=N;i++) { for (j=1;j<=M;j++) { S2(i,j) ; } } cloog-0.18.2/test/basic-bounds-1.cloog0000664000175000017500000000021512254312305014336 00000000000000# language: C c # Context 1 2 1 1 0 1 # Number of statements 1 # 3 3 # i 1 1 1 0 1 -1 2 1 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/nul_basic1.cloog0000664000175000017500000000042112254312305013646 00000000000000# Optimal code is in fact : # # for (i=0;i<=M;i+=2) { # S1 ; # } # language: C c # parameter n 1 3 # n 1 1 0 1 0 1 # Number of statements 1 # {i, j | i=2*j; 0<=i<=n} 3 5 # i j n 1 0 1 -2 0 0 1 1 0 0 0 1 -1 0 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/vivien.c0000664000175000017500000000754512254312305012263 00000000000000/* Generated from /home/skimo/git/cloog/test/vivien.cloog by CLooG 0.14.0-292-g2bfd6ac gmp bits in 0.12s. */ if (n >= 0) { for (p1=-54*n+4;p1<=4;p1++) { if (p1%2 == 0) { S1((p1-2)/2); } } if (n >= 1) { S3(1); } if (n <= 1) { S1(2); } if (n >= 2) { S4(1,2); S1(2); S6(1,2); } for (p1=7;p1<=min(9,4*n-2);p1++) { if (p1 == 8) { S4(1,3); } if (p1 == 8) { S1(3); } if (p1 == 8) { S6(1,3); } if (p1 == 9) { S3(2); } if ((p1+1)%2 == 0) { S2((p1-3)/2,1); } } for (p1=10;p1<=min(2*n+58,4*n-2);p1++) { p2 = ceild(-p1+2,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+5,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } } if (p1 >= 4*n-4) { if (p1%2 == 0) { for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } p2 = ceild(-p1+6,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+9,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } for (p2=ceild(-p1+10,4);p2<=min(-1,floord(-p1+2*n,2));p2++) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } if (p1%2 == 0) { S6(-p2+2,(p1+2*p2-4)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } if ((p1 >= 2*n+4) && (p1 <= 4*n-6)) { if (p1%2 == 0) { S6((p1-2*n+2)/2,n-1); for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } if (p1 >= 2*n+6) { if (p1%2 == 0) { S6((p1-2*n)/2,n); } } if (p1 <= 2*n+4) { if (p1%2 == 0) { S6(2,(p1-4)/2); } if ((p1+3)%4 == 0) { S3((p1-1)/4); } if (p1%2 == 0) { S1((p1-2)/2); } } if (p1 >= 2*n+5) { if ((p1+3)%4 == 0) { S3((p1-1)/4); } if (p1%2 == 0) { S1((p1-2)/2); } } if (p1 <= 2*n+2) { if (p1%2 == 0) { S6(1,(p1-2)/2); } } for (p2=max(1,ceild(p1-2*n-1,2));p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { S2((p1-2*p2-1)/2,p2); } } } if ((n >= 2) && (n <= 29)) { S2(n,n-1); } if ((n >= 2) && (n <= 29)) { S1(2*n-1); } if ((n >= 2) && (n <= 28)) { S3(n); } for (p1=max(7,4*n+2);p1<=2*n+58;p1++) { if (p1%2 == 0) { S1((p1-2)/2); } } for (p1=2*n+59;p1<=4*n-2;p1++) { p2 = ceild(-p1+2,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+5,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } } if (p1 >= 4*n-4) { if (p1%2 == 0) { for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } p2 = ceild(-p1+6,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+9,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } if (p1%2 == 0) { S6(-p2+2,(p1+2*p2-4)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } if (p1 <= 4*n-6) { if (p1%2 == 0) { S6((p1-2*n+2)/2,n-1); for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } if (p1%2 == 0) { S6((p1-2*n)/2,n); } if ((p1+3)%4 == 0) { S3((p1-1)/4); } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { S2((p1-2*p2-1)/2,p2); } } } if (n >= 30) { S2(n,n-1); } if (n >= 29) { S3(n); } } cloog-0.18.2/test/gesced.cloog0000664000175000017500000000123112254312305013060 00000000000000# language: C c # parameters {n, m | n<=m n>=2 m>=2} 3 4 # m n 1 1 1 -1 0 1 1 0 -2 1 0 1 -2 0 3 # Number of statements 1 # {i | 1<=i<=n} 2 5 # i m n 1 1 1 0 0 -1 1 -1 0 1 0 0 0 0 1 # {i, j | 1<=i<=n 1<=j<=m} 4 6 # i j m n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 1 # {i, j | 1<=i<=n 1<=j<=m} 4 6 # i j m n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 3 # Scattering functions # Et les instructions de chunking (prog init)... 1 6 # c1 i m n 1 0 1 -1 0 0 0 1 7 # c1 i j m n 1 0 1 0 -1 0 -1 0 1 7 # c1 i j m n 1 0 1 0 -1 0 -2 0 0 cloog-0.18.2/test/otl.good.c0000664000175000017500000001025312254312305012476 00000000000000/* Generated from ../../../git/cloog/test/otl.cloog by CLooG 0.14.0-273-gfe7416f gmp bits in 0.24s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(outerTimeTileIter,outerProcTileIter1,outerProcTileIter2,innerTimeTileIter,innerProcTileIter1,innerProcTileIter2) { hash(1); hash(outerTimeTileIter); hash(outerProcTileIter1); hash(outerProcTileIter2); hash(innerTimeTileIter); hash(innerProcTileIter1); hash(innerProcTileIter2); } void test(int M, int N) { /* Scattering iterators. */ int outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, innerTimeTileScatter, innerProcTileScatter1, innerProcTileScatter2; /* Original iterators. */ int outerTimeTileIter, outerProcTileIter1, outerProcTileIter2, innerTimeTileIter, innerProcTileIter1, innerProcTileIter2; if ((M >= 3) && (N >= 4)) { for (outerTimeTileScatter=1;outerTimeTileScatter<=floord(2*M+2*N-7,5);outerTimeTileScatter++) { 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++) { 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++) { 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++) { for (innerProcTileScatter1=max(max(max(max(ceild(innerTimeTileScatter,2),ceild(5*innerTimeTileScatter-M-2,5)),ceild(5*outerTimeTileScatter-M-1,5)),outerProcTileScatter1),outerTimeTileScatter-outerProcTileScatter2);innerProcTileScatter1<=min(min(min(min(min(min(min(floord(M+2*N-4,5),floord(5*outerProcTileScatter2+N+2,5)),floord(-5*outerProcTileScatter2+5*innerTimeTileScatter+N+4,5)),floord(5*outerTimeTileScatter-5*outerProcTileScatter2+N+5,5)),floord(5*innerTimeTileScatter+2*N+2,10)),floord(5*outerTimeTileScatter+2*N+3,10)),outerTimeTileScatter),outerProcTileScatter1+1);innerProcTileScatter1++) { for (innerProcTileScatter2=outerProcTileScatter2;innerProcTileScatter2<=outerProcTileScatter2;innerProcTileScatter2++) { for (outerTimeTileIter=outerTimeTileScatter;outerTimeTileIter<=outerTimeTileScatter;outerTimeTileIter++) { for (outerProcTileIter1=outerProcTileScatter1;outerProcTileIter1<=outerProcTileScatter1;outerProcTileIter1++) { for (outerProcTileIter2=outerProcTileScatter2;outerProcTileIter2<=outerProcTileScatter2;outerProcTileIter2++) { for (innerTimeTileIter=innerTimeTileScatter;innerTimeTileIter<=innerTimeTileScatter;innerTimeTileIter++) { for (innerProcTileIter1=innerProcTileScatter1;innerProcTileIter1<=innerProcTileScatter1;innerProcTileIter1++) { for (innerProcTileIter2=outerProcTileScatter2;innerProcTileIter2<=outerProcTileScatter2;innerProcTileIter2++) { S1(outerTimeTileIter,outerProcTileIter1,outerProcTileIter2,innerTimeTileIter,innerProcTileIter1,innerProcTileIter2); } } } } } } } } } } } } } } cloog-0.18.2/test/backtrack.c0000664000175000017500000000016412254312305012676 00000000000000/* Generated from ../../../git/cloog/test/backtrack.cloog by CLooG 0.14.0-367-gf043665 gmp bits in 0.00s. */ S1(0); cloog-0.18.2/test/1point-2.c0000664000175000017500000000017212254312305012321 00000000000000/* Generated from ../../../git/cloog/test/1point-2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ S1(2*M,N+2) ; cloog-0.18.2/test/lineality-2-1-2.good.c0000664000175000017500000000163612254312305014333 00000000000000/* Generated from ../../../git/cloog/test/lineality-2-1-2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; for (i=1;i<=M-3;i++) { for (j=1;j<=i+1;j++) { S1(i,j) ; } j = i+2 ; S1(i,i+2) ; S2(i,i+2) ; for (j=i+3;j<=M;j++) { S1(i,j) ; } } if (M >= 3) { i = M-2 ; for (j=1;j<=M-1;j++) { S1(M-2,j) ; } S1(M-2,M) ; S2(M-2,M) ; } for (i=M-1;i<=M;i++) { for (j=1;j<=M;j++) { S1(i,j) ; } j = i+2 ; S2(i,i+2) ; } } cloog-0.18.2/test/equality.cloog0000664000175000017500000000054412254312305013471 00000000000000# Language: C c # Context (0 parameter(s)): 1 2 1 1 1 # Parameter name(s) # Statement number: 2 # Iteration domain of statement 1. 1 3 4 0 2 -1 0 1 1 0 0 1 -1 0 5 0 0 0 # For future options. # Iteration domain of statement 2. 1 3 4 0 0 -1 4 1 1 0 0 1 -1 0 5 0 0 0 # For future options. 1 # Iterator name(s) i0 i1 # No scattering functions. 0 cloog-0.18.2/test/sor1d.good.c0000664000175000017500000000360512254312305012733 00000000000000/* Generated from /home/skimo/git/cloog/test/sor1d.cloog by CLooG 0.14.0-226-g3fc65ac gmp bits in 0.04s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(tileT1,tileP1,other1,other2) { hash(1); hash(tileT1); hash(tileP1); hash(other1); hash(other2); } #define S2(tileT1,tileP1,other1,other2,other3) { hash(2); hash(tileT1); hash(tileP1); hash(other1); hash(other2); hash(other3); } #define S3(tileT1,tileP1,other1,other2,other3) { hash(3); hash(tileT1); hash(tileP1); hash(other1); hash(other2); hash(other3); } #define S4(tileT1) { hash(4); hash(tileT1); } void test(int M, int N) { /* Scattering iterators. */ int glT1, rp1, vT1, vP1, otherP1, arrAcc1; /* Original iterators. */ int tileT1, tileP1, other1, other2, other3; if ((M >= 1) && (N >= 3)) { for (glT1=-1;glT1<=floord(3*M+N-5,100);glT1++) { for (rp1=max(max(0,ceild(100*glT1-2*M-N+5,100)),ceild(100*glT1-N-193,300));rp1<=min(min(min(min(floord(glT1+1,2),floord(M,100)),floord(100*glT1+99,100)),floord(50*glT1+51,150)),floord(100*glT1+N+98,300));rp1++) { for (vT1=max(max(max(max(0,100*glT1-100*rp1),100*rp1-1),200*rp1-3),200*rp1-N+1);vT1<=min(min(2*M+N-5,100*glT1-100*rp1+99),200*rp1+N+193);vT1++) { if (rp1 >= max(1,ceild(vT1-N+7,200))) { S3(glT1-rp1,rp1-1,rp1,100*rp1-1,-200*rp1+vT1+6); } for (vP1=max(max(1,ceild(vT1-N+5,2)),100*rp1);vP1<=min(min(floord(vT1+2,2),M),100*rp1+99);vP1++) { S1(glT1-rp1,rp1,vP1,vT1-2*vP1+4); if ((rp1 <= min(floord(M-100,100),floord(vT1-197,200))) && (100*rp1 == vP1-99)) { S2(glT1-rp1,rp1,rp1+1,100*rp1+99,-200*rp1+vT1-194); } } } } S4(glT1); } } } cloog-0.18.2/test/multi-stride2.cloog0000664000175000017500000000033412254312305014335 00000000000000# Language c # Context 1 2 1 1 0 # Number of statements 1 1 # i' i j 1 4 5 0 1 -2 0 -1 0 1 0 -3 -2 1 1 0 0 0 1 -1 0 0 100 0 0 0 0 0 cloog-0.18.2/test/square+triangle-1-1-2-3.cloog0000664000175000017500000000055012254312305015525 00000000000000# language: C c # Context # {M | M >= 1} 2 3 # M 1 1 1 -1 1 0 1 0 2 # Number of statements 1 # {i, j | 1<=i<=M; 1<=j<=M} 5 5 # i j M 1 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # {i, j | 2<=j<=i<=M} 4 5 # i j M 1 1 0 1 0 -2 1 1 -1 0 0 1 -1 0 1 0 1 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/yosr.good.c0000664000175000017500000000165512254312305012702 00000000000000/* Generated from ../../../git/cloog/test/yosr.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int n) { /* Scattering iterators. */ int proc; /* Original iterators. */ int i, j, k; if (n >= 2) { for (j=2;j<=n;j++) { S1(1,j) ; } } for (proc=2;proc<=n-1;proc++) { for (i=1;i<=proc-1;i++) { for (j=i+1;j<=n;j++) { S2(i,j,proc) ; } } for (j=proc+1;j<=n;j++) { S1(proc,j) ; } } if (n >= 2) { for (i=1;i<=n-1;i++) { for (j=i+1;j<=n;j++) { S2(i,j,n) ; } } } } cloog-0.18.2/test/dartef.f0000664000175000017500000000315012254312305012217 00000000000000! Generated from /home/skimo/git/cloog/test/dartef.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.08s. IF (n >= 1) THEN DO t3=n+3, 3*n+1 IF (MOD(t3+n+1, 2) == 0) THEN S1(1,n,(t3-n-1)/2) END IF END DO DO t1=-n+2, n-1 IF (t1 >= 0) THEN DO t3=t1+4, t1+2*n+2 IF (MOD(t1+t3, 2) == 0) THEN S1(t1+1,1,(-t1+t3-2)/2) END IF END DO END IF DO t2=MAX(-t1+2,t1+3), -t1+4 DO t3=t2+2, t2+2*n IF (MOD(t1+t2, 2) == 0) THEN IF (MOD(t1+t3, 2) == 0) THEN S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) END IF END IF END DO END DO DO t2=MAX(-t1+5,t1+3), MIN(-t1+2*n,t1+2*n) DO t3=1, MIN(n,t2+1) IF (MOD(t1+t2+1, 2) == 0) THEN S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) END IF END DO DO t3=t2+2, n IF (MOD(t1+t2+1, 2) == 0) THEN S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) END IF IF (MOD(t1+t2, 2) == 0) THEN IF (MOD(t1+t3, 2) == 0) THEN S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) END IF END IF END DO DO t3=MAX(n+1,t2+2), t2+2*n IF (MOD(t1+t2, 2) == 0) THEN IF (MOD(t1+t3, 2) == 0) THEN S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) END IF END IF END DO END DO IF (t1 <= -1) THEN DO t3=1, n S2(t1+n-1,n,t3) END DO END IF DO t2=-t1+2*n+1, MIN(-t1+2*n+3,t1+2*n+1) DO t3=1, n IF (MOD(t1+t2+1, 2) == 0) THEN S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) END IF END DO END DO END DO DO t3=1, n S2(n,1,t3) END DO END IF cloog-0.18.2/test/forwardsub-1-1-2.cloog0000664000175000017500000000130612254312305014442 00000000000000# language: C c # Context #{N | 3<=N} 2 3 # M 1 1 1 -3 1 0 1 0 4 # Number of statements 1 #{t1,t2 | 2<=t1<=N; t2=1; 3<=N} 5 5 # i j M 1 0 0 1 0 -1 1 0 0 1 -3 1 -1 0 1 0 1 1 0 0 -2 1 0 0 0 1 0 0 0 1 #{t1,t2 | t2+1<=t1<=N; 2<=t2} 4 5 # i j M 1 1 1 -1 0 -1 1 0 1 0 -2 1 -1 0 1 0 1 0 0 0 1 0 0 0 1 #{t1,t2 | t1=1; t2=1; 3<=N} 4 5 # i j M 1 0 1 0 0 -1 0 0 1 0 -1 1 0 0 1 -3 1 0 0 0 1 0 0 0 1 #{t1,t2 | t1=t2; 2<=t2<=N; 3<=N} 4 5 # i j M 1 0 1 -1 0 0 1 0 0 1 -3 1 0 -1 1 0 1 0 1 0 -2 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/singleton.c0000664000175000017500000000017412254312305012754 00000000000000/* Generated from /home/skimo/git/cloog/test/singleton.cloog by CLooG 0.14.0-242-g720faff gmp bits in 0.00s. */ S2(); S1(); cloog-0.18.2/test/pouchet.good.c0000664000175000017500000000235212254312305013350 00000000000000/* Generated from ../../../git/cloog/test/pouchet.cloog by CLooG 0.16.2-3-gc1aebd7 gmp bits in 0.04s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k,l,m) { hash(1); hash(i); hash(j); hash(k); hash(l); hash(m); } #define S2(i,j,k,l,m) { hash(2); hash(i); hash(j); hash(k); hash(l); hash(m); } void test(int Ny) { /* Scattering iterators. */ int c0, c1, c2, c3, c4, c5; /* Original iterators. */ int i, j, k, l, m; if (Ny >= 2) { for (c0=1;c0<=floord(Ny+4,2);c0++) { for (c1=max(ceild(c0+1,2),c0-1);c1<=min(floord(2*c0+Ny,4),c0);c1++) { if (c0 >= ceild(4*c1-Ny+1,2)) { for (c2=1;c2<=2;c2++) { S1(c0-c1,c1,2*c0-2*c1,-2*c0+4*c1,c2); S2(c0-c1,c1,2*c0-2*c1,-2*c0+4*c1-1,c2); } } if (2*c0 == 4*c1-Ny) { for (c2=1;c2<=2;c2++) { if (Ny%2 == 0) { if ((2*c0+3*Ny)%4 == 0) { S2((2*c0-Ny)/4,(2*c0+Ny)/4,(2*c0-Ny)/2,Ny-1,c2); } } } } } } } } cloog-0.18.2/test/wavefront.cloog0000664000175000017500000000042012254312305013640 00000000000000c 1 4 # n m 1 1 0 0 1 1 n m 1 1 4 6 # i j n m 1 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 1 0 0 -1 1 0 -1 0 1 0 0 0 0 0 1 2 8 # c1 c2 i j n m 1 0 1 0 -1 -1 0 0 0 0 0 1 -1 0 0 0 0 0 cloog-0.18.2/test/basic-bounds-5.good.c0000664000175000017500000000100412254312305014405 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-5.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; j = floord(M+1,2) ; S1(1,j) ; } cloog-0.18.2/test/levenshtein-1-2-3.cloog0000664000175000017500000000355212254312305014617 00000000000000# language: C c # Context # {length,width | width+2<=length; 1<=width} 3 4 # M N 1 1 1 -1 -2 1 0 1 -1 1 0 0 1 0 8 # Number of statements 1 # {t1,t2,length,width | t1=0; t2=0; width+2<=length; 1<=width} 5 6 # i j M N 1 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 1 -1 -2 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | 1<=t1<=width; t2=0; width+2<=length} 5 6 # i j M N 1 0 0 1 0 0 0 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 0 1 -1 -2 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | t1=t2; 1<=t2<=width; width+2<=length} 5 6 # i j M N 1 0 1 -1 0 0 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 -1 -2 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | t1=2t2-width; width+1<=t2<=length-1; 1<=width} 5 6 # i j M N 1 0 1 -2 0 1 0 1 0 1 0 -1 -1 1 0 -1 1 0 -1 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | t1=2t2+width; 1<=t2<=length-width-1; 1<=width} 5 6 # i j M N 1 0 1 -2 0 -1 0 1 0 1 0 0 -1 1 0 -1 1 -1 -1 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | (2t2-width+1,t2+1)<=t1<=(t2+length-1,2t2+width-1); 1<=t2<=length-1; width+2<=length} 8 6 # i j M N 1 1 1 -2 0 1 -1 1 1 -1 0 0 -1 1 -1 1 1 0 -1 1 -1 2 0 1 -1 1 0 1 0 0 -1 1 0 -1 1 0 -1 1 0 0 1 -1 -2 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | (width+1,2t2+width+1)<=t1<=(2length-width-2,2t2+width+2); width+2<=length; 1<=width} 6 6 # i j M N 1 1 1 0 0 -1 -1 1 1 -2 0 -1 -1 1 -1 0 2 -1 -2 1 -1 2 0 1 2 1 0 0 1 -1 -2 1 0 0 0 1 -1 0 0 0 1 # {t1,t2,length,width | (width+1,2t2-width)<=t1<=(2t2+width,2length-width-2); width+2<=length; 1<=width} 7 6 # i j M N 1 1 1 0 0 -1 -1 1 1 -2 0 1 0 1 -1 2 0 1 0 1 -1 0 2 -1 -2 1 0 0 1 -1 -2 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/lineality-2-1-2.c0000664000175000017500000000050112254312305013372 00000000000000/* Generated from /home/skimo/git/cloog/test/lineality-2-1-2.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.00s. */ for (i=1;i<=M;i++) { for (j=1;j<=min(M,i+1);j++) { S1(i,j); } if (i >= M-1) { S2(i,i+2); } if (i <= M-2) { S1(i,i+2); S2(i,i+2); } for (j=i+3;j<=M;j++) { S1(i,j); } } cloog-0.18.2/test/min-2-1.good.c0000664000175000017500000000124512254312305012761 00000000000000/* Generated from ../../../git/cloog/test/min-2-1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } void test(int M, int N) { /* Original iterators. */ int i, j, k; if (M >= 0) { for (i=1;i<=N;i++) { for (j=0;j<=min(min(i,M),-i+N);j++) { for (k=0;k<=min(min(M,i),-i+N);k++) { S1(i,j,k) ; } } } } } cloog-0.18.2/test/dealII.cloog0000664000175000017500000000221612254312305012761 00000000000000# CLooG -> CLooG # This is an automatic dump of a CLooG input file from a CloogProgram data # structure. WARNING: it is highly dangerous and MAY be correct ONLY if # - it has been dumped before loop generation. # - option -noscalars is used (it removes scalar dimensions otherwise) # - option -l is at least the original scattering dimension number # ASK THE AUTHOR IF YOU *NEED* SOMETHING MORE ROBUST # Language: C c # Context (3 parameter(s)): 4 5 1 -1 0 0 4 1 1 0 0 0 1 0 -1 0 4 1 0 1 0 0 1 # Parameter name(s) T_2 T_67 T_66 # Statement number: 2 # Iteration domain of statement 1. 2 2 6 1 -1 1 0 0 -1 1 1 0 0 0 0 2 6 1 -1 0 -1 0 0 1 1 0 0 0 0 0 0 0 # For future options. # Iteration domain of statement 2. 2 3 6 1 -1 1 0 0 -1 1 1 0 0 0 0 1 -1 0 0 1 0 3 6 1 -1 0 1 0 -1 1 1 0 0 0 0 1 -1 0 0 1 0 0 0 0 # For future options. 1 # Iterator name(s) scat_0 scat_1 scat_2 git_0 # No scattering functions. 0 cloog-0.18.2/test/iftest.c0000664000175000017500000000024012254312305012242 00000000000000/* Generated from ../../../git/cloog/test/iftest.cloog by CLooG 0.14.0-245-gd8c1718 gmp bits in 0.00s. */ if (n >= 1) { for (i=1;i<=n;i++) { S1(i); } } cloog-0.18.2/test/lu2.cloog0000664000175000017500000000104212254312305012330 00000000000000# language: C c # parameter n 1 3 1 0 1 1 n 2 # Number of statements 1 # {c1, c2, i, j | c1=i, c2=n, 1<=i<=n; i+1<=j<=n} 6 7 0 1 0 -1 0 0 0 0 0 1 0 0 -1 0 1 0 0 1 0 0 -1 1 0 0 -1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 -1 1 0 0 0 0 1 # {c1, c2, i, j, k | c1=k, c2=j, 1<=i<=n; i+1<=j<=n i+1<=k<=n} 8 8 0 1 0 0 0 -1 0 0 0 0 1 0 -1 0 0 0 1 0 0 1 0 0 0 -1 1 0 0 -1 0 0 1 0 1 0 0 -1 1 0 0 -1 1 0 0 0 -1 0 1 0 1 0 0 -1 0 1 0 -1 1 0 0 0 0 -1 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/gesced2.c0000664000175000017500000000101612254312305012262 00000000000000/* Generated from /home/skimo/git/cloog/test/gesced2.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.03s. */ for (c1=1;c1<=4;c1++) { for (c2=5;c2<=M-10;c2++) { S1(c1,c2); } } for (c1=5;c1<=M-10;c1++) { for (c2=-c1+1;c2<=4;c2++) { S2(c1+c2,c1); } for (c2=5;c2<=min(M-10,-c1+M);c2++) { S1(c1,c2); S2(c1+c2,c1); } for (c2=-c1+M+1;c2<=M-10;c2++) { S1(c1,c2); } for (c2=M-9;c2<=-c1+M;c2++) { S2(c1+c2,c1); } } for (c1=M-9;c1<=M;c1++) { for (c2=5;c2<=M-10;c2++) { S1(c1,c2); } } cloog-0.18.2/test/stride.c0000664000175000017500000000027012254312305012241 00000000000000/* Generated from stride.cloog by CLooG 0.14.0-200-g26bdb56 gmp bits in 0.01s. */ for (c1=3;c1<=100;c1++) { if (c1 == 25) { S1(25); } if (c1%3 == 0) { S2(c1,c1/3); } } cloog-0.18.2/test/classen2.cloog0000664000175000017500000000245712254312305013353 00000000000000# created: Wed Mar 17 17:37:13 CET 2010 # ---------------------- CONTEXT ---------------------- c # language is C # Context (no parameter, so always true) 1 7 1 0 0 0 0 0 0 1 # set parameter names outerTimeTileScatter outerProcTileScatter1 outerProcTileScatter2 M N # --------------------- STATEMENTS -------------------- 1 1 # domains per statement 20 13 1 2 1 1 -1 0 0 0 0 0 0 0 0 1 1 1 1 0 -1 0 0 0 0 0 0 1 1 1 1 0 0 0 -1 0 0 0 0 0 1 1 -2 -1 -1 1 0 0 0 0 0 0 0 0 1 -1 -1 -1 0 1 0 0 0 0 0 0 -1 1 -1 -1 0 0 0 1 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 0 0 1 -2 1 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 0 0 0 1 -2 1 1 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 0 0 0 0 1 0 -1 1 0 0 0 1 0 0 -5 0 0 0 0 0 1 0 0 0 0 1 0 0 -5 0 0 0 0 1 0 0 0 0 0 1 0 0 -5 0 0 0 1 0 0 0 0 0 -1 0 0 5 0 0 4 1 0 0 0 0 -1 0 0 5 0 0 0 4 1 0 0 0 -1 0 0 5 0 0 0 0 4 1 0 0 0 0 0 0 0 0 0 0 1 -3 1 0 0 0 0 0 0 0 0 0 1 0 -2 0 0 0 # for future options... 1 # set the iterator names compIter1 compIter2 compIter3 compIter4 compIter5 compIter6 # --------------------- SCATTERING -------------------- 1 # Scattering functions 3 16 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 # we set the scattering dimension names compScatter1 compScatter2 compScatter3 cloog-0.18.2/test/lex.cloog0000664000175000017500000000024512254312305012422 00000000000000c 0 2 0 2 1 2 3 1 1 0 1 -1 10 0 0 0 1 2 3 1 1 0 1 -1 10 0 0 0 0 2 3 6 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 -1 0 0 3 6 0 -1 0 0 1 0 0 0 -1 0 0 -1 0 0 0 -1 0 0 0 cloog-0.18.2/test/yosr2.c0000664000175000017500000000066112254312305012031 00000000000000/* Generated from ../../../git/cloog/test/yosr2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ for (i=1;i<=M;i++) { S2(i) ; } for (proc=2;proc<=M-1;proc++) { for (i=1;i<=proc-1;i++) { S4(i,proc) ; } for (j=1;j<=proc-1;j++) { S1(proc,j) ; } for (j=proc+1;j<=M;j++) { for (k=1;k<=proc-1;k++) { S3(proc,j,k) ; } } } for (i=1;i<=M-1;i++) { S4(i,M) ; } for (j=1;j<=M-1;j++) { S1(M,j) ; } cloog-0.18.2/test/union.cloog0000664000175000017500000000020712254312305012760 00000000000000c 2 1 3 1 1 -1 1 3 1 -1 -1 0 1 1 2 4 1 1 0 0 1 -1 0 100 0 0 0 0 1 2 2 5 0 -1 1 0 0 1 0 0 -1 10 2 5 0 -1 -1 0 0 1 0 0 1 -11 0 cloog-0.18.2/test/dealII.good.c0000664000175000017500000000147712254312305013037 00000000000000/* Generated from ../../../git/cloog/test/dealII.cloog by CLooG 0.14.0-270-g7ee1261 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(scat_0) { hash(1); hash(scat_0); } #define S2(scat_0) { hash(2); hash(scat_0); } void test(int T_2, int T_67, int T_66) { /* Original iterators. */ int scat_0; for (scat_0=0;scat_0<=min(T_66,T_2-1);scat_0++) { S1(scat_0); S2(scat_0); } if ((T_2 == 0) && (T_67 == 0)) { S1(0); } for (scat_0=max(0,T_66+1);scat_0<=T_2-1;scat_0++) { S1(scat_0); } for (scat_0=T_2;scat_0<=min(T_66,T_67-1);scat_0++) { S2(scat_0); } } cloog-0.18.2/test/dot.good.c0000664000175000017500000000120012254312305012456 00000000000000/* Generated from ../../../git/cloog/test/dot.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; for (j=1;j<=M;j++) { S1(0,j) ; } for (i=1;i<=N;i++) { for (j=1;j<=M;j++) { S2(i,j) ; } } } cloog-0.18.2/test/walters2.c0000664000175000017500000000041312254312305012511 00000000000000/* Generated from ../../../git/cloog/test/walters2.cloog by CLooG 0.14.0-245-gd8c1718 gmp bits in 0.01s. */ for (i=0;i<=51;i++) { S2(0,i); } for (j=1;j<=24;j++) { S2(j,0); for (i=1;i<=50;i++) { S1(j,i); } S2(j,51); } for (i=0;i<=51;i++) { S2(25,i); } cloog-0.18.2/test/lux.cloog0000664000175000017500000000104112254312305012435 00000000000000# language: C c # parameter n 1 3 1 0 1 0 2 # Number of statements 1 # {c1, c2, i, j | c1=i, c2=n, 1<=i<=n; i+1<=j<=n} 6 7 0 1 -1 0 0 0 0 0 0 0 1 0 -1 0 1 0 1 0 0 0 -1 1 0 -1 0 0 1 0 1 0 -1 0 1 0 -1 1 0 0 0 -1 1 0 0 0 0 1 # {c1, c2, i, j, k | c1=k, c2=j, 1<=i<=n; i+1<=j<=n i+1<=k<=n} 8 8 0 1 0 0 0 -1 0 0 0 0 0 -1 1 0 0 0 1 0 1 0 0 0 0 -1 1 0 -1 0 0 0 1 0 1 0 -1 1 0 0 0 -1 1 0 0 -1 0 0 1 0 1 0 -1 0 0 1 0 -1 1 0 0 0 0 -1 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/0D-1.good.c0000664000175000017500000000064012254312305012300 00000000000000/* Generated from ../../../git/cloog/test/0D-1.cloog by CLooG 0.14.0-117-g5444fca gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } void test() { S1() ; } cloog-0.18.2/test/durbin_e_s.c0000664000175000017500000000065012254312305013062 00000000000000/* Generated from ../../../git/cloog/test/durbin_e_s.cloog by CLooG 0.14.0-238-gb1cb779 gmp bits in 0.01s. */ S4(1,0,0); S7(1,0,0); S8(1,0,3); for (i=2;i<=9;i++) { S2(i,-7,0); for (j=-7;j<=i-9;j++) { S3(i,j,1); } S6(i,i-9,2); S8(i,0,3); for (j=1;j<=i-1;j++) { S5(i,j,3); } } S2(10,-7,0); for (j=-7;j<=1;j++) { S3(10,j,1); } S6(10,1,2); for (j=1;j<=9;j++) { S5(10,j,3); S1(10,j,4); } S1(10,10,4); cloog-0.18.2/test/uday_scalars.cloog0000664000175000017500000000273112254312305014306 00000000000000# Langage: C c # Context (1 parameter) # no constraints on parameters: 1 3 1 0 1 1 # Parameter name(s) n # Statement number: 2 # Iteration domain of statement 1. 1 # 1 domain 4 6 # 4 lines and 6 columns # j l m n cst 1 1 0 0 0 0 # j >= 0 1 -1 0 0 1 0 # j <= N 0 0 1 0 0 0 # l = 0 0 0 0 1 0 0 # m = 0 0 0 0 # For future options. # Iteration domain of statement 2. 1 # 1 domain 4 6 # 4 lines and 6 columns # j l m n cst 1 0 1 0 0 0 # l >= 0 1 0 -1 0 1 0 # l <= N 0 1 0 0 0 0 # j = 0 0 0 0 1 0 0 # m = 0 0 0 0 # For future options. 1 # Iterator name(s) j l m # 1 scattering functions. 2 # First function 4 10 # p1 p2 p3 p4 j l m n cst 0 1 0 0 0 0 0 0 0 0 # p1 = 0 0 0 1 0 0 0 0 0 0 -1 # p2 = 1 0 0 0 1 0 -1 0 0 0 0 # p3 = j 0 0 0 0 1 0 0 0 0 0 # p4 = 0 # Second function 4 10 # p1 p2 p3 p4 j l m n cst 0 1 0 0 0 0 0 0 0 -1 # p1 = 1 0 0 1 0 0 0 0 0 0 0 # p2 = 0 0 0 0 1 0 0 -1 0 0 0 # p3 = l 0 0 0 0 1 0 0 0 0 -1 # p4 = 1 1 # set scattering dimension names manually p1 p2 p3 p4 cloog-0.18.2/test/min-2-1.c0000664000175000017500000000043412254312305012031 00000000000000/* Generated from ../../../git/cloog/test/min-2-1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if ((M >= 0) && (N >= 1)) { for (i=1;i<=N;i++) { for (j=0;j<=min(min(M,i),-i+N);j++) { for (k=0;k<=min(min(M,i),-i+N);k++) { S1(i,j,k) ; } } } } cloog-0.18.2/test/nul_basic1.c0000664000175000017500000000025212254312305012767 00000000000000/* Generated from ../../../git/cloog/test/nul_basic1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ if (M >= 0) { for (i=0;i<=M;i+=2) { S1(i,i/2) ; } } cloog-0.18.2/test/sor1d.c0000664000175000017500000000164112254312305012002 00000000000000/* Generated from ../../../git/cloog/test/sor1d.cloog by CLooG 0.14.0-278-gcf1f323 gmp bits in 0.11s. */ if ((M >= 1) && (N >= 3)) { for (glT1=-1;glT1<=floord(3*M+N-5,100);glT1++) { 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++) { for (vT1=max(max(100*glT1-100*rp1,200*rp1-3),200*rp1-N+1);vT1<=min(min(min(2*M+N-5,100*glT1-100*rp1+99),200*rp1+N+193),100*glT1-100*rp1+N+95);vT1++) { if (rp1 >= max(1,ceild(vT1-N+7,200))) { S3(glT1-rp1,rp1-1,rp1,100*rp1-1,-200*rp1+vT1+6); } for (vP1=max(max(1,ceild(vT1-N+5,2)),100*rp1);vP1<=min(min(floord(vT1+2,2),M),100*rp1+99);vP1++) { S1(glT1-rp1,rp1,vP1,vT1-2*vP1+4); } if (rp1 <= min(floord(M-100,100),floord(vT1-197,200))) { S2(glT1-rp1,rp1,rp1+1,100*rp1+99,-200*rp1+vT1-194); } } } S4(glT1); } } cloog-0.18.2/test/forwardsub-2-1-2-3.c0000664000175000017500000000040112254312305013715 00000000000000/* Generated from ../../../git/cloog/test/forwardsub-2-1-2-3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ S3(1,0) ; for (k=2;k<=M;k++) { S1(1,1,k) ; } for (i=2;i<=M-1;i++) { S4(i,0) ; for (k=i+1;k<=M;k++) { S2(i,1,k) ; } } S4(M,0) ; cloog-0.18.2/test/check_strided.sh0000775000175000017500000000510212254312305013734 00000000000000#!/bin/sh # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** check_strided.sh ** # **-------------------------------------------------------------------** # ** First version: November 17th 2011 ** # **-------------------------------------------------------------------**/ # #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ $CHECKER "STRIDED" "$CLOOGTEST_STRIDED" "-strides 1" "cloog" "c" "0" cloog-0.18.2/test/lux.good.c0000664000175000017500000000165712254312305012520 00000000000000/* Generated from ../../../git/cloog/test/lux.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k,l) { hash(1); hash(i); hash(j); hash(k); hash(l); } #define S2(i,j,k,l,m) { hash(2); hash(i); hash(j); hash(k); hash(l); hash(m); } void test(int M) { /* Original iterators. */ int i, j, k, l, m; if (M >= 2) { for (l=2;l<=M;l++) { S1(1,1,M,l) ; } } for (i=2;i<=M-1;i++) { for (j=1;j<=i-1;j++) { for (k=j+1;k<=M;k++) { S2(i,j,k,k,i) ; } } for (l=i+1;l<=M;l++) { S1(i,i,M,l) ; } } if (M >= 2) { for (j=1;j<=M-1;j++) { for (k=j+1;k<=M;k++) { S2(M,j,k,k,M) ; } } } } cloog-0.18.2/test/lex.good.c0000664000175000017500000000111312254312305012463 00000000000000/* Generated from /home/skimo/git/cloog/test/lex.cloog by CLooG 0.14.0-234-g330f397 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } void test() { /* Scattering iterators. */ int c1; /* Original iterators. */ int i; for (c1=0;c1<=10;c1++) { S2(c1); S1(c1); } } cloog-0.18.2/test/1point-1.cloog0000664000175000017500000000030712254312305013201 00000000000000# language: C c # Context #{M | } 1 3 # M 1 1 0 1 0 1 # Number of statements 1 #{i, j | i=2N; i=2j} 3 5 # i j M 1 0 1 0 -2 0 0 1 -2 0 0 1 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/0D-3.c0000664000175000017500000000015712254312305011356 00000000000000/* Generated from ../../../git/cloog/test/0D-3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ S1() ; cloog-0.18.2/test/largeur.cloog0000664000175000017500000000043512254312305013274 00000000000000# language: C c # parameters {n | n>= 0} 1 3 1 1 0 0 1 # Number of statements 1 # {i, j | 1<=i<=n i<=j<=n} 4 5 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 0 1 0 -1 1 0 0 0 0 0 1 # Scattering functions # Et les instructions de chunking... 2 7 0 1 0 0 -1 0 0 0 0 1 -1 0 0 0 0 cloog-0.18.2/test/stride2.good.c0000664000175000017500000000115112254312305013251 00000000000000/* Generated from stride2.cloog by CLooG 0.14.0-200-g26bdb56 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test() { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j; for (c1=3;c1<=100;c1+=3) { if (c1 == 27) { S1(27); } S2(c1,c1/3); } } cloog-0.18.2/test/1point-1.good.c0000664000175000017500000000076612254312305013260 00000000000000/* Generated from ../../../git/cloog/test/1point-1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; i = 2*M ; S1(2*M,M) ; } cloog-0.18.2/test/constant.good.c0000664000175000017500000000170312254312305013531 00000000000000/* Generated from ../../../git/cloog/test/constant.cloog by CLooG 0.14.0-333-g4442dac gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } #define S3(i) { hash(3); hash(i); } #define S4(i) { hash(4); hash(i); } #define S5(i) { hash(5); hash(i); } #define S6(i) { hash(6); hash(i); } void test(int M) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i; for (c2=0;c2<=min(1023,M+1024);c2++) { S1(c2); S3(c2); } for (c2=max(0,M+1025);c2<=1023;c2++) { S2(c2); S3(c2); } for (c1=0;c1<=min(1023,M+1024);c1++) { S4(c1); S6(c1); } for (c1=max(0,M+1025);c1<=1023;c1++) { S5(c1); S6(c1); } } cloog-0.18.2/test/logopar.c0000664000175000017500000000056712254312305012423 00000000000000/* Generated from /home/skimo/git/cloog/test/logopar.cloog by CLooG 0.14.0-284-g5c046c9 gmp bits in 0.00s. */ for (j=0;j<=m;j++) { S1(1,j); } for (i=2;i<=n;i++) { for (j=0;j<=i-2;j++) { S2(i,j); } for (j=i-1;j<=n;j++) { S1(i,j); S2(i,j); } for (j=n+1;j<=m;j++) { S1(i,j); } } for (i=n+1;i<=m+1;i++) { for (j=i-1;j<=m;j++) { S1(i,j); } } cloog-0.18.2/test/tiling.c0000664000175000017500000000031212254312305012232 00000000000000/* Generated from ../../../git/cloog/test/tiling.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (ii=0;ii<=floord(n,10);ii++) { for (i=10*ii;i<=min(n,10*ii+9);i++) { S1(ii,i) ; } } cloog-0.18.2/test/darte.good.c0000664000175000017500000002540112254312305013000 00000000000000/* Generated from ../../../git/cloog/test/darte.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.27s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int n) { /* Scattering iterators. */ int t1, t2, t3; /* Original iterators. */ int i, j, k; if (n >= 1) { t1 = -n+1 ; t2 = n+1 ; for (t3=n+3;t3<=3*n+1;t3++) { if ((t3+n+1)%2 == 0) { k = (t3-n-1)/2 ; S1(1,n,(t3-n-1)/2) ; } } } if ((n >= 2) && (n <= 2)) { t1 = -n+2 ; for (t2=-n+4;t2<=3*n-2;t2++) { for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t2+n)%2 == 0) { i = (t2-n+2)/2 ; j = (t2+n-2)/2 ; if ((t3+n)%2 == 0) { k = (-t2+t3)/2 ; S1((t2-n+2)/2,(t2+n-2)/2,(-t2+t3)/2) ; } } } } t2 = n+3 ; for (t3=1;t3<=n;t3++) { S2(1,n,t3) ; } } if (n >= 3) { t1 = -n+2 ; for (t2=n;t2<=n+2;t2++) { for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t2+n)%2 == 0) { i = (t2-n+2)/2 ; j = (t2+n-2)/2 ; if ((t3+n)%2 == 0) { k = (-t2+t3)/2 ; S1((t2-n+2)/2,(t2+n-2)/2,(-t2+t3)/2) ; } } } } t2 = n+3 ; for (t3=1;t3<=n;t3++) { S2(1,n,t3) ; } } for (t1=ceild(-2*n+5,2);t1<=min(-n+6,-1);t1++) { for (t2=-t1+2;t2<=-t1+4;t2++) { for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+5;t2<=t1+2*n;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } t2 = t1+2*n+1 ; for (t3=1;t3<=n;t3++) { i = t1+n-1 ; S2(t1+n-1,n,t3) ; } } if (n == 2) { for (t3=5;t3<=7;t3++) { if ((t3+1)%2 == 0) { k = (t3-3)/2 ; S1(2,1,(t3-3)/2) ; } } for (t2=4;t2<=6;t2++) { for (t3=1;t3<=2;t3++) { if (t2%2 == 0) { i = (t2-2)/2 ; j = (t2-2)/2 ; S2((t2-2)/2,(t2-2)/2,t3) ; } } } } for (t1=-n+7;t1<=-1;t1++) { for (t2=-t1+2;t2<=-t1+4;t2++) { for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+5;t2<=n-2;t2++) { for (t3=1;t3<=t2+1;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } for (t3=n+1;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=n-1;t2<=t1+2*n;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } t2 = t1+2*n+1 ; for (t3=1;t3<=n;t3++) { i = t1+n-1 ; S2(t1+n-1,n,t3) ; } } if (n >= 3) { for (t1=0;t1<=min(1,-n+6);t1++) { for (t2=t1+2;t2<=-t1+4;t2++) { for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+5;t2<=-t1+2*n;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+2*n+1;t2<=t1+2*n+1;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } } } } for (t1=max(-n+7,0);t1<=1;t1++) { for (t2=t1+2;t2<=-t1+4;t2++) { for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+5;t2<=n-2;t2++) { for (t3=1;t3<=t2+1;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } for (t3=n+1;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=n-1;t2<=-t1+2*n;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+2*n+1;t2<=t1+2*n+1;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } } } for (t1=2;t1<=n-5;t1++) { t2 = t1+2 ; for (t3=t1+4;t3<=t1+2*n+2;t3++) { i = t1+1 ; if ((t1+t3)%2 == 0) { k = (-t1+t3-2)/2 ; S1(t1+1,1,(-t1+t3-2)/2) ; } } for (t2=t1+3;t2<=n-2;t2++) { for (t3=1;t3<=t2+1;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } for (t3=n+1;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=n-1;t2<=-t1+2*n;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+2*n+1;t2<=-t1+2*n+3;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } } } for (t1=max(2,n-4);t1<=floord(2*n-3,2);t1++) { t2 = t1+2 ; for (t3=t1+4;t3<=t1+2*n+2;t3++) { i = t1+1 ; if ((t1+t3)%2 == 0) { k = (-t1+t3-2)/2 ; S1(t1+1,1,(-t1+t3-2)/2) ; } } for (t2=t1+3;t2<=-t1+2*n;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { i = (t1+t2)/2 ; j = (-t1+t2)/2 ; if ((t1+t3)%2 == 0) { k = (-t2+t3)/2 ; S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2) ; } } } } for (t2=-t1+2*n+1;t2<=-t1+2*n+3;t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { i = (t1+t2-3)/2 ; j = (-t1+t2-1)/2 ; S2((t1+t2-3)/2,(-t1+t2-1)/2,t3) ; } } } } if (n >= 3) { t1 = n-1 ; t2 = n+1 ; for (t3=n+3;t3<=3*n+1;t3++) { if ((t3+n+1)%2 == 0) { k = (t3-n-1)/2 ; S1(n,1,(t3-n-1)/2) ; } } for (t2=n+2;t2<=n+4;t2++) { for (t3=1;t3<=n;t3++) { if ((t2+n)%2 == 0) { i = (t2+n-4)/2 ; j = (t2-n)/2 ; S2((t2+n-4)/2,(t2-n)/2,t3) ; } } } } if (n >= 1) { t2 = n+3 ; for (t3=1;t3<=n;t3++) { S2(n,1,t3) ; } } } cloog-0.18.2/test/basic-bounds-4.cloog0000664000175000017500000000025012254312305014340 00000000000000# language: C c # Context 2 3 # M 1 1 1 0 1 0 1 0 1 # Number of statements 1 # 3 4 # i M 1 1 1 0 0 1 -1 1 1 1 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/emploi.good.c0000664000175000017500000000142112254312305013162 00000000000000/* Generated from ../../../git/cloog/test/emploi.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int m, int n) { /* Original iterators. */ int i, j; if (m >= 1) { for (i=1;i<=n;i++) { if (i >= m) { S1(i) ; } if (i <= min(2*m,m-1)) { S1(i) ; } for (j=1;j<=m;j++) { S2(i,j) ; } } } if (m <= 0) { for (i=1;i<=n;i++) { S1(i) ; } } } cloog-0.18.2/test/block3.good.c0000664000175000017500000000110412254312305013050 00000000000000/* Generated from ../../../git/cloog/test/block3.cloog by CLooG 0.16.2-4-gba4e834 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } #define S2() { hash(2); } #define S3(i) { hash(3); hash(i); } void test() { /* Scattering iterators. */ int c1; /* Original iterators. */ int i; S1(); S3(0); S2(); S3(1); } cloog-0.18.2/test/walters.c0000664000175000017500000000073612254312305012437 00000000000000/* Generated from ../../../git/cloog/test/walters.cloog by CLooG 0.16.1-3-g354eed5 gmp bits in 0.01s. */ S2(1,0,1,0); S4(1,0,1,0); S3(2,0,1,1); S4(2,0,1,1); for (i=3;i<=10;i++) { if ((i+1)%3 == 0) { S3(i,(i-2)/3,(i+1)/3,(i+1)/3); } if ((i+2)%3 == 0) { S2(i,(i-1)/3,(i+2)/3,(i-1)/3); } if (i%3 == 0) { S1(i,i/3,i/3,i/3); } div36 = floord(i,3); div37 = ceild(2*i-3*div36-1,3); if (div37 <= floord(i+2,3)) { S4(i,div36,div37,i-div36-div37); } } cloog-0.18.2/test/singleton.good.c0000664000175000017500000000071112254312305013700 00000000000000/* Generated from /home/skimo/git/cloog/test/singleton.cloog by CLooG 0.14.0-242-g720faff gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } #define S2() { hash(2); } void test() { S2(); S1(); } cloog-0.18.2/test/sor1d.cloog0000664000175000017500000001241412254312305012663 00000000000000# created: Thu Dec 17 16:41:33 CET 2009 # ---------------------- CONTEXT ---------------------- c # language is C # Context 2 4 1 1 0 0 1 0 1 0 1 # set parameter names M N # --------------------- STATEMENTS -------------------- 4 # 1 computation stmts: 1 # domains per statement 19 8 1 -100 0 2 1 0 0 -4 1 0 0 0 1 0 0 -2 1 100 0 -2 -1 0 0 103 1 0 0 0 -1 0 1 -1 1 0 0 1 0 0 0 -1 1 0 -100 1 0 0 0 0 1 -100 0 2 0 0 1 -5 1 0 0 -1 0 1 0 0 1 0 100 -1 0 0 0 99 1 100 0 -2 0 0 0 101 1 0 50 0 0 0 0 49 1 -100 200 0 0 0 1 193 1 0 -100 0 0 1 0 0 1 100 -200 0 0 0 0 101 1 100 0 0 0 0 0 99 1 -100 0 0 0 2 1 -5 1 0 0 0 0 0 1 -3 1 0 0 0 0 2 1 94 1 0 0 0 0 1 0 -1 0 0 0 # for future options... # 1 prepare-send stmts: 1 # domains per statement 57 9 1 0 -200 0 2 1 0 0 -3 1 0 0 0 2 1 0 0 -5 1 -100 0 0 2 1 0 0 -4 1 0 0 0 0 1 0 0 -3 1 0 200 0 -2 -1 0 1 197 1 0 0 0 -2 -1 2 1 -3 1 100 0 0 -2 -1 0 0 103 1 0 0 0 0 -1 0 1 -1 1 0 0 -100 1 0 0 0 1 1 0 -100 0 1 0 0 0 0 1 0 0 0 1 0 0 0 -1 1 0 -200 0 2 0 0 1 -4 1 0 0 0 2 0 0 1 -6 1 -100 0 0 2 0 0 1 -5 1 0 0 100 -1 0 0 0 98 1 0 100 0 -1 0 0 0 99 1 0 0 0 -1 0 1 0 -1 1 0 200 0 -2 0 0 1 194 1 0 0 0 -2 0 2 1 -6 1 50 0 0 -1 0 0 0 50 1 0 -1 1 0 0 0 0 -1 1 0 0 100 0 0 0 0 97 1 0 -200 200 0 0 0 1 192 1 0 0 200 0 0 0 1 190 1 -100 0 200 0 0 0 1 191 1 0 1 -1 0 0 0 0 1 1 0 0 -100 0 0 1 0 0 1 0 200 -200 0 0 0 1 196 1 0 0 -200 0 0 2 1 -4 1 50 0 -100 0 0 0 0 51 1 -100 200 0 0 0 0 2 189 1 -100 200 0 0 0 0 1 193 1 0 100 0 0 0 0 1 94 1 0 200 0 0 0 0 1 192 1 0 50 0 0 0 0 0 49 1 100 -200 0 0 0 0 1 96 1 0 -100 0 0 0 1 1 -5 1 0 -100 0 0 0 1 0 -100 1 0 -200 0 0 0 2 1 -204 1 50 -100 0 0 0 0 0 -49 1 50 0 0 0 0 0 0 49 1 100 0 0 0 0 0 1 94 1 100 0 0 0 0 0 3 284 1 50 0 0 0 0 0 1 45 1 -100 0 0 0 0 2 1 -7 1 -100 0 0 0 0 2 2 -11 1 -100 0 0 0 0 2 4 179 1 -100 0 0 0 0 2 3 -15 1 0 0 0 0 0 2 1 -8 1 0 0 0 0 0 2 3 -16 1 0 0 0 0 0 1 1 -6 1 0 0 0 0 0 0 1 -4 1 0 0 0 0 0 2 4 79 1 0 0 0 0 0 2 7 463 1 0 0 0 0 0 2 6 269 1 0 0 0 0 0 2 5 75 1 0 0 0 0 0 1 0 -2 0 0 0 # for future options... # 1 prepare-receive stmts: 1 # domains per statement 57 9 1 0 -200 0 2 1 0 0 -3 1 0 0 0 2 1 0 0 -5 1 -100 0 0 2 1 0 0 -4 1 0 0 0 0 1 0 0 -3 1 0 200 0 -2 -1 0 1 197 1 0 0 0 -2 -1 2 1 -3 1 100 0 0 -2 -1 0 0 103 1 0 0 0 0 -1 0 1 -1 1 0 0 -100 1 0 0 0 1 1 0 -100 0 1 0 0 0 0 1 0 0 0 1 0 0 0 -1 1 0 -200 0 2 0 0 1 -4 1 0 0 0 2 0 0 1 -6 1 -100 0 0 2 0 0 1 -5 1 0 0 100 -1 0 0 0 98 1 0 100 0 -1 0 0 0 99 1 0 0 0 -1 0 1 0 -1 1 0 200 0 -2 0 0 1 194 1 0 0 0 -2 0 2 1 -6 1 50 0 0 -1 0 0 0 50 1 0 -1 1 0 0 0 0 -1 1 0 0 100 0 0 0 0 97 1 0 -200 200 0 0 0 1 192 1 0 0 200 0 0 0 1 190 1 -100 0 200 0 0 0 1 191 1 0 1 -1 0 0 0 0 1 1 0 0 -100 0 0 1 0 0 1 0 200 -200 0 0 0 1 196 1 0 0 -200 0 0 2 1 -4 1 50 0 -100 0 0 0 0 51 1 -100 200 0 0 0 0 2 189 1 -100 200 0 0 0 0 1 193 1 0 100 0 0 0 0 1 94 1 0 200 0 0 0 0 1 192 1 0 50 0 0 0 0 0 49 1 100 -200 0 0 0 0 1 96 1 0 -100 0 0 0 1 1 -5 1 0 -100 0 0 0 1 0 -100 1 0 -200 0 0 0 2 1 -204 1 50 -100 0 0 0 0 0 -49 1 50 0 0 0 0 0 0 49 1 100 0 0 0 0 0 1 94 1 100 0 0 0 0 0 3 284 1 50 0 0 0 0 0 1 45 1 -100 0 0 0 0 2 1 -7 1 -100 0 0 0 0 2 2 -11 1 -100 0 0 0 0 2 4 179 1 -100 0 0 0 0 2 3 -15 1 0 0 0 0 0 2 1 -8 1 0 0 0 0 0 2 3 -16 1 0 0 0 0 0 1 1 -6 1 0 0 0 0 0 0 1 -4 1 0 0 0 0 0 2 4 79 1 0 0 0 0 0 2 7 463 1 0 0 0 0 0 2 6 269 1 0 0 0 0 0 2 5 75 1 0 0 0 0 0 1 0 -2 0 0 0 # for future options... # 1 communication stmts: 1 # domains per statement 21 5 1 200 0 3 781 1 200 0 1 391 1 200 0 4 1075 1 100 0 1 392 1 100 0 0 197 1 -200 6 5 377 1 -200 6 6 671 1 -100 3 2 190 1 -200 6 3 -13 1 -100 3 1 -5 1 0 2 3 484 1 0 1 1 95 1 0 3 1 192 1 0 3 5 873 1 0 3 2 189 1 0 6 7 1062 1 0 6 5 771 1 0 3 4 579 1 0 0 1 -3 1 0 2 1 -5 1 0 1 0 -1 0 0 0 # for future options... 1 # set the iterator names tileT1 tileP1 other1 other2 other3 other4 other5 # --------------------- SCATTERING -------------------- 4 # Scattering functions 9 17 0 1 0 -1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 -1 0 0 4 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 9 18 0 1 0 -1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 -1 0 0 4 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 9 18 0 1 0 0 0 0 0 -1 0 0 -1 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 -1 0 0 4 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 9 14 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 # we set the scattering dimension names glT1 bl rp1 vT1 vP1 stmtType otherP1 arrAcc1 arrNr1 cloog-0.18.2/test/0D-2.c0000664000175000017500000000020112254312305011343 00000000000000/* Generated from ../../../git/cloog/test/0D-2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ if (M >= 0) { S1() ; } cloog-0.18.2/test/block2.cloog0000664000175000017500000000237212254312305013011 00000000000000# CLooG -> CLooG # This is an automatic dump of a CLooG input file from a CloogInput data # structure. # Language: C c # Context: 0 2 0 # Parameter name(s) # Statement number: 3 # Iteration domain of statement 5 (ND_1IP_ED_0_0_V_0). 1 3 4 0 0 1 -1 1 1 0 0 1 -1 0 9 0 0 0 # For future options. # Iteration domain of statement 6 (ND_1OP_ED_3_0_V_1). 1 3 4 0 0 1 -1 1 1 0 0 1 -1 0 9 0 0 0 # For future options. # Iteration domain of statement 7 (ND_1). 1 3 4 0 0 1 -1 1 1 0 0 1 -1 0 9 0 0 0 # For future options. 0 # Iterator name(s) # --------------------- SCATTERING -------------------- 3 # Scattering functions # Scattering of statement 5 (ND_1IP_ED_0_0_V_0). 1 3 7 0 0 0 1 0 0 -6 0 0 1 0 0 -1 0 0 1 0 0 -1 0 0 # Scattering of statement 6 (ND_1OP_ED_3_0_V_1). 1 3 7 0 0 0 1 0 0 -11 0 0 1 0 0 -1 0 0 1 0 0 -1 0 0 # Scattering of statement 7 (ND_1). 1 3 7 0 0 0 1 0 0 -8 0 0 1 0 0 -1 0 0 1 0 0 -1 0 0 1 # Scattering dimension name(s) c0 c1 c2 cloog-0.18.2/test/dot2.good.c0000664000175000017500000000132512254312305012550 00000000000000/* Generated from ../../../git/cloog/test/dot2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; for (i=1;i<=min(M,N);i++) { S1(i) ; for (j=1;j<=M;j++) { S2(i,j) ; } } for (i=N+1;i<=M;i++) { S1(i) ; } for (i=M+1;i<=N;i++) { for (j=1;j<=M;j++) { S2(i,j) ; } } } cloog-0.18.2/test/tiling.cloog0000664000175000017500000000050012254312305013112 00000000000000# language: C c # parameter {n | n>= 0} 1 3 # n 1 1 1 0 1 n 1 # Number of statements: 1 # {ii, i | t*ii<=i<=t*ii+t-1 0<=i<=n} 4 5 # ii i n 1 1 0 1 0 0 1 0 -1 1 0 1 10 -1 0 9 1 -10 1 0 0 0 0 0 1 ii i 0 # Scattering functions 1 6 # c1 ii i n 1 0 1 -1 -2 0 0 0 cloog-0.18.2/test/lux.c0000664000175000017500000000065012254312305011561 00000000000000/* Generated from ../../../git/cloog/test/lux.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ if (M >= 2) { for (l=2;l<=M;l++) { S1(1,1,M,l) ; } for (i=2;i<=M-1;i++) { for (j=1;j<=i-1;j++) { for (k=j+1;k<=M;k++) { S2(i,j,k,k,i) ; } } for (l=i+1;l<=M;l++) { S1(i,i,M,l) ; } } for (j=1;j<=M-1;j++) { for (k=j+1;k<=M;k++) { S2(M,j,k,k,M) ; } } } cloog-0.18.2/test/lineality-2-1-2.cloog0000664000175000017500000000055612254312305014265 00000000000000# language: C c # Context # {M | 2<=M} 2 3 # M 1 1 1 -2 1 0 1 0 2 # Number of statements 1 # {i,j,M | 1<=i<=M; 1<=j<=M} 5 5 # i j M 1 1 1 0 0 -1 1 0 1 0 -1 1 -1 0 1 0 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # {i,j,M | i=j-2; 3<=j<=M+2} 4 5 # i j M 1 0 1 -1 0 2 1 0 1 0 -3 1 0 -1 1 2 1 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/lub.good.c0000664000175000017500000000145012254312305012461 00000000000000/* Generated from ../../../git/cloog/test/lub.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } #define S4(i,j) { hash(4); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j, k; for (i=1;i<=M-1;i++) { for (j=i+1;j<=M;j++) { S1(i,j) ; for (k=i+1;k<=M;k++) { S2(i,j,k) ; S3(i,j,k) ; } S4(i,j) ; } } } cloog-0.18.2/test/double.c0000664000175000017500000000035412254312305012224 00000000000000/* Generated from ../../../git/cloog/test/double.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (M >= 0) { for (i=0;i<=M;i++) { S1(i) ; for (j=0;j<=N;j++) { S2(i,j) ; S3(i,j) ; } S4(i) ; } } cloog-0.18.2/test/basic-bounds-6.c0000664000175000017500000000017312254312305013465 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-6.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ S1(-1) ; cloog-0.18.2/test/block.good.c0000664000175000017500000000111012254312305012762 00000000000000/* Generated from /home/skimo/git/cloog/test/block.cloog by CLooG 0.14.0-170-g72daac3 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } #define S2() { hash(2); } #define S3(i) { hash(3); hash(i); } void test() { /* Scattering iterators. */ int c1; /* Original iterators. */ int i; S1(); S3(0); S2(); S3(1); } cloog-0.18.2/test/min-3-1.good.c0000664000175000017500000000106512254312305012762 00000000000000/* Generated from ../../../git/cloog/test/min-3-1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; for (i=0;i<=min(10,M);i++) { for (j=0;j<=min(10,M);j++) { S1(i,j) ; } } } cloog-0.18.2/test/block3.c0000664000175000017500000000020212254312305012117 00000000000000/* Generated from ../../../git/cloog/test/block3.cloog by CLooG 0.16.2-4-gba4e834 gmp bits in 0.00s. */ S1(); S3(0); S2(); S3(1); cloog-0.18.2/test/vivien.cloog0000664000175000017500000000573112254312305013137 00000000000000# Context c # output in language C # no constraints on parameters 1 3 # 1 line and 3 columns # n 1 1 0 0 # 0 >= 0 always true 1 # Setting manually the parameter' sname n # The name # -------------------- Statements ------------------ 6 # Number of statements 1 # First statement: 1 domain # First domain 2 4 # 2 lines and 4 columns # i n 1 1 1 27 -1 # i >= 1 1 -1 1 28 # n >= i 0 0 0 1 # Second statement: 1 domain # First domain 4 5 # 4 lines and 5 columns # i k n 1 1 1 29 0 -1 # i >= 1 1 -1 0 1 0 # n >= i 1 0 1 0 -1 # k >= 1 1 1 -1 0 -1 # k <= i-1 0 0 0 1 # Third statement: 1 domain # First domain 2 4 # 2 lines and 4 columns # i n 1 1 1 0 -1 # i >= 1 1 -1 1 0 # n >= i 0 0 0 1 # Fourth statement: 1 domain # First domain 4 5 # 4 lines and 5 columns # i j n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # n >= i 1 -1 1 0 -1 # j >= i+1 1 0 -1 1 0 # j <= n 0 0 0 1 # Fifth statement: 1 domain # First domain 6 6 # 6 lines and 6 columns # i j k n 1 1 1 0 0 0 -1 # i >= 1 1 -1 0 0 1 0 # n >= i 1 -1 1 0 0 -1 # j >= i+1 1 0 -1 0 1 0 # j <= n 1 0 0 1 0 -1 # k >= 1 1 1 0 -1 0 -1 # k <= i-1 0 0 0 1 # Sixth statement: 1 domain # First domain 4 5 # 4 lines and 5 columns # i j n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # n >= i 1 -1 1 0 -1 # j >= i+1 1 0 -1 1 0 # j <= n 0 0 0 1 # We manually set the iterator names i j k # ------------------------ Scattering ------------------- 6 # Number of scattering functions # First function 3 7 # 3 lines and 7 columns # p1 p2 p3 i n 1 0 1 0 0 -2 0 -2 # p1 = 2i+2 0 0 1 0 0 0 0 # p2 = 0 0 0 0 1 0 0 0 # p3 = 0 # Second function 3 8 # 3 lines and 8 columns # p1 p2 p3 i j n 1 0 1 0 0 -2 -2 0 -1 # p1 = 2i+2j+1 0 0 1 0 0 -1 0 0 # p2 = j 0 0 0 1 0 0 0 0 # p3 = 0 # Third function 3 7 # 3 lines and 7 columns # p1 p2 p3 i n 1 0 1 0 0 -4 0 -1 # p1 = 4i+1 0 0 1 0 0 0 0 # p2 = 0 0 0 0 1 0 0 0 # p3 = 0 # Fourth function 3 8 # 3 lines and 8 columns # p1 p2 p3 i j n 1 0 1 0 0 -2 -2 0 0 # p1 = 2i+2j 0 0 1 0 1 0 0 0 # p2 = -i 0 0 0 1 0 0 0 0 # p3 = 0 # Fifth function 3 9 # 3 lines and 9 columns # p1 p2 p3 i j k n 1 0 1 0 0 -2 -2 0 0 0 # p1 = 2i+2j 0 0 1 0 1 0 0 0 -1 # p2 = -i+1 0 0 0 1 0 0 -1 0 0 # p3 = k # Sixth function 3 8 # 3 lines and 8 columns # p1 p2 p3 i j n 1 0 1 0 0 -2 -2 0 0 # p1 = 2i+2j 0 0 1 0 1 0 0 -2 # p2 = -i+2 0 0 0 1 0 0 0 0 # p3 = 0 1 # Manually set the scattering dimensions p1 p2 p3 cloog-0.18.2/test/1point-1.c0000664000175000017500000000017012254312305012316 00000000000000/* Generated from ../../../git/cloog/test/1point-1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ S1(2*M,M) ; cloog-0.18.2/test/check_openscop.sh0000775000175000017500000000510212254312305014124 00000000000000#!/bin/sh # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** check_openscop.sh ** # **-------------------------------------------------------------------** # ** First version: November 17th 2011 ** # **-------------------------------------------------------------------**/ # #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ $CHECKER "OPENSCOP" "$CLOOGTEST_OPENSCOP" "-openscop" "scop" "c" "0" cloog-0.18.2/test/levenshtein-1-2-3.c0000664000175000017500000000122512254312305013731 00000000000000/* Generated from ../../../git/cloog/test/levenshtein-1-2-3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.12s. */ S1(0,0) ; S2(1,0) ; S3(1,1) ; for (i=2;i<=N;i++) { S2(i,0) ; for (j=1;j<=i-1;j++) { S6(i,j) ; } S3(i,i) ; } S7(N+1,0) ; for (j=1;j<=N;j++) { S6(N+1,j) ; S8(N+1,j) ; } for (i=N+2;i<=2*M-N-2;i++) { j = floord(i-N-1,2) ; S7(i,j) ; if ((i+N)%2 == 0) { S5(i,(i-N)/2) ; S8(i,(i-N)/2) ; } for (j=ceild(i-N+1,2);j<=floord(i+N-1,2);j++) { S6(i,j) ; S8(i,j) ; } if ((i+N)%2 == 0) { S4(i,(i+N)/2) ; S8(i,(i+N)/2) ; } } for (i=2*M-N-1;i<=2*M-2;i++) { for (j=i-M+1;j<=M-1;j++) { S6(i,j) ; } } cloog-0.18.2/test/infinite3.cloog0000664000175000017500000000052112254312305013517 00000000000000# langage c # parametres {M, N | M>=1 N >=1} 2 4 # M N 1 1 1 0 -1 1 0 1 -1 0 2 # Number of statements 1 # {i | 1<=i<=M} 1 5 # i M N 1 #1 1 0 0 -1 1 -1 1 0 0 0 0 0 1 # {i, j | 1<=i<=N 1<=j<=M} 4 6 # i j M N 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/forwardsub-3-1-2.good.c0000664000175000017500000000172712254312305014521 00000000000000/* Generated from ../../../git/cloog/test/forwardsub-3-1-2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } #define S4(i,j) { hash(4); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; S3(2,1) ; S1(3,1) ; S1(4,1) ; S4(4,2) ; for (i=5;i<=M+1;i++) { S1(i,1) ; for (j=2;j<=floord(i-1,2);j++) { S2(i,j) ; } if (i%2 == 0) { S4(i,i/2) ; } } for (i=M+2;i<=2*M-1;i++) { for (j=i-M;j<=floord(i-1,2);j++) { S2(i,j) ; } if (i%2 == 0) { S4(i,i/2) ; } } i = 2*M ; S4(2*M,M) ; } cloog-0.18.2/test/lu2.c0000664000175000017500000000065112254312305011454 00000000000000/* Generated from ../../../git/cloog/test/lu2.cloog by CLooG 0.14.0-238-gb1cb779 gmp bits in 0.01s. */ if (n >= 2) { for (l=2;l<=n;l++) { S1(1,n,1,l); } for (i=2;i<=n-1;i++) { for (j=2;j<=n;j++) { for (k=1;k<=min(i-1,j-1);k++) { S2(i,j,k,j,i); } } for (l=i+1;l<=n;l++) { S1(i,n,i,l); } } for (j=2;j<=n;j++) { for (k=1;k<=j-1;k++) { S2(n,j,k,j,n); } } } cloog-0.18.2/test/reservoir/0000775000175000017500000000000012254314447012715 500000000000000cloog-0.18.2/test/reservoir/tang-xue1.good.c0000664000175000017500000000200112254312305015521 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/tang-xue1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k,l) { hash(1); hash(i); hash(j); hash(k); hash(l); } void test() { /* Scattering iterators. */ int c2, c4, c6, c8; /* Original iterators. */ int i, j, k, l; for (c2=0;c2<=9;c2++) { for (c4=max(-1,c2-9);c4<=min(4,c2+3);c4++) { for (c6=max(max(c2,1),c2-c4);c6<=min(min(c2+1,9),c2-c4+4);c6++) { for (c8=max(1,-c2+c4+c6);c8<=min(4,-c2+c4+c6+1);c8++) { if (c2%2 == 0) { if ((c2+c4)%2 == 0) { j = (-c2+c4)/2 ; k = -c2+c6 ; l = -c4+c8 ; S1(c2/2,(-c2+c4)/2,-c2+c6,-c4+c8) ; } } } } } } } cloog-0.18.2/test/reservoir/pingali3.c0000664000175000017500000000052712254312305014502 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (M >= 1) { for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { for (c6=1;c6<=M;c6++) { S2(c2,c4,c6) ; } } } } cloog-0.18.2/test/reservoir/loechner3.c0000664000175000017500000000044212254312305014652 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/loechner3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (M >= 1) { for (c2=1;c2<=M;c2++) { for (c4=2;c4<=c2+M;c4++) { for (c6=max(1,-c2+c4);c6<=min(M,c4-1);c6++) { S1(c2,c6,c4-c6) ; } } } } cloog-0.18.2/test/reservoir/loechner4.cloog0000775000175000017500000000254412254312305015544 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 1 1 # { (i,j,k,l,m) | i-1 >= 0, -i+m >= 0, j-1 >= 0, -j+m >= 0, k-1 >= 0, -k+m >= 0, l-1 >= 0, -l+m >= 0, 1 >= 0 } 9 7 1 1 0 0 0 0 -1 1 -1 0 0 0 1 0 1 0 1 0 0 0 -1 1 0 -1 0 0 1 0 1 0 0 1 0 0 -1 1 0 0 -1 0 1 0 1 0 0 0 1 0 -1 1 0 0 0 -1 1 0 1 0 0 0 0 0 1 0 0 0 0 # Scattering functions 1 10 16 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/pingali1.cloog0000775000175000017500000000337012254312305015363 00000000000000# Language c # Context 1 4 1 0 0 1 0 # Number of statments 2 1 # { (i,j,k,l,m) | i-1 >= 0, -i+l >= 0, -j+m >= 0, k-1 >= 0, j-k-1 >= 0, 1 >= 0 } 6 7 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 -1 0 0 1 0 1 0 0 1 0 0 -1 1 0 1 -1 0 0 -1 1 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+l >= 0, 1 >= 0 } 5 6 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 0 0 1 0 0 0 0 # Scattering functions 2 8 14 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam5.c0000664000175000017500000000057612254312305014415 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam5.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (M >= 1) { for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S3(c2,c4) ; } } } cloog-0.18.2/test/reservoir/lim-lam1.cloog0000664000175000017500000000174312254312305015267 00000000000000# Language c # Context 1 2 1 1 0 # Number of statments 2 1 # { (i,j) | i-1 >= 0, -i+100 >= 0, j-1 >= 0, -j+100 >= 0 } 4 4 1 1 0 -1 1 -1 0 100 1 0 1 -1 1 0 -1 100 0 0 0 1 # { (i,j) | i-1 >= 0, -i+100 >= 0, j-1 >= 0, -j+100 >= 0 } 4 4 1 1 0 -1 1 -1 0 100 1 0 1 -1 1 0 -1 100 0 0 0 0 # Scattering functions 2 6 9 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 -2 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 6 9 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 1 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 -2 1 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam3.cloog0000775000175000017500000000543012254312305015271 00000000000000# Language c # Context 2 3 1 1 -1 1 0 1 0 # Number of statments 4 1 # { (i,j,k,l) | -i+l >= 0, i-j-1 >= 0, k-1 >= 0, j-k-1 >= 0, 1 >= 0 } 5 6 1 -1 0 0 1 0 1 1 -1 0 0 -1 1 0 0 1 0 -1 1 0 1 -1 0 -1 1 0 0 0 0 1 0 0 0 1 # { (i,j,k) | -i+k >= 0, j-1 >= 0, i-j-1 >= 0, 1 >= 0 } 4 5 1 -1 0 1 0 1 0 1 0 -1 1 1 -1 0 -1 1 0 0 0 1 0 0 0 1 # { (i,j,k) | -i+k >= 0, j-1 >= 0, i-j-1 >= 0, 1 >= 0 } 4 5 1 -1 0 1 0 1 0 1 0 -1 1 1 -1 0 -1 1 0 0 0 1 0 0 0 1 # { (i,j) | i-1 >= 0, -i+j >= 0, 1 >= 0 } 3 4 1 1 0 -1 1 -1 1 0 1 0 0 1 0 0 0 0 # Scattering functions 4 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 -2 -2 0 -5 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 -4 0 -3 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -3 -2 0 -1 0 0 0 1 0 0 0 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 11 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -5 0 0 0 0 0 1 0 0 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/mg-rprj3.cloog0000775000175000017500000001437512254312305015327 00000000000000# Language c # Context 1 8 1 0 0 0 0 0 0 1 0 # Number of statments 5 1 # { (i,j,k,l,m,n,o,p,q) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+l >= 0, 1 >= 0 } 7 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 -2 1 0 -1 0 0 1 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 -2 1 0 0 -1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+l >= 0, 1 >= 0 } 7 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 -2 1 0 -1 0 0 1 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 -2 1 0 0 -1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 -2 1 0 -1 0 0 1 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 -2 1 0 0 -1 1 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 -2 1 0 -1 0 0 1 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 -2 1 0 0 -1 1 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 -2 1 0 -1 0 0 1 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 -2 1 0 0 -1 1 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 # Scattering functions 5 8 18 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 18 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 18 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 18 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 18 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam6.good.c0000664000175000017500000000144312254312305015337 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam6.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; if (M >= 1) { for (c2=0;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } } if (M >= 1) { for (c2=0;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c4,c2) ; } } } } cloog-0.18.2/test/reservoir/pingali6.good.c0000664000175000017500000000235712254312305015437 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali6.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.03s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int M, int N) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if (N >= 3) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S1(1,c4,c6) ; } } } if (N >= 3) { for (c2=3;c2<=2*M;c2++) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if (c2%2 == 0) { S1(c2/2,c4,c6) ; } } } for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if ((c2+1)%2 == 0) { i = (c2-1)/2 ; S2((c2-1)/2,c4,c6) ; } } } } } if (N >= 3) { c2 = 2*M+1 ; for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S2(M,c4,c6) ; } } } } cloog-0.18.2/test/reservoir/jacobi2.cloog0000775000175000017500000000121412254312305015163 00000000000000# Language c # Context 2 3 1 1 -1 1 0 1 0 # Number of statments 1 1 # { (i,j,k) | i >= 0, -i+k-1 >= 0, j >= 0, -j+k-1 >= 0, 1 >= 0 } 5 5 1 1 0 0 0 1 -1 0 1 -1 1 0 1 0 0 1 0 -1 1 -1 1 0 0 0 1 0 0 0 0 # Scattering functions 1 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/stride.c0000664000175000017500000000027112254312305014262 00000000000000/* Generated from ../../../git/cloog/test/reservoir/stride.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ if (M >= 2) { for (c2=2;c2<=M;c2+=7) { S1(c2,(c2-2)/7) ; } } cloog-0.18.2/test/reservoir/tang-xue1.c0000664000175000017500000000071712254312305014606 00000000000000/* Generated from ../../../git/cloog/test/reservoir/tang-xue1.cloog by CLooG 0.14.0-165-g01eb246 gmp bits in 0.01s. */ for (c2=0;c2<=9;c2++) { for (c4=max(-1,c2-9);c4<=min(4,c2+3);c4++) { for (c6=max(max(1,c2),c2-c4);c6<=min(min(9,c2+1),c2-c4+4);c6++) { for (c8=max(1,-c2+c4+c6);c8<=min(4,-c2+c4+c6+1);c8++) { if (c2%2 == 0) { if (c4%2 == 0) { S1(c2/2,(-c2+c4)/2,-c2+c6,-c4+c8); } } } } } } cloog-0.18.2/test/reservoir/jacobi2.c0000664000175000017500000000030312254312305014275 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/jacobi2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (c2=0;c2<=M-1;c2++) { for (c4=0;c4<=M-1;c4++) { S1(c2,c4) ; } } cloog-0.18.2/test/reservoir/lim-lam4.good.c0000664000175000017500000000204512254312305015334 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam4.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if (M >= 2) { S1(1,0,0) ; } for (c2=2;c2<=2*M-2;c2++) { for (c4=max(-M+1,-c2+1);c4<=-1;c4++) { for (i=max(1,c2-M+1);i<=min(c2+c4,M-1);i++) { j = c2+c4-i ; S1(i,c2+c4-i,-c4) ; } for (c6=max(-c4,c2-M+1);c6<=min(c2-1,M-1);c6++) { i = c2-c6 ; j = c4+c6 ; S2(c2-c6,c4+c6,c6) ; } } for (i=max(1,c2-M+1);i<=min(M-1,c2);i++) { j = c2-i ; S1(i,c2-i,0) ; } } } cloog-0.18.2/test/reservoir/fusion1.cloog0000775000175000017500000000166512254312305015250 00000000000000# Language c # Context 2 3 1 1 -1 1 0 1 0 # Number of statments 3 1 # { (i,j) | i >= 0, -i+j >= 0, 1 >= 0 } 3 4 1 1 0 0 1 -1 1 0 1 0 0 1 0 0 0 1 # { (i,j) | i-1 >= 0, -i+j >= 0, 1 >= 0 } 3 4 1 1 0 -1 1 -1 1 0 1 0 0 1 0 0 0 1 # { (i,j) | i >= 0, -i+j >= 0, 1 >= 0 } 3 4 1 1 0 0 1 -1 1 0 1 0 0 1 0 0 0 0 # Scattering functions 3 4 7 0 1 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 4 7 0 1 0 0 0 0 -1 0 0 1 0 -1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 4 7 0 1 0 0 0 0 -2 0 0 1 0 -1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/mg-interp.cloog0000775000175000017500000005362212254312305015566 00000000000000# Language c # Context 1 11 1 0 0 0 0 0 0 0 0 0 1 0 # Number of statments 15 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-q >= 0, -i+n-1 >= 0, j-p >= 0, -j+m-1 >= 0, k-o >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-q >= 0, -i+n-1 >= 0, j-p >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-q >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-o >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-q >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 # Scattering functions 15 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -3 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -3 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -4 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -4 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -5 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -6 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -7 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/pingali5.good.c0000664000175000017500000000231012254312305015423 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali5.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.03s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; for (c2=3;c2<=2*M-3;c2++) { for (c4=ceild(c2+3,2);c4<=M;c4++) { for (i=ceild(c2+1,2);i<=min(c4-1,c2-1);i++) { j = c2-i ; S1(i,c2-i,c4) ; } } for (c4=max(1,c2-M);c4<=floord(c2-1,2);c4++) { i = c2-c4 ; S2(c2-c4,c4) ; } for (c4=ceild(c2+3,2);c4<=M;c4++) { for (i=ceild(c2+1,2);i<=min(c4-1,c2-1);i++) { j = c2-i ; S3(i,c2-i,c4) ; } } } for (c2=max(2*M-2,3);c2<=2*M-1;c2++) { for (c4=max(1,c2-M);c4<=floord(c2-1,2);c4++) { i = c2-c4 ; S2(c2-c4,c4) ; } } } cloog-0.18.2/test/reservoir/QR.good.c0000664000175000017500000000753612254312305014254 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/QR.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.27s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i) { hash(3); hash(i); } #define S4(i,j) { hash(4); hash(i); hash(j); } #define S5(i) { hash(5); hash(i); } #define S6(i,j) { hash(6); hash(i); hash(j); } #define S7(i,j,k) { hash(7); hash(i); hash(j); hash(k); } #define S8(i,j) { hash(8); hash(i); hash(j); } #define S9(i,j,k) { hash(9); hash(i); hash(j); hash(k); } #define S10(i) { hash(10); hash(i); } void test(int M, int N) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if ((M <= -1) && (N >= 1)) { S1(0) ; } if ((M >= 0) && (N >= 1)) { S1(0) ; } if ((M >= 1) && (N >= 2)) { for (c4=0;c4<=M-1;c4++) { S2(0,c4) ; } S3(0) ; for (c4=0;c4<=M-1;c4++) { S4(0,c4) ; } S10(0) ; S1(1) ; S5(0) ; } if ((M <= 0) && (N >= 2)) { S3(0) ; S10(0) ; S1(1) ; S5(0) ; } if ((M >= 1) && (N == 1)) { for (c4=0;c4<=M-1;c4++) { S2(0,c4) ; } S3(0) ; for (c4=0;c4<=M-1;c4++) { S4(0,c4) ; } S10(0) ; S5(0) ; } if ((M <= 0) && (N == 1)) { S3(0) ; S10(0) ; S5(0) ; } for (c2=2;c2<=min(N-1,M);c2++) { for (c4=c2-1;c4<=N-1;c4++) { i = c2-2 ; S6(c2-2,c4) ; for (c6=c2-2;c6<=M-1;c6++) { i = c2-2 ; S7(c2-2,c4,c6) ; } i = c2-2 ; S8(c2-2,c4) ; for (c6=c2-2;c6<=M-1;c6++) { i = c2-2 ; S9(c2-2,c4,c6) ; } } for (c4=c2-1;c4<=M-1;c4++) { i = c2-1 ; S2(c2-1,c4) ; } i = c2-1 ; S3(c2-1) ; for (c4=c2-1;c4<=M-1;c4++) { i = c2-1 ; S4(c2-1,c4) ; } i = c2-1 ; S10(c2-1) ; S1(c2) ; i = c2-1 ; S5(c2-1) ; } if ((M >= 1) && (M <= N-2)) { c2 = M+1 ; for (c4=M;c4<=N-1;c4++) { i = M-1 ; S6(M-1,c4) ; c6 = M-1 ; i = M-1 ; k = M-1 ; S7(M-1,c4,M-1) ; i = M-1 ; S8(M-1,c4) ; c6 = M-1 ; i = M-1 ; k = M-1 ; S9(M-1,c4,M-1) ; } S3(M) ; S10(M) ; i = M+1 ; S1(M+1) ; S5(M) ; } if ((M >= N) && (N >= 2)) { c4 = N-1 ; i = N-2 ; j = N-1 ; S6(N-2,N-1) ; for (c6=N-2;c6<=M-1;c6++) { i = N-2 ; j = N-1 ; S7(N-2,N-1,c6) ; } i = N-2 ; j = N-1 ; S8(N-2,N-1) ; for (c6=N-2;c6<=M-1;c6++) { i = N-2 ; j = N-1 ; S9(N-2,N-1,c6) ; } for (c4=N-1;c4<=M-1;c4++) { i = N-1 ; S2(N-1,c4) ; } i = N-1 ; S3(N-1) ; for (c4=N-1;c4<=M-1;c4++) { i = N-1 ; S4(N-1,c4) ; } i = N-1 ; S10(N-1) ; i = N-1 ; S5(N-1) ; } if ((M == N-1) && (N >= 2)) { c4 = N-1 ; i = N-2 ; j = N-1 ; S6(N-2,N-1) ; c6 = N-2 ; i = N-2 ; j = N-1 ; k = N-2 ; S7(N-2,N-1,N-2) ; i = N-2 ; j = N-1 ; S8(N-2,N-1) ; c6 = N-2 ; i = N-2 ; j = N-1 ; k = N-2 ; S9(N-2,N-1,N-2) ; i = N-1 ; S3(N-1) ; i = N-1 ; S10(N-1) ; i = N-1 ; S5(N-1) ; } for (c2=max(M+2,2);c2<=N-1;c2++) { for (c4=c2-1;c4<=N-1;c4++) { i = c2-2 ; S6(c2-2,c4) ; i = c2-2 ; S8(c2-2,c4) ; } i = c2-1 ; S3(c2-1) ; i = c2-1 ; S10(c2-1) ; S1(c2) ; i = c2-1 ; S5(c2-1) ; } if ((M <= N-2) && (N >= 2)) { c4 = N-1 ; i = N-2 ; j = N-1 ; S6(N-2,N-1) ; i = N-2 ; j = N-1 ; S8(N-2,N-1) ; i = N-1 ; S3(N-1) ; i = N-1 ; S10(N-1) ; i = N-1 ; S5(N-1) ; } } cloog-0.18.2/test/reservoir/mg-psinv.cloog0000775000175000017500000000615212254312305015420 00000000000000# Language c # Context 1 5 1 0 0 0 1 0 # Number of statments 3 1 # { (i,j,k,l,m,n) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 8 1 1 0 0 0 0 0 -2 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 -2 1 0 -1 0 0 1 0 -1 1 0 0 1 0 0 0 -1 1 0 0 -1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 8 1 1 0 0 0 0 0 -2 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 -2 1 0 -1 0 0 1 0 -1 1 0 0 1 0 0 0 -1 1 0 0 -1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 8 1 1 0 0 0 0 0 -2 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 -2 1 0 -1 0 0 1 0 -1 1 0 0 1 0 0 0 -2 1 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 1 0 0 0 0 # Scattering functions 3 8 15 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 15 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 15 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/fusion2.good.c0000664000175000017500000000170112254312305015303 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/fusion2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M, int N) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; if ((M >= 1) && (N >= 1)) { for (c4=1;c4<=M;c4++) { S1(1,c4) ; } } if (M >= 1) { for (c2=2;c2<=N;c2++) { for (c4=1;c4<=M;c4++) { i = c2-1 ; S2(c2-1,c4) ; } for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } } if ((M >= 1) && (N >= 1)) { c2 = N+1 ; for (c4=1;c4<=M;c4++) { S2(N,c4) ; } } } cloog-0.18.2/test/reservoir/pingali4.c0000664000175000017500000000041012254312305014472 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali4.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c2,c4) ; } } cloog-0.18.2/test/reservoir/lim-lam2.good.c0000664000175000017500000000157312254312305015337 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } void test(int M, int N) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; for (c2=1;c2<=M;c2++) { S1(c2) ; } if (N >= 2) { for (c2=1;c2<=M;c2++) { for (c4=2;c4<=N;c4++) { S2(c2,c4) ; } } } if (N >= 2) { for (c2=1;c2<=M;c2++) { for (c4=1;c4<=N-1;c4++) { S3(c2,c4) ; } } } } cloog-0.18.2/test/reservoir/loechner4.good.c0000664000175000017500000000142412254312305015603 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/loechner4.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k,l) { hash(1); hash(i); hash(j); hash(k); hash(l); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6, c8; /* Original iterators. */ int i, j, k, l; for (c2=2;c2<=2*M;c2++) { for (c4=1;c4<=M;c4++) { for (c6=1;c6<=M;c6++) { for (c8=max(1,c2-M);c8<=min(c2-1,M);c8++) { l = c2-c8 ; S1(c6,c4,c8,c2-c8) ; } } } } } cloog-0.18.2/test/reservoir/QR.cloog0000775000175000017500000001652512254312305014207 00000000000000# Language c # Context 1 4 1 0 0 1 0 # Number of statments 10 1 # { (i,j,k) | i >= 0, -i+k-1 >= 0, 1 >= 0 } 3 5 1 1 0 0 0 1 -1 0 1 -1 1 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i >= 0, -i+l-1 >= 0, -i+j >= 0, -j+k-1 >= 0, 1 >= 0 } 5 6 1 1 0 0 0 0 1 -1 0 0 1 -1 1 -1 1 0 0 0 1 0 -1 1 0 -1 1 0 0 0 0 1 0 0 0 1 # { (i,j,k) | i >= 0, -i+k-1 >= 0, 1 >= 0 } 3 5 1 1 0 0 0 1 -1 0 1 -1 1 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i >= 0, -i+l-1 >= 0, -i+j >= 0, -j+k-1 >= 0, 1 >= 0 } 5 6 1 1 0 0 0 0 1 -1 0 0 1 -1 1 -1 1 0 0 0 1 0 -1 1 0 -1 1 0 0 0 0 1 0 0 0 1 # { (i,j,k) | i >= 0, -i+k-1 >= 0, 1 >= 0 } 3 5 1 1 0 0 0 1 -1 0 1 -1 1 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i >= 0, -i+j-1 >= 0, -j+l-1 >= 0, 1 >= 0 } 4 6 1 1 0 0 0 0 1 -1 1 0 0 -1 1 0 -1 0 1 -1 1 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m) | i >= 0, -i+j-1 >= 0, -j+m-1 >= 0, -i+k >= 0, -k+l-1 >= 0, 1 >= 0 } 6 7 1 1 0 0 0 0 0 1 -1 1 0 0 0 -1 1 0 -1 0 0 1 -1 1 -1 0 1 0 0 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i >= 0, -i+j-1 >= 0, -j+l-1 >= 0, 1 >= 0 } 4 6 1 1 0 0 0 0 1 -1 1 0 0 -1 1 0 -1 0 1 -1 1 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m) | i >= 0, -i+j-1 >= 0, -j+m-1 >= 0, -i+k >= 0, -k+l-1 >= 0, 1 >= 0 } 6 7 1 1 0 0 0 0 0 1 -1 1 0 0 0 -1 1 0 -1 0 0 1 -1 1 -1 0 1 0 0 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 1 0 0 0 1 # { (i,j,k) | i >= 0, -i+k-1 >= 0, 1 >= 0 } 3 5 1 1 0 0 0 1 -1 0 1 -1 1 0 0 0 1 0 0 0 0 # Scattering functions 10 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -5 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 -3 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 -6 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 -2 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 8 14 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 -2 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 -2 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 8 14 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 -2 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -3 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 -4 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam3.c0000664000175000017500000000144712254312305014411 00000000000000/* Generated from ../../../git/cloog/test/reservoir/lim-lam3.cloog by CLooG 0.16.2-8-g1421b58 gmp bits in 0.03s. */ S4(1); for (c2=9;c2<=min(13,5*M-1);c2++) { if (c2 <= M+7) { S2(c2-7,1); } if (c2 == 10) { S4(2); } if (c2 <= 3*M+3) { if (c2%3 == 0) { S3((c2-3)/3,1); } } } for (c2=14;c2<=5*M-1;c2++) { for (c4=max(2,ceild(c2-M-3,4));c4<=min(floord(c2-8,3),M-1);c4++) { for (c6=max(1,ceild(c2-2*c4-M-5,2));c6<=min(floord(c2-3*c4-6,2),c4-1);c6++) { S1(c2-2*c4-2*c6-5,c4,c6); } } for (c4=max(1,ceild(c2-M-3,4));c4<=floord(c2-4,5);c4++) { S2(c2-4*c4-3,c4); } if (c2%5 == 0) { S4(c2/5); } for (c4=max(1,ceild(c2-3*M-1,2));c4<=floord(c2-4,5);c4++) { if ((c2+c4+2)%3 == 0) { S3((c2-2*c4-1)/3,c4); } } } if (M >= 2) { S4(M); } cloog-0.18.2/test/reservoir/mg-resid.good.c0000664000175000017500000000336512254312305015435 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/mg-resid.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.05s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } void test(int M, int N, int O) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if ((M >= 3) && (N >= 4)) { for (c2=2;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,2,c6) ; S2(c2,2,c6) ; } for (c4=4;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S1(c2,(c4+1)/2,c6) ; S2(c2,(c4+1)/2,c6) ; } } for (c6=2;c6<=M-1;c6++) { if (c4%2 == 0) { S3(c2,c4/2,c6) ; } } } c4 = 2*N-2 ; for (c6=2;c6<=M-1;c6++) { j = N-1 ; S3(c2,N-1,c6) ; } } } if ((M >= 3) && (N == 3)) { for (c2=2;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,2,c6) ; S2(c2,2,c6) ; } for (c6=2;c6<=M-1;c6++) { S3(c2,2,c6) ; } } } if ((M >= 1) && (M <= 2) && (N >= 3)) { for (c2=2;c2<=O-1;c2++) { for (c4=3;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S1(c2,(c4+1)/2,c6) ; S2(c2,(c4+1)/2,c6) ; } } } } } } cloog-0.18.2/test/reservoir/fusion1.good.c0000664000175000017500000000131212254312305015300 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/fusion1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } #define S3(i) { hash(3); hash(i); } void test(int M) { /* Scattering iterators. */ int c2; /* Original iterators. */ int i; for (c2=0;c2<=M;c2++) { S1(c2) ; } for (c2=1;c2<=M;c2++) { S2(c2) ; } for (c2=0;c2<=M;c2++) { S3(c2) ; } } cloog-0.18.2/test/reservoir/loechner3.good.c0000664000175000017500000000132412254312305015601 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/loechner3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; for (c2=1;c2<=M;c2++) { for (c4=2;c4<=c2+M;c4++) { for (c6=max(1,-c2+c4);c6<=min(M,c4-1);c6++) { k = c4-c6 ; S1(c2,c6,c4-c6) ; } } } } cloog-0.18.2/test/reservoir/mg-interp2.cloog0000775000175000017500000001370712254312305015650 00000000000000# Language c # Context 1 11 1 0 0 0 0 0 0 0 0 0 1 0 # Number of statments 4 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-p >= 0, -j+m-1 >= 0, k-o >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-p >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-o >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n,o,p,q,r,s,t) | i-1 >= 0, -i+n-1 >= 0, j-1 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 14 1 1 0 0 0 0 0 0 0 0 0 0 0 -1 1 -1 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 0 0 -1 1 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 # Scattering functions 4 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 21 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -3 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/mg-interp.good.c0000664000175000017500000001634512254312305015632 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/mg-interp.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 1.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } #define S4(i,j,k) { hash(4); hash(i); hash(j); hash(k); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } #define S6(i,j,k) { hash(6); hash(i); hash(j); hash(k); } #define S7(i,j,k) { hash(7); hash(i); hash(j); hash(k); } #define S8(i,j,k) { hash(8); hash(i); hash(j); hash(k); } #define S9(i,j,k) { hash(9); hash(i); hash(j); hash(k); } #define S10(i,j,k) { hash(10); hash(i); hash(j); hash(k); } #define S11(i,j,k) { hash(11); hash(i); hash(j); hash(k); } #define S12(i,j,k) { hash(12); hash(i); hash(j); hash(k); } #define S13(i,j,k) { hash(13); hash(i); hash(j); hash(k); } #define S14(i,j,k) { hash(14); hash(i); hash(j); hash(k); } #define S15(i,j,k) { hash(15); hash(i); hash(j); hash(k); } void test(int M, int N, int O, int P, int Q, int R, int S, int T, int U) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if ((M >= 2) && (N >= 4)) { for (c2=1;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S6(c2,1,c6) ; S7(c2,1,c6) ; } for (c6=1;c6<=M;c6++) { S3(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S1(c2,2,c6) ; } S1(c2,2,M) ; for (c6=1;c6<=M-1;c6++) { S6(c2,2,c6) ; S7(c2,2,c6) ; } for (c6=1;c6<=M-1;c6++) { S11(c2,1,c6) ; } for (c4=3;c4<=2*N-5;c4++) { for (c6=1;c6<=M-1;c6++) { if ((c4+1)%2 == 0) { j = (c4-1)/2 ; S10(c2,(c4-1)/2,c6) ; } } for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S3(c2,(c4+1)/2,c6) ; } } for (c6=1;c6<=M-1;c6++) { if (c4%2 == 0) { j = (c4+2)/2 ; S6(c2,(c4+2)/2,c6) ; S7(c2,(c4+2)/2,c6) ; } if ((c4+1)%2 == 0) { j = (c4+3)/2 ; S1(c2,(c4+3)/2,c6) ; } } if ((c4+1)%2 == 0) { j = (c4+3)/2 ; S1(c2,(c4+3)/2,M) ; } for (c6=1;c6<=M-1;c6++) { if (c4%2 == 0) { S11(c2,c4/2,c6) ; } } } c4 = 2*N-4 ; for (c6=1;c6<=M-1;c6++) { j = N-1 ; S6(c2,N-1,c6) ; S7(c2,N-1,c6) ; } for (c6=1;c6<=M-1;c6++) { j = N-2 ; S11(c2,N-2,c6) ; } c4 = 2*N-3 ; for (c6=1;c6<=M-1;c6++) { j = N-2 ; S10(c2,N-2,c6) ; } for (c6=1;c6<=M;c6++) { j = N-1 ; S3(c2,N-1,c6) ; } c4 = 2*N-2 ; for (c6=1;c6<=M-1;c6++) { j = N-1 ; S11(c2,N-1,c6) ; } c4 = 2*N-1 ; for (c6=1;c6<=M-1;c6++) { j = N-1 ; S10(c2,N-1,c6) ; } } } if ((M >= 2) && (N == 3)) { for (c2=1;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S6(c2,1,c6) ; S7(c2,1,c6) ; } for (c6=1;c6<=M;c6++) { S3(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S1(c2,2,c6) ; } S1(c2,2,M) ; for (c6=1;c6<=M-1;c6++) { S6(c2,2,c6) ; S7(c2,2,c6) ; } for (c6=1;c6<=M-1;c6++) { S11(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S10(c2,1,c6) ; } for (c6=1;c6<=M;c6++) { S3(c2,2,c6) ; } for (c6=1;c6<=M-1;c6++) { S11(c2,2,c6) ; } for (c6=1;c6<=M-1;c6++) { S10(c2,2,c6) ; } } } if ((M >= 2) && (N == 2)) { for (c2=1;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S6(c2,1,c6) ; S7(c2,1,c6) ; } for (c6=1;c6<=M;c6++) { S3(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S11(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S10(c2,1,c6) ; } } } if ((M == 1) && (N >= 3)) { for (c2=1;c2<=O-1;c2++) { for (c4=-1;c4<=0;c4++) { if ((c4+1)%2 == 0) { j = (c4+3)/2 ; S1(c2,(c4+3)/2,1) ; } } for (c4=1;c4<=2*N-5;c4++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S3(c2,(c4+1)/2,1) ; } if ((c4+1)%2 == 0) { j = (c4+3)/2 ; S1(c2,(c4+3)/2,1) ; } } for (c4=2*N-4;c4<=2*N-3;c4++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S3(c2,(c4+1)/2,1) ; } } } } if ((M == 1) && (N == 2)) { for (c2=1;c2<=O-1;c2++) { S1(c2,1,1) ; S3(c2,1,1) ; } } if ((M >= 2) && (N >= 3)) { for (c2=1;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S2(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S8(c2,1,c6) ; } for (c4=3;c4<=2*N-2;c4++) { for (c6=1;c6<=M;c6++) { if (c4%2 == 0) { S2(c2,c4/2,c6) ; } } for (c6=1;c6<=M-1;c6++) { if (c4%2 == 0) { S8(c2,c4/2,c6) ; } } for (c6=1;c6<=M-1;c6++) { if ((c4+1)%2 == 0) { j = (c4-1)/2 ; S9(c2,(c4-1)/2,c6) ; } } } c4 = 2*N-1 ; for (c6=1;c6<=M-1;c6++) { j = N-1 ; S9(c2,N-1,c6) ; } } } if ((M >= 2) && (N == 2)) { for (c2=1;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S2(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S8(c2,1,c6) ; } for (c6=1;c6<=M-1;c6++) { S9(c2,1,c6) ; } } } if ((M == 1) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=2;c4<=2*N-2;c4++) { if (c4%2 == 0) { S2(c2,c4/2,1) ; } } } } if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S4(c2,c4,c6) ; } } } } if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S5(c2,c4,c6) ; } } } } if ((M >= P+1) && (N >= Q+1)) { for (c2=R;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S12(c2,c4,c6) ; } } } } if ((M >= 2) && (N >= Q+1)) { for (c2=R;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S13(c2,c4,c6) ; } } } } if ((M >= P+1) && (N >= 2)) { for (c2=R;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S14(c2,c4,c6) ; } } } } if ((M >= 2) && (N >= 2)) { for (c2=R;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S15(c2,c4,c6) ; } } } } } cloog-0.18.2/test/reservoir/pingali2.cloog0000775000175000017500000000221612254312305015362 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 2 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 0 # Scattering functions 2 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 6 10 0 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam2.c0000664000175000017500000000054312254312305014404 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ for (c2=1;c2<=M;c2++) { S1(c2) ; } if (N >= 2) { for (c2=1;c2<=M;c2++) { for (c4=2;c4<=N;c4++) { S2(c2,c4) ; } } } if (N >= 2) { for (c2=1;c2<=M;c2++) { for (c4=1;c4<=N-1;c4++) { S3(c2,c4) ; } } } cloog-0.18.2/test/reservoir/mg-psinv.c0000664000175000017500000000162112254312305014530 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/mg-psinv.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.02s. */ if ((M >= 1) && (N >= 3) && (O >= 3)) { if (M >= 3) { for (c2=2;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,2,c6); S2(c2,2,c6); } for (c4=4;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { S1(c2,(c4+1)/2,c6); S2(c2,(c4+1)/2,c6); } } for (c6=2;c6<=M-1;c6++) { if (c4%2 == 0) { S3(c2,c4/2,c6); } } } for (c6=2;c6<=M-1;c6++) { S3(c2,N-1,c6); } } } if (M <= 2) { for (c2=2;c2<=O-1;c2++) { for (c4=3;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { S1(c2,(c4+1)/2,c6); S2(c2,(c4+1)/2,c6); } } } } } } cloog-0.18.2/test/reservoir/tang-xue1.cloog0000664000175000017500000000332012254312305015460 00000000000000# # Example 1 in "Generating Efficient Tiled Code for Distributed Memory # Machines", Peiyi Tang and Jingling Xue. # # for (int i = 1; i <= 9; i++) { # for (int j = 1; j <= 4; j++) { # A[i,2*j] = A[i,2*j-2] + A[i-1,2*j-2]; # } # } # # We tile it with a tiling matrix H = [1/2 0] # [-1/2 1/2] # # We get: # # for (int i = 0; i <= 9; i += 2) { # for (int j = max(-1, -9 + i); j <= min(4, 3 + i); j++) { # for (int k = max(1, i, i-j); k <= min(4 + i -j, 1 + i, 9); k++) { # for (int l = max(-i + j + k, 1); l <= min(4, 1 -i + j + k); l++) { # if (i % 2 == 0) { # if ((i + j) % 2 == 0) { # A[k, 2 * l] = A[k, -2 + 2 * l] + A[-1 + k, -2 + 2 * l]; # } # } # } # } # } # } # # language: C c # parameter (none) 1 2 # 1 1 1 0 1 # number of statements 1 # -2i-2j -l +4 >= 0 # -k +l >= 0 # -2i -k +9 >= 0 # k >= 0 # 2i +k -1 >= 0 # k -l +1 >= 0 # -k +1 >= 0 # 2i+2j +l-1 >= 0 8 6 # i j k l 1 1 -2 -2 0 -1 4 1 0 0 -1 1 0 1 -2 0 -1 0 9 1 0 0 1 0 0 1 2 0 1 0 -1 1 0 0 1 -1 1 1 0 0 -1 0 1 1 2 2 0 1 -1 0 0 0 0 1 # Scattering functions 9 15 # alpha=[2i, 2i+2j, 2i+k, 2i+2j+l] gamma=[0, 0, 0, 0] beta=[0, 0, 0, 0, 0, 0] # c1 c2 c3 c4 c5 c6 c7 c8 c9 i j k l 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 2 2 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 2 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 2 2 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 cloog-0.18.2/test/reservoir/lim-lam4.cloog0000775000175000017500000000333112254312305015270 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 2 1 # { (i,j,k,l) | i-1 >= 0, -i+l-1 >= 0, j >= 0, k >= 0, -j-k+l-1 >= 0, 1 >= 0 } 6 6 1 1 0 0 0 -1 1 -1 0 0 1 -1 1 0 1 0 0 0 1 0 0 1 0 0 1 0 -1 -1 1 -1 1 0 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i-1 >= 0, -i+l-1 >= 0, j >= 0, -j+k-1 >= 0, -k+l-1 >= 0, 1 >= 0 } 6 6 1 1 0 0 0 -1 1 -1 0 0 1 -1 1 0 1 0 0 0 1 0 -1 1 0 -1 1 0 0 -1 1 -1 1 0 0 0 0 1 0 0 0 0 # Scattering functions 2 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 -1 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/fusion2.c0000664000175000017500000000056712254312305014365 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/fusion2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ if ((M >= 1) && (N >= 1)) { for (c4=1;c4<=M;c4++) { S1(1,c4) ; } for (c2=2;c2<=N;c2++) { for (c4=1;c4<=M;c4++) { S2(c2-1,c4) ; } for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c4=1;c4<=M;c4++) { S2(N,c4) ; } } cloog-0.18.2/test/reservoir/fusion1.c0000664000175000017500000000034612254312305014357 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/fusion1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (c2=0;c2<=M;c2++) { S1(c2) ; } for (c2=1;c2<=M;c2++) { S2(c2) ; } for (c2=0;c2<=M;c2++) { S3(c2) ; } cloog-0.18.2/test/reservoir/lim-lam1.good.c0000664000175000017500000000247212254312305015335 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test() { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; S1(1,100) ; for (c2=-98;c2<=0;c2++) { c4 = -2*c2+2 ; j = -c2+1 ; S1(1,-c2+1) ; for (c4=-2*c2+3;c4<=199;c4++) { if (c4%2 == 0) { i = (2*c2+c4)/2 ; S1((2*c2+c4)/2,c4/2) ; } if ((c4+1)%2 == 0) { i = (2*c2+c4-1)/2 ; j = (c4+1)/2 ; S2((2*c2+c4-1)/2,(c4+1)/2) ; } } i = c2+100 ; S1(c2+100,100) ; } for (c2=1;c2<=99;c2++) { S2(c2,1) ; for (c4=2;c4<=-2*c2+200;c4++) { if (c4%2 == 0) { i = (2*c2+c4)/2 ; S1((2*c2+c4)/2,c4/2) ; } if ((c4+1)%2 == 0) { i = (2*c2+c4-1)/2 ; j = (c4+1)/2 ; S2((2*c2+c4-1)/2,(c4+1)/2) ; } } c4 = -2*c2+201 ; j = -c2+101 ; S2(100,-c2+101) ; } S2(100,1) ; } cloog-0.18.2/test/reservoir/mg-interp.c0000664000175000017500000001012012254312305014664 00000000000000/* Generated from ../../../git/cloog/test/reservoir/mg-interp.cloog by CLooG 0.16.2-5-g590827b gmp bits in 0.29s. */ if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,1,c6); } if (N == 2) { for (c6=1;c6<=M-1;c6++) { S6(c2,1,c6); S7(c2,1,c6); } } if (N >= 3) { for (c6=1;c6<=M-1;c6++) { S6(c2,1,c6); S7(c2,1,c6); } } if (N == 2) { for (c6=1;c6<=M;c6++) { S3(c2,1,c6); } } if (N == 2) { for (c6=1;c6<=M-1;c6++) { S11(c2,1,c6); } } if (N >= 3) { for (c6=1;c6<=M;c6++) { S3(c2,1,c6); } for (c6=1;c6<=M;c6++) { S1(c2,2,c6); } } if (N == 3) { for (c6=1;c6<=M-1;c6++) { S6(c2,2,c6); S7(c2,2,c6); } for (c6=1;c6<=M-1;c6++) { S11(c2,1,c6); } } if (N >= 4) { for (c6=1;c6<=M-1;c6++) { S6(c2,2,c6); S7(c2,2,c6); } for (c6=1;c6<=M-1;c6++) { S11(c2,1,c6); } } for (c4=3;c4<=2*N-5;c4++) { for (c6=1;c6<=M-1;c6++) { if ((c4+1)%2 == 0) { S10(c2,(c4-1)/2,c6); } } for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { S3(c2,(c4+1)/2,c6); } } for (c6=1;c6<=M-1;c6++) { if (c4%2 == 0) { S6(c2,(c4+2)/2,c6); } if ((c4+1)%2 == 0) { S1(c2,(c4+3)/2,c6); } if (c4%2 == 0) { S7(c2,(c4+2)/2,c6); } } if ((c4+1)%2 == 0) { S1(c2,(c4+3)/2,M); } for (c6=1;c6<=M-1;c6++) { if (c4%2 == 0) { S11(c2,c4/2,c6); } } } if (N >= 4) { for (c6=1;c6<=M-1;c6++) { S6(c2,N-1,c6); S7(c2,N-1,c6); } for (c6=1;c6<=M-1;c6++) { S11(c2,N-2,c6); } } if (N >= 3) { for (c6=1;c6<=M-1;c6++) { S10(c2,N-2,c6); } for (c6=1;c6<=M;c6++) { S3(c2,N-1,c6); } } if (N >= 3) { for (c6=1;c6<=M-1;c6++) { S11(c2,N-1,c6); } } for (c6=1;c6<=M-1;c6++) { S10(c2,N-1,c6); } } } if ((M == 1) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { S1(c2,1,1); for (c4=1;c4<=2*N-5;c4++) { if ((c4+1)%2 == 0) { S3(c2,(c4+1)/2,1); } if ((c4+1)%2 == 0) { S1(c2,(c4+3)/2,1); } } S3(c2,N-1,1); } } if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S2(c2,1,c6); } for (c6=1;c6<=M-1;c6++) { S8(c2,1,c6); } for (c4=3;c4<=2*N-2;c4++) { for (c6=1;c6<=M;c6++) { if (c4%2 == 0) { S2(c2,c4/2,c6); } } for (c6=1;c6<=M-1;c6++) { if (c4%2 == 0) { S8(c2,c4/2,c6); } } for (c6=1;c6<=M-1;c6++) { if ((c4+1)%2 == 0) { S9(c2,(c4-1)/2,c6); } } } for (c6=1;c6<=M-1;c6++) { S9(c2,N-1,c6); } } } if ((M == 1) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=2;c4<=2*N-2;c4++) { if (c4%2 == 0) { S2(c2,c4/2,1); } } } } if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S4(c2,c4,c6); } } } } if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S5(c2,c4,c6); } } } } if ((M >= P+1) && (N >= Q+1)) { for (c2=R;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S12(c2,c4,c6); } } } } if ((M >= 2) && (N >= Q+1)) { for (c2=R;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S13(c2,c4,c6); } } } } if ((M >= P+1) && (N >= 2)) { for (c2=R;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S14(c2,c4,c6); } } } } if ((M >= 2) && (N >= 2)) { for (c2=R;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S15(c2,c4,c6); } } } } cloog-0.18.2/test/reservoir/pingali6.cloog0000775000175000017500000000376712254312305015402 00000000000000# Language c # Context 3 4 1 1 0 -1 1 0 1 -1 1 0 0 1 0 # Number of statments 2 1 # { (i,j,k,l,m) | i-1 >= 0, -i+l >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+m-1 >= 0, 1 >= 0 } 7 7 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 1 0 0 0 -2 1 0 -1 0 0 1 -1 1 0 0 1 0 0 -2 1 0 0 -1 0 1 -1 1 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m) | i-1 >= 0, -i+l >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+m-1 >= 0, 1 >= 0 } 7 7 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 1 0 0 0 -2 1 0 -1 0 0 1 -1 1 0 0 1 0 0 -2 1 0 0 -1 0 1 -1 1 0 0 0 0 0 1 0 0 0 0 # Scattering functions 2 8 14 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -2 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 8 14 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -2 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/cholesky2.c0000664000175000017500000000127612254312305014701 00000000000000/* Generated from ../../../git/cloog/test/reservoir/cholesky2.cloog by CLooG 0.14.0-283-g7c18f7a gmp bits in 0.04s. */ if (M >= 1) { if (M >= 2) { S1(1); } for (c2=2;c2<=min(3,M);c2++) { S2(1,c2); } if (M == 1) { S1(1); } for (c2=4;c2<=3*M-4;c2++) { if ((c2+1)%3 == 0) { S1((c2+1)/3); } for (c4=ceild(c2+2,3);c4<=min(M,c2-2);c4++) { for (c6=ceild(c2-c4+2,2);c6<=min(c4,c2-c4);c6++) { S3(c2-c4-c6+1,c4,c6); } } for (c4=ceild(c2+4,3);c4<=min(M,c2);c4++) { if ((c2+c4)%2 == 0) { S2((c2-c4+2)/2,c4); } } } for (c2=max(2*M,3*M-3);c2<=3*M-2;c2++) { S3(c2-2*M+1,M,M); } if (M >= 2) { S1(M); } } cloog-0.18.2/test/reservoir/loechner5.c0000664000175000017500000000046512254312305014661 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/loechner5.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ if (M >= 1) { for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { for (c6=1;c6<=M;c6++) { for (c8=1;c8<=M;c8++) { S1(c4,c6,c2,c8) ; } } } } } cloog-0.18.2/test/reservoir/loechner4.c0000664000175000017500000000051612254312305014655 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/loechner4.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ if (M >= 1) { for (c2=2;c2<=2*M;c2++) { for (c4=1;c4<=M;c4++) { for (c6=1;c6<=M;c6++) { for (c8=max(1,c2-M);c8<=min(M,c2-1);c8++) { S1(c6,c4,c8,c2-c8) ; } } } } } cloog-0.18.2/test/reservoir/bastoul3.c0000664000175000017500000000032512254312305014524 00000000000000/* Generated from ../../../git/cloog/test/reservoir/bastoul3.cloog by CLooG 0.16.3 gmp bits in 0.01s. */ for (i=3;i<=9;i++) { for (j=max(i-6,i-2*floord(i+1,2)+2);j<=min(3,i-2);j+=2) { S1(i,j,(i-j)/2); } } cloog-0.18.2/test/reservoir/pingali2.good.c0000664000175000017500000000134712254312305015431 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c2,c4) ; } } } cloog-0.18.2/test/reservoir/pingali1.c0000664000175000017500000000075512254312305014503 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/pingali1.cloog by CLooG 0.14.0-225-g6e2d019 gmp bits in 0.01s. */ if ((M >= 1) && (N >= 1)) { if (N >= 2) { for (c2=1;c2<=M;c2++) { S2(c2,1); for (c4=3;c4<=2*N-1;c4++) { for (c6=max(1,c4-N);c6<=floord(c4-1,2);c6++) { S1(c2,c4-c6,c6); } if ((c4+1)%2 == 0) { S2(c2,(c4+1)/2); } } } } if (N == 1) { for (c2=1;c2<=M;c2++) { S2(c2,1); } } } cloog-0.18.2/test/reservoir/pingali5.c0000664000175000017500000000107312254312305014501 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/pingali5.cloog by CLooG 0.14.0-225-g6e2d019 gmp bits in 0.02s. */ if (M >= 2) { for (c2=3;c2<=2*M-3;c2++) { for (c4=ceild(c2+3,2);c4<=M;c4++) { for (i=ceild(c2+1,2);i<=min(c2-1,c4-1);i++) { S1(i,c2-i,c4); } } for (c4=max(1,c2-M);c4<=floord(c2-1,2);c4++) { S2(c2-c4,c4); } for (c4=ceild(c2+3,2);c4<=M;c4++) { for (i=ceild(c2+1,2);i<=min(c2-1,c4-1);i++) { S3(i,c2-i,c4); } } } for (c2=max(M+1,2*M-2);c2<=2*M-1;c2++) { S2(M,c2-M); } } cloog-0.18.2/test/reservoir/loechner5.cloog0000775000175000017500000000254412254312305015545 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 1 1 # { (i,j,k,l,m) | i-1 >= 0, -i+m >= 0, j-1 >= 0, -j+m >= 0, k-1 >= 0, -k+m >= 0, l-1 >= 0, -l+m >= 0, 1 >= 0 } 9 7 1 1 0 0 0 0 -1 1 -1 0 0 0 1 0 1 0 1 0 0 0 -1 1 0 -1 0 0 1 0 1 0 0 1 0 0 -1 1 0 0 -1 0 1 0 1 0 0 0 1 0 -1 1 0 0 0 -1 1 0 1 0 0 0 0 0 1 0 0 0 0 # Scattering functions 1 10 16 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/jacobi3.c0000664000175000017500000000120112254312305014274 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/jacobi3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ if ((M >= 1) && (N >= 3)) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S1(1,c4,c6) ; } } for (c2=3;c2<=2*M;c2++) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if (c2%2 == 0) { S1(c2/2,c4,c6) ; } } } for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if ((c2+1)%2 == 0) { S2((c2-1)/2,c4,c6) ; } } } } for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S2(M,c4,c6) ; } } } cloog-0.18.2/test/reservoir/mg-interp2.good.c0000664000175000017500000000274212254312305015710 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/mg-interp2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.07s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } #define S4(i,j,k) { hash(4); hash(i); hash(j); hash(k); } void test(int M, int N, int O, int P, int Q, int R, int S, int T, int U) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if ((M >= P+1) && (N >= Q+1)) { for (c2=1;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S1(c2,c4,c6) ; } } } } if ((M >= 2) && (N >= Q+1)) { for (c2=1;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S2(c2,c4,c6) ; } } } } if ((M >= P+1) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S3(c2,c4,c6) ; } } } } if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S4(c2,c4,c6) ; } } } } } cloog-0.18.2/test/reservoir/lim-lam3.good.c0000664000175000017500000000335412254312305015337 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.04s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } #define S4(i) { hash(4); hash(i); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; for (c2=5;c2<=min(5*M,8);c2++) { if (c2%5 == 0) { S4(c2/5) ; } } for (c2=9;c2<=min(13,5*M-1);c2++) { for (c4=max(1,ceild(c2-M-3,4));c4<=floord(c2-4,5);c4++) { i = c2-4*c4-3 ; S2(c2-4*c4-3,c4) ; } if (c2%5 == 0) { S4(c2/5) ; } for (c4=max(1,ceild(c2-3*M-1,2));c4<=floord(c2-4,5);c4++) { if ((c2+c4+2)%3 == 0) { i = (c2-2*c4-1)/3 ; S3((c2-2*c4-1)/3,c4) ; } } } for (c2=14;c2<=5*M-1;c2++) { for (c4=max(2,ceild(c2-M-3,4));c4<=min(M-1,floord(c2-8,3));c4++) { for (c6=max(1,ceild(c2-2*c4-M-5,2));c6<=min(c4-1,floord(c2-3*c4-6,2));c6++) { i = c2-2*c4-2*c6-5 ; S1(c2-2*c4-2*c6-5,c4,c6) ; } } for (c4=max(ceild(c2-M-3,4),1);c4<=floord(c2-4,5);c4++) { i = c2-4*c4-3 ; S2(c2-4*c4-3,c4) ; } if (c2%5 == 0) { S4(c2/5) ; } for (c4=max(ceild(c2-3*M-1,2),1);c4<=floord(c2-4,5);c4++) { if ((c2+c4+2)%3 == 0) { i = (c2-2*c4-1)/3 ; S3((c2-2*c4-1)/3,c4) ; } } } if (M >= 2) { c2 = 5*M ; S4(M) ; } } cloog-0.18.2/test/reservoir/bastoul3.cloog0000664000175000017500000000055612254312305015413 00000000000000# Figure 4 from "Efficient code generation for automatic parallelization # and optimization". # # Language c # Context 1 2 1 1 0 # Number of statements 1 1 # i' i j 1 6 5 0 1 -1 -2 0 1 0 1 0 -1 1 0 -1 0 3 1 0 0 1 -1 1 0 0 -1 3 1 0 0 0 1 0 0 0 0 0 cloog-0.18.2/test/reservoir/lim-lam6.c0000664000175000017500000000045412254312305014411 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam6.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (M >= 1) { for (c2=0;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=0;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c4,c2) ; } } } cloog-0.18.2/test/reservoir/stride2.c0000664000175000017500000000026712254312305014351 00000000000000/* Generated from ../../../git/cloog/test/reservoir/stride2.cloog by CLooG 0.16.1-2-g0ae5c85 gmp bits in 0.00s. */ if (M >= 2) { for (c2=2;c2<=M;c2+=7) { S1(c2,(c2-2)/7); } } cloog-0.18.2/test/reservoir/pingali5.cloog0000775000175000017500000000445512254312305015374 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 3 1 # { (i,j,k,l) | j-1 >= 0, i-j-1 >= 0, -i+k-1 >= 0, -k+l >= 0, 1 >= 0 } 5 6 1 0 1 0 0 -1 1 1 -1 0 0 -1 1 -1 0 1 0 -1 1 0 0 -1 1 0 1 0 0 0 0 1 0 0 0 1 # { (i,j,k) | -i+k >= 0, j-1 >= 0, i-j-1 >= 0, 1 >= 0 } 4 5 1 -1 0 1 0 1 0 1 0 -1 1 1 -1 0 -1 1 0 0 0 1 0 0 0 1 # { (i,j,k,l) | j-1 >= 0, i-j-1 >= 0, -i+k-1 >= 0, -k+l >= 0, 1 >= 0 } 5 6 1 0 1 0 0 -1 1 1 -1 0 0 -1 1 -1 0 1 0 -1 1 0 0 -1 1 0 1 0 0 0 0 1 0 0 0 0 # Scattering functions 3 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/stride2.cloog0000664000175000017500000000126712254312305015233 00000000000000# # Stride-bug: # # for (i = 2; i <= N; i+=7) { # S(i); # # becomes: # # for (i = 5; i <= N; i+=7) { # S(i); # Language c # Context 1 3 1 0 1 0 # Number of statements 1 1 4 5 0 1 -7 0 -2 # i - 7j = 2 1 1 0 0 0 # i >= 0 1 -1 0 1 0 # i <= n 1 0 0 0 1 0 0 0 0 # Scattering functions 1 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/jacobi3.cloog0000775000175000017500000000371512254312305015174 00000000000000# Language c # Context 1 4 1 0 0 1 0 # Number of statments 2 1 # { (i,j,k,l,m) | i-1 >= 0, -i+l >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+m-1 >= 0, 1 >= 0 } 7 7 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 1 0 0 0 -2 1 0 -1 0 0 1 -1 1 0 0 1 0 0 -2 1 0 0 -1 0 1 -1 1 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m) | i-1 >= 0, -i+l >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+m-1 >= 0, 1 >= 0 } 7 7 1 1 0 0 0 0 -1 1 -1 0 0 1 0 0 1 0 1 0 0 0 -2 1 0 -1 0 0 1 -1 1 0 0 1 0 0 -2 1 0 0 -1 0 1 -1 1 0 0 0 0 0 1 0 0 0 0 # Scattering functions 2 8 14 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -2 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 8 14 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -2 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam4.c0000664000175000017500000000075012254312305014406 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam4.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.04s. */ if (M >= 2) { S1(1,0,0) ; for (c2=2;c2<=2*M-2;c2++) { for (c4=max(-M+1,-c2+1);c4<=-1;c4++) { for (i=max(1,c2-M+1);i<=min(M-1,c2+c4);i++) { S1(i,c2+c4-i,-c4) ; } for (c6=max(-c4,c2-M+1);c6<=min(M-1,c2-1);c6++) { S2(c2-c6,c4+c6,c6) ; } } for (i=max(1,c2-M+1);i<=min(c2,M-1);i++) { S1(i,c2-i,0) ; } } } cloog-0.18.2/test/reservoir/pingali3.good.c0000664000175000017500000000144412254312305015430 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { for (c6=1;c6<=M;c6++) { S2(c2,c4,c6) ; } } } } cloog-0.18.2/test/reservoir/mg-rprj3.c0000664000175000017500000000205112254312305014427 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/mg-rprj3.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.10s. */ if ((M >= 2) && (N >= 3) && (O >= 3)) { if (M >= 3) { for (c2=2;c2<=O-1;c2++) { for (c6=2;c6<=M;c6++) { S1(c2,2,c6); } for (c4=3;c4<=N-1;c4++) { for (c6=2;c6<=M;c6++) { S2(c2,c4-1,c6); } S4(c2,c4-1,2); for (c6=2;c6<=M-2;c6++) { S3(c2,c4-1,c6); S5(c2,c4-1,c6); S4(c2,c4-1,c6+1); } S3(c2,c4-1,M-1); S5(c2,c4-1,M-1); for (c6=2;c6<=M;c6++) { S1(c2,c4,c6); } } for (c6=2;c6<=M;c6++) { S2(c2,N-1,c6); } S4(c2,N-1,2); for (c6=2;c6<=M-2;c6++) { S3(c2,N-1,c6); S5(c2,N-1,c6); S4(c2,N-1,c6+1); } S3(c2,N-1,M-1); S5(c2,N-1,M-1); } } if (M == 2) { for (c2=2;c2<=O-1;c2++) { S1(c2,2,2); for (c4=3;c4<=N-1;c4++) { S2(c2,c4-1,2); S1(c2,c4,2); } S2(c2,N-1,2); } } } cloog-0.18.2/test/reservoir/mg-rprj3.good.c0000664000175000017500000000706212254312305015365 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/mg-rprj3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.39s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } #define S4(i,j,k) { hash(4); hash(i); hash(j); hash(k); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } void test(int M, int N, int O, int P, int Q, int R) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if ((M >= 4) && (N >= 4)) { for (c2=2;c2<=O-1;c2++) { for (c6=2;c6<=M;c6++) { S1(c2,2,c6) ; } for (c4=3;c4<=N-1;c4++) { for (c6=2;c6<=M;c6++) { j = c4-1 ; S2(c2,c4-1,c6) ; } j = c4-1 ; S4(c2,c4-1,2) ; for (c6=2;c6<=M-2;c6++) { j = c4-1 ; S3(c2,c4-1,c6) ; j = c4-1 ; S5(c2,c4-1,c6) ; j = c4-1 ; k = c6+1 ; S4(c2,c4-1,c6+1) ; } c6 = M-1 ; j = c4-1 ; k = M-1 ; S3(c2,c4-1,M-1) ; j = c4-1 ; k = M-1 ; S5(c2,c4-1,M-1) ; for (c6=2;c6<=M;c6++) { S1(c2,c4,c6) ; } } for (c6=2;c6<=M;c6++) { j = N-1 ; S2(c2,N-1,c6) ; } j = N-1 ; S4(c2,N-1,2) ; for (c6=2;c6<=M-2;c6++) { j = N-1 ; S3(c2,N-1,c6) ; j = N-1 ; S5(c2,N-1,c6) ; j = N-1 ; k = c6+1 ; S4(c2,N-1,c6+1) ; } c6 = M-1 ; j = N-1 ; k = M-1 ; S3(c2,N-1,M-1) ; j = N-1 ; k = M-1 ; S5(c2,N-1,M-1) ; } } if ((M >= 4) && (N == 3)) { for (c2=2;c2<=O-1;c2++) { for (c6=2;c6<=M;c6++) { S1(c2,2,c6) ; } for (c6=2;c6<=M;c6++) { S2(c2,2,c6) ; } S4(c2,2,2) ; for (c6=2;c6<=M-2;c6++) { S3(c2,2,c6) ; S5(c2,2,c6) ; k = c6+1 ; S4(c2,2,c6+1) ; } c6 = M-1 ; k = M-1 ; S3(c2,2,M-1) ; k = M-1 ; S5(c2,2,M-1) ; } } if ((M == 3) && (N == 3)) { for (c2=2;c2<=O-1;c2++) { for (c6=2;c6<=3;c6++) { S1(c2,2,c6) ; } for (c6=2;c6<=3;c6++) { S2(c2,2,c6) ; } S4(c2,2,2) ; S3(c2,2,2) ; S5(c2,2,2) ; } } if ((M == 3) && (N >= 4)) { for (c2=2;c2<=O-1;c2++) { for (c6=2;c6<=3;c6++) { S1(c2,2,c6) ; } for (c4=3;c4<=N-1;c4++) { for (c6=2;c6<=3;c6++) { j = c4-1 ; S2(c2,c4-1,c6) ; } j = c4-1 ; S4(c2,c4-1,2) ; j = c4-1 ; S3(c2,c4-1,2) ; j = c4-1 ; S5(c2,c4-1,2) ; for (c6=2;c6<=3;c6++) { S1(c2,c4,c6) ; } } for (c6=2;c6<=3;c6++) { j = N-1 ; S2(c2,N-1,c6) ; } j = N-1 ; S4(c2,N-1,2) ; j = N-1 ; S3(c2,N-1,2) ; j = N-1 ; S5(c2,N-1,2) ; } } if ((M == 2) && (N >= 4)) { for (c2=2;c2<=O-1;c2++) { S1(c2,2,2) ; for (c4=3;c4<=N-1;c4++) { j = c4-1 ; S2(c2,c4-1,2) ; S1(c2,c4,2) ; } j = N-1 ; S2(c2,N-1,2) ; } } if ((M == 2) && (N == 3)) { for (c2=2;c2<=O-1;c2++) { S1(c2,2,2) ; S2(c2,2,2) ; } } } cloog-0.18.2/test/reservoir/mg-psinv.good.c0000664000175000017500000000336512254312305015466 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/mg-psinv.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.05s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } void test(int M, int N, int O) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if ((M >= 3) && (N >= 4)) { for (c2=2;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,2,c6) ; S2(c2,2,c6) ; } for (c4=4;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S1(c2,(c4+1)/2,c6) ; S2(c2,(c4+1)/2,c6) ; } } for (c6=2;c6<=M-1;c6++) { if (c4%2 == 0) { S3(c2,c4/2,c6) ; } } } c4 = 2*N-2 ; for (c6=2;c6<=M-1;c6++) { j = N-1 ; S3(c2,N-1,c6) ; } } } if ((M >= 3) && (N == 3)) { for (c2=2;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,2,c6) ; S2(c2,2,c6) ; } for (c6=2;c6<=M-1;c6++) { S3(c2,2,c6) ; } } } if ((M >= 1) && (M <= 2) && (N >= 3)) { for (c2=2;c2<=O-1;c2++) { for (c4=3;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S1(c2,(c4+1)/2,c6) ; S2(c2,(c4+1)/2,c6) ; } } } } } } cloog-0.18.2/test/reservoir/pingali1.good.c0000664000175000017500000000212412254312305015422 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M, int N) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if (N >= 2) { for (c2=1;c2<=M;c2++) { for (c4=1;c4<=2;c4++) { if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S2(c2,(c4+1)/2) ; } } for (c4=3;c4<=2*N-1;c4++) { for (c6=max(1,c4-N);c6<=floord(c4-1,2);c6++) { j = c4-c6 ; S1(c2,c4-c6,c6) ; } if ((c4+1)%2 == 0) { j = (c4+1)/2 ; S2(c2,(c4+1)/2) ; } } } } if (N == 1) { for (c2=1;c2<=M;c2++) { S2(c2,1) ; } } } cloog-0.18.2/test/reservoir/lim-lam2.cloog0000775000175000017500000000337212254312305015273 00000000000000# Language c # Context 3 4 1 1 0 -1 1 0 1 -1 1 0 0 1 0 # Number of statments 3 1 # { (i,j,k) | i-1 >= 0, -i+j >= 0, 1 >= 0 } 3 5 1 1 0 0 -1 1 -1 1 0 0 1 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i-1 >= 0, -i+k >= 0, j-2 >= 0, -j+l >= 0, 1 >= 0 } 5 6 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 1 0 0 -2 1 0 -1 0 1 0 1 0 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+l-1 >= 0, 1 >= 0 } 5 6 1 1 0 0 0 -1 1 -1 0 1 0 0 1 0 1 0 0 -1 1 0 -1 0 1 -1 1 0 0 0 0 1 0 0 0 0 # Scattering functions 3 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 6 11 0 1 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 6 11 0 1 0 0 0 0 0 0 0 0 -2 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -2 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/two.cloog0000664000175000017500000000045412254312305014465 00000000000000# Scan # D = { (i, j, k) | 0 <= i < 10, 1 <= j < 20, 2i + 3j = k, i + j + 3 = 3k } # # language: C c # parameter (none) 1 2 1 1 0 1 # Number of statements 1 6 5 # i j k 1 1 1 0 0 0 1 -1 0 0 10 1 0 1 0 -1 1 0 -1 0 20 0 2 3 -1 0 0 1 1 -1 3 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/reservoir/jacobi2.good.c0000664000175000017500000000115112254312305015226 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/jacobi2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; for (c2=0;c2<=M-1;c2++) { for (c4=0;c4<=M-1;c4++) { S1(c2,c4) ; } } } cloog-0.18.2/test/reservoir/liu-zhuge1.cloog0000775000175000017500000000350412254312305015650 00000000000000# Language c # Context 1 4 1 0 0 1 0 # Number of statments 3 1 # { (i,j,k,l) | i >= 0, -i+k >= 0, j >= 0, -j+l >= 0, 1 >= 0 } 5 6 1 1 0 0 0 0 1 -1 0 1 0 0 1 0 1 0 0 0 1 0 -1 0 1 0 1 0 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i >= 0, -i+k >= 0, j >= 0, -j+l >= 0, 1 >= 0 } 5 6 1 1 0 0 0 0 1 -1 0 1 0 0 1 0 1 0 0 0 1 0 -1 0 1 0 1 0 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i >= 0, -i+k >= 0, j >= 0, -j+l >= 0, 1 >= 0 } 5 6 1 1 0 0 0 0 1 -1 0 1 0 0 1 0 1 0 0 0 1 0 -1 0 1 0 1 0 0 0 0 1 0 0 0 0 # Scattering functions 3 6 11 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -3 -1 0 0 4 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 6 11 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -3 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 6 11 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -3 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/liu-zhuge1.good.c0000664000175000017500000000775412254312305015726 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/liu-zhuge1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.05s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } void test(int M, int N) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; if ((M >= 0) && (N >= 0)) { for (c2=-4;c2<=min(-1,3*M+N-4);c2++) { for (c4=max(0,c2-3*M+4);c4<=min(c2+4,N);c4++) { if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } } } if ((M <= 1) && (M >= 0)) { for (c2=0;c2<=3*M+N-4;c2++) { for (c4=max(c2-3*M,0);c4<=c2;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } } for (c4=c2-3*M+4;c4<=min(c2+4,N);c4++) { if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } for (c4=max(0,c2-3*M);c4<=c2;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S3((c2-c4)/3,c4) ; } } } } for (c2=0;c2<=min(3*M-4,N-1);c2++) { for (c4=0;c4<=c2;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } for (c4=c2+1;c4<=min(c2+4,N);c4++) { if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } for (c4=0;c4<=c2;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S3((c2-c4)/3,c4) ; } } } if (M >= 2) { for (c2=3*M-3;c2<=N-1;c2++) { for (c4=max(c2-3*M,0);c4<=c2-3*M+3;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } } for (c4=c2-3*M+4;c4<=c2;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } for (c4=c2+1;c4<=min(c2+4,N);c4++) { if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } for (c4=max(0,c2-3*M);c4<=c2;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S3((c2-c4)/3,c4) ; } } } } if (N >= 0) { for (c2=N;c2<=3*M-4;c2++) { for (c4=0;c4<=N;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } for (c4=0;c4<=N;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S3((c2-c4)/3,c4) ; } } } } for (c2=max(3*M-3,N);c2<=3*M+N-4;c2++) { for (c4=max(c2-3*M,0);c4<=c2-3*M+3;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } } for (c4=c2-3*M+4;c4<=N;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } if ((c2+2*c4+1)%3 == 0) { i = (c2-c4+4)/3 ; S1((c2-c4+4)/3,c4) ; } } for (c4=max(0,c2-3*M);c4<=N;c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S3((c2-c4)/3,c4) ; } } } if ((M >= 0) && (N >= 0)) { for (c2=max(3*M+N-3,0);c2<=3*M+N;c2++) { for (c4=max(0,c2-3*M);c4<=min(c2,N);c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S2((c2-c4)/3,c4) ; } } for (c4=max(0,c2-3*M);c4<=min(c2,N);c4++) { if ((c2+2*c4)%3 == 0) { i = (c2-c4)/3 ; S3((c2-c4)/3,c4) ; } } } } } cloog-0.18.2/test/reservoir/cholesky2.good.c0000664000175000017500000000337712254312305015634 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/cholesky2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.05s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; for (c2=2;c2<=min(3,3*M-4);c2++) { if ((c2+1)%3 == 0) { i = (c2+1)/3 ; S1((c2+1)/3) ; } for (c4=ceild(c2+4,3);c4<=min(c2,M);c4++) { if ((c2+c4)%2 == 0) { i = (c2-c4+2)/2 ; S2((c2-c4+2)/2,c4) ; } } } for (c2=4;c2<=3*M-4;c2++) { if ((c2+1)%3 == 0) { i = (c2+1)/3 ; S1((c2+1)/3) ; } for (c4=ceild(c2+2,3);c4<=min(c2-2,M);c4++) { for (c6=ceild(c2-c4+2,2);c6<=min(c2-c4,c4);c6++) { i = c2-c4-c6+1 ; S3(c2-c4-c6+1,c4,c6) ; } } for (c4=ceild(c2+4,3);c4<=min(M,c2);c4++) { if ((c2+c4)%2 == 0) { i = (c2-c4+2)/2 ; S2((c2-c4+2)/2,c4) ; } } } for (c2=max(2,3*M-3);c2<=min(3,3*M-2);c2++) { if ((c2+1)%3 == 0) { i = (c2+1)/3 ; S1((c2+1)/3) ; } } for (c2=max(3*M-3,4);c2<=3*M-2;c2++) { if ((c2+1)%3 == 0) { i = (c2+1)/3 ; S1((c2+1)/3) ; } for (c4=ceild(c2+2,3);c4<=min(M,c2-2);c4++) { for (c6=ceild(c2-c4+2,2);c6<=min(c2-c4,c4);c6++) { i = c2-c4-c6+1 ; S3(c2-c4-c6+1,c4,c6) ; } } } if (M >= 1) { c2 = 3*M-1 ; S1(M) ; } } cloog-0.18.2/test/reservoir/mg-interp2.c0000664000175000017500000000153612254312305014761 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/mg-interp2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.11s. */ if (O >= 2) { if ((M >= P+1) && (N >= Q+1)) { for (c2=1;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S1(c2,c4,c6) ; } } } } if ((M >= 2) && (N >= Q+1)) { for (c2=1;c2<=O-1;c2++) { for (c4=Q;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S2(c2,c4,c6) ; } } } } if ((M >= P+1) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=P;c6<=M-1;c6++) { S3(c2,c4,c6) ; } } } } if ((M >= 2) && (N >= 2)) { for (c2=1;c2<=O-1;c2++) { for (c4=1;c4<=N-1;c4++) { for (c6=1;c6<=M-1;c6++) { S4(c2,c4,c6) ; } } } } } cloog-0.18.2/test/reservoir/QR.c0000664000175000017500000000404612254312305013316 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/QR.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.21s. */ if (N >= 1) { S1(0) ; if ((M >= 1) && (N == 1)) { for (c4=0;c4<=M-1;c4++) { S2(0,c4) ; } S3(0) ; for (c4=0;c4<=M-1;c4++) { S4(0,c4) ; } S10(0) ; S5(0) ; } if ((M <= 0) && (N == 1)) { S3(0) ; S10(0) ; S5(0) ; } if ((M >= 1) && (N >= 2)) { for (c4=0;c4<=M-1;c4++) { S2(0,c4) ; } S3(0) ; for (c4=0;c4<=M-1;c4++) { S4(0,c4) ; } S10(0) ; S1(1) ; S5(0) ; } if ((M <= 0) && (N >= 2)) { S3(0) ; S10(0) ; S1(1) ; S5(0) ; } for (c2=2;c2<=min(M,N-1);c2++) { for (c4=c2-1;c4<=N-1;c4++) { S6(c2-2,c4) ; for (c6=c2-2;c6<=M-1;c6++) { S7(c2-2,c4,c6) ; } S8(c2-2,c4) ; for (c6=c2-2;c6<=M-1;c6++) { S9(c2-2,c4,c6) ; } } for (c4=c2-1;c4<=M-1;c4++) { S2(c2-1,c4) ; } S3(c2-1) ; for (c4=c2-1;c4<=M-1;c4++) { S4(c2-1,c4) ; } S10(c2-1) ; S1(c2) ; S5(c2-1) ; } if ((M >= 1) && (M <= N-2)) { for (c4=M;c4<=N-1;c4++) { S6(M-1,c4) ; S7(M-1,c4,M-1) ; S8(M-1,c4) ; S9(M-1,c4,M-1) ; } S3(M) ; S10(M) ; S1(M+1) ; S5(M) ; } for (c2=max(2,M+2);c2<=N-1;c2++) { for (c4=c2-1;c4<=N-1;c4++) { S6(c2-2,c4) ; S8(c2-2,c4) ; } S3(c2-1) ; S10(c2-1) ; S1(c2) ; S5(c2-1) ; } if ((M >= N) && (N >= 2)) { S6(N-2,N-1) ; for (c6=N-2;c6<=M-1;c6++) { S7(N-2,N-1,c6) ; } S8(N-2,N-1) ; for (c6=N-2;c6<=M-1;c6++) { S9(N-2,N-1,c6) ; } for (c4=N-1;c4<=M-1;c4++) { S2(N-1,c4) ; } S3(N-1) ; for (c4=N-1;c4<=M-1;c4++) { S4(N-1,c4) ; } S10(N-1) ; S5(N-1) ; } if ((M == N-1) && (M >= 1)) { S6(M-1,M) ; S7(M-1,M,M-1) ; S8(M-1,M) ; S9(M-1,M,M-1) ; S3(M) ; S10(M) ; S5(M) ; } if ((M <= N-2) && (N >= 2)) { S6(N-2,N-1) ; S8(N-2,N-1) ; S3(N-1) ; S10(N-1) ; S5(N-1) ; } } cloog-0.18.2/test/reservoir/pingali4.cloog0000775000175000017500000000223612254312305015366 00000000000000# Language c # Context 2 3 1 1 -2 1 0 1 0 # Number of statments 2 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 0 # Scattering functions 2 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 6 10 0 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam5.good.c0000664000175000017500000000155012254312305015335 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/lim-lam5.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S3(c2,c4) ; } } } cloog-0.18.2/test/reservoir/two.c0000664000175000017500000000020112254312305013572 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/two.cloog by CLooG 0.14.0-225-g6e2d019 gmp bits in 0.00s. */ S1(1,1,5); cloog-0.18.2/test/reservoir/pingali6.c0000664000175000017500000000116412254312305014503 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali6.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.04s. */ if (N >= 3) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S1(1,c4,c6) ; } } for (c2=3;c2<=2*M;c2++) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if (c2%2 == 0) { S1(c2/2,c4,c6) ; } } } for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if ((c2+1)%2 == 0) { S2((c2-1)/2,c4,c6) ; } } } } for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S2(M,c4,c6) ; } } } cloog-0.18.2/test/reservoir/lim-lam1.c0000664000175000017500000000077612254312305014413 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/lim-lam1.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.01s. */ S1(1,100); for (c2=-98;c2<=99;c2++) { if (c2 <= 0) { S1(1,-c2+1); } if (c2 >= 1) { S2(c2,1); } for (c4=max(2,-2*c2+3);c4<=min(199,-2*c2+200);c4++) { if (c4%2 == 0) { S1((2*c2+c4)/2,c4/2); } if ((c4+1)%2 == 0) { S2((2*c2+c4-1)/2,(c4+1)/2); } } if (c2 <= 0) { S1(c2+100,100); } if (c2 >= 1) { S2(100,-c2+101); } } S2(100,1); cloog-0.18.2/test/reservoir/stride.cloog0000664000175000017500000000122512254312305015143 00000000000000# # Stride-bug: # # for (i = 2; i <= N; i+=7) { # S(i); # # becomes: # # for (i = 5; i <= N; i+=7) { # S(i); # Language c # Context 1 3 1 0 1 0 # Number of statements 1 1 4 5 0 1 -7 0 -2 1 1 0 0 -2 1 -1 0 1 0 1 0 0 0 1 0 0 0 0 # Scattering functions 1 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/fusion2.cloog0000775000175000017500000000240512254312305015242 00000000000000# Language c # Context 1 4 1 0 0 1 0 # Number of statments 2 1 # { (i,j,k,l) | i-1 >= 0, -i+l >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 6 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 1 0 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i-1 >= 0, -i+l >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 6 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 1 0 0 0 0 1 0 0 0 0 # Scattering functions 2 6 11 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 6 11 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/lim-lam5.cloog0000775000175000017500000000324012254312305015270 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 3 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 0 # Scattering functions 3 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 6 10 0 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 6 10 0 1 0 0 0 0 0 0 0 -2 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/jacobi3.good.c0000664000175000017500000000241212254312305015230 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/jacobi3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.03s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int M, int N) { /* Scattering iterators. */ int c2, c4, c6; /* Original iterators. */ int i, j, k; if ((M >= 1) && (N >= 3)) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S1(1,c4,c6) ; } } } if (N >= 3) { for (c2=3;c2<=2*M;c2++) { for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if (c2%2 == 0) { S1(c2/2,c4,c6) ; } } } for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { if ((c2+1)%2 == 0) { i = (c2-1)/2 ; S2((c2-1)/2,c4,c6) ; } } } } } if ((M >= 1) && (N >= 3)) { c2 = 2*M+1 ; for (c4=2;c4<=N-1;c4++) { for (c6=2;c6<=N-1;c6++) { S2(M,c4,c6) ; } } } } cloog-0.18.2/test/reservoir/mg-resid.c0000664000175000017500000000162112254312305014477 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/mg-resid.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.03s. */ if ((M >= 1) && (N >= 3) && (O >= 3)) { if (M >= 3) { for (c2=2;c2<=O-1;c2++) { for (c6=1;c6<=M;c6++) { S1(c2,2,c6); S2(c2,2,c6); } for (c4=4;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { S1(c2,(c4+1)/2,c6); S2(c2,(c4+1)/2,c6); } } for (c6=2;c6<=M-1;c6++) { if (c4%2 == 0) { S3(c2,c4/2,c6); } } } for (c6=2;c6<=M-1;c6++) { S3(c2,N-1,c6); } } } if (M <= 2) { for (c2=2;c2<=O-1;c2++) { for (c4=3;c4<=2*N-3;c4++) { for (c6=1;c6<=M;c6++) { if ((c4+1)%2 == 0) { S1(c2,(c4+1)/2,c6); S2(c2,(c4+1)/2,c6); } } } } } } cloog-0.18.2/test/reservoir/two.good.c0000664000175000017500000000115512254312305014532 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/two.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } void test() { /* Original iterators. */ int i, j, k; for (i=0;i<=1;i++) { if ((i+1)%2 == 0) { j = (-i+3)/2 ; k = (i+9)/2 ; S1(i,(-i+3)/2,(i+9)/2) ; } } } cloog-0.18.2/test/reservoir/lim-lam6.cloog0000775000175000017500000000221212254312305015267 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 2 1 # { (i,j,k) | i >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 0 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 0 1 0 -1 1 0 1 0 0 0 1 0 0 0 0 # Scattering functions 2 6 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 6 10 0 1 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/mg-resid.cloog0000775000175000017500000000615212254312305015367 00000000000000# Language c # Context 1 5 1 0 0 0 1 0 # Number of statments 3 1 # { (i,j,k,l,m,n) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 8 1 1 0 0 0 0 0 -2 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 -2 1 0 -1 0 0 1 0 -1 1 0 0 1 0 0 0 -1 1 0 0 -1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 8 1 1 0 0 0 0 0 -2 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 -2 1 0 -1 0 0 1 0 -1 1 0 0 1 0 0 0 -1 1 0 0 -1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 # { (i,j,k,l,m,n) | i-2 >= 0, -i+n-1 >= 0, j-2 >= 0, -j+m-1 >= 0, k-2 >= 0, -k+l-1 >= 0, 1 >= 0 } 7 8 1 1 0 0 0 0 0 -2 1 -1 0 0 0 0 1 -1 1 0 1 0 0 0 0 -2 1 0 -1 0 0 1 0 -1 1 0 0 1 0 0 0 -2 1 0 0 -1 1 0 0 -1 1 0 0 0 0 0 0 1 0 0 0 0 # Scattering functions 3 8 15 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 15 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 8 15 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/pingali2.c0000664000175000017500000000045412254312305014500 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ if (M >= 1) { for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c2,c4) ; } } } cloog-0.18.2/test/reservoir/pingali3.cloog0000775000175000017500000000322012254312305015357 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 2 1 # { (i,j,k) | i-1 >= 0, -i+k >= 0, j-1 >= 0, -j+k >= 0, 1 >= 0 } 5 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i-1 >= 0, -i+l >= 0, j-1 >= 0, -j+l >= 0, k-1 >= 0, -k+l >= 0, 1 >= 0 } 7 6 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 0 0 -1 1 0 1 0 0 0 0 1 0 0 0 0 # Scattering functions 2 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/liu-zhuge1.c0000664000175000017500000000226512254312305014767 00000000000000/* Generated from /home/skimo/git/cloog/test/./reservoir/liu-zhuge1.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.02s. */ if ((M >= 0) && (N >= 0)) { for (c2=-4;c2<=min(-1,3*M+N-4);c2++) { for (c4=max(0,c2-3*M+4);c4<=min(N,c2+4);c4++) { if ((c2+2*c4+1)%3 == 0) { S1((c2-c4+4)/3,c4); } } } for (c2=0;c2<=3*M+N-4;c2++) { for (c4=max(0,c2-3*M);c4<=min(c2,c2-3*M+3);c4++) { if ((c2+2*c4)%3 == 0) { S2((c2-c4)/3,c4); } } for (c4=max(0,c2-3*M+4);c4<=min(N,c2);c4++) { if ((c2+2*c4)%3 == 0) { S2((c2-c4)/3,c4); } if ((c2+2*c4+1)%3 == 0) { S1((c2-c4+4)/3,c4); } } for (c4=max(c2+1,c2-3*M+4);c4<=min(N,c2+4);c4++) { if ((c2+2*c4+1)%3 == 0) { S1((c2-c4+4)/3,c4); } } for (c4=max(0,c2-3*M);c4<=min(N,c2);c4++) { if ((c2+2*c4)%3 == 0) { S3((c2-c4)/3,c4); } } } for (c2=max(0,3*M+N-3);c2<=3*M+N;c2++) { for (c4=max(0,c2-3*M);c4<=min(N,c2);c4++) { if ((c2+2*c4)%3 == 0) { S2((c2-c4)/3,c4); } } for (c4=max(0,c2-3*M);c4<=min(N,c2);c4++) { if ((c2+2*c4)%3 == 0) { S3((c2-c4)/3,c4); } } } } cloog-0.18.2/test/reservoir/loechner5.good.c0000664000175000017500000000134512254312305015606 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/loechner5.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k,l) { hash(1); hash(i); hash(j); hash(k); hash(l); } void test(int M) { /* Scattering iterators. */ int c2, c4, c6, c8; /* Original iterators. */ int i, j, k, l; for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { for (c6=1;c6<=M;c6++) { for (c8=1;c8<=M;c8++) { S1(c4,c6,c2,c8) ; } } } } } cloog-0.18.2/test/reservoir/loechner3.cloog0000775000175000017500000000163612254312305015544 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 1 1 # { (i,j,k,l) | -i+l >= 0, j-1 >= 0, -j+l >= 0, k-1 >= 0, i-k >= 0, 1 >= 0 } 6 6 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 1 0 -1 0 0 1 0 0 0 0 1 0 0 0 0 # Scattering functions 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/cholesky2.cloog0000775000175000017500000000414312254312305015561 00000000000000# Language c # Context 1 3 1 0 1 0 # Number of statments 3 1 # { (i,j) | i-1 >= 0, -i+j >= 0, 1 >= 0 } 3 4 1 1 0 -1 1 -1 1 0 1 0 0 1 0 0 0 1 # { (i,j,k) | i-1 >= 0, -i+j-1 >= 0, -j+k >= 0, 1 >= 0 } 4 5 1 1 0 0 -1 1 -1 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # { (i,j,k,l) | i-1 >= 0, -j+l >= 0, -i+k-1 >= 0, j-k >= 0, 1 >= 0 } 5 6 1 1 0 0 0 -1 1 0 -1 0 1 0 1 -1 0 1 0 -1 1 0 1 -1 0 0 1 0 0 0 0 1 0 0 0 0 # Scattering functions 3 8 11 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -3 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 8 12 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -2 -1 0 2 0 0 0 1 0 0 0 0 0 0 0 -2 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 8 13 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 -1 -1 0 1 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 cloog-0.18.2/test/reservoir/pingali4.good.c0000664000175000017500000000134712254312305015433 00000000000000/* Generated from ../../../git/cloog/test/./reservoir/pingali4.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S1(c2,c4) ; } } for (c2=1;c2<=M;c2++) { for (c4=1;c4<=M;c4++) { S2(c2,c4) ; } } } cloog-0.18.2/test/lex.c0000664000175000017500000000023112254312305011534 00000000000000/* Generated from /home/skimo/git/cloog/test/lex.cloog by CLooG 0.14.0-234-g330f397 gmp bits in 0.00s. */ for (c1=0;c1<=10;c1++) { S2(c1); S1(c1); } cloog-0.18.2/test/logo.cloog0000664000175000017500000000050412254312305012570 00000000000000# language: C c # Context 1 3 # n 1 1 0 1 0 2 # Number of statements 1 3 5 # i j n 1 1 1 0 0 -1 # i >= 1 1 0 -1 0 7 # j <= 7 1 -1 1 0 1 # j >= i-1 0 0 0 1 4 5 # i j n 1 1 1 0 0 -2 # i >= 2 1 -1 0 0 6 # i <= 6 1 0 1 0 0 # j >= 0 1 0 -1 0 4 # j <= 4 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/1point-2.good.c0000664000175000017500000000101312254312305013243 00000000000000/* Generated from ../../../git/cloog/test/1point-2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; i = 2*M ; j = N+2 ; S1(2*M,N+2) ; } cloog-0.18.2/test/equality2.c0000664000175000017500000000076512254312305012677 00000000000000/* Generated from ../../../git/cloog/test/equality2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.07s. */ for (i0=1;i0<=10000;i0++) { for (i1=1000;i1<=1016;i1++) { for (i2=1;i2<=min(-2*i1+2033,2*i1-1999);i2++) { if (2*i1 == i2+1999) { S2(i0,i1,i2,1,i0,2*i1-1000,1,2,i0,i1-499,2*i1-1999,i0,2*i1-1999,i1-999,i1-999) ; } if (i2 == 1) { if (i1%2 == 0) { S1(i0,i1,i2,2,i0,(i1+2)/2,i1-999,i0,i1-999,(i1-998)/2,(i1-998)/2) ; } } } } } cloog-0.18.2/test/lub.c0000664000175000017500000000044212254312305011532 00000000000000/* Generated from ../../../git/cloog/test/lub.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ if (M >= 2) { for (i=1;i<=M-1;i++) { for (j=i+1;j<=M;j++) { S1(i,j) ; for (k=i+1;k<=M;k++) { S2(i,j,k) ; S3(i,j,k) ; } S4(i,j) ; } } } cloog-0.18.2/test/check_c.sh0000775000175000017500000000505412254312305012526 00000000000000#!/bin/sh # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** check_c.sh ** # **-------------------------------------------------------------------** # ** First version: November 17th 2011 ** # **-------------------------------------------------------------------**/ # #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ $CHECKER "C" "$CLOOGTEST_C" "" "cloog" "c" "0" cloog-0.18.2/test/ex1.c0000664000175000017500000000052312254312305011445 00000000000000/* Generated from ../../../git/cloog/test/ex1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ for (i=0;i<=14;i++) { for (j=0;j<=n-15;j++) { S1(i,j) ; } } for (i=15;i<=n;i++) { for (j=0;j<=9;j++) { S1(i,j) ; } for (j=10;j<=n-15;j++) { S1(i,j) ; S2(i,j) ; } for (j=n-14;j<=n;j++) { S2(i,j) ; } } cloog-0.18.2/test/forwardsub-3-1-2.c0000664000175000017500000000064212254312305013565 00000000000000/* Generated from ../../../git/cloog/test/forwardsub-3-1-2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ S3(2,1) ; S1(3,1) ; S1(4,1) ; S4(4,2) ; for (i=5;i<=M+1;i++) { S1(i,1) ; for (j=2;j<=floord(i-1,2);j++) { S2(i,j) ; } if (i%2 == 0) { S4(i,i/2) ; } } for (i=M+2;i<=2*M-1;i++) { for (j=i-M;j<=floord(i-1,2);j++) { S2(i,j) ; } if (i%2 == 0) { S4(i,i/2) ; } } S4(2*M,M) ; cloog-0.18.2/test/min-3-1.cloog0000664000175000017500000000036112254312305012712 00000000000000# language: C c # Context 2 3 # M 1 1 1 0 1 0 1 0 1 # Number of statements 1 # 7 5 # i j M 1 1 1 0 0 0 1 -1 0 1 0 1 -1 0 0 10 1 0 1 0 0 1 0 -1 1 0 1 0 -1 0 10 1 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/durbin_e_s.cloog0000664000175000017500000000257412254312305013752 00000000000000# language: C c # Context 0 2 0 # parameter names 8 # Number of statements 1 4 5 0 1 0 0 -10 0 0 0 1 -4 1 0 1 0 -1 1 0 -1 0 10 0 0 0 1 4 5 0 0 1 0 7 0 0 0 1 0 1 1 0 0 -2 1 -1 0 0 10 0 0 0 1 4 5 0 0 0 1 -1 1 0 1 0 7 1 -1 0 0 10 1 1 -1 0 -9 0 0 0 1 4 5 0 1 0 0 -1 0 0 1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 4 5 0 0 0 1 -3 1 1 -1 0 -1 1 -1 0 0 10 1 0 1 0 -1 0 0 0 1 4 5 0 1 -1 0 -9 0 0 0 1 -2 1 0 1 0 7 1 0 -1 0 1 0 0 0 1 4 5 0 1 0 0 -1 0 0 1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 4 5 0 0 1 0 0 0 0 0 1 -3 1 1 0 0 -1 1 -1 0 0 9 0 0 0 0 # iterator names 0 # scattering functions 0 # scattering dimension names cloog-0.18.2/test/infinite.c0000664000175000017500000000036312254312305012557 00000000000000/* Generated from ../../../git/cloog/test/infinite.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ for (;i<=0;i++) { S1(i) ; } for (i=1;i<=N;i++) { S1(i) ; for (j=1;j<=M;j++) { S2(i,j) ; } } for (i=N+1;;i++) { S1(i) ; } cloog-0.18.2/test/dot2.c0000664000175000017500000000043612254312305011623 00000000000000/* Generated from ../../../git/cloog/test/dot2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ for (i=1;i<=min(M,N);i++) { S1(i) ; for (j=1;j<=M;j++) { S2(i,j) ; } } for (i=N+1;i<=M;i++) { S1(i) ; } for (i=M+1;i<=N;i++) { for (j=1;j<=M;j++) { S2(i,j) ; } } cloog-0.18.2/test/infinite2.cloog0000664000175000017500000000052112254312305013516 00000000000000# langage c # parametres {M, N | M>=1 N >=1} 2 4 # M N 1 1 1 0 -1 1 0 1 -1 0 2 # Number of statements 1 # {i | 1<=i<=M} 1 5 # i M N 1 1 1 0 0 -1 #1 -1 1 0 0 0 0 0 1 # {i, j | 1<=i<=N 1<=j<=M} 4 6 # i j M N 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/basic-bounds-3.good.c0000664000175000017500000000077312254312305014417 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int M) { /* Original iterators. */ int i; for (i=0;i<=M;i++) { S1(i) ; } } cloog-0.18.2/test/wavefront.c0000664000175000017500000000036612254312305012770 00000000000000/* Generated from ../../../git/cloog/test/wavefront.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if ((m >= 1) && (n >= 1)) { for (c1=2;c1<=n+m;c1++) { for (c2=max(1,c1-m);c2<=min(n,c1-1);c2++) { S1(c2,c1-c2) ; } } } cloog-0.18.2/test/double.cloog0000664000175000017500000000145112254312305013104 00000000000000# language: C c # parameters n m 1 4 # n m 1 1 0 1 0 0 4 # Number of statements 1 # S1 {i | 0<=i<=n} 2 5 # i n m 1 1 1 0 0 0 1 -1 1 0 0 0 0 0 1 # S2 {i, j | 0<=i<=n; 0<=j<=m} 4 6 # i j n m 1 1 1 0 0 0 0 1 -1 0 1 0 0 1 0 1 0 0 0 1 0 -1 0 1 0 0 0 0 1 # S3 {i, j | 0<=i<=n; 0<=j<=m} 4 6 # i j n m 1 1 1 0 0 0 0 1 -1 0 1 0 0 1 0 1 0 0 0 1 0 -1 0 1 0 0 0 0 1 # S4 {i | 0<=i<=n} 2 5 # i n m 1 1 1 0 0 0 1 -1 1 0 0 0 0 0 0 0 # Scattering functions 2 7 # c1 C2 i n m 1 0 1 0 -1 0 0 0 0 0 1 0 0 0 -1 2 8 # c1 C2 i j n m 1 0 1 0 -1 0 0 0 0 0 0 1 0 0 0 0 -2 2 8 # c1 C2 i j n m 1 0 1 0 -1 0 0 0 0 0 0 1 0 0 0 0 -3 2 7 # c1 C2 i n m 1 0 1 0 -1 0 0 0 0 0 1 0 0 0 -4 0 cloog-0.18.2/test/block3.cloog0000664000175000017500000000016012254312305013003 00000000000000C 0 2 0 3 1 0 2 0 0 0 1 0 2 0 0 0 1 2 3 1 1 0 1 -1 1 0 0 0 0 3 1 3 0 -1 0 1 3 0 -1 1 1 4 0 -1 1 0 0 cloog-0.18.2/test/yosrf.f0000664000175000017500000000057312254312305012122 00000000000000! Generated from ../../../git/cloog/test/yosrf.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. IF (n >= 2) THEN DO j=2, n S1(1,j) END DO DO proc=2, n-1 DO i=1, proc-1 DO j=i+1, n S2(i,j,proc) END DO END DO DO j=proc+1, n S1(proc,j) END DO END DO DO i=1, n-1 DO j=i+1, n S2(i,j,n) END DO END DO END IF cloog-0.18.2/test/gesced.good.c0000664000175000017500000000175012254312305013134 00000000000000/* Generated from ../../../git/cloog/test/gesced.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } void test(int M, int N) { /* Scattering iterators. */ int c1; /* Original iterators. */ int i, j; for (c1=1;c1<=N;c1++) { S1(c1) ; } for (c1=N+1;c1<=2*N;c1++) { for (i=1;i<=N;i++) { j = c1-N ; S2(i,c1-N) ; } } for (c1=2*N+1;c1<=M+N;c1++) { for (i=1;i<=N;i++) { j = c1-2*N ; S3(i,c1-2*N) ; j = c1-N ; S2(i,c1-N) ; } } for (c1=M+N+1;c1<=M+2*N;c1++) { for (i=1;i<=N;i++) { j = c1-2*N ; S3(i,c1-2*N) ; } } } cloog-0.18.2/test/merge.good.c0000664000175000017500000000126112254312305012776 00000000000000/* Generated from ../../../git/cloog/test/merge.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } #define S3(i) { hash(3); hash(i); } void test() { /* Scattering iterators. */ int c1; /* Original iterators. */ int i; for (c1=0;c1<=10;c1++) { if (c1 == 0) { S1(0) ; } if (c1 >= 2) { S2(c1) ; } S3(c1) ; } } cloog-0.18.2/test/iftest2.good.c0000664000175000017500000000125512254312305013262 00000000000000/* Generated from ../../../git/cloog/test/iftest2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; if (M >= 1) { for (i=1;i<=N;i++) { for (j=1;j<=M;j++) { if (i <= 2*M) { S1(i,j) ; } if (i >= max(M,2*M+1)) { S1(i,j) ; } } } } } cloog-0.18.2/test/multi-stride2.c0000664000175000017500000000024512254312305013455 00000000000000/* Generated from ../../../git/cloog/test/multi-stride2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ for (i=5;i<=100;i+=6) { S1(i,(i-1)/2,(i-2)/3) ; } cloog-0.18.2/test/1point-2.cloog0000664000175000017500000000030612254312305013201 00000000000000# language: C c # Context #{M,N | } 1 4 # M N 1 1 0 0 1 0 1 # Number of statements 1 # 3 6 # i j M N 1 0 1 0 -2 0 0 0 2 -2 -4 2 4 1 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/donotsimp.good.c0000664000175000017500000000130112254312305013706 00000000000000/* Generated from ../../../git/cloog/test/donotsimp.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c2, c4; /* Original iterators. */ int i, j; for (c2=1;c2<=10;c2++) { for (c4=1;c4<=c2;c4++) { S1(c2,c4) ; } for (c4=11;c4<=M;c4++) { S2(c2,c4) ; } } } cloog-0.18.2/test/singleton.cloog0000664000175000017500000000011112254312305013624 00000000000000c 0 2 0 2 1 0 2 0 0 0 1 0 2 0 0 0 0 2 1 3 0 -1 0 1 3 0 -1 -1 0 cloog-0.18.2/test/basic-bounds-1.good.c0000664000175000017500000000076612254312305014417 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test() { /* Original iterators. */ int i; for (i=0;i<=2;i++) { S1(i) ; } } cloog-0.18.2/test/gesced3.c0000664000175000017500000000040312254312305012262 00000000000000/* Generated from ../../../git/cloog/test/gesced3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.02s. */ for (c1=M+1;c1<=2*M;c1++) { S1(c1-M) ; } for (c1=2*M+1;c1<=M+N;c1++) { S2(c1-2*M) ; S1(c1-M) ; } for (c1=M+N+1;c1<=2*M+N;c1++) { S2(c1-2*M) ; } cloog-0.18.2/test/4-param.c0000664000175000017500000000053212254312305012211 00000000000000/* Generated from ../../../git/cloog/test/4-param.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.18s. */ for (i=m;i<=min(n,p-1);i++) { S1(i) ; } for (i=p;i<=min(q,m-1);i++) { S2(i) ; } for (i=max(m,p);i<=min(n,q);i++) { S1(i) ; S2(i) ; } for (i=max(max(m,p),q+1);i<=n;i++) { S1(i) ; } for (i=max(max(m,p),n+1);i<=q;i++) { S2(i) ; } cloog-0.18.2/test/classen2.good.c0000664000175000017500000000550712254312305013420 00000000000000/* Generated from ../../../git/cloog/test/classen2.cloog by CLooG 0.14.0-271-gaa1e292 gmp bits in 0.13s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(compIter1,compIter2,compIter3,compIter4,compIter5,compIter6) { hash(1); hash(compIter1); hash(compIter2); hash(compIter3); hash(compIter4); hash(compIter5); hash(compIter6); } void test(int outerTimeTileScatter, int outerProcTileScatter1, int outerProcTileScatter2, int M, int N) { /* Scattering iterators. */ int compScatter1, compScatter2, compScatter3; /* Original iterators. */ int compIter1, compIter2, compIter3, compIter4, compIter5, compIter6; if ((M >= 2) && (N >= 3) && (outerProcTileScatter1 >= outerProcTileScatter2) && (5*outerProcTileScatter1 <= M+2*N-4) && (5*outerProcTileScatter1 <= 5*outerProcTileScatter2+N+2) && (outerProcTileScatter2 >= 0) && (5*outerProcTileScatter2 <= M+N-2) && (outerTimeTileScatter >= outerProcTileScatter1) && (outerTimeTileScatter <= 2*outerProcTileScatter1) && (outerTimeTileScatter <= outerProcTileScatter1+outerProcTileScatter2+1) && (5*outerTimeTileScatter <= 2*M+2*N-6) && (5*outerTimeTileScatter <= 5*outerProcTileScatter1+M+2) && (5*outerTimeTileScatter >= 10*outerProcTileScatter1-2*N-2) && (5*outerTimeTileScatter <= 5*outerProcTileScatter2+M+N) && (5*outerTimeTileScatter >= 10*outerProcTileScatter2-N-3) && (5*outerTimeTileScatter <= 10*outerProcTileScatter2+N+3) && (5*outerTimeTileScatter >= 5*outerProcTileScatter1+5*outerProcTileScatter2-N-4)) { for (compScatter1=max(max(max(max(max(4,5*outerTimeTileScatter),5*outerProcTileScatter2+1),5*outerProcTileScatter1+5*outerProcTileScatter2-N),10*outerProcTileScatter1-2*N+2),10*outerProcTileScatter2-N+1);compScatter1<=min(min(min(min(min(5*outerTimeTileScatter+4,2*M+2*N-6),5*outerProcTileScatter1+M+2),5*outerProcTileScatter1+5*outerProcTileScatter2+5),5*outerProcTileScatter2+M+N),10*outerProcTileScatter2+N+3);compScatter1++) { for (compScatter2=max(max(max(max(ceild(compScatter1+4,2),5*outerProcTileScatter1),5*outerProcTileScatter2+1),compScatter1-M+2),compScatter1-5*outerProcTileScatter2-1);compScatter2<=min(min(min(min(floord(compScatter1+2*N-2,2),compScatter1),5*outerProcTileScatter1+4),compScatter1-5*outerProcTileScatter2+N),5*outerProcTileScatter2+N+2);compScatter2++) { for (compScatter3=max(max(5*outerProcTileScatter2,compScatter1-compScatter2+3),compScatter2-N+2);compScatter3<=min(min(compScatter2-1,5*outerProcTileScatter2+4),compScatter1-compScatter2+N);compScatter3++) { S1(compScatter1-compScatter2+1,-compScatter1+compScatter2+compScatter3-2,compScatter2-compScatter3,compScatter1,compScatter2,compScatter3); } } } } } cloog-0.18.2/test/double.good.c0000664000175000017500000000131212254312305013146 00000000000000/* Generated from ../../../git/cloog/test/double.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } #define S4(i) { hash(4); hash(i); } void test(int M, int N) { /* Original iterators. */ int i, j; for (i=0;i<=M;i++) { S1(i) ; for (j=0;j<=N;j++) { S2(i,j) ; S3(i,j) ; } S4(i) ; } } cloog-0.18.2/test/infinite2.c0000664000175000017500000000032612254312305012640 00000000000000/* Generated from ../../../git/cloog/test/infinite2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (i=1;i<=N;i++) { S1(i) ; for (j=1;j<=M;j++) { S2(i,j) ; } } for (i=N+1;;i++) { S1(i) ; } cloog-0.18.2/test/check_special.sh0000775000175000017500000000567712254312305013737 00000000000000#!/bin/sh # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** check_special.sh ** # **-------------------------------------------------------------------** # ** First version: November 17th 2011 ** # **-------------------------------------------------------------------**/ # #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ # Refactor $SPECIAL_OPTIONS list to remove quotes and to replace spaces in # individual tests with %, e.g., "'file1 -f -1' 'file2'" becomes # "file1%-f%-1 file2". special_refactored=`echo "$SPECIAL_OPTIONS" | \ sed "s/' '/#/g" | \ sed 's/ /%/g' | \ sed "s/#/ /g" | \ sed "s/'//g"` $CHECKER "SPECIAL" "$special_refactored" "" "cloog" "c" "0" cloog-0.18.2/test/backtrack.cloog0000664000175000017500000000020412254312305013552 00000000000000c 0 2 0 # Number of statements 1 1 # of domains 1 3 0 1 0 0 0 0 0 # of scattering functions 1 2 5 0 1 0 -1 0 0 0 1 0 0 0 cloog-0.18.2/test/classen.c0000664000175000017500000000577212254312305012413 00000000000000/* Generated from /home/skimo/git/cloog/test/classen.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.45s. */ if (m >= 1) { if (m >= 2) { S1(0,1,1,1); S2(0,1,1,1,1,1,2,1); S3(0,1,1,2,1,1,1,2); S4(0,1,2,2,1,1,2,2); S8(0,1); } if (m == 1) { S1(0,1,1,1); S8(0,1); } for (glT1=1;glT1<=2*m-4;glT1++) { if (glT1 <= m-2) { S5(glT1-1,1,glT1,1,glT1,1,glT1+1,1); S1(glT1,1,glT1+1,1); S2(glT1,1,glT1+1,1,glT1+1,1,glT1+2,1); S3(glT1,1,glT1+1,2,glT1+1,1,glT1+1,2); S4(glT1,1,glT1+2,2,glT1+1,1,glT1+2,2); } if (glT1 >= m) { S5(glT1-1,glT1-m+2,glT1,glT1-m+2,m-1,glT1-m+2,m,glT1-m+2); S6(glT1-1,glT1-m+1,glT1,glT1-m+2,m,glT1-m+1,m,glT1-m+2); S1(glT1,glT1-m+2,m,glT1-m+2); S3(glT1,glT1-m+2,glT1+1,glT1-m+3,m,glT1-m+2,m,glT1-m+3); } if (glT1 == m-1) { S5(m-2,1,m-1,1,m-1,1,m,1); S1(m-1,1,m,1); S3(m-1,1,m,2,m,1,m,2); } for (rp1=max(2,glT1-m+3);rp1<=min(glT1,m-1);rp1++) { S5(glT1-1,rp1,glT1,rp1,glT1-rp1+1,rp1,glT1-rp1+2,rp1); S6(glT1-1,rp1-1,glT1,rp1,glT1-rp1+2,rp1-1,glT1-rp1+2,rp1); S7(glT1-1,rp1-1,glT1+1,rp1,glT1-rp1+2,rp1-1,glT1-rp1+3,rp1); S1(glT1,rp1,glT1-rp1+2,rp1); S2(glT1,rp1,glT1+1,rp1,glT1-rp1+2,rp1,glT1-rp1+3,rp1); S3(glT1,rp1,glT1+1,rp1+1,glT1-rp1+2,rp1,glT1-rp1+2,rp1+1); S4(glT1,rp1,glT1+2,rp1+1,glT1-rp1+2,rp1,glT1-rp1+3,rp1+1); } if (glT1 <= m-2) { S6(glT1-1,glT1,glT1,glT1+1,1,glT1,1,glT1+1); S7(glT1-1,glT1,glT1+1,glT1+1,1,glT1,2,glT1+1); S1(glT1,glT1+1,1,glT1+1); S2(glT1,glT1+1,glT1+1,glT1+1,1,glT1+1,2,glT1+1); S3(glT1,glT1+1,glT1+1,glT1+2,1,glT1+1,1,glT1+2); S4(glT1,glT1+1,glT1+2,glT1+2,1,glT1+1,2,glT1+2); } if (glT1 >= m) { S5(glT1-1,m,glT1,m,glT1-m+1,m,glT1-m+2,m); S6(glT1-1,m-1,glT1,m,glT1-m+2,m-1,glT1-m+2,m); S7(glT1-1,m-1,glT1+1,m,glT1-m+2,m-1,glT1-m+3,m); S1(glT1,m,glT1-m+2,m); S2(glT1,m,glT1+1,m,glT1-m+2,m,glT1-m+3,m); } if (glT1 == m-1) { S6(m-2,m-1,m-1,m,1,m-1,1,m); S7(m-2,m-1,m,m,1,m-1,2,m); S1(m-1,m,1,m); S2(m-1,m,m,m,1,m,2,m); } for (coordP1=max(1,glT1-m+2);coordP1<=min(m,glT1+1);coordP1++) { S8(glT1,coordP1); } } if (m >= 2) { if (m >= 3) { S5(2*m-4,m-1,2*m-3,m-1,m-1,m-1,m,m-1); S6(2*m-4,m-2,2*m-3,m-1,m,m-2,m,m-1); S1(2*m-3,m-1,m,m-1); S3(2*m-3,m-1,2*m-2,m,m,m-1,m,m); } if (m == 2) { S5(0,1,1,1,1,1,2,1); S1(1,1,2,1); S3(1,1,2,2,2,1,2,2); } if (m >= 3) { S5(2*m-4,m,2*m-3,m,m-2,m,m-1,m); S6(2*m-4,m-1,2*m-3,m,m-1,m-1,m-1,m); S7(2*m-4,m-1,2*m-2,m,m-1,m-1,m,m); S1(2*m-3,m,m-1,m); } if (m == 2) { S6(0,1,1,2,1,1,1,2); S7(0,1,2,2,1,1,2,2); S1(1,2,1,2); } S2(2*m-3,m,2*m-2,m,m-1,m,m,m); for (coordP1=m-1;coordP1<=m;coordP1++) { S8(2*m-3,coordP1); } } if (m >= 2) { S5(2*m-3,m,2*m-2,m,m-1,m,m,m); S6(2*m-3,m-1,2*m-2,m,m,m-1,m,m); S1(2*m-2,m,m,m); S8(2*m-2,m); } } cloog-0.18.2/test/lu2.good.c0000664000175000017500000000175512254312305012411 00000000000000/* Generated from ../../../git/cloog/test/lu2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k,l) { hash(1); hash(i); hash(j); hash(k); hash(l); } #define S2(i,j,k,l,m) { hash(2); hash(i); hash(j); hash(k); hash(l); hash(m); } void test(int n) { /* Original iterators. */ int i, j, k, l, m; if (n >= 2) { for (l=2;l<=n;l++) { S1(1,n,1,l) ; } } for (i=2;i<=n-1;i++) { for (j=2;j<=n-1;j++) { for (k=1;k<=min(j-1,i-1);k++) { S2(i,j,k,j,i) ; } } for (k=1;k<=i-1;k++) { S2(i,n,k,n,i) ; } for (l=i+1;l<=n;l++) { S1(i,n,i,l) ; } } if (n >= 2) { for (j=2;j<=n;j++) { for (k=1;k<=j-1;k++) { S2(n,j,k,j,n) ; } } } } cloog-0.18.2/test/yosr2.good.c0000664000175000017500000000200712254312305012754 00000000000000/* Generated from ../../../git/cloog/test/yosr2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i) { hash(2); hash(i); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } #define S4(i,j) { hash(4); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int proc; /* Original iterators. */ int i, j, k; for (i=1;i<=M;i++) { S2(i) ; } for (proc=2;proc<=M-1;proc++) { for (i=1;i<=proc-1;i++) { S4(i,proc) ; } for (j=1;j<=proc-1;j++) { S1(proc,j) ; } for (j=proc+1;j<=M;j++) { for (k=1;k<=proc-1;k++) { S3(proc,j,k) ; } } } for (i=1;i<=M-1;i++) { S4(i,M) ; } for (j=1;j<=M-1;j++) { S1(M,j) ; } } cloog-0.18.2/test/rectangle.cloog0000664000175000017500000000046012254312305013575 00000000000000# language: C c # parameter {n | n>= 0} 1 3 # n 1 1 1 0 1 n 1 # Number of statements: 1 # {ii, i | 0<=i<=n 0<=j<=n} 4 5 # i j n 1 1 1 0 0 0 1 -1 0 1 0 1 0 1 0 0 1 0 -1 1 0 0 0 0 0 1 # Scattering functions 1 6 # c1 j i n 1 0 1 -1 -1 0 0 0 cloog-0.18.2/test/gesced.c0000664000175000017500000000061012254312305012177 00000000000000/* Generated from ../../../git/cloog/test/gesced.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.05s. */ for (c1=1;c1<=N;c1++) { S1(c1) ; } for (c1=N+1;c1<=2*N;c1++) { for (i=1;i<=N;i++) { S2(i,c1-N) ; } } for (c1=2*N+1;c1<=M+N;c1++) { for (i=1;i<=N;i++) { S3(i,c1-2*N) ; S2(i,c1-N) ; } } for (c1=M+N+1;c1<=M+2*N;c1++) { for (i=1;i<=N;i++) { S3(i,c1-2*N) ; } } cloog-0.18.2/test/min-1-1.c0000664000175000017500000000034412254312305012030 00000000000000/* Generated from ../../../git/cloog/test/min-1-1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if ((M >= 0) && (N >= 1)) { for (i=1;i<=N;i++) { for (j=0;j<=min(min(M,i),-i+N);j++) { S1(i,j) ; } } } cloog-0.18.2/test/orc.c0000664000175000017500000000175612254312305011544 00000000000000/* Generated from ../../../git/cloog/test/orc.cloog by CLooG 0.16.2-5-g590827b gmp bits in 0.03s. */ S1(0); S2(0,0); for (p2=1;p2<=22;p2++) { if ((p2+1)%2 == 0) { S3(0,(p2-1)/2); } if (p2%2 == 0) { S2(0,p2/2); } } S3(0,11); for (p1=2;p1<=6;p1++) { if ((p1+1)%3 == 0) { S4((p1-2)/3); } if (p1%3 == 0) { S1(p1/3); } if (p1 == 4) { S2(1,0); } if (p1 == 4) { for (p2=1;p2<=20;p2++) { if ((p2+1)%2 == 0) { S3(1,(p2-1)/2); } if (p2%2 == 0) { S2(1,p2/2); } } } if (p1 == 4) { S3(1,10); } } S2(2,0); for (p2=1;p2<=18;p2++) { if ((p2+1)%2 == 0) { S3(2,(p2-1)/2); } if (p2%2 == 0) { S2(2,p2/2); } } S3(2,9); S4(2); S5(0); for (p2=0;p2<=9;p2++) { S6(0,p2); } for (p1=2;p1<=42;p1++) { if ((p1+1)%3 == 0) { S7((p1-2)/3); } if (p1%3 == 0) { S5(p1/3); } for (p2=0;p2<=9;p2++) { if ((p1+2)%3 == 0) { S6((p1-1)/3,p2); } } } for (p2=0;p2<=9;p2++) { S6(14,p2); } S7(14); cloog-0.18.2/test/christian.cloog0000664000175000017500000000212312254312305013613 00000000000000# =============================================== Global # Language C # Context 0 3 # Parameter names are provided 1 # Parameter names N # Number of statements 2 # =============================================== Statement 1 # ---------------------------------------------- 1.1 Domain # Iteration domain 1 4 5 1 1 0 0 0 ## i >= 0 1 -1 0 1 -1 ## -i+N-1 >= 0 1 0 1 0 0 ## j >= 0 1 0 -1 1 -1 ## -j+N-1 >= 0 0 0 0 # =============================================== Statement 2 # ---------------------------------------------- 2.1 Domain # Iteration domain 1 4 5 1 1 0 0 0 ## i >= 0 1 -1 0 1 -1 ## -i+N-1 >= 0 1 0 1 0 0 ## j >= 0 1 0 -1 1 -1 ## -j+N-1 >= 0 0 0 0 #naming for domains 0 # ---------------------------------------------- Scatterings # of Scattering functions 2 # Scattering function 1 6 0 1 -1 1 0 0 ## p = i-j # Scattering function 1 6 0 1 -1 1 0 -1 ## p = i-j+1 # we will set the scattering dimension names 1 p cloog-0.18.2/test/basic-bounds-5.c0000664000175000017500000000022012254312305013455 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-5.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ j = floord(M+1,2) ; S1(1,j) ; cloog-0.18.2/test/constbound.cloog0000664000175000017500000000105312254312305014006 00000000000000# CLooG script generated automatically by PLUTO # language: C c # Context 0 2 1 # Number of statements 2 1 # of domains 6 5 1 0 1 0 0 1 0 -1 0 9999 1 0 0 1 0 1 0 1 -1 0 1 -50 1 0 0 1 50 -1 0 24 0 0 0 1 6 5 1 0 1 0 0 1 0 -1 0 9999 1 0 0 1 0 1 0 1 -1 0 1 -50 1 0 -25 1 50 -1 0 49 0 0 0 0 # of scattering functions 2 4 9 0 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 1 0 0 -1 0 4 9 0 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 0 0 -1 0 0 0 0 0 0 1 0 0 -1 0 # we will set the scattering dimension names 4 t0 t1 t2 t3 cloog-0.18.2/test/backtrack.good.c0000664000175000017500000000077412254312305013634 00000000000000/* Generated from ../../../git/cloog/test/backtrack.cloog by CLooG 0.14.0-367-gf043665 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test() { /* Scattering iterators. */ int c1; /* Original iterators. */ int i; S1(0); } cloog-0.18.2/test/0D-2.cloog0000664000175000017500000000004412254312305012231 00000000000000c 0 3 0 1 1 1 3 1 1 0 0 0 0 0 0 cloog-0.18.2/test/yosrf.cloog0000664000175000017500000000155212254312305012776 00000000000000# language: FORTRAN f # One parameter : n 1 3 # n 1 1 0 1 # We want to set the parameter names... 1 # and 'n' is the name of the unique parameter n 2 # Number of statements: 2. 1 # {i, j | 1<=i<=n-1; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 -1 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 1 # {i, j, k | 1<=i<=n-1; i+1<=j<=n i+1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 -1 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 -1 0 1 0 -1 1 0 0 -1 1 0 0 0 0 # We want to let CLooG set the iterator names. 0 2 # Scattering functions 1 6 # c1 i j n 1 0 1 -1 0 0 0 1 7 # c1 i j k n 1 0 1 0 0 -1 0 0 1 proc 2 # Scattering functions 3 8 # c1 c2 c3 i j n 1 0 1 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 3 9 # c1 c2 c3 i j k n 1 0 1 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 0 0 -1 0 0 0 cloog-0.18.2/test/cholesky.c0000664000175000017500000000116312254312305012572 00000000000000/* Generated from ../../../git/cloog/test/cholesky.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.04s. */ if (n >= 1) { if (n >= 2) { S1(1) ; S3(1) ; for (c3=2;c3<=n;c3++) { S4(1,c3) ; S6(1,c3) ; } } if (n == 1) { S1(1) ; S3(1) ; } for (c1=2;c1<=n-1;c1++) { S1(c1) ; for (c3=1;c3<=c1-1;c3++) { S2(c1,c3) ; } S3(c1) ; for (c3=c1+1;c3<=n;c3++) { S4(c1,c3) ; for (c5=1;c5<=c1-1;c5++) { S5(c1,c3,c5) ; } S6(c1,c3) ; } } if (n >= 2) { S1(n) ; for (c3=1;c3<=n-1;c3++) { S2(n,c3) ; } S3(n) ; } } cloog-0.18.2/test/cholesky2.c0000664000175000017500000000217212254312305012655 00000000000000/* Generated from ../../../git/cloog/test/cholesky2.cloog by CLooG 0.16.1-2-g33ac553 gmp bits in 0.02s. */ if (M >= 1) { for (c2=1;c2<=M-1;c2++) { S1(c2); for (c3=c2+1;c3<=M;c3++) { S4(c2,c3); } } S1(M); S3(1); if (M >= 3) { S6(1,2); for (c2=3;c2<=M;c2++) { S6(1,c2); for (i=2;i<=c2-1;i++) { S5(i,c2,1); } } } if (M == 2) { S6(1,2); } for (c1=3;c1<=3*M-7;c1++) { if ((c1+2)%3 == 0) { S3((c1+2)/3); } if (c1%3 == 0) { S2((c1+3)/3,c1/3); } if ((c1+1)%3 == 0) { S6((c1+1)/3,(c1+4)/3); } if (c1%3 == 0) { S2((c1+6)/3,c1/3); } for (c2=ceild(c1+7,3);c2<=M;c2++) { if ((c1+1)%3 == 0) { S6((c1+1)/3,c2); } if (c1%3 == 0) { S2(c2,c1/3); } if ((c1+1)%3 == 0) { for (i=ceild(c1+4,3);i<=c2-1;i++) { S5(i,c2,(c1+1)/3); } } } } if (M >= 3) { for (c2=M-1;c2<=M;c2++) { S2(c2,M-2); } } if (M >= 3) { S3(M-1); } if (M >= 3) { S6(M-1,M); } if (M >= 2) { S2(M,M-1); } if (M >= 2) { S3(M); } } cloog-0.18.2/test/walters.good.c0000664000175000017500000000261212254312305013361 00000000000000/* Generated from /home/skimo/git/cloog/test/walters.cloog by CLooG 0.14.0-223-gad1f0a0 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,div36,div37,div38) { hash(1); hash(i); hash(div36); hash(div37); hash(div38); } #define S2(i,div36,div37,div38) { hash(2); hash(i); hash(div36); hash(div37); hash(div38); } #define S3(i,div36,div37,div38) { hash(3); hash(i); hash(div36); hash(div37); hash(div38); } #define S4(i,div36,div37,div38) { hash(4); hash(i); hash(div36); hash(div37); hash(div38); } void test() { /* Original iterators. */ int i, div36, div37, div38; S2(1,0,1,0); S4(1,0,1,0); S3(2,0,1,1); S4(2,0,1,1); for (i=3;i<=10;i++) { if ((i+2)%3 <= 1) { div36 = floord(i-1,3); if ((i+1)%3 <= 1) { div37 = floord(i+1,3); if ((i+1)%3 == 0) { S3(i,div36,div37,(i+1)/3); S4(i,div36,div37,(i+1)/3); } } if ((i+2)%3 == 0) { div38 = floord(i+1,3); S2(i,div36,(i+2)/3,div38); S4(i,div36,(i+2)/3,div38); } } if (i%3 == 0) { div37 = floord(i+2,3); div38 = floord(i+1,3); S1(i,i/3,div37,div38); S4(i,i/3,div37,div38); } } } cloog-0.18.2/test/guide.cloog0000664000175000017500000000136712254312305012735 00000000000000# Language is C c # The context (no constraints on parameters) 1 4 # 1 lines and 4 columns # m n 1 1 0 0 0 # 0 >= 0, always true 0 # CLooG will set parameters names automatically 2 # The number of statements 2 # First statement # The first domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 -1 2 0 0 # i <= 2*m # The second domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 1 -1 0 0 # i >= m 0 0 0 1 # Second statement 2 5 # 4 lines and 6 columns # i m n 1 1 1 0 -1 -1 # i >= 1 1 -1 0 2 0 # i <= n 0 0 0 0 # CLooG will set iterators names automatically 0 cloog-0.18.2/test/0D-3.good.c0000664000175000017500000000064512254312305012307 00000000000000/* Generated from ../../../git/cloog/test/0D-3.cloog by CLooG 0.14.0-117-g5444fca gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } void test(int M) { S1() ; } cloog-0.18.2/test/mod4.cloog0000664000175000017500000000166412254312305012503 00000000000000# language: C c # parameters 1 2 1 1 0 3 # S1: ND_4IP_3 1 11 7 1 1 0 0 0 0 -1 1 -1 0 0 0 0 10 0 0 0 0 1 0 -2 1 -1 0 0 0 3 2 1 -1 0 0 0 3 2 1 1 0 0 0 -3 0 0 1 0 0 -1 -3 0 1 1 -3 0 0 0 2 1 -1 3 0 0 0 0 1 1 0 -3 0 0 1 1 -1 0 3 0 0 1 0 0 0 # S2: W:ND_4OP_1 1 13 7 1 0 1 0 0 -1 -1 1 0 0 3 0 -3 -2 1 1 0 0 0 0 -1 1 -1 0 0 0 0 10 0 0 0 0 1 0 -2 1 -1 0 0 0 3 2 1 -1 0 0 0 3 2 1 1 0 0 0 -3 0 0 1 0 0 -1 -3 0 1 1 -3 0 0 0 2 1 -1 3 0 0 0 0 1 1 0 -3 0 0 1 1 -1 0 3 0 0 1 0 0 0 # S3: ND_4 1 11 7 1 1 0 0 0 0 -1 1 -1 0 0 0 0 10 0 0 0 0 1 0 -2 1 -1 0 0 0 3 2 1 -1 0 0 0 3 2 1 1 0 0 0 -3 0 0 1 0 0 -1 -3 0 1 1 -3 0 0 0 2 1 -1 3 0 0 0 0 1 1 0 -3 0 0 1 1 -1 0 3 0 0 1 0 0 0 1 j div41 div42 mod6 mod6_a 0 0 cloog-0.18.2/test/merge.c0000664000175000017500000000026612254312305012053 00000000000000/* Generated from ../../../git/cloog/test/merge.cloog by CLooG 0.14.0-238-gb1cb779 gmp bits in 0.00s. */ S1(0); for (c1=0;c1<=10;c1++) { if (c1 >= 2) { S2(c1); } S3(c1); } cloog-0.18.2/test/ex1.good.c0000664000175000017500000000142412254312305012375 00000000000000/* Generated from ../../../git/cloog/test/ex1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int n) { /* Original iterators. */ int i, j; for (i=0;i<=14;i++) { for (j=0;j<=n-15;j++) { S1(i,j) ; } } for (i=15;i<=n;i++) { for (j=0;j<=9;j++) { S1(i,j) ; } for (j=10;j<=n-15;j++) { S1(i,j) ; S2(i,j) ; } for (j=n-14;j<=n;j++) { S2(i,j) ; } } } cloog-0.18.2/test/tiling.good.c0000664000175000017500000000111612254312305013164 00000000000000/* Generated from ../../../git/cloog/test/tiling.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(ii,i) { hash(1); hash(ii); hash(i); } void test(int n) { /* Original iterators. */ int ii, i; for (ii=0;ii<=floord(n,10);ii++) { for (i=max(10*ii,0);i<=min(10*ii+9,n);i++) { S1(ii,i) ; } } } cloog-0.18.2/test/Makefile.am0000664000175000017500000002172112254312305012643 00000000000000# # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** makefile ** # **-------------------------------------------------------------------** # ** First version: march 6th 2003 ** # **-------------------------------------------------------------------**/ # # makefile for checking. #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * This file has been written with the help of the Bart Kienhuis's checking * # * makefile for PipLib. * # * * # *****************************************************************************/ if NO_ISL GENERATE_TEST = else GENERATE_TEST = generate_test endif noinst_PROGRAMS = $(GENERATE_TEST) AM_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include LDADD = ../libcloog-isl.la generate_test_SOURCES = generate_test.c FORCE: ../libcloog-isl.la: FORCE cd ..; $(MAKE) $(AM_MAKEFLAGS) libcloog-isl.la ROOT = .. FINITE_CLOOGTEST_C = \ 0D-1 \ 0D-2 \ 0D-3 \ 1point-1 \ 1point-2 \ 4-param \ basic-bounds-1 \ basic-bounds-2 \ basic-bounds-3 \ basic-bounds-4 \ basic-bounds-5 \ basic-bounds-6 \ block \ block2 \ block3 \ byu98-1-2-3 \ cholesky \ cholesky2 \ christian \ classen \ classen2 \ constant \ constbound \ darte \ dealII \ donotsimp \ dot \ dot2 \ double \ durbin_e_s \ emploi \ esced \ ex1 \ forwardsub-1-1-2 \ forwardsub-2-1-2-3 \ forwardsub-3-1-2 \ gauss \ gesced \ gesced2 \ gesced3 \ guide \ iftest \ iftest2 \ largeur \ levenshtein-1-2-3 \ lex \ lineality-1-2 \ lineality-2-1-2 \ logo \ logopar \ lu \ lu2 \ lub \ lux \ min-1-1 \ min-2-1 \ min-3-1 \ min-4-1 \ mode \ multi-mm-1 \ no_lindep \ orc \ rectangle \ singleton \ square+triangle-1-1-2-3 \ swim \ test \ thomasset \ tiling \ uday_scalars \ union \ vivien \ vivien2 \ walters \ walters2 \ walters3 \ wavefront \ yosr \ yosr2 \ non_optimal/nul_complex1 \ non_optimal/usvd_e_t \ non_optimal/youcef \ reservoir/cholesky2 \ reservoir/fusion1 \ reservoir/fusion2 \ reservoir/jacobi2 \ reservoir/jacobi3 \ reservoir/lim-lam1 \ reservoir/lim-lam2 \ reservoir/lim-lam3 \ reservoir/lim-lam4 \ reservoir/lim-lam5 \ reservoir/lim-lam6 \ reservoir/liu-zhuge1 \ reservoir/loechner3 \ reservoir/loechner4 \ reservoir/loechner5 \ reservoir/mg-interp2 \ reservoir/mg-interp \ reservoir/mg-psinv \ reservoir/mg-resid \ reservoir/mg-rprj3 \ reservoir/pingali1 \ reservoir/pingali2 \ reservoir/pingali3 \ reservoir/pingali4 \ reservoir/pingali5 \ reservoir/pingali6 \ reservoir/QR \ reservoir/tang-xue1 \ reservoir/two CLOOG_ISL_TEST_C = \ isl/mod \ isl/mod2 \ isl/mod3 \ isl/mod4 CLOOGTEST_C = \ infinite \ infinite2 \ infinite3 \ infinite4 \ $(FINITE_CLOOGTEST_C) \ $(CLOOG_ISL_TEST_C) CLOOGTEST_FORTRAN = \ dartef \ iftestf \ levenshtein-1-2-3f \ yosrf CLOOG_ISL_TEST_STRIDED = \ isl/mxm-shared CLOOGTEST_STRIDED = \ basic-bounds-2 \ mod4 \ nul_basic1 \ nul_basic2 \ nul_lcpc \ multi-stride \ multi-stride2 \ stride3 \ stride4 \ reservoir/bastoul3 \ reservoir/stride \ reservoir/stride2 \ $(CLOOG_ISL_TEST_STRIDED) if NO_OSL CLOOGTEST_OPENSCOP = else CLOOGTEST_OPENSCOP = \ openscop/matmult \ openscop/empty \ openscop/union endif SPECIAL_TESTS = \ isl/unroll \ isl/jacobi-shared \ isl/unroll2 \ backtrack \ vasilache \ merge \ equality \ equality2 \ otl \ param-split \ pouchet \ stride \ stride2 \ sor1d SPECIAL_OPTIONS = \ 'isl/unroll -first-unroll 1' \ 'isl/jacobi-shared -f 4 -l -1 -override -strides 1 -sh 1' \ 'isl/unroll2 -first-unroll 1' \ 'backtrack -f 1 -backtrack' \ 'vasilache -f 8 -l 9' \ 'merge -f -1' \ 'equality -f -1 -l 2 -override' \ 'equality2 -f -1 -l 4 -esp 1 -override' \ 'otl -block 1 -esp 0 -otl 0' \ 'param-split -f -1' \ 'pouchet -f 3 -l 7' \ 'stride -f -1 -strides 1' \ 'stride2 -f -1 -strides 1' \ 'sor1d -f -1' generate: @echo " /*-----------------------------------------------*" @echo " * Generate files *" @echo " *-----------------------------------------------*/" @for x in $(CLOOGTEST_C) ; do \ echo "Generate $$x.c" ; \ $(top_builddir)/cloog $(srcdir)/$$x.cloog -o $(srcdir)/$$x.c ; \ done ; \ for x in $(CLOOGTEST_FORTRAN) ; do \ echo "Generate $$x.f" ; \ $(top_builddir)/cloog $(srcdir)/$$x.cloog -o $(srcdir)/$$x.f ; \ done ; \ for x in $(CLOOGTEST_STRIDED) ; do \ echo "Generate $$x.c" ; \ $(top_builddir)/cloog $(srcdir)/$$x.cloog \ -strides 1 -o $(srcdir)/$$x.c ; \ done ; \ for x in $(CLOOGTEST_OPENSCOP) ; do \ echo "Generate $$x.c" ; \ $(top_builddir)/cloog $(srcdir)/$$x.scop \ -openscop -o $(srcdir)/$$x.c ; \ done ; \ for line in $(SPECIAL_OPTIONS); do \ options=`echo $$line | sed -e 's/^[^ ]* //'`; \ x=`echo $$line | sed -e 's/ .*//'`; \ echo "Generate file $$x ($$options)" ; \ $(top_builddir)/cloog$(EXEEXT) $(srcdir)/$$x.cloog \ $$options > $(srcdir)/$$x.c ; \ done generate_good: @for x in $(FINITE_CLOOGTEST_C) ; do \ echo "Generate $$x.good.c" ; \ $(top_builddir)/cloog$(EXEEXT) -callable 1 $(srcdir)/$$x.cloog -o $(srcdir)/$$x.good.c ; \ done; \ for line in $(SPECIAL_OPTIONS); do echo $$line | while read x options; do \ echo "Generate $$x.good.c ($$options)" ; \ $(top_builddir)/cloog$(EXEEXT) -callable 1 $$options $(srcdir)/$$x.cloog -o $(srcdir)/$$x.good.c ; \ done; done valgrind: @echo " /*-----------------------------------------------*" @echo " * Checking files by Valgrind *" @echo " *-----------------------------------------------*/" for x in $(CLOOGTEST_C) ; do \ echo "Valgrinding $$x.c" ; \ valgrind $(top_builddir)/cloog$(EXEEXT) $(srcdir)/$$x.cloog ; \ done ; \ for x in $(CLOOGTEST_FORTRAN) ; do \ echo "Valgrinding $$x.f" ; \ valgrind $(top_builddir)/cloog$(EXEEXT) $(srcdir)/$$x.cloog ; \ done CHECKER := "$(srcdir)/checker.sh" TESTS_ENVIRONMENT = \ top_builddir=$(top_builddir) \ srcdir=$(srcdir) \ EXEXT=$(EXEEXT) \ CHECKER=$(CHECKER) \ COMPILE="$(COMPILE)" \ LINK="$(LINK)" \ FINITE_CLOOGTEST_C="$(FINITE_CLOOGTEST_C)" \ CLOOGTEST_C="$(CLOOGTEST_C)" \ CLOOGTEST_FORTRAN="$(CLOOGTEST_FORTRAN)" \ CLOOGTEST_STRIDED="$(CLOOGTEST_STRIDED)" \ CLOOGTEST_OPENSCOP="$(CLOOGTEST_OPENSCOP)" \ SPECIAL_OPTIONS="$(SPECIAL_OPTIONS)" test_run: generate_test$(EXEEXT) $(TESTS_ENVIRONMENT) \ $(srcdir)/check_run.sh check_SCRIPTS = \ check_c.sh \ check_fortran.sh \ check_strided.sh \ check_openscop.sh \ check_special.sh TESTS = $(check_SCRIPTS) EXTRA_DIST = \ $(check_SCRIPTS) \ $(srcdir)/checker.sh \ $(srcdir)/check_run.sh \ $(CLOOGTEST_C:%=%.cloog) \ $(CLOOGTEST_C:%=%.c) \ $(FINITE_CLOOGTEST_C:%=%.good.c) \ $(CLOOGTEST_FORTRAN:%=%.cloog) \ $(CLOOGTEST_FORTRAN:%=%.f) \ $(CLOOGTEST_STRIDED:%=%.cloog) \ $(CLOOGTEST_STRIDED:%=%.c) \ $(CLOOGTEST_OPENSCOP:%=%.scop) \ $(CLOOGTEST_OPENSCOP:%=%.c) \ $(SPECIAL_TESTS:%=%.cloog) \ $(SPECIAL_TESTS:%=%.c) \ $(SPECIAL_TESTS:%=%.good.c) cloog-0.18.2/test/constant.c0000664000175000017500000000054012254312305012600 00000000000000/* Generated from ../../../git/cloog/test/constant.cloog by CLooG 0.14.0-333-g4442dac gmp bits in 0.01s. */ for (c2=0;c2<=min(1023,M+1024);c2++) { S1(c2); S3(c2); } for (c2=max(0,M+1025);c2<=1023;c2++) { S2(c2); S3(c2); } for (c1=0;c1<=min(1023,M+1024);c1++) { S4(c1); S6(c1); } for (c1=max(0,M+1025);c1<=1023;c1++) { S5(c1); S6(c1); } cloog-0.18.2/test/constbound.c0000664000175000017500000000052012254312305013123 00000000000000/* Generated from /home/skimo/git/cloog/test/constbound.cloog by CLooG 0.14.0-170-g72daac3 gmp bits in 0.01s. */ for (t0=0;t0<=199;t0++) { for (t2=50*t0;t2<=50*t0+24;t2++) { for (t3=0;t3<=t2;t3++) { S1(t0,t2,t3); } } for (t2=50*t0+25;t2<=50*t0+49;t2++) { for (t3=0;t3<=t2;t3++) { S2(t0,t2,t3); } } } cloog-0.18.2/test/constant.cloog0000664000175000017500000000431312254312305013463 00000000000000# CLooG -> CLooG # This is an automatic dump of a CLooG input file from a CloogInput data # structure. # Language: C c # Context: 0 3 0 # Parameter name(s) # Statement number: 6 # Iteration domain of statement 1 (Stmt_if.then). 1 3 4 1 0 0 1 1 1 0 0 1 -1 0 1023 1 -1 1 1024 0 0 0 # For future options. # Iteration domain of statement 2 (Stmt_if.else). 1 3 4 1 0 0 1 1 1 0 0 1 -1 0 1023 1 1 -1 -1025 0 0 0 # For future options. # Iteration domain of statement 3 (Stmt_if.end). 1 2 4 1 0 0 1 1 1 0 0 1 -1 0 1023 0 0 0 # For future options. # Iteration domain of statement 1 (Stmt_if.then). 1 3 4 1 0 0 1 1 1 0 0 1 -1 0 1023 1 -1 1 1024 0 0 0 # For future options. # Iteration domain of statement 2 (Stmt_if.else). 1 3 4 1 0 0 1 1 1 0 0 1 -1 0 1023 1 1 -1 -1025 0 0 0 # For future options. # Iteration domain of statement 3 (Stmt_if.end). 1 2 4 1 0 0 1 1 1 0 0 1 -1 0 1023 0 0 0 # For future options. 0 # Iterator name(s) # --------------------- SCATTERING -------------------- 6 # Scattering functions # Scattering of statement 1 (Stmt_if.then). 1 3 7 3 1 0 1 0 0 0 1 0 0 0 0 0 1 0 -1 0 0 0 1 0 0 0 0 1 # Scattering of statement 2 (Stmt_if.else). 1 3 7 3 1 0 1 0 0 0 1 0 0 -1 0 0 1 0 -1 0 0 0 1 0 0 0 0 1 # Scattering of statement 3 (Stmt_if.end). 1 3 7 3 1 0 1 0 0 0 1 0 0 -2 0 0 1 0 -1 0 0 0 1 0 0 0 0 1 # Scattering of statement 1 (Stmt_if.then). 1 3 7 3 1 0 1 0 0 0 1 0 0 0 0 1 0 0 -1 0 0 0 0 1 0 0 0 0 # Scattering of statement 2 (Stmt_if.else). 1 3 7 3 1 0 1 0 0 0 1 0 0 -1 0 1 0 0 -1 0 0 0 0 1 0 0 0 0 # Scattering of statement 3 (Stmt_if.end). 1 3 7 3 1 0 1 0 0 0 1 0 0 -2 0 1 0 0 -1 0 0 0 0 1 0 0 0 0 0 # Scattering dimension name(s) cloog-0.18.2/test/lu.good.c0000664000175000017500000000174512254312305012326 00000000000000/* Generated from ../../../git/cloog/test/lu.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int n) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j, k; if (n >= 2) { for (j=2;j<=n;j++) { S1(1,j) ; } } for (c1=2;c1<=n-1;c1++) { for (c2=2;c2<=n-1;c2++) { for (i=1;i<=min(c2-1,c1-1);i++) { S2(i,c2,c1) ; } } for (i=1;i<=c1-1;i++) { S2(i,n,c1) ; } for (j=c1+1;j<=n;j++) { S1(c1,j) ; } } if (n >= 2) { for (c2=2;c2<=n;c2++) { for (i=1;i<=c2-1;i++) { S2(i,c2,n) ; } } } } cloog-0.18.2/test/durbin_e_s.good.c0000664000175000017500000000330212254312305014006 00000000000000/* Generated from ../../../git/cloog/test/durbin_e_s.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.05s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } #define S4(i,j,k) { hash(4); hash(i); hash(j); hash(k); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } #define S6(i,j,k) { hash(6); hash(i); hash(j); hash(k); } #define S7(i,j,k) { hash(7); hash(i); hash(j); hash(k); } #define S8(i,j,k) { hash(8); hash(i); hash(j); hash(k); } void test() { /* Original iterators. */ int i, j, k; S4(1,0,0) ; S7(1,0,0) ; S8(1,0,3) ; S2(2,-7,0) ; S3(2,-7,1) ; S6(2,-7,2) ; S8(2,0,3) ; S5(2,1,3) ; S2(3,-7,0) ; S3(3,-7,1) ; S3(3,-6,1) ; S6(3,-6,2) ; S8(3,0,3) ; for (j=1;j<=2;j++) { S5(3,j,3) ; } for (i=4;i<=8;i++) { S2(i,-7,0) ; S3(i,-7,1) ; for (j=-6;j<=i-10;j++) { S3(i,j,1) ; } j = i-9 ; S3(i,i-9,1) ; S6(i,i-9,2) ; S8(i,0,3) ; for (j=1;j<=i-1;j++) { S5(i,j,3) ; } } S2(9,-7,0) ; S3(9,-7,1) ; for (j=-6;j<=-1;j++) { S3(9,j,1) ; } S3(9,0,1) ; S6(9,0,2) ; S8(9,0,3) ; for (j=1;j<=8;j++) { S5(9,j,3) ; } S2(10,-7,0) ; S3(10,-7,1) ; for (j=-6;j<=0;j++) { S3(10,j,1) ; } S3(10,1,1) ; S6(10,1,2) ; S5(10,1,3) ; S1(10,1,4) ; for (j=2;j<=9;j++) { S5(10,j,3) ; S1(10,j,4) ; } S1(10,10,4) ; } cloog-0.18.2/test/square+triangle-1-1-2-3.good.c0000664000175000017500000000147712254312305015604 00000000000000/* Generated from ../../../git/cloog/test/square+triangle-1-1-2-3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; for (j=1;j<=M;j++) { S1(1,j) ; } for (i=2;i<=M-1;i++) { S1(i,1) ; for (j=2;j<=i;j++) { S1(i,j) ; S2(i,j) ; } for (j=i+1;j<=M;j++) { S1(i,j) ; } } if (M >= 2) { S1(M,1) ; for (j=2;j<=M;j++) { S1(M,j) ; S2(M,j) ; } } } cloog-0.18.2/test/levenshtein-1-2-3.good.c0000664000175000017500000000272112254312305014662 00000000000000/* Generated from ../../../git/cloog/test/levenshtein-1-2-3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.03s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } #define S4(i,j) { hash(4); hash(i); hash(j); } #define S5(i,j) { hash(5); hash(i); hash(j); } #define S6(i,j) { hash(6); hash(i); hash(j); } #define S7(i,j) { hash(7); hash(i); hash(j); } #define S8(i,j) { hash(8); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; S1(0,0) ; S2(1,0) ; S3(1,1) ; for (i=2;i<=N;i++) { S2(i,0) ; for (j=1;j<=i-1;j++) { S6(i,j) ; } S3(i,i) ; } i = N+1 ; S7(N+1,0) ; for (j=1;j<=N;j++) { S6(N+1,j) ; S8(N+1,j) ; } for (i=N+2;i<=2*M-N-2;i++) { j = floord(i-N-1,2) ; S7(i,j) ; if ((i+N)%2 == 0) { j = (i-N)/2 ; S5(i,(i-N)/2) ; S8(i,(i-N)/2) ; } for (j=ceild(i-N+1,2);j<=floord(i+N-1,2);j++) { S6(i,j) ; S8(i,j) ; } if ((i+N)%2 == 0) { j = (i+N)/2 ; S4(i,(i+N)/2) ; S8(i,(i+N)/2) ; } } for (i=2*M-N-1;i<=2*M-2;i++) { for (j=i-M+1;j<=M-1;j++) { S6(i,j) ; } } } cloog-0.18.2/test/pouchet.c0000664000175000017500000000123012254312305012413 00000000000000/* Generated from ../../../git/cloog/test/pouchet.cloog by CLooG 0.16.2-3-gc1aebd7 gmp bits in 0.03s. */ if (Ny >= 2) { for (c0=1;c0<=floord(Ny+4,2);c0++) { for (c1=max(ceild(c0+1,2),c0-1);c1<=min(floord(2*c0+Ny,4),c0);c1++) { if (c0 >= ceild(4*c1-Ny+1,2)) { for (c2=1;c2<=2;c2++) { S1(c0-c1,c1,2*c0-2*c1,-2*c0+4*c1,c2); S2(c0-c1,c1,2*c0-2*c1,-2*c0+4*c1-1,c2); } } if (2*c0 == 4*c1-Ny) { for (c2=1;c2<=2;c2++) { if (Ny%2 == 0) { if ((2*c0+3*Ny)%4 == 0) { S2((2*c0-Ny)/4,(2*c0+Ny)/4,(2*c0-Ny)/2,Ny-1,c2); } } } } } } } cloog-0.18.2/test/basic-bounds-4.good.c0000664000175000017500000000077512254312305014422 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-4.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int M) { /* Original iterators. */ int i; for (i=0;i<=M+1;i++) { S1(i) ; } } cloog-0.18.2/test/forwardsub-1-1-2.c0000664000175000017500000000035412254312305013563 00000000000000/* Generated from ../../../git/cloog/test/forwardsub-1-1-2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ S3(1,1) ; S1(2,1) ; S4(2,2) ; for (i=3;i<=M;i++) { S1(i,1) ; for (j=2;j<=i-1;j++) { S2(i,j) ; } S4(i,i) ; } cloog-0.18.2/test/walters2.cloog0000664000175000017500000000151712254312305013400 00000000000000# language: C c # parameters 1 2 1 1 1 2 # S1 1 12 4 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 1 1 0 -1 1 0 1 -1 1 -1 0 24 1 0 -1 50 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 0 0 0 # S2 4 11 4 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 1 1 0 -1 1 0 1 -1 1 1 0 -25 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 12 4 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 1 1 0 -1 1 0 1 -1 1 -1 0 24 1 0 1 -51 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 10 4 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 1 1 0 -1 1 0 -1 0 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 9 4 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 1 -1 0 0 1 1 0 0 1 -1 0 25 1 0 1 0 1 0 -1 51 0 0 0 1 j i 0 0 cloog-0.18.2/test/param-split.c0000664000175000017500000000031012254312305013173 00000000000000/* Generated from ../../../git/cloog/test/param-split.cloog by CLooG 0.14.0-277-gce2ba57 gmp bits in 0.00s. */ for (i=0;i<=M;i++) { S1(i); if (i == 0) { S2(i); } } if (M <= -1) { S2(0); } cloog-0.18.2/test/block2.good.c0000664000175000017500000000125312254312305013054 00000000000000/* Generated from /home/skimo/git/cloog/test/block2.cloog by CLooG 0.14.0-302-g309b32c gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } void test() { /* Scattering iterators. */ int c0, c1; /* Original iterators. */ int i, j; for (c0=0;c0<=9;c0++) { S1(c0,1); S3(c0,1); S2(c0,1); } } cloog-0.18.2/test/byu98-1-2-3.c0000664000175000017500000000064312254312305012370 00000000000000/* Generated from /home/skimo/git/cloog/test/byu98-1-2-3.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.01s. */ for (i=2;i<=3;i++) { for (j=-i+6;j<=6;j++) { S1(i,j); } } for (i=4;i<=7;i++) { if (i == 4) { for (j=3;j<=4;j++) { S1(i,j); } } if (i >= 6) { S2(i,-i+9); } if (i <= 5) { S1(i,-i+9); S2(i,-i+9); } for (j=max(-i+10,i-1);j<=6;j++) { S1(i,j); } } S2(8,1); cloog-0.18.2/test/min-1-1.good.c0000664000175000017500000000113312254312305012754 00000000000000/* Generated from ../../../git/cloog/test/min-1-1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; if (M >= 0) { for (i=1;i<=N;i++) { for (j=0;j<=min(min(i,-i+N),M);j++) { S1(i,j) ; } } } } cloog-0.18.2/test/yosr.cloog0000664000175000017500000000155012254312305012626 00000000000000# language: C c # One parameter : n 1 3 # n 1 1 0 1 # We want to set the parameter names... 1 # and 'n' is the name of the unique parameter n 2 # Number of statements: 2. 1 # {i, j | 1<=i<=n-1; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 -1 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 1 # {i, j, k | 1<=i<=n-1; i+1<=j<=n i+1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 -1 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 -1 0 1 0 -1 1 0 0 -1 1 0 0 0 0 # We want to let CLooG set the iterator names. 0 2 # Scattering functions 1 6 # c1 i j n 1 0 1 -1 0 0 0 1 7 # c1 i j k n 1 0 1 0 0 -1 0 0 1 proc 2 # Scattering functions 3 8 # c1 c2 c3 i j n 1 0 1 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 3 9 # c1 c2 c3 i j k n 1 0 1 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 0 0 -1 0 0 0 cloog-0.18.2/test/basic-bounds-2.cloog0000664000175000017500000000021512254312305014337 00000000000000# language: C c # Context 1 2 1 1 0 1 # Number of statements 1 # 3 3 # i 1 1 3 0 1 -3 2 1 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/cholesky.cloog0000664000175000017500000000420012254312305013446 00000000000000# language: C c # parameter n 1 3 # n 1 1 0 1 1 n 6 # Number of statements 1 # S1 {i | 1<=i<=n} 2 4 # i n 1 1 1 0 -1 1 -1 1 0 0 0 0 1 # S2 {i, j | 1<=i<=n; 1<=j<=i-1} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 1 -1 0 -1 0 0 0 1 # S3 {i | 1<=i<=n} 2 4 # i n 1 1 1 0 -1 1 -1 1 0 0 0 0 1 # S4 {i, j | 1<=i<=n; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 1 # S5 {i, j, k | 1<=i<=n; i+1<=j<=n 1<=k<=i-1} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 1 0 -1 0 -1 0 0 0 1 # S6 {i, j | 1<=i<=n; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 0 6 # Scattering functions # Et les instructions de chunking (prog init)... 6 10 # c1 c2 c3 c4 c5 c6 i n 1 0 1 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 6 11 # c1 c2 c3 c4 c5 c6 i j n 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 6 10 # c1 c2 c3 c4 c5 c6 i n 1 0 1 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 0 -3 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 6 11 # c1 c2 c3 c4 c5 c6 i j n 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 -4 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 6 12 # c1 c2 c3 c4 c5 c6 i j k n 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -4 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -2 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 6 11 # c1 c2 c3 c4 c5 c6 i j n 1 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 -4 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -3 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 cloog-0.18.2/test/lub.cloog0000664000175000017500000000126612254312305012420 00000000000000# language: C c # parameter n 1 3 # n 1 1 0 1 0 4 # Number of statements 1 # {i, j | 1<=i<=n; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 1 # {i, j, k | 1<=i<=n; i+1<=j<=n i+1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 -1 0 1 0 -1 1 0 0 -1 1 0 0 0 0 1 # {i, j, k | 1<=i<=n; i+1<=j<=n i+1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 -1 0 1 0 -1 1 0 0 -1 1 0 0 0 0 1 # {i, j | 1<=i<=n; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/orc.good.c0000664000175000017500000000433112254312305012463 00000000000000/* Generated from ../../../git/cloog/test/orc.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.06s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } #define S4(i) { hash(4); hash(i); } #define S5(i) { hash(5); hash(i); } #define S6(i,j) { hash(6); hash(i); hash(j); } #define S7(i) { hash(7); hash(i); } void test() { /* Scattering iterators. */ int p1, p2; /* Original iterators. */ int i, j; S1(0) ; S2(0,0) ; for (p2=1;p2<=22;p2++) { if ((p2+1)%2 == 0) { j = (p2-1)/2 ; S3(0,(p2-1)/2) ; } if (p2%2 == 0) { S2(0,p2/2) ; } } S3(0,11) ; for (p1=2;p1<=6;p1++) { if ((p1+1)%3 == 0) { i = (p1-2)/3 ; S4((p1-2)/3) ; } if ((p1+2)%3 == 0) { i = (p1-1)/3 ; S2((p1-1)/3,0) ; } if (p1%3 == 0) { S1(p1/3) ; } for (p2=1;p2<=floord(-2*p1+68,3);p2++) { if ((p1+2)%3 == 0) { i = (p1-1)/3 ; if ((p2+1)%2 == 0) { j = (p2-1)/2 ; S3((p1-1)/3,(p2-1)/2) ; } if (p2%2 == 0) { S2((p1-1)/3,p2/2) ; } } } p2 = floord(-2*p1+71,3) ; if ((p1+2)%3 == 0) { i = (p1-1)/3 ; if ((p2+1)%2 == 0) { j = (p2-1)/2 ; S3((p1-1)/3,(p2-1)/2) ; } } } S2(2,0) ; for (p2=1;p2<=18;p2++) { if ((p2+1)%2 == 0) { j = (p2-1)/2 ; S3(2,(p2-1)/2) ; } if (p2%2 == 0) { S2(2,p2/2) ; } } S3(2,9) ; S4(2) ; S5(0) ; S6(0,0) ; for (p2=1;p2<=9;p2++) { S6(0,p2) ; } for (p1=2;p1<=42;p1++) { if ((p1+1)%3 == 0) { i = (p1-2)/3 ; S7((p1-2)/3) ; } if ((p1+2)%3 == 0) { i = (p1-1)/3 ; S6((p1-1)/3,0) ; } if (p1%3 == 0) { S5(p1/3) ; } for (p2=1;p2<=9;p2++) { if ((p1+2)%3 == 0) { i = (p1-1)/3 ; S6((p1-1)/3,p2) ; } } } S6(14,0) ; for (p2=1;p2<=9;p2++) { S6(14,p2) ; } S7(14) ; } cloog-0.18.2/test/iftestf.f0000664000175000017500000000023612254312305012420 00000000000000! Generated from ../../../git/cloog/test/iftestf.cloog by CLooG 0.14.0-245-gd8c1718 gmp bits in 0.00s. IF (n >= 1) THEN DO i=1, n S1(i) END DO END IF cloog-0.18.2/test/nul_lcpc.c0000664000175000017500000000050712254312305012551 00000000000000/* Generated from ../../../git/cloog/test/nul_lcpc.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.03s. */ for (i=1;i<=6;i+=2) { for (j=1;j<=i;j++) { S1(i,(i-1)/2,j) ; S2(i,(i-1)/2,j) ; } for (j=i+1;j<=p;j++) { S1(i,(i-1)/2,j) ; } } for (i=7;i<=m;i+=2) { for (j=1;j<=p;j++) { S1(i,(i-1)/2,j) ; } } cloog-0.18.2/test/param-split.good.c0000664000175000017500000000114612254312305014132 00000000000000/* Generated from ../../../git/cloog/test/param-split.cloog by CLooG 0.14.0-277-gce2ba57 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } void test(int M) { /* Original iterators. */ int i; if (M >= 0) { S1(0); S2(0); } for (i=1;i<=M;i++) { S1(i); } if (M <= -1) { S2(0); } } cloog-0.18.2/test/union.good.c0000664000175000017500000000136312254312305013032 00000000000000/* Generated from ../../../git/cloog/test/union.cloog by CLooG 0.14.0-277-g62f7d82 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int M) { /* Scattering iterators. */ int c1; /* Original iterators. */ int i; if (M <= -1) { for (c1=0;c1<=100;c1++) { S1(c1); } } if (M >= 1) { if (M >= 11) { for (c1=-100;c1<=0;c1++) { S1(-c1); } } if (M <= 10) { for (c1=0;c1<=100;c1++) { S1(c1); } } } } cloog-0.18.2/test/Makefile.in0000664000175000017500000006663012254313270012666 00000000000000# Makefile.in generated by automake 1.11.3 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** makefile ** # **-------------------------------------------------------------------** # ** First version: march 6th 2003 ** # **-------------------------------------------------------------------**/ # # makefile for checking. #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2003 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * This file has been written with the help of the Bart Kienhuis's checking * # * makefile for PipLib. * # * * # *****************************************************************************/ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ noinst_PROGRAMS = $(am__EXEEXT_1) subdir = test DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_cc_maxopt.m4 \ $(top_srcdir)/m4/ax_cflags_warn_all.m4 \ $(top_srcdir)/m4/ax_check_compiler_flags.m4 \ $(top_srcdir)/m4/ax_compiler_vendor.m4 \ $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/ax_gcc_archflag.m4 \ $(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \ $(top_srcdir)/m4/ax_submodule.m4 $(top_srcdir)/m4/libtool.m4 \ $(top_srcdir)/m4/ltoptions.m4 $(top_srcdir)/m4/ltsugar.m4 \ $(top_srcdir)/m4/ltversion.m4 $(top_srcdir)/m4/lt~obsolete.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = @NO_ISL_FALSE@am__EXEEXT_1 = generate_test$(EXEEXT) PROGRAMS = $(noinst_PROGRAMS) am_generate_test_OBJECTS = generate_test.$(OBJEXT) generate_test_OBJECTS = $(am_generate_test_OBJECTS) generate_test_LDADD = $(LDADD) generate_test_DEPENDENCIES = ../libcloog-isl.la AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent DEFAULT_INCLUDES = -I.@am__isrc@ depcomp = $(SHELL) $(top_srcdir)/autoconf/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) AM_V_CC = $(am__v_CC_@AM_V@) am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@) am__v_CC_0 = @echo " CC " $@; AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ CCLD = $(CC) LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CCLD = $(am__v_CCLD_@AM_V@) am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@) am__v_CCLD_0 = @echo " CCLD " $@; AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; SOURCES = $(generate_test_SOURCES) DIST_SOURCES = $(generate_test_SOURCES) ETAGS = etags CTAGS = ctags am__tty_colors = \ red=; grn=; lgn=; blu=; std= DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CD = @CD@ CFLAGS = @CFLAGS@ CFLAGS_WARN = @CFLAGS_WARN@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GIT_INDEX = @GIT_INDEX@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ ISL_CPPFLAGS = @ISL_CPPFLAGS@ ISL_LDFLAGS = @ISL_LDFLAGS@ ISL_LIBS = @ISL_LIBS@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OSL_CPPFLAGS = @OSL_CPPFLAGS@ OSL_LDFLAGS = @OSL_LDFLAGS@ OSL_LIBS = @OSL_LIBS@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ TEXI2DVI = @TEXI2DVI@ VERSION = @VERSION@ VERSION_MAJOR = @VERSION_MAJOR@ VERSION_MINOR = @VERSION_MINOR@ VERSION_REVISION = @VERSION_REVISION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ subdirs = @subdirs@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ @NO_ISL_FALSE@GENERATE_TEST = generate_test @NO_ISL_TRUE@GENERATE_TEST = AM_CPPFLAGS = -I$(top_builddir)/include -I$(top_srcdir)/include LDADD = ../libcloog-isl.la generate_test_SOURCES = generate_test.c ROOT = .. FINITE_CLOOGTEST_C = \ 0D-1 \ 0D-2 \ 0D-3 \ 1point-1 \ 1point-2 \ 4-param \ basic-bounds-1 \ basic-bounds-2 \ basic-bounds-3 \ basic-bounds-4 \ basic-bounds-5 \ basic-bounds-6 \ block \ block2 \ block3 \ byu98-1-2-3 \ cholesky \ cholesky2 \ christian \ classen \ classen2 \ constant \ constbound \ darte \ dealII \ donotsimp \ dot \ dot2 \ double \ durbin_e_s \ emploi \ esced \ ex1 \ forwardsub-1-1-2 \ forwardsub-2-1-2-3 \ forwardsub-3-1-2 \ gauss \ gesced \ gesced2 \ gesced3 \ guide \ iftest \ iftest2 \ largeur \ levenshtein-1-2-3 \ lex \ lineality-1-2 \ lineality-2-1-2 \ logo \ logopar \ lu \ lu2 \ lub \ lux \ min-1-1 \ min-2-1 \ min-3-1 \ min-4-1 \ mode \ multi-mm-1 \ no_lindep \ orc \ rectangle \ singleton \ square+triangle-1-1-2-3 \ swim \ test \ thomasset \ tiling \ uday_scalars \ union \ vivien \ vivien2 \ walters \ walters2 \ walters3 \ wavefront \ yosr \ yosr2 \ non_optimal/nul_complex1 \ non_optimal/usvd_e_t \ non_optimal/youcef \ reservoir/cholesky2 \ reservoir/fusion1 \ reservoir/fusion2 \ reservoir/jacobi2 \ reservoir/jacobi3 \ reservoir/lim-lam1 \ reservoir/lim-lam2 \ reservoir/lim-lam3 \ reservoir/lim-lam4 \ reservoir/lim-lam5 \ reservoir/lim-lam6 \ reservoir/liu-zhuge1 \ reservoir/loechner3 \ reservoir/loechner4 \ reservoir/loechner5 \ reservoir/mg-interp2 \ reservoir/mg-interp \ reservoir/mg-psinv \ reservoir/mg-resid \ reservoir/mg-rprj3 \ reservoir/pingali1 \ reservoir/pingali2 \ reservoir/pingali3 \ reservoir/pingali4 \ reservoir/pingali5 \ reservoir/pingali6 \ reservoir/QR \ reservoir/tang-xue1 \ reservoir/two CLOOG_ISL_TEST_C = \ isl/mod \ isl/mod2 \ isl/mod3 \ isl/mod4 CLOOGTEST_C = \ infinite \ infinite2 \ infinite3 \ infinite4 \ $(FINITE_CLOOGTEST_C) \ $(CLOOG_ISL_TEST_C) CLOOGTEST_FORTRAN = \ dartef \ iftestf \ levenshtein-1-2-3f \ yosrf CLOOG_ISL_TEST_STRIDED = \ isl/mxm-shared CLOOGTEST_STRIDED = \ basic-bounds-2 \ mod4 \ nul_basic1 \ nul_basic2 \ nul_lcpc \ multi-stride \ multi-stride2 \ stride3 \ stride4 \ reservoir/bastoul3 \ reservoir/stride \ reservoir/stride2 \ $(CLOOG_ISL_TEST_STRIDED) @NO_OSL_FALSE@CLOOGTEST_OPENSCOP = \ @NO_OSL_FALSE@ openscop/matmult \ @NO_OSL_FALSE@ openscop/empty \ @NO_OSL_FALSE@ openscop/union @NO_OSL_TRUE@CLOOGTEST_OPENSCOP = SPECIAL_TESTS = \ isl/unroll \ isl/jacobi-shared \ isl/unroll2 \ backtrack \ vasilache \ merge \ equality \ equality2 \ otl \ param-split \ pouchet \ stride \ stride2 \ sor1d SPECIAL_OPTIONS = \ 'isl/unroll -first-unroll 1' \ 'isl/jacobi-shared -f 4 -l -1 -override -strides 1 -sh 1' \ 'isl/unroll2 -first-unroll 1' \ 'backtrack -f 1 -backtrack' \ 'vasilache -f 8 -l 9' \ 'merge -f -1' \ 'equality -f -1 -l 2 -override' \ 'equality2 -f -1 -l 4 -esp 1 -override' \ 'otl -block 1 -esp 0 -otl 0' \ 'param-split -f -1' \ 'pouchet -f 3 -l 7' \ 'stride -f -1 -strides 1' \ 'stride2 -f -1 -strides 1' \ 'sor1d -f -1' CHECKER := "$(srcdir)/checker.sh" TESTS_ENVIRONMENT = \ top_builddir=$(top_builddir) \ srcdir=$(srcdir) \ EXEXT=$(EXEEXT) \ CHECKER=$(CHECKER) \ COMPILE="$(COMPILE)" \ LINK="$(LINK)" \ FINITE_CLOOGTEST_C="$(FINITE_CLOOGTEST_C)" \ CLOOGTEST_C="$(CLOOGTEST_C)" \ CLOOGTEST_FORTRAN="$(CLOOGTEST_FORTRAN)" \ CLOOGTEST_STRIDED="$(CLOOGTEST_STRIDED)" \ CLOOGTEST_OPENSCOP="$(CLOOGTEST_OPENSCOP)" \ SPECIAL_OPTIONS="$(SPECIAL_OPTIONS)" check_SCRIPTS = \ check_c.sh \ check_fortran.sh \ check_strided.sh \ check_openscop.sh \ check_special.sh TESTS = $(check_SCRIPTS) EXTRA_DIST = \ $(check_SCRIPTS) \ $(srcdir)/checker.sh \ $(srcdir)/check_run.sh \ $(CLOOGTEST_C:%=%.cloog) \ $(CLOOGTEST_C:%=%.c) \ $(FINITE_CLOOGTEST_C:%=%.good.c) \ $(CLOOGTEST_FORTRAN:%=%.cloog) \ $(CLOOGTEST_FORTRAN:%=%.f) \ $(CLOOGTEST_STRIDED:%=%.cloog) \ $(CLOOGTEST_STRIDED:%=%.c) \ $(CLOOGTEST_OPENSCOP:%=%.scop) \ $(CLOOGTEST_OPENSCOP:%=%.c) \ $(SPECIAL_TESTS:%=%.cloog) \ $(SPECIAL_TESTS:%=%.c) \ $(SPECIAL_TESTS:%=%.good.c) all: all-am .SUFFIXES: .SUFFIXES: .c .lo .o .obj $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign test/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign test/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): clean-noinstPROGRAMS: @list='$(noinst_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list generate_test$(EXEEXT): $(generate_test_OBJECTS) $(generate_test_DEPENDENCIES) $(EXTRA_generate_test_DEPENDENCIES) @rm -f generate_test$(EXEEXT) $(AM_V_CCLD)$(LINK) $(generate_test_OBJECTS) $(generate_test_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/generate_test.Po@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(AM_V_CC)$(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LTCOMPILE) -c -o $@ $< mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags check-TESTS: $(TESTS) @failed=0; all=0; xfail=0; xpass=0; skip=0; \ srcdir=$(srcdir); export srcdir; \ list=' $(TESTS) '; \ $(am__tty_colors); \ if test -n "$$list"; then \ for tst in $$list; do \ if test -f ./$$tst; then dir=./; \ elif test -f $$tst; then dir=; \ else dir="$(srcdir)/"; fi; \ if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xpass=`expr $$xpass + 1`; \ failed=`expr $$failed + 1`; \ col=$$red; res=XPASS; \ ;; \ *) \ col=$$grn; res=PASS; \ ;; \ esac; \ elif test $$? -ne 77; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xfail=`expr $$xfail + 1`; \ col=$$lgn; res=XFAIL; \ ;; \ *) \ failed=`expr $$failed + 1`; \ col=$$red; res=FAIL; \ ;; \ esac; \ else \ skip=`expr $$skip + 1`; \ col=$$blu; res=SKIP; \ fi; \ echo "$${col}$$res$${std}: $$tst"; \ done; \ if test "$$all" -eq 1; then \ tests="test"; \ All=""; \ else \ tests="tests"; \ All="All "; \ fi; \ if test "$$failed" -eq 0; then \ if test "$$xfail" -eq 0; then \ banner="$$All$$all $$tests passed"; \ else \ if test "$$xfail" -eq 1; then failures=failure; else failures=failures; fi; \ banner="$$All$$all $$tests behaved as expected ($$xfail expected $$failures)"; \ fi; \ else \ if test "$$xpass" -eq 0; then \ banner="$$failed of $$all $$tests failed"; \ else \ if test "$$xpass" -eq 1; then passes=pass; else passes=passes; fi; \ banner="$$failed of $$all $$tests did not behave as expected ($$xpass unexpected $$passes)"; \ fi; \ fi; \ dashes="$$banner"; \ skipped=""; \ if test "$$skip" -ne 0; then \ if test "$$skip" -eq 1; then \ skipped="($$skip test was not run)"; \ else \ skipped="($$skip tests were not run)"; \ fi; \ test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ report=""; \ if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ dashes=`echo "$$dashes" | sed s/./=/g`; \ if test "$$failed" -eq 0; then \ col="$$grn"; \ else \ col="$$red"; \ fi; \ echo "$${col}$$dashes$${std}"; \ echo "$${col}$$banner$${std}"; \ test -z "$$skipped" || echo "$${col}$$skipped$${std}"; \ test -z "$$report" || echo "$${col}$$report$${std}"; \ echo "$${col}$$dashes$${std}"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am $(MAKE) $(AM_MAKEFLAGS) $(check_SCRIPTS) $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: check-am all-am: Makefile $(PROGRAMS) installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool clean-noinstPROGRAMS \ mostlyclean-am distclean: distclean-am -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: check-am install-am install-strip .PHONY: CTAGS GTAGS all all-am check check-TESTS check-am clean \ clean-generic clean-libtool clean-noinstPROGRAMS ctags \ distclean distclean-compile distclean-generic \ distclean-libtool distclean-tags distdir dvi dvi-am html \ html-am info info-am install install-am install-data \ install-data-am install-dvi install-dvi-am install-exec \ install-exec-am install-html install-html-am install-info \ install-info-am install-man install-pdf install-pdf-am \ install-ps install-ps-am install-strip installcheck \ installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags uninstall uninstall-am FORCE: ../libcloog-isl.la: FORCE cd ..; $(MAKE) $(AM_MAKEFLAGS) libcloog-isl.la generate: @echo " /*-----------------------------------------------*" @echo " * Generate files *" @echo " *-----------------------------------------------*/" @for x in $(CLOOGTEST_C) ; do \ echo "Generate $$x.c" ; \ $(top_builddir)/cloog $(srcdir)/$$x.cloog -o $(srcdir)/$$x.c ; \ done ; \ for x in $(CLOOGTEST_FORTRAN) ; do \ echo "Generate $$x.f" ; \ $(top_builddir)/cloog $(srcdir)/$$x.cloog -o $(srcdir)/$$x.f ; \ done ; \ for x in $(CLOOGTEST_STRIDED) ; do \ echo "Generate $$x.c" ; \ $(top_builddir)/cloog $(srcdir)/$$x.cloog \ -strides 1 -o $(srcdir)/$$x.c ; \ done ; \ for x in $(CLOOGTEST_OPENSCOP) ; do \ echo "Generate $$x.c" ; \ $(top_builddir)/cloog $(srcdir)/$$x.scop \ -openscop -o $(srcdir)/$$x.c ; \ done ; \ for line in $(SPECIAL_OPTIONS); do \ options=`echo $$line | sed -e 's/^[^ ]* //'`; \ x=`echo $$line | sed -e 's/ .*//'`; \ echo "Generate file $$x ($$options)" ; \ $(top_builddir)/cloog$(EXEEXT) $(srcdir)/$$x.cloog \ $$options > $(srcdir)/$$x.c ; \ done generate_good: @for x in $(FINITE_CLOOGTEST_C) ; do \ echo "Generate $$x.good.c" ; \ $(top_builddir)/cloog$(EXEEXT) -callable 1 $(srcdir)/$$x.cloog -o $(srcdir)/$$x.good.c ; \ done; \ for line in $(SPECIAL_OPTIONS); do echo $$line | while read x options; do \ echo "Generate $$x.good.c ($$options)" ; \ $(top_builddir)/cloog$(EXEEXT) -callable 1 $$options $(srcdir)/$$x.cloog -o $(srcdir)/$$x.good.c ; \ done; done valgrind: @echo " /*-----------------------------------------------*" @echo " * Checking files by Valgrind *" @echo " *-----------------------------------------------*/" for x in $(CLOOGTEST_C) ; do \ echo "Valgrinding $$x.c" ; \ valgrind $(top_builddir)/cloog$(EXEEXT) $(srcdir)/$$x.cloog ; \ done ; \ for x in $(CLOOGTEST_FORTRAN) ; do \ echo "Valgrinding $$x.f" ; \ valgrind $(top_builddir)/cloog$(EXEEXT) $(srcdir)/$$x.cloog ; \ done test_run: generate_test$(EXEEXT) $(TESTS_ENVIRONMENT) \ $(srcdir)/check_run.sh # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: cloog-0.18.2/test/lineality-1-2.good.c0000664000175000017500000000145712254312305014175 00000000000000/* Generated from ../../../git/cloog/test/lineality-1-2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; S1(1,1) ; S2(1,1) ; for (j=2;j<=M;j++) { S1(1,j) ; } for (i=2;i<=M-1;i++) { for (j=1;j<=i-1;j++) { S1(i,j) ; } S1(i,i) ; S2(i,i) ; for (j=i+1;j<=M;j++) { S1(i,j) ; } } for (j=1;j<=M-1;j++) { S1(M,j) ; } S1(M,M) ; S2(M,M) ; } cloog-0.18.2/test/basic-bounds-3.cloog0000664000175000017500000000025012254312305014337 00000000000000# language: C c # Context 2 3 # M 1 1 1 0 1 0 1 0 1 # Number of statements 1 # 3 4 # i M 1 1 1 0 0 1 -1 1 0 1 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/test.c0000664000175000017500000000055512254312305011734 00000000000000/* Generated from /home/skimo/git/cloog/test/test.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.01s. */ for (i=1;i<=2;i++) { for (j=1;j<=M;j++) { S1(i,j); } } for (i=3;i<=N;i++) { for (j=1;j<=min(M,i-1);j++) { S1(i,j); } if (i >= M+1) { S2(i,i); } if (i <= M) { S1(i,i); S2(i,i); } for (j=i+1;j<=M;j++) { S1(i,j); } } cloog-0.18.2/test/vivien2.c0000664000175000017500000000620612254312305012336 00000000000000/* Generated from /home/skimo/git/cloog/test/vivien2.cloog by CLooG 0.14.0-292-g2bfd6ac gmp bits in 0.10s. */ for (p1=-54*n+4;p1<=4;p1++) { if (p1%2 == 0) { S1((p1-2)/2); } } S3(1); S4(1,2); S1(2); S6(1,2); for (p1=7;p1<=9;p1++) { if (p1 == 8) { S4(1,3); } if (p1 == 8) { S1(3); } if (p1 == 8) { S6(1,3); } if (p1 == 9) { S3(2); } if ((p1+1)%2 == 0) { S2((p1-3)/2,1); } } for (p1=10;p1<=2*n+58;p1++) { p2 = ceild(-p1+2,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+5,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } } if (p1 >= 4*n-4) { if (p1%2 == 0) { for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } p2 = ceild(-p1+6,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+9,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } for (p2=ceild(-p1+10,4);p2<=min(-1,floord(-p1+2*n,2));p2++) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } if (p1%2 == 0) { S6(-p2+2,(p1+2*p2-4)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } if ((p1 >= 2*n+4) && (p1 <= 4*n-6)) { if (p1%2 == 0) { S6((p1-2*n+2)/2,n-1); for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } if (p1 >= 2*n+6) { if (p1%2 == 0) { S6((p1-2*n)/2,n); } } if (p1 <= 2*n+4) { if (p1%2 == 0) { S6(2,(p1-4)/2); } if ((p1+3)%4 == 0) { S3((p1-1)/4); } if (p1%2 == 0) { S1((p1-2)/2); } } if (p1 >= 2*n+5) { if ((p1+3)%4 == 0) { S3((p1-1)/4); } if (p1%2 == 0) { S1((p1-2)/2); } } if (p1 <= 2*n+2) { if (p1%2 == 0) { S6(1,(p1-2)/2); } } for (p2=max(1,ceild(p1-2*n-1,2));p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { S2((p1-2*p2-1)/2,p2); } } } for (p1=2*n+59;p1<=4*n-2;p1++) { p2 = ceild(-p1+2,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+5,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } } if (p1 >= 4*n-4) { if (p1%2 == 0) { for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } p2 = ceild(-p1+6,4); if (p2 <= min(floord(-p1+2*n,2),floord(-p1+9,4))) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { S4(-p2,(p1+2*p2)/2); } if (p1%2 == 0) { S6(-p2+2,(p1+2*p2-4)/2); } for (p3=1;p3<=-p2;p3++) { if (p1%2 == 0) { S5(-p2+1,(p1+2*p2-2)/2,p3); } } } if (p1 <= 4*n-6) { if (p1%2 == 0) { S6((p1-2*n+2)/2,n-1); for (p3=1;p3<=floord(p1-2*n-2,2);p3++) { S5((p1-2*n)/2,n,p3); } } } if (p1%2 == 0) { S6((p1-2*n)/2,n); } if ((p1+3)%4 == 0) { S3((p1-1)/4); } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { S2((p1-2*p2-1)/2,p2); } } } S2(n,n-1); S3(n); cloog-0.18.2/test/no_lindep.good.c0000664000175000017500000000104712254312305013650 00000000000000/* Generated from ../../../git/cloog/test/no_lindep.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int M, int N) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i; c1 = M+1 ; i = N+2 ; S1(N+2) ; } cloog-0.18.2/test/darte.c0000664000175000017500000000310112254312305012042 00000000000000/* Generated from /home/skimo/git/cloog/test/darte.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.05s. */ if (n >= 1) { for (t3=n+3;t3<=3*n+1;t3++) { if ((t3+n+1)%2 == 0) { S1(1,n,(t3-n-1)/2); } } for (t1=-n+2;t1<=n-1;t1++) { if (t1 >= 0) { for (t3=t1+4;t3<=t1+2*n+2;t3++) { if ((t1+t3)%2 == 0) { S1(t1+1,1,(-t1+t3-2)/2); } } } for (t2=max(-t1+2,t1+3);t2<=-t1+4;t2++) { for (t3=t2+2;t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { if ((t1+t3)%2 == 0) { S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2); } } } } for (t2=max(-t1+5,t1+3);t2<=min(-t1+2*n,t1+2*n);t2++) { for (t3=1;t3<=min(n,t2+1);t3++) { if ((t1+t2+1)%2 == 0) { S2((t1+t2-3)/2,(-t1+t2-1)/2,t3); } } for (t3=t2+2;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { S2((t1+t2-3)/2,(-t1+t2-1)/2,t3); } if ((t1+t2)%2 == 0) { if ((t1+t3)%2 == 0) { S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2); } } } for (t3=max(n+1,t2+2);t3<=t2+2*n;t3++) { if ((t1+t2)%2 == 0) { if ((t1+t3)%2 == 0) { S1((t1+t2)/2,(-t1+t2)/2,(-t2+t3)/2); } } } } if (t1 <= -1) { for (t3=1;t3<=n;t3++) { S2(t1+n-1,n,t3); } } for (t2=-t1+2*n+1;t2<=min(-t1+2*n+3,t1+2*n+1);t2++) { for (t3=1;t3<=n;t3++) { if ((t1+t2+1)%2 == 0) { S2((t1+t2-3)/2,(-t1+t2-1)/2,t3); } } } } for (t3=1;t3<=n;t3++) { S2(n,1,t3); } } cloog-0.18.2/test/iftest.good.c0000664000175000017500000000110712254312305013174 00000000000000/* Generated from ../../../git/cloog/test/iftest.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int m, int n) { /* Original iterators. */ int i; for (i=1;i<=n;i++) { if (i <= 2*m) { S1(i) ; } if (i >= max(m,2*m+1)) { S1(i) ; } } } cloog-0.18.2/test/orc.cloog0000664000175000017500000000516012254312305012416 00000000000000 #-------------------CONTEXT------------------------ c # language is c # Context (no constarints on parameters) 1 2 # 1 lines and 2 coloumns # 1 1 0 1 # We want to set manually the parameter names #---------------------STATEMENTS-------------------- 7 #Number of Statements 1 #STMT 1 at line no. 12 has 1 domain # Domain 1 2 3 # i 1 1 1 0 1 -1 2 0 0 0 1 #STMT 2 at line no. 15 has 1 domain # Domain 1 4 4 # i j 1 1 1 0 0 1 -1 0 2 1 0 1 0 1 -1 -1 11 0 0 0 1 #STMT 3 at line no. 16 has 1 domain # Domain 1 4 4 # i j 1 1 1 0 0 1 -1 0 2 1 0 1 0 1 -1 -1 11 0 0 0 1 #STMT 4 at line no. 20 has 1 domain # Domain 1 2 3 # i 1 1 1 0 1 -1 2 0 0 0 1 #STMT 1 at line no. 32 has 1 domain # Domain 1 2 3 # l 1 1 1 0 1 -1 14 0 0 0 1 #STMT 2 at line no. 37 has 1 domain # Domain 1 4 4 # l m 1 1 1 0 0 1 -1 0 14 1 0 1 0 1 0 -1 9 0 0 0 1 #STMT 3 at line no. 41 has 1 domain # Domain 1 2 3 # l 1 1 1 0 1 -1 14 0 0 0 1 # Set Iterator Names i j #Iterator Names #---------------------SCATTERING FUNCTIONS-------------------- 7 #Scattering functions # Scattering Matrix for stmt at line no.12 3 6 # p0 p1 p2 i 1 0 1 0 0 0 0 0 0 1 0 -3 0 0 0 0 1 0 0 # Scattering Matrix for stmt at line no.15 3 7 # p0 p1 p2 i j 1 0 1 0 0 0 0 0 0 0 1 0 -3 0 -1 0 0 0 1 0 -2 0 # Scattering Matrix for stmt at line no.16 3 7 # p0 p1 p2 i j 1 0 1 0 0 0 0 0 0 0 1 0 -3 0 -1 0 0 0 1 0 -2 -1 # Scattering Matrix for stmt at line no.20 3 6 # p0 p1 p2 i 1 0 1 0 0 0 0 0 0 1 0 -3 -2 0 0 0 1 0 0 # Scattering Matrix for stmt at line no.32 3 6 # p0 p1 p2 l 1 0 1 0 0 0 -2 0 0 1 0 -3 0 0 0 0 1 0 0 # Scattering Matrix for stmt at line no.37 3 7 # p0 p1 p2 l m 1 0 1 0 0 0 0 -2 0 0 1 0 -3 0 -1 0 0 0 1 0 -1 0 # Scattering Matrix for stmt at line no.41 3 6 # p0 p1 p2 l 1 0 1 0 0 0 -2 0 0 1 0 -3 -2 0 0 0 1 0 0 1 # Set manually the scattering dimension names p0 p1 p2 #Scattering dimension names cloog-0.18.2/test/emploi.c0000664000175000017500000000045612254312305012242 00000000000000/* Generated from ../../../git/cloog/test/emploi.cloog by CLooG 0.14.0-245-gd8c1718 gmp bits in 0.01s. */ if (n >= 1) { if (m >= 1) { for (i=1;i<=n;i++) { S1(i); for (j=1;j<=m;j++) { S2(i,j); } } } if (m <= 0) { for (i=1;i<=n;i++) { S1(i); } } } cloog-0.18.2/test/donotsimp.cloog0000664000175000017500000000167412254312305013655 00000000000000# Language c # Context # {n>=20} 1 3 1 1 -20 0 # Number of statments 2 1 # {i,j | 0<=i<=10 1<=j<=i} 4 5 1 1 0 0 -1 1 -1 0 0 10 1 0 1 0 -1 1 1 -1 0 0 0 0 0 1 # {i,j | 0<=i<=10 11<=j<=n} 4 5 1 1 0 0 -1 1 -1 0 0 10 1 0 1 0 -11 1 0 -1 1 0 0 0 0 0 # Scattering functions 2 5 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 5 10 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 cloog-0.18.2/test/mode.c0000664000175000017500000000071612254312305011700 00000000000000/* Generated from /home/skimo/git/cloog/test/mode.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.00s. */ if (M >= 0) { if (N >= 0) { for (i=0;i<=M;i++) { for (j=0;j<=min(N,i);j++) { S1(i,j); S2(i,j); } for (j=N+1;j<=i;j++) { S1(i,j); } for (j=i+1;j<=N;j++) { S2(i,j); } } } if (N <= -1) { for (i=0;i<=M;i++) { for (j=0;j<=i;j++) { S1(i,j); } } } } cloog-0.18.2/test/uday_scalars.c0000664000175000017500000000033612254312305013424 00000000000000/* Generated from ../../../git/cloog/test/uday_scalars.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (n >= 0) { for (p3=0;p3<=n;p3++) { S1(p3,0,0) ; } for (p3=0;p3<=n;p3++) { S2(0,p3,0) ; } } cloog-0.18.2/test/lineality-1-2.cloog0000664000175000017500000000064012254312305014120 00000000000000# language: C c # Context # {M | 2<=M} 2 3 # M 1 1 1 -2 1 0 1 0 2 # Number of statements 1 # {i,j,M | 1<=i<=M; 1<=j<=M} 5 5 # i j M 1 1 1 0 0 -1 1 0 1 0 -1 1 -1 0 1 0 1 0 -1 1 0 1 0 0 0 1 0 0 0 1 # {i,j,M | i=j; 1<=j<=M} 4 5 # i j M 1 0 1 -1 0 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/guide.good.c0000664000175000017500000000122312254312305012772 00000000000000/* Generated from ../../../git/cloog/test/guide.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } void test(int M, int N) { /* Original iterators. */ int i; for (i=1;i<=N;i++) { if (i >= M) { S1(i) ; } if (i <= min(2*M,M-1)) { S1(i) ; } } for (i=N+1;i<=2*N;i++) { S2(i) ; } } cloog-0.18.2/test/stride2.c0000664000175000017500000000024112254312305012321 00000000000000/* Generated from stride2.cloog by CLooG 0.14.0-200-g26bdb56 gmp bits in 0.00s. */ for (c1=3;c1<=100;c1+=3) { if (c1 == 27) { S1(27); } S2(c1,c1/3); } cloog-0.18.2/test/logopar.good.c0000664000175000017500000000205112254312305013340 00000000000000/* Generated from ../../../git/cloog/test/logopar.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int m, int n) { /* Original iterators. */ int i, j; for (j=0;j<=m;j++) { S1(1,j) ; } if (m >= n+1) { for (i=2;i<=n;i++) { for (j=0;j<=i-2;j++) { S2(i,j) ; } for (j=i-1;j<=n;j++) { S1(i,j) ; S2(i,j) ; } for (j=n+1;j<=m;j++) { S1(i,j) ; } } } if (m == n) { for (i=2;i<=n;i++) { for (j=0;j<=i-2;j++) { S2(i,j) ; } for (j=i-1;j<=n;j++) { S1(i,j) ; S2(i,j) ; } } } for (i=n+1;i<=m+1;i++) { for (j=i-1;j<=m;j++) { S1(i,j) ; } } } cloog-0.18.2/test/equality2.cloog0000664000175000017500000000514612254312305013556 00000000000000c # Context (0 parameter(s)): 1 2 1 1 1 # Parameter name(s) # Statement number: 2 # Iteration domain of statement 2. 1 13 13 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 -998 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 0 0 -2 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 -500 0 0 0 0 0 0 0 1 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 1 0 -2 1 0 0 0 0 0 0 0 0 0 0 1 -1 0 1 0 0 0 0 0 0 0 1 0 0 0 -1 1 0 0 0 0 0 0 0 -1 0 0 0 10000 1 0 0 0 0 0 0 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 0 0 -1 9 0 0 0 # For future options. # Iteration domain of statement 3. 1 17 17 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 -999 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -2 -998 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -2 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 -500 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 10000 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 9 0 0 0 # For future options. 1 # Iterator name(s) i0 i1 i2 i3 i4 i5 i6 i7 i8 i9 i10 i11 i12 i13 i14 # No scattering functions. 0 cloog-0.18.2/test/iftest2.cloog0000664000175000017500000000112212254312305013205 00000000000000# language: C c # The context (no constraints on parameters) 1 4 # 1 lines and 4 columns # m n 1 1 0 0 0 0 1 # The number of statements 2 # First statement # The first domain 5 6 # 3 lines and 5 columns # i j m n 1 1 1 0 0 0 -1 # i >= 1 1 -1 0 0 1 0 # i <= n 1 1 0 -1 0 0 # i >= m 1 0 1 0 0 -1 1 0 -1 1 0 0 # The second domain 5 6 # 3 lines and 5 columns # i j m n 1 1 1 0 0 0 -1 # i >= 1 1 -1 0 0 1 0 # i <= n 1 -1 0 2 0 0 # i <= 2*m 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 0 cloog-0.18.2/test/vivien.good.c0000664000175000017500000004353112254312305013205 00000000000000/* Generated from ../../../git/cloog/test/vivien.cloog by CLooG 0.14.0-76-gef19709 gmp bits in 0.78s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i) { hash(3); hash(i); } #define S4(i,j) { hash(4); hash(i); hash(j); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } #define S6(i,j) { hash(6); hash(i); hash(j); } void test(int n) { /* Scattering iterators. */ int p1, p2, p3; /* Original iterators. */ int i, j, k; for (p1=-54*n+4;p1<=min(4,4*n+1);p1++) { if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } } if (n >= 1) { S3(1) ; } if (n >= 2) { S4(1,2) ; S1(2) ; S6(1,2) ; } for (p1=max(-54*n+4,4*n+2);p1<=6;p1++) { if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } } for (p1=7;p1<=min(min(2*n+2,9),floord(4*n+12,3));p1++) { for (p2=ceild(-p1+2,4);p2<=-1;p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } if (p1%2 == 0) { j = (p1-2)/2 ; S6(1,(p1-2)/2) ; } if ((p1+1)%2 == 0) { i = (p1-3)/2 ; S2((p1-3)/2,1) ; } } for (p1=2*n+3;p1<=min(9,4*n-2);p1++) { for (p2=ceild(-p1+2,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } if (n >= 4) { S4(2,3) ; S4(1,4) ; S5(2,3,1) ; S6(2,3) ; S1(4) ; S6(1,4) ; } if (n == 3) { S4(2,3) ; S5(2,3,1) ; S6(2,3) ; S1(4) ; } for (p1=11;p1<=min(12,2*n+2);p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=-1;p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } if (p1%2 == 0) { j = (p1-4)/2 ; S6(2,(p1-4)/2) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } if (p1%2 == 0) { j = (p1-2)/2 ; S6(1,(p1-2)/2) ; } if ((p1+1)%2 == 0) { i = (p1-3)/2 ; S2((p1-3)/2,1) ; } for (p2=2;p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } if (n == 4) { S2(4,1) ; S2(3,2) ; } if (n == 5) { S3(3) ; S2(5,1) ; S2(4,2) ; } if (n >= 6) { S3(3) ; S2(5,1) ; S2(4,2) ; } if ((n <= 4) && (n >= 4)) { p1 = 2*n+4 ; for (p2=ceild(-n-1,2);p2<=-2;p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; } for (p2=ceild(-n+1,2);p2<=-1;p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } S6(2,n) ; i = n+1 ; S1(n+1) ; } for (p1=14;p1<=2*n+2;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } p2 = floord(-p1+9,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+10,4);p2<=-1;p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } if (p1%2 == 0) { j = (p1-4)/2 ; S6(2,(p1-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } if (p1%2 == 0) { j = (p1-2)/2 ; S6(1,(p1-2)/2) ; } if ((p1+1)%2 == 0) { i = (p1-3)/2 ; S2((p1-3)/2,1) ; } for (p2=2;p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } if ((n <= 4) && (n >= 4)) { S3(3) ; for (p2=-n+6;p2<=2;p2++) { i = -p2+6 ; S2(-p2+6,p2) ; } } if (n >= 7) { p1 = 2*n+3 ; if ((n+1)%2 == 0) { i = (n+1)/2 ; S3((n+1)/2) ; } S2(n,1) ; for (p2=2;p2<=floord(n,2);p2++) { i = -p2+n+1 ; S2(-p2+n+1,p2) ; } } if ((n <= 6) && (n >= 6)) { p1 = 2*n+3 ; if ((n+1)%2 == 0) { i = (n+1)/2 ; S3((n+1)/2) ; } S2(n,1) ; for (p2=2;p2<=floord(n,2);p2++) { i = -p2+n+1 ; S2(-p2+n+1,p2) ; } } if (n >= 7) { p1 = 2*n+4 ; for (p2=ceild(-n-1,2);p2<=floord(-2*n+1,4);p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; } for (p2=ceild(-n+1,2);p2<=floord(-2*n+5,4);p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } for (p2=ceild(-n+3,2);p2<=-2;p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; i = -p2+2 ; j = p2+n ; S6(-p2+2,p2+n) ; for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } j = n-1 ; S6(3,n-1) ; S5(2,n,1) ; S6(2,n) ; i = n+1 ; S1(n+1) ; } if ((n <= 5) && (n >= 5)) { p1 = 2*n+4 ; for (p2=ceild(-n-1,2);p2<=floord(-2*n+1,4);p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; } for (p2=ceild(-n+1,2);p2<=-2;p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } for (p2=-1;p2<=floord(-2*n+5,4);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } for (p2=ceild(-n+3,2);p2<=-1;p2++) { i = -p2+2 ; j = p2+n ; S6(-p2+2,p2+n) ; for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } S6(2,n) ; i = n+1 ; S1(n+1) ; } if ((n <= 6) && (n >= 6)) { p1 = 2*n+4 ; for (p2=ceild(-n-1,2);p2<=floord(-2*n+1,4);p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; } for (p2=ceild(-n+1,2);p2<=-2;p2++) { j = p2+n+2 ; S4(-p2,p2+n+2) ; for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; j = p2+n+1 ; S5(-p2+1,p2+n+1,p3) ; } } j = n-1 ; S6(3,n-1) ; S5(2,n,1) ; S6(2,n) ; i = n+1 ; S1(n+1) ; } for (p1=2*n+5;p1<=min(4*n-10,2*n+58);p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } p2 = floord(-p1+9,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+2*n+3,2);p2<=min(floord(-p1+2*n+4,2),-1);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-9,2*n+5);p1<=min(4*n-8,2*n+58);p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+2*n+3,2);p2<=min(floord(-p1+2*n+4,2),-1);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-7,2*n+5);p1<=min(4*n-6,2*n+58);p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+2*n+1,2);p2<=floord(-p1+9,4);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n+2,2);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+2*n+3,2);p2<=min(floord(-p1+2*n+4,2),-1);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(max(4*n-5,14),2*n+5);p1<=min(4*n-2,2*n+58);p1++) { for (p2=ceild(-p1+2,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } } for (p2=max(ceild(-p1+2*n+1,2),ceild(-p1+6,4));p2<=floord(-p1+2*n+2,2);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=max(ceild(-p1+10,4),ceild(-p1+2*n+3,2));p2<=min(floord(-p1+2*n+4,2),-1);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } if ((n >= 2) && (n <= 29)) { p1 = 4*n-1 ; p2 = n-1 ; j = n-1 ; S2(n,n-1) ; } for (p1=2*n+59;p1<=4*n-10;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } p2 = floord(-p1+9,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-9,2*n+59);p1<=4*n-8;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+2,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-7,2*n+59);p1<=4*n-6;p1++) { p2 = floord(-p1+5,4) ; if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p2=ceild(-p1+6,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+2*n+1,2);p2<=floord(-p1+9,4);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=ceild(-p1+10,4);p2<=floord(-p1+2*n+2,2);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } p2 = floord(-p1+2*n+4,2) ; i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n-5,2*n+59);p1<=4*n-2;p1++) { for (p2=ceild(-p1+2,4);p2<=floord(-p1+2*n,2);p2++) { if (p1%2 == 0) { j = (p1+2*p2)/2 ; S4(-p2,(p1+2*p2)/2) ; } } for (p2=max(ceild(-p1+2*n+1,2),ceild(-p1+6,4));p2<=floord(-p1+2*n+2,2);p2++) { for (p3=1;p3<=-p2;p3++) { i = -p2+1 ; if (p1%2 == 0) { j = (p1+2*p2-2)/2 ; S5(-p2+1,(p1+2*p2-2)/2,p3) ; } } } for (p2=max(ceild(-p1+10,4),ceild(-p1+2*n+3,2));p2<=floord(-p1+2*n+4,2);p2++) { i = -p2+2 ; if (p1%2 == 0) { j = (p1+2*p2-4)/2 ; S6(-p2+2,(p1+2*p2-4)/2) ; } } if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } for (p2=ceild(p1-2*n-1,2);p2<=floord(p1-3,4);p2++) { if ((p1+1)%2 == 0) { i = (p1-2*p2-1)/2 ; S2((p1-2*p2-1)/2,p2) ; } } } for (p1=max(4*n,7);p1<=min(4*n+1,2*n+58);p1++) { if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } } if (n >= 30) { p1 = 4*n-1 ; p2 = n-1 ; j = n-1 ; S2(n,n-1) ; } for (p1=max(max(-54*n+4,4*n+2),7);p1<=2*n+58;p1++) { if (p1%2 == 0) { i = (p1-2)/2 ; S1((p1-2)/2) ; } } for (p1=max(4*n,2*n+59);p1<=4*n+1;p1++) { if ((p1+3)%4 == 0) { i = (p1-1)/4 ; S3((p1-1)/4) ; } } } cloog-0.18.2/test/basic-bounds-6.good.c0000664000175000017500000000073212254312305014415 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-6.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test() { /* Original iterators. */ int i; S1(-1) ; } cloog-0.18.2/test/min-4-1.cloog0000664000175000017500000000041612254312305012714 00000000000000# language: C c # Context # {L,M,N|} 1 5 # L M N 1 1 0 0 0 1 0 1 # Number of statements 1 # {i|-L,-M <= i <= M, N} 5 6 # i L M N 1 1 1 1 0 0 0 1 1 0 1 0 0 1 -1 0 1 0 0 1 -1 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/walters.cloog0000664000175000017500000000264612254312305013322 00000000000000# language: C c # parameters 1 2 1 1 1 4 # S1: sub1 1 18 6 1 1 0 0 0 -1 1 -1 0 0 0 10 1 -1 3 0 0 2 1 1 -3 0 0 0 1 0 1 0 0 -1 1 -1 3 0 0 0 1 1 0 -3 0 2 1 -1 0 3 0 0 1 1 0 0 -3 1 1 -1 0 0 3 1 1 1 0 0 0 -1 1 -1 0 0 0 10 1 1 -3 0 0 0 1 -1 3 0 0 2 1 1 0 -3 0 2 1 -1 0 3 0 0 1 1 0 0 -3 1 1 -1 0 0 3 1 0 0 0 # S2: sub2 1 17 6 1 1 0 0 0 -1 1 -1 0 0 0 10 1 -1 0 3 0 0 1 1 0 -3 0 2 1 -1 0 3 0 -2 1 1 -3 0 0 0 1 -1 3 0 0 2 1 1 0 0 -3 1 1 -1 0 0 3 1 1 1 0 0 0 -1 1 -1 0 0 0 10 1 1 -3 0 0 0 1 -1 3 0 0 2 1 1 0 -3 0 2 1 -1 0 3 0 0 1 1 0 0 -3 1 1 -1 0 0 3 1 0 0 0 # S3: sub3 1 18 6 1 -1 0 0 0 10 1 1 0 0 0 -1 1 -1 0 0 3 1 1 1 0 0 -3 1 1 0 0 0 1 -1 1 -1 0 0 3 -1 1 1 -3 0 0 0 1 -1 3 0 0 2 1 1 0 -3 0 2 1 -1 0 3 0 0 1 1 0 0 0 -1 1 -1 0 0 0 10 1 1 -3 0 0 0 1 -1 3 0 0 2 1 1 0 -3 0 2 1 -1 0 3 0 0 1 1 0 0 -3 1 1 -1 0 0 3 1 0 0 0 # S4: enclosing 1 8 6 1 1 0 0 0 -1 1 -1 0 0 0 10 1 1 -3 0 0 0 1 -1 3 0 0 2 1 1 0 -3 0 2 1 -1 0 3 0 0 1 1 0 0 -3 1 1 -1 0 0 3 1 0 0 0 1 i div36 div37 div38 0 0 cloog-0.18.2/test/stride2.cloog0000664000175000017500000000021712254312305013205 00000000000000c 0 2 0 2 1 1 3 0 -1 27 -1 0 0 1 3 4 1 1 0 -3 1 -1 0 100 0 1 -3 0 0 0 0 0 2 2 5 0 -1 0 1 0 0 0 -1 0 0 2 6 0 -1 0 1 0 0 0 0 -1 0 1 0 0 cloog-0.18.2/test/forwardsub-1-1-2.good.c0000664000175000017500000000137512254312305014516 00000000000000/* Generated from ../../../git/cloog/test/forwardsub-1-1-2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } #define S4(i,j) { hash(4); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; S3(1,1) ; S1(2,1) ; S4(2,2) ; for (i=3;i<=M;i++) { S1(i,1) ; for (j=2;j<=i-1;j++) { S2(i,j) ; } S4(i,i) ; } } cloog-0.18.2/test/mod4.c0000664000175000017500000000035512254312305011616 00000000000000/* Generated from /home/skimo/git/cloog/test/mod4.cloog by CLooG 0.14.0-225-g6e2d019 gmp bits in 0.00s. */ for (j=2;j<=10;j+=3) { S1(j,(j+1)/3,(j+1)/3,2,(j-2)/3); S2(j,(j+1)/3,(j+1)/3,2,(j-2)/3); S3(j,(j+1)/3,(j+1)/3,2,(j-2)/3); } cloog-0.18.2/test/levenshtein-1-2-3f.cloog0000664000175000017500000000356012254312305014764 00000000000000# language: FORTRAN f # Context # {length,width | width+2<=length; 1<=width} 3 4 # M N 1 1 1 -1 -2 1 0 1 -1 1 0 0 1 0 8 # Number of statements 1 # {t1,t2,length,width | t1=0; t2=0; width+2<=length; 1<=width} 5 6 # i j M N 1 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 1 -1 -2 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | 1<=t1<=width; t2=0; width+2<=length} 5 6 # i j M N 1 0 0 1 0 0 0 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 0 1 -1 -2 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | t1=t2; 1<=t2<=width; width+2<=length} 5 6 # i j M N 1 0 1 -1 0 0 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 -1 -2 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | t1=2t2-width; width+1<=t2<=length-1; 1<=width} 5 6 # i j M N 1 0 1 -2 0 1 0 1 0 1 0 -1 -1 1 0 -1 1 0 -1 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | t1=2t2+width; 1<=t2<=length-width-1; 1<=width} 5 6 # i j M N 1 0 1 -2 0 -1 0 1 0 1 0 0 -1 1 0 -1 1 -1 -1 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | (2t2-width+1,t2+1)<=t1<=(t2+length-1,2t2+width-1); 1<=t2<=length-1; width+2<=length} 8 6 # i j M N 1 1 1 -2 0 1 -1 1 1 -1 0 0 -1 1 -1 1 1 0 -1 1 -1 2 0 1 -1 1 0 1 0 0 -1 1 0 -1 1 0 -1 1 0 0 1 -1 -2 1 0 0 0 0 1 0 0 0 1 # {t1,t2,length,width | (width+1,2t2+width+1)<=t1<=(2length-width-2,2t2+width+2); width+2<=length; 1<=width} 6 6 # i j M N 1 1 1 0 0 -1 -1 1 1 -2 0 -1 -1 1 -1 0 2 -1 -2 1 -1 2 0 1 2 1 0 0 1 -1 -2 1 0 0 0 1 -1 0 0 0 1 # {t1,t2,length,width | (width+1,2t2-width)<=t1<=(2t2+width,2length-width-2); width+2<=length; 1<=width} 7 6 # i j M N 1 1 1 0 0 -1 -1 1 1 -2 0 1 0 1 -1 2 0 1 0 1 -1 0 2 -1 -2 1 0 0 1 -1 -2 1 0 0 0 1 -1 1 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/stride4.c0000664000175000017500000000027012254312305012325 00000000000000/* Generated from ../../../git/cloog/test/stride4.cloog by CLooG 0.16.0-10-g13c6274 gmp bits in 0.00s. */ if ((t >= 0) && (t <= 15)) { for (i0=t;i0<=99;i0+=16) { S1(i0,t); } } cloog-0.18.2/test/block2.c0000664000175000017500000000025312254312305012124 00000000000000/* Generated from /home/skimo/git/cloog/test/block2.cloog by CLooG 0.14.0-302-g309b32c gmp bits in 0.01s. */ for (c0=0;c0<=9;c0++) { S1(c0,1); S3(c0,1); S2(c0,1); } cloog-0.18.2/test/gesced3.good.c0000664000175000017500000000141412254312305013214 00000000000000/* Generated from ../../../git/cloog/test/gesced3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } void test(int M, int N) { /* Scattering iterators. */ int c1; /* Original iterators. */ int i; for (c1=M+1;c1<=2*M;c1++) { i = c1-M ; S1(c1-M) ; } for (c1=2*M+1;c1<=M+N;c1++) { i = c1-2*M ; S2(c1-2*M) ; i = c1-M ; S1(c1-M) ; } for (c1=M+N+1;c1<=2*M+N;c1++) { i = c1-2*M ; S2(c1-2*M) ; } } cloog-0.18.2/test/no_lindep.c0000664000175000017500000000016712254312305012723 00000000000000/* Generated from ../../../git/cloog/test/no_lindep.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ S1(N+2) ; cloog-0.18.2/test/thomasset.c0000664000175000017500000000203712254312305012761 00000000000000/* Generated from /home/skimo/git/cloog/test/thomasset.cloog by CLooG 0.14.0-292-g2bfd6ac gmp bits in 0.04s. */ if (n >= 1) { for (c1=0;c1<=floord(n-4,3);c1++) { for (i=3*c1+1;i<=3*c1+3;i++) { S1(i,c1); } } c1 = floord(n-1,3); if (c1 >= ceild(n-2,3)) { if (c1 == 0) { S1(1,0); for (j=1;j<=n;j++) { S2(1,j,0,0,0); } } if (c1 >= 1) { for (j=1;j<=2;j++) { S2(1,j,0,c1,0); } } for (i=max(2,3*c1+1);i<=n;i++) { S1(i,c1); } } if (3*c1 == n-3) { for (i=n-2;i<=n;i++) { if (n%3 == 0) { S1(i,(n-3)/3); } } } if (c1 >= ceild(n-2,3)) { for (c2=1;c2<=n-1;c2++) { for (j=1;j<=2;j++) { S2(c2+1,j,0,c1,0); } } } for (c1=ceild(n,3);c1<=floord(2*n,3);c1++) { for (c2=0;c2<=n-1;c2++) { for (j=max(1,3*c1-n);j<=min(n,3*c1-n+4);j++) { p = max(ceild(3*c1-j,3),ceild(n-2,3)); if (p <= min(floord(n,3),floord(3*c1-j+2,3))) { S2(c2+1,j,0,p,c1-p); } } } } } cloog-0.18.2/test/4-param.good.c0000664000175000017500000000142512254312305013142 00000000000000/* Generated from ../../../git/cloog/test/4-param.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i) { hash(2); hash(i); } void test(int m, int n, int p, int q) { /* Original iterators. */ int i; for (i=m;i<=min(min(n,p-1),q);i++) { S1(i) ; } for (i=p;i<=min(min(q,m-1),n);i++) { S2(i) ; } for (i=max(m,p);i<=min(n,q);i++) { S1(i) ; S2(i) ; } for (i=max(m,q+1);i<=n;i++) { S1(i) ; } for (i=max(p,n+1);i<=q;i++) { S2(i) ; } } cloog-0.18.2/test/test.cloog0000664000175000017500000000056612254312305012617 00000000000000# language: C c # parameters {m, n | 4<=m<=n} 2 4 # m n 1 1 -1 1 0 1 1 0 -4 0 2 # Number of statements 1 # {i, j | 1<=i<=n 1<=j<=m} 4 6 # i j m n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 1 # {i, j | i=j 3<=j<=N} 3 6 # i j m n 1 0 1 -1 0 0 0 1 0 1 0 0 -3 1 0 -1 0 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/esced.good.c0000664000175000017500000000127312254312305012765 00000000000000/* Generated from ../../../git/cloog/test/esced.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int n, int m) { /* Original iterators. */ int i, j; if (n >= 1) { for (i=1;i<=m;i++) { S1(i) ; for (j=1;j<=n;j++) { S2(i,j) ; } } } if (n <= 0) { for (i=1;i<=m;i++) { S1(i) ; } } } cloog-0.18.2/test/multi-stride.c0000664000175000017500000000016012254312305013367 00000000000000/* Generated from ../../../git/cloog/test/multi-stride.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ cloog-0.18.2/test/classen2.c0000664000175000017500000000412712254312305012466 00000000000000/* Generated from ../../../git/cloog/test/classen2.cloog by CLooG 0.14.0-271-gaa1e292 gmp bits in 0.14s. */ if ((M >= 2) && (N >= 3) && (outerProcTileScatter1 >= outerProcTileScatter2) && (5*outerProcTileScatter1 <= M+2*N-4) && (5*outerProcTileScatter1 <= 5*outerProcTileScatter2+N+2) && (outerProcTileScatter2 >= 0) && (5*outerProcTileScatter2 <= M+N-2) && (outerTimeTileScatter >= outerProcTileScatter1) && (outerTimeTileScatter <= 2*outerProcTileScatter1) && (outerTimeTileScatter <= outerProcTileScatter1+outerProcTileScatter2+1) && (5*outerTimeTileScatter <= 2*M+2*N-6) && (5*outerTimeTileScatter <= 5*outerProcTileScatter1+M+2) && (5*outerTimeTileScatter >= 10*outerProcTileScatter1-2*N-2) && (5*outerTimeTileScatter <= 5*outerProcTileScatter2+M+N) && (5*outerTimeTileScatter >= 10*outerProcTileScatter2-N-3) && (5*outerTimeTileScatter <= 10*outerProcTileScatter2+N+3) && (5*outerTimeTileScatter >= 5*outerProcTileScatter1+5*outerProcTileScatter2-N-4)) { for (compScatter1=max(max(max(max(max(4,5*outerTimeTileScatter),5*outerProcTileScatter2+1),5*outerProcTileScatter1+5*outerProcTileScatter2-N),10*outerProcTileScatter1-2*N+2),10*outerProcTileScatter2-N+1);compScatter1<=min(min(min(min(min(5*outerTimeTileScatter+4,2*M+2*N-6),5*outerProcTileScatter1+M+2),5*outerProcTileScatter1+5*outerProcTileScatter2+5),5*outerProcTileScatter2+M+N),10*outerProcTileScatter2+N+3);compScatter1++) { for (compScatter2=max(max(max(max(ceild(compScatter1+4,2),5*outerProcTileScatter1),5*outerProcTileScatter2+1),compScatter1-M+2),compScatter1-5*outerProcTileScatter2-1);compScatter2<=min(min(min(min(floord(compScatter1+2*N-2,2),compScatter1),5*outerProcTileScatter1+4),compScatter1-5*outerProcTileScatter2+N),5*outerProcTileScatter2+N+2);compScatter2++) { for (compScatter3=max(max(5*outerProcTileScatter2,compScatter1-compScatter2+3),compScatter2-N+2);compScatter3<=min(min(compScatter2-1,5*outerProcTileScatter2+4),compScatter1-compScatter2+N);compScatter3++) { S1(compScatter1-compScatter2+1,-compScatter1+compScatter2+compScatter3-2,compScatter2-compScatter3,compScatter1,compScatter2,compScatter3); } } } } cloog-0.18.2/test/0D-3.cloog0000664000175000017500000000005212254312305012231 00000000000000c 1 3 1 1 0 0 1 1 1 3 1 1 0 0 0 0 0 0 cloog-0.18.2/test/lu.c0000664000175000017500000000065112254312305011372 00000000000000/* Generated from ../../../git/cloog/test/lu.cloog by CLooG 0.14.0-238-gb1cb779 gmp bits in 0.01s. */ if (n >= 2) { for (j=2;j<=n;j++) { S1(1,j); } for (c1=2;c1<=n-1;c1++) { for (c2=2;c2<=n;c2++) { for (i=1;i<=min(c1-1,c2-1);i++) { S2(i,c2,c1); } } for (j=c1+1;j<=n;j++) { S1(c1,j); } } for (c2=2;c2<=n;c2++) { for (i=1;i<=c2-1;i++) { S2(i,c2,n); } } } cloog-0.18.2/test/constbound.good.c0000664000175000017500000000153412254312305014060 00000000000000/* Generated from /home/skimo/git/cloog/test/constbound.cloog by CLooG 0.14.0-170-g72daac3 64 bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test() { /* Scattering iterators. */ int t0, t2, t3; /* Original iterators. */ int i, j, k; for (t0=0;t0<=199;t0++) { for (t2=max(0,50*t0);t2<=50*t0+24;t2++) { for (t3=0;t3<=t2;t3++) { S1(t0,t2,t3); } } for (t2=50*t0+25;t2<=min(9999,50*t0+49);t2++) { for (t3=0;t3<=t2;t3++) { S2(t0,t2,t3); } } } } cloog-0.18.2/test/gauss.good.c0000664000175000017500000000157012254312305013024 00000000000000/* Generated from ../../../git/cloog/test/gauss.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } void test(int M) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j, k; if (M >= 2) { for (c2=2;c2<=M;c2++) { for (j=2;j<=M;j++) { S2(1,j,c2) ; } } } for (c1=2;c1<=M-1;c1++) { for (c2=c1+1;c2<=M;c2++) { for (j=1;j<=c1-1;j++) { S1(c1,j,c2) ; } for (j=c1+1;j<=M;j++) { S2(c1,j,c2) ; } } } } cloog-0.18.2/test/square+triangle-1-1-2-3.c0000664000175000017500000000044112254312305014643 00000000000000/* Generated from /home/skimo/git/cloog/test/square+triangle-1-1-2-3.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.00s. */ for (j=1;j<=M;j++) { S1(1,j); } for (i=2;i<=M;i++) { S1(i,1); for (j=2;j<=i;j++) { S1(i,j); S2(i,j); } for (j=i+1;j<=M;j++) { S1(i,j); } } cloog-0.18.2/test/classen.cloog0000664000175000017500000001217412254312305013266 00000000000000# created: Fri Mar 4 11:37:56 CET 2005 # ---------------------- CONTEXT ---------------------- c # language is C # Context 1 3 1 1 0 1 # set parameter names m # --------------------- STATEMENTS -------------------- 8 # 1 computation stmts: 1 # one domain per statement 7 7 1 0 0 0 0 1 -1 1 0 0 -1 0 1 0 1 0 0 1 0 0 -1 1 0 0 0 -1 1 0 1 0 0 0 1 0 -1 0 0 -1 0 1 0 0 0 -1 0 1 1 0 -2 0 0 0 # for future options... # 3 prepare-send stmts: 1 # one domain per statement 13 11 1 0 0 0 0 0 0 0 0 1 -1 1 -1 0 0 0 0 0 0 0 2 -3 1 1 0 0 0 0 0 0 0 0 0 1 1 -1 0 0 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 0 1 0 1 -1 1 0 0 0 0 0 0 1 -3 1 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 -2 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 0 0 -2 0 -1 0 1 0 0 0 0 0 0 -1 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 # for future options... 1 # one domain per statement 13 11 1 0 0 0 0 0 0 0 0 1 -1 1 -1 0 0 0 0 0 0 0 2 -3 1 1 0 0 0 0 0 0 0 0 0 1 1 -1 0 0 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 0 1 -1 1 -1 1 0 0 0 0 0 0 1 -2 1 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 -2 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 0 0 -2 0 -1 0 1 0 0 0 0 0 0 -1 0 0 -1 0 1 0 0 0 0 0 -1 0 0 0 # for future options... 1 # one domain per statement 13 11 1 0 0 0 0 0 0 0 0 1 -1 1 -1 0 0 0 0 0 0 0 2 -4 1 1 0 0 0 0 0 0 0 0 0 1 1 -1 0 0 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 0 1 -1 1 -1 1 0 0 0 0 0 0 1 -3 1 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 -2 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 0 0 -2 0 -1 0 1 0 0 0 0 0 0 -2 0 0 -1 0 1 0 0 0 0 0 -1 0 0 0 # for future options... # 3 prepare-receive stmts: 1 # one domain per statement 13 11 1 0 0 0 0 0 0 0 0 1 -1 1 -1 0 0 0 0 0 0 0 2 -3 1 1 0 0 0 0 0 0 0 0 0 1 1 -1 0 0 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 0 1 0 1 -1 1 0 0 0 0 0 0 1 -3 1 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 -2 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 0 0 -2 0 -1 0 1 0 0 0 0 0 0 -1 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 # for future options... 1 # one domain per statement 13 11 1 0 0 0 0 0 0 0 0 1 -1 1 -1 0 0 0 0 0 0 0 2 -3 1 1 0 0 0 0 0 0 0 0 0 1 1 -1 0 0 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 0 1 -1 1 -1 1 0 0 0 0 0 0 1 -2 1 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 -2 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 0 0 -2 0 -1 0 1 0 0 0 0 0 0 -1 0 0 -1 0 1 0 0 0 0 0 -1 0 0 0 # for future options... 1 # one domain per statement 13 11 1 0 0 0 0 0 0 0 0 1 -1 1 -1 0 0 0 0 0 0 0 2 -4 1 1 0 0 0 0 0 0 0 0 0 1 1 -1 0 0 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 0 1 -1 1 -1 1 0 0 0 0 0 0 1 -3 1 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 -2 0 0 -1 0 0 0 1 0 0 0 0 0 -1 0 0 0 1 1 0 0 0 -2 0 -1 0 1 0 0 0 0 0 0 -2 0 0 -1 0 1 0 0 0 0 0 -1 0 0 0 # for future options... # communication statement: 1 # number of domains for communication statement 6 5 1 -1 0 2 -2 1 1 0 0 0 1 1 -1 0 1 1 0 -1 1 0 1 -1 1 1 -2 1 0 1 0 -1 0 0 0 # for future options... 1 # set the iterator names coordT1 coordP1 other1 other2 other3 other4 other5 other6 # --------------------- SCATTERING -------------------- 8 # Scattering functions 7 14 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 7 18 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 7 18 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 7 18 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -2 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 7 18 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 7 18 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 7 18 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 7 12 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 # we set the scattering dimension names glT1 bl rp1 stmtType local1 local2 local3 cloog-0.18.2/test/yosr2.cloog0000664000175000017500000000136112254312305012710 00000000000000# language: C c # parameter n 1 3 # n 1 1 1 -2 0 4 # Number of statements 1 # S2 {k, l | 1<=k<=n; 1<=l<=k-1} 4 5 # k l n 1 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 1 -1 0 -1 0 0 0 1 # S3 {k | 1<=k<=n} 2 4 # k n 1 1 1 0 -1 1 -1 1 0 0 0 0 1 # S5 {k, i, m | 1<=k<=n; k+1<=i<=n 1<=m<=k-1} 6 6 # k i m n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 1 0 -1 0 -1 0 0 0 1 # S4 {k, i | 1<=k<=n; k+1<=i<=n} 4 5 # k i n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 0 4 # Scattering functions 1 6 # c1 k l n 1 0 1 -1 0 0 0 1 5 # c1 k n 1 0 1 0 0 0 1 7 # c1 k i m n 1 0 1 -1 0 0 0 0 1 6 # c1 k i n 1 0 1 0 -1 0 0 1 proc cloog-0.18.2/test/nul_basic2.cloog0000664000175000017500000000133512254312305013654 00000000000000# Optimal code is in fact : # # for (i=0;i<=M;i+=2) { # S1 ; # } # language: C c # parameter n 1 3 # n 1 1 1 -2 1 n 2 # Number of statements 1 # {i, j | i=2*j; 1<=i<=n} 3 5 # i j n 1 0 1 -2 0 0 1 1 0 0 -1 1 -1 0 1 0 0 0 0 1 # {i, j | i=4*j; 1<=i<=n} 3 5 # i j n 1 0 1 -4 0 0 1 1 0 0 -1 1 -1 0 1 0 0 0 0 0 0 # Scattering functions 5 10 # t1 t2 t3 t4 t5 i j n 1 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 5 10 # t1 t2 t3 t4 t5 i j n 1 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 cloog-0.18.2/test/basic-bounds-5.cloog0000664000175000017500000000030712254312305014344 00000000000000# language: C c # Context 1 3 # M 1 1 0 1 0 1 # Number of statements 1 # {i,j,N | i=1; 2j-1<=N<=2j} 3 5 # i j M 1 0 1 0 0 -1 1 0 2 -1 0 1 0 -2 1 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/yosr.c0000664000175000017500000000065612254312305011753 00000000000000/* Generated from ../../../git/cloog/test/yosr.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if (n >= 2) { for (j=2;j<=n;j++) { S1(1,j) ; } for (proc=2;proc<=n-1;proc++) { for (i=1;i<=proc-1;i++) { for (j=i+1;j<=n;j++) { S2(i,j,proc) ; } } for (j=proc+1;j<=n;j++) { S1(proc,j) ; } } for (i=1;i<=n-1;i++) { for (j=i+1;j<=n;j++) { S2(i,j,n) ; } } } cloog-0.18.2/test/forwardsub-2-1-2-3.cloog0000664000175000017500000000144512254312305014607 00000000000000# language: C c # Context #{M | 3<=M} 2 3 # M 1 1 1 -3 1 0 1 0 4 # Number of statements 1 #{i,j,k | i=1; j=1; 2<=k<=M; 3<=M} 6 6 # i j k M 1 0 1 0 0 0 -1 0 0 1 0 0 -1 1 0 0 0 1 -3 1 0 0 -1 1 0 1 0 0 1 0 -2 1 0 0 0 0 1 0 0 0 1 #{i,j,k | 2<=i<=k-1; j=1; k<=M} 5 6 # i j k M 1 0 0 1 0 0 -1 1 -1 0 1 0 -1 1 1 0 0 0 -2 1 0 0 -1 1 0 1 0 0 0 0 1 0 0 0 1 #{i,j | i=1; j=0; 3<=M} 4 5 # i j M 1 0 1 0 0 -1 0 0 1 0 0 1 0 0 1 -3 1 0 0 0 1 0 0 0 1 #{i,j | 2<=i<=M; j=0; 3<=M} 4 5 # i j M 1 0 0 1 0 0 1 1 0 0 -2 1 0 0 1 -3 1 -1 0 1 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/swim.c0000664000175000017500000002643112254312305011735 00000000000000/* Generated from ../../../git/cloog/test/swim.cloog by CLooG 0.16.1-3-g277eafa gmp bits in 0.20s. */ if (M == 1) { S1(); S2(); S3(); S4(); S5(); S6(); S7(); S8(); S9(); S10(); S11(); S12(); S13(); S14(); S15(); S16(); S17(); S18(); S19(); S20(); S21(); S22(); S23(); S24(); S25(); S26(); S27(); for (p1=1;p1<=N;p1++) { for (p3=1;p3<=N;p3++) { S28(p1,p3); S29(p1,p3); S30(p1,p3); } S31(p1); } S32(); S33(); S34(); if (O <= 1) { S35(); } S36(); S37(); if ((N >= 1) && (Q >= 1) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S40(p1,p3,p5); S41(p1,p3,p5); S42(p1,p3,p5); S43(p1,p3,p5); } } for (p3=1;p3<=Q;p3++) { S44(p1,p3); S45(p1,p3); S46(p1,p3); S47(p1,p3); } for (p3=1;p3<=R;p3++) { S48(p1,p3); S49(p1,p3); S50(p1,p3); S51(p1,p3); } S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S59(p1,p3,p5); S60(p1,p3,p5); S61(p1,p3,p5); } } for (p3=1;p3<=Q;p3++) { S62(p1,p3); S63(p1,p3); S64(p1,p3); } for (p3=1;p3<=R;p3++) { S65(p1,p3); S66(p1,p3); S67(p1,p3); } S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5); S96(p1,p3,p5); S97(p1,p3,p5); } S98(p1,p3); } S99(p1); S100(p1); S101(p1); for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S102(p1,p3,p5); S103(p1,p3,p5); S104(p1,p3,p5); S105(p1,p3,p5); S106(p1,p3,p5); S107(p1,p3,p5); } } for (p3=1;p3<=Q;p3++) { S108(p1,p3); S109(p1,p3); S110(p1,p3); S111(p1,p3); S112(p1,p3); S113(p1,p3); } for (p3=1;p3<=R;p3++) { S114(p1,p3); S115(p1,p3); S116(p1,p3); S117(p1,p3); S118(p1,p3); S119(p1,p3); } S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } if ((N <= 0) && (Q >= 1) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S40(p1,p3,p5); S41(p1,p3,p5); S42(p1,p3,p5); S43(p1,p3,p5); } } for (p3=1;p3<=Q;p3++) { S44(p1,p3); S45(p1,p3); S46(p1,p3); S47(p1,p3); } for (p3=1;p3<=R;p3++) { S48(p1,p3); S49(p1,p3); S50(p1,p3); S51(p1,p3); } S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S59(p1,p3,p5); S60(p1,p3,p5); S61(p1,p3,p5); } } for (p3=1;p3<=Q;p3++) { S62(p1,p3); S63(p1,p3); S64(p1,p3); } for (p3=1;p3<=R;p3++) { S65(p1,p3); S66(p1,p3); S67(p1,p3); } S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); S99(p1); S100(p1); S101(p1); for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S102(p1,p3,p5); S103(p1,p3,p5); S104(p1,p3,p5); S105(p1,p3,p5); S106(p1,p3,p5); S107(p1,p3,p5); } } for (p3=1;p3<=Q;p3++) { S108(p1,p3); S109(p1,p3); S110(p1,p3); S111(p1,p3); S112(p1,p3); S113(p1,p3); } for (p3=1;p3<=R;p3++) { S114(p1,p3); S115(p1,p3); S116(p1,p3); S117(p1,p3); S118(p1,p3); S119(p1,p3); } S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } if ((N >= 1) && (Q >= 1) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); for (p3=1;p3<=Q;p3++) { S44(p1,p3); S45(p1,p3); S46(p1,p3); S47(p1,p3); } S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); for (p3=1;p3<=Q;p3++) { S62(p1,p3); S63(p1,p3); S64(p1,p3); } S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5); S96(p1,p3,p5); S97(p1,p3,p5); } S98(p1,p3); } S99(p1); S100(p1); S101(p1); for (p3=1;p3<=Q;p3++) { S108(p1,p3); S109(p1,p3); S110(p1,p3); S111(p1,p3); S112(p1,p3); S113(p1,p3); } S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } if ((N <= 0) && (Q >= 1) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); for (p3=1;p3<=Q;p3++) { S44(p1,p3); S45(p1,p3); S46(p1,p3); S47(p1,p3); } S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); for (p3=1;p3<=Q;p3++) { S62(p1,p3); S63(p1,p3); S64(p1,p3); } S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); S99(p1); S100(p1); S101(p1); for (p3=1;p3<=Q;p3++) { S108(p1,p3); S109(p1,p3); S110(p1,p3); S111(p1,p3); S112(p1,p3); S113(p1,p3); } S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } if ((N >= 1) && (Q <= 0) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); for (p3=1;p3<=R;p3++) { S48(p1,p3); S49(p1,p3); S50(p1,p3); S51(p1,p3); } S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); for (p3=1;p3<=R;p3++) { S65(p1,p3); S66(p1,p3); S67(p1,p3); } S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5); S96(p1,p3,p5); S97(p1,p3,p5); } S98(p1,p3); } S99(p1); S100(p1); S101(p1); for (p3=1;p3<=R;p3++) { S114(p1,p3); S115(p1,p3); S116(p1,p3); S117(p1,p3); S118(p1,p3); S119(p1,p3); } S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } if ((N <= 0) && (Q <= 0) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); for (p3=1;p3<=R;p3++) { S48(p1,p3); S49(p1,p3); S50(p1,p3); S51(p1,p3); } S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); for (p3=1;p3<=R;p3++) { S65(p1,p3); S66(p1,p3); S67(p1,p3); } S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); S99(p1); S100(p1); S101(p1); for (p3=1;p3<=R;p3++) { S114(p1,p3); S115(p1,p3); S116(p1,p3); S117(p1,p3); S118(p1,p3); S119(p1,p3); } S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } if ((N >= 1) && (Q <= 0) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5); S96(p1,p3,p5); S97(p1,p3,p5); } S98(p1,p3); } S99(p1); S100(p1); S101(p1); S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } if ((N <= 0) && (Q <= 0) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1); S39(p1); S52(p1); S53(p1); S54(p1); S55(p1); S56(p1); S57(p1); S58(p1); S68(p1); S69(p1); S70(p1); S71(p1); S72(p1); S73(p1); S74(p1); S75(p1); S76(p1); S77(p1); S78(p1); S79(p1); S80(p1); S81(p1); S82(p1); S83(p1); S84(p1); S85(p1); S86(p1); S87(p1); S88(p1); S89(p1); S90(p1); S91(p1); S92(p1); S93(p1); S94(p1); S99(p1); S100(p1); S101(p1); S120(p1); S121(p1); S122(p1); S123(p1); S124(p1); S125(p1); } } } cloog-0.18.2/test/rectangle.good.c0000664000175000017500000000117212254312305013644 00000000000000/* Generated from ../../../git/cloog/test/rectangle.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int n) { /* Scattering iterators. */ int c1; /* Original iterators. */ int i, j; for (c1=0;c1<=2*n;c1++) { for (i=max(c1-n,0);i<=min(c1,n);i++) { j = c1-i ; S1(i,c1-i) ; } } } cloog-0.18.2/test/multi-stride.cloog0000664000175000017500000000033412254312305014253 00000000000000# Language c # Context 1 2 1 1 0 # Number of statements 1 1 # i' i j 1 4 5 0 1 -2 0 -1 0 1 0 -6 -2 1 1 0 0 0 1 -1 0 0 100 0 0 0 0 0 cloog-0.18.2/test/basic-bounds-2.c0000664000175000017500000000017212254312305013460 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ S1(0) ; cloog-0.18.2/test/swim.cloog0000664000175000017500000043047112254312305012621 00000000000000c # language is C # ---------- CONTEXT ---------- # Context (no constraints on parameters) 1 8 # 1 lines, 8 columns 0 0 0 0 0 0 0 0 0 # Automatically find parameter names # ---------- STATEMENTS ---------- 125 # Number of statements 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -1 1 -1 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -1 1 -1 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -1 1 -1 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -1 1 -1 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 4 8 1 0 0 -1 0 0 0 1 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 3 8 1 1 0 0 0 0 0 -1 1 -1 0 0 0 0 0 1 1 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 9 11 1 1 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 -1 1 0 0 0 -1 0 0 0 0 0 1 1 0 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 7 10 1 1 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 1 1 0 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 1 # Statement has 1 domain 5 9 1 1 0 0 0 0 0 0 -2 1 -1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 -1 1 0 -1 0 0 0 0 0 1 1 0 -1 0 0 0 0 0 1 0 0 0 0 # Automatically find iterator names. # ---------- SCATTERING FUNCTIONS ---------- 125 # Number of scattering functions 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -2 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -3 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -4 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -5 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -6 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -7 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -8 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -9 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -10 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -11 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -12 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -13 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -14 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -15 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -16 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -17 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -18 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -19 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -20 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -21 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -22 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -23 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -24 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -25 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -26 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -27 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -27 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -27 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -27 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -28 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -29 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -30 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -31 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -32 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 15 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -33 # Beta 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -3 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -3 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -3 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -3 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -3 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -3 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -4 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -4 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -4 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -4 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -3 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -5 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -6 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -7 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -8 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -9 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -10 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -11 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -12 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -12 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -12 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -13 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -13 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -13 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -14 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -14 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -14 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -15 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -16 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -17 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -18 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -19 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -20 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -21 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -22 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -23 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -24 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -25 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -26 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -27 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -28 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -29 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -30 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -31 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -32 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -33 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -35 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -36 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -37 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -38 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -39 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -40 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -41 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -42 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -42 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -42 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -42 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -43 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -44 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -45 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -46 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -46 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -46 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -2 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -46 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -3 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -46 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -4 # Beta 3 7 18 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -46 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -5 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -47 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -47 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -47 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -47 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -3 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -47 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -4 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -47 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -48 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -48 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -48 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -48 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -3 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -48 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -4 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 17 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -48 # Beta 1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -5 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -49 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -50 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -51 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -52 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -53 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 7 16 # p0 p1 p2 p3 p4 p5 p6 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -34 # Beta 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 # Alpha & Gamma 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -54 # Beta 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 # Beta 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # Alpha & Gamma 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 # Beta 3 1 # Set the scattering parameter names. p0 p1 p2 p3 p4 p5 p6 cloog-0.18.2/test/multi-mm-1.c0000664000175000017500000000035612254312305012653 00000000000000/* Generated from /home/skimo/git/cloog/test/multi-mm-1.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.00s. */ for (i=0;i<=M;i++) { for (j=0;j<=min(N,i);j++) { S1(i,j); S2(i,j); } for (j=N+1;j<=i;j++) { S1(i,j); } } cloog-0.18.2/test/thomasset.good.c0000664000175000017500000000542412254312305013713 00000000000000/* Generated from ../../../git/cloog/test/thomasset.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.10s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j,k,p,q) { hash(2); hash(i); hash(j); hash(k); hash(p); hash(q); } void test(int n) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j, k, p, q; for (c1=0;c1<=floord(n-5,3);c1++) { for (i=max(3*c1+1,1);i<=3*c1+3;i++) { S1(i,c1) ; } } if (n == 1) { S1(1,0) ; for (k=0;k<=min(0,0);k++) { for (p=max(0,ceild(-3*k-1,3));p<=min(floord(-3*k+1,3),0);p++) { q = -k-p ; S2(1,1,k,p,-k-p) ; } } } if (n >= 2) { for (c1=max(0,ceild(n-4,3));c1<=0;c1++) { S1(1,c1) ; for (j=1;j<=min(n,3*c1-n+5);j++) { for (k=0;k<=floord(3*c1-j-n+4,3);k++) { for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) { q = c1-k-p ; S2(1,j,k,p,c1-k-p) ; } } } for (i=2;i<=min(n,3*c1+3);i++) { S1(i,c1) ; } for (c2=1;c2<=n-1;c2++) { i = c2+1 ; for (j=1;j<=min(3*c1-n+5,n);j++) { for (k=0;k<=floord(3*c1-j-n+4,3);k++) { for (p=ceild(n-2,3);p<=floord(3*c1-j-3*k+2,3);p++) { q = c1-k-p ; S2(c2+1,j,k,p,c1-k-p) ; } } } } } } for (c1=max(1,ceild(n-4,3));c1<=floord(n-1,3);c1++) { for (j=1;j<=3*c1-n+5;j++) { for (k=0;k<=min(floord(3*c1-j-n+4,3),0);k++) { 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++) { q = c1-k-p ; S2(1,j,k,p,c1-k-p) ; } } } for (i=3*c1+1;i<=min(n,3*c1+3);i++) { S1(i,c1) ; } for (c2=1;c2<=n-1;c2++) { i = c2+1 ; for (j=1;j<=3*c1-n+5;j++) { for (k=0;k<=min(floord(3*c1-j-n+4,3),0);k++) { 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++) { q = c1-k-p ; S2(c2+1,j,k,p,c1-k-p) ; } } } } } if (n >= 1) { for (c1=ceild(n,3);c1<=floord(2*n+1,3);c1++) { for (c2=0;c2<=n-1;c2++) { i = c2+1 ; for (j=max(1,3*c1-n-1);j<=min(n,3*c1-n+5);j++) { for (k=max(ceild(3*c1-j-n,3),0);k<=min(floord(3*c1-j-n+4,3),0);k++) { 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++) { q = c1-k-p ; S2(c2+1,j,k,p,c1-k-p) ; } } } } } } } cloog-0.18.2/test/largeur.good.c0000664000175000017500000000113212254312305013335 00000000000000/* Generated from ../../../git/cloog/test/largeur.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j; for (c1=1;c1<=M;c1++) { for (c2=1;c2<=c1;c2++) { S1(c2,c1) ; } } } cloog-0.18.2/test/logopar.cloog0000664000175000017500000000063412254312305013277 00000000000000# language: C c # Context 3 4 # m n 1 1 1 -1 0 # m > n 1 1 0 0 # m >= 0 1 0 1 -2 # n >= 2 1 m n 2 # Number of statements 1 3 6 # i j m n 1 1 1 0 0 0 -1 # i >= 1 1 0 -1 1 0 0 # j <= m 1 -1 1 0 0 1 # j >= i-1 0 0 0 1 4 6 # i j m n 1 1 1 0 0 0 -2 # i >= 2 1 -1 0 0 1 0 # i <= n 1 0 1 0 0 0 # j >= 0 1 0 -1 0 1 0 # j <= n 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/byu98-1-2-3.cloog0000664000175000017500000000163612254312305013254 00000000000000# Here is the result given by an old CLooG (the same was given up to 0.12.2), # the difference with the new constant spreading technique of 0.14.0 is # one of the most beautiful. # # /* Generated by CLooG v0.10.7 */ # for (i=2;i<=3;i++) { # for (j=-i+6;j<=6;j++) { # S1 ; # } # } # for (j=4-1;j<=-(4)+8;j++) { # S1(i = 4) ; # } # j = -(4)+9 ; # S1(i = 4) ; # S2(i = 4) ; # for (j=-(4)+10;j<=6;j++) { # S1(i = 4) ; # } # S1(i = 5,j = 4) ; # S2(i = 5,j = 4) ; # for (j=5;j<=6;j++) { # S1(i = 5) ; # } # for (i=6;i<=7;i++) { # j = -i+9 ; # S2 ; # for (j=i-1;j<=6;j++) { # S1 ; # } # } # S2(i = 8,j = 1) ; # language: C c # Context #{ | 1>=0} 1 2 1 1 0 2 # Number of statements 1 # {i,j | (-j+6,2)<=i<=j+1; 3<=j<=6} 5 4 # i j 1 1 1 1 -6 1 1 0 -2 1 0 1 -3 1 0 -1 6 1 -1 1 1 0 0 0 1 # {i,j | i=-j+9; 1<=j<=5} 3 4 0 1 1 -9 1 0 1 -1 1 0 -1 5 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/0D-2.good.c0000664000175000017500000000067312254312305012307 00000000000000/* Generated from ../../../git/cloog/test/0D-2.cloog by CLooG 0.14.0-117-g5444fca gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } void test(int M) { if (M >= 0) { S1() ; } } cloog-0.18.2/test/vasilache.good.c0000664000175000017500000000313412254312305013637 00000000000000/* Generated from ../../../git/cloog/test/vasilache.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.15s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } #define S2() { hash(2); } #define S3() { hash(3); } #define S4(i,j) { hash(4); hash(i); hash(j); } #define S5(i,j) { hash(5); hash(i); hash(j); } #define S6(i,j,k,l) { hash(6); hash(i); hash(j); hash(k); hash(l); } #define S7(i,j,k,l) { hash(7); hash(i); hash(j); hash(k); hash(l); } #define S8() { hash(8); } void test(int M, int N) { /* Scattering iterators. */ int p1, p3, p5, p7; /* Original iterators. */ int i, j, k, l; S1() ; S2() ; for (p1=0;p1<=N-1;p1++) { for (p3=0;p3<=N-1;p3++) { S4(p1,p3) ; S5(p1,p3) ; } } for (p1=0;p1<=N-1;p1++) { for (p3=0;p3<=N-1;p3++) { for (p5=0;p5<=floord(N-1,32);p5++) { if (p5 >= 0) { p7 = 32*p5 ; l = 32*p5 ; S7(p1,p3,p5,32*p5) ; } if (p5 <= -1) { S7(p1,p3,p5,0) ; } for (p7=max(32*p5+1,1);p7<=min(N-1,32*p5+31);p7++) { l = p7-1 ; S6(p1,p3,p5,p7-1) ; S7(p1,p3,p5,p7) ; } if (p5 >= ceild(N-32,32)) { l = N-1 ; S6(p1,p3,p5,N-1) ; } if (p5 <= floord(N-33,32)) { p7 = 32*p5+32 ; l = 32*p5+31 ; S6(p1,p3,p5,32*p5+31) ; } } } } S8() ; } cloog-0.18.2/test/generate_test.c0000664000175000017500000000703112254312305013602 00000000000000#include #include /* Generate code that scans part of the parameter domain of * a given cloog problem, running both a function called "good" * and a function called "test" for each value of the parameters. * These functions are assumed to call the "hash" function, * which is also generated by this program. * If for any given value of the parameters, the final hash * value computed by test is different from that computed by * good, then an error is reported. */ CloogDomain *get_param_domain(CloogOptions *options) { CloogDomain *domain; CloogProgram *program; program = cloog_program_read(stdin, options); domain = cloog_domain_copy(program->context); cloog_program_free(program); return cloog_domain_from_context(domain); } static const char preamble[] = "#include \n" "#include \n" "\n" "static unsigned h;\n" "\n" "void hash(int v)\n" "{\n" " int i;\n" " union u {\n" " int v;\n" " unsigned char c[1];\n" " } u;\n" " u.v = v;\n" " for (i = 0; i < sizeof(int); ++i) {\n" " h *= 16777619;\n" " h ^= u.c[i];\n" " }\n" "}\n" "\n" "int main()\n" "{\n" " unsigned h_good, h_test;\n"; ; static const char postamble[] = " return 0;\n" "}\n" ; static const char *call[] = {"good", "test"}; static void print_macros(FILE *file) { fprintf(file, "/* Useful macros. */\n") ; fprintf(file, "#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))\n"); fprintf(file, "#define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d))\n"); fprintf(file, "#define max(x,y) ((x) > (y) ? (x) : (y))\n") ; fprintf(file, "#define min(x,y) ((x) < (y) ? (x) : (y))\n\n") ; } int main() { int dim; int range; int i, j; CloogState *state = cloog_state_malloc(); CloogOptions *options = cloog_options_malloc(state); CloogDomain *domain; CloogDomain *cube, *tmp; CloogProgram *p; CloogStatement *statement; cloog_int_t m, M; options->quiet = 1; domain = get_param_domain(options); dim = cloog_domain_dimension(domain); if (dim >= 8) range = 4; else if (dim >= 5) range = 6; else range = 30; cloog_int_init(m); cloog_int_init(M); cloog_int_set_si(m, 0); cloog_int_set_si(M, range); cube = cloog_domain_cube(state, dim, m, M); domain = cloog_domain_intersection(tmp = domain, cube); cloog_domain_free(tmp); cloog_domain_free(cube); p = cloog_program_malloc(); assert(p); p->names = cloog_names_malloc(); assert(p->names); p->names->nb_iterators = dim; p->names->iterators = cloog_names_generate_items(dim, "p", 0); p->language = 'c'; p->context = cloog_domain_universe(state, 0); statement = cloog_statement_alloc(state, 1); p->loop = cloog_loop_malloc(state); p->loop->domain = domain; p->loop->block = cloog_block_alloc(statement, 0, NULL, dim); p->blocklist = cloog_block_list_alloc(p->loop->block); p = cloog_program_generate(p, options); printf("%s", preamble); for (i = 0; i < dim; ++i) printf("\tint %s;\n", p->names->iterators[i]); printf("#define S1("); for (i = 0; i < dim; ++i) { if (i) printf(","); printf("p%d", i); } printf(") do {"); for (j = 0; j < 2; ++j) { printf(" h = 2166136261u;"); printf(" %s(", call[j]); for (i = 0; i < dim; ++i) { if (i) printf(", "); printf("p%d", i); } printf(");"); printf(" h_%s = h;", call[j]); } printf(" assert(h_good == h_test);"); printf(" } while (0)\n"); print_macros(stdout); cloog_program_pprint(stdout, p, options); printf("%s", postamble); cloog_int_clear(m); cloog_int_clear(M); cloog_program_free(p); cloog_options_free(options); cloog_state_free(state); return 0; } cloog-0.18.2/test/nul_lcpc.cloog0000664000175000017500000000115712254312305013434 00000000000000# language: C c # parameter n 3 5 # m n p 1 1 1 -1 0 -1 1 0 -1 1 -1 0 0 1 0 -6 1 m n p 2 # Number of statements 1 # {i, j, k | i=2*k+1; 1<=i<=m; 1<=j<=p} 5 8 # i k j m n p 1 0 1 -2 0 0 0 0 -1 # i=2*k+1 1 1 0 0 0 0 0 -1 # 1<=i 1 -1 0 0 1 0 0 0 # i<=m 1 0 0 1 0 0 0 -1 # 1<=j 1 0 0 -1 0 0 1 0 # j<=p 0 0 0 1 # {i, j, k | i=2*k+1; 1<=i<=n; 1<=j<=i} 5 8 # i k j m n p 1 0 1 -2 0 0 0 0 -1 # i=2*k+1 1 1 0 0 0 0 0 -1 # 1<=i 1 -1 0 0 0 1 0 0 # i<=n 1 0 0 1 0 0 0 -1 # 1<=j 1 1 0 -1 0 0 0 0 # j<=i 0 0 0 1 i k j 0 # Scattering functions cloog-0.18.2/test/equality.c0000664000175000017500000000043112254312305012603 00000000000000/* Generated from ../../../git/cloog/test/equality.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ for (i0=0;i0<=5;i0++) { for (i1=ceild(4*i0,5);i1<=floord(6*i0+20,5);i1++) { if (2*i0 == i1) { S1(i0,i1) ; } if (i1 == 4) { S2(i0,i1) ; } } } cloog-0.18.2/test/basic-bounds-2.good.c0000664000175000017500000000073112254312305014410 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test() { /* Original iterators. */ int i; S1(0) ; } cloog-0.18.2/test/christian.c0000664000175000017500000000054412254312305012737 00000000000000/* Generated from ../../../git/cloog/test/christian.cloog by CLooG 0.16.2-5-g3b3bf96 gmp bits in 0.01s. */ if (N >= 1) { S1(0,N-1); for (p=-N+2;p<=N-1;p++) { if (p >= 1) { S2(p-1,0); } for (i=max(0,p);i<=min(N-1,p+N-2);i++) { S1(i,-p+i); S2(i,-p+i+1); } if (p <= 0) { S1(p+N-1,N-1); } } S2(N-1,0); } cloog-0.18.2/test/stride3.cloog0000664000175000017500000000210212254312305013201 00000000000000 # ---------------------- CONTEXT ---------------------- c # language is C # Context (no constraints on two parameters) 1 4 # 1 lines and 4 columns # eq/in m n 1 1 0 0 0 # 0 >= 0, always true 1 # We want to set manually the parameter names m n # parameter names # --------------------- STATEMENTS -------------------- 1 # Number of statements 1 # First statement: two domains # First domain 3 5 # 3 lines and 5 columns # eq/in i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 1 -1 0 0 # i >= m # Second domain 0 0 0 # for future options 1 # We want to set manually the iterator names i j # iterator names # --------------------- SCATTERING -------------------- 1 # Scattering functions # First function 2 7 # 2 lines and 7 columns # eq/in p1 p2 i m n 1 0 1 0 -50 0 0 0 # p1 = i 0 0 1 0 0 0 0 # p2 = 0 1 # We want to set manually the scattering dimension names p1 p2 # scattering dimension names cloog-0.18.2/test/iftest.cloog0000664000175000017500000000077212254312305013135 00000000000000# language: C c # The context (no constraints on parameters) 1 4 # 1 lines and 4 columns # m n 1 1 0 0 0 1 m n 1 # The number of statements 2 # First statement # The first domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 1 -1 0 0 # i >= m # The second domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 -1 2 0 0 # i <= 2*m 0 0 0 0 0 cloog-0.18.2/test/min-4-1.c0000664000175000017500000000033312254312305012031 00000000000000/* Generated from ../../../git/cloog/test/min-4-1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ if ((M >= -N) && (M >= -O) && (N >= 0) && (N >= -O)) { for (i=max(-M,-N);i<=min(N,O);i++) { S1(i) ; } } cloog-0.18.2/test/cholesky2.good.c0000664000175000017500000000446212254312305013610 00000000000000/* Generated from ../../../git/cloog/test/cholesky2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.11s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i) { hash(3); hash(i); } #define S4(i,j) { hash(4); hash(i); hash(j); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } #define S6(i,j) { hash(6); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c1, c2, c3; /* Original iterators. */ int i, j, k; if (M >= 2) { for (c2=1;c2<=M-1;c2++) { S1(c2) ; for (c3=c2+1;c3<=M;c3++) { S4(c2,c3) ; } } S1(M) ; } if (M == 1) { S1(1) ; } if (M >= 2) { S3(1) ; } if (M >= 3) { S6(1,2) ; for (c2=3;c2<=M;c2++) { S6(1,c2) ; for (i=2;i<=c2-1;i++) { S5(i,c2,1) ; } } } if (M == 2) { S6(1,2) ; } for (c1=3;c1<=3*M-7;c1++) { if ((c1+2)%3 == 0) { i = (c1+2)/3 ; S3((c1+2)/3) ; } if (c1%3 == 0) { c2 = (c1+3)/3 ; i = (c1+3)/3 ; S2((c1+3)/3,c1/3) ; } c2 = floord(c1+6,3) ; if ((c1+1)%3 == 0) { i = (c1+1)/3 ; S6((c1+1)/3,c2) ; } if (c1%3 == 0) { S2(c2,c1/3) ; } for (c2=ceild(c1+7,3);c2<=M;c2++) { if ((c1+1)%3 == 0) { i = (c1+1)/3 ; S6((c1+1)/3,c2) ; } if (c1%3 == 0) { S2(c2,c1/3) ; } if ((c1+1)%3 == 0) { c3 = (c1+1)/3 ; for (i=ceild(c1+4,3);i<=c2-1;i++) { k = (c1+1)/3 ; S5(i,c2,(c1+1)/3) ; } } } } for (c1=max(3*M-6,3);c1<=3*M-4;c1++) { if ((c1+2)%3 == 0) { i = (c1+2)/3 ; S3((c1+2)/3) ; } if (c1%3 == 0) { c2 = (c1+3)/3 ; i = (c1+3)/3 ; S2((c1+3)/3,c1/3) ; } for (c2=ceild(c1+4,3);c2<=M;c2++) { if ((c1+1)%3 == 0) { i = (c1+1)/3 ; S6((c1+1)/3,c2) ; } if (c1%3 == 0) { S2(c2,c1/3) ; } } } if (M >= 2) { c1 = 3*M-3 ; j = M-1 ; S2(M,M-1) ; } if (M >= 1) { c1 = 3*M-2 ; S3(M) ; } } cloog-0.18.2/test/logo.good.c0000664000175000017500000000161212254312305012637 00000000000000/* Generated from ../../../git/cloog/test/logo.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j; for (j=0;j<=7;j++) { S1(1,j) ; } for (i=2;i<=5;i++) { for (j=0;j<=i-2;j++) { S2(i,j) ; } for (j=i-1;j<=4;j++) { S1(i,j) ; S2(i,j) ; } for (j=5;j<=7;j++) { S1(i,j) ; } } for (j=0;j<=4;j++) { S2(6,j) ; } for (j=5;j<=7;j++) { S1(6,j) ; } for (i=7;i<=8;i++) { for (j=i-1;j<=7;j++) { S1(i,j) ; } } } cloog-0.18.2/test/logo.c0000664000175000017500000000055612254312305011716 00000000000000/* Generated from /home/skimo/git/cloog/test/logo.cloog by CLooG 0.14.0-284-ga90f184 gmp bits in 0.01s. */ for (j=0;j<=7;j++) { S1(1,j); } for (i=2;i<=6;i++) { for (j=0;j<=i-2;j++) { S2(i,j); } for (j=i-1;j<=4;j++) { S1(i,j); S2(i,j); } for (j=5;j<=7;j++) { S1(i,j); } } for (i=7;i<=8;i++) { for (j=i-1;j<=7;j++) { S1(i,j); } } cloog-0.18.2/test/dealII.c0000664000175000017500000000067112254312305012103 00000000000000/* Generated from ../../../git/cloog/test/dealII.cloog by CLooG 0.14.0-270-g7ee1261 gmp bits in 0.01s. */ for (scat_0=0;scat_0<=min(T_66,T_2-1);scat_0++) { S1(scat_0); S2(scat_0); } if ((T_2 == 0) && (T_66 >= 0) && (T_67 == 0)) { S1(0); } if ((T_66 <= -1) && (T_67 == 0)) { S1(0); } for (scat_0=max(max(0,T_66+1),-T_67+1);scat_0<=T_2-1;scat_0++) { S1(scat_0); } for (scat_0=T_2;scat_0<=min(T_66,T_67-1);scat_0++) { S2(scat_0); } cloog-0.18.2/test/isl/0000775000175000017500000000000012254314447011464 500000000000000cloog-0.18.2/test/isl/mod.cloog0000664000175000017500000000042012254312305013173 00000000000000c # Context: 0 2 0 # Parameter name(s) # Statement number: 1 # Iteration domain of statement 1 4 4 1 0 1 0 1 1 0 0 1 -1 0 3 1 1 -3 0 1 -1 3 1 0 0 0 # For future options. 0 # Iterator name(s) # No scattering functions. 0 cloog-0.18.2/test/isl/mod3.c0000664000175000017500000000037112254312305012402 00000000000000/* Generated from ../../../git/cloog/test/isl/mod3.cloog by CLooG 0.14.0-325-g62da9f7 gmp bits in 0.02s. */ for (i=max(0,32*h0-1991);i<=min(999,32*h0+31);i++) { if ((63*i+32*h0+31)%64 <= 62) { for (j=0;j<=999;j++) { S1(i,j); } } } cloog-0.18.2/test/isl/mxm-shared.cloog0000664000175000017500000003421612254312305014473 00000000000000# CLooG -> CLooG # This is an automatic dump of a CLooG input file from a CloogInput data # structure. # Language: C c # Context: 1 19 15 0 0 3 10 0 0 0 128 0 -8 0 1 0 0 0 0 0 0 0 0 0 4096 0 0 0 128 0 -1 0 0 0 0 0 0 0 8 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 -128 0 0 0 1 0 0 0 0 0 0 0 0 0 -8 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 -1 0 0 -1 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 15 1 0 0 0 1 0 0 0 -1 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 1 0 0 -1 0 0 0 0 0 0 -1 1 0 0 0 0 0 -128 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 -8 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 15 1 # Parameter name(s) N b0 b1 g0 g1 g2 g3 g4 t0 t1 # Statement number: 1 # Iteration domain of statement 1 (write_shared_C). 2 22 18 2 0 4 10 0 0 -1 0 0 0 16 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 128 0 0 8 0 -1 0 0 0 0 0 0 0 0 0 0 0 4096 0 0 0 0 -128 0 1 0 0 0 0 0 0 0 0 0 128 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -128 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -8 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -128 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 -1 -1 1 0 0 0 0 0 0 0 -8 0 1 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 15 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 127 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 7 1 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 24 19 2 0 5 10 0 0 -1 0 0 0 0 16 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 128 0 0 8 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 4096 0 0 0 0 0 -128 0 1 0 0 0 0 0 0 0 0 0 128 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -128 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -8 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -8 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 -1 0 0 0 0 0 -1 -1 1 0 0 0 0 0 0 0 0 0 -128 0 1 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 7 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 15 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 127 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 0 0 0 # For future options. 0 # Iterator name(s) # --------------------- SCATTERING -------------------- 1 # Scattering functions # Scattering of statement 1 (write_shared_C). 2 27 22 4 2 4 10 0 0 0 0 0 1 0 0 0 0 16 0 8 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 16 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 128 0 0 0 120 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4096 0 0 0 0 0 3968 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -128 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -8 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -128 0 1 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 -8 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 15 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 127 1 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 7 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 15 29 23 4 2 5 10 0 0 0 0 0 1 0 0 0 0 0 16 0 8 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 16 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 128 0 0 0 120 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4096 0 0 0 0 0 3968 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -128 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -8 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -8 0 1 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -128 0 1 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 -1 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 7 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 15 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 127 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 15 1 # Scattering dimension name(s) c0 c1 c2 c3 cloog-0.18.2/test/isl/unroll.cloog0000664000175000017500000000010712254312305013731 00000000000000C [n] -> { : } 0 1 [n] -> { [i] : 0 <= i and i <= 10 } 0 0 0 0 0 cloog-0.18.2/test/isl/mod.c0000664000175000017500000000024312254312305012315 00000000000000/* Generated from ../../../git/cloog/test/isl/mod.cloog by CLooG 0.14.0-325-g71fa959 gmp bits in 0.00s. */ for (i=0;i<=3;i++) { if (i%3 <= 1) { S1(i); } } cloog-0.18.2/test/isl/mxm-shared.c0000664000175000017500000000041012254312305013577 00000000000000/* Generated from ../../../git/cloog/test/isl/mxm-shared.cloog by CLooG 0.16.1-5-gcba2a9f gmp bits in 0.34s. */ if (g4%4 == 0) { if ((N >= g0+t1+1) && (N >= g1+t0+1) && (t1 <= 7)) { for (c0=t0;c0<=min(127,N-g1-1);c0+=16) { S1(g0+t1,c0+g1); } } } cloog-0.18.2/test/isl/unroll2.good.c0000664000175000017500000000105112254312305014060 00000000000000/* Generated from ../../../git/cloog/test/isl/unroll2.cloog by CLooG 0.16.3-13-g27516e4 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int M) { /* Original iterators. */ int i; if ((M >= -1) && (M <= 9)) { for (i=max(0,M);i<=M+1;i++) { S1(i); } } } cloog-0.18.2/test/isl/mod4.cloog0000664000175000017500000000041612254312305013264 00000000000000c 1 0 4 0 1 6 7 1 0 2 2 1 0 -5 0 0 1 0 1 0 5 0 0 -1 2 1 0 0 -11 1 0 0 1 0 0 11 -1 0 6 1 1 0 0 0 0 0 1 -1 0 0 1 1 0 0 0 0 0 0 cloog-0.18.2/test/isl/unroll.good.c0000664000175000017500000000103612254312305014001 00000000000000/* Generated from ./isl/unroll.cloog by CLooG 0.16.3-14-g80e4ef0 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int M) { /* Original iterators. */ int i; S1(0); S1(1); S1(2); S1(3); S1(4); S1(5); S1(6); S1(7); S1(8); S1(9); S1(10); } cloog-0.18.2/test/isl/mod3.cloog0000664000175000017500000000102112254312305013254 00000000000000# Language: C c # Context: 2 3 1 -1 93 1 1 0 1 # Parameter name(s) h0 # Statement number: 1 # Iteration domain of statement 1 1 9 6 2 0 1 1 1 1 0 0 0 0 1 -1 0 0 0 999 1 0 0 -1 0 31 1 1 0 32 -32 999 1 0 1 0 0 0 1 0 -1 0 0 999 1 1 0 64 -32 31 1 -1 0 -64 32 31 1 0 0 1 0 0 0 0 0 # For future options. 0 # Iterator name(s) # No scattering functions. 0 cloog-0.18.2/test/isl/mod2.cloog0000664000175000017500000000036212254312305013262 00000000000000# Language: C c # Context: 0 2 0 # Parameter name(s) # Statement number: 1 # Iteration domain of statement 1 { [i] : 0 <= i <= 3 and 0 <= i - 3*[i/3] <= 1 } 0 0 0 # For future options. 0 # Iterator name(s) # No scattering functions. 0 cloog-0.18.2/test/isl/jacobi-shared.good.c0000664000175000017500000000203012254312305015154 00000000000000/* Generated from ../../../git/cloog/test/isl/jacobi-shared.cloog by CLooG 0.16.2-19-gfcd8fdc gmp bits in 1.65s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int T, int N, int h0, int b0, int b1, int g0, int g1, int g2, int g3, int g4, int t0, int t1) { /* Scattering iterators. */ int c0, c1, c2, c3; /* Original iterators. */ int i, j; if ((h0+1)%2 == 0) { 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)) { for (c0=max(-16*floord(t0-1,16)+t0,-16*floord(g1+t0-3,16)+t0);c0<=min(32,N-g1-1);c0+=16) { c1 = -32*floord(t1-1,32)+t1; if (c1 <= 32) { S1(c0+g1-1,c1+g2-1); } } } } } cloog-0.18.2/test/isl/mod4.c0000664000175000017500000000034012254312305012377 00000000000000/* Generated from ../../../git/cloog/test/isl/mod4.cloog by CLooG 0.16.0-9-g188dbd4 gmp bits in 0.00s. */ if (M%11 <= 6) { if (N%5 <= 2) { if (M >= -N) { for (i=0;i<=M+N;i++) { S1(i); } } } } cloog-0.18.2/test/isl/jacobi-shared.cloog0000664000175000017500000002733712254312305015127 00000000000000# CLooG -> CLooG # This is an automatic dump of a CLooG input file from a CloogInput data # structure. # Language: C c # Context: 1 22 16 0 0 2 12 0 0 1024 0 0 0 0 32 0 0 -1 0 0 0 0 0 0 2048 0 0 0 0 32 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 29 1 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 29 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 63 1 0 0 0 1 0 0 -32 0 0 0 0 0 0 0 -2 1 0 0 0 1 0 -32 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -4 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 2 0 -1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 -32 0 0 1 0 0 0 0 0 1 0 0 0 0 0 -32 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 31 1 # Parameter name(s) T N h0 b0 b1 g0 g1 g2 g3 g4 t0 t1 # Statement number: 1 # Iteration domain of statement 1 (write_shared_A). 1 33 21 2 0 5 12 0 0 1 0 0 0 0 32 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 1 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 1024 0 0 0 0 0 0 992 0 0 1 0 0 0 0 0 0 0 0 0 2048 0 0 0 0 0 0 2016 0 0 1 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 2 0 -1 0 0 0 0 0 0 0 0 0 -1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 1 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 1 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 63 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 31 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -4 1 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 29 1 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 29 1 0 0 0 0 0 0 0 0 0 0 -32 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -32 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 -32 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 1 0 0 -32 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 31 0 0 0 # For future options. 0 # Iterator name(s) # --------------------- SCATTERING -------------------- 1 # Scattering functions # Scattering of statement 1 (write_shared_A). 1 37 25 4 2 5 12 0 0 0 0 0 0 1 0 0 0 0 32 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 1 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 -1 0 1 0 0 0 0 0 0 0 0 0 1024 0 0 0 0 0 0 992 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 2048 0 0 0 0 0 0 2016 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 1 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 0 0 0 0 0 0 0 2 0 -1 0 0 0 0 0 0 0 0 0 -1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 63 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 31 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -4 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 31 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 29 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 29 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -32 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -32 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 -32 0 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 -32 0 0 0 0 0 0 0 -2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 15 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 31 1 # Scattering dimension name(s) c0 c1 c2 c3 cloog-0.18.2/test/isl/jacobi-shared.c0000664000175000017500000000105412254312305014232 00000000000000/* Generated from ../../../git/cloog/test/isl/jacobi-shared.cloog by CLooG 0.16.3-2-g5511bef gmp bits in 1.82s. */ if ((h0+1)%2 == 0) { if ((16*floord(t0-1,16) >= -N+g1+t0+1) && (16*floord(g1+t0-3,16) >= -N+g1+t0+1) && (32*floord(t1-1,32) >= -N+g2+t1+1) && (32*floord(g2+t1-3,32) >= t1-32)) { for (c0=max(-16*floord(t0-1,16)+t0,-16*floord(g1+t0-3,16)+t0);c0<=min(32,N-g1-1);c0+=16) { for (c1=-32*floord(t1-1,32)+t1;c1<=min(32,N-g2-1);c1+=32) { if ((c1 >= 1) && (c1 <= 32)) { S1(c0+g1-1,c1+g2-1); } } } } } cloog-0.18.2/test/isl/unroll2.cloog0000664000175000017500000000012512254312305014013 00000000000000C [n] -> { : } 0 1 [n] -> { [i] : 0 <= i and n <= i <= n + 1 <= 10 } 0 0 0 0 0 cloog-0.18.2/test/isl/unroll2.c0000664000175000017500000000026712254312305013141 00000000000000/* Generated from ../../../git/cloog/test/isl/unroll2.cloog by CLooG 0.16.3-13-g27516e4 gmp bits in 0.00s. */ if ((M >= -1) && (M <= 9)) { if (M >= 0) { S1(M); } S1(M+1); } cloog-0.18.2/test/isl/mod2.c0000664000175000017500000000024312254312305012377 00000000000000/* Generated from ../../../git/cloog/test/isl/mod.cloog by CLooG 0.14.0-325-g71fa959 gmp bits in 0.00s. */ for (i=0;i<=3;i++) { if (i%3 <= 1) { S1(i); } } cloog-0.18.2/test/isl/unroll.c0000664000175000017500000000024512254312305013053 00000000000000/* Generated from ./isl/unroll.cloog by CLooG 0.16.3-13-gbbcc8fc gmp bits in 0.00s. */ S1(0); S1(1); S1(2); S1(3); S1(4); S1(5); S1(6); S1(7); S1(8); S1(9); S1(10); cloog-0.18.2/test/union.c0000664000175000017500000000045612254312305012105 00000000000000/* Generated from ../../../git/cloog/test/union.cloog by CLooG 0.16.0-3-g7eee03c gmp bits in 0.00s. */ if (M <= -1) { for (c1=0;c1<=100;c1++) { S1(c1); } } if (M >= 11) { for (c1=-100;c1<=0;c1++) { S1(-c1); } } if ((M >= 1) && (M <= 10)) { for (c1=0;c1<=100;c1++) { S1(c1); } } cloog-0.18.2/test/vasilache.c0000664000175000017500000000113412254312305012706 00000000000000/* Generated from ../../../git/cloog/test/vasilache.cloog by CLooG 0.14.0-162-g1e599e0 gmp bits in 0.03s. */ S1(); S2(); for (p1=0;p1<=N-1;p1++) { for (p3=0;p3<=N-1;p3++) { S4(p1,p3); S5(p1,p3); } } for (p1=0;p1<=N-1;p1++) { for (p3=0;p3<=N-1;p3++) { for (p5=0;p5<=floord(N-1,32);p5++) { S7(p1,p3,p5,32*p5); for (p7=32*p5+1;p7<=min(N-1,32*p5+31);p7++) { S6(p1,p3,p5,p7-1); S7(p1,p3,p5,p7); } if (p5 >= ceild(N-31,32)) { S6(p1,p3,p5,N-1); } if (p5 <= floord(N-32,32)) { S6(p1,p3,p5,32*p5+31); } } } } S8(); cloog-0.18.2/test/iftest2.c0000664000175000017500000000032212254312305012325 00000000000000/* Generated from ../../../git/cloog/test/iftest2.cloog by CLooG 0.14.0-245-gd8c1718 gmp bits in 0.00s. */ if ((M >= 1) && (N >= 1)) { for (i=1;i<=N;i++) { for (j=1;j<=M;j++) { S1(i,j); } } } cloog-0.18.2/test/uday_scalars.good.c0000664000175000017500000000125612254312305014355 00000000000000/* Generated from ../../../git/cloog/test/uday_scalars.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(j,l,m) { hash(1); hash(j); hash(l); hash(m); } #define S2(j,l,m) { hash(2); hash(j); hash(l); hash(m); } void test(int n) { /* Scattering iterators. */ int p3; /* Original iterators. */ int j, l, m; for (p3=0;p3<=n;p3++) { S1(p3,0,0) ; } for (p3=0;p3<=n;p3++) { S2(0,p3,0) ; } } cloog-0.18.2/test/min-2-1.cloog0000664000175000017500000000065212254312305012714 00000000000000# language: C c # Context # {M,N | 1>=0} 1 4 # M N 1 1 0 0 1 0 1 # Number of statements 1 # {i,j |1<=i<=N; 0<=j<=M; j<=i; j+i<=N}, i.e. # {i,j | (1,j)<=i<=-j+N; 0<=j<=M} 10 7 # i j k M N 1 1 1 0 0 0 0 -1 1 0 1 0 0 0 0 1 0 -1 0 1 0 0 1 1 -1 0 0 0 0 1 -1 -1 0 0 1 0 1 0 0 1 0 0 0 1 0 0 -1 1 0 0 1 1 0 -1 0 0 0 1 -1 0 -1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/infinite.cloog0000664000175000017500000000052212254312305013435 00000000000000# langage c # parametres {M, N | M>=1 N >=1} 2 4 # M N 1 1 1 0 -1 1 0 1 -1 0 2 # Number of statements 1 # {i | 1<=i<=M} 0 5 # i M N 1 #1 1 0 0 -1 #1 -1 1 0 0 0 0 0 1 # {i, j | 1<=i<=N 1<=j<=M} 4 6 # i j M N 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/gesced2.cloog0000664000175000017500000000214712254312305013151 00000000000000# language: C c # parameters {n | n>=16} 1 3 # n 1 1 1 -16 0 2 # Number of statements 1 # {i, j | 1<=i<=n 5<=j<=n-10} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -5 1 0 -1 1 -10 0 0 0 1 # {i, j | 1<=i<=n 5<=j<=n-10} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -5 1 0 -1 1 -10 0 0 0 0 2 # Scattering functions # Et les instructions de chunking (sol triviale)... 2 7 # c1 c2 i j n 1 0 1 0 -1 0 0 0 0 0 1 0 -1 0 0 2 7 # c1 c2 i j n 1 0 1 0 0 -1 0 0 0 0 1 -1 1 0 0 0 # Et les instructions de chunking (sol aux inverse)... 2 7 # c1 c2 i j n 1 0 1 0 -10 -3 0 -5 0 0 1 -4 -1 0 5 2 7 # c1 c2 i j n 1 0 1 0 -9 -4 0 -15 0 0 1 -5 0 0 0 0 2 # Et les instructions de chunking (sol aux egalites)... 2 7 # c1 c2 i j n 1 0 1 0 1 -2 0 -30 0 0 1 -1 1 0 30 2 7 # c1 c2 i j n 1 0 1 0 -1 1 0 15 0 0 1 1 -2 0 -30 0 # Et les instructions de chunking (sol triviale)... 2 7 # c1 c2 i j n 1 0 1 0 -1 0 0 0 0 0 1 0 -1 0 5 2 7 # c1 c2 i j n 1 0 1 0 0 -1 0 -10 0 0 1 -1 0 0 0 0 cloog-0.18.2/test/min-4-1.good.c0000664000175000017500000000102212254312305012754 00000000000000/* Generated from ../../../git/cloog/test/min-4-1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } void test(int M, int N, int O) { /* Original iterators. */ int i; for (i=max(-M,-N);i<=min(O,N);i++) { S1(i) ; } } cloog-0.18.2/test/gesced3.cloog0000664000175000017500000000061112254312305013144 00000000000000# language: C c # parametres {n | n>=m m>=2} 2 4 # m n 1 1 -1 1 0 1 1 0 -2 0 2 # Number of statements 1 # {i | 1<=i<=n} 2 5 # i m n 1 1 1 0 0 -1 1 -1 0 1 0 0 0 0 1 # {i | 1<=i<=n} 2 5 # i m n 1 1 1 0 0 -1 1 -1 0 1 0 0 0 0 0 2 # Et les instructions de chunking (sol triviale)... 1 6 # c1 i m n 1 0 1 -1 -1 0 0 1 6 # c1 i m n 1 0 1 -1 -2 0 0 0 cloog-0.18.2/test/esced.cloog0000664000175000017500000000045112254312305012714 00000000000000# language: C c # parameters {n, m | n<=m} 1 4 #1 1 -1 0 1 0 0 1 1 n m 2 # Number of statements 1 # {i | 1<=i<=n} 2 5 1 1 0 0 -1 1 -1 0 1 0 0 0 0 1 # {i, j | 1<=i<=n 1<=j<=m} 4 6 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/swim.good.c0000664000175000017500000004273712254312305012673 00000000000000/* Generated from ../../../git/cloog/test/swim.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.70s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1() { hash(1); } #define S2() { hash(2); } #define S3() { hash(3); } #define S4() { hash(4); } #define S5() { hash(5); } #define S6() { hash(6); } #define S7() { hash(7); } #define S8() { hash(8); } #define S9() { hash(9); } #define S10() { hash(10); } #define S11() { hash(11); } #define S12() { hash(12); } #define S13() { hash(13); } #define S14() { hash(14); } #define S15() { hash(15); } #define S16() { hash(16); } #define S17() { hash(17); } #define S18() { hash(18); } #define S19() { hash(19); } #define S20() { hash(20); } #define S21() { hash(21); } #define S22() { hash(22); } #define S23() { hash(23); } #define S24() { hash(24); } #define S25() { hash(25); } #define S26() { hash(26); } #define S27() { hash(27); } #define S28(i,j) { hash(28); hash(i); hash(j); } #define S29(i,j) { hash(29); hash(i); hash(j); } #define S30(i,j) { hash(30); hash(i); hash(j); } #define S31(i) { hash(31); hash(i); } #define S32() { hash(32); } #define S33() { hash(33); } #define S34() { hash(34); } #define S35() { hash(35); } #define S36() { hash(36); } #define S37() { hash(37); } #define S38(i) { hash(38); hash(i); } #define S39(i) { hash(39); hash(i); } #define S40(i,j,k) { hash(40); hash(i); hash(j); hash(k); } #define S41(i,j,k) { hash(41); hash(i); hash(j); hash(k); } #define S42(i,j,k) { hash(42); hash(i); hash(j); hash(k); } #define S43(i,j,k) { hash(43); hash(i); hash(j); hash(k); } #define S44(i,j) { hash(44); hash(i); hash(j); } #define S45(i,j) { hash(45); hash(i); hash(j); } #define S46(i,j) { hash(46); hash(i); hash(j); } #define S47(i,j) { hash(47); hash(i); hash(j); } #define S48(i,j) { hash(48); hash(i); hash(j); } #define S49(i,j) { hash(49); hash(i); hash(j); } #define S50(i,j) { hash(50); hash(i); hash(j); } #define S51(i,j) { hash(51); hash(i); hash(j); } #define S52(i) { hash(52); hash(i); } #define S53(i) { hash(53); hash(i); } #define S54(i) { hash(54); hash(i); } #define S55(i) { hash(55); hash(i); } #define S56(i) { hash(56); hash(i); } #define S57(i) { hash(57); hash(i); } #define S58(i) { hash(58); hash(i); } #define S59(i,j,k) { hash(59); hash(i); hash(j); hash(k); } #define S60(i,j,k) { hash(60); hash(i); hash(j); hash(k); } #define S61(i,j,k) { hash(61); hash(i); hash(j); hash(k); } #define S62(i,j) { hash(62); hash(i); hash(j); } #define S63(i,j) { hash(63); hash(i); hash(j); } #define S64(i,j) { hash(64); hash(i); hash(j); } #define S65(i,j) { hash(65); hash(i); hash(j); } #define S66(i,j) { hash(66); hash(i); hash(j); } #define S67(i,j) { hash(67); hash(i); hash(j); } #define S68(i) { hash(68); hash(i); } #define S69(i) { hash(69); hash(i); } #define S70(i) { hash(70); hash(i); } #define S71(i) { hash(71); hash(i); } #define S72(i) { hash(72); hash(i); } #define S73(i) { hash(73); hash(i); } #define S74(i) { hash(74); hash(i); } #define S75(i) { hash(75); hash(i); } #define S76(i) { hash(76); hash(i); } #define S77(i) { hash(77); hash(i); } #define S78(i) { hash(78); hash(i); } #define S79(i) { hash(79); hash(i); } #define S80(i) { hash(80); hash(i); } #define S81(i) { hash(81); hash(i); } #define S82(i) { hash(82); hash(i); } #define S83(i) { hash(83); hash(i); } #define S84(i) { hash(84); hash(i); } #define S85(i) { hash(85); hash(i); } #define S86(i) { hash(86); hash(i); } #define S87(i) { hash(87); hash(i); } #define S88(i) { hash(88); hash(i); } #define S89(i) { hash(89); hash(i); } #define S90(i) { hash(90); hash(i); } #define S91(i) { hash(91); hash(i); } #define S92(i) { hash(92); hash(i); } #define S93(i) { hash(93); hash(i); } #define S94(i) { hash(94); hash(i); } #define S95(i,j,k) { hash(95); hash(i); hash(j); hash(k); } #define S96(i,j,k) { hash(96); hash(i); hash(j); hash(k); } #define S97(i,j,k) { hash(97); hash(i); hash(j); hash(k); } #define S98(i,j) { hash(98); hash(i); hash(j); } #define S99(i) { hash(99); hash(i); } #define S100(i) { hash(100); hash(i); } #define S101(i) { hash(101); hash(i); } #define S102(i,j,k) { hash(102); hash(i); hash(j); hash(k); } #define S103(i,j,k) { hash(103); hash(i); hash(j); hash(k); } #define S104(i,j,k) { hash(104); hash(i); hash(j); hash(k); } #define S105(i,j,k) { hash(105); hash(i); hash(j); hash(k); } #define S106(i,j,k) { hash(106); hash(i); hash(j); hash(k); } #define S107(i,j,k) { hash(107); hash(i); hash(j); hash(k); } #define S108(i,j) { hash(108); hash(i); hash(j); } #define S109(i,j) { hash(109); hash(i); hash(j); } #define S110(i,j) { hash(110); hash(i); hash(j); } #define S111(i,j) { hash(111); hash(i); hash(j); } #define S112(i,j) { hash(112); hash(i); hash(j); } #define S113(i,j) { hash(113); hash(i); hash(j); } #define S114(i,j) { hash(114); hash(i); hash(j); } #define S115(i,j) { hash(115); hash(i); hash(j); } #define S116(i,j) { hash(116); hash(i); hash(j); } #define S117(i,j) { hash(117); hash(i); hash(j); } #define S118(i,j) { hash(118); hash(i); hash(j); } #define S119(i,j) { hash(119); hash(i); hash(j); } #define S120(i) { hash(120); hash(i); } #define S121(i) { hash(121); hash(i); } #define S122(i) { hash(122); hash(i); } #define S123(i) { hash(123); hash(i); } #define S124(i) { hash(124); hash(i); } #define S125(i) { hash(125); hash(i); } void test(int M, int N, int O, int P, int Q, int R) { /* Scattering iterators. */ int p1, p3, p5; /* Original iterators. */ int i, j, k; if (M == 1) { S1() ; S2() ; S3() ; S4() ; S5() ; S6() ; S7() ; S8() ; S9() ; S10() ; S11() ; S12() ; S13() ; S14() ; S15() ; S16() ; S17() ; S18() ; S19() ; S20() ; S21() ; S22() ; S23() ; S24() ; S25() ; S26() ; S27() ; } if (M == 1) { for (p1=1;p1<=N;p1++) { for (p3=1;p3<=N;p3++) { S28(p1,p3) ; S29(p1,p3) ; S30(p1,p3) ; } S31(p1) ; } } if (M == 1) { S32() ; S33() ; S34() ; } if ((M == 1) && (O <= 1)) { S35() ; } if (M == 1) { S36() ; S37() ; } if ((M == 1) && (N >= 1) && (Q >= 1) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S40(p1,p3,p5) ; S41(p1,p3,p5) ; S42(p1,p3,p5) ; S43(p1,p3,p5) ; } } for (p3=1;p3<=Q;p3++) { S44(p1,p3) ; S45(p1,p3) ; S46(p1,p3) ; S47(p1,p3) ; } for (p3=1;p3<=R;p3++) { S48(p1,p3) ; S49(p1,p3) ; S50(p1,p3) ; S51(p1,p3) ; } S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S59(p1,p3,p5) ; S60(p1,p3,p5) ; S61(p1,p3,p5) ; } } for (p3=1;p3<=Q;p3++) { S62(p1,p3) ; S63(p1,p3) ; S64(p1,p3) ; } for (p3=1;p3<=R;p3++) { S65(p1,p3) ; S66(p1,p3) ; S67(p1,p3) ; } S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5) ; S96(p1,p3,p5) ; S97(p1,p3,p5) ; } S98(p1,p3) ; } S99(p1) ; S100(p1) ; S101(p1) ; for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S102(p1,p3,p5) ; S103(p1,p3,p5) ; S104(p1,p3,p5) ; S105(p1,p3,p5) ; S106(p1,p3,p5) ; S107(p1,p3,p5) ; } } for (p3=1;p3<=Q;p3++) { S108(p1,p3) ; S109(p1,p3) ; S110(p1,p3) ; S111(p1,p3) ; S112(p1,p3) ; S113(p1,p3) ; } for (p3=1;p3<=R;p3++) { S114(p1,p3) ; S115(p1,p3) ; S116(p1,p3) ; S117(p1,p3) ; S118(p1,p3) ; S119(p1,p3) ; } S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } if ((M == 1) && (N <= 0) && (Q >= 1) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S40(p1,p3,p5) ; S41(p1,p3,p5) ; S42(p1,p3,p5) ; S43(p1,p3,p5) ; } } for (p3=1;p3<=Q;p3++) { S44(p1,p3) ; S45(p1,p3) ; S46(p1,p3) ; S47(p1,p3) ; } for (p3=1;p3<=R;p3++) { S48(p1,p3) ; S49(p1,p3) ; S50(p1,p3) ; S51(p1,p3) ; } S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S59(p1,p3,p5) ; S60(p1,p3,p5) ; S61(p1,p3,p5) ; } } for (p3=1;p3<=Q;p3++) { S62(p1,p3) ; S63(p1,p3) ; S64(p1,p3) ; } for (p3=1;p3<=R;p3++) { S65(p1,p3) ; S66(p1,p3) ; S67(p1,p3) ; } S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; S99(p1) ; S100(p1) ; S101(p1) ; for (p3=1;p3<=Q;p3++) { for (p5=1;p5<=R;p5++) { S102(p1,p3,p5) ; S103(p1,p3,p5) ; S104(p1,p3,p5) ; S105(p1,p3,p5) ; S106(p1,p3,p5) ; S107(p1,p3,p5) ; } } for (p3=1;p3<=Q;p3++) { S108(p1,p3) ; S109(p1,p3) ; S110(p1,p3) ; S111(p1,p3) ; S112(p1,p3) ; S113(p1,p3) ; } for (p3=1;p3<=R;p3++) { S114(p1,p3) ; S115(p1,p3) ; S116(p1,p3) ; S117(p1,p3) ; S118(p1,p3) ; S119(p1,p3) ; } S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } if ((M == 1) && (N >= 1) && (Q <= 0) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; for (p3=1;p3<=R;p3++) { S48(p1,p3) ; S49(p1,p3) ; S50(p1,p3) ; S51(p1,p3) ; } S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; for (p3=1;p3<=R;p3++) { S65(p1,p3) ; S66(p1,p3) ; S67(p1,p3) ; } S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5) ; S96(p1,p3,p5) ; S97(p1,p3,p5) ; } S98(p1,p3) ; } S99(p1) ; S100(p1) ; S101(p1) ; for (p3=1;p3<=R;p3++) { S114(p1,p3) ; S115(p1,p3) ; S116(p1,p3) ; S117(p1,p3) ; S118(p1,p3) ; S119(p1,p3) ; } S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } if ((M == 1) && (N <= 0) && (Q <= 0) && (R >= 1)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; for (p3=1;p3<=R;p3++) { S48(p1,p3) ; S49(p1,p3) ; S50(p1,p3) ; S51(p1,p3) ; } S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; for (p3=1;p3<=R;p3++) { S65(p1,p3) ; S66(p1,p3) ; S67(p1,p3) ; } S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; S99(p1) ; S100(p1) ; S101(p1) ; for (p3=1;p3<=R;p3++) { S114(p1,p3) ; S115(p1,p3) ; S116(p1,p3) ; S117(p1,p3) ; S118(p1,p3) ; S119(p1,p3) ; } S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } if ((M == 1) && (N >= 1) && (Q <= 0) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5) ; S96(p1,p3,p5) ; S97(p1,p3,p5) ; } S98(p1,p3) ; } S99(p1) ; S100(p1) ; S101(p1) ; S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } if ((M == 1) && (N <= 0) && (Q <= 0) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; S99(p1) ; S100(p1) ; S101(p1) ; S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } if ((M == 1) && (N >= 1) && (Q >= 1) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; for (p3=1;p3<=Q;p3++) { S44(p1,p3) ; S45(p1,p3) ; S46(p1,p3) ; S47(p1,p3) ; } S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; for (p3=1;p3<=Q;p3++) { S62(p1,p3) ; S63(p1,p3) ; S64(p1,p3) ; } S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; for (p3=1;p3<=N;p3++) { for (p5=1;p5<=N;p5++) { S95(p1,p3,p5) ; S96(p1,p3,p5) ; S97(p1,p3,p5) ; } S98(p1,p3) ; } S99(p1) ; S100(p1) ; S101(p1) ; for (p3=1;p3<=Q;p3++) { S108(p1,p3) ; S109(p1,p3) ; S110(p1,p3) ; S111(p1,p3) ; S112(p1,p3) ; S113(p1,p3) ; } S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } if ((M == 1) && (N <= 0) && (Q >= 1) && (R <= 0)) { for (p1=2;p1<=P;p1++) { S38(p1) ; S39(p1) ; for (p3=1;p3<=Q;p3++) { S44(p1,p3) ; S45(p1,p3) ; S46(p1,p3) ; S47(p1,p3) ; } S52(p1) ; S53(p1) ; S54(p1) ; S55(p1) ; S56(p1) ; S57(p1) ; S58(p1) ; for (p3=1;p3<=Q;p3++) { S62(p1,p3) ; S63(p1,p3) ; S64(p1,p3) ; } S68(p1) ; S69(p1) ; S70(p1) ; S71(p1) ; S72(p1) ; S73(p1) ; S74(p1) ; S75(p1) ; S76(p1) ; S77(p1) ; S78(p1) ; S79(p1) ; S80(p1) ; S81(p1) ; S82(p1) ; S83(p1) ; S84(p1) ; S85(p1) ; S86(p1) ; S87(p1) ; S88(p1) ; S89(p1) ; S90(p1) ; S91(p1) ; S92(p1) ; S93(p1) ; S94(p1) ; S99(p1) ; S100(p1) ; S101(p1) ; for (p3=1;p3<=Q;p3++) { S108(p1,p3) ; S109(p1,p3) ; S110(p1,p3) ; S111(p1,p3) ; S112(p1,p3) ; S113(p1,p3) ; } S120(p1) ; S121(p1) ; S122(p1) ; S123(p1) ; S124(p1) ; S125(p1) ; } } } cloog-0.18.2/test/stride3.c0000664000175000017500000000030612254312305012324 00000000000000/* Generated from ../../../git/cloog/test/stride3.cloog by CLooG 0.14.0-291-g5879c32 gmp bits in 0.00s. */ if ((m <= n) && (n >= 1)) { for (p1=max(50,50*m);p1<=50*n;p1+=50) { S1(p1/50); } } cloog-0.18.2/test/stride.cloog0000664000175000017500000000021712254312305013123 00000000000000c 0 2 0 2 1 1 3 0 -1 25 -1 0 0 1 3 4 1 1 0 -3 1 -1 0 100 0 1 -3 0 0 0 0 0 2 2 5 0 -1 0 1 0 0 0 -1 0 0 2 6 0 -1 0 1 0 0 0 0 -1 0 1 0 0 cloog-0.18.2/test/multi-mm-1.good.c0000664000175000017500000000137312254312305013602 00000000000000/* Generated from ../../../git/cloog/test/multi-mm-1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; for (i=0;i<=N;i++) { for (j=0;j<=i;j++) { S1(i,j) ; S2(i,j) ; } } for (i=N+1;i<=M;i++) { for (j=0;j<=N;j++) { S1(i,j) ; S2(i,j) ; } for (j=N+1;j<=i;j++) { S1(i,j) ; } } } cloog-0.18.2/test/infinite4.c0000664000175000017500000000020712254312305012640 00000000000000/* Generated from ../../../git/cloog/test/infinite4.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (;;i++) { S1(i) ; } cloog-0.18.2/test/cholesky.good.c0000664000175000017500000000234612254312305013525 00000000000000/* Generated from ../../../git/cloog/test/cholesky.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.05s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) { hash(1); hash(i); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i) { hash(3); hash(i); } #define S4(i,j) { hash(4); hash(i); hash(j); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } #define S6(i,j) { hash(6); hash(i); hash(j); } void test(int n) { /* Scattering iterators. */ int c1, c3, c5; /* Original iterators. */ int i, j, k; if (n >= 2) { S1(1) ; S3(1) ; for (c3=2;c3<=n;c3++) { S4(1,c3) ; S6(1,c3) ; } } if (n == 1) { S1(1) ; S3(1) ; } for (c1=2;c1<=n-1;c1++) { S1(c1) ; for (c3=1;c3<=c1-1;c3++) { S2(c1,c3) ; } S3(c1) ; for (c3=c1+1;c3<=n;c3++) { S4(c1,c3) ; for (c5=1;c5<=c1-1;c5++) { S5(c1,c3,c5) ; } S6(c1,c3) ; } } if (n >= 2) { S1(n) ; for (c3=1;c3<=n-1;c3++) { S2(n,c3) ; } S3(n) ; } } cloog-0.18.2/test/basic-bounds-4.c0000664000175000017500000000022512254312305013461 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-4.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (i=0;i<=M+1;i++) { S1(i) ; } cloog-0.18.2/test/non_optimal/0000775000175000017500000000000012254314447013214 500000000000000cloog-0.18.2/test/non_optimal/usvd_e_t.c0000664000175000017500000001137312254312305015104 00000000000000/* Generated from ../../../git/cloog/test/non_optimal/usvd_e_t.cloog by CLooG 0.14.0-238-gb1cb779 gmp bits in 0.11s. */ for (i=0;i<=2;i++) { S1(i,0,0); for (j=0;j<=4;j++) { S2(i,j,0); } } S1(3,0,0); for (j=0;j<=4;j++) { S2(3,j,0); } for (j=7;j<=11;j++) { S8(3,j,0); } S1(4,0,0); S2(4,0,0); S3(4,0,0); S5(4,0,0); for (j=1;j<=4;j++) { S2(4,j,0); S5(4,j,0); } for (j=7;j<=11;j++) { S8(4,j,0); } for (i=5;i<=6;i++) { for (j=-4;j<=i-9;j++) { S6(i,j,0); } for (j=i-9;j<=-1;j++) { S7(i,j,0); } S3(i,0,0); S7(i,0,0); for (j=1;j<=i-4;j++) { S4(i,j,-1); } for (j=i-4;j<=4;j++) { S5(i,j,0); } for (j=7;j<=11;j++) { S8(i,j,0); } } for (j=-4;j<=-2;j++) { S6(7,j,0); } for (j=-2;j<=-1;j++) { S7(7,j,0); } S3(7,0,0); S7(7,0,0); for (j=1;j<=3;j++) { S4(7,j,-1); } for (j=3;j<=4;j++) { S5(7,j,0); } S9(7,4,0); S10(7,4,0); S11(7,4,0); S21(7,4,0); S23(7,4,0); S11(7,4,1); S16(7,4,1); S17(7,4,1); for (k=2;k<=4;k++) { S11(7,4,k); } S12(7,5,0); S21(7,5,0); S22(7,5,0); S23(7,5,0); S12(7,5,1); S16(7,5,1); S17(7,5,1); for (k=2;k<=4;k++) { S12(7,5,k); } S21(7,6,0); S22(7,6,0); S23(7,6,0); for (j=7;j<=8;j++) { S8(7,j,0); S21(7,j,0); S22(7,j,0); S23(7,j,0); } S8(7,9,0); S22(7,9,0); for (j=10;j<=11;j++) { S8(7,j,0); } for (j=-4;j<=-1;j++) { S6(8,j,0); } S7(8,-1,0); S3(8,0,0); S7(8,0,0); S19(8,1,-2); S4(8,1,-1); S19(8,1,-1); S19(8,1,0); S15(8,1,4); S18(8,1,4); for (k=-4;k<=-3;k++) { S14(8,2,k); S20(8,2,k); } S14(8,2,-2); S19(8,2,-2); S20(8,2,-2); S4(8,2,-1); S14(8,2,-1); S19(8,2,-1); S20(8,2,-1); S14(8,2,0); S19(8,2,0); S20(8,2,0); S15(8,2,4); S18(8,2,4); for (k=-4;k<=-2;k++) { S14(8,3,k); S20(8,3,k); } S4(8,3,-1); S14(8,3,-1); S20(8,3,-1); S14(8,3,0); S20(8,3,0); S15(8,3,4); S18(8,3,4); for (k=-4;k<=-2;k++) { S14(8,4,k); S20(8,4,k); } S4(8,4,-1); S14(8,4,-1); S20(8,4,-1); S5(8,4,0); S9(8,4,0); S10(8,4,0); S14(8,4,0); S20(8,4,0); S23(8,4,0); S13(8,4,1); S21(8,4,1); S23(8,4,1); S24(8,4,1); S13(8,4,2); S16(8,4,2); S17(8,4,2); S24(8,4,2); S13(8,4,3); S24(8,4,3); S13(8,4,4); S15(8,4,4); S23(8,5,0); S11(8,5,1); S21(8,5,1); S22(8,5,1); S23(8,5,1); S24(8,5,1); S11(8,5,2); S16(8,5,2); S17(8,5,2); S24(8,5,2); S11(8,5,3); S24(8,5,3); S11(8,5,4); S15(8,5,4); S23(8,6,0); S12(8,6,1); S21(8,6,1); S22(8,6,1); S23(8,6,1); S24(8,6,1); S12(8,6,2); S16(8,6,2); S17(8,6,2); S24(8,6,2); S12(8,6,3); S24(8,6,3); S12(8,6,4); for (j=7;j<=8;j++) { S23(8,j,0); S21(8,j,1); S22(8,j,1); S23(8,j,1); for (k=1;k<=3;k++) { S24(8,j,k); } } S22(8,9,1); S7(9,0,0); for (j=1;j<=2;j++) { for (k=-1;k<=0;k++) { S19(9,j,k); } for (k=4;k<=5;k++) { S15(9,j,k); S18(9,j,k); } } S20(9,3,-4); for (k=-3;k<=-2;k++) { S14(9,3,k); S20(9,3,k); } for (k=-1;k<=0;k++) { S14(9,3,k); S19(9,3,k); S20(9,3,k); } for (k=4;k<=5;k++) { S15(9,3,k); S18(9,3,k); } S20(9,4,-4); for (k=-3;k<=-1;k++) { S14(9,4,k); S20(9,4,k); } S9(9,4,0); S10(9,4,0); S14(9,4,0); S20(9,4,0); for (k=0;k<=1;k++) { S23(9,4,k); } S13(9,4,2); S21(9,4,2); S23(9,4,2); S24(9,4,2); S13(9,4,3); S16(9,4,3); S17(9,4,3); S24(9,4,3); S13(9,4,4); for (k=4;k<=5;k++) { S15(9,4,k); S18(9,4,k); } for (k=0;k<=1;k++) { S23(9,5,k); } S13(9,5,2); S21(9,5,2); S22(9,5,2); S23(9,5,2); S24(9,5,2); S13(9,5,3); S16(9,5,3); S17(9,5,3); S24(9,5,3); S13(9,5,4); for (k=4;k<=5;k++) { S15(9,5,k); } for (k=0;k<=1;k++) { S23(9,6,k); } S11(9,6,2); S21(9,6,2); S22(9,6,2); S23(9,6,2); S24(9,6,2); S11(9,6,3); S16(9,6,3); S17(9,6,3); S24(9,6,3); S11(9,6,4); for (k=0;k<=1;k++) { S23(9,7,k); } S12(9,7,2); S21(9,7,2); S22(9,7,2); S23(9,7,2); S24(9,7,2); S12(9,7,3); S16(9,7,3); S17(9,7,3); S24(9,7,3); S12(9,7,4); for (k=0;k<=1;k++) { S23(9,8,k); } S21(9,8,2); S22(9,8,2); S23(9,8,2); for (k=2;k<=3;k++) { S24(9,8,k); } S22(9,9,2); for (j=1;j<=3;j++) { S19(10,j,0); S26(10,j,3); S15(10,j,4); S18(10,j,4); S25(10,j,4); for (k=5;k<=6;k++) { S15(10,j,k); S18(10,j,k); } } for (k=-4;k<=-3;k++) { S20(10,4,k); } for (k=-2;k<=-1;k++) { S14(10,4,k); S20(10,4,k); } S9(10,4,0); S10(10,4,0); S14(10,4,0); S19(10,4,0); S20(10,4,0); S13(10,4,3); S21(10,4,3); S24(10,4,3); S26(10,4,3); S13(10,4,4); S15(10,4,4); S16(10,4,4); S17(10,4,4); S18(10,4,4); S25(10,4,4); for (k=5;k<=6;k++) { S15(10,4,k); S18(10,4,k); } S13(10,5,3); S21(10,5,3); S22(10,5,3); S24(10,5,3); S26(10,5,3); S13(10,5,4); S15(10,5,4); S16(10,5,4); S17(10,5,4); S18(10,5,4); S25(10,5,4); for (k=5;k<=6;k++) { S15(10,5,k); S18(10,5,k); } S13(10,6,3); S21(10,6,3); S22(10,6,3); S24(10,6,3); S13(10,6,4); S16(10,6,4); S17(10,6,4); S11(10,7,3); S21(10,7,3); S22(10,7,3); S24(10,7,3); S11(10,7,4); S16(10,7,4); S17(10,7,4); S12(10,8,3); S21(10,8,3); S22(10,8,3); S24(10,8,3); S12(10,8,4); S16(10,8,4); S17(10,8,4); S22(10,9,3); for (i=11;i<=14;i++) { for (j=1;j<=5;j++) { S26(i,j,3); S25(i,j,4); } } cloog-0.18.2/test/non_optimal/usvd_e_t.good.c0000664000175000017500000001735512254312305016041 00000000000000/* Generated from ../../../git/cloog/test/./non_optimal/usvd_e_t.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.36s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j,k) { hash(3); hash(i); hash(j); hash(k); } #define S4(i,j,k) { hash(4); hash(i); hash(j); hash(k); } #define S5(i,j,k) { hash(5); hash(i); hash(j); hash(k); } #define S6(i,j,k) { hash(6); hash(i); hash(j); hash(k); } #define S7(i,j,k) { hash(7); hash(i); hash(j); hash(k); } #define S8(i,j,k) { hash(8); hash(i); hash(j); hash(k); } #define S9(i,j,k) { hash(9); hash(i); hash(j); hash(k); } #define S10(i,j,k) { hash(10); hash(i); hash(j); hash(k); } #define S11(i,j,k) { hash(11); hash(i); hash(j); hash(k); } #define S12(i,j,k) { hash(12); hash(i); hash(j); hash(k); } #define S13(i,j,k) { hash(13); hash(i); hash(j); hash(k); } #define S14(i,j,k) { hash(14); hash(i); hash(j); hash(k); } #define S15(i,j,k) { hash(15); hash(i); hash(j); hash(k); } #define S16(i,j,k) { hash(16); hash(i); hash(j); hash(k); } #define S17(i,j,k) { hash(17); hash(i); hash(j); hash(k); } #define S18(i,j,k) { hash(18); hash(i); hash(j); hash(k); } #define S19(i,j,k) { hash(19); hash(i); hash(j); hash(k); } #define S20(i,j,k) { hash(20); hash(i); hash(j); hash(k); } #define S21(i,j,k) { hash(21); hash(i); hash(j); hash(k); } #define S22(i,j,k) { hash(22); hash(i); hash(j); hash(k); } #define S23(i,j,k) { hash(23); hash(i); hash(j); hash(k); } #define S24(i,j,k) { hash(24); hash(i); hash(j); hash(k); } #define S25(i,j,k) { hash(25); hash(i); hash(j); hash(k); } #define S26(i,j,k) { hash(26); hash(i); hash(j); hash(k); } void test() { /* Original iterators. */ int i, j, k; for (i=0;i<=2;i++) { S1(i,0,0) ; S2(i,0,0) ; for (j=1;j<=4;j++) { S2(i,j,0) ; } } S1(3,0,0) ; S2(3,0,0) ; for (j=1;j<=4;j++) { S2(3,j,0) ; } for (j=7;j<=11;j++) { S8(3,j,0) ; } S1(4,0,0) ; S2(4,0,0) ; S3(4,0,0) ; S5(4,0,0) ; for (j=1;j<=4;j++) { S2(4,j,0) ; S5(4,j,0) ; } for (j=7;j<=11;j++) { S8(4,j,0) ; } S6(5,-4,0) ; S7(5,-4,0) ; for (j=-3;j<=-1;j++) { S7(5,j,0) ; } S3(5,0,0) ; S7(5,0,0) ; S4(5,1,-1) ; S5(5,1,0) ; for (j=2;j<=4;j++) { S5(5,j,0) ; } for (j=7;j<=11;j++) { S8(5,j,0) ; } S6(6,-4,0) ; S6(6,-3,0) ; S7(6,-3,0) ; for (j=-2;j<=-1;j++) { S7(6,j,0) ; } S3(6,0,0) ; S7(6,0,0) ; S4(6,1,-1) ; S4(6,2,-1) ; S5(6,2,0) ; for (j=3;j<=4;j++) { S5(6,j,0) ; } for (j=7;j<=11;j++) { S8(6,j,0) ; } for (j=-4;j<=-3;j++) { S6(7,j,0) ; } S6(7,-2,0) ; S7(7,-2,0) ; S7(7,-1,0) ; S3(7,0,0) ; S7(7,0,0) ; for (j=1;j<=2;j++) { S4(7,j,-1) ; } S4(7,3,-1) ; S5(7,3,0) ; S5(7,4,0) ; S9(7,4,0) ; S10(7,4,0) ; S11(7,4,0) ; S21(7,4,0) ; S23(7,4,0) ; S11(7,4,1) ; S16(7,4,1) ; S17(7,4,1) ; for (k=2;k<=4;k++) { S11(7,4,k) ; } S12(7,5,0) ; S21(7,5,0) ; S22(7,5,0) ; S23(7,5,0) ; S12(7,5,1) ; S16(7,5,1) ; S17(7,5,1) ; for (k=2;k<=4;k++) { S12(7,5,k) ; } S21(7,6,0) ; S22(7,6,0) ; S23(7,6,0) ; for (j=7;j<=8;j++) { S8(7,j,0) ; S21(7,j,0) ; S22(7,j,0) ; S23(7,j,0) ; } S8(7,9,0) ; S22(7,9,0) ; for (j=10;j<=11;j++) { S8(7,j,0) ; } for (j=-4;j<=-2;j++) { S6(8,j,0) ; } S6(8,-1,0) ; S7(8,-1,0) ; S3(8,0,0) ; S7(8,0,0) ; S19(8,1,-2) ; S4(8,1,-1) ; S19(8,1,-1) ; S19(8,1,0) ; S15(8,1,4) ; S18(8,1,4) ; for (k=-4;k<=-3;k++) { S14(8,2,k) ; S20(8,2,k) ; } S14(8,2,-2) ; S19(8,2,-2) ; S20(8,2,-2) ; S4(8,2,-1) ; S14(8,2,-1) ; S19(8,2,-1) ; S20(8,2,-1) ; S14(8,2,0) ; S19(8,2,0) ; S20(8,2,0) ; S15(8,2,4) ; S18(8,2,4) ; for (k=-4;k<=-2;k++) { S14(8,3,k) ; S20(8,3,k) ; } S4(8,3,-1) ; S14(8,3,-1) ; S20(8,3,-1) ; S14(8,3,0) ; S20(8,3,0) ; S15(8,3,4) ; S18(8,3,4) ; for (k=-4;k<=-2;k++) { S14(8,4,k) ; S20(8,4,k) ; } S4(8,4,-1) ; S14(8,4,-1) ; S20(8,4,-1) ; S5(8,4,0) ; S9(8,4,0) ; S10(8,4,0) ; S14(8,4,0) ; S20(8,4,0) ; S23(8,4,0) ; S13(8,4,1) ; S21(8,4,1) ; S23(8,4,1) ; S24(8,4,1) ; S13(8,4,2) ; S16(8,4,2) ; S17(8,4,2) ; S24(8,4,2) ; S13(8,4,3) ; S24(8,4,3) ; S13(8,4,4) ; S15(8,4,4) ; S23(8,5,0) ; S11(8,5,1) ; S21(8,5,1) ; S22(8,5,1) ; S23(8,5,1) ; S24(8,5,1) ; S11(8,5,2) ; S16(8,5,2) ; S17(8,5,2) ; S24(8,5,2) ; S11(8,5,3) ; S24(8,5,3) ; S11(8,5,4) ; S15(8,5,4) ; S23(8,6,0) ; S12(8,6,1) ; S21(8,6,1) ; S22(8,6,1) ; S23(8,6,1) ; S24(8,6,1) ; S12(8,6,2) ; S16(8,6,2) ; S17(8,6,2) ; S24(8,6,2) ; S12(8,6,3) ; S24(8,6,3) ; S12(8,6,4) ; for (j=7;j<=8;j++) { S23(8,j,0) ; S21(8,j,1) ; S22(8,j,1) ; S23(8,j,1) ; S24(8,j,1) ; for (k=2;k<=3;k++) { S24(8,j,k) ; } } S22(8,9,1) ; S7(9,0,0) ; for (j=1;j<=2;j++) { for (k=-1;k<=0;k++) { S19(9,j,k) ; } for (k=4;k<=5;k++) { S15(9,j,k) ; S18(9,j,k) ; } } S20(9,3,-4) ; for (k=-3;k<=-2;k++) { S14(9,3,k) ; S20(9,3,k) ; } for (k=-1;k<=0;k++) { S14(9,3,k) ; S19(9,3,k) ; S20(9,3,k) ; } for (k=4;k<=5;k++) { S15(9,3,k) ; S18(9,3,k) ; } S20(9,4,-4) ; for (k=-3;k<=-1;k++) { S14(9,4,k) ; S20(9,4,k) ; } S9(9,4,0) ; S10(9,4,0) ; S14(9,4,0) ; S20(9,4,0) ; S23(9,4,0) ; S23(9,4,1) ; S13(9,4,2) ; S21(9,4,2) ; S23(9,4,2) ; S24(9,4,2) ; S13(9,4,3) ; S16(9,4,3) ; S17(9,4,3) ; S24(9,4,3) ; S13(9,4,4) ; S15(9,4,4) ; S18(9,4,4) ; S15(9,4,5) ; S18(9,4,5) ; for (k=0;k<=1;k++) { S23(9,5,k) ; } S13(9,5,2) ; S21(9,5,2) ; S22(9,5,2) ; S23(9,5,2) ; S24(9,5,2) ; S13(9,5,3) ; S16(9,5,3) ; S17(9,5,3) ; S24(9,5,3) ; S13(9,5,4) ; S15(9,5,4) ; S15(9,5,5) ; for (k=0;k<=1;k++) { S23(9,6,k) ; } S11(9,6,2) ; S21(9,6,2) ; S22(9,6,2) ; S23(9,6,2) ; S24(9,6,2) ; S11(9,6,3) ; S16(9,6,3) ; S17(9,6,3) ; S24(9,6,3) ; S11(9,6,4) ; for (k=0;k<=1;k++) { S23(9,7,k) ; } S12(9,7,2) ; S21(9,7,2) ; S22(9,7,2) ; S23(9,7,2) ; S24(9,7,2) ; S12(9,7,3) ; S16(9,7,3) ; S17(9,7,3) ; S24(9,7,3) ; S12(9,7,4) ; for (k=0;k<=1;k++) { S23(9,8,k) ; } S21(9,8,2) ; S22(9,8,2) ; S23(9,8,2) ; S24(9,8,2) ; S24(9,8,3) ; S22(9,9,2) ; for (j=1;j<=3;j++) { S19(10,j,0) ; S26(10,j,3) ; S15(10,j,4) ; S18(10,j,4) ; S25(10,j,4) ; for (k=5;k<=6;k++) { S15(10,j,k) ; S18(10,j,k) ; } } for (k=-4;k<=-3;k++) { S20(10,4,k) ; } for (k=-2;k<=-1;k++) { S14(10,4,k) ; S20(10,4,k) ; } S9(10,4,0) ; S10(10,4,0) ; S14(10,4,0) ; S19(10,4,0) ; S20(10,4,0) ; S13(10,4,3) ; S21(10,4,3) ; S24(10,4,3) ; S26(10,4,3) ; S13(10,4,4) ; S15(10,4,4) ; S16(10,4,4) ; S17(10,4,4) ; S18(10,4,4) ; S25(10,4,4) ; for (k=5;k<=6;k++) { S15(10,4,k) ; S18(10,4,k) ; } S13(10,5,3) ; S21(10,5,3) ; S22(10,5,3) ; S24(10,5,3) ; S26(10,5,3) ; S13(10,5,4) ; S15(10,5,4) ; S16(10,5,4) ; S17(10,5,4) ; S18(10,5,4) ; S25(10,5,4) ; for (k=5;k<=6;k++) { S15(10,5,k) ; S18(10,5,k) ; } S13(10,6,3) ; S21(10,6,3) ; S22(10,6,3) ; S24(10,6,3) ; S13(10,6,4) ; S16(10,6,4) ; S17(10,6,4) ; S11(10,7,3) ; S21(10,7,3) ; S22(10,7,3) ; S24(10,7,3) ; S11(10,7,4) ; S16(10,7,4) ; S17(10,7,4) ; S12(10,8,3) ; S21(10,8,3) ; S22(10,8,3) ; S24(10,8,3) ; S12(10,8,4) ; S16(10,8,4) ; S17(10,8,4) ; S22(10,9,3) ; for (i=11;i<=14;i++) { for (j=1;j<=5;j++) { S26(i,j,3) ; S25(i,j,4) ; } } } cloog-0.18.2/test/non_optimal/nul_complex1.cloog0000664000175000017500000000053512254312305016561 00000000000000# Optimal code is in fact : # # for (i=0;i<=M;i+=2) { # S1 ; # } # language: C c # parameter n 1 3 # n 1 1 0 1 1 n 1 # Number of statements 1 # {i | 0<=i<=n} 4 5 # i j n 1 1 1 0 0 0 1 -1 0 1 0 1 0 1 0 0 1 0 -1 1 0 0 0 0 0 1 # Scattering functions 2 7 # c1 c2 i j n 1 0 1 0 -2 -3 0 0 0 0 1 -2 -2 0 0 0 cloog-0.18.2/test/non_optimal/youcef.good.c0000664000175000017500000000143112254312305015507 00000000000000/* Generated from ../../../git/cloog/test/./non_optimal/youcef.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } #define S3(i,j) { hash(3); hash(i); hash(j); } void test() { /* Original iterators. */ int i, j; for (i=0;i<=3;i++) { S1(i,i) ; S2(i,i) ; for (j=i+1;j<=4;j++) { S2(i,j) ; } S2(i,5) ; S3(i,5) ; } S1(4,4) ; S2(4,4) ; S2(4,5) ; S3(4,5) ; S1(5,5) ; S2(5,5) ; S3(5,5) ; } cloog-0.18.2/test/non_optimal/nul_complex1.good.c0000664000175000017500000000137612254312305016633 00000000000000/* Generated from ../../../git/cloog/test/./non_optimal/nul_complex1.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } void test(int n) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j; for (c1=0;c1<=5*n;c1++) { for (c2=max(c1-n,ceild(2*c1,3));c2<=min(c1,floord(2*c1+2*n,3));c2++) { if (c2%2 == 0) { i = (-2*c1+3*c2)/2 ; j = c1-c2 ; S1((-2*c1+3*c2)/2,c1-c2) ; } } } } cloog-0.18.2/test/non_optimal/usvd_e_t.cloog0000664000175000017500000001316012254312305015761 00000000000000# language: C c # Context 0 2 0 # parameter names 26 # Number of statements 1 4 5 # i j k 1 0 0 1 0 0 0 0 0 1 0 1 1 0 0 0 1 -1 0 0 4 0 0 0 1 5 5 # i j k 1 0 0 0 1 0 1 1 0 0 0 1 -1 0 0 4 1 0 1 0 0 1 0 -1 0 4 0 0 0 1 4 5 # i j k 1 0 0 1 0 0 0 0 0 1 0 1 1 0 0 -4 1 -1 0 0 8 0 0 0 1 4 5 # i j k 1 0 0 0 1 1 1 -1 0 0 8 1 0 1 0 -1 1 1 -1 0 -4 0 0 0 1 4 5 # i j k 1 0 0 0 1 0 1 1 0 0 -4 1 0 -1 0 4 1 -1 1 0 4 0 0 0 1 4 5 # i j k 1 0 0 0 1 0 1 -1 0 0 8 1 0 1 0 4 1 1 -1 0 -9 0 0 0 1 4 5 # i j k 1 0 0 0 1 0 1 1 0 0 -5 1 0 -1 0 0 1 -1 1 0 9 0 0 0 1 5 5 # i j k 1 0 0 0 1 0 1 1 0 0 -3 1 -1 0 0 7 1 0 1 0 -7 1 0 -1 0 11 0 0 0 1 4 5 # i j k 1 0 0 1 0 -4 0 0 0 1 0 1 1 0 0 -7 1 -1 0 0 10 0 0 0 1 4 5 # i j k 1 0 0 1 0 -4 0 0 0 1 0 1 1 0 0 -7 1 -1 0 0 10 0 0 0 1 5 5 # i j k 1 0 1 -1 0 -3 1 0 -1 0 7 1 0 1 0 -4 1 0 0 -1 4 1 0 -1 1 4 0 0 0 1 5 5 # i j k 1 0 1 -1 0 -2 1 0 1 0 -5 1 0 -1 0 8 1 0 0 -1 4 1 0 -1 1 5 0 0 0 1 5 5 # i j k 1 1 -1 0 0 10 1 0 1 0 -4 1 0 0 -1 4 1 -1 0 1 7 1 1 -1 0 -4 0 0 0 1 5 5 # i j k 1 1 1 0 0 -8 1 0 -1 0 4 1 0 0 -1 0 1 -1 0 1 12 1 -1 1 0 6 0 0 0 1 5 5 # i j k 1 1 -1 0 0 10 1 0 1 0 -1 1 0 -1 0 5 1 0 0 1 -4 1 1 0 -1 -4 0 0 0 1 5 5 # i j k 1 0 1 0 -1 -6 1 0 0 -1 4 1 0 1 0 -4 1 0 0 1 -1 1 0 -1 1 4 0 0 0 1 5 5 # i j k 1 0 1 0 -1 -6 1 0 0 1 -1 1 0 1 0 -4 1 0 0 -1 4 1 0 -1 1 4 0 0 0 1 5 5 # i j k 1 1 -1 0 0 10 1 0 1 0 -1 1 0 0 1 -4 1 1 0 -1 -4 1 1 -1 0 -5 0 0 0 1 5 5 # i j k 1 1 1 0 0 -8 1 0 1 0 -1 1 0 0 -1 0 1 -1 0 1 10 1 1 -1 0 -6 0 0 0 1 5 5 # i j k 1 1 1 0 0 -8 1 0 -1 0 4 1 0 0 1 4 1 0 0 -1 0 1 -1 1 0 6 0 0 0 1 5 5 # i j k 1 0 1 0 -1 -7 1 0 0 -1 3 1 0 1 0 -4 1 0 -1 0 8 1 0 0 1 0 0 0 0 1 5 5 # i j k 1 0 1 0 -1 -7 1 0 0 1 0 1 0 1 0 -5 1 0 -1 0 9 1 0 0 -1 3 0 0 0 1 5 5 # i j k 1 1 -1 0 0 9 1 0 1 0 -4 1 0 -1 0 8 1 0 0 1 0 1 1 0 -1 -7 0 0 0 1 5 5 # i j k 1 1 1 0 0 -8 1 0 1 0 -4 1 0 -1 0 8 1 0 0 -1 3 1 -1 0 1 7 0 0 0 1 5 5 # i j k 1 0 0 0 1 -4 1 1 0 0 -10 1 -1 0 0 14 1 0 1 0 -1 1 0 -1 0 5 0 0 0 1 5 5 # i j k 1 0 0 0 1 -3 1 1 0 0 -10 1 -1 0 0 14 1 0 1 0 -1 1 0 -1 0 5 0 0 0 0 # iterator names 0 # scattering functions 0 # scattering dimension names cloog-0.18.2/test/non_optimal/nul_complex1.c0000664000175000017500000000050112254312305015671 00000000000000/* Generated from ../../../git/cloog/test/./non_optimal/nul_complex1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ if (n >= 0) { for (c1=0;c1<=5*n;c1++) { for (c2=max(ceild(2*c1,3),c1-n);c2<=min(floord(2*c1+2*n,3),c1);c2++) { if (c2%2 == 0) { S1((-2*c1+3*c2)/2,c1-c2) ; } } } } cloog-0.18.2/test/non_optimal/youcef.cloog0000664000175000017500000000070312254312305015442 00000000000000# Optimal code is in fact : # # for (i=0;i<=M;i++) { # S1 ; # for (j=0;j<=N;j++) { # S2 ; # } # S3 ; # } # language: C c # parameters {M, N | M>=1 N >=1} 0 2 0 3 # Number of statements 1 # {i | 0<=i<=5 i==j} 3 4 1 1 0 0 1 -1 0 5 0 1 -1 0 0 0 0 1 # {i | 0<=i<=5 i<=j<=5} 4 4 1 1 0 0 1 -1 0 5 1 -1 1 0 1 0 -1 5 0 0 0 1 # {i | 0<=i<=5 j==5} 3 4 1 1 0 0 1 -1 0 5 0 0 1 -5 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/non_optimal/youcef.c0000664000175000017500000000031312254312305014556 00000000000000/* Generated from ../../../git/cloog/test/non_optimal/youcef.cloog by CLooG 0.14.0-238-gb1cb779 gmp bits in 0.00s. */ for (i=0;i<=5;i++) { S1(i,i); for (j=i;j<=5;j++) { S2(i,j); } S3(i,5); } cloog-0.18.2/test/donotsimp.c0000664000175000017500000000034612254312305012767 00000000000000/* Generated from ../../../git/cloog/test/donotsimp.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.01s. */ for (c2=1;c2<=10;c2++) { for (c4=1;c4<=c2;c4++) { S1(c2,c4) ; } for (c4=11;c4<=M;c4++) { S2(c2,c4) ; } } cloog-0.18.2/test/infinite3.c0000664000175000017500000000050112254312305012634 00000000000000/* Generated from ../../../git/cloog/test/infinite3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.03s. */ for (;i<=0;i++) { S1(i) ; } for (i=1;i<=min(M,N);i++) { S1(i) ; for (j=1;j<=M;j++) { S2(i,j) ; } } for (i=N+1;i<=M;i++) { S1(i) ; } for (i=M+1;i<=N;i++) { for (j=1;j<=M;j++) { S2(i,j) ; } } cloog-0.18.2/test/emploi.cloog0000664000175000017500000000212312254312305013114 00000000000000# language: C c # The context (no constraints on parameters) 1 4 # 1 lines and 4 columns # m n 1 1 0 0 0 # 0 >= 0, always true 1 # We want to set the parameter names m n 2 # The number of statements 2 # First statement # The first domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 -1 2 0 0 # i <= 2*m # The second domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 1 -1 0 0 # i >= m 0 0 0 1 # Second statement 4 6 # 4 lines and 6 columns # i j m n 1 1 1 0 0 0 -1 # i >= 1 1 -1 0 0 1 0 # i <= n 1 0 1 0 0 -1 # j >= 1 1 0 -1 1 0 0 # j <= m 0 0 0 0 0 # Scattering functions # The first function 2 7 # 2 lines and 7 columns # c1 c2 i m n 1 0 1 0 -1 0 0 0 # c1 = i 0 0 1 0 0 0 0 # c2 = 0 # The second function 2 8 # 2 lines and 8 columns # c1 c2 i j m n 1 0 1 0 0 0 0 -1 0 # c1 = n 0 0 1 -1 -1 0 0 0 # c2 = i+j 0 cloog-0.18.2/test/block.c0000664000175000017500000000020612254312305012040 00000000000000/* Generated from /home/skimo/git/cloog/test/block.cloog by CLooG 0.14.0-170-g72daac3 gmp bits in 0.00s. */ S1(); S3(0); S2(); S3(1); cloog-0.18.2/test/multi-mm-1.cloog0000664000175000017500000000055612254312305013536 00000000000000# language: C c # Context #{M,N|M>N} 3 4 # M N 1 1 1 -1 0 1 0 1 -1 1 0 0 1 0 2 # Number of statements 1 # 4 6 # i j M N 1 1 0 1 0 0 0 1 1 -1 0 0 0 1 -1 0 1 0 0 1 0 0 0 0 1 0 0 0 1 # 5 6 # i j M N 1 1 0 1 0 0 0 1 1 -1 0 0 0 1 -1 0 1 0 0 1 0 -1 0 1 0 1 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/christian.good.c0000664000175000017500000000151312254312305013663 00000000000000/* Generated from ../../../git/cloog/test/christian.cloog by CLooG 0.16.2-5-g3b3bf96 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int N) { /* Scattering iterators. */ int p; /* Original iterators. */ int i, j; if (N >= 1) { S1(0,N-1); for (p=-N+2;p<=N-1;p++) { if (p >= 1) { S2(p-1,0); } for (i=max(0,p);i<=min(N-1,p+N-2);i++) { S1(i,-p+i); S2(i,-p+i+1); } if (p <= 0) { S1(p+N-1,N-1); } } S2(N-1,0); } } cloog-0.18.2/test/min-1-1.cloog0000664000175000017500000000052112254312305012706 00000000000000# language: C c # Context # {M,N | 1>=0} 1 4 # M N 1 1 0 0 1 0 1 # Number of statements 1 # {i,j |1<=i<=N; 0<=j<=M; j<=i; j+i<=N}, i.e. # {i,j | (1,j)<=i<=-j+N; 0<=j<=M} 6 6 # i j M N 1 1 1 0 0 0 -1 1 0 1 0 0 0 1 0 -1 1 0 0 1 1 -1 0 0 0 1 -1 -1 0 1 0 1 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/thomasset.cloog0000664000175000017500000000161112254312305013637 00000000000000# language: C c 1 3 1 0 0 # 0 >= 0 1 n # ------------- STATEMENTS ------------- 2 # Number of statements # ax:Z 1 # The domain is made of one polyhedron 4 5 # 4 lines and 5 columns # i j n 1 -1 0 1 0 1 1 0 0 -1 1 1 -3 0 -1 1 -1 3 0 3 0 0 0 # future options # ax:P 1 # The domain is made of one polyhedron 10 8 # 10 lines and 8 columns # i j k p q n 1 -1 0 0 0 0 1 0 1 0 -1 0 0 0 1 0 1 0 1 0 0 0 0 -1 1 1 0 0 0 0 0 -1 1 0 1 0 0 -3 0 0 1 0 -1 0 0 3 0 2 1 0 0 0 -3 0 1 0 1 0 0 0 3 0 -1 2 1 0 0 -3 0 0 0 1 1 0 0 3 0 0 0 1 0 0 0 # future options 1 # Iterator Names i j k p q # ------------- SCATTERING ------------- 2 # nb scattering functions # Scattering for ax:Z 2 7 # 2 lines and 7 columns # c1 c2 i j n 0 1 0 0 -1 0 0 0 0 1 0 0 0 0 # Scattering for ax:P 2 10 # 2 lines and 10 columns # c1 c2 i j k p q n 0 1 0 0 0 -1 -1 -1 0 0 0 0 1 -1 0 0 0 0 0 1 0 # Scattering Function Names cloog-0.18.2/test/classen.good.c0000664000175000017500000002654712254312305013345 00000000000000/* Generated from ../../../git/cloog/test/classen.cloog by CLooG 0.14.0-76-gfd78716 gmp bits in 1.73s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(coordT1,coordP1,other1,other2) { hash(1); hash(coordT1); hash(coordP1); hash(other1); hash(other2); } #define S2(coordT1,coordP1,other1,other2,other3,other4,other5,other6) { hash(2); hash(coordT1); hash(coordP1); hash(other1); hash(other2); hash(other3); hash(other4); hash(other5); hash(other6); } #define S3(coordT1,coordP1,other1,other2,other3,other4,other5,other6) { hash(3); hash(coordT1); hash(coordP1); hash(other1); hash(other2); hash(other3); hash(other4); hash(other5); hash(other6); } #define S4(coordT1,coordP1,other1,other2,other3,other4,other5,other6) { hash(4); hash(coordT1); hash(coordP1); hash(other1); hash(other2); hash(other3); hash(other4); hash(other5); hash(other6); } #define S5(coordT1,coordP1,other1,other2,other3,other4,other5,other6) { hash(5); hash(coordT1); hash(coordP1); hash(other1); hash(other2); hash(other3); hash(other4); hash(other5); hash(other6); } #define S6(coordT1,coordP1,other1,other2,other3,other4,other5,other6) { hash(6); hash(coordT1); hash(coordP1); hash(other1); hash(other2); hash(other3); hash(other4); hash(other5); hash(other6); } #define S7(coordT1,coordP1,other1,other2,other3,other4,other5,other6) { hash(7); hash(coordT1); hash(coordP1); hash(other1); hash(other2); hash(other3); hash(other4); hash(other5); hash(other6); } #define S8(coordT1,coordP1) { hash(8); hash(coordT1); hash(coordP1); } void test(int m) { /* Scattering iterators. */ int glT1, rp1, local1, local2; /* Original iterators. */ int coordT1, coordP1, other1, other2, other3, other4, other5, other6; if (m >= 2) { S1(0,1,1,1) ; S2(0,1,1,1,1,1,2,1) ; S3(0,1,1,2,1,1,1,2) ; S4(0,1,2,2,1,1,2,2) ; S8(0,1) ; } if (m == 1) { S1(0,1,1,1) ; S8(0,1) ; } if (m >= 3) { S5(0,1,1,1,1,1,2,1) ; S1(1,1,2,1) ; S2(1,1,2,1,2,1,3,1) ; S3(1,1,2,2,2,1,2,2) ; S4(1,1,3,2,2,1,3,2) ; S6(0,1,1,2,1,1,1,2) ; S7(0,1,2,2,1,1,2,2) ; S1(1,2,1,2) ; S2(1,2,2,2,1,2,2,2) ; S3(1,2,2,3,1,2,1,3) ; S4(1,2,3,3,1,2,2,3) ; for (coordP1=1;coordP1<=2;coordP1++) { S8(1,coordP1) ; } } for (glT1=2;glT1<=m-2;glT1++) { coordT1 = glT1-1 ; other5 = glT1+1 ; S5(glT1-1,1,glT1,1,glT1,1,glT1+1,1) ; other1 = glT1+1 ; S1(glT1,1,glT1+1,1) ; local1 = glT1+1 ; other1 = glT1+1 ; other3 = glT1+1 ; other5 = glT1+2 ; S2(glT1,1,glT1+1,1,glT1+1,1,glT1+2,1) ; other3 = glT1+1 ; other5 = glT1+1 ; S3(glT1,1,glT1+1,2,glT1+1,1,glT1+1,2) ; other1 = glT1+2 ; other3 = glT1+1 ; other5 = glT1+2 ; S4(glT1,1,glT1+2,2,glT1+1,1,glT1+2,2) ; for (rp1=2;rp1<=glT1;rp1++) { local1 = glT1-rp1+1 ; coordT1 = glT1-1 ; other3 = glT1-rp1+1 ; other5 = glT1-rp1+2 ; S5(glT1-1,rp1,glT1,rp1,glT1-rp1+1,rp1,glT1-rp1+2,rp1) ; local1 = glT1-rp1+2 ; local2 = rp1-1 ; coordT1 = glT1-1 ; coordP1 = rp1-1 ; other3 = glT1-rp1+2 ; other4 = rp1-1 ; other5 = glT1-rp1+2 ; S6(glT1-1,rp1-1,glT1,rp1,glT1-rp1+2,rp1-1,glT1-rp1+2,rp1) ; other1 = glT1+1 ; other3 = glT1-rp1+2 ; other4 = rp1-1 ; other5 = glT1-rp1+3 ; S7(glT1-1,rp1-1,glT1+1,rp1,glT1-rp1+2,rp1-1,glT1-rp1+3,rp1) ; other1 = glT1-rp1+2 ; S1(glT1,rp1,glT1-rp1+2,rp1) ; local1 = glT1-rp1+2 ; other1 = glT1+1 ; other3 = glT1-rp1+2 ; other5 = glT1-rp1+3 ; S2(glT1,rp1,glT1+1,rp1,glT1-rp1+2,rp1,glT1-rp1+3,rp1) ; other2 = rp1+1 ; other3 = glT1-rp1+2 ; other5 = glT1-rp1+2 ; other6 = rp1+1 ; S3(glT1,rp1,glT1+1,rp1+1,glT1-rp1+2,rp1,glT1-rp1+2,rp1+1) ; other1 = glT1+2 ; other2 = rp1+1 ; other3 = glT1-rp1+2 ; other5 = glT1-rp1+3 ; other6 = rp1+1 ; S4(glT1,rp1,glT1+2,rp1+1,glT1-rp1+2,rp1,glT1-rp1+3,rp1+1) ; } rp1 = glT1+1 ; coordT1 = glT1-1 ; other2 = glT1+1 ; other6 = glT1+1 ; S6(glT1-1,glT1,glT1,glT1+1,1,glT1,1,glT1+1) ; other1 = glT1+1 ; other2 = glT1+1 ; other6 = glT1+1 ; S7(glT1-1,glT1,glT1+1,glT1+1,1,glT1,2,glT1+1) ; coordP1 = glT1+1 ; other2 = glT1+1 ; S1(glT1,glT1+1,1,glT1+1) ; local2 = glT1+1 ; coordP1 = glT1+1 ; other1 = glT1+1 ; other2 = glT1+1 ; other4 = glT1+1 ; other6 = glT1+1 ; S2(glT1,glT1+1,glT1+1,glT1+1,1,glT1+1,2,glT1+1) ; other2 = glT1+2 ; other4 = glT1+1 ; other6 = glT1+2 ; S3(glT1,glT1+1,glT1+1,glT1+2,1,glT1+1,1,glT1+2) ; other1 = glT1+2 ; other2 = glT1+2 ; other4 = glT1+1 ; other6 = glT1+2 ; S4(glT1,glT1+1,glT1+2,glT1+2,1,glT1+1,2,glT1+2) ; for (coordP1=1;coordP1<=glT1+1;coordP1++) { S8(glT1,coordP1) ; } } if (m >= 3) { glT1 = m-1 ; local1 = m-1 ; coordT1 = m-2 ; other1 = m-1 ; other3 = m-1 ; S5(m-2,1,m-1,1,m-1,1,m,1) ; coordT1 = m-1 ; S1(m-1,1,m,1) ; coordT1 = m-1 ; S3(m-1,1,m,2,m,1,m,2) ; for (rp1=2;rp1<=m-1;rp1++) { local1 = -rp1+m ; coordT1 = m-2 ; other1 = m-1 ; other3 = -rp1+m ; other5 = -rp1+m+1 ; S5(m-2,rp1,m-1,rp1,-rp1+m,rp1,-rp1+m+1,rp1) ; local1 = -rp1+m+1 ; local2 = rp1-1 ; coordT1 = m-2 ; coordP1 = rp1-1 ; other1 = m-1 ; other3 = -rp1+m+1 ; other4 = rp1-1 ; other5 = -rp1+m+1 ; S6(m-2,rp1-1,m-1,rp1,-rp1+m+1,rp1-1,-rp1+m+1,rp1) ; other3 = -rp1+m+1 ; other4 = rp1-1 ; other5 = -rp1+m+2 ; S7(m-2,rp1-1,m,rp1,-rp1+m+1,rp1-1,-rp1+m+2,rp1) ; coordT1 = m-1 ; other1 = -rp1+m+1 ; S1(m-1,rp1,-rp1+m+1,rp1) ; local1 = -rp1+m+1 ; coordT1 = m-1 ; other3 = -rp1+m+1 ; other5 = -rp1+m+2 ; S2(m-1,rp1,m,rp1,-rp1+m+1,rp1,-rp1+m+2,rp1) ; other2 = rp1+1 ; other3 = -rp1+m+1 ; other5 = -rp1+m+1 ; other6 = rp1+1 ; S3(m-1,rp1,m,rp1+1,-rp1+m+1,rp1,-rp1+m+1,rp1+1) ; other1 = m+1 ; other2 = rp1+1 ; other3 = -rp1+m+1 ; other5 = -rp1+m+2 ; other6 = rp1+1 ; S4(m-1,rp1,m+1,rp1+1,-rp1+m+1,rp1,-rp1+m+2,rp1+1) ; } local2 = m-1 ; coordT1 = m-2 ; coordP1 = m-1 ; other1 = m-1 ; other4 = m-1 ; S6(m-2,m-1,m-1,m,1,m-1,1,m) ; other4 = m-1 ; S7(m-2,m-1,m,m,1,m-1,2,m) ; coordT1 = m-1 ; S1(m-1,m,1,m) ; coordT1 = m-1 ; S2(m-1,m,m,m,1,m,2,m) ; coordT1 = m-1 ; for (coordP1=1;coordP1<=m;coordP1++) { S8(m-1,coordP1) ; } } for (glT1=m;glT1<=2*m-4;glT1++) { rp1 = glT1-m+2 ; local1 = m-1 ; local2 = glT1-m+2 ; coordT1 = glT1-1 ; coordP1 = glT1-m+2 ; other2 = glT1-m+2 ; other3 = m-1 ; other4 = glT1-m+2 ; other6 = glT1-m+2 ; S5(glT1-1,glT1-m+2,glT1,glT1-m+2,m-1,glT1-m+2,m,glT1-m+2) ; local2 = glT1-m+1 ; coordT1 = glT1-1 ; coordP1 = glT1-m+1 ; other2 = glT1-m+2 ; other4 = glT1-m+1 ; other6 = glT1-m+2 ; S6(glT1-1,glT1-m+1,glT1,glT1-m+2,m,glT1-m+1,m,glT1-m+2) ; coordP1 = glT1-m+2 ; other2 = glT1-m+2 ; S1(glT1,glT1-m+2,m,glT1-m+2) ; local2 = glT1-m+2 ; coordP1 = glT1-m+2 ; other1 = glT1+1 ; other2 = glT1-m+3 ; other4 = glT1-m+2 ; other6 = glT1-m+3 ; S3(glT1,glT1-m+2,glT1+1,glT1-m+3,m,glT1-m+2,m,glT1-m+3) ; for (rp1=glT1-m+3;rp1<=m-1;rp1++) { local1 = glT1-rp1+1 ; coordT1 = glT1-1 ; other3 = glT1-rp1+1 ; other5 = glT1-rp1+2 ; S5(glT1-1,rp1,glT1,rp1,glT1-rp1+1,rp1,glT1-rp1+2,rp1) ; local1 = glT1-rp1+2 ; local2 = rp1-1 ; coordT1 = glT1-1 ; coordP1 = rp1-1 ; other3 = glT1-rp1+2 ; other4 = rp1-1 ; other5 = glT1-rp1+2 ; S6(glT1-1,rp1-1,glT1,rp1,glT1-rp1+2,rp1-1,glT1-rp1+2,rp1) ; other1 = glT1+1 ; other3 = glT1-rp1+2 ; other4 = rp1-1 ; other5 = glT1-rp1+3 ; S7(glT1-1,rp1-1,glT1+1,rp1,glT1-rp1+2,rp1-1,glT1-rp1+3,rp1) ; other1 = glT1-rp1+2 ; S1(glT1,rp1,glT1-rp1+2,rp1) ; local1 = glT1-rp1+2 ; other1 = glT1+1 ; other3 = glT1-rp1+2 ; other5 = glT1-rp1+3 ; S2(glT1,rp1,glT1+1,rp1,glT1-rp1+2,rp1,glT1-rp1+3,rp1) ; other2 = rp1+1 ; other3 = glT1-rp1+2 ; other5 = glT1-rp1+2 ; other6 = rp1+1 ; S3(glT1,rp1,glT1+1,rp1+1,glT1-rp1+2,rp1,glT1-rp1+2,rp1+1) ; other1 = glT1+2 ; other2 = rp1+1 ; other3 = glT1-rp1+2 ; other5 = glT1-rp1+3 ; other6 = rp1+1 ; S4(glT1,rp1,glT1+2,rp1+1,glT1-rp1+2,rp1,glT1-rp1+3,rp1+1) ; } local1 = glT1-m+1 ; coordT1 = glT1-1 ; other3 = glT1-m+1 ; other5 = glT1-m+2 ; S5(glT1-1,m,glT1,m,glT1-m+1,m,glT1-m+2,m) ; local1 = glT1-m+2 ; local2 = m-1 ; coordT1 = glT1-1 ; coordP1 = m-1 ; other3 = glT1-m+2 ; other4 = m-1 ; other5 = glT1-m+2 ; S6(glT1-1,m-1,glT1,m,glT1-m+2,m-1,glT1-m+2,m) ; other1 = glT1+1 ; other3 = glT1-m+2 ; other4 = m-1 ; other5 = glT1-m+3 ; S7(glT1-1,m-1,glT1+1,m,glT1-m+2,m-1,glT1-m+3,m) ; other1 = glT1-m+2 ; S1(glT1,m,glT1-m+2,m) ; local1 = glT1-m+2 ; other1 = glT1+1 ; other3 = glT1-m+2 ; other5 = glT1-m+3 ; S2(glT1,m,glT1+1,m,glT1-m+2,m,glT1-m+3,m) ; for (coordP1=glT1-m+2;coordP1<=m;coordP1++) { S8(glT1,coordP1) ; } } if (m >= 3) { glT1 = 2*m-3 ; rp1 = m-1 ; local1 = m-1 ; local2 = m-1 ; coordT1 = 2*m-4 ; coordP1 = m-1 ; other1 = 2*m-3 ; other2 = m-1 ; other3 = m-1 ; other4 = m-1 ; other6 = m-1 ; S5(2*m-4,m-1,2*m-3,m-1,m-1,m-1,m,m-1) ; local2 = m-2 ; coordT1 = 2*m-4 ; coordP1 = m-2 ; other1 = 2*m-3 ; other2 = m-1 ; other4 = m-2 ; other6 = m-1 ; S6(2*m-4,m-2,2*m-3,m-1,m,m-2,m,m-1) ; coordT1 = 2*m-3 ; coordP1 = m-1 ; other2 = m-1 ; S1(2*m-3,m-1,m,m-1) ; local2 = m-1 ; coordT1 = 2*m-3 ; coordP1 = m-1 ; other1 = 2*m-2 ; other4 = m-1 ; S3(2*m-3,m-1,2*m-2,m,m,m-1,m,m) ; local1 = m-2 ; coordT1 = 2*m-4 ; other1 = 2*m-3 ; other3 = m-2 ; other5 = m-1 ; S5(2*m-4,m,2*m-3,m,m-2,m,m-1,m) ; local1 = m-1 ; local2 = m-1 ; coordT1 = 2*m-4 ; coordP1 = m-1 ; other1 = 2*m-3 ; other3 = m-1 ; other4 = m-1 ; other5 = m-1 ; S6(2*m-4,m-1,2*m-3,m,m-1,m-1,m-1,m) ; other1 = 2*m-2 ; other3 = m-1 ; other4 = m-1 ; S7(2*m-4,m-1,2*m-2,m,m-1,m-1,m,m) ; coordT1 = 2*m-3 ; other1 = m-1 ; S1(2*m-3,m,m-1,m) ; local1 = m-1 ; coordT1 = 2*m-3 ; other1 = 2*m-2 ; other3 = m-1 ; S2(2*m-3,m,2*m-2,m,m-1,m,m,m) ; coordT1 = 2*m-3 ; for (coordP1=m-1;coordP1<=m;coordP1++) { S8(2*m-3,coordP1) ; } } if (m == 2) { S5(0,1,1,1,1,1,2,1) ; S1(1,1,2,1) ; S3(1,1,2,2,2,1,2,2) ; S6(0,1,1,2,1,1,1,2) ; S7(0,1,2,2,1,1,2,2) ; S1(1,2,1,2) ; S2(1,2,2,2,1,2,2,2) ; for (coordP1=1;coordP1<=2;coordP1++) { S8(1,coordP1) ; } } if (m >= 2) { glT1 = 2*m-2 ; local1 = m-1 ; coordT1 = 2*m-3 ; other1 = 2*m-2 ; other3 = m-1 ; S5(2*m-3,m,2*m-2,m,m-1,m,m,m) ; local2 = m-1 ; coordT1 = 2*m-3 ; coordP1 = m-1 ; other1 = 2*m-2 ; other4 = m-1 ; S6(2*m-3,m-1,2*m-2,m,m,m-1,m,m) ; coordT1 = 2*m-2 ; S1(2*m-2,m,m,m) ; coordT1 = 2*m-2 ; S8(2*m-2,m) ; } } cloog-0.18.2/test/gauss.cloog0000664000175000017500000000170712254312305012760 00000000000000# language: C c # parameter n 1 3 # n 1 1 0 1 0 2 # Number of statements 1 # {i, j, k | 1<=i<=n; 1<=j<=i-1 i+1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 1 -1 0 0 -1 1 -1 0 1 0 -1 1 0 0 -1 1 0 0 0 0 1 # {i, j, k | 1<=i<=n; i+1<=j<=n i+1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 -1 0 1 0 -1 1 0 0 -1 1 0 0 0 0 0 2 # Scattering functions # Et les instructions de chunking... 2 8 # c1 c2 i j k n 1 0 1 0 -1 0 0 0 0 0 0 1 0 0 -1 0 0 2 8 # c1 c2 i j k n 1 0 1 0 -1 0 0 0 0 0 0 1 0 0 -1 0 0 0 2 # Et les instructions de chunking... 1 7 # c1 i j k n 1 0 1 0 0 0 -1 2 1 7 # c1 i j k n 1 0 1 -1 0 0 0 1 0 2 # Et les instructions de chunking... 2 8 # c1 c2 i j k n 1 0 1 0 -1 0 0 0 0 0 0 1 0 0 -1 0 0 2 8 # c1 c2 i j k n 1 0 1 0 -1 0 0 0 0 0 0 1 0 0 -1 0 0 0 cloog-0.18.2/test/basic-bounds-6.cloog0000664000175000017500000000021312254312305014341 00000000000000# language: C c # Context 1 2 1 1 0 1 # Number of statements 1 3 3 # i 1 1 2 3 1 -2 -1 1 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/rectangle.c0000664000175000017500000000030712254312305012714 00000000000000/* Generated from ../../../git/cloog/test/rectangle.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (c1=0;c1<=2*n;c1++) { for (i=max(0,c1-n);i<=min(c1,n);i++) { S1(i,c1-i) ; } } cloog-0.18.2/test/gesced2.good.c0000664000175000017500000000271412254312305013217 00000000000000/* Generated from ../../../git/cloog/test/gesced2.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.04s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M) { /* Scattering iterators. */ int c1, c2; /* Original iterators. */ int i, j; for (c1=1;c1<=4;c1++) { for (c2=5;c2<=M-10;c2++) { S1(c1,c2) ; } } for (c1=5;c1<=min(M-10,9);c1++) { for (c2=-c1+1;c2<=4;c2++) { i = c1+c2 ; S2(c1+c2,c1) ; } for (c2=5;c2<=M-10;c2++) { S1(c1,c2) ; i = c1+c2 ; S2(c1+c2,c1) ; } for (c2=M-9;c2<=-c1+M;c2++) { i = c1+c2 ; S2(c1+c2,c1) ; } } if (M >= 20) { for (c2=-9;c2<=4;c2++) { i = c2+10 ; S2(c2+10,10) ; } for (c2=5;c2<=M-10;c2++) { S1(10,c2) ; i = c2+10 ; S2(c2+10,10) ; } } for (c1=11;c1<=M-10;c1++) { for (c2=-c1+1;c2<=4;c2++) { i = c1+c2 ; S2(c1+c2,c1) ; } for (c2=5;c2<=-c1+M;c2++) { S1(c1,c2) ; i = c1+c2 ; S2(c1+c2,c1) ; } for (c2=-c1+M+1;c2<=M-10;c2++) { S1(c1,c2) ; } } for (c1=M-9;c1<=M;c1++) { for (c2=5;c2<=M-10;c2++) { S1(c1,c2) ; } } } cloog-0.18.2/test/test.good.c0000664000175000017500000000162012254312305012655 00000000000000/* Generated from ../../../git/cloog/test/test.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.02s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; for (i=1;i<=2;i++) { for (j=1;j<=M;j++) { S1(i,j) ; } } for (i=3;i<=M-1;i++) { for (j=1;j<=i-1;j++) { S1(i,j) ; } S1(i,i) ; S2(i,i) ; for (j=i+1;j<=M;j++) { S1(i,j) ; } } for (j=1;j<=M-1;j++) { S1(M,j) ; } S1(M,M) ; S2(M,M) ; for (i=M+1;i<=N;i++) { for (j=1;j<=M;j++) { S1(i,j) ; } S2(i,i) ; } } cloog-0.18.2/test/dot2.cloog0000664000175000017500000000045612254312305012506 00000000000000# language: C c # parameters {M, N | M>=1 N >=1} 2 4 1 1 0 -1 1 0 1 -1 0 2 # Number of statements 1 # {i | 1<=i<=M} 2 5 1 1 0 0 -1 1 -1 1 0 0 0 0 0 1 # {i, j | 1<=i<=N 1<=j<=M} 4 6 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 1 0 0 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/vivien2.cloog0000664000175000017500000000573312254312305013223 00000000000000# Context c # output in language C # no constraints on parameters 1 3 # 1 line and 3 columns # n 1 1 1 -30 # 0 >= 0 always true 1 # Setting manually the parameter' sname n # The name # -------------------- Statements ------------------ 6 # Number of statements 1 # First statement: 1 domain # First domain 2 4 # 2 lines and 4 columns # i n 1 1 1 27 -1 # i >= 1 1 -1 1 28 # n >= i 0 0 0 1 # Second statement: 1 domain # First domain 4 5 # 4 lines and 5 columns # i k n 1 1 1 29 0 -1 # i >= 1 1 -1 0 1 0 # n >= i 1 0 1 0 -1 # k >= 1 1 1 -1 0 -1 # k <= i-1 0 0 0 1 # Third statement: 1 domain # First domain 2 4 # 2 lines and 4 columns # i n 1 1 1 0 -1 # i >= 1 1 -1 1 0 # n >= i 0 0 0 1 # Fourth statement: 1 domain # First domain 4 5 # 4 lines and 5 columns # i j n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # n >= i 1 -1 1 0 -1 # j >= i+1 1 0 -1 1 0 # j <= n 0 0 0 1 # Fifth statement: 1 domain # First domain 6 6 # 6 lines and 6 columns # i j k n 1 1 1 0 0 0 -1 # i >= 1 1 -1 0 0 1 0 # n >= i 1 -1 1 0 0 -1 # j >= i+1 1 0 -1 0 1 0 # j <= n 1 0 0 1 0 -1 # k >= 1 1 1 0 -1 0 -1 # k <= i-1 0 0 0 1 # Sixth statement: 1 domain # First domain 4 5 # 4 lines and 5 columns # i j n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # n >= i 1 -1 1 0 -1 # j >= i+1 1 0 -1 1 0 # j <= n 0 0 0 1 # We manually set the iterator names i j k # ------------------------ Scattering ------------------- 6 # Number of scattering functions # First function 3 7 # 3 lines and 7 columns # p1 p2 p3 i n 1 0 1 0 0 -2 0 -2 # p1 = 2i+2 0 0 1 0 0 0 0 # p2 = 0 0 0 0 1 0 0 0 # p3 = 0 # Second function 3 8 # 3 lines and 8 columns # p1 p2 p3 i j n 1 0 1 0 0 -2 -2 0 -1 # p1 = 2i+2j+1 0 0 1 0 0 -1 0 0 # p2 = j 0 0 0 1 0 0 0 0 # p3 = 0 # Third function 3 7 # 3 lines and 7 columns # p1 p2 p3 i n 1 0 1 0 0 -4 0 -1 # p1 = 4i+1 0 0 1 0 0 0 0 # p2 = 0 0 0 0 1 0 0 0 # p3 = 0 # Fourth function 3 8 # 3 lines and 8 columns # p1 p2 p3 i j n 1 0 1 0 0 -2 -2 0 0 # p1 = 2i+2j 0 0 1 0 1 0 0 0 # p2 = -i 0 0 0 1 0 0 0 0 # p3 = 0 # Fifth function 3 9 # 3 lines and 9 columns # p1 p2 p3 i j k n 1 0 1 0 0 -2 -2 0 0 0 # p1 = 2i+2j 0 0 1 0 1 0 0 0 -1 # p2 = -i+1 0 0 0 1 0 0 -1 0 0 # p3 = k # Sixth function 3 8 # 3 lines and 8 columns # p1 p2 p3 i j n 1 0 1 0 0 -2 -2 0 0 # p1 = 2i+2j 0 0 1 0 1 0 0 -2 # p2 = -i+2 0 0 0 1 0 0 0 0 # p3 = 0 1 # Manually set the scattering dimensions p1 p2 p3 cloog-0.18.2/test/lineality-1-2.c0000664000175000017500000000036512254312305013243 00000000000000/* Generated from /home/skimo/git/cloog/test/lineality-1-2.cloog by CLooG 0.14.0-284-g5c046c9 gmp bits in 0.00s. */ for (i=1;i<=M;i++) { for (j=1;j<=i-1;j++) { S1(i,j); } S1(i,i); S2(i,i); for (j=i+1;j<=M;j++) { S1(i,j); } } cloog-0.18.2/test/equality.good.c0000664000175000017500000000132112254312305013531 00000000000000/* Generated from ../../../git/cloog/test/equality.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i0,i1) { hash(1); hash(i0); hash(i1); } #define S2(i0,i1) { hash(2); hash(i0); hash(i1); } void test() { /* Original iterators. */ int i0, i1; for (i0=0;i0<=5;i0++) { for (i1=ceild(4*i0,5);i1<=floord(6*i0+20,5);i1++) { if (2*i0 == i1) { S1(i0,i1) ; } if (i1 == 4) { S2(i0,i1) ; } } } } cloog-0.18.2/test/nul_basic2.c0000664000175000017500000000027212254312305012772 00000000000000/* Generated from ../../../git/cloog/test/nul_basic2.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (i=2;i<=n;i+=2) { if (i%4 == 0) { S2(i,i/4) ; } S1(i,i/2) ; } cloog-0.18.2/test/lu.cloog0000664000175000017500000000110212254312305012243 00000000000000# language: C c # parameter n 1 3 # n 1 1 0 1 1 n 2 # Number of statements 1 # {i, j | 1<=i<=n; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 1 # {i, j, k | 1<=i<=n; i+1<=j<=n i+1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 -1 0 1 0 -1 1 0 0 -1 1 0 0 0 0 0 2 # Scattering functions # Et les instructions de chunking... 2 7 # c1 c2 i j n 1 0 1 0 -1 0 0 0 0 0 1 0 0 -1 0 2 8 # c1 c2 i j k n 1 0 1 0 0 0 -1 0 0 0 0 1 0 -1 0 0 0 0 cloog-0.18.2/test/pouchet.cloog0000664000175000017500000000441312254312305013302 00000000000000# CLooG -> CLooG # This is an automatic dump of a CLooG input file from a CloogInput data # structure. # Language: C c # Context: 1 0 3 0 0 0 1 1 # Parameter name(s) Ny # Statement number: 2 # Iteration domain of statement 2 ((null)). 1 8 8 5 0 0 1 1 0 0 1 0 0 0 0 1 0 0 -1 0 0 0 2 1 0 0 0 1 0 0 -1 1 0 0 0 -1 0 1 -1 1 0 0 0 0 1 0 -1 1 0 0 0 0 -1 0 2 0 -2 0 1 0 0 0 0 0 0 -2 1 1 0 0 0 0 0 0 # For future options. # Iteration domain of statement 4 ((null)). 1 8 8 5 0 0 1 1 0 0 1 0 0 0 0 1 0 0 -1 0 0 0 2 1 0 0 0 1 0 0 -1 1 0 0 0 -1 0 1 -1 1 0 0 0 0 1 0 -1 1 0 0 0 0 -1 0 2 0 -2 0 1 0 0 0 0 0 0 -2 1 1 0 0 1 0 0 0 # For future options. 0 # Iterator name(s) # --------------------- SCATTERING -------------------- 2 # Scattering functions # Scattering of statement 2 ((null)). 1 6 14 6 5 0 1 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -1 -1 0 0 0 0 0 # Scattering of statement 4 ((null)). 1 6 14 6 5 0 1 0 0 0 0 0 0 1 0 0 0 0 -1 0 -1 0 0 0 0 0 1 0 0 0 0 -1 0 0 -1 0 0 0 0 1 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 -1 -1 0 0 0 0 0 1 # Scattering dimension name(s) c0 c1 c2 c3 c4 c5 cloog-0.18.2/test/0D-1.c0000664000175000017500000000015712254312305011354 00000000000000/* Generated from ../../../git/cloog/test/0D-1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ S1() ; cloog-0.18.2/test/mode.good.c0000664000175000017500000000203712254312305012625 00000000000000/* Generated from ../../../git/cloog/test/mode.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.00s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j) { hash(1); hash(i); hash(j); } #define S2(i,j) { hash(2); hash(i); hash(j); } void test(int M, int N) { /* Original iterators. */ int i, j; for (i=0;i<=min(M,N-1);i++) { for (j=0;j<=i;j++) { S1(i,j) ; S2(i,j) ; } for (j=i+1;j<=N;j++) { S2(i,j) ; } } if ((M >= N) && (N >= 0)) { for (j=0;j<=N;j++) { S1(N,j) ; S2(N,j) ; } } if (N >= 0) { for (i=N+1;i<=M;i++) { for (j=0;j<=N;j++) { S1(i,j) ; S2(i,j) ; } for (j=N+1;j<=i;j++) { S1(i,j) ; } } } if (N <= -1) { for (i=0;i<=M;i++) { for (j=0;j<=i;j++) { S1(i,j) ; } } } } cloog-0.18.2/test/dartef.cloog0000664000175000017500000000127612254312305013104 00000000000000# language: FORTRAN f # parameters n m 1 3 # n 1 1 0 0 1 n 2 # Number of statements 1 # S1 {i, j, k | 1<=i<=n; 1<=j<=n, 1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 0 0 -1 1 0 0 0 0 1 # S2 {i, j, k | 1<=i<=n; 1<=j<=n, 1<=k<=n} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 0 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 0 0 -1 1 0 0 0 0 0 2 # Scattering functions 3 9 # c1 c2 c3 i j k n 1 0 1 0 0 -1 1 0 0 0 0 0 1 0 -1 -1 0 0 0 0 0 0 1 -1 -1 -2 0 0 3 9 # c1 c2 c3 i j k n 1 0 1 0 0 -1 1 0 0 -1 0 0 1 0 -1 -1 0 0 -2 0 0 0 1 0 0 -1 0 0 1 t1 t2 t3 cloog-0.18.2/test/basic-bounds-3.c0000664000175000017500000000022312254312305013456 00000000000000/* Generated from ../../../git/cloog/test/basic-bounds-3.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (i=0;i<=M;i++) { S1(i) ; } cloog-0.18.2/test/walters3.c0000664000175000017500000000031312254312305012511 00000000000000/* Generated from ../../../git/cloog/test/walters3.cloog by CLooG 0.14.0-338-g99c7504 gmp bits in 0.00s. */ for (j=2;j<=8;j++) { if (j%2 == 0) { S1(j,j/2,j/2); S2(j,j/2,j/2); } } S2(10,5,5); cloog-0.18.2/test/iftestf.cloog0000664000175000017500000000100112254312305013265 00000000000000# language: FORTRAN f # The context (no constraints on parameters) 1 4 # 1 lines and 4 columns # m n 1 1 0 0 0 1 m n 1 # The number of statements 2 # First statement # The first domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 1 -1 0 0 # i >= m # The second domain 3 5 # 3 lines and 5 columns # i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 -1 2 0 0 # i <= 2*m 0 0 0 0 0 cloog-0.18.2/test/4-param.cloog0000664000175000017500000000052712254312305013076 00000000000000# language: C c # Context # parameters m n p q 1 6 # m n p q 1 1 0 0 0 0 1 1 m n p q 2 # Number of statements 1 # S1 i,... 3 7 # i m n p q 1 1 1 -1 0 0 0 0 1 -1 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 # 3 7 # i m n p q 1 1 1 0 0 -1 0 0 1 -1 0 0 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/min-3-1.c0000664000175000017500000000027312254312305012033 00000000000000/* Generated from ../../../git/cloog/test/min-3-1.cloog by CLooG 0.14.0-136-gb91ef26 gmp bits in 0.00s. */ for (i=0;i<=min(10,M);i++) { for (j=0;j<=min(10,M);j++) { S1(i,j) ; } } cloog-0.18.2/test/infinite4.cloog0000664000175000017500000000016012254312305013517 00000000000000# langage c # Context 0 2 0 1 # Number of statements 1 # {i | 1<=i<=M} 0 3 0 0 0 0 0 # Scattering functions cloog-0.18.2/test/cholesky2.cloog0000664000175000017500000000256312254312305013542 00000000000000# language: C c # parameter n 1 3 # n 1 1 0 1 0 6 # Number of statements 1 # S1 {i | 1<=i<=n} 2 4 # i n 1 1 1 0 -1 1 -1 1 0 0 0 0 1 # S2 {i, j | 1<=i<=n; 1<=j<=i-1} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 1 -1 0 -1 0 0 0 1 # S3 {i | 1<=i<=n} 2 4 # i n 1 1 1 0 -1 1 -1 1 0 0 0 0 1 # S4 {i, j | 1<=i<=n; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 1 # S5 {i, j, k | 1<=i<=n; i+1<=j<=n 1<=k<=i-1} 6 6 # i j k n 1 1 1 0 0 0 -1 1 -1 0 0 1 0 1 -1 1 0 0 -1 1 0 -1 0 1 0 1 0 0 1 0 -1 1 1 0 -1 0 -1 0 0 0 1 # S6 {i, j | 1<=i<=n; i+1<=j<=n} 4 5 # i j n 1 1 1 0 0 -1 1 -1 0 1 0 1 -1 1 0 -1 1 0 -1 1 0 0 0 0 0 6 # Scattering functions # Et les instructions de chunking (parallele)... 3 7 # c1 c2 c3 i n 1 0 1 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 1 0 0 0 3 8 # c1 c2 c3 i j n 1 0 1 0 0 0 -3 0 0 0 0 1 0 -1 0 0 0 0 0 0 1 0 0 0 0 3 7 # c1 c2 c3 i n 1 0 1 0 0 -3 0 2 0 0 1 0 0 0 0 0 0 0 1 0 0 0 3 8 # c1 c2 c3 i j n 1 0 1 0 0 0 0 0 0 0 0 1 0 -1 0 0 0 0 0 0 1 0 -1 0 0 3 9 # c1 c2 c3 i j k n 1 0 1 0 0 0 0 -3 0 1 0 0 1 0 0 -1 0 0 0 0 0 0 1 0 0 -1 0 0 3 8 # c1 c2 c3 i j n 1 0 1 0 0 -3 0 0 1 0 0 1 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 cloog-0.18.2/test/forwardsub-2-1-2-3.good.c0000664000175000017500000000145512254312305014656 00000000000000/* Generated from ../../../git/cloog/test/forwardsub-2-1-2-3.cloog by CLooG 0.14.0-72-gefe2fc2 gmp bits in 0.01s. */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d)) #define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); } #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); } #define S3(i,j) { hash(3); hash(i); hash(j); } #define S4(i,j) { hash(4); hash(i); hash(j); } void test(int M) { /* Original iterators. */ int i, j, k; S3(1,0) ; for (k=2;k<=M;k++) { S1(1,1,k) ; } for (i=2;i<=M-1;i++) { S4(i,0) ; for (k=i+1;k<=M;k++) { S2(i,1,k) ; } } S4(M,0) ; } cloog-0.18.2/source/0000775000175000017500000000000012254314446011215 500000000000000cloog-0.18.2/source/union_domain.c0000664000175000017500000002211712254312305013753 00000000000000#include #include #include #include "../include/cloog/cloog.h" #ifdef OSL_SUPPORT #include #include #include #include #endif #define ALLOC(type) (type*)malloc(sizeof(type)) #define ALLOCN(type,n) (type*)malloc((n)*sizeof(type)) void cloog_named_domain_list_free(CloogNamedDomainList *list) { while (list != NULL) { CloogNamedDomainList *temp = list->next; cloog_domain_free(list->domain); cloog_scattering_free(list->scattering); free(list->name); free(list); list = temp; } } CloogUnionDomain *cloog_union_domain_alloc(int nb_par) { CloogUnionDomain *ud; ud = ALLOC(CloogUnionDomain); if (!ud) cloog_die("memory overflow.\n"); ud->domain = NULL; ud->next_domain = &ud->domain; ud->n_name[CLOOG_PARAM] = nb_par; ud->n_name[CLOOG_ITER] = 0; ud->n_name[CLOOG_SCAT] = 0; ud->name[CLOOG_PARAM] = NULL; ud->name[CLOOG_ITER] = NULL; ud->name[CLOOG_SCAT] = NULL; return ud; } void cloog_union_domain_free(CloogUnionDomain *ud) { int i; int j; if (!ud) return; for (i = 0; i < 3; ++i) { if (!ud->name[i]) continue; for (j = 0; j < ud->n_name[i]; ++j) free(ud->name[i][j]); free(ud->name[i]); } cloog_named_domain_list_free(ud->domain); free(ud); } /** * Add a domain with scattering function to the union of domains. * name may be NULL and is duplicated if it is not. * domain and scattering are taken over by the CloogUnionDomain. * scattering may be NULL. */ CloogUnionDomain *cloog_union_domain_add_domain(CloogUnionDomain *ud, const char *name, CloogDomain *domain, CloogScattering *scattering, void *usr) { CloogNamedDomainList *named; int n; if (!ud) return NULL; named = ALLOC(CloogNamedDomainList); if (!named) cloog_die("memory overflow.\n"); if (ud->name[CLOOG_ITER]) cloog_die("iterator names must be set after adding domains.\n"); if (ud->name[CLOOG_SCAT]) cloog_die("scattering names must be set after adding domains.\n"); n = cloog_domain_dimension(domain); if (n > ud->n_name[CLOOG_ITER]) ud->n_name[CLOOG_ITER] = n; if (scattering) { n = cloog_scattering_dimension(scattering, domain); if (n > ud->n_name[CLOOG_SCAT]) ud->n_name[CLOOG_SCAT] = n; } named->domain = domain; named->scattering = scattering; named->name = name ? strdup(name) : NULL; named->usr = usr; named->next = NULL; *ud->next_domain = named; ud->next_domain = &named->next; return ud; } /** * Set the name of parameter, iterator or scattering dimension * at the specified position. The name is duplicated. */ CloogUnionDomain *cloog_union_domain_set_name(CloogUnionDomain *ud, enum cloog_dim_type type, int index, const char *name) { int i; if (!ud) return ud; if (type != CLOOG_PARAM && type != CLOOG_ITER && type != CLOOG_SCAT) cloog_die("invalid dim type\n"); if (index < 0 || index >= ud->n_name[type]) cloog_die("index out of range\n"); if (!ud->name[type]) { ud->name[type] = ALLOCN(char *, ud->n_name[type]); if (!ud->name[type]) cloog_die("memory overflow.\n"); for (i = 0; i < ud->n_name[type]; ++i) ud->name[type][i] = NULL; } free(ud->name[type][index]); ud->name[type][index] = strdup(name); if (!ud->name[type][index]) cloog_die("memory overflow.\n"); return ud; } static char *next_line(FILE *input, char *line, unsigned len) { char *p; do { if (!(p = fgets(line, len, input))) return NULL; while (isspace(*p) && *p != '\n') ++p; } while (*p == '#' || *p == '\n'); return p; } /** * cloog_scattering_list_read * Read in a list of scattering functions for the nb_statements * domains in loop. */ static CloogScatteringList *cloog_scattering_list_read(FILE * foo, CloogDomain **domain, int nb_statements, int nb_parameters) { int nb_scat = 0; char s[MAX_STRING]; CloogScatteringList *list = NULL, **next = &list; /* We read first the number of scattering functions in the list. */ do { if (!fgets(s, MAX_STRING, foo)) break; } while ((*s=='#' || *s=='\n') || (sscanf(s, " %d", &nb_scat) < 1)); if (nb_scat == 0) return NULL; if (nb_scat != nb_statements) cloog_die("wrong number of scattering functions.\n"); while (nb_scat--) { *next = (CloogScatteringList *)malloc(sizeof(CloogScatteringList)); (*next)->scatt = cloog_domain_read_scattering(*domain, foo); (*next)->next = NULL; next = &(*next)->next; domain++; } return list; } static CloogUnionDomain *set_names_from_list(CloogUnionDomain *ud, enum cloog_dim_type type, int n, char **names) { int i; if (!names) return ud; for (i = 0; i < n; ++i) { ud = cloog_union_domain_set_name(ud, type, i, names[i]); free(names[i]); } free(names); return ud; } /** * Fill up a CloogUnionDomain from information in a CLooG input file. * The language and the context are assumed to have been read from * the input file already. */ CloogUnionDomain *cloog_union_domain_read(FILE *file, int nb_par, CloogOptions *options) { int op1, op2, op3; char line[MAX_STRING]; CloogDomain **domain; CloogUnionDomain *ud; CloogScatteringList *scatteringl; int i; int n_iter = -1; int n_dom; char **names; ud = cloog_union_domain_alloc(nb_par); names = cloog_names_read_strings(file, nb_par); ud = set_names_from_list(ud, CLOOG_PARAM, nb_par, names); /* We read the number of statements. */ if (!next_line(file, line, sizeof(line))) cloog_die("Input error.\n"); if (sscanf(line, "%d", &n_dom) != 1) cloog_die("Input error.\n"); domain = ALLOCN(CloogDomain *, n_dom); if (!domain) cloog_die("memory overflow.\n"); for (i = 0; i < n_dom; ++i) { int dim; domain[i] = cloog_domain_union_read(options->state, file, nb_par); dim = cloog_domain_dimension(domain[i]); if (dim > n_iter) n_iter = dim; /* To read that stupid "0 0 0" line. */ if (!next_line(file, line, sizeof(line))) cloog_die("Input error.\n"); if (sscanf(line, " %d %d %d", &op1, &op2, &op3) != 3) cloog_die("Input error.\n"); } /* Reading of the iterator names. */ names = cloog_names_read_strings(file, n_iter); /* Reading and putting the scattering data in program structure. */ scatteringl = cloog_scattering_list_read(file, domain, n_dom, nb_par); if (scatteringl) { CloogScatteringList *is, *next; if (cloog_scattering_list_lazy_same(scatteringl)) cloog_msg(options, CLOOG_WARNING, "some scattering functions are similar.\n"); for (i = 0, is = scatteringl; i < n_dom; ++i, is = next) { next = is->next; ud = cloog_union_domain_add_domain(ud, NULL, domain[i], is->scatt, NULL); free(is); } } else { for (i = 0; i < n_dom; ++i) ud = cloog_union_domain_add_domain(ud, NULL, domain[i], NULL, NULL); } ud = set_names_from_list(ud, CLOOG_ITER, n_iter, names); if (scatteringl) { int n_scat = ud->n_name[CLOOG_SCAT]; names = cloog_names_read_strings(file, n_scat); ud = set_names_from_list(ud, CLOOG_SCAT, n_scat, names); } free(domain); return ud; } #ifdef OSL_SUPPORT /** * Extracts a CloogUnionDomain from an openscop scop (the CloogUnionDomain * corresponds more or less to the openscop statement). * \param[in,out] state CLooG state. * \param[in] scop OpenScop scop to convert. * \return A new CloogUnionDomain corresponding the input OpenScop scop. */ CloogUnionDomain *cloog_union_domain_from_osl_scop(CloogState *state, osl_scop_p scop) { int i, nb_parameters; CloogDomain *domain = NULL; CloogScattering *scattering = NULL; CloogUnionDomain *ud = NULL; osl_scop_p normalized; osl_statement_p statement; osl_scatnames_p scatnames; /* Set the union of domains. */ nb_parameters = (scop->context == NULL) ? 0 : scop->context->nb_parameters; ud = cloog_union_domain_alloc(nb_parameters); /* - Set the parameter names. */ if (osl_generic_has_URI(scop->parameters, OSL_URI_STRINGS)) { for (i = 0; i < osl_strings_size(scop->parameters->data); i++) { ud = cloog_union_domain_set_name(ud, CLOOG_PARAM, i, ((osl_strings_p)(scop->parameters->data))->string[i]); } } /* - Set each statement (domain/scattering). * Since CLooG requires all number of scattering dimensions to be * equal, we normalize them first. */ normalized = osl_scop_clone(scop); osl_scop_normalize_scattering(normalized); statement = normalized->statement; while(statement != NULL) { domain = cloog_domain_from_osl_relation(state, statement->domain); scattering = cloog_scattering_from_osl_relation(state, statement->scattering); ud = cloog_union_domain_add_domain(ud, NULL, domain, scattering, NULL); statement = statement->next; } osl_scop_free(normalized); /* - Set the scattering dimension names. */ scatnames = osl_generic_lookup(scop->extension, OSL_URI_SCATNAMES); if ((scatnames != NULL) && (scatnames->names != NULL)) { for (i = 0; (i < osl_strings_size(scatnames->names)) && (i < ud->n_name[CLOOG_SCAT]); i++) { ud = cloog_union_domain_set_name(ud, CLOOG_SCAT, i, scatnames->names->string[i]); } } return ud; } #endif cloog-0.18.2/source/statement.c0000664000175000017500000002373312254312305013305 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** statement.c ** **-------------------------------------------------------------------** ** First version: november 4th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /* CAUTION: the english used for comments is probably the worst you ever read, * please feel free to correct and improve it ! */ # include # include # include # include "../include/cloog/cloog.h" /****************************************************************************** * Memory leaks hunting * ******************************************************************************/ /** * These functions and global variables are devoted to memory leaks hunting: we * want to know at each moment how many CloogStatement structures had been * allocated (cloog_statement_allocated) and how many had been freed * (cloog_statement_freed). Each time a CloogStatement structure is allocated, * a call to the function cloog_statement_leak_up() must be carried out, and * respectively cloog_statement_leak_down() when a CloogStatement structure is * freed. The special variable cloog_statement_max gives the maximal number of * CloogStatement structures simultaneously alive (i.e. allocated and * non-freed) in memory. * - July 3rd->11th 2003: first version (memory leaks hunt and correction). */ static void cloog_statement_leak_up(CloogState *state) { state->statement_allocated++; if ((state->statement_allocated - state->statement_freed) > state->statement_max) state->statement_max = state->statement_allocated - state->statement_freed ; } static void cloog_statement_leak_down(CloogState *state) { state->statement_freed++; } /****************************************************************************** * Structure display function * ******************************************************************************/ /** * cloog_domain_print_structure : * this function is a human-friendly way to display the CloogDomain data * structure, it includes an indentation level (level) in order to work with * others print_structure functions. * - June 16th 2005: first version. */ void cloog_statement_print_structure(file, statement, level) FILE * file ; CloogStatement * statement ; int level ; { int i ; if (statement != NULL) { /* Go to the right level. */ for (i=0; inumber) ; statement = statement->next ; while (statement != NULL) { for (i=0; inumber) ; statement = statement->next ; } } else { for (i=0; istate); next = statement->next ; /* free(statement->usr) ; Actually, this is user's job ! */ free(statement->name); free(statement) ; statement = next ; } } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * cloog_statement_malloc function: * This function allocates the memory space for a CloogStatement structure and * sets its fields with default values. Then it returns a pointer to the * allocated space. * - November 21th 2005: first version. */ CloogStatement *cloog_statement_malloc(CloogState *state) { CloogStatement * statement ; /* Memory allocation for the CloogStatement structure. */ statement = (CloogStatement *)malloc(sizeof(CloogStatement)) ; if (statement == NULL) cloog_die("memory overflow.\n"); cloog_statement_leak_up(state); /* We set the various fields with default values. */ statement->state = state; statement->number = 0; statement->name = NULL; statement->usr = NULL ; /* To fill it is actually user's job ! */ statement->next = NULL ; return statement ; } /** * cloog_statement_alloc function: * This function allocates the memory space for a CloogStatement structure and * sets its fields with those given as input. Then it returns a pointer to the * allocated space. * - number is the statement number. ** * - September 9th 2002: first version. * - March 17th 2003: fix for the usr field in CloogStatement structure. * - April 16th 2005: adaptation to new CloogStatement structure (with * number), cloog_statement_read becomes * cloog_statement_alloc sincethere is nothing more to * read on a file. * - November 21th 2005: use of cloog_statement_malloc. */ CloogStatement *cloog_statement_alloc(CloogState *state, int number) { CloogStatement * statement ; /* Memory allocation and initialization of the structure. */ statement = cloog_statement_malloc(state); statement->number = number ; return statement ; } /** * cloog_statement_copy function: * This function returns a copy of the CloogStatement structure given as input. * - October 28th 2001: first version (in loop.c). * - March 17th 2003: fix for the usr field in CloogStatement structure. * - April 16th 2005: adaptation to new CloogStatement struct (with number). */ CloogStatement * cloog_statement_copy(CloogStatement * source) { CloogStatement * statement, * temp, * now = NULL ; statement = NULL ; while (source != NULL) { cloog_statement_leak_up(source->state); temp = (CloogStatement *)malloc(sizeof(CloogStatement)) ; if (temp == NULL) cloog_die("memory overflow.\n"); temp->state = source->state; temp->number = source->number ; temp->name = source->name ? strdup(source->name) : NULL; temp->usr = source->usr ; temp->next = NULL ; if (statement == NULL) { statement = temp ; now = statement ; } else { now->next = temp ; now = now->next ; } source = source->next ; } return(statement) ; } /** * cloog_statement_add function: * This function adds a CloogStatement structure (statement) at a given place * (now) of a NULL terminated list of CloogStatement structures. The beginning * of this list is (start). This function updates (now) to (loop), and * updates (start) if the added element is the first one -that is when (start) * is NULL-. * - March 27th 2004: first version. */ void cloog_statement_add(start, now, statement) CloogStatement ** start, ** now, * statement ; { if (*start == NULL) { *start = statement ; *now = *start ; } else { (*now)->next = statement ; *now = (*now)->next ; } } cloog-0.18.2/source/matrix/0000775000175000017500000000000012254314446012521 500000000000000cloog-0.18.2/source/matrix/constraintset.c0000664000175000017500000011047412254312305015504 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** constraintset.c ** **-------------------------------------------------------------------** ** First version: april 17th 2005 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /* CAUTION: the english used for comments is probably the worst you ever read, * please feel free to correct and improve it ! */ # include # include # include #include #include #define ALLOC(type) (type*)malloc(sizeof(type)) #define ALLOCN(type,n) (type*)malloc((n)*sizeof(type)) CloogConstraint *cloog_constraint_first(CloogConstraintSet *constraints); CloogConstraint *cloog_constraint_next(CloogConstraint *constraint); CloogConstraintSet *cloog_constraint_set_from_cloog_matrix(CloogMatrix *M) { return (CloogConstraintSet *)M; } void cloog_constraint_set_free(CloogConstraintSet *constraints) { cloog_matrix_free(&constraints->M); } int cloog_constraint_set_contains_level(CloogConstraintSet *constraints, int level, int nb_parameters) { return constraints->M.NbColumns - 2 - nb_parameters >= level; } /* Check if the variable at position level is defined by an * equality. If so, return the row number. Otherwise, return -1. * * If there is an equality, we can print it directly -no ambiguity-. * PolyLib can give more than one equality, we use just the first one * (this is a PolyLib problem, but all equalities are equivalent). */ CloogConstraint *cloog_constraint_set_defining_equality(CloogConstraintSet *constraints, int level) { CloogConstraint *constraint = ALLOC(CloogConstraint); int i; constraint->set = constraints; for (i = 0; i < constraints->M.NbRows; i++) if (cloog_int_is_zero(constraints->M.p[i][0]) && !cloog_int_is_zero(constraints->M.p[i][level])) { constraint->line = &constraints->M.p[i]; return constraint; } free(constraint); return cloog_constraint_invalid(); } /* Check if the variable (e) at position level is defined by a * pair of inequalities * + -m e + + k1 >= 0 * <-a, i> + m e + <-b, p> + k2 >= 0 * with 0 <= k1 + k2 < m * If so return the row number of the upper bound and set *lower * to the row number of the lower bound. If not, return -1. * * If the variable at position level occurs in any other constraint, * then we currently return -1. The modulo guard that we would generate * would still be correct, but we would also need to generate * guards corresponding to the other constraints, and this has not * been implemented yet. */ CloogConstraint *cloog_constraint_set_defining_inequalities(CloogConstraintSet *constraints, int level, CloogConstraint **lower, int nb_par) { int i, j, k; cloog_int_t m; CloogMatrix *matrix = &constraints->M; unsigned len = matrix->NbColumns - 2; unsigned nb_iter = len - nb_par; CloogConstraint *constraint; for (i = 0; i < matrix->NbRows; i++) { if (cloog_int_is_zero(matrix->p[i][level])) continue; if (cloog_int_is_zero(matrix->p[i][0])) return cloog_constraint_invalid(); if (cloog_int_is_one(matrix->p[i][level])) return cloog_constraint_invalid(); if (cloog_int_is_neg_one(matrix->p[i][level])) return cloog_constraint_invalid(); if (cloog_seq_first_non_zero(matrix->p[i]+level+1, (1+nb_iter)-(level+1)) != -1) return cloog_constraint_invalid(); for (j = i+1; j < matrix->NbRows; ++j) { if (cloog_int_is_zero(matrix->p[j][level])) continue; if (cloog_int_is_zero(matrix->p[j][0])) return cloog_constraint_invalid(); if (cloog_int_is_one(matrix->p[j][level])) return cloog_constraint_invalid(); if (cloog_int_is_neg_one(matrix->p[j][level])) return cloog_constraint_invalid(); if (cloog_seq_first_non_zero(matrix->p[j]+level+1, (1+nb_iter)-(level+1)) != -1) return cloog_constraint_invalid(); cloog_int_init(m); cloog_int_add(m, matrix->p[i][1+len], matrix->p[j][1+len]); if (cloog_int_is_neg(m) || cloog_int_abs_ge(m, matrix->p[i][level])) { cloog_int_clear(m); return cloog_constraint_invalid(); } cloog_int_clear(m); if (!cloog_seq_is_neg(matrix->p[i]+1, matrix->p[j]+1, len)) return cloog_constraint_invalid(); for (k = j+1; k < matrix->NbRows; ++k) if (!cloog_int_is_zero(matrix->p[k][level])) return cloog_constraint_invalid(); *lower = ALLOC(CloogConstraint); constraint = ALLOC(CloogConstraint); (*lower)->set = constraints; constraint->set = constraints; if (cloog_int_is_pos(matrix->p[i][level])) { (*lower)->line = &matrix->p[i]; constraint->line = &matrix->p[j]; } else { (*lower)->line = &matrix->p[j]; constraint->line = &matrix->p[i]; } return constraint; } } return cloog_constraint_invalid(); } int cloog_constraint_set_total_dimension(CloogConstraintSet *constraints) { return constraints->M.NbColumns - 2; } int cloog_constraint_set_n_iterators(CloogConstraintSet *constraint, int nb_par) { return cloog_constraint_set_total_dimension(constraint) - nb_par; } int cloog_equal_total_dimension(CloogEqualities *equal) { return cloog_constraint_set_total_dimension(equal->constraints); } int cloog_constraint_total_dimension(CloogConstraint *constraint) { return cloog_constraint_set_total_dimension(constraint->set); } /****************************************************************************** * Equalities spreading functions * ******************************************************************************/ /* Equalities are stored inside a CloogMatrix data structure called "equal". * This matrix has (nb_scattering + nb_iterators + 1) rows (i.e. total * dimensions + 1, the "+ 1" is because a statement can be included inside an * external loop without iteration domain), and (nb_scattering + nb_iterators + * nb_parameters + 2) columns (all unknowns plus the scalar plus the equality * type). The ith row corresponds to the equality "= 0" for the ith dimension * iterator. The first column gives the equality type (0: no equality, then * EQTYPE_* -see pprint.h-). At each recursion of pprint, if an equality for * the current level is found, the corresponding row is updated. Then the * equality if it exists is used to simplify expressions (e.g. if we have * "i+1" while we know that "i=2", we simplify it in "3"). At the end of * the pprint call, the corresponding row is reset to zero. */ CloogEqualities *cloog_equal_alloc(int n, int nb_levels, int nb_parameters) { int i; CloogEqualities *equal = ALLOC(CloogEqualities); equal->constraints = cloog_constraint_set_from_cloog_matrix( cloog_matrix_alloc(n, nb_levels + nb_parameters + 1)); equal->types = ALLOCN(int, n); for (i = 0; i < n; ++i) equal->types[i] = EQTYPE_NONE; return equal; } void cloog_equal_free(CloogEqualities *equal) { cloog_matrix_free(&equal->constraints->M); free(equal->types); free(equal); } int cloog_equal_count(CloogEqualities *equal) { return equal->constraints->M.NbRows; } CloogConstraintSet *cloog_equal_constraints(CloogEqualities *equal) { return equal->constraints; } /** * cloog_constraint_equal_type function : * This function returns the type of the equality in the constraint (line) of * (constraints) for the element (level). An equality is 'constant' iff all * other factors are null except the constant one. It is a 'pure item' iff * it is equal or opposite to a single variable or parameter. * Otherwise it is an 'affine expression'. * For instance: * i = -13 is constant, i = j, j = -M are pure items, * j = 2*M, i = j+1, 2*j = M are affine expressions. * * - constraints is the matrix of constraints, * - level is the column number in equal of the element which is 'equal to', ** * - July 3rd 2002: first version, called pprint_equal_isconstant. * - July 6th 2002: adaptation for the 3 types. * - June 15th 2005: (debug) expr = domain->Constraint[line] was evaluated * before checking if line != ONE_TIME_LOOP. Since * ONE_TIME_LOOP is -1, an invalid read was possible. * - October 19th 2005: Removal of the once-time-loop specific processing. */ static int cloog_constraint_equal_type(CloogConstraint *constraint, int level) { int i, one=0 ; cloog_int_t *expr; expr = *constraint->line; if (!cloog_int_is_one(expr[level]) && !cloog_int_is_neg_one(expr[level])) return EQTYPE_EXAFFINE; /* There is only one non null factor, and it must be +1 or -1 for * iterators or parameters. */ for (i = 1;i <= constraint->set->M.NbColumns-2; i++) if (!cloog_int_is_zero(expr[i]) && (i != level)) { if ((!cloog_int_is_one(expr[i]) && !cloog_int_is_neg_one(expr[i])) || (one != 0)) return EQTYPE_EXAFFINE ; else one = 1 ; } /* if the constant factor is non null, it must be alone. */ if (one != 0) { if (!cloog_int_is_zero(expr[constraint->set->M.NbColumns-1])) return EQTYPE_EXAFFINE ; } else return EQTYPE_CONSTANT ; return EQTYPE_PUREITEM ; } int cloog_equal_type(CloogEqualities *equal, int level) { return equal->types[level-1]; } /** * cloog_equal_update function: * this function updates a matrix of equalities where each row corresponds to * the equality "=0" of an affine expression such that the entry at column * "row" (="level") is not zero. This matrix is upper-triangular, except the * row number "level-1" which has to be updated for the matrix to be triangular. * This function achieves the processing. * - equal is the matrix to be updated, * - level gives the row that has to be updated (it is actually row "level-1"), * - nb_par is the number of parameters of the program. ** * - September 20th 2005: first version. */ static void cloog_equal_update(CloogEqualities *equal, int level, int nb_par) { int i, j ; cloog_int_t gcd, factor_level, factor_outer, temp_level, temp_outer; cloog_int_init(gcd); cloog_int_init(temp_level); cloog_int_init(temp_outer); cloog_int_init(factor_level); cloog_int_init(factor_outer); /* For each previous level, */ for (i=level-2;i>=0;i--) { /* if the corresponding iterator is inside the current equality and is equal * to something, */ if (!cloog_int_is_zero(equal->constraints->M.p[level-1][i+1]) && equal->types[i]) { /* Compute the Greatest Common Divisor. */ cloog_int_gcd(gcd, equal->constraints->M.p[level-1][i+1], equal->constraints->M.p[i][i+1]); /* Compute the factors to apply to each row vector element. */ cloog_int_divexact(factor_level, equal->constraints->M.p[i][i+1], gcd); cloog_int_divexact(factor_outer, equal->constraints->M.p[level-1][i+1], gcd); /* Now update the row 'level'. */ /* - the iterators, up to level, */ for (j = 1; j <= level; j++) { cloog_int_mul(temp_level, factor_level, equal->constraints->M.p[level-1][j]); cloog_int_mul(temp_outer, factor_outer, equal->constraints->M.p[i][j]); cloog_int_sub(equal->constraints->M.p[level-1][j], temp_level, temp_outer); } /* - between last useful iterator (level) and the first parameter, the * matrix is sparse (full of zeroes), we just do nothing there. * - the parameters and the scalar. */ for (j = 0; j < nb_par + 1; j++) { cloog_int_mul(temp_level,factor_level, equal->constraints->M.p[level-1] [equal->constraints->M.NbColumns-j-1]); cloog_int_mul(temp_outer,factor_outer, equal->constraints->M.p[i][equal->constraints->M.NbColumns-j-1]); cloog_int_sub(equal->constraints->M.p[level-1] [equal->constraints->M.NbColumns-j-1], temp_level,temp_outer) ; } } } /* Normalize (divide by GCD of all elements) the updated equality. */ cloog_seq_normalize(&(equal->constraints->M.p[level-1][1]), equal->constraints->M.NbColumns-1); cloog_int_clear(gcd); cloog_int_clear(temp_level); cloog_int_clear(temp_outer); cloog_int_clear(factor_level); cloog_int_clear(factor_outer); } /** * cloog_equal_add function: * This function updates the row (level-1) of the equality matrix (equal) with * the row that corresponds to the row (line) of the matrix (matrix). * - equal is the matrix of equalities, * - matrix is the matrix of constraints, * - level is the column number in matrix of the element which is 'equal to', * - line is the line number in matrix of the constraint we want to study, * - the infos structure gives the user all options on code printing and more. ** * - July 2nd 2002: first version. * - October 19th 2005: Addition of the once-time-loop specific processing. */ void cloog_equal_add(CloogEqualities *equal, CloogConstraintSet *constraints, int level, CloogConstraint *line, int nb_par) { int j; CloogConstraint *i = cloog_constraint_invalid(); CloogMatrix *matrix = &constraints->M; /* If we are in the case of a loop running once, this means that the equality * comes from an inequality. Here we find this inequality. */ if (!cloog_constraint_is_valid(line)) { for (i = cloog_constraint_first(constraints); cloog_constraint_is_valid(i); i = cloog_constraint_next(i)) if ((!cloog_int_is_zero(i->line[0][0]))&& (!cloog_int_is_zero(i->line[0][level]))) { line = i ; /* Since in once-time-loops, equalities derive from inequalities, we * may have to offset the values. For instance if we have 2i>=3, the * equality is in fact i=2. This may happen when the level coefficient is * not 1 or -1 and the scalar value is not zero. In any other case (e.g., * if the inequality is an expression including outer loop counters or * parameters) the once time loop would not have been detected * because of floord and ceild functions. */ if (cloog_int_ne_si(i->line[0][level],1) && cloog_int_ne_si(i->line[0][level],-1) && !cloog_int_is_zero(i->line[0][matrix->NbColumns-1])) { cloog_int_t denominator; cloog_int_init(denominator); cloog_int_abs(denominator, i->line[0][level]); cloog_int_fdiv_q(i->line[0][matrix->NbColumns-1], i->line[0][matrix->NbColumns-1], denominator); cloog_int_set_si(i->line[0][level], cloog_int_sgn(i->line[0][level])); cloog_int_clear(denominator); } break ; } } assert(cloog_constraint_is_valid(line)); /* We update the line of equal corresponding to level: * - the first element gives the equality type, */ equal->types[level-1] = cloog_constraint_equal_type(line, level); /* - the other elements corresponding to the equality itself * (the iterators up to level, then the parameters and the scalar). */ for (j=1;j<=level;j++) cloog_int_set(equal->constraints->M.p[level-1][j], line->line[0][j]); for (j = 0; j < nb_par + 1; j++) cloog_int_set(equal->constraints->M.p[level-1][equal->constraints->M.NbColumns-j-1], line->line[0][line->set->M.NbColumns-j-1]); if (cloog_constraint_is_valid(i)) cloog_constraint_release(line); cloog_equal_update(equal, level, nb_par); } /** * cloog_equal_del function : * This function reset the equality corresponding to the iterator (level) * in the equality matrix (equal). * - July 2nd 2002: first version. */ void cloog_equal_del(CloogEqualities *equal, int level) { equal->types[level-1] = EQTYPE_NONE; } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * Function cloog_constraint_set_normalize: * This function will modify the constraint system in such a way that when * there is an equality depending on the element at level 'level', there are * no more (in)equalities depending on this element. For instance, try * test/valilache.cloog with options -f 8 -l 9, with and without the call * to this function. At a given moment, for the level L we will have * 32*P=L && L>=1 (P is a lower level), this constraint system cannot be * translated directly into a source code. Thus, we normalize the domain to * remove L from the inequalities. In our example, this leads to * 32*P=L && 32*P>=1, that can be transated to the code * if (P>=1) { L=32*P ; ... }. This function solves the DaeGon Kim bug. * WARNING: Remember that if there is another call to Polylib after a call to * this function, we have to recall this function. * -June 16th 2005: first version (adaptation from URGent June-7th-2005 by * N. Vasilache). * - June 21rd 2005: Adaptation for GMP. * - November 4th 2005: Complete rewriting, simpler and faster. It is no more an * adaptation from URGent. */ void cloog_constraint_set_normalize(CloogConstraintSet *constraints, int level) { int ref, i, j ; cloog_int_t factor_i, factor_ref, temp_i, temp_ref, gcd; CloogMatrix *matrix = &constraints->M; if (matrix == NULL) return ; /* Don't "normalize" the constant term. */ if (level == matrix->NbColumns-1) return; /* Let us find an equality for the current level that can be propagated. */ for (ref=0;refNbRows;ref++) if (cloog_int_is_zero(matrix->p[ref][0]) && !cloog_int_is_zero(matrix->p[ref][level])) { cloog_int_init(gcd); cloog_int_init(temp_i); cloog_int_init(temp_ref); cloog_int_init(factor_i); cloog_int_init(factor_ref); /* Row "ref" is the reference equality, now let us find a row to simplify.*/ for (i=ref+1;iNbRows;i++) if (!cloog_int_is_zero(matrix->p[i][level])) { /* Now let us set to 0 the "level" coefficient of row "j" using "ref". * First we compute the factors to apply to each row vector element. */ cloog_int_gcd(gcd, matrix->p[ref][level], matrix->p[i][level]); cloog_int_divexact(factor_i, matrix->p[ref][level], gcd); cloog_int_divexact(factor_ref, matrix->p[i][level], gcd); /* Maybe we are simplifying an inequality: factor_i must not be <0. */ if (cloog_int_is_neg(factor_i)) { cloog_int_abs(factor_i, factor_i); cloog_int_neg(factor_ref, factor_ref); } /* Now update the vector. */ for (j=1;jNbColumns;j++) { cloog_int_mul(temp_i, factor_i, matrix->p[i][j]); cloog_int_mul(temp_ref, factor_ref, matrix->p[ref][j]); cloog_int_sub(matrix->p[i][j], temp_i, temp_ref); } /* Normalize (divide by GCD of all elements) the updated vector. */ cloog_seq_normalize(&(matrix->p[i][1]), matrix->NbColumns-1); } cloog_int_clear(gcd); cloog_int_clear(temp_i); cloog_int_clear(temp_ref); cloog_int_clear(factor_i); cloog_int_clear(factor_ref); break ; } } /** * cloog_constraint_set_copy function: * this functions builds and returns a "hard copy" (not a pointer copy) of a * CloogMatrix data structure. * - October 26th 2005: first version. */ CloogConstraintSet *cloog_constraint_set_copy(CloogConstraintSet *constraints) { int i, j ; CloogMatrix *copy; CloogMatrix *matrix = &constraints->M; copy = cloog_matrix_alloc(matrix->NbRows, matrix->NbColumns); for (i=0;iNbRows;i++) for (j=0;jNbColumns;j++) cloog_int_set(copy->p[i][j], matrix->p[i][j]); return cloog_constraint_set_from_cloog_matrix(copy); } /** * cloog_equal_vector_simplify function: * this function simplify an affine expression with its coefficients in * "vector" of length "length" thanks to an equality matrix "equal" that gives * for some elements of the affine expression an equality with other elements, * preferably constants. For instance, if the vector contains i+j+3 and the * equality matrix gives i=n and j=2, the vector is simplified to n+3 and is * returned in a new vector. * - vector is the array of affine expression coefficients * - equal is the matrix of equalities, * - length is the vector length, * - level is a level we don't want to simplify (-1 if none), * - nb_par is the number of parameters of the program. ** * - September 20th 2005: first version. * - November 2nd 2005: (debug) we are simplifying inequalities, thus we are * not allowed to multiply the vector by a negative * constant.Problem found after a report of Michael * Classen. */ struct cloog_vec *cloog_equal_vector_simplify(CloogEqualities *equal, cloog_int_t *vector, int length, int level, int nb_par) { int i, j ; cloog_int_t gcd, factor_vector, factor_equal, temp_vector, temp_equal; struct cloog_vec *simplified; simplified = cloog_vec_alloc(length); cloog_seq_cpy(simplified->p, vector, length); cloog_int_init(gcd); cloog_int_init(temp_vector); cloog_int_init(temp_equal); cloog_int_init(factor_vector); cloog_int_init(factor_equal); /* For each non-null coefficient in the vector, */ for (i=length-nb_par-2;i>0;i--) if (i != level) { /* if the coefficient in not null, and there exists a useful equality */ if ((!cloog_int_is_zero(simplified->p[i])) && equal->types[i-1]) { /* Compute the Greatest Common Divisor. */ cloog_int_gcd(gcd, simplified->p[i], equal->constraints->M.p[i-1][i]); /* Compute the factors to apply to each row vector element. */ cloog_int_divexact(factor_vector, equal->constraints->M.p[i-1][i], gcd); cloog_int_divexact(factor_equal, simplified->p[i], gcd); /* We are simplifying an inequality: factor_vector must not be <0. */ if (cloog_int_is_neg(factor_vector)) { cloog_int_abs(factor_vector, factor_vector); cloog_int_neg(factor_equal, factor_equal); } /* Now update the vector. */ /* - the iterators, up to the current level, */ for (j=1;j<=length-nb_par-2;j++) { cloog_int_mul(temp_vector, factor_vector, simplified->p[j]); cloog_int_mul(temp_equal, factor_equal, equal->constraints->M.p[i-1][j]); cloog_int_sub(simplified->p[j], temp_vector, temp_equal); } /* - between last useful iterator (i) and the first parameter, the equal * matrix is sparse (full of zeroes), we just do nothing there. * - the parameters and the scalar. */ for (j = 0; j < nb_par + 1; j++) { cloog_int_mul(temp_vector, factor_vector, simplified->p[length-1-j]); cloog_int_mul(temp_equal,factor_equal, equal->constraints->M.p[i-1][equal->constraints->M.NbColumns-j-1]); cloog_int_sub(simplified->p[length-1-j],temp_vector,temp_equal) ; } } } /* Normalize (divide by GCD of all elements) the updated vector. */ cloog_seq_normalize(&simplified->p[1], length - 1); cloog_int_clear(gcd); cloog_int_clear(temp_vector); cloog_int_clear(temp_equal); cloog_int_clear(factor_vector); cloog_int_clear(factor_equal); return simplified ; } /** * cloog_constraint_set_simplify function: * this function simplify all constraints inside the matrix "matrix" thanks to * an equality matrix "equal" that gives for some elements of the affine * constraint an equality with other elements, preferably constants. * For instance, if a row of the matrix contains i+j+3>=0 and the equality * matrix gives i=n and j=2, the constraint is simplified to n+3>=0. The * simplified constraints are returned back inside a new simplified matrix. * - matrix is the set of constraints to simplify, * - equal is the matrix of equalities, * - level is a level we don't want to simplify (-1 if none), * - nb_par is the number of parameters of the program. ** * - November 4th 2005: first version. */ CloogConstraintSet *cloog_constraint_set_simplify(CloogConstraintSet *constraints, CloogEqualities *equal, int level, int nb_par) { int i, j, k ; struct cloog_vec *vector; CloogMatrix *simplified; CloogMatrix *matrix = &constraints->M; if (matrix == NULL) return NULL ; /* The simplified matrix is such that each row has been simplified thanks * tho the "equal" matrix. We allocate the memory for the simplified matrix, * then for each row of the original matrix, we compute the simplified * vector and we copy its content into the according simplified row. */ simplified = cloog_matrix_alloc(matrix->NbRows, matrix->NbColumns); for (i=0;iNbRows;i++) { vector = cloog_equal_vector_simplify(equal, matrix->p[i], matrix->NbColumns, level, nb_par); for (j=0;jNbColumns;j++) cloog_int_set(simplified->p[i][j], vector->p[j]); cloog_vec_free(vector); } /* After simplification, it may happen that few constraints are the same, * we remove them here by replacing them with 0=0 constraints. */ for (i=0;iNbRows;i++) for (j=i+1;jNbRows;j++) { for (k=0;kNbColumns;k++) if (cloog_int_ne(simplified->p[i][k],simplified->p[j][k])) break ; if (k == matrix->NbColumns) { for (k=0;kNbColumns;k++) cloog_int_set_si(simplified->p[j][k],0); } } return cloog_constraint_set_from_cloog_matrix(simplified); } /** * Return clast_expr corresponding to the variable "level" (1 based) in * the given constraint. */ struct clast_expr *cloog_constraint_variable_expr(CloogConstraint *constraint, int level, CloogNames *names) { int total_dim, nb_iter; const char *name; total_dim = cloog_constraint_total_dimension(constraint); nb_iter = total_dim - names->nb_parameters; if (level <= nb_iter) name = cloog_names_name_at_level(names, level); else name = names->parameters[level - (nb_iter+1)] ; return &new_clast_name(name)->expr; } /** * Return true if constraint c involves variable v (zero-based). */ int cloog_constraint_involves(CloogConstraint *constraint, int v) { return !cloog_int_is_zero(constraint->line[0][1+v]); } int cloog_constraint_is_lower_bound(CloogConstraint *constraint, int v) { return cloog_int_is_pos(constraint->line[0][1+v]); } int cloog_constraint_is_upper_bound(CloogConstraint *constraint, int v) { return cloog_int_is_neg(constraint->line[0][1+v]); } int cloog_constraint_is_equality(CloogConstraint *constraint) { return cloog_int_is_zero(constraint->line[0][0]); } void cloog_constraint_clear(CloogConstraint *constraint) { int k; for (k = 1; k <= constraint->set->M.NbColumns - 2; k++) cloog_int_set_si(constraint->line[0][k], 0); } CloogConstraintSet *cloog_constraint_set_drop_constraint( CloogConstraintSet *constraints, CloogConstraint *constraint) { cloog_constraint_clear(constraint); return constraints; } void cloog_constraint_coefficient_get(CloogConstraint *constraint, int var, cloog_int_t *val) { cloog_int_set(*val, constraint->line[0][1+var]); } void cloog_constraint_coefficient_set(CloogConstraint *constraint, int var, cloog_int_t val) { cloog_int_set(constraint->line[0][1+var], val); } void cloog_constraint_constant_get(CloogConstraint *constraint, cloog_int_t *val) { cloog_int_set(*val, constraint->line[0][constraint->set->M.NbColumns-1]); } /** * Copy the coefficient of constraint c into dst in PolyLib order, * i.e., first the coefficients of the variables, then the coefficients * of the parameters and finally the constant. */ void cloog_constraint_copy_coefficients(CloogConstraint *constraint, cloog_int_t *dst) { cloog_seq_cpy(dst, constraint->line[0]+1, constraint->set->M.NbColumns-1); } CloogConstraint *cloog_constraint_invalid(void) { return NULL; } int cloog_constraint_is_valid(CloogConstraint *constraint) { return constraint != NULL; } /** * Check whether there is any need for the constraint "upper" on * "level" to get reduced. * Yes. */ int cloog_constraint_needs_reduction(CloogConstraint *upper, int level) { return 1; } /** * Create a CloogConstraintSet containing enough information to perform * a reduction on the upper equality (in this case lower is an invalid * CloogConstraint) or the pair of inequalities upper and lower * from within insert_modulo_guard. * In the PolyLib backend, we return a CloogConstraintSet containting only * the upper bound. The reduction will not change the stride so there * will be no need to recompute the bound on the modulo expression. */ CloogConstraintSet *cloog_constraint_set_for_reduction(CloogConstraint *upper, CloogConstraint *lower) { CloogConstraintSet *set; set = cloog_constraint_set_from_cloog_matrix( cloog_matrix_alloc(1, upper->set->M.NbColumns)); cloog_seq_cpy(set->M.p[0], upper->line[0], set->M.NbColumns); return set; } /* Computes x, y and g such that g = gcd(a,b) and a*x+b*y = g */ static void Euclid(cloog_int_t a, cloog_int_t b, cloog_int_t *x, cloog_int_t *y, cloog_int_t *g) { cloog_int_t c, d, e, f, tmp; cloog_int_init(c); cloog_int_init(d); cloog_int_init(e); cloog_int_init(f); cloog_int_init(tmp); cloog_int_abs(c, a); cloog_int_abs(d, b); cloog_int_set_si(e, 1); cloog_int_set_si(f, 0); while (cloog_int_is_pos(d)) { cloog_int_tdiv_q(tmp, c, d); cloog_int_mul(tmp, tmp, f); cloog_int_sub(e, e, tmp); cloog_int_tdiv_q(tmp, c, d); cloog_int_mul(tmp, tmp, d); cloog_int_sub(c, c, tmp); cloog_int_swap(c, d); cloog_int_swap(e, f); } cloog_int_set(*g, c); if (cloog_int_is_zero(a)) cloog_int_set_si(*x, 0); else if (cloog_int_is_pos(a)) cloog_int_set(*x, e); else cloog_int_neg(*x, e); if (cloog_int_is_zero(b)) cloog_int_set_si(*y, 0); else { cloog_int_mul(tmp, a, *x); cloog_int_sub(tmp, c, tmp); cloog_int_divexact(*y, tmp, b); } cloog_int_clear(c); cloog_int_clear(d); cloog_int_clear(e); cloog_int_clear(f); cloog_int_clear(tmp); } /** * Reduce the modulo guard expressed by "contraints" using equalities * found in outer nesting levels (stored in "equal"). * The modulo guard may be an equality or a pair of inequalities. * In case of a pair of inequalities, "constraints" only contains the * upper bound and *bound contains the bound on the * corresponding modulo expression. The bound is left untouched by * this function. */ CloogConstraintSet *cloog_constraint_set_reduce(CloogConstraintSet *constraints, int level, CloogEqualities *equal, int nb_par, cloog_int_t *bound) { int i, j, k, len, len2, nb_iter; struct cloog_vec *line_vector2; cloog_int_t *line, *line2, val, x, y, g; len = constraints->M.NbColumns; len2 = cloog_equal_total_dimension(equal) + 2; nb_iter = len - 2 - nb_par; cloog_int_init(val); cloog_int_init(x); cloog_int_init(y); cloog_int_init(g); line_vector2 = cloog_vec_alloc(len2); line2 = line_vector2->p; line = constraints->M.p[0]; if (cloog_int_is_pos(line[level])) cloog_seq_neg(line+1, line+1, len-1); cloog_int_neg(line[level], line[level]); assert(cloog_int_is_pos(line[level])); for (i = nb_iter; i >= 1; --i) { if (i == level) continue; cloog_int_fdiv_r(line[i], line[i], line[level]); if (cloog_int_is_zero(line[i])) continue; /* Look for an earlier variable that is also a multiple of line[level] * and check whether we can use the corresponding affine expression * to "reduce" the modulo guard, where reduction means that we eliminate * a variable, possibly at the expense of introducing other variables * with smaller index. */ for (j = level-1; j >= 0; --j) { CloogConstraint *equal_constraint; if (cloog_equal_type(equal, j+1) != EQTYPE_EXAFFINE) continue; equal_constraint = cloog_equal_constraint(equal, j); cloog_constraint_coefficient_get(equal_constraint, j, &val); if (!cloog_int_is_divisible_by(val, line[level])) { cloog_constraint_release(equal_constraint); continue; } cloog_constraint_coefficient_get(equal_constraint, i-1, &val); if (cloog_int_is_divisible_by(val, line[level])) { cloog_constraint_release(equal_constraint); continue; } for (k = j; k > i; --k) { cloog_constraint_coefficient_get(equal_constraint, k-1, &val); if (cloog_int_is_zero(val)) continue; if (!cloog_int_is_divisible_by(val, line[level])) break; } if (k > i) { cloog_constraint_release(equal_constraint); continue; } cloog_constraint_coefficient_get(equal_constraint, i-1, &val); Euclid(val, line[level], &x, &y, &g); if (!cloog_int_is_divisible_by(val, line[i])) { cloog_constraint_release(equal_constraint); continue; } cloog_int_divexact(val, line[i], g); cloog_int_neg(val, val); cloog_int_mul(val, val, x); cloog_int_set_si(y, 1); /* Add (equal->p[j][i])^{-1} * line[i] times the equality */ cloog_constraint_copy_coefficients(equal_constraint, line2+1); cloog_seq_combine(line+1, y, line+1, val, line2+1, i); cloog_seq_combine(line+len-nb_par-1, y, line+len-nb_par-1, val, line2+len2-nb_par-1, nb_par+1); cloog_constraint_release(equal_constraint); break; } } cloog_vec_free(line_vector2); cloog_int_clear(val); cloog_int_clear(x); cloog_int_clear(y); cloog_int_clear(g); /* Make sure the line is not inverted again in the calling function. */ cloog_int_neg(line[level], line[level]); return constraints; } CloogConstraint *cloog_constraint_first(CloogConstraintSet *constraints) { CloogConstraint *c; if (constraints->M.NbRows == 0) return cloog_constraint_invalid(); c = ALLOC(CloogConstraint); c->set = constraints; c->line = &constraints->M.p[0]; return c; } CloogConstraint *cloog_constraint_next(CloogConstraint *constraint) { constraint->line++; if (constraint->line == constraint->set->M.p + constraint->set->M.NbRows) { cloog_constraint_release(constraint); return NULL; } return constraint; } CloogConstraint *cloog_constraint_copy(CloogConstraint *constraint) { CloogConstraint *c = ALLOC(CloogConstraint); c->set = constraint->set; c->line = constraint->line; return c; } void cloog_constraint_release(CloogConstraint *constraint) { free(constraint); } int cloog_constraint_set_foreach_constraint(CloogConstraintSet *constraints, int (*fn)(CloogConstraint *constraint, void *user), void *user) { CloogConstraint *c; for (c = cloog_constraint_first(constraints); cloog_constraint_is_valid(c); c = cloog_constraint_next(c)) if (fn(c, user) < 0) { cloog_constraint_release(c); return -1; } return 0; } CloogConstraint *cloog_equal_constraint(CloogEqualities *equal, int j) { CloogConstraint *c = ALLOC(CloogConstraint); c->set = equal->constraints; c->line = &equal->constraints->M.p[j]; return c; } cloog-0.18.2/source/stride.c0000664000175000017500000000251412254312305012565 00000000000000#include #include #define ALLOC(type) (type*)malloc(sizeof(type)) CloogStride *cloog_stride_malloc() { CloogStride *s; s = ALLOC(CloogStride); if (!s) cloog_die("memory overflow.\n"); s->references = 1; cloog_int_init(s->stride); cloog_int_init(s->offset); cloog_int_init(s->factor); s->constraint = cloog_constraint_invalid(); return s; } CloogStride *cloog_stride_alloc(cloog_int_t stride, cloog_int_t offset) { CloogStride *s = cloog_stride_malloc(); cloog_int_set(s->stride, stride); cloog_int_set(s->offset, offset); cloog_int_set_si(s->factor, 0); return s; } CloogStride *cloog_stride_alloc_from_constraint(cloog_int_t stride, CloogConstraint *constraint, cloog_int_t factor) { CloogStride *s = cloog_stride_malloc(); cloog_int_set(s->stride, stride); cloog_int_set(s->factor, factor); cloog_int_set_si(s->offset, -1); s->constraint = constraint; return s; } CloogStride *cloog_stride_copy(CloogStride *stride) { if (!stride) return stride; stride->references++; return stride; } void cloog_stride_free(CloogStride *stride) { if (!stride) return; stride->references--; if (stride->references > 0) return; cloog_int_clear(stride->stride); cloog_int_clear(stride->offset); cloog_int_clear(stride->factor); cloog_constraint_release(stride->constraint); free(stride); } cloog-0.18.2/source/options.c0000664000175000017500000004775312254312305013004 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** options.c ** **-------------------------------------------------------------------** ** First version: april 19th 2003 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #include # include # include # include # include "../include/cloog/cloog.h" #ifdef OSL_SUPPORT #include #endif /****************************************************************************** * Error reporting functions * ******************************************************************************/ void cloog_vmsg(CloogOptions *options, enum cloog_msg_type type, const char *msg, va_list ap) { const char *type_msg; if (options && options->quiet && (type == CLOOG_WARNING || type == CLOOG_INFO)) return; switch(type) { case CLOOG_WARNING: type_msg = "WARNING"; break; case CLOOG_INFO: type_msg = "INFO"; break; case CLOOG_ERROR: default: type_msg = "ERROR"; break; } fprintf(stderr, "[CLooG] %s: ", type_msg); vfprintf(stderr, msg, ap); } /** * Print message to stderr. * @param msg printf format string */ void cloog_msg(CloogOptions *options, enum cloog_msg_type type, const char *msg, ...) { va_list args; va_start(args, msg); cloog_vmsg(options, type, msg, args); va_end(args); } /** * Print error message to stderr and exit. * @param msg printf format string */ void cloog_die(const char *msg, ...) { va_list args; va_start(args, msg); cloog_vmsg(NULL, CLOOG_ERROR, msg, args); va_end(args); exit(1); } /****************************************************************************** * Structure display function * ******************************************************************************/ /** * cloog_option_print function: * This function prints the content of a CloogOptions structure (program) into * a file (foo, possibly stdout). * - April 19th 2003: first version. */ void cloog_options_print(FILE * foo, CloogOptions * options) { int i; fprintf(foo,"Options:\n") ; fprintf(foo,"OPTIONS FOR LOOP GENERATION\n") ; fprintf(foo,"l = %3d,\n",options->l) ; fprintf(foo,"f = %3d,\n",options->f) ; fprintf(foo,"fs = %3d,\n",options->f) ; if (options->fs_ls_size>=1) { fprintf(foo,"fs = "); for (i=0; ifs_ls_size; i++) { fprintf(foo,"%3d,\n",options->fs[i]) ; } fprintf(foo,"\n"); fprintf(foo,"ls = "); for (i=0; ifs_ls_size; i++) { fprintf(foo,"%3d,\n",options->ls[i]) ; } fprintf(foo,"\n"); } fprintf(foo,"stop = %3d,\n",options->stop) ; fprintf(foo,"strides = %3d,\n",options->strides) ; fprintf(foo,"sh = %3d,\n",options->sh); fprintf(foo,"OPTIONS FOR PRETTY PRINTING\n") ; fprintf(foo,"esp = %3d,\n",options->esp) ; fprintf(foo,"fsp = %3d,\n",options->fsp) ; fprintf(foo,"otl = %3d.\n",options->otl) ; fprintf(foo,"block = %3d.\n",options->block) ; fprintf(foo,"compilable = %3d.\n",options->compilable) ; fprintf(foo,"callable = %3d.\n",options->callable) ; fprintf(foo,"MISC OPTIONS\n") ; fprintf(foo,"name = %3s.\n", options->name); fprintf(foo,"openscop = %3d.\n", options->openscop); if (options->scop != NULL) fprintf(foo,"scop = (present but not printed).\n"); else fprintf(foo,"scop = NULL.\n"); fprintf(foo,"UNDOCUMENTED OPTIONS FOR THE AUTHOR ONLY\n") ; fprintf(foo,"leaks = %3d.\n",options->leaks) ; fprintf(foo,"backtrack = %3d.\n",options->backtrack); fprintf(foo,"override = %3d.\n",options->override) ; fprintf(foo,"structure = %3d.\n",options->structure) ; fprintf(foo,"noscalars = %3d.\n",options->noscalars) ; fprintf(foo,"noblocks = %3d.\n",options->noblocks) ; fprintf(foo,"nosimplify = %3d.\n",options->nosimplify) ; } /****************************************************************************** * Memory deallocation function * ******************************************************************************/ /** * cloog_options_free function: * This function frees the allocated memory for a CloogOptions structure. * - April 19th 2003: first version. */ void cloog_options_free(CloogOptions *options) { #ifdef OSL_SUPPORT if (options->scop != NULL) { osl_scop_free(options->scop); } #endif free(options->fs); free(options->ls); free(options); } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * cloog_options_help function: * This function displays the quick help when the user set the option -help * while calling cloog. Prints are cutted to respect the 509 characters * limitation of the ISO C 89 compilers. * - August 5th 2002: first version. */ void cloog_options_help() { printf( "Usage: cloog [ options | file ] ...\n" "Options for code generation:\n" " -l Last loop depth to optimize (-1: infinity)\n" " (default setting: -1).\n" " -f First loop depth to start loop separation (-1: " "infinity)\n (default setting: 1).\n") ; printf( " -stop Loop depth to stop code generation (-1: infinity)" "\n (default setting: -1).\n" " -strides Handle non-unit strides (1) or not (0)\n" " (default setting: 0).\n" " -first-unroll First loop dimension to unroll (-1: no unrolling)\n"); printf( "\nOptions for pretty printing:\n" " -otl Simplify loops running one time (1) or not (0)\n" " (default setting: 1).\n") ; printf( " -esp Allow complex equalities spreading (1) or not (0)\n" " (default setting: 0).\n"); printf( " -fsp First level to begin the spreading\n" " (default setting: 1).\n" " -block Make a new statement block per iterator in C\n" " programs (1) or not (0) (default setting: 0).\n") ; printf( " -compilable Compilable code by using preprocessor (not 0) or" "\n not (0), number being the value of the parameters" "\n (default setting: 0).\n" " -callable Testable code by using preprocessor (not 0) or" "\n not (0) (default setting: 0).\n"); printf( "\nGeneral options:\n" " -o Name of the output file; 'stdout' is a special\n" " value: when used, output is standard output\n" " (default setting: stdout).\n" #ifdef OSL_SUPPORT " -openscop Input file has OpenScop format.\n" #endif " -v, --version Display the version information (and more).\n" " -q, --quiet Don't print any informational messages.\n" " -h, --help Display this information.\n\n") ; printf( "The special value 'stdin' for 'file' makes CLooG to read data on\n" "standard input.\n\n" "For bug reporting or any suggestions, please send an email to the author\n" ".\n") ; } /** * cloog_options_version function: * This function displays some version informations when the user set the * option -version while calling cloog. Prints are cutted to respect the 509 * characters limitation of the ISO C 89 compilers. * - August 5th 2002: first version. */ void cloog_options_version() { printf("%s The Chunky Loop Generator\n", cloog_version()); printf( "-----\n" "This is a loop generator for scanning Z-polyhedra. It is based on the " "work of\nF. Quillere and C. Bastoul on high level code generation and of " "the PolyLib Team\non polyhedral computation. This program is distributed " "under the terms of the\nGNU Lesser General Public License " "(details at http://www.gnu.org/licenses/lgpl-2.1.html).\n" "-----\n") ; printf( "It would be fair to refer the following paper in any publication " "resulting from\nthe use of this software or its library:\n" "@InProceedings{Bas04,\n" "author = {Cedric Bastoul},\n" "title = {Code Generation in the Polyhedral Model Is Easier Than You " "Think},\n" "booktitle = {PACT'13 IEEE International Conference on Parallel " "Architecture\n and Compilation Techniques},\n" "pages = {7--16},\n" "month = {september},\n" "year = 2004,\n" "address = {Juan-les-Pins}\n" "}\n" "-----\n" "For any information, please ask the author at " ".\n") ; } /** * cloog_options_set function: * This function sets the value of an option thanks to the user's calling line. * - option is the value to set, * - argc are the elements of the user's calling line, * - number is the number of the element corresponding to the considered option, * this function adds 1 to number to pass away the option value. ** * - August 5th 2002: first version. * - June 29th 2003: (debug) lack of argument now detected. */ void cloog_options_set(int * option, int argv, char ** argc, int * number) { char ** endptr ; if (*number+1 >= argv) cloog_die("an option lacks of argument.\n"); endptr = NULL ; *option = strtol(argc[*number+1],endptr,10) ; if (endptr != NULL) cloog_die("value '%s' for option '%s' is not valid.\n", argc[*number+1], argc[*number]); *number = *number + 1 ; } /** * cloog_options_malloc function: * This functions allocate the memory space for a CLoogOptions structure and * fill its fields with the defaults values. It returns a pointer to the * allocated CloogOptions structure. * - April 19th 2003: first version. * - November 21th 2005: name changed (before it was cloog_options_init). */ CloogOptions *cloog_options_malloc(CloogState *state) { CloogOptions * options ; /* Memory allocation for the CloogOptions structure. */ options = (CloogOptions *)malloc(sizeof(CloogOptions)) ; if (options == NULL) cloog_die("memory overflow.\n"); options->state = state; /* We set the various fields with default values. */ /* OPTIONS FOR LOOP GENERATION */ options->l = -1 ; /* Last level to optimize: infinity. */ options->f = 1 ; /* First level to optimize: the first. */ options->ls = NULL ; /* Statement-wise l option is not set */ options->fs = NULL ; /* Statement-wise f option is not set */ options->fs_ls_size = 0; /* No statement-wise f/s control */ options->stop = -1 ; /* Generate all the code. */ options->strides = 0 ; /* Generate a code with unit strides. */ options->sh = 0; /* Compute actual convex hull. */ options->first_unroll = -1; /* First level to unroll: none. */ options->name = ""; /* OPTIONS FOR PRETTY PRINTING */ options->esp = 1 ; /* We want Equality SPreading.*/ options->fsp = 1 ; /* The First level to SPread is the first. */ options->otl = 1 ; /* We want to fire One Time Loops. */ options->block = 0 ; /* We don't want to force statement blocks. */ options->compilable = 0 ; /* No compilable code. */ options->callable = 0 ; /* No callable code. */ options->quiet = 0; /* Do print informational messages. */ options->save_domains = 0; /* Don't save domains. */ /* MISC OPTIONS */ options->language = CLOOG_LANGUAGE_C; /* The default output language is C. */ options->openscop = 0 ; /* The input file has not the OpenScop format.*/ options->scop = NULL;/* No default SCoP.*/ /* UNDOCUMENTED OPTIONS FOR THE AUTHOR ONLY */ options->leaks = 0 ; /* I don't want to print allocation statistics.*/ options->backtrack = 0; /* Perform backtrack in Quillere's algorithm.*/ options->override = 0 ; /* I don't want to override CLooG decisions.*/ options->structure = 0 ; /* I don't want to print internal structure.*/ options->noblocks = 0 ; /* I do want to make statement blocks.*/ options->noscalars = 0 ; /* I do want to use scalar dimensions.*/ options->nosimplify = 0 ; /* I do want to simplify polyhedra.*/ return options ; } /** * cloog_options_read function: * This functions reads all the options and the input/output files thanks * the the user's calling line elements (in argc). It fills a CloogOptions * structure and the FILE structure corresponding to input and output files. * - August 5th 2002: first version. * - April 19th 2003: now in options.c and support of the CloogOptions structure. */ void cloog_options_read(CloogState *state, int argc, char **argv, FILE **input, FILE **output, CloogOptions **options) { int i, infos=0, input_is_set=0 ; /* CloogOptions structure allocation and initialization. */ *options = cloog_options_malloc(state); /* The default output is the standard output. */ *output = stdout ; for (i=1;il,argc,argv,&i) ; else if (strcmp(argv[i],"-f") == 0) cloog_options_set(&(*options)->f,argc,argv,&i) ; else if (strcmp(argv[i],"-stop") == 0) cloog_options_set(&(*options)->stop,argc,argv,&i) ; else if (strcmp(argv[i],"-strides") == 0) cloog_options_set(&(*options)->strides,argc,argv,&i) ; else if (strcmp(argv[i],"-sh") == 0) cloog_options_set(&(*options)->sh,argc,argv,&i) ; else if (!strcmp(argv[i], "-first-unroll")) cloog_options_set(&(*options)->first_unroll, argc, argv, &i); else if (strcmp(argv[i],"-otl") == 0) cloog_options_set(&(*options)->otl,argc,argv,&i) ; else if (strcmp(argv[i],"-openscop") == 0) { #ifdef OSL_SUPPORT (*options)->openscop = 1 ; #else cloog_die("CLooG has not been compiled with OpenScop support.\n"); #endif } else if (strcmp(argv[i],"-esp") == 0) cloog_options_set(&(*options)->esp,argc,argv,&i) ; else if (strcmp(argv[i],"-fsp") == 0) cloog_options_set(&(*options)->fsp,argc,argv,&i) ; else if (strcmp(argv[i],"-block") == 0) cloog_options_set(&(*options)->block,argc,argv,&i) ; else if (strcmp(argv[i],"-compilable") == 0) cloog_options_set(&(*options)->compilable, argc, argv, &i); else if (strcmp(argv[i], "-callable") == 0) cloog_options_set(&(*options)->callable, argc, argv, &i); else if (strcmp(argv[i],"-loopo") == 0) /* Special option for the LooPo team ! */ { (*options)->esp = 0 ; (*options)->block = 1 ; } else if (strcmp(argv[i],"-bipbip") == 0)/* Special option for the author only !*/ (*options)->backtrack = 0; else if (strcmp(argv[i],"-leaks") == 0) (*options)->leaks = 1 ; else if (strcmp(argv[i],"-nobacktrack") == 0) (*options)->backtrack = 0; else if (strcmp(argv[i], "-backtrack") == 0) (*options)->backtrack = 1; else if (strcmp(argv[i],"-override") == 0) (*options)->override = 1 ; else if (strcmp(argv[i],"-noblocks") == 0) (*options)->noblocks = 1 ; else if (strcmp(argv[i],"-noscalars") == 0) (*options)->noscalars = 1 ; else if (strcmp(argv[i],"-nosimplify") == 0) (*options)->nosimplify = 1 ; else if ((strcmp(argv[i],"-struct") == 0) || (strcmp(argv[i],"-structure") == 0)) (*options)->structure = 1 ; else if ((strcmp(argv[i],"--help") == 0) || (strcmp(argv[i],"-h") == 0)) { cloog_options_help() ; infos = 1 ; } else if ((strcmp(argv[i],"--version") == 0) || (strcmp(argv[i],"-v") == 0)) { cloog_options_version() ; infos = 1 ; } else if ((strcmp(argv[i],"--quiet") == 0) || (strcmp(argv[i],"-q") == 0)) (*options)->quiet = 1; else if (strcmp(argv[i],"-o") == 0) { if (i+1 >= argc) cloog_die("no output name for -o option.\n"); /* stdout is a special value, when used, we set output to standard * output. */ if (strcmp(argv[i+1],"stdout") == 0) *output = stdout ; else { *output = fopen(argv[i+1],"w") ; if (*output == NULL) cloog_die("can't create output file %s.\n", argv[i+1]); } i ++ ; } else cloog_msg(*options, CLOOG_WARNING, "unknown %s option.\n", argv[i]); } else { if (!input_is_set) { input_is_set = 1 ; (*options)->name = argv[i] ; /* stdin is a special value, when used, we set input to standard input. */ if (strcmp(argv[i],"stdin") == 0) *input = stdin ; else { *input = fopen(argv[i],"r") ; if (*input == NULL) cloog_die("%s file does not exist.\n", argv[i]); } } else cloog_die("multiple input files.\n"); } if (!input_is_set) { if (!infos) cloog_die("no input file (-h for help).\n"); exit(1) ; } } #ifdef OSL_SUPPORT /** * This function extracts CLooG option values from an OpenScop scop and * updates an existing CloogOption structure with those values. If the * options were already set, they are updated without warning. * \param[in] scop Input Scop. * \param[in,out] options CLooG options to be updated. */ void cloog_options_copy_from_osl_scop(osl_scop_p scop, CloogOptions *options) { if (!options) cloog_die("Options must be provided.\n"); if (scop) { /* Extract the language. */ if (!strcmp(scop->language, "FORTRAN")) options->language = CLOOG_LANGUAGE_FORTRAN; else options->language = CLOOG_LANGUAGE_C; /* Store the input SCoP in the option structure. */ options->scop = scop; } } #endif cloog-0.18.2/source/loop.c0000664000175000017500000024647212254312305012261 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** loop.c ** **-------------------------------------------------------------------** ** First version: october 26th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /* CAUTION: the english used for comments is probably the worst you ever read, * please feel free to correct and improve it ! */ # include # include # include "../include/cloog/cloog.h" #define ALLOC(type) (type*)malloc(sizeof(type)) /****************************************************************************** * Memory leaks hunting * ******************************************************************************/ /** * These functions and global variables are devoted to memory leaks hunting: we * want to know at each moment how many CloogLoop structures had been allocated * (cloog_loop_allocated) and how many had been freed (cloog_loop_freed). * Each time a CloogLoog structure is allocated, a call to the function * cloog_loop_leak_up() must be carried out, and respectively * cloog_loop_leak_down() when a CloogLoop structure is freed. The special * variable cloog_loop_max gives the maximal number of CloogLoop structures * simultaneously alive (i.e. allocated and non-freed) in memory. * - July 3rd->11th 2003: first version (memory leaks hunt and correction). */ static void cloog_loop_leak_up(CloogState *state) { state->loop_allocated++; if ((state->loop_allocated - state->loop_freed) > state->loop_max) state->loop_max = state->loop_allocated - state->loop_freed; } static void cloog_loop_leak_down(CloogState *state) { state->loop_freed++; } /****************************************************************************** * Structure display function * ******************************************************************************/ /** * cloog_loop_print_structure function: * Displays a loop structure in a way that trends to be understandable without * falling in a deep depression or, for the lucky ones, getting a headache... * Written by Olivier Chorier, Luc Marchaud, Pierre Martin and Romain Tartiere. * - April 24th 2005: Initial version. * - May 21rd 2005: - New parameter `F' for destination file (ie stdout), * - Minor tweaks. * - May 26th 2005: Memory leak hunt. * - June 2nd 2005: (Ced) Integration and minor fixes. * -June 22nd 2005: (Ced) Adaptation for GMP. */ void cloog_loop_print_structure(FILE * file, CloogLoop * loop, int level) { int i, j, first=1 ; if (loop) { /* Go to the right level. */ for (i=0; idomain, level+1, "CloogDomain"); /* Print the stride. */ for(j=0; j<=level; j++) fprintf(file,"|\t") ; if (loop->stride) { fprintf(file, "Stride: "); cloog_int_print(file, loop->stride->stride); fprintf(file, "\n"); fprintf(file, "Offset: "); cloog_int_print(file, loop->stride->offset); fprintf(file, "\n"); } /* A blank line. */ for(j=0; j<=level+1; j++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the block. */ cloog_block_print_structure(file,loop->block,level+1) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print inner if any. */ if (loop->inner) cloog_loop_print_structure(file,loop->inner,level+1) ; /* And let's go for the next one. */ loop = loop->next ; /* One more time something that is here only for a better look. */ if (!loop) { /* Two blank lines if this is the end of the linked list. */ for (j=0; j<2; j++) { for (i=0; i<=level; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; } } else { /* A special blank line if the is a next loop. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; fprintf(file,"V\n") ; } } } /** * cloog_loop_print function: * This function prints the content of a CloogLoop structure (start) into a * file (file, possibly stdout). * - June 2nd 2005: Now this very old function (probably as old as CLooG) is * only a frontend to cloog_loop_print_structure, with a quite * better human-readable representation. */ void cloog_loop_print(FILE * file, CloogLoop * loop) { cloog_loop_print_structure(file,loop,0) ; } /****************************************************************************** * Memory deallocation function * ******************************************************************************/ /** * cloog_loop_free function: * This function frees the allocated memory for a CloogLoop structure (loop), * and frees its inner loops and its next loops. * - June 22nd 2005: Adaptation for GMP. */ void cloog_loop_free(CloogLoop * loop) { CloogLoop * next ; while (loop != NULL) { cloog_loop_leak_down(loop->state); next = loop->next ; cloog_domain_free(loop->domain) ; cloog_domain_free(loop->unsimplified); cloog_block_free(loop->block) ; if (loop->inner != NULL) cloog_loop_free(loop->inner) ; cloog_stride_free(loop->stride); free(loop) ; loop = next ; } } /** * cloog_loop_free_parts function: * This function frees the allocated memory for some parts of a CloogLoop * structure (loop), each other argument is a boolean having to be set to 1 if * we want to free the corresponding part, 0 otherwise. This function applies * the same freeing policy to its inner ans next loops recursively. * - July 3rd 2003: first version. * - June 22nd 2005: Adaptation for GMP. */ void cloog_loop_free_parts(loop, domain, block, inner, next) CloogLoop * loop ; int domain, block, inner, next ; { CloogLoop * follow ; while (loop != NULL) { cloog_loop_leak_down(loop->state); follow = loop->next ; if (domain) cloog_domain_free(loop->domain) ; if (block) cloog_block_free(loop->block) ; if ((inner) && (loop->inner != NULL)) cloog_loop_free_parts(loop->inner,domain,block,inner,1) ; cloog_domain_free(loop->unsimplified); cloog_stride_free(loop->stride); free(loop) ; if (next) loop = follow ; else loop = NULL ; } } /****************************************************************************** * Reading functions * ******************************************************************************/ /** * Construct a CloogLoop structure from a given iteration domain * and statement number. */ CloogLoop *cloog_loop_from_domain(CloogState *state, CloogDomain *domain, int number) { int nb_iterators; CloogLoop * loop ; CloogStatement * statement ; /* Memory allocation and information reading for the first domain: */ loop = cloog_loop_malloc(state); /* domain. */ loop->domain = domain; if (loop->domain != NULL) nb_iterators = cloog_domain_dimension(loop->domain); else nb_iterators = 0 ; /* included statement block. */ statement = cloog_statement_alloc(state, number + 1); loop->block = cloog_block_alloc(statement, 0, NULL, nb_iterators); return loop ; } /** * cloog_loop_read function: * This function reads loop data from a file (foo, possibly stdin) and * returns a pointer to a CloogLoop structure containing the read information. * This function can be used only for input file reading, when one loop is * associated with one statement. * - number is the statement block number carried by the loop (-1 if none). * - nb_parameters is the number of parameters. ** * - September 9th 2002: first version. * - April 16th 2005: adaptation to new CloogStatement struct (with number). * - June 11th 2005: adaptation to new CloogBlock structure. * - June 22nd 2005: Adaptation for GMP. */ CloogLoop *cloog_loop_read(CloogState *state, FILE *foo, int number, int nb_parameters) { int op1, op2, op3; char s[MAX_STRING]; CloogDomain *domain; domain = cloog_domain_union_read(state, foo, nb_parameters); /* To read that stupid "0 0 0" line. */ while (fgets(s,MAX_STRING,foo) == 0) ; while ((*s=='#' || *s=='\n') || (sscanf(s," %d %d %d",&op1,&op2,&op3)<3)) fgets(s,MAX_STRING,foo) ; return cloog_loop_from_domain(state, domain, number); } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * cloog_loop_malloc function: * This function allocates the memory space for a CloogLoop structure and * sets its fields with default values. Then it returns a pointer to the * allocated space. * - November 21th 2005: first version. */ CloogLoop *cloog_loop_malloc(CloogState *state) { CloogLoop * loop ; /* Memory allocation for the CloogLoop structure. */ loop = (CloogLoop *)malloc(sizeof(CloogLoop)) ; if (loop == NULL) cloog_die("memory overflow.\n"); cloog_loop_leak_up(state); /* We set the various fields with default values. */ loop->state = state; loop->domain = NULL ; loop->unsimplified = NULL; loop->block = NULL ; loop->usr = NULL; loop->inner = NULL ; loop->next = NULL ; loop->otl = 0; loop->stride = NULL; return loop ; } /** * cloog_loop_alloc function: * This function allocates the memory space for a CloogLoop structure and * sets its fields with those given as input. Then it returns a pointer to the * allocated space. * - October 27th 2001: first version. * - June 22nd 2005: Adaptation for GMP. * - November 21th 2005: use of cloog_loop_malloc. */ CloogLoop *cloog_loop_alloc(CloogState *state, CloogDomain *domain, int otl, CloogStride *stride, CloogBlock *block, CloogLoop *inner, CloogLoop *next) { CloogLoop * loop ; loop = cloog_loop_malloc(state); loop->domain = domain ; loop->block = block ; loop->inner = inner ; loop->next = next ; loop->otl = otl; loop->stride = cloog_stride_copy(stride); return(loop) ; } /** * cloog_loop_add function: * This function adds a CloogLoop structure (loop) at a given place (now) of a * NULL terminated list of CloogLoop structures. The beginning of this list * is (start). This function updates (now) to (loop), and updates (start) if the * added element is the first one -that is when (start) is NULL-. * - October 28th 2001: first version. */ void cloog_loop_add(CloogLoop ** start, CloogLoop ** now, CloogLoop * loop) { if (*start == NULL) { *start = loop ; *now = *start ; } else { (*now)->next = loop ; *now = (*now)->next ; } } /** * cloog_loop_add function: * This function adds a CloogLoop structure (loop) at a given place (now) of a * NULL terminated list of CloogLoop structures. The beginning of this list * is (start). This function updates (now) to the end of the loop list (loop), * and updates (start) if the added element is the first one -that is when * (start) is NULL-. * - September 9th 2005: first version. */ void cloog_loop_add_list(CloogLoop ** start, CloogLoop ** now, CloogLoop * loop) { if (*start == NULL) { *start = loop ; *now = *start ; } else { (*now)->next = loop ; *now = (*now)->next ; } while ((*now)->next != NULL) *now = (*now)->next ; } /** * cloog_loop_copy function: * This function returns a copy of the CloogLoop structure given as input. In * fact, there is just new allocations for the CloogLoop structures, but their * contents are the same. * - October 28th 2001: first version. * - July 3rd->11th 2003: memory leaks hunt and correction. */ CloogLoop * cloog_loop_copy(CloogLoop * source) { CloogLoop * loop ; CloogBlock * block ; CloogDomain * domain ; loop = NULL ; if (source != NULL) { domain = cloog_domain_copy(source->domain) ; block = cloog_block_copy(source->block) ; loop = cloog_loop_alloc(source->state, domain, source->otl, source->stride, block, NULL, NULL); loop->usr = source->usr; loop->inner = cloog_loop_copy(source->inner) ; loop->next = cloog_loop_copy(source->next) ; } return(loop) ; } /** * cloog_loop_add_disjoint function: * This function adds some CloogLoop structures at a given place (now) of a * NULL terminated list of CloogLoop structures. The beginning of this list * is (start). (loop) can be an union of polyhedra, this function separates the * union into a list of *disjoint* polyhedra then adds the list. This function * updates (now) to the end of the list and updates (start) if first added * element is the first of the principal list -that is when (start) is NULL-. * (loop) can be freed by this function, basically when its domain is actually * a union of polyhedra, but don't worry, all the useful data are now stored * inside the list (start). We do not use PolyLib's Domain_Disjoint function, * since the number of union components is often higher (thus code size too). * - October 28th 2001: first version. * - November 14th 2001: bug correction (this one was hard to find !). * - July 3rd->11th 2003: memory leaks hunt and correction. * - June 22nd 2005: Adaptation for GMP. * - October 27th 2005: (debug) included blocks were not copied for new loops. */ void cloog_loop_add_disjoint(start, now, loop) CloogLoop ** start, ** now, * loop ; { CloogLoop * sep, * inner ; CloogDomain *domain, *seen, *temp, *rest; CloogBlock * block ; if (cloog_domain_isconvex(loop->domain)) cloog_loop_add(start,now,loop) ; else { domain = cloog_domain_simplify_union(loop->domain); loop->domain = NULL ; /* We separate the first element of the rest of the union. */ domain = cloog_domain_cut_first(domain, &rest); /* This first element is the first of the list of disjoint polyhedra. */ sep = cloog_loop_alloc(loop->state, domain, 0, NULL, loop->block, loop->inner, NULL); cloog_loop_add(start,now,sep) ; seen = cloog_domain_copy(domain); while (!cloog_domain_isempty(domain = rest)) { temp = cloog_domain_cut_first(domain, &rest); domain = cloog_domain_difference(temp, seen); cloog_domain_free(temp); if (cloog_domain_isempty(domain)) { cloog_domain_free(domain); continue; } /* Each new loop will have its own life, for instance we can free its * inner loop and included block. Then each one must have its own copy * of both 'inner' and 'block'. */ inner = cloog_loop_copy(loop->inner) ; block = cloog_block_copy(loop->block) ; sep = cloog_loop_alloc(loop->state, cloog_domain_copy(domain), 0, NULL, block, inner, NULL); /* domain can be an union too. If so: recursion. */ if (cloog_domain_isconvex(domain)) cloog_loop_add(start,now,sep) ; else cloog_loop_add_disjoint(start,now,sep) ; if (cloog_domain_isempty(rest)) { cloog_domain_free(domain); break; } seen = cloog_domain_union(seen, domain); } cloog_domain_free(rest); cloog_domain_free(seen); cloog_loop_free_parts(loop,0,0,0,0) ; } } /** * cloog_loop_disjoint function: * This function returns a list of loops such that each loop with non-convex * domain in the input list (loop) is separated into several loops where the * domains are the components of the union of *disjoint* polyhedra equivalent * to the original non-convex domain. See cloog_loop_add_disjoint comments * for more details. * - September 16th 2005: first version. */ CloogLoop * cloog_loop_disjoint(CloogLoop * loop) { CloogLoop *res=NULL, * now=NULL, * next ; /* Because this is often the case, don't waste time ! */ if (loop && !loop->next && cloog_domain_isconvex(loop->domain)) return loop ; while (loop != NULL) { next = loop->next ; loop->next = NULL ; cloog_loop_add_disjoint(&res,&now,loop) ; loop = next ; } return res ; } /** * cloog_loop_restrict function: * This function returns the (loop) in the context of (context): it makes the * intersection between the (loop) domain and the (context), then it returns * a pointer to a new loop, with this intersection as domain. ** * - October 27th 2001: first version. * - June 15th 2005: a memory leak fixed (domain was not freed when empty). * - June 22nd 2005: Adaptation for GMP. */ CloogLoop *cloog_loop_restrict(CloogLoop *loop, CloogDomain *context) { int new_dimension ; CloogDomain * domain, * extended_context, * new_domain ; CloogLoop * new_loop ; domain = loop->domain ; if (cloog_domain_dimension(domain) > cloog_domain_dimension(context)) { new_dimension = cloog_domain_dimension(domain); extended_context = cloog_domain_extend(context, new_dimension); new_domain = cloog_domain_intersection(extended_context,loop->domain) ; cloog_domain_free(extended_context) ; } else new_domain = cloog_domain_intersection(context,loop->domain) ; if (cloog_domain_isempty(new_domain)) { cloog_domain_free(new_domain) ; return(NULL) ; } else { new_loop = cloog_loop_alloc(loop->state, new_domain, 0, NULL, loop->block, loop->inner, NULL); return(new_loop) ; } } /** * Call cloog_loop_restrict on each loop in the list "loop" and return * the concatenated result. */ CloogLoop *cloog_loop_restrict_all(CloogLoop *loop, CloogDomain *context) { CloogLoop *next; CloogLoop *res = NULL; CloogLoop **res_next = &res; for (; loop; loop = next) { next = loop->next; *res_next = cloog_loop_restrict(loop, context); if (*res_next) { res_next = &(*res_next)->next; cloog_loop_free_parts(loop, 1, 0, 0, 0); } else { loop->next = NULL; cloog_loop_free(loop); } } return res; } /** * Restrict the domains of the inner loops of each loop l in the given * list of loops to the domain of the loop l. If the domains of all * inner loops of a given loop l turn out to be empty, then remove l * from the list. */ CloogLoop *cloog_loop_restrict_inner(CloogLoop *loop) { CloogLoop *next; CloogLoop *res; CloogLoop **res_next = &res; for (; loop; loop = next) { next = loop->next; loop->inner = cloog_loop_restrict_all(loop->inner, loop->domain); if (loop->inner) { *res_next = loop; res_next = &(*res_next)->next; } else { loop->next = NULL; cloog_loop_free(loop); } } *res_next = NULL; return res; } /** * cloog_loop_project function: * This function returns the projection of (loop) on the (level) first * dimensions (outer loops). It makes the projection of the (loop) domain, * then it returns a pointer to a new loop, with this projection as domain. ** * - October 27th 2001: first version. * - July 3rd->11th 2003: memory leaks hunt and correction. * - June 22nd 2005: Adaptation for GMP. */ CloogLoop * cloog_loop_project(CloogLoop * loop, int level) { CloogDomain * new_domain ; CloogLoop * new_loop, * copy ; copy = cloog_loop_alloc(loop->state, loop->domain, loop->otl, loop->stride, loop->block, loop->inner, NULL); if (cloog_domain_dimension(loop->domain) == level) new_domain = cloog_domain_copy(loop->domain) ; else new_domain = cloog_domain_project(loop->domain, level); new_loop = cloog_loop_alloc(loop->state, new_domain, 0, NULL, NULL, copy, NULL); return(new_loop) ; } /** * Call cloog_loop_project on each loop in the list "loop" and return * the concatenated result. */ CloogLoop *cloog_loop_project_all(CloogLoop *loop, int level) { CloogLoop *next; CloogLoop *res = NULL; CloogLoop **res_next = &res; for (; loop; loop = next) { next = loop->next; *res_next = cloog_loop_project(loop, level); res_next = &(*res_next)->next; cloog_loop_free_parts(loop, 0, 0, 0, 0); } return res; } /** * cloog_loop_concat function: * This function returns a pointer to the concatenation of the * CloogLoop lists given as input. * - October 28th 2001: first version. */ CloogLoop * cloog_loop_concat(CloogLoop * a, CloogLoop * b) { CloogLoop * loop, * temp ; loop = a ; temp = loop ; if (loop != NULL) { while (temp->next != NULL) temp = temp->next ; temp->next = b ; } else loop = b ; return(loop) ; } /** * cloog_loop_combine: * Combine consecutive loops with identical domains into * a single loop with the concatenation of their inner loops * as inner loop. */ CloogLoop *cloog_loop_combine(CloogLoop *loop) { CloogLoop *first, *second; for (first = loop; first; first = first->next) { while (first->next) { if (!cloog_domain_lazy_equal(first->domain, first->next->domain)) break; second = first->next; first->inner = cloog_loop_concat(first->inner, second->inner); first->next = second->next; cloog_loop_free_parts(second, 1, 0, 0, 0); } } return loop; } /** * Remove loops from list that have an empty domain. */ CloogLoop *cloog_loop_remove_empty_domain_loops(CloogLoop *loop) { CloogLoop *l, *res, *next, **res_next; res = NULL; res_next = &res; for (l = loop; l; l = next) { next = l->next; if (cloog_domain_isempty(l->domain)) cloog_loop_free_parts(l, 1, 1, 1, 0); else { *res_next = l; res_next = &(*res_next)->next; } } *res_next = NULL; return res; } CloogLoop *cloog_loop_decompose_inner(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims); /* For each loop with only one inner loop, replace the domain * of the loop with the projection of the domain of the inner * loop. To increase the number of loops with a single inner * we first decompose the inner loops into strongly connected * components. */ CloogLoop *cloog_loop_specialize(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims) { int dim; CloogDomain *domain; CloogLoop *l; loop = cloog_loop_decompose_inner(loop, level, scalar, scaldims, nb_scattdims); for (l = loop; l; l = l->next) { if (l->inner->next) continue; if (!cloog_domain_isconvex(l->inner->domain)) continue; dim = cloog_domain_dimension(l->domain); domain = cloog_domain_project(l->inner->domain, dim); if (cloog_domain_isconvex(domain)) { cloog_domain_free(l->domain); l->domain = domain; } else { cloog_domain_free(domain); } } return cloog_loop_remove_empty_domain_loops(loop); } /* For each loop with only one inner loop, propagate the bounds from * the inner loop domain to the outer loop domain. This is especially * useful if the inner loop domain has a non-trivial stride which * results in an update of the lower bound. */ CloogLoop *cloog_loop_propagate_lower_bound(CloogLoop *loop, int level) { int dim; CloogDomain *domain, *t; CloogLoop *l; for (l = loop; l; l = l->next) { if (l->inner->next) continue; if (!cloog_domain_isconvex(l->inner->domain)) continue; dim = cloog_domain_dimension(l->domain); domain = cloog_domain_project(l->inner->domain, dim); if (cloog_domain_isconvex(domain)) { t = cloog_domain_intersection(domain, l->domain); cloog_domain_free(l->domain); l->domain = t; } cloog_domain_free(domain); } return loop; } /** * cloog_loop_separate function: * This function implements the Quillere algorithm for separation of multiple * loops: for a given set of polyhedra (loop), it computes a set of disjoint * polyhedra such that the unions of these sets are equal, and returns this set. * - October 28th 2001: first version. * - November 14th 2001: elimination of some unused blocks. * - August 13th 2002: (debug) in the case of union of polyhedra for one * loop, redundant constraints are fired. * - July 3rd->11th 2003: memory leaks hunt and correction. * - June 22nd 2005: Adaptation for GMP. * - October 16th 2005: Removal of the non-shared constraint elimination when * there is only one loop in the list (seems to work * without now, DomainSimplify may have been improved). * The problem was visible with test/iftest2.cloog. */ CloogLoop * cloog_loop_separate(CloogLoop * loop) { int lazy_equal=0, disjoint = 0; CloogLoop * new_loop, * new_inner, * res, * now, * temp, * Q, * inner, * old /*, * previous, * next*/ ; CloogDomain *UQ, *domain; if (loop == NULL) return NULL ; loop = cloog_loop_combine(loop); if (loop->next == NULL) return cloog_loop_disjoint(loop) ; UQ = cloog_domain_copy(loop->domain) ; domain = cloog_domain_copy(loop->domain) ; res = cloog_loop_alloc(loop->state, domain, 0, NULL, loop->block, loop->inner, NULL); old = loop ; while((loop = loop->next) != NULL) { temp = NULL ; /* For all Q, add Q-loop associated with the blocks of Q alone, * and Q inter loop associated with the blocks of Q and loop. */ for (Q = res; Q; Q = Q->next) { /* Add (Q inter loop). */ if ((disjoint = cloog_domain_lazy_disjoint(Q->domain,loop->domain))) domain = NULL ; else { if ((lazy_equal = cloog_domain_lazy_equal(Q->domain,loop->domain))) domain = cloog_domain_copy(Q->domain) ; else domain = cloog_domain_intersection(Q->domain,loop->domain) ; if (!cloog_domain_isempty(domain)) { new_inner = cloog_loop_concat(cloog_loop_copy(Q->inner), cloog_loop_copy(loop->inner)) ; new_loop = cloog_loop_alloc(loop->state, domain, 0, NULL, NULL, new_inner, NULL); cloog_loop_add_disjoint(&temp,&now,new_loop) ; } else { disjoint = 1; cloog_domain_free(domain); } } /* Add (Q - loop). */ if (disjoint) domain = cloog_domain_copy(Q->domain) ; else { if (lazy_equal) domain = cloog_domain_empty(Q->domain); else domain = cloog_domain_difference(Q->domain,loop->domain) ; } if (!cloog_domain_isempty(domain)) { new_loop = cloog_loop_alloc(loop->state, domain, 0, NULL, NULL, Q->inner, NULL); cloog_loop_add_disjoint(&temp,&now,new_loop) ; } else { cloog_domain_free(domain) ; /* If Q->inner is no more useful, we can free it. */ inner = Q->inner ; Q->inner = NULL ; cloog_loop_free(inner) ; } } /* Add loop-UQ associated with the blocks of loop alone.*/ if (cloog_domain_lazy_disjoint(loop->domain,UQ)) domain = cloog_domain_copy(loop->domain) ; else { if (cloog_domain_lazy_equal(loop->domain,UQ)) domain = cloog_domain_empty(UQ); else domain = cloog_domain_difference(loop->domain,UQ) ; } if (!cloog_domain_isempty(domain)) { new_loop = cloog_loop_alloc(loop->state, domain, 0, NULL, NULL, loop->inner, NULL); cloog_loop_add_disjoint(&temp,&now,new_loop) ; } else { cloog_domain_free(domain) ; /* If loop->inner is no more useful, we can free it. */ cloog_loop_free(loop->inner) ; } loop->inner = NULL ; if (loop->next != NULL) UQ = cloog_domain_union(UQ, cloog_domain_copy(loop->domain)); else cloog_domain_free(UQ); cloog_loop_free_parts(res,1,0,0,1) ; res = temp ; } cloog_loop_free_parts(old,1,0,0,1) ; return(res) ; } static CloogDomain *bounding_domain(CloogDomain *dom, CloogOptions *options) { if (options->sh) return cloog_domain_simple_convex(dom); else return cloog_domain_convex(dom); } /** * cloog_loop_merge function: * This function is the 'soft' version of loop_separate if we are looking for * a code much simpler (and less efficicient). This function returns the new * CloogLoop list. * - October 29th 2001: first version. * - July 3rd->11th 2003: memory leaks hunt and correction. * - June 22nd 2005: Adaptation for GMP. */ CloogLoop *cloog_loop_merge(CloogLoop *loop, int level, CloogOptions *options) { CloogLoop *res, *new_inner, *old; CloogDomain *new_domain, *temp; if (loop == NULL) return loop; if (loop->next == NULL && cloog_domain_isconvex(loop->domain)) return loop; old = loop; temp = loop->domain; loop->domain = NULL; new_inner = loop->inner; for (loop = loop->next; loop; loop = loop->next) { temp = cloog_domain_union(temp, loop->domain); loop->domain = NULL; new_inner = cloog_loop_concat(new_inner, loop->inner); } new_domain = bounding_domain(temp, options); if (level > 0 && !cloog_domain_is_bounded(new_domain, level) && cloog_domain_is_bounded(temp, level)) { CloogDomain *splitter, *t2; cloog_domain_free(new_domain); splitter = cloog_domain_bound_splitter(temp, level); res = NULL; while (!cloog_domain_isconvex(splitter)) { CloogDomain *first, *rest; first = cloog_domain_cut_first(splitter, &rest); splitter = rest; t2 = cloog_domain_intersection(first, temp); cloog_domain_free(first); new_domain = bounding_domain(t2, options); cloog_domain_free(t2); if (cloog_domain_isempty(new_domain)) { cloog_domain_free(new_domain); continue; } res = cloog_loop_alloc(old->state, new_domain, 0, NULL, NULL, cloog_loop_copy(new_inner), res); } t2 = cloog_domain_intersection(splitter, temp); cloog_domain_free(splitter); new_domain = bounding_domain(t2, options); cloog_domain_free(t2); if (cloog_domain_isempty(new_domain)) { cloog_domain_free(new_domain); cloog_loop_free(new_inner); } else res = cloog_loop_alloc(old->state, new_domain, 0, NULL, NULL, new_inner, res); } else { res = cloog_loop_alloc(old->state, new_domain, 0, NULL, NULL, new_inner, NULL); } cloog_domain_free(temp); cloog_loop_free_parts(old, 0, 0, 0, 1); return res; } static int cloog_loop_count(CloogLoop *loop) { int nb_loops; for (nb_loops = 0; loop; loop = loop->next) nb_loops++; return nb_loops; } /** * cloog_loop_sort function: * Adaptation from LoopGen 0.4 by F. Quillere. This function sorts a list of * parameterized disjoint polyhedra, in order to not have lexicographic order * violation (see Quillere paper). * - September 16th 2005: inclusion of cloog_loop_number (October 29th 2001). */ CloogLoop *cloog_loop_sort(CloogLoop *loop, int level) { CloogLoop *res, *now, **loop_array; CloogDomain **doms; int i, nb_loops=0, * permut ; /* There is no need to sort the parameter domains. */ if (!level) return loop; /* We will need to know how many loops are in the list. */ nb_loops = cloog_loop_count(loop); /* If there is only one loop, it's the end. */ if (nb_loops == 1) return(loop) ; /* We have to allocate memory for some useful components: * - loop_array: the loop array, * - doms: the array of domains to sort, * - permut: will give us a possible sort (maybe not the only one). */ loop_array = (CloogLoop **)malloc(nb_loops*sizeof(CloogLoop *)) ; doms = (CloogDomain **)malloc(nb_loops*sizeof(CloogDomain *)); permut = (int *)malloc(nb_loops*sizeof(int)) ; /* We fill up the loop and domain arrays. */ for (i=0;inext) { loop_array[i] = loop ; doms[i] = loop_array[i]->domain; } /* cloog_domain_sort will fill up permut. */ cloog_domain_sort(doms, nb_loops, level, permut); /* With permut and loop_array we build the sorted list. */ res = NULL ; for (i=0;inext = NULL ; cloog_loop_add(&res,&now,loop_array[permut[i]-1]) ; } free(permut) ; free(doms); free(loop_array) ; return res; } /** * cloog_loop_nest function: * This function changes the loop list in such a way that we have no more than * one dimension added by level. It returns an equivalent loop list with * this property. * - October 29th 2001: first version. * - July 3rd->11th 2003: memory leaks hunt and correction. * - June 22nd 2005: Adaptation for GMP. * - November 21th 2005: (debug) now OK when cloog_loop_restrict returns NULL. */ CloogLoop *cloog_loop_nest(CloogLoop *loop, CloogDomain *context, int level) { int l ; CloogLoop * p, * temp, * res, * now, * next ; CloogDomain * new_domain ; loop = cloog_loop_disjoint(loop); res = NULL ; /* Each domain is changed by its intersection with the context. */ while (loop != NULL) { p = cloog_loop_restrict(loop, context); next = loop->next ; if (p != NULL) { cloog_loop_free_parts(loop,1,0,0,0) ; temp = cloog_loop_alloc(p->state, p->domain, 0, NULL, p->block, p->inner, NULL); /* If the intersection dimension is too big, we make projections smaller * and smaller, and each projection includes the preceding projection * (thus, in the target list, dimensions are added one by one). */ if (cloog_domain_dimension(p->domain) >= level) for (l = cloog_domain_dimension(p->domain); l >= level; l--) { new_domain = cloog_domain_project(p->domain, l); temp = cloog_loop_alloc(p->state, new_domain, 0, NULL, NULL, temp, NULL); } /* p is no more useful (but its content yes !). */ cloog_loop_free_parts(p,0,0,0,0) ; cloog_loop_add(&res,&now,temp) ; } else cloog_loop_free_parts(loop,1,1,1,0) ; loop = next ; } return(res) ; } /* Check if the domains of the inner loops impose a stride constraint * on the given level. * The core of the search is implemented in cloog_domain_list_stride. * Here, we simply construct a list of domains to pass to this function * and if a stride is found, we adjust the lower bounds by calling * cloog_domain_stride_lower_bound. */ static int cloog_loop_variable_offset_stride(CloogLoop *loop, int level) { CloogDomainList *list = NULL; CloogLoop *inner; CloogStride *stride; for (inner = loop->inner; inner; inner = inner->next) { CloogDomainList *entry = ALLOC(CloogDomainList); entry->domain = cloog_domain_copy(inner->domain); entry->next = list; list = entry; } stride = cloog_domain_list_stride(list, level); cloog_domain_list_free(list); if (!stride) return 0; loop->stride = stride; loop->domain = cloog_domain_stride_lower_bound(loop->domain, level, stride); return 1; } /** * cloog_loop_stride function: * This function will find the stride of a loop for the iterator at the column * number 'level' in the constraint matrix. It will update the lower bound of * the iterator accordingly. Basically, the function will try to find in the * inner loops a common condition on this iterator for the inner loop iterators * to be integral. For instance, let us consider a loop with the iterator i, * the iteration domain -4<=i<=n, and its two inner loops with the iterator j. * The first inner loop has the constraint 3j=i, and the second one has the * constraint 6j=i. Then the common constraint on i for j to be integral is * i%3=0, the stride for i is 3. Lastly, we have to find the new lower bound * for i: the first value satisfying the common constraint: -3. At the end, the * iteration domain for i is -3<=i<=n and the stride for i is 3. * * The algorithm implemented in this function only allows for strides * on loops with a lower bound that has a constant remainder on division * by the stride. Before initiating this procedure, we first check * if we can find a stride with a lower bound with a variable offset in * cloog_loop_variable_offset_stride. * * - loop is the loop including the iteration domain of the considered iterator, * - level is the column number of the iterator in the matrix of contraints. ** * - June 29th 2003: first version (work in progress since June 26th 2003). * - July 14th 2003: simpler version. * - June 22nd 2005: Adaptation for GMP (from S. Verdoolaege's 0.12.1 version). */ void cloog_loop_stride(CloogLoop * loop, int level) { int first_search ; cloog_int_t stride, ref_offset, offset, potential; CloogLoop * inner ; if (!cloog_domain_can_stride(loop->domain, level)) return; if (cloog_loop_variable_offset_stride(loop, level)) return; cloog_int_init(stride); cloog_int_init(ref_offset); cloog_int_init(offset); cloog_int_init(potential); cloog_int_set_si(ref_offset, 0); cloog_int_set_si(offset, 0); /* Default stride. */ cloog_int_set_si(stride, 1); first_search = 1 ; inner = loop->inner ; while (inner != NULL) { /* If the minimun stride has not been found yet, find the stride. */ if ((first_search) || (!cloog_int_is_one(stride))) { cloog_domain_stride(inner->domain, level, &potential, &offset); if (!cloog_int_is_one(potential) && (!first_search)) { /* Offsets must be the same for common stride. */ cloog_int_gcd(stride, potential, stride); if (!cloog_int_is_zero(stride)) { cloog_int_fdiv_r(offset, offset, stride); cloog_int_fdiv_r(ref_offset, ref_offset, stride); } if (cloog_int_ne(offset,ref_offset)) cloog_int_set_si(stride, 1); } else { cloog_int_set(stride, potential); cloog_int_set(ref_offset, offset); } first_search = 0 ; } inner = inner->next ; } if (cloog_int_is_zero(stride)) cloog_int_set_si(stride, 1); /* Update the values if necessary. */ if (!cloog_int_is_one(stride)) { /* Update the stride value. */ if (!cloog_int_is_zero(offset)) cloog_int_sub(offset, stride, offset); loop->stride = cloog_stride_alloc(stride, offset); loop->domain = cloog_domain_stride_lower_bound(loop->domain, level, loop->stride); } cloog_int_clear(stride); cloog_int_clear(ref_offset); cloog_int_clear(offset); cloog_int_clear(potential); } void cloog_loop_otl(CloogLoop *loop, int level) { if (cloog_domain_is_otl(loop->domain, level)) loop->otl = 1; } /** * cloog_loop_stop function: * This function implements the 'stop' option : each domain of each loop * in the list 'loop' is replaced by 'context'. 'context' should be the * domain of the outer loop. By using this method, there are no more dimensions * to scan and the simplification step will automaticaly remove the domains * since they are the same as the corresponding contexts. The effect of this * function is to stop the code generation at the level this function is called, * the resulting code do not consider the next dimensions. * - January 11th 2005: first version. */ CloogLoop * cloog_loop_stop(CloogLoop * loop, CloogDomain * context) { if (loop == NULL) return NULL ; else { cloog_domain_free(loop->domain) ; loop->domain = cloog_domain_copy(context) ; loop->next = cloog_loop_stop(loop->next, context) ; } return loop ; } static int level_is_constant(int level, int scalar, int *scaldims, int nb_scattdims) { return level && (level+scalar <= nb_scattdims) && (scaldims[level+scalar-1]); } /** * Compare the constant dimensions of loops 'l1' and 'l2' starting at 'scalar' * and return -1 if the vector of constant dimensions of 'l1' is smaller * than that of 'l2', 0 if they are the same and +1 if that of 'l1' is * greater than that of 'l2'. * This function should be called on the innermost loop (the loop * containing a block). * \param l1 Loop to be compared with l2. * \param l2 Loop to be compared with l1. * \param level Current non-scalar dimension. * \param scaldims Boolean array saying whether a dimension is scalar or not. * \param nb_scattdims Size of the scaldims array. * \param scalar Current scalar dimension. * \return -1 if (l1 < l2), 0 if (l1 == l2) and +1 if (l1 > l2) */ int cloog_loop_constant_cmp(CloogLoop *l1, CloogLoop *l2, int level, int *scaldims, int nb_scattdims, int scalar) { CloogBlock *b1, *b2; b1 = l1->block; b2 = l2->block; while (level_is_constant(level, scalar, scaldims, nb_scattdims)) { int cmp = cloog_int_cmp(b1->scaldims[scalar], b2->scaldims[scalar]); if (cmp) return cmp; scalar++; } return 0; } /** * cloog_loop_scalar_gt function: * This function returns 1 if loop 'l1' is greater than loop 'l2' for the * scalar dimension vector that begins at dimension 'scalar', 0 otherwise. What * we want to know is whether a loop is scheduled before another one or not. * This function solves the problem when the considered dimension for scheduling * is a scalar dimension. Since there may be a succession of scalar dimensions, * this function will reason about the vector of scalar dimension that begins * at dimension 'level+scalar' and finish to the first non-scalar dimension. * \param l1 Loop to be compared with l2. * \param l2 Loop to be compared with l1. * \param level Current non-scalar dimension. * \param scaldims Boolean array saying whether a dimension is scalar or not. * \param nb_scattdims Size of the scaldims array. * \param scalar Current scalar dimension. * \return 1 if (l1 > l2), 0 otherwise. ** * - September 9th 2005: first version. * - October 15nd 2007: now "greater than" instead of "greater or equal". */ int cloog_loop_scalar_gt(l1, l2, level, scaldims, nb_scattdims, scalar) CloogLoop * l1, * l2 ; int level, * scaldims, nb_scattdims, scalar ; { return cloog_loop_constant_cmp(l1, l2, level, scaldims, nb_scattdims, scalar) > 0; } /** * cloog_loop_scalar_eq function: * This function returns 1 if loop 'l1' is equal to loop 'l2' for the scalar * dimension vector that begins at dimension 'scalar', 0 otherwise. What we want * to know is whether two loops are scheduled for the same time or not. * This function solves the problem when the considered dimension for scheduling * is a scalar dimension. Since there may be a succession of scalar dimensions, * this function will reason about the vector of scalar dimension that begins * at dimension 'level+scalar' and finish to the first non-scalar dimension. * - l1 and l2 are the loops to compare, * - level is the current non-scalar dimension, * - scaldims is the boolean array saying whether a dimension is scalar or not, * - nb_scattdims is the size of the scaldims array, * - scalar is the current scalar dimension. ** * - September 9th 2005 : first version. */ int cloog_loop_scalar_eq(l1, l2, level, scaldims, nb_scattdims, scalar) CloogLoop * l1, * l2 ; int level, * scaldims, nb_scattdims, scalar ; { return cloog_loop_constant_cmp(l1, l2, level, scaldims, nb_scattdims, scalar) == 0; } /** * cloog_loop_scalar_sort function: * This function sorts a linked list of loops (loop) with respect to the * scalar dimension vector that begins at dimension 'scalar'. Since there may * be a succession of scalar dimensions, this function will reason about the * vector of scalar dimension that begins at dimension 'level+scalar' and * finish to the first non-scalar dimension. * \param loop Loop list to sort. * \param level Current non-scalar dimension. * \param scaldims Boolean array saying whether a dimension is scalar or not. * \param nb_scattdims Size of the scaldims array. * \param scalar Current scalar dimension. * \return A pointer to the sorted list. ** * - July 2nd 2005: first developments. * - September 2nd 2005: first version. * - October 15nd 2007: complete rewrite to remove bugs, now a bubble sort. */ CloogLoop * cloog_loop_scalar_sort(loop, level, scaldims, nb_scattdims, scalar) CloogLoop * loop ; int level, * scaldims, nb_scattdims, scalar ; { int ok ; CloogLoop **current; do { ok = 1; for (current = &loop; (*current)->next; current = &(*current)->next) { CloogLoop *next = (*current)->next; if (cloog_loop_scalar_gt(*current,next,level,scaldims,nb_scattdims,scalar)) { ok = 0; (*current)->next = next->next; next->next = *current; *current = next; } } } while (!ok); return loop ; } /** * cloog_loop_generate_backtrack function: * adaptation from LoopGen 0.4 by F. Quillere. This function implements the * backtrack of the Quillere et al. algorithm (see the Quillere paper). * It eliminates unused iterations of the current level for the new one. See the * example called linearity-1-1 example with and without this part for an idea. * - October 26th 2001: first version in cloog_loop_generate_general. * - July 31th 2002: (debug) no more parasite loops (REALLY hard !). * - October 30th 2005: extraction from cloog_loop_generate_general. */ CloogLoop *cloog_loop_generate_backtrack(CloogLoop *loop, int level, CloogOptions *options) { CloogDomain * domain ; CloogLoop * now, * now2, * next, * next2, * end, * temp, * l, * inner, * new_loop ; temp = loop ; loop = NULL ; while (temp != NULL) { l = NULL ; inner = temp->inner ; while (inner != NULL) { next = inner->next ; /* This 'if' and its first part is the debug of july 31th 2002. */ if (inner->block != NULL) { end = cloog_loop_alloc(temp->state, inner->domain, 0, NULL, inner->block, NULL, NULL); domain = cloog_domain_copy(temp->domain) ; new_loop = cloog_loop_alloc(temp->state, domain, 0, NULL, NULL, end, NULL); } else new_loop = cloog_loop_project(inner, level); cloog_loop_free_parts(inner,0,0,0,0) ; cloog_loop_add(&l,&now2,new_loop) ; inner = next ; } temp->inner = NULL ; if (l != NULL) { l = cloog_loop_separate(l) ; l = cloog_loop_sort(l, level); while (l != NULL) { l->stride = cloog_stride_copy(l->stride); cloog_loop_add(&loop,&now,l) ; l = l->next ; } } next2 = temp->next ; cloog_loop_free_parts(temp,1,0,0,0) ; temp = next2 ; } return loop ; } /** * Return 1 if we need to continue recursing to the specified level. */ int cloog_loop_more(CloogLoop *loop, int level, int scalar, int nb_scattdims) { return level + scalar <= nb_scattdims || cloog_domain_dimension(loop->domain) >= level; } /** * Return 1 if the domains of all loops in the given linked list * have a fixed value at the given level. * In principle, there would be no need to check that the fixed value is * the same for each of these loops because this function is only * called on a component. However, not all backends perform a proper * decomposition into components. */ int cloog_loop_is_constant(CloogLoop *loop, int level) { cloog_int_t c1, c2; int r = 1; cloog_int_init(c1); cloog_int_init(c2); if (!cloog_domain_lazy_isconstant(loop->domain, level - 1, &c1)) r = 0; for (loop = loop->next; r && loop; loop = loop->next) { if (!cloog_domain_lazy_isconstant(loop->domain, level - 1, &c2)) r = 0; else if (cloog_int_ne(c1, c2)) r = 0; } cloog_int_clear(c1); cloog_int_clear(c2); return r; } /** * Assuming all domains in the given linked list of loop * have a fixed values at level, return a single loop with * a domain corresponding to this fixed value and with as * list of inner loops the concatenation of all inner loops * in the original list. */ CloogLoop *cloog_loop_constant(CloogLoop *loop, int level) { CloogLoop *res, *inner, *tmp; CloogDomain *domain, *t; if (!loop) return loop; inner = loop->inner; domain = loop->domain; for (tmp = loop->next; tmp; tmp = tmp->next) { inner = cloog_loop_concat(inner, tmp->inner); domain = cloog_domain_union(domain, tmp->domain); } domain = cloog_domain_simple_convex(t = domain); cloog_domain_free(t); res = cloog_loop_alloc(loop->state, domain, 0, NULL, NULL, inner, NULL); cloog_loop_free_parts(loop, 0, 0, 0, 1); return res; } /* Unroll the given loop at the given level, provided it is allowed * by cloog_domain_can_unroll. * If so, we return a list of loops, one for each iteration of the original * loop. Otherwise, we simply return the original loop. */ static CloogLoop *loop_unroll(CloogLoop *loop, int level) { int can_unroll; cloog_int_t i; cloog_int_t n; CloogConstraint *lb; CloogLoop *res = NULL; CloogLoop **next_res = &res; CloogDomain *domain; CloogLoop *inner; cloog_int_init(n); can_unroll = cloog_domain_can_unroll(loop->domain, level, &n, &lb); if (!can_unroll) { cloog_int_clear(n); return loop; } cloog_int_init(i); for (cloog_int_set_si(i, 0); cloog_int_lt(i, n); cloog_int_add_ui(i, i, 1)) { domain = cloog_domain_copy(loop->domain); domain = cloog_domain_fixed_offset(domain, level, lb, i); inner = cloog_loop_copy(loop->inner); inner = cloog_loop_restrict_all(inner, domain); if (!inner) { cloog_domain_free(domain); continue; } *next_res = cloog_loop_alloc(loop->state, domain, 1, NULL, NULL, inner, NULL); next_res = &(*next_res)->next; } cloog_int_clear(i); cloog_int_clear(n); cloog_constraint_release(lb); cloog_loop_free(loop); return res; } /* Unroll all loops in the given list at the given level, provided * they can be unrolled. */ CloogLoop *cloog_loop_unroll(CloogLoop *loop, int level) { CloogLoop *now, *next; CloogLoop *res = NULL; CloogLoop **next_res = &res; for (now = loop; now; now = next) { next = now->next; now->next = NULL; *next_res = loop_unroll(now, level); while (*next_res) next_res = &(*next_res)->next; } return res; } CloogLoop *cloog_loop_generate_restricted_or_stop(CloogLoop *loop, CloogDomain *context, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options); CloogLoop *cloog_loop_recurse(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, int constant, CloogOptions *options); /** * Recurse on the inner loops of the given single loop. * * - loop is the loop for which we have to generate scanning code, * - level is the current non-scalar dimension, * - scalar is the current scalar dimension, * - scaldims is the boolean array saying whether a dimension is scalar or not, * - nb_scattdims is the size of the scaldims array, * - constant is true if the loop is known to be executed at most once * - options are the general code generation options. */ static CloogLoop *loop_recurse(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, int constant, CloogOptions *options) { CloogLoop *inner, *into, *end, *next, *l, *now; CloogDomain *domain; if (level && options->strides && !constant) cloog_loop_stride(loop, level); if (!constant && options->first_unroll >= 0 && level + scalar >= options->first_unroll) { loop = cloog_loop_unroll(loop, level); if (loop->next) return cloog_loop_recurse(loop, level, scalar, scaldims, nb_scattdims, 1, options); } if (level && options->otl) cloog_loop_otl(loop, level); inner = loop->inner; domain = cloog_domain_copy(loop->domain); domain = cloog_domain_add_stride_constraint(domain, loop->stride); into = NULL ; while (inner != NULL) { /* 4b. -ced- recurse for each sub-list of non terminal loops. */ if (cloog_loop_more(inner, level + 1, scalar, nb_scattdims)) { end = inner; while ((end->next != NULL) && cloog_loop_more(end->next, level + 1, scalar, nb_scattdims)) end = end->next ; next = end->next ; end->next = NULL ; l = cloog_loop_generate_restricted_or_stop(inner, domain, level + 1, scalar, scaldims, nb_scattdims, options); if (l != NULL) cloog_loop_add_list(&into,&now,l) ; inner = next ; } else { cloog_loop_add(&into,&now,inner) ; inner = inner->next ; } } cloog_domain_free(domain); loop->inner = into; return loop; } /** * Recurse on the inner loops of each of the loops in the loop list. * * - loop is the loop list for which we have to generate scanning code, * - level is the current non-scalar dimension, * - scalar is the current scalar dimension, * - scaldims is the boolean array saying whether a dimension is scalar or not, * - nb_scattdims is the size of the scaldims array, * - constant is true if the loop is known to be executed at most once * - options are the general code generation options. */ CloogLoop *cloog_loop_recurse(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, int constant, CloogOptions *options) { CloogLoop *now, *next; CloogLoop *res = NULL; CloogLoop **next_res = &res; for (now = loop; now; now = next) { next = now->next; now->next = NULL; *next_res = loop_recurse(now, level, scalar, scaldims, nb_scattdims, constant, options); while (*next_res) next_res = &(*next_res)->next; } return res; } /* Get the max across all 'first' depths for statements in this * stmt list, and the max across all 'last' depths */ void cloog_statement_get_fl(CloogStatement *s, int *f, int *l, CloogOptions *options) { if (s == NULL) return; int fs, ls; if (options->fs != NULL && options->ls != NULL) { fs = options->fs[s->number-1]; ls = options->ls[s->number-1]; *f = (fs > *f)? fs: *f; *l = (ls > *l)? ls: *l; }else{ *f = -1; *l = -1; } cloog_statement_get_fl(s->next, f, l, options); } /* Get the max across all 'first' depths for statements under * this loop, and the max across all 'last' depths */ void cloog_loop_get_fl(CloogLoop *loop, int *f, int *l, CloogOptions *options) { if (loop == NULL) return; CloogBlock *block = loop->block; if (block != NULL && block->statement != NULL) { cloog_statement_get_fl(block->statement, f, l, options); } cloog_loop_get_fl(loop->inner, f, l, options); cloog_loop_get_fl(loop->next, f, l, options); } /** * cloog_loop_generate_general function: * Adaptation from LoopGen 0.4 by F. Quillere. This function implements the * Quillere algorithm for polyhedron scanning from step 3 to 5. * (see the Quillere paper). * - loop is the loop for which we have to generate a scanning code, * - level is the current non-scalar dimension, * - scalar is the current scalar dimension, * - scaldims is the boolean array saying whether a dimension is scalar or not, * - nb_scattdims is the size of the scaldims array, * - options are the general code generation options. ** * - October 26th 2001: first version. * - July 3rd->11th 2003: memory leaks hunt and correction. * - June 22nd 2005: Adaptation for GMP. * - September 2nd 2005: The function have been cutted out in two pieces: * cloog_loop_generate and this one, in order to handle * the scalar dimension case more efficiently with * cloog_loop_generate_scalar. * - November 15th 2005: (debug) the result of the cloog_loop_generate call may * be a list of polyhedra (especially if stop option is * used): cloog_loop_add_list instead of cloog_loop_add. * - May 31, 2012: statement-wise first and last depth for loop separation * if options->fs and option->ls arrays are set, it will override what has * been supplied via "-f/-l" * */ CloogLoop *cloog_loop_generate_general(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options) { CloogLoop *res, *now, *temp, *l, *new_loop, *next; int separate = 0; int constant = 0; int first = -1; int last = -1; now = NULL; /* Get the -f and -l for each statement */ cloog_loop_get_fl(loop, &first, &last, options); /* If stmt-wise options are not set or set inconsistently, use -f/-l ones globally */ if (first <= 0 || last < first) { first = options->f; last = options->l; } /* 3. Separate all projections into disjoint polyhedra. */ if (level > 0 && cloog_loop_is_constant(loop, level)) { res = cloog_loop_constant(loop, level); constant = 1; }else if ((first > level+scalar) || (first < 0)) { res = cloog_loop_merge(loop, level, options); }else{ res = cloog_loop_separate(loop); separate = 1; } /* 3b. -correction- sort the loops to determine their textual order. */ res = cloog_loop_sort(res, level); res = cloog_loop_restrict_inner(res); if (separate) res = cloog_loop_specialize(res, level, scalar, scaldims, nb_scattdims); /* 4. Recurse for each loop with the current domain as context. */ temp = res ; res = NULL ; if (!level || (level+scalar < last) || (last < 0)) res = cloog_loop_recurse(temp, level, scalar, scaldims, nb_scattdims, constant, options); else while (temp != NULL) { next = temp->next ; l = cloog_loop_nest(temp->inner, temp->domain, level+1); new_loop = cloog_loop_alloc(temp->state, temp->domain, 0, NULL, NULL, l, NULL); temp->inner = NULL ; temp->next = NULL ; cloog_loop_free_parts(temp,0,0,0,0) ; cloog_loop_add(&res,&now,new_loop) ; temp = next ; } if (options->strides) res = cloog_loop_propagate_lower_bound(res, level); /* 5. eliminate unused iterations of the current level for the new one. See * the example called linearity-1-1 example with and without this part * for an idea. */ if (options->backtrack && level && ((level+scalar < last) || (last < 0)) && ((first <= level+scalar) && !(first < 0))) res = cloog_loop_generate_backtrack(res, level, options); /* Pray for my new paper to be accepted somewhere since the following stuff * is really amazing :-) ! * Far long later: The paper has been accepted to PACT 2004 :-))). But there * are still some bugs and I have no time to fix them. Thus now you have to * pray for me to get an academic position for that really amazing stuff :-) ! * Later again: OK, I get my academic position, but still I have not enough * time to fix and clean this part... Pray again :-) !!! */ /* res = cloog_loop_unisolate(res,level) ;*/ return(res) ; } CloogLoop *cloog_loop_generate_restricted(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options); /** * cloog_loop_generate_scalar function: * This function applies the simplified code generation scheme in the trivial * case of scalar dimensions. When dealing with scalar dimensions, there is * no need of costly polyhedral operations for separation or sorting: sorting * is a question of comparing scalar vectors and separation amounts to consider * only loops with the same scalar vector for the next step of the code * generation process. This function achieves the separation/sorting process * for the vector of scalar dimension that begins at dimension 'level+scalar' * and finish to the first non-scalar dimension. * - loop is the loop for which we have to generate a scanning code, * - level is the current non-scalar dimension, * - scalar is the current scalar dimension, * - scaldims is the boolean array saying whether a dimension is scalar or not, * - nb_scattdims is the size of the scaldims array, * - options are the general code generation options. ** * - September 2nd 2005: First version. */ CloogLoop *cloog_loop_generate_scalar(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options) { CloogLoop * res, * now, * temp, * l, * end, * next, * ref ; int scalar_new; /* We sort the loop list with respect to the current scalar vector. */ res = cloog_loop_scalar_sort(loop,level,scaldims,nb_scattdims,scalar) ; scalar_new = scalar + scaldims[level + scalar - 1]; temp = res ; res = NULL ; while (temp != NULL) { /* Then we will appy the general code generation process to each sub-list * of loops with the same scalar vector. */ end = temp ; ref = temp ; while((end->next != NULL) && cloog_loop_more(end->next, level, scalar_new, nb_scattdims) && cloog_loop_scalar_eq(ref,end->next,level,scaldims,nb_scattdims,scalar)) end = end->next ; next = end->next ; end->next = NULL ; /* For the next dimension, scalar value is updated by adding the scalar * vector size, which is stored at scaldims[level+scalar-1]. */ if (cloog_loop_more(temp, level, scalar_new, nb_scattdims)) { l = cloog_loop_generate_restricted(temp, level, scalar_new, scaldims, nb_scattdims, options); if (l != NULL) cloog_loop_add_list(&res, &now, l); } else cloog_loop_add(&res, &now, temp); temp = next ; } return res ; } /* Compare loop with the next loop based on their constant dimensions. * The result is < 0, == 0 or > 0 depending on whether the constant * dimensions of loop are lexicographically smaller, equal or greater * than those of loop->next. * If loop is the last in the list, then it is assumed to be smaller * than the "next" one. */ static int cloog_loop_next_scal_cmp(CloogLoop *loop) { int i; int nb_scaldims; if (!loop->next) return -1; nb_scaldims = loop->block->nb_scaldims; if (loop->next->block->nb_scaldims < nb_scaldims) nb_scaldims = loop->next->block->nb_scaldims; for (i = 0; i < nb_scaldims; ++i) { int cmp = cloog_int_cmp(loop->block->scaldims[i], loop->next->block->scaldims[i]); if (cmp) return cmp; } return loop->block->nb_scaldims - loop->next->block->nb_scaldims; } /* Check whether the globally constant dimensions of a and b * have the same value for all globally constant dimensions * that are situated before any (locally) non-constant dimension. */ static int cloog_loop_equal_prefix(CloogLoop *a, CloogLoop *b, int *scaldims, int nb_scattdims) { int i; int cst = 0; int dim = 0; for (i = 0; i < nb_scattdims; ++i) { if (!scaldims[i]) { dim++; continue; } if (!cloog_int_eq(a->block->scaldims[cst], b->block->scaldims[cst])) break; cst++; } for (i = i + 1; i < nb_scattdims; ++i) { if (scaldims[i]) continue; if (!cloog_domain_lazy_isconstant(a->domain, dim, NULL)) return 0; /* No need to check that dim is also constant in b and that the * constant values are equal. That will happen during the check * whether the two domains are equal. */ dim++; } return 1; } /* Try to block adjacent loops in the loop list "loop". * We only attempt blocking if the constant dimensions of the loops * in the least are (not necessarily strictly) increasing. * Then we look for a sublist such that the first (begin) has constant * dimensions strictly larger than the previous loop in the complete * list and such that the loop (end) after the last loop in the sublist * has constant dimensions strictly larger than the last loop in the sublist. * Furthermore, all loops in the sublist should have the same domain * (with globally constant dimensions removed) and the difference * (if any) in constant dimensions may only occur after all the * (locally) constant dimensions. * If we find such a sublist, then the blocks of all but the first * are merged into the block of the first. * * Note that this function can only be called before the global * blocklist has been created because it may otherwise modify and destroy * elements on that list. */ CloogLoop *cloog_loop_block(CloogLoop *loop, int *scaldims, int nb_scattdims) { CloogLoop *begin, *end, *l; int begin_after_previous; int end_after_previous; if (!loop->next) return loop; for (begin = loop; begin; begin = begin->next) { if (!begin->block || !begin->block->scaldims) return loop; if (cloog_loop_next_scal_cmp(begin) > 0) return loop; } begin_after_previous = 1; for (begin = loop; begin; begin = begin->next) { if (!begin_after_previous) { begin_after_previous = cloog_loop_next_scal_cmp(begin) < 0; continue; } end_after_previous = cloog_loop_next_scal_cmp(begin) < 0; for (end = begin->next; end; end = end->next) { if (!cloog_loop_equal_prefix(begin, end, scaldims, nb_scattdims)) break; if (!cloog_domain_lazy_equal(begin->domain, end->domain)) break; end_after_previous = cloog_loop_next_scal_cmp(end) < 0; } if (end != begin->next && end_after_previous) { for (l = begin->next; l != end; l = begin->next) { cloog_block_merge(begin->block, l->block); begin->next = l->next; cloog_loop_free_parts(l, 1, 0, 1, 0); } } begin_after_previous = cloog_loop_next_scal_cmp(begin) < 0; } return loop; } /** * Check whether for any fixed iteration of the outer loops, * there is an iteration of loop1 that is lexicographically greater * than an iteration of loop2. * Return 1 if there exists (or may exist) such a pair. * Return 0 if all iterations of loop1 are lexicographically smaller * than the iterations of loop2. * If no iteration is lexicographically greater, but if there are * iterations that are equal to iterations of loop2, then return "def". * This is useful for ensuring that such statements are not reordered. * Some users, including the test_run target in test, expect * the statements at a given point to be run in the original order. * Passing the value "0" for "def" would allow such statements to be reordered * and would allow for the detection of more components. */ int cloog_loop_follows(CloogLoop *loop1, CloogLoop *loop2, int level, int scalar, int *scaldims, int nb_scattdims, int def) { int dim1, dim2; dim1 = cloog_domain_dimension(loop1->domain); dim2 = cloog_domain_dimension(loop2->domain); while ((level <= dim1 && level <= dim2) || level_is_constant(level, scalar, scaldims, nb_scattdims)) { if (level_is_constant(level, scalar, scaldims, nb_scattdims)) { int cmp = cloog_loop_constant_cmp(loop1, loop2, level, scaldims, nb_scattdims, scalar); if (cmp > 0) return 1; if (cmp < 0) return 0; scalar += scaldims[level + scalar - 1]; } else { int follows = cloog_domain_follows(loop1->domain, loop2->domain, level); if (follows > 0) return 1; if (follows < 0) return 0; level++; } } return def; } /* Structure for representing the nodes in the graph being traversed * using Tarjan's algorithm. * index represents the order in which nodes are visited. * min_index is the index of the root of a (sub)component. * on_stack indicates whether the node is currently on the stack. */ struct cloog_loop_sort_node { int index; int min_index; int on_stack; }; /* Structure for representing the graph being traversed * using Tarjan's algorithm. * len is the number of nodes * node is an array of nodes * stack contains the nodes on the path from the root to the current node * sp is the stack pointer * index is the index of the last node visited * order contains the elements of the components separated by -1 * op represents the current position in order */ struct cloog_loop_sort { int len; struct cloog_loop_sort_node *node; int *stack; int sp; int index; int *order; int op; }; /* Allocate and initialize cloog_loop_sort structure. */ static struct cloog_loop_sort *cloog_loop_sort_alloc(int len) { struct cloog_loop_sort *s; int i; s = (struct cloog_loop_sort *)malloc(sizeof(struct cloog_loop_sort)); assert(s); s->len = len; s->node = (struct cloog_loop_sort_node *) malloc(len * sizeof(struct cloog_loop_sort_node)); assert(s->node); for (i = 0; i < len; ++i) s->node[i].index = -1; s->stack = (int *)malloc(len * sizeof(int)); assert(s->stack); s->order = (int *)malloc(2 * len * sizeof(int)); assert(s->order); s->sp = 0; s->index = 0; s->op = 0; return s; } /* Free cloog_loop_sort structure. */ static void cloog_loop_sort_free(struct cloog_loop_sort *s) { free(s->node); free(s->stack); free(s->order); free(s); } /* Check whether for any fixed iteration of the outer loops, * there is an iteration of loop1 that is lexicographically greater * than an iteration of loop2, where the iteration domains are * available in the inner loops of the arguments. * * By using this functions to detect components, we ensure that * two CloogLoops appear in the same component if some iterations of * each loop should be executed before some iterations of the other loop. * Since we also want two CloogLoops that have exactly the same * iteration domain at the current level to be placed in the same component, * we first check if these domains are indeed the same. */ static int inner_loop_follows(CloogLoop *loop1, CloogLoop *loop2, int level, int scalar, int *scaldims, int nb_scattdims, int def) { int f; f = cloog_domain_lazy_equal(loop1->domain, loop2->domain); if (!f) f = cloog_loop_follows(loop1->inner, loop2->inner, level, scalar, scaldims, nb_scattdims, def); return f; } /* Perform Tarjan's algorithm for computing the strongly connected components * in the graph with the individual CloogLoops as vertices. * Two CloopLoops appear in the same component if they both (indirectly) * "follow" each other, where the following relation is determined * by the follows function. */ static void cloog_loop_components_tarjan(struct cloog_loop_sort *s, CloogLoop **loop_array, int i, int level, int scalar, int *scaldims, int nb_scattdims, int (*follows)(CloogLoop *loop1, CloogLoop *loop2, int level, int scalar, int *scaldims, int nb_scattdims, int def)) { int j; s->node[i].index = s->index; s->node[i].min_index = s->index; s->node[i].on_stack = 1; s->index++; s->stack[s->sp++] = i; for (j = s->len - 1; j >= 0; --j) { int f; if (j == i) continue; if (s->node[j].index >= 0 && (!s->node[j].on_stack || s->node[j].index > s->node[i].min_index)) continue; f = follows(loop_array[i], loop_array[j], level, scalar, scaldims, nb_scattdims, i > j); if (!f) continue; if (s->node[j].index < 0) { cloog_loop_components_tarjan(s, loop_array, j, level, scalar, scaldims, nb_scattdims, follows); if (s->node[j].min_index < s->node[i].min_index) s->node[i].min_index = s->node[j].min_index; } else if (s->node[j].index < s->node[i].min_index) s->node[i].min_index = s->node[j].index; } if (s->node[i].index != s->node[i].min_index) return; do { j = s->stack[--s->sp]; s->node[j].on_stack = 0; s->order[s->op++] = j; } while (j != i); s->order[s->op++] = -1; } static int qsort_index_cmp(const void *p1, const void *p2) { return *(int *)p1 - *(int *)p2; } /* Sort the elements of the component starting at list. * The list is terminated by a -1. */ static void sort_component(int *list) { int len; for (len = 0; list[len] != -1; ++len) ; qsort(list, len, sizeof(int), qsort_index_cmp); } /* Given an array of indices "list" into the "loop_array" array, * terminated by -1, construct a linked list of the corresponding * entries and put the result in *res. * The value returned is the number of CloogLoops in the (linked) list */ static int extract_component(CloogLoop **loop_array, int *list, CloogLoop **res) { int i = 0; sort_component(list); while (list[i] != -1) { *res = loop_array[list[i]]; res = &(*res)->next; ++i; } *res = NULL; return i; } /** * Call cloog_loop_generate_scalar or cloog_loop_generate_general * on each of the strongly connected components in the list of CloogLoops * pointed to by "loop". * * We use Tarjan's algorithm to find the strongly connected components. * Note that this algorithm also topologically sorts the components. * * The components are treated separately to avoid spurious separations. * The concatentation of the results may contain successive loops * with the same bounds, so we try to combine such loops. */ CloogLoop *cloog_loop_generate_components(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options) { int i, nb_loops; CloogLoop *tmp; CloogLoop *res, **res_next; CloogLoop **loop_array; struct cloog_loop_sort *s; if (level == 0 || !loop->next) return cloog_loop_generate_general(loop, level, scalar, scaldims, nb_scattdims, options); nb_loops = cloog_loop_count(loop); loop_array = (CloogLoop **)malloc(nb_loops * sizeof(CloogLoop *)); assert(loop_array); for (i = 0, tmp = loop; i < nb_loops; i++, tmp = tmp->next) loop_array[i] = tmp; s = cloog_loop_sort_alloc(nb_loops); for (i = nb_loops - 1; i >= 0; --i) { if (s->node[i].index >= 0) continue; cloog_loop_components_tarjan(s, loop_array, i, level, scalar, scaldims, nb_scattdims, &inner_loop_follows); } i = 0; res = NULL; res_next = &res; while (nb_loops) { int n = extract_component(loop_array, &s->order[i], &tmp); i += n + 1; nb_loops -= n; *res_next = cloog_loop_generate_general(tmp, level, scalar, scaldims, nb_scattdims, options); while (*res_next) res_next = &(*res_next)->next; } cloog_loop_sort_free(s); free(loop_array); res = cloog_loop_combine(res); return res; } /* For each loop in the list "loop", decompose the list of * inner loops into strongly connected components and put * the components into separate loops at the top level. */ CloogLoop *cloog_loop_decompose_inner(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims) { CloogLoop *l, *tmp; CloogLoop **loop_array; int i, n_loops, max_loops = 0; struct cloog_loop_sort *s; for (l = loop; l; l = l->next) { n_loops = cloog_loop_count(l->inner); if (max_loops < n_loops) max_loops = n_loops; } if (max_loops <= 1) return loop; loop_array = (CloogLoop **)malloc(max_loops * sizeof(CloogLoop *)); assert(loop_array); for (l = loop; l; l = l->next) { int n; for (i = 0, tmp = l->inner; tmp; i++, tmp = tmp->next) loop_array[i] = tmp; n_loops = i; if (n_loops <= 1) continue; s = cloog_loop_sort_alloc(n_loops); for (i = n_loops - 1; i >= 0; --i) { if (s->node[i].index >= 0) continue; cloog_loop_components_tarjan(s, loop_array, i, level, scalar, scaldims, nb_scattdims, &cloog_loop_follows); } n = extract_component(loop_array, s->order, &l->inner); n_loops -= n; i = n + 1; while (n_loops) { CloogLoop *inner; n = extract_component(loop_array, &s->order[i], &inner); n_loops -= n; i += n + 1; tmp = cloog_loop_alloc(l->state, cloog_domain_copy(l->domain), l->otl, l->stride, l->block, inner, l->next); l->next = tmp; l = tmp; } cloog_loop_sort_free(s); } free(loop_array); return loop; } CloogLoop *cloog_loop_generate_restricted(CloogLoop *loop, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options) { /* To save both time and memory, we switch here depending on whether the * current dimension is scalar (simplified processing) or not (general * processing). */ if (level_is_constant(level, scalar, scaldims, nb_scattdims)) return cloog_loop_generate_scalar(loop, level, scalar, scaldims, nb_scattdims, options); /* * 2. Compute the projection of each polyhedron onto the outermost * loop variable and the parameters. */ loop = cloog_loop_project_all(loop, level); return cloog_loop_generate_components(loop, level, scalar, scaldims, nb_scattdims, options); } CloogLoop *cloog_loop_generate_restricted_or_stop(CloogLoop *loop, CloogDomain *context, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options) { /* If the user asked to stop code generation at this level, let's stop. */ if ((options->stop >= 0) && (level+scalar >= options->stop+1)) return cloog_loop_stop(loop,context) ; return cloog_loop_generate_restricted(loop, level, scalar, scaldims, nb_scattdims, options); } /** * cloog_loop_generate function: * Adaptation from LoopGen 0.4 by F. Quillere. This function implements the * Quillere algorithm for polyhedron scanning from step 1 to 2. * (see the Quillere paper). * - loop is the loop for which we have to generate a scanning code, * - context is the context of the current loop (constraints on parameter and/or * on outer loop counters), * - level is the current non-scalar dimension, * - scalar is the current scalar dimension, * - scaldims is the boolean array saying whether a dimension is scalar or not, * - nb_scattdims is the size of the scaldims array, * - options are the general code generation options. ** * - October 26th 2001: first version. * - July 3rd->11th 2003: memory leaks hunt and correction. * - June 15th 2005: a memory leak fixed (loop was not entirely freed when * the result of cloog_loop_restrict was NULL). * - June 22nd 2005: Adaptation for GMP. * - September 2nd 2005: The function have been cutted out in two pieces: * cloog_loop_generate and this one, in order to handle * the scalar dimension case more efficiently with * cloog_loop_generate_scalar. * - November 15th 2005: (debug) Condition for stop option no more take care of * further scalar dimensions. */ CloogLoop *cloog_loop_generate(CloogLoop *loop, CloogDomain *context, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options) { /* 1. Replace each polyhedron by its intersection with the context. */ loop = cloog_loop_restrict_all(loop, context); if (!loop) return NULL; return cloog_loop_generate_restricted_or_stop(loop, context, level, scalar, scaldims, nb_scattdims, options); } /* * Internal function for simplifying a single loop in a list of loops. * See cloog_loop_simplify. */ static CloogLoop *loop_simplify(CloogLoop *loop, CloogDomain *context, int level, int nb_scattdims, CloogOptions *options) { int domain_dim; CloogBlock * new_block ; CloogLoop *simplified, *inner; CloogDomain * domain, * simp, * inter, * extended_context ; domain = loop->domain ; domain_dim = cloog_domain_dimension(domain); extended_context = cloog_domain_extend(context, domain_dim); inter = cloog_domain_intersection(domain,extended_context) ; simp = cloog_domain_simplify(domain, extended_context); cloog_domain_free(extended_context) ; /* If the constraint system is never true, go to the next one. */ if (cloog_domain_never_integral(simp)) { cloog_loop_free(loop->inner); cloog_domain_free(inter); cloog_domain_free(simp); return NULL; } inner = cloog_loop_simplify(loop->inner, inter, level+1, nb_scattdims, options); if ((inner == NULL) && (loop->block == NULL)) { cloog_domain_free(inter); cloog_domain_free(simp); return NULL; } new_block = cloog_block_copy(loop->block) ; simplified = cloog_loop_alloc(loop->state, simp, loop->otl, loop->stride, new_block, inner, NULL); if (options->save_domains) { inter = cloog_domain_add_stride_constraint(inter, loop->stride); if (domain_dim > nb_scattdims) { CloogDomain *t; inter = cloog_domain_project(t = inter, nb_scattdims); cloog_domain_free(t); } simplified->unsimplified = inter; } else cloog_domain_free(inter); return(simplified) ; } /** * cloog_loop_simplify function: * This function implements the part 6. of the Quillere algorithm, it * recursively simplifies each loop in the context of the preceding loop domain. * It returns a pointer to the simplified loop list. * The cloog_domain_simplify (DomainSimplify) behaviour is really bad with * polyhedra union and some really awful sidesteppings were written, I plan * to solve that... * - October 31th 2001: first version. * - July 3rd->11th 2003: memory leaks hunt and correction. * - April 16th 2005: a memory leak fixed (extended_context was not freed). * - June 15th 2005: a memory leak fixed (loop was not conveniently freed * when the constraint system is never true). * - October 27th 2005: - this function called before cloog_loop_fast_simplify * is now the official cloog_loop_simplify function in * replacement of a slower and more complex one (after * deep changes in the pretty printer). * - we use cloog_loop_disjoint to fix the problem when * simplifying gives a union of polyhedra (before, it * was under the responsibility of the pretty printer). */ CloogLoop *cloog_loop_simplify(CloogLoop *loop, CloogDomain *context, int level, int nb_scattdims, CloogOptions *options) { CloogLoop *now; CloogLoop *res = NULL; CloogLoop **next = &res; int need_split = 0; for (now = loop; now; now = now->next) if (!cloog_domain_isconvex(now->domain)) { now->domain = cloog_domain_simplify_union(now->domain); if (!cloog_domain_isconvex(now->domain)) need_split = 1; } /* If the input of CLooG contains any union domains, then they * may not have been split yet at this point. Do so now as the * clast construction assumes there are no union domains. */ if (need_split) loop = cloog_loop_disjoint(loop); for (now = loop; now; now = now->next) { *next = loop_simplify(now, context, level, nb_scattdims, options); now->inner = NULL; /* For loop integrity. */ cloog_domain_free(now->domain); now->domain = NULL; if (*next) next = &(*next)->next; } cloog_loop_free(loop); return res; } /** * cloog_loop_scatter function: * This function add the scattering (scheduling) informations in a loop. */ void cloog_loop_scatter(CloogLoop * loop, CloogScattering *scatt) { loop->domain = cloog_domain_scatter(loop->domain, scatt); } cloog-0.18.2/source/version.c.in0000664000175000017500000000055412254312305013367 00000000000000#include "version.h" #include "cloog/version.h" #define CLOOG_BITS "@BITS@" const char *cloog_version(void) { return "CLooG "CLOOG_HEAD" "CLOOG_BITS" bits"; } int cloog_version_major(void) { return CLOOG_VERSION_MAJOR; } int cloog_version_minor(void) { return CLOOG_VERSION_MINOR; } int cloog_version_revision(void) { return CLOOG_VERSION_REVISION; } cloog-0.18.2/source/matrix.c0000664000175000017500000001346612254312305012607 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** cloogmatrix.c ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #include #include #include #include "../include/cloog/cloog.h" /** * cloog_matrix_alloc: * Allocate a CloogMatrix data structure with NbRows rows and NbColumns columns. * All values are initialized to 0. * This method returns a pointer to the data structure if successful or a NULL * pointer otherwise. */ CloogMatrix *cloog_matrix_alloc(unsigned NbRows, unsigned NbColumns) { CloogMatrix *matrix; cloog_int_t **p, *q; int i, j; matrix = (CloogMatrix *)malloc(sizeof(CloogMatrix)); if (!matrix) return NULL; matrix->NbRows = NbRows; matrix->NbColumns = NbColumns; if (!NbRows || !NbColumns) { matrix->p = NULL; matrix->p_Init = NULL; return matrix; } p = (cloog_int_t **)malloc(NbRows * sizeof(cloog_int_t *)); if (p == NULL) { free (matrix); return NULL; } q = (cloog_int_t *)malloc(NbRows * NbColumns * sizeof(cloog_int_t)); if (q == NULL) { free (matrix); free (p); return NULL; } matrix->p = p; matrix->p_Init = q; for (i = 0; i < NbRows; i++) { *p++ = q; for (j = 0; j < NbColumns; j++) { cloog_int_init(*(q+j)); cloog_int_set_si(*(q+j), 0); } q += NbColumns; } return matrix; } /** * cloog_matrix_free: * Free matrix. */ void cloog_matrix_free(CloogMatrix * matrix) { int i; cloog_int_t *p; int size = matrix->NbRows * matrix->NbColumns; p = matrix->p_Init; for (i = 0; i < size; i++) cloog_int_clear(*p++); if (matrix) { free(matrix->p_Init); free(matrix->p); free(matrix); } } /** * Print the elements of CloogMatrix M to file, with each row prefixed * by prefix and suffixed by suffix. */ void cloog_matrix_print_structure(FILE *file, CloogMatrix *M, const char *prefix, const char *suffix) { int i, j; for (i = 0; i < M->NbRows; ++i) { fprintf(file, "%s", prefix); for (j = 0; j < M->NbColumns; ++j) { cloog_int_print(file, M->p[i][j]); fprintf(file, " "); } fprintf(file, "%s\n", suffix); } } /** * cloog_matrix_print function: * This function prints the content of a CloogMatrix structure (matrix) into a * file (foo, possibly stdout). */ void cloog_matrix_print(FILE* foo, CloogMatrix* m) { if (!m) fprintf(foo, "(null)\n"); fprintf(foo, "%d %d\n", m->NbRows, m->NbColumns); cloog_matrix_print_structure(foo, m, "", ""); fflush(foo); } static char *next_line(FILE *input, char *line, unsigned len) { char *p; do { if (!(p = fgets(line, len, input))) return NULL; while (isspace(*p) && *p != '\n') ++p; } while (*p == '#' || *p == '\n'); return p; } CloogMatrix *cloog_matrix_read(FILE *input) { unsigned n_row, n_col; char line[1024]; if (!next_line(input, line, sizeof(line))) cloog_die("Input error.\n"); if (sscanf(line, "%u %u", &n_row, &n_col) != 2) cloog_die("Input error.\n"); return cloog_matrix_read_of_size(input, n_row, n_col); } /** * Read a matrix in PolyLib format from input. */ CloogMatrix *cloog_matrix_read_of_size(FILE *input, unsigned n_row, unsigned n_col) { CloogMatrix *M; int i, j; char line[1024]; char val[1024]; char *p; M = cloog_matrix_alloc(n_row, n_col); if (!M) cloog_die("memory overflow.\n"); for (i = 0; i < n_row; ++i) { int offset; int n; p = next_line(input, line, sizeof(line)); if (!p) cloog_die("Input error.\n"); for (j = 0; j < n_col; ++j) { n = sscanf(p, "%s%n", val, &offset); if (!n) cloog_die("Input error.\n"); cloog_int_read(M->p[i][j], val); p += offset; } } return M; } cloog-0.18.2/source/int.c0000664000175000017500000000632312254312305012067 00000000000000#include #include "../include/cloog/cloog.h" #define ALLOC(type) (type*)malloc(sizeof(type)) #define ALLOCN(type,n) (type*)malloc((n)*sizeof(type)) #if defined(CLOOG_INT_INT) || \ defined(CLOOG_INT_LONG) || \ defined(CLOOG_INT_LONG_LONG) cloog_int_t cloog_gcd(cloog_int_t a, cloog_int_t b) { while (a) { cloog_int_t t = b % a; b = a; a = t; } if (b < 0) b = -b; return b; } #endif struct cloog_vec *cloog_vec_alloc(unsigned size) { int i; struct cloog_vec *vec; vec = ALLOC(struct cloog_vec); if (!vec) return NULL; vec->p = ALLOCN(cloog_int_t, size); if (!vec->p) goto error; vec->size = size; for (i = 0; i < size; ++i) cloog_int_init(vec->p[i]); return vec; error: free(vec); return NULL; } void cloog_vec_free(struct cloog_vec *vec) { int i; if (!vec) return; for (i = 0; i < vec->size; ++i) cloog_int_clear(vec->p[i]); free(vec->p); free(vec); } void cloog_vec_dump(struct cloog_vec *vec) { int i; for (i = 0; i < vec->size; ++i) { cloog_int_print(stderr, vec->p[i]); fprintf(stderr, " "); } fprintf(stderr, "\n"); } int cloog_seq_first_non_zero(cloog_int_t *p, unsigned len) { int i; for (i = 0; i < len; ++i) if (!cloog_int_is_zero(p[i])) return i; return -1; } void cloog_seq_neg(cloog_int_t *dst, cloog_int_t *src, unsigned len) { int i; for (i = 0; i < len; ++i) cloog_int_neg(dst[i], src[i]); } void cloog_seq_cpy(cloog_int_t *dst, cloog_int_t *src, unsigned len) { int i; for (i = 0; i < len; ++i) cloog_int_set(dst[i], src[i]); } static void cloog_seq_scale_down(cloog_int_t *dst, cloog_int_t *src, cloog_int_t m, unsigned len) { int i; for (i = 0; i < len; ++i) cloog_int_divexact(dst[i], src[i], m); } void cloog_seq_combine(cloog_int_t *dst, cloog_int_t m1, cloog_int_t *src1, cloog_int_t m2, cloog_int_t *src2, unsigned len) { int i; cloog_int_t tmp; cloog_int_init(tmp); for (i = 0; i < len; ++i) { cloog_int_mul(tmp, m1, src1[i]); cloog_int_addmul(tmp, m2, src2[i]); cloog_int_set(dst[i], tmp); } cloog_int_clear(tmp); } static int cloog_seq_abs_min_non_zero(cloog_int_t *p, unsigned len) { int i, min = cloog_seq_first_non_zero(p, len); if (min < 0) return -1; for (i = min + 1; i < len; ++i) { if (cloog_int_is_zero(p[i])) continue; if (cloog_int_abs_lt(p[i], p[min])) min = i; } return min; } void cloog_seq_gcd(cloog_int_t *p, unsigned len, cloog_int_t *gcd) { int i, min = cloog_seq_abs_min_non_zero(p, len); if (min < 0) { cloog_int_set_si(*gcd, 0); return; } cloog_int_abs(*gcd, p[min]); for (i = 0; cloog_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) { if (i == min) continue; if (cloog_int_is_zero(p[i])) continue; cloog_int_gcd(*gcd, *gcd, p[i]); } } int cloog_seq_is_neg(cloog_int_t *p1, cloog_int_t *p2, unsigned len) { int i; for (i = 0; i < len; ++i) { if (cloog_int_abs_ne(p1[i], p2[i])) return 0; if (cloog_int_is_zero(p1[i])) continue; if (cloog_int_eq(p1[i], p2[i])) return 0; } return 1; } void cloog_seq_normalize(cloog_int_t *p, unsigned len) { cloog_int_t gcd; if (len == 0) return; cloog_int_init(gcd); cloog_seq_gcd(p, len, &gcd); if (!cloog_int_is_zero(gcd) && !cloog_int_is_one(gcd)) cloog_seq_scale_down(p, p, gcd, len); cloog_int_clear(gcd); } cloog-0.18.2/source/version.c0000664000175000017500000000055112254313327012764 00000000000000#include "version.h" #include "cloog/version.h" #define CLOOG_BITS "gmp" const char *cloog_version(void) { return "CLooG "CLOOG_HEAD" "CLOOG_BITS" bits"; } int cloog_version_major(void) { return CLOOG_VERSION_MAJOR; } int cloog_version_minor(void) { return CLOOG_VERSION_MINOR; } int cloog_version_revision(void) { return CLOOG_VERSION_REVISION; } cloog-0.18.2/source/program.c0000664000175000017500000011534612254312305012752 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** program.c ** **-------------------------------------------------------------------** ** First version: october 25th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /* CAUTION: the english used for comments is probably the worst you ever read, * please feel free to correct and improve it ! */ # include # include #include # include # include # include # include # include # include "../include/cloog/cloog.h" #ifdef CLOOG_RUSAGE # include #endif #define ALLOC(type) (type*)malloc(sizeof(type)) #ifdef OSL_SUPPORT #include #include #endif /****************************************************************************** * Structure display function * ******************************************************************************/ /** * cloog_program_print function: * this function is a human-friendly way to display the CloogProgram data * structure, it shows all the different fields and includes an indentation * level (level) in order to work with others print_structure functions. * - July 1st 2005: first version based on the old cloog_program_print function. */ void cloog_program_print_structure(file, program, level) FILE * file ; CloogProgram * program ; int level ; { int i, j ; /* Go to the right level. */ for (i=0; ilanguage) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the scattering dimension number. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; fprintf(file,"Scattering dimension number: %d\n",program->nb_scattdims) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the scalar scattering dimension informations. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; if (program->scaldims != NULL) { fprintf(file,"Scalar dimensions:") ; for (i=0;inb_scattdims;i++) fprintf(file," %d:%d ",i,program->scaldims[i]) ; fprintf(file,"\n") ; } else fprintf(file,"No scalar scattering dimensions\n") ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the parameter and the iterator names. */ cloog_names_print_structure(file,program->names,level+1) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the context. */ cloog_domain_print_structure(file, program->context, level+1, "Context"); /* Print the loop. */ cloog_loop_print_structure(file,program->loop,level+1) ; /* One more time something that is here only for a better look. */ for (j=0; j<2; j++) { for (i=0; i<=level; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; } } /** * cloog_program_dump_cloog function: * This function dumps a CloogProgram structure supposed to be completely * filled in a CLooG input file (foo possibly stdout) such as CLooG can * rebuild almost exactly the data structure from the input file. * * If the scattering is already applied, the scattering parameter is supposed to * be NULL. In this case the number of scattering functions is lost, since they * are included inside the iteration domains. This can only lead to a less * beautiful pretty printing. * * In case the scattering is not yet applied it can be passed to this function * and will be included in the CLooG input file dump. */ void cloog_program_dump_cloog(FILE * foo, CloogProgram * program, CloogScatteringList *scattering) { int i; CloogLoop * loop ; CloogScatteringList *tmp_scatt; fprintf(foo, "# CLooG -> CLooG\n" "# This is an automatic dump of a CLooG input file from a CloogProgram data\n" "# structure. WARNING: it is highly dangerous and MAY be correct ONLY if\n" "# - it has been dumped before loop generation.\n" "# - option -noscalars is used (it removes scalar dimensions otherwise)\n" "# - option -l is at least the original scattering dimension number\n" "# ASK THE AUTHOR IF YOU *NEED* SOMETHING MORE ROBUST\n") ; /* Language. */ if (program->language == 'c') fprintf(foo,"# Language: C\n") ; else fprintf(foo,"# Language: FORTRAN\n") ; fprintf(foo,"%c\n\n",program->language) ; /* Context. */ fprintf(foo, "# Context (%d parameter(s)):\n", program->names->nb_parameters); cloog_domain_print_constraints(foo, program->context, 0); fprintf(foo,"1 # Parameter name(s)\n") ; for (i=0;inames->nb_parameters;i++) fprintf(foo,"%s ",program->names->parameters[i]) ; /* Statement number. */ i = 0 ; loop = program->loop ; while (loop != NULL) { i++ ; loop = loop->next ; } fprintf(foo,"\n\n# Statement number:\n%d\n\n",i) ; /* Iteration domains. */ i = 1 ; loop = program->loop ; while (loop != NULL) { /* Name of the domain. */ fprintf(foo,"# Iteration domain of statement %d.\n",i) ; cloog_domain_print_constraints(foo, loop->domain, 1); fprintf(foo,"0 0 0 # For future options.\n\n") ; i++ ; loop = loop->next ; } fprintf(foo,"\n1 # Iterator name(s)\n") ; /* Scattering already applied? In this case print the scattering names as * additional iterator names. */ if (!scattering) for (i = 0; i < program->names->nb_scattering; i++) fprintf(foo, "%s ", program->names->scattering[i]); for (i=0;inames->nb_iterators;i++) fprintf(foo,"%s ",program->names->iterators[i]); fprintf(foo,"\n\n") ; /* Exit, if scattering is already applied. */ if (!scattering) { fprintf(foo, "# No scattering functions.\n0\n\n"); return; } /* Scattering relations. */ fprintf(foo, "# --------------------- SCATTERING --------------------\n"); i = 0; for (tmp_scatt = scattering; tmp_scatt; tmp_scatt = tmp_scatt->next) i++; fprintf(foo, "%d # Scattering functions", i); for (tmp_scatt = scattering; tmp_scatt; tmp_scatt = tmp_scatt->next) cloog_scattering_print_constraints(foo, tmp_scatt->scatt); fprintf(foo, "\n1 # Scattering dimension name(s)\n"); for (i = 0; i < program->names->nb_scattering; i++) fprintf(foo, "%s ", program->names->scattering[i]); } /** * cloog_program_print function: * This function prints the content of a CloogProgram structure (program) into a * file (file, possibly stdout). * - July 1st 2005: Now this very old function (probably as old as CLooG) is * only a frontend to cloog_program_print_structure, with a * quite better human-readable representation. */ void cloog_program_print(FILE * file, CloogProgram * program) { cloog_program_print_structure(file,program,0) ; } static void print_comment(FILE *file, CloogOptions *options, const char *fmt, ...) { va_list args; va_start(args, fmt); if (options->language == CLOOG_LANGUAGE_FORTRAN) { fprintf(file, "! "); vfprintf(file, fmt, args); fprintf(file, "\n"); } else { fprintf(file, "/* "); vfprintf(file, fmt, args); fprintf(file, " */\n"); } } static void print_macros(FILE *file) { fprintf(file, "/* Useful macros. */\n") ; fprintf(file, "#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))\n"); fprintf(file, "#define ceild(n,d) (((n)<0) ? -((-(n))/(d)) : ((n)+(d)-1)/(d))\n"); fprintf(file, "#define max(x,y) ((x) > (y) ? (x) : (y))\n") ; fprintf(file, "#define min(x,y) ((x) < (y) ? (x) : (y))\n\n") ; } static void print_declarations(FILE *file, int n, char **names) { int i; fprintf(file, " int %s", names[0]); for (i = 1; i < n; i++) fprintf(file, ", %s", names[i]); fprintf(file, ";\n"); } static void print_iterator_declarations(FILE *file, CloogProgram *program, CloogOptions *options) { CloogNames *names = program->names; if (names->nb_scattering) { fprintf(file, " /* Scattering iterators. */\n"); print_declarations(file, names->nb_scattering, names->scattering); } if (names->nb_iterators) { fprintf(file, " /* Original iterators. */\n"); print_declarations(file, names->nb_iterators, names->iterators); } } static void print_callable_preamble(FILE *file, CloogProgram *program, CloogOptions *options) { int j; CloogBlockList *blocklist; CloogBlock *block; CloogStatement *statement; fprintf(file, "extern void hash(int);\n\n"); print_macros(file); for (blocklist = program->blocklist; blocklist; blocklist = blocklist->next) { block = blocklist->block; for (statement = block->statement; statement; statement = statement->next) { fprintf(file, "#define S%d(", statement->number); if (block->depth > 0) { fprintf(file, "%s", program->names->iterators[0]); for(j = 1; j < block->depth; j++) fprintf(file, ",%s", program->names->iterators[j]); } fprintf(file,") { hash(%d);", statement->number); for(j = 0; j < block->depth; j++) fprintf(file, " hash(%s);", program->names->iterators[j]); fprintf(file, " }\n"); } } fprintf(file, "\nvoid test("); if (program->names->nb_parameters > 0) { fprintf(file, "int %s", program->names->parameters[0]); for(j = 1; j < program->names->nb_parameters; j++) fprintf(file, ", int %s", program->names->parameters[j]); } fprintf(file, ")\n{\n"); print_iterator_declarations(file, program, options); } static void print_callable_postamble(FILE *file, CloogProgram *program) { fprintf(file, "}\n"); } /** * cloog_program_osl_pprint function: * this function pretty-prints the C or FORTRAN code generated from an * OpenScop specification by overwriting SCoP in a given code, if the * options -compilable or -callable are not set. The SCoP coordinates are * provided through the OpenScop "Coordinates" extension. It returns 1 if * it succeeds to find an OpenScop coordinates information * to pretty-print the generated code, 0 otherwise. * \param[in] file The output stream (possibly stdout). * \param[in] program The generated pseudo-AST to pretty-print. * \param[in] options CLooG options (contains the OpenSCop specification). * \return 1 on success to pretty-print at the place of a SCoP, 0 otherwise. */ int cloog_program_osl_pprint(FILE * file, CloogProgram * program, CloogOptions * options) { #ifdef OSL_SUPPORT int lines = 0; int columns = 0; int read = 1; char c; osl_scop_p scop = options->scop; osl_coordinates_p coordinates; struct clast_stmt *root; FILE * original; if (scop && !options->compilable && !options->callable) { coordinates = osl_generic_lookup(scop->extension, OSL_URI_COORDINATES); if (coordinates) { original = fopen(coordinates->name, "r"); if (!original) { cloog_msg(options, CLOOG_WARNING, "unable to open the file specified in the SCoP " "coordinates\n"); return 0; } /* Print the macros the generated code may need. */ print_macros(file); /* Print what was before the SCoP in the original file. */ while (((lines < coordinates->line_start - 1) || (columns < coordinates->column_start - 1)) && (read != EOF)) { read = fscanf(original, "%c", &c); columns++; if (read != EOF) { if (c == '\n') { lines++; columns = 0; } fprintf(file, "%c", c); } } /* Carriage return to preserve indentation if necessary. */ if (coordinates->column_start > 0) fprintf(file, "\n"); /* Generate the clast from the pseudo-AST then pretty-print it. */ root = cloog_clast_create(program, options); clast_pprint(file, root, coordinates->indent, options); cloog_clast_free(root); /* Print what was after the SCoP in the original file. */ while (read != EOF) { read = fscanf(original, "%c", &c); columns++; if (read != EOF) { if (((lines == coordinates->line_end - 1) && (columns > coordinates->column_end)) || (lines > coordinates->line_end - 1)) fprintf(file, "%c", c); if (c == '\n') { lines++; columns = 0; } } } fclose(original); return 1; } } #endif return 0; } /** * cloog_program_pprint function: * This function prints the content of a CloogProgram structure (program) into a * file (file, possibly stdout), in a C-like language. * - June 22nd 2005: Adaptation for GMP. */ void cloog_program_pprint(file, program, options) FILE * file ; CloogProgram * program ; CloogOptions * options ; { int i, j, indentation = 0; CloogStatement * statement ; CloogBlockList * blocklist ; CloogBlock * block ; struct clast_stmt *root; if (cloog_program_osl_pprint(file, program, options)) return; if (program->language == 'f') options->language = CLOOG_LANGUAGE_FORTRAN ; else options->language = CLOOG_LANGUAGE_C ; #ifdef CLOOG_RUSAGE print_comment(file, options, "Generated from %s by %s in %.2fs.", options->name, cloog_version(), options->time); #else print_comment(file, options, "Generated from %s by %s.", options->name, cloog_version()); #endif #ifdef CLOOG_MEMORY print_comment(file, options, "CLooG asked for %d KBytes.", options->memory); cloog_msg(CLOOG_INFO, "%.2fs and %dKB used for code generation.\n", options->time,options->memory); #endif /* If the option "compilable" is set, we provide the whole stuff to generate * a compilable code. This code just do nothing, but now the user can edit * the source and set the statement macros and parameters values. */ if (options->compilable && (program->language == 'c')) { /* The headers. */ fprintf(file,"/* DON'T FORGET TO USE -lm OPTION TO COMPILE. */\n\n") ; fprintf(file,"/* Useful headers. */\n") ; fprintf(file,"#include \n") ; fprintf(file,"#include \n") ; fprintf(file,"#include \n\n") ; /* The value of parameters. */ fprintf(file,"/* Parameter value. */\n") ; for (i = 1; i <= program->names->nb_parameters; i++) fprintf(file, "#define PARVAL%d %d\n", i, options->compilable); /* The macros. */ print_macros(file); /* The statement macros. */ fprintf(file,"/* Statement macros (please set). */\n") ; blocklist = program->blocklist ; while (blocklist != NULL) { block = blocklist->block ; statement = block->statement ; while (statement != NULL) { fprintf(file,"#define S%d(",statement->number) ; if (block->depth > 0) { fprintf(file,"%s",program->names->iterators[0]) ; for(j=1;jdepth;j++) fprintf(file,",%s",program->names->iterators[j]) ; } fprintf(file,") {total++;") ; if (block->depth > 0) { fprintf(file, " printf(\"S%d %%d", statement->number); for(j=1;jdepth;j++) fprintf(file, " %%d"); fprintf(file,"\\n\",%s",program->names->iterators[0]) ; for(j=1;jdepth;j++) fprintf(file,",%s",program->names->iterators[j]) ; fprintf(file,");") ; } fprintf(file,"}\n") ; statement = statement->next ; } blocklist = blocklist->next ; } /* The iterator and parameter declaration. */ fprintf(file,"\nint main() {\n") ; print_iterator_declarations(file, program, options); if (program->names->nb_parameters > 0) { fprintf(file," /* Parameters. */\n") ; fprintf(file, " int %s=PARVAL1",program->names->parameters[0]); for(i=2;i<=program->names->nb_parameters;i++) fprintf(file, ", %s=PARVAL%d", program->names->parameters[i-1], i); fprintf(file,";\n"); } fprintf(file," int total=0;\n"); fprintf(file,"\n") ; /* And we adapt the identation. */ indentation += 2 ; } else if (options->callable && program->language == 'c') { print_callable_preamble(file, program, options); indentation += 2; } root = cloog_clast_create(program, options); clast_pprint(file, root, indentation, options); cloog_clast_free(root); /* The end of the compilable code in case of 'compilable' option. */ if (options->compilable && (program->language == 'c')) { fprintf(file, "\n printf(\"Number of integral points: %%d.\\n\",total);"); fprintf(file, "\n return 0;\n}\n"); } else if (options->callable && program->language == 'c') print_callable_postamble(file, program); } /****************************************************************************** * Memory deallocation function * ******************************************************************************/ /** * cloog_program_free function: * This function frees the allocated memory for a CloogProgram structure. */ void cloog_program_free(CloogProgram * program) { cloog_names_free(program->names) ; cloog_loop_free(program->loop) ; cloog_domain_free(program->context) ; cloog_block_list_free(program->blocklist) ; if (program->scaldims != NULL) free(program->scaldims) ; free(program) ; } /****************************************************************************** * Reading function * ******************************************************************************/ static void cloog_program_construct_block_list(CloogProgram *p) { CloogLoop *loop; CloogBlockList **next = &p->blocklist; for (loop = p->loop; loop; loop = loop->next) { *next = cloog_block_list_alloc(loop->block); next = &(*next)->next; } } /** * Construct a CloogProgram structure from a given context and * union domain representing the iteration domains and scattering functions. */ CloogProgram *cloog_program_alloc(CloogDomain *context, CloogUnionDomain *ud, CloogOptions *options) { int i; char prefix[] = "c"; CloogScatteringList * scatteringl; CloogNames *n; CloogProgram * p ; /* Memory allocation for the CloogProgram structure. */ p = cloog_program_malloc() ; if (options->language == CLOOG_LANGUAGE_FORTRAN) p->language = 'f'; else p->language = 'c'; p->names = n = cloog_names_alloc(); /* We then read the context data. */ p->context = context; n->nb_parameters = ud->n_name[CLOOG_PARAM]; /* First part of the CloogNames structure: the parameter names. */ if (ud->name[CLOOG_PARAM]) { n->parameters = ud->name[CLOOG_PARAM]; ud->name[CLOOG_PARAM] = NULL; } else n->parameters = cloog_names_generate_items(n->nb_parameters, NULL, FIRST_PARAMETER); n->nb_iterators = ud->n_name[CLOOG_ITER]; if (ud->name[CLOOG_ITER]) { n->iterators = ud->name[CLOOG_ITER]; ud->name[CLOOG_ITER] = NULL; } else n->iterators = cloog_names_generate_items(n->nb_iterators, NULL, FIRST_ITERATOR); if (ud->domain) { CloogNamedDomainList *l; CloogLoop **next = &p->loop; CloogScatteringList **next_scat = &scatteringl; scatteringl = NULL; for (i = 0, l = ud->domain; l; ++i, l = l->next) { *next = cloog_loop_from_domain(options->state, l->domain, i); l->domain = NULL; (*next)->block->statement->name = l->name; (*next)->block->statement->usr = l->usr; l->name = NULL; if (l->scattering) { *next_scat = ALLOC(CloogScatteringList); (*next_scat)->scatt = l->scattering; l->scattering = NULL; (*next_scat)->next = NULL; next_scat = &(*next_scat)->next; } next = &(*next)->next; } if (scatteringl != NULL) { p->nb_scattdims = cloog_scattering_dimension(scatteringl->scatt, p->loop->domain); n->nb_scattering = p->nb_scattdims; if (ud->name[CLOOG_SCAT]) { n->scattering = ud->name[CLOOG_SCAT]; ud->name[CLOOG_SCAT] = NULL; } else n->scattering = cloog_names_generate_items(n->nb_scattering, prefix, -1); /* The boolean array for scalar dimensions is created and set to 0. */ p->scaldims = (int *)malloc(p->nb_scattdims*(sizeof(int))) ; if (p->scaldims == NULL) cloog_die("memory overflow.\n"); for (i=0;inb_scattdims;i++) p->scaldims[i] = 0 ; /* We try to find blocks in the input problem to reduce complexity. */ if (!options->noblocks) cloog_program_block(p, scatteringl, options); if (!options->noscalars) cloog_program_extract_scalars(p, scatteringl, options); cloog_program_scatter(p, scatteringl, options); cloog_scattering_list_free(scatteringl); if (!options->noblocks) p->loop = cloog_loop_block(p->loop, p->scaldims, p->nb_scattdims); } else { p->nb_scattdims = 0 ; p->scaldims = NULL ; } cloog_names_scalarize(p->names,p->nb_scattdims,p->scaldims) ; cloog_program_construct_block_list(p); } else { p->loop = NULL ; p->blocklist = NULL ; p->scaldims = NULL ; } cloog_union_domain_free(ud); return(p) ; } /** * cloog_program_read function: * This function read the informations to put in a CloogProgram structure from * a file (file, possibly stdin). It returns a pointer to a CloogProgram * structure containing the read informations. * - October 25th 2001: first version. * - September 9th 2002: - the big reading function is now split in several * functions (one per read data structure). * - adaptation to the new file format with naming. */ CloogProgram *cloog_program_read(FILE *file, CloogOptions *options) { CloogInput *input; CloogProgram *p; input = cloog_input_read(file, options); p = cloog_program_alloc(input->context, input->ud, options); free(input); return p; } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * cloog_program_malloc function: * This function allocates the memory space for a CloogProgram structure and * sets its fields with default values. Then it returns a pointer to the * allocated space. * - November 21th 2005: first version. */ CloogProgram * cloog_program_malloc() { CloogProgram * program ; /* Memory allocation for the CloogProgram structure. */ program = (CloogProgram *)malloc(sizeof(CloogProgram)) ; if (program == NULL) cloog_die("memory overflow.\n"); /* We set the various fields with default values. */ program->language = 'c' ; program->nb_scattdims = 0 ; program->context = NULL ; program->loop = NULL ; program->names = NULL ; program->blocklist = NULL ; program->scaldims = NULL ; program->usr = NULL; return program ; } /** * cloog_program_generate function: * This function calls the Quillere algorithm for loop scanning. (see the * Quillere paper) and calls the loop simplification function. * - depth is the loop depth we want to optimize (guard free as possible), * the first loop depth is 1 and anegative value is the infinity depth. * - sep_level is the level number where we want to start loop separation. ** * - October 26th 2001: first version. * - April 19th 2005: some basic fixes and memory usage feature. * - April 29th 2005: (bug fix, bug found by DaeGon Kim) see case 2 below. */ CloogProgram * cloog_program_generate(program, options) CloogProgram * program ; CloogOptions * options ; { #ifdef CLOOG_RUSAGE float time; struct rusage start, end ; #endif CloogLoop * loop ; #ifdef CLOOG_MEMORY char status_path[MAX_STRING_VAL] ; FILE * status ; /* We initialize the memory need to 0. */ options->memory = 0 ; #endif if (options->override) { cloog_msg(options, CLOOG_WARNING, "you are using -override option, be aware that the " "generated\n code may be incorrect.\n") ; } else { /* Playing with options may be dangerous, here are two possible issues : * 1. Using -l option less than scattering dimension number may lead to * an illegal target code (since the scattering is not respected), if * it is the case, we set -l depth to the first acceptable value. */ if ((program->nb_scattdims > options->l) && (options->l >= 0)) { cloog_msg(options, CLOOG_WARNING, "-l depth is less than the scattering dimension number " "(the \n generated code may be incorrect), it has been " "automaticaly set\n to this value (use option -override " "to override).\n") ; options->l = program->nb_scattdims ; } /* 2. Using -f option greater than one while -l depth is greater than the * scattering dimension number may lead to iteration duplication (try * test/daegon_lu_osp.cloog with '-f 3' to test) because of the step 4b * of the cloog_loop_generate function, if it is the case, we set -l to * the first acceptable value. */ if (((options->f > 1) || (options->f < 0)) && ((options->l > program->nb_scattdims) || (options->l < 0))) { cloog_msg(options, CLOOG_WARNING, "-f depth is more than one, -l depth has been " "automaticaly set\n to the scattering dimension number " "(target code may have\n duplicated iterations), -l depth " "has been automaticaly set to\n this value (use option " "-override to override).\n") ; options->l = program->nb_scattdims ; } } #ifdef CLOOG_RUSAGE getrusage(RUSAGE_SELF, &start) ; #endif if (program->loop != NULL) { loop = program->loop ; /* Here we go ! */ loop = cloog_loop_generate(loop, program->context, 0, 0, program->scaldims, program->nb_scattdims, options); #ifdef CLOOG_MEMORY /* We read into the status file of the process how many memory it uses. */ sprintf(status_path,"/proc/%d/status",getpid()) ; status = fopen(status_path, "r") ; while (fscanf(status,"%s",status_path) && strcmp(status_path,"VmData:")!=0); fscanf(status,"%d",&(options->memory)) ; fclose(status) ; #endif if ((!options->nosimplify) && (program->loop != NULL)) loop = cloog_loop_simplify(loop, program->context, 0, program->nb_scattdims, options); program->loop = loop ; } #ifdef CLOOG_RUSAGE getrusage(RUSAGE_SELF, &end) ; /* We calculate the time spent in code generation. */ time = (end.ru_utime.tv_usec - start.ru_utime.tv_usec)/(float)(MEGA) ; time += (float)(end.ru_utime.tv_sec - start.ru_utime.tv_sec) ; options->time = time ; #endif return program ; } /** * cloog_program_block function: * this function gives a last chance to the lazy user to consider statement * blocks instead of some statement lists where the whole list may be * considered as a single statement from a code generation point of view. * For instance two statements with the same iteration domain and the same * scattering functions may be considered as a block. This function is lazy * and can only find very simple forms of trivial blocks (see * cloog_domain_lazy_block function for more details). The useless loops and * scattering functions are removed and freed while the statement list of * according blocks are filled. * - program is the whole program structure (befaore applying scattering), * - scattering is the list of scattering functions. ** * - April 30th 2005: first attempt. * - June 10-11th 2005: first working version. */ void cloog_program_block(CloogProgram *program, CloogScatteringList *scattering, CloogOptions *options) { int blocked_reference=0, blocked=0, nb_blocked=0 ; CloogLoop * reference, * start, * loop ; CloogScatteringList * scatt_reference, * scatt_loop, * scatt_start; if ((program->loop == NULL) || (program->loop->next == NULL)) return ; /* The process will use three variables for the linked list : * - 'start' is the starting point of a new block, * - 'reference' is the node of the block used for the block checking, * - 'loop' is the candidate to be inserted inside the block. * At the beginning of the process, the linked lists are as follow: * O------>O------>O------>O------>NULL * | | * start loop * reference */ reference = program->loop ; start = program->loop ; loop = reference->next ; scatt_reference = scattering ; scatt_start = scattering ; scatt_loop = scattering->next ; while (loop != NULL) { if (cloog_domain_lazy_equal(reference->domain,loop->domain) && cloog_scattering_lazy_block(scatt_reference->scatt, scatt_loop->scatt, scattering,program->nb_scattdims)) { /* If we find a block we update the links: * +---------------+ * | v * O O------>O------>O------>NULL * | | * start loop * reference */ blocked = 1 ; nb_blocked ++ ; cloog_block_merge(start->block,loop->block); /* merge frees loop->block */ loop->block = NULL ; start->next = loop->next ; scatt_start->next = scatt_loop->next ; } else { /* If we didn't find a block, the next start of a block is updated: * O------>O------>O------>O------>NULL * | | * reference start * loop */ blocked= 0 ; start = loop ; scatt_start = scatt_loop ; } /* If the reference node has been included into a block, we can free it. */ if (blocked_reference) { reference->next = NULL ; cloog_loop_free(reference) ; cloog_scattering_free(scatt_reference->scatt); free(scatt_reference) ; } /* The reference and the loop are now updated for the next try, the * starting position depends on the previous step. * O ? O------>O------>O------>NULL * | | * reference loop */ reference = loop ; loop = loop->next ; scatt_reference = scatt_loop ; scatt_loop = scatt_loop->next ; /* We mark the new reference as being blocked or not, if will be freed * during the next while loop execution. */ if (blocked) blocked_reference = 1 ; else blocked_reference = 0 ; } /* We free the last blocked reference if any (since in the while loop it was * freed during the next loop execution, it was not possible to free the * last one inside). */ if (blocked_reference) { reference->next = NULL ; cloog_loop_free(reference) ; cloog_scattering_free(scatt_reference->scatt); free(scatt_reference) ; } if (nb_blocked != 0) cloog_msg(options, CLOOG_INFO, "%d domains have been blocked.\n", nb_blocked); } /** * cloog_program_extract_scalars function: * this functions finds and removes the dimensions of the scattering functions * when they are scalar (i.e. of the shape "dim + scalar = 0") for all * scattering functions. The reason is that the processing of such dimensions * is trivial and do not need neither a row and a column in the matrix * representation of the domain (this will save memory) neither the full * Quillere processing (this will save time). The scalar dimensions data are * dispatched in the CloogProgram structure (the boolean vector scaldims will * say which original dimensions are scalar or not) and to the CloogBlock * structures (each one has a scaldims vector that contains the scalar values). * - June 14th 2005: first developments. * - June 30th 2005: first version. */ void cloog_program_extract_scalars(CloogProgram *program, CloogScatteringList *scattering, CloogOptions *options) { int i, j, scalar, current, nb_scaldims=0 ; CloogScatteringList *start; CloogScattering *old; CloogLoop *loop; CloogBlock * block ; start = scattering ; for (i=0;inb_scattdims;i++) { scalar = 1 ; scattering = start ; while (scattering != NULL) { if (!cloog_scattering_lazy_isscalar(scattering->scatt, i, NULL)) { scalar = 0 ; break ; } scattering = scattering->next ; } if (scalar) { nb_scaldims ++ ; program->scaldims[i] = 1 ; } } /* If there are no scalar dimensions, we can continue directly. */ if (!nb_scaldims) return ; /* Otherwise, in each block, we have to put the number of scalar dimensions, * and to allocate the memory for the scalar values. */ for (loop = program->loop; loop; loop = loop->next) { block = loop->block; block->nb_scaldims = nb_scaldims ; block->scaldims = (cloog_int_t *)malloc(nb_scaldims*sizeof(cloog_int_t)); for (i=0;iscaldims[i]); } /* Then we have to fill these scalar values, so we can erase those dimensions * from the scattering functions. It's easier to begin with the last one, * since there would be an offset otherwise (if we remove the i^th dimension, * then the next one is not the (i+1)^th but still the i^th...). */ current = nb_scaldims - 1 ; for (i=program->nb_scattdims-1;i>=0;i--) if (program->scaldims[i]) { scattering = start ; for (loop = program->loop; loop; loop = loop->next) { block = loop->block; if (!cloog_scattering_lazy_isscalar(scattering->scatt, i, &block->scaldims[current])) { /* We should have found a scalar value: if not, there is an error. */ cloog_die("dimension %d is not scalar as expected.\n", i); } scattering = scattering->next ; } scattering = start ; while (scattering != NULL) { old = scattering->scatt; scattering->scatt = cloog_scattering_erase_dimension(old, i); cloog_scattering_free(old); scattering = scattering->next ; } current-- ; } /* We postprocess the scaldims array in such a way that each entry is how * many scalar dimensions follows + 1 (the current one). This will make * some other processing easier (e.g. knowledge of some offsets). */ for (i=0;inb_scattdims-1;i++) { if (program->scaldims[i]) { j = i + 1 ; while ((j < program->nb_scattdims) && program->scaldims[j]) { program->scaldims[i] ++ ; j ++ ; } } } if (nb_scaldims != 0) cloog_msg(options, CLOOG_INFO, "%d dimensions (over %d) are scalar.\n", nb_scaldims,program->nb_scattdims) ; } /** * cloog_program_scatter function: * This function adds the scattering (scheduling) informations in a program. * If names is NULL, this function create names itself such that the i^th * name is ci. * - November 6th 2001: first version. */ void cloog_program_scatter(CloogProgram *program, CloogScatteringList *scattering, CloogOptions *options) { int scattering_dim, scattering_dim2, not_enough_constraints=0 ; CloogLoop * loop ; if ((program != NULL) && (scattering != NULL)) { loop = program->loop ; /* We compute the scattering dimension and check it is >=0. */ scattering_dim = cloog_scattering_dimension(scattering->scatt, loop->domain); if (scattering_dim < 0) cloog_die("scattering has not enough dimensions.\n"); if (!cloog_scattering_fully_specified(scattering->scatt, loop->domain)) not_enough_constraints ++ ; /* The scattering dimension may have been modified by scalar extraction. */ scattering_dim = cloog_scattering_dimension(scattering->scatt, loop->domain); /* Finally we scatter all loops. */ cloog_loop_scatter(loop, scattering->scatt); loop = loop->next ; scattering = scattering->next ; while ((loop != NULL) && (scattering != NULL)) { scattering_dim2 = cloog_scattering_dimension(scattering->scatt, loop->domain); if (scattering_dim2 != scattering_dim) cloog_die("scattering dimensions are not the same.\n") ; if (!cloog_scattering_fully_specified(scattering->scatt, loop->domain)) not_enough_constraints ++ ; cloog_loop_scatter(loop, scattering->scatt); loop = loop->next ; scattering = scattering->next ; } if ((loop != NULL) || (scattering != NULL)) cloog_msg(options, CLOOG_WARNING, "there is not a scattering for each statement.\n"); if (not_enough_constraints) cloog_msg(options, CLOOG_WARNING, "not enough constraints for " "%d scattering function(s).\n",not_enough_constraints) ; } } cloog-0.18.2/source/input.c0000664000175000017500000001315012254312305012430 00000000000000#include #include #include #include "../include/cloog/cloog.h" #ifdef OSL_SUPPORT #include #endif #define ALLOC(type) (type*)malloc(sizeof(type)) static char *next_line(FILE *input, char *line, unsigned len) { char *p; do { if (!(p = fgets(line, len, input))) return NULL; while (isspace(*p) && *p != '\n') ++p; } while (*p == '#' || *p == '\n'); return p; } #ifdef OSL_SUPPORT /** * This function translates an OpenScop scop to a CLooG input. * \param[in,out] state CLooG state. * \param[in] scop Scop to translate. * \return A CloogInput corresponding to the scop input. */ CloogInput *cloog_input_from_osl_scop(CloogState *state, osl_scop_p scop) { CloogInput *input = NULL; CloogDomain *context = NULL; CloogUnionDomain *ud = NULL; if (scop) { /* Extract the context. */ context = cloog_domain_from_osl_relation(state, scop->context); /* Extract the union of domains. */ ud = cloog_union_domain_from_osl_scop(state, scop); /* Build and return the input. */ input = cloog_input_alloc(context, ud); } return input; } #endif /** * Read input from a .cloog file, putting most of the information * in the returned CloogInput. The chosen language is put in * options->language. */ CloogInput *cloog_input_read(FILE *file, CloogOptions *options) { char line[MAX_STRING]; char language; CloogDomain *context; CloogUnionDomain *ud; int nb_par; #ifdef OSL_SUPPORT if (options->openscop) { osl_scop_p scop = osl_scop_read(file); CloogInput * input = cloog_input_from_osl_scop(options->state, scop); cloog_options_copy_from_osl_scop(scop, options); return input; } #endif /* First of all, we read the language to use. */ if (!next_line(file, line, sizeof(line))) cloog_die("Input error.\n"); if (sscanf(line, "%c", &language) != 1) cloog_die("Input error.\n"); if (language == 'f') options->language = CLOOG_LANGUAGE_FORTRAN; else options->language = CLOOG_LANGUAGE_C; /* We then read the context data. */ context = cloog_domain_read_context(options->state, file); nb_par = cloog_domain_parameter_dimension(context); ud = cloog_union_domain_read(file, nb_par, options); return cloog_input_alloc(context, ud); } /** * Create a CloogInput from a CloogDomain context and a CloogUnionDomain. */ CloogInput *cloog_input_alloc(CloogDomain *context, CloogUnionDomain *ud) { CloogInput *input; input = ALLOC(CloogInput); if (!input) cloog_die("memory overflow.\n"); input->context = context; input->ud = ud; return input; } void cloog_input_free(CloogInput *input) { cloog_domain_free(input->context); cloog_union_domain_free(input->ud); free(input); } static void print_names(FILE *file, CloogUnionDomain *ud, enum cloog_dim_type type, const char *name) { int i; fprintf(file, "\n%d # %s name(s)\n", ud->name[type] ? 1 : 0, name); if (!ud->name[type]) return; for (i = 0; i < ud->n_name[type]; i++) fprintf(file, "%s ", ud->name[type][i]); fprintf(file, "\n"); } /** * Dump the .cloog description of a CloogInput and a CloogOptions data structure * into a file. The generated .cloog file will contain the same information as * the data structures. The file can be used to run the cloog program on the * example. */ void cloog_input_dump_cloog(FILE *file, CloogInput *input, CloogOptions *opt) { int i, num_statements; CloogUnionDomain *ud = input->ud; CloogNamedDomainList *ndl = ud->domain; fprintf(file, "# CLooG -> CLooG\n" "# This is an automatic dump of a CLooG input file from a " "CloogInput data\n" "# structure.\n\n"); /* Language. */ if (opt->language == CLOOG_LANGUAGE_FORTRAN) { fprintf(file, "# Language: FORTRAN\n"); fprintf(file, "f\n\n"); } else { fprintf(file, "# Language: C\n"); fprintf(file, "c\n\n"); } /* Context. */ fprintf(file, "# Context:\n"); cloog_domain_print_constraints(file, input->context, 1); print_names(file, ud, CLOOG_PARAM, "Parameter"); /* Statement number. */ i = 0; while (ndl != NULL) { i++; ndl = ndl->next; } num_statements = i; fprintf(file, "\n# Statement number:\n%d\n\n", num_statements); /* Iteration domains. */ i = 1; ndl = ud->domain; while (ndl != NULL) { fprintf(file, "# Iteration domain of statement %d (%s).\n", i, ndl->name); cloog_domain_print_constraints(file, ndl->domain, 1); fprintf(file,"\n0 0 0 # For future options.\n\n"); i++; ndl = ndl->next; } print_names(file, ud, CLOOG_ITER, "Iterator"); /* Exit, if no scattering is supplied. */ if (!ud->domain || !ud->domain->scattering) { fprintf(file, "# No scattering functions.\n0\n\n"); return; } /* Scattering relations. */ fprintf(file, "# --------------------- SCATTERING --------------------\n"); fprintf(file, "%d # Scattering functions\n", num_statements); i = 1; ndl = ud->domain; while (ndl != NULL) { fprintf(file, "\n# Scattering of statement %d (%s).\n", i, ndl->name); cloog_scattering_print_constraints(file, ndl->scattering); i++; ndl = ndl->next; } print_names(file, ud, CLOOG_SCAT, "Scattering dimension"); } cloog-0.18.2/source/mp_get_memory_functions.c0000664000175000017500000000056512254312305016232 00000000000000#include void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)) { if (alloc_func_ptr) *alloc_func_ptr = __gmp_allocate_func; if (realloc_func_ptr) *realloc_func_ptr = __gmp_reallocate_func; if (free_func_ptr) *free_func_ptr = __gmp_free_func; } cloog-0.18.2/source/cloog.c0000664000175000017500000001142612254312305012400 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** cloog.c ** **-------------------------------------------------------------------** ** First version: october 25th 2001, CLooG's birth date ! ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ # include # include # include "../include/cloog/cloog.h" int main(int argv, char * argc[]) { CloogProgram * program ; CloogOptions * options ; CloogState *state; FILE * input, * output ; state = cloog_state_malloc(); /* Options and input/output file setting. */ cloog_options_read(state, argv, argc, &input, &output, &options); /* Reading the program informations. */ program = cloog_program_read(input,options) ; fclose(input) ; /* Generating and printing the code. */ program = cloog_program_generate(program,options) ; if (options->structure) cloog_program_print(stdout,program) ; cloog_program_pprint(output,program,options) ; cloog_program_free(program) ; /* Printing the allocation statistics if asked. */ if (options->leaks) { fprintf(output,"/* Domains : allocated=%5d, freed=%5d, max=%5d. */\n", state->domain_allocated, state->domain_freed, state->domain_max); fprintf(output,"/* Loops : allocated=%5d, freed=%5d, max=%5d. */\n", state->loop_allocated, state->loop_freed, state->loop_max); fprintf(output,"/* Statements : allocated=%5d, freed=%5d, max=%5d. */\n", state->statement_allocated, state->statement_freed, state->statement_max); fprintf(output,"/* Blocks : allocated=%5d, freed=%5d, max=%5d. */\n", state->block_allocated, state->block_freed, state->block_max); } /* Inform the user in case of a problem with the allocation statistics. */ if ((state->domain_allocated != state->domain_freed) || (state->loop_allocated != state->loop_freed) || (state->statement_allocated != state->statement_freed) || (state->block_allocated != state->block_freed)) { cloog_msg(options, CLOOG_INFO, "an internal problem has been detected (it should have" " no\n consequence on the correctness of the output)." " Please send (if\n you can) your input file, the first line " "given by typing 'cloog -v'\n and your full command " "line call to CLooG including options to\n . Thank you for your participation to get\n" " CLooG better and safer.\n") ; } cloog_options_free(options) ; cloog_state_free(state); fclose(output) ; return 0; } cloog-0.18.2/source/clast.c0000664000175000017500000020010212254312305012372 00000000000000#include #include #include #include "../include/cloog/cloog.h" #define ALLOC(type) (type*)malloc(sizeof(type)) #define ALLOCN(type,n) (type*)malloc((n)*sizeof(type)) /** * CloogInfos structure: * this structure contains all the informations necessary for pretty printing, * they come from the original CloogProgram structure (language, names), from * genereral options (options) or are built only for pretty printing (stride). * This structure is mainly there to reduce the number of function parameters, * since most pprint.c functions need most of its field. */ struct clooginfos { CloogState *state; /**< State. */ CloogStride **stride; int stride_level; /**< Number of valid entries in stride array. */ int nb_scattdims ; /**< Scattering dimension number. */ int * scaldims ; /**< Boolean array saying whether a given * scattering dimension is scalar or not. */ CloogNames * names ; /**< Names of iterators and parameters. */ CloogOptions * options ; /**< Options on CLooG's behaviour. */ CloogEqualities *equal; /**< Matrix of equalities. */ } ; typedef struct clooginfos CloogInfos ; static int clast_expr_cmp(struct clast_expr *e1, struct clast_expr *e2); static int clast_term_cmp(struct clast_term *t1, struct clast_term *t2); static int clast_binary_cmp(struct clast_binary *b1, struct clast_binary *b2); static int clast_reduction_cmp(struct clast_reduction *r1, struct clast_reduction *r2); static struct clast_expr *clast_expr_copy(struct clast_expr *e); static int clast_equal_add(CloogEqualities *equal, CloogConstraintSet *constraints, int level, CloogConstraint *constraint, CloogInfos *infos); static struct clast_stmt *clast_equal(int level, CloogInfos *infos); static struct clast_expr *clast_minmax(CloogConstraintSet *constraints, int level, int max, int guard, int lower_bound, int no_earlier, CloogInfos *infos); static void insert_guard(CloogConstraintSet *constraints, int level, struct clast_stmt ***next, CloogInfos *infos); static int insert_modulo_guard(CloogConstraint *upper, CloogConstraint *lower, int level, struct clast_stmt ***next, CloogInfos *infos); static int insert_equation(CloogDomain *domain, CloogConstraint *upper, CloogConstraint *lower, int level, struct clast_stmt ***next, CloogInfos *infos); static int insert_for(CloogDomain *domain, CloogConstraintSet *constraints, int level, int otl, struct clast_stmt ***next, CloogInfos *infos); static void insert_block(CloogDomain *domain, CloogBlock *block, int level, struct clast_stmt ***next, CloogInfos *infos); static void insert_loop(CloogLoop * loop, int level, struct clast_stmt ***next, CloogInfos *infos); struct clast_name *new_clast_name(const char *name) { struct clast_name *n = malloc(sizeof(struct clast_name)); n->expr.type = clast_expr_name; n->name = name; return n; } struct clast_term *new_clast_term(cloog_int_t c, struct clast_expr *v) { struct clast_term *t = malloc(sizeof(struct clast_term)); t->expr.type = clast_expr_term; cloog_int_init(t->val); cloog_int_set(t->val, c); t->var = v; return t; } struct clast_binary *new_clast_binary(enum clast_bin_type t, struct clast_expr *lhs, cloog_int_t rhs) { struct clast_binary *b = malloc(sizeof(struct clast_binary)); b->expr.type = clast_expr_bin; b->type = t; b->LHS = lhs; cloog_int_init(b->RHS); cloog_int_set(b->RHS, rhs); return b; } struct clast_reduction *new_clast_reduction(enum clast_red_type t, int n) { int i; struct clast_reduction *r; r = malloc(sizeof(struct clast_reduction)+(n-1)*sizeof(struct clast_expr *)); r->expr.type = clast_expr_red; r->type = t; r->n = n; for (i = 0; i < n; ++i) r->elts[i] = NULL; return r; } static void free_clast_root(struct clast_stmt *s); const struct clast_stmt_op stmt_root = { free_clast_root }; static void free_clast_root(struct clast_stmt *s) { struct clast_root *r = (struct clast_root *)s; assert(CLAST_STMT_IS_A(s, stmt_root)); cloog_names_free(r->names); free(r); } struct clast_root *new_clast_root(CloogNames *names) { struct clast_root *r = malloc(sizeof(struct clast_root)); r->stmt.op = &stmt_root; r->stmt.next = NULL; r->names = cloog_names_copy(names); return r; } static void free_clast_assignment(struct clast_stmt *s); const struct clast_stmt_op stmt_ass = { free_clast_assignment }; static void free_clast_assignment(struct clast_stmt *s) { struct clast_assignment *a = (struct clast_assignment *)s; assert(CLAST_STMT_IS_A(s, stmt_ass)); free_clast_expr(a->RHS); free(a); } struct clast_assignment *new_clast_assignment(const char *lhs, struct clast_expr *rhs) { struct clast_assignment *a = malloc(sizeof(struct clast_assignment)); a->stmt.op = &stmt_ass; a->stmt.next = NULL; a->LHS = lhs; a->RHS = rhs; return a; } static void free_clast_user_stmt(struct clast_stmt *s); const struct clast_stmt_op stmt_user = { free_clast_user_stmt }; static void free_clast_user_stmt(struct clast_stmt *s) { struct clast_user_stmt *u = (struct clast_user_stmt *)s; assert(CLAST_STMT_IS_A(s, stmt_user)); cloog_domain_free(u->domain); cloog_statement_free(u->statement); cloog_clast_free(u->substitutions); free(u); } struct clast_user_stmt *new_clast_user_stmt(CloogDomain *domain, CloogStatement *stmt, struct clast_stmt *subs) { struct clast_user_stmt *u = malloc(sizeof(struct clast_user_stmt)); u->stmt.op = &stmt_user; u->stmt.next = NULL; u->domain = cloog_domain_copy(domain); u->statement = cloog_statement_copy(stmt); u->substitutions = subs; return u; } static void free_clast_block(struct clast_stmt *b); const struct clast_stmt_op stmt_block = { free_clast_block }; static void free_clast_block(struct clast_stmt *s) { struct clast_block *b = (struct clast_block *)s; assert(CLAST_STMT_IS_A(s, stmt_block)); cloog_clast_free(b->body); free(b); } struct clast_block *new_clast_block() { struct clast_block *b = malloc(sizeof(struct clast_block)); b->stmt.op = &stmt_block; b->stmt.next = NULL; b->body = NULL; return b; } static void free_clast_for(struct clast_stmt *s); const struct clast_stmt_op stmt_for = { free_clast_for }; static void free_clast_for(struct clast_stmt *s) { struct clast_for *f = (struct clast_for *)s; assert(CLAST_STMT_IS_A(s, stmt_for)); cloog_domain_free(f->domain); free_clast_expr(f->LB); free_clast_expr(f->UB); cloog_int_clear(f->stride); cloog_clast_free(f->body); if (f->private_vars) free(f->private_vars); if (f->reduction_vars) free(f->reduction_vars); free(f); } struct clast_for *new_clast_for(CloogDomain *domain, const char *it, struct clast_expr *LB, struct clast_expr *UB, CloogStride *stride) { struct clast_for *f = malloc(sizeof(struct clast_for)); f->stmt.op = &stmt_for; f->stmt.next = NULL; f->domain = cloog_domain_copy(domain); f->iterator = it; f->LB = LB; f->UB = UB; f->body = NULL; f->parallel = CLAST_PARALLEL_NOT; f->private_vars = NULL; f->reduction_vars = NULL; cloog_int_init(f->stride); if (stride) cloog_int_set(f->stride, stride->stride); else cloog_int_set_si(f->stride, 1); return f; } static void free_clast_guard(struct clast_stmt *s); const struct clast_stmt_op stmt_guard = { free_clast_guard }; static void free_clast_guard(struct clast_stmt *s) { int i; struct clast_guard *g = (struct clast_guard *)s; assert(CLAST_STMT_IS_A(s, stmt_guard)); cloog_clast_free(g->then); for (i = 0; i < g->n; ++i) { free_clast_expr(g->eq[i].LHS); free_clast_expr(g->eq[i].RHS); } free(g); } struct clast_guard *new_clast_guard(int n) { int i; struct clast_guard *g = malloc(sizeof(struct clast_guard) + (n-1) * sizeof(struct clast_equation)); g->stmt.op = &stmt_guard; g->stmt.next = NULL; g->then = NULL; g->n = n; for (i = 0; i < n; ++i) { g->eq[i].LHS = NULL; g->eq[i].RHS = NULL; } return g; } void free_clast_name(struct clast_name *n) { free(n); } void free_clast_term(struct clast_term *t) { cloog_int_clear(t->val); free_clast_expr(t->var); free(t); } void free_clast_binary(struct clast_binary *b) { cloog_int_clear(b->RHS); free_clast_expr(b->LHS); free(b); } void free_clast_reduction(struct clast_reduction *r) { int i; for (i = 0; i < r->n; ++i) free_clast_expr(r->elts[i]); free(r); } void free_clast_expr(struct clast_expr *e) { if (!e) return; switch (e->type) { case clast_expr_name: free_clast_name((struct clast_name*) e); break; case clast_expr_term: free_clast_term((struct clast_term*) e); break; case clast_expr_red: free_clast_reduction((struct clast_reduction*) e); break; case clast_expr_bin: free_clast_binary((struct clast_binary*) e); break; default: assert(0); } } void free_clast_stmt(struct clast_stmt *s) { assert(s->op); assert(s->op->free); s->op->free(s); } void cloog_clast_free(struct clast_stmt *s) { struct clast_stmt *next; while (s) { next = s->next; free_clast_stmt(s); s = next; } } static int clast_name_cmp(struct clast_name *n1, struct clast_name *n2) { return n1->name == n2->name ? 0 : strcmp(n1->name, n2->name); } static int clast_term_cmp(struct clast_term *t1, struct clast_term *t2) { int c; if (!t1->var && t2->var) return -1; if (t1->var && !t2->var) return 1; c = clast_expr_cmp(t1->var, t2->var); if (c) return c; return cloog_int_cmp(t1->val, t2->val); } static int clast_binary_cmp(struct clast_binary *b1, struct clast_binary *b2) { int c; if (b1->type != b2->type) return b1->type - b2->type; if ((c = cloog_int_cmp(b1->RHS, b2->RHS))) return c; return clast_expr_cmp(b1->LHS, b2->LHS); } static int clast_reduction_cmp(struct clast_reduction *r1, struct clast_reduction *r2) { int i; int c; if (r1->n == 1 && r2->n == 1) return clast_expr_cmp(r1->elts[0], r2->elts[0]); if (r1->type != r2->type) return r1->type - r2->type; if (r1->n != r2->n) return r1->n - r2->n; for (i = 0; i < r1->n; ++i) if ((c = clast_expr_cmp(r1->elts[i], r2->elts[i]))) return c; return 0; } static int clast_expr_cmp(struct clast_expr *e1, struct clast_expr *e2) { if (!e1 && !e2) return 0; if (!e1) return -1; if (!e2) return 1; if (e1->type != e2->type) return e1->type - e2->type; switch (e1->type) { case clast_expr_name: return clast_name_cmp((struct clast_name*) e1, (struct clast_name*) e2); case clast_expr_term: return clast_term_cmp((struct clast_term*) e1, (struct clast_term*) e2); case clast_expr_bin: return clast_binary_cmp((struct clast_binary*) e1, (struct clast_binary*) e2); case clast_expr_red: return clast_reduction_cmp((struct clast_reduction*) e1, (struct clast_reduction*) e2); default: assert(0); } } int clast_expr_equal(struct clast_expr *e1, struct clast_expr *e2) { return clast_expr_cmp(e1, e2) == 0; } /** * Return 1 is both expressions are constant terms and e1 is bigger than e2. */ int clast_expr_is_bigger_constant(struct clast_expr *e1, struct clast_expr *e2) { struct clast_term *t1, *t2; struct clast_reduction *r; if (!e1 || !e2) return 0; if (e1->type == clast_expr_red) { r = (struct clast_reduction *)e1; return r->n == 1 && clast_expr_is_bigger_constant(r->elts[0], e2); } if (e2->type == clast_expr_red) { r = (struct clast_reduction *)e2; return r->n == 1 && clast_expr_is_bigger_constant(e1, r->elts[0]); } if (e1->type != clast_expr_term || e2->type != clast_expr_term) return 0; t1 = (struct clast_term *)e1; t2 = (struct clast_term *)e2; if (t1->var || t2->var) return 0; return cloog_int_gt(t1->val, t2->val); } static int qsort_expr_cmp(const void *p1, const void *p2) { return clast_expr_cmp(*(struct clast_expr **)p1, *(struct clast_expr **)p2); } static void clast_reduction_sort(struct clast_reduction *r) { qsort(&r->elts[0], r->n, sizeof(struct clast_expr *), qsort_expr_cmp); } static int qsort_eq_cmp(const void *p1, const void *p2) { struct clast_equation *eq1 = (struct clast_equation *)p1; struct clast_equation *eq2 = (struct clast_equation *)p2; int cmp; cmp = clast_expr_cmp(eq1->LHS, eq2->LHS); if (cmp) return cmp; cmp = clast_expr_cmp(eq1->RHS, eq2->RHS); if (cmp) return cmp; return eq1->sign - eq2->sign; } /** * Sort equations in a clast_guard. */ static void clast_guard_sort(struct clast_guard *g) { qsort(&g->eq[0], g->n, sizeof(struct clast_equation), qsort_eq_cmp); } /** * Construct a (deep) copy of an expression clast. */ static struct clast_expr *clast_expr_copy(struct clast_expr *e) { if (!e) return NULL; switch (e->type) { case clast_expr_name: { struct clast_name* n = (struct clast_name*) e; return &new_clast_name(n->name)->expr; } case clast_expr_term: { struct clast_term* t = (struct clast_term*) e; return &new_clast_term(t->val, clast_expr_copy(t->var))->expr; } case clast_expr_red: { int i; struct clast_reduction *r = (struct clast_reduction*) e; struct clast_reduction *r2 = new_clast_reduction(r->type, r->n); for (i = 0; i < r->n; ++i) r2->elts[i] = clast_expr_copy(r->elts[i]); return &r2->expr; } case clast_expr_bin: { struct clast_binary *b = (struct clast_binary*) e; return &new_clast_binary(b->type, clast_expr_copy(b->LHS), b->RHS)->expr; } default: assert(0); } } /****************************************************************************** * Equalities spreading functions * ******************************************************************************/ /** * clast_equal_allow function: * This function checks whether the options allow us to spread the equality or * not. It returns 1 if so, 0 otherwise. * - equal is the matrix of equalities, * - level is the column number in equal of the element which is 'equal to', * - line is the line number in equal of the constraint we want to study, * - the infos structure gives the user all options on code printing and more. ** * - October 27th 2005: first version (extracted from old pprint_equal_add). */ static int clast_equal_allow(CloogEqualities *equal, int level, int line, CloogInfos *infos) { if (level < infos->options->fsp) return 0 ; if ((cloog_equal_type(equal, level) == EQTYPE_EXAFFINE) && !infos->options->esp) return 0 ; return 1 ; } /** * clast_equal_add function: * This function updates the row (level-1) of the equality matrix (equal) with * the row that corresponds to the row (line) of the matrix (matrix). It returns * 1 if the row can be updated, 0 otherwise. * - equal is the matrix of equalities, * - matrix is the matrix of constraints, * - level is the column number in matrix of the element which is 'equal to', * - line is the line number in matrix of the constraint we want to study, * - the infos structure gives the user all options on code printing and more. */ static int clast_equal_add(CloogEqualities *equal, CloogConstraintSet *constraints, int level, CloogConstraint *constraint, CloogInfos *infos) { cloog_equal_add(equal, constraints, level, constraint, infos->names->nb_parameters); return clast_equal_allow(equal, level, level-1, infos); } /** * clast_equal function: * This function prints the substitution data of a statement into a clast_stmt. * Using this function instead of pprint_equal is useful for generating * a compilable pseudo-code by using preprocessor macro for each statement. * By opposition to pprint_equal, the result is less human-readable. For * instance this function will print (i,i+3,k,3) where pprint_equal would * return (j=i+3,l=3). * - level is the number of loops enclosing the statement, * - the infos structure gives the user all options on code printing and more. ** * - March 12th 2004: first version. * - November 21th 2005: (debug) now works well with GMP version. */ static struct clast_stmt *clast_equal(int level, CloogInfos *infos) { int i ; struct clast_expr *e; struct clast_stmt *a = NULL; struct clast_stmt **next = &a; CloogEqualities *equal = infos->equal; CloogConstraint *equal_constraint; for (i=infos->names->nb_scattering;inames); cloog_constraint_release(equal_constraint); } else { e = &new_clast_term(infos->state->one, &new_clast_name( cloog_names_name_at_level(infos->names, i+1))->expr)->expr; } *next = &new_clast_assignment(NULL, e)->stmt; next = &(*next)->next; } return a; } /** * clast_bound_from_constraint function: * This function returns a clast_expr containing the printing of the * 'right part' of a constraint according to an element. * For instance, for the constraint -3*i + 2*j - M >=0 and the element j, * we have j >= (3*i + M)/2. As we are looking for integral solutions, this * function should return 'ceild(3*i+M,2)'. * - matrix is the polyhedron containing all the constraints, * - line_num is the line number in domain of the constraint we want to print, * - level is the column number in domain of the element we want to use, * - names structure gives the user some options about code printing, * the number of parameters in domain (nb_par), and the arrays of iterator * names and parameters (iters and params). ** * - November 2nd 2001: first version. * - June 27th 2003: 64 bits version ready. */ struct clast_expr *clast_bound_from_constraint(CloogConstraint *constraint, int level, CloogNames *names) { int i, sign, nb_elts=0, len; cloog_int_t *line, numerator, denominator, temp, division; struct clast_expr *e = NULL; struct cloog_vec *line_vector; len = cloog_constraint_total_dimension(constraint) + 2; line_vector = cloog_vec_alloc(len); line = line_vector->p; cloog_constraint_copy_coefficients(constraint, line+1); cloog_int_init(temp); cloog_int_init(numerator); cloog_int_init(denominator); if (!cloog_int_is_zero(line[level])) { struct clast_reduction *r; /* Maybe we need to invert signs in such a way that the element sign is>0.*/ sign = -cloog_int_sgn(line[level]); for (i = 1, nb_elts = 0; i <= len - 1; ++i) if (i != level && !cloog_int_is_zero(line[i])) nb_elts++; r = new_clast_reduction(clast_red_sum, nb_elts); nb_elts = 0; /* First, we have to print the iterators and the parameters. */ for (i = 1; i <= len - 2; i++) { struct clast_expr *v; if (i == level || cloog_int_is_zero(line[i])) continue; v = cloog_constraint_variable_expr(constraint, i, names); if (sign == -1) cloog_int_neg(temp,line[i]); else cloog_int_set(temp,line[i]); r->elts[nb_elts++] = &new_clast_term(temp, v)->expr; } if (sign == -1) { cloog_int_neg(numerator, line[len - 1]); cloog_int_set(denominator, line[level]); } else { cloog_int_set(numerator, line[len - 1]); cloog_int_neg(denominator, line[level]); } /* Finally, the constant, and the final printing. */ if (nb_elts) { if (!cloog_int_is_zero(numerator)) r->elts[nb_elts++] = &new_clast_term(numerator, NULL)->expr; if (!cloog_int_is_one(line[level]) && !cloog_int_is_neg_one(line[level])) { if (!cloog_constraint_is_equality(constraint)) { if (cloog_int_is_pos(line[level])) e = &new_clast_binary(clast_bin_cdiv, &r->expr, denominator)->expr; else e = &new_clast_binary(clast_bin_fdiv, &r->expr, denominator)->expr; } else e = &new_clast_binary(clast_bin_div, &r->expr, denominator)->expr; } else e = &r->expr; } else { free_clast_reduction(r); if (cloog_int_is_zero(numerator)) e = &new_clast_term(numerator, NULL)->expr; else { if (!cloog_int_is_one(denominator)) { if (!cloog_constraint_is_equality(constraint)) { /* useful? */ if (cloog_int_is_divisible_by(numerator, denominator)) { cloog_int_divexact(temp, numerator, denominator); e = &new_clast_term(temp, NULL)->expr; } else { cloog_int_init(division); cloog_int_tdiv_q(division, numerator, denominator); if (cloog_int_is_neg(numerator)) { if (cloog_int_is_pos(line[level])) { /* nb<0 need max */ e = &new_clast_term(division, NULL)->expr; } else { /* nb<0 need min */ cloog_int_sub_ui(temp, division, 1); e = &new_clast_term(temp, NULL)->expr; } } else { if (cloog_int_is_pos(line[level])) { /* nb>0 need max */ cloog_int_add_ui(temp, division, 1); e = &new_clast_term(temp, NULL)->expr; } else /* nb>0 need min */ e = &new_clast_term(division, NULL)->expr; } cloog_int_clear(division); } } else e = &new_clast_binary(clast_bin_div, &new_clast_term(numerator, NULL)->expr, denominator)->expr; } else e = &new_clast_term(numerator, NULL)->expr; } } } cloog_vec_free(line_vector); cloog_int_clear(temp); cloog_int_clear(numerator); cloog_int_clear(denominator); return e; } /* Temporary structure for communication between clast_minmax and * its cloog_constraint_set_foreach_constraint callback functions. */ struct clast_minmax_data { int level; int max; int guard; int lower_bound; int no_earlier; CloogInfos *infos; int n; struct clast_reduction *r; }; /* Should constraint "c" be considered by clast_minmax? * * If d->no_earlier is set, then the constraint may not involve * any earlier variables. */ static int valid_bound(CloogConstraint *c, struct clast_minmax_data *d) { int i; if (d->max && !cloog_constraint_is_lower_bound(c, d->level - 1)) return 0; if (!d->max && !cloog_constraint_is_upper_bound(c, d->level - 1)) return 0; if (cloog_constraint_is_equality(c)) return 0; if (d->guard && cloog_constraint_involves(c, d->guard - 1)) return 0; if (d->no_earlier) for (i = 0; i < d->level - 1; ++i) if (cloog_constraint_involves(c, i)) return 0; return 1; } /* Increment n for each bound that should be considered by clast_minmax. */ static int count_bounds(CloogConstraint *c, void *user) { struct clast_minmax_data *d = (struct clast_minmax_data *) user; if (!valid_bound(c, d)) return 0; d->n++; return 0; } /* Update the given lower bound based on stride information, * for those cases where the stride offset is represented by * a constraint. * Note that cloog_loop_stride may have already performed a * similar update of the lower bounds, but the updated lower * bounds may have been eliminated because they are redundant * by definition. On the other hand, performing the update * on an already updated constraint is an identity operation * and is therefore harmless. */ static CloogConstraint *update_lower_bound_c(CloogConstraint *c, int level, CloogStride *stride) { if (!stride->constraint) return c; return cloog_constraint_stride_lower_bound(c, level, stride); } /* Update the given lower bound based on stride information. * If the stride offset is represented by a constraint, * then we have already performed the update in update_lower_bound_c. * Otherwise, the original lower bound is known to be a constant. * If the bound has already been updated and it just happens * to be a constant, then this function performs an identity * operation on the constant. */ static void update_lower_bound(struct clast_expr *expr, int level, CloogStride *stride) { struct clast_term *t; if (stride->constraint) return; if (expr->type != clast_expr_term) return; t = (struct clast_term *)expr; if (t->var) return; cloog_int_sub(t->val, t->val, stride->offset); cloog_int_cdiv_q(t->val, t->val, stride->stride); cloog_int_mul(t->val, t->val, stride->stride); cloog_int_add(t->val, t->val, stride->offset); } /* Add all relevant bounds to r->elts and update lower bounds * based on stride information. */ static int collect_bounds(CloogConstraint *c, void *user) { struct clast_minmax_data *d = (struct clast_minmax_data *) user; if (!valid_bound(c, d)) return 0; c = cloog_constraint_copy(c); if (d->lower_bound && d->infos->stride[d->level - 1]) c = update_lower_bound_c(c, d->level, d->infos->stride[d->level - 1]); d->r->elts[d->n] = clast_bound_from_constraint(c, d->level, d->infos->names); if (d->lower_bound && d->infos->stride[d->level - 1]) { update_lower_bound(d->r->elts[d->n], d->level, d->infos->stride[d->level - 1]); } cloog_constraint_release(c); d->n++; return 0; } /** * clast_minmax function: * This function returns a clast_expr containing the printing of a minimum or a * maximum of the 'right parts' of all constraints according to an element. * For instance consider the constraints: * -3*i +2*j -M >= 0 * 2*i +j >= 0 * -i -j +2*M >= 0 * if we are looking for the minimum for the element j, the function should * return 'max(ceild(3*i+M,2),-2*i)'. * - constraints is the constraints, * - level is the column number in domain of the element we want to use, * - max is a boolean set to 1 if we are looking for a maximum, 0 for a minimum, * - guard is set to 0 if there is no guard, and set to the level of the element * with a guard otherwise (then the function gives the max or the min only * for the constraint where the guarded coefficient is 0), * - lower is set to 1 if the maximum is to be used a lower bound on a loop * - no_earlier is set if no constraints should be used that involve * earlier dimensions, * - the infos structure gives the user some options about code printing, * the number of parameters in domain (nb_par), and the arrays of iterator * names and parameters (iters and params). ** * - November 2nd 2001: first version. */ static struct clast_expr *clast_minmax(CloogConstraintSet *constraints, int level, int max, int guard, int lower_bound, int no_earlier, CloogInfos *infos) { struct clast_minmax_data data = { level, max, guard, lower_bound, no_earlier, infos }; data.n = 0; cloog_constraint_set_foreach_constraint(constraints, count_bounds, &data); if (!data.n) return NULL; data.r = new_clast_reduction(max ? clast_red_max : clast_red_min, data.n); data.n = 0; cloog_constraint_set_foreach_constraint(constraints, collect_bounds, &data); clast_reduction_sort(data.r); return &data.r->expr; } /** * Insert modulo guards defined by existentially quantified dimensions, * not involving the given level. * * This function is called from within insert_guard. * Any constraint used in constructing a modulo guard is removed * from the constraint set to avoid insert_guard * adding a duplicate (pair of) constraint(s). * * Return the updated CloogConstraintSet. */ static CloogConstraintSet *insert_extra_modulo_guards( CloogConstraintSet *constraints, int level, struct clast_stmt ***next, CloogInfos *infos) { int i; int nb_iter; int total_dim; CloogConstraint *upper, *lower; total_dim = cloog_constraint_set_total_dimension(constraints); nb_iter = cloog_constraint_set_n_iterators(constraints, infos->names->nb_parameters); for (i = total_dim - infos->names->nb_parameters; i >= nb_iter + 1; i--) { if (cloog_constraint_is_valid(upper = cloog_constraint_set_defining_equality(constraints, i))) { if (!level || (nb_iter < level) || !cloog_constraint_involves(upper, level-1)) { insert_modulo_guard(upper, cloog_constraint_invalid(), i, next, infos); constraints = cloog_constraint_set_drop_constraint(constraints, upper); } cloog_constraint_release(upper); } else if (cloog_constraint_is_valid(upper = cloog_constraint_set_defining_inequalities(constraints, i, &lower, infos->names->nb_parameters))) { if (!level || (nb_iter < level) || !cloog_constraint_involves(upper, level-1)) { insert_modulo_guard(upper, lower, i, next, infos); constraints = cloog_constraint_set_drop_constraint(constraints, upper); constraints = cloog_constraint_set_drop_constraint(constraints, lower); } cloog_constraint_release(upper); cloog_constraint_release(lower); } } return constraints; } /* Temporary structure for communication between insert_guard and * its cloog_constraint_set_foreach_constraint callback function. */ struct clast_guard_data { int level; CloogInfos *infos; int n; int i; int nb_iter; CloogConstraintSet *copy; struct clast_guard *g; int min; int max; }; static int guard_count_bounds(CloogConstraint *c, void *user) { struct clast_guard_data *d = (struct clast_guard_data *) user; d->n++; return 0; } /* Insert a guard, if necesessary, for constraint j. * * If the constraint involves any earlier dimensions, then we have * already considered it during a previous iteration over the constraints. * * If we have already generated a min [max] for the current level d->i * and if the current constraint is an upper [lower] bound, then we * can skip the constraint as it will already have been used * in that previously generated min [max]. */ static int insert_guard_constraint(CloogConstraint *j, void *user) { int i; struct clast_guard_data *d = (struct clast_guard_data *) user; int minmax = -1; int individual_constraint; struct clast_expr *v; struct clast_term *t; if (!cloog_constraint_involves(j, d->i - 1)) return 0; for (i = 0; i < d->i - 1; ++i) if (cloog_constraint_involves(j, i)) return 0; if (d->level && d->nb_iter >= d->level && cloog_constraint_involves(j, d->level - 1)) return 0; individual_constraint = !d->level || cloog_constraint_is_equality(j); if (!individual_constraint) { if (d->max && cloog_constraint_is_lower_bound(j, d->i - 1)) return 0; if (d->min && cloog_constraint_is_upper_bound(j, d->i - 1)) return 0; } v = cloog_constraint_variable_expr(j, d->i, d->infos->names); d->g->eq[d->n].LHS = &(t = new_clast_term(d->infos->state->one, v))->expr; if (individual_constraint) { /* put the "denominator" in the LHS */ cloog_constraint_coefficient_get(j, d->i - 1, &t->val); cloog_constraint_coefficient_set(j, d->i - 1, d->infos->state->one); if (cloog_int_is_neg(t->val)) { cloog_int_neg(t->val, t->val); cloog_constraint_coefficient_set(j, d->i - 1, d->infos->state->negone); } if (d->level || cloog_constraint_is_equality(j)) d->g->eq[d->n].sign = 0; else if (cloog_constraint_is_lower_bound(j, d->i - 1)) d->g->eq[d->n].sign = 1; else d->g->eq[d->n].sign = -1; d->g->eq[d->n].RHS = clast_bound_from_constraint(j, d->i, d->infos->names); } else { int guarded; if (cloog_constraint_is_lower_bound(j, d->i - 1)) { minmax = 1; d->max = 1; d->g->eq[d->n].sign = 1; } else { minmax = 0; d->min = 1; d->g->eq[d->n].sign = -1; } guarded = (d->nb_iter >= d->level) ? d->level : 0 ; d->g->eq[d->n].RHS = clast_minmax(d->copy, d->i, minmax, guarded, 0, 1, d->infos); } d->n++; return 0; } /** * insert_guard function: * This function inserts a guard in the clast. * A guard on an element (level) is : * -> the conjunction of all the existing constraints where the coefficient of * this element is 0 if the element is an iterator, * -> the conjunction of all the existing constraints if the element isn't an * iterator. * For instance, considering these constraints and the element j: * -3*i +2*j -M >= 0 * 2*i +M >= 0 * this function should return 'if (2*i+M>=0) {'. * - matrix is the polyhedron containing all the constraints, * - level is the column number of the element in matrix we want to use, * - the infos structure gives the user some options about code printing, * the number of parameters in matrix (nb_par), and the arrays of iterator * names and parameters (iters and params). ** * - November 3rd 2001: first version. * - November 14th 2001: a lot of 'purifications'. * - July 31th 2002: (debug) some guard parts are no more redundants. * - August 12th 2002: polyhedra union ('or' conditions) are now supported. * - October 27th 2005: polyhedra union ('or' conditions) are no more supported * (the need came from loop_simplify that may result in * domain unions, now it should be fixed directly in * cloog_loop_simplify). */ static void insert_guard(CloogConstraintSet *constraints, int level, struct clast_stmt ***next, CloogInfos *infos) { int total_dim; struct clast_guard_data data = { level, infos, 0 }; if (!constraints) return; data.copy = cloog_constraint_set_copy(constraints); data.copy = insert_extra_modulo_guards(data.copy, level, next, infos); cloog_constraint_set_foreach_constraint(constraints, guard_count_bounds, &data); data.g = new_clast_guard(data.n); data.n = 0; /* Well, it looks complicated because I wanted to have a particular, more * readable, ordering, obviously this function may be far much simpler ! */ data.nb_iter = cloog_constraint_set_n_iterators(constraints, infos->names->nb_parameters); /* We search for guard parts. */ total_dim = cloog_constraint_set_total_dimension(constraints); for (data.i = 1; data.i <= total_dim; data.i++) { data.min = 0; data.max = 0; cloog_constraint_set_foreach_constraint(data.copy, insert_guard_constraint, &data); } cloog_constraint_set_free(data.copy); data.g->n = data.n; if (data.n) { clast_guard_sort(data.g); **next = &data.g->stmt; *next = &data.g->then; } else free_clast_stmt(&data.g->stmt); } /** * Check if the constant "cst" satisfies the modulo guard that * would be introduced by insert_computed_modulo_guard. * The constant is assumed to have been reduced prior to calling * this function. */ static int constant_modulo_guard_is_satisfied(CloogConstraint *lower, cloog_int_t bound, cloog_int_t cst) { if (cloog_constraint_is_valid(lower)) return cloog_int_le(cst, bound); else return cloog_int_is_zero(cst); } /** * Insert a modulo guard "r % mod == 0" or "r % mod <= bound", * depending on whether lower represents a valid constraint. */ static void insert_computed_modulo_guard(struct clast_reduction *r, CloogConstraint *lower, cloog_int_t mod, cloog_int_t bound, struct clast_stmt ***next) { struct clast_expr *e; struct clast_guard *g; e = &new_clast_binary(clast_bin_mod, &r->expr, mod)->expr; g = new_clast_guard(1); if (!cloog_constraint_is_valid(lower)) { g->eq[0].LHS = e; cloog_int_set_si(bound, 0); g->eq[0].RHS = &new_clast_term(bound, NULL)->expr; g->eq[0].sign = 0; } else { g->eq[0].LHS = e; g->eq[0].RHS = &new_clast_term(bound, NULL)->expr; g->eq[0].sign = -1; } **next = &g->stmt; *next = &g->then; } /* Try and eliminate coefficients from a modulo constraint based on * stride information of an earlier level. * The modulo of the constraint being constructed is "m". * The stride information at level "level" is given by "stride" * and indicated that the iterator i at level "level" is equal to * some expression modulo stride->stride. * If stride->stride is a multiple of "m' then i is also equal to * the expression modulo m and so we can eliminate the coefficient of i. * * If stride->constraint is NULL, then i has a constant value modulo m, stored * stride->offset. We simply multiply this constant with the coefficient * of i and add the result to the constant term, reducing it modulo m. * * If stride->constraint is not NULL, then it is a constraint of the form * * e + k i = s a * * with s equal to stride->stride, e an expression in terms of the * parameters and earlier iterators and a some arbitrary expression * in terms of existentially quantified variables. * stride->factor is a value f such that f * k = -1 mod s. * Adding stride->constraint f * c times to the current modulo constraint, * with c the coefficient of i eliminates i in favor of parameters and * earlier variables. */ static void eliminate_using_stride_constraint(cloog_int_t *line, int len, int nb_iter, CloogStride *stride, int level, cloog_int_t m) { if (!stride) return; if (!cloog_int_is_divisible_by(stride->stride, m)) return; if (stride->constraint) { int i, s_len; cloog_int_t t, v; cloog_int_init(t); cloog_int_init(v); cloog_int_mul(t, line[level], stride->factor); for (i = 1; i < level; ++i) { cloog_constraint_coefficient_get(stride->constraint, i - 1, &v); cloog_int_addmul(line[i], t, v); cloog_int_fdiv_r(line[i], line[i], m); } s_len = cloog_constraint_total_dimension(stride->constraint)+2; for (i = nb_iter + 1; i <= len - 2; ++i) { cloog_constraint_coefficient_get(stride->constraint, i - (len - s_len) - 1, &v); cloog_int_addmul(line[i], t, v); cloog_int_fdiv_r(line[i], line[i], m); } cloog_constraint_constant_get(stride->constraint, &v); cloog_int_addmul(line[len - 1], t, v); cloog_int_fdiv_r(line[len - 1], line[len - 1], m); cloog_int_clear(v); cloog_int_clear(t); } else { cloog_int_addmul(line[len - 1], line[level], stride->offset); cloog_int_fdiv_r(line[len - 1], line[len - 1], m); } cloog_int_set_si(line[level], 0); } /* Temporary structure for communication between insert_modulo_guard and * its cloog_constraint_set_foreach_constraint callback function. */ struct clast_modulo_guard_data { CloogConstraint *lower; int level; struct clast_stmt ***next; CloogInfos *infos; int empty; cloog_int_t val, bound; }; /* Insert a modulo guard for constraint c. * The constraint may be either an equality or an inequality. * Since this function returns -1, it is only called on a single constraint. * In case of an inequality, the constraint is usually an upper bound * on d->level. However, if this variable is an existentially * quantified variable, the upper bound constraint may get removed * as trivially holding and then this function is called with * a lower bound instead. In this case, we need to adjust the constraint * based on the sum of the constant terms of the lower and upper bound * stored in d->bound. */ static int insert_modulo_guard_constraint(CloogConstraint *c, void *user) { struct clast_modulo_guard_data *d = (struct clast_modulo_guard_data *) user; int level = d->level; CloogInfos *infos = d->infos; int i, nb_elts = 0, len, nb_iter, nb_par; int constant; struct cloog_vec *line_vector; cloog_int_t *line; len = cloog_constraint_total_dimension(c) + 2; nb_par = infos->names->nb_parameters; nb_iter = len - 2 - nb_par; line_vector = cloog_vec_alloc(len); line = line_vector->p; cloog_constraint_copy_coefficients(c, line + 1); if (cloog_int_is_pos(line[level])) { cloog_seq_neg(line + 1, line + 1, len - 1); if (!cloog_constraint_is_equality(c)) cloog_int_add(line[len - 1], line[len - 1], d->bound); } cloog_int_neg(line[level], line[level]); assert(cloog_int_is_pos(line[level])); nb_elts = 0; for (i = 1; i <= len-1; ++i) { if (i == level) continue; cloog_int_fdiv_r(line[i], line[i], line[level]); if (cloog_int_is_zero(line[i])) continue; if (i == len-1) continue; nb_elts++; } if (nb_elts || !cloog_int_is_zero(line[len-1])) { struct clast_reduction *r; const char *name; r = new_clast_reduction(clast_red_sum, nb_elts + 1); nb_elts = 0; /* First, the modulo guard : the iterators... */ i = level - 1; if (i > infos->stride_level) i = infos->stride_level; for (; i >= 1; --i) eliminate_using_stride_constraint(line, len, nb_iter, infos->stride[i - 1], i, line[level]); for (i=1;i<=nb_iter;i++) { if (i == level || cloog_int_is_zero(line[i])) continue; name = cloog_names_name_at_level(infos->names, i); r->elts[nb_elts++] = &new_clast_term(line[i], &new_clast_name(name)->expr)->expr; } /* ...the parameters... */ for (i=nb_iter+1;i<=len-2;i++) { if (cloog_int_is_zero(line[i])) continue; name = infos->names->parameters[i-nb_iter-1] ; r->elts[nb_elts++] = &new_clast_term(line[i], &new_clast_name(name)->expr)->expr; } constant = nb_elts == 0; /* ...the constant. */ if (!cloog_int_is_zero(line[len-1])) r->elts[nb_elts++] = &new_clast_term(line[len-1], NULL)->expr; /* our initial computation may have been an overestimate */ r->n = nb_elts; if (constant) { d->empty = !constant_modulo_guard_is_satisfied(d->lower, d->bound, line[len - 1]); free_clast_reduction(r); } else insert_computed_modulo_guard(r, d->lower, line[level], d->bound, d->next); } cloog_vec_free(line_vector); return -1; } /** * insert_modulo_guard: * This function inserts a modulo guard corresponding to an equality * or a pair of inequalities. * Returns 0 if the modulo guard is discovered to be unsatisfiable. * * See insert_equation. * - matrix is the polyhedron containing all the constraints, * - upper and lower are the line numbers of the constraint in matrix * we want to print; in particular, if we want to print an equality, * then lower == -1 and upper is the row of the equality; if we want * to print an inequality, then upper is the row of the upper bound * and lower in the row of the lower bound * - level is the column number of the element in matrix we want to use, * - the infos structure gives the user some options about code printing, * the number of parameters in matrix (nb_par), and the arrays of iterator * names and parameters (iters and params). */ static int insert_modulo_guard(CloogConstraint *upper, CloogConstraint *lower, int level, struct clast_stmt ***next, CloogInfos *infos) { int nb_par; CloogConstraintSet *set; struct clast_modulo_guard_data data = { lower, level, next, infos, 0 }; cloog_int_init(data.val); cloog_constraint_coefficient_get(upper, level-1, &data.val); if (cloog_int_is_one(data.val) || cloog_int_is_neg_one(data.val)) { cloog_int_clear(data.val); return 1; } nb_par = infos->names->nb_parameters; cloog_int_init(data.bound); /* Check if would be emitting the redundant constraint mod(e,m) <= m-1 */ if (cloog_constraint_is_valid(lower)) { cloog_constraint_constant_get(upper, &data.val); cloog_constraint_constant_get(lower, &data.bound); cloog_int_add(data.bound, data.val, data.bound); cloog_constraint_coefficient_get(lower, level-1, &data.val); cloog_int_sub_ui(data.val, data.val, 1); if (cloog_int_eq(data.val, data.bound)) { cloog_int_clear(data.val); cloog_int_clear(data.bound); return 1; } } if (cloog_constraint_needs_reduction(upper, level)) { set = cloog_constraint_set_for_reduction(upper, lower); set = cloog_constraint_set_reduce(set, level, infos->equal, nb_par, &data.bound); cloog_constraint_set_foreach_constraint(set, insert_modulo_guard_constraint, &data); cloog_constraint_set_free(set); } else insert_modulo_guard_constraint(upper, &data); cloog_int_clear(data.val); cloog_int_clear(data.bound); return !data.empty; } /** * We found an equality or a pair of inequalities identifying * a loop with a single iteration, but the user wants us to generate * a loop anyway, so we do it here. */ static int insert_equation_as_loop(CloogDomain *domain, CloogConstraint *upper, CloogConstraint *lower, int level, struct clast_stmt ***next, CloogInfos *infos) { const char *iterator = cloog_names_name_at_level(infos->names, level); struct clast_expr *e1, *e2; struct clast_for *f; e2 = clast_bound_from_constraint(upper, level, infos->names); if (!cloog_constraint_is_valid(lower)) e1 = clast_expr_copy(e2); else e1 = clast_bound_from_constraint(lower, level, infos->names); f = new_clast_for(domain, iterator, e1, e2, infos->stride[level-1]); **next = &f->stmt; *next = &f->body; cloog_constraint_release(lower); cloog_constraint_release(upper); return 1; } /** * insert_equation function: * This function inserts an equality * constraint according to an element in the clast. * Returns 1 if the calling function should recurse into inner loops. * * An equality can be preceded by a 'modulo guard'. * For instance, consider the constraint i -2*j = 0 and the * element j: pprint_equality should return 'if(i%2==0) { j = i/2 ;'. * - matrix is the polyhedron containing all the constraints, * - num is the line number of the constraint in matrix we want to print, * - level is the column number of the element in matrix we want to use, * - the infos structure gives the user some options about code printing, * the number of parameters in matrix (nb_par), and the arrays of iterator * names and parameters (iters and params). ** * - November 13th 2001: first version. * - June 26th 2003: simplification of the modulo guards (remove parts such as * modulo is 0, compare vivien or vivien2 with a previous * version for an idea). * - June 29th 2003: non-unit strides support. * - July 14th 2003: (debug) no more print the constant in the modulo guard when * it was previously included in a stride calculation. */ static int insert_equation(CloogDomain *domain, CloogConstraint *upper, CloogConstraint *lower, int level, struct clast_stmt ***next, CloogInfos *infos) { struct clast_expr *e; struct clast_assignment *ass; if (!infos->options->otl) return insert_equation_as_loop(domain, upper, lower, level, next, infos); if (!insert_modulo_guard(upper, lower, level, next, infos)) { cloog_constraint_release(lower); cloog_constraint_release(upper); return 0; } if (cloog_constraint_is_valid(lower) || !clast_equal_add(infos->equal, NULL, level, upper, infos)) { /* Finally, the equality. */ /* If we have to make a block by dimension, we start the block. Function * pprint knows if there is an equality, if this is the case, it checks * for the same following condition to close the brace. */ if (infos->options->block) { struct clast_block *b = new_clast_block(); **next = &b->stmt; *next = &b->body; } e = clast_bound_from_constraint(upper, level, infos->names); ass = new_clast_assignment(cloog_names_name_at_level(infos->names, level), e); **next = &ass->stmt; *next = &(**next)->next; } cloog_constraint_release(lower); cloog_constraint_release(upper); return 1; } /** * Insert a loop that is executed exactly once as an assignment. * In particular, the loop * * for (i = e; i <= e; ++i) { * S; * } * * is generated as * * i = e; * S; * */ static void insert_otl_for(CloogConstraintSet *constraints, int level, struct clast_expr *e, struct clast_stmt ***next, CloogInfos *infos) { const char *iterator; iterator = cloog_names_name_at_level(infos->names, level); if (!clast_equal_add(infos->equal, constraints, level, cloog_constraint_invalid(), infos)) { struct clast_assignment *ass; if (infos->options->block) { struct clast_block *b = new_clast_block(); **next = &b->stmt; *next = &b->body; } ass = new_clast_assignment(iterator, e); **next = &ass->stmt; *next = &(**next)->next; } else { free_clast_expr(e); } } /** * Insert a loop that is executed at most once as an assignment followed * by a guard. In particular, the loop * * for (i = e1; i <= e2; ++i) { * S; * } * * is generated as * * i = e1; * if (i <= e2) { * S; * } * */ static void insert_guarded_otl_for(CloogConstraintSet *constraints, int level, struct clast_expr *e1, struct clast_expr *e2, struct clast_stmt ***next, CloogInfos *infos) { const char *iterator; struct clast_assignment *ass; struct clast_guard *guard; iterator = cloog_names_name_at_level(infos->names, level); if (infos->options->block) { struct clast_block *b = new_clast_block(); **next = &b->stmt; *next = &b->body; } ass = new_clast_assignment(iterator, e1); **next = &ass->stmt; *next = &(**next)->next; guard = new_clast_guard(1); guard->eq[0].sign = -1; guard->eq[0].LHS = &new_clast_term(infos->state->one, &new_clast_name(iterator)->expr)->expr; guard->eq[0].RHS = e2; **next = &guard->stmt; *next = &guard->then; } /** * insert_for function: * This function inserts a for loop in the clast. * Returns 1 if the calling function should recurse into inner loops. * * A loop header according to an element is the conjunction of a minimum and a * maximum on a given element (they give the loop bounds). * For instance, considering these constraints and the element j: * i + j -9*M >= 0 * -j +5*M >= 0 * j -4*M >= 0 * this function should return 'for (j=max(-i+9*M,4*M),j<=5*M;j++) {'. * - constraints contains all constraints, * - level is the column number of the element in matrix we want to use, * - otl is set if the loop is executed at most once, * - the infos structure gives the user some options about code printing, * the number of parameters in matrix (nb_par), and the arrays of iterator * names and parameters (iters and params). */ static int insert_for(CloogDomain *domain, CloogConstraintSet *constraints, int level, int otl, struct clast_stmt ***next, CloogInfos *infos) { const char *iterator; struct clast_expr *e1; struct clast_expr *e2; e1 = clast_minmax(constraints, level, 1, 0, 1, 0, infos); e2 = clast_minmax(constraints, level, 0, 0, 0, 0, infos); if (clast_expr_is_bigger_constant(e1, e2)) { free_clast_expr(e1); free_clast_expr(e2); return 0; } /* If min and max are not equal there is a 'for' else, there is a '='. * In the special case e1 = e2 = NULL, this is an infinite loop * so this is not a '='. */ if (e1 && e2 && infos->options->otl && clast_expr_equal(e1, e2)) { free_clast_expr(e2); insert_otl_for(constraints, level, e1, next, infos); } else if (otl) { insert_guarded_otl_for(constraints, level, e1, e2, next, infos); } else { struct clast_for *f; iterator = cloog_names_name_at_level(infos->names, level); f = new_clast_for(domain, iterator, e1, e2, infos->stride[level-1]); **next = &f->stmt; *next = &f->body; } return 1; } /** * insert_block function: * This function inserts a statement block. * - block is the statement block, * - level is the number of loops enclosing the statement, * - the infos structure gives the user some options about code printing, * the number of parameters in domain (nb_par), and the arrays of iterator * names and parameters (iters and params). ** * - September 21th 2003: first version (pick from pprint function). */ static void insert_block(CloogDomain *domain, CloogBlock *block, int level, struct clast_stmt ***next, CloogInfos *infos) { CloogStatement * statement ; struct clast_stmt *subs; if (!block) return; for (statement = block->statement; statement; statement = statement->next) { CloogStatement *s_next = statement->next; subs = clast_equal(level,infos); statement->next = NULL; **next = &new_clast_user_stmt(domain, statement, subs)->stmt; statement->next = s_next; *next = &(**next)->next; } } /** * insert_loop function: * This function converts the content of a CloogLoop structure (loop) into a * clast_stmt (inserted at **next). * The iterator (level) of * the current loop is given by 'level': this is the column number of the * domain corresponding to the current loop iterator. The data of a loop are * written in this order: * 1. The guard of the loop, i.e. each constraint in the domain that does not * depend on the iterator (when the entry in the column 'level' is 0). * 2. The iteration domain of the iterator, given by the constraints in the * domain depending on the iterator, i.e.: * * an equality if the iterator has only one value (possibly preceded by * a guard verifying if this value is integral), *OR* * * a loop from the minimum possible value of the iterator to the maximum * possible value. * 3. The included statement block. * 4. The inner loops (recursive call). * 5. The following loops (recursive call). * - level is the recursion level or the iteration level that we are printing, * - the infos structure gives the user some options about code printing, * the number of parameters in domain (nb_par), and the arrays of iterator * names and parameters (iters and params). ** * - November 2nd 2001: first version. * - March 6th 2003: infinite domain support. * - April 19th 2003: (debug) NULL loop support. * - June 29th 2003: non-unit strides support. * - April 28th 2005: (debug) level is level+equality when print statement! * - June 16th 2005: (debug) the N. Vasilache normalization step has been * added to avoid iteration duplication (see DaeGon Kim * bug in cloog_program_generate). Try vasilache.cloog * with and without the call to cloog_polylib_matrix_normalize, * using -f 8 -l 9 options for an idea. * - September 15th 2005: (debug) don't close equality braces when unnecessary. * - October 16th 2005: (debug) scalar value is saved for next loops. */ static void insert_loop(CloogLoop * loop, int level, struct clast_stmt ***next, CloogInfos *infos) { int equality = 0; CloogConstraintSet *constraints, *temp; struct clast_stmt **top = *next; CloogConstraint *i, *j; int empty_loop = 0; /* It can happen that loop be NULL when an input polyhedron is empty. */ if (loop == NULL) return; /* The constraints do not always have a shape that allows us to generate code from it, * thus we normalize it, we also simplify it with the equalities. */ temp = cloog_domain_constraints(loop->domain); cloog_constraint_set_normalize(temp,level); constraints = cloog_constraint_set_simplify(temp,infos->equal,level, infos->names->nb_parameters); cloog_constraint_set_free(temp); if (level) { infos->stride[level - 1] = loop->stride; infos->stride_level++; } /* First of all we have to print the guard. */ insert_guard(constraints,level, next, infos); if (level && cloog_constraint_set_contains_level(constraints, level, infos->names->nb_parameters)) { /* We scan all the constraints to know in which case we are : * [[if] equation] or [for]. */ if (cloog_constraint_is_valid(i = cloog_constraint_set_defining_equality(constraints, level))) { empty_loop = !insert_equation(loop->unsimplified, i, cloog_constraint_invalid(), level, next, infos); equality = 1 ; } else if (cloog_constraint_is_valid(i = cloog_constraint_set_defining_inequalities(constraints, level, &j, infos->names->nb_parameters))) { empty_loop = !insert_equation(loop->unsimplified, i, j, level, next, infos); } else empty_loop = !insert_for(loop->unsimplified, constraints, level, loop->otl, next, infos); } if (!empty_loop) { /* Finally, if there is an included statement block, print it. */ insert_block(loop->unsimplified, loop->block, level+equality, next, infos); /* Go to the next level. */ if (loop->inner != NULL) insert_loop(loop->inner, level+1, next, infos); } if (level) { cloog_equal_del(infos->equal,level); infos->stride_level--; } cloog_constraint_set_free(constraints); /* Go to the next loop on the same level. */ while (*top) top = &(*top)->next; if (loop->next != NULL) insert_loop(loop->next, level, &top,infos); } struct clast_stmt *cloog_clast_create(CloogProgram *program, CloogOptions *options) { CloogInfos *infos = ALLOC(CloogInfos); int nb_levels; struct clast_stmt *root = &new_clast_root(program->names)->stmt; struct clast_stmt **next = &root->next; infos->state = options->state; infos->names = program->names; infos->options = options; infos->scaldims = program->scaldims; infos->nb_scattdims = program->nb_scattdims; /* Allocation for the array of strides, there is a +1 since the statement can * be included inside an external loop without iteration domain. */ nb_levels = program->names->nb_scattering+program->names->nb_iterators+1; infos->stride = ALLOCN(CloogStride *, nb_levels); infos->stride_level = 0; infos->equal = cloog_equal_alloc(nb_levels, nb_levels, program->names->nb_parameters); insert_loop(program->loop, 0, &next, infos); cloog_equal_free(infos->equal); free(infos->stride); free(infos); return root; } struct clast_stmt *cloog_clast_create_from_input(CloogInput *input, CloogOptions *options) { CloogProgram *program; struct clast_stmt *root; program = cloog_program_alloc(input->context, input->ud, options); free(input); program = cloog_program_generate(program, options); root = cloog_clast_create(program, options); cloog_program_free(program); return root; } /* Adds to the list if not already in it */ static int add_if_new(void **list, int num, void *new, int size) { int i; for (i=0; istmt).next, filter, &loops_next, &num_next_loops, &stmts_next, &num_next_stmts); *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); *nloops = concat_if_new((void **)loops, *nloops, loops_next, num_next_loops, sizeof(struct clast_stmt *)); free(loops_next); free(stmts_next); } if (CLAST_STMT_IS_A(node, stmt_guard)) { // printf("guard stmt\n"); struct clast_guard *guard = (struct clast_guard *) node; clast_filter(guard->then, filter, &loops_next, &num_next_loops, &stmts_next, &num_next_stmts); *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); *nloops = concat_if_new((void **)loops, *nloops, loops_next, num_next_loops, sizeof(struct clast_stmt *)); free(loops_next); free(stmts_next); clast_filter((guard->stmt).next, filter, &loops_next, &num_next_loops, &stmts_next, &num_next_stmts); *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); *nloops = concat_if_new((void **)loops, *nloops, loops_next, num_next_loops, sizeof(struct clast_stmt *)); free(loops_next); free(stmts_next); } if (CLAST_STMT_IS_A(node, stmt_user)) { struct clast_user_stmt *user_stmt = (struct clast_user_stmt *) node; // printf("user stmt: S%d\n", user_stmt->statement->number); ret = add_if_new((void **)stmts, *nstmts, &user_stmt->statement->number, sizeof(int)); if (ret) (*nstmts)++; clast_filter((user_stmt->stmt).next, filter, &loops_next, &num_next_loops, &stmts_next, &num_next_stmts); *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); *nloops = concat_if_new((void **)loops, *nloops, loops_next, num_next_loops, sizeof(struct clast_stmt *)); free(loops_next); free(stmts_next); } if (CLAST_STMT_IS_A(node, stmt_for)) { struct clast_for *for_stmt = (struct clast_for *) node; clast_filter(for_stmt->body, filter, &loops_next, &num_next_loops, &stmts_next, &num_next_stmts); *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); *nloops = concat_if_new((void **)loops, *nloops, loops_next, num_next_loops, sizeof(struct clast_stmt *)); if (iter == NULL || !strcmp(for_stmt->iterator, iter)) { if (stmts_filter == NULL || (filter_type == subset && list_compare(stmts_next, num_next_stmts, stmts_filter, nstmts_filter) <= 0) || (filter_type == exact && list_compare(stmts_next, num_next_stmts, stmts_filter, nstmts_filter) == 0 )) { ret = add_if_new((void **)loops, *nloops, &for_stmt, sizeof(struct clast_for *)); if (ret) (*nloops)++; } } free(loops_next); free(stmts_next); clast_filter((for_stmt->stmt).next, filter, &loops_next, &num_next_loops, &stmts_next, &num_next_stmts); *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); *nloops = concat_if_new((void **)loops, *nloops, loops_next, num_next_loops, sizeof(struct clast_stmt *)); free(loops_next); free(stmts_next); } } cloog-0.18.2/source/names.c0000664000175000017500000004301712254312305012401 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** names.c ** **-------------------------------------------------------------------** ** First version: august 1st 2002 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2002-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /* CAUTION: the english used for comments is probably the worst you ever read, * please feel free to correct and improve it ! */ # include # include # include # include "../include/cloog/cloog.h" /****************************************************************************** * Structure display function * ******************************************************************************/ /** * cloog_names_print function: * this function is a human-friendly way to display the CloogNames data * structure, it shows all the different fields and includes an indentation * level (level) in order to work with others print_structure functions. * - July 1st 2005: first version based on the old cloog_names_print function, * it was the first modification in this file since two years ! */ void cloog_names_print_structure(FILE * file, CloogNames * names, int level) { int i ; /* Go to the right level. */ for (i=0; inb_scalars) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the scalar iterators. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; if (names->nb_scalars > 0) { fprintf(file,"+-- Scalar iterator strings:") ; for (i=0;inb_scalars;i++) fprintf(file," %s",names->scalars[i]) ; fprintf(file,"\n") ; } else fprintf(file,"+-- No scalar string\n") ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the scattering dimension number. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; fprintf(file,"Scattering dimension number: %d\n",names->nb_scattering) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the scattering iterators. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; if (names->nb_scattering > 0) { fprintf(file,"+-- Scattering strings ----:") ; for (i=0;inb_scattering;i++) fprintf(file," %s",names->scattering[i]) ; fprintf(file,"\n") ; } else fprintf(file,"+-- No scattering string\n") ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the iterator number. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; fprintf(file,"Iterator number -----------: %d\n",names->nb_iterators) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the iterators. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; if (names->nb_iterators > 0) { fprintf(file,"+-- Iterator strings ------:") ; for (i=0;inb_iterators;i++) fprintf(file," %s",names->iterators[i]) ; fprintf(file,"\n") ; } else fprintf(file,"+-- No iterators\n") ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the parameter number. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; fprintf(file,"Parameter number ----------: %d\n",names->nb_parameters) ; /* A blank line. */ for (i=0; i<=level+1; i++) fprintf(file,"|\t") ; fprintf(file,"\n") ; /* Print the parameters. */ for (i=0; i<=level; i++) fprintf(file,"|\t") ; if (names->nb_parameters > 0) { fprintf(file,"+-- Parameter strings -----:") ; for (i=0;inb_parameters;i++) fprintf(file," %s",names->parameters[i]) ; fprintf(file,"\n") ; } else fprintf(file,"No parameters\n") ; } else fprintf(file,"+-- No CloogNames\n") ; fprintf(file, "Number of active references: %d\n", names->references); } /** * cloog_names_print function: * This function prints the content of a CloogNames structure (names) into a * file (file, possibly stdout). * - July 1st 2005: Now this function is only a frontend to * cloog_program_print_structure, with a quite better * human-readable representation. */ void cloog_names_print(FILE * file, CloogNames * names) { cloog_names_print_structure(file,names,0) ; } /****************************************************************************** * Memory deallocation function * ******************************************************************************/ /** * cloog_names_free function: * This function decrements the number of active references to * a CloogNames structure and frees the allocated memory for this structure * if the count drops to zero. */ void cloog_names_free(CloogNames * names) { int i ; if (--names->references) return; if (names->scalars != NULL) { for (i=0;inb_scalars;i++) free(names->scalars[i]) ; free(names->scalars) ; } if (names->scattering != NULL) { for (i=0;inb_scattering;i++) free(names->scattering[i]) ; free(names->scattering) ; } if (names->iterators != NULL) { for (i=0;inb_iterators;i++) free(names->iterators[i]) ; free(names->iterators) ; } if (names->parameters != NULL) { for (i=0;inb_parameters;i++) free(names->parameters[i]) ; free(names->parameters) ; } free(names) ; } /** * cloog_names_copy function: * As usual in CLooG, "copy" means incrementing the reference count. */ CloogNames *cloog_names_copy(CloogNames *names) { names->references++; return names; } /****************************************************************************** * Reading functions * ******************************************************************************/ /** * cloog_names_read_strings function: * This function reads names data from a file (file, possibly stdin). It first * reads the naming option to know if whether it can read the names from the * file. If not, NULL is returned. Otherwise, the names are stored * into an array of strings, and a pointer to this array is returned. * - nb_items is the number of names the function will have to read if the * naming option is set to read. */ char ** cloog_names_read_strings(FILE *file, int nb_items) { int i, option, n ; char s[MAX_STRING], str[MAX_STRING], * c, **names = NULL; /* We first read name option. */ while (fgets(s,MAX_STRING,file) == 0) ; while ((*s=='#' || *s=='\n') || (sscanf(s," %d",&option)<1)) fgets(s,MAX_STRING,file) ; /* If there is no item to read, then return NULL. */ if (nb_items == 0) return NULL ; /* If option is to read them in the file, then we do it and put them into * the array. */ if (option) { /* Memory allocation. */ names = (char **)malloc(nb_items*sizeof(char *)) ; if (names == NULL) cloog_die("memory overflow.\n"); for (i=0;inb_scalars = 0 ; names->nb_scattering = 0 ; names->nb_iterators = 0 ; names->nb_parameters = 0 ; names->scalars = NULL ; names->scattering = NULL ; names->iterators = NULL ; names->parameters = NULL ; names->references = 1; return names ; } /** * cloog_names_alloc function: * This function allocates the memory space for a CloogNames structure and * sets its fields with those given as input. Then it returns a pointer to the * allocated space. * - July 7th 2005: first version. * - September 11th 2005: addition of both scalar and scattering informations. * - November 21th 2005: use of cloog_names_malloc. */ CloogNames * cloog_names_alloc() { CloogNames * names ; /* Memory allocation for the CloogNames structure. */ names = cloog_names_malloc() ; names->nb_scalars = 0; names->nb_scattering = 0; names->nb_iterators = 0; names->nb_parameters = 0; names->scalars = NULL; names->scattering = NULL; names->iterators = NULL; names->parameters = NULL; return names ; } /** * cloog_names_generate_items function: * This function returns a pointer to an array of strings with entries set * based on the function's parameters. * - nb_items will be the number of entries in the string array. * - prefix is the name prefix of each item or NULL. * If not NULL, then the remainder of the name will be an integer * in the range [0, nb_items-1]. * - first_item is the name of the first item (if prefix == NULL), * the nb_items-1 following items will be the nb_items-1 * following letters in ASCII code. ** * - September 9th 2002 : first version, extracted from cloog_names_generate. */ char ** cloog_names_generate_items(int nb_items, char * prefix, char first_item) { int i ; char ** names ; if (nb_items == 0) return NULL ; names = (char **)malloc(nb_items*sizeof(char *)) ; if (names == NULL) cloog_die("memory overflow.\n"); for (i=0;inb_scalars = nb_scalars ; names->nb_scattering = nb_scattering ; names->nb_parameters = nb_parameters ; names->nb_iterators = nb_iterators ; names->scalars = cloog_names_generate_items(nb_scalars, NULL,first_s); names->scattering = cloog_names_generate_items(nb_scattering,NULL,first_t); names->parameters = cloog_names_generate_items(nb_parameters,NULL,first_p); names->iterators = cloog_names_generate_items(nb_iterators, NULL,first_i); return names ; } /* Lastly we update the CLoogNames structure: the iterators corresponding to * scalar dimensions have to be removed since these dimensions have been * erased and do not need to be print. We copy all the iterator names except * the scalar ones in a new string array. * - September 12th 2005: first version. */ void cloog_names_scalarize(CloogNames * names, int nb_scattdims, int * scaldims) { int nb_scalars, nb_scattering, i, current_scalar, current_scattering ; char ** scalars, ** scattering ; if (!nb_scattdims || (scaldims == NULL)) return ; nb_scalars = 0 ; for (i=0;inb_scattering - nb_scalars ; scattering = (char **)malloc(nb_scattering * sizeof(char *)) ; if (scattering == NULL) cloog_die("memory overflow.\n"); scalars = (char **)malloc(nb_scalars * sizeof(char *)) ; if (scalars == NULL) cloog_die("memory overflow.\n"); current_scalar = 0 ; current_scattering = 0 ; for (i=0;iscattering[i] ; current_scattering ++ ; } else { scalars[current_scalar] = names->scattering[i] ; current_scalar ++ ; } } free(names->scattering) ; names->scattering = scattering ; names->scalars = scalars ; names->nb_scattering = nb_scattering ; names->nb_scalars = nb_scalars ; } /** * Return the name at a given level (starting at one). * May be a scattering dimension or an iterator of the original domain. */ const char *cloog_names_name_at_level(CloogNames *names, int level) { if (level <= names->nb_scattering) return names->scattering[level - 1]; else return names->iterators[level - names->nb_scattering - 1]; } cloog-0.18.2/source/state.c0000664000175000017500000000205212254312305012410 00000000000000#include #include "../include/cloog/cloog.h" /** * Allocate state and initialize backend independent part. */ CloogState *cloog_core_state_malloc(void) { CloogState *state; state = (CloogState *)malloc(sizeof(CloogState)); if (!state) cloog_die("memory overflow.\n"); state->backend = NULL; cloog_int_init(state->zero); cloog_int_set_si(state->zero, 0); cloog_int_init(state->one); cloog_int_set_si(state->one, 1); cloog_int_init(state->negone); cloog_int_set_si(state->negone, -1); state->block_allocated = 0; state->block_freed = 0; state->block_max = 0; state->domain_allocated = 0; state->domain_freed = 0; state->domain_max = 0; state->loop_allocated = 0; state->loop_freed = 0; state->loop_max = 0; state->statement_allocated = 0; state->statement_freed = 0; state->statement_max = 0; return state; } /** * Free state. */ void cloog_core_state_free(CloogState *state) { cloog_int_clear(state->zero); cloog_int_clear(state->one); cloog_int_clear(state->negone); free(state); } cloog-0.18.2/source/pprint.c0000664000175000017500000004500112254312305012605 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** pprint.c ** **-------------------------------------------------------------------** ** First version: october 26th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /* CAUTION: the english used for comments is probably the worst you ever read, * please feel free to correct and improve it ! */ /* June 22nd 2005: General adaptation for GMP. * October 26th 2005: General adaptation from CloogDomain to Matrix data * structure for all constraint systems. * October 27th 2005: General adaptation from CloogEqual to Matrix data * structure for equality spreading. */ # include # include # include #include # include "../include/cloog/cloog.h" #ifdef OSL_SUPPORT #include #include #include #include #include #endif static void pprint_name(FILE *dst, struct clast_name *n); static void pprint_term(struct cloogoptions *i, FILE *dst, struct clast_term *t); static void pprint_sum(struct cloogoptions *opt, FILE *dst, struct clast_reduction *r); static void pprint_binary(struct cloogoptions *i, FILE *dst, struct clast_binary *b); static void pprint_minmax_f(struct cloogoptions *info, FILE *dst, struct clast_reduction *r); static void pprint_minmax_c(struct cloogoptions *info, FILE *dst, struct clast_reduction *r); static void pprint_reduction(struct cloogoptions *i, FILE *dst, struct clast_reduction *r); static void pprint_expr(struct cloogoptions *i, FILE *dst, struct clast_expr *e); static void pprint_equation(struct cloogoptions *i, FILE *dst, struct clast_equation *eq); static void pprint_assignment(struct cloogoptions *i, FILE *dst, struct clast_assignment *a); static void pprint_user_stmt(struct cloogoptions *options, FILE *dst, struct clast_user_stmt *u); static void pprint_guard(struct cloogoptions *options, FILE *dst, int indent, struct clast_guard *g); static void pprint_for(struct cloogoptions *options, FILE *dst, int indent, struct clast_for *f); static void pprint_stmt_list(struct cloogoptions *options, FILE *dst, int indent, struct clast_stmt *s); void pprint_name(FILE *dst, struct clast_name *n) { fprintf(dst, "%s", n->name); } /** * This function returns a string containing the printing of a value (possibly * an iterator or a parameter with its coefficient or a constant). * - val is the coefficient or constant value, * - name is a string containing the name of the iterator or of the parameter, */ void pprint_term(struct cloogoptions *i, FILE *dst, struct clast_term *t) { if (t->var) { int group = t->var->type == clast_expr_red && ((struct clast_reduction*) t->var)->n > 1; if (cloog_int_is_one(t->val)) ; else if (cloog_int_is_neg_one(t->val)) fprintf(dst, "-"); else { cloog_int_print(dst, t->val); fprintf(dst, "*"); } if (group) fprintf(dst, "("); pprint_expr(i, dst, t->var); if (group) fprintf(dst, ")"); } else cloog_int_print(dst, t->val); } void pprint_sum(struct cloogoptions *opt, FILE *dst, struct clast_reduction *r) { int i; struct clast_term *t; assert(r->n >= 1); assert(r->elts[0]->type == clast_expr_term); t = (struct clast_term *) r->elts[0]; pprint_term(opt, dst, t); for (i = 1; i < r->n; ++i) { assert(r->elts[i]->type == clast_expr_term); t = (struct clast_term *) r->elts[i]; if (cloog_int_is_pos(t->val)) fprintf(dst, "+"); pprint_term(opt, dst, t); } } void pprint_binary(struct cloogoptions *i, FILE *dst, struct clast_binary *b) { const char *s1 = NULL, *s2 = NULL, *s3 = NULL; int group = b->LHS->type == clast_expr_red && ((struct clast_reduction*) b->LHS)->n > 1; if (i->language == CLOOG_LANGUAGE_FORTRAN) { switch (b->type) { case clast_bin_fdiv: s1 = "FLOOR(REAL(", s2 = ")/REAL(", s3 = "))"; break; case clast_bin_cdiv: s1 = "CEILING(REAL(", s2 = ")/REAL(", s3 = "))"; break; case clast_bin_div: if (group) s1 = "(", s2 = ")/", s3 = ""; else s1 = "", s2 = "/", s3 = ""; break; case clast_bin_mod: s1 = "MOD(", s2 = ", ", s3 = ")"; break; } } else { switch (b->type) { case clast_bin_fdiv: s1 = "floord(", s2 = ",", s3 = ")"; break; case clast_bin_cdiv: s1 = "ceild(", s2 = ",", s3 = ")"; break; case clast_bin_div: if (group) s1 = "(", s2 = ")/", s3 = ""; else s1 = "", s2 = "/", s3 = ""; break; case clast_bin_mod: if (group) s1 = "(", s2 = ")%", s3 = ""; else s1 = "", s2 = "%", s3 = ""; break; } } fprintf(dst, "%s", s1); pprint_expr(i, dst, b->LHS); fprintf(dst, "%s", s2); cloog_int_print(dst, b->RHS); fprintf(dst, "%s", s3); } void pprint_minmax_f(struct cloogoptions *info, FILE *dst, struct clast_reduction *r) { int i; if (r->n == 0) return; fprintf(dst, r->type == clast_red_max ? "MAX(" : "MIN("); pprint_expr(info, dst, r->elts[0]); for (i = 1; i < r->n; ++i) { fprintf(dst, ","); pprint_expr(info, dst, r->elts[i]); } fprintf(dst, ")"); } void pprint_minmax_c(struct cloogoptions *info, FILE *dst, struct clast_reduction *r) { int i; for (i = 1; i < r->n; ++i) fprintf(dst, r->type == clast_red_max ? "max(" : "min("); if (r->n > 0) pprint_expr(info, dst, r->elts[0]); for (i = 1; i < r->n; ++i) { fprintf(dst, ","); pprint_expr(info, dst, r->elts[i]); fprintf(dst, ")"); } } void pprint_reduction(struct cloogoptions *i, FILE *dst, struct clast_reduction *r) { switch (r->type) { case clast_red_sum: pprint_sum(i, dst, r); break; case clast_red_min: case clast_red_max: if (r->n == 1) { pprint_expr(i, dst, r->elts[0]); break; } if (i->language == CLOOG_LANGUAGE_FORTRAN) pprint_minmax_f(i, dst, r); else pprint_minmax_c(i, dst, r); break; default: assert(0); } } void pprint_expr(struct cloogoptions *i, FILE *dst, struct clast_expr *e) { if (!e) return; switch (e->type) { case clast_expr_name: pprint_name(dst, (struct clast_name*) e); break; case clast_expr_term: pprint_term(i, dst, (struct clast_term*) e); break; case clast_expr_red: pprint_reduction(i, dst, (struct clast_reduction*) e); break; case clast_expr_bin: pprint_binary(i, dst, (struct clast_binary*) e); break; default: assert(0); } } void pprint_equation(struct cloogoptions *i, FILE *dst, struct clast_equation *eq) { pprint_expr(i, dst, eq->LHS); if (eq->sign == 0) fprintf(dst, " == "); else if (eq->sign > 0) fprintf(dst, " >= "); else fprintf(dst, " <= "); pprint_expr(i, dst, eq->RHS); } void pprint_assignment(struct cloogoptions *i, FILE *dst, struct clast_assignment *a) { if (a->LHS) fprintf(dst, "%s = ", a->LHS); pprint_expr(i, dst, a->RHS); } /** * pprint_osl_body function: * this function pretty-prints the OpenScop body of a given statement. * It returns 1 if it succeeds to find an OpenScop body to print for * that statement, 0 otherwise. * \param[in] options CLooG Options. * \param[in] dst Output stream. * \param[in] u Statement to print the OpenScop body. * \return 1 on success to pretty-print an OpenScop body for u, 0 otherwise. */ int pprint_osl_body(struct cloogoptions *options, FILE *dst, struct clast_user_stmt *u) { #ifdef OSL_SUPPORT int i; char *expr, *tmp; struct clast_stmt *t; osl_scop_p scop = options->scop; osl_statement_p stmt; osl_body_p body; if ((scop != NULL) && (osl_statement_number(scop->statement) >= u->statement->number)) { stmt = scop->statement; /* Go to the convenient statement in the SCoP. */ for (i = 1; i < u->statement->number; i++) stmt = stmt->next; /* Ensure it has a printable body. */ body = NULL; if (osl_generic_has_URI(stmt->body, OSL_URI_BODY)) { body = stmt->body->data; } else if (osl_generic_has_URI(stmt->body, OSL_URI_EXTBODY)) { if (stmt->body->data != NULL) { body = ((osl_extbody_p)(stmt->body->data))->body; } } if ((body != NULL) && (body->expression != NULL) && (body->iterators != NULL)) { expr = osl_util_identifier_substitution(body->expression->string[0], body->iterators->string); tmp = expr; /* Print the body expression, substituting the @...@ markers. */ while (*expr) { if (*expr == '@') { int iterator; expr += sscanf(expr, "@%d", &iterator) + 2; /* 2 for the @s */ t = u->substitutions; for (i = 0; i < iterator; i++) t = t->next; pprint_assignment(options, dst, (struct clast_assignment *)t); } else { fprintf(dst, "%c", *expr++); } } fprintf(dst, "\n"); free(tmp); return 1; } } #endif return 0; } void pprint_user_stmt(struct cloogoptions *options, FILE *dst, struct clast_user_stmt *u) { struct clast_stmt *t; if (pprint_osl_body(options, dst, u)) return; if (u->statement->name) fprintf(dst, "%s", u->statement->name); else fprintf(dst, "S%d", u->statement->number); fprintf(dst, "("); for (t = u->substitutions; t; t = t->next) { assert(CLAST_STMT_IS_A(t, stmt_ass)); pprint_assignment(options, dst, (struct clast_assignment *)t); if (t->next) fprintf(dst, ","); } fprintf(dst, ")"); if (options->language != CLOOG_LANGUAGE_FORTRAN) fprintf(dst, ";"); fprintf(dst, "\n"); } void pprint_guard(struct cloogoptions *options, FILE *dst, int indent, struct clast_guard *g) { int k; if (options->language == CLOOG_LANGUAGE_FORTRAN) fprintf(dst,"IF "); else fprintf(dst,"if "); if (g->n > 1) fprintf(dst,"("); for (k = 0; k < g->n; ++k) { if (k > 0) { if (options->language == CLOOG_LANGUAGE_FORTRAN) fprintf(dst," .AND. "); else fprintf(dst," && "); } fprintf(dst,"("); pprint_equation(options, dst, &g->eq[k]); fprintf(dst,")"); } if (g->n > 1) fprintf(dst,")"); if (options->language == CLOOG_LANGUAGE_FORTRAN) fprintf(dst," THEN\n"); else fprintf(dst," {\n"); pprint_stmt_list(options, dst, indent + INDENT_STEP, g->then); fprintf(dst, "%*s", indent, ""); if (options->language == CLOOG_LANGUAGE_FORTRAN) fprintf(dst,"END IF\n"); else fprintf(dst,"}\n"); } void pprint_for(struct cloogoptions *options, FILE *dst, int indent, struct clast_for *f) { if (options->language == CLOOG_LANGUAGE_C) { if ((f->parallel & CLAST_PARALLEL_OMP) && !(f->parallel & CLAST_PARALLEL_MPI)) { if (f->LB) { fprintf(dst, "lbp="); pprint_expr(options, dst, f->LB); fprintf(dst, ";\n"); } if (f->UB) { fprintf(dst, "%*s", indent, ""); fprintf(dst, "ubp="); pprint_expr(options, dst, f->UB); fprintf(dst, ";\n"); } fprintf(dst, "#pragma omp parallel for%s%s%s%s%s%s\n", (f->private_vars)? " private(":"", (f->private_vars)? f->private_vars: "", (f->private_vars)? ")":"", (f->reduction_vars)? " reduction(": "", (f->reduction_vars)? f->reduction_vars: "", (f->reduction_vars)? ")": ""); fprintf(dst, "%*s", indent, ""); } if ((f->parallel & CLAST_PARALLEL_VEC) && !(f->parallel & CLAST_PARALLEL_OMP) && !(f->parallel & CLAST_PARALLEL_MPI)) { if (f->LB) { fprintf(dst, "lbv="); pprint_expr(options, dst, f->LB); fprintf(dst, ";\n"); } if (f->UB) { fprintf(dst, "%*s", indent, ""); fprintf(dst, "ubv="); pprint_expr(options, dst, f->UB); fprintf(dst, ";\n"); } fprintf(dst, "%*s#pragma ivdep\n", indent, ""); fprintf(dst, "%*s#pragma vector always\n", indent, ""); fprintf(dst, "%*s", indent, ""); } if (f->parallel & CLAST_PARALLEL_MPI) { if (f->LB) { fprintf(dst, "_lb_dist="); pprint_expr(options, dst, f->LB); fprintf(dst, ";\n"); } if (f->UB) { fprintf(dst, "%*s", indent, ""); fprintf(dst, "_ub_dist="); pprint_expr(options, dst, f->UB); fprintf(dst, ";\n"); } fprintf(dst, "%*s", indent, ""); fprintf(dst, "polyrt_loop_dist(_lb_dist, _ub_dist, nprocs, my_rank, &lbp, &ubp);\n"); if (f->parallel & CLAST_PARALLEL_OMP) { fprintf(dst, "#pragma omp parallel for%s%s%s%s%s%s\n", (f->private_vars)? " private(":"", (f->private_vars)? f->private_vars: "", (f->private_vars)? ")":"", (f->reduction_vars)? " reduction(": "", (f->reduction_vars)? f->reduction_vars: "", (f->reduction_vars)? ")": ""); } fprintf(dst, "%*s", indent, ""); } } if (options->language == CLOOG_LANGUAGE_FORTRAN) fprintf(dst, "DO "); else fprintf(dst, "for ("); if (f->LB) { fprintf(dst, "%s=", f->iterator); if (f->parallel & (CLAST_PARALLEL_OMP | CLAST_PARALLEL_MPI)) { fprintf(dst, "lbp"); }else if (f->parallel & CLAST_PARALLEL_VEC){ fprintf(dst, "lbv"); }else{ pprint_expr(options, dst, f->LB); } } else if (options->language == CLOOG_LANGUAGE_FORTRAN) cloog_die("unbounded loops not allowed in FORTRAN.\n"); if (options->language == CLOOG_LANGUAGE_FORTRAN) fprintf(dst,", "); else fprintf(dst,";"); if (f->UB) { if (options->language != CLOOG_LANGUAGE_FORTRAN) fprintf(dst,"%s<=", f->iterator); if (f->parallel & (CLAST_PARALLEL_OMP | CLAST_PARALLEL_MPI)) { fprintf(dst, "ubp"); }else if (f->parallel & CLAST_PARALLEL_VEC){ fprintf(dst, "ubv"); }else{ pprint_expr(options, dst, f->UB); } }else if (options->language == CLOOG_LANGUAGE_FORTRAN) cloog_die("unbounded loops not allowed in FORTRAN.\n"); if (options->language == CLOOG_LANGUAGE_FORTRAN) { if (cloog_int_gt_si(f->stride, 1)) cloog_int_print(dst, f->stride); fprintf(dst,"\n"); } else { if (cloog_int_gt_si(f->stride, 1)) { fprintf(dst,";%s+=", f->iterator); cloog_int_print(dst, f->stride); fprintf(dst, ") {\n"); } else fprintf(dst, ";%s++) {\n", f->iterator); } pprint_stmt_list(options, dst, indent + INDENT_STEP, f->body); fprintf(dst, "%*s", indent, ""); if (options->language == CLOOG_LANGUAGE_FORTRAN) fprintf(dst,"END DO\n") ; else fprintf(dst,"}\n") ; } void pprint_stmt_list(struct cloogoptions *options, FILE *dst, int indent, struct clast_stmt *s) { for ( ; s; s = s->next) { if (CLAST_STMT_IS_A(s, stmt_root)) continue; fprintf(dst, "%*s", indent, ""); if (CLAST_STMT_IS_A(s, stmt_ass)) { pprint_assignment(options, dst, (struct clast_assignment *) s); if (options->language != CLOOG_LANGUAGE_FORTRAN) fprintf(dst, ";"); fprintf(dst, "\n"); } else if (CLAST_STMT_IS_A(s, stmt_user)) { pprint_user_stmt(options, dst, (struct clast_user_stmt *) s); } else if (CLAST_STMT_IS_A(s, stmt_for)) { pprint_for(options, dst, indent, (struct clast_for *) s); } else if (CLAST_STMT_IS_A(s, stmt_guard)) { pprint_guard(options, dst, indent, (struct clast_guard *) s); } else if (CLAST_STMT_IS_A(s, stmt_block)) { fprintf(dst, "{\n"); pprint_stmt_list(options, dst, indent + INDENT_STEP, ((struct clast_block *)s)->body); fprintf(dst, "%*s", indent, ""); fprintf(dst, "}\n"); } else { assert(0); } } } /****************************************************************************** * Pretty Printing (dirty) functions * ******************************************************************************/ void clast_pprint(FILE *foo, struct clast_stmt *root, int indent, CloogOptions *options) { pprint_stmt_list(options, foo, indent, root); } cloog-0.18.2/source/isl/0000775000175000017500000000000012254314446012004 500000000000000cloog-0.18.2/source/isl/domain.c0000664000175000017500000015133012254312305013332 00000000000000#include #include #include #include #include #include #include #include #include #include #ifdef OSL_SUPPORT #include #include #endif CloogDomain *cloog_domain_from_isl_set(__isl_take isl_set *set) { if (isl_set_is_params(set)) set = isl_set_from_params(set); set = isl_set_detect_equalities(set); set = isl_set_compute_divs(set); return (CloogDomain *)set; } __isl_give isl_set *isl_set_from_cloog_domain(CloogDomain *domain) { return (isl_set *)domain; } CloogScattering *cloog_scattering_from_isl_map(__isl_take isl_map *map) { return (CloogScattering *)map; } __isl_give isl_map *isl_map_from_cloog_scattering(CloogScattering *scattering) { return (isl_map *)scattering; } /** * Returns true if each scattering dimension is defined in terms * of the original iterators. */ int cloog_scattering_fully_specified(CloogScattering *scattering, CloogDomain *domain) { isl_map *map = isl_map_from_cloog_scattering(scattering); return isl_map_is_single_valued(map); } CloogConstraintSet *cloog_domain_constraints(CloogDomain *domain) { isl_basic_set *bset; isl_set *set = isl_set_from_cloog_domain(domain); assert(isl_set_n_basic_set(set) == 1); bset = isl_set_copy_basic_set(set); return cloog_constraint_set_from_isl_basic_set(bset); } void cloog_domain_print_constraints(FILE *foo, CloogDomain *domain, int print_number) { isl_basic_set *bset; isl_set *set = isl_set_from_cloog_domain(domain); if (print_number) isl_set_print(set, foo, 0, ISL_FORMAT_EXT_POLYLIB); else { assert(isl_set_n_basic_set(set) == 1); bset = isl_set_copy_basic_set(set); isl_basic_set_print(bset, foo, 0, NULL, NULL, ISL_FORMAT_POLYLIB); isl_basic_set_free(bset); } } void cloog_scattering_print_constraints(FILE *foo, CloogScattering *scattering) { isl_map *map = isl_map_from_cloog_scattering(scattering); isl_map_print(map, foo, 0, ISL_FORMAT_EXT_POLYLIB); } void cloog_domain_free(CloogDomain * domain) { isl_set *set = isl_set_from_cloog_domain(domain); isl_set_free(set); } void cloog_scattering_free(CloogScattering *scatt) { isl_map *map = isl_map_from_cloog_scattering(scatt); isl_map_free(map); } CloogDomain * cloog_domain_copy(CloogDomain * domain) { isl_set *set = isl_set_from_cloog_domain(domain); return cloog_domain_from_isl_set(isl_set_copy(set)); } /** * cloog_domain_convex function: * Computes the convex hull of domain. */ CloogDomain *cloog_domain_convex(CloogDomain *domain) { isl_set *set = isl_set_from_cloog_domain(domain); set = isl_set_from_basic_set(isl_set_convex_hull(isl_set_copy(set))); return cloog_domain_from_isl_set(set); } /** * cloog_domain_simple_convex: * Given a list (union) of polyhedra, this function returns a "simple" * convex hull of this union. In particular, the constraints of the * the returned polyhedron consist of (parametric) lower and upper * bounds on individual variables and constraints that appear in the * original polyhedra. */ CloogDomain *cloog_domain_simple_convex(CloogDomain *domain) { struct isl_basic_set *hull; isl_set *set = isl_set_from_cloog_domain(domain); if (cloog_domain_isconvex(domain)) return cloog_domain_copy(domain); hull = isl_set_bounded_simple_hull(isl_set_copy(set)); return cloog_domain_from_isl_set(isl_set_from_basic_set(hull)); } /** * cloog_domain_simplify function: * Given two polyhedral domains (dom1) and (dom2), * this function finds the largest domain set (or the smallest list * of non-redundant constraints), that when intersected with polyhedral * domain (dom2) equals (dom1)intersect(dom2). The output is a new CloogDomain * structure with a polyhedral domain with the "redundant" constraints removed. * NB: the second domain is required not to be a union. */ CloogDomain *cloog_domain_simplify(CloogDomain *dom1, CloogDomain *dom2) { isl_set *set1 = isl_set_from_cloog_domain(dom1); isl_set *set2 = isl_set_from_cloog_domain(dom2); set1 = isl_set_gist(isl_set_copy(set1), isl_set_copy(set2)); return cloog_domain_from_isl_set(set1); } /** * cloog_domain_union function: * This function returns a new polyhedral domain which is the union of * two polyhedral domains (dom1) U (dom2). * Frees dom1 and dom2; */ CloogDomain *cloog_domain_union(CloogDomain *dom1, CloogDomain *dom2) { isl_set *set1 = isl_set_from_cloog_domain(dom1); isl_set *set2 = isl_set_from_cloog_domain(dom2); set1 = isl_set_union(set1, set2); return cloog_domain_from_isl_set(set1); } /** * cloog_domain_intersection function: * This function returns a new polyhedral domain which is the intersection of * two polyhedral domains (dom1) \cap (dom2). */ CloogDomain *cloog_domain_intersection(CloogDomain *dom1, CloogDomain *dom2) { isl_set *set1 = isl_set_from_cloog_domain(dom1); isl_set *set2 = isl_set_from_cloog_domain(dom2); set1 = isl_set_intersect(isl_set_copy(set1), isl_set_copy(set2)); return cloog_domain_from_isl_set(set1); } /** * cloog_domain_difference function: * Returns the set difference domain \ minus. */ CloogDomain *cloog_domain_difference(CloogDomain *domain, CloogDomain *minus) { isl_set *set1 = isl_set_from_cloog_domain(domain); isl_set *set2 = isl_set_from_cloog_domain(minus); set1 = isl_set_subtract(isl_set_copy(set1), isl_set_copy(set2)); return cloog_domain_from_isl_set(set1); } /** * cloog_domain_sort function: * This function topologically sorts (nb_doms) domains. Here (doms) is an * array of pointers to CloogDomains, (nb_doms) is the number of domains, * (level) is the level to consider for partial ordering (nb_par) is the * parameter space dimension, (permut) if not NULL, is an array of (nb_doms) * integers that contains a permutation specification after call in order to * apply the topological sorting. */ void cloog_domain_sort(CloogDomain **doms, unsigned nb_doms, unsigned level, int *permut) { int i, j, k, cmp; struct isl_ctx *ctx; unsigned char **follows; isl_set *set_i, *set_j; isl_basic_set *bset_i, *bset_j; if (!nb_doms) return; set_i = isl_set_from_cloog_domain(doms[0]); ctx = isl_set_get_ctx(set_i); for (i = 0; i < nb_doms; i++) { set_i = isl_set_from_cloog_domain(doms[i]); assert(isl_set_n_basic_set(set_i) == 1); } follows = isl_alloc_array(ctx, unsigned char *, nb_doms); assert(follows); for (i = 0; i < nb_doms; ++i) { follows[i] = isl_alloc_array(ctx, unsigned char, nb_doms); assert(follows[i]); for (j = 0; j < nb_doms; ++j) follows[i][j] = 0; } for (i = 1; i < nb_doms; ++i) { for (j = 0; j < i; ++j) { if (follows[i][j] || follows[j][i]) continue; set_i = isl_set_from_cloog_domain(doms[i]); set_j = isl_set_from_cloog_domain(doms[j]); bset_i = isl_set_copy_basic_set(set_i); bset_j = isl_set_copy_basic_set(set_j); cmp = isl_basic_set_compare_at(bset_i, bset_j, level-1); isl_basic_set_free(bset_i); isl_basic_set_free(bset_j); if (!cmp) continue; if (cmp > 0) { follows[i][j] = 1; for (k = 0; k < i; ++k) follows[i][k] |= follows[j][k]; } else { follows[j][i] = 1; for (k = 0; k < i; ++k) follows[k][i] |= follows[k][j]; } } } for (i = 0, j = 0; i < nb_doms; j = (j + 1) % nb_doms) { for (k = 0; k < nb_doms; ++k) if (follows[j][k]) break; if (k < nb_doms) continue; for (k = 0; k < nb_doms; ++k) follows[k][j] = 0; follows[j][j] = 1; permut[i] = 1 + j; ++i; } for (i = 0; i < nb_doms; ++i) free(follows[i]); free(follows); } /** * Check whether there is or may be any value of dom1 at the given level * that is greater than or equal to a value of dom2 at the same level. * * Return * 1 is there is or may be a greater-than pair. * 0 if there is no greater-than pair, but there may be an equal-to pair * -1 if there is definitely no such pair */ int cloog_domain_follows(CloogDomain *dom1, CloogDomain *dom2, unsigned level) { isl_set *set1 = isl_set_from_cloog_domain(dom1); isl_set *set2 = isl_set_from_cloog_domain(dom2); int follows; follows = isl_set_follows_at(set1, set2, level - 1); assert(follows >= -1); return follows; } /** * cloog_domain_empty function: * Returns an empty domain of the same dimensions as template. */ CloogDomain *cloog_domain_empty(CloogDomain *template) { isl_set *set = isl_set_from_cloog_domain(template); isl_space *space = isl_set_get_space(set); return cloog_domain_from_isl_set(isl_set_empty(space)); } /** * Return 1 if the specified dimension has both an upper and a lower bound. */ int cloog_domain_is_bounded(CloogDomain *dom, unsigned level) { isl_set *set = isl_set_from_cloog_domain(dom); return isl_set_dim_is_bounded(set, isl_dim_set, level - 1); } /****************************************************************************** * Structure display function * ******************************************************************************/ /** * cloog_domain_print_structure : * this function is a more human-friendly way to display the CloogDomain data * structure, it only shows the constraint system and includes an indentation * level (level) in order to work with others print_structure functions. */ void cloog_domain_print_structure(FILE *file, CloogDomain *domain, int level, const char *name) { int i ; isl_set *set = isl_set_from_cloog_domain(domain); /* Go to the right level. */ for (i = 0; i < level; i++) fprintf(file, "|\t"); if (!set) { fprintf(file, "+-- Null CloogDomain\n"); return; } fprintf(file, "+-- %s\n", name); for (i = 0; i < level+1; ++i) fprintf(file, "|\t"); isl_set_print(set, file, 0, ISL_FORMAT_ISL); fprintf(file, "\n"); } /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_domain_list_free(CloogDomainList *list) { CloogDomainList *next; for ( ; list; list = next) { next = list->next; cloog_domain_free(list->domain); free(list); } } /** * cloog_scattering_list_free function: * This function frees the allocated memory for a CloogScatteringList structure. */ void cloog_scattering_list_free(CloogScatteringList *list) { while (list != NULL) { CloogScatteringList *temp = list->next; isl_map *map = isl_map_from_cloog_scattering(list->scatt); isl_map_free(map); free(list); list = temp; } } /****************************************************************************** * Reading function * ******************************************************************************/ /** * cloog_domain_read_context function: * Read parameter domain. */ CloogDomain *cloog_domain_read_context(CloogState *state, FILE *input) { struct isl_ctx *ctx = state->backend->ctx; isl_set *set; set = isl_set_read_from_file(ctx, input); set = isl_set_move_dims(set, isl_dim_param, 0, isl_dim_set, 0, isl_set_dim(set, isl_dim_set)); return cloog_domain_from_isl_set(set); } /** * cloog_domain_from_context * Reinterpret context by turning parameters into variables. */ CloogDomain *cloog_domain_from_context(CloogDomain *context) { isl_set *set = isl_set_from_cloog_domain(context); set = isl_set_move_dims(set, isl_dim_set, 0, isl_dim_param, 0, isl_set_dim(set, isl_dim_param)); return cloog_domain_from_isl_set(set); } /** * cloog_domain_union_read function: * This function reads a union of polyhedra into a file (input) and * returns a pointer to a CloogDomain containing the read information. */ CloogDomain *cloog_domain_union_read(CloogState *state, FILE *input, int nb_parameters) { struct isl_ctx *ctx = state->backend->ctx; struct isl_set *set; set = isl_set_read_from_file(ctx, input); if (isl_set_dim(set, isl_dim_param) != nb_parameters) { int dim = isl_set_dim(set, isl_dim_set); set = isl_set_move_dims(set, isl_dim_param, 0, isl_dim_set, dim - nb_parameters, nb_parameters); } return cloog_domain_from_isl_set(set); } /** * cloog_domain_read_scattering function: * This function reads in a scattering function from the file input. * * We try to read the scattering relation as a map, but if it is * specified in the original PolyLib format, then isl_map_read_from_file * will treat the input as a set return a map with zero input dimensions. * In this case, we need to decompose the set into a map from * scattering dimensions to domain dimensions and then invert the * resulting map. */ CloogScattering *cloog_domain_read_scattering(CloogDomain *domain, FILE *input) { isl_set *set = isl_set_from_cloog_domain(domain); isl_ctx *ctx = isl_set_get_ctx(set); struct isl_map *scat; unsigned nparam; unsigned dim; unsigned n_scat; dim = isl_set_dim(set, isl_dim_set); nparam = isl_set_dim(set, isl_dim_param); scat = isl_map_read_from_file(ctx, input); if (isl_map_dim(scat, isl_dim_param) != nparam) { int n_out = isl_map_dim(scat, isl_dim_out); scat = isl_map_move_dims(scat, isl_dim_param, 0, isl_dim_out, n_out - nparam, nparam); } if (isl_map_dim(scat, isl_dim_in) != dim) { n_scat = isl_map_dim(scat, isl_dim_out) - dim; scat = isl_map_move_dims(scat, isl_dim_in, 0, isl_dim_out, n_scat, dim); } return cloog_scattering_from_isl_map(scat); } /****************************************************************************** * CloogMatrix Reading function * ******************************************************************************/ /** * isl_constraint_read_from_matrix: * Convert a single line of a matrix to a isl_constraint. * Returns a pointer to the constraint if successful; NULL otherwise. */ static struct isl_constraint *isl_constraint_read_from_matrix( struct isl_space *dim, cloog_int_t *row) { struct isl_constraint *constraint; int j; int nvariables = isl_space_dim(dim, isl_dim_set); int nparam = isl_space_dim(dim, isl_dim_param); isl_local_space *ls = isl_local_space_from_space(dim); if (cloog_int_is_zero(row[0])) constraint = isl_equality_alloc(ls); else constraint = isl_inequality_alloc(ls); for (j = 0; j < nvariables; ++j) isl_constraint_set_coefficient(constraint, isl_dim_out, j, row[1 + j]); for (j = 0; j < nparam; ++j) isl_constraint_set_coefficient(constraint, isl_dim_param, j, row[1 + nvariables + j]); isl_constraint_set_constant(constraint, row[1 + nvariables + nparam]); return constraint; } /** * isl_basic_set_read_from_matrix: * Convert matrix to basic_set. The matrix contains nparam parameter columns. * Returns a pointer to the basic_set if successful; NULL otherwise. */ static struct isl_basic_set *isl_basic_set_read_from_matrix(struct isl_ctx *ctx, CloogMatrix* matrix, int nparam) { struct isl_space *dim; struct isl_basic_set *bset; int i; unsigned nrows, ncolumns; nrows = matrix->NbRows; ncolumns = matrix->NbColumns; int nvariables = ncolumns - 2 - nparam; dim = isl_space_set_alloc(ctx, nparam, nvariables); bset = isl_basic_set_universe(isl_space_copy(dim)); for (i = 0; i < nrows; ++i) { cloog_int_t *row = matrix->p[i]; struct isl_constraint *constraint = isl_constraint_read_from_matrix(isl_space_copy(dim), row); bset = isl_basic_set_add_constraint(bset, constraint); } isl_space_free(dim); return bset; } /** * cloog_domain_from_cloog_matrix: * Create a CloogDomain containing the constraints described in matrix. * nparam is the number of parameters contained in the domain. * Returns a pointer to the CloogDomain if successful; NULL otherwise. */ CloogDomain *cloog_domain_from_cloog_matrix(CloogState *state, CloogMatrix *matrix, int nparam) { struct isl_ctx *ctx = state->backend->ctx; struct isl_basic_set *bset; bset = isl_basic_set_read_from_matrix(ctx, matrix, nparam); return cloog_domain_from_isl_set(isl_set_from_basic_set(bset)); } /** * cloog_scattering_from_cloog_matrix: * Create a CloogScattering containing the constraints described in matrix. * nparam is the number of parameters contained in the domain. * Returns a pointer to the CloogScattering if successful; NULL otherwise. */ CloogScattering *cloog_scattering_from_cloog_matrix(CloogState *state, CloogMatrix *matrix, int nb_scat, int nb_par) { struct isl_ctx *ctx = state->backend->ctx; struct isl_basic_set *bset; struct isl_basic_map *scat; struct isl_space *dims; unsigned dim; bset = isl_basic_set_read_from_matrix(ctx, matrix, nb_par); dim = isl_basic_set_n_dim(bset) - nb_scat; dims = isl_space_alloc(ctx, nb_par, nb_scat, dim); scat = isl_basic_map_from_basic_set(bset, dims); scat = isl_basic_map_reverse(scat); return cloog_scattering_from_isl_map(isl_map_from_basic_map(scat)); } /****************************************************************************** * Processing functions * ******************************************************************************/ #ifdef OSL_SUPPORT /** * Converts an openscop relation to a CLooG domain. * \param[in,out] state CLooG state. * \param[in] relation OpenScop relation to convert. * \return A new CloogDomain corresponding to the input OpenScop relation. */ CloogDomain *cloog_domain_from_osl_relation(CloogState *state, osl_relation_p relation) { char *str; struct isl_ctx *ctx = state->backend->ctx; isl_set *set; CloogDomain *domain = NULL; if (relation != NULL) { if (relation->precision != OSL_PRECISION_MP) cloog_die("Non-GMP precision is not supported yet.\n"); str = osl_relation_spprint_polylib(relation, NULL); set = isl_set_read_from_str(ctx, str); free(str); domain = cloog_domain_from_isl_set(set); } return domain; } /** * Converts an openscop scattering relation to a CLooG scattering. * \param[in,out] state CLooG state. * \param[in] relation OpenScop relation to convert. * \return A new CloogScattering corresponding to the input OpenScop relation. */ CloogScattering *cloog_scattering_from_osl_relation(CloogState *state, osl_relation_p relation) { char *str; struct isl_ctx *ctx = state->backend->ctx; isl_map *map; CloogScattering *scattering = NULL; if (relation != NULL) { if (relation->precision != OSL_PRECISION_MP) cloog_die("Non-GMP precision is not supported yet.\n"); if (relation->type != OSL_TYPE_SCATTERING) cloog_die("Cannot convert a non-scattering relation to a scattering.\n"); str = osl_relation_spprint_polylib(relation, NULL); map = isl_map_read_from_str(ctx, str); free(str); scattering = cloog_scattering_from_isl_map(map); } return scattering; } #endif /** * cloog_domain_isempty function: */ int cloog_domain_isempty(CloogDomain *domain) { isl_set *set = isl_set_from_cloog_domain(domain); return isl_set_is_empty(set); } /** * cloog_domain_universe function: * This function returns the complete dim-dimensional space. */ CloogDomain *cloog_domain_universe(CloogState *state, unsigned dim) { struct isl_space *dims; struct isl_basic_set *bset; dims = isl_space_set_alloc(state->backend->ctx, 0, dim); bset = isl_basic_set_universe(dims); return cloog_domain_from_isl_set(isl_set_from_basic_set(bset)); } /** * cloog_domain_project function: * This function returns the projection of * (domain) on the (level) first dimensions (i.e. outer loops). */ CloogDomain *cloog_domain_project(CloogDomain *domain, int level) { isl_set *set = isl_set_from_cloog_domain(domain); set = isl_set_remove_dims(isl_set_copy(set), isl_dim_set, level, isl_set_n_dim(set) - level); set = isl_set_compute_divs(set); if (level > 0) set = isl_set_remove_divs_involving_dims(set, isl_dim_set, level - 1, 1); return cloog_domain_from_isl_set(set); } /** * cloog_domain_extend function: * This function returns the (domain) given as input with (dim) * dimensions and (nb_par) parameters. * This function does not free (domain), and returns a new CloogDomain. */ CloogDomain *cloog_domain_extend(CloogDomain *domain, int dim) { isl_set *set = isl_set_from_cloog_domain(domain); int n = isl_set_dim(set, isl_dim_set); set = isl_set_add_dims(isl_set_copy(set), isl_dim_set, dim - n); return cloog_domain_from_isl_set(set); } /** * cloog_domain_never_integral function: * For us, an equality like 3*i -4 = 0 is always false since 4%3 != 0. * There is no need to check for such constraints explicitly for the isl * backend. */ int cloog_domain_never_integral(CloogDomain * domain) { isl_set *set = isl_set_from_cloog_domain(domain); return isl_set_is_empty(set); } /** * Check whether the loop at "level" is executed at most once. * We construct a map that maps all remaining variables to this iterator * and check whether this map is single valued. * * Alternatively, we could have mapped the domain through a mapping * [p] -> { [..., i] -> [..., i'] : i' > i } * and then taken the intersection of the original domain and the transformed * domain. If this intersection is empty, then the corresponding * loop is executed at most once. */ int cloog_domain_is_otl(CloogDomain *domain, int level) { int otl; isl_set *set = isl_set_from_cloog_domain(domain); isl_map *map; map = isl_map_from_domain(isl_set_copy(set)); map = isl_map_move_dims(map, isl_dim_out, 0, isl_dim_in, level - 1, 1); otl = isl_map_is_single_valued(map); isl_map_free(map); return otl; } /** * cloog_domain_stride function: * This function finds the stride imposed to unknown with the column number * 'strided_level' in order to be integral. For instance, if we have a * constraint like -i - 2j + 2k = 0, and we consider k, then k can be integral * only if (i + 2j)%2 = 0. Then only if i%2 = 0. Then k imposes a stride 2 to * the unknown i. The function returns the imposed stride in a parameter field. * - domain is the set of constraint we have to consider, * - strided_level is the column number of the unknown for which a stride have * to be found, * - looking_level is the column number of the unknown that impose a stride to * the first unknown. * - stride is the stride that is returned back as a function parameter. * - offset is the value of the constant c if the condition is of the shape * (i + c)%s = 0, s being the stride. */ void cloog_domain_stride(CloogDomain *domain, int strided_level, cloog_int_t *stride, cloog_int_t *offset) { isl_set *set = isl_set_from_cloog_domain(domain); isl_set_dim_residue_class(set, strided_level - 1, stride, offset); if (!isl_int_is_zero(*offset)) isl_int_sub(*offset, *stride, *offset); return; } struct cloog_can_stride { int level; int can_stride; }; static int constraint_can_stride(__isl_take isl_constraint *c, void *user) { struct cloog_can_stride *ccs = (struct cloog_can_stride *)user; int i; isl_int v; unsigned n_div; if (isl_constraint_is_equality(c)) { isl_constraint_free(c); return 0; } isl_int_init(v); isl_constraint_get_coefficient(c, isl_dim_set, ccs->level - 1, &v); if (isl_int_is_pos(v)) { n_div = isl_constraint_dim(c, isl_dim_div); for (i = 0; i < n_div; ++i) { isl_constraint_get_coefficient(c, isl_dim_div, i, &v); if (!isl_int_is_zero(v)) break; } if (i < n_div) ccs->can_stride = 0; } isl_int_clear(v); isl_constraint_free(c); return 0; } static int basic_set_can_stride(__isl_take isl_basic_set *bset, void *user) { struct cloog_can_stride *ccs = (struct cloog_can_stride *)user; int r; r = isl_basic_set_foreach_constraint(bset, constraint_can_stride, ccs); isl_basic_set_free(bset); return r; } /** * Return 1 if CLooG is allowed to perform stride detection on level "level" * and 0 otherwise. * Currently, stride detection is only allowed when none of the lower * bound constraints involve any existentially quantified variables. * The reason is that the current isl interface does not make it * easy to construct an integer division that depends on other integer * divisions. * By not allowing existentially quantified variables in the constraints, * we can ignore them in cloog_domain_stride_lower_bound. */ int cloog_domain_can_stride(CloogDomain *domain, int level) { struct cloog_can_stride ccs = { level, 1 }; isl_set *set = isl_set_from_cloog_domain(domain); int r; r = isl_set_foreach_basic_set(set, basic_set_can_stride, &ccs); assert(r == 0); return ccs.can_stride; } struct cloog_stride_lower { int level; CloogStride *stride; isl_set *set; isl_basic_set *bounds; }; /* If the given constraint is a lower bound on csl->level, then add * a lower bound to csl->bounds that makes sure that the remainder * of the smallest value on division by csl->stride is equal to csl->offset. * * In particular, the given lower bound is of the form * * a i + f >= 0 * * where f may depend on the parameters and other iterators. * The stride is s and the offset is d. * The lower bound -f/a may not satisfy the above condition. In fact, * it may not even be integral. We want to round this value of i up * to the nearest value that satisfies the condition and add the corresponding * lower bound constraint. This nearest value is obtained by rounding * i - d up to the nearest multiple of s. * That is, we first subtract d * * i' = -f/a - d * * then we round up to the nearest multiple of s * * i'' = s * ceil(i'/s) * * and finally, we add d again * * i''' = i'' + d * * and impose the constraint i >= i'''. * * We find * * i'' = s * ceil((-f - a * d)/(a * s)) = - s * floor((f + a * d)/(a * s)) * * i >= - s * floor((f + a * d)/(a * s)) + d * * or * i + s * floor((f + a * d)/(a * s)) - d >= 0 */ static int constraint_stride_lower(__isl_take isl_constraint *c, void *user) { struct cloog_stride_lower *csl = (struct cloog_stride_lower *)user; isl_int v; isl_constraint *bound; isl_aff *b; if (isl_constraint_is_equality(c)) { isl_constraint_free(c); return 0; } isl_int_init(v); isl_constraint_get_coefficient(c, isl_dim_set, csl->level - 1, &v); if (!isl_int_is_pos(v)) { isl_int_clear(v); isl_constraint_free(c); return 0; } b = isl_constraint_get_bound(c, isl_dim_set, csl->level - 1); b = isl_aff_neg(b); b = isl_aff_add_constant(b, csl->stride->offset); b = isl_aff_scale_down(b, csl->stride->stride); b = isl_aff_floor(b); b = isl_aff_scale(b, csl->stride->stride); isl_int_neg(v, csl->stride->offset); b = isl_aff_add_constant(b, v); b = isl_aff_add_coefficient_si(b, isl_dim_in, csl->level - 1, 1); bound = isl_inequality_from_aff(b); csl->bounds = isl_basic_set_add_constraint(csl->bounds, bound); isl_int_clear(v); isl_constraint_free(c); return 0; } /* This functions performs essentially the same operation as * constraint_stride_lower, the only difference being that the offset d * is not a constant, but an affine expression in terms of the parameters * and earlier variables. In particular the affine expression is equal * to the coefficients of stride->constraint multiplied by stride->factor. * As in constraint_stride_lower, we add an extra bound * * i + s * floor((f + a * d)/(a * s)) - d >= 0 * * for each lower bound * * a i + f >= 0 * * where d is not the aforementioned affine expression. */ static int constraint_stride_lower_c(__isl_take isl_constraint *c, void *user) { struct cloog_stride_lower *csl = (struct cloog_stride_lower *)user; isl_int v; isl_constraint *bound; isl_constraint *csl_c; isl_aff *d, *b; if (isl_constraint_is_equality(c)) { isl_constraint_free(c); return 0; } isl_int_init(v); isl_constraint_get_coefficient(c, isl_dim_set, csl->level - 1, &v); if (!isl_int_is_pos(v)) { isl_int_clear(v); isl_constraint_free(c); return 0; } csl_c = cloog_constraint_to_isl(csl->stride->constraint); d = isl_constraint_get_aff(csl_c); d = isl_aff_drop_dims(d, isl_dim_div, 0, isl_aff_dim(d, isl_dim_div)); d = isl_aff_set_coefficient_si(d, isl_dim_in, csl->level - 1, 0); d = isl_aff_scale(d, csl->stride->factor); b = isl_constraint_get_bound(c, isl_dim_set, csl->level - 1); b = isl_aff_neg(b); b = isl_aff_add(b, isl_aff_copy(d)); b = isl_aff_scale_down(b, csl->stride->stride); b = isl_aff_floor(b); b = isl_aff_scale(b, csl->stride->stride); b = isl_aff_sub(b, d); b = isl_aff_add_coefficient_si(b, isl_dim_in, csl->level - 1, 1); bound = isl_inequality_from_aff(b); csl->bounds = isl_basic_set_add_constraint(csl->bounds, bound); isl_int_clear(v); isl_constraint_free(c); return 0; } static int basic_set_stride_lower(__isl_take isl_basic_set *bset, void *user) { struct cloog_stride_lower *csl = (struct cloog_stride_lower *)user; int r; csl->bounds = isl_basic_set_universe(isl_basic_set_get_space(bset)); if (csl->stride->constraint) r = isl_basic_set_foreach_constraint(bset, &constraint_stride_lower_c, csl); else r = isl_basic_set_foreach_constraint(bset, &constraint_stride_lower, csl); bset = isl_basic_set_intersect(bset, csl->bounds); csl->set = isl_set_union(csl->set, isl_set_from_basic_set(bset)); return r; } /** * Update the lower bounds at level "level" to the given stride information. * That is, make sure that the remainder on division by "stride" * is equal to "offset". */ CloogDomain *cloog_domain_stride_lower_bound(CloogDomain *domain, int level, CloogStride *stride) { struct cloog_stride_lower csl; isl_set *set = isl_set_from_cloog_domain(domain); int r; csl.stride = stride; csl.level = level; csl.set = isl_set_empty(isl_set_get_space(set)); r = isl_set_foreach_basic_set(set, basic_set_stride_lower, &csl); assert(r == 0); cloog_domain_free(domain); return cloog_domain_from_isl_set(csl.set); } /* Add stride constraint, if any, to domain. */ CloogDomain *cloog_domain_add_stride_constraint(CloogDomain *domain, CloogStride *stride) { isl_constraint *c; isl_set *set; if (!stride || !stride->constraint) return domain; set = isl_set_from_cloog_domain(domain); c = isl_constraint_copy(cloog_constraint_to_isl(stride->constraint)); set = isl_set_add_constraint(set, c); return cloog_domain_from_isl_set(set); } /** * cloog_domain_lazy_equal function: * This function returns 1 if the domains given as input are the same, 0 if it * is unable to decide. */ int cloog_domain_lazy_equal(CloogDomain *d1, CloogDomain *d2) { isl_set *set1 = isl_set_from_cloog_domain(d1); isl_set *set2 = isl_set_from_cloog_domain(d2); return isl_set_fast_is_equal(set1, set2); } struct cloog_bound_split { isl_set *set; int level; int lower; int upper; }; static int constraint_bound_split(__isl_take isl_constraint *c, void *user) { struct cloog_bound_split *cbs = (struct cloog_bound_split *)user; isl_int v; int i; int handle = 0; isl_int_init(v); isl_constraint_get_coefficient(c, isl_dim_set, cbs->level - 1, &v); if (!cbs->lower && isl_int_is_pos(v)) cbs->lower = handle = 1; else if (!cbs->upper && isl_int_is_neg(v)) cbs->upper = handle = 1; if (handle) { for (i = 0; i < isl_set_dim(cbs->set, isl_dim_param); ++i) { isl_constraint_get_coefficient(c, isl_dim_param, i, &v); if (isl_int_is_zero(v)) continue; cbs->set = isl_set_split_dims(cbs->set, isl_dim_param, i, 1); } } isl_int_clear(v); isl_constraint_free(c); return (cbs->lower && cbs->upper) ? -1 : 0; } static int basic_set_bound_split(__isl_take isl_basic_set *bset, void *user) { struct cloog_bound_split *cbs = (struct cloog_bound_split *)user; int r; cbs->lower = 0; cbs->upper = 0; r = isl_basic_set_foreach_constraint(bset, constraint_bound_split, cbs); isl_basic_set_free(bset); return ((!cbs->lower || !cbs->upper) && r < 0) ? -1 : 0; } /** * Return a union of sets S_i such that the convex hull of "dom", * when intersected with one the sets S_i, will have an upper and * lower bound for the dimension at "level" (provided "dom" itself * has such bounds for the dimensions). * * We currently take a very simple approach. For each of the basic * sets in "dom" we pick a lower and an upper bound and split the * range of any parameter involved in these two bounds in a * nonnegative and a negative part. This ensures that the symbolic * constant in these two constraints are themselves bounded and * so there will be at least one upper and one lower bound * in the convex hull. */ CloogDomain *cloog_domain_bound_splitter(CloogDomain *dom, int level) { struct cloog_bound_split cbs; isl_set *set = isl_set_from_cloog_domain(dom); int r; cbs.level = level; cbs.set = isl_set_universe(isl_set_get_space(set)); r = isl_set_foreach_basic_set(set, basic_set_bound_split, &cbs); assert(r == 0); return cloog_domain_from_isl_set(cbs.set); } /* Check whether the union of scattering functions over all domains * is obviously injective. */ static int injective_scattering(CloogScatteringList *list) { isl_map *map; isl_union_map *umap; int injective; int i = 0; char name[30]; if (!list) return 1; map = isl_map_copy(isl_map_from_cloog_scattering(list->scatt)); snprintf(name, sizeof(name), "S%d", i); map = isl_map_set_tuple_name(map, isl_dim_in, name); umap = isl_union_map_from_map(map); for (list = list->next, ++i; list; list = list->next, ++i) { map = isl_map_copy(isl_map_from_cloog_scattering(list->scatt)); snprintf(name, sizeof(name), "S%d", i); map = isl_map_set_tuple_name(map, isl_dim_in, name); umap = isl_union_map_add_map(umap, map); } injective = isl_union_map_plain_is_injective(umap); isl_union_map_free(umap); return injective; } /** * cloog_scattering_lazy_block function: * This function returns 1 if the two scattering functions s1 and s2 given * as input are the same (except possibly for the final dimension, where we * allow a difference of 1), assuming that the domains on which this * scatterings are applied are the same. * In fact this function answers the question "can I * safely consider the two domains as only one with two statements (a block) ?". * A difference of 1 in the final dimension is only allowed if the * entire scattering function is injective. * - s1 and s2 are the two domains to check for blocking, * - scattering is the linked list of all domains, * - scattdims is the total number of scattering dimentions. */ int cloog_scattering_lazy_block(CloogScattering *s1, CloogScattering *s2, CloogScatteringList *scattering, int scattdims) { int i; struct isl_space *dim; struct isl_map *rel; struct isl_set *delta; isl_map *map1 = isl_map_from_cloog_scattering(s1); isl_map *map2 = isl_map_from_cloog_scattering(s2); int fixed, block; isl_int cst; unsigned n_scat; n_scat = isl_map_dim(map1, isl_dim_out); if (n_scat != isl_map_dim(map2, isl_dim_out)) return 0; dim = isl_map_get_space(map1); dim = isl_space_map_from_set(isl_space_domain(dim)); rel = isl_map_identity(dim); rel = isl_map_apply_domain(rel, isl_map_copy(map1)); rel = isl_map_apply_range(rel, isl_map_copy(map2)); delta = isl_map_deltas(rel); isl_int_init(cst); for (i = 0; i < n_scat; ++i) { fixed = isl_set_fast_dim_is_fixed(delta, i, &cst); if (fixed != 1) break; if (isl_int_is_zero(cst)) continue; if (i + 1 < n_scat) break; if (!isl_int_is_one(cst)) break; if (!injective_scattering(scattering)) break; } block = i >= n_scat; isl_int_clear(cst); isl_set_free(delta); return block; } /** * cloog_domain_lazy_disjoint function: * This function returns 1 if the domains given as input are disjoint, 0 if it * is unable to decide. */ int cloog_domain_lazy_disjoint(CloogDomain *d1, CloogDomain *d2) { isl_set *set1 = isl_set_from_cloog_domain(d1); isl_set *set2 = isl_set_from_cloog_domain(d2); return isl_set_fast_is_disjoint(set1, set2); } /** * cloog_scattering_list_lazy_same function: * This function returns 1 if two domains in the list are the same, 0 if it * is unable to decide. */ int cloog_scattering_list_lazy_same(CloogScatteringList *list) { CloogScatteringList *one, *other; isl_map *one_map, *other_map; for (one = list; one; one = one->next) { one_map = isl_map_from_cloog_scattering(one->scatt); for (other = one->next; other; other = other->next) { other_map = isl_map_from_cloog_scattering(other->scatt); if (isl_map_fast_is_equal(one_map, other_map)) return 1; } } return 0; } int cloog_domain_dimension(CloogDomain * domain) { isl_set *set = isl_set_from_cloog_domain(domain); return isl_set_dim(set, isl_dim_set); } int cloog_domain_parameter_dimension(CloogDomain *domain) { isl_set *set = isl_set_from_cloog_domain(domain); return isl_set_dim(set, isl_dim_param); } int cloog_scattering_dimension(CloogScattering *scatt, CloogDomain *domain) { isl_map *map = isl_map_from_cloog_scattering(scatt); return isl_map_dim(map, isl_dim_out); } int cloog_domain_isconvex(CloogDomain * domain) { isl_set *set = isl_set_from_cloog_domain(domain); return isl_set_n_basic_set(set) <= 1; } /** * cloog_domain_cut_first function: * This function splits off and returns the first convex set in the * union "domain". The remainder of the union is returned in rest. * The original "domain" itself is destroyed and may not be used * after a call to this function. */ CloogDomain *cloog_domain_cut_first(CloogDomain *domain, CloogDomain **rest) { isl_set *set = isl_set_from_cloog_domain(domain); struct isl_basic_set *first; first = isl_set_copy_basic_set(set); set = isl_set_drop_basic_set(set, first); *rest = cloog_domain_from_isl_set(set); return cloog_domain_from_isl_set(isl_set_from_basic_set(first)); } /** * Given a union domain, try to find a simpler representation * using fewer sets in the union. * The original "domain" itself is destroyed and may not be used * after a call to this function. */ CloogDomain *cloog_domain_simplify_union(CloogDomain *domain) { isl_set *set = isl_set_from_cloog_domain(domain); return cloog_domain_from_isl_set(isl_set_coalesce(set)); } /** * cloog_scattering_lazy_isscalar function: * this function returns 1 if the scattering dimension 'dimension' in the * scattering 'scatt' is constant. * If value is not NULL, then it is set to the constant value of dimension. */ int cloog_scattering_lazy_isscalar(CloogScattering *scatt, int dimension, cloog_int_t *value) { isl_map *map = isl_map_from_cloog_scattering(scatt); return isl_map_fast_is_fixed(map, isl_dim_out, dimension, value); } /** * cloog_domain_lazy_isconstant function: * this function returns 1 if the dimension 'dimension' in the * domain 'domain' is constant. * If value is not NULL, then it is set to the constant value of dimension. */ int cloog_domain_lazy_isconstant(CloogDomain *domain, int dimension, cloog_int_t *value) { isl_set *set = isl_set_from_cloog_domain(domain); return isl_set_fast_dim_is_fixed(set, dimension, value); } /** * cloog_scattering_erase_dimension function: * this function returns a CloogDomain structure builds from 'domain' where * we removed the dimension 'dimension' and every constraint involving this * dimension. */ CloogScattering *cloog_scattering_erase_dimension(CloogScattering *scattering, int dimension) { isl_map *map = isl_map_from_cloog_scattering(scattering); map = isl_map_remove_dims(isl_map_copy(map), isl_dim_out, dimension, 1); return cloog_scattering_from_isl_map(map); } /** * cloog_domain_cube: * Construct and return a dim-dimensional cube, with values ranging * between min and max in each dimension. */ CloogDomain *cloog_domain_cube(CloogState *state, int dim, cloog_int_t min, cloog_int_t max) { int i; struct isl_basic_set *cube; struct isl_basic_set *interval; struct isl_basic_set_list *list; if (dim == 0) return cloog_domain_universe(state, dim); interval = isl_basic_set_interval(state->backend->ctx, min, max); list = isl_basic_set_list_alloc(state->backend->ctx, dim); for (i = 0; i < dim; ++i) list = isl_basic_set_list_add(list, isl_basic_set_copy(interval)); isl_basic_set_free(interval); cube = isl_basic_set_list_product(list); return cloog_domain_from_isl_set(isl_set_from_basic_set(cube)); } /** * cloog_domain_scatter function: * This function add the scattering (scheduling) informations to a domain. */ CloogDomain *cloog_domain_scatter(CloogDomain *domain, CloogScattering *scatt) { isl_set *set = isl_set_from_cloog_domain(domain); isl_map *map = isl_map_from_cloog_scattering(scatt); map = isl_map_reverse(isl_map_copy(map)); map = isl_map_intersect_range(map, set); set = isl_set_flatten(isl_map_wrap(map)); return cloog_domain_from_isl_set(set); } static int add_domain_from_map(__isl_take isl_map *map, void *user) { isl_space *dim; const char *name; CloogDomain *domain; CloogScattering *scat; CloogUnionDomain **ud = (CloogUnionDomain **)user; dim = isl_map_get_space(map); name = isl_space_get_tuple_name(dim, isl_dim_in); domain = cloog_domain_from_isl_set(isl_map_domain(isl_map_copy(map))); scat = cloog_scattering_from_isl_map(map); *ud = cloog_union_domain_add_domain(*ud, name, domain, scat, NULL); isl_space_free(dim); return 0; } /** * Construct a CloogUnionDomain from an isl_union_map representing * a global scattering function. The input is a mapping from different * spaces (different tuple names and possibly different dimensions) * to a common space. The iteration domains are set to the domains * in each space. The statement names are set to the names of the * spaces. The parameter names of the result are set to those of * the input, but the iterator and scattering dimension names are * left unspecified. */ CloogUnionDomain *cloog_union_domain_from_isl_union_map( __isl_take isl_union_map *umap) { int i; int nparam; isl_space *dim; CloogUnionDomain *ud; dim = isl_union_map_get_space(umap); nparam = isl_space_dim(dim, isl_dim_param); ud = cloog_union_domain_alloc(nparam); for (i = 0; i < nparam; ++i) { const char *s = isl_space_get_dim_name(dim, isl_dim_param, i); ud = cloog_union_domain_set_name(ud, CLOOG_PARAM, i, s); } isl_space_free(dim); if (isl_union_map_foreach_map(umap, &add_domain_from_map, &ud) < 0) { isl_union_map_free(umap); cloog_union_domain_free(ud); assert(0); } isl_union_map_free(umap); return ud; } static int count_same_name(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos, const char *name) { enum isl_dim_type t; unsigned p, s; int count = 0; int len = strlen(name); for (t = isl_dim_param; t <= type && t <= isl_dim_out; ++t) { s = t == type ? pos : isl_space_dim(dim, t); for (p = 0; p < s; ++p) { const char *n = isl_space_get_dim_name(dim, t, p); if (n && !strncmp(n, name, len)) count++; } } return count; } static CloogUnionDomain *add_domain(__isl_take isl_set *set, CloogUnionDomain *ud) { int i, nvar; isl_ctx *ctx; isl_space *dim; char buffer[20]; const char *name; CloogDomain *domain; ctx = isl_set_get_ctx(set); dim = isl_set_get_space(set); name = isl_space_get_tuple_name(dim, isl_dim_set); set = isl_set_flatten(set); set = isl_set_set_tuple_name(set, NULL); domain = cloog_domain_from_isl_set(set); ud = cloog_union_domain_add_domain(ud, name, domain, NULL, NULL); nvar = isl_space_dim(dim, isl_dim_set); for (i = 0; i < nvar; ++i) { char *long_name = NULL; int n; name = isl_space_get_dim_name(dim, isl_dim_set, i); if (!name) { snprintf(buffer, sizeof(buffer), "i%d", i); name = buffer; } n = count_same_name(dim, isl_dim_set, i, name); if (n) { int size = strlen(name) + 10; long_name = isl_alloc_array(ctx, char, size); if (!long_name) cloog_die("memory overflow.\n"); snprintf(long_name, size, "%s_%d", name, n); name = long_name; } ud = cloog_union_domain_set_name(ud, CLOOG_ITER, i, name); free(long_name); } isl_space_free(dim); return ud; } /** * Construct a CloogUnionDomain from an isl_set. * The statement names are set to the names of the * spaces. The parameter and iterator names of the result are set to those of * the input, but the scattering dimension names are left unspecified. */ CloogUnionDomain *cloog_union_domain_from_isl_set( __isl_take isl_set *set) { int i; int nparam; isl_space *dim; CloogUnionDomain *ud; dim = isl_set_get_space(set); nparam = isl_space_dim(dim, isl_dim_param); ud = cloog_union_domain_alloc(nparam); for (i = 0; i < nparam; ++i) { const char *s = isl_space_get_dim_name(dim, isl_dim_param, i); ud = cloog_union_domain_set_name(ud, CLOOG_PARAM, i, s); } isl_space_free(dim); ud = add_domain(set, ud); return ud; } /* Computes x, y and g such that g = gcd(a,b) and a*x+b*y = g */ static void Euclid(cloog_int_t a, cloog_int_t b, cloog_int_t *x, cloog_int_t *y, cloog_int_t *g) { cloog_int_t c, d, e, f, tmp; cloog_int_init(c); cloog_int_init(d); cloog_int_init(e); cloog_int_init(f); cloog_int_init(tmp); cloog_int_abs(c, a); cloog_int_abs(d, b); cloog_int_set_si(e, 1); cloog_int_set_si(f, 0); while (cloog_int_is_pos(d)) { cloog_int_tdiv_q(tmp, c, d); cloog_int_mul(tmp, tmp, f); cloog_int_sub(e, e, tmp); cloog_int_tdiv_q(tmp, c, d); cloog_int_mul(tmp, tmp, d); cloog_int_sub(c, c, tmp); cloog_int_swap(c, d); cloog_int_swap(e, f); } cloog_int_set(*g, c); if (cloog_int_is_zero(a)) cloog_int_set_si(*x, 0); else if (cloog_int_is_pos(a)) cloog_int_set(*x, e); else cloog_int_neg(*x, e); if (cloog_int_is_zero(b)) cloog_int_set_si(*y, 0); else { cloog_int_mul(tmp, a, *x); cloog_int_sub(tmp, c, tmp); cloog_int_divexact(*y, tmp, b); } cloog_int_clear(c); cloog_int_clear(d); cloog_int_clear(e); cloog_int_clear(f); cloog_int_clear(tmp); } /* Construct a CloogStride from the given constraint for the given level, * if possible. * We first compute the gcd of the coefficients of the existentially * quantified variables and then remove any common factors it has * with the coefficient at the given level. * The result is the value of the stride and if it is not one, * then it is possible to construct a CloogStride. * The constraint leading to the stride is stored in the CloogStride * as well a value (factor) such that the product of this value * and the coefficient at the given level is equal to -1 modulo the stride. */ static CloogStride *construct_stride(isl_constraint *c, int level) { int i, n, sign; isl_int v, m, gcd, stride, factor; CloogStride *s; if (!c) return NULL; isl_int_init(v); isl_int_init(m); isl_int_init(gcd); isl_int_init(factor); isl_int_init(stride); isl_constraint_get_coefficient(c, isl_dim_set, level - 1, &v); sign = isl_int_sgn(v); isl_int_abs(m, v); isl_int_set_si(gcd, 0); n = isl_constraint_dim(c, isl_dim_div); for (i = 0; i < n; ++i) { isl_constraint_get_coefficient(c, isl_dim_div, i, &v); isl_int_gcd(gcd, gcd, v); } isl_int_gcd(v, m, gcd); isl_int_divexact(stride, gcd, v); if (isl_int_is_zero(stride) || isl_int_is_one(stride)) s = NULL; else { Euclid(m, stride, &factor, &v, &gcd); if (sign > 0) isl_int_neg(factor, factor); c = isl_constraint_copy(c); s = cloog_stride_alloc_from_constraint(stride, cloog_constraint_from_isl_constraint(c), factor); } isl_int_clear(stride); isl_int_clear(factor); isl_int_clear(gcd); isl_int_clear(m); isl_int_clear(v); return s; } struct cloog_isl_find_stride_data { int level; CloogStride *stride; }; /* Check if the given constraint can be used to derive * a stride on the iterator identified by data->level. * We first check that there are some existentially quantified variables * and that the coefficient at data->level is non-zero. * Then we call construct_stride for further checks and the actual * construction of the CloogStride. */ static int find_stride(__isl_take isl_constraint *c, void *user) { struct cloog_isl_find_stride_data *data; int n; isl_int v; if (!isl_constraint_is_equality(c)) { isl_constraint_free(c); return 0; } data = (struct cloog_isl_find_stride_data *)user; if (data->stride) { isl_constraint_free(c); return 0; } n = isl_constraint_dim(c, isl_dim_div); if (n == 0) { isl_constraint_free(c); return 0; } isl_int_init(v); isl_constraint_get_coefficient(c, isl_dim_set, data->level - 1, &v); if (!isl_int_is_zero(v)) data->stride = construct_stride(c, data->level); isl_int_clear(v); isl_constraint_free(c); return 0; } /* Check if the given list of domains has a common stride on the given level. * If so, return a pointer to a CloogStride object. If not, return NULL. * * We project out all later variables, take the union and compute * the affine hull of the union. Then we check the (equality) * constraints in this affine hull for imposing a stride. */ CloogStride *cloog_domain_list_stride(CloogDomainList *list, int level) { struct cloog_isl_find_stride_data data = { level, NULL }; isl_set *set; isl_basic_set *aff; int first = level; int n; int r; set = isl_set_from_cloog_domain(list->domain); n = isl_set_dim(set, isl_dim_set) - first; set = isl_set_project_out(isl_set_copy(set), isl_dim_set, first, n); for (list = list->next; list; list = list->next) { isl_set *set_i = isl_set_from_cloog_domain(list->domain); n = isl_set_dim(set_i, isl_dim_set) - first; set_i = isl_set_project_out(isl_set_copy(set_i), isl_dim_set, first, n); set = isl_set_union(set, set_i); } aff = isl_set_affine_hull(set); r = isl_basic_set_foreach_constraint(aff, &find_stride, &data); assert(r == 0); isl_basic_set_free(aff); return data.stride; } struct cloog_can_unroll { int can_unroll; int level; isl_constraint *c; isl_set *set; isl_int *n; }; /* * Check if the given lower bound can be used for unrolling * and, if so, return the unrolling factor/trip count in *v. * If the lower bound involves any existentially quantified * variables, we currently punt. * Otherwise we compute the maximal value of (i - ceil(l) + 1), * with l the given lower bound and i the iterator identified by level. */ static int is_valid_unrolling_lower_bound(struct cloog_can_unroll *ccu, __isl_keep isl_constraint *c, isl_int *v) { unsigned n_div; isl_aff *aff; enum isl_lp_result res; n_div = isl_constraint_dim(c, isl_dim_div); if (isl_constraint_involves_dims(c, isl_dim_div, 0, n_div)) return 0; aff = isl_constraint_get_bound(c, isl_dim_set, ccu->level - 1); aff = isl_aff_ceil(aff); aff = isl_aff_neg(aff); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, ccu->level - 1, 1); res = isl_set_max(ccu->set, aff, v); isl_aff_free(aff); if (res == isl_lp_unbounded) return 0; assert(res == isl_lp_ok); cloog_int_add_ui(*v, *v, 1); return 1; } /* Check if we can unroll based on the given constraint. * Only lower bounds can be used. * Record it if it turns out to be usable and if we haven't recorded * any other constraint already. */ static int constraint_can_unroll(__isl_take isl_constraint *c, void *user) { struct cloog_can_unroll *ccu = (struct cloog_can_unroll *)user; isl_int v; isl_int count; isl_int_init(v); isl_int_init(count); isl_constraint_get_coefficient(c, isl_dim_set, ccu->level - 1, &v); if (isl_int_is_pos(v) && is_valid_unrolling_lower_bound(ccu, c, &count) && (!ccu->c || isl_int_lt(count, *ccu->n))) { isl_constraint_free(ccu->c); ccu->c = isl_constraint_copy(c); isl_int_set(*ccu->n, count); } isl_int_clear(count); isl_int_clear(v); isl_constraint_free(c); return 0; } /* Check if we can unroll the domain at the current level. * If the domain is a union, we cannot. Otherwise, we check the * constraints. */ static int basic_set_can_unroll(__isl_take isl_basic_set *bset, void *user) { struct cloog_can_unroll *ccu = (struct cloog_can_unroll *)user; int r = 0; if (ccu->c || !ccu->can_unroll) ccu->can_unroll = 0; else { bset = isl_basic_set_remove_redundancies(bset); r = isl_basic_set_foreach_constraint(bset, &constraint_can_unroll, ccu); } isl_basic_set_free(bset); return r; } /* Check if we can unroll the given domain at the given level, and * if so, return the single lower bound in *lb and an upper bound * on the number of iterations in *n. * If we cannot unroll, return 0 and set *lb to NULL. * * We can unroll, if we can identify a lower bound on level * such that the number of iterations is bounded by a constant. */ int cloog_domain_can_unroll(CloogDomain *domain, int level, cloog_int_t *n, CloogConstraint **lb) { isl_set *set = isl_set_from_cloog_domain(domain); struct cloog_can_unroll ccu = { 1, level, NULL, set, n }; int r; *lb = NULL; r = isl_set_foreach_basic_set(set, &basic_set_can_unroll, &ccu); assert(r == 0); if (!ccu.c) ccu.can_unroll = 0; if (!ccu.can_unroll) { isl_constraint_free(ccu.c); return 0; } *lb = cloog_constraint_from_isl_constraint(ccu.c); return ccu.can_unroll; } /* Fix the iterator i at the given level to l + o, * where l is prescribed by the constraint lb and o is equal to offset. * In particular, if lb is the constraint * * a i >= f(j) * * then l = ceil(f(j)/a). */ CloogDomain *cloog_domain_fixed_offset(CloogDomain *domain, int level, CloogConstraint *lb, cloog_int_t offset) { isl_aff *aff; isl_set *set = isl_set_from_cloog_domain(domain); isl_constraint *c; isl_constraint *eq; c = cloog_constraint_to_isl(lb); aff = isl_constraint_get_bound(c, isl_dim_set, level - 1); aff = isl_aff_ceil(aff); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, level - 1, -1); aff = isl_aff_add_constant(aff, offset); eq = isl_equality_from_aff(aff); set = isl_set_add_constraint(set, eq); return cloog_domain_from_isl_set(set); } cloog-0.18.2/source/isl/backend.c0000664000175000017500000000137212254312305013452 00000000000000#include /** * Allocate and initialize full state. */ CloogState *cloog_state_malloc(void) { return cloog_isl_state_malloc(NULL); } /** * Allocate and initialize full state for isl backend. */ CloogState *cloog_isl_state_malloc(struct isl_ctx *ctx) { CloogState *state; int allocated = !ctx; state = cloog_core_state_malloc(); if (!ctx) ctx = isl_ctx_alloc(); state->backend = isl_alloc_type(ctx, CloogBackend); state->backend->ctx = ctx; state->backend->ctx_allocated = allocated; return state; } /** * Free state and backend independent parts. */ void cloog_state_free(CloogState *state) { if (state->backend->ctx_allocated) isl_ctx_free(state->backend->ctx); free(state->backend); cloog_core_state_free(state); } cloog-0.18.2/source/isl/constraints.c0000664000175000017500000006674612254312305014452 00000000000000#include #include #include #include #include #include #include #define ALLOC(type) (type*)malloc(sizeof(type)) #define ALLOCN(type,n) (type*)malloc((n)*sizeof(type)) CloogConstraintSet *cloog_constraint_set_from_isl_basic_set(struct isl_basic_set *bset) { return (CloogConstraintSet *)bset; } CloogConstraint *cloog_constraint_from_isl_constraint(struct isl_constraint *constraint) { return (CloogConstraint *)constraint; } isl_constraint *cloog_constraint_to_isl(CloogConstraint *constraint) { return (isl_constraint *)constraint; } isl_basic_set *cloog_constraints_set_to_isl(CloogConstraintSet *constraints) { return (isl_basic_set *)constraints; } /****************************************************************************** * Memory leaks hunting * ******************************************************************************/ void cloog_constraint_set_free(CloogConstraintSet *constraints) { isl_basic_set_free(cloog_constraints_set_to_isl(constraints)); } int cloog_constraint_set_contains_level(CloogConstraintSet *constraints, int level, int nb_parameters) { isl_basic_set *bset; bset = cloog_constraints_set_to_isl(constraints); return isl_basic_set_dim(bset, isl_dim_set) >= level; } struct cloog_isl_dim { enum isl_dim_type type; int pos; }; static struct cloog_isl_dim basic_set_cloog_dim_to_isl_dim( __isl_keep isl_basic_set *bset, int pos) { enum isl_dim_type types[] = { isl_dim_set, isl_dim_div, isl_dim_param }; int i; struct cloog_isl_dim ci_dim; for (i = 0; i < 3; ++i) { unsigned dim = isl_basic_set_dim(bset, types[i]); if (pos < dim) { ci_dim.type = types[i]; ci_dim.pos = pos; return ci_dim; } pos -= dim; } assert(0); } static struct cloog_isl_dim set_cloog_dim_to_isl_dim( CloogConstraintSet *constraints, int pos) { isl_basic_set *bset; bset = cloog_constraints_set_to_isl(constraints); return basic_set_cloog_dim_to_isl_dim(bset, pos); } /* Check if the variable at position level is defined by an * equality. If so, return the row number. Otherwise, return -1. */ CloogConstraint *cloog_constraint_set_defining_equality( CloogConstraintSet *constraints, int level) { struct isl_constraint *c; struct cloog_isl_dim dim; isl_basic_set *bset; bset = cloog_constraints_set_to_isl(constraints); dim = set_cloog_dim_to_isl_dim(constraints, level - 1); if (isl_basic_set_has_defining_equality(bset, dim.type, dim.pos, &c)) return cloog_constraint_from_isl_constraint(c); else return NULL; } struct cloog_isl_other { int level; int found; isl_constraint *u; isl_constraint *l; }; /* Set other->found to 1 if the given constraint involves other->level * and is different from other->u and other->l. */ static int check_other_constraint(__isl_take isl_constraint *c, void *user) { struct cloog_isl_other *other = user; CloogConstraint *cc; if (!isl_constraint_is_equal(c, other->l) && !isl_constraint_is_equal(c, other->u)) { cc = cloog_constraint_from_isl_constraint(c); if (cloog_constraint_involves(cc, other->level - 1)) other->found = 1; } isl_constraint_free(c); return other->found ? -1 : 0; } /* Check if the variable (e) at position level is defined by a * pair of inequalities * + -m e + + k1 >= 0 * <-a, i> + m e + <-b, p> + k2 >= 0 * with 0 <= k1 + k2 < m * If so return the row number of the upper bound and set *lower * to the row number of the lower bound. If not, return -1. * * If the variable at position level occurs in any other constraint, * then we currently return -1. The modulo guard that we would generate * would still be correct, but we would also need to generate * guards corresponding to the other constraints, and this has not * been implemented yet. */ CloogConstraint *cloog_constraint_set_defining_inequalities( CloogConstraintSet *constraints, int level, CloogConstraint **lower, int nb_par) { struct isl_constraint *u; struct isl_constraint *l; struct cloog_isl_dim dim; struct isl_basic_set *bset; struct cloog_isl_other other; bset = cloog_constraints_set_to_isl(constraints); dim = set_cloog_dim_to_isl_dim(constraints, level - 1); if (!isl_basic_set_has_defining_inequalities(bset, dim.type, dim.pos, &l, &u)) return cloog_constraint_invalid(); other.l = l; other.u = u; other.found = 0; other.level = level; isl_basic_set_foreach_constraint(bset, &check_other_constraint, &other); if (other.found) { isl_constraint_free(l); isl_constraint_free(u); *lower = NULL; return NULL; } *lower = cloog_constraint_from_isl_constraint(l); return cloog_constraint_from_isl_constraint(u); } int cloog_constraint_set_total_dimension(CloogConstraintSet *constraints) { isl_basic_set *bset; bset = cloog_constraints_set_to_isl(constraints); return isl_basic_set_total_dim(bset); } int cloog_constraint_set_n_iterators(CloogConstraintSet *constraints, int n_par) { isl_basic_set *bset; bset = cloog_constraints_set_to_isl(constraints); return isl_basic_set_dim(bset, isl_dim_set); } /****************************************************************************** * Equalities spreading functions * ******************************************************************************/ /* Equalities are stored inside a Matrix data structure called "equal". * This matrix has (nb_scattering + nb_iterators + 1) rows (i.e. total * dimensions + 1, the "+ 1" is because a statement can be included inside an * external loop without iteration domain), and (nb_scattering + nb_iterators + * nb_parameters + 2) columns (all unknowns plus the scalar plus the equality * type). The ith row corresponds to the equality "= 0" for the ith dimension * iterator. The first column gives the equality type (0: no equality, then * EQTYPE_* -see pprint.h-). At each recursion of pprint, if an equality for * the current level is found, the corresponding row is updated. Then the * equality if it exists is used to simplify expressions (e.g. if we have * "i+1" while we know that "i=2", we simplify it in "3"). At the end of * the pprint call, the corresponding row is reset to zero. */ CloogEqualities *cloog_equal_alloc(int n, int nb_levels, int nb_parameters) { int i; CloogEqualities *equal = ALLOC(CloogEqualities); equal->total_dim = nb_levels - 1 + nb_parameters; equal->n = n; equal->constraints = ALLOCN(isl_constraint *, n); equal->types = ALLOCN(int, n); for (i = 0; i < n; ++i) { equal->constraints[i] = NULL; equal->types[i] = EQTYPE_NONE; } return equal; } int cloog_equal_total_dimension(CloogEqualities *equal) { return equal->total_dim; } void cloog_equal_free(CloogEqualities *equal) { int i; for (i = 0; i < equal->n; ++i) isl_constraint_free(equal->constraints[i]); free(equal->constraints); free(equal->types); free(equal); } int cloog_equal_count(CloogEqualities *equal) { return equal->n; } /** * cloog_constraint_equal_type function : * This function returns the type of the equality in the constraint (line) of * (constraints) for the element (level). An equality is 'constant' iff all * other factors are null except the constant one. It is a 'pure item' iff * it is equal or opposite to a single variable or parameter. * Otherwise it is an 'affine expression'. * For instance: * i = -13 is constant, i = j, j = -M are pure items, * j = 2*M, i = j+1, 2*j = M are affine expressions. * * - constraints is the matrix of constraints, * - level is the column number in equal of the element which is 'equal to', */ static int cloog_constraint_equal_type(CloogConstraint *cc, int level) { int i; isl_int c; int type = EQTYPE_NONE; struct isl_constraint *constraint = cloog_constraint_to_isl(cc); isl_int_init(c); isl_constraint_get_constant(constraint, &c); if (!isl_int_is_zero(c)) type = EQTYPE_CONSTANT; isl_constraint_get_coefficient(constraint, isl_dim_set, level - 1, &c); if (!isl_int_is_one(c) && !isl_int_is_negone(c)) type = EQTYPE_EXAFFINE; for (i = 0; i < isl_constraint_dim(constraint, isl_dim_param); ++i) { isl_constraint_get_coefficient(constraint, isl_dim_param, i, &c); if (isl_int_is_zero(c)) continue; if ((!isl_int_is_one(c) && !isl_int_is_negone(c)) || type != EQTYPE_NONE) { type = EQTYPE_EXAFFINE; break; } type = EQTYPE_PUREITEM; } for (i = 0; i < isl_constraint_dim(constraint, isl_dim_set); ++i) { if (i == level - 1) continue; isl_constraint_get_coefficient(constraint, isl_dim_set, i, &c); if (isl_int_is_zero(c)) continue; if ((!isl_int_is_one(c) && !isl_int_is_negone(c)) || type != EQTYPE_NONE) { type = EQTYPE_EXAFFINE; break; } type = EQTYPE_PUREITEM; } for (i = 0; i < isl_constraint_dim(constraint, isl_dim_div); ++i) { isl_constraint_get_coefficient(constraint, isl_dim_div, i, &c); if (isl_int_is_zero(c)) continue; if ((!isl_int_is_one(c) && !isl_int_is_negone(c)) || type != EQTYPE_NONE) { type = EQTYPE_EXAFFINE; break; } type = EQTYPE_PUREITEM; } isl_int_clear(c); if (type == EQTYPE_NONE) type = EQTYPE_CONSTANT; return type; } int cloog_equal_type(CloogEqualities *equal, int level) { return equal->types[level-1]; } /** * cloog_equal_add function: * This function updates the row (level-1) of the equality matrix (equal) with * the row that corresponds to the row (line) of the matrix (matrix). * - equal is the matrix of equalities, * - matrix is the matrix of constraints, * - level is the column number in matrix of the element which is 'equal to', * - line is the line number in matrix of the constraint we want to study, * - the infos structure gives the user all options on code printing and more. ** * line is set to an invalid constraint for equalities that CLooG itself has * discovered because the lower and upper bound of a loop happened to be equal. * This situation shouldn't happen in the isl port since isl should * have found the equality itself. */ void cloog_equal_add(CloogEqualities *equal, CloogConstraintSet *matrix, int level, CloogConstraint *line, int nb_par) { isl_constraint *c; assert(cloog_constraint_is_valid(line)); equal->types[level-1] = cloog_constraint_equal_type(line, level); c = cloog_constraint_to_isl(line); equal->constraints[level - 1] = isl_constraint_copy(c); } /** * cloog_equal_del function : * This function reset the equality corresponding to the iterator (level) * in the equality matrix (equal). * - July 2nd 2002: first version. */ void cloog_equal_del(CloogEqualities *equal, int level) { equal->types[level-1] = EQTYPE_NONE; isl_constraint_free(equal->constraints[level - 1]); equal->constraints[level-1] = NULL; } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * Function cloog_constraint_set_normalize: * This function will modify the constraint system in such a way that when * there is an equality depending on the element at level 'level', there are * no more (in)equalities depending on this element. * * The simplified form of isl automatically satisfies this condition. */ void cloog_constraint_set_normalize(CloogConstraintSet *matrix, int level) { } /** * cloog_constraint_set_copy function: * this functions builds and returns a "hard copy" (not a pointer copy) of a * CloogConstraintSet data structure. */ CloogConstraintSet *cloog_constraint_set_copy(CloogConstraintSet *constraints) { isl_basic_set *bset; bset = cloog_constraints_set_to_isl(constraints); return cloog_constraint_set_from_isl_basic_set(isl_basic_set_dup(bset)); } /** * cloog_constraint_set_simplify function: * this function simplify all constraints inside the matrix "matrix" thanks to * an equality matrix "equal" that gives for some elements of the affine * constraint an equality with other elements, preferably constants. * For instance, if a row of the matrix contains i+j+3>=0 and the equality * matrix gives i=n and j=2, the constraint is simplified to n+3>=0. The * simplified constraints are returned back inside a new simplified matrix. * - matrix is the set of constraints to simplify, * - equal is the matrix of equalities, * - level is a level we don't want to simplify (-1 if none), * - nb_par is the number of parameters of the program. ** * isl should have performed these simplifications already in isl_set_gist. */ CloogConstraintSet *cloog_constraint_set_simplify(CloogConstraintSet *matrix, CloogEqualities *equal, int level, int nb_par) { return cloog_constraint_set_copy(matrix); } static struct cloog_isl_dim constraint_cloog_dim_to_isl_dim( CloogConstraint *constraint, int pos) { enum isl_dim_type types[] = { isl_dim_set, isl_dim_div, isl_dim_param }; int i; struct cloog_isl_dim ci_dim; for (i = 0; i < 3; ++i) { isl_constraint *c = cloog_constraint_to_isl(constraint); unsigned dim = isl_constraint_dim(c, types[i]); if (pos < dim) { ci_dim.type = types[i]; ci_dim.pos = pos; return ci_dim; } pos -= dim; } assert(0); } static struct clast_expr *div_expr(CloogConstraint *constraint, int pos, CloogNames *names) { int i, nb_elts; unsigned dim = cloog_constraint_total_dimension(constraint); cloog_int_t c; struct clast_reduction *r; struct clast_expr *e = NULL; isl_aff *div; div = isl_constraint_get_div(cloog_constraint_to_isl(constraint), pos); cloog_int_init(c); for (i = 0, nb_elts = 0; i < dim; ++i) { struct cloog_isl_dim dim; dim = constraint_cloog_dim_to_isl_dim(constraint, i); if (dim.type == isl_dim_set) dim.type = isl_dim_in; isl_aff_get_coefficient(div, dim.type, dim.pos, &c); if (!cloog_int_is_zero(c)) ++nb_elts; } isl_aff_get_constant(div, &c); if (!cloog_int_is_zero(c)) ++nb_elts; r = new_clast_reduction(clast_red_sum, nb_elts); for (i = 0, nb_elts = 0; i < dim; ++i) { struct clast_expr *v; struct cloog_isl_dim dim; dim = constraint_cloog_dim_to_isl_dim(constraint, i); if (dim.type == isl_dim_set) dim.type = isl_dim_in; isl_aff_get_coefficient(div, dim.type, dim.pos, &c); if (cloog_int_is_zero(c)) continue; v = cloog_constraint_variable_expr(constraint, 1 + i, names); r->elts[nb_elts++] = &new_clast_term(c, v)->expr; } isl_aff_get_constant(div, &c); if (!cloog_int_is_zero(c)) r->elts[nb_elts++] = &new_clast_term(c, NULL)->expr; isl_aff_get_denominator(div, &c); e = &new_clast_binary(clast_bin_fdiv, &r->expr, c)->expr; cloog_int_clear(c); isl_aff_free(div); return e; } /** * Return clast_expr corresponding to the variable "level" (1 based) in * the given constraint. */ struct clast_expr *cloog_constraint_variable_expr(CloogConstraint *constraint, int level, CloogNames *names) { struct cloog_isl_dim dim; const char *name; assert(constraint); dim = constraint_cloog_dim_to_isl_dim(constraint, level - 1); if (dim.type == isl_dim_div) return div_expr(constraint, dim.pos, names); if (dim.type == isl_dim_set) name = cloog_names_name_at_level(names, level); else name = names->parameters[dim.pos]; return &new_clast_name(name)->expr; } /** * Return true if constraint c involves variable v (zero-based). */ int cloog_constraint_involves(CloogConstraint *constraint, int v) { isl_int c; int res; isl_int_init(c); cloog_constraint_coefficient_get(constraint, v, &c); res = !isl_int_is_zero(c); isl_int_clear(c); return res; } int cloog_constraint_is_lower_bound(CloogConstraint *constraint, int v) { isl_int c; int res; isl_int_init(c); cloog_constraint_coefficient_get(constraint, v, &c); res = isl_int_is_pos(c); isl_int_clear(c); return res; } int cloog_constraint_is_upper_bound(CloogConstraint *constraint, int v) { isl_int c; int res; isl_int_init(c); cloog_constraint_coefficient_get(constraint, v, &c); res = isl_int_is_neg(c); isl_int_clear(c); return res; } int cloog_constraint_is_equality(CloogConstraint *constraint) { return isl_constraint_is_equality(cloog_constraint_to_isl(constraint)); } CloogConstraintSet *cloog_constraint_set_drop_constraint( CloogConstraintSet *constraints, CloogConstraint *constraint) { isl_basic_set *bset; isl_constraint *c; bset = cloog_constraints_set_to_isl(constraints); c = cloog_constraint_to_isl(cloog_constraint_copy(constraint)); bset = isl_basic_set_drop_constraint(bset, c); return cloog_constraint_set_from_isl_basic_set(bset); } void cloog_constraint_coefficient_get(CloogConstraint *constraint, int var, cloog_int_t *val) { struct cloog_isl_dim dim; isl_constraint *c; if (!constraint) return; dim = constraint_cloog_dim_to_isl_dim(constraint, var); c = cloog_constraint_to_isl(constraint); isl_constraint_get_coefficient(c, dim.type, dim.pos, val); } void cloog_constraint_coefficient_set(CloogConstraint *constraint, int var, cloog_int_t val) { struct cloog_isl_dim dim; isl_constraint *c; assert(constraint); dim = constraint_cloog_dim_to_isl_dim(constraint, var); c = cloog_constraint_to_isl(constraint); isl_constraint_set_coefficient(c, dim.type, dim.pos, val); } void cloog_constraint_constant_get(CloogConstraint *constraint, cloog_int_t *val) { isl_constraint_get_constant(cloog_constraint_to_isl(constraint), val); } /** * Copy the coefficient of constraint c into dst in PolyLib order, * i.e., first the coefficients of the variables, then the coefficients * of the parameters and finally the constant. */ void cloog_constraint_copy_coefficients(CloogConstraint *constraint, cloog_int_t *dst) { int i; unsigned dim; dim = cloog_constraint_total_dimension(constraint); for (i = 0; i < dim; ++i) cloog_constraint_coefficient_get(constraint, i, dst+i); cloog_constraint_constant_get(constraint, dst+dim); } CloogConstraint *cloog_constraint_invalid(void) { return NULL; } int cloog_constraint_is_valid(CloogConstraint *constraint) { return constraint != NULL; } int cloog_constraint_total_dimension(CloogConstraint *constraint) { isl_constraint *c; c = cloog_constraint_to_isl(constraint); return isl_constraint_dim(c, isl_dim_all); } /** * Check whether there is any need for the constraint "upper" on * "level" to get reduced. * In case of the isl backend, there should be no need to do so * if the level corresponds to an existentially quantified variable. * Moreover, the way reduction is performed does not work for such * variables since its position might chance during the construction * of a set for reduction. */ int cloog_constraint_needs_reduction(CloogConstraint *upper, int level) { isl_basic_set *bset; isl_constraint *c; struct cloog_isl_dim dim; c = cloog_constraint_to_isl(upper); bset = isl_basic_set_from_constraint(isl_constraint_copy(c)); dim = basic_set_cloog_dim_to_isl_dim(bset, level - 1); isl_basic_set_free(bset); return dim.type == isl_dim_set; } /** * Create a CloogConstraintSet containing enough information to perform * a reduction on the upper equality (in this case lower is an invalid * CloogConstraint) or the pair of inequalities upper and lower * from within insert_modulo_guard. * In the isl backend, we return a CloogConstraintSet containing both * bounds, as the stride may change during the reduction and we may * need to recompute the bound on the modulo expression. */ CloogConstraintSet *cloog_constraint_set_for_reduction(CloogConstraint *upper, CloogConstraint *lower) { struct isl_basic_set *bset; isl_constraint *c; c = cloog_constraint_to_isl(upper); bset = isl_basic_set_from_constraint(isl_constraint_copy(c)); if (cloog_constraint_is_valid(lower)) { c = cloog_constraint_to_isl(lower); bset = isl_basic_set_add_constraint(bset, isl_constraint_copy(c)); } return cloog_constraint_set_from_isl_basic_set(bset); } static int add_constant_term(CloogConstraint *c, void *user) { isl_int *bound = (isl_int *)user; isl_int v; isl_int_init(v); cloog_constraint_constant_get(c, &v); isl_int_add(*bound, *bound, v); isl_int_clear(v); return 0; } /* Return an isl_basic_set representation of the equality stored * at position i in the given CloogEqualities. */ static __isl_give isl_basic_set *equality_to_basic_set(CloogEqualities *equal, int i) { isl_constraint *c; isl_basic_set *bset; unsigned nparam; unsigned nvar; c = isl_constraint_copy(equal->constraints[i]); bset = isl_basic_set_from_constraint(c); nparam = isl_basic_set_dim(bset, isl_dim_param); nvar = isl_basic_set_dim(bset, isl_dim_set); bset = isl_basic_set_add_dims(bset, isl_dim_set, equal->total_dim - (nparam + nvar)); return bset; } /** * Reduce the modulo guard expressed by "constraints" using equalities * found in outer nesting levels (stored in "equal"). * The modulo guard may be an equality or a pair of inequalities. * In case of a pair of inequalities, *bound contains the bound on the * corresponding modulo expression. If any reduction is performed * then this bound is recomputed. * * "level" may not correspond to an existentially quantified variable. * * We first check if there are any equalities we can use. If not, * there is again nothing to reduce. * For the actual reduction, we use isl_basic_set_gist, but this * function will only perform the reduction we want here if the * the variable that imposes the modulo constraint has been projected * out (i.e., turned into an existentially quantified variable). * After the call to isl_basic_set_gist, we need to move the * existential variable back into the position where the calling * function expects it (assuming there are any constraints left). * We do this by adding an equality between the given dimension and * the existentially quantified variable. * * If there are no existentially quantified variables left, then * we don't need to add this equality. * If, on the other hand, the resulting basic set involves more * than one existentially quantified variable, then the caller * will not be able to handle the result, so we just return the * original input instead. */ CloogConstraintSet *cloog_constraint_set_reduce(CloogConstraintSet *constraints, int level, CloogEqualities *equal, int nb_par, cloog_int_t *bound) { int j; isl_space *idim; struct isl_basic_set *eq; struct isl_basic_map *id; struct cloog_isl_dim dim; struct isl_constraint *c; unsigned constraints_dim; unsigned n_div; isl_basic_set *bset, *orig; bset = cloog_constraints_set_to_isl(constraints); orig = isl_basic_set_copy(bset); dim = set_cloog_dim_to_isl_dim(constraints, level - 1); assert(dim.type == isl_dim_set); eq = NULL; for (j = 0; j < level - 1; ++j) { isl_basic_set *bset_j; if (equal->types[j] != EQTYPE_EXAFFINE) continue; bset_j = equality_to_basic_set(equal, j); if (!eq) eq = bset_j; else eq = isl_basic_set_intersect(eq, bset_j); } if (!eq) { isl_basic_set_free(orig); return cloog_constraint_set_from_isl_basic_set(bset); } idim = isl_space_map_from_set(isl_basic_set_get_space(bset)); id = isl_basic_map_identity(idim); id = isl_basic_map_remove_dims(id, isl_dim_out, dim.pos, 1); bset = isl_basic_set_apply(bset, isl_basic_map_copy(id)); bset = isl_basic_set_apply(bset, isl_basic_map_reverse(id)); constraints_dim = isl_basic_set_dim(bset, isl_dim_set); eq = isl_basic_set_remove_dims(eq, isl_dim_set, constraints_dim, isl_basic_set_dim(eq, isl_dim_set) - constraints_dim); bset = isl_basic_set_gist(bset, eq); n_div = isl_basic_set_dim(bset, isl_dim_div); if (n_div > 1) { isl_basic_set_free(bset); return cloog_constraint_set_from_isl_basic_set(orig); } if (n_div < 1) { isl_basic_set_free(orig); return cloog_constraint_set_from_isl_basic_set(bset); } c = isl_equality_alloc(isl_basic_set_get_local_space(bset)); c = isl_constraint_set_coefficient_si(c, isl_dim_div, 0, 1); c = isl_constraint_set_coefficient_si(c, isl_dim_set, dim.pos, -1); bset = isl_basic_set_add_constraint(bset, c); isl_int_set_si(*bound, 0); constraints = cloog_constraint_set_from_isl_basic_set(bset); cloog_constraint_set_foreach_constraint(constraints, add_constant_term, bound); isl_basic_set_free(orig); return cloog_constraint_set_from_isl_basic_set(bset); } CloogConstraint *cloog_constraint_copy(CloogConstraint *constraint) { return cloog_constraint_from_isl_constraint( isl_constraint_copy(cloog_constraint_to_isl(constraint))); } void cloog_constraint_release(CloogConstraint *constraint) { isl_constraint_free(cloog_constraint_to_isl(constraint)); } struct cloog_isl_foreach { int (*fn)(CloogConstraint *constraint, void *user); void *user; }; static int cloog_isl_foreach_cb(__isl_take isl_constraint *c, void *user) { struct cloog_isl_foreach *data = (struct cloog_isl_foreach *)user; int ret; if (isl_constraint_is_div_constraint(c)) { isl_constraint_free(c); return 0; } ret = data->fn(cloog_constraint_from_isl_constraint(c), data->user); isl_constraint_free(c); return ret; } int cloog_constraint_set_foreach_constraint(CloogConstraintSet *constraints, int (*fn)(CloogConstraint *constraint, void *user), void *user) { struct cloog_isl_foreach data = { fn, user }; isl_basic_set *bset; bset = cloog_constraints_set_to_isl(constraints); return isl_basic_set_foreach_constraint(bset, cloog_isl_foreach_cb, &data); } CloogConstraint *cloog_equal_constraint(CloogEqualities *equal, int j) { isl_constraint *c; c = isl_constraint_copy(equal->constraints[j]); return cloog_constraint_from_isl_constraint(c); } /* Given a stride constraint on iterator i (specified by level) of the form * * i = f(outer iterators) + stride * f(existentials) * * extract f as an isl_aff. */ static isl_aff *extract_stride_offset(__isl_keep isl_constraint *c, int level, CloogStride *stride) { int i; isl_space *dim = isl_constraint_get_space(c); isl_local_space *ls = isl_local_space_from_space(dim); isl_aff *offset = isl_aff_zero_on_domain(ls); isl_int u; unsigned nparam, nvar; isl_int_init(u); nparam = isl_constraint_dim(c, isl_dim_param); nvar = isl_constraint_dim(c, isl_dim_set); for (i = 0; i < nparam; ++i) { isl_constraint_get_coefficient(c, isl_dim_param, i, &u); isl_int_mul(u, u, stride->factor); offset = isl_aff_set_coefficient(offset, isl_dim_param, i, u); } for (i = 0; i < nvar; ++i) { if (i == level - 1) continue; isl_constraint_get_coefficient(c, isl_dim_set, i, &u); isl_int_mul(u, u, stride->factor); offset = isl_aff_set_coefficient(offset, isl_dim_in, i, u); } isl_constraint_get_constant(c, &u); isl_int_mul(u, u, stride->factor); offset = isl_aff_set_constant(offset, u); isl_int_clear(u); return offset; } /* Update the given lower bound on level such that it satisfies the stride * constraint. The computation performed here is essentially the same * as that performed in constraint_stride_lower_c. * * We update the constraint * * a i + f >= 0 * * to * * i >= s * ceil((-f/a - d)/s) + d * * with s the stride and d the offset encoded in the stride constraint. */ CloogConstraint *cloog_constraint_stride_lower_bound(CloogConstraint *c, int level, CloogStride *stride) { isl_constraint *stride_c = cloog_constraint_to_isl(stride->constraint); isl_constraint *bound = cloog_constraint_to_isl(c); isl_aff *offset; isl_aff *lower; lower = isl_constraint_get_bound(bound, isl_dim_set, level - 1); isl_constraint_free(bound); offset = extract_stride_offset(stride_c, level, stride); lower = isl_aff_sub(lower, isl_aff_copy(offset)); lower = isl_aff_scale_down(lower, stride->stride); lower = isl_aff_ceil(lower); lower = isl_aff_scale(lower, stride->stride); lower = isl_aff_add(lower, offset); lower = isl_aff_neg(lower); lower = isl_aff_add_coefficient_si(lower, isl_dim_in, level - 1, 1); bound = isl_inequality_from_aff(lower); return cloog_constraint_from_isl_constraint(bound); } cloog-0.18.2/source/block.c0000664000175000017500000003143012254312305012364 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** block.c ** **-------------------------------------------------------------------** ** First version: june 11th 2005 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /* CAUTION: the english used for comments is probably the worst you ever read, * please feel free to correct and improve it ! */ # include # include # include "../include/cloog/cloog.h" /****************************************************************************** * Memory leaks hunting * ******************************************************************************/ /** * These functions and global variables are devoted to memory leaks hunting: we * want to know at each moment how many CloogBlock structures had been allocated * (cloog_block_allocated) and how many had been freed (cloog_block_freed). * Each time a CloogBlock structure is allocated, a call to the function * cloog_block_leak_up() must be carried out, and respectively * cloog_block_leak_down() when a CloogBlock structure is freed. The special * variable cloog_block_max gives the maximal number of CloogBlock structures * simultaneously alive (i.e. allocated and non-freed) in memory. * - June 11th 2005: first version. */ static void cloog_block_leak_up(CloogState *state) { state->block_allocated++; if ((state->block_allocated - state->block_freed) > state->block_max) state->block_max = state->block_allocated - state->block_freed; } static void cloog_block_leak_down(CloogState *state) { state->block_freed++; } /****************************************************************************** * Structure display function * ******************************************************************************/ /** * cloog_domain_print_structure : * this function is a human-friendly way to display the CloogDomain data * structure, it includes an indentation level (level) in order to work with * others print_structure functions. * - June 16th 2005: first version. */ void cloog_block_print_structure(FILE * file, CloogBlock * block, int level) { int i ; /* Go to the right level. */ for (i=0; istatement,level+1) ; /* A blank line. */ for (i=0; inb_scaldims == 0) fprintf(file,"No scalar dimensions\n") ; else { fprintf(file,"Scalar dimensions (%d):",block->nb_scaldims) ; for (i = 0; i < block->nb_scaldims; i++) { fprintf(file, " "); cloog_int_print(file, block->scaldims[i]); } fprintf(file,"\n") ; } /* A blank line. */ for (i=0; idepth) ; /* A blank line. */ for (i=0; iblock,1) ; blocklist = blocklist->next ; i++ ; } } /****************************************************************************** * Memory deallocation function * ******************************************************************************/ /** * cloog_block_free function: * This function frees the allocated memory for a CloogStatement structure. * - June 11th 2005: first version. * - June 30th 2005: scaldims field management. */ void cloog_block_free(CloogBlock * block) { int i ; if (block != NULL) { block->references -- ; if (block->references == 0) { cloog_block_leak_down(block->state); if (block->scaldims != NULL) { for (i=0;inb_scaldims;i++) cloog_int_clear(block->scaldims[i]); free(block->scaldims) ; } if (block->statement) cloog_statement_free(block->statement); free(block) ; } } } /** * cloog_block_list_free function: * This function frees the allocated memory for a CloogBlockList structure. * - June 11th 2005: first version. */ void cloog_block_list_free(CloogBlockList * blocklist) { CloogBlockList * temp ; while (blocklist != NULL) { temp = blocklist->next ; cloog_block_free(blocklist->block) ; free(blocklist) ; blocklist = temp ; } } /****************************************************************************** * Processing functions * ******************************************************************************/ /** * cloog_block_malloc function: * This function allocates the memory space for a CloogBlock structure and * sets its fields with default values. Then it returns a pointer to the * allocated space. * - November 21th 2005: first version. */ CloogBlock *cloog_block_malloc(CloogState *state) { CloogBlock * block ; /* Memory allocation for the CloogBlock structure. */ block = (CloogBlock *)malloc(sizeof(CloogBlock)) ; if (block == NULL) cloog_die("memory overflow.\n"); cloog_block_leak_up(state); /* We set the various fields with default values. */ block->state = state; block->statement = NULL ; block->nb_scaldims = 0 ; block->scaldims = NULL ; block->depth = 0 ; block->references = 1 ; block->usr = NULL; return block ; } /** * cloog_block_alloc function: * This function allocates the memory space for a CloogBlock structure and * sets its fields with those given as input. Then it returns a pointer to the * allocated space. The two parameters nb_scaldims and scaldims are for internal * service, put to respectively 0 and NULL if you don't know what they are * useful for ! * - statement is the statement list of the block, * - scattering is the scattering function for the block (NULL if unsure !), * - nb_scaldims is the number of scalar dimensions (0 if unsure !), * - scaldims is the array with the scalar dimensions values (NULL if unsure !), * - depth is the original block depth (the number of outer loops). ** * - June 11th 2005: first version. * - June 30th 2005: addition of the nb_scaldims and scaldims parameters. * - November 21th 2005: use of cloog_block_malloc. */ CloogBlock *cloog_block_alloc(CloogStatement *statement, int nb_scaldims, cloog_int_t *scaldims, int depth) { CloogBlock * block ; /* Block allocation. */ block = cloog_block_malloc(statement->state); block->statement = statement ; block->nb_scaldims = nb_scaldims ; block->scaldims = scaldims ; block->depth = depth ; block->references = 1 ; return block ; } /** * cloog_block_list_malloc function: * This function allocates the memory space for a CloogBlockList structure and * sets its fields with default values. Then it returns a pointer to the * allocated space. * - November 21th 2005: first version. */ CloogBlockList * cloog_block_list_malloc() { CloogBlockList * blocklist ; /* Memory allocation for the CloogBlock structure. */ blocklist = (CloogBlockList *)malloc(sizeof(CloogBlockList)) ; if (blocklist == NULL) cloog_die("memory overflow.\n"); /* We set the various fields with default values. */ blocklist->block = NULL ; blocklist->next = NULL ; return blocklist ; } /** * cloog_block_list_alloc function: * This function allocates the memory space for a CloogBlockList structure and * sets its fields with those given as input. Then it returns a pointer to the * allocated space. * - block is the block element of the list node, ** * - June 11th 2005: first version. * - November 21th 2005: use of cloog_block_list_malloc. */ CloogBlockList * cloog_block_list_alloc(CloogBlock * block) { CloogBlockList * blocklist ; /* Block list node allocation. */ blocklist = cloog_block_list_malloc() ; blocklist->block = block ; blocklist->block->references ++ ; /* The block has a new reference to it. */ blocklist->next = NULL ; return blocklist ; } /** * cloog_block_copy function: * This function returns a copy of a CloogBlock structure 'block'. To save * memory this is not a memory copy but we increment a counter of active * references inside the structure, then return a pointer to that structure. */ CloogBlock * cloog_block_copy(CloogBlock * block) { if (block == NULL) return NULL ; block->references ++ ; return block ; } /** * cloog_block_merge function: * this function adds at the end of the statement list of the block 'block', * the statement list of the block 'merged'. Then the CloogBlock structure * of 'merged' is freed (obviously not its statement list that is now * included in 'block'). * - June 11th 2005: first version. */ void cloog_block_merge(CloogBlock * block, CloogBlock * merged) { CloogStatement * statement ; if ((block == NULL) || (merged == NULL)) return ; if (block->statement != NULL) { statement = block->statement ; while (statement->next != NULL) statement = statement->next ; statement->next = merged->statement ; } else block->statement = merged->statement ; merged->statement = NULL; cloog_block_free(merged); } cloog-0.18.2/README0000664000175000017500000002176312254312305010516 00000000000000# # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** The Chunky Loop Generator ** # **-------------------------------------------------------------------** # ** First version of this file: january 22th 2002 ** # **-------------------------------------------------------------------**/ # For complete informations about this software, how to build and use it, please see the postscript file in the ./doc subdirectory (a pdf version is available in the web site). Overview : I. Description II. Building CLooG III. Options IV. Running CLooG V. General Questions # **-------------------------------------------------------------------** # ** I. Description ** # **-------------------------------------------------------------------**/ CLooG is a software which generates loops for scanning Z-polyhedra. That is, CLooG finds the code or pseudo-code where each integral point of one or more parametrized polyhedron or parametrized polyhedra union is reached. CLooG is designed to avoid control overhead and to produce a very efficient code. Its input is some data on the polyhedra to scan, basically the system of affine inequalities that define them, and a context that defines some properties known on the parameters if any. The output is the pseudo scanning code. Many facilities are provided to generate a near-to-be-compileable code, and every useful functions to generate the code may be called from the CLooG library. INPUT | OUTPUT (fortunately not exactly the input, | (the real one, with default options) check test/readme.cloog for the | real input for that problem !) | | j^ i>=2 | | | j<=n+2-i | | |\ | i<=n | | | \ | | m-+-****---+-j<=m | for (i=2;i<=n;i++) { | ***** | | for (j=2;j<=min(m,-i+n+2);j++) { | ****** | ==> S1 ; | *******| | } 2-+-********-j>=2 | } | | |\ | 0-+-+------+--->i | | | | | 0 2 n | | Context : n>=2 | m>=2 | System : 2<=i<=n | 2<=j<=m | j<=n+2-i | # **-------------------------------------------------------------------** # ** II. Building CLooG ** # **-------------------------------------------------------------------**/ If you obtained CLooG from the git repository, then you first need to obtain the submodules and create a configure script. ./get_submodules.sh ./autogen.sh The first step is only needed if you plan on using the isl backend. The configure shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a Makefile. The file configure.ac is used to create configure by a program called autoconf. You only need configure.ac if you want to change it or regenerate configure using a newer version of autoconf. The simplest way to compile this package is: cd to the directory containing the package's source code and type ./configure to configure the package for your system (while running, configure prints some messages telling which features it is checking for). To compile the package, type make to install the program and/or the library, type make install you can remove the program binaries and object files from the source code directory by typing make clean To also remove the files that configure created (so you can compile the package for a different kind of computer) type make distclean # **-------------------------------------------------------------------** # ** III. Options ** # **-------------------------------------------------------------------**/ By default, make will install the package's files in /usr/local/bin, /usr/local/lib, etc. You can specify an installation prefix other than /usr/local by giving onfigure the option --prefix=PATH. By default, configure will use the isl that comes bundled with CLooG. Using the --with-isl option of configure the user can specify that "no" isl, a previously installed ("system") isl or a "build" isl should be used. In the latter case, the user should also specify the build location using --with-isl-builddir=PATH. In case of an installed isl, the installation location can be specified using the --with-isl-prefix=PATH and --with-isl-exec-prefix=PATH options of configure. By default, configure will seek the PolyLib in standard locations. If necessary, you can specify the PolyLib's path by giving configure the option --with-polylib-prefix=PATH and/or --with-polylib-exec-prefix=PATH. By default, configure will seek the GMP library in standard locations. If necessary, you can specify the GMP's path by giving configure the option --with-gmp-prefix=PATH and/or --with-gmp-exec-prefix=PATH. By default, when using the PolyLib backend, CLooG and its library are built using 64 bits integer representation. You can choose to specify explicitly others integer representations by using: --with-bits=32 for 32 bits integers, --with-bits=64 for 64 bits integers (default), --with-bits=gmp for multiple precision integers. # **-------------------------------------------------------------------** # ** IV. Running CLooG ** # **-------------------------------------------------------------------**/ To run CLooG, simply type 'cloog', optionally followed by the name of an input file. You can type 'cloog -h' or 'cloog --help' for some help. For more informations, please check the ./doc subdirectory. # **-------------------------------------------------------------------** # ** V. General Questions ** # **-------------------------------------------------------------------**/ 1. What does CLooG means ? CLooG is the Chunky LOOp Generator, Chunky is an automatic loop optimizer for data locality. CLooG is a completely independent part of the Chunky project. Pronounce 'CLooG' as 'klug', which means 'sly' in german :-). 2. CLooG do not compile, what should I do ? CLooG should compile everywhere (assuming that PolyLib is still there), thus there is a problem or the documentation is not clear, in both case it is necessary to ask the author(s) ! 3. I need a feature that CLooG do not implement, what should I do ? There are two ways. First, CLooG is a LGPL software and library. So you are welcome to improve it yourself ;-) ! Many project have been successful, it is -maybe- a sign that this is not too hard to put your hands inside the source. Second, just ask the author(s) :-) ! Maybe a lot of people would be interessed by such feature, maybe many people asked for it before, maybe it's trivial to implement (and even)... Please just never hesitate to ask the author(s) ! 4. I implemented a cool feature, can I submit it ? Obviously you are welcome to send the author(s) any improvement. But obviously we are quite careful with readability, correctness and stability, and the author(s) will read, check and check again any contribution before including it. Thus, it can take time... There are few basic rules to write contributions: - (1) Do never change the indentation of any part of the code that is not yours. - (2) Do never send codes that use more than 80 columns. - (3) Do never send codes without a lot of comments in (bad or good) english. - (4) Do never send codes with obscure and/or non-english variable names. - (5) Use C89, just C, only C (note: "//" comments are not C89, variable declaration elsewhere than at the beginning of a block, is not C89). - (6) Read doc/SubmittingPatches Please understand that in order to live for a long time, and to be used in many projects the very first priority for CLooG is to be readable and documented. 5. Is CLooG bug free ? No, who can ? ClooG is a complex program, and we do not pretend it to be bug free. Nevertheless because it has been tested and tested, we are fairly sure that CLooG results with default options have good chances to be satisfactory. If you find a result that looks strange, inadequate or incorrect, please send: - (1) The input file to the author(s). - (2) The output. - (3) The first line given by typing 'cloog -v'. - (4) All your command line options to achieve the result. We will try to explain the result or to fix the problem as soon as possible. 6. How can I contact the author(s) ? Just send a mail to cloog-development@googlegroups.com cloog-0.18.2/doc/0000775000175000017500000000000012254314447010463 500000000000000cloog-0.18.2/doc/cloog.texi0000664000175000017500000027056212254312305012404 00000000000000\input texinfo @c % @c % /**-----------------------------------------------------------------** @c % ** CLooG ** @c % **-----------------------------------------------------------------** @c % ** cloog.texi ** @c % **-----------------------------------------------------------------** @c % ** First version: july 6th 2002 ** @c % **-----------------------------------------------------------------**/ @c % @c % release 1.0: September 17th 2002 @c % release 1.1: December 5th 2002 @c % release 1.2: April 22th 2003 @c % release 2.0: November 21th 2005 (and now in texinfo instead of LaTeX) @c % release 2.1: October 15th 2007 @c % @c %/************************************************************************** @c % * CLooG : the Chunky Loop Generator (experimental) * @c % **************************************************************************/ @c %/* CAUTION: the English used is probably the worst you ever read, please @c % * feel free to correct and improve it ! @c % */ @c %\textit{"I found the ultimate transformation functions, optimization for @c %static control programs is now a closed problem, I have \textnormal{just} @c %to generate the target code !"} @c % /************************************************************************* @c % * PART I: HEADER * @c % *************************************************************************/ @c %**start of header @setfilename cloog.info @settitle CLooG - a loop generator for scanning polyhedra @set EDITION 2.1 @include gitversion.texi @set UPDATED October 15th 2007 @setchapternewpage odd @c %**end of header @c % /************************************************************************* @c % * PART II: SUMMARY DESCRIPTION AND COPYRIGHT * @c % *************************************************************************/ @copying This manual is for CLooG version @value{VERSION}, a software which generates loops for scanning Z-polyhedra. That is, CLooG produces a code visiting each integral point of a union of parametrized polyhedra. CLooG is designed to avoid control overhead and to produce a very efficient code. It would be quite kind to refer the following paper in any publication that results from the use of the CLooG software or its library: @example @@InProceedings@{Bas04, @ @ author =@ @ @ @ @{C. Bastoul@}, @ @ title =@ @ @ @ @ @{Code Generation in the Polyhedral Model @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ Is Easier Than You Think@}, @ @ booktitle = @{PACT'13 IEEE International Conference on @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ Parallel Architecture and Compilation Techniques@}, @ @ year =@ @ @ @ @ @ 2004, @ @ pages =@ @ @ @ @ @{7--16@}, @ @ month =@ @ @ @ @ @{september@}, @ @ address =@ @ @ @{Juan-les-Pins@} @} @end example Copyright @copyright{} 2002-2005 C@'edric Bastoul. @c quotation Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 published by the Free Software Foundation. To receive a copy of the GNU Free Documentation License, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA. @c end quotation @end copying @c % /************************************************************************* @c % * PART III: TITLEPAGE, CONTENTS, COPYRIGHT * @c % *************************************************************************/ @titlepage @title CLooG @subtitle A Loop Generator For Scanning Polyhedra @subtitle Edition @value{EDITION}, for CLooG @value{VERSION} @subtitle @value{UPDATED} @author C@'edric Bastoul @c The following two commands start the copyright page. @page @noindent (September 2001) @table @code @item C@'edric Bastoul SCHEDULES GENERATE !!! I just need to apply them now, where can I find a good code generator ?! @item Paul Feautrier Hmmm. I fear that if you want something powerful enough, you'll have to write it yourself ! @end table @vskip 0pt plus 1filll @insertcopying @end titlepage @c Output the table of contents at the beginning. @contents @c % /************************************************************************* @c % * PART IV: TOP NODE AND MASTER MENU * @c % *************************************************************************/ @ifnottex @node Top @top CLooG @insertcopying @end ifnottex @menu * Introduction:: * CLooG Software:: * CLooG Library:: @c * Hacking:: * Installing:: * Documentation:: * References:: @end menu @c % /************************************************************************* @c % * PART V: BODY OF THE DOCUMENT * @c % *************************************************************************/ @c % ****************************** INTRODUCTION ****************************** @node Introduction @chapter Introduction CLooG is a free software and library generating loops for scanning Z-polyhedra. That is, it finds a code (e.g. in C, FORTRAN...) that reaches each integral point of one or more parameterized polyhedra. CLooG has been originally written to solve the code generation problem for optimizing compilers based on the polytope model. Nevertheless it is used now in various area, e.g., to build control automata for high-level synthesis or to find the best polynomial approximation of a function. CLooG may help in any situation where scanning polyhedra matters. It uses the best state-of-the-art code generation algorithm known as the Quiller@'e et al. algorithm (@pxref{Qui00}) with our own improvements and extensions (@pxref{Bas04}). The user has full control on generated code quality. On one hand, generated code size has to be tuned for sake of readability or instruction cache use. On the other hand, we must ensure that a bad control management does not hamper performance of the generated code, for instance by producing redundant guards or complex loop bounds. CLooG is specially designed to avoid control overhead and to produce a very efficient code. CLooG stands for @emph{Chunky Loop Generator}: it is a part of the Chunky project, a research tool for data locality improvement (@pxref{Bas03a}). It is designed also to be the back-end of automatic parallelizers like LooPo (@pxref{Gri04}). Thus it is very compilable code oriented and provides powerful program transformation facilities. Mainly, it allows the user to specify very general schedules where, e.g., unimodularity or invertibility of the transformation doesn't matter. The current version is still under evaluation, and there is no guarantee that the upward compatibility will be respected (but the previous API has been stable for two years, we hope this one will be as successful -and we believe it-). A lot of reports are necessary to freeze the library API and the input file shape. Most API changes from 0.12.x to 0.14.x have been requested by the users themselves. Thus you are very welcome and encouraged to post reports on bugs, wishes, critics, comments, suggestions or successful experiences in the forum of @code{http://www.CLooG.org} or to send them to cedric.bastoul@@inria.fr directly. @menu * Basics:: * Scattering:: @end menu @node Basics @section Basically, what's the point ? If you want to use CLooG, this is because you want to scan or to find something inside the integral points of a set of polyhedra. There are many reasons for that. Maybe you need the generated code itself because it actually implements a very smart program transformation you found. Maybe you want to use the generated code because you know that the solution of your problem belongs to the integral points of those damned polyhedra and you don't know which one. Maybe you just want to know if a polyhedron has integral points depending on some parameters, which is the lexicographic minimum, maximum, the third on the basis of the left etc. Probably you have your own reasons to use CLooG. Let us illustrate a basic use of CLooG. Suppose we have a set of affine constraints that describes a part of a whatever-dimensional space, called a @strong{domain}, and we want to scan it. Let us consider for instance the following set of constraints where @samp{i} and @samp{j} are the unknown (the two dimensions of the space) and @samp{m} and @samp{n} are the parameters (some symbolic constants): @example @group 2<=i<=n 2<=j<=m j<=n+2-i @end group @end example Let us also consider that we have a partial knowledge of the parameter values, called the @strong{context}, expressed as affine constraints as well, for instance: @example @group m>=2 n>=2 @end group @end example Note that using parameters is optional, if you are not comfortable with parameter manipulation, just replace them with any scalar value that fits @code{m>=2} and @code{n>=2}. A graphical representation of this part of the 2-dimensional space, where the integral points are represented using heavy dots would be for instance: @image{images/basic,6cm} The affine constraints of both the domain and the context are what we will provide to CLooG as input (in a particular shape that will be described later). The output of CLooG is a pseudo-code to scan the integral points of the input domain according to the context: @example @group for (i=2;i<=n;i++) @{ for (j=2;j<=min(m,-i+n+2);j++) @{ S1(i,j) ; @} @} @end group @end example If you felt such a basic example is yet interesting, there is a good chance that CLooG is appropriate for you. CLooG can do much more: scanning several polyhedra or unions of polyhedra at the same time, applying general affine transformations to the polyhedra, generate compilable code etc. Welcome to the CLooG's user's guide ! @node Scattering @section Defining a Scanning Order: Scattering Functions In CLooG, domains only define the set of integral points to scan and their coordinates. In particular, CLooG is free to choose the scanning order for generating the most efficient code. This means, for optimizing/parallelizing compiler people, that CLooG doesn't make any speculation on dependences on and between statements (by the way, it's not its job !). For instance, if an user give to CLooG only two domains @code{S1:1<=i<=n}, @code{S2:1<=i<=n} and the context @code{n>=1}, the following pseudo-codes are considered to be equivalent: @example @group /* A convenient target pseudo-code. */ for (i=1;i<=N;i++) @{ S1(i) ; @} for (i=1;i<=N;i++) @{ S2(i) ; @} @end group @end example @example @group /* Another convenient target pseudo-code. */ for (i=1;i<=N;i++) @{ S1(i) ; S2(i) ; @} @end group @end example The default behaviour of CLooG is to generate the second one, since it is optimized in control. It is right if there are no data dependences between @code{S1} and @code{S2}, but wrong otherwise. Thus it is often useful to force scanning to respect a given order. This can be done in CLooG by using @strong{scattering functions}. Scattering is a shortcut for scheduling, allocation, chunking functions and the like we can find in the restructuring compilation literature. There are a lot of reasons to scatter the integral points of the domains (i.e. the statement instances of a program, for compilation people), parallelization or optimization are good examples. For instance, if the user wants for any reason to set some precedence constraints between the statements of our example above in order to force the generation of the first code, he can do it easily by setting (for example) the following scheduling functions: @tex $$\theta _{S1}(i) = (1)$$ $$\theta _{S2}(j) = (2)$$ @end tex @ifnottex @example @group T_S1(i) = (1) T_S2(j) = (2) @end group @end example @end ifnottex This scattering means that each integral point of the domain @code{S1} is scanned at logical date @code{1} while each integral point of the domain @code{S2} is scanned at logical date @code{2}. As a result, the whole domain @code{S1} is scanned before domain @code{S2} and the first code in our example is generated. The user can set every kind of affine scanning order thanks to the scattering functions. Each domain has its own scattering function and each scattering function may be multi-dimensional. A multi-dimensional logical date may be seen as classical date (year,month,day,hour,minute,etc.) where the first dimensions are the most significant. Each scattering dimension may depend linearly on the original dimensions (e.g., @code{i}), the parameters (e.g., @code{n}) ans scalars (e.g., @code{2}). A very useful example of multi-dimensional scattering functions is, for compilation people, the scheduling of the original program. The basic data to use for code generation are statement iteration domains. As we saw, these data are not sufficient to rebuild the original program (what is the ordering between instances of different statements ?). The missing data can be put in the scattering functions as the original scheduling. The method to compute it is quite simple (@pxref{Fea92}). The idea is to build an abstract syntax tree of the program and to read the scheduling for each statement. For instance, let us consider the following implementation of a Cholesky factorization: @example @group /* A Cholesky factorization kernel. */ for (i=1;i<=N;i++) @{ for (j=1;j<=i-1;j++) @{ a[i][i] -= a[i][j] ; /* S1 */ @} a[i][i] = sqrt(a[i][i]) ; /* S2 */ for (j=i+1;j<=N;j++) @{ for (k=1;k<=i-1;k++) @{ a[j][i] -= a[j][k]*a[i][k] ; /* S3 */ @} a[j][i] /= a[i][i] ; /* S4 */ @} @} @} @end group @end example The corresponding abstract syntax tree is given in the following figure. It directly gives the scattering functions (schedules) for all the statements of the program. @image{images/tree,6cm} @tex $$ \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (0,i,0,j,0)^T$\cr \theta _{S2}(i) &$= (0,i,1)^T$\cr \theta _{S3}(i,j,k)^T &$= (0,i,2,j,0,k,0)^T$\cr \theta _{S4}(i,j)^T &$= (0,i,2,j,1)^T$}$} $$ @end tex @ifnottex @example @group T_S1(i,j)^T = (0,i,0,j,0)^T T_S2(i) = (0,i,1)^T T_S3(i,j,k)^T = (0,i,2,j,0,k,0)^T T_S4(i,j)^T = (0,i,2,j,1)^T @end group @end example @end ifnottex These schedules depend on the iterators and give for each instance of each statement a unique execution date. Using such scattering functions allow CLooG to re-generate the input code. @c % ***********************Using the CLooG Software ************************** @node CLooG Software @chapter Using the CLooG Software @menu * A First Example:: * Writing The Input File:: * Calling CLooG:: * CLooG Options:: * Full Example:: @end menu @c %/************************************************************************* @c % * A FIRST EXAMPLE * @c % *************************************************************************/ @node A First Example @section A First Example CLooG takes as input a file that must be written accordingly to a grammar described in depth in a further section (@pxref{Writing The Input File}). Moreover it supports many options to tune the target code presentation or quality as discussed in a dedicated section (@pxref{Calling CLooG}). However, a basic use of CLooG is not very complex and we present in this section how to generate the code corresponding to a basic example discussed earlier (@pxref{Basics}). The problem is to find the code that scans a 2-dimensional polyhedron where @samp{i} and @samp{j} are the unknown (the two dimensions of the space) and @samp{m} and @samp{n} are the parameters (the symbolic constants), defined by the following set of constraints: @example @group 2<=i<=n 2<=j<=m j<=n+2-i @end group @end example @noindent We also consider a partial knowledge of the parameter values, expressed thanks to the following affine constraints: @example @group m>=2 n>=2 @end group @end example An input file that corresponds to this problem, and asks for a generated code in C, may be the following. Note that we do not describe here precisely the structure and the components of this file (@pxref{Writing The Input File} for such information, if you feel it necessary): @example # ---------------------- CONTEXT ---------------------- c # language is C # Context (constraints on two parameters) 2 4 # 2 lines and 4 columns # eq/in m n 1 eq/in: 1 for inequality >=0, 0 for equality =0 1 1 0 -2 # 1*m + 0*n -2*1 >= 0, i.e. m>=2 1 0 1 -2 # 0*m + 1*n -2*1 >= 0, i.e. n>=2 1 # We want to set manually the parameter names m n # parameter names # --------------------- STATEMENTS -------------------- 1 # Number of statements 1 # First statement: one domain # First domain 5 6 # 5 lines and 6 columns # eq/in i j m n 1 1 1 0 0 0 -2 # i >= 2 1 -1 0 0 1 0 # i <= n 1 0 1 0 0 -2 # j >= 2 1 0 -1 1 0 0 # j <= m 1 -1 -1 0 1 2 # n+2-i>=j 0 0 0 # for future options 1 # We want to set manually the iterator names i j # iterator names # --------------------- SCATTERING -------------------- 0 # No scattering functions @end example This file may be called @samp{basic.cloog} (this example is provided in the CLooG distribution as @code{test/manual_basic.cloog}) and we can ask CLooG to process it and to generate the code by a simple calling to CLooG with this file as input: @samp{cloog basic.cloog}. By default, CLooG will print the generated code in the standard output: @example @group /* Generated by CLooG v@value{VERSION} in 0.00s. */ for (i=2;i<=n;i++) @{ for (j=2;j<=min(m,-i+n+2);j++) @{ S1(i,j) ; @} @} @end group @end example @c %/************************************************************************* @c % * Input file * @c % *************************************************************************/ @node Writing The Input File @section Writing The Input File The input text file contains a problem description, i.e. the context, the domains and the scattering functions. Because CLooG is very 'compilable code generation oriented', we can associate some additional informations to each domain. We call this association a @emph{statement}. The set of all informations is called a @emph{program}. The input file respects the grammar below (terminals are preceded by "_"): @example File ::= Program Program ::= Context Statements Scattering Context ::= Language Domain_union Naming Statements ::= Nb_statements Statement_list Naming Scatterings ::= Nb_functions Scattering_list Naming Naming ::= Option Name_list Name_list ::= _String Name_list | (void) Statement_list ::= Statement Statement_list | (void) Domain_list ::= _Domain Domain_list | (void) Scattering_list ::= Domain_union Scattering_list | (void) Statement ::= Iteration_domain 0 0 0 Iteration_domain ::= Domain_union Domain_union ::= Nb_domains Domain_list Option ::= 0 | 1 Language ::= c | f Nb_statements ::= _Integer Nb_domains ::= _Integer Nb_functions ::= _Integer @end example Note: if there is only one domain in a @samp{Domain_union}, i.e., if @samp{Nb_domains} is 1, then this 1 may be omitted. @itemize @bullet @item @samp{Context} represents the informations that are shared by all the statements. It consists on the language used (which can be @samp{c} for C or @samp{f} for FORTRAN 90) and the global constraints on parameters. These constraints are essential since they give to CLooG the number of parameters. If there is no parameter or no constraints on parameters, just give a constraint always satisfied like @math{1 \geq 0}. @samp{Naming} sets the parameter names. If the naming option @samp{Option} is 1, parameter names will be read on the next line. There must be exactly as many names as parameters. If the naming option @samp{Option} is 0, parameter names are automatically generated. The name of the first parameter will be @samp{M}, and the name of the @math{(n+1)^{th}} parameter directly follows the name of the @math{n^{th}} parameter in ASCII code. It is the user responsibility to ensure that parameter names, iterators and scattering dimension names are different. @item @samp{Statements} represents the informations on the statements. @samp{Nb_statements} is the number of statements in the program, i.e. the number of @samp{Statement} items in the @samp{Statement_list}. @samp{Statement} represents the informations on a given statement. To each statement is associated a domain (the statement iteration domain: @samp{Iteration_domain}) and three zeroes that represents future options. @samp{Naming} sets the iterator names. If the naming option @samp{Option} is 1, the iterator names will be read on the next line. There must be exactly as many names as nesting level in the deepest iteration domain. If the naming option @samp{Option} is 0, iterator names are automatically generated. The iterator name of the outermost loop will be @samp{i}, and the iterator name of the loop at level @math{n+1} directly follows the iterator name of the loop at level @math{n} in ASCII code. @item @samp{Scatterings} represents the informations on scattering functions. @samp{Nb_functions} is the number of functions (it must be equal to the number of statements or 0 if there is no scattering function). The functions themselves are represented through @samp{Scattering_list}. @samp{Naming} sets the scattering dimension names. If the naming option @samp{Option} is 1, the scattering dimension names will be read on the next line. There must be exactly as many names as scattering dimensions. If the naming option @samp{Option} is 0, scattering dimension names are automatically generated. The name of the @math{n^{th}} scattering dimension will be @samp{cn}. @end itemize @menu * Domain Representation:: * Scattering Representation:: @end menu @node Domain Representation @subsection Domain Representation As shown by the grammar, the input file describes the various informations thanks to characters, integers and domains. Each domain is defined by a set of constraints in the PolyLib format (@pxref{Wil93}). They have the following syntax: @enumerate @item some optional comment lines beginning with @samp{#}, @item the row and column numbers, possibly followed by comments, @item the constraint rows, each row corresponds to a constraint the domain have to satisfy. Each row must be on a single line and is possibly followed by comments. The constraint is an equality @math{p(x) = 0} if the first element is 0, an inequality @math{p(x) \geq 0} if the first element is 1. The next elements are the unknown coefficients, followed by the parameter coefficients. The last element is the constant factor. @end enumerate For instance, assuming that @samp{i}, @samp{j} and @samp{k} are iterators and @samp{m} and @samp{n} are parameters, the domain defined by the following constraints : @tex $$ \hbox{$ \cases{ -i + m &$\geq 0$\cr -j + n &$\geq 0$\cr i + j - k &$\geq 0$}$} $$ @end tex @ifnottex @example @group -i + m >= 0 -j + n >= 0 i + j - k >= 0 @end group @end example @end ifnottex @noindent can be written in the input file as follows : @example @group # This is the domain 3 7 # 3 lines and 7 columns # eq/in i j k m n 1 1 -1 0 0 1 0 0 # -i + m >= 0 1 0 -1 0 0 1 0 # -j + n >= 0 1 1 1 -1 0 0 0 # i + j - k >= 0 @end group @end example Each iteration domain @samp{Iteration_domain} of a given statement is a union of polyhedra @samp{Domain_union}. A union is defined by its number of elements @samp{Nb_domains} and the elements themselves @samp{Domain_list}. For instance, let us consider the following pseudo-code: @example @group for (i=1;i<=n;i++) @{ if ((i >= m) || (i <= 2*m)) S1 ; for (j=i+1;j<=m;j++) S2 ; @} @end group @end example @noindent The iteration domain of @samp{S1} can be divided into two polyhedra and written in the input file as follows: @example @group 2 # Number of polyhedra in the union # First domain 3 5 # 3 lines and 5 columns # eq/in i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 1 -1 0 0 # i >= m # Second domain 3 5 # 3 lines and 5 columns # eq/in i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 -1 2 0 0 # i <= 2*m @end group @end example @node Scattering Representation @subsection Scattering Function Representation Scattering functions are depicted in the input file thanks a representation very close to the domain one. An integer gives the number of functions @samp{Nb_functions} and each function is represented by a domain. Each line of the domain corresponds to an equality defining a dimension of the function. Note that at present (CLooG @value{VERSION}) @strong{all functions must have the same scattering dimension number}. If a user wants to set scattering functions with different dimensionality, he has to complete the smaller one with zeroes to reach the maximum dimensionality. For instance, let us consider the following code and scheduling functions: @example @group for (i=1;i<=n;i++) @{ if ((i >= m) || (i <= 2*m)) S1 ; for (j=i+1;j<=m;j++) S2 ; @} @end group @end example @tex $$ \hbox{$ \cases{ \theta _{S1}(i) &$= (i,0)^T$\cr \theta _{S2}(i,j)^T &$= (n,i+j)^T$}$} $$ @end tex @ifnottex @example @group T_S1(i) = (i,0)^T T_S2(i,j)^T = (n,i+j)^T @end group @end example @end ifnottex @noindent This scheduling can be written in the input file as follows: @example @group 2 # Number of scattering functions # First function 2 7 # 2 lines and 7 columns # eq/in c1 c2 i m n 1 0 1 0 -1 0 0 0 # c1 = i 0 0 1 0 0 0 0 # c2 = 0 # Second function 2 8 # 2 lines and 8 columns # eq/in c1 c2 i j m n 1 0 1 0 0 0 0 -1 0 # c1 = n 0 0 1 -1 -1 0 0 0 # c2 = i+j @end group @end example The complete input file for the user who wants to generate the code for this example with the preceding scheduling would be (this file is provided in the CLooG distribution as @code{test/manual_scattering.cloog}: @example # ---------------------- CONTEXT ---------------------- c # language is C # Context (no constraints on two parameters) 1 4 # 1 lines and 4 columns # eq/in m n 1 1 0 0 0 # 0 >= 0, always true 1 # We want to set manually the parameter names m n # parameter names # --------------------- STATEMENTS -------------------- 2 # Number of statements 2 # First statement: two domains # First domain 3 5 # 3 lines and 5 columns # eq/in i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 1 -1 0 0 # i >= m # Second domain 3 5 # 3 lines and 5 columns # eq/in i m n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 0 # i <= n 1 -1 2 0 0 # i <= 2*m 0 0 0 # for future options 1 # Second statement: one domain 4 6 # 4 lines and 6 columns # eq/in i j m n 1 1 1 0 0 0 -1 # i >= 1 1 -1 0 0 1 0 # i <= n 1 -1 1 0 0 -1 # j >= i+1 1 0 -1 1 0 0 # j <= m 0 0 0 # for future options 1 # We want to set manually the iterator names i j # iterator names # --------------------- SCATTERING -------------------- 2 # Scattering functions # First function 2 7 # 2 lines and 7 columns # eq/in p1 p2 i m n 1 0 1 0 -1 0 0 0 # p1 = i 0 0 1 0 0 0 0 # p2 = 0 # Second function 2 8 # 2 lines and 8 columns # eq/in p1 p2 i j m n 1 0 1 0 0 0 0 -1 0 # p1 = n 0 0 1 -1 -1 0 0 0 # p2 = i+j 1 # We want to set manually the scattering dimension names p1 p2 # scattering dimension names @end example @c %/************************************************************************* @c % * Calling CLooG * @c % *************************************************************************/ @node Calling CLooG @section Calling CLooG CLooG is called by the following command: @example cloog [ options | file ] @end example The default behavior of CLooG is to read the input informations from a file and to print the generated code or pseudo-code on the standard output. CLooG's behavior and the output code shape is under the user control thanks to many options which are detailed a further section (@pxref{CLooG Options}). @code{file} is the input file. @code{stdin} is a special value: when used, input is standard input. For instance, we can call CLooG to treat the input file @code{basic.cloog} with default options by typing: @code{cloog basic.cloog} or @code{more basic.cloog | cloog stdin}. @c %/************************************************************************* @c % * CLooG Options * @c % *************************************************************************/ @node CLooG Options @section CLooG Options @menu * Last Depth to Optimize Control:: * First Depth to Optimize Control:: * Statement-wise First and Last Depths to Optimize Control * Simplify Convex Hull:: * Once Time Loop Elimination:: * Equality Spreading:: * First Level for Spreading:: * Statement Block:: * Loop Strides:: * Unrolling:: * Compilable Code:: * Output:: * OpenScop:: * Help:: * Version :: * Quiet :: @end menu @node Last Depth to Optimize Control @subsection Last Depth to Optimize Control @code{-l } @code{-l }: this option sets the last loop depth to be optimized in control. The higher this depth, the less control overhead. For instance, with some input file, a user can generate different pseudo-codes with different @code{depth} values as shown below. @example @group /* Generated using a given input file and @strong{option -l 1} */ for (i=0;i<=M;i++) @{ S1 ; for (j=0;j<=N;j++) @{ S2 ; @} for (j=0;j<=N;j++) @{ S3 ; @} S4 ; @} @end group @end example @example @group /* Generated using the same input file but @strong{option -l 2} */ for (i=0;i<=M;i++) @{ S1 ; for (j=0;j<=N;j++) @{ S2 ; S3 ; @} S4 ; @} @end group @end example In this example we can see that this option can change the operation execution order between statements. Let us remind that CLooG does not make any speculation on dependences between statements (@pxref{Scattering}). Thus if nothing (i.e. scattering functions) forbids this, CLooG considers the above codes to be equivalent. If there is no scattering functions, the minimum value for @code{depth} is 1 (in the case of 0, the user doesn't really need a loop generator !), and the number of scattering dimensions otherwise (CLooG will warn the user if he doesn't respect such constraint). The maximum value for depth is -1 (infinity). Default value is infinity. @node First Depth to Optimize Control @subsection First Depth to Optimize Control @code{-f } @code{-f }: this option sets the first loop depth to be optimized in control. The lower this depth, the less control overhead (and the longer the generated code). For instance, with some input file, a user can generate different pseudo-codes with different @code{depth} values as shown below. The minimum value for @code{depth} is 1, and the maximum value is -1 (infinity). Default value is 1. @example @group /* Generated using a given input file and @strong{option -f 3} */ for (i=1;i<=N;i++) @{ for (j=1;j<=M;j++) @{ S1 ; if (j >= 10) @{ S2 ; @} @} @} @end group @end example @example @group /* Generated using the same input file but @strong{option -f 2} */ for (i=1;i<=N;i++) @{ for (j=1;j<=9;j++) @{ S1 ; @} for (j=10;j<=M;j++) @{ S1 ; S2 ; @} @} @end group @end example @node Statement-wise First and Last Depths to Optimize Control @subsection Statement-wise First and Last Depths to Optimize Control @code{options->fs, options->ls} option->f/l (command-line arguments: -f and -l) provide first and last levels to optimize control overhead at a global level (across the entire program / all statements) by separating / splitting loops. option->fs/ls allow the equivalent of setting -f/-l options on a statement-wise basis. Integer arrays options->fs, options->ls should be allocated by the user with options->fs_ls_size set to the number of elements (always equal to the number of statements). For any given loop, the first and last depths of all statements under it are looked at to determine if the loop should be separated (max across all fs' and ls' is taken). A user has to set fs meaningfully, i.e., for eg., if two statements i & j have a fused loop and fs[i], fs[j] specify separation for that level for stmt i but not for stmt j, the input is ambiguous and we will in this case not separate (since a max is taken). options->fs/ls override f/l; if fs/ls are not set or are set inconsistently (max across ls[i] < max across fs[i]), f/l take over. fs/ls can only be set via the library interface for now. @node Simple Convex Hull @subsection Simple Convex Hull @code{-sh } @code{-sh }: this option enables (@code{boolean=1}) or forbids (@code{boolean=0}) the use of an overapproximation of the convex hull that may be easier to compute (especially in the isl backend) and that may result in simpler bounds. This option works only for generated code without code duplication (it means, you have to tune @code{-f} and @code{-l} options first to generate only a loop nest with internal guards). For instance, with the input file @code{test/union.cloog}, a user can generate different pseudo-codes as shown below. Default value is 0. @example @group /* Generated using test/union.cloog and @strong{option -f -1 -l 2 -override} */ for (i=0;i<=11;i++) @{ for (j=max(0,5*i-50);j<=min(15,5*i+10);j++) @{ if ((i <= 10) && (j <= 10)) @{ S1 ; @} if ((i >= 1) && (j >= 5)) @{ S2 ; @} @} @} @end group @end example @example @group /* Generated using the same input file but @strong{option -sh 1 -f -1 -l 2 -override} */ for (i=0;i<=11;i++) @{ for (j=0;j<=15;j++) @{ if ((i <= 10) && (j <= 10)) @{ S1 ; @} if ((i >= 1) && (j >= 5)) @{ S2 ; @} @} @} @end group @end example @node Once Time Loop Elimination @subsection Once Time Loop Elimination @code{-otl } @code{-otl }: this option allows (@code{boolean=1}) or forbids (@code{boolean=0}) the simplification of loops running once. Default value is 1. @example @group /* Generated using a given input file and @strong{option -otl 0} */ for (j=i+1;j<=i+1;j++) @{ S1 ; @} @end group @end example @example @group /* Generated using the same input file but @strong{option -otl 1} */ j = i+1 ; S1 ; @end group @end example @node Equality Spreading @subsection Equality Spreading @code{-esp } @code{-esp }: this option allows (@code{boolean=1}) or forbids (@code{boolean=0}) values spreading when there are equalities. Default value is 1. @example @group /* Generated using a given input file and @strong{option -esp 0} */ i = M+2 ; j = N ; for (k=i;k<=j+M;k++) @{ S1 ; @} @end group @end example @example @group /* Generated using the same input file but @strong{option -esp 1} */ for (k=M+2;k<=N+M;k++) @{ S1(i = M+2, j = N) ; @} @end group @end example @node First Level for Spreading @subsection First Level for Spreading @code{-fsp } @code{-fsp }: it can be useful to set a first level to begin equality spreading. Particularly when using scattering functions, the user may want to see the scattering dimension values instead of spreading or hiding them. If user has set a spreading, @code{level} is the first level to start it. Default value is 1. @example @group /* Generated using a given input file and @strong{option -fsp 1} */ for (j=0;j<=N+M;j++) @{ S1(i = N) ; @} for (j=0;j<=N+M;j++) @{ S1(i = M) ; @} @end group @end example @example @group /* Generated using the same input file but @strong{option -fsp 2} */ c1 = N ; for (j=0;j<=c1+M;j++) @{ S1(i = c1) ; @} c1 = M ; for (j=0;j<=N+c1;j++) @{ S1(i = c1) ; @} @end group @end example @node Statement Block @subsection Statement Block @code{-block } @code{-block }: this option allows (@code{boolean=1}) to create a statement block for each new iterator, even if there is only an equality. This can be useful in order to parse the generated pseudo-code. When @code{boolean} is set to 0 or when the generation language is FORTRAN, this feature is disabled. Default value is 0. @example @group /* Generated using a given input file and @strong{option -block 0} */ i = M+2 ; j = N ; S1 ; @end group @end example @example @group /* Generated using the same input file but @strong{option -block 1} */ @{ i = M+2 ; @{ j = N ; S1 ; @} @} @end group @end example @node Loop Strides @subsection Loop Strides @code{-strides } @code{-strides }: this options allows (@code{boolean=1}) to handle non-unit strides for loop increments. This can remove a lot of guards and make the generated code more efficient. Default value is 0. @example @group /* Generated using a given input file and @strong{option -strides 0} */ for (i=1;i<=n;i++) @{ if (i%2 == 0) @{ S1(j = i/2) ; @} if (i%4 == 0) @{ S2(j = i/4) ; @} @} @end group @end example @example @group /* Generated using the same input file but @strong{option -strides 1} */ for (i=2;i<=n;i+=2) @{ S1(j = i/2) ; if (i%4 == 0) @{ S2(j = i/4) ; @} @} @end group @end example @node Unrolling @subsection First Depth to Unroll @code{-first-unroll } @code{-first-unroll }: this option sets the first loop depth to unroll. Note that a loop is only unrolled when it is supported by the backend. In case of the isl backend, a loop is unrolled if it has a lower bound that can only be incremented a fixed (non-parametric) amount of times. @node Compilable Code @subsection Compilable Code @code{-compilable } @code{-compilable }: this options allows (@code{value} is not 0) to generate a compilable code where all parameters have the integral value @code{value}. This option creates a macro for each statement. Since CLooG do not know anything about the statement sources, it fills the macros with a basic increment that computes the total number of scanned integral points. The user may change easily the macros according to his own needs. This option is possible only if the generated code is in C. Default value is 0. @example @group /* Generated using a given input file and @strong{option -compilable 0} */ for (i=0;i<=n;i++) @{ for (j=0;j<=n;j++) @{ S1 ; S2 ; @} S3 ; @} @end group @end example @example /* Generated using the same input file but @strong{option -compilable 10} */ /* DON'T FORGET TO USE -lm OPTION TO COMPILE. */ /* Useful headers. */ #include #include #include /* Parameter value. */ #define PARVAL 10 /* Statement macros (please set). */ #define S1(i,j) @{total++;@} #define S2(i,j) @{total++;@} #define S3(i) @{total++;@} int main() @{ /* Original iterators. */ int i, j ; /* Parameters. */ int n=PARVAL, total=0 ; for (i=0;i<=n;i++) @{ for (j=0;j<=n;j++) @{ S1(i,j) ; S2(i,j) ; @} S3(i) ; @} printf("Number of integral points: %d.\n",total) ; return 0 ; @} @end example @node Callable Code @subsection Callable Code @code{-callable } @code{-callable }: if @code{boolean=1}, then a @code{test} function will be generated that has the parameters as arguments. Similarly to the @code{-compilable} option, a macro for each statement is generated. The generated definitions of these macros are as used during the correctness testing, but they can easily be changed by the user to suit her own needs. This option is only available if the target language is C. The default value is 0. @example /* Generated from double.cloog with @strong{option -callable 0} */ for (i=0;i<=M;i++) @{ S1 ; for (j=0;j<=N;j++) @{ S2 ; S3 ; @} S4 ; @} @end example @example /* Generated from double.cloog with @strong{option -callable 1} */ extern void hash(int); /* Useful macros. */ #define floord(n,d) (((n)<0) ? ((n)-(d)+1)/(d) : (n)/(d)) #define ceild(n,d) (((n)<0) ? (n)/(d) : ((n)+(d)+1)/(d)) #define max(x,y) ((x) > (y) ? (x) : (y)) #define min(x,y) ((x) < (y) ? (x) : (y)) #define S1(i) @{ hash(1); hash(i); @} #define S2(i,j) @{ hash(2); hash(i); hash(j); @} #define S3(i,j) @{ hash(3); hash(i); hash(j); @} #define S4(i) @{ hash(4); hash(i); @} void test(int M, int N) @{ /* Original iterators. */ int i, j; for (i=0;i<=M;i++) @{ S1(i) ; for (j=0;j<=N;j++) @{ S2(i,j) ; S3(i,j) ; @} S4(i) ; @} @} @end example @node Output @subsection Output @code{-o } @code{-o }: this option sets the output file. @code{stdout} is a special value: when used, output is standard output. Default value is @code{stdout}. @node OpenScop @subsection OpenScop @code{-openscop} @code{-openscop}: this option states that the input file complies to the OpenScop specification instead of the native file format (@pxref{Bas11}). This option is available only if the OpenScop support has been enabled at compile time (@pxref{Optional Features}). The following OpenScop extensions are supported by CLooG (for the details about those extensions, @pxref{Bas11}): @itemize @bullet @item @emph{scatnames} to set the scattering dimension names. @item @emph{coordinates} to inject the generated code at the place of a given SCoP in a given file. The use of this extension is disabled when the options @emph{-compilable} or @emph{-callable} are set. @end itemize @node Help @subsection Help @code{--help} or @code{-h} @code{--help} or @code{-h}: this option ask CLooG to print a short help. @node Version @subsection Version @code{--version} or @code{-v} @code{--version} or @code{-v}: this option ask CLooG to print some version informations. @node Quiet @subsection Quiet @code{--quiet} or @code{-q} @code{--quiet} or @code{-q}: this option tells CLooG not to print any informational messages. @c %/************************************************************************* @c % * A Full Example * @c % *************************************************************************/ @node Full Example @section A Full Example Let us consider the allocation problem of a Gaussian elimination, i.e. we want to distribute the various statement instances of the compute kernel onto different processors. The original code is the following: @example @group for (i=1;j<=N-1;i++) @{ for (j=i+1;j<=N;j++) @{ c[i][j] = a[j][i]/a[i][i] ; /* S1 */ for (k=i+1;k<=N;k++) @{ a[j][k] -= c[i][j]*a[i][k] ; /* S2 */ @} @} @} @end group @end example @noindent The best affine allocation functions can be found by any good automatic parallelizer like LooPo (@pxref{Gri04}): @tex $$ \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (i)$\cr \theta _{S2}(i,j,k)^T &$= (k)$}$} $$ @end tex @ifnottex @example @group T_S1(i,j)^T = (i) T_S2(i,j,k)^T = (k) @end group @end example @end ifnottex @noindent To ensure that on each processor, the set of statement instances is executed according to the original ordering, we add as minor scattering dimensions the original scheduling (@pxref{Scattering}): @tex $$ \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (i,0,i,0,j,0)^T$\cr \theta _{S2}(i,j,k)^T &$= (k,0,i,0,j,1,k,0)^T$}$} $$ @end tex @ifnottex @example @group T_S1(i,j)^T = (i,0,i,0,j,0)^T T_S2(i,j,k)^T = (k,0,i,0,j,1,k,0)^T @end group @end example @end ifnottex @noindent To ensure that the scattering functions have the same dimensionality, we complete the first function with zeroes (this is a CLooG @value{VERSION} and previous versions requirement, it should be removed in a future version, don't worry it's absolutely legal !): @tex $$ \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (i,0,i,0,j,0,0,0)^T$\cr \theta _{S2}(i,j,k)^T &$= (k,0,i,0,j,1,k,0)^T$}$} $$ @end tex @ifnottex @example @group T_S1(i,j)^T = (i,0,i,0,j,0,0,0)^T T_S2(i,j,k)^T = (k,0,i,0,j,1,k,0)^T @end group @end example @end ifnottex @noindent The input file corresponding to this code generation problem could be (this file is provided in the CLooG distribution as @code{test/manual_gauss.cloog}: @example # ---------------------- CONTEXT ---------------------- c # language is C # Context (no constraints on one parameter) 1 3 # 1 line and 3 columns # eq/in n 1 1 0 0 # 0 >= 0, always true 1 # We want to set manually the parameter name n # parameter name # --------------------- STATEMENTS -------------------- 2 # Number of statements 1 # First statement: one domain 4 5 # 4 lines and 3 columns # eq/in i j n 1 1 1 0 0 -1 # i >= 1 1 -1 0 1 -1 # i <= n-1 1 -1 1 0 -1 # j >= i+1 1 0 -1 1 0 # j <= n 0 0 0 # for future options 1 # Second statement: one domain 6 6 # 6 lines and 3 columns # eq/in i j k n 1 1 1 0 0 0 -1 # i >= 1 1 -1 0 0 1 -1 # i <= n-1 1 -1 1 0 0 -1 # j >= i+1 1 0 -1 0 1 0 # j <= n 1 -1 0 1 0 -1 # k >= i+1 1 0 0 -1 1 0 # k <= n 0 0 0 # for future options 0 # We let CLooG set the iterator names # --------------------- SCATTERING -------------------- 2 # Scattering functions # First function 8 13 # 3 lines and 3 columns # eq/in p1 p2 p3 p4 p5 p6 p7 p8 i j n 1 0 1 0 0 0 0 0 0 0 -1 0 0 0 # p1 = i 0 0 1 0 0 0 0 0 0 0 0 0 0 # p2 = 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 # p3 = i 0 0 0 0 1 0 0 0 0 0 0 0 0 # p4 = 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 # p5 = j 0 0 0 0 0 0 1 0 0 0 0 0 0 # p6 = 0 0 0 0 0 0 0 0 1 0 0 0 0 0 # p7 = 0 0 0 0 0 0 0 0 0 1 0 0 0 0 # p8 = 0 # Second function 8 14 # 3 lines and 3 columns # eq/in p1 p2 p3 p4 p5 p6 p7 p8 i j k n 1 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 # p1 = k 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # p2 = 0 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 # p3 = i 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # p4 = 0 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 # p5 = j 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 # p6 = 1 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 # p7 = k 0 0 0 0 0 0 0 0 1 0 0 0 0 0 # p8 = 0 1 # We want to set manually the scattering dimension names p1 p2 p3 p4 p5 p6 p7 p8 # scattering dimension names @end example Calling CLooG, with for instance the command line @code{cloog -fsp 2 gauss.cloog} for a better view of the allocation (the processor number is given by @code{p1}), will result on the following target code that actually implements the transformation. A minor processing on the dimension @code{p1} to implement, e.g., MPI calls, which is not shown here may result in dramatic speedups ! @example if (n >= 2) @{ p1 = 1 ; for (p5=2;p5<=n;p5++) @{ S1(i = 1,j = p5) ; @} @} for (p1=2;p1<=n-1;p1++) @{ for (p3=1;p3<=p1-1;p3++) @{ for (p5=p3+1;p5<=n;p5++) @{ S2(i = p3,j = p5,k = p1) ; @} @} for (p5=p1+1;p5<=n;p5++) @{ S1(i = p1,j = p5) ; @} @} if (n >= 2) @{ p1 = n ; for (p3=1;p3<=n-1;p3++) @{ for (p5=p3+1;p5<=n;p5++) @{ S2(i = p3,j = p5,k = n) ; @} @} @} @end example @c %/************************************************************************* @c % * A Full Example * @c % *************************************************************************/ @node CLooG Library @chapter Using the CLooG Library The CLooG Library was implemented to allow the user to call CLooG directly from his programs, without file accesses or system calls. The user only needs to link his programs with C libraries. The CLooG library mainly provides one function (@code{cloog_clast_create_from_input}) which takes as input the problem description with some options, and returns the data structure corresponding to the generated code (a @code{struct clast_stmt} structure) which is more or less an abstract syntax tree. The user can work with this data structure and/or use our pretty printing function to write the final code in either C or FORTRAN. Some other functions are provided for convenience reasons. These functions as well as the data structures are described in this section. @menu * CLooG Data Structures:: * CLooG Output:: * Retrieving version information:: * Example of Library Utilization:: @end menu @node CLooG Data Structures @section CLooG Data Structures Description In this section, we describe the data structures used by the loop generator to represent and to process a code generation problem. @menu * CloogState:: * CloogMatrix:: * CloogDomain:: * CloogScattering:: * CloogUnionDomain:: * CloogStatement:: * CloogOptions:: * CloogInput:: @end menu @node CloogState @subsection CloogState @example @group CloogState *cloog_state_malloc(void); void cloog_state_free(CloogState *state); @end group @end example @noindent The @code{CloogState} structure is (implicitly) needed to perform any CLooG operation. It should be created using @code{cloog_state_malloc} before any other CLooG objects are created and destroyed using @code{cloog_state_free} after all objects have been freed. It is allowed to use more than one @code{CloogState} structure at the same time, but an object created within the state of a one @code{CloogState} structure is not allowed to interact with an object created within the state of an other @code{CloogState} structure. @menu * CloogState/isl:: @end menu @node CloogState/isl @subsubsection isl @example #include CloogState *cloog_isl_state_malloc(isl_ctx *ctx); @end example @noindent When using the isl backend, CLooG will internally create many isl objects. If the user creates any CLooG objects from isl objects (e.g., through @code{cloog_domain_from_isl_set} below), then the user needs to make sure that these isl objects live in the same @code{isl_ctx} as those created by CLooG internally. The best way to ensure this property is to pass the @code{isl_ctx} created by the user to CLooG by calling @code{cloog_isl_state_malloc} to create a @code{CloogState}. Note that this makes the created @code{CloogState} a user of the given @code{isl_ctx}, meaning that the @code{CloogState} needs to be freed before the @code{isl_ctx} is freed. @node CloogMatrix @subsection CloogMatrix @noindent The @code{CloogMatrix} structure is equivalent to the PolyLib @code{Matrix} data structure (@pxref{Wil93}). This structure is devoted to represent a set of constraints. @example @group struct cloogmatrix @{ unsigned NbRows ; /* Number of rows. */ unsigned NbColumns ; /* Number of columns. */ cloog_int_t **p; /* Array of pointers to the matrix rows. */ cloog_int_t *p_Init; /* Matrix rows contiguously in memory. */ @}; typedef struct cloogmatrix CloogMatrix; CloogMatrix *cloog_matrix_alloc(unsigned NbRows, unsigned NbColumns); void cloog_matrix_print(FILE *foo, CloogMatrix *m); void cloog_matrix_free(CloogMatrix *matrix); @end group @end example @noindent The whole matrix is stored in memory row after row at the @code{p_Init} address. @code{p} is an array of pointers where @code{p[i]} points to the first element of the @math{i^{th}} row. @code{NbRows} and @code{NbColumns} are respectively the number of rows and columns of the matrix. Each row corresponds to a constraint. The first element of each row is an equality/inequality tag. The constraint is an equality @math{p(x) = 0} if the first element is 0, but it is an inequality @math{p(x) \geq 0} if the first element is 1. The next elements are the coefficients of the unknowns, followed by the coefficients of the parameters, and finally the constant term. For instance, the following three constraints: @tex $$ \hbox{$ \cases{ -i + m &$= 0$\cr -j + n &$\geq 0$\cr j + i - k &$\geq 0$}$} $$ @end tex @ifnottex @example @group -i + m = 0 -j + n >= 0 i + j - k >= 0 @end group @end example @end ifnottex @noindent would be represented by the following rows: @example @group # eq/in i j k m n cst 0 0 -1 0 1 0 0 1 -1 0 0 0 1 0 1 1 1 -1 0 0 0 @end group @end example @noindent To be able to provide different precision version (CLooG supports 32 bits, 64 bits and arbitrary precision through the GMP library), the @code{cloog_int_t} type depends on the configuration options (it may be @code{long int} for 32 bits version, @code{long long int} for 64 bits version, and @code{mpz_t} for multiple precision version). @node CloogDomain @subsection CloogDomain @example @group CloogDomain *cloog_domain_union_read(CloogState *state, FILE *input, int nb_parameters); CloogDomain *cloog_domain_from_cloog_matrix(CloogState *state, CloogMatrix *matrix, int nb_par); void cloog_domain_free(CloogDomain *domain); @end group @end example @noindent @code{CloogDomain} is an opaque type representing a polyhedral domain (a union of polyhedra). A @code{CloogDomain} can be read from a file using @code{cloog_domain_union_read} or converted from a @code{CloogMatrix}. The input format for @code{cloog_domain_union_read} is that of @ref{Domain Representation}. The function @code{cloog_domain_from_cloog_matrix} takes a @code{CloogState}, a @code{CloogMatrix} and @code{int} as input and returns a pointer to a @code{CloogDomain}. @code{matrix} describes the domain and @code{nb_par} is the number of parameters in this domain. The input data structures are neither modified nor freed. The @code{CloogDomain} can be freed using @code{cloog_domain_free}. There are also some backend dependent functions for creating @code{CloogDomain}s. @menu * CloogDomain/PolyLib:: * CloogDomain/isl:: @end menu @node CloogDomain/PolyLib @subsubsection PolyLib @example #include CloogDomain *cloog_domain_from_polylib_polyhedron(CloogState *state, Polyhedron *, int nb_par); @end example @noindent The function @code{cloog_domain_from_polylib_polyhedron} takes a PolyLib @code{Polyhedron} as input and returns a pointer to a @code{CloogDomain}. The @code{nb_par} parameter indicates the number of parameters in the domain. The input data structure if neither modified nor freed. @node CloogDomain/isl @subsubsection isl @example #include CloogDomain *cloog_domain_from_isl_set(__isl_take isl_set *set); __isl_give isl_set *isl_set_from_cloog_domain(CloogDomain *domain); @end example @noindent The function @code{cloog_domain_from_isl_set} takes an @code{isl_set} as input and returns a pointer to a @code{CloogDomain}. The function consumes a reference to the given @code{isl_set}. Similarly, @code{isl_set_from_cloog_domain} consumes a reference to a @code{CloogDomain} and returns an @code{isl_set}. @node CloogScattering @subsection CloogScattering @example @group CloogScattering *cloog_domain_read_scattering(CloogDomain *domain, FILE *foo); CloogScattering *cloog_scattering_from_cloog_matrix(CloogState *state, CloogMatrix *matrix, int nb_scat, int nb_par); void cloog_scattering_free(CloogScattering *); @end group @end example @noindent The @code{CloogScattering} type represents a scattering function. A @code{CloogScattering} for a given @code{CloogDomain} can be read from a file using @code{cloog_scattering_read} or converted from a @code{CloogMatrix} using @code{cloog_scattering_from_cloog_matrix}. The function @code{cloog_scattering_from_cloog_matrix} takes a @code{CloogState}, a @code{CloogMatrix} and two @code{int}s as input and returns a pointer to a @code{CloogScattering}. @code{matrix} describes the scattering, while @code{nb_scat} and @code{nb_par} are the number of scattering dimensions and the number of parameters, respectively. The input data structures are neither modified nor freed. A @code{CloogScattering} can be freed using @code{cloog_scattering_free}. There are also some backend dependent functions for creating @code{CloogScattering}s. @menu * CloogScattering/PolyLib:: * CloogScattering/isl:: @end menu @node CloogScattering/PolyLib @subsubsection PolyLib @example #include CloogScattering *cloog_scattering_from_polylib_polyhedron( CloogState *state, Polyhedron *polyhedron, int nb_par); @end example @noindent The function @code{cloog_scattering_from_polylib_polyhedron} takes a PolyLib @code{Polyhedron} as input and returns a pointer to a @code{CloogScattering}. The @code{nb_par} parameter indicates the number of parameters in the domain. The input data structure if neither modified nor freed. @node CloogScattering/isl @subsubsection isl @example #include CloogScattering *cloog_scattering_from_isl_map(__isl_take isl_map *map); @end example @noindent The function @code{cloog_scattering_from_isl_map} takes an @code{isl_map} as input and returns a pointer to a @code{CloogScattering}. The output dimensions of the @code{isl_map} correspond to the scattering dimensions, while the input dimensions correspond to the domain dimensions. The function consumes a reference to the given @code{isl_map}. @node CloogUnionDomain @subsection CloogUnionDomain @example @group enum cloog_dim_type @{ CLOOG_PARAM, CLOOG_ITER, CLOOG_SCAT @}; CloogUnionDomain *cloog_union_domain_alloc(int nb_par); CloogUnionDomain *cloog_union_domain_add_domain(CloogUnionDomain *ud, const char *name, CloogDomain *domain, CloogScattering *scattering, void *usr); CloogUnionDomain *cloog_union_domain_set_name(CloogUnionDomain *ud, enum cloog_dim_type type, int index, const char *name); void cloog_union_domain_free(CloogUnionDomain *ud); @end group @end example @noindent A @code{CloogUnionDomain} structure represents a union of scattered named domains. A @code{CloogUnionDomain} is initialized by a call to @code{cloog_union_domain_alloc}, after which domains can be added using @code{cloog_union_domain_add_domain}. @code{cloog_union_domain_alloc} takes the number of parameters as input. @code{cloog_union_domain_add_domain} takes a previously created @code{CloogUnionDomain} as input along with an optional name, a domain, an optional scattering function and a user pointer. The name may be @code{NULL} and is duplicated if it is not. If no name is specified, then the statements will be named according to the order in which they were added. @code{domain} and @code{scattering} are taken over by the @code{CloogUnionDomain}. @code{scattering} may be @code{NULL}, but it must be consistently @code{NULL} or not over all calls to @code{cloog_union_domain_add_domain}. @code{cloog_union_domain_set_name} can be used to set the names of parameters, iterators and scattering dimensions. The names of iterators and scattering dimensions can only be set after all domains have been added. There is also a backend dependent function for creating @code{CloogUnionDomain}s. @menu * CloogUnionDomain/isl:: @end menu @node CloogUnionDomain/isl @subsubsection isl @example #include CloogUnionDomain *cloog_union_domain_from_isl_union_map( __isl_take isl_union_map *umap); CloogUnionDomain *cloog_union_domain_from_isl_set( __isl_take isl_set *set); @end example @noindent The function @code{cloog_union_domain_from_isl_union_map} takes a @code{isl_union_map} as input and returns a pointer to a @code{CloogUnionDomain}. The input is a mapping from different spaces (different tuple names and possibly different dimensions) to a common space. The iteration domains are set to the domains in each space. The statement names are set to the names of the spaces. The parameter names of the result are set to those of the input, but the iterator and scattering dimension names are left unspecified. The function consumes a reference to the given @code{isl_union_map}. The function @code{cloog_union_domain_from_isl_set} is similar, but takes an unscattered domain as input. It is not defined for an union_set, because the order of iterations from two different isl_sets is undefined, if no scattering is provided. @node CloogStatement @subsection CloogStatement @example @group struct cloogstatement @{ int number ; /* The statement unique number. */ char *name; /* Name of the statement. */ void * usr ; /* Pointer for user's convenience. */ struct cloogstatement * next ;/* Next element of the linked list. */ @} ; typedef struct cloogstatement CloogStatement ; CloogStatement *cloog_statement_malloc(CloogState *state); void cloog_statement_print(FILE *, CloogStatement *); void cloog_statement_free(CloogStatement *); @end group @end example @noindent The @code{CloogStatement} structure represents a @code{NULL} terminated linked list of statements. In CLooG, a statement is only defined by its unique number (@code{number}). The user can use the pointer @code{usr} for his own convenience to link his own statement representation to the corresponding @code{CloogStatement} structure. The whole management of the @code{usr} pointer is under the responsibility of the user, in particular, CLooG never tries to print, to allocate or to free a memory block pointed by @code{usr}. @node CloogOptions @subsection CloogOptions @example @group struct cloogoptions @{ int l; /* -l option. */ int f; /* -f option. */ int *ls; /* Statement-wise l option */ int *fs; /* Statement-wise f option */ int fs_ls_size; /* Size of the fs and ls arrays (same size) */ int strides; /* -strides option. */ int sh; /* -sh option. */ int first_unroll; /* -first-unroll option. */ int esp; /* -esp option. */ int fsp; /* -fsp option. */ int otl; /* -otl option. */ int block; /* -block option. */ int compilable; /* -compilable option. */ int language; /* CLOOG_LANGUAGE_C or CLOOG_LANGUAGE_FORTRAN */ int save_domains; /* Save unsimplified copy of domain. */ @} ; typedef struct cloogoptions CloogOptions ; CloogOptions *cloog_options_malloc(CloogState *state); void cloog_options_print(FILE *foo, CloogOptions *options); void cloog_options_free(CloogOptions *options); @end group @end example @noindent The @code{CloogOptions} structure contains all the possible options to rule CLooG's behaviour (@pxref{Calling CLooG}). As a reminder, the default values are: @itemize @bullet @item @math{l = -1} (optimize control until the innermost loops), @item @math{f = 1} (optimize control from the outermost loops), @item @math{ls/fs = NULL} and @math{fs\_ls\_size = 0} (statement-wise l/f are not set), @item @math{strides = 0} (use only unit strides), @item @math{sh = 0} (do not compute simple convex hulls), @item @math{first\_unroll = -1} (do not perform unrolling), @item @math{esp = 1} (spread complex equalities), @item @math{fsp = 1} (start to spread from the first iterators), @item @math{otl = 1} (simplify loops running only once). @item @math{block = 0} (do not make statement blocks when not necessary). @item @math{compilable = 0} (do not generate a compilable code). @end itemize The @code{save_domains} option is only useful for users of the CLooG library. This option defaults to 0, but when it is set, the @code{domain} field of each @code{clast_user_stmt} will be set to the set of values for the scattering dimensions for which this instance of the user statement is executed. The @code{domain} field of each @code{clast_for} contains the set of values for the scattering dimensions for which an instance of a user statement is executed inside the @code{clast_for}. It is only available if the @code{clast_for} enumerates a scattering dimension. @node CloogInput @subsection CloogInput @example @group CloogInput *cloog_input_read(FILE *file, CloogOptions *options); CloogInput *cloog_input_alloc(CloogDomain *context, CloogUnionDomain *ud); void cloog_input_free(CloogInput *input); void cloog_input_dump_cloog(FILE *, CloogInput *, CloogOptions *); @end group @end example @noindent A @code{CloogInput} structure represents the input to CLooG. It is essentially a @code{CloogUnionDomain} along with a context @code{CloogDomain}. A @code{CloogInput} can be created from a @code{CloogDomain} and a @code{CloogUnionDomains} using @code{cloog_input_alloc}, or it can be read from a CLooG input file using @code{cloog_input_read}. The latter also modifies the @code{language} field of the @code{CloogOptions} structure. The constructed @code{CloogInput} can be used as input to a @code{cloog_clast_create_from_input} call. A @code{CloogInput} data structure and a @code{CloogOptions} contain the same information as a .cloog file. This function dumps the .cloog description of the given data structures into a file. @node Dump CLooG Input File Function @subsection Dump CLooG Input File Function @example @end example @node CLooG Output @section CLooG Output @noindent Given a description of the input, an AST corresponding to the @code{CloogInput} can be constructed using @code{cloog_clast_create_from_input} and destroyed using @code{free_clast_stmt}. @example struct clast_stmt *cloog_clast_create_from_input(CloogInput *input, CloogOptions *options); void free_clast_stmt(struct clast_stmt *s); @end example @noindent @code{clast_stmt} represents a linked list of ``statements''. @example struct clast_stmt @{ const struct clast_stmt_op *op; struct clast_stmt *next; @}; @end example @noindent The entries in the list are not of type @code{clast_stmt} itself, but of some larger type. The following statement types are defined by CLooG. @example struct clast_root @{ struct clast_stmt stmt; CloogNames * names; @}; struct clast_root *new_clast_root(CloogNames *names); struct clast_assignment @{ struct clast_stmt stmt; const char * LHS; struct clast_expr * RHS; @}; struct clast_assignment *new_clast_assignment(const char *lhs, struct clast_expr *rhs); struct clast_block @{ struct clast_stmt stmt; struct clast_stmt * body; @}; struct clast_block *new_clast_block(void); struct clast_user_stmt @{ struct clast_stmt stmt; CloogDomain * domain; CloogStatement * statement; struct clast_stmt * substitutions; @}; struct clast_user_stmt *new_clast_user_stmt(CloogDomain *domain, CloogStatement *stmt, struct clast_stmt *subs); struct clast_for @{ struct clast_stmt stmt; CloogDomain * domain; const char * iterator; struct clast_expr * LB; struct clast_expr * UB; cloog_int_t stride; struct clast_stmt * body; @}; struct clast_for *new_clast_for(CloogDomain *domain, const char *it, struct clast_expr *LB, struct clast_expr *UB, cloog_int_t stride); struct clast_guard @{ struct clast_stmt stmt; struct clast_stmt * then; int n; struct clast_equation eq[1]; @}; struct clast_guard *new_clast_guard(int n); @end example @noindent The @code{clast_stmt} returned by @code{cloog_clast_create} is a @code{clast_root}. It contains a placeholder for all the variable names that appear in the AST and a (list of) nested statement(s). @noindent A @code{clast_assignment} assigns the value given by the @code{clast_expr} @code{RHS} to a variable named @code{LHS}. @noindent A @code{clast_block} groups a list of statements into one statement. These statements are only generated if the @code{block} option is set, @pxref{Statement Block} and @ref{CloogOptions}. @noindent A @code{clast_user_stmt} represents a call to a statement specified by the user, @pxref{CloogStatement}. @code{substitutions} is a list of @code{clast_assignment} statements assigning an expression in terms of the scattering dimensions to each of the original iterators in the original order. The @code{LHS}s of these assignments are left blank (@code{NULL}). The @code{domain} is set to @code{NULL} if the @code{save_domains} option is not set. Otherwise, it is set to the set of values for the scattering dimensions for which this instance of the user statement is executed. Note that unless the @code{noscalars} option has been set, the constant scattering dimensions may have been removed from this set. @noindent A @code{clast_for} represents a for loop, iterating @code{body} for each value of @code{iterator} between @code{LB} and @code{UB} in steps of size @code{stride}. The @code{domain} is set to @code{NULL} if the @code{save_domains} option is not set. Otherwise, it is set to the set of values for the scattering dimensions for which a user statement is executed inside this @code{clast_for}. Note that unless the @code{noscalars} option has been set, the constant scattering dimensions may have been removed from this set. @noindent A @code{clast_guard} represents the guarded execution of the @code{then} (list of) statement(s) by a conjunction of @code{n} (in)equalities. Each (in)equality is represented by a @code{clast_equation}. @example struct clast_equation @{ struct clast_expr * LHS; struct clast_expr * RHS; int sign; @}; @end example @noindent The condition expressed by a @code{clast_equation} is @code{LHS <= RHS}, @code{LHS == RHS} or @code{LHS >= RHS} depending on whether @code{sign} is less than zero, equal to zero, or greater than zero. The dynamic type of a @code{clast_stmt} can be determined using the macro @code{CLAST_STMT_IS_A(stmt,type)}, where @code{stmt} is a pointer to a @code{clast_stmt} and @code{type} is one of @code{stmt_root}, @code{stmt_ass}, @code{stmt_user}, @code{stmt_block}, @code{stmt_for} or @code{stmt_guard}. Users are allowed to define their own statement types by assigning the @code{op} field of the statements a pointer to a @code{clast_stmt_op} structure. @example struct clast_stmt_op @{ void (*free)(struct clast_stmt *); @}; @end example @noindent The @code{free} field of this structure should point to a function that frees the user defined statement. @noindent A @code{clast_expr} can be an identifier, a term, a binary expression or a reduction. @example enum clast_expr_type @{ clast_expr_name, clast_expr_term, clast_expr_bin, clast_expr_red @}; struct clast_expr @{ enum clast_expr_type type; @}; void free_clast_expr(struct clast_expr *e); @end example @noindent Identifiers are of subtype @code{clast_name}. @example struct clast_name @{ struct clast_expr expr; const char * name; @}; struct clast_name *new_clast_name(const char *name); void free_clast_name(struct clast_name *t); @end example @noindent The character string pointed to by @code{name} is assumed to be part of the @code{CloogNames} structure in the root of the clast as is therefore not copied. @noindent Terms are of type @code{clast_term}. @example struct clast_term @{ struct clast_expr expr; cloog_int_t val; struct clast_expr *var; @}; struct clast_term *new_clast_term(cloog_int_t c, struct clast_expr *v); void free_clast_term(struct clast_term *t); @end example @noindent If @code{var} is set to @code{NULL}, then the term represents the integer value @code{val}. Otherwise, it represents the term @code{val * var}. @code{new_clast_term} simply copies the @code{v} pointer without copying the underlying @code{clast_expr}. @code{free_clast_term}, on the other hand, recursively frees @code{var}. @noindent Binary expressions are of type @code{clast_bin_type} and represent either the floor of a division (fdiv), the ceil of a division (cdiv), an exact division or the remainder of an fdiv. @example enum clast_bin_type @{ clast_bin_fdiv, clast_bin_cdiv, clast_bin_div, clast_bin_mod @}; struct clast_binary @{ struct clast_expr expr; enum clast_bin_type type; struct clast_expr* LHS; cloog_int_t RHS; @}; struct clast_binary *new_clast_binary(enum clast_bin_type t, struct clast_expr *lhs, cloog_int_t rhs); void free_clast_binary(struct clast_binary *b); @end example @noindent Reductions are of type @code{clast_reduction} and can represent either the sum, the minimum or the maximum of its elements. @example enum clast_red_type @{ clast_red_sum, clast_red_min, clast_red_max @}; struct clast_reduction @{ struct clast_expr expr; enum clast_red_type type; int n; struct clast_expr* elts[1]; @}; struct clast_reduction *new_clast_reduction(enum clast_red_type t, int n); void free_clast_reduction(struct clast_reduction *r); @end example @node Retrieving version information @section Retrieving version information CLooG provides static and dynamic version checks to assist on including a compatible version of the library. A static version check at compile time can be achieved by querying the version constants defined in @code{version.h}: @itemize @bullet @item @code{CLOOG_VERSION_MAJOR} @item @code{CLOOG_VERSION_MINOR} @item @code{CLOOG_VERSION_REVISION} @end itemize This way it is possible to ensure the included headers are of the correct version. It is still possible that the installed CLooG library version differs from the installed headers. In order to avoid this, a dynamic version check is provided with the functions: @example @group int cloog_version_major(void); int cloog_version_minor(void); int cloog_version_revision(void); @end group @end example By using both the static and the dynamic version check, it is possible to match CLooG's header version with the library's version. @node Example of Library Utilization @section Example of Library Utilization @menu * Basic Library Utilization:: * Scanning isl Sets:: @end menu @node Basic Library Utilization @subsection Basic Library Utilization Here is a basic example showing how it is possible to use the CLooG library, assuming that a standard installation has been done. The following C program reads a CLooG input file on the standard input, then prints the solution on the standard output. Options are preselected to the default values of the CLooG software. This example is provided in the @code{example} directory of the CLooG distribution. @example /* example.c */ # include # include int main() @{ CloogState *state; CloogInput *input; CloogOptions *options ; struct clast_stmt *root; /* Setting options and reading program informations. */ state = cloog_state_malloc(); options = cloog_options_malloc(state); input = cloog_input_read(stdin, options); /* Generating and printing the code. */ root = cloog_clast_create_from_input(input, options); clast_pprint(stdout, root, 0, options); cloog_clast_free(root); cloog_options_free(options) ; cloog_state_free(state); return 0; @} @end example @noindent The compilation (with default isl/GMP version installed) command could be: @example gcc -DCLOOG_INT_GMP example.c -lcloog-isl -o example @end example @noindent A calling command with the input file test.cloog could be: @example more test.cloog | ./example @end example @node Scanning isl Sets @subsection Scanning isl Sets Here is an isl-level example to prepare a convenient input, to generate the Clast of the scanning code for this input, to pretty-print the code and to de-allocate memory in a clean way. This example is provided in the @code{example} directory of the CLooG distribution. @example /* example-isl.c */ #include #include /* Input problem */ int nb_parameters = 1; char *parameter_name[] = @{"N"@}; char *iterator_name[] = @{"i", "j"@}; char *scattering_name[] = @{"t0", "t1", "t2"@}; char *str_context = "[N] -> @{ : N > 0@}"; char *str_domain1 = "[N] -> @{[i, j] : 0 <= i < N and 0 <= j < N@}"; char *str_domain2 = "[N] -> @{[i, j] : 0 <= i < N and 0 <= j < N@}"; char *str_scattering1 = "[N] -> @{[i, j] -> [0, i + j, j]@}"; char *str_scattering2 = "[N] -> @{[i, j] -> [1, i, -j]@}"; int main() @{ isl_ctx *ctx; isl_set *set_context, *set1, *set2; isl_map *map1, *map2; CloogDomain *context, *domain1, *domain2; CloogScattering *scattering1, *scattering2; CloogUnionDomain *domains; CloogInput *input; CloogState *state; CloogOptions *options; struct clast_stmt *root; /* Build isl structures for context, sets and mapping */ ctx = isl_ctx_alloc(); set_context = isl_set_read_from_str(ctx, str_context); set1 = isl_set_read_from_str(ctx, str_domain1); set2 = isl_set_read_from_str(ctx, str_domain2); map1 = isl_map_read_from_str(ctx, str_scattering1); map2 = isl_map_read_from_str(ctx, str_scattering2); /* Translate them to CLooG context, domains and scattering */ context = cloog_domain_from_isl_set(set_context); domain1 = cloog_domain_from_isl_set(set1); domain2 = cloog_domain_from_isl_set(set2); scattering1 = cloog_scattering_from_isl_map(map1); scattering2 = cloog_scattering_from_isl_map(map2); /* Prepare the list of domains to scan */ domains = cloog_union_domain_alloc(nb_parameters); cloog_union_domain_add_domain(domains,"S1",domain1,scattering1,NULL); cloog_union_domain_add_domain(domains,"S2",domain2,scattering2,NULL); cloog_union_domain_set_name(domains,CLOOG_PARAM,0,parameter_name[0]); cloog_union_domain_set_name(domains,CLOOG_ITER, 0,iterator_name[0]); cloog_union_domain_set_name(domains,CLOOG_ITER, 1,iterator_name[1]); cloog_union_domain_set_name(domains,CLOOG_SCAT, 0,scattering_name[0]); cloog_union_domain_set_name(domains,CLOOG_SCAT, 1,scattering_name[1]); cloog_union_domain_set_name(domains,CLOOG_SCAT, 2,scattering_name[2]); /* Build the input, generate a scanning code AST and print the code */ input = cloog_input_alloc(context, domains); state = cloog_isl_state_malloc(ctx); options = cloog_options_malloc(state); root = cloog_clast_create_from_input(input, options); clast_pprint(stdout, root, 0, options); /* Recycle allocated memory */ cloog_clast_free(root); cloog_options_free(options); cloog_state_free(state); isl_ctx_free(ctx); @} @end example @noindent The compilation (with default isl/GMP version installed) command could be: @example gcc -DCLOOG_INT_GMP example-isl.c -lcloog-isl -o example-isl @end example @noindent A calling command could be: @example ./example-isl @end example @c % ******************************** HACKING ********************************* @c @node Hacking @c @chapter Hacking CLooG @c @menu @c * Program organization:: @c * Special Options:: @c * CLooG Coding Standards:: @c @end menu @c @node Program organization @c @section Program organization @c @node Special Options @c @section Special Options @c @node CLooG Coding Standards @c @section CLooG Coding Standards @c % ****************************** INSTALLING ******************************** @node Installing @chapter Installing CLooG @menu * License:: * Requirements:: * Basic Installation:: * Optional Features:: * Uninstallation:: @end menu @node License @section License First of all, it would be very kind to refer the following paper in any publication that result from the use of the CLooG software or its library, @pxref{Bas04} (a bibtex entry is provided behind the title page of this manual, along with copyright notice, and in the CLooG home @code{http://www.CLooG.org}. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. @code{http://www.gnu.org/licenses/lgpl-2.1.html} Note, though, that if you link CLooG against a GPL library such as the PolyLib backend, then the combination becomes GPL too. In particular, a CLooG library based on the PolyLib backend is GPL version 2 only. Since the isl backend is LGPL, linking against it does not affect the license of CLooG. @node Requirements @section Requirements CLooG can be used with one of two possible backends, one using isl and one using PolyLib. The isl library is included in the CLooG distribution, while the PolyLib library needs to be obtained separately. On the other hand, isl requires GMP, while PolyLib can be compiled with or without the use of GMP. The user therefore needs to install at least one of PolyLib or GMP. @menu * PolyLib:: * GMP Library:: @end menu @node PolyLib @subsection PolyLib (optional) To successfully install CLooG with the PolyLib backend, the user first needs to install PolyLib version 5.22.1 or above (default 64 bits version is satisfying as well as 32 bits or GMP multiple precision version). Polylib can be downloaded freely at @code{http://icps.u-strasbg.fr/PolyLib/} or @code{http://www.irisa.fr/polylib/}. Once downloaded and unpacked (e.g. using the @samp{tar -zxvf polylib-5.22.3.tar.gz} command), the user can compile it by typing the following commands on the PolyLib's root directory: @itemize @bullet @item @code{./configure} @item @code{make} @item And as root: @code{make install} @end itemize Alternatively, the latest development version can be obtained from the git repository: @itemize @bullet @item @code{git clone git://repo.or.cz/polylib.git} @item @code{cd polylib} @item @code{./autogen.sh} @item @code{./configure} @item @code{make} @item And as root: @code{make install} @end itemize The PolyLib default installation is @code{/usr/local}. This directory may not be inside your library path. To fix the problem, the user should set @example export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:/usr/local/lib @end example @noindent if your shell is, e.g., bash or @example setenv LD_LIBRARY_PATH $LD_LIBRARY_PATH:/usr/local/lib @end example @noindent if your shell is, e.g., tcsh. Add the line to your .bashrc or .tcshrc (or whatever convenient file) to make this change permanent. Another solution is to ask PolyLib to install in the standard path by using the prefix option of the configure script: @samp{./configure --prefix=/usr}. CLooG makes intensive calls to polyhedral operations, and PolyLib functions do the job. Polylib is a free library written in C for the manipulation of polyhedra. The library is operating on objects like vectors, matrices, lattices, polyhedra, Z-polyhedra, unions of polyhedra and a lot of other intermediary structures. It provides functions for all the important operations on these structures. @node GMP Library @subsection GMP Library (optional) To be able to deal with insanely large coefficient, the user will need to install the GNU Multiple Precision Library (GMP for short) version 4.1.4 or above. It can be freely downloaded from @code{http://www.swox.com/gmp}. Note that the isl backend currently requires GMP. The user can compile GMP by typing the following commands on the GMP root directory: @itemize @bullet @item @code{./configure} @item @code{make} @item And as root: @code{make install} @end itemize The GMP default installation is @code{/usr/local}, the same method to fix a library path problem applies as with PolyLib (@pxref{PolyLib}). If you want to use the PolyLib backend, then PolyLib has to be built using the GMP library by specifying the option @samp{--with-libgmp=PATH_TO_GMP} to the PolyLib configure script (where @code{PATH_TO_GMP} is @code{/usr/local} if you did not change the GMP installation directory). Then you have to set the convenient CLooG configure script options to build the GMP version (@pxref{Optional Features}). @node Basic Installation @section CLooG Basic Installation Once downloaded and unpacked (e.g. using the @samp{tar -zxvf cloog-@value{VERSION}.tar.gz} command), you can compile CLooG by typing the following commands on the CLooG's root directory: @itemize @bullet @item @code{./configure} @item @code{make} @item And as root: @code{make install} @end itemize Alternatively, the latest development version can be obtained from the git repository: @itemize @bullet @item @code{git clone git://repo.or.cz/cloog.git} @item @code{cd cloog} @item @code{./get_submodules.sh} @item @code{./autogen.sh} @item @code{./configure} @item @code{make} @item And as root: @code{make install} @end itemize Depending on which backend you want to use and where they are located, you may need to pass some options to the configure script, @pxref{Optional Features}. The program binaries and object files can be removed from the source code directory by typing @code{make clean}. To also remove the files that the @code{configure} script created (so you can compile the package for a different kind of computer) type @code{make distclean}. Both the CLooG software and library have been successfully compiled on the following systems: @itemize @bullet @item PC's under Linux, with the @code{gcc} compiler, @item PC's under Windows (Cygwin), with the @code{gcc} compiler, @item Sparc and UltraSparc Stations, with the @code{gcc} compiler. @end itemize @node Optional Features @section Optional Features The @code{configure} shell script attempts to guess correct values for various system-dependent variables and user options used during compilation. It uses those values to create the @code{Makefile}. Various user options are provided by the CLooG's configure script. They are summarized in the following list and may be printed by typing @code{./configure --help} in the CLooG top-level directory. @itemize @bullet @item By default, the installation directory is @code{/usr/local}: @code{make install} will install the package's files in @code{/usr/local/bin}, @code{/usr/local/lib} and @code{/usr/local/include}. The user can specify an installation prefix other than @code{/usr/local} by giving @code{configure} the option @code{--prefix=PATH}. @item By default, the isl backend will use the version of isl that is @code{bundled} together with CLooG. Using the @code{--with-isl} option of @code{configure} the user can specify that @code{no} isl, a previously installed (@code{system}) isl or a @code{build} isl should be used. In the latter case, the user should also specify the build location using @code{--with-isl-builddir=PATH}. In case of an installed isl, the installation location can be specified using the @code{--with-isl-prefix=PATH} and @code{--with-isl-exec-prefix=PATH} options of @code{configure}. @item By default, the PolyLib backend will use an installed (@code{system}) PolyLib, if any. The installation location can be specified using the @code{--with-polylib-prefix=PATH} and @code{--with-polylib-exec-prefix=PATH} options of @code{configure}. Using the @code{--with-polylib} option of @code{configure} the user can specify that @code{no} PolyLib or a @code{build} PolyLib should be used. In the latter case, the user should also specify the build location using @code{--with-polylib-builddir=PATH}. @item By default, the PolyLib backend of CLooG is built in 64bits version if such version of the PolyLib is found by @code{configure}. If the only existing version of the PolyLib is the 32bits or if the user give to @code{configure} the option @code{--with-bits=32}, the 32bits version of CLooG will be compiled. In the same way, the option @code{--with-bits=gmp} have to be used to build the multiple precision version. @item By default, @code{configure} will look for the GMP library (necessary to build the multiple precision version) in standard locations. If necessary, the user can specify the GMP path by giving @code{configure} the option @code{--with-gmp-prefix=PATH} and/or @code{--with-gmp-exec-prefix=PATH}. @item By default, the OpenScop Library (osl) support is not enabled. @c @code{configure} will use the bundled OpenScop Library (osl). Using the @code{--with-osl} option of @code{configure} the user can specify that @code{no} osl, a previously installed (@code{system}) osl, a @code{bundled} osl, or a @code{build} osl should be used. In the latter case, the user should also specify the build location using @code{--with-osl-builddir=PATH}. In case of an installed osl, the installation location can be specified using the @code{--with-osl-prefix=PATH} and @code{--with-osl-exec-prefix=PATH} options of @code{configure}. @end itemize @node Uninstallation @section Uninstallation The user can easily remove the CLooG software and library from his system by typing (as root if necessary) from the CLooG top-level directory @code{make uninstall}. @c % **************************** DOCUMENTATION ****************************** @node Documentation @chapter Documentation The CLooG distribution provides several documentation sources. First, the source code itself is as documented as possible. The code comments use a Doxygen-compatible presentation (something similar to what JavaDoc does for JAVA). The user may install Doxygen (see @code{http://www.stack.nl/~dimitri/doxygen}) to automatically generate a technical documentation by typing @code{make doc} or @code{doxygen ./autoconf/Doxyfile} at the CLooG top-level directory after running the configure script (@pxref{Installing}). Doxygen will generate documentation sources (in HTML, LaTeX and man) in the @code{doc/source} directory of the CLooG distribution. The Texinfo sources of the present document are also provided in the @code{doc} directory. You can build it in either DVI format (by typing @code{texi2dvi cloog.texi}) or PDF format (by typing @code{texi2pdf cloog.texi}) or HTML format (by typing @code{makeinfo --html cloog.texi}, using @code{--no-split} option to generate a single HTML file) or info format (by typing @code{makeinfo cloog.texi}). @c % ****************************** REFERENCES ******************************** @node References @chapter References @itemize @item @anchor{Bas03a}[Bas03a] C. Bastoul, P. Feautrier. Improving data locality by chunking. CC'12 International Conference on Compiler Construction, LNCS 2622, pages 320-335, Warsaw, april 2003. @item @anchor{Bas03b}[Bas03b] C. Bastoul. Efficient code generation for automatic parallelization and optimization. ISPDC'03 IEEE International Symposium on Parallel and Distributed Computing, pages 23-30, Ljubljana, october 2003. @item @anchor{Bas04}[Bas04] C. Bastoul. Code Generation in the Polyhedral Model Is Easier Than You Think. PACT'13 IEEE International Conference on Parallel Architecture and Compilation Techniques, pages 7-16, Juan-les-Pins, september 2004. @item @anchor{Bas11}[Bas11] C. Bastoul. A Specification and a Library for Data Exchange in Polyhedral Compilation Tools. Technical Report, Paris-Sud University, France, September 2011. @item @anchor{Fea92}[Fea92] P. Feautrier Some efficient solutions to the affine scheduling problem, part II: multidimensional time. International Journal of Parallel Programming, 21(6):389--420, December 1992. @item @anchor{Gri04}[Gri04] M. Griebl. Automatic parallelization of loop programs for distributed memory architectures. Habilitation Thesis. Facult@"at f@"ur Mathematik und Informatik, Universit@"at Passau, 2004. @emph{http://www.infosun.fmi.uni-passau.de/cl/loopo/} @item @anchor{Qui00}[Qui00] F. Quiller@'e, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming, 28(5):469-498, october 2000. @item @anchor{Wil93}[Wil93] Doran K. Wilde. A library for doing polyhedral operations. Technical Report 785, IRISA, Rennes, France, 1993. @end itemize @c % /************************************************************************* @c % * PART VI: END OF THE DOCUMENT * @c % *************************************************************************/ @c @unnumbered Index @c @printindex cp @bye cloog-0.18.2/doc/Makefile.am0000664000175000017500000000025512254312305012430 00000000000000if HAVE_TEXI2DVI cloog.pdf: cloog.texi gitversion.texi $(TEXI2DVI) --pdf $< endif gitversion.texi: @GIT_INDEX@ echo '@set VERSION '`$(top_builddir)/genversion.sh`'' > $@ cloog-0.18.2/doc/TODO0000664000175000017500000000453712254312305011073 00000000000000# # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** The Chunky Loop Generator ** # **-------------------------------------------------------------------** # ** First version of this file: april 29th 2005 ** # **-------------------------------------------------------------------**/ # This file is mainly for the authors, in order to put ideas, requests, and work-in-progress notes. # **-------------------------------------------------------------------** # ** I. Requested features ** # **-------------------------------------------------------------------**/ 1. GMP !!! (LooPo Team). DOOOOOOOOOOOOOOOOOOOOOOOOONE !!!!!!!!!!!!!!!!! 2. Set the statement prefix (Michael Classen). 3. Do not fuse the iterators/scattering dimension names lists (Hadda Cheroun). DOOOOOOOOOOOOOOOOOOOOOOOOONE !!!!!!!!!!!!!!!!! 4. Exploit URUK transformation properties (WRAP-IT Team). DOOOOOOOOOOOOOOOOOOOOOOOOONE !!!!!!!!!!!!!!!!! # **-------------------------------------------------------------------** # ** II. Known bugs ** # **-------------------------------------------------------------------**/ 1. Lead to segfault : cloog ./test/daegon_lu_osp.cloog -f 3 -l 6 -nobacktrack -override (while every other -l values do not !) DOOOOOOOOOOOOOOOOOOOOOOOOONE !!!!!!!!!!!!!!!!! 2. -strides gives bad result for a dreamup or interpolation-duration file in test/non_optimal (I don't remember which one) 3. Various configure problems (check Sylvain Girbal mails in the mailbox !). DOOOOOOOOOOOOOOOOOOOOOOOOONE !!!!!!!!!!!!!!!!! 4. With GMP, try test/emploi.cloog (with valgrind): a memory leak... DOOOOOOOOOOOOOOOOOOOOOOOOONE !!!!!!!!!!!!!!!!! 5. With GMP, option -cpp do not write all the statement internal stuff (e.g., S1(,,) ; instead of S1(i,j,k) ;). DOOOOOOOOOOOOOOOOOOOOOOOOONE !!!!!!!!!!!!!!!!! # **-------------------------------------------------------------------** # ** III. Various notes ** # **-------------------------------------------------------------------**/ Kill the cat. cloog-0.18.2/doc/Makefile.in0000664000175000017500000002520712254313267012455 00000000000000# Makefile.in generated by automake 1.11.3 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = doc DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in TODO ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_cc_maxopt.m4 \ $(top_srcdir)/m4/ax_cflags_warn_all.m4 \ $(top_srcdir)/m4/ax_check_compiler_flags.m4 \ $(top_srcdir)/m4/ax_compiler_vendor.m4 \ $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/ax_gcc_archflag.m4 \ $(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \ $(top_srcdir)/m4/ax_submodule.m4 $(top_srcdir)/m4/libtool.m4 \ $(top_srcdir)/m4/ltoptions.m4 $(top_srcdir)/m4/ltsugar.m4 \ $(top_srcdir)/m4/ltversion.m4 $(top_srcdir)/m4/lt~obsolete.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CD = @CD@ CFLAGS = @CFLAGS@ CFLAGS_WARN = @CFLAGS_WARN@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GIT_INDEX = @GIT_INDEX@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ ISL_CPPFLAGS = @ISL_CPPFLAGS@ ISL_LDFLAGS = @ISL_LDFLAGS@ ISL_LIBS = @ISL_LIBS@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OSL_CPPFLAGS = @OSL_CPPFLAGS@ OSL_LDFLAGS = @OSL_LDFLAGS@ OSL_LIBS = @OSL_LIBS@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ TEXI2DVI = @TEXI2DVI@ VERSION = @VERSION@ VERSION_MAJOR = @VERSION_MAJOR@ VERSION_MINOR = @VERSION_MINOR@ VERSION_REVISION = @VERSION_REVISION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ subdirs = @subdirs@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign doc/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign doc/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ distclean distclean-generic distclean-libtool distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am @HAVE_TEXI2DVI_TRUE@cloog.pdf: cloog.texi gitversion.texi @HAVE_TEXI2DVI_TRUE@ $(TEXI2DVI) --pdf $< gitversion.texi: @GIT_INDEX@ echo '@set VERSION '`$(top_builddir)/genversion.sh`'' > $@ # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: cloog-0.18.2/doc/images/0000775000175000017500000000000012254312305011717 500000000000000cloog-0.18.2/doc/images/tree.pdf0000664000175000017500000001071612254312305013276 00000000000000%PDF-1.3 %Çì¢ 6 0 obj <> stream xœ¥WK®ä6 ÜëZ&IÞ32 Uƒ,‹s~˜W“9ŽRÇ‚täKwÏb;—ý ÙJ«ñg'yˆ·o°‹„óÒZæÕ(»µÖÝ£"×Tå)—aõT9y=Ôà|Ùóð-ÊÃè¾Ö(éjÃT¦aõ$Ô5 wd ¤a[ì!õæxûÈ‘g*9Ñy%p ,TI"çÂRÃvE ‘ËKlèä)s ê†Y]ƒÊ…÷÷‰ZEeu϶%™«b³!BˆƒÚLÜßbOqk2ã¬ù–¦Úë¡6ˆ£6t<ÕF_ìÅ ®{m0îV>”0׆¡ŒÚèã½6ÆbI\÷ÚP\Îà#JÞá1y>OÜndÈÒ {)eXOœi¦¨ã[§Ät°4ÑêÖ}ÆÚgóÛû×ÜZ´]¯§Ád–îØÖ3ø‰x¦úôÁ4&yÒý e(§<”‘qg Òü® eTÖÆ·­ý‡2¨¢6?×{e:Àz?ÏT³2O¸?¨ þ[]J”ÑMFäJG ´Üi±y[¸WDz—Ö;Å“»ózD=ÐÍC‰Ç=M‡Ë·¡A¡Û :ê¼b5Ty }>²|CKIx|tÌÒ{‚ôö.Šh#;I²{¯÷ÀGÚ‰§«òœóc )5-ð6+x[fÑ ;s K¸Øéxg dygà›Ò„òÎi9¬÷ðî#Y×ç;>=Ž;<‡exÓaHzå飯©ÁûÇÊ2ú6-Û™Áýãxfvïõ„{`œIƉyÂõÁóâpðøn½ÓÂ×’´˜p’Щðâc‰‚ëZnVjã.¥7“šÅþfÏ*¹§‘lž:À¬÷4‡ ΤC«ïy´7©–­ÃQYF‘·èëJÕì)ûÄÕˆ þÏ+*¾ó†:¬wð3õ‰k¨ô4+ô†ò“Ïšþw]íÏ|ÞÀ$n;—OF?{ˆmÈKÅ^Vóƒûñò•/Žö¥x{ù½O°{˜LLàúéöuª¬ŒNxž`ó€Ð\_VwB @e \>àCµÉä«ìã-åUpa¼ ¿×pÞÉ㌂«½NQüˆ; ¼ ªRç¿JªµÚ·DýŽÙ¦_ 2X4œ?yò—‹ýhø÷/î›Çðendstream endobj 7 0 obj 1017 endobj 5 0 obj <> /Contents 6 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 1 0 obj <> endobj 4 0 obj <> endobj 9 0 obj <> endobj 8 0 obj <>stream xœm’[PWÇw‰É®VQI3+ÉÖN½ R#ÕQŠŽ£0hŠLdž(›dÍÕdL² ¨‰ž"‘K@©Ñ*Š Rêà¥ÅÖK/mE¦™ñ¡3¶ÓÒÏâòÐM;mÚ—3ß|ß÷ÿÏùÿÎA‘)IŠ¢âõ%[ 7­K/¦Œ¤-Ci6ªM‰öBö-”—Ħ ¸Õܹ×Ç_+„iH~«`FlžpV |6Þ™ ¯ÍB(Ús÷YŽÙâ´RZM,Ú®,Yœž¾äß⬬,b·óï ‘KÚ(­‰XÀÒ`¶IMäðÛµ‡ÐœP——“å ÙµÔy”²XÌbQÎb"S¡X–Á™ÙÄV»‘´š—”IC™(ÚI¨MåÄ6#©UFu9™0È5R´ÕI,WP¦Ô[)ãn»ø3-±ÕœEäJRk7¨­ÿ 2•*Ú«_®X–ù>‚lB–#›‘|D‚ÌFR1ò&2çˆLAJW¨ }•”žJz(X(8k’áe#£˜Ã–I¸¥ÅB‹„šÂÇB @z¢Á­’s rª«ò8«£Ø‡uþFð‡Û  M›Íô©xgGüÝi’'³×½1G7»%ÓûRâcÐóÛñU¶hb•Ä! ÐUU.P \µ®ˆ¦Yу2 rí5é N5(ÙWŠà”‚ÇäµÝ'ÉoØp1³±t×úÌü›0¹TF‹ÄWOs:a‡(ÔÖÔGAK í@Óëï8Ä^Œüþ¬ø—úH>H}ÜÀo^ê¹Ýi¿¶[vFß¼ïx~RÄ'fŸŽ£px;»Kr¨¦€&½N©« EÃÑP#v6¸Êä“31°6h­ª8Xíñ{ªë]1g§§Á pÚé²ë{é0éÖ8_¾sbíÿqòh³šÑïGõ Ï“÷ÆÏ6z?’O:0P æTòD½Q¬"´'Ì4ƒn)ÌÇ Ám« „ƒá`MP©®9á>ßÁJÙ~š¢"U¡M=ÈeÀ©ñO}sû³xD­m·<åÊ<¢‹GŽ€ø}O%—Æ%§²«°@˜¬4ù ÝR£_˜¸V .¸Ë®iGá¹ak€nÉ»l¡JÄÝŸ,n†ç¸ìa˜=ŽqïJ¸"x¾Lˆ<])](x ½Àzþ1‹Ú¥Ñ‘¸©€CÏrSŠ.¨mC`\n9ß=t³âÎÀ¡ZßææÈ‚û$£ýœ#9RE¬X¡zË¡® Æþ‚…Ž àÞšÛ¨z°¦º£µµáÖú–Z[¬ÑË'K1°×O»}ŒÏTááÅ£Øê»|Ž³?c “'lçw(üzLÀšašÄ[§Qz})çÁÕ0÷ÅOŸ€§Ò_?~§¸Ä¾G#ÓSŒÞ•;”ÚûËùO|ôKåÊ5»Þ[™)çò¸Ba%;7áÊN~•ã#äã9âë0þ(¹:ŸðáâØmûEeÞÜ•ÊMë,õ'42c««ÞÅÿÆãÐ]¶?éêôu û`Ð=`:Sѱ¿IÕ†‹¯?8yáÆÜ6±´TåÒkeF ³Ï¾-Híû¶ÿì€ßëWåk­Õ*7ÍÌž\ÑÎîh‡Åí¢ÓÓž¿q:2}úóÖé3äÓËN endstream endobj 11 0 obj 1247 endobj 12 0 obj <> endobj 13 0 obj <> endobj 10 0 obj <> endobj 2 0 obj <>endobj xref 0 14 0000000000 65535 f 0000001332 00000 n 0000004150 00000 n 0000001273 00000 n 0000001380 00000 n 0000001122 00000 n 0000000015 00000 n 0000001102 00000 n 0000001713 00000 n 0000001449 00000 n 0000003128 00000 n 0000003045 00000 n 0000003066 00000 n 0000003096 00000 n trailer << /Size 14 /Root 1 0 R /Info 2 0 R >> startxref 4200 %%EOF cloog-0.18.2/doc/images/basic.jpg0000664000175000017500000005127412254312305013433 00000000000000ÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀMí"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(ª×úŽ•h×zí½²k‰V4ôÉbY¢‘Y]у+ ‚A´QEQEQE—â9tÈü=|šÍôvVBðK;Ê#ÚáFçzåôÏè>ð6.“©ªø}á[è!2´ançS·pa;p1]Û*º2:†V Œ‚+ξ^Zéÿ´k»Û˜m­£—šgŠ>Ñ'RxÛhúæ—â %¼Òo༷?ÇçÄuØÖ…x¯ˆ#ÑÒRÒÂæöÑEe¦Èœ|ƒll 8*>ñ'ŒMqþ ÷‡~$ê¿×®u­;û4jMtÛå…Œ63ry8Î0dצÖ‘¥Å¤]\^ÞÍêÚ¼ÀÍ"ô%Pì‰8û¨ŠØÏ_˜žMnP\ÄXü1uá±iâ\é¶m2Hâ9‘ÂŒÝFp:ñŒ×]^ñ·þI»ÿnÿúQzrºÏÄ- J½}2ÞIuM`d ;NC4ÙÈlp¸Ç9#MsŸ´_ßê qjeÔ|6‹ûý&Âëì·2qÉ/´ïÚ' ­?ë^…N“¡Ù®‰|ß4ºuݹ·¹ÎN7åÏ<`¶3jñ¶™àÛßK«|9ñ^¯|Þ_™}ao3C/î×JÊ£…8k?BÒ| ˆtÉ,þøÊÊénâ0Ý\[N#…îäÌ@PpNAàt Sÿ„ËÃíuwk¢·76Œ«4±¼òÊX¨ c…còç9«º6¹¦ø‡N]CJº[›fb»€*U‡YHHô ã|'gã'Ä9ŒjeUÓ•\Ž@0@>‡ò•CÀ–7÷z/Žìô}Hi7gÅW‚¡n³€hÉùƒ•{g=¨¹ÿ„’Ïþ/øEü¹þÝýŸý¡æm_—æyxÎs»=±Œw¨¼I¥jzÚçÚjsé–2+5ÕÕ›m¹È+µÝ.Ku@îkË?áñ—ü.O±Âwÿ?øGüßíìˆÔý£W—¿{æÝ×µz~”º—†´I›Ä¾ :ÌælÇ2Ù$ A,KgsnÎìv /M´×¼ñGFÑá%ÔuYŠáš-B_:[v‰7ÜGä0 ÎG½V¹ûu9$:ãë; ©ñwâ0U 3¦œŽL Oë@ƒEPEPEPEPEPEPY~#—LÃ×ɬßGea4/³¼¢=¡Á^ônx÷­JFUtdu ¬0AP‚Œ¾ Ócðýä·šTQ´PO.w8F*s;‚:Çb¤ñŒ4 "kêPÛË ÌpºY:ýÔcÓÆ3Åy„4ÿj?ô¼'¨Ãg87&`Çkʾ|˜T|לwê+KÁ·þðÕúŬh7>ñ ·–nu|ÌgbH&;£ò°ç¹÷€=/FÔ›WÒ¡¾k»4¶ »dª /l€= _¯>ø—ká»ôÒ_\ð–·â5Snt˜¤BÌîØë÷¾\g?t×ý‹ðóþ‰ŽðãÿP´ê(ÐôF>ûS·‚îdwHY¾b¨»˜ŸN9ç¯lÑ¥ø›IÖ5 ­>ÒâO¶Úf¶ž ‘Tôm²*’¾ã#§­pš¥½™ñßÂh`°–ÚÍ-¯ 6—H|Èm¢°$ëÔ’ëZ!Uhf* ð®XÔý«þP ÑEQEQEQEQEW™|j¸ðøðÕ¥¿Š,µ¦ÓZí;0Õ›káHvÏÝÞ~éù¯M¯ý£¿äžiÿöÿEK@›áÙí.¼1¤ÜX$©g-œ/Ëë@T6 çÏ5 òÇß2EMÌwdž€{Ö?äžxkþÁV¿ú)kÌ~=øÊ]PðÕ…›=½Êê’.qŸ-±>Äïü…{u^Âö KN¶¾¶mö÷1$Ñ7ª°ÈÕŠ(¢Š(¢Š‚êÖ;È 2´Ê¤ç0Ìñ7ýô„Ö¹¥øká5°°ÓΖe°°‘¥·´šâYbWc’v³zž1âºÊ(‘E¤0ƱĊÀ‚ŸEEp7DÉ_÷ˆqí?xsœŽR;€Fp@%®kľðÏ‹îáº×tæ»–ü¸ós*\ç…V>øÏÐWKEr¾ømá êÚZ6Ž¶÷žYŒJÓÉ! qœbã¨çÍuTQ@y·Ä-BßÅþÖ¼§-ÀÖê q 0ÈÆæ@qrwdt÷ôš(¬wÂú'‰`Xµ: ‡(í•t?ìºá—ð5¯EÉeŽ̒ȱ êÌpãO¦KsFc–5‘Ua ƶðŽgªßjvñÝÇ{|¹”_O™p¥W#~8éÛ©t_ é^{¶Ó!š#y3\O¾æYCÈØÜä;˜àdÕ¨^æÞì[ËçÝ,Í,¢pˆ©‚6ÆÜ‚OÍÁçiϽÚÏþÄÓ¿á!þßû?üLþÉö/?{©ß¿nÜíûÜç÷ª^&ðnƒãmá×lšî+v- ‰#œHFeS:tºŠ( Š( Š( Š( ¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`çZ(¢€ (¢€ (¢€ (¢€ (¢€#žn­å·¸Š9 • IŠ]HÁ#ŒUdšâÞóʸ-:ÜÊÆŠÜ…•Û'’CÜg cÖí2X’h^)QÔ« õ­>ŠÏY›O-æÚ-¥‘ ³X¢va„$‡# ”üÇ <õРŠ( Š( Š( Š( Š( Š( Š( Š( Š( Š( ®è€Ù+þñ"}§ïs‘ÀêGpÁÎ µÀÝ%Þ!ÄO´ýáÎr8Hî9Á–€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ Ž ṈK±Ë$ƒAÁäzGá_;K¤XKûT˦ý™b³—vø & wYo¹Ž¤’}rsÔÓ~è¶W¿¼cái–_ìk¦6 3,OåÜ* ` ?¥}±Ï M ‹$N¡‘Ðä0<‚ê+7Ä?ò ‡þ¿¬ÿô¦:ñ¿Ù¢òæ[?Ù¼ò5´nñD[*ŒÞfâlí\ý+Õ˜4ÒÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`ç’êÞ/7Ìž$òcóeÜàlN~cè>VäúJù£âÆoÇãGNÑï?³,ì.ZØ$hŽÒ4R\³.y#îŽ1ÁÏ9úrŠóß…ßÅÞ kÝb{[kÛ)  Òªù€*·šW äûeN=lú¶›™¿P´_-7¾é”m^y<ð8<û¹ES}[MÌߨZ/–›ßtÊ6¯<žx}«i±ù›õ EòÓ{î™FÕç“σϱ  ”W̾=øÙâÈ|e¨Ùhw‰§ÙYLöª«sy¥©³©ëŽƒ€1שõ…ßÅÞ kÝb{[kÛ)  Òªù€*·šW äûeN=¡QTßVÓcó7ê‹å¦÷Ý2«Ï'žŸcCêÚl~fýBÑ|´Þû¦QµyäóÀàóìhåMõm6?3~¡h¾Zo}Ó(Ú¼òyàpyö5ó~6x²j6ZâiöVS=ªªÅÞiF*d,êzã à uê@>š¢¼÷áwÄEñwƒZ÷XžÖÚöÊCÃ4ª¾` ­æ•ãh9>ÙSAÛ>­¦ÇæoÔ-ËMïºeWžO<>Æ€.VrÏý–éÃGŽ!·µ‘æy%’CC–Ë‚X’Iϼ¯«i±ù›õ EòÓ{î™FÕç“σϱ¡õm6?3~¡h¾Zo}Ó(Ú¼òyàpyö4rŠùƒÆŸ|Yaâ«ý3CÔM¥•„ÒZ©tŽv˜£°2t={Àuê}ƒáW_Æ~ ’ÿTh!¼°ÃtûÀóHã`9>ÙS@ßÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÀÝ%Þ!ÄO´ýáÎr8Hî9Á–ª^\[Ç‚I?Ôì–P³1¦ï¾Ç#6±9ê†JšK«x¼ß2x“ÉÍ—s±9ù ù[“è}(Z*).­âó|ÉâO&?6]ÎÄçæ>ƒånO¡ô¢K«x¼ß2x“ÉÍ—s±9ù ù[“è}(Z*).­âó|ÉâO&?6]ÎÄçæ>ƒånO¡ô§ c34"E2ª†d@$zÈúP?Š­¼Cw£y^¿¶±Ô|Ô>uÌ{×`?0Æ${~]FÝyßÆèâ×j—i5ÄS[˜Lf+‡Œ|ÓF§r©¸?Ä:Žjˆ><Ö|?ªÅ¦ÛÚ®—a.k÷I4± ùº˜â€=ÿQ²Ò¬ä¼Ô.¡µ¶Œe¥™Â¨üMY®Að‰{"kÚ®«'‹.¥%⻺‘d·Q–ÿUþì“냜b©ø¦êþ?ݤ?ô­1³lö–®ðü‹Ô»†9ûÜâô H¢¼¯I¼Ô[Y±Wø×£jn# ešµÀÜ?v ¾An™óÅIáý×Rø©ãë;æžêÆ°¢O3I–„·ÎÀÀÊ(>/…÷ƒâ°ñܺô ?™“h¶T§•åcwšNv÷Ç^qŽ(ðÇÂûÏ xëWñJkÐO>¤³ï…¬ ªI|Üà0wG¤Q@oðßáußûÛÉ"×â¾µ½TBÖ&6ÊnÚU¼Ã¼sÁϵv~!ÿl?õýgÿ¥1Ö­ex‡þA°ÿ×õŸþ”Ç@´QEQEQEQEâŸ~ØêÚµçˆ4íJK#pâIí¼44®ÿ3†.¸6Hç¡ÇP+Úë/ÄC:$ß$óÇÂ6Ó÷לäp:‘Üd`ô :ðdží<-¢G§ZÜï–Vë$„[º=ã[4Q@Q@mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªì<1á»O h‘éÖ„·;啺É!ÇnƒAøÖÍQEW›x“á ž·­O¨ÚjMcö‚d–3š „’ÌáŒç§ÿª½&ŠÆðdží<-¢G§ZÜï–Vë$„[º=ã[4Q@Q@mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªô‡–Z‚ôˆ´‘„D=Ä×òºªÉ1*0A9Ž˜ÂI'•¦KsÄÑMI 2:ä¨4ètW7¢ër›„±½2Í$Ìæ9‚ˆ  +õëƒÞºJ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠŠànˆ ’¿ïâ'Ú~ðç9¤wŒàËQ\ ѲWýâDûOÞç#ÔŽàƒœh¢Š(¢Š(Ïþ0ãPøU®[Y²Ï7›oÈØ$7aO¡äqî+½–(ç…áš5’'R®Ž2 õ’žÐcÖ%Õ“M„^Ë ™ßœ4€`>ÜíÝþÖ3Þ¶h‰ºømemxu ßMá»ÒrÂÍ[Éìð)íÓ+zûÂ~Ôï$¼¿ðþ•wu&7Í=”r;`2Ädà? Ø¢€0àð_…mn"¸·ðÖ ñ8xäŽÂ%d`r!r<æ³t¯ jº_µ¯®µi$z¸ˆOjlmò£)Wóxë“sÈã¨ë¨ ?ÂþÕü3>¶Ë­ÙÜEª^M°éì¾Tòž|Ó”ÀÆ:ô9ìmøÂ÷ ðŶ…&¡ô6Û¼©ØÄß3³ß;ËqŒtï]-QEVWˆäýYÿéLu«Y^!ÿl?õýgÿ¥1ЭQ@Q@Q@Q@eøˆgD›ä‘¾xøFÚ~úóœŽR;ŒŒ•©Y~"Ñ&ù$ož>¶Ÿ¾¼ç#ÔŽã#¥rtQEQEQEQEQEQEQEQEG<][ËoÓ÷‡9Èàu#¸`çZ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š+œ×u.h¢²‹R³{±¨Z©gS&EÄysœŒý+£¬¯ÿÈ6úþ³ÿÒ˜èVŠ( Š( Š( Š( ¾`ø“ñƒÅx³SÒtË¡§ØY\5·–ˆŽeh¤?9f\Œ•(ãóŸ§ëÅ> ü ±ÕµkÏiÚ”–FáÄ“Ûyhi]þg ]p>l‘ÏCŽ Pð÷Ä÷>*ðÀ¼¼Væ M¼Ž½$!TîÇlîéÿê®®±¼1á»O h‘éÖ„·;啺É!ÇnƒAøÖÍQExg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýkÒ>øžçÅ^—‘ªÜÁ)·‘פ„*ØíÝ?ýUƒâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªì<1á»O h‘éÖ„·;啺É!ÇnƒAøÐÍQ@xg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýkÜëͼIð†Ï[Ö§Ôm5&±ûA2K‡ÍBIfpÆsÓÿÕ@ß|Os⯠ËÈÕn`”ÛÈëÒBNìvÎîŸþªêëôð¶‰hKs¾Y[¬’lvè8ôlÐEP†x¿âˆ¡ñ=õž™p¶VÖ’½¾ÁH\£X–S×OÖ½#áï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕX>$øCg­ëSê6š“Xý ™%ŒÃæƒ!$³¸c9éÿê®Ãôð¶‰hKs¾Y[¬’lvè8ôlÑEAÈà׌x›ã‹ôÝjm+GÔ^ÎÓNf´b¥Ä“b Žò+Oùõ¯g¯6ñ'Â=oZŸQ´ÔšÇíÉ,f4 %˜ÃÏOÿUzÂoÝøãÁbþþ%KËiͤ®§‰™Q~06ç qqè;ªóÿ‡Özo‚ôTÐÔ$Pÿ®–öYB‰¦bz…è'“èQEQEQEQEQEQEÀÝ%Þ!ÄO´ýáÎr8Hî9Á–¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÐEPEPEPEPEPEPEPY^!ÿl?õýgÿ¥1Ö­ex‡þA°ÿ×õŸþ”Ç@´QEQEQEQE—â!o’FùãáiûëÎr8Hî20zV¥eøˆgD›ä‘¾xøFÚ~úóœŽR;ŒŒ”ÉÑEQEQEQEQEQEQEQEQEQE„Œ€pAõŠÜÒ5çIÎý—kÉöÙAÜ6Æ@Á΀qÑy$žq)’Åñ4SF’Fà Ž¹ê zÍèºÜ¦á,oL³I39Ž`€"( Ç=zà÷®’€ (¢€ (¢€ (¢€ (¢€ (¢€"¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`çZ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š++Ä?ò ‡þ¿¬ÿô¦:Õ®s]Öt¹¢ŠÊ-JÍîÆ¡j¦L™ämÎr0sô ŽŠ( Š( Š( Š( ²üD3¢MòHß<|#m?}yÎG©ÆFJÔ¯˜>$ü`ñDž,Ôô2èiöW må¢#™Z)ÎY—#%GÊ8Ç<ä×è®Sáï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕ]]QEW†x¿âˆ¡ñ=õž™p¶VÖ’½¾ÁH\£X–S×OÖ½#áï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕ@]Q@W†x¿âˆ¡ñ=õž™p¶VÖ’½¾ÁH\£X–S×OÖ€=Ίå>øžçÅ^—‘ªÜÁ)·‘פ„*ØíÝ?ýUÕÐEPExg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýkÒ>øžçÅ^—‘ªÜÁ)·‘פ„*ØíÝ?ýTÕÑEQExg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýhÜè®Sáï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕ]]G<][ËoÓ÷‡9Èàu#¸`çZŠànˆ ’¿ïâ'Ú~ðç9¤wŒàË@Q@Q@Q@Q@Q@Q@Q@ex‡þA°ÿ×õŸþ”ÇZµ•âùÃÿ_ÖúSjÑEQEQEQEWŠ|Aøc«jמ Óµ),É'¶ò<ÐÒ»üκà|Ù#ž‡@¯k¬¿ è“|’7ÏÛOß^s‘ÀêGq‘ƒÒ€<ëôð¶‰hKs¾Y[¬’lvè8ôlÑEQEy·‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã[4PEP^mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªôš(ôð¶‰hKs¾Y[¬’lvè8ôlÑEQEy·‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã[4PEP^mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªôš(ôð¶‰hKs¾Y[¬’lvè8ôlÑEQEy·‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«Ò>Úé~ Ñ#Ñ7E O"rò×72„<.qP ÏL e–€H9ô +˜Ñ5¯³"ÙßÎLh¤‹Ë™†Y‹p‡§<€~Zé袊(¢Š(¢Š(+º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-Ep7DÉ_÷ˆqí?xsœŽR;€Fpe Š( Š( Š( Š( Š( Š( Š( ²¼Cÿ ØëúÏÿJc­ZÊñüƒaÿ¯ë?ý)Ž€5h¢Š(¢Š(¢Š(¢Š+/ÄC:$ß$óÇÂ6Ó÷לäp:‘Üd`ô­JËñΉ7É#|ñð´ýõç9¤w=(“¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(®‰"•uVSÔ0È­íX‘OÙ/æ–f>d¢êMŠˆ¹Œã€x89 rsŒáÔsÁ ÔÄQÍ ƒkÇ"†V„´è”W7¢kSÅ•ô4“HÆ0…cž½p{æºJ(¢Š(¢ŠŠànˆ ’¿ïâ'Ú~ðç9¤wŒàËQ\ ѲWýâDûOÞç#ÔŽàƒœh¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(®s]Öt¹¢ŠÊ-JÍîÆ¡j¦L™ämÎr0sô®Ž²¼Cÿ ØëúÏÿJc  Z(¢€ (¢€ (¢€ (¢€ ùƒâOÆIâÍOIÓ.†ŸaepÖÞZ"9•¢üå™r2T|£ŒpsÎ~Ÿ¯øƒð6ÇVÕ¯ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã@4QEáž/øŸâ(|O}g¦\-•µ¤¯o°F’(Ä%”õÇAÓõ¯s¯6ñ'Â=oZŸQ´ÔšÇíÉ,f4 %˜ÃÏOÿUo|=ñ=ÏŠ¼0//#U¹‚So#¯IU;±Û;ºú««¬o xnÓÂÚ$zu¡-Îùen²H@±Û ãÐ~5³@Q@âÿ‰þ"‡Ä÷ÖzeÂÙ[ZJöûi!rŒAbYO\t?Zô‡¾'¹ñW†åäj·0Jmäué! §v;gwOÿU`ø“á ž·­O¨ÚjMcö‚d–3š „’ÌáŒç§ÿª» xnÓÂÚ$zu¡-Îùen²H@±Û ãÐ~4³EP^âÿ‰þ"‡Ä÷ÖzeÂÙ[ZJöûi!rŒAbYO\t?Z÷:óo|!³Öõ©õMI¬~ÐL’ÆaóA’YÜ1œôÿõP÷ÃßÜø«Ãòò5[˜%6ò:ô…S»³»§ÿªººÆðdží<-¢G§ZÜï–Vë$„[º=ã[4QEáž/øŸâ(|O}g¦\-•µ¤¯o°F’(Ä%”õÇAÓõ¯Hø{â{Ÿx`^^F«s¦ÞG^’ªwc¶wtÿõV‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã@4QE2X’x^T4r)VSܯñWÆYx‚ëMÒ/£Ó쬭ä/°•ÜÌêNN;`cNIöZóo|!³Öõ©õMI¬~ÐL’ÆaóA’YÜ1œôÿõP§ü&ñߎ</ïâT¼¶œÚJêx™•·ãnwòƒº¯=øwecàÍ%t cXä•JO󸆰ä/ÝP1Æ<ò} € (¢€"¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`çZ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š++Ä?ò ‡þ¿¬ÿô¦:Õ¬¯ÿÈ6úþ³ÿÒ˜èVŠ( Š( Š( Š( ²üD3¢MòHß<|#m?}yÎG©ÆFJÔ¬¿ è“|’7ÏÛOß^s‘ÀêGq‘ƒÒ€9:(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€H9ÛÐõ…·‰,¯¦UqÃq=Ág•ÙŠímÝÉ(É,[Ä G€=ŠætmsÈ×P›ä°¼¸•Fægá×ðk¦ ®è€Ù+þñ"}§ïs‘ÀêGpÁÎ µÀÝ%Þ!ÄO´ýáÎr8Hî9Á–€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ ÌOhrêm¦G¬éÏ~¬U­Vé  Ž ¦sŸÂ§Õm®otÙ­­.¬²€žrýäRFâ¾·8=Ž+ç¯Œß ôO Ø釒hon.…»[ùï,“±„Š–ÝÇeâ€>‘¬¯ÿÈ6úþ³ÿÒ˜ê] íßðiŸÚñÿöH¾Óÿ]v ÿ®k+ÄZîŽ-Üê¶"hï­·Çö„Ü»n#-‘œŒséƒ@-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-eøˆgD›ä‘¾xøFÚ~úóœŽR;ŒŒ•~K«x¼ß2x“ÉÍ—s±9ù ù[“è}+æ_‰?VäúJeù"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô¢H¤‹Íó#dòcóeÜ1±9ù ù[“è}(”W†øÇâwˆí¼Sc§N, ³™íŒ~R9fF*X–S‚qÓ·ë^ðóÄ÷+ð´·×qªÏdÆ;™ð@PÞcáŸo”ýWE>H¤‹Íó#dòcóeÜ1±9ù ù[“è}(’)"ó|ÈÙ<˜üÙw lN~cè>VäúJeù"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô¯ ñÄïÛx¦þÇNœXAg3Ûü¤rÌŒT±,§ã§oÖ€=ÊŠå>xžãÅ~–úî5Yì˜Çs"ž Ìaü óíòŸ ë¤ŠH¼ß26O&?6]ߘú•¹>‡Ò€E>H¤‹Íó#dòcóeÜ1±9ù ù[“è}(’)"ó|ÈÙ<˜üÙw lN~cè>VäúJeá¾1øâ;oßØéÓ‹,æ{c”ŽY‘Š–%”àœtíú×£ü<ñ=ÇŠü--õÜj³Ù1ŽæE<7˜ÃøAçÛå?@ÕÑO’)"ó|ÈÙ<˜üÙw lN~cè>VäúJ$ŠH¼ß26O&?6]ߘú•¹>‡Ò€E>H¤‹Íó#dòcóeÜ1±9ù ù[“è}+¼cñ;ÄvÞ)¿±Ó§YÌöÆ?)³#,K)Á8éÛõ r¢¹O‡ž'¸ñ_…¥¾»V{&1Üȧ‚†ó<û|§è:é"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô QO’)"ó|ÈÙ<˜üÙw lN~cè>VäúJ$ŠH¼ß26O&?6]ߘú•¹>‡Ò€ExoŒ~'xŽÛÅ7ö:tâ 9žØÇå#–db¥‰e8';~µèÿ‡Ò‰"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô QO’)"ó|ÈÙ<˜üÙw lN~cè>VäúJð¯üNñ·ŠoìtéÅ„s=±ÊG,ÈÅKÊpN:výhܨ®Sáç‰îß)úºH¤‹Íó#dòcóeÜ1±9ù ù[“è}('D‘Jº«)êdVö‡¬H§ì—óK32Qu&ÅD\ŒFqƒÀ<…99Æq¤ŠH¼ß26O&?6]ߘú•¹>‡Ò£»³Y ¸‚òØ4+ùã™2¢3žXáù[“ÇÒ€;˺ 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-|¯ãŒ^5ƒÄ—úu–¦ÖVöW-E†2Ìcs˹ê9àçœûO¯¿Œü%þ¨ÐCya!†é÷€ æ‘ÆÀr}²§€¿¢¢’êÞ/7Ìž$òcóeÜàlN~cè>VäúJ$º·‹Íó'‰<˜üÙw8Ÿ˜ú•¹>‡Ò€%¢¢’êÞ/7Ìž$òcóeÜàlN~cè>VäúJp–33B$S*¨f@yäG¡Áü¥cøªÛÄ7z7•á›ûkGÍCç\ǽvó `òG·åÔ_M[N“R—MKësí¼Áæ(# íëŒw®ãt?ñkµK´šâ)­Ì&3ÃÆ>i£S¹T€ÜâG5Òx‹Áz‰öɨZm»ýU廧Œÿ²ãŸÏ"€: +Æçñž·á 'OÖcñ´,á~±1¾ƒ©ÿ[lI|: ­ÏÝ_Çâ;´‡âÞ• Æ6cMžÒÕÞ‘z—pÇ?{‘ü^”éÃk:¯Ä »‹‰|+¥èËcnïþÕi׌UŠ*r7G= bi7š‹k6*ÿômA Äa¬£³³V¸‡îÁWÈ-Ó#žx¯EÕu5ÓmÁHÅܤ¥µ²œ4ÏŒàùn€dšÅð‹fñ†-ÝÝ°¿´º{+»rÄì•ÝŒ¼8íÓ'ÔÖ„<8<3¡ýšID÷×3=ÝõÀÎ&¸åØ{tØ óšß  Ú†¡g¤éóßßÜGoi–YóÛ½xÕ—Å_ëóxŸ_ÕƒÜÚ‡IÓÖÒf6Ñäå‰Û·Í“'8PÏS^Ǩiz~¯mömJÆÚößpo*æ‘r:0#5•ÿ'ƒÿèTÐÿð]ÿ@ôúžƒasÅ-Ô 1NBnê÷¨¼Cÿ ØëúÏÿJc­(¢ŽRcXâE ˆƒ@àAY¾!ÿl?õýgÿ¥1ЭQ@Q@Q@Q@xß~Xø‡Ä7ƪK`näß<ÜM™¾yiœ‘ÏCŽÂ½’¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#8 ~ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEãÞ0ø§ø“Äw:½†°ÚgÚ˜Ë<&ØÎV$³‚]qœôõÎ= x+ÁöðäZEgÁó'™ºÍ)3ã'tuë] QEWxÃàŸâOÜêöÃiŸjc,ð›c8iX’Î uÆsÓ×8ôÃEsÞ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEãÞ0ø§ø“Äw:½†°ÚgÚ˜Ë<&ØÎV$³‚]qœôõÎ= x+ÁöðäZEgÁó'™ºÍ)3ã'tuë] QEWxÃàŸâOÜêöÃiŸjc,ð›c8iX’Î uÆsÓ×8ôÃEsÞ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEãÞ0ø§ø“Äw:½†°ÚgÚ˜Ë<&ØÎV$³‚]qœôõÎ= x+ÁöðäZEgÁó'™ºÍ)3ã'tuë] QEWxÃàŸâOÜêöÃiŸjc,ð›c8iX’Î uÆsÓ×8ôÃEsÞ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEã~5ø câÜkv©-»“|ð q6dfùä¤\rG=; î<áKhÉ£BþtSNeHsÉå ï!ËÉCºÚ¼±Ééîè€Ù+þñ"}§ïs‘ÀêGpÁÎ Œ¡Ñ”ç`à1Ò€ŠÎ€ÿeyv²ÒÅDVög{É!8#NsÐrIÏ9÷Ñ Š( ?øÃCáV¹mfË<Þm¼#`HÜE…>‡‘Ǹ­=sÁ·~%Ö̺Ÿˆ/“DE4«&0 Œ²)ÜÀóòñŽ=kQ<' Ç¬K«&›½–A3¿8iÀ}¹Û»ý¬g½lÐ~¡é~²[=& ;qü&3îOR}ÍW¾ðŸ†õ;É//ü?¥]ÝIóOeŽØ ±8¶(  8<á[[ˆ®-ü5£Cù±ÿÃ]nóní¹Ïû1õÏZú ¹ÍwYÒæŠ+(µ+7»…ª˜u2d\G‘·9ÈÁÏÒº:Êñüƒaÿ¯ë?ý)Ž€5h¢Š(¢Š(¢Š(¢Š*+º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-Ep7DÉ_÷ˆqí?xsœŽR;€Fp@%¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(+º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-Ep7DÉ_÷ˆqí?xsœŽR;€Fpe Š( KsFc–5‘Ua « ÜÛÝ‹y|û¥™¥”N PFØÛIù¸ í9÷»QÏ7VòÛÜEÐJ…$ŽE ®¤`‚Æ(J*’Mqoyå\nec EnBÀÊí“É!Žî31ëv€ (¢€ (¢€ (¢€#žn x."ŽXœa£‘C+pzÖ#xÂ.ìïám™ŽI:|D“ÿ|ÖýÈ¢ŽRcXâE ˆƒ@àAY¾!ÿl?õýgÿ¥1Ö­ex‡þA°ÿ×õŸþ”Ç@´QEQEQEQEÀÝ%Þ!ÄO´ýáÎr8Hî9Á–¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#8 ÑEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEÀÝ%Þ!ÄO´ýáÎr8Hî9Á–¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÐEPEP%‰&…âeJ°ÏPzÕ%™´ùÒÞm¢ÚY 5Š'fBHr2ùOÌp:Ï] (¢¨$ŸÙÆ;yX- ÁlÍ+Ë+¶;Ëdö’Iä“W袊(¢Š(¢Š(¬¯ÿÈ6úþ³ÿÒ˜ëV±üM,phé4Ò,q%å£;¹ÀP.#$’z Ø¢²¿á'ðÿýtÏü ühÿ„ŸÃÿôÓ?ð.?ñ  Z++þÿÐwLÿÀ¸ÿÆøIü?ÿAÝ3ÿãÿÕ¢²OŠ|<£-¯i`gÞGþ4¿ð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@µÀÝ%Þ!ÄO´ýáÎr8Hî9ÁÏÿ„ŸÃÿôÓ?ð.?ñ¨n¼Qáï)wkV <Äâ;øÐýáÎwŽ;‘Üd`çnŠÊÿ„ŸÃÿôÓ?ð.?ñ£þÿÐwLÿÀ¸ÿÆ€5h¬¯øIü?ÿAÝ3ÿãÿ?á'ðÿýtÏü ühVŠÉ>)ðòŒ¶½¥œsyøÒÿÂOáÿúéŸøøЭ•ÿ ?‡ÿè;¦à\ãGü$þÿ î™ÿqÿjÑY_ð“øþƒºgþÇþ4‡Å>Q–×´°3Žo#ÿÖ¢²¿á'ðÿýtÏü ühÿ„ŸÃÿôÓ?ð.?ñ  Z++þÿÐwLÿÀ¸ÿÆøIü?ÿAÝ3ÿãÿÕ¢²OŠ|<£-¯i`gÞGþ4¿ð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@´VWü$þÿ î™ÿqÿ!ñO‡”eµí, ã›ÈÿÆ€5¨¬¯øIü?ÿAÝ3ÿãÿ?á'ðÿýtÏü ühVŠÊÿ„ŸÃÿôÓ?ð.?ñ£þÿÐwLÿÀ¸ÿÆ€5h¬“âŸ(ËkÚXÇ7‘ÿ/ü$þÿ î™ÿqÿjÑY_ð“øþƒºgþÇþ4ÂOáÿúéŸøøЭ•ÿ ?‡ÿè;¦à\ãH|Sáåm{K8æò?ñ  j++þÿÐwLÿÀ¸ÿÆøIü?ÿAÝ3ÿãÿÕ¢²¿á'ðÿýtÏü ühÿ„ŸÃÿôÓ?ð.?ñ  º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-b]x£ÃÞRîÖ¬y‰Äwñ¡ûÃœïw#¸ÈÁÎ ßð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@´VWü$þÿ î™ÿqÿð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@µB7:v"¸” E«uq8Þò;í ‚=JÏ%€¡ÿ„ŸÃÿôÓ?ð.?ñ¯ðÿíª[l‹ÄL‰ÐÏjÞTŸR§*OÓm}Ep^ø—áÿܦ›¦Ý_ÏrRIÜÞƪé—ÈO”m  c Q’Iç½ Š( Š( Š( Š( Š(  š—Ûí’3ËÛ<3gnsåȯÇn?·\\Šøüvãñ«uÃø×Å>&±i,¼ ®«}n¢K¹&#Ë…HÈP7)w#œØëšî(¯2øWñR_Ïy¦jv1Yê–‘‰Hˆ².v·ÊÙ*A#Œžµé´QESQ²û}²Cæy{g†líÎ|¹ñøíÇãV袀 (¢€ ©¨Ù}¾Ù!ó<½³Ã6vç>\Šøüvãñ«tPEPEPMFËíöÉ™åíž³·9òäWÇã·[¢Š(¢Š*¦£eöûd‡ÌòöÏ ÙÛœùr+ãñÛÆ­Ñ@Q@Q@5/·Û$>g—¶xfÎÜçË‘_ŽÜ~5nŠ(¢Š(ªš—Ûí’3ËÛ<3gnsåȯÇn?·EQEQETÔl¾ßlùž^Ùá›;sŸ.E|~;qøÕº( Š( Š( Š( ¼z?„Ÿ¼¥_ijÉwD–õŽÍÇ XÐ|ßC»½{ q?î¬ì|yw©hVúΟÆg·–å a— ¬ŒªÇp,;¯ç±ét&Ò$Ñm¦ÐRÑtÙPÏÿ/ßcÙ¿þ˜ù³ø? ÷ ¥h¢Š(¢Š(¢Š+ξ9][ÃðŸV†YâŽYÚ…Ài™…Èž;^‹Ey÷ÁVøE¢`J›€À‡Ïóø^ƒEQEÿÙÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀMí"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€?ÿÙcloog-0.18.2/doc/images/basic.pdf0000664000175000017500000011621112254312305013415 00000000000000%PDF-1.3 %Çì¢ 6 0 obj <> stream xœÕšÁŽÜ6 †ï~ Û3‘,Ù²€¤‡½ô–ì==m4ÁN€E}ýŠüIŠÊ äæA€ eŠä7’M‰²_æpŽs òÿÓez™^¿Ïóç¦p.¹ÎŸ§8™jó’S˜/,Öæç)­QÅ%éð<}z52+ëÆÚ‹ˆÛzŽyŸcIëy_çš×&“‡&¥Ý—Š Y0u:óN›@(‚7 æ[ä2Î9ãÀWæŠêMê0šw€ÙïÍû¬oû8ëÛ&³N‚›u¾ž»ËäHf½¤qÖËêfnÖ©)$ÉÍ:¼Ù½yhJLIG,j:”wx‰Ëž‘¯æžŒX¶\Ä”’WŒ’2ŽQJ6RJÎF ¦ÙH©úP™‘r‰Q!! äªAò¶”KÈ–×—°tL4Œ“›R† ¥‚›‰bñH’‡2£dQ)óÚ)s2Ê:eÚ%7:%5-¤†œ)¥Eñ&Ååá!y(w{t *åޥس³”­S÷ð Ñ)‹{|Ô0äL)w÷ìpx3Ùýó}|HÊmãQ(Sì·mã–b߸¥è6nh%75¤1 ;J "ŠêMüîòøvWÊNCdll2hCYÂNæ ·s“ïD.ãŒÓ†B|ÕaÆY±»[çê÷åÁ1-_*'d ªi‚q8§&VpÊQ4À ¹Œ¹ˆqૹŠâMÊ0œw€i+¹rB– º€1¯l©K‹7Y:'ä2®’Œ_uX%Y𥯒n8ï“w˜\±KYYj­ë¹zà‚_Ê = `Ÿ¨ (+ —ñð€«øªÃá«31.l2ﳓRW°¬u…PT? ²Baa%Á›+DNc•Æõû’ÂBƒ@Q½IÝ|ùs˜ýîN–5¨ÎãðT §Î!+xvÕ„ 9ÓÎ8ìK85«31.ww³çNpB– –/‰œ–a X¼Éb¾ENcR"ø§aP’KJ6œ÷€ÙWvádYƒêjÆ8¼Ì §®¬à•QM¸!œÓ¸d2ûN Eñ&eÎ;À´»³Í„M{›¢aÚÛüÉT±Ô§]‹7YÄ—L{ó1L{  ¾HêÓÂ×>íâKï΃cZîN‘󔇉pj†‚r™ Q,)iP3‰Q}Ó‚@±:ãê¹óà˜¶²+'ä<,™À¡eN9eýEð&¡sB®Ã’ ö%œŠêMê0œw€i'›Ê 9°ŒÃoò€©‡¸ž»ä¢°P E ScDÊÓ°úÙæ±)û`â§ÈaÄL»`’à0ùzî“aæuÄÌÅaRÃaRS¢¯Þl0MÙtÁ„Æ'(íz׃Ó(‚7 æ[äu|‚‡} §¢z“:Œæ`öeH8!‡1¿3çdáÔdvMéj‚Fêù]ƒª ã°/áÔ P¬ÎĸÜ2tlL;ç”BXdTµv¼Gõ.ÎýPÛ Á›ô×€"—ñ ‘ê]ñU‡3D(ª7ÞVÞ&çjŸN@ÔÙµ:/Gp"›û§)»O'Ðè'²Ù}:¡F8x]û§DîÓ ÃÂ`²K™±»WªvTÊÕDéïTíp ÷R )3Š{­j&\M°/)3v÷NUP’;íÕÐ`Zq©eä4Ÿ]Þê@;e›ˆjx[qÁ n*ný4Ù¤í%Ú.wO½Ê\ßÝ…ú{_ÚþŠ¿n–ÿž.óoÓë÷‘²è9ÏŸ&|ýç|Þæµ]¹L?ÅŸ¿RrÚæÇÓO µšæÔ|R›µ§\Ï+G¤K_éRóšÌkÛŸiËÜþP‡/oÞ~“>=ò‰²á©mU¤ZÖe†S68µ}å™×#ét¹UcÓbÎ`ùõí~»òæíå*ø²0ß•×SJ…aEñº%¡kN¿ý²œØð÷ÇùÝDÿþÍ½ß endstream endobj 7 0 obj 2027 endobj 5 0 obj <> /Contents 6 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 1 0 obj <> endobj 4 0 obj <> endobj 12 0 obj <> endobj 11 0 obj <>stream xœ´{X×òïì i;‰‰b°‰Äq‹àØqÁW\0àƘ¦w!$@t8ôŽÑ{ïݽ÷ÞâÄ%N·“8íˆ,¹÷­Iœ›Ü÷½ÿ÷ý_b´»g÷ÌÌ™ùM;Z Á‚ ^³öôq Z¸ËÏÇÑWu½@9ƒP¾C*ßå01-¿ÿ¦Ï},J9“ËßâÉÔw´¹o¾3¥úõw¦L~ƒØAp>Çð<‡_áßÄ$B›³‰…Ärb ±‰°$ì 7âDHˆ¹D)ÑHtÃÄ)â*ñ1ñ”xAüF©IN%uÈ÷ÈIr¹žÜLî"íH'Ò‹ &Åd,™Lf“Åd5ÙBö’Ãä)òy‰¼M~B~E¾ ãp8“9os„œ¹œ¥œUœœmœÝ'Ž'€#æÄr'—SÊ©å4rº8œ£œsœœœ/9Ï9¿r~×àiLј¦¡§1[c±†±ÆMÛ4vk8ixhhˆ4d‰™Eeõ­}G5Nk\Ѹ¡ñ‰Æßkü¢ñ/.ÅÕæ¾ÃÅÏ]Ê]ÅÝÀµàZq÷s]¹^Ü`®”›ÀÍæs«¹Ü.îaîî îmîCî7ÜŸ¸£<’7‰÷o:o&oψ·–·™·ƒ·›çÀóäò¢x±¼d^&¯€WÊ«âµóx‡y'yWyxŸñ¾ãýÌc(‚šL½Nñ©ÔjeL­¦Ì¨” ur§) C%Q¹TUEµRƒÔIêu•ú˜zL}N=£~¤”Ô¿éIôë4ŸÖ£çÓËéè ô6Úš¶£hOÚŸ£#éx:•Î¡åt]O·Ñ½ô}’¾@_§ïÑè/éïè_è1MŽ¦–曚:šBÍÙš 5—j®Ô\§¹Ys§æÍš®šÞšAšbM™f’f†f¾f©fµf“f§æ€æQÍ3š—5oi>ÐüLóÍšJÍkñ´&k½¥5Cë}­yZúZFZ«µÌµ,´¬´lµµ<´ü´Bµ¤ZqZH+[«H«\«N«U«GkXë„Öy­kZwµj}¡õ\ëg-f9IsÒ“¦MLšµÞÏ?<ÐÓÝ#Xo®Í®=óæÏ_ð爉‰‰žSøÄ=3× Ow_½ÙìI¨«·Ÿ¿«oðJ½õìÓÞÞžÎzîÞáþAzŽ..®.ªi»½]½ô6xz{úûû…êÍ]?OÏP_ß`!ûa¸Ro{ˆk ß=O_7O_Ïàp=G_½>®îŽz>Ž.®*f>žÁázKõ=}ÿ˜½ÝÓÇ)$HoÜõ¶û™èYèíruñv üûó@?3Wï`Ç@GOgGoo×  ×€Gï Ç`O?_÷@WÇ`×ÀñÁ Aüƒ=½]<ÝÜ|ý‚Çoyû‰]}Ý]Ý<= ôõ—¼1Ð7~9b`²ÕÙ¥íèìÌêæå ‰Ñ&'Võ…ñò—'FËÌœý|_^.[2AÝp‚ºÁ_wÇÀoÇà V&/oêO7Þçìèâãæí*ÚôçéC#›¿“Ñ7Znæèç8q¹|Ù„K7:²ÖfBª%†;|ÿ×À`‚»¡…£sHðÄ“ ñŒm^ od4Áj¹é«–-sÿ Ã¥êã¥zZòRƒ¥2Z¼¢9vÀv\‚Í[&X›Øø¹ûùºzmü›2Œ& µ|BœeË7»øÿÅ^0Z²t‚ã‹¿™•ýßö™›_]ƒ‰þÆ¿ƒÀÈÄêU=-Ÿd™‘•³« ë@ŽÜÿXøë]j¡bô’«¡ã8¯ÍÑ®‰ÁÆÿ\…±¾ÕŸË7U¾å&¦™¼Ì8è?D˜PÎ’å»^ÚpÙ„K6«5<ÁÞÐ&ГÅØKÎV¯¬ßüU”é›þeâ2“õ¯2X:¡•%F»^f¸|û+èOØÅd‰M°§·ËÄtcCkÖÑÌÿSFþº\ßù/Ü&°ºÄx×ßÍk2}C£íÛ„YL&¤0^b=þ€ù_?áÇË ÖÿÅÑ'à«@& áà ΰta p@ ~àk`:¼lOþà ka¼\@¸)¼o¤î°Þ…©@A$؃´†(O8Bx 4!RAié ™YÙ9¹ yá&œƒ#ÐÅP á\‚è†*(‡GPç¡  à Ü‹pz¡ j >†Ëp ú *à3¸ ×á8ôC;”À=¸'@-P à*œ‚Ahƒ¸× ³!”Ám¶ÿ‚ȇÇpÎÂ0t‚>…"8 Gá |O‰¶ïO%Òˆt"ƒÈ$²ˆl"‡È%òˆ|¢€($Š9QL”¥„‚(#ʉ ¢’¨"ª‰¢–¨#ꉢ‘h"š‰¢•h#Ú‰¢“è"º‰¢—è#ú‰b"†‰â0q„8J#Ž'ˆ“Ä)â4q†8Kœ#Έ‹Ä%â2q…¸J\#®7ˆ›Ä-â6q‡¸KÜ#îˆOˆO‰‡Ä#â1ñ„øŒxJ|N|A|I|E|M|C|K<#žßß?/ˆ‰ŸˆŸ‰_ˆ_ L(‰Qâ7‚!ƈ߉ÿ&$H’ä$—ä‘I“š¤9‰|œLN!_'ß ß$§’Úä[$Ÿ|›œFêºätrùù.) …¤ùù>9“ü€œEÎ&çsÉyä‡ä|r¹\D.&õIÒ\B.%—‘ËI#Ò˜4!W+ÉÈUäjr ¹–4%בëI3ÒœÜ@n$7‘›É-äVÒ‚ÜFn'w;IKriEZ“6änr¹—ÜGÚ’vä~Òž<@:IGÒ‰t&]HWÒt'=HOòéEz“>¤/éGú“d D“!d(FŠÈpRLFRJF’Qd4)#cÈX2ŽŒ'ÈD2‰L&SHD¦’id:™Af’Yd6™Cæ’yd>Y@’E¤œ,&KÈRRA–‘ådYIV‘Õd YKÖ‘õdÙH6‘Íd ÙJ¶‘ídÙIv‘ÝdÙKö‘ýä9H‘Ãäy˜†×Áë—àõðF;¼© oºÁ›åðæ¿aj>hó@{;h?·X¯?üiÀ¯·ÃÛaÚJ˜v¦aÐ)» »tãA÷4L_Ó£aú ˜‘Äxç¼»ÞÍÁt˜  wAz\л zßÃ{3à= x/ Þ»ïÀûIð~Ì\ 3Í`f | ¤Á¬i0Ëf5À¬c0{1Ì6„Ùµ0gÌy s~¹Â\S˜{æ*aÞ×ðáøpæo„ùõ° ´Á‚³°p-,,†…½°E}°è.,Þ‹½`q,.…Å?þ ïúQ ÿ˜‚Á0ø 瀡V€á5X²–ÂÒå°Ô–6ÂÒ§°¬–Âò¥°<–‡å¿‚Q0eƒñb0^ ÆWÀ$VÌ„'aå;°ò.|”«VÁª°ê9¬…Õ_Àšë°V¦ëÀô9¬Ó„u °þCX?fóÀLfÿs0ï °q-l¼ ›fÁ¦jØ웿†-–°ålu‡­C`± ,|a›¶%ÂvlOeÓ쨀—açrØÙ–»Àò)ì ƒ]çÁjX]kg°ylº`÷LØ]{–ÀžfØk{•°/ö €í`{ ì\aÿTØ¿ ößûÅ`ÿ ÈÀa8ÔÃÁ%pðcpŒ'cp*ç­à\.à"9¸×Éàº\GÁ- ÜÁíKp?îçÁà <”à9‡6À¡ËàU Þ+ÀûølŸÓàûøþ~…à÷5ø/ÿUà ö@ ©$€ Ãt ‚c!DBâ!t2„öCØ*ë‘%ˆF ÜÂë@<Ä ~£ IÉ— ÝÒà =‘69QïAT9D¿Ñ­Ý2#õAÌ|ˆ‰X}ˆ­ƒØˆ[qeÏ…xˆÿ: q6$~Is!i1$OädH!!å HùR0 cʃÔtH-„Ô§úR1¤CÚcH/ Èx™&ù²ü +²¾€ìmýäXBî,È=yó ¯ò½ €„‚(\…W¡ÈŠ®AÑ}{<ä¿@ñN(þJÒ t”fBPvÊnAy ”ÿ å¿C…TtAå4¨ì„ªX¨6‚êÓPó6ÔôCí¨ýꪠ®êgC}$Ô'AýehØ w¡Ñ] ‰„¦ h~šEÐü#4AK7´nV+h½m–ÐfíÓ¡=Ús¡ƒ„Ž褠3º¶C×èÞÝ' g#ô®†ÞLè-‚>!ôµC? ýÐ/†7`@>‡Á"z†NÀð..†>ŒTÁa[8쇇àð 8²ŽÁ‘5pä2] ǬáØ8^'–É8Ñ'­àägpŠ§*àÔœ–Âé8gV™'pÖ ÎÃY)œM„³™pöœÛ çžÀyw8ÿ=\ÁE>\ †‹çá’'\ ‚ËoÂå*¸"„«FpÕ®ÖõÕp­®[Á×à‚›¸Åþûn›ÃíÓpGwá®+Ü„{lâ ÷Cá~;|l?†áðÉ{ðÉ·ði <´†GsàñxÜOLáÉSøì4<µ€§­ð´>ï„/æÃ2ø’_qà«nø:¾~ _ ߔ·óáÛHxð Ásmx~¾Ûß9Â÷oÂ÷%ð}ü ?4À‹áEüh?ÀOðSüüüÜ¿XÂ/}ðëøµ°!àaPÚÁ¨Œ¶Âoá·³À,¦ÆöÀØð{üküëø÷øw/.ñÁ–6¤A>ÄéS”)DÊSŸ¼˜¦í¯¼†×ñÅ®Ò`‰ØÃÅ:ÜÑ›xë"³Z…J ]/*ºŸI+˜Vu+¾PŠÌé±”v;2—JÖ%Ð"ŠÞÊÂë¸SFÝïëV¾WFŒîVð¤Ëò#âK.ŽCÁHîëÎpŽãéí‚zQ….*“ç4§Ö¥ê(˜ã"êbR©ä9#ijT‡1`l ßKHܛȚUª ,3ÂsP%’Ë«Ûð$eé Îèrå5þØ> GE~Ä¢7+¨u™Ò"tVîd1ZXx+‹Å¨ÅŒ¥1Ê4.c+â}’P…ÖÑcRè©È8ž¥ Vgˆ+Ñ´r…3ƹE¼)£‹Ym´ãž.\Ð.RLýöNx±SÓ´[KXÕˆ¨‡ ÑÈT…{diœ¤B½+~»‡®—··´5•õ£!ÔÞå]ïSë_°¥øHay^U9­ÝZ]!o5 O1¦æ)ÿHh“ÐÚ®'ƒj-¦#›Pç`¯p§Ø͈¶•æ6 q· íååÙ¹rASgí WívX(d¡€”Óår<ƒž!Û)Ö•Š=cö"šðp…rWÎ|O%1ZÜR^îM¹ü ¢±€Ç(Ææq%ÊÉ‹_YÒ°Ž@Ÿã¢Ï98]yϼ­?Ÿ03¾š§â©ßþ‚xÚâo˜·„‘~ü‡§ç3ï2Ü׺¸Uu… ýŽD\cþÍà¹ë­#Êé,­Ç8ì!?“ññœ#Üb*<%%!Ú=6@¨¼@%¤Ù‰=d[źTNjÊAt{®ÌIÈèS®MþùάäÔ"kï3oÝ^ŠÉeƒ-­&4P\\”,:<,Pæ‹hcëñë˜;|ëÎÑáý»…ãðU°Ð°RÁ×OÄ;’R‹‚,!*FÂÌdBu˜¹80º8¾d<å6¥e <”ŸÊâ¤YD %I¿gÞÃÓkf…–Êdú‰,@N+(Ã4iºCãÝž‹CÏ~VSq˜ä¨[t¹LÅu* É%}Ó´û•Êh¾²’BgòÚ…EyE,í(Õ‘T”()“溣m4ó95ÆWŠ¸Ì¯Åví§Ç¶QÚ¢‚ä;Ku; J’Ò>¥q96é"¦9£À¼Ê åŇFD…¡$I—dÙïËÙL±÷6kóm®‹C¢E Ëï:³åK×ïæ¢ïÎ> ÃKMÍ6û#] dUv°ÃzØûs„94ÞüÖijN uî4yÉý[hUŒõ)—bË&å”3S¯=Ä!§iKr•ïòsS³Q.¢[²eû…c”ö0Ú½3žSÚœPÊ[›™ÎÓØ€j=T%ëa±§õ%ÖÀ³ðæO?´r´qÞ¥âÓlB="­Åºøõü†m·†×04ñ]»~ÿ®¶*â]žM˜j#” °1ßnÍAß­h:Xï{2¼#®9ù,Ïòb/Êê›|ÚìË÷ }h¸«ç~'3dÂ:Âe˜úæöi =æ^ÀÏ¿×Ò~EU~…KiUæëP~ÚA(¯c3¾ØJè ec*“ÇSš)áÊÇ*©0f ·†—;œSVR^Yß_t‰]LolóØ/¬#¥ª°™*ÛIÛ”ÿjcÍÃS®Æ<þ}Ô˜ÏX1ï00ö ›ôY OY*rÍxVöÆí÷¹g}|ãU†hcÞE´v S)âÝËa#Û‹f¾¶wc~N÷ã‹žC‚{6ÝˈÑr2Z±¯¯eÔRD;G±áI ¼ë¬rj]PÙTÖù#NÓ~€Ç”«øÚÏjí}r]f0oÎg4X%L½døõ©ã5C}B† œVá³ZŒ£‹(ë‚ØÔCk?P~M­c>壠ÄHYlˆèP”7òFþyae^õ¡Ñ%ZûÖ:zëѹÆC›Sðc6ûÎi">eÃÍ9UþÓ¼SŠÆŽò"™o© 8 @V‚èJEie›CÍŽm»ý턱î)+i¯O˜Ë<´.:j½*ñÊ)“ôè|t›Æ—ñ6.e —Š.<¢ÒçÃ8B¥Ïgøîã×$—¤Ô {èX^oÕ™¦¶³èê‘vø×;÷-­[ÈjñS"âÝŠÍ“¡õô˜9…ŒbekâÔùé£tIºI+C5XÍdg×âçöðáÎ} &MM ¨«°vÜÛ}» /ë©‹±@å×xß·ƒAÌLDûól‘cf\vBzr>*¡1‹¨O<²Ð˜®Ä’`^œS¢$Z)ö‹ÝÏ‚xäi‹ë²²jx ’ºš§Ý›„grÇêXaÿ(âþ,áÄÊvÞ¸~ñ÷ωë9ÙÊéü¢ôÜÔDWçF8™t í‹‹ÛÅ*/NNmLËÑI‡PM½#µY¹ ²|A±4?¾ÑUò’ºæÐ2OGß`3[á—lüßâ¹S¤;^¼Äç«ñ¡Î̺©èšï§Øünmí4mFyH©Ãï\M…±1-,;$GÇ?Ï?3€U.^dº^ߢÖõÒ!¡(<\ŸpÈ72 …¡Ð‚¨î0Z›1ÛãÈmúî{ßܾWÓsDÐÑXÒ„:йý=¦é ?KgwZ`.*FeÍ­µ9¹)Ù)éH‘\˜’…ÚQ—¼±¶¹NÞŠFP}B¥´‰fâƦó›ã>ŽFôÍ‘î–k\îËú¾Êìž¡6ÎÄ_ñO×µ4Öˆ}Š¥öÈ…¶òõ°ßáxñ[ë‘Œyéhןá`Ô’YÂgxé+ûVü|¥°­d ëÖ¥Ž/Æî=óþ€êXá0¯ÁäôVA§cSØõ Ak+áÉñ$gƒ-›¬²xÌ磧ø½h@Ôê}Ì®i>b¸h®ï,g{7§=ÁÖÈ9”¸7íôúaMômýóîî¾ÁòSl”‡õÙ¿ ëgeŽà³°¡¢V†KV²€™Å¦.S—w^…˳ÿ„ ‹mãèñØ¢Âöê ¶öºAc_<‹z€J$+Xvº²Šˆr¥AYdÅTt›\cc¾‚/óµ$âw¸Ñ¼ä䘸””D¤diÑ™lÊ É˜ñÑ®½ë­šœÙ Oj + BÞº^~{=½ +D‚Ðê˜ÊÈ“tOÛ‚Ñ/¤²ó2Ò XÍ%WƳâëjKgܽpêÚHPóŽ6!üŠ%Õ¨V·«±nàdƒ§a¥@]¶Ï8¦*Û·³±ÃËïh(éDôHµ»¹±¥ÐFY¤e¼ºn·É‹ÏAWilGýìxlÅNÇ ö|’JH÷Œ ŒµŠÐõåFP©é(ѽ9±…c^¬'ÅÇXƲó½å”e–¬€?^T*TE”G/p¤*¢ôÎQð]ÓÃò|['œ¥s¹°¡ ¹¶©FуQod{@=­}·ÛÕ¸fá í~¦^Ä»›ÌÔº—E­U ¬î3# UºßGHÃ1ÌY.^ƳS>ækß­ËÏéÂož:¸p_¨£»H`à??Y•.¤]ø|)æ”ã»Æª÷Œ3ºÿÊgrÂy½II±ò˜¬`tf–S^Ûý×3Fs0oÿºî‹¾aAßð¹Ú+èuº7øûWo§+y±Ø‹…KC‘ E¤‡gÛç`µŸ-¾æ0çÕ®=±Sxy÷®˜D~³µ«•Æ:]Px*“ž‚Ùòµ&â$k’6œÏf£y^Jz¼ .&>&Næj}Ð."1:.>% ¤Ôäôdú(sŒgÔpðôpGÕ‘fAd~h X‚tÝ$µç…¸óŠ%Éúü â>Kr½ª¸]lÍ•°ugAZaj.Ò­e ­—EoP噜ڜ›§R&¦öâP¾p°Ÿ_Ep]}eE}]p¥/›ïŽF–‡¶*·•ãùÝSëcéÓ´‡•Vlªå%GG‹ÙųmcŽ[‘[Ž:ˆć|=¼ÃÑ´²Ï kì¼ázÄ©Ú5723ÑÚ’Mûì×ZÇSö ‚yÚà Œ·‚—ª((’#6º'*â:$]±]lÍ@=½ÿã'ÖëÂ÷O9ö¡côñžŽsý="÷VA£WQ@ñNÖMÕ-÷pnWŸ½À'^p°+følåŠnäçßÍfËÑFu7.?z"=É¢V©\¸QA­ÍbatÆNø³çŸî¨«¿Sav÷§”üiÑÔsñ†‡ªR8h„ŸÀ³f‹~ü-¥}—1óÎ%ÈÐ>š‰¢_‚Tíâåƒh¯–¡v?¾ÏÌ–RCIEdO3™ÔGC{o¶w×Ö z{¹ÆTFòHY[þá"]Ö¨Ê{/¼‘µ©ÒžŸ¾3Ø5rg8ÛPd¦ÊÓä©yH·2W̺áëZ“/“ÆJ‘ɲÅåá•Òܶ§‡xuÃäé;ø}áÞÑ5ÿdj6+Ÿ÷Xƪ1{øcIZm¬RK¿‚2ɪòyÎ1 óPEx%CÒU¼x¼š;v–ϬæVñª0Q©Àlìe“©º}eiQªÂlmd”Q’ºã5I/ XýÞ,*|¨jFDÔ#u“É*W¹QN(TŽPÂkJ’ËÉ’e‰²¹LÎ,œ_”T„rÙž&?»5–3{%TGr¶làüÓ¥“Ÿ—›ž›…²Pv¡¼¿…oéÔ_ÉÊnH§ÕÁФˆ¸ÍfùQŸu Vƒts^¤p,”B{’’Ö«²|¤œ KuNc+˜V]lAa=fGzbZRZRz’nŽ,=%Ð11ñQ‘ûÊyéÞ ÇÃÌB¼[§¾öú¥sõ9ºòŒ¢4¶Ë‘3¥¼Î”üD$E±1RiÛSNÑQS‰i®Q¾±–º>±ãÕtŸrTA|þÿÞÇQbe½((þ$UŽDDÝ‹/Ash†í¶6ƹFøøÛmõ^‹Ìm•ÿ`xS\»ªï¸9×UpmQ÷ãY¸®£™‹cúÀ¯ÆÄíÖ+‚ªžÜtW•¬¤Ê³ä Ö@Ê>º™Ÿÿ@µ‡Ð%¢>QÏs¦D…Hãsªã²Öˆb¶&ñ öwìö9…áì ü¦ª·ÖÖZª%./‰‘$>(Ú߀ Ô1ÂÁâ„P¡.ªÈÏÌfmå ¡Ú ¢Ël²EÙ¢¬p}ÆNg..JÌKÎCyº¨¼ §%ƒ}j“„ªLΑUìÅ3˜ot |r¤YlºÉ),¨aª8/˜è"·Œø,¤›2s‹»Ø¦ý;ÒžôÌ2–…: ªb ‚µo/?µ •m»›ò¤lÛ@!i¤Ekáh9e‘•‡ŽÓʯY[ì»Ê6ˆÇwœN)uª¦¢Ï6|†g>˜¦ý•rû%¾X• aý(®¨OˆÙhq$¡^RÒvP±“-Óî.4µµ. «¬*/«ÈHÉLÉ&ç¦ä lº¶©¢k¸Ö×F°bmÇt¥µ¿ “zšnÑçp¶¯»üÈYAæžÒÐnÔÂ.¾µƒf³í€wBLhTÔ/&Ñ~-½Â 6kt·áÉ}ôx>:YAŒnSµýŽ"Þñ¤Òhä‡"âü£|˜9cf>þâÐÍØJ$×EŠ¢~ý F/#>-Åë¢ð¸ÄCªÚAÁJòîâÚCl¡úÇQ(ßç¦ç¨¶=kr#ì„L– S«Srjwš$uÒ¸•Bi9yÙÙÕ•½%­ˆî«ð`+-¶ŒŽÞ¥Ê½ÁrjWª¤£q&ÕÐÛ\:€è“¥þÆBÆB»bc-ã؇üäT@šOZd)êÔÅNÖr9³Úro€¥ ü¤g­ r@~Rc ú6—¶Wäm-Qµ²&å¤óÄ¥‡8ì3^8ºŠŸæ(ñÝ©ë«*ݲR3P6¢»rc…cÅ”÷£Cc˜Ä3ñëk¾ž³ÝÒÝ6L°[£s°íȽ‘Ŭc·ÕdÏÊjÁ”ßÌÔØûÍX…=[ïp‹= ócÞd¾Ôatð×É™1)éº1åñ 6§WUæSa¯LDLÉ‹iYÙl¢£Ç´2(_‹+Mß›ª(Ê>œÎ>’,¢'ÈÃÛb›±<)Wâ¥c+¹rÞ#\”W‡ <¨8’Ÿ{4O•_~aÞã_nî?‹ÎÐ#<‚‚=½*EmYÙ©©Y‚ì4„RÙà›ëåçfã¦jÜ{p ¿ÑÿƶnדVº i)l›™‘‘Yètzõ3aRF ŠÏ­l”—¶÷Õ·Uw¡B:3!3!>4^•A UÕ õAªJí·…ÒN<©Wy ‘@ñäëÊÉ]œQ³›üU{#7±Èjf ~¯ûªí듧…Ã×ko²µ~›y™7ÇâÃÍ‘òÆìÔÌÔ,áEœÍÝÀ“¹†tKò=îAäáé¹{·÷6ý[tÚ÷ Öö·²Ú}‡ýÝ#ÌÁ|lÂÌÄo1Ûf9³˜ÙÃXã¥Ì\ì|m¤°ï™Y¥4á×%˃’]’íÄ;ö‹Ü}CüíÜ|äXéHK‡°®©µ¬*y¼Îûø>ï]ãàÍÊùx/¯e¤¥gw<Չɖ„ÊB‘.ãÊcF–’ŒRP²nBFRNSW\d·SnG·¡¹ôüíkW…‰³+|^•Áyl¶ô•FºÝ~x£öðˆp ¿ü$ºƒnˆö8ôíªd´ÊU|ñZÇ+mø©â´ÐxßHOݸðD1Š¦ÃŠÅŠòREyVRaB¡ ²5®ƒäÙTvRELyxí!Ýjï’¨RD—É+j$ùÙB—,¯‚€âØLá:Ev_vGVa>ª¦+%Å¡q¤_ Ð'0$$*.Q§†BUYuùYŠŒb”O—G‡…I$aQáY¡‚¼C™ÞÈŸŽ¤\ËEŇÚª¢rØš]$‰ *“ÅÛãdŠÈü8§Àˆxû˜±â(H‡EVçf*JõÍ™™9Ùy¹Ù™­¯xÆI¥ùÿOÏÀ•¬kl9ŸÁ>S7)->36;&WקƷ.9S\Zhæ#«ê=„·%ÆÇÇ­]pp‹ö„ŒÄ¬Œ´ÔÌ ÁÉ]í7Ï«ŒsSI6ŒÏ7Gy‡ïÁs`ÞʈL•² xcþ{Ì ››zgai <²=t/ó¡N o ªâäÉ%H·µÕUµ6(j[®EæèìY븩vÓ‚rÀ}:¥.òÈjDW—*jZýìBÆùŽoÛ/êg;ßÇ®|RRWªÚ`eô«Gs« t‡ƒ0ÓøËx‡"JZ…£K©ÆÂÂ&ÁçÕŒû隣;WZ§Ô ÐW8ãsŽr×èZ>ÓYŠÖíe`õN†‡˜éhií’Þ}ǂαÎ÷ÆãoØ"õ­uÊ!4ÎÕBX‹ç³¥,`ƒšqb:ùGÖ³ ”tÙn¾Äæk¼øpN]™\X^ܘ۪ÚÈ:ˆX»Kö»ÄÁi¸“ÏømÆ~Œÿ%ìÏ1~سJ&åÿ=‹0Ëjÿ÷Œ{”-¡f7c—jâÊC¼ã!§Q¹Œ…¹ÃC[£#­’Ù:Ç_NYeD±µ8þä1õmfÒn!S¢jub¶%¼¼]ˆ.ÐXN¡ T™v41]Ç!Î7IõšA/õ¥7f–õv6ô£:¤ˆ¬òTøªvÃËå%=ûêV¯± °uú8E»Å¯¤7¨”[çÿ°¤ ÛöãúÚ©¨æÑ#¼à³iÚQø™R“ϼɋ½’ÔŒÚèÏZŸi/{¤ RwçH]_^ÑxԪ˔™´FŸ™”&Ê êÀÀ+c椉Q8ŠK‰OŠeD¥²í‚›½PûˆkmPwk¥|°K µÿJ³´wÆê/oj/¯ªèC%tzrZbBlB´Làåé!±G¶È#gKmž’š‰ZSêtjñdŠÉa"ùUõ²ØØø¨èH–&ÛćÍË+ªJ ›Yl”–¾[FÄŒó±è÷ Ü+<&|tƒêØrå[„Ò†­ÙÆx¼Ìœ’ØÞ+¥…Ç‘.öá1¶c_q/ò°ÇèûlVNÿôVTáÇ1l*³Äfü~¥6Ûgå£"Ý#¢:ÏCa>ûƒsMò× rwd©v¡ÐÉ^¥*¼}&Š‡ j6“I›SÕ¼â{¾O`€·ou`}cMu}c@?~ûÿiL ³9MØ©–¸úï|ÈiR.ç_e.ñÐø@iŒ,N–ì›ü²òÎ’ ‰w2O(d+‰Ø£ªÉ½ä”M†,¡•Ï¨„´Ø”èĨx]QŒ4!% Yº$Ó/ß7+íGöA~.>e.‰Kh3þúmfçÞOå#}±þ¥…_aL%[dg¤eª6úVªMƒ²¶±çíc­3Ìû3Úàw8-l´ Ä÷ÀÇTs±ØCøûRÊ[é-6£Sꦢ;æ·°ßUë;Ó´Ÿâ^%Å×¾ûÝÑÖž+Ó?YfC¬Ø¤¿EáûóböSLB¼7NÿðþFÌůݽôã]Ïafòç‚ðø7÷T¹#+zË[Öì=õäBEÏ©AÁð]––á)÷ÓOõwŸ¿Òë°a—ß]®‚„$„“Æk–Ýç‰NœÇ·À)çÙölzôð$•ëùÙ]ÅwrÏ zÝ Qip(<8B>¯Ä@ÀÌ}û¿Üa.ª (ÇGêk±¸f*ºŽ-«NÜÀ»*ïª>¦i;:ºãêÃûLÉ÷ã·W»ïy9¥ûXãÓænaymYA%¯>ì‡ œ®a«Lïsبëó.ܧ p"«Ò]x ›ê=É&ÕvY’‚ÚšQŠ®Ñ7±icz‡Ê.ââ]ÌlÞ—Ø¢ýjCíá|¶eÞ#*¢Ê£D²qŒXÈh0þŒˆ-N(Vm¾”•æ ªz°D5Tq|î7Œ©ó3^ÉË–r×0ëœYIÕ–`4럩˜Càw”Ãhüh9w±{›OÇÓ*K<çÖO-˜wŸ£\¥LâcåYwPn”GŸ÷´ ,âübxú‡9£ƒh±G—[½_…äº3Í´R SwýLK˜·ygÜz¢&ÑK[žP·  Úê›ëÝhµÄ¶E•vû—1“¯Ñ8…z(ëw,YN3›ñO„U³Íþñ––«Et+óŒÿ•e¹?Ú†6»»­’Œ‡èeŸ™ƒç†—ÆdJnhd”("_R%Ä‹>T¹oÓÜÁbjs9)÷óѱŒª²‘ì— © ù"Aˆ…H8 Ñ?C¤8£5=uiÔ—zÿ‚})ó<Ó%éŽÅaÙaãGˆJÂ+óK3sÂî’ÒŒ–T´;10l_œ(AŒdtPEHUuEEU^BIœB6’XŽ¶¥È{ÄŠØÒ„|DW–”V×F”G…%ĉ„Ž’$Ï$ô<¯§±Õ§=z õ›–¤â¤nÖÊ þêìÃb ëãoòÌ-Ç™åXVÓ˧¢£¢óO`î3ûQG¦iÿÏã7ùÚ?®½24rí¨÷1Ë!!ó.憕HëQµnOKýá–:ixRRRB‚@û'ˆˆ’EDL, ¯mR”5Ÿ°îYglµo½M™ÏÇ›²TàˆÖVFo¶Ý»qÝðV<ÅHxÁ¡Ú ¹Ðû=}v»y²ÈÈÌΰl‹‹² ‹¦W…–ú{{[q¸÷ääá;‡E k/ fã|~#:ê5`Ï[Ûâ©80ÝÃËÛÍÕµòÌgKT%j ;ëë:UÍ SÁòÐíh½·Õµ¿µª²¥1¸Ì=>.%%^—ŒØ¦™ŽÏÊi®k;Ö®‚s<Ûp¤°>ð+[å]mé=óG•âyè¿÷zÊ{ÿ…¥5£Skô-.üVõ}‘1ß9ŠÝ<,­\ 1šˆ!šÍA«v‡ÃA§ÐaÔ[ÒÖzêx¦žLcG}ü3MÀØÏpWÆÕAoÙ2‡_± öèÇœÇÂ)£·"ËcpAKqö¨®jˆ/c+ X}ñ¨™¦þhÔ€­®£É¼¹jhïþöâÖVáÑcÍÐ=úŠkçA¶¿£ÉÝaWàF×ýB/g_1›nÜk:ŽÖ}Ò~DXÛUWÚÈZmå#Gü9ß…g³×Y¼MUmd•ÑÚ#*"3½g0<=f£m~t×ÅÞþ²Öfá‘£M÷ÑMT”\PZWšTúPMvW%óÓïÿÀÔ|üqò ¼Â ÁÀÙ÷íó¿ÎȤ;ˆ: ;ëžÏÓ™ÿm}^ ÒEòfßÞoŸëØ Í›ïRëZ`‡tmÑ!Ùßùßêì³{>Ï×9ÊÙé¢ýnõŽ46Ç üû7š,ß²i…Éæ+Ÿ>¼tù!Ë7øÑ-þ‘YÍßPÒ z‡è# }*ªY«¸]¦¨AŸŽ_ß®h¸ZJçS›Sâ}Ã}Ã%.hÍl yxð¦°Ë¡¥Ah͘SȪة.¼.¼6þ’ÊcÏ*›eüÔ˜1¶R²\ö4“s7«¿ ^<æà>Õ[f›ô¹Rª 3?##­4»$#môr%^BÕ ²‡bƒ#b$1Ò$GÕ†|½œú(5" ©*ú)£ŠÈ#J²û6±©üÊ}lp”3j§\Íg¼Cy# E2äƒúÛl]nuÕë°Ãã+MÕ%uå•…­¨™¾n5òѲ—¹æxÕ®¸†¼·}¯2Ò]pq×/ÎT_º-8¿e8຀Nö4\—äëx9‡°ÅÚÓh¶ïtu{㱚ªî²‚‘,zlz>ß缬õÓC--î¶VMÖñÏ0¼Vë“æ;÷;‡;"Ú|ç…»{ŸœPµZ£ï³©è¶*Æ¿‰Wr·ñ˜7˜•Üžü#žòß÷1‹*F +D •Ÿh]:uIõbZÌè[üS¿·âE¼5YQã_k©zuqâ‹íbŠ™³Íšy{Eå®A/asP]ìùdš99ñ}x^DmVÚð—åzF˜-Õ‹úëËií¥…%Y]é,|7ýðß[€)x¿:¢KœËRþ¥Ñ ªmŠ³øµKxú%BÙ¨|›?–ºY™Êc¦k¨OTf¾£¬¼Eà³9J?ü.?2ÓmWd [0±<ü6{úUçtO÷ûwgZï qvc{f‰—جþ’€òDî›ýÍç}±ßÁÂ]â(ôññ“l ÿ€ C¬ŠMí|ÜìÍ–zÌOJÚíó>›ÕmWrÄ« Xgåy¿VÿÛA—£ï ïÑÏ…ŸÔž«;×Ðv㔊€²ï‘¯|ηÁŽQÿñ“‘öïð=þÒ}\[êÉ—YIýý× ¼úA Ρðâ§ÜaŠYlÈÅ«þé×%*Îgî²¾Þ8º€ï·&0ÔmEž ÒË´//uov¯ڣK4ˆ¢Ã¿Ð{wtöh ß–·^okÛÂͬçX3ï03 ù–š}ÂRâ°×ŒPg˜wÓçÜ"/#]¼ÏÀïc‡‹’‹þ#ÂðVq™S}p+¿eK¡2¤«l–Õ±tR ¶ò=/DGŸÑØê< O;Þ#²ï¯HVŒ’üÀàà¿òںʊÚÚàJ?¡ê§ ¸¯ý^^ÞæÓ6a Üóý4í_Gï+KùlpŸ E›ÓÂSiíïÒí’t†1Z`m»ÕÊ5[J@ƒÑ™#û®øßBE¨<µ2µ+íLZ¹ªÿæõá¸A¼½ ܽ-’™7’uR¢òP;“±€ºŠÊÂr?¢Ëqd(/É-A-‘„ºË¶!z&ŽæiÿZž›~Bp˜‡§¡êˆCzì­±é|3__3fʦŸð.öwxïUUOµÁkÝøË·ß}ÿçÒ?-Û½ý÷EãóJÛ`6è&^p“ƒ—°PÔßf¹|åÙŸ\ºððþŽãË…1‡øCÍ6k­½íEQˆú˜.ÔI÷×Õ÷ªx*s[ð´©>9¬víø6ØXõ:œ8Þßwüø~kaª'¿µÁÇÝÝÇ×Í÷¡­­¡¾­ˆ0[<½QT5=Ùòk?˜¦}ð"¾¹‹ÿ.ä„ÜÊÄ ¡ M)ßÑXÎÓþó£íŽÍžaü¢xÒÚ·›]} lgèo°ßæ["ª­+VÔ§SJ¸ùB(=%=¡¶±²U!EL¶4G’éœl¡³Ì«ýžƒ£ÓŽé[†\i)9qEв§#ô$DÝÅmMµUŠºÚÓ4óÛ>rÏr+tKMaW ¾ÅËÍͧsèL]žÜ'xpŒŸùYuÛIt Uº¥-UùãÕŠ—²N1ý6çù\~vBNznj>ÒíËüCÅž¡é¹~B©w}TebÒ½;Ôt¤×«ÆFŸ’,V_äzðþx-äþjœ Ú6ÿ·*¡ßþ¿Tp/ù>Çÿ⯲á:P÷Žq™ˆz÷Qwrû¨Õ»¹Xþç;)YÔ«/±¨”arâ)›VOppø:¾w€HŠèˆ’ÊÊÂòÆj¡=ÏÕ'ÂyÑ›uw·TmüÇO_”›•ClÅ»‹!< ƒ2±1‚¯ÿ!óŽ}}¹«°Ø¿PÒâ¿ŽÑÓiç]į·FT&´²BûÛŸ±pH:Ô!Œ¨Š,ð® ½vðë­óÐVš¡6¬õ .h„6ñýOFBWé¯Ï]o¬Ô þ(^F—ó=yÌ”˜É?r=yXUÀœS½Ä'«ÁE*´²âqFWâYüý[=‚ìò( oˆiO|Bãl^ÒÙØúàF¿N»Ê}Èy„9Yí;á\¶MÉÅžÞö¾¦h Íè>Z€'_鮽Ò!hØØæÝCÃÝG0ÐcŽ¸Ÿ³Û˜™Ç¼æa±ñ#§ÇxÕ‘¢ceåB¶Um<á]ÌüÔOk»"z ÙÉJèOMùM2±a÷›d|Ã.¦>L>ʯzö!6²ÿëiÚ¢›ùÚ"´;:jüWm³”ÔÅ–ž#'[ö,]éã´%Nš›ˆbPtnBe ­ÝýYRßfÆôå!E±9É‚äŠäÊð’¤ õ?Øåsòûû1q"dĹEèU盿½€Öþ?Õ]XW×– 3ó¥hÂd$aSÕ$Æh4jbM4±Ä®Ø@•&(½÷zé e餋‚ÄŠ½ÄÔ˜˜Ä &&gðâ÷ýwvYšË²Xó?äy$Ë–Ù;§¼§½ÇñŸªüÂ3ƒ~™yðýéË6,³Ô¶7&¨ˆx ‰qݸ%¿ôB*Œ-qHUçßkÈ>hÞGl+û¼ÛrÈ>”åì_ §Ÿ'jqÔX7×ÃÓ@h§ÕM ¦ Â7Æ"1JÏÜ_~1·F¦áašéá6Ï×9HÑ¢¥Fv~ÉÂ÷AÌdjV@ØnxÇtÊñŠwŠu wX-µ´Æ®^®.ö¦Þ³ƒUÁ™b¤GG§h_§`0Êp‹Á´T㌂3jø Ñ­<^{'¬ÉUGõËê/ÈÞ‚ ~.çåãà…Ï È<ÐôÓ‚oµÙ sVZ­uNpKNÇŇ fH™،¸ôŒxWkíõôˆuî¾Ö¶ {ËÝÓÛÁaК|«­ù¹ ù…Ú‘æq9(%Ded0¸ïnùúúø:ûxº#ÆÞ953;M|*‹˜Ï·m – ¥ÞÛ¦‚öÞ¾À°W•ÏÄ­Ÿcf31£–%®¡ïîúŸêKÖÏ%¢P””w˜YÂÚèuä{k|þ~S—'Ãkû.&҉’Ϋá/ø¯9¼ ßHªæÃð0XD~>†a°áOà3i /GÝ+§(Òw—)DáñæsûyrßBbÒNîzÔשÃÔó‹/Cí©¬SójÂ-†X= ëãµ0cä©›{iüÆ>“kÒ‚éj•ð§`)v´ZŠá¼%—šå›è­ÉŽÏqMØh1hµµõjGÏðD;m§¡žà@…ùf§= zuÿÅ=–e 2DìÄÊÍI¹ƒvè–Λ³Özº‰v–SAeJ|)Ò,Jw\o²Áî[Q× äͤ@»¯äßvÛ@îÂá†oÈ]Ð#ÖaGëp±Gë°CYë€ïñW96FÞ!³Qr„¥²‹oªPt†;0/cµøëe;­ãuÉý~õ³ð ¬ùëx½f{rq©h_Ñïè”Ë‹z»íN™Ëª~Þ¥±.Øòeù¦±3#5 m÷x¹í\§‰_û¾p½Ú͉\ãaDChýé“×gnµYÕ¸œB§˜[»êOiËlH}“Ä‚LkšØ?{´!¿)cC؟۬ȟOdEðWðÇþ¬¤þwˆ@Øò]º°ŒX‚åä·]x¹ð,Ó%¿‘ò¸®®Úã° _)(Ä=kš/~µ¢2à!8K\ä¬cª¼)ô!*±YH½Î¢^4¹Ž=£  Òʃýhd€Ð !™4FkòhÓ´‹.]îë»,Ó* 1G¢)›T›l«- /iìIË)F»˜ºU%ßjão)j@Í‘ÛJíÌ´^ºp£¹¾È€ª‚ßø4 ŠuÚ‚Õùð) NçÁ ü|Š‹ ûÂçð&~OÆ£±‰U‡·Åª_ðïH)cB+†Š„NC5F˜Ëê0…òp1-¡ÒðgœÀ?™VÈ£±XßFg•ªiÿ0]{¾sÔ„ñ~ùLOíåÆ9Eu>6/æA )‚wΩ‚½w9ªfûžûn1ÝòY&;§#ͬGùŠÆôylÔ]w£&9Ãb¬»Kr>wÅŒ%Š© ëÙª˜õÚ{®¼g7!þ³ÕÊ£‚生ù€T–E*h ¬Ý¢ z$¸?{öø õß_¼|äð—g×™õ­Ûµ|þ<½ éí>p`çî}¢6¯z¶IåO¡€ð‚œk=ÌS6DyzZãpN‘G¦<7~°B!{®š2Eð`ò³R%9+ä‚î¡&uEPö~Guao svP}¡ÙûDe(ö¶ 4_ZEä5JFomJtªîÙ¨Ñnþæ§CèXH§òð!ÇZB(°‚âÖ©‡ÑÇ`tÇ©‰¸Â’Ô§!±0ñ\÷™Ñg(®˜"òªHä•Ø›÷2‰Ùò<Ìû5þ‚’&CÊÆ›+!¥#!Sñ_p‚ëi¶¸•É¾'V¦â¬LxÉ8}*9<(Ö~ó¦èòŸŽ(&h/LwñCM*°H0¼ÏÆéð?([®Œ£°¹^fÿ¢ Uœs”«·¿5Ò|ìl§TöIPô4Dÿ#Xý„áN«‚ºø täœ`Ò»…Ï™ ÿ~^¡¾¶Rå]Ò¯­ty9OD—gÜ ]^Ž„.ï£æ{;¦k*uxk*uL{*ux×T꘮©T™âl“t€—¤õà™(Ï'̓•lg º#–¦¿9¯CèÆ[DÐÛ³†'»f <»Ë6V´e 箵žnªå”_‘šP„4KÒ,L6Ø}gÓ†„Ä×M'b<odÿ|"í 9ö–ÜÌßOr0X›.Õ7©ì’ÀÆgàsfÁ1e1¡@¤%*‡ª2PMQ‘Ä©ÂAÓò{`ÛCç%g¶2È( ŸŒÕ!§ðhíñTðÏ›â¯D1#ð,.;** ´­ìÄ÷9Ï_R ?ÚQ¾êÀP F$òûÉ‹ ŽBÑñä/;%kH‰'{æÌ ”c·Ä3ÿÁ`¼ñçrÂCE=0‚Pæû¥ª£_¦ß€%7b“oH,2 ß lÖ¬±])™,5/Þ'‚£ZÞ¡‘]£×"†½å»Æ_ß~~Ò†¼Íâìê\ÿ\÷=Ú6”æ/+±­&`[nùáÐ9V»PÊH(¬`¢i[{_WÄØy¥ì²®^  ¯ƒW„ù‹å ªÚ^¡ƒ¨z´¹¹e”Üq $Vùóq Þ%»†ïÿj—MBÁ[Q$ó¢dÝ%EÑÝ¿ªž' íîsˆšeªÔ\„vöªný\™ÀðT¡ºÜý·xìö¶ov+ŽÓÿÍêñQ…Ó‹Rq©»PòߥD7œ ¬ÖÛ?þ+iøøêÔ@Ö]ùB¯¬%dk/[Bž¯j‰‰juL!6•ï“ªoŸ†°l8yZ¼›p»©b”옰‚I½ÿ•JÅW¥¤” ¦ ×SH¡å~ŒLN¥—G"$L LžÌÅR0ŽªaO™{ûø[§Mj{ÁÉhK||E“úGãÃäæVï9PùÁÙŽñëJ#]/Cò²©´A„Wœð2ZmR‡5Mî÷b…|Òs ˆZ&Á"¥SPÿnRIS~¼¼.էƜµšWÈý€vþXXšª'¥M‘RÈï†B6¥W²s¥MQ†Bv7´È½b)%?¤>+ÿùMÁ| ÛfpÜZ¿õP|“㘪~êÖ@ö|Äâ"j£wn*Ⱦ¸kû>T…ªMru¬bÖEê3Iû ب9Q~¾î(ù…ùCzajg¦…ÿƒ>ÂŒ-ÏèQÖ«ÕNQÁ^ȇü¸!¯÷ݯ¾o `º(÷¸ Ïå_Ãc'd.ûm§š$ñ©ÂÞ“;ÇGàF™#f5_‰ûCßfã­*0­Y—ƒ4ê$*÷L³;EÛŬ`²)/øR­åw ÜZL°Ë0µfšªcµ Ôº/×»`šÜ˜Ë¬„û­™{¯»qüM_>‚|(Õ¯ùËšJLj®p+QGYüÙœ¬T@g7ËÉÈÕÙÖzƒ»%²Fãì²ì²<óÐVæBõŽ#ûJ­§oÖÞ¿€Ë:šXÏ°IUY›S+´ Q¾kÎúË3b—G,X4y‘AúíUÚ«~åX‹F=“¤%ZFh‹¥…•…›Z†–‹7›o6/u©D'PÅæò ùË2×%¹‘·³ÍÉõÈ×ÚŠÊ’ K‹J“*PÚï\aZlZb˜¼é#SïŽí,íu™~¼·×fhÚ;wª ërUõ"y;3ó£· æ÷ƒãæAÖþº¢ïw›$.Czh­³©©žžõ,4›Á/]ó÷¹“§Šµ+®f% âáÿÀ'x¨¡…¯ým¨iÉ9bM7ݵ mÍMíͳجú z~½RTàb‘/Š@(\ x“Í¿Áßp–ƒ™ÇðPjç­ùùsp5\<B©éûÀÌ™0”Ò~`ýaè¯ÅÇp(Q o”¦FR°œ/à_R›Máeøj°Ÿáð(8ãàŒÄ‡‰ã^@bv‹J¾„·X`Æå'qÀÊå´U§1}sˆîÍ)*×ÆÓzA‡kF¯2Y°q1bÆ®9þ£¨ßúù­-á·Kx­ jU ¯„ښׂN:kâ j1 ƒ°Z[ã¾:зee­$ŸGAô/àùöß©½âp @‰0£f•¸ŠÕÏ_‚‰ BÁ¬–q;'PË×ÍÐvãDzFxõn„Òìe´'5)1ÍÞÆ ¨‰ÈÔÓØÖÄÎA™£õ16)Ž)Ž›÷ùb a±.$@?qþ41®Ü—( Ô9R/ɱ• ü¤´ì¤´q8qçYÁŽv"ñô¯µð–Ð|"POoâ—s·ñ5ªW$ÓpûvíÇ;äiÖJ\'ÿñiX¡ÃÁ¾Oq±ËË¥ëJæž[À÷;d•+ì¤XÙK¯ d—zÂq~g”±–Øü7¾ÖRˆØLO¬^7ò×ýÅ9»*µ…«j[cB^ÐeI¸´ÿ⊴ÿbÞÍÙlÐÑAMû"ºÓb”oûJ·Y0ìOG;w - äܾÑ^®ø¡ñpìºÚ !«å™_R²ã‡-’ƵS¦êK72%ä¯åUêÀD´càmHôZWÁˆñZWzw@¼³`™#:µt-ôŽG;Áì4ð¹Í^[;½Ë¡ PdÅDC™rƒ–/hëi®’;8õ™[%”Uþ,IB’„¹(˜ø3ôÚ‡öØ—¯éer±çÕ9ËvX\¸ÃÀ¾Jªßr•üïÂa€“ðß@Ö•ŸZÉa'ÞŸB ›â.FH%÷œ_¼ÄzÌ&ϧzzNòeL!&=Ê3axbU}6ëÚ‰é`>Œü1ü¢`0ÚÿدY¿+ñûªç@üþó ǤێòH F¹ðÞ±bõs Â|Õ7<Ë¡bqBy(Ã^H !øÜÝ•>㈖2xK7$è#éd”ždo`= ÐHÏB×—èü`qgœ˜ao%ïJ‚ùÙ~6k¥§Çe—Ù$šÌuÕÑq¹ëš-]ˆNm‚XE‰¦B”Âß“åCN#¬Âñv´t7Ó1§Q*ÉiD÷°›£?†˜‘÷J‰«¨'ßú$ÿ?’ ‡7Htàý«ë<¢Œ¥8Ù•’oIZí¹ŽFá¶Ã20ü –>ºo€lÖ“ŸçÁÙøïç°‰à_Óýœ»Ï¾WÔ}öÿD!þ…ÿòt¯PŠDW :ot©8ø/Ùé‚=ùRe€ÄƒÕrÒN7Àî‹`¼V#‹Jº¹ùG"D „þ²àYšØæGZŠÚýÈjâ>mp_æÄ,!£€Ôy'’o£ûD·!V·¬—9¥g³8_â·)ÂüÙ$¸Ïpó‘¡ÍÊyL—PÞw‘óã†òÒ‘¿•^¢õô¯z{¿&ኻ–òï‰J€©’B…½˜[îž$85+êã“v‡KŽ*ÿ8´‚aq#ž Çåý o¥Ùíh…‡‡ÐÏO³Žð u Žù†I¦d^övíóò³-_'ÓïË[|T ¯‘¯Z7ªÂÇIä#?ÚbõdñVËëíQÛ š-œíô¾‰µOv°µöÆ`dǘ{o®ý±¾Õ†ÅmÍm ýCkw[lá‚ñÚ_G:ð½7c瘴Zµ'ì¯ÚÚÂÂÊ̺fõ7JÜ–^ÅØRÎvÈ1Söh†ë:ó1_Ú`•`<”µ0Xñ†×ö^¨íŸM£l6ÿ?e4¿ãŒ‹J/w)uØ9¸“ظŽ{ÿ[ÓíâÁ‡5Š7þ·æ9®|X£x÷ Ã¥ è Ø:UöÛ+êu\@u [!]vM³hª—××>‚m²„$êWt=·¼2'/aÚ†Ž™œžW`©³i"Ú€œƒ710†œ¹8áR±¦“ié,òf*™Â ,-Þ²ƒƒB:#4!$U(=˜÷±ˆ5þ`ÎB¬eí•#¯,º,Oªl%²½ë|EÞ·WXæ-L6ŠZ:—Á‡¨èY›,³ÌóMvØï!¶3¹¬hçÖœÓè ÚS¯azØ”ù¸¡6\ÄÃ8ωfÆsÑ\d“ë~] ó¿WJP% T„í{ß7Ì=œìH)ŒBØ |$Ôµøw‡Ó$õ Rì*1ÒX8 =¦—¦wÏEJÈEÿMh,±{-þ¸Ž”÷7r9äÍeè„ؽª|}þ!¦ŽB(F–dK:Y óCÙÐgàŠ`*ˆ²zŠÜ1DòRR»CÒ“9¤¥'ËK²Ã”!Œã‡wŒ5Kù~’øŸÁ%¼L$îCbÝq"ÌQÜSó” ùrE%ÿYnÐ÷‘®z¾i­å/>öŠ°‹¯zåm–4¤­œ©*Œ†(b0ååþ†ÒÁ£Ì·£íè@jN>3V‰|Ÿìv¼F;Û®Ú°6Ä4dMnH… Ëø˺ßdñëâ:P#®õ”ZÉN †ILßœœ»­XtñhJ%‚~ $ÐOÍëN¹<&å…Gj›Z¹X# oӶŒš2Á žRTë¹Ãß ªüBAÂ8ü?©á rEmTû9œ¥‰Aê+ݧÙi9Þ‡¼ŠÞÛÃál@ÄTH½Ã¨R—D"æ0öêü$V“ q¡,[.:–:¸ ÀÅÖPÀ]K»{avÁØM"vLý¦½)ÕšîÂ_kaW®šb®Ö-ø^ßn¨Apjº¦õmš#ŽŒkgSWQ‘Eðò`C “ñí w·ÊÜ?ؼG¹Vö6þøáÂ^OÕtϹ}o(ùÄ»½›d«¦rmúí×ü»Ì…ÊÖ-ß&JVÝÜ¿7ïÞ2á:ø ¡kã¼o´—Ô”¶{2÷ž=>Û·‹§jsSÄ´UÉ]½â™/‡&øÎä$è‘ߤ…+YÜQ,ØúªÇ=.·[ú*™¥¿Ñ¢Û« Ô|¯30¼¾ËS°àJñ·tðý½g¯ ï¹É8ÒN#Ú*Ù) 1ÙŽvN`ð€KÃAu{yâæíœÌ”œüm3¢ãѼCî·Ú´ŸmR&Õ'·õۛˡd”iÓA ¨ÌjnV@áÅCz=›çv‹ ÿ åA¥\7aO#¹ËÝDU²€¨y„˜VZ¹bIÆV™ÌÎ[áCAßž%jÑjyØ+™ GbXY ³$>qŽ¤É£D=Lfȵ`þòþñ#ú_Þ¢…m!FRz\4vŸ>‹ÄË¥¡6¯‰ÐiÖ`óâ¡¿q‰i¯+;ŽwÏ%‘)ñ„B7.†êÆ÷z¼h;0S{œÃë|t©žž]¶g†n€É((5ö„gXttHœVOCã¾ÁAÞÒÑŽ.¾ˆ¨)¬âµ9Õo’ˆ2ïâªÀ»0ßáó]C ŽE¨^¶P¨6÷!wéiÕ)Zô{0ƒx´ƒe`qcŠ:ÿ q½à’¤Qãr+*[àAÖŸ°½Á°·@ÃÔ q‰–¾¥‹î†L»Ô#®E(W”ˆâœ椎,ŸUècäg»ÑJþPã;LÙE-"ýq4¼ · *«Ešqx=…¾ñFSÚ&ÖÇѵ(ÈhÛLxoÔ€q)ÔÒ;ßï€jXUÚfEF—M½™p8.9å"W³#ˆIÍLÏÞe™¨¿ÄÀk˜ŠlG­Ÿþ5b<`Å^!t®ìÏŸ‡1&Q¦,±/MÈ’ûzLîÿÓ«äþƒ'JîïäßéE:ävmï¹Þ‡øÖdV³Ž<ïthÀ ”#Mµ±U0Uêi4»÷4Ýú,å¼™¤´¨ NƒîÓ¼'Z} ¯’ A‚¢ OŠ~¼•ò¯Jrwl5¼Õ ýœRÎù„'lŽIË;-0ùoáíôlûeÚøuXÅ¡Ù¶3ÝÍ׬÷Yˆh œy×Ï]^Mý€ò¤' È9… ç”!„ð²|Ÿ¨ÍŸtH¥5Ö>#B?¾¦õÖ>Xéô‡‚UÛ]’„¹CXü.µmºžü„¢êìXOòÆm¦«Lbºµ›.˜NµewºäÊÝ¿°øÎu›—eÃ&z†˜F­Ô2w°4_½×}‡¸rp'NŸL°hñ§É'¶¦R`öâ;˜Ãå‹ØQžÌÑkK i se“dmÀêèðÝsž§²Ça…K±ÇÎ9p²û6]1ÅÆtÓ'|¬W}Â9û„ãƒ2ýâ#ƒã‚ÖïíÐYóÛ:Tx k>죆X|µl¥Ñ"‡Ùhš™ÿõi''C_5­ì9ú¥ìàÑê}ù×Ð-/Ýúöðœ½ã6‰ôÐrŸ.®~®ÞȹÄù¥1ö”7¶WË RŽŠs ÊË÷¤íC B?ã>Qx"ótWÚ7FÞìO! j¼î‚,mo’Â…9l²,«!Rãx|~\aNAvÊ6´U¸—nÈcØ [ÆeªÅnÇyŽÔ9ŸMž²6:/)Bgc~ =)Â=^˜ÄYN×…‚7>¤_P-ºü5Ž½]oì7øt¹½¡‰£öÊ ¦~Ÿ1¿ó¯*B?nµ°§äz|ºe]ª:Üùû3xU`]SÎ}‚ N™\2óÐÈú:ÿ¾$b¸ä0?Á¦–èĉHLWVue¨cf7fŒ6ú{˜k»ø¸ ûm‘G,ñ‡AajÎälôÈ©³÷a@Jqe“Ö‰ú_aµ N3E‹MöSìõŸÎ‚U?±\$™ÚC÷ ¤œÕ ÒšTò¯ªî'R8öî#AxÇ—<*3í!4{k­…ëÆuƒÚY­¥Üךv.Ié)›R’SD±1aaÂ’‚$bß Á°DBºF7À˜›B®Wuk c)xƒÄa·ïÙŒÕEdX}\;×Ñø 5bü+Îƈŵöã+TkF†€ ÷ÓYëñ"Öø›é¿µ NO×–Õc$$_*7ïþ½þ<Ú\šG*9<Í'´ƒaX*±ûÍÒšM7›v îÒC\AÞªQ$±VG|\ ¢ ‚;`èŒy÷< y¶ÁµŒD ZJ î]{sý«f´FàøèFxÓ Çcñ&£Ô ­wÉÜÎA ŽçªŽ§©Õñ\}ÇÓ$ßñ\Ø·WÐ9P–Y«—¶Ã9­RO…FJ~Á‚ÜÄV‹*t},£’Í‚>Aˆ)§B¿'1ìvÐS=XZ©¬;ø\Ýàx¨ÜÜÐst–pòP‚†ÿ]ПÔî"¥RH{vr:GÁ'ÉÜ£«÷ø¬ìÇSMã@¤t3ÞßÉÝ®•Ä|6OÇÉsa =q`-ƒ›ke¹ê‘ @Â[w1Õy!2<ÉêN—Y¿fÜt× ³Þ0zd"5¸JÂw9sõ¢óõz“€ }", Mß½¤ÜÈ€d¤‰GÒÈÔÕmMC°†$ÌŸª/7…QŸæ÷ø»\ÈžUqúh ZàbŠ5lGÍŠæBQ£Tù9Ôõt-Jî¡ ²÷hêM†=y8!.91WlvD+e%1- ôQä¥^P,7‘Ÿ!W\k:MKñåÍ}¹0"R)ç‘v®XM2ÝÔÜÈoG³'%VÒn¾´æ—RÔÙ´æÙBpåÝ\y:Yš`5¬­ax`n£MEçÐj¯Z%»þE ‚Gkà‘Xçówý–h:‚[ ½ Ü)e ±8«t¼C5~Ãï®H6C®š¬rrñ2 fØ´ä,&¾uI¤ë&ƒýx1ähÀ`˜uôbjœ$û®“Ðð DhÚë`Ú¶£–?3‘)ï(2®‚Èd¦gË&ªsÚl;hƒ´‰}¿úDö½ºû~U åãŒÞ¸ãæUB×v{ç–¤y{«PòšøÛ@ö‹Þ2]Óòn{}|-¿9û”ÐœÍ.¯Å0¸Cþ&oCŽý"ªN(Í(IOÝŠ P¾w¦cŠcʆ”…Q6¡ö¡ÄÄè^’º–ÙØ‚»‚ƒ’üv:§˜"´ÞÙ~ƒ³½›kÀLÄl II— W££mM*u* ÖÛÖg˜ÉODgºÐ»&•‚nŽ è ¥¸W—~¿È6Ý1;-997Z™¾©42¯i6 ª±±˜fðXcGá>+çLÐY^Ve©m唯Sµü<Ò„w.ÿïÃÆþ5DýLƒ½`x](ÍéIò²*ðYƒ*ÿ%¹ -(iö¹•$¥Ä4Û=¤k¬ÙXÓÞ2ÚÖõ´Ücý5{%]ÆmtŸoWå¤s3” H(ø¸ÇSùêÑþçU«³`jªc®:8ž™}e {¦er³q±óI[MsÒ§I €FÅ©S—VdG‹Ø [£³ ë]›\4aƒ]€¶§¿W @AÈ'šaƒBÕ<ÉmyKML±nÄçç×ÚQn¾x’ŽÇ*‘ñÆ-»ïpåšéSÚ ÀÆáq¡WÓ]šªÚ}P¥Ù¼K¦Ê×Ý~5þTq¦*? í©rDþâà„ t ÝfãF×Uk+löü^VÓT-#!Y•-$«°?Ø+ƒG[aš„3ûé"57>SnŠ*†˜îBŒ+È(T5¨OÄ´–R*V•—£ð¡‹Ë²Rv#xÀãÁØ`‘žÍªî¤n·m%|qtàsò%LÇ…ˆf õ6KKC‡¶>öâZù ÞMâ•t?n·½Ã¸ÝBIYZÚ“50—|–^ó$"- mMùB¨;Î}X{¹ðÑúònX@Ÿ'˜+Ô—-ºéÔ×kïÔ‡%`x Vôk^"iâ!4“IÃ3‰pç]„)ã6ð ׺ë/#þIn‡ÙÔfB×éSuÚæ…†2)»J¢À­’ÄW GWêHµÓ«°Ií+ V~V|ΖÍÙ»X<-Cßûxø0ðuëxù[ 9þ¿Ç%G†'£Z”çã¹Ï&çk4éØOïLµÒ×ÌÃuÞ¡CgQåÇòÓ¸_Šð[øµ1æS§}foÁkgN‹°ù¶xÀùO ¿0ÆtYÒÔ1é7ü&~mêXÜßS4˜ne¹çN¿èÅMÒ,§a£ÐcÒŠQ—ÊØÕ dwxòU¶ÃDµ'‹¥vËËþ(/8ÍÍMMíöäM)¡tÜ}É© ¨4_$ãy^¬#‚¿ Ž ½?5 ¸Þz”û ·`ÉßQ¸Lë92+®RĬØÃÞl¯=`\ } TŽ7¨ž‚Ü ãX‹›op ª,sO¡¶{¬ýFg/;¤iìšS/‚Wÿ®}úÞ-Llצà0?m_o?o_/£Åº.ž¾~¾È†…15”.Åpç•Ó ªQü .!,&$1Y¢Ô0-÷õý^˜ø÷ÓÓÃœÅhvtAÅîœÈ¯XíD·X¿xÄdŠ“r íSÍ -m§­ýBû‡.±3qŸï¨ êwrª=ijŸ³§ë¬º,Úe“ÛŽ÷d‹vÃÖEº&º>²¼Ml]“²sÓ3#D[£b#‹ËöÏžçñe²t»ö9ìWmy“?Üš¤ƒµ^†>*ûˆ¶Î ¶o1=Üx\Û½ül¹[`Lï)˯F»ƒßÖ¡¯VpÔ3’¢&Ÿñ©µ –+ØÑ£P;Ìuýçƒ4¯Ý@‚E!ôÕ ÖŒ­„¢ÊƳ0ìì@öËÆfòÛwãí›ØØÂò<‡'9Rþ)- 2 ppñññ@¾È=Âi“KŒk¸;b¬l­,2-÷feDÆ¥‰ÒâÄ)1919»„jò š]Ù‡ZòÕ’x íÉ‹ˆˆ‰ŒCQ(Î?Ñ3Ñ[€˜Íié¹ëóV˜Yy;Ù‹ìÜmý­ü­ƒtÑw 6¤¡6r#æ,3þÐü†ëÇŽ4\š·wŒÈ{·«PgÊ¢+7:Æ¥{ˆ\ò¼ËÑf{n^…¶äžóC T®‘›÷ǯ¦÷'o.KKð²LÖNÜç•„˜Œ”äŒýìys–X¯Ü Ú ïc<žYj¾§Ð7žSß/&á+A•ç"ÈæËÈ/B(—+HµD¢£‰D~R‰¦ñ¨‡ózÑÁ5I@ù mã…‡½#}“ ûõÚ§!îø=˜Øf@`:9e~%ç6ßÖÈ}¾“¦ "‡lBš1΢–þJÓÜãk8¬Þ‰¨Ÿlõ³¹/¹Á+ &1û2×;ºÎˆ˜ËËRsÉ^j3˜¿õh0/+4˜ïÑζ~.È^>ÚIÌÈLÎÏN¥&%DæG Ñà~߻ҫ“ÜxþË•s RjVåâCbÈi0…›ÜuE-öÝ0á̦áj ÷ßa½šwˆš¿§r©˜Ç¡D_F"ik[[+«tÛܼŒô¼\Û K„ãOEV–5O~ôÝŸÃ^E®7¹M<é \èC<)º %äÞÃm/†ìQK¤‚ƒP bL|ˆtòGˆë:›z}/ðþE‡D¢hÄ”Æx­á´Quì‚ÓéáX ¿‡ß<7^ª+KÝY$úž•¾È××ÃËÓÉa£—%bÆ-þúƒZÕçkªô–ˆ`È]¥î®lÚ:𧯞*ƒÓÆŸ'e0ì­„Âá­Ôì8»ÍZé(-.$=¤Ð*ÍÍE¶^vy™-)eq’ìvÏ«UÕÇ5¼> &éP-ݹ;†>“æ„/åõ&FVãER P…[|&‡_RxOÃåÈÈóE“áÕî¤Ä¿fFÃk-9EÒБ [Ii°“¤4ØúioOêU{ûìGi°“”¡ÁƯ€ŽBX¿Ç· –¶mbHöœR±!q!äûlrÓµl ‘Ž›ûlaS«§˜žî± íeø_‰­[êläõ³æõnW}ÿRÇmrB¼â³h`ñ„í2ÒÍB_ %ŸYmÛ$S‘lb~~{˜aå/Šš¿î’ËÙM,×cž7¬Ç«{gz:0ªB ¡J.ˆ6I(UvO©‚{ Tyø<)UpO”*ïðr3Ö­š‹æ1Ë‹×n/ÎÌ(*°M1ñ#ZG°hBÁˆññ‹Œ.Ì-©-u ~ÂIÞÍt¦{/-ÊS2 ó3„îj<ŽKGl7ÆãøãÏÆHÇq¥ŒÇЖ_za~“ž)j<)9ÕóðUžx>æ ÊÓLwL¶µqt²u”4R{å³VÂÖà¤ì±íÚ…^â·À+¶J‡â¤xYºFýpƒ¿ð¯‹eðìšfðì9Ïà©tÚʹy,Ç&*¹]šÏ‘õâÃ’ºÇwÜLš84*CÛh½ë†Ö$”D àí¤>;>}[¥¨î@zAb%#§s®lWÔÛ¦-"lð|n†qrñèh‚îfƒ*µ3 ª ‡¡þÑ a¸‚à˜Þ ¡ ÅB‚ZÌ×ßS¿P§#AŽÓIÖdH³wŽ•–‰ Å{K€vg-ã/ÊÃøÍá?’†à ¾ä—²¹ÜëµíS¹÷{œÊ½ýd‰À^Måbk¸ÖΖ( %¦>DiÏ,z8»WÂü¯Ù @ð¨Jbë@°øK ‹|áO^ô…×$ÀJ²Då 6¨`s>\!,•|€À(2˜„ÿ1ß7¿$/tˆi«š,”TMÆs°JynŠ| <%󕧧ð¡ɇ(Øè'å4Ø]NîævVwX \ÇéÛöQÞ¾ï#\ã˜Y:G[^§ØênÈtº Éhá^>Q;èJH+_RYí I«¥¤ÐJŽÇ²‡bç.ø–Ó-Û[»˜ÚZqHÚ‰y(Ô`•h¡Î>¼V¸š¶fL%Š¬ÒÝÒ÷¬âopm¼;ë|­Üì´Ç4®5jcålä­‹4[ˆm(s‘œ˜4>0‹–rF;#ËÄ7Gjl)›pigQN Ú¯)å"F«rÍèÜOµ$³­“*’IU×ÛÇVú¬qµÐöÛZ£»ƒ\ì¼7"MaˆA4B¹Ó¶uàŸLwŽ(F…›ò’%?úz厜“è’fû „ö…î¶H p¯ÔÂ4Y î¬ä¯sì-9%¸ ]JpïÍÑ9Œsä•á  †Ôâ!´„Š6ÔB'É…d~ ×&ÐsWèTá·å*Àgk'ÒÄKõïHÇ^€7ˆœŸ’¶UŒk-³VIÖa×-çª/+U8|š<À7÷€N¿ft™ßW¢’ÿ PªYð)‰?Uƒ,Ê †¬H^·Ù¹RÓy»wªAçRmÙ¹eWUÆ´í²Ýºj몤Ùh œѤ±ÖîxˆyU$|ªfC›¸šÌ%ÆkQo”œÿ–&ºj}|~ÍüšÉ¹ÃÑ04ÑjþÂù‹ÖOGÐÔ´yzz;-«½B 4ð@j1²Ë ÜÉ´õ0µvŽ=ŸÎñŠW’>ÃÁÎBX©à³;’£lR‡ÃMÁ÷‚›²—º§HùíÿEÊ¥6Š£8ö¨Ü̇å-¹šhŽ M4^Â¥0¥V¥ùã&`jšÁ»h8šV¡{m}çîÀŸ>œr¿í\±z׊ÚÉ›¿@_¢‰Ös–Mœ«ÿ.Âý¼^Áo¯߀/Nj·€— ÿ©Û{ÝE[ Óñ¦ÚŸÿ¬ŽÃï¹2„þ–[‹Ÿ¡¿ë=bo²L[>úK3£š/Ž´§KÎ7½V°uøïˆ{R>Ý…¢B¢ƒ¬V{”†—ð4µG“¾·&}ýìlͬí˜FwìHHКp~Ñ8Øöq‹¸ ;”ÖB!‰Z{Ç¿¦-¤ã±Ài壬ëºæ7ýï1üÄZ®eq3ûjÙ6)÷º”´½jUþWï“s3%÷Ôc/ôie'X$q`_^æ /ÒQ±¨Å¿2>nµÜÁF‘zû( &ù’!°ε³Ÿ¯+‚ù\æeÁeöHÖiÖB0Sš¢¢‰ùkèåÄÅÞL\4(œ¸¸óä‰üÏÊ®z—†£åÿ­áè^SÉ×gÉð@WÒ4zVJ$}ÿðž°‘¯äø³š¬Y½N}­l¡Œº¶%šj';Öãÿ°ZÎÚÖ–Óñ=´œÒÏlÔJ2šcW["›³¸ö|Þº\ûÍ^°L§¹Šo™):çHŒô„Ó8·ºNãÈ›ê°Òhæ{>Mwš|È%6?—͆弨›ý¶ìŸrëi¹0«¾ËUQܯp<‡°Úªo§„¬EÆ™öåN…î[}+ˆ¨åpl%´-œ©öN‚v¿eyëf wçAH*·4d]ÄÜ»ÒCu“êþ€ˆœ)’{¦ÓÛÆe.È—Á Ì ¾›ÞF·@Àwh•GÈÒ`³,·Tt‰‹r‘ ãí—`<÷n1^´€ñ ðê®r’!ÈÉjANbdrÒ€ê¤ZÐÇhTªcÁÎ&õFrÃu¥dFMSÀJ`3ÒÙ¹ñž™†xDÁûR2£údFMžÙŒÖ=ÊfôOŸŽtFMž0 ¥¢Zà3ZÔ‘Ïèç)RB£±–‹D“›ÓåšRö—>rA£,8 zOÀáßl"™§•R·Mj€¸ÁÔ”ñ#¹T»{ÓÜ[ËèÖ ¶PÊ_tB!i[%aÁÏ¥Ú0›DPb~; ܈ãhaÙ¼¸ùe惨sªð‡g:¦w\`i{þŠ¸¹}ßyÍ^ ¾^-®Û7§Ñø×€6¤x¤6SÖp_ oËÜìið@´œ™­SÝ©Çj ¸¯TkÀ‘cµ3ã©6”h+ôÄvÕ7|KDyzƒ@Ê¥ ¿yåãð›¯oç7·GD-HíOrl—¦„ñ”5I³,˜!ÔÑ@ïœÙ±…ç²[ú€¹7B±'=ïG96UÖêF0ì}rc*Šê™Y-w&¾OÇIšúü”‘_´OkGÉêÅ+ô [GiNzÖìXª3e¹³ÑBƒ²Sº"7o5vkŸ ý’±?û”›žîMDNKIö¹6x[Ò¤ß t/æâcüR%ÑüÏ«ô…&÷ôê&õMäŠÇK™.{´a’© ÛI¦+}ZG™&ÈeºÝé\és#>¿ø¸ÖŽ £ÃLG=¥ÓLF¢±ü%ùvî¸;'CMÔ¸¤éöå‰3ÿÙ#pü­WÀñÏ'«c r™Ê»ð®=ú•:åAJib/wŸ¹ýÿ(r¹-bë•]|Ú¾KZØz˜5@.\ØšK€” ªòšv‰EâA@»ðñ>^Þ\~xYb~võ^Á_„_?3â/©aé§å-™dè¶ÂaÐP6wùd@ø'e€°´}t÷ÌYYpÑiÃñ7 ÷Î7Õʬ¦zr©{¦<›=SžlѼÞì-ßâLªQ°Ë›TÎH,ûÓÂÙØþP6Z®q«ä¿HUø7îªBt>ו͔|Í_¯Á›ÇMzWZ°K­å]Ê›©eQÑûãò“óÒK²R¶“§ ¡È…‚¡(vZÈHÍ¿4#²ßƒ×»‚Îy ÃYÂqµ—Y‰¦Þd%®*ÌJ4=yV›•"|–eBë`tƒ*üo@ÇĤ ÂfÈBïvÆAwä=glg˜5´}ˆ±3ïH†|“ç©$ã’lŠ•àéQ²[©'¡&Ô ØoNΆÇkTýI)4z™Vr—c2žÓ³Ò8AJV«¤ÔiˆÜTõ›~S¹8û4È ®µ¢ÈV¼#—%¦½,Iž?¾½.Y-©KÉê’ îkÎ]ANÒ è*IÔB¨€FµU@%4k…ï(wÃ!–c?|G®ñøÀ@NXÖ•xA†Ã%D`Ï›oáW+KÕ‘æ¸Ð·Òl'ædRàJ¤à‡?"(!@ò„ÀP"òx^dysÆ’h·á1¯"òÿag»‰h7²²Yb—æ‘Ž6£¸ôl”Šüð[?¸M²uÑIÃT<[¢âïõ$Å4‘â¼öPTè÷-åßÚ¬açUaa·”éžróÖHÓÛúù=b_/;r±Úð€®è4¬UÃé­ 6㧌Ä}ˆù™š¨mÏB;É>1™~Xf á†°/3.q`ŒnŒÁƒC°‰ŽÇz]…"ý¨"Xƒ` ~û4VÏÈÏ.ª'g§´ŸÞÞ .W1$¥ù¥T'É0:W ¯ÞèàŒ„å[RÌÄ^î‚šHø{w ð%zU ½3zkFAÓm¢‹­’ÐL­ í |øX§§DéF“xÇVŠŠIÄì–5qpüD{F½S¡µ]äDÊŠ»´3-göx“ë8.ÁuO°@û/ZžÁ†”Í‹a†`ØìfwNØëT>`õÐ6ÈÞR fUƒ){W %8;H)zΞ€_èß $#{šT¶K@Lo¸F ¾ £³¥ÎHÛÙ£hIåBkäõÛí\#à#¥a ¶*æ}÷ý*¡o†Ãç\¯M¸;å¡Þcÿ¼sþÜíAèøê«_e3ìý“›„ö8m3ݼ.O?É™#cc7gç/äŒÈyù{x»â÷±½ =ý’$R™SŽ6¡ØiÂnWP‚Ûü. Ä‹5‚pèƒ_¦Ñh/¯D¤ÐŸ‡ºÅ¡ópÜ­KÃP°?t#;½:\3…áPéÑnmÓH}oóóù‘ÜT÷ 6Oæ‡;þå0ÍÞNŽŠˆX*19tà äçB×9‰š§tp¶ìq‰"Ù¼¶:µ+|$­Àk¶{ì&õŸþò&ê:½ÿÜüöw ”8•ü1í¥ÈÅä:—HJ‘Ïǽ/‡”^#ÛËÖ&˜ÙÔDb¤Èæ³rLÓŠG¿gˇ-<+{ôhMä·¥Pʶ”ô¢2¡ÕIûàñYTÒÍœ-BZùùµ¡ï+jù>RÀ€fNêý™Çóþj: †Õ)9´¨ÅÝïA°´³ýó¶ýõ’æö&‚Þà` Í^•ÜÃÉ=x?ò¢n÷Ù?Õn÷®œøu\ï¨%ç”â0èTëгÛhšT.K2/¦Kµ¾QQ»•ðÿ-ÙÑ$lí=B.ùˆ° ¦w•{“¾Ò"¼ÜU3í5ü®«f„ê=3˜8u¥Û%K€.Ë“åM*Õܹ£JÀïÜ;òÄT»ÜÜtòD;©u²±!¥Ûeçf’ÇlÈc¸ãv¯È;‚ö¡ ˼…ÉFQëBç2ø=k“e–y¾Éû=h7Ú™\V´skÎit…í©×0=lÊ|ÜÇP.âaœçD3ã¹DŽlrݯw-•ðô€¦˜óŸ BˆûKBfDϼá²?µA§ê³/|¼$Ò-Ú`¿¦ÀÝ0:{;ÒË`­Æ¦II¬™Ç ±&ˆiUçÆæ©ÒÞæ&~Øqð`¿d;ÖLzÚ±ÖÉßÖöÚ¤;¥É‹j…É'IÇçºW©ë"<¨–\NŠs¢U†qÏunÅùsçYktVØ V‹è²÷ ÿxé1[ê[éªv7©£›NÄt9Þ Õ“pV‚o{˜Rù%©°8•Ê¹ñ•üèW_mL~õµ>}þ¯{<% endstream endobj 14 0 obj 33371 endobj 9 0 obj <> endobj 8 0 obj <>stream xœeÛOKÇg©t' U1M4j»/b ^€¨9—‹&"o\¶î¶»Ðv{ØróBk jœPJ¡­°F"[cN Ǩ‰>ÍÉñ–œýtÖ‡³ !>ø2™Ìï3ßï/¬ÈAäØŽÙŠ‹‹òªx7+î8,¸í5WÞHÈ›2äÍ:e¿òmáóBUæfPr+3{|akZ‹ÑjZtÑÞ'ÙoG3ïä|”ådEͶ¼¼í¿^ ¬V+eïXžPE¬È;=T®zie]‚×Íz|û(›J»\üyÊéêðr"E3 ËhߪiÛDå]¼×+´RÛ6ª0?¿`‡z–òn{‹HUnÚC• Vª„:Á2|‹û÷@ïáÝ…”bp”‚°ª°ˆàa!þÉXŸq‡ ò’ä= b›± ›u˜“i£R)êÓ]W •§$¢CÁº q·D:"þaôâ‰z£±ØÀظGpfÔ[iV®’ÈÑy‘¿¦¢~‰dÂWâè1Ľä×êçÖ²Z¡Üa2àItGþ#ñïÒu˜ÑÚªÔ¶à@ÙÛì]¡Ú€’H.⿉fáù‡±ãèºdc:=L§ø™³Uê'åï’–…pö -nH‹«õÏ®Åý¨þôÕ—|íÑX$í‹™b#½ƒ(ï{¥&Gs³³ü¥ý¿ws÷þš0ÝžêŸE¯à¡ù#Æ^mšj|’š™N¥8­iþ_ÕQD<_r´äéü²§îAÿòæ@}HݼKÛ< m®yê¹=»32EðÑ°¯lÑ“=Ð鸮¢*Ú«*]B#:6ºˆÎ‹å‹(ð³T•öâ(µ¬´‚õ¯1¹ßpR *Aµ^¶ äëHš_Ÿ p6¶èðûù"£QˆÌ?Ép8Üs/v7:„àÝÁ–sæŸFYÛ.Xn@Q^%‘ù=†Ñ'(¿%µ¼A>õ~€7éäfì4ŠzÍß½A%O÷â_>̼E7ü8øQ§Ï¶99ôñÂ!8¡Ÿ|ýpâo”FÉö1g¼µ_@>Tß^ÕtæÔŽVr•|è“w“†¶„L'pMBŸ\‰©UÉdV¦Æ³²øK–ð endstream endobj 15 0 obj 844 endobj 16 0 obj <> endobj 17 0 obj <> endobj 10 0 obj <> endobj 13 0 obj <> endobj 18 0 obj <> endobj 2 0 obj <>endobj xref 0 19 0000000000 65535 f 0000002342 00000 n 0000039564 00000 n 0000002283 00000 n 0000002390 00000 n 0000002132 00000 n 0000000015 00000 n 0000002112 00000 n 0000036401 00000 n 0000036154 00000 n 0000037423 00000 n 0000002675 00000 n 0000002459 00000 n 0000038461 00000 n 0000036132 00000 n 0000037330 00000 n 0000037350 00000 n 0000037380 00000 n 0000039506 00000 n trailer << /Size 19 /Root 1 0 R /Info 2 0 R >> startxref 39614 %%EOF cloog-0.18.2/doc/images/basic.fig0000664000175000017500000001045112254312305013410 00000000000000#FIG 3.2 Landscape Center Inches Letter 100.00 Single -2 1200 2 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 5400 3900 75 75 5400 3900 5400 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4800 3900 75 75 4800 3900 4800 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4200 3300 75 75 4200 3300 4200 3375 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4800 3300 75 75 4800 3300 4800 3375 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4200 2700 75 75 4200 2700 4200 2775 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4200 3900 75 75 4200 3900 4200 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6000 3900 75 75 6000 3900 6000 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6600 3900 75 75 6600 3900 6600 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 7200 3900 75 75 7200 3900 7200 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 7800 3900 75 75 7800 3900 7800 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 7200 3300 75 75 7200 3300 7200 3375 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6600 3300 75 75 6600 3300 6600 3375 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6000 3300 75 75 6000 3300 6000 3375 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 5400 3300 75 75 5400 3300 5400 3375 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4800 2700 75 75 4800 2700 4800 2775 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 5400 2700 75 75 5400 2700 5400 2775 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6000 2700 75 75 6000 2700 6000 2775 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6600 2700 75 75 6600 2700 6600 2775 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6000 2100 75 75 6000 2100 6000 2175 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 5400 2100 75 75 5400 2100 5400 2175 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4800 2100 75 75 4800 2100 4800 2175 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4200 2100 75 75 4200 2100 4200 2175 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4200 1500 75 75 4200 1500 4200 1575 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 4800 1500 75 75 4800 1500 4800 1575 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 5400 1500 75 75 5400 1500 5400 1575 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 7800 3300 75 75 7800 3300 7800 3375 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 8400 3900 75 75 8400 3900 8400 3975 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 7200 2700 75 75 7200 2700 7200 2775 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6600 2100 75 75 6600 2100 6600 2175 1 3 2 1 0 0 50 -1 20 3.000 1 0.0000 6000 1500 75 75 6000 1500 6000 1575 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 0 2 1 1 2.00 120.00 180.00 3000 5100 9600 5100 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 0 2 1 1 2.00 120.00 180.00 3000 5100 3000 900 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 3000 4500 2925 4500 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 3000 3900 2925 3900 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 3000 3300 2925 3300 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 3600 5100 3600 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 4200 5100 4200 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 5400 5100 5400 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 4800 5100 4800 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 6000 5100 6000 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 6600 5100 6600 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 3000 2700 2925 2700 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 3000 1500 2925 1500 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 3000 2100 2925 2100 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 3000 1500 9000 1500 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 8400 5100 8400 900 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 7200 5100 7200 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 7800 5100 7800 5175 2 1 0 1 0 0 50 -1 20 3.000 0 0 -1 0 0 2 8400 5100 8400 5175 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 3000 3900 9000 3900 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 5400 900 9600 5100 2 1 2 1 0 7 50 -1 -1 3.000 0 0 -1 0 0 2 4200 5100 4200 900 2 3 0 0 0 7 51 -1 15 0.000 0 0 -1 0 0 5 4200 1500 4200 3900 8400 3900 6000 1500 4200 1500 4 0 0 50 -1 2 26 0.0000 0 270 195 2625 4650 1\001 4 0 0 50 -1 2 26 0.0000 0 270 195 2625 4050 2\001 4 0 0 50 -1 2 26 0.0000 0 270 195 3525 5550 1\001 4 0 0 50 -1 2 26 0.0000 0 345 135 2700 1050 j\001 4 0 0 50 -1 0 26 0.0000 0 270 750 8025 825 i<=n\001 4 0 0 50 -1 2 26 0.0000 0 270 195 4125 5550 2\001 4 0 0 50 -1 2 26 0.0000 0 180 225 8325 5550 n\001 4 0 0 50 -1 2 26 0.0000 0 180 330 2550 1575 m\001 4 0 0 50 -1 0 26 0.0000 0 360 750 9075 3975 j>=2\001 4 0 0 50 -1 0 26 0.0000 0 360 855 9075 1575 j<=m\001 4 0 0 50 -1 2 26 0.0000 0 270 105 9450 5475 i\001 4 0 0 50 -1 0 26 0.0000 0 270 750 3825 825 i>=2\001 4 0 0 50 -1 0 26 0.0000 0 360 1410 4875 825 j<=n+2-i\001 cloog-0.18.2/doc/images/tree.eps0000664000175000017500000001453012254312305013312 00000000000000%!PS-Adobe-2.0 EPSF-2.0 %%Title: tree.eps %%Creator: fig2dev Version 3.2 Patchlevel 3c %%CreationDate: Fri Sep 6 10:09:40 2002 %%For: bastoul@whisky (Cedric Bastoul) %%BoundingBox: 0 0 388 312 %%Magnification: 1.0000 %%EndComments /$F2psDict 200 dict def $F2psDict begin $F2psDict /mtrx matrix put /col-1 {0 setgray} bind def /col0 {0.000 0.000 0.000 srgb} bind def /col1 {0.000 0.000 1.000 srgb} bind def /col2 {0.000 1.000 0.000 srgb} bind def /col3 {0.000 1.000 1.000 srgb} bind def /col4 {1.000 0.000 0.000 srgb} bind def /col5 {1.000 0.000 1.000 srgb} bind def /col6 {1.000 1.000 0.000 srgb} bind def /col7 {1.000 1.000 1.000 srgb} bind def /col8 {0.000 0.000 0.560 srgb} bind def /col9 {0.000 0.000 0.690 srgb} bind def /col10 {0.000 0.000 0.820 srgb} bind def /col11 {0.530 0.810 1.000 srgb} bind def /col12 {0.000 0.560 0.000 srgb} bind def /col13 {0.000 0.690 0.000 srgb} bind def /col14 {0.000 0.820 0.000 srgb} bind def /col15 {0.000 0.560 0.560 srgb} bind def /col16 {0.000 0.690 0.690 srgb} bind def /col17 {0.000 0.820 0.820 srgb} bind def /col18 {0.560 0.000 0.000 srgb} bind def /col19 {0.690 0.000 0.000 srgb} bind def /col20 {0.820 0.000 0.000 srgb} bind def /col21 {0.560 0.000 0.560 srgb} bind def /col22 {0.690 0.000 0.690 srgb} bind def /col23 {0.820 0.000 0.820 srgb} bind def /col24 {0.500 0.190 0.000 srgb} bind def /col25 {0.630 0.250 0.000 srgb} bind def /col26 {0.750 0.380 0.000 srgb} bind def /col27 {1.000 0.500 0.500 srgb} bind def /col28 {1.000 0.630 0.630 srgb} bind def /col29 {1.000 0.750 0.750 srgb} bind def /col30 {1.000 0.880 0.880 srgb} bind def /col31 {1.000 0.840 0.000 srgb} bind def end save newpath 0 312 moveto 0 0 lineto 388 0 lineto 388 312 lineto closepath clip newpath -165.0 369.0 translate 1 -1 scale /cp {closepath} bind def /ef {eofill} bind def /gr {grestore} bind def /gs {gsave} bind def /sa {save} bind def /rs {restore} bind def /l {lineto} bind def /m {moveto} bind def /rm {rmoveto} bind def /n {newpath} bind def /s {stroke} bind def /sh {show} bind def /slc {setlinecap} bind def /slj {setlinejoin} bind def /slw {setlinewidth} bind def /srgb {setrgbcolor} bind def /rot {rotate} bind def /sc {scale} bind def /sd {setdash} bind def /ff {findfont} bind def /sf {setfont} bind def /scf {scalefont} bind def /sw {stringwidth} bind def /tr {translate} bind def /tnt {dup dup currentrgbcolor 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb} bind def /shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul 4 -2 roll mul srgb} bind def /DrawEllipse { /endangle exch def /startangle exch def /yrad exch def /xrad exch def /y exch def /x exch def /savematrix mtrx currentmatrix def x y tr xrad yrad sc 0 0 1 startangle endangle arc closepath savematrix setmatrix } def /$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def /$F2psEnd {$F2psEnteredState restore end} def $F2psBegin %%Page: 1 1 10 setmiterlimit 0.06000 0.06000 sc % % Fig objects follow % 7.500 slw % Ellipse n 5400 1200 237 237 0 360 DrawEllipse gs col0 s gr % Ellipse n 3000 3600 237 237 0 360 DrawEllipse gs col0 s gr % Ellipse n 7800 3600 237 237 0 360 DrawEllipse gs col0 s gr % Ellipse n 6600 4800 237 237 0 360 DrawEllipse gs col0 s gr % Ellipse n 5400 2325 237 237 0 360 DrawEllipse gs col0 s gr % Polyline gs clippath 5355 2115 m 5445 2115 l 5445 1888 l 5400 2068 l 5355 1888 l cp eoclip n 5400 1425 m 5400 2100 l gs col0 s gr gr % arrowhead 15.000 slw n 5355 1888 m 5400 2068 l 5445 1888 l 5355 1888 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 5355 3390 m 5445 3390 l 5445 3163 l 5400 3343 l 5355 3163 l cp eoclip n 5400 2550 m 5400 3375 l gs col0 s gr gr % arrowhead 15.000 slw n 5355 3163 m 5400 3343 l 5445 3163 l 5355 3163 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 2955 4590 m 3045 4590 l 3045 4363 l 3000 4543 l 2955 4363 l cp eoclip n 3000 3825 m 3000 4575 l gs col0 s gr gr % arrowhead 15.000 slw n 2955 4363 m 3000 4543 l 3045 4363 l 2955 4363 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 6563 4544 m 6611 4621 l 6803 4500 l 6627 4558 l 6755 4424 l cp eoclip n 7800 3825 m 6600 4575 l gs col0 s gr gr % arrowhead 15.000 slw n 6755 4424 m 6627 4558 l 6803 4500 l 6755 4424 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 8988 4621 m 9036 4544 l 8844 4424 l 8973 4558 l 8796 4500 l cp eoclip n 7800 3825 m 9000 4575 l gs col0 s gr gr % arrowhead 15.000 slw n 8796 4500 m 8973 4558 l 8844 4424 l 8796 4500 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 6555 5790 m 6645 5790 l 6645 5563 l 6600 5743 l 6555 5563 l cp eoclip n 6600 5025 m 6600 5775 l gs col0 s gr gr % arrowhead 15.000 slw n 6555 5563 m 6600 5743 l 6645 5563 l 6555 5563 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 7802 3411 m 7831 3326 l 7615 3253 l 7772 3354 l 7587 3338 l cp eoclip n 5400 2550 m 7803 3364 l gs col0 s gr gr % arrowhead 15.000 slw n 7587 3338 m 7772 3354 l 7615 3253 l 7587 3338 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 2971 3337 m 3000 3422 l 3215 3348 l 3031 3364 l 3186 3262 l cp eoclip n 5400 2550 m 3000 3375 l gs col0 s gr gr % arrowhead 15.000 slw n 3186 3262 m 3031 3364 l 3215 3348 l 3186 3262 l cp gs 0.00 setgray ef gr col0 s /Times-Roman ff 330.00 scf sf 3075 4200 m gs 1 -1 sc (0) col0 sh gr /Times-Roman ff 330.00 scf sf 6675 5400 m gs 1 -1 sc (0) col0 sh gr /Times-Roman ff 330.00 scf sf 5475 3000 m gs 1 -1 sc (1) col0 sh gr /Times-Roman ff 330.00 scf sf 3825 3000 m gs 1 -1 sc (0) col0 sh gr /Times-Roman ff 330.00 scf sf 6900 3000 m gs 1 -1 sc (2) col0 sh gr /Times-Roman ff 330.00 scf sf 6975 4200 m gs 1 -1 sc (0) col0 sh gr /Times-Roman ff 330.00 scf sf 8475 4200 m gs 1 -1 sc (1) col0 sh gr /Times-Roman ff 330.00 scf sf 5475 1800 m gs 1 -1 sc (0) col0 sh gr /Times-Roman ff 330.00 scf sf 2850 4950 m gs 1 -1 sc (S1) col0 sh gr /Times-Roman ff 330.00 scf sf 5250 3750 m gs 1 -1 sc (S2) col0 sh gr /Times-Roman ff 330.00 scf sf 6450 6150 m gs 1 -1 sc (S3) col0 sh gr /Times-Roman ff 330.00 scf sf 8850 4950 m gs 1 -1 sc (S4) col0 sh gr /Times-Roman ff 330.00 scf sf 5355 2430 m gs 1 -1 sc (i) col0 sh gr /Times-Roman ff 330.00 scf sf 2963 3667 m gs 1 -1 sc (j) col0 sh gr /Times-Roman ff 330.00 scf sf 7763 3675 m gs 1 -1 sc (j) col0 sh gr /Times-Roman ff 330.00 scf sf 6533 4890 m gs 1 -1 sc (k) col0 sh gr $F2psEnd rs cloog-0.18.2/doc/images/tree.fig0000664000175000017500000000354012254312305013267 00000000000000#FIG 3.2 Landscape Center Inches Letter 100.00 Single -2 1200 2 1 3 0 1 0 7 50 0 -1 0.000 1 0.0000 5400 1200 237 237 5400 1200 5625 1275 1 3 0 1 0 7 50 0 -1 0.000 1 0.0000 3000 3600 237 237 3000 3600 3225 3675 1 3 0 1 0 7 50 0 -1 0.000 1 0.0000 7800 3600 237 237 7800 3600 8025 3675 1 3 0 1 0 7 50 0 -1 0.000 1 0.0000 6600 4800 237 237 6600 4800 6825 4875 1 3 0 1 0 7 50 0 -1 0.000 1 0.0000 5400 2325 237 237 5400 2325 5625 2400 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 5400 1425 5400 2100 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 5400 2550 5400 3375 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 3000 3825 3000 4575 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 7800 3825 6600 4575 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 7800 3825 9000 4575 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 6600 5025 6600 5775 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 5400 2550 7803 3364 2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 1 0 2 1 1 2.00 90.00 180.00 5400 2550 3000 3375 4 0 0 50 0 0 22 0.0000 0 225 150 3075 4200 0\001 4 0 0 50 0 0 22 0.0000 0 225 150 6675 5400 0\001 4 0 0 50 0 0 22 0.0000 0 225 150 5475 3000 1\001 4 0 0 50 0 0 22 0.0000 0 225 150 3825 3000 0\001 4 0 0 50 0 0 22 0.0000 0 225 150 6900 3000 2\001 4 0 0 50 0 0 22 0.0000 0 225 150 6975 4200 0\001 4 0 0 50 0 0 22 0.0000 0 225 150 8475 4200 1\001 4 0 0 50 0 0 22 0.0000 0 225 150 5475 1800 0\001 4 0 0 50 0 0 22 0.0000 0 225 345 2850 4950 S1\001 4 0 0 50 0 0 22 0.0000 0 225 345 5250 3750 S2\001 4 0 0 50 0 0 22 0.0000 0 225 345 6450 6150 S3\001 4 0 0 50 0 0 22 0.0000 0 225 345 8850 4950 S4\001 4 0 0 50 0 0 22 0.0000 0 225 90 5355 2430 i\001 4 0 0 50 0 0 22 0.0000 0 300 90 2963 3667 j\001 4 0 0 50 0 0 22 0.0000 0 300 90 7763 3675 j\001 4 0 0 50 0 0 22 0.0000 0 225 150 6533 4890 k\001 cloog-0.18.2/doc/images/tree.jpg0000664000175000017500000003262112254312305013304 00000000000000ÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀZ®"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€15=NòMEt!b7†1$÷‚cµBp ï9ù¶®GLž*8ü!¥Iå˪Du{µM­5ùóC†$F~DädmQŽÔxEDÚCêm‹.¥q-Ñis¼ÆÎÞP<œb=ƒãŽ:Öýa?ƒ´0æ[;?ìÙö%Ӝۖݒ¾`{‚8¥²Ô/¬µH´\Ç3LŒÖ—±®Á>ÞY2v¸ñò·$ÆѹX^2¶øSP•x¸´‰®íÜ`–0]H$r0HÁ4»EGñ][Åq‡ŠTŽ:2‘*’€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€0<"Â!ôÆ’F—M¸–Ô¬¹Þ#Wo(žsÃ1Ï+~±5=2ò=Eu}!¢‚1öò’#º@r#î¸ù¶¶\*8ü_¥GåŪJt‹¶MÍ øò‚œ… H~GäàmcžÔ¿X^2¹xSP‰y¸»‰­-Ð`—–@Q@Œòr@9À4‡ÆZ„%èÔå*YcÓTÜ“ƒ·’™ É,@ÈÓ¬´ûëÝR-_WÂУ-¥”m¼A»†w| ÎG|«È³¸€lAV¶ñ[À"‰"Š `ʤ¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠÊðÇüŠz7ýxÁÿ¢Öµk…Ö|A?…¾ ®³jT\[é–â"à ;E8Ý.£àKï ÌúåêjWqéš’]ÞË8’i”’0Ù †Vû¡A w‘EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEÍøÓƺot¨5-V ¹-æœ@ ²+ÅY†AaÆÐ?â"ã]øö¨^vÒíäDŒa$Çþ;Yúþ½eãÛÿÙè..§‡TƒU¼HØ1³Ž w,½6¶[8

—o´ñ…Vm„|¤Ÿº}:ZŠ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(®ãý³ð¿XEt¶±‹¸Îq·Ë;˜õù7þ}3Šëu=ZÏH·YnåÚ]‚G‚ÒJÄà*(åŽHàVD«âvÑ£{k :Âæ¯Øyç*ÜmeF@„©9ö­r?toì߆Ézè¢]JæI÷cæØ¿"ƒÇO‘ˆë÷³Þ½J¹-Jñ…t[2Ñt­JÊÊÙb ˆÖr¶ÜsÕÕ˜Œ“ ±êoiš½®ª’yDž{y¤°“Ù”úó‚2ä9  ôQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEsú4M©êךÝ×Xå–ÊÎ,¶"Hä(í‚Üì„çt(É­}GíÃM¹þÌæÿËo³ý¤°‹~>]ûyÛž¸æ²|<#a@ kpöòÆ6%Ù$äqË«Æ¢ø Íð÷Ä%Œ€Å§\J…$d!–6*rÏ qÒ€7í~ÑöH~×å}§Ë_7ÊÎÍøù¶çœg8Í`ø¦6Óc_[*ý£NÀ8u·Y’F6¼uÁ^œÓü ÿ$óÃ_ö µÿÑKV|TÁ¯q´¯™¨¸”q±€#CÀåTÝ xCâLƒ5Õ¦nȧe²‹‹€Häoqå®?Ü|úñÌ°xKHIÒæî5¤9Yõ Ã)õPß*ÀÖåQE•áùôoúñƒÿE­jÖG†·i öpHÈË«˜ðeΧÿ Ç:mö­w¨Cdl~Ïç•0ñ»@QÔ@ÀÍt×¾ÑïnZìÚ}žõºÝÚ;A1úºX{j¯öiÜÙj°jQêQùr}Ñ õ¿¯AEsÃÅkg ‹[Ó/t³•htóm‰'÷©£=Ü'oQËk«{Ûu¸µž)á|í’' ­ƒƒ‚8ê KX÷~Ò®f’â8ÎîEp×6R$%°I%Ürù²3@V'Ù¼Ce.mïíµL™1ÞÇäÈ«·´‘¿xgý_ByéM_Çl«ý³ay¥¶Ø÷I*y‚Çn<ÔÊ€m½AÅnÑQ[][ÞۭŬñO çl‘8elÇPjZ(¢Š(¬½rÛP¿µŽÊÂêK1;•¸»‹dQàçËÏG'dž Wá5Õ|=ñ6ÿ“k—úÆštµ¿Š[ù|Ùa7fÂØî2~€q@“EPEPEPEPEPEPEPEPEPEPEPEPEP^%¦êÖš _ÁøŸÃö½2 ÀÍpÓ;ìt^¬¸“¨ãå=+Õo!½—öÚt"L/dó¤eÛÚ8Îß¼qþ³ ÞZý}: (Ÿÿ„¶ÒÓjÒóG#¬—qƒ×ÎBÑþóíÖ· ž¨{yc–'Y#`ÊÃØŽµ%aÏá-!ç{›HdÓ®œå§Óä6ìÇÕ‚ü¯ÿ @ âi>ÒQÕî–‹NKHÇ°}N¹oøßÁšž½q“©C]ÕIpËm,*.ê "/u9'’MtiŠ4°ån­5¸B1UE­Æsòè 6Gu9ç8àMÿ EŒùZœW:[™<µ7±íŽÝÜJ¤ÇÓ0x›Vø•¦ß^^Á´ŽmVÙ™’Ú%“€Ìù°J’Iþ£°Ôõ™yâ *ÆèZMx­v[oÙ¡S,ÙÛ»ýZØÀÎqŠ¤<7q}¼ëšÅÍê¼m[[æÖßùPïn8û •±gag§Âa²´‚Ú"ÛŠC@OLàwà~TŒ5êD}ƒJ‡N‘X\jo¹ù<ˆÏnûO·\/ü"ÿlçZÕoµ,õ‡Ìò Þ\xÜ=œ¿ò®‚Š¯eag¦Û-µ¤¶ë÷b‚0Š>€qV(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ óïŒZö¿áŸ¦­áû“o47H· 䬃Ê`ÃÊqól㯸¯A®sǺ7ü$ÖôÀŒòKhí¨ÉiçAŒâUè3éÍq_üAâxrþm^ég³µ’+K0"DÙ±2ÃåÁ<4}>µëÂüÑ¿±¾èèÑí–ê3w!Îwy‡rž§&Ï˦s]ÕQEQEQEQEQEQEb?…tÄs-‚K¥Ìv~óO$­‘¹ÈÝHù”ðj9‰tÔ- Zk1¨rOôiÏÍ•†Q¸Èû©Ðߢ€9øüa¦Ç'•ªÇs£K¸(”b4b{, ˜ØçŒ'óßVWEt`Êà ƒE ªèÈêX`‚2¬ð†›´š[\hò“ÚtžZêb ÄÇÝþ´¿E|ÁñÄ~7Ñ~(=եƢÆ%·‚qhÑ-Ì@’K'ÝpX°Î0v‚1Ž=Àßô­~TÓ|CiŸÝÞĈ$|à€O(}›ó Z¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(SÔï$ÔWHÒ#xcOq(&;T'>óŸ›jätÉâ£ÂTž\º¤GW»TÚÓ_Ÿ41ÈbDgäNFFÕíG„TM¤>¦ÑȲêWÝ—;ÌlíåÉÆ#Ø08ã­m\¤ò[H–Ó,32’2o }vägó >ßÁñŒz‚xgû*i7·Ù&RŒ²/ ÈÈÜ#AÅji3M¢ÞA ÞCn#tf²¹¶ˆD’ã–FŒp®ÝÇÊÜîŠ_ 5ÝCÄ¿ô½_T˜M{pf28@€âgP0áZ>2¶øSP•x¸´‰®íÜ`–0]H$r0HÁ4»EGñ][Åq‡ŠTŽ:2‘*’€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¯2Ó¼iâÝsÀW>0ÒàÑZÒÉŸ*È$Xc,é7à¿Ëœmù JŠ(à…!†5Ž$P¨ˆ0túÂ×µ=Uc†ÏÃYÜjW™R[¹·‰>gÛóä^N@²üâ­W\»Öt}~ÆÞÓXÒ$‰.³1‰ÖE,¬»¹Áî{PcEPEPEPEPEPEPEPEP&§©ÞI¨®‘¤,FðÆ$žâPLv¨N }ç?6ÕÈé“ÅFžÒfú´?Û!6¼º‡ïƒ‚HŒü‰ÈÎF;Qái©´r,º•Ä·E¥Îó;y@òqˆö Ž8ë[W&à[Hm&¸Ú|±+R}Èãð kMм-¬XGªh1-¤rHîtÒÖ§!Îìªí¼†r«ÖZ…õ–©‘«˜æi‘šÒö5Ø'ÛË#¦Nמ>V䀸Ú*|=ñ%׋¼§ë·°Ã ÷F]ÑÂU + ÆI=gÞ­xÊØOáMBUââÒ&»·q€RXÁu qÈÁ gÐíÅuoÄ)P:8èÊFAüªJ(¢Š(¢Š(¢Š(¢ŠÀð‹t‡ÓI]6â[R²çx]¼¢xÌ{@Çm­ƒ×Š¥u¯xsP†?[Ág/›]^ªŽß•ÜylA8IÏjËø1¶ÿ 4™ 1I\ýÖ™ÙOâ?oøÊäAáMB%æâî&´·A‚^YE3ÉÉçÓGŒ4 ,:uÚê/³)˜†ç€Bã1‚ª2@Ër>ËO¾½Õ"Õõq- 2ÚYFÛĸgwÀÜäqÇʼ€[;ˆÄEko¼(" èªüªJ( Š( Š( Š( Š( Š( Š( Š(  Úý¾•¦]ê7lVÚÒžV$"©bq߀kʵï j^Š÷ÆÕéÛ åî•)ó`¸\îgCÎ>^ノ+Ön­¡½´šÖá7Ã4m‹’7)##ž†¹È¾xbRÝlg6ˆÁ…›ßNÖÙs sÅq@–:ÜW~°Õå†H>ÙoËnypΡ‚ݹÅgøoC]÷SÔo¥ŒêúÕÇŸ0ߨƒÄ¿Þ¼g’OIâ?ø{ÅÛC­XµÌ6ßê¢[‰bEí¨ÀŽ2j/ |?ðÇ„.æºÐ´Ï²M4~\çË&W9ƈê(¥¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(Â,!ÒLi$itÛ‰mJËâ5vò‰àg1ì9ñÒ·‹*• À8POSŒñøXºž™y¢º¾Ñ ÁŽ{yIÝ 9‘÷\|Û[®‘ªê^Õ–Èx¡?²ï-\Æ/¤kV‚@@;')äò± ï@þ +'Â-2•8œàŒpgÒº\ˆ<)¨D¼Ü]ÄÖ–è0KË ( Fy9 à¯iâ ZZCa¢OêE!¶Òc7(!@ýØ*¼2Äœ’5fËO¾½Õ"Õõq- 2ÚYFÛĸgwÀÜäqÇʼ€[;ˆÄEko¼(" èªüªJ( Š( Š( Š( Š( Š(  ¯ ȧ£׌ú-kV¸]gÄø[àºë6¥Ež™n",2°DSŽø,*Òê>¾ðœÏ©Þ^¦¥w™©%Ý쳉&‘II# ˜eoº@ÇpéQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQ^~ÍuâωzÖ‘6¡ym¥h–)ŠÊîKwyçRᙂÀ(àgŽN=Šä¾k—ÚÆ…y§"ͤêé·/IZ#ÃôF}OÚ]&‰¬jwÒÛ¦³¬ÜêVñÊ0Â)6í$uä óŠÚmzãU™íü;SªðúŒÙ6Ñž~èHÇE r2Ã4ŸØ·ºÓ™gçîœV–™£Ùi) µˆù’fšF/$¤wf<žÿLñWè Š( Š( Š( Š( Š( Š(  zŽ•eªÀ"½€Hå¯yHdou ÖW¬h.EЛWÓ@Oy¹„wÜŠ?z1ŽPnëòšèh  ‰|Q¡Aogq&­h°ÞÌ-íßÌyÈ\ö+ñ'ˆ¤Õ´{{;‹!ªÛBâ9K–v‰$ó’p«Ÿ ¾$êzeÌñÔ6WœGeuy!“°G-Ôú7~‡œí´QEQ^e§xÓź瀮|a¥Á¢´!¥’>UH°ÆXÒoÁ—8Ú;ó@•QÁ C kH¡Q`(è)õRöâé,m:Þ+ÉÊæ$y¼´n3Ëá°¨¨íÈÃø{âK¯xO×oa†£„ªWAŒ’z(ϽtôQEQEQEQEQEQEQEQEQEQEQEQEQEbjz䚊éBÄo bIî%Çj„àÞsóm\Ž™ÙmÇ”ç˜÷¨m§ÜgÆ|ÿ’C¡ÛÇþ”I]½Í„v陣*-çxHÀÀB=ºUøgJðµ‡Øtxf‚Ó9X^æYU9$íÇnI$ã&€5袊(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠÀð‹t‡ÓI]6â[R²çx]¼¢xÌ{@ǵëÂüÑ¿±¾èèÑí–ê3w!Îwy‡rž§&Ï˦s]ÕQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQ^e§xÓź瀮|a¥Á¢´!¥’>UH°ÆXÒoÁ—8Ú;ó@•QÁ C kH¡Q`(è)õ™¨Ý_·Ùíô”ˆËp¬âîd/ *1É Abw (#<œñÎ/„¦Ó¯\ðÝ¥òyÖ/}f“.6™ .€ÿ ²ç¸##‘Ú¸Ûjžø‰­xY¯¤Ô´©-Fª·74ñÊï°«°%¶±éЙ¬OŽ——ZT¾—N¹šÎE¼tW·s B2¸ãb»/†RÉuáSyq#Mu4ïæÍ!Ü'šì¨¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠÿÙÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀZ®"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€?ÿÙcloog-0.18.2/doc/images/basic.eps0000664000175000017500000002701612254312305013437 00000000000000%!PS-Adobe-2.0 EPSF-2.0 %%Title: basic.fig %%Creator: fig2dev Version 3.2 Patchlevel 4 %%CreationDate: Thu Nov 17 16:54:54 2005 %%For: bastoul@ulysse.futurs.inria.fr (Cedric Bastoul) %%BoundingBox: 0 0 445 301 %%Magnification: 1.0000 %%EndComments /$F2psDict 200 dict def $F2psDict begin $F2psDict /mtrx matrix put /col-1 {0 setgray} bind def /col0 {0.000 0.000 0.000 srgb} bind def /col1 {0.000 0.000 1.000 srgb} bind def /col2 {0.000 1.000 0.000 srgb} bind def /col3 {0.000 1.000 1.000 srgb} bind def /col4 {1.000 0.000 0.000 srgb} bind def /col5 {1.000 0.000 1.000 srgb} bind def /col6 {1.000 1.000 0.000 srgb} bind def /col7 {1.000 1.000 1.000 srgb} bind def /col8 {0.000 0.000 0.560 srgb} bind def /col9 {0.000 0.000 0.690 srgb} bind def /col10 {0.000 0.000 0.820 srgb} bind def /col11 {0.530 0.810 1.000 srgb} bind def /col12 {0.000 0.560 0.000 srgb} bind def /col13 {0.000 0.690 0.000 srgb} bind def /col14 {0.000 0.820 0.000 srgb} bind def /col15 {0.000 0.560 0.560 srgb} bind def /col16 {0.000 0.690 0.690 srgb} bind def /col17 {0.000 0.820 0.820 srgb} bind def /col18 {0.560 0.000 0.000 srgb} bind def /col19 {0.690 0.000 0.000 srgb} bind def /col20 {0.820 0.000 0.000 srgb} bind def /col21 {0.560 0.000 0.560 srgb} bind def /col22 {0.690 0.000 0.690 srgb} bind def /col23 {0.820 0.000 0.820 srgb} bind def /col24 {0.500 0.190 0.000 srgb} bind def /col25 {0.630 0.250 0.000 srgb} bind def /col26 {0.750 0.380 0.000 srgb} bind def /col27 {1.000 0.500 0.500 srgb} bind def /col28 {1.000 0.630 0.630 srgb} bind def /col29 {1.000 0.750 0.750 srgb} bind def /col30 {1.000 0.880 0.880 srgb} bind def /col31 {1.000 0.840 0.000 srgb} bind def end save newpath 0 301 moveto 0 0 lineto 445 0 lineto 445 301 lineto closepath clip newpath -153.0 333.0 translate 1 -1 scale /cp {closepath} bind def /ef {eofill} bind def /gr {grestore} bind def /gs {gsave} bind def /sa {save} bind def /rs {restore} bind def /l {lineto} bind def /m {moveto} bind def /rm {rmoveto} bind def /n {newpath} bind def /s {stroke} bind def /sh {show} bind def /slc {setlinecap} bind def /slj {setlinejoin} bind def /slw {setlinewidth} bind def /srgb {setrgbcolor} bind def /rot {rotate} bind def /sc {scale} bind def /sd {setdash} bind def /ff {findfont} bind def /sf {setfont} bind def /scf {scalefont} bind def /sw {stringwidth} bind def /tr {translate} bind def /tnt {dup dup currentrgbcolor 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb} bind def /shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul 4 -2 roll mul srgb} bind def /reencdict 12 dict def /ReEncode { reencdict begin /newcodesandnames exch def /newfontname exch def /basefontname exch def /basefontdict basefontname findfont def /newfont basefontdict maxlength dict def basefontdict { exch dup /FID ne { dup /Encoding eq { exch dup length array copy newfont 3 1 roll put } { exch newfont 3 1 roll put } ifelse } { pop pop } ifelse } forall newfont /FontName newfontname put newcodesandnames aload pop 128 1 255 { newfont /Encoding get exch /.notdef put } for newcodesandnames length 2 idiv { newfont /Encoding get 3 1 roll put } repeat newfontname newfont definefont pop end } def /isovec [ 8#055 /minus 8#200 /grave 8#201 /acute 8#202 /circumflex 8#203 /tilde 8#204 /macron 8#205 /breve 8#206 /dotaccent 8#207 /dieresis 8#210 /ring 8#211 /cedilla 8#212 /hungarumlaut 8#213 /ogonek 8#214 /caron 8#220 /dotlessi 8#230 /oe 8#231 /OE 8#240 /space 8#241 /exclamdown 8#242 /cent 8#243 /sterling 8#244 /currency 8#245 /yen 8#246 /brokenbar 8#247 /section 8#250 /dieresis 8#251 /copyright 8#252 /ordfeminine 8#253 /guillemotleft 8#254 /logicalnot 8#255 /hyphen 8#256 /registered 8#257 /macron 8#260 /degree 8#261 /plusminus 8#262 /twosuperior 8#263 /threesuperior 8#264 /acute 8#265 /mu 8#266 /paragraph 8#267 /periodcentered 8#270 /cedilla 8#271 /onesuperior 8#272 /ordmasculine 8#273 /guillemotright 8#274 /onequarter 8#275 /onehalf 8#276 /threequarters 8#277 /questiondown 8#300 /Agrave 8#301 /Aacute 8#302 /Acircumflex 8#303 /Atilde 8#304 /Adieresis 8#305 /Aring 8#306 /AE 8#307 /Ccedilla 8#310 /Egrave 8#311 /Eacute 8#312 /Ecircumflex 8#313 /Edieresis 8#314 /Igrave 8#315 /Iacute 8#316 /Icircumflex 8#317 /Idieresis 8#320 /Eth 8#321 /Ntilde 8#322 /Ograve 8#323 /Oacute 8#324 /Ocircumflex 8#325 /Otilde 8#326 /Odieresis 8#327 /multiply 8#330 /Oslash 8#331 /Ugrave 8#332 /Uacute 8#333 /Ucircumflex 8#334 /Udieresis 8#335 /Yacute 8#336 /Thorn 8#337 /germandbls 8#340 /agrave 8#341 /aacute 8#342 /acircumflex 8#343 /atilde 8#344 /adieresis 8#345 /aring 8#346 /ae 8#347 /ccedilla 8#350 /egrave 8#351 /eacute 8#352 /ecircumflex 8#353 /edieresis 8#354 /igrave 8#355 /iacute 8#356 /icircumflex 8#357 /idieresis 8#360 /eth 8#361 /ntilde 8#362 /ograve 8#363 /oacute 8#364 /ocircumflex 8#365 /otilde 8#366 /odieresis 8#367 /divide 8#370 /oslash 8#371 /ugrave 8#372 /uacute 8#373 /ucircumflex 8#374 /udieresis 8#375 /yacute 8#376 /thorn 8#377 /ydieresis] def /Times-Bold /Times-Bold-iso isovec ReEncode /Times-Roman /Times-Roman-iso isovec ReEncode /DrawEllipse { /endangle exch def /startangle exch def /yrad exch def /xrad exch def /y exch def /x exch def /savematrix mtrx currentmatrix def x y tr xrad yrad sc 0 0 1 startangle endangle arc closepath savematrix setmatrix } def /$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def /$F2psEnd {$F2psEnteredState restore end} def $F2psBegin 10 setmiterlimit 0 slj 0 slc 0.06000 0.06000 sc % % Fig objects follow % % % here starts figure with depth 51 % Polyline n 4200 1500 m 4200 3900 l 8400 3900 l 6000 1500 l cp gs col7 0.75 shd ef gr % Ellipse 7.500 slw [15 45] 45 sd 1 slc n 5400 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4800 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4200 3300 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4800 3300 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4200 2700 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4200 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6000 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6600 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 7200 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 7800 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 7200 3300 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6600 3300 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6000 3300 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 5400 3300 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4800 2700 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 5400 2700 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6000 2700 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6600 2700 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6000 2100 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 5400 2100 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4800 2100 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4200 2100 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4200 1500 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 4800 1500 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 5400 1500 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 7800 3300 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 8400 3900 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 7200 2700 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6600 2100 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Ellipse [15 45] 45 sd n 6000 1500 75 75 0 360 DrawEllipse gs 0.00 setgray ef gr gs col0 s gr [] 0 sd % Polyline 0 slc gs clippath 9615 5160 m 9615 5040 l 9395 5040 l 9575 5100 l 9395 5160 l cp eoclip n 3000 5100 m 9600 5100 l gs col0 s gr gr % arrowhead 15.000 slw n 9395 5160 m 9575 5100 l 9395 5040 l 9395 5160 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw gs clippath 3060 885 m 2940 885 l 2940 1105 l 3000 925 l 3060 1105 l cp eoclip n 3000 5100 m 3000 900 l gs col0 s gr gr % arrowhead 15.000 slw n 3060 1105 m 3000 925 l 2940 1105 l 3060 1105 l cp gs 0.00 setgray ef gr col0 s % Polyline 7.500 slw n 3000 4500 m 2925 4500 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 3000 3900 m 2925 3900 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 3000 3300 m 2925 3300 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 3600 5100 m 3600 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 4200 5100 m 4200 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 5400 5100 m 5400 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 4800 5100 m 4800 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 6000 5100 m 6000 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 6600 5100 m 6600 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 3000 2700 m 2925 2700 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 3000 1500 m 2925 1500 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 3000 2100 m 2925 2100 l gs 0.00 setgray ef gr gs col0 s gr % Polyline [15 45] 45 sd n 3000 1500 m 9000 1500 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 8400 5100 m 8400 900 l gs col0 s gr [] 0 sd % Polyline n 7200 5100 m 7200 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 7800 5100 m 7800 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline n 8400 5100 m 8400 5175 l gs 0.00 setgray ef gr gs col0 s gr % Polyline [15 45] 45 sd n 3000 3900 m 9000 3900 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 5400 900 m 9600 5100 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 4200 5100 m 4200 900 l gs col0 s gr [] 0 sd /Times-Bold-iso ff 390.00 scf sf 2625 4650 m gs 1 -1 sc (1) col0 sh gr /Times-Bold-iso ff 390.00 scf sf 2625 4050 m gs 1 -1 sc (2) col0 sh gr /Times-Bold-iso ff 390.00 scf sf 3525 5550 m gs 1 -1 sc (1) col0 sh gr /Times-Bold-iso ff 390.00 scf sf 2700 1050 m gs 1 -1 sc (j) col0 sh gr /Times-Roman-iso ff 390.00 scf sf 8025 825 m gs 1 -1 sc (i<=n) col0 sh gr /Times-Bold-iso ff 390.00 scf sf 4125 5550 m gs 1 -1 sc (2) col0 sh gr /Times-Bold-iso ff 390.00 scf sf 8325 5550 m gs 1 -1 sc (n) col0 sh gr /Times-Bold-iso ff 390.00 scf sf 2550 1575 m gs 1 -1 sc (m) col0 sh gr /Times-Roman-iso ff 390.00 scf sf 9075 3975 m gs 1 -1 sc (j>=2) col0 sh gr /Times-Roman-iso ff 390.00 scf sf 9075 1575 m gs 1 -1 sc (j<=m) col0 sh gr /Times-Bold-iso ff 390.00 scf sf 9450 5475 m gs 1 -1 sc (i) col0 sh gr /Times-Roman-iso ff 390.00 scf sf 3825 825 m gs 1 -1 sc (i>=2) col0 sh gr /Times-Roman-iso ff 390.00 scf sf 4875 825 m gs 1 -1 sc (j<=n+2-i) col0 sh gr % here ends figure; $F2psEnd rs showpage cloog-0.18.2/doc/images/tree.txt0000664000175000017500000000054312254312305013341 00000000000000 * | |0 | V i | +-----+-----+ | | | |0 |1 |2 | | | V V V j S2 j | | |0 +--+--+ | | | V |0 |1 S1 | | V V k S4 | |0 | V S3 cloog-0.18.2/doc/images/basic.txt0000664000175000017500000000035412254312305013463 00000000000000 j^ i>=2 | | j<=n+2-i | |\ | i<=n | | \ | m-+-****---+-j<=m | ***** | | ****** | | *******| 2-+-********-j>=2 | | |\ 0-+-+------+--->i | | | 0 2 n cloog-0.18.2/doc/cloog.pdf0000664000175000017500000121325312254314447012210 00000000000000%PDF-1.4 %ÐÔÅØ 1 0 obj << /Length 587 /Filter /FlateDecode >> stream xÚmTM¢@½ó+z&ÎÁ±?tBL$ñ°ãd4›½*´.‰<øï·_•èÌf’W¯_wÕ«îrðãc;Šòê`GæUŠOÛV×&³£øç¾öƒ¤Ê®[vïÖæ6ïWÛ7ñÑTÙÖvb¯“uYt/N¼.³ó5·½êÿ¢¥=åS‚> stream xÚmTM¢@½ó+z&ÎÁ±?tBL0ñ°ãd4›½*´.‰<Ì¿ß~U¢Îf’W¯_u½ªîvðãc;ZäÕÁŽÌ«Ÿ¶­®MfGñÏ}í I•]/¶ìÞ­ÍmÞ¯¶o⣩²­íÄ0^'ë²è^œx]fçkn{ÕÿEK{*ʇuÄpg6;µÞ$4»¢;»µgZ8, ’ü²M[Tå›P¯RJG¤eWxm½ñ­ž÷ŽE™7·¢â žÒ"/²îÑ7»¸¦‘¼ýj;{Y—ÇÊ‹"1þt‹m×|‘£o¼irÛåI É‘c¶×º>[TÒ›ÏEnn#×ÛûþbÅø¹‘ûÒBS¬ØEV嶭÷™möåÉz‘”s…«¹gËüŸµ)gŽÏR©ð133wÄ xAÄbêí;¬ÒaGL6K& 0+‡}&ö"?‘á°(Ò¦Òa/ ¡cì,•!£½¥‰î-fö3¤Ù*IÃx {aªùð”sIC%ÒðhSô¢¨7å£Å}­HÏ=ŤIYƒ¹(îƒêjŧ ÿZóéàü4{ÖØSOØá5˜‡áZ ä®ekxvKº·Ǭü÷…Ü@2aÂ> stream xÚmSÁnâ0½ç+¼$z Ø¨"¤€ÄaKU¢Õ^C<ÐHàDN8ð÷õÌŠV{Hôüæç=üúØS`¾Jñ m}u%ŒÒßE Y]^/`»w¦¶oâÃÕå:1L·ÙÖVÝ‹omy¾èUÿ­àTÙ ÖÃþŽv¹Êó‘DM^ug{¦…Ç‚° ÉpmUÛ7¡^¥”žX[“ÖôÚã{=1î+kܽ¨8 …@iaª²»¯è_^|Ó˜¼¿µ\¶öXq,ÆŸ>ØvîFŽ^‚ñÎp•=‰!9òÌþÚ4gÀêBË¥0pôùÞÞ‹ ˆñs#P~k@hZ+vQÖÚ¦(ÁöA,åRÄÑf€5ÿĦœq8>K¥Â_¸—žX NˆHæžÐÔ3$¤Çž˜{<Ý0Š*¢5cÕ~ÿP÷õʯÂùÝ5WÂ42^!ž0^#žrq‰xƘœE„3xÎü ñ ªz“)cÒgl1BÌîÒ°õ•?ŸXqû!òŠNA‡¨Wš»A*dý1ùÔ)iȧΰÅç“Оó â9ç’†NVf¤¡–kô¯VäaŠžUJü†ôì?%Íš5Ø»bÿTW£=ј«±®–¾Œ¿É5ëñ2éfè&p2pj³V^ócH£Mc†VYxLS7˜E=›þ1âj· ¾gÈÈ endstream endobj 6 0 obj << /Length 330 /Filter /FlateDecode >> stream xÚ}‘OO„0Åï|ŠÛDj§ÓRztÍî&ÆDÜÔòÇ%® ˆ¿½S ÆÃÆp ¯íû½Î 0E0¯˜C”Þä¬zKÔ²ûšÀ²2¨éò( g)ücN‰ž:=û7Er¾sši%3›[V´!Ûf }ÆŠš=ðËëA¤|Ø‹§â*ÙÉÇ/)\µ”ä× Mš@cÃÚä.ò-0PÒ+IˬÑÒ`Œ¸ D‚t·÷(÷Mߌå4ŒA¾¹á«¸¯Ê¾ïú—xóVÛñûÐÔc^É2”Ú!µAKouLÙÖÝÔ }´h gqծ̹PíB¡³Vr©gÕh”_pq7Õ4<ÏnÆH;ºR.çÖ‚‘h2JOÑ Qi>F9*m±Ð–?*Â"áD ¼»ŠXÎò^~NÃ×ñdÿAðïhv×ü(ƃá endstream endobj 5 0 obj << /Type /Page /Contents 6 0 R /Resources 4 0 R /MediaBox [0 0 612 792] /Parent 9 0 R >> endobj 4 0 obj << /Font << /F72 7 0 R /F51 8 0 R >> /ProcSet [ /PDF /Text ] >> endobj 12 0 obj << /Length 1486 /Filter /FlateDecode >> stream xÚVëoÛ6ÿž¿ÂùTˆ4RË0l©ë¦)ÚÂXÜÛºŒL[\$ÑÕ£äßïT?" ƒS<Þïù;Ê‘€ŸÍÄ(¢`OGYy!˜úp!ù+ŽBXü$ Gþ‘ôëÕÅo9’"˜‰™­6¨~2IƒÙ,­Ö£?½/"wz×êrN½û±ÿºûQy¡Îåø¯Õ{Ðë#_ÎNIÍü‹£q&ž^×&#ùתimW°ø‰IL@CH ; wów‹7Ÿ?,î@VHïfñiñëõxy«Q.//Ç~ÅÞ-íÿîš–¾*­×ôÕZZÕnWì™”ƒkðz•E¯p—z¹®5dª"^ÖüEȸZ£ÙÎÍ##9¶µ.Nô¿&ZÆ;Í,ºÒµj­ eìý|9DŸÃpÈ¥‚€9 oµêÚÚ@2þWüÞ•e@€ÂÝ'3o£Ü¦b Z¢™ ­{ …íèø7øg¶Æ–ºÍMµ¥íŽÝÅðà dƒVâ‘®l·Í¯!ìµ¾*ø0WHøæDˆ‚ Âõ±6­>‰0yaZr~2`ŸôêD¥WlèÀű\(`™…$ºÊMƒ"¼’|éTñ§™¾ÁlàÇü'ð†¾]Õ7ÆVÄ 9 Bð*NbL:25vÓ¢U-¬ä|Ì ™áAN|œyÍ—|ÕîÄÔeWaˆêìŸC^ìsh(‰M…1±D—иøÌ9õv5×a—9 €WÑâ 4uŠÛo¦1­Ë0î´ÊЭœµS-èmíB(© !xz-]e7'ú»ŠÂG'NíT­ ¬jó¶k,&Þ ''“øÔ#`rÙƒ†]Cœ])4f[õ߬Ë W…æ¹lZÃG™%gj[Ë5‰ϵZUUgªŽÉ,õÊzöÔåc’Ý·Ò .ßÅ'ŒIü™BI5P‰XŠ†éìk‡­âè¦ZѬµÞ8´±ÉY`c‹‚zÕ¥I;E $^‰ v+5ÊžìºûÂdªuit—¸rs×|}W´ ±oj[ö|z(ß]ÃXh7²Ç)Æ=µƒ‹k-'ÆcȸA¾0÷hˆª÷?¡i8 ¦ÝhFür[-k›Áx€H4O0D|åL•2€Ö>÷®ÍñNœb?}:îigÙóÕ@´¦-ôAnëÓÜ®™tCxࢊ{ë‹~,û(hÿDÝÐ¥ñK+oâZ¨gƒû\`¥¿#¦ÉTl­?¤çÞÚ‡SÃqyZ^ÏW¯dD»ÛÅbÁ_U«ëÊyÑ›9·Ôž®2Öþ½°¹Ÿià[¡YîºÎr¨è¬íj–t½G*Ë)ŽbµÒY^™¯nþË•½tìE$/—øjƒ¶º9KUêCÑ &¶´U›Ÿq7î±t¯ëçÁ Ôz]ëæp…LRzß©Ê/tã/MÕ<“'C%ø<4ëý—…=·;׸µÙæ„5¨2‰ƒ0F"ˆú×DFú&âD_ˆhä±l%C7Ë8Hâ\t\ÔF®H¸‰±Yݳ/N£Ã³/î[…ðΟ$A:ž Þ’@³4 MÜ(NÊGñă‘ÃÇá‰í€)c·ÇÓØÃgdzm˜(÷ƒÈØáø8@¬dè5›=ëÉé&t”u嬡«Ö"ƒÀ …ÀR–:›kÜýŽ°âæÓgúx‹ÏÖZ3ùÍùU=ÂÂÙ“éªÑü$ý ýêŸ!x,ƒ>479=sq>0j q¸þôÖ»¤òkå;/•?T¼h˜{CN½Úâ,Ai¦ M:"(\"JGŠ†àQWgr¹x å`’ßÐ;ã)>‰ rbÎb~(’b6‡/8Õ±ÇGï³þ·øl³Õ•ìm•WTÖɌֲêrWð4Z*ÓÌ~Ç#ÈQ$Xðµ…²ï~¼&¢¥”`‚HiÿùîÚõÅÅbuñ/®¯‘ endstream endobj 11 0 obj << /Type /Page /Contents 12 0 R /Resources 10 0 R /MediaBox [0 0 612 792] /Parent 9 0 R >> endobj 10 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F60 14 0 R >> /ProcSet [ /PDF /Text ] >> endobj 58 0 obj << /Length 2655 /Filter /FlateDecode >> stream xÚíœ]sÛ¸†ïó+tWy¦B‰o²“ÙNó±ÝvÒI[{Û‹¶ŒL¯9¡%E¤œ¤¿¾ ðu(06kÇÎZ“™X–ñÊx€ ñ¬Pÿð¬*f’RT±r¶¼zV˜wß?ÃæÕB,@Ä‹³g¿ûžã.PUTxvv1ã¸D•tÍœÏþ=oOþ{ö—g¯Ï\;œ[„ƈJ’Ì°Ds6*©Ï"J†0eZåì¤bóú]ל,¨äóõ…þúr½:¡x>4úK?~ÝC” 26¥~+†QÁ„n Ÿ,0&|þg}Év­ZÂóóÝrhUcûëÕ¯®Çê5Lµ³¿þ÷êz!õ1ù.ÿÍ/½î«½ 9ðš©ž­èL0ŠŠRÛH©~ åÐtº±ÎwßÙ ÇUy1‘¼IØqCiÊ2.˜âÍHp£„F:Š¢˜¿¨ûvYwÝ瓒Ϋ¡tþñ²~Óë×ÃåH"eóÍÉ‚Èùº]¨/ƒþá4F¼šè Œ$£¯Õ ~ÔØbÜšæG‡.|lÀÕƒüxÅ>)G¦ˆU•Å‡|^5ÿ)0[µ«Ÿ4µ†åôÏ—*d^¯Ô+ûc6»=o¶ªÔ§ŸŸ.ëah¶îÒïGw«}zêC`^!"ñ‚õKŽ™iú$ÏMœ²v3 ú Dc†HM3šq¸šqXQZ=OüØk+Ôl£ý8í¼Ñ³ÆúOúûÓõÅ0Î&ÇÿêmšFˆš;KYÝåø¿CÃùÜvDN>±ñ|>éYòJFü;T H.äX£h]>ÿ£Lí¶ô˜{ý©¾ÚtM0U1B`Dýj"©Â˜••)|l"Q@÷ÃœyÅf)Gg¨Ä6!¹¼ÿ¯1YoÛ¡ó»IîgºT ªâÜìËa„<*V“Î7Uk>Dc1žŒ-y@ùàQÐiD ˆÆ˜JJa\¡Rª\%K!8 tOA¢1P’RR"µ÷ Øü“*ñ)÷ø„Ù!*ÍqŒ¿¡ÅJÌgÓSy>ûà”Ï°óË Ï@4æsRÊÍ2˜#*\1CË/ÕÂÔY¼¯E•™ª Y•ˆ°êXÉÜyc‡¶Ó ]nKòfb 8ÄÛA“z‰Yª1à’Z¸Båì€c8ÏØž¹·›èj«Æý½'AÜÃLa– ãUj>8…´÷M j µ¤–ÃX©4…p¨¹bçMÝ›*ùU³.u=¬=yWíÿLE=nÿŽóØvÝÉDªÂˆn·èôUÏÏÇv¿ ÑËÕ×YøE\µÝ’å*N¸:éé°«P5âjZ˹*9ª0÷®ÚÊÄ­¼ïÂVŠw‹¤ÅÅí¶–¨`÷¼CóÓtHžŸ>8å'ì㈟@5ægRËù)’øikSU<6W¦Ž\|l{³|®Wçú…ÑÌXç}Ü~v›ý«¥T9[`Š°úÐûO¶ÖÒ⻋ÞlÖ»wº>¶Ð.ŸB]Ã’UH`–‰¥Nai¢4–ÁMZ¨Ã2©å°¤1A=–¶R9m÷›z0\+åæ“~ï‡]Î)TSesJi’Ê»õºkêU0­¨$èã.ubö›þ˳ߧ쇖Dìª1û“ZÎ~BÅÀ~nì»ZóÏÚ+“NlíºÑ?xÝ©T³‚+ß)RŒ»–ƒõÐe€P‹û!f¡éƒ< }pÊBØ­˜-ª1 “ZÎB¬ûÌY(Œ…¯?ìê®Æ‘ûYwýéfÛÔçã‚7ä—ZHSw~Ñô›<ÃÈ/RfÇÜzdú-Ïvœ²Z±¨ÆlOjYÛi%Q±·]Þ¬ß4×£ûÍx£ÔŒ¾‹õ6‡U¾L|aèXèšë¦ ’ TÀÍᎈé¶×²LÁ Ó'F`2ªFLOk9ÓKŠJL/CE¤ÎÖ/ºõþDÅrœµß]ÆS—ßuëåûŒ1_Tñ-ÎÖ¶ÿòì÷Á)û¡%ûjÌþ¤–³_H÷+»ÐŸŅö=oúåŠ2Žý‚¯7‘·{>îFN¿á}lë—îÃ<\l ` Þ)’1ûSBÎ}®ÌãØç)²¶~\©õ_¸Vgq)|šÛYìtüm[˜¨ÏÌïnêùe~ë<Ã|pÊ1Ø‘Ë€j̳¤–3G- ivwîåújÓvæ$æ~‘µÄçM¸8o™x§–?¿®»]¹¥2ùánÌWÓ1y¾úà”¯°¯#¾Õ˜¯I-ç«Zæ^_ ¸§”ëjQ!Zù’{9¹ô–|<‚blŽym:+Ïkœòö?ž&€ª1¯“ZÎk\ª\+×vïîínO¢¬•r’YM*~¾Þ_®ŸÇ3¶ò‰ßî‰dÈȧ‚¦âà)¨(©åo rÝe{»Ù§‡fuºTÕ[¨`+(G›fÕûÐéÞ[CÍx•‡šN¡íÇÁ“ZP5†ZRË¡&Ôš´`5»±ù÷]Ûk-¡?¥ƒì<ø}$21ÒáC$﹤zÉ0†Ÿñ/?œÂ"Á¨ÆðKjÙs[„õa~üੇý)P»9’|ðA5#ËãÔxÿ¼ÃòxóÁ)Þ Þ€jŒ·­IB±÷yéÏxHêMûn[o?‡Ÿ*,û³QTovÛH[§c 8ôtÔA“zøOô@Õ˜uZ‘TQT3+Rwêîðˆç«z¨Ý¾ün9ì¶MoÏðôËm»‰ÇU…þæËëظ5½—7n}pjÜBC"æÕ˜ùI-[¦ŒGç„dÎ|ogìÿiO.xÏ\ÅôøPÜýÏ Ö¤,Æ@p‚±‰ïaÆ j„±´¦ •Tå·²@œPÀ˜£¬í»àÐج8’%òÉk[u>8E$!BPQ—Ôr™MHUºO¹‘ÙþZÛöSðh€@Œ¼›(Ö—<¬|p +hu+ Ã*©å°âlRÌaEo`eÎ .§Tê«èñiÞ»< eÉʧ€‚&“àÑU¨*©åfÇñoÙƒ{ Üìø·ñÔºû¬JÁú gÉûJRÆ”<¦|pŠ)è3 ª„ª1¦’ZŽ)"Qs”›üŽ×#.¸´ky̹Ørƒq^2\JÈMŠ˜!)=oìæ"Ò?‡š1F¼”OüOaýò¬¥mÈÈŦ¾Fò’1€RB.a©ÂHØ¿©±'è8 >ü$hLÉãɧ€‚>Gˆª1¤’Z–©²DL”©ã$øø'AãZs>6Ä LtÀýÆf endstream endobj 57 0 obj << /Type /Page /Contents 58 0 R /Resources 56 0 R /MediaBox [0 0 612 792] /Parent 9 0 R /Annots [ 15 0 R 16 0 R 17 0 R 18 0 R 19 0 R 20 0 R 21 0 R 22 0 R 23 0 R 24 0 R 25 0 R 26 0 R 27 0 R 28 0 R 29 0 R 30 0 R 31 0 R 32 0 R 33 0 R 34 0 R 35 0 R 36 0 R 37 0 R 38 0 R 39 0 R 40 0 R 41 0 R 42 0 R 43 0 R 44 0 R 45 0 R 46 0 R 47 0 R 48 0 R 49 0 R 50 0 R 51 0 R 52 0 R 53 0 R ] >> endobj 15 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [441.93 643.088 450 653.051] /A << /S /GoTo /D (1) >> >> endobj 16 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [444.545 624.529 450 634.226] /A << /S /GoTo /D (1) >> >> endobj 17 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [444.545 611.378 450 621.075] /A << /S /GoTo /D (2) >> >> endobj 18 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [441.93 581.619 450 594.371] /A << /S /GoTo /D (5) >> >> endobj 19 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [444.545 565.849 450 575.546] /A << /S /GoTo /D (5) >> >> endobj 20 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [444.545 552.698 450 562.395] /A << /S /GoTo /D (6) >> >> endobj 21 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [444.545 539.548 450 549.123] /A << /S /GoTo /D (7) >> >> endobj 22 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [444.545 526.397 450 535.973] /A << /S /GoTo /D (8) >> >> endobj 23 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 513.246 450 522.943] /A << /S /GoTo /D (10) >> >> endobj 24 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 500.096 450 509.671] /A << /S /GoTo /D (11) >> >> endobj 25 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 486.642 450 496.642] /A << /S /GoTo /D (11) >> >> endobj 26 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 473.491 450 483.491] /A << /S /GoTo /D (11) >> >> endobj 27 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 447.19 450 456.644] /A << /S /GoTo /D (12) >> >> endobj 28 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 434.342 450 444.039] /A << /S /GoTo /D (12) >> >> endobj 29 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 421.191 450 430.888] /A << /S /GoTo /D (13) >> >> endobj 30 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 407.738 450 417.738] /A << /S /GoTo /D (13) >> >> endobj 31 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 394.587 450 404.587] /A << /S /GoTo /D (14) >> >> endobj 32 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 383.861 450 391.436] /A << /S /GoTo /D (14) >> >> endobj 33 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 368.589 450 378.286] /A << /S /GoTo /D (15) >> >> endobj 34 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 355.135 450 365.135] /A << /S /GoTo /D (15) >> >> endobj 35 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 341.984 450 351.984] /A << /S /GoTo /D (15) >> >> endobj 36 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 331.258 450 338.834] /A << /S /GoTo /D (16) >> >> endobj 37 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 315.683 450 325.562] /A << /S /GoTo /D (17) >> >> endobj 38 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 302.532 450 312.411] /A << /S /GoTo /D (17) >> >> endobj 39 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 289.382 450 299.382] /A << /S /GoTo /D (17) >> >> endobj 40 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 278.655 450 286.11] /A << /S /GoTo /D (18) >> >> endobj 41 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 263.08 450 272.959] /A << /S /GoTo /D (18) >> >> endobj 42 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 250.233 450 259.93] /A << /S /GoTo /D (18) >> >> endobj 43 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [433.861 220.473 450 233.226] /A << /S /GoTo /D (21) >> >> endobj 44 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 204.703 450 214.279] /A << /S /GoTo /D (21) >> >> endobj 45 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 191.553 450 201.25] /A << /S /GoTo /D (21) >> >> endobj 46 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 180.523 450 188.099] /A << /S /GoTo /D (21) >> >> endobj 47 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 165.251 450 174.948] /A << /S /GoTo /D (21) >> >> endobj 48 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 152.101 450 161.798] /A << /S /GoTo /D (22) >> >> endobj 49 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 138.95 450 148.647] /A << /S /GoTo /D (23) >> >> endobj 50 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 127.92 450 135.496] /A << /S /GoTo /D (23) >> >> endobj 51 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 112.649 450 122.346] /A << /S /GoTo /D (23) >> >> endobj 52 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 99.498 450 109.195] /A << /S /GoTo /D (23) >> >> endobj 53 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 88.468 450 96.044] /A << /S /GoTo /D (23) >> >> endobj 59 0 obj << /D [57 0 R /XYZ 90 720 null] >> endobj 56 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F97 60 0 R /F59 61 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 101 0 obj << /Length 1426 /Filter /FlateDecode >> stream xÚíšËrÛ6†÷~ -©…P\ ¢ËÄq¦wœ‰åUÛ«Ð.§åRT¦éÓ$.%FÝ\ìZ“…Hú?…ÿËÁÁ!Ñ Êh&àŒ-f«ÍÔWÿ8Cúh!NÄ«åÙw Í 4[ÞºC,?Ì~Îêz¾@œbš½¾ÜΘgÛ·ó!4[ô$+ÕǺÿc‘mïÕé]ÕTmÙm[{«H¶[•MS7wêì^}gýé÷êC[Î]þxöfiï–aüÀÏé#ø= PÅŒËkpõ£@€Éß!Ì^›;¿»iêms¾Ý”uÓߊILF" B¤ò0Æ÷òû9WùäÌ{1!ä?^üƒ8F‰ýl™Éî]¸‘€0×;»p‚=þ9Ì=¦GÊ NTYé#ÐB„‚‚àY.rÉŒË @š–z·ö±ÁÈyþ2Ðøö êŒmIÔ9Áê&$ø©sUÔŵL†Ê 8ÉGêò£ uÝ•]µ©š¹<ë¼9 !À1=å¨Ä‹!’´i$Á1’\w1ó’䨆HŠjY’8¬`#Iüˆ¤«ûN.v;/C,Ä#zé`…ˆÒ–¤5Ljr]娆ˆŠjY¢”8DGDýÐÜï½9©(9Ñôo7„˜ö( ±18†˜k;νˆ9ª!Ä¢Z1Jå]Ó1¡;ßoô¦Bí@ ½!™BnØ`\ÔëJ]¼˜$Û7s”­är™D™ÌtÞD'ÈŸÓZ2^Ï\šñcpÌx׌€ñŽjÈø¨‚TîÛè,'hØWiã±É,f_í»@‚,þtSÌ3¬¾C¤i«ÒHƒc¤¹îHsTC¤Eµ,iˆQXÒˆ&í}ÕµuõÑv%>öåuÕ'V&]PË™D†TS7·ÛvSv¡¬Â (~ ^=ËiŒÁ1H&ÆA/$Žj’¨–…ª&€†„jHÞüUnîͳ½U(\Ö¿I0Ú²ý¤Îoºz]ÿAC ýÿß…ÐÐs›†ÆCcb— G5„FTË”(LÈMy,¶+ôªÜÕ+…†D"&U}9µq 3¯IX8Á,¦Vy±pUXĵ,¼Œ8X˜æzÒìî[‡ÃÁuÕù7Þ(óSóæ±iÒ0ƒcM¬E^ŒÕFZÏ„æX?qaTª«í~ÁA˜ÉÍÍ®+×k…gª&¨¯‡vwArù­ç•J»˜È+GfÒân«ÐÅë1à`@åµ·ŸâH†¬ž ùK &!ÔT«Èe½ªš]åK 99a§ªO¼Œ¥i¹g Žå—’ŽjȨ–%²_ʘ%ÛÑŸûºµO¼«–Àò??¡É¿n)mKn ŽçBÎQ Õ²5Ì·¸Ùøn®Þè7VC­ô dp;<«(×òyë&Œ-Ð ÁÍÐ`BA&4ÆÏèi€«b'¢bÈ¡‚¹ÊŽì˜dõö§wG[°D€ÐP 3ÃI`8Á4&¦o—ÏU à×2k-äÍ  ô“ížšR[îÓU›Ï‡åqrzÃãáRÈÌ>cp ×Ò>ŽjŸ¨–Å'盷ߨíÿ]éâ> endobj 54 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 707.916 450 717.613] /A << /S /GoTo /D (24) >> >> endobj 55 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 696.887 450 704.462] /A << /S /GoTo /D (24) >> >> endobj 80 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 681.615 450 691.312] /A << /S /GoTo /D (25) >> >> endobj 81 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 668.464 450 678.161] /A << /S /GoTo /D (25) >> >> endobj 82 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 655.313 450 665.01] /A << /S /GoTo /D (26) >> >> endobj 83 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 642.163 450 651.86] /A << /S /GoTo /D (26) >> >> endobj 84 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 629.012 450 638.588] /A << /S /GoTo /D (26) >> >> endobj 85 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 615.861 450 625.558] /A << /S /GoTo /D (30) >> >> endobj 86 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 602.711 450 612.408] /A << /S /GoTo /D (30) >> >> endobj 87 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 589.56 450 599.257] /A << /S /GoTo /D (30) >> >> endobj 88 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 576.409 450 586.106] /A << /S /GoTo /D (31) >> >> endobj 89 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [433.861 546.65 450 559.402] /A << /S /GoTo /D (35) >> >> endobj 90 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 533.001 450 540.456] /A << /S /GoTo /D (35) >> >> endobj 91 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 517.729 450 527.305] /A << /S /GoTo /D (35) >> >> endobj 92 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 503.973 450 514.882] /A << /S /GoTo /D (35) >> >> endobj 93 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 490.822 450 501.731] /A << /S /GoTo /D (36) >> >> endobj 94 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 480.399 450 487.974] /A << /S /GoTo /D (36) >> >> endobj 95 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 465.127 450 474.824] /A << /S /GoTo /D (37) >> >> endobj 96 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [439.091 454.097 450 461.673] /A << /S /GoTo /D (38) >> >> endobj 97 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [433.861 425.006 450 434.969] /A << /S /GoTo /D (39) >> >> endobj 98 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [433.861 392.628 450 402.59] /A << /S /GoTo /D (41) >> >> endobj 102 0 obj << /D [100 0 R /XYZ 90 720 null] >> endobj 99 0 obj << /Font << /F51 8 0 R /F59 61 0 R /F72 7 0 R /F97 60 0 R >> /ProcSet [ /PDF /Text ] >> endobj 114 0 obj << /S /GoTo /D (Introduction) >> endobj 117 0 obj (Introduction) endobj 118 0 obj << /S /GoTo /D (Basics) >> endobj 121 0 obj (Basically, what's the point ?) endobj 122 0 obj << /S /GoTo /D (Scattering) >> endobj 125 0 obj (Defining a Scanning Order: Scattering Functions) endobj 126 0 obj << /S /GoTo /D (CLooG Software) >> endobj 129 0 obj (Using the CLooG Software) endobj 130 0 obj << /S /GoTo /D (A First Example) >> endobj 133 0 obj (A First Example) endobj 134 0 obj << /S /GoTo /D (Writing The Input File) >> endobj 137 0 obj (Writing The Input File) endobj 138 0 obj << /S /GoTo /D (Domain Representation) >> endobj 141 0 obj (Domain Representation) endobj 142 0 obj << /S /GoTo /D (Scattering Representation) >> endobj 145 0 obj (Scattering Function Representation) endobj 146 0 obj << /S /GoTo /D (Calling CLooG) >> endobj 149 0 obj (Calling CLooG) endobj 150 0 obj << /S /GoTo /D (CLooG Options) >> endobj 153 0 obj (CLooG Options) endobj 154 0 obj << /S /GoTo /D (Last Depth to Optimize Control) >> endobj 157 0 obj (Last Depth to Optimize Control -l ) endobj 158 0 obj << /S /GoTo /D (First Depth to Optimize Control) >> endobj 161 0 obj (First Depth to Optimize Control -f ) endobj 162 0 obj << /S /GoTo /D (Statement-wise First and Last Depths to Optimize Control) >> endobj 165 0 obj (Statement-wise First and Last Depths to Optimize Control options->fs, options->ls) endobj 166 0 obj << /S /GoTo /D (Simple Convex Hull) >> endobj 169 0 obj (Simple Convex Hull -sh ) endobj 170 0 obj << /S /GoTo /D (Once Time Loop Elimination) >> endobj 173 0 obj (Once Time Loop Elimination -otl ) endobj 174 0 obj << /S /GoTo /D (Equality Spreading) >> endobj 177 0 obj (Equality Spreading -esp ) endobj 178 0 obj << /S /GoTo /D (First Level for Spreading) >> endobj 181 0 obj (First Level for Spreading -fsp ) endobj 182 0 obj << /S /GoTo /D (Statement Block) >> endobj 185 0 obj (Statement Block -block ) endobj 186 0 obj << /S /GoTo /D (Loop Strides) >> endobj 189 0 obj (Loop Strides -strides ) endobj 190 0 obj << /S /GoTo /D (Unrolling) >> endobj 193 0 obj (First Depth to Unroll -first-unroll ) endobj 194 0 obj << /S /GoTo /D (Compilable Code) >> endobj 197 0 obj (Compilable Code -compilable ) endobj 198 0 obj << /S /GoTo /D (Callable Code) >> endobj 201 0 obj (Callable Code -callable ) endobj 202 0 obj << /S /GoTo /D (Output) >> endobj 205 0 obj (Output -o ) endobj 206 0 obj << /S /GoTo /D (OpenScop) >> endobj 209 0 obj (OpenScop -openscop) endobj 210 0 obj << /S /GoTo /D (Help) >> endobj 213 0 obj (Help --help or -h) endobj 214 0 obj << /S /GoTo /D (Version) >> endobj 217 0 obj (Version --version or -v) endobj 218 0 obj << /S /GoTo /D (Quiet) >> endobj 221 0 obj (Quiet --quiet or -q) endobj 222 0 obj << /S /GoTo /D (Full Example) >> endobj 225 0 obj (A Full Example) endobj 226 0 obj << /S /GoTo /D (CLooG Library) >> endobj 229 0 obj (Using the CLooG Library) endobj 230 0 obj << /S /GoTo /D (CLooG Data Structures) >> endobj 233 0 obj (CLooG Data Structures Description) endobj 234 0 obj << /S /GoTo /D (CloogState) >> endobj 237 0 obj (CloogState) endobj 238 0 obj << /S /GoTo /D (CloogState/isl) >> endobj 241 0 obj (isl) endobj 242 0 obj << /S /GoTo /D (CloogMatrix) >> endobj 245 0 obj (CloogMatrix) endobj 246 0 obj << /S /GoTo /D (CloogDomain) >> endobj 249 0 obj (CloogDomain) endobj 250 0 obj << /S /GoTo /D (CloogDomain/PolyLib) >> endobj 253 0 obj (PolyLib) endobj 254 0 obj << /S /GoTo /D (CloogDomain/isl) >> endobj 257 0 obj (isl) endobj 258 0 obj << /S /GoTo /D (CloogScattering) >> endobj 261 0 obj (CloogScattering) endobj 262 0 obj << /S /GoTo /D (CloogScattering/PolyLib) >> endobj 265 0 obj (PolyLib) endobj 266 0 obj << /S /GoTo /D (CloogScattering/isl) >> endobj 269 0 obj (isl) endobj 270 0 obj << /S /GoTo /D (CloogUnionDomain) >> endobj 273 0 obj (CloogUnionDomain) endobj 274 0 obj << /S /GoTo /D (CloogUnionDomain/isl) >> endobj 277 0 obj (isl) endobj 278 0 obj << /S /GoTo /D (CloogStatement) >> endobj 281 0 obj (CloogStatement) endobj 282 0 obj << /S /GoTo /D (CloogOptions) >> endobj 285 0 obj (CloogOptions) endobj 286 0 obj << /S /GoTo /D (CloogInput) >> endobj 289 0 obj (CloogInput) endobj 290 0 obj << /S /GoTo /D (Dump CLooG Input File Function) >> endobj 293 0 obj (Dump CLooG Input File Function) endobj 294 0 obj << /S /GoTo /D (CLooG Output) >> endobj 297 0 obj (CLooG Output) endobj 298 0 obj << /S /GoTo /D (Retrieving version information) >> endobj 301 0 obj (Retrieving version information) endobj 302 0 obj << /S /GoTo /D (Example of Library Utilization) >> endobj 305 0 obj (Example of Library Utilization) endobj 306 0 obj << /S /GoTo /D (Basic Library Utilization) >> endobj 309 0 obj (Basic Library Utilization) endobj 310 0 obj << /S /GoTo /D (Scanning isl Sets) >> endobj 313 0 obj (Scanning isl Sets) endobj 314 0 obj << /S /GoTo /D (Installing) >> endobj 317 0 obj (Installing CLooG) endobj 318 0 obj << /S /GoTo /D (License) >> endobj 321 0 obj (License) endobj 322 0 obj << /S /GoTo /D (Requirements) >> endobj 325 0 obj (Requirements) endobj 326 0 obj << /S /GoTo /D (PolyLib) >> endobj 329 0 obj (PolyLib \(optional\)) endobj 330 0 obj << /S /GoTo /D (GMP Library) >> endobj 333 0 obj (GMP Library \(optional\)) endobj 334 0 obj << /S /GoTo /D (Basic Installation) >> endobj 337 0 obj (CLooG Basic Installation) endobj 338 0 obj << /S /GoTo /D (Optional Features) >> endobj 341 0 obj (Optional Features) endobj 342 0 obj << /S /GoTo /D (Uninstallation) >> endobj 345 0 obj (Uninstallation) endobj 346 0 obj << /S /GoTo /D (Documentation) >> endobj 349 0 obj (Documentation) endobj 350 0 obj << /S /GoTo /D (References) >> endobj 353 0 obj (References) endobj 360 0 obj << /Length 3533 /Filter /FlateDecode >> stream xÚZYÜ6~÷¯˜·h°nEÔ­ Ánbl /œc³~Ú$Àr$v7mQòÌä×o]T«{4v`ÀÍ£D«ŠU_GÝDðOÝTÑM‘$a•–7u÷"’Ñ/”´v@°[Q|÷îÅ—ßgêFEaUêæÝ~½Ä»ææ×àÕQŸ&3Þî’$ ÔW·»4Í‚7ým\Ó8Üîà·™ëÉ=¶3¥uûû»½øç»e×,Ž?ÃR<᫈oTÆ*K…¯¼LC•¤Ì—ºÝeyŒœ$Š9_Ï 0p}.8xœ…Q%§zˬ¯á»"¬ã_Í?ûÑlöžõÿÓ£²¾áFkïF=>rç³*èoU@z²ýWjqÇ"NŽûûaäÏ\­û^Èòà¿»sÖ>M3êÎY$Á»£ž<«/ñ|x •„ NI'²8]fÁo‘JûÆqGóO-z2ž$‹Lx€•ó( lÏ£¯^òï÷·ÀåOÀû/·%ìûË·?†aŸ(&Ÿ˜ ®Q*GC»åïó´e1‡Q·<"“ öòÛ s$X¬@Øç<éQw,ÒþiP Y<XZ¥Á+TÁ[‘ùk&rÿ~´Óä'§.8´ ˜(!#³Gi¬e ݃éͨ½1.‡3ŒÃ]k:ø ªÄ@²Ãi²ý“,'ê¡;ÙÖŒŽ§ï´£#eϼyÄ(PÓÀÂñŽÏߘ¥’¤Áæ# ߌðikœãuÈvÐd«™v™~`ãß28”O^420´Ñ³ã¸%m©€}ÀʨY±aön¶mÃÍzðn ¤ˆ=OC§'ÍÓ,híá¸k…sÔBËãî‘¿´²7ß©hÙo·YZ0)Ú'…N›6æ ª:KÖ«â@Ÿ@õ 9TþƒíX·0£Ø†‘‚ösO^ˆD^\º˜î42ýÈЉ[$N\¤_M;;ÍËFqp4ä`Ob0…³ad·œÂÞ`×£CÎbð₺·HDq‘-"š¸ë&=™Ý°ßÁNòÝÊä±»2yêëök:vÜýГèîýìjË üÌleñ['·i“Q+p3ÿj6êr½Ž£{sÆ\G¡8Q¡RÅM–çaUV‰Â¸„ “l<ínE¼+¯—$ÎÖ£èw4{U»:Û铸˜D%ì«.8z=Õgx¹^Œxa·»ßƒ|¸5Ì£4èj÷ܱ™vð-ë _-'¢¦;„²¿è@ÅŽ”¶‹•0·ÖÝ3 P*†ð fIX&å'àiw+âC_/É øN»(%@dņT…ªŒ/8zªOõ9^®[€\¥Á‰¯ÛÈI<¼1·-·È'à–?[2ºþYî/‡½‚¯_!§þ˜uk'v¸i×$ø©÷kÈîGÐ%ˆŠä`+¯±ÞC]F5è:ºÜbÖ•xZµ8Uœ{¿{qüVŽ=ö™‚ˆFßÙ…sž”Olï¦ÑƒKbÇ#î‚$ÅÉþ$Ïx“ÆqMpz|~hˆé˜cîpÝý]ƒ™÷n&O mTcž˜ñ!Pßé†û—! :݃ÁùëÃÔ ‘`ôÃäYé$Z o¾2ƒuêí£ìQÐ¥wÕÅÔ©'ßl˜`ÑáKü•¸ŠK xi"»CiÇÉåRMc€Õ˜+aÇJŸÓXr`q&Ù¦†¼TW1+l°iœbÖ,× m QHÚNÚãÒKB²TS ÎÍ­LÃÒzþruï(ràG‚½®#Xƒ¹K¡Šàm{ˆàP^âY :ñж¼…Û /KºîAØ*¿_"Ì^Ê+¿dô­ iæ–Â: 09Cõgé’÷‚œ)Cë|i!S^ N&P'‹¤Z"*™,"¢[ô›“‰r®8lìJjX®[€GÿÅÄ#œ>¤ÆZÎã¸1Ê Ãñâ±3Âe ¼Æ Ô¾a(„Ë­¤¯äþP$Ç×CǺNf.×ìþ=Ìà ÄÆŒÿNO¾%CóiU¡kÛúíD„&®Y¶^iŒ©QKfXœ1,v By‹çÔònž¸Cû#%Fó‘+ 8ðíÏo˜„P26ÄWšž»æñ¢15Zo9ÅÀ3$r=:4q´0ö€Ê?®Ê>UÄ•dYE‚ü¡ÁçÄÖ«CG ›ëÚ8Gwû;VUµì{ù© ÈB©õqE`§x Ä·<Øä­ÄˆƒŽF¼Á8Éö\[…Fo .ªVt=ŸÖ6°>K™H%‘çZ,tHØS¬èlš'nby¨•awÔ"Dä=)ƒ7]-Vã}DÃÕýî=ÖïÐ~‡Ž;âðA6øÆRÛRÛ«Jv¶²t£ùc6N2¾lèØO–‘'“4Æ:gZ^ÐQ¨ÖA¨É¦†™éYæÙ–…aÖw ×E¦Y†æEõ0ÛšM„NGOÒƒ.ëºðº†öOip7ж±yoÝ‘+r2PƒŸ´µŸ^–’„ ¹ù:˜¨Á«Ž~beÈÐ7>¯‚xU¡¶[…Y*øI¸”s'Ëî8ÇëÈ›'a”+›ÓtúêË/ïïïC@ôÃëpÛp»„ŒÛ5È«Š—›c\„#GÓ]ÎÕ¦mÞi7 p° ŽTV†I¾@ùlퟅE\x ÛV‡{a¢±#8ºVjô->À¤a’æ1~»KÒ,L’1]˜Wþ&”‡µ¶¦Ü¬JH‡E!QO_8nKõ•¬#‰é~&žüû3/6ª‚û$µ¬7T1HW vúKœ‚®GPQ“¯–G€—BÁ®ZþWn]­—V›$\'ØÜŸn˜†K癥ðŒTp‘`SzáÁìªw¶1ž³a†—O'q•_=8¤,¬¢¢ 50Ÿérüé»H‚˜jÈøæ-|ò_Ñ»Ž£K…SœrU9Å]Yâ®`Ÿñ?L/ÃNoøý {¬¬«Li¾K0b'ðc{n_ig QS×Ó,”ª˜íEí2å’Mzv¡ç:Êeq~ÁžØ¹BQ¬ŸJ )@IŸžH%-/‰[-8-$“*ÙV)µP„í•ŒfUíÃî¥Pžìå‹í>9Ó“o7pC;O(J*ØÃ${º+[”eGzÝ]½\•™ç¡úƒãÎ×ý;‚<gK.Ó K–W@úþ88ù²Ñçžç‡ÃóSFyÎ5°ýˆ›ÐÑaƒf ´‹ã>ñ|u´ËkeŒ2 RbªžègÏî Žƒ÷R&T×Þæ&®ËÎ k÷<«¹{q§¹ ŠÄ—ï¦ð™„O‘¥5‚  f°g¡ClÔqWJÞN}A†Á7…S•‰< ’‡$®<ÈVqК[ãM9)M‡¹Îö–ë¦ÝK~èôÃÕˆ| Ù±‘÷2yÎZæ ªñ~ñ¶ .a¹5{fªI_ið3˜$ éG¦8k ˆ®ðU’®¬‰Ï/ ÐIâúΡ7‘H’¬#ÉF%Qê-:á´Ì p¥xÚì/2kÆ#מR¦ðàܹ(òÄæ“Ø€'õÛ—§\öÈ9 ¤r½h‹”½ÕV×õrŸM›Ø{¤ 3°ìü|Šcš¸6˜BfN›ù‰‚0€ç»klÇÏGhÚ8ëNºÆ¤9M*¬áµ”hÑÇ ’˺KeåñK3tÚnþ­G’yYš,q㥤®ý1ÎJ®‘  Ö6(¡¾Ä ‘5ˆ•t”ŠÁu‘H-§À¥ù(£U‰Ù˜iÞ—*øÃó+rž=Q úg`hþo &y–Ù"'ûY$ø/Æ0ÿÙUUX%‰ÿäý_^TþŒ…qšoÕcP„èÎWOÄø)fÛ ÁEvŒ‹-‰TXd+ù’mÉ h©>sºÐsš-vÓýµã©% aûy±-ºèÿòº^Ë–?|qgékg“TX¦å•ç$g,o.-ùmphdTbøôÕ¦DÊ°¼ômñ×ßد¿ÙÊ›`æý×ßt[ÑÆû¿Å;ë« ÿ®`Ú, endstream endobj 359 0 obj << /Type /Page /Contents 360 0 R /Resources 358 0 R /MediaBox [0 0 612 792] /Parent 9 0 R /Annots [ 354 0 R 355 0 R 356 0 R 357 0 R ] >> endobj 354 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [231.117 564.262 308.351 575.171] /A << /S /GoTo /D (Qui00) >> >> endobj 355 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [112.131 551.111 190.182 562.02] /A << /S /GoTo /D (Bas04) >> >> endobj 356 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [273.977 469.819 355.254 480.728] /A << /S /GoTo /D (Bas03a) >> >> endobj 357 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [310.166 456.668 385.87 467.577] /A << /S /GoTo /D (Gri04) >> >> endobj 62 0 obj << /D [359 0 R /XYZ 90 720 null] >> endobj 115 0 obj << /D [359 0 R /XYZ 90 720 null] >> endobj 119 0 obj << /D [359 0 R /XYZ 90 312.323 null] >> endobj 358 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F54 361 0 R /F52 13 0 R /F53 362 0 R >> /ProcSet [ /PDF /Text ] >> endobj 367 0 obj << /Type /XObject /Subtype /Image /Width 493 /Height 333 /BitsPerComponent 8 /Length 21180 /ColorSpace /DeviceRGB /Filter /DCTDecode >> stream ÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀMí"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(ª×úŽ•h×zí½²k‰V4ôÉbY¢‘Y]у+ ‚A´QEQEQE—â9tÈü=|šÍôvVBðK;Ê#ÚáFçzåôÏè>ð6.“©ªø}á[è!2´ançS·pa;p1]Û*º2:†V Œ‚+ξ^Zéÿ´k»Û˜m­£—šgŠ>Ñ'RxÛhúæ—â %¼Òo༷?ÇçÄuØÖ…x¯ˆ#ÑÒRÒÂæöÑEe¦Èœ|ƒll 8*>ñ'ŒMqþ ÷‡~$ê¿×®u­;û4jMtÛå…Œ63ry8Î0dצÖ‘¥Å¤]\^ÞÍêÚ¼ÀÍ"ô%Pì‰8û¨ŠØÏ_˜žMnP\ÄXü1uá±iâ\é¶m2Hâ9‘ÂŒÝFp:ñŒ×]^ñ·þI»ÿnÿúQzrºÏÄ- J½}2ÞIuM`d ;NC4ÙÈlp¸Ç9#MsŸ´_ßê qjeÔ|6‹ûý&Âëì·2qÉ/´ïÚ' ­?ë^…N“¡Ù®‰|ß4ºuݹ·¹ÎN7åÏ<`¶3jñ¶™àÛßK«|9ñ^¯|Þ_™}ao3C/î×JÊ£…8k?BÒ| ˆtÉ,þøÊÊénâ0Ý\[N#…îäÌ@PpNAàt Sÿ„ËÃíuwk¢·76Œ«4±¼òÊX¨ c…còç9«º6¹¦ø‡N]CJº[›fb»€*U‡YHHô ã|'gã'Ä9ŒjeUÓ•\Ž@0@>‡ò•CÀ–7÷z/Žìô}Hi7gÅW‚¡n³€hÉùƒ•{g=¨¹ÿ„’Ïþ/øEü¹þÝýŸý¡æm_—æyxÎs»=±Œw¨¼I¥jzÚçÚjsé–2+5ÕÕ›m¹È+µÝ.Ku@îkË?áñ—ü.O±Âwÿ?øGüßíìˆÔý£W—¿{æÝ×µz~”º—†´I›Ä¾ :ÌælÇ2Ù$ A,KgsnÎìv /M´×¼ñGFÑá%ÔuYŠáš-B_:[v‰7ÜGä0 ÎG½V¹ûu9$:ãë; ©ñwâ0U 3¦œŽL Oë@ƒEPEPEPEPEPEPY~#—LÃ×ɬßGea4/³¼¢=¡Á^ônx÷­JFUtdu ¬0AP‚Œ¾ Ócðýä·šTQ´PO.w8F*s;‚:Çb¤ñŒ4 "kêPÛË ÌpºY:ýÔcÓÆ3Åy„4ÿj?ô¼'¨Ãg87&`Çkʾ|˜T|לwê+KÁ·þðÕúŬh7>ñ ·–nu|ÌgbH&;£ò°ç¹÷€=/FÔ›WÒ¡¾k»4¶ »dª /l€= _¯>ø—ká»ôÒ_\ð–·â5Snt˜¤BÌîØë÷¾\g?t×ý‹ðóþ‰ŽðãÿP´ê(ÐôF>ûS·‚îdwHY¾b¨»˜ŸN9ç¯lÑ¥ø›IÖ5 ­>ÒâO¶Úf¶ž ‘Tôm²*’¾ã#§­pš¥½™ñßÂh`°–ÚÍ-¯ 6—H|Èm¢°$ëÔ’ëZ!Uhf* ð®XÔý«þP ÑEQEQEQEQEW™|j¸ðøðÕ¥¿Š,µ¦ÓZí;0Õ›káHvÏÝÞ~éù¯M¯ý£¿äžiÿöÿEK@›áÙí.¼1¤ÜX$©g-œ/Ëë@T6 çÏ5 òÇß2EMÌwdž€{Ö?äžxkþÁV¿ú)kÌ~=øÊ]PðÕ…›=½Êê’.qŸ-±>Äïü…{u^Âö KN¶¾¶mö÷1$Ñ7ª°ÈÕŠ(¢Š(¢Š‚êÖ;È 2´Ê¤ç0Ìñ7ýô„Ö¹¥øká5°°ÓΖe°°‘¥·´šâYbWc’v³zž1âºÊ(‘E¤0ƱĊÀ‚ŸEEp7DÉ_÷ˆqí?xsœŽR;€Fp@%®kľðÏ‹îáº×tæ»–ü¸ós*\ç…V>øÏÐWKEr¾ømá êÚZ6Ž¶÷žYŒJÓÉ! qœbã¨çÍuTQ@y·Ä-BßÅþÖ¼§-ÀÖê q 0ÈÆæ@qrwdt÷ôš(¬wÂú'‰`Xµ: ‡(í•t?ìºá—ð5¯EÉeŽ̒ȱ êÌpãO¦KsFc–5‘Ua ƶðŽgªßjvñÝÇ{|¹”_O™p¥W#~8éÛ©t_ é^{¶Ó!š#y3\O¾æYCÈØÜä;˜àdÕ¨^æÞì[ËçÝ,Í,¢pˆ©‚6ÆÜ‚OÍÁçiϽÚÏþÄÓ¿á!þßû?üLþÉö/?{©ß¿nÜíûÜç÷ª^&ðnƒãmá×lšî+v- ‰#œHFeS:tºŠ( Š( Š( Š( ¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`çZ(¢€ (¢€ (¢€ (¢€ (¢€#žn­å·¸Š9 • IŠ]HÁ#ŒUdšâÞóʸ-:ÜÊÆŠÜ…•Û'’CÜg cÖí2X’h^)QÔ« õ­>ŠÏY›O-æÚ-¥‘ ³X¢va„$‡# ”üÇ <õРŠ( Š( Š( Š( Š( Š( Š( Š( Š( Š( ®è€Ù+þñ"}§ïs‘ÀêGpÁÎ µÀÝ%Þ!ÄO´ýáÎr8Hî9Á–€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ Ž ṈK±Ë$ƒAÁäzGá_;K¤XKûT˦ý™b³—vø & wYo¹Ž¤’}rsÔÓ~è¶W¿¼cái–_ìk¦6 3,OåÜ* ` ?¥}±Ï M ‹$N¡‘Ðä0<‚ê+7Ä?ò ‡þ¿¬ÿô¦:ñ¿Ù¢òæ[?Ù¼ò5´nñD[*ŒÞfâlí\ý+Õ˜4ÒÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`ç’êÞ/7Ìž$òcóeÜàlN~cè>VäúJù£âÆoÇãGNÑï?³,ì.ZØ$hŽÒ4R\³.y#îŽ1ÁÏ9úrŠóß…ßÅÞ kÝb{[kÛ)  Òªù€*·šW äûeN=lú¶›™¿P´_-7¾é”m^y<ð8<û¹ES}[MÌߨZ/–›ßtÊ6¯<žx}«i±ù›õ EòÓ{î™FÕç“σϱ  ”W̾=øÙâÈ|e¨Ùhw‰§ÙYLöª«sy¥©³©ëŽƒ€1שõ…ßÅÞ kÝb{[kÛ)  Òªù€*·šW äûeN=¡QTßVÓcó7ê‹å¦÷Ý2«Ï'žŸcCêÚl~fýBÑ|´Þû¦QµyäóÀàóìhåMõm6?3~¡h¾Zo}Ó(Ú¼òyàpyö5ó~6x²j6ZâiöVS=ªªÅÞiF*d,êzã à uê@>š¢¼÷áwÄEñwƒZ÷XžÖÚöÊCÃ4ª¾` ­æ•ãh9>ÙSAÛ>­¦ÇæoÔ-ËMïºeWžO<>Æ€.VrÏý–éÃGŽ!·µ‘æy%’CC–Ë‚X’Iϼ¯«i±ù›õ EòÓ{î™FÕç“σϱ¡õm6?3~¡h¾Zo}Ó(Ú¼òyàpyö4rŠùƒÆŸ|Yaâ«ý3CÔM¥•„ÒZ©tŽv˜£°2t={Àuê}ƒáW_Æ~ ’ÿTh!¼°ÃtûÀóHã`9>ÙS@ßÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÑQIuo›æOy1ù²îp6'?1ô+r}¥][Åæù“ÄžL~l»œ ‰ÏÌ}ÊÜŸCé@ÀÝ%Þ!ÄO´ýáÎr8Hî9Á–ª^\[Ç‚I?Ôì–P³1¦ï¾Ç#6±9ê†JšK«x¼ß2x“ÉÍ—s±9ù ù[“è}(Z*).­âó|ÉâO&?6]ÎÄçæ>ƒånO¡ô¢K«x¼ß2x“ÉÍ—s±9ù ù[“è}(Z*).­âó|ÉâO&?6]ÎÄçæ>ƒånO¡ô§ c34"E2ª†d@$zÈúP?Š­¼Cw£y^¿¶±Ô|Ô>uÌ{×`?0Æ${~]FÝyßÆèâ×j—i5ÄS[˜Lf+‡Œ|ÓF§r©¸?Ä:Žjˆ><Ö|?ªÅ¦ÛÚ®—a.k÷I4± ùº˜â€=ÿQ²Ò¬ä¼Ô.¡µ¶Œe¥™Â¨üMY®Að‰{"kÚ®«'‹.¥%⻺‘d·Q–ÿUþì“냜b©ø¦êþ?ݤ?ô­1³lö–®ðü‹Ô»†9ûÜâô H¢¼¯I¼Ô[Y±Wø×£jn# ešµÀÜ?v ¾An™óÅIáý×Rø©ãë;æžêÆ°¢O3I–„·ÎÀÀÊ(>/…÷ƒâ°ñܺô ?™“h¶T§•åcwšNv÷Ç^qŽ(ðÇÂûÏ xëWñJkÐO>¤³ï…¬ ªI|Üà0wG¤Q@oðßáußûÛÉ"×â¾µ½TBÖ&6ÊnÚU¼Ã¼sÁϵv~!ÿl?õýgÿ¥1Ö­ex‡þA°ÿ×õŸþ”Ç@´QEQEQEQEâŸ~ØêÚµçˆ4íJK#pâIí¼44®ÿ3†.¸6Hç¡ÇP+Úë/ÄC:$ß$óÇÂ6Ó÷לäp:‘Üd`ô :ðdží<-¢G§ZÜï–Vë$„[º=ã[4Q@Q@mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªì<1á»O h‘éÖ„·;啺É!ÇnƒAøÖÍQEW›x“á ž·­O¨ÚjMcö‚d–3š „’ÌáŒç§ÿª½&ŠÆðdží<-¢G§ZÜï–Vë$„[º=ã[4Q@Q@mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªô‡–Z‚ôˆ´‘„D=Ä×òºªÉ1*0A9Ž˜ÂI'•¦KsÄÑMI 2:ä¨4ètW7¢ër›„±½2Í$Ìæ9‚ˆ  +õëƒÞºJ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠŠànˆ ’¿ïâ'Ú~ðç9¤wŒàËQ\ ѲWýâDûOÞç#ÔŽàƒœh¢Š(¢Š(Ïþ0ãPøU®[Y²Ï7›oÈØ$7aO¡äqî+½–(ç…áš5’'R®Ž2 õ’žÐcÖ%Õ“M„^Ë ™ßœ4€`>ÜíÝþÖ3Þ¶h‰ºømemxu ßMá»ÒrÂÍ[Éìð)íÓ+zûÂ~Ôï$¼¿ðþ•wu&7Í=”r;`2Ädà? Ø¢€0àð_…mn"¸·ðÖ ñ8xäŽÂ%d`r!r<æ³t¯ jº_µ¯®µi$z¸ˆOjlmò£)Wóxë“sÈã¨ë¨ ?ÂþÕü3>¶Ë­ÙÜEª^M°éì¾Tòž|Ó”ÀÆ:ô9ìmøÂ÷ ðŶ…&¡ô6Û¼©ØÄß3³ß;ËqŒtï]-QEVWˆäýYÿéLu«Y^!ÿl?õýgÿ¥1ЭQ@Q@Q@Q@eøˆgD›ä‘¾xøFÚ~úóœŽR;ŒŒ•©Y~"Ñ&ù$ož>¶Ÿ¾¼ç#ÔŽã#¥rtQEQEQEQEQEQEQEQEG<][ËoÓ÷‡9Èàu#¸`çZ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š+œ×u.h¢²‹R³{±¨Z©gS&EÄysœŒý+£¬¯ÿÈ6úþ³ÿÒ˜èVŠ( Š( Š( Š( ¾`ø“ñƒÅx³SÒtË¡§ØY\5·–ˆŽeh¤?9f\Œ•(ãóŸ§ëÅ> ü ±ÕµkÏiÚ”–FáÄ“Ûyhi]þg ]p>l‘ÏCŽ Pð÷Ä÷>*ðÀ¼¼Væ M¼Ž½$!TîÇlîéÿê®®±¼1á»O h‘éÖ„·;啺É!ÇnƒAøÖÍQExg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýkÒ>øžçÅ^—‘ªÜÁ)·‘פ„*ØíÝ?ýUƒâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªì<1á»O h‘éÖ„·;啺É!ÇnƒAøÐÍQ@xg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýkÜëͼIð†Ï[Ö§Ôm5&±ûA2K‡ÍBIfpÆsÓÿÕ@ß|Os⯠ËÈÕn`”ÛÈëÒBNìvÎîŸþªêëôð¶‰hKs¾Y[¬’lvè8ôlÐEP†x¿âˆ¡ñ=õž™p¶VÖ’½¾ÁH\£X–S×OÖ½#áï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕX>$øCg­ëSê6š“Xý ™%ŒÃæƒ!$³¸c9éÿê®Ãôð¶‰hKs¾Y[¬’lvè8ôlÑEAÈà׌x›ã‹ôÝjm+GÔ^ÎÓNf´b¥Ä“b Žò+Oùõ¯g¯6ñ'Â=oZŸQ´ÔšÇíÉ,f4 %˜ÃÏOÿUzÂoÝøãÁbþþ%KËiͤ®§‰™Q~06ç qqè;ªóÿ‡Özo‚ôTÐÔ$Pÿ®–öYB‰¦bz…è'“èQEQEQEQEQEQEÀÝ%Þ!ÄO´ýáÎr8Hî9Á–¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÐEPEPEPEPEPEPEPY^!ÿl?õýgÿ¥1Ö­ex‡þA°ÿ×õŸþ”Ç@´QEQEQEQE—â!o’FùãáiûëÎr8Hî20zV¥eøˆgD›ä‘¾xøFÚ~úóœŽR;ŒŒ”ÉÑEQEQEQEQEQEQEQEQEQE„Œ€pAõŠÜÒ5çIÎý—kÉöÙAÜ6Æ@Á΀qÑy$žq)’Åñ4SF’Fà Ž¹ê zÍèºÜ¦á,oL³I39Ž`€"( Ç=zà÷®’€ (¢€ (¢€ (¢€ (¢€ (¢€"¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`çZ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š++Ä?ò ‡þ¿¬ÿô¦:Õ®s]Öt¹¢ŠÊ-JÍîÆ¡j¦L™ämÎr0sô ŽŠ( Š( Š( Š( ²üD3¢MòHß<|#m?}yÎG©ÆFJÔ¯˜>$ü`ñDž,Ôô2èiöW må¢#™Z)ÎY—#%GÊ8Ç<ä×è®Sáï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕ]]QEW†x¿âˆ¡ñ=õž™p¶VÖ’½¾ÁH\£X–S×OÖ½#áï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕ@]Q@W†x¿âˆ¡ñ=õž™p¶VÖ’½¾ÁH\£X–S×OÖ€=Ίå>øžçÅ^—‘ªÜÁ)·‘פ„*ØíÝ?ýUÕÐEPExg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýkÒ>øžçÅ^—‘ªÜÁ)·‘פ„*ØíÝ?ýTÕÑEQExg‹þ'øŠßYé— emi+Û줅Ê1‰e=qÐtýhÜè®Sáï‰î|Uáyy­Ì›yzHB©ÝŽÙÝÓÿÕ]]G<][ËoÓ÷‡9Èàu#¸`çZŠànˆ ’¿ïâ'Ú~ðç9¤wŒàË@Q@Q@Q@Q@Q@Q@Q@ex‡þA°ÿ×õŸþ”ÇZµ•âùÃÿ_ÖúSjÑEQEQEQEWŠ|Aøc«jמ Óµ),É'¶ò<ÐÒ»üκà|Ù#ž‡@¯k¬¿ è“|’7ÏÛOß^s‘ÀêGq‘ƒÒ€<ëôð¶‰hKs¾Y[¬’lvè8ôlÑEQEy·‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã[4PEP^mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªôš(ôð¶‰hKs¾Y[¬’lvè8ôlÑEQEy·‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã[4PEP^mâO„6zÞµ>£i©5Ú ’XÌ>h2K0;†3žŸþªôš(ôð¶‰hKs¾Y[¬’lvè8ôlÑEQEy·‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«Ò>Úé~ Ñ#Ñ7E O"rò×72„<.qP ÏL e–€H9ô +˜Ñ5¯³"ÙßÎLh¤‹Ë™†Y‹p‡§<€~Zé袊(¢Š(¢Š(+º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-Ep7DÉ_÷ˆqí?xsœŽR;€Fpe Š( Š( Š( Š( Š( Š( Š( ²¼Cÿ ØëúÏÿJc­ZÊñüƒaÿ¯ë?ý)Ž€5h¢Š(¢Š(¢Š(¢Š+/ÄC:$ß$óÇÂ6Ó÷לäp:‘Üd`ô­JËñΉ7É#|ñð´ýõç9¤w=(“¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(®‰"•uVSÔ0È­íX‘OÙ/æ–f>d¢êMŠˆ¹Œã€x89 rsŒáÔsÁ ÔÄQÍ ƒkÇ"†V„´è”W7¢kSÅ•ô4“HÆ0…cž½p{æºJ(¢Š(¢ŠŠànˆ ’¿ïâ'Ú~ðç9¤wŒàËQ\ ѲWýâDûOÞç#ÔŽàƒœh¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(®s]Öt¹¢ŠÊ-JÍîÆ¡j¦L™ämÎr0sô®Ž²¼Cÿ ØëúÏÿJc  Z(¢€ (¢€ (¢€ (¢€ ùƒâOÆIâÍOIÓ.†ŸaepÖÞZ"9•¢üå™r2T|£ŒpsÎ~Ÿ¯øƒð6ÇVÕ¯ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã@4QEáž/øŸâ(|O}g¦\-•µ¤¯o°F’(Ä%”õÇAÓõ¯s¯6ñ'Â=oZŸQ´ÔšÇíÉ,f4 %˜ÃÏOÿUo|=ñ=ÏŠ¼0//#U¹‚So#¯IU;±Û;ºú««¬o xnÓÂÚ$zu¡-Îùen²H@±Û ãÐ~5³@Q@âÿ‰þ"‡Ä÷ÖzeÂÙ[ZJöûi!rŒAbYO\t?Zô‡¾'¹ñW†åäj·0Jmäué! §v;gwOÿU`ø“á ž·­O¨ÚjMcö‚d–3š „’ÌáŒç§ÿª» xnÓÂÚ$zu¡-Îùen²H@±Û ãÐ~4³EP^âÿ‰þ"‡Ä÷ÖzeÂÙ[ZJöûi!rŒAbYO\t?Z÷:óo|!³Öõ©õMI¬~ÐL’ÆaóA’YÜ1œôÿõP÷ÃßÜø«Ãòò5[˜%6ò:ô…S»³»§ÿªººÆðdží<-¢G§ZÜï–Vë$„[º=ã[4QEáž/øŸâ(|O}g¦\-•µ¤¯o°F’(Ä%”õÇAÓõ¯Hø{â{Ÿx`^^F«s¦ÞG^’ªwc¶wtÿõV‰>ÙëzÔú¦¤Ö?h&Ic0ù ÈI,ÀîÎzú«°ðdží<-¢G§ZÜï–Vë$„[º=ã@4QE2X’x^T4r)VSܯñWÆYx‚ëMÒ/£Ó쬭ä/°•ÜÌêNN;`cNIöZóo|!³Öõ©õMI¬~ÐL’ÆaóA’YÜ1œôÿõP§ü&ñߎ</ïâT¼¶œÚJêx™•·ãnwòƒº¯=øwecàÍ%t cXä•JO󸆰ä/ÝP1Æ<ò} € (¢€"¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÔWt@l•ÿx‡>Ó÷‡9Èàu#¸`çZ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š++Ä?ò ‡þ¿¬ÿô¦:Õ¬¯ÿÈ6úþ³ÿÒ˜èVŠ( Š( Š( Š( ²üD3¢MòHß<|#m?}yÎG©ÆFJÔ¬¿ è“|’7ÏÛOß^s‘ÀêGq‘ƒÒ€9:(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€H9ÛÐõ…·‰,¯¦UqÃq=Ág•ÙŠímÝÉ(É,[Ä G€=ŠætmsÈ×P›ä°¼¸•Fægá×ðk¦ ®è€Ù+þñ"}§ïs‘ÀêGpÁÎ µÀÝ%Þ!ÄO´ýáÎr8Hî9Á–€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ ÌOhrêm¦G¬éÏ~¬U­Vé  Ž ¦sŸÂ§Õm®otÙ­­.¬²€žrýäRFâ¾·8=Ž+ç¯Œß ôO Ø釒hon.…»[ùï,“±„Š–ÝÇeâ€>‘¬¯ÿÈ6úþ³ÿÒ˜ê] íßðiŸÚñÿöH¾Óÿ]v ÿ®k+ÄZîŽ-Üê¶"hï­·Çö„Ü»n#-‘œŒséƒ@-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-—Vñy¾dñ'“›.çbsóAò·'ÐúQ%Õ¼^o™”-eøˆgD›ä‘¾xøFÚ~úóœŽR;ŒŒ•~K«x¼ß2x“ÉÍ—s±9ù ù[“è}+æ_‰?VäúJeù"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô¢H¤‹Íó#dòcóeÜ1±9ù ù[“è}(”W†øÇâwˆí¼Sc§N, ³™íŒ~R9fF*X–S‚qÓ·ë^ðóÄ÷+ð´·×qªÏdÆ;™ð@PÞcáŸo”ýWE>H¤‹Íó#dòcóeÜ1±9ù ù[“è}(’)"ó|ÈÙ<˜üÙw lN~cè>VäúJeù"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô¯ ñÄïÛx¦þÇNœXAg3Ûü¤rÌŒT±,§ã§oÖ€=ÊŠå>xžãÅ~–úî5Yì˜Çs"ž Ìaü óíòŸ ë¤ŠH¼ß26O&?6]ߘú•¹>‡Ò€E>H¤‹Íó#dòcóeÜ1±9ù ù[“è}(’)"ó|ÈÙ<˜üÙw lN~cè>VäúJeá¾1øâ;oßØéÓ‹,æ{c”ŽY‘Š–%”àœtíú×£ü<ñ=ÇŠü--õÜj³Ù1ŽæE<7˜ÃøAçÛå?@ÕÑO’)"ó|ÈÙ<˜üÙw lN~cè>VäúJ$ŠH¼ß26O&?6]ߘú•¹>‡Ò€E>H¤‹Íó#dòcóeÜ1±9ù ù[“è}+¼cñ;ÄvÞ)¿±Ó§YÌöÆ?)³#,K)Á8éÛõ r¢¹O‡ž'¸ñ_…¥¾»V{&1Üȧ‚†ó<û|§è:é"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô QO’)"ó|ÈÙ<˜üÙw lN~cè>VäúJ$ŠH¼ß26O&?6]ߘú•¹>‡Ò€ExoŒ~'xŽÛÅ7ö:tâ 9žØÇå#–db¥‰e8';~µèÿ‡Ò‰"’/7Ì“ÉÍ—pÆÄçæ>ƒånO¡ô QO’)"ó|ÈÙ<˜üÙw lN~cè>VäúJð¯üNñ·ŠoìtéÅ„s=±ÊG,ÈÅKÊpN:výhܨ®Sáç‰îß)úºH¤‹Íó#dòcóeÜ1±9ù ù[“è}('D‘Jº«)êdVö‡¬H§ì—óK32Qu&ÅD\ŒFqƒÀ<…99Æq¤ŠH¼ß26O&?6]ߘú•¹>‡Ò£»³Y ¸‚òØ4+ùã™2¢3žXáù[“ÇÒ€;˺ 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-|¯ãŒ^5ƒÄ—úu–¦ÖVöW-E†2Ìcs˹ê9àçœûO¯¿Œü%þ¨ÐCya!†é÷€ æ‘ÆÀr}²§€¿¢¢’êÞ/7Ìž$òcóeÜàlN~cè>VäúJ$º·‹Íó'‰<˜üÙw8Ÿ˜ú•¹>‡Ò€%¢¢’êÞ/7Ìž$òcóeÜàlN~cè>VäúJp–33B$S*¨f@yäG¡Áü¥cøªÛÄ7z7•á›ûkGÍCç\ǽvó `òG·åÔ_M[N“R—MKësí¼Áæ(# íëŒw®ãt?ñkµK´šâ)­Ì&3ÃÆ>i£S¹T€ÜâG5Òx‹Áz‰öɨZm»ýU廧Œÿ²ãŸÏ"€: +Æçñž·á 'OÖcñ´,á~±1¾ƒ©ÿ[lI|: ­ÏÝ_Çâ;´‡âÞ• Æ6cMžÒÕÞ‘z—pÇ?{‘ü^”éÃk:¯Ä »‹‰|+¥èËcnïþÕi׌UŠ*r7G= bi7š‹k6*ÿômA Äa¬£³³V¸‡îÁWÈ-Ó#žx¯EÕu5ÓmÁHÅܤ¥µ²œ4ÏŒàùn€dšÅð‹fñ†-ÝÝ°¿´º{+»rÄì•ÝŒ¼8íÓ'ÔÖ„<8<3¡ýšID÷×3=ÝõÀÎ&¸åØ{tØ óšß  Ú†¡g¤éóßßÜGoi–YóÛ½xÕ—Å_ëóxŸ_ÕƒÜÚ‡IÓÖÒf6Ñäå‰Û·Í“'8PÏS^Ǩiz~¯mömJÆÚößpo*æ‘r:0#5•ÿ'ƒÿèTÐÿð]ÿ@ôúžƒasÅ-Ô 1NBnê÷¨¼Cÿ ØëúÏÿJc­(¢ŽRcXâE ˆƒ@àAY¾!ÿl?õýgÿ¥1ЭQ@Q@Q@Q@xß~Xø‡Ä7ƪK`näß<ÜM™¾yiœ‘ÏCŽÂ½’¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#8 ~ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEãÞ0ø§ø“Äw:½†°ÚgÚ˜Ë<&ØÎV$³‚]qœôõÎ= x+ÁöðäZEgÁó'™ºÍ)3ã'tuë] QEWxÃàŸâOÜêöÃiŸjc,ð›c8iX’Î uÆsÓ×8ôÃEsÞ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEãÞ0ø§ø“Äw:½†°ÚgÚ˜Ë<&ØÎV$³‚]qœôõÎ= x+ÁöðäZEgÁó'™ºÍ)3ã'tuë] QEWxÃàŸâOÜêöÃiŸjc,ð›c8iX’Î uÆsÓ×8ôÃEsÞ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEãÞ0ø§ø“Äw:½†°ÚgÚ˜Ë<&ØÎV$³‚]qœôõÎ= x+ÁöðäZEgÁó'™ºÍ)3ã'tuë] QEWxÃàŸâOÜêöÃiŸjc,ð›c8iX’Î uÆsÓ×8ôÃEsÞ ð}‡‚<9‘`Yð|Éæn³J@ øÉÇ@z×CEQEã~5ø câÜkv©-»“|ð q6dfùä¤\rG=; î<áKhÉ£BþtSNeHsÉå ï!ËÉCºÚ¼±Ééîè€Ù+þñ"}§ïs‘ÀêGpÁÎ Œ¡Ñ”ç`à1Ò€ŠÎ€ÿeyv²ÒÅDVög{É!8#NsÐrIÏ9÷Ñ Š( ?øÃCáV¹mfË<Þm¼#`HÜE…>‡‘Ǹ­=sÁ·~%Ö̺Ÿˆ/“DE4«&0 Œ²)ÜÀóòñŽ=kQ<' Ç¬K«&›½–A3¿8iÀ}¹Û»ý¬g½lÐ~¡é~²[=& ;qü&3îOR}ÍW¾ðŸ†õ;É//ü?¥]ÝIóOeŽØ ±8¶(  8<á[[ˆ®-ü5£Cù±ÿÃ]nóní¹Ïû1õÏZú ¹ÍwYÒæŠ+(µ+7»…ª˜u2d\G‘·9ÈÁÏÒº:Êñüƒaÿ¯ë?ý)Ž€5h¢Š(¢Š(¢Š(¢Š*+º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-Ep7DÉ_÷ˆqí?xsœŽR;€Fp@%¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(+º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-Ep7DÉ_÷ˆqí?xsœŽR;€Fpe Š( KsFc–5‘Ua « ÜÛÝ‹y|û¥™¥”N PFØÛIù¸ í9÷»QÏ7VòÛÜEÐJ…$ŽE ®¤`‚Æ(J*’Mqoyå\nec EnBÀÊí“É!Žî31ëv€ (¢€ (¢€ (¢€#žn x."ŽXœa£‘C+pzÖ#xÂ.ìïám™ŽI:|D“ÿ|ÖýÈ¢ŽRcXâE ˆƒ@àAY¾!ÿl?õýgÿ¥1Ö­ex‡þA°ÿ×õŸþ”Ç@´QEQEQEQEÀÝ%Þ!ÄO´ýáÎr8Hî9Á–¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#8 ÑEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEÀÝ%Þ!ÄO´ýáÎr8Hî9Á–¢¸¢d¯ûÄ8‰öŸ¼9ÎG©À#82ÐEPEP%‰&…âeJ°ÏPzÕ%™´ùÒÞm¢ÚY 5Š'fBHr2ùOÌp:Ï] (¢¨$ŸÙÆ;yX- ÁlÍ+Ë+¶;Ëdö’Iä“W袊(¢Š(¢Š(¬¯ÿÈ6úþ³ÿÒ˜ëV±üM,phé4Ò,q%å£;¹ÀP.#$’z Ø¢²¿á'ðÿýtÏü ühÿ„ŸÃÿôÓ?ð.?ñ  Z++þÿÐwLÿÀ¸ÿÆøIü?ÿAÝ3ÿãÿÕ¢²OŠ|<£-¯i`gÞGþ4¿ð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@µÀÝ%Þ!ÄO´ýáÎr8Hî9ÁÏÿ„ŸÃÿôÓ?ð.?ñ¨n¼Qáï)wkV <Äâ;øÐýáÎwŽ;‘Üd`çnŠÊÿ„ŸÃÿôÓ?ð.?ñ£þÿÐwLÿÀ¸ÿÆ€5h¬¯øIü?ÿAÝ3ÿãÿ?á'ðÿýtÏü ühVŠÉ>)ðòŒ¶½¥œsyøÒÿÂOáÿúéŸøøЭ•ÿ ?‡ÿè;¦à\ãGü$þÿ î™ÿqÿjÑY_ð“øþƒºgþÇþ4‡Å>Q–×´°3Žo#ÿÖ¢²¿á'ðÿýtÏü ühÿ„ŸÃÿôÓ?ð.?ñ  Z++þÿÐwLÿÀ¸ÿÆøIü?ÿAÝ3ÿãÿÕ¢²OŠ|<£-¯i`gÞGþ4¿ð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@´VWü$þÿ î™ÿqÿ!ñO‡”eµí, ã›ÈÿÆ€5¨¬¯øIü?ÿAÝ3ÿãÿ?á'ðÿýtÏü ühVŠÊÿ„ŸÃÿôÓ?ð.?ñ£þÿÐwLÿÀ¸ÿÆ€5h¬“âŸ(ËkÚXÇ7‘ÿ/ü$þÿ î™ÿqÿjÑY_ð“øþƒºgþÇþ4ÂOáÿúéŸøøЭ•ÿ ?‡ÿè;¦à\ãH|Sáåm{K8æò?ñ  j++þÿÐwLÿÀ¸ÿÆøIü?ÿAÝ3ÿãÿÕ¢²¿á'ðÿýtÏü ühÿ„ŸÃÿôÓ?ð.?ñ  º 6Jÿ¼CˆŸiûÃœäp:‘Ü0sƒ-b]x£ÃÞRîÖ¬y‰Äwñ¡ûÃœïw#¸ÈÁÎ ßð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@´VWü$þÿ î™ÿqÿð“øþƒºgþÇþ4«EeÂOáÿúéŸøøÑÿ ?‡ÿè;¦à\ã@µB7:v"¸” E«uq8Þò;í ‚=JÏ%€¡ÿ„ŸÃÿôÓ?ð.?ñ¯ðÿíª[l‹ÄL‰ÐÏjÞTŸR§*OÓm}Ep^ø—áÿܦ›¦Ý_ÏrRIÜÞƪé—ÈO”m  c Q’Iç½ Š( Š( Š( Š( Š(  š—Ûí’3ËÛ<3gnsåȯÇn?·\\Šøüvãñ«uÃø×Å>&±i,¼ ®«}n¢K¹&#Ë…HÈP7)w#œØëšî(¯2øWñR_Ïy¦jv1Yê–‘‰Hˆ².v·ÊÙ*A#Œžµé´QESQ²û}²Cæy{g†líÎ|¹ñøíÇãV袀 (¢€ ©¨Ù}¾Ù!ó<½³Ã6vç>\Šøüvãñ«tPEPEPMFËíöÉ™åíž³·9òäWÇã·[¢Š(¢Š*¦£eöûd‡ÌòöÏ ÙÛœùr+ãñÛÆ­Ñ@Q@Q@5/·Û$>g—¶xfÎÜçË‘_ŽÜ~5nŠ(¢Š(ªš—Ûí’3ËÛ<3gnsåȯÇn?·EQEQETÔl¾ßlùž^Ùá›;sŸ.E|~;qøÕº( Š( Š( Š( ¼z?„Ÿ¼¥_ijÉwD–õŽÍÇ XÐ|ßC»½{ q?î¬ì|yw©hVúΟÆg·–å a— ¬ŒªÇp,;¯ç±ét&Ò$Ñm¦ÐRÑtÙPÏÿ/ßcÙ¿þ˜ù³ø? ÷ ¥h¢Š(¢Š(¢Š+ξ9][ÃðŸV†YâŽYÚ…Ài™…Èž;^‹Ey÷ÁVøE¢`J›€À‡Ïóø^ƒEQEÿÙÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀMí"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€?ÿÙ endstream endobj 370 0 obj << /Length 1968 /Filter /FlateDecode >> stream xÚ­XÝܶ¿¿bódm|«)êËöH›ºH¤(|@š>ð$ޮΒ¨èãÎ×"ÿ{çƒÒJk9nbDÎ ‡CÎÌo†+vüÄ. vIú™Jwy}8êÇ+áF8,$þxwuó>;øY‰ÝÝÃRÅ]±û‡'÷‘¨$óþô“ÝdêÙ¿ìazü(Oó¬rÌ–§GÓ˜N¶ãé”×çºiÊæÈä–×T/'StzÿÏ»¯þ|7Iù•Ó ÄWŽ#\µ‹Så‹Pñ™~2î{cßÈÓUo™’Û¦/ Óñl8é%ž÷`©aêIãäiAÑüiu7”ºâ‹Ï•)ŽNÌ>Lj ËÀ]›aÚîi®j4ý52°FW°œeqÜ0\ð ø€ú"âóÁ!pëÁ|Ü’Õ„‘¯¤‚+$ákö…ùÔv¦ïq7rkÏdýK âÆð$‡Xð@·ðz .a {%Þ0É»ï3MU]¯ ôʦt“›7Î0¹:KìÇûA²yõn%Ê‚¹|DÁôÆÑ/‡Bi¯•ül0ù¯ÙŽ<Ña%˜’Û>èûÊíþ\'-WàÐ ÉLùSìÔ_p‚LÈz'¥›bS—ðS‘MB_ò§”0L')ˆ…ð¾c;nO%œˆï.Œc_ ¹J¸kÃù@wK§b¨0«ÈÅŠ’®u¸d&ÈCQÖ°£€y} ׎¡à¶O†¼¿\Rº$++·drâYÇpûêi!~!ÁˆÎ¶B~:Æ”£c?#éÉ0&½ð´°œŠqËŽUÁŒ{B\sÊå9¥5)Ï9E½IàIš0ðBŒ¦)øJ…Šb?”¾7?Ôb÷½½úÛïÁ° !~œkîè¢b¹À˜ #°œQˆäø²ù–"¦Ã¤¡°5®`mMqÁ%8LY¤sœgy94cÀ®²ª˜Úv„áOPœN»‘¦|œU}”#!|˦þD™)2ª›2à’‘œ“0ïOº}$g¼’ÁdŒî—ø‹§Ï»òžŒâX€¦ƒ=dR»p`Øq˜m¢«…ïÂüÐ+'xç€i{3öóg2à~Hë¼£œÎÜ‹Œ8w‹Œ12 ˜ì@*l.E¶ó4Ö¨<·]1çÀ´·[¦–ep³ÜÈÔO×u‚2"’{êV¾-ßÝ6oËׯñ™óoº!|]Àôjñ#,~|w[— ÎêëCùºy-QÍÛǯ¨cmÙpýx–}ëbocïß¾Âú¯ªäxï©\T5˜<˜Šªؘcx¦™}¯û2ç¡ù¤ë–*L(`&]fpDç@ä܆ؙa„0v‚Òi•S~t!IQ]0-G'l!x>U-yÁ[9Jú3è÷ZÈì¶+5µ`C!pÜÙ±ÎÈ©çM8§ËQ ƒÂòºodd›˜SÛóÅɲÙÑž²”»FŽ ^tÀ¤Mxo Øô[Ùˆ ¢‚à³ÕHÃÛÀ/ez]œ;2T1ì"D‚—P½yÈàŽ½rJ&D¦%nz¸ šÊgâ¼ÍÙ– :}½u÷<˜ÚJ[·eåº$ÊÛKX1CN¦¼¿ïSèU+Xb–Y¯Î`qƒW´ÆÞt¯¶GÆr É‘&@QR±ÄÄC¡yIɆ _¢/Cï{4û"çÐ$¢ …χ³—aö×ox pö™÷~O^͇ɯ—Y‰·”ùBf.!ØT/¢ðš ‚=OlS½à‚’ 4LgϹÇô#Éþ®aE>ƒaR`ÝzjtÃ3*¯NÙ1Í9ŒÀ¼Úû+ŸŸãßî²$¥ØƒC飮Z­+(4USóýЙ©{·Ìa r·ÒÏ­½,òdmWp—¸,š‹?–™—£¶½ëÝñ.ã¼t-×VOaj04“Ê+·’€2†:ÃdÚSÑ¢.ÿ{Þ`ó»ŠfÌå0NÖµàÔ©q0ÊW˜¤Š°è÷Í+'QëÜÍl}~ Hì`yŸÜ=/ª<þb89vS€Û~Íå6 ®ç î‘¼´·qbðÚLmÎõÝÕÇû…|ûRñ£Q3'Uô2B9¼r ±7¥·ŒËIÛ£½çÕßp«óyè½GÌ 7ÑüE{qxMÐk.ˆ)ÄQdd¨v ŽåÓžˆ3ŠÀ ^Çj0e!ŽÎ—àD§lÝê@/ÞùuóA¼ïn±çØB‡(ñ%€ÕülßÐÃÃ>™µÉßÓ~dË'[Ïÿ2ì°ùY_†üå «íÃÔOÒtñ¢_|Ñe?ÌMÛƒ­*þãäü7ѺÛ4S/Úû<úÏÆëFpõØ1¿ŽàÈÿëqѸýD(ý4KÖÑÍ·Ü€}ÇØïÉ4 ÏÝ϶, åÛ›­<¼è4vš?ouš‘ŸÈd«3ü¬/\J®ÚÂÿãÖòÛ_ÿ—í@¯ endstream endobj 369 0 obj << /Type /Page /Contents 370 0 R /Resources 368 0 R /MediaBox [0 0 612 792] /Parent 9 0 R >> endobj 63 0 obj << /D [369 0 R /XYZ 90 720 null] >> endobj 123 0 obj << /D [369 0 R /XYZ 90 269.825 null] >> endobj 368 0 obj << /Font << /F51 8 0 R /F53 362 0 R /F52 13 0 R /F72 7 0 R >> /XObject << /Im1 367 0 R >> /ProcSet [ /PDF /Text /ImageC ] >> endobj 374 0 obj << /Length 2546 /Filter /FlateDecode >> stream xÚËrܸñ#µ«¡ |Ùq¥—7µ©T.Öm½jˆ™AÄ!’ãYo*ÿž~%¹T%F£ÑÝèרMjSD›,ŽÃÂä›ÝéM$Ї7JF[@ØÎ0þv÷æí/‰Ú¨(,¢BmîöswÕæ·àÓ±|lw³ã8Pïn¶Æ$Á¯Í΃¡ko¶ð­Î»Áµ Ž¥‚øæ÷»¼ù|7žšhý [ˆñ”/=çK©<Ì7inBfííO7°3 >6ípDq²k›o¶q¶x>”ÝÁÊø±·çªÝîÚʆ ùé-2 LlUª„éî[¡õ5J"÷A½wùð¯÷îçŸa®xå¿´- 3ÉVÅ{¿(Ú4a¾_à±ô*ÖvN1ÿ‡ ×:B„²LšÊ»BRä4 Ù þ³¶Ñ/ÌPç*Œó*ê^ÓÜJ™Ôã” ¨5JQ¨Ól$¤W ©Ð$Æ〔uj‚û³ÜûÒµÍ/Eàâz°k’k¬tG¹XHæ-/vFd1k(Ó¬!ø¶û®LKçTvÚ¡d€σ´ CBÚ•MXy™ãu¶Iï䨒îI¸‘ƒ»ÊvøÁ‚ ÊÑ O*06aÿ šµ‰ ¡³à;Ï=2ʲŽç²FÏ’^Öý®ÀíÑ¥L”ûsÃN%³¢©" È[vÃmÒT_®ˆàÝð[2+ý±í†j“N@¯ƒƒ~‡Ò9Úê\ÃNPºÑqPÖ5ß H·rù¬u¶ô¼›4Ý<ðÑiìq¹BÏ4Kh~Ô8¨Ýà ‹×/ãX”ƒ¯‘2¼4°Ü :ˆg¹1nlO®.9<ðú“s'–zåïø Çþ ÇlJž×íÀsr]èlÙÓmHFgR¯7…–cb]Yó[f+ =£1åÙ¾ª=•ÎA.;ÄÈar5áô¸Ç“eBkwCÉžÆ(fß(CFŸÇ®®N¨æ8#PÉ•àŸAûX[ „ÐnTÛÚý9¢Â oŸ;[!™âÒAÇï5®íå Îêñºqür“"«h¼º} †þ7Ž  ¬Ÿ{ҀȈÊIÈ°HWÄ5g(+Sè´ ë1n# oOBù±³;K~›W V€Í•£ŸóUÇij›å3 fÌ%Àȉ&D -‘*5ÜñíÆ»§œžíB—Æ ö†Åä5spáƒ+©g~èÈ>·®_µªèŽ”©mï]2ùN˜T-É×Äìj”8˜Î½—>ÀAÒûoX@;g%á¾6g*`Þ =J‹^ dp‘Íñ•ób˜÷ý;ñœÅ"Æåy¨#ƒI`˜å¢µ¯‘–€¨¢Mf9{H¸”†tQ…©i_Ë,t6ÆÌÕølBž~F¯¼Æ› µÑž”[#‡Y2 –’Å}ÀOFtAWˆou&ºLƪøÑ‹§/^<ö¼èg.žmfD~èÞÿ^£ ©ì™{çDWû{ÛEæ¨b“†iTxWÏá0ykO¶ldi8–l¹CK;òléвtèLˆ\m$þìÏײ±8ÒG¼–×%ažyÝŒý¦ÁÄ–B»°[··Þ8ƒÊ&K“…_ª0©^K Aö:yÑ|‹0ž²ËËÑ‘WŠ5‹c?Í®b@Ùi"B¹œXûg­_‘*Xá+ kF“ R.4G ᤤ“Õ(!>õi(x#i¦^4j.š¦ÌË|”“K> 2¨ˆ$iŠÓ2=½t§l"Î/Ƕ–áó¢(t¨2ýŠ±¤a¬¶Âé‰ØŠk3𵯨tfQòŠðç'rzgÒéf>˜Ðd <¥\3 w8Ãẋ$§ðXêªâõbÅ ÏÇ—…*´$¦P’Qˆ‚<,Òî;OĺCÁVŠßî6–I,ÙiÚ‡\\§Ñ<ô ÆðKßã´kr6°€Áiû|)Aq ŒªH¢àóø¾À»yeÁXDzg dÐR¾Ñðd~&ÎÇb‚6“¦lô_Ú¤ƒSÉá{%3 ¦D›àD…@=¸må Åé@‰eµŠT||‡—ÆGŠM z¤¼CN'ð⼞Ò+‘H°!S—}ñ¥_¥i1¾“”ÝíI:ÇÛJÊãàöÆy{bïuì­v!Gì\|ñ/é“6SúDÐñn=Ï¥E{ô"8µŒ ¡;4wï$w¥FD|›ôqhEòs•ÅP´GâtÒ¯Mm^…| î^˲ßÃ~;8,?ÉeΉ÷v³©ßÇÖGXjVìÙ@ù76Ø1·Û¨eØ2$Äæ ³4ë4òm`ßçÚ[”Û@D6Œuù¢Ÿ,ˆ3„^P–Ç==Ä öÓ(\ØÞ2%é {5í ›Î|vNêD-;{vuÅ[Ø¡t”ÚS'"„«)Ùï…2]œQÖTxá)‡6ÖM‘>WÐâÆ©Ñ€ûI‰®Ð“ÅàǼ¯HŸÖ¼û+›þ6…'uç?¹ÞwÌ®U!JŽ2iÖEyÀu±åÉãyàe*‹##XY8JX˜Û:LËžÑ?››_Ä›y‹…'s E*<þ“Ž-qR ¡VølOÛµ›§«}ë4øÏÙù¥ÞɳNXcê®éЊ+HôU üµ#Ô9¬F'óß<<îv†¼ò{Ì5Iâ÷·_0"ڲпÓsVà›šQO¸* y„’oÎÕÓß`<Ökü\›ùLðzò®²åR–þ7y*8$»Áï=¶qv"üþ;›jù‡lìXÔÀd䙜ž»X5µŸ¦·¥$»¢åvì4U‹ ê© T£›f…'õ¤øÝ ·ž2ƒeL-ûcP R àÔz‡/v­¦«+¦8øFΞ›+ùØ\1 ÷}ÞU*q†«8ø„%Lÿ ½=ˆÞ·ßyÛø?-îA¢ endstream endobj 373 0 obj << /Type /Page /Contents 374 0 R /Resources 372 0 R /MediaBox [0 0 612 792] /Parent 378 0 R /Annots [ 371 0 R ] >> endobj 371 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [221.665 102.777 298.736 113.686] /A << /S /GoTo /D (Fea92) >> >> endobj 375 0 obj << /D [373 0 R /XYZ 90 720 null] >> endobj 372 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F53 362 0 R /F59 61 0 R /F10 376 0 R /F4 377 0 R >> /ProcSet [ /PDF /Text ] >> endobj 380 0 obj << /Type /XObject /Subtype /Image /Width 430 /Height 346 /BitsPerComponent 8 /Length 13713 /ColorSpace /DeviceRGB /Filter /DCTDecode >> stream ÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀZ®"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€15=NòMEt!b7†1$÷‚cµBp ï9ù¶®GLž*8ü!¥Iå˪Du{µM­5ùóC†$F~DädmQŽÔxEDÚCêm‹.¥q-Ñis¼ÆÎÞP<œb=ƒãŽ:Öýa?ƒ´0æ[;?ìÙö%Ӝۖݒ¾`{‚8¥²Ô/¬µH´\Ç3LŒÖ—±®Á>ÞY2v¸ñò·$ÆѹX^2¶øSP•x¸´‰®íÜ`–0]H$r0HÁ4»EGñ][Åq‡ŠTŽ:2‘*’€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€0<"Â!ôÆ’F—M¸–Ô¬¹Þ#Wo(žsÃ1Ï+~±5=2ò=Eu}!¢‚1öò’#º@r#î¸ù¶¶\*8ü_¥GåŪJt‹¶MÍ øò‚œ… H~GäàmcžÔ¿X^2¹xSP‰y¸»‰­-Ð`—–@Q@Œòr@9À4‡ÆZ„%èÔå*YcÓTÜ“ƒ·’™ É,@ÈÓ¬´ûëÝR-_WÂУ-¥”m¼A»†w| ÎG|«È³¸€lAV¶ñ[À"‰"Š `ʤ¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠÊðÇüŠz7ýxÁÿ¢Öµk…Ö|A?…¾ ®³jT\[é–â"à ;E8Ý.£àKï ÌúåêjWqéš’]ÞË8’i”’0Ù †Vû¡A w‘EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEÍøÓƺot¨5-V ¹-æœ@ ²+ÅY†AaÆÐ?â"ã]øö¨^vÒíäDŒa$Çþ;Yúþ½eãÛÿÙè..§‡TƒU¼HØ1³Ž w,½6¶[8

—o´ñ…Vm„|¤Ÿº}:ZŠ(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(®ãý³ð¿XEt¶±‹¸Îq·Ë;˜õù7þ}3Šëu=ZÏH·YnåÚ]‚G‚ÒJÄà*(åŽHàVD«âvÑ£{k :Âæ¯Øyç*ÜmeF@„©9ö­r?toì߆Ézè¢]JæI÷cæØ¿"ƒÇO‘ˆë÷³Þ½J¹-Jñ…t[2Ñt­JÊÊÙb ˆÖr¶ÜsÕÕ˜Œ“ ±êoiš½®ª’yDž{y¤°“Ù”úó‚2ä9  ôQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEsú4M©êךÝ×Xå–ÊÎ,¶"Hä(í‚Üì„çt(É­}GíÃM¹þÌæÿËo³ý¤°‹~>]ûyÛž¸æ²|<#a@ kpöòÆ6%Ù$äqË«Æ¢ø Íð÷Ä%Œ€Å§\J…$d!–6*rÏ qÒ€7í~ÑöH~×å}§Ë_7ÊÎÍøù¶çœg8Í`ø¦6Óc_[*ý£NÀ8u·Y’F6¼uÁ^œÓü ÿ$óÃ_ö µÿÑKV|TÁ¯q´¯™¨¸”q±€#CÀåTÝ xCâLƒ5Õ¦nȧe²‹‹€Häoqå®?Ü|úñÌ°xKHIÒæî5¤9Yõ Ã)õPß*ÀÖåQE•áùôoúñƒÿE­jÖG†·i öpHÈË«˜ðeΧÿ Ç:mö­w¨Cdl~Ïç•0ñ»@QÔ@ÀÍt×¾ÑïnZìÚ}žõºÝÚ;A1úºX{j¯öiÜÙj°jQêQùr}Ñ õ¿¯AEsÃÅkg ‹[Ó/t³•htóm‰'÷©£=Ü'oQËk«{Ûu¸µž)á|í’' ­ƒƒ‚8ê KX÷~Ò®f’â8ÎîEp×6R$%°I%Ürù²3@V'Ù¼Ce.mïíµL™1ÞÇäÈ«·´‘¿xgý_ByéM_Çl«ý³ay¥¶Ø÷I*y‚Çn<ÔÊ€m½AÅnÑQ[][ÞۭŬñO çl‘8elÇPjZ(¢Š(¬½rÛP¿µŽÊÂêK1;•¸»‹dQàçËÏG'dž Wá5Õ|=ñ6ÿ“k—úÆštµ¿Š[ù|Ùa7fÂØî2~€q@“EPEPEPEPEPEPEPEPEPEPEPEPEP^%¦êÖš _ÁøŸÃö½2 ÀÍpÓ;ìt^¬¸“¨ãå=+Õo!½—öÚt"L/dó¤eÛÚ8Îß¼qþ³ ÞZý}: (Ÿÿ„¶ÒÓjÒóG#¬—qƒ×ÎBÑþóíÖ· ž¨{yc–'Y#`ÊÃØŽµ%aÏá-!ç{›HdÓ®œå§Óä6ìÇÕ‚ü¯ÿ @ âi>ÒQÕî–‹NKHÇ°}N¹oøßÁšž½q“©C]ÕIpËm,*.ê "/u9'’MtiŠ4°ån­5¸B1UE­Æsòè 6Gu9ç8àMÿ EŒùZœW:[™<µ7±íŽÝÜJ¤ÇÓ0x›Vø•¦ß^^Á´ŽmVÙ™’Ú%“€Ìù°J’Iþ£°Ôõ™yâ *ÆèZMx­v[oÙ¡S,ÙÛ»ýZØÀÎqŠ¤<7q}¼ëšÅÍê¼m[[æÖßùPïn8û •±gag§Âa²´‚Ú"ÛŠC@OLàwà~TŒ5êD}ƒJ‡N‘X\jo¹ù<ˆÏnûO·\/ü"ÿlçZÕoµ,õ‡Ìò Þ\xÜ=œ¿ò®‚Š¯eag¦Û-µ¤¶ë÷b‚0Š>€qV(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ óïŒZö¿áŸ¦­áû“o47H· 䬃Ê`ÃÊqól㯸¯A®sǺ7ü$ÖôÀŒòKhí¨ÉiçAŒâUè3éÍq_üAâxrþm^ég³µ’+K0"DÙ±2ÃåÁ<4}>µëÂüÑ¿±¾èèÑí–ê3w!Îwy‡rž§&Ï˦s]ÕQEQEQEQEQEQEb?…tÄs-‚K¥Ìv~óO$­‘¹ÈÝHù”ðj9‰tÔ- Zk1¨rOôiÏÍ•†Q¸Èû©Ðߢ€9øüa¦Ç'•ªÇs£K¸(”b4b{, ˜ØçŒ'óßVWEt`Êà ƒE ªèÈêX`‚2¬ð†›´š[\hò“ÚtžZêb ÄÇÝþ´¿E|ÁñÄ~7Ñ~(=եƢÆ%·‚qhÑ-Ì@’K'ÝpX°Î0v‚1Ž=Àßô­~TÓ|CiŸÝÞĈ$|à€O(}›ó Z¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(SÔï$ÔWHÒ#xcOq(&;T'>óŸ›jätÉâ£ÂTž\º¤GW»TÚÓ_Ÿ41ÈbDgäNFFÕíG„TM¤>¦ÑȲêWÝ—;ÌlíåÉÆ#Ø08ã­m\¤ò[H–Ó,32’2o }vägó >ßÁñŒz‚xgû*i7·Ù&RŒ²/ ÈÈÜ#AÅji3M¢ÞA ÞCn#tf²¹¶ˆD’ã–FŒp®ÝÇÊÜîŠ_ 5ÝCÄ¿ô½_T˜M{pf28@€âgP0áZ>2¶øSP•x¸´‰®íÜ`–0]H$r0HÁ4»EGñ][Åq‡ŠTŽ:2‘*’€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¯2Ó¼iâÝsÀW>0ÒàÑZÒÉŸ*È$Xc,é7à¿Ëœmù JŠ(à…!†5Ž$P¨ˆ0túÂ×µ=Uc†ÏÃYÜjW™R[¹·‰>gÛóä^N@²üâ­W\»Öt}~ÆÞÓXÒ$‰.³1‰ÖE,¬»¹Áî{PcEPEPEPEPEPEPEPEP&§©ÞI¨®‘¤,FðÆ$žâPLv¨N }ç?6ÕÈé“ÅFžÒfú´?Û!6¼º‡ïƒ‚HŒü‰ÈÎF;Qái©´r,º•Ä·E¥Îó;y@òqˆö Ž8ë[W&à[Hm&¸Ú|±+R}Èãð kMм-¬XGªh1-¤rHîtÒÖ§!Îìªí¼†r«ÖZ…õ–©‘«˜æi‘šÒö5Ø'ÛË#¦Nמ>V䀸Ú*|=ñ%׋¼§ë·°Ã ÷F]ÑÂU + ÆI=gÞ­xÊØOáMBUââÒ&»·q€RXÁu qÈÁ gÐíÅuoÄ)P:8èÊFAüªJ(¢Š(¢Š(¢Š(¢ŠÀð‹t‡ÓI]6â[R²çx]¼¢xÌ{@Çm­ƒ×Š¥u¯xsP†?[Ág/›]^ªŽß•ÜylA8IÏjËø1¶ÿ 4™ 1I\ýÖ™ÙOâ?oøÊäAáMB%æâî&´·A‚^YE3ÉÉçÓGŒ4 ,:uÚê/³)˜†ç€Bã1‚ª2@Ër>ËO¾½Õ"Õõq- 2ÚYFÛĸgwÀÜäqÇʼ€[;ˆÄEko¼(" èªüªJ( Š( Š( Š( Š( Š( Š( Š(  Úý¾•¦]ê7lVÚÒžV$"©bq߀kʵï j^Š÷ÆÕéÛ åî•)ó`¸\îgCÎ>^ノ+Ön­¡½´šÖá7Ã4m‹’7)##ž†¹È¾xbRÝlg6ˆÁ…›ßNÖÙs sÅq@–:ÜW~°Õå†H>ÙoËnypΡ‚ݹÅgøoC]÷SÔo¥ŒêúÕÇŸ0ߨƒÄ¿Þ¼g’OIâ?ø{ÅÛC­XµÌ6ßê¢[‰bEí¨ÀŽ2j/ |?ðÇ„.æºÐ´Ï²M4~\çË&W9ƈê(¥¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(Â,!ÒLi$itÛ‰mJËâ5vò‰àg1ì9ñÒ·‹*• À8POSŒñøXºž™y¢º¾Ñ ÁŽ{yIÝ 9‘÷\|Û[®‘ªê^Õ–Èx¡?²ï-\Æ/¤kV‚@@;')äò± ï@þ +'Â-2•8œàŒpgÒº\ˆ<)¨D¼Ü]ÄÖ–è0KË ( Fy9 à¯iâ ZZCa¢OêE!¶Òc7(!@ýØ*¼2Äœ’5fËO¾½Õ"Õõq- 2ÚYFÛĸgwÀÜäqÇʼ€[;ˆÄEko¼(" èªüªJ( Š( Š( Š( Š( Š(  ¯ ȧ£׌ú-kV¸]gÄø[àºë6¥Ež™n",2°DSŽø,*Òê>¾ðœÏ©Þ^¦¥w™©%Ý쳉&‘II# ˜eoº@ÇpéQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQ^~ÍuâωzÖ‘6¡ym¥h–)ŠÊîKwyçRᙂÀ(àgŽN=Šä¾k—ÚÆ…y§"ͤêé·/IZ#ÃôF}OÚ]&‰¬jwÒÛ¦³¬ÜêVñÊ0Â)6í$uä óŠÚmzãU™íü;SªðúŒÙ6Ñž~èHÇE r2Ã4ŸØ·ºÓ™gçîœV–™£Ùi) µˆù’fšF/$¤wf<žÿLñWè Š( Š( Š( Š( Š( Š(  zŽ•eªÀ"½€Hå¯yHdou ÖW¬h.EЛWÓ@Oy¹„wÜŠ?z1ŽPnëòšèh  ‰|Q¡Aogq&­h°ÞÌ-íßÌyÈ\ö+ñ'ˆ¤Õ´{{;‹!ªÛBâ9K–v‰$ó’p«Ÿ ¾$êzeÌñÔ6WœGeuy!“°G-Ôú7~‡œí´QEQ^e§xÓź瀮|a¥Á¢´!¥’>UH°ÆXÒoÁ—8Ú;ó@•QÁ C kH¡Q`(è)õRöâé,m:Þ+ÉÊæ$y¼´n3Ëá°¨¨íÈÃø{âK¯xO×oa†£„ªWAŒ’z(ϽtôQEQEQEQEQEQEQEQEQEQEQEQEQEbjz䚊éBÄo bIî%Çj„àÞsóm\Ž™ÙmÇ”ç˜÷¨m§ÜgÆ|ÿ’C¡ÛÇþ”I]½Í„v陣*-çxHÀÀB=ºUøgJðµ‡Øtxf‚Ó9X^æYU9$íÇnI$ã&€5袊(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠÀð‹t‡ÓI]6â[R²çx]¼¢xÌ{@ǵëÂüÑ¿±¾èèÑí–ê3w!Îwy‡rž§&Ï˦s]ÕQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQ^e§xÓź瀮|a¥Á¢´!¥’>UH°ÆXÒoÁ—8Ú;ó@•QÁ C kH¡Q`(è)õ™¨Ý_·Ùíô”ˆËp¬âîd/ *1É Abw (#<œñÎ/„¦Ó¯\ðÝ¥òyÖ/}f“.6™ .€ÿ ²ç¸##‘Ú¸Ûjžø‰­xY¯¤Ô´©-Fª·74ñÊï°«°%¶±éЙ¬OŽ——ZT¾—N¹šÎE¼tW·s B2¸ãb»/†RÉuáSyq#Mu4ïæÍ!Ü'šì¨¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢Š(¢ŠÿÙÿØÿàJFIFPPÿÛC    $.' ",#(7),01444'9=82<.342ÿÛC  2!!22222222222222222222222222222222222222222222222222ÿÀZ®"ÿÄ ÿĵ}!1AQa"q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿĵw!1AQaq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ ?÷ú(¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€ (¢€?ÿÙ endstream endobj 383 0 obj << /Length 1119 /Filter /FlateDecode >> stream xÚíWKoã6¾ûWè('Í—D²I ´Û¶X,P¬{ÚÍA•éD±#%’ÜÝ´Èß¡†v¤,uÚ´§"(’¿ypfÊ_–þ@¾ö퟊=jÛ¢¹o›nçqe ZUxœkÊvÝcœbØÂaû¶¿•to_%ãMUÞn\O»ýd‹ ¾ÝÖxÜË1Óño-všj7[aýl؇ªqªú³vêÄéèó®F–Æ&þÑí5éÀà³À{¡¬n6ö¢’-ì® ý ùÚΪ endstream endobj 382 0 obj << /Type /Page /Contents 383 0 R /Resources 381 0 R /MediaBox [0 0 612 792] /Parent 378 0 R >> endobj 384 0 obj << /D [382 0 R /XYZ 90 720 null] >> endobj 381 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F19 385 0 R /F59 61 0 R /F10 376 0 R /F4 377 0 R >> /XObject << /Im2 380 0 R >> /ProcSet [ /PDF /Text /ImageC ] >> endobj 392 0 obj << /Length 2002 /Filter /FlateDecode >> stream xÚX[oܶ~ϯX G›FªH݃¸@j8ç´hÓ‡ìA¨,Ѷb]¶’6Îþûλ+Yk§Ç~ 9‡¿W­|øW«Ì_%Aàeaº*š¾Hï_(é¹ àžhü°yñÝ»H­”ïe~¦V››S›rõѹ¼Ë·£é×nŽ~½vÃ0rþ;Tí-‹Æ;ÃËŸ»µ«S§û7?t7ãZ'ÎÄyZZk?q¢õ›Ÿ^\mNEZ?ã5jÏò*Tó"etóóéÑÅ(Á GO¯ó¡*ØÕÝ`XÖÝ°à$ßu">ÑÙ ñ¸A§íFî÷<*:Ì­_x·%wØî#Å„^, ¦àðÎÚ>ðw²#Ö鸽5­é@v¦±«“ÿåaØÃb4-¦Ò%2’M¸1­B^€Pb䦠Á)¿AÍä}]Ù[÷\~L#¸þô*ŠR/ŽÓ§ó£èº'ÊKùqfrÊYôEá͇~üw2 EQÎ%G™îQ?2Ÿh=ãáÜØ C9Çù™è Î †Ë[L™;ð1u×µipà3×|ÉeÐâµJ”‚o£qzæ¨Ë×-h EÞŠœí–UcÚ°ÊkVrÔû;Sö!è=À-(æþ”2AO‚Òt„ ‡ÄR)y‰N¬Æ¿Ä ëü²UßSÙaʧsFÓ£QÂ3Ô©Ó&”¦b.ÐÚF†vví}ÛQ±×²){ø:’Å’]pX3ÄÄÞ°Í ƒ§ÊC‰ô`yg:ñ½To¾ ¯£U}¯8>Li¿Úè Œ ¨¤ ”Ðæ«Ò^d“8ìÄêZ¸cÓEpx#'Î8 6y¥!âræ`š\ž£‡Úü¦«kNt‡º} ;”|k¿Ï+NžÃëE¨S/åÐ_õ›‹êÍÅ´<|ùôæ¢YJ‰ o¿Õî"±Ýã6z©ò*Ž×C‡=MîV%Õ“ … ë±ÂàCQ¶\›’ª²„‰†Ÿ™À‡ÃòÏëêÕ«;ƒ…ÊG~ ©ïÊÎ<=oï¶0vG“ {]@>‡óŠ©lôÿê’æû ½´Z+òG¨‚RÅS#o±äûÀÀ®}Y`ŸSöfÝ ß;«W‘$„l§N°X§!Gêäý̺ÁJDÜØ«¶´KÒ-»Æíå+HþY8+`›Ü2>‹$hÛÌÒ¤“C€R&†îûn”¯’ÓaÂÃZKÐ/;þÊ• o Y r$‘ÃG GQ ¦Þ[“¢g»+ÆUã”# ç‡õÀ,E À¦Ã€k¨Ð‚ ϘÃQ¡ô\ R¨@S¸P”—¨äéAtÝå¥afrVÔ‚/ô€ÂÎô…º†±ó#3·¯'lTíÆÊV» ÷ø¥•fádG ¥„h=³—P‡ž “é^ˆŸ¸ö°+ðîØͪ… ?X”#l„ø%Ó÷”¤Ó=Ýw;ŽòcjÓs ÚÖœa†¼ßc6ÿÊÈÿ’Žwñ¿]þú~sõ¿Í“ŠKÜã ²@··;:!éÈ´¨Á%_M\ºìÚÑ|y€Œ<¤¶Qf#E°:î¯FºëœÒ¬®Ý,KΉžLFLS`‰&6EWï(/LŠ ó×w•øõ á’çVQf•×¬£¸!z"­á·êžÇß_ø¯¸çÏ4§zô€[i¸öýéÓVPQB+‘bÇ…ÍñqïêeÃoe¹—­U|©¬/òI<ª<ãÉNÏÜvmÿˆÀÒÚþlmõOÖ¶wG6J"5aßo»‡¼BB*[h+y ¸Ö+%Ü ¥dQ,²@6ÒN‰õÔlòV?…üéÃæíæê—«÷›çUª¦) ïw͵õo`„ÛÊçqѱé|ùYr2íµE¬ìš¼Z*àÛXP4#Vˆ§hFçÃ4þ?´r~’öqØ~}dÍ[Ëöðª)¡ÏÆ ZpÏ™žóÔô› KB¹æþCø·» endstream endobj 391 0 obj << /Type /Page /Contents 392 0 R /Resources 390 0 R /MediaBox [0 0 612 792] /Parent 378 0 R /Annots [ 386 0 R 387 0 R 388 0 R 389 0 R ] >> endobj 386 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [244.381 608.544 462.264 619.453] /A << /S /GoTo /D (Writing The Input File) >> >> endobj 387 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [194.293 582.242 366.018 593.151] /A << /S /GoTo /D (Calling CLooG) >> >> endobj 388 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [285.212 555.941 414.273 566.85] /A << /S /GoTo /D (Basics) >> >> endobj 389 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [218.298 368.989 421.494 379.898] /A << /S /GoTo /D (Writing The Input File) >> >> endobj 64 0 obj << /D [391 0 R /XYZ 90 720 null] >> endobj 127 0 obj << /D [391 0 R /XYZ 90 720 null] >> endobj 131 0 obj << /D [391 0 R /XYZ 90 656.143 null] >> endobj 390 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 395 0 obj << /Length 1674 /Filter /FlateDecode >> stream xÚ•WYoÜ6~÷¯X´ÑÆ‘LRwhN¸Üà ä! \®D¯éèØJZ;FÛÿÞ!‡:¸–ãÔ ˜×œç è‚À.R²ˆ}ßKƒd‘•Äì~9 fæ;¡xµ:8zÒ%^JRºX]NE¬òÅ''Zº4âÔyý¡^º,qê÷K×÷}ÇUCàp\æp‹Ë¨DûºÁå%N§ÍxUÉjƒÛ[ä)î®DÞðåçÕÏoWƒ±!cx£(î»Ã¦îЀz1IQxÔÐ' >…qèIHôZdC:.ÃñG®qxy‚#Sö‚.õ=Þ¬Ðo+°¿0‚KK0%+N%Ò½ïƒmsuÈ\ùòäZ‹t\[0¹oZœÄƒ}sz²ëvÀy½íd]µ½,ò|2Ú9QÿÑ0ÜòªÃYWãØ ³QòjÇ‹âÎ_Ùõñ£Ýà¥hç`‘‚i:ý æ©­†Úûãó×?­Vo?={ÿ0éœYöýžõ>g¼Ëtø#¤U6¹Ÿ‡J^F0&`qŠrWW²…ÔaÄùƒÐ ¬|š„K;w¸XëœH•²"ÇùŸF‹Ò"ŠÁ~-Í[™yYQ×›9›"¿'|Ò[’mÕâ+/·…Qݺmê%t#óÞY!¹¾kµaUXç²í¹Þ-©ƒèº4e¥ÔYA 1qx;ç›yMz‹;ÑvGl¸I}¨,ê9ÁIjôT9Nn—ãXaÌ0ßà‰¸ëðÈE¤¡Çb:Äœ·táBWwˆJ@B/8¬ ÈÅ%ßÝ3”¿ß³neQ`#ÚB*¤:<@4ÇÆ¥cÈzp;:z§€€p‰¼1|õ®Ó Ì Á/±³úè)Öƒ÷£nµ\›šNÔ¦þÜM‰W–¨‘x„´ΟÍ•£¡ˆ«|•'ìX¾8©Žåá!†¶:ù[óQê¡gï5ð^¿8)e¥Vå3WB‡QRŽ¯‘fL9§Ú†g×#ñ± òêgŽ&'Gïb€6€Üˆ˜®™ˆ-¤oOÆ4X‘ï|\¦ÓÈßÐ*Vúþ`rªÂ§ïd!æâPÁ™z” UX±&!F>N;ñÕ̆I" 2.«O9P Ö…(q‘‹6k¤î©*nÓÄ‘žPÁNˆ 3 Ò¢b­Ç Gy]NèR’`+½ÿB™ö Ÿùc}A@W"ã»Và¡U`5Ýwntùkîpõ$«Ë­,øº0lråfiR «5¬ëF „EäO”/êÐTÅu&ˆyÛšò)UatY9m]šÏs©TðB­ÕÕ@à–Û«¦P•N‚gJÙ®;å<…çÊ2ñ#PJù­{œÖ3µB»¤wMÔVÙKà¹5´Ö¶«Kï ™ †fã™Ú‘ ¼v~Šo'߇²v‰«Z²çµÞi‘dx ÀÞ¬µ4¡¼ûz;¶Í2¤N­þmô”—s†û‰GÓ`4Þ   C“!?@ÿ°Ýˆ_þ"ëŒy]ϲixYòw×:Ž|[ÀpÛ¿a¡ÞE©Ôú"(K¼h±*óFô…^dߪá`wœ{ AÕ ÑÐl~è¿Fþ>7‹½˜|Fu톎OŸÉ"‡CV/ˆ·š²\øжÔS©Xœü6÷UÂ@Y˜$Z‰ƒ‰Ê}€¡Å±xú™í)P!/Ô½pÒWt9s£òëùsóqñkS+ˆç¬?Rtdäx]WXÜôƒ¸âÖ¬Çr2#qÊ:‘øW›ßè×+ì¿Ñ)x±«t:éï§3^î‹4íc¢ßâ‰cgë‹v߸~}QÀ‹ÒÝ—Üw¦Á•Ö6•=¾Õñ3i¤þ.áæÄ ã©Í¿l±„^¢î{=žAa Ã.Î;,å=j=™¶ÿŸ±qßÔ2×wÎñ=˜´¬AÅpú0¦ß©ÇÜóÄÀÑ<3º-BFÉ÷{²)úª-v Ùáû?ÜÙCmÿNN;Óí.rã”~¤í 3ÖÏ3Î[ÿ0¼Æ;1;9†GÂDÖá6„¥¬ÄBgÿ1±ƒxª>³X/gÄN_}ëcxœBÙˆf.5&žÙa–iÔ6Ih«)Ÿjÿ$ìÔ endstream endobj 394 0 obj << /Type /Page /Contents 395 0 R /Resources 393 0 R /MediaBox [0 0 612 792] /Parent 378 0 R >> endobj 65 0 obj << /D [394 0 R /XYZ 90 720 null] >> endobj 135 0 obj << /D [394 0 R /XYZ 90 407.836 null] >> endobj 393 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F72 7 0 R /F54 361 0 R >> /ProcSet [ /PDF /Text ] >> endobj 399 0 obj << /Length 3331 /Filter /FlateDecode >> stream xÚÅZÝܶ÷_q@ªE½ªø!J ЇÔIŠ+R§ˆ¯èC¤º]íê]é"ic_ÿúÎp†¥Óúb#h±ÀŠßœ!‡3¿R\eðW6»*”J­.¯v§—¾{!8µ…ۨşo^üñ›\\‰,µ™W7‡xˆ›ýÕÉ«ûêa¬ûÍV)•È/6[­óäCÓÞQÑx_SâÕ·Ýf+ˤû åßt‡q#‹äý «ZI)³")6?ÞüõÅ×7¨\Êg¨ÆÏ-2 µúÊ”:Jí¯»±Šó\$ͨ* ’‹¤`²ð[$]{|¤’®åª}wªš–ªék’Š>ÿBòav9›ÝÊ´Ú2š÷+×ý§sÛt-7ŸkÊ´Æ·þýKXÔ,Kš´N!©¬ej‹õÉtžªÜúÞ¯o"j‡µ™ò"•… 3Í<¬‰#ój« › m¯¶B¥"§Nã½k;*ð£“S…;úHe·nÏYºS3Žõ>%JLSRÂöäW[™¥™ä‘ßf¢X#ZÈÔä¹'zu Tš)ßàU׎õ‡qm$ ³Y±/KôõC_À2>T6Þoré¦=tý©aóBm5bJ±CÑpÉ=Þ¢˜?rƒãÑ÷©©d«±>m¶0>O™Â~CâšÇÜÁ<Í0´V^ ÞA„w(‚Êú³f“cÕÞ«;ΤSo³<{ßìpž{*ÚáÌ€»U$Üm]’‹2ÍŠ ›»U¡é-b™‚Á`É(ñŠ>>»:I.Ò\j?Âá“çøùûîû ,ÞÍ÷_¾¦B›÷‚ÒU»_¬Øݱ»­Ž´ÄR‹4ËõLÊqÆ=K…²šÖ¾U_jЂ¸uFæÉÍ=Õ­vtb‚‰zð‚ÖÀì®TçŽk:å±k'Fþ" ·Šš·Œ…·p 2Ø—ß7¿qÀ´nÇËžCl¨ró:ç&§ÀÊ9nÆä¿¡É*B]ðtdîÈd“ÀÕ>Js¡AWèÍ kV ÚbÅTæ€èV1Và»H6šgìC=º‡XFzè»;&PC9â©Xdƒ§+’3äO˜`X>›ñ’Å:ÍKýdW·P8l-Ò íýŠ–wa/S°_o }Á©5å*~:‚#³FJ™¥¢œ1\mòK»Ègrˆ͈°·¯‡XܼÍEÖ0vÅšŠ²™–4ûÈ‚÷næ8cˆÃ)¬"¹Ù€ˆ0YdI]— ÀѬ55 üŽË0ÞÛ5h}¹>!(‘‘£ÇÈ(¯pãA©)|¾ëk íY5qí‡â8ê©QS@ƒ1-ÙÃÄx¶¥&÷÷?uO¬:<âš 6ÆÔRÍ`Ùá<:½iÂU¨; %. Qš Ç †Ú»ãªÔ`³õÀy°˜+;A^Âé%yX"÷=â6 &ï¨4€óK@QfèÿâWŘGæ@Ó8t.ʉš˜þ€w1ÉðœA39¦q𜅺vvˆÚ#v( ˆ½dÄîJîsès„L@ç8N5pû€Î1¨UÜ'F²À8gMN呲͒º}]?°ü—-=o‹à#Äg›¶UøÁÄäiAzÚLy)Z(Rmìgm¦à͈úŸì¡˜VE0ÐÀÄ ßÓö’-•œsƒ~­5~D*ÑJz0©8¾ äîÎÐòÔ¹-…ò#‡/¨–…JÅ>Ÿº°Fàð¦Á^4ÏGˆ^ÎðXDÒ í´V˜I0òc½Ë` b   ‹ú ëh•(Z+Úš´(ä3>ƒV±Ë(EÐ €ëk|»ô1aW6À{[,90³-€,qP|œ :Oªü£, Ÿ0qÙ°mÔ™HÁÞÌÅ*Fö¸#²ÿ_#ÞÒWáãÜ ñ ’ÐÆ;¿F,V9ÇjbÏËçvçÍW)/x½²Î„ŠoèvñB! —òf©*J ‰óÞ“FOg ÷b çÞCƒ°¦v%ˆ=š‘ZE+'[™úç3†<ÝlݧÎ:,¶«ë©.£ls¸u(Á§ˆ_ŒUâw¾"l¢Ü p2)ÌmËÆi“ÓPéÌpYå癡ÄlÔ£ïÎw÷3?YJ/Ãé“1œ¶Yy1~b­ù•8ha*KÂA.E[‡Eñ*B~ß8/Æ òw5ÇZ&ë+T†i!°8Z¦Ò.´Fˆé B•ÐøsŒ(ŽèdC+‡ˆÀ3]P0cF~aHwa™?Uª?% \X¾‡°„rì\‹by_¬g’{01kbQŒpòR2Âáþ”êÞ9NÕî_‹‚ö-Ëß f&DZfå,î÷Ѹ’jq»® t=XË]{„8„Â&,=¬C†:M4F M® Q¤(×Îp*è^é+ï©yò½×ŽÊ…O.È@æ„Æ_ÜÉZg¸'øÓRö–ãy3…„Á–SÕc¼Eš©¸iÎ#%10}¬IíÉŠïú†ÏÒR¿ý²É&õMwü@3ËîÚVí;ŸîV9ûUçÓ]~muž%|‘UßÕ½siwŽýsçÏJ•|‚S¥Ö¢÷— gBuVÇ’x¤{¯€Pá”p¦¾Ñ½ZÁÞµIü ,áK«úw·;>~‹«†FKB2ˆx`¨ëå³Q–.‚(Ê,Pîžv¤²Äš«,x=ððm·QãµG‹!m?ü³9Zõ#;|+®-–I“Ã943Šž>6ñ­ž¡e9ãT%Øyb%|ï®+})z3£#€øðHrR}ø‚­£±p0ÄüéÎbL]ðÅœ~u—Ì o¥OQ€I‘Î&‚ÿ®iÛ`Þ7ãýGTx©Ì‚?ö»_ãñU;4p—š—L|ðÑúŽ Å.ú ÇóÉÇÏ]¨`¿ãäà Cs{|ôÒé—Õ-úÞó==[ñëƒ'`ŠóG4ªF-Ž •õìœ!%…ˆ£|+g ¸wÝNì*u÷üÆS”~ ž_OÑ?(\HFØ;ªq—á‡G|AøBä©)÷Ó‚Á˪°ø˜™àæ‚MÁ šüVôÁ`GWepq%n&Ü5 |»ƒEOw‡æâG4Ž¤—Ë02§ºÙ"­n@3îÑ ~#âï‚VÌw>ëôëa]¶ui§×ë—…à4ëàXuÓb·šƒ¤Æ$ÂOîü ß~á—a£‰îU‘™ãìþ„»0Ç–4¯™sØ–gx—R9Èña~Åû·°òÙg*ͧÐîsËFhN[ÀTjf¥q)Ã2JM‘5PXN¹jÁñ/, àŽM¢>ܘ^„i! %çö]` Öì(ŠTEÆÆñ’ÎÏʉ€n^_á˜> endobj 396 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [188.273 185.268 265.546 196.177] /A << /S /GoTo /D (Wil93) >> >> endobj 66 0 obj << /D [398 0 R /XYZ 90 720 null] >> endobj 139 0 obj << /D [398 0 R /XYZ 90 244.753 null] >> endobj 397 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F60 14 0 R /F59 61 0 R /F10 376 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 403 0 obj << /Length 1986 /Filter /FlateDecode >> stream xÚíY[oä¶~ß_1@¢©W IQ¯ ¤m¶HìCí·n‘jGôZöHšHšl7—ÿžsxHIœÕØÞ}+ ˜utn<—±áð'6ßäI ¥7»æw«/„›Å@/(þzóâËשØÎ ^ˆÍÍí’ÅMµùW¤·±ÈU^Dû¾ÛÆRGÝ?¶q’$QŒƒŠJzÚ»—z|oZÓ—c×Óã-MT4ìʶ­Û÷´| oöïLÕ—Ûß|÷â››IÙTÊ'¬AŠ'Ì\Á[µÉ´b"QdÓë­N"R©ˆêvËvg^£’Q9 ÇÆiXDã]9â:þƒêwpO ¦TÚX¾µ£ 4HY.µ§øÂJg¸I¦EêIïÏ1Ë'f¤YÙV¤ì*ÓD0>køðl¦½¡I=nEsÑ~ŠhXŠ=ç™"a"Ä6O;æómi?Û–h_öecÍM?¼D›8IbI Öôíxg(H«®)ë–·2o¹P­÷HEï¶Åiî>Sò{È xña ÷]¡Ö#3X¢ûŠ¬Ŧ`E&3yÊÚXdLå™ODÔòW]Nk¯üšÈY‘$´è8f<Ì–åj# –jAto9çÎ…Å’T3¥Õ£!1¡Oq±Æƒ¦'Ûj$3¦‹i«Þr™®‰‚¥sNð5Fq@k·{ŸcÜjŠå,UâIãÄIžØ–²4ÑȶPÔªmg÷D~ƞܯéØ~Î…!Ÿ‡ÕhË å°Ë”3Î3Ò\»‚ ]çv —™úzKͺ 0…Ãq¤)&íÞåe9ø–äó3LÄ°âHÍÐùŽ>kþ´…¶“F7wõ@3?ZÁ8qÃgæbã"È¡vˆ4åž—[Þ×­q¼lt¤8ìºý±i‡€g ŽùñKt€Õ¸s`~ïÆ76nlÝ(,7)ÁÖ“øŽ"ö~2®¬£dÐE ßÕô|ACCÃ_®häkžAŽižzNÏ‘H¼$¶I Š™ñ£‚gÎÇ qNxLÃÊðÓÈ“Œå™ #ë›r‡ñxá¨3è» êÃZçs‚WëàA ÐÉ|6}ë?ÿaÇO ž`Y’.›%0ïnI`IïëŸP)ãDT F®`sÊ4–ôí±uz{vÙêÅ.Ñ%¤¿Lƒ]Ah9¬š(hÿSyú»µë’µV5@É_°mœñ,úÚi-¼œKêkèç®±cÁ@ StøÜvx$¶&ÖÇÿ»²ÔÓ ïB³7™›ýy³@Ó+½yç¶lXÅ79“¹ ö,w¨ &XƒÑèœåÅI^‡úÈá-mæ`ö´Ín}=Â8`ˆ¹y:ÿïëa\u?–¢Xº_IŽÈ[YäRÈ[æ*Úˆ&™ñèè´@¼TW¦Ÿt¥É ²Â¥Ã`ŽUïèR™ÕZ¾PLp ²ÎM0QßBš×Wâ²~uÕ^ÖðìŠÂ/֧ЭTª‚p­oçOíçaê73‹_]¡é+G%ÿlé,í'rœ’׎Í%íîI`ÇýU}!.ï_]5—÷Î’3&\Ë€óZ;ømµ‚-:#‘ÝØÆ[È rb®\ðÊfFqöø“8›êѵ8ƒЄEü[‚Àw†°ZÕ?AôTôÆîŽ^6|0©;z}rµD%âüŠæ3Ô@´q²ØB Úˆ±")NÁ¨Ç‰ÃËóÁðLä!ƒôæؼ3nË;‡‡ÙÛ¥Úd2ÕÊuñºî!—Ÿ‡aÒm¬„IÏCñ†yfYoç'm;“ïìòI¢Šsd}ŠA–<}Z·ÁœGÐÆ#j6+9xðÚ@ɬþ¿ƒÿã xÊgmá¢ØS²C¶RXMSÁrt8 ŠËwðY&£ë] 姧›pÒëm‘@6ï\•…•šCo¨P T7ª¾+Õ“n 2°•2ºu,z¤{˜TæPïF[J¥+0Rù“r:iÁtªtö}Ù>xV4ô^K¬Å¾GÀ:þ#=íöÝàyt³¬•Ý˜zK^D]kd¤:‰¾v+®æ›÷ÌøfzOh~É!Ï["¸µxqò>sé%sÎd*HnöèÓ•D:,Ç#3`Ù3rð c‘‡ dA¬ ´{¦Ä|Eó’.:ÉwˆË2½<{À+,Dk |«›¾¢Å]׃$×:ÛÊÉ·[†bZúÂüx,÷5øoô ^º‹4Š<«ÓÚîÖW$Ò%p$ ¨ÓÉ'[Ñ›n4žom‘„F8~Ì.¡ˆ’–7ÚHÄ™ÐLz´»•—\±dºõ*÷{úh‘3øhƒè88±w%>RÐÍÊÓ»ÀàÁ^MÊ,Ç{ò)3ñyéŠlqôÈmÀæ°k`)S,S'Àî©U‹ ºþD¿)<-/¤øPw^wØëÄôþÄH8É©œþ¼‘/#,dóK¬œ<ÂMWpx¸C¥`uÂq×58:·ê醶MÂÕ®u¯I+œýlzÚ}ðS?S.,&QSþ·¶?6k <º\©åIðƒþrbFB„Ça¾&¦cÏÓÊî¼ã %]žã¯,ÖS÷í§_ùßY~lHÌ endstream endobj 402 0 obj << /Type /Page /Contents 403 0 R /Resources 401 0 R /MediaBox [0 0 612 792] /Parent 378 0 R >> endobj 67 0 obj << /D [402 0 R /XYZ 90 720 null] >> endobj 143 0 obj << /D [402 0 R /XYZ 90 190.685 null] >> endobj 401 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F19 385 0 R /F60 14 0 R /F59 61 0 R /F72 7 0 R /F53 362 0 R >> /ProcSet [ /PDF /Text ] >> endobj 406 0 obj << /Length 1289 /Filter /FlateDecode >> stream xÚ­XÛnã6}ÏWع©Þt‹“m] hÓ‡¨h¦([Ž•ê’Jr½‹nÿ½Cqd›6å8Åfðv8<œN–9þ1'¦N(‰eäÌÊ3Š³ž1ìyðvß%gï}æ0Jb3'YìšHæÎoîÍ2}é²fâ !\~9ñ¤ôÝŸÛ¼zÒSÝ2Ó›ê‰Ç#·þ Ç÷õ¢›ðÐ]O`2mÅ9§¡O~O¾?»M6¤|Î_a­‡´ù.mÆ"9A$ R3_ÔÀÚç¾û@}š_³i~u]Móós3½òâ{‰ô¥ã1A˜¯÷æ‹íÖ~»~s­ÛrkâóçCt÷ Qü«×cÎaú {43íž bÜãù:?gÓç«ërúŒ7¹Â=7,s¾ŠLËÿª¥‹÷,vb<èÉ%‰" ‰jÜ\CýØÈÂc ‰£ÇǨ8‘‚ù„qˆ"#›FIÄCáîמfd¦$2tvŒ(wØXIÂ%,å6K‚„°…nÌ@ ¸ŒbâÆÃhÜp¨œ;žÚ,G$ á¡Cxöü“ D æ{`b;Í‹"" 4*Œ}aó/çàéÄcAè>Û,B²…\ž>d¯ÍYÜaš/Dãíà^ ó!Ì›`TÈ31Œ8·Zë»Äz[ O¸¬xõ²p/J" 1墛†.óVkk;SʺÌæ«"¯&ÌíµXº³´Òë½£0¯›¼ë²JCòjO¶óêeÕéîe²È4.Å“uQÔJÁ×í%25t—+Ùõ”«ÅY½ê¼ÓÍݪ|ÌP¾jÔÔv–Ÿ¦AÔx±ªf]^Wm/TÔ”(´ó>oÚ΄ÛÐxx¡O‡Ý8 ¾ÊZÝM«ùªšY]¬Ê=ì¯ åº‹’=³ rRJ·%¶¶ZšmÂK!>Œ*„FRmÑÛï·=þŽ øÐä6_ {è†Í¨mûÜ8ƒZžÃC÷Ù¬¼zBŒ¢ÓcLj½9Hϧk4Vcí~ ñC°…¬:1dƒÉ×ÒÃ8ÊŒ\~nU+O$ ¤ññ&J$åàëò¥Èº~´Ñµ0h„ê÷…‰Zï†m«6kto \Ü%HS­!º ¬Ôï®Å]µ†>eUÖ¤š@[(ô"67S€ dSÅ+' Õá^å´Î»%Ș”(wP¹¾4Ù,›ëêæ•FƒâÜZik½*æz¸ÕR¨·FÐ#L0<̽4½\þÏ34ÐK. ƒ4+eÏó¶kòÇUÿÅô3ikÓÚ½l鲶»(Ój•l5•ÌŠº~²>r%"Ø<ÜV9‡ñ´›øuyÖ½vóÓ]rûkrx¨­3ã­(Òêi•>e˜µ¨7Ã>A¹Á覮ºìc·­Ž«zŠ \šæU‡Vj”…nˆ—´IKHð¦ÝÔÐ&7üæäÄ‹ãpÑ«”ü*uú‹¡>}?ômŸ¾¶ü¨ùw ýIëôîšUfjyïYf\Íý‚ÁX§z¹CÿµNè,>áò2Ûó/Ê ¬>)94Ü|l÷.Ûc™‰¯Ròmrûãí]r?=òJ+c:Ь2S)fafîß)_6Û.÷2r^—°'Alà ðM‡Šñ¼õß^½½àÒ—?šCñì¦1³]t0uð*²Ã‚fÇæ•õ>`9öÞaYŽÿ¡m)‘¶Tÿòjëý endstream endobj 405 0 obj << /Type /Page /Contents 406 0 R /Resources 404 0 R /MediaBox [0 0 612 792] /Parent 408 0 R >> endobj 407 0 obj << /D [405 0 R /XYZ 90 720 null] >> endobj 404 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F19 385 0 R /F59 61 0 R /F10 376 0 R /F4 377 0 R >> /ProcSet [ /PDF /Text ] >> endobj 412 0 obj << /Length 1395 /Filter /FlateDecode >> stream xÚÅXKoã6¾çWè¡r·RD‰z-Úm°YlQ´@k ‡lŒDÇÊÊ”«ÇöÇwÈ!eI¦iQ49C g†Ão4YøðO™¿HÂÐËhºÈ·W¾^ýtEôÌwÄñÓêêú6" â{™Ÿ‘Åj=±*wñ—.‰³$sn~©—n:õû¥†¡ãÊ: ©JÜ!ùÈoXW7H®qB6gB”â—w¸§zÙð¢aËûÕÏWïVƒµQœ9Žä8!©—.â”z$¤x¤p #'ZºY–DÎWHêÕª¼Å)ÅÀ)‡¼®ú­h¥™ Þ%¡G"”¨Eð¿®KÓ¼æG¾³Õ£Ð#Q»ƒìKµ¢ ˜C4§¿¥@ÖâûFW‰ÃßãH&VDJî\戶ÈüNË–“ˆ Í=!2øf«„º6ø‡¢’tA CjÒw}Ãq^ﺲÞßI{¡¿?½äлÿàymî³íXÇ·\toµ¡¥õ–•ÂæJŠ ñ3ô8fâã˜!ç@ót9xÎbgŽ¡‘Kþ„,P:mGÒ1Ñä"«Ÿ¦V—oȘJ‡ŒDœR1m¬þ¿ ú§ÞðÌD‡³®ÖÀåzaËDϪêEÞèeg’®ò:Ûr+òÊá¸c0ŸØ<¶Us»¶?j7?®Vï~ÿðëûã¬6³‚iÀ欋T­@WŠ|â@K,Ý–MÛMÙO(J¦çŽsòú°Ówº3 òõÁ¤RrÇ¢|œz&Plž0[üãñqRE0Qá[fâŸq¾à‚Ò‹/(ýÙöè ½:ýZ.ê\¶dŸÙ}‰ ïkœ"Ý3À~m囧éÅý©©…sQBnåýŸÎUã[J³½%—Ê»¾M ¤^Hã@öƒÐpB?ݧÆmžìýâÀ¹»±7Щv7 d»«ÄLÛdieæ‘@wÉóÞ¸l±ÝÍA"/pía /8Wn‘ 뺂Î><Mq^oÁ‡Å[­vÒÍÆ`|¦T'iˆªóª®µF_t´••¾ˆ{ÛqÜHöÐñTòJdÄ)øšõU‡Äƒ:(ß0iõçRÖ ¹\¯q{BÒÒr”8‘cÃY¡WŒøRìúÎL¡tn™Ê ÄQ[gÝÀ¼Þ"Áñ£Oh¥÷«,0Ö±“ ̃ÄéÙ€ŒÒ)²”~JSóV‘÷$ÉPè¯ò€rܵ¼/jwþUà8ƒÞR¬Ñ²ê¾ƒ³y²;? ¾nñ³Å—rYÈH=,6(T¢4+ÉvÃðM¥i…Ã$qzQð—z0é[³IYùª©+ÃÃħVÏk“’é©c’xÞ”¹<Á•±Fk(xÇJÄ?PÌÞ뾃 ¹ö«‚Zø¹«å|þ0$iìQª·]EêqèA(—…ï…Ñø‰hxݳåÙ;©Œƒrel‰!KP4ênì°ðúâþ[ ÓØÙ±G}~Bæ–‡qæÑ`jùá³Öp±y.LÙ .#ž-u€×#?èw™,‰ H<ß WÙN0™P•kVUièÑ00BÚ®À7ÕAÒ¡¾Ì³°T:³Tý®C+ñœ8<—Ð(™h–8Ÿ—Tÿªçò—„€@.P]ÀEPBcaµÄl¢ª>ŒÏ8LÛeJU¸ãɘs-ëy©ƒ >åL˜IUál‰ÃxUD2ˆ/Τ=D§ ¹fl„5ÒlWçS/N‡>°¶Ì=Ìû·Æ€ä$2ÌÏe·AU*‹ƒªé}1'iœŠóÊ¡Ö2D"¨™qjt褊ÜiÛ²ÔKè°|mîRèC‚$œÂb[«¬2S¡jè]7÷V…‰šÑž‰Ï¿Òš‡ï endstream endobj 411 0 obj << /Type /Page /Contents 412 0 R /Resources 410 0 R /MediaBox [0 0 612 792] /Parent 408 0 R /Annots [ 409 0 R ] >> endobj 409 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [186.413 115.928 369.423 126.837] /A << /S /GoTo /D (CLooG Options) >> >> endobj 68 0 obj << /D [411 0 R /XYZ 90 720 null] >> endobj 147 0 obj << /D [411 0 R /XYZ 90 230.317 null] >> endobj 410 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 416 0 obj << /Length 1798 /Filter /FlateDecode >> stream xÚµXÝsÓFÏ_á>Utè¾ôÑ@ C‡¶IŸ€Å>ÇYr%™þïݽ]ɲâ”aß­öóvoï·‘³þÉYÍ­EfÒÙbs1õý‰äU áˆã—‹“ÇgVÎd$²(“³‹ÕXÅÅrö:x¶Î·kæ¡Ö:P?ÍCclðW[TWDêÖŽÏ^ÕóP¥Aý‚öçõª›«$¸ž1o€KÉ$J)ço/~;ùõbðÊ*u‡ÛÈqÃïDͤÚÄŠýŽS#¤6ä·fÚX_óPà›–ä[bƒ?·]QW-:Bz´ˆàPŠEšeƒ!I‘דÏeÐv¤å¹ÛvkZvõ^ñ¦øìh÷¬®æ`µkê’LÉèÀ–²‘° Fém…%‰=Y¢âŸIĪqvÂ^$”‰ˆûX½ ù¡àAZ­2,aU¹+ZÌ™j ¸6A뺖V>·¸(sŒKNò–>,éðKWéÒ3°`Íç±$ž‚M,À0áÁt% .zSëâjåæU¢ ¹ÂáIK1xÓPš5‘ J׶¸ŠÇ&ˆPãöþ皵˗`8Žep6Çðâ)ª¶Ë«…ójup]`pø¡­7®gÙî:2ö&’¦tìBNŸw­kèë"¯ˆtå*×äó‘Dƒä P¢]ãÈYL£ ¶XcXln·„eâzÇ›@Ô-1‘o˜õ©Ž#e#(i“õ駬©­„‚ëÀlæ6òr×›Ì[2Ø®ýY^WD¾ôŽ9¨ ¼íâhÙÊ4ZAµ©æà?€‹¥lð‚hIÛ5\æôsU|€àü’—«¢tÌV-Ùª[UîŠÂékC cyÌ[(6cz©©UfE–ªƒ\aÝ o"O£ÓâÉÓßO‹‡a/éË?^ZJa¬9Lý9sœ«‹Íï@ó»'Oÿ8}w‡fV¬ÆŠÃc¶ÿýæ6õ×Ù<7·ËMÄþ_åøŽ€‹6߸/”Îå®;^:1Ü„/UŽº­rt6-I‘@Ç¿ý´ï];ß­tä±Ú‰¾{ŽÇrÓf„©9óÄø³Åø2P“Äû˜o¶˜PÜx¸Ákß‚uEà\/—wý ¬aHðXhšÖyu5Ⱥž›:TÞ å>ºÅ®ßZxP–ðP¼PË$^~#;ßF½ÃØßYÁûÓ¹ ¶ò$èZx£’$ ^¹Ž¾îZúmܦ€žkÃ!!uŒÀp¿¤­c¡ªf¾Mþž w¹6>±ù-‰,v%‡&jvnéÂc f™jéàéÄ“i„ Eˆ_öÂcå¹S_ª˜£ 0T±Z'€“ŒH2ëÁ¡P)|¡í"ö¼áˆù¼ª¤ u Nø'…"§^Ÿ/ò /ô”·™ÅÁ6÷Å\j꫺NÁ·±¯7lÏu‡—SeÞK¼¿PÖ$€–ðôv|ÖÅŠ†¯ —Ñ·á· ÅvÇyk‡øÂ@WÜUþZêžT7—Ų¥ Â1D;&ãRK¨Ô”G[m%?p:ZäT#ìÕóïÑ î<"ÿqãþÞŒAøBà}Üúru¬ Á¨Ÿ2Ò$ X›À‰ào|)Ò‡H!Õ_müתØø³ÝaÀ@,X7Çú>V•Iî†WðIJè”ôãV‘¿ƒ?‹¼åU½¢ßhêòn@‹MTŒPzÒq†^PýèQ¦„’—å'ZWŸP\åô3‚ù¸e[7´ý ¯„V{y"‚ ŒÏO%=4d1 EÆÙ@ú²€vÐúŒø0“×EëŽ@Â3£°aSrãÛÒ¶ÏVD0’†Ö«æ¿le2Cj.zke½G ‘n™ƒåd–q?G<ë,ƒþ ÃHô³Úh&*Ö—¿Ï¨áNjFD\\í‘·7Bwhé¸ c(È3¬¯šÇ“5øé§×#ÅOs¶ÆNh]ûÎs6t9‘>ìSi<¾ÙiÝ@b¹ýîæ Äm ÓuŽ·Dæ±”Ýc¬Ö6ZÞk¬N­=:VƒÉœs«ÓLÈäéGm;<\"¢Œ+¾<^HK¶ïÖÞöxÉf™Ü' %ã× •úw Žø°üö{wúßÈJ%Rz%¾ÁY{kƒ£wM¦"Q“wmÔõôA¼C×Ó)@°öëìD¹ endstream endobj 415 0 obj << /Type /Page /Contents 416 0 R /Resources 414 0 R /MediaBox [0 0 612 792] /Parent 408 0 R /Annots [ 413 0 R ] >> endobj 413 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [262.337 252.067 411.828 262.976] /A << /S /GoTo /D (Scattering) >> >> endobj 69 0 obj << /D [415 0 R /XYZ 90 720 null] >> endobj 151 0 obj << /D [415 0 R /XYZ 90 720 null] >> endobj 155 0 obj << /D [415 0 R /XYZ 90 669.39 null] >> endobj 159 0 obj << /D [415 0 R /XYZ 90 161.656 null] >> endobj 414 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F102 417 0 R /F52 13 0 R /F53 362 0 R >> /ProcSet [ /PDF /Text ] >> endobj 420 0 obj << /Length 2279 /Filter /FlateDecode >> stream xÚµÙrã¸ñÝ_¡§„Ú5)‚7ãñT%»™MR›¤Rã7ÇDJðP¤—‡=N*ÿž¾@‘Žg&µ)W@£/4}PjåßZåþ* C/²Õîtá ôÃ…’™ îã7›w±Z)ßËý\­nÊ)‹›ýêÖQÁÚUIžæÎ?7k7Ȝ槵†¡ãâ9šW•l>ðòPÔE«û¦åeÉ“Èévº®M}`ðÓTÏÇbßêõÝÍ_.þx3jÁŽƒŸž'˜žG©ÌËVIy*ŒøH›ïÖ@;?±ŽÅž—CGzáTóp0EÍSS? =OKS‚VïQgNE‘ïÅQ*’¸æ¡7M-6+Ù ¡ÐÍTc/BKöÝqVn'^Å+W…žŠỷüÓ}s­®Ì›ë¿]™ï¿‡µâµR^GB«ˆïøþÍõ_¯î¿Žø½`\†?ÓÊ”¾<}{Í£ò™Ç/˜SæîÊ&[ÑLúÒÎŒ” ábÔW{A”{îô©xÅ ¶Zt¸¸ôó^:Ág½ xé¡x¾ þ¿^ÿo^ðùÛð_—éÿ ®÷Šë|›lÞ¥p¡çÃEà=@d‚Àᆑg ã^ä… ' œ÷=¸Ì ¢C¨œÞ}2øB˜ÆÎ;Óv=O1:ÐägmA?ý±ãyßðøwpŒ“ù—Ðÿ>Nß6+¥ü™Vaê%aêGó¢©kuîÛ²»d.#¤êÄÅf1Þ¹à8ãâ.¹$Ø0·.ùv‰%8mYŒrS­Ý(ðéžwÍé¦p+S Õía@ÓAèï»ß­ÝDeô$h†·bŸÀùCÛ¬ƒÔy\+Ç쉉Ö*jÖ„xA\‘ÅiV<¢œ Ak´:Žµ:¿®ÜK’tæ.»†Ä‹px¬¢2k…Þ3T÷2òp¨š­‚Q4.#²…ÞµM×ñ6Eœˆ%L+k8í¡Õ'^l˜x*GuÖõÈ~l%DÝ"à™çèŽ Ò«cëž"’n–žN÷P™^pbÿœÈ;L¥R¹”³èÊϼÐO¿è#FÙmð2P”®@ÈzÂ¥‹¼øe0ë8p?A¸Qh¶âœltU S¿PÊt‹Qz«w(œƒi½—^0•X¤6#áìdõÄý¶è†J6PŽ½‹–| &ꃂĹ!¿Ã=ëw8çäÝ~è˜/?yÜ §Š“Ãùû.)pA´_,Ÿ°±h(£AY¹ãNáz±ý½êÎÞ^ÆÑÓ.$Ô=A®Æûn¦:êsëΨt8®±&,£l%ýù;œ[.9­ŠáI+‹sþü"^C¸_±[}™ÑØÇò¥ž*n*/Û”xþýBn"ã8ó§Õ.ë‚*éLI'‡°1âÖô  ‡A·{[ìG`ÅwXêÑÕ¥©Ï`°HßQ~ÃJ>÷G¶Ø×sIÈ$T­ o> endobj 70 0 obj << /D [419 0 R /XYZ 90 720 null] >> endobj 163 0 obj << /D [419 0 R /XYZ 90 405.809 null] >> endobj 167 0 obj << /D [419 0 R /XYZ 90 174.807 null] >> endobj 418 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F53 362 0 R /F72 7 0 R /F102 417 0 R >> /ProcSet [ /PDF /Text ] >> endobj 423 0 obj << /Length 1021 /Filter /FlateDecode >> stream xÚíWKoÛF¾ûWðV¹ÚYîòI94uI{°zjr -2^›"U’²[ùïå.%Ò¢dÚAP(h_óÚÙ™o†`QüQ+ð<ñк^ŸQ³{wfæ"Û¡øqy6}'ÀJ"µL»"–+ëwûíM¼©“Òq=ϳÙkÇå\Ø¿U2ÿ¢·ê›DOÞ~(—…vñ^¯/‹´vX`?8¸—HÅ   žóyùóÙÅrg•`ì ³šݬk7@HBË9kÓ§çr û}’'e\'+½ÜjãÕ´NªzºÍe‘“ë¬(Ìnœ¯”‰¨Áëj`,"4 Ñ¢Fz±©‘OßÕMÕÈmÌ:3þ2Û…òÁ½úKÊR®#¾&;ñçSEd¹žàÄã¾å‚G@è³´(µ¥Ÿ¨ rAgr¾˜ÉÉ7@ýÝ°.¸a†îÛÅ:þSMèâ\º‚* ³Ûùb-sµ BíOÀìÓ Ó½‚ÆD½œ/ô¨…éù«W[†Èõ‰ž;. ÁL{¬Ga,úÚÑQf¾iõŸ´²¥cd#t‡<:tôèfŒ‘Àø*kÕ¤Š×f&óͶÖÓTffó ·†Rû„3ñÐv«=³NÍØ®3=25D#3ƒ Âÿ 3" Á÷Ì ªòÄÿQÿ’¨‡§ÃþEQß=š¾ 0P ùc}ô9út‹ +¹Þdò~½{%|n$  TEª›™ždSéu¹Íó]ëR4!6QM ·JÒx›ÕúìÞØd[ÓÜHÃdèŽ:ìžÀ±¾Èû$?¿ÇZŽ!ÎÙ`+b‹ÛÃÏ!ÐGìJ© ~ÄCéí{‡Í0‡Š(å;ý«Õ«ë<|è£Îƒç©›1èßÌà¥KôZ×ô„£Faš¯1íâmœÉÚA ûK#Ñå¦Lâ•rÔ€^@„»×w“j3ÀZ¶>€iæ瘠a `¾ØûÞ}óÅQ@ª`Â9‚)½¥÷vB¡Ïˆ|‚¡hD¿A£ªê>“B0lpzÉ÷p“ä»ï«2Ñ —ýî2©¡‹ï•u¡‹ÿ Ë„Ô1è HèóCè ± õ»@ÙK¾v"ùú‰úË Ê Þ-äìn¾¸|œÝ=‡ÏCCõaürÁÞ endstream endobj 422 0 obj << /Type /Page /Contents 423 0 R /Resources 421 0 R /MediaBox [0 0 612 792] /Parent 408 0 R >> endobj 71 0 obj << /D [422 0 R /XYZ 90 720 null] >> endobj 171 0 obj << /D [422 0 R /XYZ 90 381.926 null] >> endobj 175 0 obj << /D [422 0 R /XYZ 90 208.823 null] >> endobj 421 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F53 362 0 R /F72 7 0 R /F102 417 0 R >> /ProcSet [ /PDF /Text ] >> endobj 426 0 obj << /Length 1328 /Filter /FlateDecode >> stream xÚÕkoÛ6ð{~…?ÒM¤"õðÒ X·µØÐtCc`Ö} eÚV¬H® ‚bÿ}w‹ùrò'jê‰hÏØoË©$¬|3õ¤”ÌÃE1M»Üîh»6…©tSV´] Xê¢ÈŠ5¡wD“ßm̲ÒÓ¿æ¿ý<ïµ ƒàsðÆ}{‚}{„Hüd%ÊR‘I§/¦@²7¤£YÒ¶­­^6C@­¯”»¶!p•å¹( 2å¾Ì@E~ƒŠV\¹k²²p>3õŽ!á@Ù(ö“Hv„/NñÎÄ“•—OH_„tfŠ*|à!ßž_gÛ—çïŽ/ζÇÇ€túÉrÂW¡rô‚\ ¤ÌèÚ9-Àå„ «þÝg†g¤ÒÇ¿É¢,’>“Ð"x_p¿'?št/ð•·(`¯³ª§Ê8doÍÍT frÚRÀp¹«Œ^âËXî‚Ø\‚ÇzW{+ë^ {™›“?æd¯#òDìGà×}Rx£!é 9¢¢NÚwSO©€ehA0cÙ,lTÚ´µYµ9ÁMIkm‰¦åŠ>EòÇt9!æc«s È;ǵó”zIö;žéªÉÒ6×U~G/çL¼ÜíÆ WÕç‚5ä=ØÔ4¦™‚YtÄVm‘b<×'¸O(UˆÔT]#¥î4Ä­Õ¤À߆¸X«PˆqÔŽM„‚D:5–Ùµ)jJ ØÞLÃé¼5µ5‡ ÉŠºfå ×ø³_º¢u“u¸¥_£×’„ý²¢ãθ¨kÇÈ a m4öÌOÆBMŠÀP£\ÀØÀ‹+HÕ§}V<›PxÀ Ô{â»(ATîŒ(]¹PÊAgê"â;kl€„ì'³Òmî°àØÈ:–Ê“Uг‹’:Pþ,_[S5-ëìƒí‹%UËñ’ÊýP£5uõpM|Á£{5•C@ÓøbM½:çgWTQ¯¾½¢>¡rö±ülÊ\$Ša³‚@˜o:Ê´#èç,Üts–•a/HhõË΄Ê)RÒºÓUmzÝX÷µm$¯vµi—¥—ÒWÎÒ€VQ²?pryVÁ¹Ÿ„òà]Ç^›µû½_ñ˜&DPa\9-øP¸ÒÄf/ ú8õmâ>ןÕkwÚ1~¡ðÛûi"ÙüýïN\:«Ð—É0Ÿ)®íÇÄU[ ˬ֋Ü,í,¡ög 5œ%¤#QŒÿf‰…ûŽMÑO[§÷˜Úq쇑¸ßwhGò E?²¨ßW·¨¾RþWúõ}ÊñÉ̺ðžø8~ë~rê=äƱ^öiô[ö1ªË¯ëttoüÆ?XtGï endstream endobj 425 0 obj << /Type /Page /Contents 426 0 R /Resources 424 0 R /MediaBox [0 0 612 792] /Parent 408 0 R >> endobj 72 0 obj << /D [425 0 R /XYZ 90 720 null] >> endobj 179 0 obj << /D [425 0 R /XYZ 90 626.025 null] >> endobj 183 0 obj << /D [425 0 R /XYZ 90 302.296 null] >> endobj 424 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F53 362 0 R /F72 7 0 R /F102 417 0 R >> /ProcSet [ /PDF /Text ] >> endobj 429 0 obj << /Length 1653 /Filter /FlateDecode >> stream xÚÕËnÛFðî¯Ð¥(•”ë}ñÕÄ=Ô±ƒiTÊ©éaMQmŠHÊiPôß;³³¤D‰vœœðÎçµ³óZ‰ ‡?1Iø$RŠ%:ž¤ëî°w'ÂA>ø{¿ÎON/1œ%<“ùr_Ä|1ùÓ;_™M›ÕS_)åÉŸ§¾Ö÷¡ÉËBµ«Œ€ó·ÕÔ—±W½¦ý¬Z¶SyŸ¦€45PIñÈÁô¯ùo'óÞª@Ê/˜GvGr"ã`¸³;Œ5J“Ý’i–Lý ”ÞÛ©/<0NÁÿ ,QàÍÚ:_d Zrz)ø@’š)‚f+Èo­e|y]UEfÊ_ˆ5û¾ó;V_D,TêH¸åPÀÀù‚œ$jôv€‹sd4_xm^•noŠ¢B÷~rû<àc† 0½“ëL8c6‚:èHA¢ Ù-z0ˆ½•)EF¸²*ým™·ôewNø´¬jÂ.,6¨lâË f\+p‘b4[-y™ÖÙ:+ñ,mÃðÚ"oNÇŽ´—š’ ª0¦î‘0#œ¡¥¨Zª%­7[S/œ0™€µ¹C~ÇJ±‹´Y™Õ¦ÍUJ&/Ü×uU;(ûÈE˜æhhäµÌžˆò*[šmÑÒeßOƒ.iëR$w1ÀÙØ%ɘÅ6rx’¬Ógà x¯wæávKÙ‡ ¡å&¿›,˜—›mKà2Ç{²dp~Ò¨5‡»–Ý]W -2q?hµ7T˜m²g~vJ÷« ÂP;§Ð7 hÆg~&^ä/ÏÊùóç]øåË-Ó>ˆåï’6gg´ò§H˜ ä½uœÎM§rÇú‚Lðë¿cW<´H‹ErÌ"ýt‹ü1©;c¿*†l ИuöH]j4ˆB&£/Åòă1$ŽbHq¦€`pºƒ ’]ÉG=þU!ð=]ôaô©~@úÅA´ë‚c5UÞ%tŽ¼nZjc¯²M»"ÐÖuX?”uUã1NXë¾#.Q~Ë@mqhŠŽ›š¢—q cØEÌD,}1Á¾‡Âð Å.ðBî5Yë°Tá…[Óék[RDÃlÎ@f+Ù…H†Þ»ªuRÚ•q" !š[gç0ŠÀ-¸W•Åg„„“Ž©ˆøO+¬Ýa#ÅïG³ÝlH~ÝvÔ×Øúœ{:‹4)¢ï\[^ ŽY€ùazoœôÔ4ña‹DŒãG…ň rñ`ÇÃâÇáaù Z©U˽£©HØB¬`¿2ŽÌÐ⦫­&Ô5éØ–N„s9|qS€pŽÜgN t|$:+œ2 ¿ 'mJãô‚•© ±A¹‚mŠ ÍБ’`Ö`š•NAk§ èm¾Î6–—|$'åäyµÞä…×v¢‚D:Ç”8zŒ&b9!úáÌOI@Ïýò‡ÒÐñÓp “p á`8 Y$Ãý$Œ£~8 \º)¦6Ïð`QúÑáTÆ}±ŒéW’¼Wßi-íÜây7ªº’k7Ö9“ˆnpb@ï†=šOµfHÁ j'À0ĉ›€x5´_ŒŠ~0Œ«=!&…#ÆÕMçdìÆñqî)ê‹n²ªÞ-X²´ìfgб«‹¡ùÞp -k“Ö4²QXu ÁÉ0š$u;(xèÍ ± H>x â~QÑjoKKáÝa…¢ð /ÆŠú á„s‰Åt¥ ¥=U+àè¦oMµ­Ó¬Áz¥©Ü !f|Q4;ö‘„¶ç·# ¢Üö€ -צÉSOB¹ÒÄ^.“-9Xa{‚mæવ—´VÂvÿ]ùªé•xFA¡+m²j)vnêŽßu„¼,ã¹<Á”g…´6®oà†n×”7Ž,ƒcî[ÛñöŽؤiU/èÍ/BÊ/@S@e¼¤M™e |Ãi8÷|GÒÅ!ÀnCm¸irÌÆ‘Ëq•ŸN]í:|µÉþ«­liô ý>ÁhÝ{ iÌÀð覿‹Ú°r?ðF\1}<_kÅ |l¾æO{¤ðÞï-òÞ>í7{lŸÉoz¢ÍÔÃlÿ××Òa+Ü(Da¨Ž®4˜Pjà™î0¯®Þý8'ðòêמ_ÑúavA€_¬ ¸z?sõnHu~õûû7o/íH-þˆ÷Û] endstream endobj 428 0 obj << /Type /Page /Contents 429 0 R /Resources 427 0 R /MediaBox [0 0 612 792] /Parent 430 0 R >> endobj 73 0 obj << /D [428 0 R /XYZ 90 720 null] >> endobj 187 0 obj << /D [428 0 R /XYZ 90 720 null] >> endobj 191 0 obj << /D [428 0 R /XYZ 90 411.096 null] >> endobj 195 0 obj << /D [428 0 R /XYZ 90 330.062 null] >> endobj 427 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F102 417 0 R /F52 13 0 R /F53 362 0 R >> /ProcSet [ /PDF /Text ] >> endobj 433 0 obj << /Length 1150 /Filter /FlateDecode >> stream xÚWÝoÛ6Ï_at 7CR––¤@´†®+fo/Ëh‰¶˜É”!Q ‚aÿûŽ:Ê‘%5ü ;ò~wÇã}ÐlFáÇf)-‚€¤a2ËvgÔ­þsÆ僀?øyuvù1b3FIJS6[m†*Vùì/ÅsŸÅé"õn?WsŸ'^õiîAàùöz¹Òmî‘ÝJ-kaªÙ ¡×dBk¥·¸¼GLùXȼó¿W¿œ}X¼8ÿÎq¬ÄóóðáyKH2‹“° Ä#]¾2òþhä¦-‘.¤ÈeÝäÞ^Z_À†ÏÂ"„ý tV¶¹D‘ëÆäª"Å»‘${I´TëÓdwÂI“€²±ß_E-vÒÈÙo¢lå´ã½‰\n”v¾¾ÿýÏ÷Ÿ‘fô5;K#ŒÜIm݉¬®¤ïhD÷¥SÚHKìt/–̪P÷†KÿšÊˆòüüê¿©àÀüTð¤é C#–E‹)ð0ê)J[èÀj'Ï £pl±áoµÚ*-\–)ƒEѼ¨ƒAuß{ü\MÄåYNœ¨Zß`8 ]nè‘aº î¯^ÝÐ+u}£¯Ôùù)Ñï|oÁ÷/€£1x"U®¦Î6‘(ç´¢ðdšŒ2ãt¤ÉTÙ×àUòæK»[÷ZmÜ}j#·uŸ û øæ'd~ÌÉ4(ý梻Šïµ–¦­5 З]xzùqm1 ú¢m‹Ðw¡-ú|­3F9N GrÐsïV”¥X—P1ÔÇ-ôö€{У:MŒŽT±Åàc§ÆÏFØëuUA£Ðï;nÎ~õÙ‚ÄAð\ ‰c £qÅhLü`¢&ÔS›)k0 Â'?Ö6¥ZYF½(IA‘R[ŠybJ}Èzˆ‘™R Ù²’^jÓę̂Êi}Pe‰Ôæâ“ȸQ*sdM! R…hú%‰·ÏÃÄéQýì­Ájåžè¿õ”·;0Ã<=‡Allóyè-ÕN•¢.Aà…Må¾…œ:;§œ0È°CT»½Â;œB‘4{ájoCpaŸÝkšéf%ö»&Ef,kÜpêüv§òñQdz1 Ó§(Ú#¦Ô[òhÙ\ÞQje}ê IW¾v ÎÞ8P? í¶¨Ý¢p¦Úæ ¬…†`£|P€DVյ̌–M3UÞ6yàdÓ.áÞºµ÷±D*³W&420…Ué6Ö݃JöR6\Bo;wìÂÂãAàmÛöŽíJÓ*g±À-îUsÈÇgPK™wc&fÆ.À€ÆkD ÕLŒªJw^BE ëÇ·9””PƒBWü¢kðX4¢ÞJãÞ—pŽVl{Ñ%n òx›@À mipLÄž}A”L¦06D y|4[?=eˆe7uµC*¯ZpždeUmqåA™Â)ÆõƒÞtœòî=ìvàÜ”o $6=t.7Ú}ž†„'ã¹65¦=uL/_›9S3üË‹3|<‚–üµ¹œ>l‡:ÃÓ`öÅÿS\Gˆ endstream endobj 432 0 obj << /Type /Page /Contents 433 0 R /Resources 431 0 R /MediaBox [0 0 612 792] /Parent 430 0 R >> endobj 74 0 obj << /D [432 0 R /XYZ 90 720 null] >> endobj 199 0 obj << /D [432 0 R /XYZ 90 288.854 null] >> endobj 431 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F72 7 0 R /F102 417 0 R /F53 362 0 R >> /ProcSet [ /PDF /Text ] >> endobj 439 0 obj << /Length 1776 /Filter /FlateDecode >> stream xÚµXÝoÛ8 ß_à^œµVõ寵ÛÛÝv8ÜÖÚ=m{ð¥q—ÚAì¬-†ýïGŠ²c»JÓî0¬‘(Šü‘¢HÊbÂ៘d|’(Å2Nf7ϸ£~{&Ü(†°ÇñúòÙÉÛHLgÏÄärÑq9Ÿ| Þ,óuc6ÓP)ÈÓPë(øXå‘š¥¡Á›¿ªi(Ó zGó‹jÑLeÜN˜o€KŠ„'H¦_.ÿ|öûe‡*’òläxˆ[öq ‘²t§š ¥ úÉó)쌂w¦4›¼1sš.6Õ æÕöëÊ°Ùªª®ˆr[4K„ÒU_ºä1Ih¬äjÝUIv†³|µÊANu Üö¸4e‚Çíîç'È3 e¦™L£I(­™;pvI`¾W…ƒ¼Ìëågñ¢làGœÚýp”2fŠË¡µk³Ø®h|“Ï6UÍhâÔò¾_æfQ”Æy±™£¢ò‘‘Ðþ/‘|Æw‹¿yìzˆ#+àHàß“nNÌ/v{Êáºå飘3S¬†(Lž ³<©ã9ÚkÆ“`Þäw¸áîøžÔHÁw ïvª_íTß{ßyaÞ{øpå“pœýG8úA9r!l ï¤üF· ØF|öó¥Òn9¾Þ«BPÑÒ®÷ªõô…:¤Wý?zõãÕOu¨=2§a—uS7.ëáý1ýv„û.ÂK‚éHΫÍRç›âª(s—§ŠtµÙ“ªœÐNmáp\ŸúØÕfÅK~Zœ½|Zõý´Þƒ=¬á4\Ÿ½üpz½GC4Üì R¯OP_8JÌÞXyýýzÈûÓ³Ô[9y›@ASŒCEÂ…ª-T0–EŽO2,½ (–Á9¤ä`Û¬· m|°;‹YwÅ4„¾A%*»ã•¯€†nK(·õÝn„ <Ú8hgb¦­*l_ i–E [¹Ür.‚Ú45¨§Áe½Îk!¾àÐI°Î¯D-ƈ”ŽO¢¢‡Œ–ë–±0‹ó+Þ¡$.)± cÛÄ¢uÐÒrô+ݬ¢}1 k¹ºwŒ½Óp·ÙÁêà(T 7{»&bµÁó‰5–{ZúJÌ6mÝ”¨xNk¹cÆ+,˜4Å¡å=g¬Ît,áM”°(M=ã–7ì1ûü:IåËÌœ•fš@}:·žµ èo§)•7Û©!Èk©SÚË"ZÇzðþ´fà=¦Õ¾7hËöØ<¦Œ…õC$I%„ˆÃ±¨V« #âÖ¾¥‘4¾Û@Â÷`YƒÁ5ÍíCîÈ÷«Ú=øwÐŽ©Døò”˜ÒE* B’ÇÓ±†=^_6 '€å’ò&ÎmëÔÇãIŽë”±°î¤_P݈ù ÔHÉØÚÉDª[nú¢õ0ˆ IèŠL=›FÐ#4e~cjoM’,xwìk‹ Ÿ!?tŸhj¨ ÐiwßnæpÕí Ÿ•Ï¼àãˆi‡“1‹Þb¯ìŸ þC×ßì1#ai*f¤êÕ5$“%0¸Ú}ÒÁéŒb}îVm^KùŽ}½Êgnh+^J- rÕ®¤éÅ›êïVíc|½Nª,áÜ›Kò¹Ä>œm«¶W\ ZhÉó¢ns4P]Çg7¶’l¬}¾—±d<휒÷1»Ûzãwº]gä;QwU…Ú§›öÊÕpOE×xÛ´…FÔØÙÆߪ J}¢\¨{`Dàv÷ÊßøaÖßY†ËŽq¨j¸’ÉØâq™Ú;Ý [ú»G­W£GIOï(_¤¼,Ç^ŽÕ•ÃêBO¿Þsƶ :zð]2¯¿ù?ÌR~ÐÁÆ´Ëì¹ËèâåT¸VøÐÖfÒ½¶i­ endstream endobj 438 0 obj << /Type /Page /Contents 439 0 R /Resources 437 0 R /MediaBox [0 0 612 792] /Parent 430 0 R /Annots [ 434 0 R 435 0 R 440 0 R 436 0 R ] >> endobj 434 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [267.329 218.012 345.075 228.921] /A << /S /GoTo /D (Bas11) >> >> endobj 435 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [370.462 204.861 522 215.77] /A << /S /GoTo /D (Optional Features) >> >> endobj 440 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [90 191.71 127.592 202.619] /A << /S /GoTo /D (Optional Features) >> >> endobj 436 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [222.97 178.56 300.455 189.469] /A << /S /GoTo /D (Bas11) >> >> endobj 75 0 obj << /D [438 0 R /XYZ 90 720 null] >> endobj 203 0 obj << /D [438 0 R /XYZ 90 326.297 null] >> endobj 207 0 obj << /D [438 0 R /XYZ 90 264.346 null] >> endobj 211 0 obj << /D [438 0 R /XYZ 90 109.66 null] >> endobj 437 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F53 362 0 R /F72 7 0 R /F102 417 0 R /F60 14 0 R /F54 361 0 R >> /ProcSet [ /PDF /Text ] >> endobj 446 0 obj << /Length 2113 /Filter /FlateDecode >> stream xÚíY_Û6ϧðá*'W$EýéÞ>ÜI€CÑkãpÀ6(‹kk-KŽ$o’+úÝo†CÉ’­Ýu®mŠÙ}°8‡œáü†C> àŸÏÒ`KÉÒ0™-·OGÝ<áîËÀñÅ“‹—ŠÏxÀÒ å³ÅÍPÄ"›]{<™ûB¯Yê²ÌË‘w4¦ø¸6Y­çoÿ|òbÑk«„xd9Èq²žX̸d,È­'JBÆeHë ÑÜW‘ðþ=O¥gê&¯Jœûâ%Æcc–&¦²#}ÿnÈ;ž&RLɨc…ÕNÉã IÜË»#&%†ûïó„³$ˆà#f‘”“sM¦ƒAÇsÅ‚2 O¦Éᜅªçùfî‡aèµë¼!ÓU»°†Ó͆>Ž¢­ˆyWçåè-‘›jk¨ã©n-¶+/Á9¶e7ljký8eišÎ|–KfŒÉŒ?€‡zûÜ´“›ž(%éÁˆïœãy”`A$?Í„ï¦M¨"ÈÔ™0œ˜y¼ñ¡d±ˆÏ0 <™øÔ€ê,¶¦(ši–UKüdKylK Øûxb=]ikšF¯ÌИ!“a$ìÞD S¡câFòΘŠ,ùw+ï%žË}QPëŽÝfjÁÍxʸHIηU ÀpiAà-Á§òÌÔDm׆>ta£Uì-µÛ îêêma¶Ô¨nH€¦æ+½oš\;NSä[؃£¿FbâåÌ0ØpXÿ{ëáÄj¿u¿{¨DE¿YÞ´uþvßÚ…Ù•HÆ-Äj*B§EEž®ó W„„¦Õ­ÙšN"’òˆåÒXRɽŒeµÝá4¶wƒ¶3ui ÇM’*bÍò.M=’cýfhªºÁUòÐ[¬ÄªÎW9¸ gØ%ÌŒsçˆí6ÏŃ› Lï¾™ò|ð”ÄFL¦1‰µh¢„ò~ T_ñËÛ¿]}çóËüÙ3 pêûÙ*äbÚH«ÑðÛ«ü ¸¼}d¸[Óuþæúö q]Ñ/4öå®ïÖÎÁ‡.žRûµ“üôbj«FJm¬RTjsRj<Üj°q3ûN-§êS«Öæ þôZ‰‘VþH8ÉþeÐs´•uXÿÔ˜Ö‘$ø·ÖWLÓRSƒ+F¥ës'69œX ÞìË¥… j.u9䘪}™ut·RéΤk¬\$gu û¶Â¸¶¤æN× œüÿÚh”"ßÐA?=¾]@ý~NRÑ÷Ѭ1Ç9#ˆ_|r¹FjóŒØ3 ˜TÃl§ãõÌܱH«Òõ«:Â7_»ˆñ™Ž_È5‚Ã05Òè4óê¸ÑåX˜ÕýÙtžÎÜ#!3äq!â<`l$dÇ+…s¤t”¦2>&h£bÏ"–Æ2± N;Ƈ¿½&®pÄ$âZù$B³0‚ùRÐœSz…L„½¨üsçØ»ký>Û²güT}'fß*·w‹)Q"f©¶+„·ä^-¹b±Jz5§dÊ!ÇA»±2ë@&ãƒÿ¸%¢ó,!¶DôYRE÷½™ÜJiýô·° $<ùf™ÔK!ÕƒãqÄ žKªÓ*‘6üÀå͔;6ôÝ®5ÆØ$ðl$Å^½ÄPµ&êÐy„ù5Ò.†ÆæY0ΦIð{ÈJbÏu ²Ûlh¨ù`–ŒdDÕËeUgtDŪ)d´Ó†:dЊ ‰ åBqȺ°KgÐ  ]CxE\@ÛÖ¤v–ƒÞ ¡²Þ3[Cd²}ѽ'¤ÃSÂU%Gs¼Šø¦¯â³<$𜠊àׯû‡wIGhÝeŒòGNDwÇõˆ‚ÇŒ‚«ÓÙáý³F÷øÜà.~àž<Ü9…‘äü0ôœ 6z–I)jx—tk–‹°Þ+,<æbñ”@Ø™ ƒÁ=Û—²rȉíC'… ¹½Œó ýLŸ Q⇨è“!*>@”/ï³aÀ’˜^SŸæañqPxTàCë…ç»ìCVñE[õ|¡ |†GhÈÓ£9|;4ï Ka¶‡%à[kIJ»¾L¡º‘szëH=.ê"oé®ó#Àp>(q([^(LkŽt€Û[X7íäUשŒQ ÷þvM_pµ¢²ŒM€€NèÊW‘K!àWÓϨlí€am¿±â’qW›;*ž`kP{t”Ú¼Ûçu_PÁåóç-õ6ëj_d¼Ã 0†WnCAõ¬«‹¹b™«r@JµoÉfã"¨ƒì¬*¿rõµ÷(§ªë®ÂÖ~å uúmS<IJaV]Íí/÷¡.øX%ÿ‚ºÔ ωÑgÄÄI£&áo+ãW¢¿ŠY‰/èÿýÿ|è15*’Špe·oé¶pd¸FצqÏ©¥»Qݾ6à/¡¨å´kKò‚wï´„Æ¢»û»‡dÇM¬ö@-2¢°ÏêÐ#ô‘F _óÌdSÉ@””8ª®Çî9*<<” 'ÈBÁz‹µ¦i/¶ºÜëâ§>Þ°eQU«iïâ`»èðj6õ¢'Bp+×uÕöÉ?ê{þ¯ï/þ³xñ4½X¿“_èrµ·7zlá¾ZÉÝ8ðˆ‘FÏ«²5ÚÃ{BY¹H|ÚZçeë¤à–Ò¯uî-dsu_[«æ"$¸::r‘wrlæ8iæb¿-›)p"Ì»‹Üi?´öúÚôÿ¥«Æf endstream endobj 445 0 obj << /Type /Page /Contents 446 0 R /Resources 444 0 R /MediaBox [0 0 612 792] /Parent 430 0 R /Annots [ 442 0 R 443 0 R ] >> endobj 442 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [146.121 410.261 221.985 421.171] /A << /S /GoTo /D (Gri04) >> >> endobj 443 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [90 322.201 237.909 333.111] /A << /S /GoTo /D (Scattering) >> >> endobj 76 0 obj << /D [445 0 R /XYZ 90 720 null] >> endobj 215 0 obj << /D [445 0 R /XYZ 90 720 null] >> endobj 219 0 obj << /D [445 0 R /XYZ 90 655.156 null] >> endobj 223 0 obj << /D [445 0 R /XYZ 90 609.934 null] >> endobj 444 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F102 417 0 R /F52 13 0 R /F19 385 0 R /F59 61 0 R /F10 376 0 R /F4 377 0 R >> /ProcSet [ /PDF /Text ] >> endobj 449 0 obj << /Length 785 /Filter /FlateDecode >> stream xÚ½WÉnÛ0½û+ô"¡•ÃE›ƒ¶@8Aƒ6‡ZEE¬#7J,JµiùûRâHmJñÖ؇!éáããðq†Æ’_lR:y‘5ÍFZ®tp[ŸâÁÙ•-Œ†#4ÂV,Çå6 ›{¦µY‚·kú¨Ÿ&ñE<þ:¾'Ý®&BDÛÿí*û]sÉg°sÁD’%\,MÌôø]¥‹¥Ø˜vp"u—g,å&.žrðeŒ0ZƒÂð<å )ãwªA•™æóUÆ—¦¸äï™\²j¦ ¤°,®f×iÓª%ˆ×¬mi9N±ßH2Õ%‰M;­¡ÜMLÜ‹ù0¹‹ {ÝÅýDt¢éÛNªpkMphÃT¿ym`´Îh´>õY:œ­ÄjÚÉ ‘æ¼Cˆò€5I¦y-™t(‡`C—ÁÕåã)ô¹yü•ß)tjЫûp½ö?N·È°Ø6¸®ß=noñÇ~â¯ëÞ°_ÿÞ!c×åR¾)Êç„VB›¢™ÊÂÇDÞ*~údçêwyÇãoŸo¯w¬~¦â7™2! Uï">Õ¶mÈ,­‚W»›¼#¸cTżɖô¤)¤€ÛXÀ¾ À( ‚>XÈ\E6)ì_Qù&D¨/÷¼d·³eI°>¢z‡õ 2ź¦„º³Ê±V£D4JÈpR›Œ`¶WèþA:‚ÚN”¼ž íHij]ÑÒ(ù¥‡c(5Rp°”NÈLcžîÜŽ ¦QŠ ”Œ…Îðø3æh=E{'IÑøÕr´ñXþ7ÿðø|ô endstream endobj 448 0 obj << /Type /Page /Contents 449 0 R /Resources 447 0 R /MediaBox [0 0 612 792] /Parent 430 0 R >> endobj 450 0 obj << /D [448 0 R /XYZ 90 720 null] >> endobj 447 0 obj << /Font << /F51 8 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 453 0 obj << /Length 999 /Filter /FlateDecode >> stream xÚ½WQoÛ6~ϯðÐ8‘- ­lÅ6th5°‡­ªLÛj$J0åAÑÿ¾£ŽtÍD±•Ô-˜wäñôÝÇ»#C'üÑIMÎI§“¢¾Šìì͵Rá‘Åo‹«ŸÿtB#’E,VÇ.ËÉ¿‹¦!eI¼zÓLC–ÍŸÓs„fˆƒµÊ.¶¨®¥’Û¼k¶¨®Pˆ]äJ•jÓ-î©n7r¹Í§ï]ý¾8 Œ ÇX܇ÇCcJ’(ÌÒ˜PcP£QPˆ-‘Ñ¿uLáCþžázKqœãpc†@BÊ >2·ó‚O"c²ÈCF‡¡=âI’‚Æ=håc }/´økã=á(ò2á!ûøÒ.@¢ÙA›yÐè% €8ª>“G×çžD–dZÈ´¹ÆáC€¶ÅØ}ÿH÷¹êPêµ´u®vyUÝÚåݺëä¶oÕF_–µTºlª*¯¥àǵ8×P\õºRq‰é²ÀQî|ö¸¯ß½½ ”TÌ`œj›ý+ˆ®wGÇ—Ø5NìËnƒRG¡TºËÕ”B q²'ÆESeKTÀ±´8¼[‡‰”Ä<rzEÕ4öÊ WºÅ«Ù›2ßiMÐb "Ê™ÅÌy:€Ì1@$ã~ù|èC”†A0N£àS)÷(5+1€ÃHã=¿fò?H½ƒE»EÊ ©ucª)Lìjók?fJãºüd¥uøÁ(·CLqF‰àÂÅ×ÒA(‰ÅÁÐQ8=A8½ª‚/Àëd §µƒc«:«úkOçP0™—¯«ÆÄàööQ’]¾]›âàÜvÏÍR¢Úmòò¢³Uc´²n+ juÚÙNûäéåm®4]ÝsL–È‚_qo]*|¥Ó8Å@‡ÄÓ‰Ó£Ê 7a$eg¸…æsgcÚƒqëEdJ%IIÖÄŠoÿ~v íä~SÆ~c]hUcÎ#νA¦ÎoäÖÆP瘽r÷ cSx~iFe>ðn4¬XL_”R.w­Æ©Ÿë3%)6 ž¡Ÿr…­Å¤¾í2¿ØnËL¡ø¹Ò§cìã¸ó¶³Ú‹Ù—°ûT+æìE+^Îü>>æKï¨ÙXúŸ»þèé­øê 1„C®¾ ,¯ÜI:95È) )Œã°ûøvò—ó–ü).ÄöÑs /¶wì>-¿Çàõ?A‡)ç)¥Cœ> =͈|hLB\¸hÔØ¢q‰£~PÞÐoIu:oF¦ÍÃKæ_æÿ²›Î endstream endobj 452 0 obj << /Type /Page /Contents 453 0 R /Resources 451 0 R /MediaBox [0 0 612 792] /Parent 430 0 R >> endobj 454 0 obj << /D [452 0 R /XYZ 90 720 null] >> endobj 451 0 obj << /Font << /F51 8 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 458 0 obj << /Length 2423 /Filter /FlateDecode >> stream xÚkoãÆñûý ýBÑ÷ÁW[h/MqÅ5 rò! Š¢,Ö©Ôùüï;¯¥H‰º3 æîÌìî¼gv¥ïBøÓwYx—X«2—Þ‡7¡@ŸÞh­`=¡øûý›·ßEúN‡* 3}w¿›nq¿½û%x·ÏCÙ­ÖÖÚÀþiµv. ~ê«æ‘AþäÁ»íjmÒ ý'Ï?T›.ï^ft¦£W¿ÝÿëÍ?îGf"c¾Â-R\±›˜;(£#'ìÆ©SÚ:f×®ÖQlF“H„1h 3sÏ °u©ÐR*kÞô·p:Ú磌8y^ôyÏ“êp¬ËCÙ l(·L‚¡ed^×-"žy:øíO=*zJYéòÑÛª+‹¡–³w]{à•ûªG‰Pm•¹H„c×>vù¡ÿdOáäjØ·§‘¿†ÚÕ¤¤$È‹¢ìû²gLÛ1´é‡òÀ0d©W f€ßïesNKšz¥ƒž4e¹í™%BP]5O AN t„ÂÞŒuæY:TjRzU"ÎfÂĨ"ñÀ‘ð…'‡¼jjƒ2PýŸª- ª‘kÙcwjŠ¡jžýF¡ø‡™ú‡5À_jSb±¨Ûöñ¡¨ó~x(º2Êdíéf¦@[=TÍÔ¿àzø6¸¸ì htÚ,xÞW2º@ŸÊŸVà Ä¿¸Rñ¶LAjH»©Éz0‰‹®:Šˆ&õêTßdE‹Ary³eLW§ [j-ÜÎä¼Sló!g ÷Cw*`¥ Š¶ëÊþÈÆj¶ª©øHâwHƒÇ²)»œâ‡×Ñ’­lƒÖÉ—ÌcÒDì•È§sVb#õÃaQùY¦l6_L“Øžjâ0žûçÄ0‘ È©á{hIÚÈr¤†ÀâQÞ0&ßÀ9±Ðþ…³Eþ™çCW–ga,.+$Î[ð&ŽÓNÛ=ÉŒÍabö¬ˆðˆÑ )Œü–x5žƒH–'ÁôõˆcW1»l= ˜„àÉ–}îªAöb³ N“× -8¯m…¨j˜¦AHV€½cP+ÓïðÜÿü¸J]p¿ZëàÇ¿}¯–úÈíÀ¡e¯(¹ì“³•ÂiNØ2j×Ê’¢%I?ῲ©Ê¦m!Ô{dð: ¦¤Ì ½úrù¼žÁdµ“ûŠZD î;X'ì‚ãzCñAŒTiGOò¾$^û>VR§¬‹Ô<›©† ©Ò\Jß} 1!Ž¥ó[‰ì(ø8e(qÁ·“ü²\Xu¦´Éø÷Èaè<‡!rˆ§±éÓÖ¢,&˜ êW{³F¤'X_àfŽ˜AÀ€go™zã½ù¼EÔRe<•Dž€d-»¡—êÎ L‘×Å‹€ лã‚sZNòÑ$¥ÁTÎã(âu˜»'³*ezƒieM4l4Y-ÎãDzçrŠT)pš¨ØwNï°ˆ1=4^QðG®j=Bز˜p?µÕ⟗‘¼zºx‰ —^@èq³K_Y3PB£Èž±%a L´ÏÛ“cvŠ£ø*ÇcÜZJÞ.sTY°ƒ«Š Z,.ˆÇ~†š¹Œ}a\ÆÊÒÅ1y#ž…èiS‚óÖÓç‰ë 4ñ~àú’Æ*5É\§=4j5•ß(Øs–<áNC0'jxt£u¤Rkæ­ÊÔ¨KJÒa Ž1.’hÛqI3,aB±Ÿ\M4ïÀµA‡ þ i§—•Ý÷$·1F¹Ø]Õ#Ì)C~ÀìŒ'úôà›"CÏ $FO\¬û‘Š³Ô¯Èw|á3¨ý¶‰eI¢Q€ìósQ`ˆX§lxŠ‡m±€Céz?0Œ[^3¹à <Š´¡‘mg‰„ ršù¾FÞZa÷º¤§Âs;ó•°Ð*ÒÉBXàþùàO@Ÿ<Õ¡„,íBÿ$d#[gë3àì±0ÁN¥jDâ(‚ ûHLæ”2pØîðR}nžB§í«·q´$8ìÏ抂¦äÜo7ä‹Ïg_Œ¤s鉨ˆaŸœsb¤ôf0" !ÿ£WMÈf‘¡á'é\3¢ºéýÛZi ¾tŒ¥^„©¥aAý.~¥Âp˜^)l±D+ÇÊÁM+•›T*_«ª¾~]}úCÕõi+µã/Öoaõ[©ý_— Ңˮ Š᳧>¿ª0 s?ï1êóY‰†|¯w,# 69]ž¸“ÜbàÄÙ¼DÕsU ½w§ºeºêŒÝƒÇ‡s©™3M»€’$ Þï.x¢›Äuû÷|³ÓÓ.üPt±!1öËÏUÙß$" àxŸÙù£8ž»úEH›šqw) ã…<ÑúLµÀÝÅVãc:+çÀ_Æ'±IÇoíè¾Û’js;ø¸ñ/9—O?ç§ìE¸ÝÞù·ßw¥böÊ‹û?y£/þ endstream endobj 457 0 obj << /Type /Page /Contents 458 0 R /Resources 456 0 R /MediaBox [0 0 612 792] /Parent 460 0 R /Annots [ 455 0 R 459 0 R ] >> endobj 455 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [484.727 89.626 522 100.535] /A << /S /GoTo /D (Wil93) >> >> endobj 459 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [90 76.476 126.364 87.385] /A << /S /GoTo /D (Wil93) >> >> endobj 77 0 obj << /D [457 0 R /XYZ 90 720 null] >> endobj 227 0 obj << /D [457 0 R /XYZ 90 720 null] >> endobj 231 0 obj << /D [457 0 R /XYZ 90 505.515 null] >> endobj 235 0 obj << /D [457 0 R /XYZ 90 438.794 null] >> endobj 239 0 obj << /D [457 0 R /XYZ 90 287.074 null] >> endobj 243 0 obj << /D [457 0 R /XYZ 90 122.507 null] >> endobj 456 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 464 0 obj << /Length 2544 /Filter /FlateDecode >> stream xÚÅێܶõÝ_1@_´îÍ›H)iR×RÄA‘ì›c,´3šYÕ3ÒX#ÙÞý÷œÃCQ—ázô¡X`E‘GçÆs±âð'V9_Y¥X®³ÕæøŒûÝ÷Ï„_­`=øÛͳ¯S±œå<«›ÝÅÍvõ6‘òj-LnóäåÍÕZfIóýÕZ)•¬ñ¡“‚ÞþðD¯û².Û¢kZzÝÑB'çMQ×U½§í}sx¸/·mqõîæÏ^ÝnS)Ÿ!.å‘Sy„ÈX¶2™fBiéܵý¦»‚¯Ódshšý±èÚê3’´k¡˜H ò?Ô×çj_—[zûéîçæÓ™Öß‚‚óäÅsÖïÊ–ÖÍŽž-@3Z>áˆÁtª=%A¤–4^6‡þXdðñ%*‚ŸâsNØÛªîn½ôÏŸŸP3Áý]ÛsÔ§>)[ÏK×øç}I ¯½Gd+ô’ƒÓíuÕ-|³@9ˆXwÕ¾oúóÁsXÕž…òØ´sÂ똖ÿûmL/Ýéܖ^ÚǬÃm¼Ä â.`’†)î1MÎ=3$1á¸-‡fó+OyÌ¢®ãÆæ ¾Qæ?6ÕvÂí@êÔ‚–‘Ôë~|åyÙ5Íõ…þìxIà‹øwmY"ú&÷Ð- x<8$Äf%7hJJçɧûæà–Y°*ܮδw†x‚Šq{µ‡sWO{msáä½»+‘t€M$-Î;ÚD3&.gaCf9“F.‡d¥1qTÆ„1\±Ý¶å\ ‚R+fl0Æå, $Ih`Ô Z€c"ÿdÝ*ą̃ln è±*£¸jp[ü€\·?Ý—mTÚÌ2=rö¶zcNZƳQ#º= G@ºØ€„\lÀů\èöÜÑiy(%ÁÓéÀnwW50–Ï¢·‘Ì䵊`_–[/€Ù4ƒÿ9|IÞ|ã^H¦´½€Þ¢—Nmó ¬ùñëO• ×_o£È³£~ÇØó¼W¦3,ZT§P Ø]m¹éªW¸ÀP¨„ô*§àþˆÿïÜa¦À§m€ôbŸiYvÛô` ®Âåñ“á>ˆ¼­VYòªØ ¦û­uÞ…ÈšÖó 6Ro=:gpZD“SSCè-¼A9œ"ƒÌùhHø23$Ü@>ÝAàß‚¿ã º>Ñ臾8€K£G½¨êé+tÅ~ÉĜŠ¼¡fh#ö­ã&ûbLH™Î‚í`ÄâaRËès aR¥4í(KþJŽBȤÚѳ#‰½ÿ‚EœÑ8::\h_yÈ„CrLf'’~8óŒòê‡÷ú)ÕH­Y®òÿnáS ˤU#L£QF°TT3­ªA«rjÌ£:mÒùÈ® öH;‹.@rh’ZøŒ)uR—Ÿ;:š\‹¦°@ä¾®‚¢ˆ ˜M5…ÖäëC]‡}ý¾&ª±6QÀᮆœ Ñlé‹;ï5¿‡T¬ sêFãT´Å±Ä´u8rŠQx‚Š«¡ˆz WŸ7ÜÚùfÌOËöˆê’&y}…Ù¦¥ýÊnJ<…sý €*g‚?øþùŸ‰rÈÙ¹‘Æ]¾M!Ç`Å ÷ÍF6ˆšœ¡½¿ñ-˜¸¢ÍobFKcõJ@a –Ç£Vž+èEž\Z¹Ó÷Ÿ£ÙÖ-c´0,ËC¾ Ñ#Â:ƒLƒÇLÍø«˜ÿWŒ®e©O2 êG2…\ý^ŽZ¨"²Eíõ?°Í—Îœo¼89²WáÏû¨1AѤäjö”3Ρ|’p©ÃhÀ¦?l©™÷Õõùmy‚À»} | PC p£™Ûá–/%'[Væ¡}ðîô'j<Ê/°)@k‘Ú.…žïýó蟵nÎtA¬œ/.”ûÞž{œká?âþ9y÷€‘¨6]|Í/±E°$îLL(GYš±rQ[¦P‡òeïåB#„I“7ˆ/ÅÝÁ¯:|¢‚êcµõÛ ²‚žb»Ú@ôn)(‹dS«¦&Ð.a´ã†ë'%Ü;÷'_2"̈PIÏ]Õ¹™ËÄèqËsK•÷RûE mA ¢ÞÊ)|…ðÞô{¬_õ÷`÷û7ÿ¤Å¡ºÃO± Àü§í£Í"”*<‘e:äˆÅaÐ~Œ  Sð »-ý+ΰC Ox„l´öÕ`ÎÒe˜zß·Eç$ßMš®±K…S½«Ë`},†’ †ûˆ(tyˆÑ‡fðU3&¤6L›ùÜøÉá]:Jîâpgb×ÑÖ4gÂÚKºÃJ?ÆU.bÍ9àÎtîã¬PÕÌ.{ëÇ{;)BP=žþ¿t%§åãn˜‹º6­?tÕéàçÔD`ÂÚ¡ïU-°âaÀw~­ BË(µKpŽpÎx‹‘8ìÁº+iöoŽXÁ<U-3Ã”Ô vüÓQÖÖmÝö5°tÛ–Å6L~éŠÎÏŸŸqMê”QrÌ ¥ªúÔw×Ã<ÏÞê»Û± 'Së9.ñUœîÚæx;]=É0‡Œkó‘Èœ+Îù”å¶øL-p:™©Í"€)Ö‹!Úô£xÔÉ…˜ —R?\Jql_|èKÚ[F$8žesJÓø1·ø:ÛzîE*hÛY'¹£-?«òŸ#‡"‹8žÝÂwÑØ.¨C@}ZÜݸ~4cê“OЪim‡V=0´JZ÷g !’}<^­‹yF¸ðœhù¥4§„.j)ˆ÷.õR4pU`χ¬ŒI>o‹cÐIp1ÓÕ›ðëÇ…®BÀÂÑzj}ÛiE✖–ˎŸŽ_vUãÑDb;Ÿ‰î~ H­äôW#màsht„Ð…÷Ë“œƒ>òûÑ»žG~[¢t¼ü‚38gÌÀDw&üMØ€s´Û·ƒ7+£“Ÿ§Þä’ô»kBs*ö%ÁØ¥XR[&Q h. ”ñĨõ,"ÐY¸c•ú;v}MFnÔjf²4z¡á6z¯Ð*Û±åëŠ÷βϤBÍ!åv‘ãÖ¬E>³fŠé±Yp‚ã{…G‘BTÕc©ó”@”2úép:Ž²)XHèñ—4u£‚§Á…ШÖà¸ëÛÚt¸ùÓ®›¸: ˜œP"AœúÚÀ9 dk ))Ÿ Çï_AÒ¡ªÛ–çM[ùŒ½õ¥..†L‚ëGÔ‹~©ó`Ž”‚Ÿ&[-I¹)ÜrtŽ˜«ð9Ö$ô>ðÕÝ.ã¹eCµÂYš- CÓ1†‚ŒEWЊ~}ìÛÒE:ãgxÈ[YŸ-½©orý—vÝ5B4þˈ-z³¥ÙuDcŠ£ÿɯ½z¬ýÕ,g"±áˆAë7ÐÅ5^ endstream endobj 463 0 obj << /Type /Page /Contents 464 0 R /Resources 462 0 R /MediaBox [0 0 612 792] /Parent 460 0 R /Annots [ 461 0 R 465 0 R ] >> endobj 461 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [460.983 129.381 522 139.381] /A << /S /GoTo /D (Domain Representation) >> >> endobj 465 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [90 115.928 247.228 126.837] /A << /S /GoTo /D (Domain Representation) >> >> endobj 78 0 obj << /D [463 0 R /XYZ 90 720 null] >> endobj 247 0 obj << /D [463 0 R /XYZ 90 257.327 null] >> endobj 462 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F59 61 0 R /F10 376 0 R /F60 14 0 R /F19 385 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 468 0 obj << /Length 1981 /Filter /FlateDecode >> stream xÚµYmÛ6 þÞ_qÀ¾8E£êÕ’·a@׵Æ(ÐÛ§u8ø_ÏhìdÝýû‘¢ü9—´ŠÖ’"QE=|ÈŠ+ÄUƯ¬R,Óîjµ}ÆÃèçg"´–0a9˜ñóõ³—o¸œe<W×wC×ë«¿’×÷ùþ¨K¥T¢¾_,µ6ÉŸM¹ûDCûû‚¯ßU‹¥tIõ+õß•·u^?˜™H¤Zü}ýû³7×2FÊ'´ÅO«›:Í„Ò¤îÁk;ÁD9œ(³ÄúY«MU}ºYWÛ¼ÜÝÜÕEVŒE[¦RÕ.a‹¥á"¹¾/j<°‘IÞ56ME­¦Ú†±Û|µc|^H›»5 ®‹0‡(vøËžÆï»Õ¾¬vMèV55Vu‘ïgγ2eB(h(&L¸,<×/þX±¥’eYÖž¨a4Ç‚\Å8LòrÃ$¸6fœ¥©°ƒ¿`‚T&ïJ$Õæ.xÆД²,mïä»r·ÚÖ`#Mò£7þË°)o_ú»ÿ Efs§ñKŸOî­ÚÞ1þ{_¬ëj÷‘îW~Øçû°çóÛ/üRfŒ;v´ÕûnyXð‚¾ånOl‘× [ü³ìRËœ—j˜¶áí\ãÛÐZw³Wj™1ÙŒgFOS@ Á¸l¥ìóÏè}ECÛçôycóç("ZïOnN"D·]ÞxË.5øŒÔrlÚr÷p#Ê4Mr|2µI]ì5º»¥Ï¡Ü5|<âàÌ}ÕNŠh,Œd\èV‹¼Þ3¨ë¯(æÄSÝÓ§»‰T–IÛNƒ9ù¶š§pîu¹¯kÂAÐpÜ?üÃB$[lÜ ,–"©Éˆî!¼ëêŽ0µÛ‘BéÆ„Éq¡ôu;®ÀOÈ÷9µš}}XÁ5ATØbW” -àý– }]~3ë0ÃÃ,¹«á^õbÅCI(R6›o@XGq>t€Œ›¦Ø#^Üø¼š°Kø©?‰þ¢há§òŸèÂÐ£í† t5R±ûmcÈ6S€‘šŸP—»y€iuŽl)´a63XÁMóèv€Hwâ„p-™åf€!^h * pc=\à(Á=žL²Ô˜±3x 1:Ž!’³Ô¥_ !Â…KùwðÚ{ð+釭7—ß> sb· ‹Zåàwp&" Qm˜2~–u9<ɦÊm¹ÉëÍãÂéäEL¾çê—¡ø€ì‚&Lú~Ô³£^$³º‹,½Uè”Óg`ì¢U”Èf`_š¡G?ug)Óiw$ïS´að)¯DÔØV1“Šsm-zcÇh•†×›Ùc@Ô‡pPE&@[ h€?ÏÓØ >×éEàhäú¦é¦œBŸÀ‘3´ãgôö·woÂÜ»ªêq9žý´V½&CÿÙæûºü÷)ö&4ìá"`ÿ‡_¬‡Ã­Ÿ v ;²Ç?U¹¦é‘3E¯öôÈgÁ¹íáãåG¡ Ít'!»Ød…$«ò×EF¨÷Åšl¥,ÐE®Æ¶"¥•qUš¹Þ?†Ï'ŽŸi¶§òk#ììzôô™·0èiK ±§IŽ…ÈœNòû`  ÁÒŽC×¥Š¥†ëbé•uqCL.? iñÓˆî>ŸÄ [—qîÍ9&…E>T×ãÁŸ Fקz†±‹C §ë4níЦ˜ÔÑ4PÉÀë°ÑÇ`¸ÝœÆŽÓ@õ|ÀOŠ¦)sâøqšn°'Å\ïOóž`f:ú¸.šU]ÞÔ6AõÖ}{§{A_îËMða9¼&Ž-Â× •Nåð¢ãDWôtûDN ÆÌza˜J &ÄO¡á/æ°ÅÃAkú“T Ó XµgJü‰~^—Ûb×P• ûÄî/,Á7Ð0Æ0 &N°Ì2ȘÇ/Â[ˆx„™H{åýTàÑuù†mscìrã†úd;ÈŽqô(;ÆAŸãT¤ë°Û«8 §@ån»l—ŒüÂG0™™ÖhÔñÛSs³ÁˬÌN`v¼0*À•¤C˜V²­Œâ†y×ð•QlQeTfé 2ê¨2Š?SeÔµ•Q):@þ2°L Òã´.TL• S¥OVLáÑË I¸%fÊ¥â¯:qLì/¯—ª¯­—ŠËIw¼pê¥BÒïºç$Ž؈“ûÎQõ´ziÕêð”'´Ò4{ºÊÔÁe§ùÇ™¥T7©U$Ø£9}ž¨¥ZËT–žWK ‡´g’p`=DË®‚MŠàb7ý(}Žã&ŽbܤI±¸iãiú qsi¹žËZ€dòž2ˆ7÷ÖQéôm•¸§,›–wÚÛÅ®¬Z ¦ò)Ÿ”Oy(Ÿò^ |:à]ù”wåS>.ŸòP>åÃò)O¶ž¶{U†%TîƒÄq11DŒó ©úÿ)¤âÐýyû endstream endobj 467 0 obj << /Type /Page /Contents 468 0 R /Resources 466 0 R /MediaBox [0 0 612 792] /Parent 460 0 R >> endobj 79 0 obj << /D [467 0 R /XYZ 90 720 null] >> endobj 251 0 obj << /D [467 0 R /XYZ 90 660.917 null] >> endobj 255 0 obj << /D [467 0 R /XYZ 90 552.919 null] >> endobj 259 0 obj << /D [467 0 R /XYZ 90 444.315 null] >> endobj 263 0 obj << /D [467 0 R /XYZ 90 230.808 null] >> endobj 267 0 obj << /D [467 0 R /XYZ 90 111.781 null] >> endobj 466 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 471 0 obj << /Length 2486 /Filter /FlateDecode >> stream xÚ¥Y[oãÆ~÷¯Ðº°¸œ ‡C¤(°Ý¦AŠmÓf§$h‘²‰P¤JR»u‹þ÷ž3ç /%ÛXèAsŸs›ï|3«~b•F«D©0ÕvµÝßDÜúÛàÒ¬'#þtóî/±X‰(L£T¬îwÓ%îóÕÏÔ·kaÒ$ >|ln×ÒÍw·k¥T°Æ?dT«¸ó@ÕÇ¢.Ú¬oZªî¨ ƒn›ÕuY?RóæTÏOEÞf·¿ÞÿõæÛûAÚXÊÔÁçúÈ©>BØЮŒÕ¡PšTúP5Íã§mÖ÷EëD‰eü~‹­›nhÞìÚf¿)»j³Ï¿Dq´q•>û­ ÜÅÓiø•8µ)( 2¬E Ã2Ü?Á*ÊÄÁîXoû²©yÞLv‡V+PÕM¹*àÒ¶"‰Â(~>H~ Ö.:Ú8[ÜR«0±ÒO¹²¸Ö°ö [Æ‹–õáØûõs*´Elk¿+®µZ+ û˜l¢BÓ eR‚Š8! ú†þ³E‰PHë…8õë‚Ô6†â0!ßéØû" šcÏâ'A^ÇtÜ·Ãô0xA°GúJÃ¥£S›¶-:V,æuösé$”‘es šÚM"X 1‘ø”¾<•UA}¸’+°ƒæã©~&Š›Øœ,7û \t²BèäŒæ’]ñôûw°…ñǽ Cècøh‹]Ñõ¶ 1ÎÐÜû%ËÏ·2 ŠÅ •2 åŒ×Œ'"ÝïF$°–‚fèpgÕ¤¡2 :LÇ&hÆ-Fb”H2hªA§?“=–¤ò‡Þxà)êãžà‚Î2ØoÓ?OþK>þðÃw›¼ÿñýßî¦-ßßûã¬áÓ‡÷÷Tÿß7ÞüÒ„*“ã0•qŠsGlß37YU5[„¸²îiTý°9díh§ž}ÃÒyÎE\ÿ¼c~çvÑ€w"™ Ë´}ÊZžPgûÂÛ—œ­FÛÝ]”û ùǃÄk~nÊÜ‹ÖM¬°ž øf[tE¿AÉßj ñšèÁ‹?x±¬óâßÜxÙ—ô£]G[,h´k‹ëÚ¼%%¾_ÄU<„é áÏÝœÀØP¥ÆÏèúö¸…üV22˜9Æ”b:j2" œbÔ‚XÿEN#ÐX9õþ{`ªH/‹¾`Fr=\–THB$#œ9z³ìˬ*ÿƒBÄʨÅ3ufÔ´…£L € KæTÒ”SŠs,Xd ¤ŠÅ°²&Èv.SãŽn¶ˆÑOœ³LF§9‹íF˜TÐþr`;óÉ°zGݯç2û¢&22a"ã%kyW)—?\õ’!#FJ.©¨Êí&€#÷¹lŽ]õLõm[d½Ó"_t®LÂؾíÌÇöâ…}<EIª†î&øRöOT"Ld4•f{Í K‡IÆ&à|#:a‹O2ÔVSãtRÌèAŽD÷<Ò ‘ aͱdW IÇ6œÒá9WJ¤ GÖ.pä>ÃÀy^Jxn‘ Œ5z°Ùßúøqɲ@(¬®Ìé#‡IÊ€‡ª= ß¾£ö²Ÿ«›ɶ4Á÷;ê©þwj¸9<ÖQP8Ûò—Hè2"4[d¼:™ú`ñ‡fÌzW/A& U<ŒÍ¼¤þðúSa-€ÂüŠÖà€Ï¤L2c’p·»p5ŠãiÊyÕqÜTæ*:#«¯VW˜Á|xXXb3€í ³—|ñxH,Nr"X,x@ÔAƒ”üï€ýØqÍÇ¥« -+»žc¸z^Îv|k_’e­£4Äò,È'²ŒšžÊ'n„G°€¢Ã¢ºÄ "›|]êM_ðml¯QÏ£—ye’Àõí„t9¦!žÚ^#ÖæTrçþ;Ê­ÜøÄãp¯ŽŠ˜‹ñÿà1&açs ®¦ç.G°Ž+â‚><ÁäöéÍy­¥`X6›B9ûqGœh²‘cK5s¥ékÖgïxë&²PVSV£1Üü¢ç‰Ñ¹»¹ƒR\l¤m³ D4EÐl­‚7QÏ1x­™EÅÃË@ËK¯HÕ5³‡Ì±IÆ$Ö2/(-B™¥†Æ:?8:²qF"OhäÛ¡©[~BP‰ f›³'„PÐ#BÙU¯{2ø]Yo«cΗ¼?¸Óðf¿s¥ðé ¡òúéð‚H­üÐyñºô:Ìôw¾éCè×Þ˜ù :ÉæÊ.Éäb™®önÞËWÐxòb%S{ýUVÃS\Á§s«.¦$`f‰:Ë4]~îT&„>s]Ýp|ýÍ:ÒŒH1eøT…1÷©9¸¢ñÕ+ý¿ÐJ#<£e‘pk©õ×dÀÇÈãcäI½dr‰°t`…18¨ ¨”#Tø¸ÈxÝ!Û:¬'¨]K@){rWÅ€;ŸœÿÒë8S:¤h%ËA[©ëʇꙚ—C”:[¦dp¨n›ýÞÝR­¡¼5`eÔSò? ¶´‰§y =ˆä&žä&óñDsù&šL7‘þ6‚S*NMÞ6ÖÂæ€È•/ï?Lp¯íçG ’€2§õ"ˆ1'SuXMRÖöWn,´Ew¬zêdÃ/4ÞžšŽûNV†˜ûSÁ|oÖËIzÉ+.N´œgl¬ñ@U–‹ND,TÅ®§Ò±æ—úášæH„&sàˆ1%bm|tw Òßøè¾ §ER î Þ^x‚SÈxòõФ§oI³¨†®¡o9©^ƒ¾èÏ%j£0 J>¾]¹/«¬½ó—„Z5 ¿ú4¤ ªþ¦Ýí?mKÆ÷BìðŸJÜw/̯4ëXÙà{^¯äocuà y.­ þ€FOg;±qðk鿆ϡß›À6©tï'ÛýÍÏ¿F«úÀ¹!Ü ¿¸û•â¯%ÕêÓÍ?—>kHÛ&Nq%3sâM<‘žëm³cÇ1ÇU1M<¹‚äžQ‹ÕÜB&ÒæÛ}ôÁ0û‚&n<—=O"ŽÕ¹ $8WÈd•¤¡VökL ñ‹±Ñ¸’ŒÔ`‚nÎZõà«;îažîÞ7èƒ÷Œ——¼Â¡¥[Xé‰2*ò?|M endstream endobj 470 0 obj << /Type /Page /Contents 471 0 R /Resources 469 0 R /MediaBox [0 0 612 792] /Parent 460 0 R >> endobj 103 0 obj << /D [470 0 R /XYZ 90 720 null] >> endobj 271 0 obj << /D [470 0 R /XYZ 90 615.103 null] >> endobj 275 0 obj << /D [470 0 R /XYZ 90 284.329 null] >> endobj 469 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 475 0 obj << /Length 1983 /Filter /FlateDecode >> stream xÚ­YKsã6¾ûWèÊebˆ'Líaâš™JÊ5ÎÆžS’rÑd±L IyÖ›ÊOãAŠ¤h+Öné@°Ñl|ýD³~x¦’YJ)RLΛ³$PÏpÅÀ÷8~¸={÷‰ãNJžÝ®ú"n—³_£Ëu¶mt5)¥ý~3Æ£¯u^>xR³Ö~pyeæ1‘‘ùì߯òû*«žF°Âáóßo:ûxÛá„Ak9à¦d†)Jo€+$C˜2—"ŒÄ<æ‚D—¢$27MÖè.çðÖX 4é+M$’³§HPêåÔMµ[4 ˆðhQóPî{€ ¦sÜzƼ _”»Í½µ™¿ŸÇŠñ$zwîßo­Áì`/ѽîÊüîüËù;·$ƈq6\w±ÎÂ*çe¶Ñv)•òn©/@ó#³òÏæ`ñá"­^^ü“É—a:`¬_Pêgº·¯LÕ²ëê»:Ñ”OºÌu¹ÐÓK⣆ï#)õá}§mGÒEïƒÕ‹¼|ÔËv\,OÙù¯VëC5Ï[½Ô«Öª¯ƒ¿´´›!­J¢ Y7Áxî$Þu"ï6YQ˜Åo OöìÕ1Á ~?eã½_Ç"·øÑJüôãÕÇ ëâeìç‡K[aUi=„<%n\•â¡2ÔæÑT*”2p¦ì8!ÙÑò{î*[Ó*½­t …êZS{Z6µ*N$"·b¾|½ºšZ \,o¹ a6y Ø–^2æGs’FžD\|úIÆ–(pÔÖ3ËÆ/¶K¿„a¤R1ôø¾8ƒ7OA ÷¨û’<)¯ýӔų-Áa˜•“}½·Ìa*ow[½ìØIÛm¬÷°*hSù ë÷IŸ)„謪ç„ý(CTtεÑÊKŠ*ã°,XЙ¨]s‘•a­½(Å(!|˜Åî{B¢­7Sî-Ò¡ÀåQ¢Z¶&N¹£TvqåJ¢•¿væ…± |+ý Gûúä\ŸhŒÚšõš€±4ˆÝ¬ÉM9Ù¬ƒ=d‚0æ£ÅTðq0F¹´»ý„!RŒ°Lß”kRÒƒ\¦4 >„Hþ¶'š"¼m²2{èëF±Kûl^¨ ÃÇ=$eLŽw €±}ÌHŽ”iW.]c”†ÍÅzV«óû¼È›-vÒåp*öÜvƒ„„¤R@ïàIÛ¬jòÅ®ÈüöU©Ýùž¬Hmƒ¼]½Êu†&ˆ©‚&A|K·[†·°›Åaá6¡Ósü”E¶\{Jæ½1¶«³“÷Nä˜ÛG??²ãÒSC͘ªœ’ ‚É_AkŒ-ò,ÃN0ÆJ!ª`ç†-c¹ïÓq?x½µéPŸØ šý×ÇúÀú$Œ¡ØtR\„®Ä ÈÇB&Ih>lwüǾ?æ %BΨ’H€®¡GfHIk›Y¥g«³‡~hSš = •)´ÎÁ³¨Õ!¨ÕTJ»Žh J¡Á&'øP)s† Î‹zܽv¥$þ–×mïÖ 8aCI^Ç™DÓS` 8H06†¹úG0Wo† Or’‹™DLѱ‹ë»¢¾«óÿÚ# É¾Q¿Ú }ñ*têYÙ6Ç-¡ª²ç0¶[xÝ+ì vyz$`˜€hV§¨H9¢ŒŒT„´Ì—Úz#•=oÄ>h†á£),OÁgë:À·~ß:~mý†ä°0<ÅI°å6ÁQdäUÝÜíÊʶ8©‡ÏMÆ~rŒs~iM>%ÕˆâHªPØGÇ™»½ud@rįDQÄ„8–´G‰ƒÌ:„µ:t]ŸK(ÄÌešâÐÞŽKÀN G”pq•#\Ð",™TýýÆQÇØ89²ç»!bv 6F‘cl ³ÙæEv_TÉx?5FIÄ‘Œ%,C=%<1lVC”EV>ì ¶•Žö²õòêúúóÝÕ‡/Ÿ¿~øüñî2­&g?]ÿrûˇ/ý›ŽГ¥ø$ôX³—ÁìIß-Í&ËËz\on`®½ûªóͶÈWy{1³0Ûçá>å…  ãU0CÐð½ElÛ>’P$©xåÊÿ“;Ÿ¶?Üßš\÷)ÃûÜ;; ØÂmOöÿ»ëiNÝô¬Œ¹x öyøðÍ .|^ù?ÜúÀ9€ÑÁItØääBOhCbâÎG%íY¼±ë)™Ý íÀŸÛ`95ñŠ@ê¼îV»vzŠû.ðÜ»w½ÎÜÉ?7»Ê5ôI„ e®éÒz|Ž1œ`Sš)$¤o­ ÌÙ™ì.¼•ÞòÆ=æ‰Ûÿ±H·ü^ø>Öžä ö‡¿_/Á.îÆêÁö*þ~΂P¶ü'cðPŽQšÒøÃZ®#°ÇÂú×CŒ±èCí!†3l¥7¹=»_ þÂ`ät¶+O}šs®ßéöÛJïƒI$ƒ ÅR!IFqú[‚Ózj``‚ïn‹©è¨›ÿ×Ô‚à"Žùþ,I&ïZ“ö*Ù8²qºq‡«TìÐñy–Ï ?ßý»“—¥®6¦Æ —fë’÷bÒ.TAóS̲šRº&ö†‰I*_Ò‹z½Òž^«ÊlFÞ6ö®°qZ¹;Õ5³aû7{ïÌ¡ endstream endobj 474 0 obj << /Type /Page /Contents 475 0 R /Resources 473 0 R /MediaBox [0 0 612 792] /Parent 460 0 R /Annots [ 472 0 R ] >> endobj 472 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [111.879 106.961 288.773 117.871] /A << /S /GoTo /D (Calling CLooG) >> >> endobj 104 0 obj << /D [474 0 R /XYZ 90 720 null] >> endobj 279 0 obj << /D [474 0 R /XYZ 90 720 null] >> endobj 283 0 obj << /D [474 0 R /XYZ 90 444.703 null] >> endobj 473 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F52 13 0 R /F60 14 0 R /F59 61 0 R >> /ProcSet [ /PDF /Text ] >> endobj 478 0 obj << /Length 2433 /Filter /FlateDecode >> stream xÚ­Y[oܶ~ϯXœ'íAÄò*‘(úÐ[‚Á)ê>5…!¯´¶íÊ]i“øüú3ánkÊqÒÂKR$ç>ó -6þÄÆñM®sÚnv‡<¬¾!Â(… élÇW/¾yeÄFp減«ýüŠ«róG"³m*2—»äÇ·í6•6i_oS¥T’âN š5áã=Mo«cu*úöDÓ= tÒíŠã±>ÞÒò=iîªòTlÿ¼úåÅÏW#·FÊψƒ;É“ñ…<>šMf5J“Lï¸È‘Èîæ{…d™1pµßÕs<é¾ÛƒxžtáÄB[Ò2ÐÍpâ»è¥‚1^ú¼Ì%¿ÓÏÛ·±KUÎx>^ZËصR0)Ô°Éóh‰GTá_£Ž¤”L;í 2‡ZúãO¾)áã/Ît¾ùèw6ŠÉ/l6¿½øop%I™1£ÄR—AKÂÊ0›Û„°rÌ ½$ÜÕÿÛ¦Z'UÔ.85“]R™Û„“Ó½ã†w}ÑW‡ê¸÷ëÓuW‘{6ßìiSqªhplûà¹U'ÅK"·t2ˆÅ ×8``º/ð²®?ù ¨Ë*êa*cNÙuIÎ]`´=6ÄéùX÷´—ã½ë|kÇŒS_Ãö]ŒY¡™–nÙ²½Pê®=ÜŸû AWî›0Þµ`›<ù€ª>ÑÚNÎMó„<BÇf_"Pˆ ­ÁÞ?vh¦€HΔfÜØ¿ãÐBÃØH¸J1+qp>žB:VVÌðjs‘o–:Xæ›wœóØE–i;n—Òƒ…†] ƒhøl›røºœaÒʯp«ª»ú•e¹~5㺻?UE9xzÑ'£úë\4u_?J@~Êÿ†ÏÄy–œ mŸà¹/NAÇ}Pú\Œý© úîïBr¦ô© gêžêëS‚Ifù×wÛGO–Ëü ‰0~ëýà èh~:…_c²ÚŠäa˜ì*”‚ÅCÚ25úÒ™ç†jS»{µO>/ ÏÈU‡â½ÏFCj*Hž“Ü‘w¸í}ûãìY†Ô±ÚU]WœÖ…†‚g3û¦Cï¯Iîâ†I´@(ÊJ~ôÐé‹)ÖêUC:÷Ù³œÌ¹I3 jA,\û]Ý LÉegš‹±Äªë²=õ1Zs"ŒÅ¦½ïk¨©–ýRIÔR&P%÷ç†V=Å,ž†{úõ±†»¹»8oê›XlkU¶i.È@dä@ÚK+ ýf¾)&L·¬öŹéÑ#2CÑ¿ü%üæà6g…žÖ‚·À¨+u8ð#ìïãÊ9 ]1j­!PZOBèª)‰ª«Âûð]ŒNŽ§wMÑõרÈë®?ôÑJ®lG3}¬›†hÜPa¥•ãõ¨2Hù—z¤L(dØÏ0ü~Øš,)šsÕÑœú „#j*’]ÑCÚ¤,ke Üí.O}¼«ƒÂ%uخخæÔÅÄ*"p¸H(²(x¡ÌrÀ6ÕPÉÈÍVà &xö ÓBNËÝ#Ó"!äÕDÓæqÓ@Z-m‹:‰çMI‡€´TOÅkDf–,5§–2ƒ¥pîu>;’c‹8XÉ»‚„-1ƒ,Bjn:èÈtZ-LëÅ‘–g†ƒUo8Mi ¦Ál0Zô´äM{K…U ^Vôe% U†8Ñ=OÚô˜ÄÑr“¼!ÇI5ÞŒ_ÄBÝ]Âþ™¦@˜çä²Ëž†k™ƒ[ ž=QÄ“ )ê|ð•¡[¼tóXƒùh°Pðr`A1÷Ž ‚‹Tøæ¯q™Ý¦&“ÉX[„Üí›#t Ñêa:Iβ¡E„CÃþÔH“ü{‡ ×5®\#ÔÂJ÷êÍÛŸÃç}ÝT/iìþê{¾Rš÷xëÛED‹gP+š¦Ý!9¿ë'Šà°­=öÕ§Þc8@ºˆð©ÂŸøý´ÇÎåÄIº8øùÐÖ%í3²?UÕÈÇœ[ÿy!´ûŠ?yYy>Ü_û… Mε8'²®Ý‘ò¥Ç¥£]5~ñ}Ô‹¡üÉщg”#wBqáRÏZðó®?cÇï¬INÀpìªEBy £uŸ œÍ’šòk--MocŒ>¼éÃÞp_(uЃ¿1QR ¦yÚ "R9ͬ¥*šcO:E·¿Ã‘ÅàÄ…!aƒÛÅË/u¹N6“Ì97Ï]îq9&œz¦‰83S)Â4ŽŒßxPV) „}BƉï—:@tø08†".'´ú¹bæ,Ïær çŠý ñšù¥å¢XVpÉ„ñø¹ ÕïQŽs,Ëf%å"ÁD½"‡öv¼PC:õØG”©UN Æ…•áÄw£A§@8¿H0¡E5Òç|øY¼9 ‹øŠdäºtB;¦¥‰‰7°òH:@£j^8 EyJ¯AǦkit .ËÚ¤Ž×j£6sÃ4Åñö\ÜF[ªTAØ +q;ÁkÅ v(±F 0Un–á1äÈXû#¡ýrÆŸVA@ B¾UeT>ðU9”ÏƤ¦½Ï X’z€¥‚´EG¿ƒ àº—yωPÇp°ð‚'û×è‚ä!ѨÊ€ŠÉŸ FBSŠpÃæ2”ñTY‘L«çêPÜôüY=Æ…ãóƒSŸ<”kI Q¿Ä œÕ$N´¨5Z]qäë#¾åÔ.{~ºððvu_¸¥uØnxÏA<—ëÐpеQ/ŒËûóqn†âƒnêZýÚ£›ÊªÛêûá5ãøa> endobj 105 0 obj << /D [477 0 R /XYZ 90 720 null] >> endobj 287 0 obj << /D [477 0 R /XYZ 90 450.847 null] >> endobj 291 0 obj << /D [477 0 R /XYZ 90 217.551 null] >> endobj 295 0 obj << /D [477 0 R /XYZ 90 185.981 null] >> endobj 476 0 obj << /Font << /F51 8 0 R /F60 14 0 R /F59 61 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 481 0 obj << /Length 792 /Filter /FlateDecode >> stream xÚµWKÚ0¾ó+rLVÄw{cûR…*µËžº Ä@´ILcÓíªê¯;` !À¶âd<3žùæóx€†ÃЈ#t]{‘1/Ž’> z³¹‚­iŒ&ƒWï}h@ÄN ÉBw1Ioæí*Y3\Y¶ëº¦ûÚ²=Ï7ïiV.¥ˆ­°|¹ËF‘I>Èïq6«’ê™ËŒ¡‰BëûäÓàÝdŒPO´Bã8\¤‡ a"#ˆ<]OFLYµ™3‹[ûæ¼ ‰j¥ÕÈÞÚץ괟ådþø)|F×”IŸ{{g?äZÚµTý“dé1y;½m(®N_,/A¥>[oI‘ˆ®®A‘Ö¢îVpW÷¾«Ô•Eñå—º73Ê2¶a§ãùµ8<­Û•m‡ÙCAæ?ì»ánxênoôx’úÑPþOó`AªÿØÚ(ÀoâvœÑñ2>Å%ŒT׶½ñèZËûQk°"¿iV²©˜ BYœ,Å×Rô².Ñ[N“\všÒ¾üŒI²ÂÈ(¼ºñ¨“²šÖýhØŒÕ?vƒµÏ§‘Ø7„aÜÌÖˆ#þˆ¹¥ÂÆbðeðmP$ endstream endobj 480 0 obj << /Type /Page /Contents 481 0 R /Resources 479 0 R /MediaBox [0 0 612 792] /Parent 483 0 R >> endobj 482 0 obj << /D [480 0 R /XYZ 90 720 null] >> endobj 479 0 obj << /Font << /F51 8 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 489 0 obj << /Length 2905 /Filter /FlateDecode >> stream xÚµZmoÜÆþî_¡”áÛr߸$Ú°ƒ´Mà&@$r º[I¬ïÈ É³£ýïÙY’KÞRR Ä}}›ç™Ùã)üñ‹"½0R²BåÛëԗ~~Å}j 6A‹wׯþô7Í/xÊŠ´à×w¡ˆëÝÅÇDä—ž¦H¾}ß\nDž4¿ÜH)“ ~TRRnï+”½·µm˾i){G •tÛ²®«úžŠÔgÿø`wmyùéú‡Wß]³ÕB<³lq¾®G¦‚¥æ"ËãRÑš¶û¦¹¿©êþ¦¿:éú¶ÚÙ_RÍÿŒ“¸Øð\2a.6"c2åÔ ¶¾Ãv_výÍý©lwTðo×O7‡î’q½Ú­ëçÚàÀ‡ž†L}¯§;aþ5}ú[Ï»úa]—›¼€&ñúsÙö×SÙWM ‡’Á¤ì¯ù'¿³Qÿÿ¼Pj°;¯kûõ&(…NÝ4±²÷}©‹  ÇÖÌä~˜ëë[ÎN¦™gæäÏwܱˆÔŒ3©Ìжµý©­-LT™Ü^ “<ÆFÈR&%ŸF@ ¢q¶­-{‰§†ñL ªÁ[$e>_AÛ4ÑhÊ)†¶ ¶1ÓÉ÷=IßÂ9Â¥ê˪îhQ%U÷åÖnèX¥(X:;‡f¿³pO…ñå~ …úF%_.u–”mUÞî}I]l7´*{ßñH·Û–^RUÓwôöêš:•õÎ÷¡ªÇ¾ê¼ æîrcr,ä~8ÛõvG]»öþ`iÉدÃvlÔPTZÝÛØ®s1ßñ²ëªûäE÷½ÐLéñ8©-î±NiQ˜ ÝÙŸ|ö¾ú‚*ekÊÞâ<§.±))ÃÒPÓÜ ýíØR¯Ÿÿq›ZV®úô µ-Ã) †%x`»Øà`•3†i®ïãcrÐî65IWJŽÆ¦³Ô®‹H*[;Ù?ÒêMÎ2-æ»ç¡5ViRÝÑwåøx²q¡«û—šØÉz;ñ};Û¿à 1e—È* Ã4Wª]™È¡Z0Øèc‡¶› q„7,Eº‰]Ùí43ÁË)ùñ*Üm*{çÄ·øó'œ¼(’cyo±ž'\-W¡Š =›­âœ# ­ž™¿NSb14L‹A)8eÜý§v ‰VÐ.N´†ó½Bbêà 1¦ßº1Isÿ“;ç÷kho°¹Ðg'œåL«l6×ó½Z=3Õ¥°ù}÷"^rá•ÌæþÔÙv¨óÐSL@}lá:Ž7P…ËT†@ª kTÌn-ÕtG·™v[ý’rå`J»ìd8|‚N·:ÍbwH0¨}PÅT>© CÛMÐ8²ÏK‘s½À)¡^d—Ú¯,À©ï¯Âµ;•KäU&Oc*ÃÁô0ºNY G·¢2¾Õ&hS™…°Ie–jQ°ÑŽu§Û®¯ú“Óò˜F ®ùŒOåsðñž @@d -˜ÑÙÄ{cFT=ƒºŜăhru´¬é‹HnaTwÓw¬Ë{Û:J:§€„ƒ²mÙC›QÞ®‚©tn£¨qãå—[4ª+¢š¶º¯êrO¹ª''­‹ûè }³Y_—²ÈˆÂ¯°rü#š=E#F¾Óyéwãà~<+¾a0$öö®§Ôí¾¬?S atb@—¤ÉÇÞ¿ÍÌ9?ãù±|j½ô…^È®9¢wÎD!5v*èòÌ,Ü*ëX0Çóy €méóëÐà­€8‰+®”3=GùÅÞÐJâ7ìÑ9AñUGߺñ+€¥ ¯*ù †n¿V}ƒ¶Jλ„‹§êk«£Lã2Rnß}Â&4i~)I›ÁHÄt¡ ?»PàoPÈ*¾>TŽ“8Y}ð(:wmD1¼ý¸tÌç°Åù87År3wó"6!(zÈN‡þò éÏJ´üšÉ/}½àøœ‹ýæ±&ŒwŒ˜²Ø¦¦°ý(ù¯OKF‰ArvÜ;ë_ˆàpÛ=\ö¯Á?:ƒ´p‘ÚtŠ²¬Ðbo°=ÎI÷RåÇúݶGwÕ}}sV;ή¹ôÝŠw „7iý™yF£fŒ%Ük³ÀŽƒ ¬FýF ~cþ¤È,¤·N–cÒÿÛüÎ…­>©ÍÕW¥å3iw«î±ž^FW ©dª3i«dðìÁ_÷÷¶Å½Dêá%=ü}ã½pCÄ é­S'ø ®jë_³-âL¶B»–Š„äÔ”YF° hf·:*©¤)\K†›¯x–iƲ‰ç6Ǩ¯wƒ8,Wv¿ó³¼›Ä/fê£0)ýªèåÇ]nC—Ûõlü|×Ì›à‹– N¬a™\†kñã‹P’™P‘%Zgs°âü~!þ“ ì™ }i*ÿ3´¹¯ïZëì-à'~f4þ,‰þ ^릵 endstream endobj 488 0 obj << /Type /Page /Contents 489 0 R /Resources 487 0 R /MediaBox [0 0 612 792] /Parent 483 0 R /Annots [ 484 0 R 485 0 R 486 0 R 491 0 R ] >> endobj 484 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [297.514 489.407 499.076 500.316] /A << /S /GoTo /D (Statement Block) >> >> endobj 485 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [90 476.257 268.546 487.166] /A << /S /GoTo /D (CloogOptions) >> >> endobj 486 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [461.776 461.082 522 470.779] /A << /S /GoTo /D (CloogStatement) >> >> endobj 491 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [90 447.325 216.596 458.234] /A << /S /GoTo /D (CloogStatement) >> >> endobj 490 0 obj << /D [488 0 R /XYZ 90 720 null] >> endobj 487 0 obj << /Font << /F51 8 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 494 0 obj << /Length 1434 /Filter /FlateDecode >> stream xÚXYÛ6~ß_áGya³ÖEù™®šgM‡wÕ|)Ó ú™þ~(žLn^àNŠL2›ÿµúõîÇU§L$åm‘â\]9TWˆ”¥³8 ™P!iüß”4µ TÂ¥ˆY¢"\êD9b)W‚–hk´öñv2é¨>qêÝÐÉdPméÛ<5žDP7æ¸nŽFÓõsul‰ZQÎáÓ¸‡}sz½=–릨ʖkîÈPµº½t¬5ú O›¹àRXÝà\ê Ú¨²P" ì$õë&oô^“Ì’q‡• ƒ|H ÁR‘¶¬wyÝ<êƇWlm^R”ƒ–!ÄšLÆa¢Ëã~¨E ›—ƒ¦Ë-\R“T1ä±Ì÷zÑáÚ?ähÍ’œ³C¯‘˜ÖÍ#†™1}LÁ9µðšqWPÁÓ›¯TäTz‘ýØóýÄ#~IË{ âÖ´?‰®ÚÅ’¡„±A³¥h©O ’¾\˜ú’ì‹y<Îô·O(ª![Z Œ'é8ÿÎÍ·"^sÒuÏâÉë…uUÖí›ç¼E˜>(ÓçUáuëuÍïKý屿D?ûÅ»_ÅíqÓò»(¾ùš¸YÙNÇE°ÆÝò55Fn ¨­pyÈMC'ÜðsãoBELf„w»ªúüt©_©êQ¤ZÚ¾ÍÙQ)`Nb¤(GsC’ jÆ©×ÍÖi.Ekº*êŽÆème§’xÀ“êPè͸µNœ§Ð#ÌÞqÈ“BbÃàjºƒMŠ«q¶céþælGí’h¬åyÐZWJòké.¢äR¾£ƒ‹dÀàÀÛS¾»-‘{Ȳàþ”›Û+ƒ¸næ 4à¥- CMí›}/ö†ÓyݸP6ZYU»­l¸Êý~ëÍ2θìrÀóqËT<ÌuÁôh§º†þ€\÷pW)‹Ó¨}øáã÷’ÈáHXÊ8Ãœ*kÌ@{°–˧'®\û¬é®¶I”*hkÞg¬‹xqšGqïŽþA›Ã´«„„„‰tDËP$Áo˜ú_ŠZ;­ ‡Sj•¤R$$K¸ùŸfæDƒôé&,íÓÕ³¥âž*Å+>ƒGª·‰ù' épǹe1%ºU£.ö‡Ý jΡ¡Õú½%¼0êàtý"¢œ endstream endobj 493 0 obj << /Type /Page /Contents 494 0 R /Resources 492 0 R /MediaBox [0 0 612 792] /Parent 483 0 R >> endobj 495 0 obj << /D [493 0 R /XYZ 90 720 null] >> endobj 492 0 obj << /Font << /F51 8 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 498 0 obj << /Length 1692 /Filter /FlateDecode >> stream xÚ¥koÛ6ð{~…}¨\ÄŠÞ”ºa@[d]Š¬²¬_ÚÂ-:⪇GII¼aÿ}w–ÕøЉíz ñö”€1k+kL;‘ñ!1¸x­éVf;Èî*-éð‘Èh€5r®–¯šS[k.M#š–`„Ï@ëuÑeÊ*…¢¹Ô夯 >Ï#™XûZhjLJŠ•Äšû– è¸ÖkB2fáþˆÓ«©Ñž@i«¯@%Qp-I”ÜP€kRM¾Òe˜J5=øLIÉ v´ÿ«ãr‡¦O$‚.|>êÈö:` Í Mu¡#PÆ?;nP)P E5ÙÂÀÂÐÔõ;âiçSÁÑ=ê+B‰œQ³rf;ÀoTQA6)šÐ^öÛË««wËç׿_\}XþöúýÕõ´¢" ñwH¸øð-¾Ã†ëó¸™lëÐa‹íÐÑ“ÐM.Ðw‰gÝ£#SÕÅ Z½j=ªAî¬Tø W^54°\o(£T,À)çiž¦CjUÆ ‰Öµ”|­$ûô€Ü‰<׺Øë¤Ç"ü‚ÃÒ-ŠÐýPeµ¹J$eBvrÚ å¢PÊÒhÐ…s¡“XÆÉ Ä™OùdÜod]Y†=«„þ9À¬ p¬‹j¢¼Ô2ãfú¨Í¤íéR§Z &GÈÁžít]ÔY;PFuQ§©ÎÞAéÕÌïaœ"œ¾ lºŠæÀWÏŒ6ñAW£Wg;Œ&Ö؃lfû~7~ÇhEõ­û$±„ÖÕè69¢?Ê`«t¤ä›Æ³ºFu /ŽU­¨i“ ê­Ë”xªÎ…Àþ¶÷^ü„·£ö¦2ïÐa¸„·’]Óô_ò4) ô‹'2‡‚ò‘robÁßÇ‚N‹zð¥ëÄdáNMçغÒr«r&U`½ìÓ@Z‹¿Sxæýdü}Û—þ‘Ƭço»$áMÚ¨„x„çS£ ³#óÕø+Dz”1¸¦´¬ˆ=n¹±M®Ꞧ è³fÒŽ™xAj`µk ×›ÑØgS¡âÀ:ÅÑÅÃ!§+mêª:±ªŽŠÔ*KeF@] é]Ô}ž6t¥' Ž.ÓwY]q¬c~Ý„ÚÜTEADæ#æ[º„:s+Ó’`b®è2ŒU£Í¶k'ªŽÔˆ˜šâpÕ}ddP |WE¯FÞJ±Ÿ^FÄuÑiÛŸà &f£k?¶(?´®¶æ3n°ÑM¼¿ún- Ï©BËÈÑ}O‚}Æ7iW´„p7#+-:Š÷)bê2ž›zÓR°a[—è¡0b¦ß«¯´>ãt €õ 05ÃiÍ&¿ê 3L'’)ðmæõ_ó™À6_«Dì?¢ƒ½ý~pôkS3»+å™ÉïjUÓ<6®Øg/© hÍìµþ:›òËt©':üÔ´™¨íü牜ÄWýæLý×Tø“Ö€Õ@’ endstream endobj 497 0 obj << /Type /Page /Contents 498 0 R /Resources 496 0 R /MediaBox [0 0 612 792] /Parent 483 0 R >> endobj 106 0 obj << /D [497 0 R /XYZ 90 720 null] >> endobj 299 0 obj << /D [497 0 R /XYZ 90 481.826 null] >> endobj 303 0 obj << /D [497 0 R /XYZ 90 245.125 null] >> endobj 307 0 obj << /D [497 0 R /XYZ 90 216.873 null] >> endobj 496 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F72 7 0 R /F60 14 0 R >> /ProcSet [ /PDF /Text ] >> endobj 501 0 obj << /Length 1247 /Filter /FlateDecode >> stream xÚÍWÛnã6}ÏW­hQËζ ´i›n‘&â>¥¡H´ÍT‰î&Hóï’C]²ÊeÑ—"HHŽfÎœr† xðC'+oY…ËIZy(ýëˆâÌ·§ñÃúhþsD'Ô#+oE'ëmbM®œ“}RIVÏÜ œàxæ†aäüÑðrgDrÏÌääLÌ\éˆS³>ã7uR߃̧+êtv½þõè§uK&òýWØ*Ïéú}º”.Ér²X†„¡aÌK9ÓÈ)^þéEüR#yPÀ†„Q8qi@h„QæBì.e"™Q|רù{­î¡&í©~,«zyÇÕüyÕ‹JrQ6¨,ú«¡‘±id}H:Í“FnYXWµ'AÏ7VówFã’I©·F-¾’23“š%Y«RÕbW'…Yðr+ê"ÑF=ÎG)¶yúÎ…@7Z¾)’<©Íûh^Äø¥¢AŸEâÝ> p´|£B5ñ7ƒ¤ u&é0“§¬duÒ%³Í_UÃkÅúøk¿"cãIC`µw#Lͧ@r·­Ea¸+ÚzòíÞ–”JsÈEk«<ãÔ{- ¾Åë¸mk¦6ÀS0Ïûïïžµèy;ð´okµ|y×k&u‰ w¤¨Õ—§ý Z4 —F$Z¢ÞÚ¶°TÏu(Aè(*Ÿ¸Ü›ÏÛ&‡\šoòùéo¿›Åß3?vXÝ !|-!‚ QcZ\•ùÈ|l xñ°¬ï¼í ¾s™&eiâ#G§PM Ã6cySG4& { ý¯0\€¥¹3“Ò®s7gpb`Ósó 4©sùR˜:*s9ZKaƪ!³_ ž˜!…sx´äL¯$úÃ.ÆA‹¶3Í÷zÓ”øDÕ»‘‰-úß³± lºäPå^ofÆÌn3‘{¼šY]iJVAKEôÞU}K•´v¬#plz°V@ˆŒ¹ê¢ÐJ©ŽG© NŽulÆsû0Ð'E$ÑlfËÀ!& ë=‡l7æ`Ús„åo„pêÌóŒe¶ô»R9ÂtéA£ŠÀ¿öûB%†‰ýØ*f¼f©4qºÚå_?[sO_`‡Ç¿9¨~FƸ¸t‘`éKÊÞ€HMuÛPÆo¶¯x™æ‡ ëð[]ƒsý—ì?¼Ù@5Ô§FcsïéÉ¿ÉYñ·ö1XÞlªž: ³Ã—Çø…¶OjÄmÍ6%ŒW×P„p-Xë‡éùôqü^ë ¸Tå&zQu|Š×òôöu,(= pP|-Z/˜‡©ôZ4I»©ÿùs`Yo ‘Hv§ÊpÑœ^£÷ƒ}GëáØ çfÀoÞãôÕÀS&Ôóœ¾êéŠc·×§´ä¸0jßlO”o‡Ê_BØÿ?åÛ:> endobj 107 0 obj << /D [500 0 R /XYZ 90 720 null] >> endobj 311 0 obj << /D [500 0 R /XYZ 90 361.653 null] >> endobj 499 0 obj << /Font << /F51 8 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 504 0 obj << /Length 890 /Filter /FlateDecode >> stream xÚµ—ÝOÛ0Àßù+"žZÔØijÚCéÚÔ Dë"/q!ZG‰+Á?;vl§‰[•uBˆ‹?~w绳à¸ì83×¹ò¼Ñlrí„é™+Gÿœ) Ù‚¡±âÆ?¸£™;Ž¿1~ä<÷<Ø‚ËÙÕ¬·X’þ^÷È]èy^oÈÿLzH|%r2Ÿ/8⤟!Lzeˆ²,Î^Äp.ö$ï¯8*Pí?»õ•µS¸ÃW´ý¦?ÀsGp:q.¯'#àM„Sq™%¦}˜ö.˜„$£øô0dø‰ÛÆt7S IQ.W1Ií`òÎ ¶,B^¾Å™\º£7ªæ@ósk"JqQ¨0V hûÕP§ç)‹IÖ0L¨.íª¿eù¶>Á˜Ë{¬¤ˆâÚ.[í¸Ï)3¤”k‰øꗴ؆R˜ ’%Mk{ B´9ðrä¹r×øB¬¸ÙÆI$DF!â¶ÀR}•³¾#–rÊ$‚Å;×!w™Ò71ýYi ØX€’„„¿Ü©Ë~A·£:;[>W`›‚¤ì NbØò¨ÞÚÆ+:øV&ê>«áǹÐÊåeÖâ²ÁC\£.lGÁ«ößÐM³«¼ƒÍ¼ó ”•‰ªúŠS)ñ—]²ü~m§¬ÇÌ+wëÜáXWö„¼Úäi ßd€¸FÊY!à((8@ƒGÑìIb»ƒ¨g5•…™SyvY+E‡ùhèáÄx(pŽ BHâR†l:Ò Nþ¨î‰cOÃê-¿öë#VWQö;`¶ 3‡Jë!w¢HŠ#ÕÎWà|P?læûôói¹<Öxhà¡o¥ó¤Ï˜Ó&{±¼¿¿ æów ¥Z÷ì®1ÞŽÿæß>Ê"w1mÓSvT€õIÎhµ˜ûÊ £Nꆡ´”€Ó+-%pÝ®d{k¡ê¸ê$TvÆré ÎÔ-’HNÏWþΟ3cè^¯ïn>bݪ5Ê¿×ußùàX¯CÝÓ5™üŽæsìúS`úf 1;¾IÎœŠk%ñ¦¯#šÃ=âÌ&q7s·9Ï ‹Ô¶'‡8&¯Ž_ص™«VÙoçu¥Ë#ßäÎî)³³î+qJŠ÷½m¥áâ¦ÀU:scö×t}²õŽÃ¾WO'(ö4cÁÿmû ŽLBP endstream endobj 503 0 obj << /Type /Page /Contents 504 0 R /Resources 502 0 R /MediaBox [0 0 612 792] /Parent 483 0 R >> endobj 505 0 obj << /D [503 0 R /XYZ 90 720 null] >> endobj 502 0 obj << /Font << /F51 8 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 508 0 obj << /Length 359 /Filter /FlateDecode >> stream xÚ’ÁRÂ0†ï6Eµ´R»ö0ž*ù!TO‹yÖZóiD!cÞK|Û»Š0ïÿBk§¸~—2‚ý€ƒAÈ1eÜ2L²v›,j!žI@ôYÿè™!ˆRÌu¢ ÓÀ|šÌñ&ô08Ô¶¦®o¼Ÿ5Såºi[¨Êš[Þ‹veÓ¹X¤ÙÚ@Ãô'w6xóü!uã u¶jÚTJ‘ÀCó2­rÛ8S™[}¾[¯9ÖkøFe‘e]f™§@t9žÎf“äæ>NvFÛ´\K4Þûd&•ZÉ êÄû·5»9ô\î™ðîPìÿCáþŒyO_z~¾U endstream endobj 507 0 obj << /Type /Page /Contents 508 0 R /Resources 506 0 R /MediaBox [0 0 612 792] /Parent 510 0 R >> endobj 509 0 obj << /D [507 0 R /XYZ 90 720 null] >> endobj 506 0 obj << /Font << /F51 8 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 513 0 obj << /Length 42 /Filter /FlateDecode >> stream xÚ3T0BCKscc=K …ä\.¨h6—!”ebl¤Q¤Bx Ç endstream endobj 512 0 obj << /Type /Page /Contents 513 0 R /Resources 511 0 R /MediaBox [0 0 612 792] /Parent 510 0 R >> endobj 514 0 obj << /D [512 0 R /XYZ 90 720 null] >> endobj 511 0 obj << /ProcSet [ /PDF ] >> endobj 518 0 obj << /Length 2429 /Filter /FlateDecode >> stream xÚµX[oã¶~ß_‘·ÊÀšEê¶}Ê.vÓ¤IxQ,Ú•mÙ&"‹:’¼iö×w.”,9J{NÑ"@LÎ 9Î|Jžùð'ÏRÿ,VJ¤:9[íßøŽúøFºÑæ‰÷‹7çŸBy&}‘ú©<[l†[,Ög?{vYÕæõl®”òô»Ù\ëл*›6+ Sn™þáÚÎæAâÙKø S_{*œýºøÏ›‹^waJ¼°.Îd,jg]”h!•fëôlFÁØž8d{T€ö€¼‰JGn1оð¥ó¶ã]®gsé™U^63éå¼rX)S!ƒ”W~2uÓ‚"ß÷ì¥V¼ÅQìÇyša`Åš–¡v§ÉWäåõ3ÏA­)\kyyo(úHÚåLÛØ¢°¸ô‰=^•U¼±“5%‹f%Ê9ÕaY Ž:šµƶìöÎÚNas(ZôžÜUB†ìí¦¶{<þ€ ÑZy‡&g º?âpFÄ”8oì¦%‹ñ_V;)[ó2Ó6<(̲Π‰ò Œ:J½&ÏO3IEˆ“ø,’R$*¦lA*æT';Odýé–äðÏï³Æ׿¢!±Þ:gµ<µ¨´c‹^æw'õ¶h‹8Vc[~ñC?cõK³lóß9€9o Ãóš«—ò±I^j0¶p°UM9óÕ¬s̱4¥\„üÛQÒ¡gpZÓ¹[Æ~w9ŽÌ]·åžÓëaÒkAú[ÌHä=™vÇò+[QÖf»›AN´L.m ÅÖ-ìLÀÄeSº"ìÓÐù3ŸÝwÅ ãÅB¦1¬¦U»¶­ÞŸ?== ØÀ^ [o§J\P„ZwËVF‘ˆa3™¸3YPT¢û´¥ ÔKž3…“?î“ÿ{t1…ª$d`™UVò Îצik³<´n9! l1:ÇŠAÚžc°6›ç¡öåš0äù4ø½oœ#RPJçuø@xyó™×yÓÐnÀ½Ì˼ΠfÜ’ Œ ãš Ó-Í&"Ô˜fG™äe‡B0ná`;MŸ°Ò9N°èá1ƒRIÆ‚_€X¶ü~*%rÈ5´3TºÃÔÆ ´…*ôÂwà ŸøK~âÀY)&!R©ÔZ»#r[¡ÀwöàŠjŠ¬0AÔú:v¹‚Ì.W^,IHéÏ„€jl8 v¶âÒíèd/JBlÝðɳ—CY€ìÍË5 #t0õ§«Å·Ÿ<¹¸ùÂ[ü4“ðÿâþï‹‹›Å—Éàc¡[Ü(”Ì¿âÙ,ÑŒ ÆÙW…Aw¢XvePsøZCÃB‰?Þ#õàOÿâýÕõÕ⋪ù÷ÓÕâæãÛ üí=O.¦Ì¼£îgP‹«Ÿ¯aH½ÂÝçû»Û‡‚g”‹±K¤p1À /$öÅ€; ê®P®¯˜l¬[±·µ#­ Ø ¢m†ÇU48S6N‚mËâ×yÁªšób[sHt±k÷Å$¬uuøåŸÛbî‘b´µ‡í®ŸcFÐê™ þR%ÄV8Në‘Ù£ÎæÙ63eãÖf,}ywÍó&qÒVxf;'Úð/…wTyÅóµY2a™‘ü#ÕV¹~û:žÁ%ßÙî¡ñ ºXº4%á]i/o¸ß ci­s # ´˜Ì¯²®­C‘ÕXCÐéfL—÷¾"s™5˜üH·ntô%Œ¼V¸@ÇãÞq¤'|Étæ"1S©†%”Sä%òþ±eA•Àâ÷½S®ræ8äOaÛ‚)ÇhǧJn”/ï@Ïõ[^‡ Á½(°û Û©b\s°0èx…C+Àƒì_*òbå(l Š¾¬”â•N?ˆEõ~À>Zþ߃©ó=ä ¼ÚæÏúýäeç¤Êã>ºäI²Aªe×Læ6i¶tL4YÇžÀ2AÝ6YNö$ëz\ǽ …WÓÙ!z©Fu”Òà S'³àG†v©àª–©î·\n$iÆ¢m·xÔ£Á¼¿Ò 'Ñ ýáÎNÚ-;)zäŒt—y¾nœ"ˤ.è/+É.^K2Pã+ê.è¾4Då¶d&«‡Š°ÜE m—!ÄÕÅÙ5gL×?Þ¹g Î:o@lì𸵠ýÁÛ/$<ª`Íúµ+•£D×ôŠý%‹6¸ôþ"± sœQ‚g‹\Ý/…%ßEÀèB*}R(X~K31s‹<£‚FUeÎ4Ò)ÇþNøbÝ·ƒÞ´¾N•ð¡Ðº:…gx¬ÓîM~7SòL¸=±;ã>,+¨{¥lcu ¨…°¿oÜãÐÏLéýÕ±:AqíBwýFÇ‹„\ éQžc#À6M pâ"O[Û±%“ÍË0§ wG].BPÐpL!‡ßŒËƒŸ}3—z@Ç®óM†ï|"Dš—ôŸÜß8F·g³yf°GŽN8–SÞ ¨ ¯„1üìÀ{k4ïe½bz̵Š½= –™Š^ @©ê|eØ­’¡i˜ëqc„ ?ÁÏÏ HRáá /<œ¬ùÓIYØŒ iøV£„uY;Õ‹)ДÈôä9iVU#óîõÍ"£“ÜËšåVlêó;>ÀóמxÏø}ÑLØ Cá«dâEkjÓd¨¢Åk*"_À›ëø²§€¤·Ôè$~ ñ³<‰àYéœ ’T„`èÈÉjX¹’“,[Áv72z)ï·I¥¤Ï{ÎÊ6sð1ÿöû× _þÎÉ9¥¼ "¶ß&=ŽÕÐãïX-ïüÂÜ¡«(>Zäp…³áõÒ½çZè4emŨöÑû[éãKW)÷´©ÜgR}|ùÂøôžê k\‹Sž4@ øÎÉÔî#›Ó½†ÛiÕÚúùG#ò‡ÑH SÇ/@¤xò…aŸ)ç+[nÌöPçSûÎ4í©ÿgç}öø?l©_l)_ßò‚šUå h£w“‰ðý02‡Oóŧêæ±!¥A*§³€§?>+šŠîû帅ö£é*w’¶Ú»OxÌîêòP ÚKÊ ÄÓ¾¿Ál¢o³#}Û.#ëœ? ÛƼšPKišþäpjÀÒ‚;Ð4&Ðká•*Vß:X[Óþãþõ+wÚNÃ?œŸâ<;´v›—¢ÙýÆÿûE…¨ÿ™¤Q endstream endobj 517 0 obj << /Type /Page /Contents 518 0 R /Resources 516 0 R /MediaBox [0 0 612 792] /Parent 510 0 R /Annots [ 515 0 R ] >> endobj 515 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [362.787 609.109 442.947 620.018] /A << /S /GoTo /D (Bas04) >> >> endobj 108 0 obj << /D [517 0 R /XYZ 90 720 null] >> endobj 315 0 obj << /D [517 0 R /XYZ 90 720 null] >> endobj 319 0 obj << /D [517 0 R /XYZ 90 656.708 null] >> endobj 323 0 obj << /D [517 0 R /XYZ 90 422.777 null] >> endobj 327 0 obj << /D [517 0 R /XYZ 90 326.091 null] >> endobj 516 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F52 13 0 R /F60 14 0 R >> /ProcSet [ /PDF /Text ] >> endobj 523 0 obj << /Length 2473 /Filter /FlateDecode >> stream xÚÕXÝÛÈ Ï_á‡'Ѭ4£ÏyHÒ^šbï\݇ö.ÈÉÒØÖE–\IŽwó×—rdI«½‡háÏ5$‡ääø+~þ*õV±R" ’U~|âñêÇ'>\ pG/7On¾ý•ï‰ÔKýÕf7>bS¬~vT´vý(SçÕm³veâ4¯×®RÊqñ/p2šU¼y¢é^׺Íú¦¥éŽÓåY]—õž–OôMuÐE›­ßoþöä/›AÚPÊ/¨ƒô‰¼‰> l†«( „¯ÒéÏ‘Ù\w_Š( áhCõ¢.Hʬ#Ù[T1všþ,ÇG0²ß³š>.ë®Ïªj‰û"L£•ë'ðϲmøaè9ïÖt5·å‚Ô)ô.;W=íò±Y_65m—Ý’T~”ˆ$‰¬\7箽©š<[(Œ…Œ¥¥k7HTvij([ƒIï‰á1C ïi¯nX°­¹#=HYšÈï×xwç¯\øÂ÷Àz¾~H «rÛfætt¬? AàlÖ‰r²˜.XûÎÍúßò©m¶•>>¥/ιÓì€Ý¡9WlÏN÷KW%á¦@žP$±"ôÝ©iA¯P†ÎíŸ?ܾyùÓ‹ŸþùáÝ‹Í_Ÿÿi¶ðìzµ7 È¢½G$q(w$Ò½1öÙÉAƒÇût¬“{ñ”¶·Yw Å¦ý:E@c]ZT„¿6R¥#mpÆÚàÐh#ÃÄjƒÃ>}å¼( ¢3ÄAUÖ<ꛥ³ÞE›Ó¤±‹x¤]üÅ =»q9d½þ„h^É!z`ú }S×¥6³Þ~镆ï}ã²ûªOºyÀ9!Ò×äð8ëM°à(ÇÕCVïy‡ N·Ç¬f.Fé`¦u[¢êšêL!3:+xeÝG¼3±ÄØ`ø2…EóYY[¡XØ«‹¬-–ôÁx#§ÚÚ°64`õ(Ö4^ ‡`sêKHƒB8ÝͨᆑznµÍmy5¡ýë¢ÿfáÐâÐ œ±+í x\aWÞ=G']Äq/µß'rT©â©ËŽ“ZwfÌ vêpᢩ4àù QAXTL7K“Tkö1!’ø$DØób1S ~={\Øë¡£iÑ07¸V£ŒÙ&˜šð·f >ÆÑàÀ­2é#NŒ3©86ùþv­Ö´q…]X¾´eêÒ¤¬‰âb’8 ȸ0g.Oç! ©±?ì<¸#YÌé –ë‚+¢¤/éê0fà|ôB„äcö@«0r~ƒ„ÄÔUùÑZèÈZ˜­Ì]+ ²öm™kšB½’õý0•³J„ÿå^—AcÃbväCÎ5›%ÚMtᨚ8n„ltÐ_…©xwæŸð HÀÿ€[Æì9tQ;!M׷缇èàbSÏsÞð! ¢AÞíheìJ8mZf8L¬SÍÍpdé[€ ÆE“tFf1§šÅÚfd{QGëXR«zÀƃ`ÅX¦R GÄBTH4­t^ÿð]2ÖÕACÂórÎ*‹ÍóøGEbÙrÏÖüs(O$T´Ù„'=SCG—!G j•ÕV¿ ÷´]eížOÉ©FD„Œr“OÀv˜é›Õ€žÊbQ1³Zë‚FV+–ã¢ýöõÿ ÁçÊ]LLåɨ¥Û»Ö ›—e•T^¯Ið:ÍEãŽq \…j©íÍíšuN™öVòE@CúDâ]gátŠ)cÄ7Ž‰„Pø%²ˆCÕ=mæã Ê‹·\5Y¡sÕ®mŽË‰Cx×úõÐ÷§g77—ËEt—æNäÍñf>½”0”/b*ßP*çǦ7u,Z.ëí—"(m»ŠV¶YŽb[ð!Ù "ÊÏmËÙ¾º'òVÿû utGxõI€ q¶Ð*ñ8M&Pr­eÍMb°F§²â8£p¡ü;\E÷&—ŸæI<SWèÀ Ò^†m8 ½xÓs-'MF„¡1àÆhÚQ6©GG ˜|¼'þ…s]¦žäó¯;Ù´g_ômÝ ÁÆþ4ÎÞ`ÈÅ]=M.¨EF9VÐä j³ÍŸš× ¤$³Âw®pŠY—‘šŠ³¦ýÙ!ôXÝ”×_Ìqç²bYl/$Ì>0aóh=}õJ]Q ¡…á (/w÷T™J>PùGL},à¼x×EŸu!$¨çØ€ؼýÀÂ=ìn@Ædèn˜{C¢ RL; X7bdW/Ò€Ý5ÉPs†?¾‰• T¢z¿RÉÀ¾ 1ôs*Œ-ñ#hzíù~àò¢¬ðÑÅ凚eAó.…ƒq?Žsº(rÂ`–„?p3jx¤b¯’…ˆy!°qÏh°»>.Ð ùhlž Ì€=1½D$“—Ü›¼¼í¨§†c­Ùp“ŠãŽg~[ À²Z¬¦æé=˜Ö{¸ólúi,TÖ2Hõ»°iiÝñÍ\‚Í€Aó­ ´¬¢•ï±–Ò™i6ÞócÙFã¹üp3"T:–ÿ!ŒZª/H>?l £Ôö [$éõ,µ§‚‘o»E½Ï«[K4žOV‡ÎçeÖ•9 ߀}Aõ±·.õ@©ð%ãùÛ:G÷”­²k.¯Íµ¤6´§1þò*š_ìÀÙCeq7(ˆ`°üŽ£$Ôr}Æõ«ûùîÓŽ+تiö®xÉÄþó"äE>Œã1æy¦Z¥fP³@ÅJï+/¹âƒJ.¡S5*¡a2‰³tTI§³J:µ•4v0PIËètRF§\F_¿Fl¾c’k=½Ÿ__]ËÿZu­¾}u-ÿ‡«kΆ/ª^·5„"´p‰ržÎ8!uדT¿.WÍéxEð%DåNª|=Ýš°.k]p›†î”ß¾ä3[MO‹MW>ên(Ò4ý#îÁl†hÍâÁ4ÔÀ·M+òÏ7&|’~[Ê‹w³ÿƽŸ¸ÙëþCwÞ›â\éNt›þ™¹gS endstream endobj 522 0 obj << /Type /Page /Contents 523 0 R /Resources 521 0 R /MediaBox [0 0 612 792] /Parent 510 0 R /Annots [ 519 0 R 520 0 R ] >> endobj 519 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [269.909 331.571 420.515 342.48] /A << /S /GoTo /D (PolyLib) >> >> endobj 520 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [197.349 263.096 387.894 274.005] /A << /S /GoTo /D (Optional Features) >> >> endobj 109 0 obj << /D [522 0 R /XYZ 90 720 null] >> endobj 331 0 obj << /D [522 0 R /XYZ 90 483.569 null] >> endobj 335 0 obj << /D [522 0 R /XYZ 90 251.675 null] >> endobj 521 0 obj << /Font << /F51 8 0 R /F60 14 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 527 0 obj << /Length 2876 /Filter /FlateDecode >> stream xÚ­ZKoÜF¾ûWèf Òý&i ‡Ø»Ézá ¬ì’8ŽÄ5‡ËÚ_¿U]ͧz<’60àiö³ººê«¯ºÅ¯üãW)»Š¥ŒR•\å‡WÌÕ~yÅ])„á¬Ç»›Wo~ÒüŠ³(e)¿ºÙϧ¸Ù]ý¼¿ËŽ}ÑnB)e ÞnB¥tð¡îú¬ªÊú–êßl6¡H‚ægøÑ)SŒ7ÞüóÕßoƵµ„ä3l!]úÊ$*âR‘„0nƒˆy_."£5Lm{Eo²SßÜuÔÝQïåÌ¡ër%‰xÞÔySïËÛS[üÅ3²//š’ŸŸòÇzGg–uø«‚.šþ­O£@á qìà’ À·\óH§æ*<’ÚÐÈ¿Gk E½³F#45ýÞß•ù$¸£Ïm_IðeCݱRøÕœÜüÈjÓSMßÐï©+¨Fqò¢-\§»âÁµU™mžõÅĕâq¥C†K¹Qõ†0þÛá¾Aù¨¿2â »Q”tÌ:§ß®98¥5ǾlêŽ>¨£B©¨lNPY+²]Þ–ÇþÚÍRk‡’BDZ™+N‘pëT‘H z€êç®5ô g=οžÒnés‘£Ü"Eýþë±…@CVQÍOPR‘õ°îO'ö1»u»ñè ×Ëï×ë‚äëÉÈ1éœK"®b8¨82BSÛ ê]¤ipl›Û6;€”ŒÛ²Îڲ訉¬ Ívjü4AxRvÃAyVSí–lœ>ÚâРõ|Eƒ*ÜDû¶9P‰ÎFwÍ©Íݘœìqç>we +6탎Œñ±í9Ó³ÍGô/#¬&ü±#çUÒ{ÜXëˆO"Ä}ÜlÐo7hNAVu¶ÄW;¥:Út³š<§³~êæCA£#aä°ú ^ Ê`´ëJNC“ç-X£]wG0Í¡G?·=Ià',$3KŸÎ›Ã±¬œÂœ¿¢i;œÃpV®‚}ã"eF?»ö/‚´ÂÊ/å€ÁÍ~ðýÃñQäè0AyT$pU®Ÿè®ìú³§'ÖKØÂ?¤Ò‘1béïšYªØí ó(ß]³·b[ØR˜IáPƃ/·mf-FÜe¨†¯ò¬q.SÔnÊSž]·?U•┿£¯¦^É´oªÊß½³{?,w]_º·¾`J”‚6¯žJ?½íÀüTïˆ"©àcY£8§o×Ôt_Z=:ËñÙºœ‡ØÛ<÷-,xo2ùƒÕI{íç&‰—ŽÈÿ{Gÿ.í‰6xt÷®=éýÃ-(MvµUuv«)x×_ºW!E”˜ø%Dèó1ksç¬ä*ø ¶o³±MŸûÌFí'gj"Áå‹öQ×&T‘Tà’´Ç$2ƒ8‹¸pçiã°6"øñÍ‹ dÇPkÅÀd\(ö-YOa²dŠ…>ˆ}ÅÉSAXÉñ`»»¢BIt<á1¢d>xì;j±joOEçªò¦mmˆÅ¯X«Sá Z¡4ÀM ÛmN®‘ü;ÜM4³°nØ$ìq.–@ó·e¶µ\%ÎT"ˆGB`£¯‘·)¢˜®ÓîÔZ.‹µt‚ÖR T&©>ôãTnd×à´XœïM9þŠ‡ˆEݽ‡Â–»øpÁÉs(ë3#¹ŒÁ¿6–—¤ºÔ €-•&~šj‡çP üÈ÷rgAj±eb(Pp„þùµ›xIh¡‚lÁÉqcÙø°ñ4’w ܧäý¯]›ÅxЯ£Oë`«*ˆ€T"džÂÁžúØZAÝøc[RlVw‡«|ŸR1Ô#õ¥!ÂüàèE"†þ=ŽœoÊ1Vðo–,èÝ"úÚâVÅRÇÀ'¾g]Šuú9hù4¢L ÔtŸ*ÌJ40R{ XíòÁŒÛq⮶Cw. p5’·7§®}S5yæM,u‰xìëÍV¡§úYé*d«ñˆÖ÷%âÖlCô1ž‹(Neº4щj$‚¯M)|”µOÜDEzb¹ÓîßlK/{KØœ“_û¦Œ#ÍbÏŒU¹õÎv6š!z‹/ p­Ú3gYçÕiWø Ó±9ôˆt3 Æ”Îͼ †l”Õ.3r`ž—û‡!!£ß¥¹QW Â¿ÑHà®Ãlkxu/ !bÆ<Íô ‹´Õ:! n˯ˆü¡€”Hý´ªféÙdo)äAj‰Ógr¼‰]…!èd_~ûáÓ7ÿðZ>œ½–‹\ÀsÏÄ#fx6¿²ˆ!!R ¥\jˆ-eWQa Í™½šn}Ow„6 cï†ñ„}mG˜˜Ná¸qbJ4©ê‚O¹ãHoU켡TA†4Þ#’…á"–Ž‰OâåqM¸ n ˜ë(R%gyr*"¡g‰+„¸)Ÿiò‰"[؆´á³É8RŠ^"u±4s£´ó:Â%òT(,=•v–õþûM°ºÉ•êÆkHªÑ`ã׃;Ä[gçi+&¾"©Á¼¿DX²Æ(añÊÃ9XÀ(ñHŸL¥I3ž %êvkkP@zŠ¿Ù­Ë8 ­¬¼f†˜4Ñèqêî®9Un#ã~ EpÕ*øPSy*¤ÛN¦<ë §C!L$ÙêæÈ­‘ÃÑBZ1,‰µî¦k—ç 5ãPÚ“­›nUÉíÄg8ع¥æl=´‹8‹_\ÆK 5ðÊÃMN kôê&'£ b‚ »ˆß3sÁjks?­èòjÖi;ÐoµUìD·ñü60q± HgŽy^ ©áNÌ­H²}Ý’>¼BïeÜ£­€¨}ÉO¾ŒìÒ\æÂ{JÅ·"¿h¸N€¹ñ%Fuã ˜g9Íæpû}‚cž°ÂÅ$Äï41/b2U3Þ«8²|²ïÕÃG W¶b»ŽcXIq K6ŽÙ¤§¦Š™Ýáç9˜d–`? ¦V‚º=”{jÉj¢3rZžÏxã‘I—iÈÒ€?rw™¸À…)Õ’éäÖþí–¡‹3|,öçî!tÄ’xe}GØ °ÚËÆ'"=åß±o3‹¸†`¾´Š7‹ÅŸdþ&¥›¿RçÍ?eêEæª8†:Ë0 —J…ñkÔû¨'%H½LÔ"üY¶Áø“¯ô”2< IÛ€ªu’ßa‚¼È6Ô$ãÒ£ Åu\>;ó<*•¹×SÎ.àBí˜`òtuy=…|®Ç¡É†|¨¢…1äC9Ç÷]#èírì3\÷`‘U@™B<¶ONŠÊÅšqzâíJKŸ'ÁÎ]“¸G{¯sé¸,|ë2P0K.d0†Û$û¥Ø¯æØ?{zXc¿R_®‡Ûßåã‰Â„„Á.{WUÓ¯QÛ²wÍ‹Çvróu'»Øݲ›ex1ZÏñe}ièœK¬m‘“TаoNvPµ¥›3/w1ÉËpJ‹4ø°_Hbã¼£–Å·²ë Èàk©ì»'ù.ofL§‰µ}™)C §mÈ­¯c¶ˆs‹!Îót@!(AÂ?<_a‡Æÿ¤#".Ó'?_Šd {(ÉÙ$â™k ˆ[øAŠ§\ÙWÙqq÷«|š\”§QlÒ…‹6N5 {|à86›' Ïwî!kR, 벃ëyvæþÞH+¨œ:žWˆÀ?8I¤O#·ïõk’KÜeîñ:¯›åNH#‰œ½Ìÿžcȃ¦§bì‹`Õ—Çjx> endobj 524 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [322.546 596.254 513.091 607.163] /A << /S /GoTo /D (Optional Features) >> >> endobj 110 0 obj << /D [526 0 R /XYZ 90 720 null] >> endobj 339 0 obj << /D [526 0 R /XYZ 90 456.283 null] >> endobj 525 0 obj << /Font << /F51 8 0 R /F60 14 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 530 0 obj << /Length 1189 /Filter /FlateDecode >> stream xÚ•WKÛ6¾ï¯ð‘"F|K‡š¢M[¤h€8§¦Ù¦×ÂÊ’!Ê›øßw†CÙ–£E¶X`w8Îó›®Xäð#e¾pJñR‹Íá!Oܧ‘¨ ²‰w«‡·¿±9/óR,V»[«í⦊e&léJöˇn™É‚uï—™RŠeøG³ŠNMúx¤ã£o}_ ]OÇš…MÕ¶uûHì#ÝiÎ{¿í«å¿«?~]]¼5Rþ ”ø.›Oâ)à£YØBs¡4Åô%ÝÇ.$·Æ€ê(õî Nj˶~WšáMº!ooZíxcÓµ»úñÔû9åÆpî&ѯuÓú1qOt¤L1ì=Ž½ÿëc’¬×}Õ'¯¾ä&oýƇpa ]XŸêf;QbÙa 6 ŠúØDhµ)€P\òêØûMê®]f:×ìy)ó=2Àœ f>†¡j·U¿Å“¡(ÛT¾Ì¬)Ø;úØ.?Ý-4{Ÿ¤$Qæ|OŠ!Ä piw¦OIZÇœ`yr_$ÿ«aÈ*Øãż¨’=Öψ¸™ò9¸[ª×–Oª 6(¯ ñŽÏBCòâ ,ûZûìñpÌ É»úÛO^ý>Â’Û¢/B’ß$f (Ë5Àþ{T_@×¹˜&Èó›9P n¯Žs™6U&rÍe‰Ê-4@ù¿Û*/¯m•)‘*‹ì¿H¾ý´‰³X.¸‡â¾ áátLc¤S°:З¶ˆðmµnüP©•cŸÍD«s™52yŸZ°:]6JOp‘)kY·›3åÉ‹âµØ3ZM±z¡e°©z:ŶA" 3e‘ZGY·ªaÎ !×îR­ Qq™]¬š3qöƒEÔsÝB“lÕ- ‡2NŸ±d³¦U~ÛSá˜3¯4WVr±ôâ:ôÝ0rN:Áª9›².ݨj}j·èæŒM í[èiȨdz4v^»*¡P7ÚqÏÅ#¸–ånRöÝ 7Òk}t€BGð ©-±"hªaðɧM|tS^¿Ó\½W_5¡Kk@稛¢w:yU©è€—K©§3ŸX§ð¤Ju]×–Ê¢ÂmÝ¿< 2£®)³RÇD EŒ™<ƒ6‹œØp¾¢0*KÅ3wmJPVã¦Tf¼6¥Ì¸¡77,j6EurÌÓ!\ºF¡ŽðW6å$^{aÞH .Ù™yóª]aìÍ®˜SÙ0K=é“#¯Y ÐfàÁlo^qóóÍäÜZ÷ºù& mÌÝÆq  ú^[c…„y©€p¼(-‰jn–™±’}n'e›±/…2ÎéxsEåv©?ºÔÔW¡Ž£ ˜½?tø” §Ð*îîEìXèv Å_UŸ¤°*‘À÷¼„h•Áy×w¢öqe¡š‘¾>aÀ$š?h¤Vaî Ô'—ªM½£¿ôTÄÍP¡ç´?áE>z1ö8Ó¸`9wǬñÏèoHÖoàyžÅ³)¹¼î¶Cõ”ŸÆ2ÍUÈ> endobj 111 0 obj << /D [529 0 R /XYZ 90 720 null] >> endobj 343 0 obj << /D [529 0 R /XYZ 90 548.41 null] >> endobj 528 0 obj << /Font << /F51 8 0 R /F60 14 0 R /F52 13 0 R /F72 7 0 R >> /ProcSet [ /PDF /Text ] >> endobj 534 0 obj << /Length 1272 /Filter /FlateDecode >> stream xÚWMoÜ8 ½çWÌÑbõaËî­Ûlv[d= Š]´=8¶&cĶ Û“4—ýí%Eyâ™L` ‘Hšz¤ÈG…¯bøá«<^i)Y®²UÙ^Ä^zÁý*ƒhañÛæb}ðYç|µÙ.]lªÕ·àÓ®è'3„‘”2H>„‘RIpeÃHè  #ìC´W](²`*¦Úv NµÖÌÛ/¿o!ÞÁˆ/@j±âš ž(2ÍãRÈ$Œ’T8XRå¾5] œF i‹sÿýf(øâÓ Efÿ }UÓPßî)&%yÐ6ƒ‡º‚¸]Ø#)Fó€ñ;ÑP4$¬Ð]æ-²ƒ¾G»J3²‚̓ëz§KÐ$i0ÍpÈ„Ö%!« ƃpÉ8D娧Ñ4[¼$Ô#þA1ÒþSôNoDZ¾m ÖÁÃØQˆr>=ÃÓÝ'¥mgoþ´ýèUíá.@ûóéÎtX÷8x÷fñ¹@æ¡‹ïq¶5Ó®îîH4Ömݹ™, wÅD«/ú&IP<×(j|ŒG»µƒÿâcÈ9¾Âo|„9#…+ ˜·m÷'ÚÔÝ8Mó"Ø£ (&‡1¾Ųg<`ï wÓÔX¯8/ïY׬ÿ« d¨ÁueþO«YÄ)¸™½`عKÐqPì'ÛBbKüD*ðd†b2ÞÀÛ›k{×Á½×®¹±ŽQ3×ÝY$„f2ÇWwZã2NƒÛ9c°žÜºÇ»<“ 1Äi:Ñ÷†8§²å¹˜•s9›Ãužó)ÁæÝ9Î+[cRJÛm×W ßÖ9w O–é|váê,ö *ãÄóEæøÂ)l5žÊ•‚Åú8UU=˜r²Ãµv±u «×°Çäw®àq €ú=æên?ÌÜPu?‘բ–\+ãxš­’> endobj 531 0 obj << /Type /Annot /Subtype /Link /Border [0 0 0] /Rect [328.168 587.559 478.002 598.468] /A << /S /GoTo /D (Installing) >> >> endobj 112 0 obj << /D [533 0 R /XYZ 90 720 null] >> endobj 347 0 obj << /D [533 0 R /XYZ 90 720 null] >> endobj 532 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F52 13 0 R >> /ProcSet [ /PDF /Text ] >> endobj 538 0 obj << /Length 42 /Filter /FlateDecode >> stream xÚ3T0BCKscc=K …ä\.¨h6—!”ebl¤Q¤Bx Ç endstream endobj 537 0 obj << /Type /Page /Contents 538 0 R /Resources 536 0 R /MediaBox [0 0 612 792] /Parent 535 0 R >> endobj 539 0 obj << /D [537 0 R /XYZ 90 720 null] >> endobj 536 0 obj << /ProcSet [ /PDF ] >> endobj 542 0 obj << /Length 1521 /Filter /FlateDecode >> stream xÚµWKs7 ¾ûWèjÆ»&¹oßÙNÕ&×R'ÓIr V´Åxê>â:=ô¯ ¸²díL›N:™ñ’ øðˆ˜pø'&Ÿ$Aàga:ÉËî¤'­¼V-Ô'xp²™ßˆ°«ûâw»™¦óIã×Zõ]ct²ˆ'l^n›z*SöÅT÷d`=LuŠ6Eac¹*L‡jOdjµ[G,ÇõÿôÕXq–g³WB’ö¼šÊ„4> Ü÷Dà xš}F¥:SWªÝ,b³ºrÁÂ}Ìêj—[SXtA Zm×ô9Þ„—†B°·?Ϥ*c)p«îx¼H‰¹ƒ÷Ó4dªizöx:æ—Ú6¦ d’œþvžCÄ1 Ÿ};z«OèOdÑ E8 »8ÍؘŠs£+ŒnG9!²Ötñ^Wº±¤ã»º¡À¹.á §íV5ª(Z YX}ÅhÀ’nÃ¥jM‹z;ŠUgJóÕþx˜?‹›ËÙ+À­,eó«+0vå6äµnž³„-žÊ­}AÝš¾$Uûópvƒ7¬£º rŽ. nV}§×Ž9êCvô$ß)6à„L^Àøíç~U|V•r{—Ü]½²‹¡vü;¸¿«!‚J; öÀNoxßì —Œûv§`ƒUO½nlpáðÝ`Ãíç-é^©ÖàëP¶Ü(gê7,u?ôrcªë&¢\¹@¢Ì–¯D@a¨¯Üêgö–Èð=Ä%MŽÆ7¦Óy×7Nß"O†€ùÞè…‹B¶´µJQe~ïu{œ Àæ¤?öªò Ýz7¦4[[©¡ƒ”hå(#Âÿ!#„ÀŒà)e|÷è's+\_tnÀr˜9Áv@±U´kVjžhC•/m5GÑÕ!UÝk’géE23ÌEœÒ­.Z›*á råêç­v”o:ìD\5¦õýšD¿VæËÔƼz sú¶w5 ²É £Hݹß)×83‰­6æDlª±@ÇÂ]S¥ãE]jZi[¿1¯žk8ÊÛºè1’-m»Ú}7îžÂ{•Û´Ä½î êÑ ƒ¦½ÚóCÇXâý¹ Éü|ŒÙ6f}Ñ™µ)uՌ勻Fƒ½Ž]Ùa`§Ì©ûd»}}G—_Ð%M}ߨ²tU’LŠ<â1üçAšýJ~:’j—:ã È2ù½‘}Ó[•°w>}A¦W…MhÁ.ž»h C×Euáš ]°!€¯›•ê-m·ôþ–v–¸Xï52k³Ôe œ=ŽƒjˆHC]D’EqÄ~P+ãØàA´ÛèÖ Ç6#Uÿ58$SGJà%` 2øÛ£3 ¼YAÎáûH§Gh×´žWà³=CøÒ=‚bÒaŒŽ@Þ½ßÝQ½mUzTLatÞèa¾Nl6]·=?;{||ô xÒö•W¿¯Œ·F‚,úk}–gùHbàA^ŸçýXþ§$ù¥7œc’ˆ”]ûôYÓ(„ã#—Á4L$³¥I ¶p:·Pua>þ\oÕzC "1hQµK§þÞëÒ–†ÙÁ €*6Óà«_Ì…(«tK)ë]&¶#iu×Ô0vÉ0c®(»ªo'Ðx¬Ëˆð÷è Ú8何ð^Ba’)ò>²¼ã ;wr<€dä ÿîÓ7D; T ùeÝàHÀHô“O"ÃÃ8Ã6ŒGÅÐ\ñœè R„¬¦º »Ãˆ¤[»þMH¶ÎêÒ6ªíC«å½V9‹$‹æ·óÅÅ)5½[]U»‰ç¨UBá¤qÿÏû7ò9ùW endstream endobj 541 0 obj << /Type /Page /Contents 542 0 R /Resources 540 0 R /MediaBox [0 0 612 792] /Parent 535 0 R >> endobj 113 0 obj << /D [541 0 R /XYZ 90 720 null] >> endobj 351 0 obj << /D [541 0 R /XYZ 90 720 null] >> endobj 365 0 obj << /D [541 0 R /XYZ 111.6 656.04 null] >> endobj 543 0 obj << /D [541 0 R /XYZ 111.6 613.599 null] >> endobj 364 0 obj << /D [541 0 R /XYZ 111.6 571.158 null] >> endobj 441 0 obj << /D [541 0 R /XYZ 111.6 528.717 null] >> endobj 379 0 obj << /D [541 0 R /XYZ 111.6 499.427 null] >> endobj 366 0 obj << /D [541 0 R /XYZ 111.6 456.986 null] >> endobj 363 0 obj << /D [541 0 R /XYZ 111.6 414.546 null] >> endobj 400 0 obj << /D [541 0 R /XYZ 111.6 372.105 null] >> endobj 540 0 obj << /Font << /F51 8 0 R /F72 7 0 R /F60 14 0 R /F54 361 0 R >> /ProcSet [ /PDF /Text ] >> endobj 546 0 obj << /Length 42 /Filter /FlateDecode >> stream xÚ3T0BCKscc=K …ä\.¨h6—!”ebl¤Q¤Bx Ç endstream endobj 545 0 obj << /Type /Page /Contents 546 0 R /Resources 544 0 R /MediaBox [0 0 612 792] /Parent 535 0 R >> endobj 547 0 obj << /D [545 0 R /XYZ 90 720 null] >> endobj 544 0 obj << /ProcSet [ /PDF ] >> endobj 548 0 obj [514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6] endobj 549 0 obj [750 750 750 750 1044.4 1044.4 791.7 791.7 583.3 583.3 638.9 638.9 638.9 638.9 805.6 805.6 805.6 805.6 1277.8 1277.8 811.1 811.1 875 875 666.7 666.7 666.7 666.7 666.7 666.7 888.9 888.9 888.9 888.9 888.9 888.9 888.9] endobj 550 0 obj [569.5 569.5 569.5 569.5] endobj 551 0 obj [701.5 674.8 778.2 674.6 1074.4 936.9 671.5 778.4 462.3 462.3 462.3 1138.9 1138.9 478.2 619.7 502.4 510.5 594.7 542 557.1 557.3 668.8 404.2 472.7 607.3 361.3 1013.7 706.2 563.9 588.9 523.6 530.4 539.2 431.6] endobj 552 0 obj [333.3 277.8 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 305.6 777.8 472.2 472.2 777.8 755.6 711.1 722.2 766.7 655.6 627.8 786.1 783.3 397.2 516.7 783.3 600 950 783.3 750 683.3 750 759.7 555.6 694.4 769.4 755.6 1033.3 755.6 755.6 611.1 280 544.4 280 500 277.8 277.8 486.1 555.6 444.4 555.6 466.7 305.6 500 555.6 277.8 305.6 527.8 277.8 833.3 555.6 500 555.6 527.8 427.8 394.4 390.3 555.6 527.8 722.2 527.8] endobj 553 0 obj [357.8 306.7 511.1 511.1 511.1 511.1 511.1 511.1 511.1 511.1 511.1 511.1 511.1 306.7 306.7 306.7 766.7 511.1 511.1 766.7 743.3 703.9 715.6 755 678.3 652.8 773.6 743.3 385.6 525 768.9 627.2 896.7 743.3 766.7 678.3 766.7 729.4 562.2 715.6 743.3 743.3 998.9 743.3 743.3 613.3 306.7 514.4 306.7 511.1 306.7 306.7 511.1 460 460 511.1 460 306.7 460 511.1 306.7 306.7 460 255.6 817.8 562.2 511.1 511.1 460 421.7 408.9 332.2 536.7 460 664.4 463.9 485.6] endobj 554 0 obj [469.4 353.9 576.2 583.3 602.5 494 437.5 570 517 571.4 437.2 540.3 595.8 625.7 651.4 622.5 466.3 591.4 828.1 517 362.8 654.2 1000 1000 1000 1000 277.8 277.8 500 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 777.8 500 777.8 500 530.9 750 758.5 714.7 827.9 738.2 643.1 786.2 831.3 439.6 554.5 849.3 680.6 970.1 803.5 762.8 642 790.6 759.3 613.2 584.4 682.8 583.3 944.4 828.5 580.6 682.6 388.9 388.9 388.9 1000 1000 416.7 528.6 429.2 432.8 520.5 465.6 489.6 477 576.2 344.5 411.8 520.6 298.4 878 600.2 484.7 503.1 446.4 451.2 468.7 361.1 572.5 484.7 715.9 571.5 490.3 465] endobj 555 0 obj [272] endobj 556 0 obj [777.8 277.8 777.8 500 777.8 500 777.8 777.8 777.8 777.8 777.8 777.8 777.8 1000 500 500 777.8 777.8 777.8 777.8 777.8 777.8] endobj 557 0 obj [525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525] endobj 558 0 obj [583.3 555.6 555.6 833.3 833.3 277.8 305.6 500 500 500 500 500 750 444.4 500 722.2 777.8 500 902.8 1013.9 777.8 277.8 277.8 500 833.3 500 833.3 777.8 277.8 388.9 388.9 500 777.8 277.8 333.3 277.8 500 500 500 500 500 500 500 500 500 500 500 277.8 277.8 277.8 777.8 472.2 472.2 777.8 750 708.3 722.2 763.9 680.6 652.8 784.7 750 361.1 513.9 777.8 625 916.7 750 777.8 680.6 777.8 736.1 555.6 722.2 750 750 1027.8 750 750 611.1 277.8 500 277.8 500 277.8 277.8 500 555.6 444.4 555.6 444.4 305.6 500 555.6 277.8 305.6 527.8 277.8 833.3 555.6 500 555.6 527.8 391.7 394.4 388.9 555.6 527.8 722.2 527.8 527.8 444.4 500 1000 500 500 500] endobj 559 0 obj [625 625 937.5 937.5 312.5 343.7 562.5 562.5 562.5 562.5 562.5 849.5 500 574.1 812.5 875 562.5 1018.5 1143.5 875 312.5 342.6 581 937.5 562.5 937.5 875 312.5 437.5 437.5 562.5 875 312.5 375 312.5 562.5 562.5 562.5 562.5 562.5 562.5 562.5 562.5 562.5 562.5 562.5 312.5 312.5 342.6 875 531.3 531.3 875 849.5 799.8 812.5 862.3 738.4 707.2 884.3 879.6 419 581 880.8 675.9 1067.1 879.6 844.9 768.5 844.9 839.1 625 782.4 864.6 849.5 1162 849.5 849.5 687.5 312.5 581 312.5 562.5 312.5 312.5 546.9 625 500 625 513.3 343.7 562.5 625 312.5 343.7 593.7 312.5 937.5 625 562.5 625 593.7 459.5 443.8 437.5 625 593.7 812.5 593.7 593.7 500] endobj 560 0 obj << /Length1 1767 /Length2 10356 /Length3 0 /Length 11470 /Filter /FlateDecode >> stream xÚ¶PÚ-Šw„Á‚3¸»CpwÜ-¸C‚{p·@p·'h Hp îGî9¹÷ÿª÷jªföê^m»»w -¥ª‹¸…ƒ9XÆÁÞ•…•M ©$ÁÎ`cãdecã@¥¥Õ„¸BÁ‹QiµÁÎ.{ß’Î`3×g™”™ë3OÉÁ à°sØyØyØØllüÿ!:8 ¤ÌÜ!%V€‚ƒ=Ø•VÒÁÑËbeíúæ?G=ˆÀÎÏÏËü§9@Üì ™Ù”Ì\­ÁvÏAfP€†võú/ôBÖ®®Ž@ ‡‡«™ «ƒ³•3Àâj P»€ÝÁ€? (›ÙÿªŒ• i qùK®á`éêaæ <  ØÞåÙÂÍÞì xÐW¨8‚íÿ"+þE`ü}7vVöÜýmý‡#ˆýŸÆf ƒ£™½ÄÞ ` ‚*2Š¬®ž®Ì3{‹?ˆfP‡g{3w3ÔÌü™ðgæfq5€Ùs—çr†8ºº°º@ ”üÃÍó-KÛ[H:ØÙí]]PÿÈO â =_»ð¯ÎÚÚ;xØûü ,!ö–aáæÔ²‡8¹å¥þ¦<‹Pÿ•Y]Ülll¼<ì°ì ²þá^ÓËü§òOñs~>ŽŽËç"À~Kð󪋙;àêìöóù]ñß•`¹ÌÁV{Ô½?‹Á–áçæ;C<lϳÇ`ûãóÏÉèy¼,ì¡^ÿÒÿì/P_G^^Kšé¯ŠÿÑIH8x|Xx8,Ülv¶çð¼Ï¿ÿvóÏü§ø?¥ªf¿“ûÍ£¼½¥€ÿ¯ž/ï?u¸ÿ=ô¯ à¿#(;<Ï2@ÿïè²q³ž¿ØÿŸàO“ÿ¿¹ÿÃËÿmôÿ7!7(ôO5ýŸúÿÚÌõú›ð<Ên®Ïk¡äð¼öÿKÕÿµÊP‹ÿÕÉ»š=/‡¸½ôŸK„¸È@<ÁªWõ_ôŸ<;‡BìÁª.?ž ;Ûÿèž× dûüœ¸7þq|ØŸ÷Óìùç`€¬ö®Ï&€çâü–Ψô“Ÿ4ûCôâÍÿEü èôGv@‹ß ;þ r€–¿ANÐê7ÈZÿ¹¸Ÿ‘—£õókó/ãYù >çeû|N ú|ÎÌî_ø¼Àß\==Ðáß`ÏÜç'ù7õs¦Ž¿ÁçÔœƒÏy¸üy@×àóô]­Áÿz{î ÐÕÃá7ƒçÄÝ~ƒÏ‰»ÿ 9žéžÿ¦ö¬ô;ÿeý_m¹9;?¿v®ÝsÏÿƒÿ|ZÁ`O0u~Ö$bó)¤ý¦Fü¥ËÖWáiÚ-4Ÿyç·;ÌÉ ³‚Vœ¯Ä“‡z±—6¤é/Å(}ö[ê_„·&ªµÝû>˜Ä«Onµ¡~Ÿ ì/ܯûBŽBÆ¢)¶íûèä«h ßÛ¥@›ëäƇ©šwãñYÖ³îKùâhØì–ÚöGž7håS,±Z1†%3´yæ¾S!¹²#3âžxbÍ\^MãæŒ?Q(Ä3¡úÄrùè¯r¼»ýæý£R“Ã¥›„†DŸ˜þwtòµÄnŠÑœOiqÌŠð\6oäûÁ…Ï ßÞh“P½U%v)cÎ Pì£éÎñe:CµAãÊ€×tuÈ>¡´¥²–‰ÕÔC¥&È þ·Ôä º°L=¯ºŽ´º˜€X·2âç诱“gô5z¤Š–„²³-ï~Þó=ÎÃÒ Ž"Lº äà©HÙ˜Rô7q ¯–Õ<µ˜ò{ÏÜÐÖ>g)ºícWrø†e¡›™Àî@[-$Z8éȶà×BM‰z¢ VŠ^½åš›´kÆá¿ýa\¦Ý|”ÂΣY] ,‚â>è¯Ûi †_ w6»c^@Æ+l[†=5ÔEQV2±Y¸0ÐcT‹'ßÆnºé8¸ÿ8lßa´ñ¥,ÙÝ°ÎÎlØi–Ï]øfYG¼~,U¸öBf3AL9y¿Ìð–3ºqUÈ!µÊöë ÌÝKæÈŸÙc«sOz~”Tk½ËNXtSàˆ2>¸œc7¯~4pUµ5Öl8ééý°‚tið–>óG]UýÙº9œk'úÙ^M›öó@ภôXj¾G8üÃÏDÿSOž}#æk¹’s¥~^&·#Þ q;.üñ$Ï-Œ2…²·ŠÏƒ‹~6v&b°"cÔ‘é OqÒÀBÚ·‰ÙFÛÔð®éûÒsÃOHÙ}ŒïÓó;^Æ𢳹žÐÂS go¤È©cîU«{Uò¹~q¦ÎrãÃÆrIÝ.óßÃaƒóÎèÞé­ÝãEîGD´ÚIw8˜^Wžtw¡Ø•Ýÿ&B›Æ3Mc)·uæÏrì;¦9ÜJÕ“Èþ“6aÜžD@ÙúænvÊ!/búÕ•*y,‘à”"³øg†@ÚwıCë´}ž âP;æåIk“Lß«s þ°×˜áp¤Q=¢t:–u:KÕSðn‘ïãTÂí? odz,˜ãrܬî1ÕkFy|"ö¡M’p,A‡d›Î¦éiHDVÅìƒÈ=¶jR}i»ÐL±kûvˆh!^D£œÃxmIr¿*…¶¤=Ä\]¬w¢$÷_üF²ÝœßɈ¥¥¾Xщ:±u[÷‘å¯FhJ˜`Hˆ$‘ø‘&Ò+Ãîû £É‹¤ûs¤ª£ Ô‹c K Fƒa~¶Ã°i÷ÏÑrÅÒ§†`ŸcûÊ“­!'¡ k<3œØƲ|Á;(žÕÕ:8Ú¤· *ˉæ ìb GŠèjI§Ø%(2›»5µCk´·N  SK+p¹¢(iô'†G˜z§âÅ<’¢È-^xžnšÆ/¾f“§6I f’W‡"6÷S§¼iˆ½–>ìfi´§Û†³‹«¾Zí¿®#yycsˉ“¬·Ú¹‚ Î1åRgÊàMiÔwŠ¼ØBÕÈìJ÷Ô«›^Úòù0@Ìxlùé,Ô³ÔQëgþ¦ÌÅC¾9u‰‘en±©Ðî:…¾²>hÉv})ö Nµô䲞bm÷ø³ùÆ‘Ëô÷Ä­!ªÎõ+ÑÓ:Bl @I‚PwFb> YÌ5ô©™³—X½më6g‚¥Àc3e³¬U²=‚ «?6»3„#!y‘@Ã8·°>J-d„-¦¯Ã‹êçæ¤ ž`Ö­ îZ?£ü>mœÿ½Z}U²G„ùb “ÑÙ—{÷®zÍŠ ?ŘS*'_ŸlNódûò“O©IÀå 2ö ·»'ÏÅŽù‚oXÚç8Í+Ê1ù¥ä"4o Eœ¯ñXpF«h¨YÈÀQõñ仦…|!\Qm¹ù¯›¢n?@bUïŸÓ.Ó£§/€oƒ[;ÐÃ>§é…Ïú«t'ð:˜+ºpHôI4ÙÕãù Ø ê§/ÝÇ‚N Ø6Ë?z4ÐÚí\ås¿õ éI•‰¾weOm'Ò[¯šbšôâ‘T0LÞRQ7öÊ u »Si!5¹%z¬ý´¤X Aj¬ÍÂãßÛ¶ÛŒMŠß2màï¸RœÕ­ûâÕ“oL)Ñr)P“±ö$¶¡xI±BüÓ/Áòå×ÀQÇÚûDz}}f±†æFÜÜìH²TÕrپǞûaŒPþòôˆUÛ{VO–Ž<ÓÉÆÔ_qí—/¼(ª_¢z{ Ó…PŸ}‰?øéÞBZ¹“¶×$U Ñ]û€šÀîì˜mk4Ÿ€Xû„<»®ÁùÁè¶þ+'eíþ<’©A/Ó]Ð[)2M­öG£ÈKí¼ë”V)‘U$êYƒ4âåJ—ì´ –G¿ùðãNµ4$k Ãõ^h.8ijf,óU“F|-ðLy¯IM0Þò‹ÕÁ…‰O•Ë¯²î×Ú°Hâ.lkÈuþ©j€åœCèLG®òr"|nôÐE%Ù=߶ê;÷ýDŸ¿ß¥á',‚–å`Øë³ú²¢Œ,Ù!Æ*NGžrÉë»T·V‹ïŽ ÅòÓ»TBØø´¾SèxuÏV•4°$>èJñÄ^#ŽEóOTN‚ª†Y:®¿³“ªG šsxöYGÆ~†Ó¤K=<Ưeßç9ƒŒ¼f9ÅYØ¡0ßÕ2NRYî?¿Jb3ð=}±–Uñ„Én,Cú®›’)pÇc‚“0‰*×E¿†ÍAÑem§Qn²*<Á!{>n®*ß/›½x[CBmCW\¨¥ÚGPx=ài|Í.imÏJ}Í£åá¸ÿSÚTšÌÄ«SÐ º¶©î/ù,^4äÈ%ƒäÀºr'¦/,Žá×1%í óñ¤à<.Ùºž3ÙxÁM ˜o°ƒ9¡”­ ¼Aßÿ!o$â‘”Iº ›à9U _TïI¼dÂ3&• yÍn?~ܺ)z+Ô^×Ø=¸NOOÎÛù$P&[HpÒÚM",ÿÄL|Oú3\›r6òLVñU {›­ØËFŒêÝ~” ]¾Öþ*eÅJÁ¾o4 Æ£´ú^r±ß;äùØø“ù—øŽï¥<èöe]E7³*Þ¼;2àL ý$MJÈ-Q/· ÿ¤#²ˆ2©Å©ÿö—ªî^†¨àjrí§ͯÂ. …V8z•¨íUûKÚÞÈÀØ­åëŸóµwí²È…¹0:"„H¦jçÅoPÐ؃™ñäW¿Tp²”­ÒÙÛs¡ß‚LM-³e‹¦§Ñ Ka äi¯‰ˆUøÛ _±02ô¯5…HKJü2T±á,#ÚÜQÞ˜~I<¾ýø~óK?¯W77NŒ¼à´JP½NY’f|/üÉ–&ÿ0© hóÝȾ¡‰œ 41¥²žÞ¾<Šz„!ìü¸÷RÓMF?¬œÛàîˆ2ª ÃSi’h4ž\¶}ÌÇœò"×õåÒMÛ~18åŒPÑ03³voè–óué óÎöQM8Ú§â‰ÌsžQÆÏuF®ðÅèìi*853{QÑÉK·6>ݾ×j˜ÅM(ùwW¸c×N=›Ng`ØÉù‡±ÚÇ•IÝj÷”,ßž; ˆh„2‚:+QV6È#ÖQŠ¤à§Q©þ÷4ÛKÑpIL52ÑŽ”õxÖ “k,YUw¦Þ¬åÍi­³È{Y%]c1ë¯he½‘;’‘áu‘r¨¾uY¦äŒÚbG|IÒšï‰_ 3˜uóÀÝ‘Ùù™Š­õ@GF¼È*#C¿a~”Oš¥®Z•¦»ˆJÖïÄw9IC„O~ _èÔÈû$"U„.aÂßµ™´ÙlóIM–¾ó)ÄÛ–4F«4!<,VÑÿl (ÑúÕ=Qb­AL_8¼`wšw·¿Íµû¾Qð~ÐJF`X[Íñg]Œ‰!†ã›¸ï¹—ù¯Æ~¡ ¯Ç…U’>Šäðö¿Ö&¾/eZÊ´ |ßžèAGÖpq…ɘ'Á¤ ^ ÉõMGŒ‹Îî=§ùl5|o¶÷¼Ñ$½ï7j8çsTü9%-7¿Mt)¿¯væQ¶Æa3ꥅðHõ¯×ƒÃc“Oìƒö½DX§r3‹Q&/{W´Lüô:ƒŸO) r^ÁJU+q7uà ”³Ì³Æ4g °_˜‹o€]íÏZF×s«¡Œ¬S÷12†ûèH×5{M=„bx¶7­öèÞÔ6Q™Ô'¯&øH,ÓÚ”¬èñš[WÑ¢ñ†YíÀ¦Õ¼A€å¨®s}y{–Wù&Twš‘zÁ¬¡Âx%®?ú,犄a gô‹S j[’HìÏë6[¼7#Ð6ƒxÎ/½—à†+‘wýö¯–cìžî6á"† º'› ï§g)ЬïÏeM¿ì^ŸdVTw|ÿ“ÂZ¯îöe„‰ûöQêt)ÞHývHØ‚µíÊòp«¿]\È tƒ¼%»7o6Œv *ÿå/BWñOö¯˜–l;3$£Å6J`,yAã˜Éåè²=F á‘}¾ìl›'!wVÊ5cyôÀ÷ÞÍ{KqÚ+ÿý†l+µjÌ©Ó›ÃnL¬Øw‡ýÜE#¢ä£ÉÚlÛsKì¾f-üý‰ADy/rÄâ2`óOIaïhí˜u®ó£Ÿ‚f66¿RaÑ!òKHYçj{_k€Úvå[e§Ãü¹ŠùKpÃéh,N¾ ËóÁ«R–ÃæÈ)U$GÉ6òèL‰wØI4U›>o–]Oò"á&?.[ìÆÆ9ñeÂI¯VºÚmí¡R¦åÄU|'ÕŒ†Ùœ%T)¾‰±/‘>?$°™×/ °¾Ôþ«¼ø³§Ù$ã'àÚ²ù(Ø+V_÷cÛ²¦­nqIyÈ(€žŒ†z¿÷iá¼li±pk²5hÄ1hãÒTE^¶'Hòe;-’ÜÜT“ÓÓî'ç3þL‰-yShŸk>¹ÊÔw¹ìöw½¾-n$ƃŸä¤Y> ôÖ!ÜÄmù|™0kÌ©«3[º(_dRP­œGaÒD§rŽ§NqàÀZõ±‚¸ Cµ‘Xœ°Öuû7ª>DDª&a½¿l˜2„oÈןà”Î%ÁÏÇ,=Û¾#¸ZÃЖ^d=ö3÷iX] Ÿ‚ÉêºúAskH‰gÚ@tœŸ˜â‰Áã#ì ÷-‹í¯ÆDùÐ{~×TÜ“Kö“ã ÑÉ6xt| ýݤ·°G4OÏYLD!ï÷ʼ±89x¥õºˆÑÎðÈbYS9Ú¤œ Ê+Œ9ñ꽈”wç2kBp䤵¼2GJž¯Ùß‹qt'wÈ¿Dd,R¢ãÇ)ª S„i2ëwI«ÃZ¸hyob›òœ6yæëqíNxLSßš•PŒŽ]涮Eî¤qA¸QWéúXCÎë:+O¢J ÇÄúšÈúîX¥Ë‹ïÍ­üjõõCEÑyzsРËE¡x&I…«þôCÜß±_þB5ä‹Q!&R¬ÙYûT²ÿ§´2»ü²O éÔ>u(¦vo5zäÌÂPSÍ9Wé]µ\gÄêší;v“ü‹AÓc[ZŠ²zé>8Ý`BÊËÜÔ‘>F¨ø°B*im* -‹žïBÆæ×i{|ɼ×ã"Iã»=„³ªó¼šqú&cëÎíXãta^‘e­ÑNš”ŒEx~n‡‰X¯,Vn%˜ Kæhôøå>ÊÓ–¡³Ç§™¢ZÄx[16Øp¹X,d>ÇÁƇÞœÎÖ%öéK --ºaÆ} µ9–U¹ ;¹ÿì‹ÃRuVeÏ8@í¨ËGŠ+ _œYƒÙ¥MÓ€† ñõR/ŽùÉ™qÒø“®/ü? # jm+q†Ö#oekMéP4.RC­2ƒˆàƒßÅtÇ ÀÙ¦Ã]X×ñ†AYõÌS>V÷²›I*¸ Yžš†ç€w×õ·G›?[&ŽîcìÅAàzÇx§4z Lâû£‡9# 5<ÕãŽñÑ]d«¢ã½æ—WÉ€³ªÒb݃½ -¯&ò·Ý8QÄ"Ëã0M ‡ƒIsúOØ·QóažBê”g&ý¿V 1+„±ˆ±~ôWþº@ 3é}úñüJèI÷„–H»«~Éüø cÛk*váQUŽ½r<ÛoÔEÎçýUŸv¦‰rKܘæîG£…#Áuzj?˽'Y¢óêf$:{ÞZNXEã7šÐ©˜@°~l&»©¹í‹týBÆÅÁçH¢åÄÊÅd’Ä”ÑrÂQü| É'Û“"³[·q6åJ¿ºns”5‡‰*>•×ù5¾]ó›ÃDšôegOõ€çŸ µ×m×4¼N‹¿¸KJƒnŽð ÅÒ08°˜ô¤Ó€çŠ±çË/ÍvÊ„vZèéù ë’›9Ú3jÇc:C¿¹ÄMT5*ߦDçÌ<ÒãÂm³ç–×匿Ø“óäKNSþó­ÑZ„þÏP1ÛÆ¡GX7èË*®Ÿ¬~½˜µNJ…Î0 ¬pÒ™PŠ9¹SÔ‘ µµ íKŽ,,Î×W#oìwùñ¢“x‡«é7Þ×ûá’ÉÚÔ¾‰êFùpUå4@*× V5Ÿ¦» ¤ü8„„â!ô?r ó Ç©}˜¶íV䔣´ÑE„žÎÙ`ÐMºÍT—N8WÝâ!­£hü¯áìt¶V ïõ)ûf86ó$q^§”}ÿ¢¸t™C_›WÜTÙVzœó² >¦5…’FÄNc$ÊWÁø&5üuÉ›Ññ£Ü»4âq$rió¬íÜ œ¯ÜþÉñDš0…Y²Û÷î½÷>æk1 ’Ùد±,?1„Ì”hŽpëɬ»’tÞÉÈýH/cSI…´wÃ`Òw, JÇNmËã[™Y?Ÿ½?÷‚3;/2 "åï9õãÎB†±Ü¿çH´ÓLÀžoÆgUœä×¥›ÿ4´7ÀžÙMŸ%Y#½9ÐÂk®Û{Ñ ¥“»<œÕ§€¨õúz˜só”ŪĆcÜGóF‰q¦4ç%‘%½.cfòœ˜Ä¦¬à+KjÞ}¹äþÇN›Šò ´Ë¾ðb‡®P•6]‰=¥NÑx ÿr̆,lª±=I=盕ù.uû‡À/KÆýÈ?q¢¼®b&~2š:ÒLÆö¯žÏìÛÃ?”·îÅ9•Wà÷Ò~¾ ’À¦t’‡¡º¾ù@óz÷¾×jP¾.¸%Xž£ÉyÂô”.Bé³|°æ‚™o1·ãèÙ·òô\6 ]ëǦ®/Î _˾-]Z7 .ÇhÑ®|¾f"RHk÷ðö6´=wƒÇ&¸¸Ÿ»í*o°Ò8úȪƖÐà²Ô“gáÆÖB¼ô¦­W6—b0=n½w^ÇIFaõQpù]S‘Vå¿K•:iVÖo†•ôC\ØñÆjD 8u28øÞ,Ö.R¦Ø&Â%ƒû†E<¦Ý´¢Ö8ÚÊIî+’;ÚÿEµ‚ÅY¹xmÏ™×YÊC ²ÀÌú.–d |«*Ég=LýÉdÓ_ž[3Ž0ÅÀõQXë|e”#00F)…û׫njbØ´È‹¬þ¨ƒx-xSâIC‘ÒdªGIx[˜ìQ’UœÓ&‚]]ØV¿ÏZè"j\§dÑÏ>ܼH(¯oðƳBpdE÷r¸Þ&mI=Ð4;ëÑòº\3EwE¯)ä!J߸wqà/B¤v⺠h|”\~íÇ·²Œ¹ ‹ë=Ѷ¹—h3|ˆ/›ù&zñŠŸ_ûv\‹èãš×­®lTkEÛ§RÀ(/¢N¼,yiók5OJ˜1ëí‘Ûw ïR˜ý›çùàŽjcû°*ý3è#Éõ"‘¥ !)Há½va·ëø–XUÎOd„F%ŠSnzÃâ:óSêýü6}a£Á)HÚy(>_5ÑÃàLó®ß.[PAÒ½§Eiù(B2urC •É>h7ÒÅÖDwéaDȇö»wªÇxvÅYb b`Ͷ‹nßù¡nÈhzWõê»}j«7Sh>æ"̾åÍÉܸ½qZ²A¦í¸Ž¤Uº¥Õgq.|åÝxGBQy—‡'L™®nüÐ_ì/ ±²q¥F×ömî\5ÐQùz“i*\‘Ø·ñ*atcÙzîQžšÇ–S‘¦GïE93Ǹ,Ìy¯ÉWè5Vs‰Ë·eyž(¦ýÑ©ŽËÊäì,ZQ½µ` ¡œq`½üqÎ%ÖÓùªRA ÔÅ‘S¯DЙӵ¢z•i›ìhŠøaié¾~@Bü'€/·âe{̤ihì#}o‹_+*VT‘Qlœƒ!OèºL¼6¢­îõ ‘kàزrvöá»ÚlvÊôv¸—×%Ž”ç~×mËê Þª›¯…ë[Þ ´”38m«,®}»#­#r’€#ŒÌV³Î(lôEgQ7.•{ {øŽj3¢}ûªMŒÛÛ©i¹ð*:¸¸!µÖ¸ÊÆ´89¯NÜšœx‚G÷=³Q,3œp :†ZšŒä'ʺ\÷×+Щ÷£;ìu~³ÃV¦ëå’»þß\z[¸ËÞúÄÑáÂûßÇO<°©c7zÍöm‡È"S Þôྂ'(=hÐéæ±Ô*g¸²Q†ábu cs½L`µ ì¬]J?ç®2ûØ(iÔt0»LÑ8÷••d–ŸššÇüÖ©òŠPGˆ¥¿ç¼öÚ¤}å‰bÌŒŠ/¼‚á+4gKÊW»¼þo,ê@Q98´ŒÜ:“K™Å¯ËÝN¼…>ýð‚ÇP·†tÉÜ?¾bÄ^,ÞÂç ¬C‡µÖ”VÔÈîÏïp3zࣸ>ÑT5OEgžišŸœŒªm=U&B{¢$oç¾ßÛ›fq+Uº ™dZðNWÝ€èWäöOŽ DŸ™;JwäcPBÇu®,nB®&i ONø³Tåïècî‰]2®gÓ¸óUeÝÈe Κý:|”{Ì¢¤xMÆ 2†NØšL‹ùÛ†~®_eÑÐ~‹‹U­9}dþÂýí¥šZ¬Ü뻨4bís~¶†ŠW®šqœç¾×ó?Û[D&,#ÛÓð&:ç{vX ³Á¨%t-84ZÓ(îeíc (^r‹ÆäÛ‘o¤‘»ë®·ytË’Ç?Øn¶³Ÿ^‘™Tæ¶|—§ÕÝè?îî¯{Ìöp¬•Ú·þŒÁ÷“N‘€A»¾ž%xÍí='BDèµþ{º`Ü&’÷Ʀ/1‹¸ÄÙZx“³¯óoCzuà ÏŠ ÝÔ/roKÇfùüuªC•£š_Îñøú!“c°^›Û&èK§7} 6g©›ÉšIÎí_ЧÎÓ`›’° ÓšDt6h¢zìhÞO¢hA˜?`œÑÇÖ )-ÎْïÑ*oŠp”:mO1Ç»Ó_ôs ’½Ÿä¡d—-â@‡^Àõ 7À zòØ ó$‚ÆH‚-øfXvn=E…bÞÖ.od„ß‘`~‚ï—± gkež­âeÿ%cóŠUÏß2DêK‰“w…™×¸þ{Éyå‘á/ƒ‡ì†Ô®þ2NuÉ™;zÌhW·‡dÁW(7ÀJqO Ib4{èÊá΋ž±ŸËèwÑ!äãžBB¡ ^`:nÚÕRŠL ¬ž4dú²å‚†ú([½«xêãP:9l‹$Å ?+ Ú£º©˜·È‘ä(_¼à ŽÞÙ5tŽï\œ¸ 7ÙvÇý\ÿÎe)à&MkGöR†5€T(ú ½q¹®}Oðhoüs-Ç‹@¶’>&]ÍÒòôsçí-ÕVÌtz‹×>Îß[5’š›‘†Òw _¿ ÁÁmê©Ëåç, _Ø‘Âßw¡‘ˆ*ô?°ÙN‚ùˆG„7ÿVj€áÁÑH0Á%OªKí}Ó¼Þ]Dè#C‹ÙÏx):ÚûI\TåÚCº°Ï²Þ^…Ž¢†ùÕ¡÷ ~íàkt. ’]vùÕ”ã_“Aj‹ô¯Ó,Áµ¦jL]jÄ+ˆd{Ùñ¶ÈæË~ÎXw‚? ·JšÖ#Φ¯ü3¢‡‰¡ýiY¯4P½ÈY P0:šˆ‘èœ/ŽR9Ä}‡táO®[ébêW0x_ôöÑlÜfŽfÜn,é{¿á­ÐÕ ,¯¿5]wï •MšÿdÅL©Ö³YJ_Ôo!Š7œv]›¶Oõq"SׄJê§Äê¾ D›áQ>ÒJBÒ–'ÄãTÁ]ŸØ%8×ÎÉðã…p¢a§B®[êèÎß¼éÉ“vô«Í–Ñ€­ à¢V+¬Ý°ùüy´Âh"U‡Ý£´ YD€TGM늟ìxQÃ+÷”4¾Ü XôXPŸOÓ§‡üKTogó¡å-Ÿxƒ!°AK÷s¹)«‡0Å°ûòÈñ:zÀÒ²Mâºp ˜FMÓÉb‹hÐ-¢^r»ÐÑ?Uˆzáʇ6™P羇³oÆÒ=Ž$l=F‹ËËI†–¦H^»Á•âQª˜ uÐ¥_åûÑbj$Îø;çzþÁÅÀá”H…­£˜óåQ$üEƒv³Ùiim<òz’òÄüp•T9¦"¦©v³&*^‰HÂñÀóO;£1åyÚr]íò9cÚ0^l~]™j´?Jp±Ï,Ì û›ŒÉQÐk{’¦­1Œýò„É'à°Ås7bMák˜tV˸ÍÙ<{áöU®U›Õ‡»1÷J2ƒÓñkJ Üö¸¦v”µ"UÐjÃ(\@˜²Ügþ ­PWÜMŸŠæDóæÙÎÞNÌ@AAMà ÎQï6Vù\©ÇÁ=e<« ¸ Ü°xKý1vªŒ[³C®âA‹wˆ^n•³"©“º‘$?”q¤]m6<¿ÔúŒ ý$KÇ ŽÅzµ˜¿:˜1†™Nô,ÍX•kò›É‰{eVZei;GÝedN)ÎÛj[O`¿Um=ÚH©jÝ‚´¹Èº“ÂRòxZ^…ya ’Çà6&§Šýx7ߧ7¼tJV™öS»]:½…¦xƽ5žÜÒº…ÔEßÏO ¢‘ Z+ô*—[›=Ç£}ðº#Z€Ç°ã7ªPïÙqAÙÂÂ潘Ÿ|xd·²Æú:®$HŸ ¾Ëã©gro:rп½à¶œU[jcHÉdG‚áh%^áô¤Ò‹{Eöë¡Qm§`ä3Çϧq…á¦ô½(µÚÁ“´h,œÀ$‡}½Ý—³DíF~¼éFñ—ëàÿà¶8 endstream endobj 561 0 obj << /Type /FontDescriptor /FontName /ZWIIUE+CMB10 /Flags 4 /FontBBox [-62 -250 1011 750] /Ascent 694 /CapHeight 686 /Descent -194 /ItalicAngle 0 /StemV 108 /XHeight 444 /CharSet (/a/b/c/d/e/f/g/h/hyphen/i/k/l/m/n/o/one/p/r/s/t/three/two/u/v/x/zero) /FontFile 560 0 R >> endobj 562 0 obj << /Length1 2395 /Length2 17009 /Length3 0 /Length 18403 /Filter /FlateDecode >> stream xÚŒöT%lÛ ×d7Ùíl»ÉœlLÖζÉ5SM˜lÛ¶mÛ¶ëë¾Ìý¼ÿ¿Ö÷­Öª}œ¼Žã:ÏkGF$¯D'hdc³±v¤c¢gäË©31Yè™aÉÈ”Í-ÿ±Ã’©íÌl¬¹ÿ!lÔwü°‰è;~ÊØX$,L,&vn&nFF3##×mì¹"úÎfFz€¤5ЖLØÆÖÍÞÌÄÔñ£Ï>( ©L\\´§­€öf†úÖ}GS ÕGGC}K€’¡ÐÑíJPò˜::Úr30¸¸¸Ðë[9ÐÛØ›ðQÑ\ÌMŠ@ ½3Ððe€¬¾ðßÔèaÉʦfÿr(Ù;ºèÛK3C µÃGŠ“µÐðÑ $! ³Zÿ+Xú_´€‹`¢gúo¹gÿUÈÌúïd}CC+[}k73k€±™% '&MïèêH з6ú+PßÒÁæ#_ßYßÌRßà#àï£ëÄú ÿÍÏÁÐÞÌÖÑÞÁÌò/Ž •ùYÔÚHØÆÊ híèû×ùDÌ솺»1üûr-¬m\¬=þƒŒÍ¬Œÿ¢aädË bmfç”ùẇ öÍè`cddä`çí@WCS†¿(»Ùÿv2ýeþààåakc 0þ ô23~üõpÐwí€^ÿtü/‚eb™: €&fÖ°ª˜ÆÿÂ÷ooæ Ðdü?&ã_?ÿý¤ý1aF6Ö–nÂÿ¾by)iEqšSþ¯SHÈÆàAÇÆ cfc01±p8Ø^ÿ[ç¿ ü‡ýßVy}³ŸŽñOE kc׿H|¨÷"Îÿž ʯ à;ÈÚ|Ì3@ùgüµÙ ?~1ý^‚¿SþÿÍþ_Uþ_ÇÿÿžHÌÉÒòo?å¿þüúVf–nÿŽø˜g'ÇݱùØëÿªü×B ÙXý_Ÿ„£þdžZ›XþWF313W ‘¼™£¡é¿†è?·ðQÜÒÌ(oã`ö׃ cbdü?¾3´øxT>îêoðc¥þ·¥¨µ¡Ñ_»ÇÌÆз·×wƒeü0f66€ÓÇ’]ÿžm½µãG àƒœÀØÆö¯eg0þeúb0ýAá?ˆÀ òqDÿ‹8 b€Aüb0|ýƒX ÐG?é?裟ÌôÑAó£ƒüôÑAáúè ø}tPúƒX ÊÐ[•?裻êôÑ]í¿ˆëéÿ1}œEßðc(þø?Ô0øƒ>ü†ÿEl>CË+ý…•õ/‹•Õ?*~Ü5ƒÑ?à£?Õ?®’á_cö'àƒ¤ñø2ûÏòtþG¿ü6NöÿÈÿ1ùü8‘éŸó}èbêfk ´þGćÍìðC‹ÀŽ–ÿ€XýLäþ”bûHµþ˜æø?ØÚüéþ‘ló?îÓÛþq³ýøö²¶ÿ„•éßVûÿщõC9ÛgÅæÚ~|y3Øý™Ü¿Ðáïûñã¥ü0Ú|lýÿªÎô!Ó?DdúÐÄ᯿Ðù¢±}„;|<ç>Žó§ÜÇóÇàhjüÇ=}pst±ùG‡VNÿ€2;ÿ~ÓåCð‘ýfÌåÝþ?Ttÿ#ÌG%w ý¿ZýÏbèdÿ!£ãßüÇûòü÷w9è 4„]œ³1üh^ØòP!ˆëB·;Æ;M¶«–HEç±hßêô„OUþÛÝþN0~° ye[”òV`‰ðÕ㸱*¤é§Bó³ç‹n¬âän3ìÂFßxα`u/> ²Àžç«§ªŸX#h»$Y†'¢|êƒK¸kuoÑòHðÜ®Â^9»ÜKÑ]¤J„–_þ Y¦Aê,1¤#>45Ê…+ÒÌíÝ4Júø;¡d, ¬×I$K®‡ÆsÔã¬ûj‰2³C6)¶>Ø-ÊÈ$¹‡ÐA‚$æ¼GA^´dpxž1¾Î\=_+’¾k%Qû"OÑðøæ0Ö¡®ŸpÒödp´¡Â™Ðà¡¥RzJF5GþÔ+“n6¬ƒBÛþ+†{xéÌoûþ> ÇSyæ¤î–·”üm! óì ØY}½\ÞS5?Þ}b˜ 25;=ô]NÛ>q<\z‹[C§iÞ(;åSžÁ$Ñb2%Jÿ©wš¦6ÐW†ònÁŠ[9ùIÊ|¤r]²Ýñ½[6íØ0€I‡gïQþÓƼò®Sà‚Q‘&p2*Ùœ[²Ó|Xê9Œ„Y)«B3î¸7UÈ…¤DÔß&°Š£¼@_?'!4‹§!Ää&ÿ^Ÿ{¬f²pê;Ü¡Q¹ÑÏI‰¢‰³ ¯:.ßeÊŠÇ$""çL©Å,j?³;BéG&®Û%é1ØçËfðy•±eOˆkùí±(±KdýûÑÓà·HRøê5Ì;ïL³kiUÞ\Êß/·a_jHcvº'¶´6Õdé…s)U§´Îe÷öð2Z»X>#BÌò_Yê";tÊË×ßÁµE¹+¹lεl|íÖãr·껓߈©u²Ÿ£’æu2-ŒšõŸ[Ìlꔟ ×É÷ªo „èè˜Ý¡+sW¡]&`)Ù÷¾Ûþšë‚ྫÀýivª™qns”>nÝе©#ÛëWe²? OûB2›ÔòLr5è4ûËgñÖLFPªûo%?øçËÑ ³@1„ 39$Tgý^!æv3ÔÞSµjsõ@hh¤à[ybÚ†TÆø úKhYË‚{['ÅížÂße`3ja¿Kç؃/ÌÇ·øÉõ¼{C/­ŽžF¥”v ‚} ¤¢XÚ#ôûÕi\€ðÂk¨ö+@$±ÿ»€4`èI±R © °i 5 ¼gqª=ù…Ôöõ'Ñ1þÊ5Wu„"€—CãÊ«ð÷JŒ6ͱ;0KJ3iÒª–®z}»cƒ5t1NUDƒ®<¡³,iFmI*Á¶¶þ,«¡.Ó[Ùé>÷bN =¶„èÑÏ[?…œƒ5'`"âpeª½Š–·‰f¸HU Óp¥—¥b»ŸÓ¢ÎôDâÒ²}_Ð:f]?y·Ö¿þN¶£a¦û"3_3‰t4݈{ÂÌ}.ÉüUøY†yGo„;L:úš;k§:gài£´mÔ{ãÍ0e^F¦`#•È˜K—Oþ¨Ü Z,§ð®”ba/5¾.jšõg >§;ð“ 4$Ö)Ä#¶Åglx>Ú¯Þe:Å *|åÞŸQÖ¼©À¹0ÄÓéÐtiÆgB 1?´ÄX%›í=Ž¥2ØWÆžÜôòiŸ¬ñGrnÉk€ZÄ@’XEäo&“ ¾³7áÆÆ=rå9óšŠvèªSö¹ÅË>$BQráäïc±Íñd­©³A4³¡E_À« §@VˆHÞE·Õ#k-Ìh«g¢a5%Ô”¥¼,ZR7ÌŒàrë¥ãó下onz®é_ÐHëö®î·¼}¼- Ci6JbÊåfð{˜Ñ¢õö®xEf"*ŒÑ\@q±¨zÚâ"-çŽÅËjë¶8@ˆ¾~u³£ÙÜ+¾D˜’¬‰÷<†€„Ùs¾7g°Ÿ˜]ú /LÅZa^ýúLS4ƒÕ5¨ÇÖ]‘Aíñ‘¦Ù¯@_Wb¯ö§•éÏ" ñEKƒï¾¦]J}>4}êœ0£žJÖ=þI+yÑî2­à$Œ 1 k5éZ.ßTcN"/IP@ŠZíS‹hh¹#¸î dk\?œþXvHöµ†QôE¡iHBLUxtŸ«ìiaÖšív´X^j£¸´ï¢\®)ßuú´MäÍôqFA*NÈ’ä— I-+Ø1B£Þg/º«’0¯ÂþüéWNðŠÅnÊ–|MU_O§á׸&ýéâ¨ÛŸ*a;œhÐ,kŒnwXkÜ ¥B~b<(KBjrC”8á¼íEð«…Ê>„Ë S7!TÈB˜ŸI_‹Í0äóÃeƒŒÄÙ èêe¬ l 9jߺûkµb¦@”¬Å)2$Ù³æcÈ<$`Ì‚¤Ì‹¹ø œÙ(¢´¯|j4:äG l@£æçëòìËùäcô‘ƤRÐáöÂŽ¢. _¹g÷ÊUÅÞ§H^ÊŒ¶î Ðáû=•1G‘A—Òî»æ»"öÐæ"#§S.â ™8¬€ÛTóÔàóìת¼ÖVÃ\¦Š[&ë°>õ|…äÓF&°dqµLŠ7O»yÍ—¾‚sms(õk‰økêx9â R ¡˜yL¹@e”ƒB²’²î¼¿?eòªÔI^b5fóžÞ2CaÔ|PŒÌ<½@¾–é¬ÙÝ€y°¬RÍwM†ÆJª>°±¯ß˜–x…Å;»§üËó]GGg)ï° Ý¾"™oØÞ†už¤Pž€õè;» ãa—iš¢WEºò¼G eyâézPŒ÷ði;Îýûm´Ì»yÇ>TA:üî YŒØ'LÕÀ÷¥ïâ[ÎõþüzJÜÇÜ’@[ž‘ºA¤Ÿ-®”bˆŒáUžo÷šÖ¿êJoú×>EC£Mo´mÎp‘>µ“¡'xQf-ðáð/׌3¢#Ò‡áÊP ýkàå]pEk¹òoÇIe›—x²^ Þ¿›«C4«;€½ÊØã,‰–ל¤ÎJ¿PcѤª†ÆŽ}‚§ågAéØvåH¸d'Ám×'ºãý¾M2€úü 7?蔋nÕÀðs]¼½z…ðUþ^«PKÏ`s{–ôΞ·j”?†!çž+Š'ÅUHùèx‘£Œ>ƒ­pK¨n[QTË¥OŒ¥J„ºMŽïú™Éd/ÿ¸Ä.Ñ"ž7!ø$‚ ÁÔYÞ²úUó¼,yGL¬IÉY`*Ûì°ÎeÊäÕ(ùýS×ðy02™ÃкwŠð1ôaZ›2ê| –{÷JŸ¹)‡ueÅ#(cw[<}. Z Š»/Ó²ä©×Aó`±M¼iJ5̸ùFòsKæJÛqîˆ(^ãYÿÙ­öºëc Hq/%R}OøûMøù: 'Šs—ä×ò_n~ bG‰k¶Ý5Ìh?{¼$¨×j0…„ÇùÜø“åtA!ZX¡¼poÅWˆîg¨j2ÕM©^<ЇHÙˆ1Äèã4`¿¤¯³ŠëŒ”Xü ôØïå^…Nª}[Ó¦JÖ/àÄúÍò£W¦¿Œ˜Þ;РŒeù„=õéÖ:¤¤õ)Ua¦àÓê;¸™V^NŽØ¿5’Õ\‰±`¿˜ ç¦ç®…“gÉx-, °¤‹X ˜êEj¥Û;ñ­_~¹7kÄÕm; E‡µÓL2´¸•M™  ´ÖËzržGŸ¥bNŽ_Nú±CJrŠÀþ8éñvýR¼¿UV§%æ|«r¢†×îkyKæ ¡iR3ƒ|dÎî‹" 7ƒ¾Bü㇎…¥pÕ¹RÓ Þ!Õ™uÚ¬Øo94ä$·RŸA´™}ïk »ÖÓÂ%B3‰¬ ?Ò¼táaåj×€¢^íç¢ýªB³tPPGV”Um«ÝP?ÕiØ%¹çŸ~¾e·-T& fo°WdtŸ$Uú24+”Õ9fèq‚ C0Âý UÀ¿ÓÞ›rœsÊd±ŽáÁ¸pqoToš¿YÙ;ߦÈßD‘ ðýÈ€6ðu½jÞÖ½oΖînèI‡s+.úPq3Ά4©(Ààa|¬ |éUl4Ô=0ç½°m_}HTÆÚüš>sÛa,ŸmSêÛ.3M£CA›ˆxƮ˰¬æaº0:x>È:™|4b¾_­ä5õv*â7é6[·¶9gŽ S°Vííž"ía'¨¢8eJJÎí.«$)½ê†g®“Ö×ÿ¿4¦€jJyÂ{BJLýIž"ÚRRÛ’Ï›k‹¼;w͹sKç:¢ª5Dm—×LvÊ__y¡ª,’ bkÎ’iÅęߗ•½šÃïë],Æ1ÑÛu­ìÍk§yÖ–+~A+Úb›ÁêûnNc$¨c¦Ø•ÛÕ^õîí%ù¹Çµ‹‚&F˜ä,»XšÆM¸óm+kÚuskQc x+¸EqürðÒšoˆåœ]ɲA˜Ùï©RÈaܸÚ=9BDE½˜²ü¾’èaçûó‚ôw<ò]¿øwI ²¶É kü‚7­[ˆÀ©¶¯’3¹ÐÐ8ÃWd‘œt•S’™êà ÉϨ!€9²:äùNž·4ïsŒ…µÄpÜp 1F˜JP¥Å]ìe*.·rÄ¢óÏ>øWǼbÑÝ<}„H“šÄA®Œh Ÿ·_á’n5<<ü#»oÖé±àO9‡û)ê4`j:GuõÉLŒ¼›}b ¶¤ÔfŠU2܃¯@ï²Â‡dSƒ³îh%À33˜ýO–|u/û¥›†ÛÙÁ4 –B“Þh`îA÷t{pm²¿ÕÐQÕ ›í£'PƒB1#ø}ºTi|AµH¿ä•8â)+v¡ÉpvŠœø4LH§;|ó©!a…{ñÐ/Ô2ÿROj‹l4”N1:*% Ÿ@aûs^šànEWø3&(Óœ"âËЋ¾¨(â +q{æÑ`‰‡/ÙBSÒ¾¯³DE(Ei¾ ˜ψP<Êgÿ—o[±peí–b E´èw¿÷r¹`Q)hù,ñ²5ìì*ô0B±Ð„Ã+ÎhÙ±—<¯T°ª4™û =Fv÷†Û2µE³ƒò6qE´d;(æ7y=£ã!UIn ²ñÅíìÌ5G Úª¡4ë¤[Z*¢²¿BšÙúýã©ŽÁa™IzÑ{[Ý’%ÃXS€ÔqÃZ ïöH!-àβà …â^&ã TÖKxæÆæ{Ï.¥”KšY¸æ¢ÏÜ;­jpÓ,O‹ÕÞV§°ŠÙt¹>õÛöÍ_+–B—^4òwKŠèÁµß:µ1³xˆêÐM©FÝž)Æš_Ñ‹,W‚Y–ý†4×CÜû{ùçß^ó›hŒ&C´®ÛÙm"OËg:qD»8AÄg5‘§PkòÝ|9Ô53à‘ÃA¡PÔ(Ø›% žÅo%ÎáH½…ñ£ˆj¶¼2¶}Áe¤ªáë5¸ï2°Û:bcm¼ÐFÊÄ2׸Õ"0~ÖË›*AaŒí-97¾&«d›Uƒrc-×°këÜÇ]HŒt·”ü pB ¢NVäé\¿Úª#>ç¦;öKz€&/}^¬U†‰‘Æ•åª÷æ¥ÑkÕÏdxšn¦¬}‡mš~·ç*2mØÃßʶn"ƒ“òæYvMÜrrÓ—%¹T0Ä䜰~$MÐÔÍóï*mzs UÑì”1Ú?=VhKz[3® …š¨uá^]%F$×>iú’B]Ï{û²¥#Ó5åö,nÔx+—ÏNTEF µf»K›¼mmÛ‰A í­&Bãé0d¤&Î^VåÆePŒ¥Î !%ž[EÒsÆ1¹Ï2KgŒËJl0&˜ y½ˆ‚ ¿Iˆþ…Þ4ZDjtxÅÆ_#oâK¶‹ëuË1FÑK`—ƒU|×P{î/Ñ&Çs 4aLgmX–p™Ù öû…ñ{Ó´Þ6¢%‰ iå†4«ãÉD{Wð¬Ë­ÊûÇÎ@²‹']ì`dÛªYpM|dØÚt¶lo=–c&>ÛõSýãRóg#å±þ£$òívhIÍ·ŠUÍ_þvr1N³m®”:žŸ .“P@šLº|ËúV¡L£ß)Ψç|;B…P1̶›šÄ˜×Xæóú}å‰UKã@‹€7VFHÔR~¤›R½ùy›´l”ÉXiY`hÒç`8¹Àï ‰dÄ>ó2å’¥¹4q# €È€Ä!“mœ4¿¤ºo°‘x=⣀è.ªö× ÏÞïwñÖÑ®U o"I5F ,Ž”¤1Mu¬Œ{8[Š,r r.ÊÏõÔ¨»nöË`˜5æÂ<±µ<­¼4?%%Ý¢D ´!Dôr7iÊ1¶cÓ©ß®í¶¤\m§…בi y$K]«H¸‹Õ»—“ùgDN·¦^ í’.JΩ'–1t7w2É@!@xò‹ŠìQ+Èâ—'3 =«‡’ñ10¯¥æaîÒ×À)¯­¤ìEj?S•å|_¨úN%X™½i‡–œ³n­º?ÇGÌ>Hï¿8 Àe/H³u†¢\#œïžÊ€„/òþ’CP_£@Æ {ôÉîW¨q‡òè‚웛ѩHÈÆÉ)2—ò”v³J%{ö‘±4$mðšVg™Á!VÔ·–¤ÄlOL$é’•O5q¶lÝEÑ~Ë\ ÆžT ú@<¥hÀL¸b†ºKÂTS›7ÌâÔ´0ƒöX« {B´ Dzz¿"N~x0i[<_"\‡ÚY‚Œs˜gƒ¨l»t)\±p´åÚ»’ å0=òÁ!2Kè²çÜVÿn a·œÝ¦Pá!ûÃE†ÀìqµÜ·»1Qûì*ö¢°þŒ|­¤Š-hï°ïèÙŒ”›<’d 6¡8ßb’kígy;ûÔ÷v>: °.,^!ÒZ0ò$÷Ƴܠ=,x›æl»Î[s?a/š~™î¥@N,oÿŠ«NÀ˜qαŒ;É·¦¥¢«)ÛrL"±3d†r ‰Šêÿæ–ôxIÕë‡yTÿ~NÔS‘'B42ûTÙãbÅ$i]9ª½áÚ»ŠÅ©Ø —6G2b)gÚ ŽÑ´’Ô)ѼÀ¹ØÐí>ãXñÁ‹ ‡0Ž…fnŸ­ýÂmš¶„qbµ6y« ᇙ¼ùý+ê—x€¯Ó`ý±À r@K&õ#Û2E°½é7³"3wzæÌÄëú‡›Ò¦ó]–Ö¡ÜÑøð3øM¨…„?ánæNÁ,‘ T¥„ó†â7öZ†E6Èì5îwµFKed¶™ÌWî9Ô䘺çH;(';BWvþQ²÷¬jíf[ÑÖ_R º§Ý‡ÐCÏ z0Ì6 Üн ÄURña†Æª†›¬?O”ÔçÛc*÷^†ÊÍóˆÁSRaOô¥—Ivº ~?‘õÙñ4#)¿*,óΫW[”µ•– ´`¢h‡– (x)ÏnNRp> Ù†ùÊÜ>/ÚU|ëxRŽ&²‘ ΛòYJ$‘ÉŒÄ\f…µÑœºzmäiV!òÒ&Rîiçòí€È?¯Úç‰óâ…4Š Šó‹¼‹ÏuÌ{å’lºvc&.B/½ÊKµµ®?\ü“>[là$¥{©óôÉúí©ø1Æ xÍhMDédÄXq¥u_0vƒX꽸ÞkQŽ SúÂAkƒü˜bèBtf‚Ä›K EƒÔl…"ÄFàÕp#e!#ëç¦Õ+°­é«žN©êlç‰ÙÎÍ.Ѫè%¿»P½®ËžiÑ!Óúw¨ãøÂܹŸ‚1[ÏŒÁªšB‘.É¢hìkkämXóŠ8ûDÿ3žñWü Ãlë‹ù6"¤‰Ž",óe$Û’GyAëárä5Œ¡‹“šßây·K¨ás} Ïù=Ózb¶îæ(=ÁM· ù‰â§Y¦ò¦”ý¿R©‹ÙÈ„“ ƒ¬6c|u!šãÇ“0U¿s]­rÙA/½M …‰C<RUïµj¯ˆIˆZ›ºÜ’åðt¡(H™°–ú |v”ûe,‹L¿ÓbN®úu ^‡qž¬íÑå1Îó¹ø¾³qdåβû+Sr_š|Jlo¥íÎ>¯¯,‰Ä§^ÉC¸8ŽK²Zm:{5ˆ¾2öÉ»¦aˆ*.1¶TÚ'eé×ïé¾à§öã4/s×¼Ys+žÞ{¦¯A¢B‡_¬Å›c6U+&oŠxîR$¿ååX“áuCÞ|.E½¸! >eIA¦âWî#˜j£ýJ;m\Å_Ù íˆU¾rBa°Œá’hŽÒ¯lJÓ† °Þ‰ÿ {ªð½÷J”º W+¦ÁE¡¿d°Ò³z†ˆŠõd÷ËÌïØýÀ»V¾»Ï+×Gxº«nöºO~r¨á"ç%l—Š!yíßÞ€?ä–¾Ä7¼Æ¾·)Ÿbø9É“µc®EžQ½ íÇ®%òs«ŸÙŸ”GòxÚµy¹)¢axh:¶h;0Â|îº*_×,~Õƒ™è«($<Á`œÙ¿ó’"Ú,E7†*NUøH±²<“¤ïVÁ-ƒM„Ný®Ù0¹VÉÅ&üój?2õÈ“a±H¨FÇE|ßwAÜ¥Œ¼Tv…›ˆ‘†£Ñú¨ªa›&WB)äG|Ø$2èFÊ"}ʦ*ªœ–h+QL¬G¥ê¿”ÍJÆݽ†±CA0¯`W!Ãhd ÆêÄ®äDáò¢ãBûàlcQ³ͱ­dH°¢Ì®»Õ®®£OyP®É³Ÿ}uͪG »Wõ`ÐȽ‘j² Ú!‘Òë'¼¨‰ô»xFŒÂ?#˜„‹×»h+.Yœ;‡'ÇÓÝàŽÝÞ3µžV³Z,Æ´‹Þzèà¤Tß$PéêbŸ_ËR{ËÔ—8êd_x ÿDCi—Þ--£µ®*CWò£ˆÇ.[ Ô-,ìÅSèÖwÁÈZ¤e#H”16º÷Æ·Æuý×DÑÉSI3Т9½YÓ†Bæ3Wø‰Ü“R'ƒœoðö—éZ]Z«HôzÞ¶s£½ÌC,ú{†W²ÂtV, §sÈÂ`™Bn8jwúYfÙØ|Á“ÙÚiˆá´P'¨§É~'Î÷8PŒ;75Qgl!gˆËsù¡³ åoÁÅZÉoMDŸÇ[<¾ç ‚.›½KÉéy“FF­“¨@-˜Õ^Ž "þà[¥#’= ¿Çú]¹ãµ¯½Œ7@(I‚vLà,ý4{è…¯9p>Ùös Þrb½Ê—Âx²jo=TY– uº ’ìÞ=Oh”VÝ%ßþ-Qròù^…~þ„­âl†¾pV'5£‡Þwú¹ ³×‘%4Y“ú¶¡½’,Mg;ù:kph““ÕJ*“{—#&ä§;›³¤ŒƒJÇ2¸H–]sGÈ¡ÂMŠnd¡ò™(J“’rtî‰.@Þ À{;BÆ[ó ÑëóÜÝûzj‰-¥³©ó*I½v‰G”ši›D§{ˆòÂ…ÓoÉi n: l–À¨´ ’£ç¡ì.^ìÿæÏ"5hV §âÝ_K–ÐävÜ1ÄN(âQ™3‘/¿-M¸ àŒ!J–* smŒ©ÎXa|o=ÓZgç ½Ø55UÑ÷dÔzdd%©ùý Ral§ÅŽ-4DÜ`÷Ë#‹‡i«\ä:ñ4ÐRÅvÁëáó}µõ±"=Þ@fª3ãâCm3÷ïµ<œvùu“Âã7»Ý×è÷¶}8¿I ~FÐ1…2XëJÊk'I±§ Ž;ýòéê°¢BÙŒ±bÒê0*䕬·ÖÇì£þuçY]’ËBaÒv "5ß­;¦|ÜQ× ›,þ•ßï±0¾éV[“’M—_EiÛp,«Þü7GïZÿ“ƹrÃÿ"ÉÎGßöùä ‘pXbWñ÷¸ò:a·˜ó+F ÏúÚ'Wžxh@jkÀÄj[uLeDåZË¥)©o¾HBfÃ|Ó©ÚÈ2ÿ¯¡ë‚ån{ÔSHô.ͪ8kÅ( ÿçÚ¦:ï¢uUzõ©­ù%ƒGŒ dR£‚â¹Rf_×ajê@qáä»>ur×Ù«™«"³“üA- 5CW¹TȨÏÙÆT#=‚©*3Ä¡<<Å 8½¢œ@|1Hy¡|óNìó¦ãɵÅQ¢SžìAò²!Ñ/iÂáoì?³Ã¯\¿:,²0$†ó0>–F1ϱÚk6ßø}â,àB„;U†ÑN8Q˜g^™™&Ëaª’ÿv¿×È©õñæø¡´™êŽ·›„¶~¶Mu‚}€Æóþ½G÷m‘SŽ¦ºS‹>YŠÓ¤‹Sjr¤¢|È­34:™‡Êp–:JÕ°y—žd`w{ª+··J~DV¢ÛYÝÜnòG†ÌɳYér ‚‘Ƨíâç/L‘Áàñ‡I'CQe&²’¬·Ò_s^~ök[‘â”#6¹3)-|ŒB7B–Ž‘Á•«o  ³Ç-‹FRn¥f×Q`U×oq Í åÐRAoÚtæ0!_~IŸö\ °Hmí-d¾oaPfgþ”²_Üz^ZÅisºt‹ØBºfìSš6 Ðêé³ØÊé,Èá—)Æ-膂%ÖË`¥a´dmwÉ?Û}¾ÏxöéÉ]ÚF«¬ hš‘º]…Ke3ÐǺ±é{O¢õØ‹’ïϧµ§ó!ZÃã+//ÉSkp‰JOœÔ35šùþ~ý%‹Ù=YÇJWæ7#'2¸WÇxS?k.¾]u;Bªí²÷°«øn¥$Å®YÔ•:,uÈž“5pÐa{aÐ6ÌŒù¤IéÁ&0Wšš¼,úkx³Ë©É_­t±„ «[>úŽèÓñÒdèW7='Ôe†ô¤8³¸Ÿo訣 yDs–HZÃÒßPA†YP° QëúÆ%Ô~ãV'øñ}Ÿƒ1ÜóîG8iØÇÛíýmG­áø=1òË"érOózùèôÈêÒ|û§úKeQ‹ÜÕ‘]ÄàrÊr í¥)~éцH«zÇMF~î > Ù÷jfOþ&Îs?”v—uL¼o\¼0ûHL3ƒ"*4zPàm m€¨eæ·i"5?Ý»Àòão°¯à¤”ª™n1¾ß„â‡1ŽÕtBĆ—56KðwA×Æ_jNÄ5Ý ¿aß—D;~O vñWæzäS«—s¨A@ã ñÊ/ –P “~ËX¢è¶µEikr½_ÙvÁk«üô+òUÜ]œé žY"^îSXþ’&õèÞ$ÒÈFJüuªAmý-ƒ[í DÊ·Š5htºª4$‰œY®³DÌ¡Õ/Sòò×iþAO1% &®'ÈGy˜ñ€!'šŸf›?£k³2ºQp9¶ç”>eKâœ,îuƒⶊ©sÄæx…MÖÔ 1>®îï¬aûÐSC¯n&÷ùË£["šâ-Ñ"V.˜ÊPÚÂñiõ~³9›KšäqO}0njzÞl¨ŠŽ"`œS éè% ¥ÃÌP¹ù£æö<¥@¯ò½æy1Ó‘oÑî.Ê8¾òì7v;AéüJÒù.M‚i[\¸b¡ËÒ)‡°=­¼ßŒÊ°Ë¥X¡2V@å½e³ÏKVäj£f"˜—ÂMì VʱÏIƼÌ*=¿†— žu,Sp¬Yp¢†¢„Ää½&üMÐú‰Ö ,Äãô½»Mä-q]!qà_Sò—F´úLX‚'‡`ŠÃ†²§ø@Œã²Ê7˜Þ¸¹ðÑü)cÖt?…’vŽê zr{vþ>LÖB¶›g‹.‚‡ì9bT¼)³_ŸÎ4‡ŸJÕO–¯r¶-rËÅ^0 P•ÎJ$·à Ó¾Qa!VòÛ–/¢_LË*óejêÄÜ¢~…%Jº7ÝÞ{c—3®Å^#QÉj)4¤‰Áx( [ˆ²¸btuº˜Ç—ÓW•  d–AçWöê]ûDN^<+ü#[ãMÄÍ‹ÀJD#óØ^‹ˬ­ö0MÈäú¾ÂS¶%E‚‘/éBg*ªÝ;Ô_c¯àG_¸ñÙËP°éµk¬õ¤ÉáË=[±d-ÿ\ˆ­ÐË^YÜ^Ù$ „ß Y¹06né(Yƒ#ÕoÃñ‡‘‰êƒµØ 4`zF‹ÑÑ”;(ÿÖ·Oe#ð¢ðø³ÝË<ÕÕ½›Ø±ÑF¥×UùÁ\M ‚õ]<à/÷î¼LkLwM£/F 0…?æÊ5h_¿ÉJ* HñÔ”nϘEç,{¨3¯bËG$S´ŽÔª·¨»ëø¼å4ª%îì,)©¦ðÛx÷‡wä¿ LBRoæÌ0¤~Á áo[¿<9äMwG.ÎßôDbPoŠÄ&@7Ü5‰‘¶D¨¾±ÏµûöU_b–ç`ªQSÏ;nº³m÷ºÿñ@Â/•ô¥ˆò±^)nÖ×1Ðt†Ž=^ÌÔÆÐÕ·AÉrøU Ôä‰÷ŽT³/c´CGt6ýúô¬(+ñçxØêowµ¯l¤³Žw÷0x"?Š!?mÍYúýä’?bâÐØL‰&è6ì€%Œ" ƒ¸eÛ×ð&–2Ö,n'^˜Ô6w ÕzØ+»âká÷ ×7p7þ¢lƒ˜}Ï®+ $Ü‘Öíüµ€ìÓ^õœÐìð.¤Ì¶Øš ‡óÒÞ/qÅd;s8ò _O\2Mv½®Ðà`ÖG솈fQ¤>¸e~à^t§”(ìõj,2õ=ÐÁ?÷í‘ ´_óAÞÚ‰ŠØO¾àƒ‰Ú’=“ÇUòº—áË4^6d¤]öíµƒv¢æ'‘îhEÆ"¹’ƒþÚ&DiÄüц mÂÊfÜåzIRSÛô£¦urYyØÒw^”;¤H¬`¥gá ³=cöãS´°‰ñ“–A}cjAÈg$¦Ë½Xx½ç,âãzI â‚_»‰@*-ï ‘S×ßÅ£ OÂð§í(’ø¥ªÛí’°AŠ¿ ¸bf·|ëÛã=`¿ˆJ†·6– Ih”õÖËù÷l¤GCqf×é\åífLŽÈŠ> 4<=VÄf Ãí³’˜v‰Ý®2è†h<ùCÓ^UkÁdA5°€Âº¥ÝÓšŠß|z UÂFú'žKŒ ñ·( %§°]ðJ óªG/_B Í [@´•¤µܯY'41å×it¡T}>­Ñj¹ó ‹`‘á5õ+×› ðÊËðæ}ƒYl™";l‹(5GÍùf~¿Êô“!x `0Æc’WɘÍìwâªi“[I Â8×›_{ˆ æl:}³Ð÷…8YÇʵT*L3™cC™ ¡¥ô˜ŒçQÊÚö*Mžûà1‡”zn¦½] ÞIdiØúJï±4ˆÞ©Žþ„œêԺቆ6â©!hýPòÜn‡—`ûIYìUM¹žº»ÓZæwÈ8Î5…ŠáÉÕ×,ÖáEŽç°>“v©Õ…Ï‹¦ãˆÛ¬t…wq.¶=‹NÞc,Õ&‚üÜÚ`‹²ä{öB÷Úàù‡Ž2´¦èå& SÝB”F7å¥ÛÕ/-ÅšCänjâ=ív`JâìeñlŠö«À³…*fy£Íc\x¨¬¦81|¢¿A‘‹×òênvÌl¯OεÚÌT8rLÕ´À„ºq~Ÿ„3VéG˜¾ñ’@wÛv¬Éz _%¾™†®v&ËF­|U) -” tËS|}ëf¹ÃH†·Ÿ6Žþ­z“ÇH3ª wÝÑ+GÏÊqEëÆH9ün1¡D/ОҶUQ\²½š­cyŽ®‹âÓŽˆâbÛ³‹á´3Cï™æÄÕÅìOY´ïLež~û*^fòªsë#G%z†cçÂ;s5+ÚŒe_:<<&zÙn¾ûå¬s:LúíÞ·ÜÛ¶a (à hc.ôfe »uŒñ,/˜=þp@^´È÷i_ed,¯ÁûÆ*¡ûìÓ€, †JŹ!0õ¶ZU‹®. Œ!¿oÒ«¶9‰¦x'BISÆ;e:òÁ“’?Ól7½R]cžÇp{Nïÿª±¦oéPLK]iÑ&K=MHt.ð`k“k´à©öid)ì²n˜‰×•0wqžÃnÛÝiÐOëH…Eßy CÀs4—xëY±]„¤²DÕc©7šš~pøüœòëÄßJ«{ ] Àz¢Ö¶„¶½Î1½ÃCøDA|åyãE5÷Gô¥¶Îý{씧f™ù»:P):£Ëì ¡õD-…¯-wi”åJ¤KDè9N!Æçj#2€Ie3•XÀR# ®ô3f"V±Ç9¯!TŒÌucìSLOº3¬9Ñû*Û[‰¸'(“j}FÕ UçÖ•0ä÷M² "Œ LWK†\ç\a‰aÈ^ûž^l±´ÅSH¦iK5"´O‹|œ6Æã‡ð¯ëÒ7ŽJø­W—XëŠùNð½ÄŒ\ëÒ­ÜYÚÌ‘ÞN¿¥Ù‹]ùAøÝ–\UÊ–oFJ!N´ˆ£Ëã²¢â¤Z 7sÂö÷«ððQÈó}àóöýf‚Y–5Ís3T§ç”¨Lyê¸/§Ãê¾¢”ªHAêEüŒ‹?ê¹ œLf·“$€éwë`”w¨»XƒàeàCÌ$×|N'º1'ÉÀÜ}ëߤdFÏh@{#Ø:ѭ߉ÂÆ4¼üA;çz6YqÓÝ­ášß*Uß¡„°GY'[÷yz[°9$öpGÞÄ¡ê ç$îcöAÅn)h¶+œËk™%2 ÇÐy¥Ž åÕä d»ï;sÓ§‹¸_¸ÄÅc1SÀ_ãºQažÊ ¤sSÜu9nDª„Â΋býΫÕD$d5ŽöÑá;Í Ä(ÎÁ Fi2¼°¹jËé=½Û¿.¥ µD'Ùæ8’¿¦F€³¾ô7(01d@çYÐ*½Aø(öä³R }ÒʵmMÌ^–@þÒëÖ@µÓ!”C2v;>vÆǤôRÌx$z¦i:cÛœ¡¬pG= ߣÅ8„|¾»§®ZüœQû”Ÿº‘o[ءȘ4âfÄÂÅFæÐZ©§R½~é-k× *éqüÖ–äM°¢§ºÖéBó5Ñ5í©æÊ%{3{Jÿ[yÝHIÇwH¦ùv„OþJÓÓ¿ô›ŽÈ¾X/Hz–ø>ñéG~îèNí²ÿm)»WÌ*¾+eÍx’»9løzÕ|°Z[+µ‘+/€ï€m§°ß°EÉ&8Jï%Ú;ÝØlÀ±Ñð†µwÄßP–&ÕíÇG„«âÃÁuj7{ÛV¼ò݆QÄòösªˆš;“ƺ/â8ºcZ0~J¡)²ãŠA Þ™p.¹Ž€×¸~OàR7ðWë·5 \:CRͯB÷ÁåæâL›¼¼@h È’ðªzŠ¯æÿO7Èù á;5]ªPà7ì *够6 CÅQC´OP;]µÜA*驱?^£vMÃO']X…ì#*Òl×+¡ͥ/ÏÕ¸H-¡ôÖî+0*Áöo̵¾O6@EÒ8{|Ûéøì[J‰u¿µMO=JQýtX¿‘]9{O¡Á°æƒ’wxîVÇÌx¢É.¬No(‚—nÜ©p³ý‡Š¤ú!³ [8jú‚¢'è’sµŒ¨–ÃŒ Âæ5ë¯áM=ª«¶Æˆ÷}‰¾¤Ü’„"4Ø£’(wµmC-IñìÜm¥³†vTï¢þ°$ š´R ‹¡‹Ÿ•ÉAƒ™ûSÈnŽ¬_»ì€:æ-¦òk¬eò»˜û÷(ê/pœ¸ÕôØxVêF‘M> ¿.ºë»ç?£˜À,´¤]Q÷Ê ”fÊ·±Ùþ§Ÿíö†jÚt™:i‹ô>¦sÚ^Ô…‰ÍïÏ{XZä¯gHSùcA¸ÿÿò‰³–vóT‚&T•ÆïÓT¦Ò³jŒî=ëpC`uTññ´'ÐtFäyŸ:SÝ dá„Ñua¯¥ú)W>ñ'–}åçÁÑ]„o+Ä~%{ì%oÜ0EC“¥·9Æ´Ÿ=-z³nè“ÕP§9Åa¡ª°lŽ4.Ó*;Ú‘f·-8šÆ´lu Bæ(`Û%RÏEŽ@•;½™„Iij;4Žê1}Þ-Ü6±L*#˜ $|œ>®w{«ªªãlùšèåRÐË,-¤]×?»)ý¡n˜¹s‹k‰¶ÁÑ5¶èc—ϸ÷èi£Xÿ<î.b¾±+¼6RùF|Ëüœ±%žÿDËŠO•xa?Ñô[nº¼›Ž2¼O~R[œòÕ†tô; ¸íÛq‡’¸ÚÖ#y³O'ü€®&@-ÛûLVá2Á…%wiœ™«`Õ©ùGù{€ DR¸×,>n¿-4â6Ôò›‹×ÿé^&Ý r‰Yo¦@ž)3jü¿™s”IºUò¼ÿw@€h©@%9YÔ ŒR”gc,“-Cr=—àÌhæÀLüy€åE d ¼ÍòӚ¼¥c| v&usÅ+±ª„Nh^CÝ[ƒ(8àmòª8ýÕ_É3rWšÄ+žžøHŠòiÇìÿ¯…;ÊÿûÇ/C”ðiTm4ŒŒ¸îKò9ìw¬§ñŸÃ~„ygvmïèŽã²YÝÍö‡ ïæ;”Ž&Äì8CÎ^ç¸èžxÍ*=ÜnT]ˆtù:ö9‡X“{+Åû"Hä'  ÛBÂo¤×Ÿr25ân}º¸ØsÊ•ëÊÁæ—ècó{¬¯¯§aUM¸u(Ì õ~„›KùXž(‡™93n‰H4Øu6þÛ¶¯D¤{¸?„E€ã:\qõSº‰.F±¬oã=¡>±ñ-Í·n" yh&mÊ2¶É-ÀÈ€ÍOî[€µ¸¥µº–1™n1HàZërì‘NäÞŠµuçå ×þÿ™¦ð/öâYo73vé2fpV2Û´GRÊÔqÂ/š_ W†y#t/[~/Ý•TÈØ«V9(^¤Öã)jþlªôvþ˱ؤ«ŸÐêrî¼ ý ÞMè@­õάÌ`È~Ž,±ù’c%5Ë- b‘ô‘$§+¹FgÓ G"ê yëÅ{Änº>ê§ÕŸ8Ù°d^<áµ¹çF‹læõL¬d^gÌúP ì.FÃþ·Ù¦†¾ÉØ;z‰›‚H0³ð%sõB˜ûìÞK@ZÛýõs' yUŸ¡3(„S&ˆÐ=Jþ¦–ƒðÅ74øþƒí(µCâÊNbòУýw>ʈ˜Ú endstream endobj 563 0 obj << /Type /FontDescriptor /FontName /PKLDRG+CMBX12 /Flags 4 /FontBBox [-53 -251 1139 750] /Ascent 694 /CapHeight 686 /Descent -194 /ItalicAngle 0 /StemV 109 /XHeight 444 /CharSet (/A/B/C/D/E/F/G/H/I/L/M/O/P/Q/R/S/T/U/V/W/a/acute/b/c/colon/comma/d/e/eight/f/fi/five/four/g/h/hyphen/i/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/question/quoteright/r/s/seven/six/t/three/two/u/v/w/x/y/z/zero) /FontFile 562 0 R >> endobj 564 0 obj << /Length1 1499 /Length2 6439 /Length3 0 /Length 7435 /Filter /FlateDecode >> stream xÚµT”k6L7H‡ Cw§t·0  1ÃÐ%Ý!­t#݈҈’ Ò‚”H}£ÇsÞ÷¼ÿ¿Ö÷­g­yžûÚ×Þû¾î½÷=¬Lz†¼ öp;ˆ*†äò H”´UÌ€!>AVV#(Òò7NÀjAxBá0Éÿb(! $ S!QDm8 ðÐËE%b’A‰¿‰p„$@ä µhóÂaOV%¸»êè„DåùûÀæ%$Äx~»Ü (hƒN7TF0È`C!H¿…àvB"Ý%ùù}||ø@nž|p„£,'ÀŠt@O0êŽôäó„ºþÒÈÿ+ ê˜U`öJp77 éIðkÊPŒ:w?þ?ÅuÁ}`¯ 0{‡_2ì½ÜùaP/ˆ†ò "øæAD$ÅDEÄìÄÿ+‘Ÿ;ä·ø Fi p‡»P2 APêEà ò†/HPÀþ½"öP0`q„ÂþCþZ£ê€ú,Píüzþù²Fu˜=æê÷úïó›é«jisÿ‘üQQî àð Jˆ €Â"Â11A@пýsËÿê ¶÷_!5`p€Ä_*PÇ÷·ï?­Áñgn8ÿΠG54ÀñŸþ·£~€ÿÏSðÛåÿ¯ùEù¿öÿÿîHÕËÕõ·ã/ÂÿÇrƒºúýa Ú ‰m8jD`ÿK5…ü5ÑÚ{¨—ÛÿZ5 Ô(À]ÿ9H¨§*Ôb¯E‚þê£¿ë€ ï …AôàžÐ_w€( ð?6ÔØ]P÷Š'ªZ¿MÔTý;¥ ·ÿ5~‚"¢ò#@µQsjñýÝÞ~>‰r äà‚_5ðÛ!@`Š†2üÆEÿ`®¤ÔÑñ‹ˆø[ÿà¨~ûÿqøïPH÷ßø¿ööB Pãý»ÇPâþ^ÿ¾KP{‚€ fá`©禈Î ÷|x7Æe>°n˜fsò, º¼~’àfpÖç†}Fœ)d ÷“.®©pœÊd¼ØíhÁ~™¦ÿê2ðÊæ‰ÁäÆ+‚ù ê7ïKwšéñïóÉo^{š„º`v ÷á&ÚK* °XLº˜ñ_ª1ôì¥{@gAKyJþn’-@q+ó!Í\@eÙrÉ4S’ƒû­šœå™Q(ÒÅ+—]„Z—Hü>fÉW§8¬˜±§H#~gÇ;T“ -ùîS°{ï´FIÛ^÷>f›•¹Q‹w ±Û0 GEDì¥Zðç""î0!ËÁ²Ègb BƒyÔ’l^:EÖŠëø!d„¥ã7Þ—ýä_b0Ä¢i¨êòc»Xp*a”»„¦ùW?å+3óòöyöš8¡b!ê‡#Ûl|ñÕ%·r­©BÙàÊçéf†}úõ¡½<_©VkD™|é :îmRY‘nFÝÊãý`‡Ÿ…#vÅç/¼ÓUµOŠ„üøÒÎœ\ó;uÇç™wÍ—¡éè*`ëîÍë] 44"·‡f.wñ]°’(g¶E€TÊù‰1Ë´o,GMáî®k8ö¿IQMù„­J›^ëš-’âWR»?6ˆÀùDíS44·*Ÿ† ÎzήA5¹Ÿþ³‡¼Ø¯=´qsÙÖK£„L!c׾NJ{ ËÜHfa½¢åÔÒ«¯¤ŽyaWa³Gk3á™þyNq?¼ËÙršJ½iºÙ$R;ÕÙN¼lL7d>yj¡¸ñŒãÇtµÌ!—·3´ÕR_­”³ïñ,‚o‰+þ“Ý›ì#ŒÎ ²$Vª8³'£þçê‘Ïüd?@`µÜ[àãoôuÊ!Å=ýt°*î/{w³ëŽÄ¹Îd®7ïÇïÞ%+œWFF%Ê\ô¯4´‚ Ú<î7|©üdç;'{~FïEÔ•RǶ-9¾+ãj=ð÷t.ÙÞÞ½Sª’_ ýT±o™¬ð(óýõqÌeÿ ƒ1©·GÛ‰Ré$ÌoD9Ÿ7kÞ“Sb“•rtâìž!Ru|×€é?g\ê•“§Ù<ŒÊã `”þˆ“˜s/;Š3hFïÍh4¥ ÛóF{†L7ðÕg–5 §¦¶­ Õ3ˆÆ%oŒa3}þQ#lýë»À€20cŒƒŸw¢°@Ýeÿ®µ·n´ÜÑR¼ùû؃:vt+‰EŸáËH½:L÷äãì—¶;]ÐÚ=,ŽuÁQl:t‡²âïõ #O,åž„\ŒÜe…|ÓùÄ9È‹<å,}T­¢Áñh1UÛòÎgÀT׋]#‡JËîÝž{£þKÛ…‹„R¥YÁºócð¥ÁÒ!ì²Á†ZŒ ‡kš ïQX­Ñ£‘¢ãÂ#‡—º”¥¦5„‘¤ÝBšKŽ_›¡^‡[óiÙ{g:‘)s?ÈkÊÏ=*ó†|£³ÅÜÉocC¤WÏ+¬ÛÞyç×ͺáZœ”åÔ3^Êt™š8™ßa3¸ ¨e ù´Ø¹Å¾«ƒ¥nL¶K,t)µ §ýø|r o»á†º€¦÷ùݱÕ]ö^ù:àªU¡Ö’CmÍ¥”Ç6g—6 ¯Õ@KF= ˜vè#qc•Šë¥EÄö³]8‚Ï2ëÖe/bðbÇ5kÄV±²ç’Sð&çiúŒH¥Þ6líÕr[ §(s¡ÝÏèÁó–+lFýåcFšÊaž¿b›ʨœ\>²ÔÚØ¿¨>;|Äp¥Çiò®%¸H‘'(`aMot™8£$H ‘’‘ÿ ¶ ûY/JHWp:ðȣBZØú3Œ{äký± ‰"ñøK1N¨ËH_*MѧéWýúׇ®K’4uøåöûÓ~ß Ç6º%ÝXbÛ”_´5™zD8ÓõïÏ ¡Áž$qäT×5>щ‰%ͺ¥]Mvêb"¡9Ó£´Vh?üdMÍ  ˜ñ[ÊÆPE£»b–$¨›Z.Þ |Ë»cI ›õŒ„ä¯Zó*oðe~ÏÎ#Ùl2•ä¯åiX+Ïg¿©®b/NŽx2þíLY-Úçµþƒ©Çîè÷ªf"zpE¥o¿þhÆ=dVÞîqœÉR®Pç±ø¹ÅëBWeÍóºÂ0îšår×½ŸØi¨=›ŠìŽíî“t ©6#Óî[Ü#) ã ¯Fâû&¼Þ:WrWÙªƒŸ¬{S2çrO`2m:®%aÒ»’ÒJ±ºlw³„%<óÞcÆ{ÁúIûy?–Bªèl”N@Hä[Ö—Ö‰´Ê—M¶R›²»Í›%o6Û˜r‹” ¡[óÙp‡‰!Gš8WZ/I¸P¡_&½ñáRñÜ¡¨›ºO {=m%Ö¡Z~5ç©÷ü—š¸‹ëzgBÅ&ëð2ÊC>¿ÐSS¡K|‘€˜„·˜Ñ(¤îmÏ™_YW'Ù2AGWM °;Çh5&†<Þõ¢‹ƒ_ø†@n×X)d'§¾ìs…(õ|Íœva.y"ÄH¹o’ç20žãIšY—¾Ç"Ü/Œg›à«üæð5:\Reù‰!@;B”E2:+ªî™µÏ×åüÓ%…ªü vgë"™ËKMáìú…™ÒÆqÉQmÝiЛ)n³a˵r;ž%z7ÐWGm꘨D–E\ƒõHé«Î˜ðÀz[†‘÷r”ÔñHï#Õ­bŸùq„ ç› zÆX†YþuÞ5L]ïFÌA²>y¿çñaë—,·ès“o/ŽÑ}ƒ£о1á–øK[ Â“øvCŠ/ïê·­çô7°NÕÄZ)B5¹tXƒwéIªl¦ØìòÒ÷×aî RÒ†^ÿlúH‡S”ß# daLzÑq‚˜p5Ý}LÝùÒT€ûZêqÃe~³œz¢M{ÀÊÐþ&¦Ó½‚7Y‹,®Ð–o[~Íi4 xnŸ¥[t9qP3tÐ@áþ{JÁéëæÌTÈЧgaÇb“5Ö#'‰Ÿ¯ÌQ%$lXãФmèãÁT=>—lP/šOu5'VÍT7 9 ‚Þûän\/d†¥ùÚÉuÄËïjÍèþûh±¦h†@Ëõ×møfÌ•dFG¨ZJÚ÷¼hd‚thç‡Íí×Ô{ka–Ó‘gôX‘­?N¡óãGÛ^<Þ1ñ˜…›ú[€¿‹1m=5¢~ÙѬӊ§’Z•4Châþ4ewÜíø„wu´0#:ñÞ:JtËtB­DÊ u£¾ÀZy1sz£éâ„«]'Qi¹ƒxÞˆ8I‚•‘¶•”±M߆VVÈࡳ5|!Ò‘¾ø5çàýWiàžNgügŽéD¡RPn?‡Š' e4"´CûÐŽÌ—‡Ìû›¯ˆ¼Jòìyžxê}¬tàt<ÃPÓÕô?Í x¼¾ÙÛoXüè0ýt*•‡Ñ`Æ!e¯íF¥ß*§î¶ŠÞÀìýÜ8kTJr㛥þ‘Á‡ ‰ùû.höÝQ>½#Ö_¡>³t_Äîõº®Yì³uì?¶ŽöÊÕˆ…•4(f]íd~›óéTðòz+`4¨l-öòvwøÐ~u/ í¢oŠnÍIõ=\Û"ªú1”ƒ¢èœÛŠ‡†ØÝÂZ¼½g ¸£Öìj£rwoþª÷Åøc5 –{sÓûúÛÈwjŸÉX›‹‘så&Í"ÂõoL¦ú‹"ƒ§UgŽè+öÚ ½`w¹^é5Zºï'aä®ÄÙ}Š¨ÞV|é‹uBJt&4pÒuÆþIyauž=¦èö!Éö§Î#y3â …´¶~ø >'—2¸MÞ‚ŸaœLé¾ýN%ìþ­õr*¾—!´º°°£ôìö+šõOŠ;//,v­z0©ª#EœÂòmQwèTJ #¨ìQ úTõÇa,@[ÛÝÅR¸§‚D´Ìrƒ;Ö¶6ÔÏ-´¸âz èVÛã'>Ù¹œ¡÷Ã%X% ÉhŽsì# EC¦éÌå‚¢¸×òµ†Í+¾ä'¼Ù"aìr87ݽš€4ѹUïó¨òÛ¯gÓÇMÓ3«‹Ý•ëw&Ê5 ;Ë$Øt%ÐmqµãP5S#ûù¹q_¸obH‚‡Öd])ÝØ”Ji'ðn¸TÏ0†xØA6Þ{¦Uò¦H4‹ékOúÀ …®zDaµ4kèdœ…TÒù`ƒ EŒ°¬W´õÎ}óõÞ‰GÞôˆ–m9ì³&S“ þÀÖrßGyz Ûã3·Ÿƒk6äkæ1b{!S oŸØZ„¯¨Ø2e8 í©÷ ¯æͱOB4 ˆm«C]ò¸Û«—éV—IÉœW;Äá+¯Ôuôp<ÈcSÈ:NàO…ìo¯”\0'|ÅÐÁ;Â]zøíã<ßöÑ16æÉÊ£ÜòÌ»ñ ŸFža'wÊ)•ó¸q‹–=wLkšƒWzçhÙë`7ý¢F†Oµ#íq» ÎsÁÕײu~‚ö±2X/ÂÇé^ßÉ8Â*‚ìïÎ_}ï@’ç’æ’k]ßd:MNáÛó+°ÖsJ¢Ñ™¨žR¼óx<ðmaNáxÐÔ Ôb0ô…?ž„|§àÄÆlx~|ýU÷.‹]á³»„‚{ô®­9®¬GÀô»™Z§¨ý·˜ón ÒTâž#êjqîEô-^XúéÑÏ\£ŽÅÃûßl¢#ûÅónN²[ÂJa~Tº%’ºë7ÓrÆIéU!)ÝBþRªÐj)VEP ¿ qïÊ„r;¼‰é¾îº>{üH£Öø™|6Ñóy>&c߉ïÁw Î2Æ2ãeÊ›šåŸSÙò½$¶/±Æmá7»Œm÷5Ð 0`)TïÖ´BOWÛR]“0uîÄ" Äó&—Ì¿#ü$ââåvÀN ù™L?#Á”æX_"uH»>ý—’Ÿ.yÜéÁ.ÈÊ´jû™ÉñÒo†‰:ùºüÑ—…]L­Š6B ˆÐ‚³w´ÿ‰SÜÔý™m‰íöôº¸Í¬{b³§Jæg8è‰Í;Þéö­TIò0µ§^SF*=àúèd©ÚÏŠ.œ¸¥uÒÍÂ]ê—–)ÊkþÛEë¶ó¯†Mäø õ÷ŽÛ£)Ð*7ÓTÁϤ£vÎ|©5¡EüHžœ²v:ÿ¸úùÙSOèn[q}G´dY(w£ª‹øG3£@×üHô²˜p§Öö·¬: —,W¨²Z«ÈcuR³)¶7ž/žÐú¼å:ú‘U”Ú?º.uogÝ“£6‘EOq¡à×E²Æ=L~5€?@ë5‰vF²Ì'yut’ó)<œø– ²¶áÉàY¯RúfCô.ƒëéÞNŽw:W™‹5žÈšò¥èf¢\ï¦ÐJÀ'Öö‰z•ãÊV¨Émoá­ó›•õéz%á :¾–ÏοM<‡„éÍ}Ò³˜âNx—å(ˆ/÷ˆÙû§½ÈÓÚ?Bª؉è]åùððåu%³8¾Â©ŽL¸™P•\è=À<¾–ô¢P49—Ý×ÝÈ,ócê#´uåhäŠP[»I_’!¶Ûößñœž(í*Í4—¯Nl ˆ ¸R<}0’5]!Í—´ß¶¶2$“.µNk Î×UX_2û\{©¦Û{4–d‚UñR† ÍÅ[v"^¶z„&,CÍXét|±œ!üÝÇF¦~jã>}Æ|¦áýËø<ùjRŠmbݵS6™ò<ëwR¶j sŠž›c»¡–Í»Žj+¦óÊo£'ßÎá}“KÎð¸Ëý6híų̈d"øYås_‰%ñ†’ËÀõwÌ&|'¾ž¦ÁA®¨ô» ^N†Ï24!gœñ´/ë×ÜÎýñ¥¾’û\¨_[š¸‡Ñ«’Jž }”"ó2u"ó½­åÝÁ#”L#/~M8üÓœªÿ)IQµl²A£Î0þwÈs/†]ÝÉ ‚<›ÂQ–bGé6¡Íò2FÆÆ$‚RÉÒˆÅô{í+ÍÞA\Šªåà·üœ¶cŧ‹ŒÒLq%Њi]û¼dz“5P¥œ¸46¼òŽÊ ¦ÀÑ»gÝÂ;Bý›9ì‘™–!Iœ6jëê:Šò¾ïH ~ÛŒc.ð5¡½(VÁÜûíBû¥Amôã¨æÖ'ÉXe’‹U^T¼ÇŒ˜æ.`¼À½Šy…·Q"ñÞW‡Dn²%cO6æÍS˜Ë‡âôÇÓ€ês4U}hùvÒ9s‹ô覙‹ü½Ã°býÙع|¾“xUÒ 4]1ÅmÒ´œg-Þû´žÆÒÍö’ÛòdçA‹ýKdWo­üÞ£Sl%½W&uâÞ\;Ü5æàÑKYùÌð’öJw‡ÄW@º9È>’¸»'/¼º™·6ë¦ ÷Ú‘—­ åOŒ'ƒŠÔ:î^R QíKRé„v§|2sÞämúIcV‡…W/?ϽÊÆp¡/‘$»8q{ã¸Q²ŒÇ1*•Ò…žh^ká:îé’q㕇GI%æÉ®¬’E ôØm$Ó̤p¬£~:Ðœpý³Ÿ^/­ð‡Ïݤ}tcA“Øծ¯}ŽÎ¹þ êÅ„N1Atƒ%ü³íxØ£ÏÞIJH-Ö“®P3øMëê;™ýtTf?"äNm^@L8¤mv3Òü“ aS endstream endobj 565 0 obj << /Type /FontDescriptor /FontName /XPUFLM+CMEX10 /Flags 4 /FontBBox [-24 -2960 1454 772] /Ascent 40 /CapHeight 0 /Descent -600 /ItalicAngle 0 /StemV 47 /XHeight 431 /CharSet (/braceex/braceleftbigg/braceleftbt/braceleftmid/bracelefttp) /FontFile 564 0 R >> endobj 566 0 obj << /Length1 1828 /Length2 11142 /Length3 0 /Length 12296 /Filter /FlateDecode >> stream xÚ÷T”k÷Œ# Ý%ˆÀ€€twww#9ÀCÍCwwH7H H7Ò-]‚t#!‚t|xÎyßãûûÿ×ú¾5k1ϵë¾ö½¯ý¬†RM“YÜb’8À˜ÙYØ’ÊÊòìl66N664-0Ìô;ÈÉ qø#BÒ „=Ù¤€°§@eˆ@ÁÅÀÎ `ç`ç`cp°±ñÿ'â$º‚-Ê,ˆÈFõp[YÞÎùÏ#€ÎœÀÎÏÏËôW:@Üä6:”0kýÓ‰æ@;€&Ä ‚yüO :!k *ÀÊêææÆ´wf8Y‰Ð3ÜÀ0k€Èää ²ün ´ýÓ  @Ëìü·Cb s:O;°9ÈÁù)ÅÅÁäx: )¯P…‚þVú;€ ðÏåØYØÿ[îŸìß…À%ÍÍ!öP ƒØÁ ` ¶Te”X`î0&ÐÁâw ÐÎò”t‚í€fOQdÄÕÀ§ÿéÏÙÜ …9³8ƒí~÷Èú»ÌÓ5K;XHBìíA0g´ßü¤ÀN ó§{÷`ýg¸¶7¯ÿ K°ƒ…åï6,\ ¬Ú`G¼Ô?1O&´mV €›—“r€ÜÍ­Y åýådÿm~êÁÇ ,ŸÚù€-AO_h^Î@WæäòñúÓñ¿`6‡Ì@V`´«?™A–ã§ù;ÝlOòc°ýþü÷ÉèIa;Ãÿ1«²‚¾žŽã?-ÿ×)!qx1sr˜9¸Ùìl\|Þ§Ÿÿ­óßøO÷YÕ€àØýQQÞÁø}Äï.ž®ï?¸þ# ºö†ð¿G¨@ž Ðý«C6n6ó§?ìÿŸ·à¯”ÿâÿ]åÿUÿÿ—‘Œ‹Ý_~º¿þü@{°Ç?O‚v=-‡2äiEþo¨.èïVY€]ìÿ¯W|Zq«'¡3³s±°qým;Ë€ÝAj`˜¹õßbúÏ4žÎ°;€Ô Îàß/ž§,6¶ÿã{Ú=sÛ§—‹óÓÌþvŸö×xcÐÓªý/isˆÅïäà最hO’xBÜ/ö§åµ¹ÿ¥y+‹ö”xêÙ` qBû=h^«ÒoÓ߈Àªò_ô$Víÿ"~^+ð_ôiö/â°šÿqÿFO»üoôïNY-þ€ìVÐÀjùä°ZÿŸh€ÿ€OŒmþ€O´lÿ€O¼ìþ€OTìÿ…Oguø>Ñ€üŸh@ÿíâ©ôI·?x³?1sú>1sþ/äyªæltþƒ:ûWØ¿ð©â“þaÜ û{—!Ç?÷?à!Ï¿àÿÌÜÜÅÉéI-ë“ þƒÿz)ƒ@î s´…9ˆ¹`°MmpÛuµ8©óθÐóã´k=æñBcX¿ô´ÉF‚fvÖ¢b™ÌB»Œ±M§Š„ãuÎêü™×vE½×%3…Ìž…YüÜãå³ÙD¯«WTsØÍpïuS$ÈJœúáÔÈ¢pºPE-¬ú5i°½ßÔö~Mt£%ø ëÒ¦ÒÑUý!K‰è¿Î÷M X‹ÙÖ÷9ñ›ÜMû¸ ­hÈT• *E¡Ž´·*œõÁá¡eÜ>²î¨×ÀêP®´àÐ+).ä*å|¬_¹%®‡x^f²øb‡ýåkô)×µ*§ÖÛ§‡F”tI]¼Ö¦I–Ñìß=oÈp¡ËiNy»‘K9aMƒ"‰WÎ:½é`¹žÕŠM2[…°EÅÙÞ©õ_.Š©òÁtLÊ Â·¿û4дǸZ†Â·¾©NÁÝ–f$Ê¢?ð± Ê ¶Ë^¾¤ ™Õå0àK³nÓ)^ænõ×ÃåäÄt§Ujc±6|D.Ò¿ôòäzÈ?ëè ]t¬ŠrˆÁ‹ö\¯[öÎ(|{ÌÎú¹Þ<½&ZÒÓÍ~ãÒ»Ê}ÃHiÐRäSáÙfÏ}´> Pä”tFdz´FPU,mõ…_„·€û ’W~{@46iƒãDsý}{èyŸPAƒÖ{>/S#Ô™î´âÌïG‡Y`zü)Òšªê¯Àe/Î6z¯ÁÙ8×Â@0äÕÁ˜OԺǻvÙ™PNÚVööaÆ_¢‹Å $P ÚOˆ‹n_?oÉ¢Ÿ©!=Âhû €ÂÂ_ú-ëðœÓŠôåY–0…A‡ Å£Ù#Ä„ðDâ•NáÚí@àrã©.Å üvcvfÏ:ðtòVÆYõ}pR!ͱÇi‹[´Ê§Š9‘ )Ÿ‹”¥ìwýúÉXmGõ5ì6o+ƒ¬>`!u²›u´d)”½M;¬cJÌüè»ÝôƒŽÍ hÙl’Njõàx=®­ÐðÓ¬I4›BòiŸûùàA˜§,çŒÀ»9´~R;.Oý³=³õN2“XU¼§wÊ»d]0Kÿ(}ì`z¦D¨fìš3çD\œm“q´YBƉçH }$„ËDiëÿ9ÞòÝÀø-û1ãÔ"îÌ3ìïº µÃPH–Ô]VyB‡»È°å¼\Ý­…‘–ôe·M†ÆP¤/+ãúö6Ñ # gÅŽoÛSo9Z{ž›™-G©sµ`ÑHÙè/hÁ•_ U„½À-À´uëJðÚ\1ŽayNÑs‚Y/º ÏÓð¢P}fÍ­_è8`ƳÃ#Û2®ˆC" šürõN8üÀ²¥QèÄFñWì µm³Ýå*ɹ=µN:ÿs_PÞÎ [ ÒˆßËå›4­ 5v¯Éü—y±_rd½Ì´ÚGÛ,‘B7ò*¼"”¦iûºÐ†õ²ù·†‹×o¯~4¬‰ˆà/n×kå}‚üÐp˘Ù@ #ϵ£±ž¢F´î‘½ê&&ò¸;jÆò Î ƒí.êåµRñúŸ:‚×-o}ºðv§’è«Cù55fô’=^à e9×sØ$«·mµâÐtaÄig·†¬{‰ÌÆ°æ}¬*•´‡¬í°Ó|ôy]zañÍËšˆK$/ÙØMªøD ¤~nÕ‡p[èO¯‹u6ˆ¢@1Àœ‚¯j$ú[ÄÉ@wwäƒçSTŠæû»&hhç"¿>ÿÒ‚L 2¼ÂoþO¸iøò5 †yMI_çm™Ùw.½ƒQ6—Q"éYÛZÿZJ½þ.¥øŽÆë÷ƒï´S«/3·Êav·Zr¯†¦<2û@Ú¿œCÄ—³"!!œãÞF€*£ôí]RÏ–€•JÚä—I²_´ÙÅBYXùá§äŸLÈx&QwøkeU„G°›·äqw\Ï#Cõ@«uó© ”“c­c ¹]2K¶M¬ú¥_ãqŸl´©ü‘ê^P«Ùž†`èÑ@ïðB´5Gg/P¡‘„ü‰‘bˆÔ’g@乬"ãܶx߉¯„ÕÝòUx‰¸…¿&HžgÊ×6!RR}×08üBE²rWSùò øø æ¢H2îÀÄUøÆÎON†y›×º½ÙR|{QÔ§3Þ§9”M2‘kã‘Í/÷•MüÐ,ÔSä©zõ‡è¾Ùk8îá_('øZÎá ð3¥”óÔm¾0a¿-˜ñu :,}¥Éô\”=N4ýlN|¶ÍÃŽ.pKéYËìS±v<Þï{¨]$åöbÓ DwñZüñKÒ-ðEºªVÌ‹)sÝÑØÕrûÐ]b, 9Š¡gá}ëô y°´Îs¯löˆ3öÑ ­šd¥ûin]EoOÿé³­ÔïÅFr¡„Å~ˆŽp¥ççb—Öœ‚oÛ®AmGÃÃNÓ{×¼¨ƒS6†²ŽnYæ%Ë7|}fØ^zÚ~uE-‡gö—Ÿï‚‹àÂЄ4y`ì v}+¦ŸÌ2v#ár[á䉦ÈLè³ß¦ŸÍš€p¤±4a˜EÚæÜßÇ$7Ä¢!ýÜ8ƒîJRcâi‘~÷ý*Åd“(¥¨£,Ë÷])º”ÀQ‡¼ÚŹ¬%ðrLÙÄTi´3fïB[LÐæ-‹Ó*J5ù™´A)3ÂÇû¦ïX{A<ÛSvâœ*Ÿc¬OSI”¡+Á³FÆh– ºÌ­ÎÓúË’æL³»ð°9› %œ'{g´&ÒÕq宕ÐíŸHÔÞ3ãÚ¶}jÉH±-Ú8¿û¤H^iµ"¶jR(þfw¾ëmëL µÕ~VÊ¡"¦+ê;rRyŽ¤·œ(~Ïg/î¹pñ- Ñ¢CEj;Ý—i*áCt­í2•°™DR¶Ë?Qe2·:¶oÍ[ ˆüƒ§K|íjvÐÔt»ÃF€þÜÛº8ÿÇíb†[Rïg»‰‹ï„†vÔ¢©¡6þ]ûn½°Fð‡Upe¡BÙlNÓ¯Y@»vQÿȉóž~k¶MˆO>šaLNòùxø†<MjcðiÕ êÛÂHGø(ô¾Š´ã`âÞ»‡Å+Õ¼:Ìîš-¶ œ®„hÑO%ñÇØ«æW o› ÔÚŸ8Àìzjé²¹{8úµ«…œÏ?ÂÖ4vÀ™vÔl4÷’éþüûßLÆ™?ùØú*M‰};ú؃9"+Üg\nýõ€Þ¶*³ŒÊg6óîZÌÙøŵ»ì#Ë»PìCbÕ«ÐŒ·Q?lª¶d´–Û&1™¨ÇA/5–ªo-“ê ¿Úû›Û²CjwýPÂFw×ý»¥ÂÌŽ£˜$+ÏziCïõðå 2fÓÚ —{??nÞi€ ¦® ­N/ ¢ß'f+«²,¿HŽ"Քεè>¿„†ÎžÙ"å‰çQàÐ-)o“Ìãb£â\.ÇTL}QM®±[™˜ô~uþÁØ“[::€Ä“ú!pÄüh•mÄV3×.~o]âäŒÒnú\a,ñÁ6ª­eTVÚz–vO”0(P€¿^Ijšœ½%ÆE™1SJj¥iÀпc{vV½yÉÐ}¥-Ê,=õr'$òIËls¥“{»ª©óW;GR‡HùwEwGÎÞ¢õÏ&°²ŠÌýøIï)Ýyšp¶‚Qá]éwbU­I,ÇÆëNuE¹tdr"A{‹j£+u³‚UW_çßûØëfí3ÿlPÞ÷t6u6ó‰Ï‰^¸ïun#0Itnc…OÍÙ’ ï ÆVMî)Oµûµjm(kjöìHÎW˜ÑDM·z:d¬Í‰_å˜Q?{q¼u&ùœªüѵ3ªùÂæ.F4-÷vyDœl¦i—›åƒ³@‡Ñ © GeH{­¨]g}­9ÞöœZÑÕ9%¥`é€Æû•õ%ëà;3¡ÐäÄå{Û;Ö¯5¤ý©$Hæx~pÜØÂÖ÷">YÜèxÛçÃ&åŸ3É·÷=Ôæšþ‡¤Ü”e 9­lÉ‘›‹b!”)¾ÛR¨3¯ù1üÞŸÖ?ž9#’åT [Ižä¿«X½Ù;œ÷DŒ11Jlsò}ú?\.±*‚ö ½÷lG²”WÖ*¶%íæ3©ö„0?õòÏÁCbêL†&žw·CÖNØ”A¨ ‚{#XþÓºý,,|¯dؤÓ6ÆQá WÅØ·‹bÜÁÕ‘:eŽïF›«Ê“*pæ ß¬ Už¹y­Íf-;s8ÚÿxÍaùZ¤Øx{)èuq¡ÕˆڕÛW¢’<‹³ŽÔa{¸Þg±îÞ-o--<T^d”`äÐJèòÁlý!xw”ɱBRù³( 1ýá ßµ:íK‚¹Ë½G‹¶F€í:BüÓ/’†áÒò±€ÎÐ`ï6=µÙ<ö~º}ÏÕ©{/×öØ^CîèÏ s8©ôšÑ— è&‚0ÛÙUæÌì.2š’’Æç2nŽÓI0®WŽj_>CWÍ¥« uþlYCC·|—Z’£â }žÆ DW<ö­Ž0Û:ç¤v‘>SßOJE¡;”¬³©înº][ß¹áp& Ëo\»¯· •MSÑŒ4à˜ýÕ:ï„Ǻ²ÅûE2ÖXR"o#j¯š@xÅ)~Ê4å” Ëα‚ŽÃh¥3]Dš­¸—ÄVGö]´dÊžrõÝ8&í‹€×TÍWó‘BXqåQTúfW‘43“¶Žñ,¢ÀÉš•Ú`>šÕ}ÊÙw¸©¯ýþ£cÐóxÓ<'@é•8zE¢6ßÀ`?$žêŒñêSºèÒζÄLÌAñlTPã]´CNB‡ÇDhQðB£ù§=Åý¯Š:ZA¯Ëù^nDç$C¥:܆³s¦ˆ¤ÍñÐs{?ö Ë_ìG”( šž|NÒ£×p?^MØGèsGåžbY´þð¥UJŽä wmÞ¼Á·»…H¡c+´ù8 HÀ‘h`ÈÚCq¥þAFPHÿ1w2ä—o¯÷iyÓê,.þ¹«Sç}1EÕ±xŸÙAÛ`AýݶÝG;Ïs¶  ¯ó·D)5I.EÃÆ•Ó]Qé×?5¦¯’©6l_¯äž'ˆiæÝz+ Ó?žË"’"ø0%M»j‹J Ñû¤fÞþHþt’ðqsu_vr·;ñ9\S†õž¼òå†G\«2™wuSçë\aSž—Ï៿ƒaâóÙ“ƒó÷„Ìn’³r[ž¡må‡3’ cf"Ê.ùùyòáðj:AiCk©#l/¶ÇĶPŠÓ¢€Êþá=)/^ׂ¼ïÒÎͪ6ÉÓÑ1`Ja|S5l©ÃáÞ3ªäôkŽ“;82É0ÔÕ\øa÷Ú¢ÖþçQ‹˜_‹Mvû…qîS«¦UùwBÅ}F‰ß¢oxc3 »›Dw—k?ÿ×µöžG%ÌFbq‹O4D4øÛŽÔóO1pï^Äž{H%-t"Û뛼N0‹>¦x»ÑãÊ›®cWô‚@oà€s;3‹B¶”ŠsH\Œv×C¬ýˆhs& )¾+Âz›z‰îŽž|vÁ8JÄÀÛx,7ar­.tNÌîê¬êߤõ¬nÉö wª…žómŠ\lM…­.”wÇÑCcZh|Ã]øœ9Ë5ñ—ìOµ~ËOóôÙóª fz0üO{¹5ºJ)[ºVQ¥ÏœÆ…Yk°;iÙe´|¤~¶q¾_+ѤyE«ÜìS /Y˜„jv³Õ\È*îF¨X€vÕxUñ. µ@šg›ÌN×)L‰ëáZyØ䥑Vxºï›4×*²;Qu4›õÉœÂ$¿nô4oæjs%Äàóz-DÜÜž¾C¸¸ðY¤J·/Cyg‹*dßväJD׬Ev7£0ÐŽhñ–óùú…Å¿N›^è´Kîᣠl¤¨íoo¶V¸k*îÎ{•Ogóh¶Ã@$ì ‹&e2ŸNdÃëg³k:®®sÒiuƒû8È>tõž‚"N†$è4•ùCïRÝ ®Ÿ'„;h¨h¹¼Îâ#Ž´_âÝ0m/AàW¤’Âk?¥Q¶úæ/[‹š¦’p¼Ž ­ŒB¢!³"t(VÛ´:] ÓÒU5 }5}ÂÅ¢êNížàþ ÷gìµ^3IÞÇ+>EY“lu”ssÏbÝ “Ñ°À ’nã)bªb][ç¯9-D·o¥ÎŽaZ;¬yœN•itõ#ûÚÒ߶¬Ê ”,D¢#Âà‘31Åî8¿þÐTà{_@ôÆ q¿x E[t•~{VÃŒfênÝ䟶'Ƀ¹Õ7èKŸ†ªš€V^:¨çÆ=ÆJ5²ám›þDBÍJ¼ªPÞ!‹Þ¼žH>xÑóŠMùòÚ:¥µOÓwºóŒY#N¤ˆaüuúÃ÷!îp붽ãVoyn—nSuµ‚«¹@zÓŸ¥©êêƒût¿¯¸¹‰“ëŒK‚Vƒ ”ת ád(ܲ ¦¢c2Ê0×{ý¾ŒZmÅ@»,×àà:¸ر->¶¼;Rì;Ä3PBóhvD­—èj¤î{C>̳O©{¸Ž6+MØ8 ßrÌsÍt'¯ÕMó0ö#ñ™\ ܲû¨cncDlG»´ö^¦wE ¥GµpŸúõP$ ¥”À¸(\¸zxd ñV¦²{âýÐ •‰Rê­è« <†[°9¶c#^wºï­\PôJ5¾6†W,ˆ®Üd9Î#fB±uFJê¡lÇ ×ŠGÉóŒMb" æEHÙLÜÞƒ$I% 6bÊû»aœã)C_ FBj×^HŠTQú¢UèʃGÀÍAÞÉÛ!7‘^„=å}5yi²É·µk”w-¡ìõ›ÓÐŽ––g²ùÒ?P4&tG’GË^ª`Š#¾Ýœr ¹ÙÜ¢ü 9j&ú^H•¤w/3ÝË|}JŸ‡Hm¬µQã Žh”ˆ#r? ãªZŒI:ù<>rL€x —‘fɳ gæo4 åÞµLó3ŽÓ„Jˆ˜~×Q•4rïµ<ùHù";…ͽÐulvNM%ˇgéÞƒìBÇ^ ÷;Hzþº 6ŒVFJ›d¢`¡[6šKÄ-qÀývEÿBGßœ„c ÏÕÕr, Î#JFÉ*È3 ì+,¬•¥ä;鬬R­šå åû¡ýzøÃç¯Ðtü)qñUoÐîŠó¬ß¹èmâxµCÔ‘L”íOµÕŒ¥_èá¥ð  mës5ZŒüÒélÞê\§5Ò1<«Ààu1tHåÙ؃Íjµ…wPš{4ê$øPGÄbÆ¡~ a‰ŒáÿÆ·üáb¦¯qƒíÜ/(È$M}zCv"‚ÒFhÄùfë!qâ¦h_É,UðÌêzFèŒ_ 9æ±Ñúúõg”BK»è„Æ7cvÛĆ£ÅqTTó!w™ïýûW­%°FVet Щ¦á ×Z`¯ê Ì>&$Ÿëb65ó/m^µÇ¤ YxûƒÿL³VjE×åëÜ}n§€e6š‰' ¿–ø/ªè¥0Ð;õ›ï§ Ùë_µ–ª‘Ò‘F.<µ×iXܾ ¶zhwjŒ:'{§›Î<îøùxóï̬3îç>S«ÊÒb©¹ É™/$øt{V¼a«‡mÖê¼"7î_Ÿ7bÐòÒOðcH–6ÛY¦ÞÔ½/(m}f…_Ã…þþ 8jw…ŽïÃÌÇbƒ£ŸÄÈŠ #¸ÅÇFó´ª{á­¡òø„#‰Å «ÒÞÝÿkÈ7¾‰LÐ ìò1ݧý ø9p]4\C%–i!éÿ”Š‚QE°”·šÒ™™`Àd˜;FîͯÄ×=ɳ$0ÅÌýÅÞFHà›Cù:ù©ª ’#wôñšF„øA{ÚXØcÆ(¸5ëUçÚvm^ö´õ•]Y=|œ¹D:n{¬a•ëß‘¸\s‘5ÉË«ó—b¡˜åê.~C–ÌUEâƒ7˜Fohëß4>ž¾€÷7“¼‹ÎO¡¯Ðz[\˜‚'(¹Š+¥£¢òíUÚ6# ÿåâXx¥Šñ)b.cr!HÐÔ5½aP-³ëë÷Sƒ”'Má‚€¾@?¸Œ8_ÎO¸Ø`f“…œbrDïökwãƒådWHëbåÙGy «tø^žU\ ‡$š—…w‚o’2Žx‚µsÊÚÞ'²v³ª³µ*Å~šÈ1BÁ~°«ÏØ)Ûø–Ë“OË@Ý¿`·-TZüŽ|žŽVìv·sw”¼n¨\›Žç–õRÚ•Z_9¡]ëy£G¬“Ò×÷ô5ñL¯hGó–á½YÏX#„s×ûï-|é©qgEÕx°zúÃ] Ëëæ±ü…ÞnÑô¨:” .ýhïÝïÙúùâ×}eÐðˆžz½c~(3¯3©)¯Ã/Ùß0 aµdsïìp#éW!–&[ûjÎ3¢u.h>ªRujåÇOµ«˜û†ÞDðÖXkuqØmï‡o3ãVp“ž·[AÉ fWÄ©GÚé0¢¢6÷â²ÝÞäÜ~®díôãÃ+è;Û4Ä(vBAø$%JÇßô|1¹?²Êbݱ¶{ 56Çé÷3w¢ãT9yþ|ï–›,»k\¶ €Ûô‹õ¼…h¦ ŠŒÔcH+bwŽ?Ý#Cï'yï±~;è+Þâ»dºÃÌ/áwx«¾]Œòš#d¯FüÕÏU …_ÕÅ7fì#øa.‘ ZHöž‹¦ÍC—O4/"Ò¬2k´/·=›²y¤ TpŒ0+ÝJ §9u²; À¤X†Pl¯È:ž÷¸ó Ócæó!ép/¼ y‰ÉÂËl€/.ìxa ÷Ç›Ûu¤÷¡‰ûF*ÌVÆbÌÞÖ?¢õ¸ôM–Bý^*ŠšÌ€cdr{^Öà—kvÎòSTnäwMŸÎá¾|צ;ÓFc™¼~ßšE[R¯D6_Þ(J·_…±6¡êTæ y/Š‹9[<ªß[ê(¸= üÜrýð£)yp@Ó¨üÝ.yÚ7H†ÁÑOÛÔNSÖã´@s_ %R»v°÷v÷#|wI ܉FÕ–«Çëý¾ÃÜý¼1 `úˆ® —UÓ»šÜLfºB¤Îg§Éõ¦NpÄÃSxS¢·Â¬<•h¸A.Ñš_Í„”ˆešÄjȸ£Úœ¶’³š2¢Ûoo=R—žév$ʶ³”³»ÄÜÊ–³õ˜þ| Ü7 jÄ^H zÞ+4L’íš]•ý©¢´ã¤ËDÖzvW3ùv—zÌçÚ¾OtªãEŒ‡†µŒ!¥€JùË•ýâ¢ÒeÖó`ÛS#‚” YÖ˜–Áq-‚’2õ˜ó7)IXÁ·Û~Þ¼Óx &׆JQz´ý!e\2G–S<— Üg¦?†‹«¥—ÌÂ?ô’ „Nî´ ï]OO²N½ß”ŽóvŽíÒjü\l\5&|Þ»˜vëMERq­{gd§L€6¾<¢»ë·Í·£ª°"1—(DÄ3iRD)˜( Z¥¾†âI? &š?SAóTó‚ÝÆÏÝõ.Šwó×™¶¼Æø*rnP³cYZËÏLÞ±ÄUö‚ïo&/^c&ñ¯ÑXÔ†g¹WB‡rjÁvû*ê™ëîŠ×ÍJ€@\å ]Ü97ûÑY0J:å#{SÎ…ëOŠÅpØ£ ß %ÞD £/Y©Xl>%E“–»%Zxö{j ÑnÌäÌ¢ÇÀ‚¥Cˆ´ÍÒ½J/œ6¨)â×ÇoÂÑø’]¼"“\Uú›Œwüˆ§«ï·?+-ÿXþ¼dôµ;†{ãd[Ö)ŽŽ>s½å2‹‚LÙ©xð‰é§€{ëEòÞžA÷Ä­á~’¢­çñùè+™B}gM¼­Û¥UÞ”ÙõLÃƯ/B¼R䎿Ð4Ïù=²¬$¯Á#˜N{;¤ýºèÖ³XáÊ+ܧH¶£B…È—Ðí¦³'/šà¾ÀWa%ô ºB\Ð5 tÁ• [a¶Û[è‚­J< Näˆw VS—ü“Ô÷[‰Äöt&îkÐÆáѽnEµv}¹ËïŽ"ày{MfkCH¼+›hæ6Ê™½©´¢i²k{ìöMß‘!¦6"¤ÁL#yuvÏ–(ý½\ûgë”ONÅ„Áø«'íE/˜‰x(VÛÙÝ(Sn‚]á…ÞF~aJŒ¹®‹d¿ÕS®*¢UÒrE¾¿‡Úö,¡ò&eèü$ ¬ÐG…1«âî+ÝÅ ²ýʲ|ì^ÌêŸQk_¢âÔª1©]¨7¬å±.r±¢6Go|ËÕXãjþu4p#6ä=Ý7Æ#Ý€Y_qÛœpIÖÐYzª¹%E#Ooür¡bdCMRç"šüýk;r®M½Ú„µSœµò ¦%Ä“sH÷‘Î^JÞ!ÍÑš¯Ÿ ‹‡2s«Vm¡Á5|ûß2(cC¢#þ~“룆‡%׺‘­¢¢·™ë…‡Ž‰º Ó6$?[U\Oª$Ý.æ‘á?LÝ1˜Ü`*¨­Ø„‹ §\_"P(ãh /Õ‡4Ðóé>º-©8JŸé ¶Ø¯¹NŽ·\“(³€*æiçrÑ!~Ð_,ç*-n‹Œq(%‹µÚü’¬‘Ûú5Õ³A>Ùl¾%Á/*a¡ÑƬƒÕ¯ÌÕq°ÃÙO^rÅŒ­˜â͇)Ý´Õ9©…§¿h2}¥çS6Òþ˜ßŽÛ´ù5Ú\)ðç³'8ÍÓTÞ{,œ±]äLj¼Ù}¥9'8ÊI…}úýúWŒ”µ\ˆýã ‚4Ö¼xâ>Î}áVsš‰A‚Gÿ­¯ÝBözÝ8ê…0‹Èv$ÖtŸý‰ÎmúÄáKÂNÉ-sZ-«²± Å°7! å˜ý™½…{Õó…™9ìž¡w•<éÚØ—8ÖÖ¼8€ÊÛq{ ¸xÐ×;¼$3yHþ à êµ$âMt«äô6›¬Óé…àR1øÖYðX°„95ý,ÔÞ)@Ù»ÇË +fáõ\ÕÌW2ÌžVr¬…U‘pÈ¥&.ò£sà‘Ïú¾ReO‹RЮfAÇ›zÎmáo…dhl=Øõ#ûôb|—+Ó«©×Àbý(I»gñK(-…â<ýó [†Ÿ“{¹3wžkîÀmRSßV©^ÿG¡¾ [–vn«1„nËxæ3§Wܦ‚qÃã(ÉQ×üoz oˆù¸ÓGqÜeÖ{ˆô4“‹ÖbˆÖ )–×––H‚”7a#n[1¨Ý¶™JK+cXÕ òÓÊ3u‹—£ê“M6~'*¤E #kvà¢gÑYèWƒWÌÉ7³3­qЗŽ“Ó¸é[½÷ÎˬE³ Ô°â—}åöÅ72Bk g-Šã»X¸D W=”E±'gmòf²×¹l„iéDË«mf8w¦ÔmWo+(*¥7^*¸çëáŽ0u*B*8ú˜æÔ((R8‹E̽h»Æû­Sdm|’y^¿]HaêÌ}s”#’C~:Ù¸qH2i†â—ÿJ¡±³¬z.øùmĤ„¸_ô¯LH]R€97VY VYàü=%½rÛ7ÞŸr„¯èoßõZÚÿ”.ykhÊKÑ`æÈãÖαÚ|ÆÙHÿ0<ÞþÉhÐý©ÆK«`È^5ê¨åà|%œç¤Ã$wkÍ7Me_ÁÙ)â’Vs`œ÷qßj¾H:^~9 "þà:€‹ݶ¼£8Ù£Ú ŽÐ(>»ü¸§>÷m®”OrTG\ì=îÙÏ«;n*1†ˆ×¥Éwqo&y‡m,kòùDÝtñ™{ö ñ‹/š]÷«_ˆ[¦'æÅLÛ‘¹Uk¡ÒÅ5r~#áÞaÏǶA‘Áâîë ]}ƒ­,ÄA}eÍùm’+ÔxÇŸ²QOWbj´‰e:0fyÓWµ^ÏC¸ÖǹdÙ5¿ÛmöÜ?š…—^ªýVç-s^[hב&ò‡ä¾RIÇéz2£ZðÇá4ªΨ• tËlž·nly'º€°z\S’c…æÛ¥”xCÑÙAÂòf´÷‘As6NßN*ÈKµV”¸LÐ÷ÖÂ>\9MõUÜ‘ì·¾Qõ¼7%^r­-Ãùr÷IÁ}‚@Qéá‹eúA§&»ö¨ˆÀúæs¡F¡ñ}&Ÿè¨—ñ8¥&m<„&qYAq^Ho¼~Χðs9©ia1êØfêèðg«l]QUìÌhfîó˜Dàï(òÌ>ò[´Ý)Y|•~ó¢˜Nž·Y%õøcøV~2\ñÒ±ºYb}¿Ê¼ºó³ÒÁ× TÒ’Ç…ù°C]ÊÌ ßrx÷YŸ=_s§óžÑ{Jö=#PÄ5Y)‘±÷æ8}_[°þ="9ӯ߭ToAÜ·ƒD?ÔšoõúhÖM3ìV¸?íô”kƒõ«“‹“.DZÆ8 §HD²ÛdÝÒä;”øPÕ…=UR:\³ï(¢Ù>?›áð 0äÓ§®WÊCÉÞLŠŒ•âÈ»—ÑøÕË÷> endobj 568 0 obj << /Length1 1420 /Length2 5888 /Length3 0 /Length 6852 /Filter /FlateDecode >> stream xÚuT“kÓ-("DAŠJ‡Ð”¡7iR¤wAš„$$AH ¤7Þ{•"M8€4AŠ(H‘^Dzïˆáå|ç?ß½kÝ»²VòÎÌž™g?³ç '«ž!¿"mSE£pü !ià}mmu0PHHD@HHÀÉi„ÄÙÃþö8Â0X$%ý¿÷100ïSãð@m4 ¨ál‰AâÒ i!! °Ôß@4F¨ vABÚ@ 4 †pÞG;ºcpßçïG „’’’àû•Tt€a0 ¨ Æ!`øŽ°=Ð AÂpîÿ*Á%‹Àá¥]]]ÀX4.ÇÍtEâ@†qA?)uÀ°?Ôœ@#û;`ˆ¶Å¹‚10 Þa„ÀPX|Š3 Ãñ݆êZ@]Gê7Xë7€øçr€ ÐÊýÉþY‰ú• †@ÐŽ`”;Ú"ía@]U-œŽFAÁöX4>ìFÚƒmð€_GUõ`<Ã?ü° Ò‡À"írüYÍ*(è}´ƒ …Ã~žO‰Að÷î.øg¸OPhW”çß–-µýIêì(hŒB:9ÃÔ•ÿ`ð.À?>8 ’”‘Âœ€07Bðg#wGد è§ÏÁÛÓí´ÅÓ€y#maø€'ìâ0Î0oÏÿø·€P$´Á‘(À?Õñn˜ío? Ò h.„—(ôóóŸ'K¼Â h”½û?ð_#TÓSÔ12åýCù?A%%´Г_ä‚„„Åøï×ùÏ üÍþ—WŒüs:¡*ª£lÑø:¿Yà¯ïo&.¤Áõgo¸ÿn¡ƒÆ äúGÿBbBüèÿ{ ~¥üßÄÿ³ÊÿSÿÿ}"Ug{û_q®ß€ÿ#v@Ú»ÿAàíŒÃ/‡6¿"¨ÿ†šÀ~o´6 Štvøï¨:Œ_E/t~¨€èo?«ŠtƒAõ8â·˜þž¾‡=ÓCc‘?_<ø,!¡ÿŠáwòÿrÁâgö;Æâ÷k¼?m~Õþ} ý¹“Âbâ@0và%·Ä€ž üòBan¿4@¡qø ž³7Ðü´˜$PÐ?4ô§ð¯Úg ßü—(ðÿ¶-? æƒÆGЙ@»ªÀÆïŠ ®ü‹}²W¶“¾› ó÷åY‘à:T1LO›Ð,VRµ²kÑQrúž13ºï¹PÍòÚ]ô?‹ê œÅæÅÈÅ7ÂϱžGŒl#7ê²M”˜¥ 1zLá­¤òPx‡!ç ¯»Uíc±®wn©Jh5ê4·V¥iÝf”z¸1g€«·é6Z; ½›9ç0ÿÜ",Q'…MS¶ùãZN1ÛÕÓ=EùŽém¸Ÿ†‹ÿâG0ŽRE¦›QYôjùéò³ÌB—õ*O5êû· µ³Y hÝ÷sâê·i-ÎدšÚ¥…!bë´7šrR–óhßÄc±¶ÉÄÌÏl!ðgžPÙiUßæúÑžAš£ñ+³= ö×Zûßp¥±{!J‹ö|ž~P4 ·Kz1ã0É‚Pg¿£âq…];ªW%ʺetäí%5I#Çce8ZÿªhgXY46Uoë·<>[TW_€©ìŸt%àÆ‹ NϤûJ$Þ`¥â®ÆÅÇÑÌmEy ZÕÊÇF!H3Ò®‘ `éB¿/­íI8¹à(®+¹/YX6©Yì'³]¸u-¨Ê£—ø´¹¿½7Ò|ý{²d•Ñ¡b¨¨mù’u}F^ï ]mæÞ¤f¸ù=ŽQR­†‚;k§ÃðäáÅÀÀ;â·îÈíל(s¥zÇH2=‚®tóe›œÅ+asþb›hGKU¨>üXÏz|«ß´Ös‰Õ îUær0òôot‰¡,ûXÙ‘¥HºT3™îJp)¥+3YÐæu„-Ì–Ñü!^båJO"¥Rƒ©Ü0^ï'÷‰(¿Ôd¸‘X ©"Øúåæê6•z¢LÔhf,A6×òüÐKüÕ¢Ê1¨s¾Ë’iœåîÉ7}gä+<†™ 8(ÛdMïǬMìõò0:&Íjà„92º%õbŽþ<®ð¶.¶ô`ª¢ îsúó¢‰Ðä ¢â«Ff/÷cæWæ2O›ÏâïL ¡µr.Ã% %÷èÆt¤Û7Ùwd¾œÝ ½:6JÖú>×–I.E¬éà×Kêª6O·aô™¤¡(…iGeK˜¡‡¾ŒwJ-cThvk0íz 3a‘(.÷zY™ÔÛbyßIuE´ôþ#ÊK—-ìšÃ§‡+=©UÊ×'Øeœô¬’0“íæ¦LI5ŽµøMä?Ù}óh‡ªŒ÷2 qµñŽËvzjªÊKŠ X‰€òpŠ+NÖ?kEsr—™© Ò¤Î>«¸ûnÝîZ=©÷I –>ÕamÒ÷t˜kÃ&*™ `ªcDü+Yâ׆ÐÔr$qãðO´ð'‚OHtšÅè™/õš8&áK¯ú. ¸^ðŠÛÔm·1vTìúô¾Ïè5/åÏYkyÑ_ØôI“µ¢ ZÞ–døŤ¯úÌéB1¸ªO$$–šFy“ä²pq¦ü|GÏoWÌ‘ XZfæ}Xs¿¹öÝ`g\Æ©ö¹~„㙄ËÉðÚ󦦚s=O÷*µºšÛjin½øXl²ïæÆîå;DÕa×<&srëR×£D!uÆy©ûíNt×ÁdºAZÛ†Ž¹‚t¶ð² -½Ï ›—ÄJà²æ-ËÄž)FDÿ…–œÒE§Ò©²8<}ÊôÉ›”UD>OƒR7Ônlx*:ë]ºL¦j®˜Š&ɇàq_Upqì ÷‹Ô­›KGO-©kä®èî,Œ©Š®•pÖïÿBt¥ _PrdQ[dØŽèj†€'”¬½—€ûÿØí|¼±TëBz°Pm´‹H…£².j6rú˜8§Ÿè ùƒžP€Ä÷>[«¬ìOÊ¥•·N¸¿‘¸n„¹|CäÆ-ë ‹Úü¨‘žÎʃ ò ïK=ðNsW¾³IŸ{¦ŽææûZ¡>ŸáyBúHAXŽ¥ÔOÙ5$õšåCåiô!ä‘äã{Ñêwy¦gà1ߦÍê-ê?âVß3ªv²vôÌ'ÑÐMŽ‹kHù TйÇ;бûMjàä=†Ý{'ås`™{kç#µRls߯‡°W™s7ð`1m“øBËpXäÁ'z{±4 ÓDt»BÚî¥^Œ›Yz”㧘c¥¹¿*ZZHïc :½¿˜­†Ah ³Ã(fŒ“vOGnP%¿$Vµÿ*xàpý¦™Ø$IM g{_Aì-ÙƒÙu;µ„ -M­ªc—ƒÉGÞ«}ËTOUèzG=&Ý÷Ï Ùw¾0äße4Êò¥C\J9.t ØvZŠØ´f©Ph7N:] ¢h æŠ1 07sÊ÷š×’.芩/K¯»ëYh§®ù놮[ Y(\ü^ª3)ñrîɸ¾B眂‘&C…}rÃRЇ‘—ñg î‡èj8¡ôN™Ê6Bh¤bV}ãÙ&ߺÄ{ÖÜÇ Ü¯„Æí'\ØŒ…#¯­IÌžÛPJ?Ýçæ׆¶aN–_Þ ÷.XÝÕ.æ)S»ÓhñÞ~†ÚËç!Ë´øBŠËÞbÕŒ=¤ L_ÎËä‹æl.ÞA¾Ö`äŽúqΗ­ kRP6t–è6ûTü| “õ–%.Œy»¡}D_¡²1”¿ÒÂÚž0Wz)hžÃ¦àÛkÀ³¡žù[}é ú&ÁyA2Eº®J±¨¢ÀöŒriQU«v•GcÔŸ±ƒH :«…Èaã×Ô:uFñ­°—;ë Ïgxqeùöx ÄD´†P¾NŸnZeÇÇË„œ ‚ÞÇ‘¨æ<9²‹^´Ú¡Ð¡Ù[–0Ûž¸Î#Fâ„Ó¯pˆêA¶*NÕÝæÒˆo#Î"4xP€+kŠ†–ñˆÀ¦Á‘Ç%³i…k±‘b®ÇTñ÷=Þ”ú,I³8«N •ìƒ·0ýÝf录:-ÈBQ½Ÿ‰ãïb «ņÑ!¿“Œ”ê:¹$ÒM,n¹ Ò:DÃSYgëþù¥R~^`‰âê¢ä Es¶¸]\ —nþn"1o¾ÿÐ-"‰"÷¡ÜÈŸ—(±÷ x³s•ø˜‹)øõ1%úÒÕ=Ï¿(¾á  bþÅË/:ö=µa [¢FìÑCo#I#͹hÚ ìW½¨êk·n!ÜXÏÊž¹=•ÿÁ¦§vS7@ÅËÝã…f¿RÆi‘þ&Gb¤áجgÁÆ^‡TðÊâÙ°B9qõº¬#î‹U=»“ÉŒõmbƒ0¥zn%ö1Ɖþ·äè‘Ð{V?¾0¥ï‚AdÛ7 Ô–üÓ’J)ôïn‘O?Ó DB±êµIäp›Wô/{Ül)åvp‚ôßÄeÂÞ„e;ó÷r]°¿Pø|›>8#4(ã­võ#†ÎÜÁ®x@ ÓåáNõ7K‡{†åÌëqæ>\’óOî$5(ó#mÒüÎH9ëLt’ÓêÇË(Î’–ŠˆÐsŠh2Føš$d®”VÙ•øxãÊð}I‹„ c ZabyM›W…pº¬ªÓ³!˜ˆô[d`‘¸ÞIJøºUÙΪºoá2aÑÆÇÊ©Ûû«^$Ç `ìÍ¢kƒO±meâ›LºѶ¶›öû- 1ÍêÚ™n‘í¹¦b²ÖþM@nõK¹6Ù+!nëã&ü£!ë윥š«etå%¤…W‘w]¶ º•<=ßê9~%ÕVzÒNvbܼ+»ã’ómû²ûÉîydƆÇÈË«wø™y“&9o|VGrgmN²å°Ñ&ƒ¥!³ìZ±&Á$Ìþû‘ê{‚凮Û)oîXMˆ§žtÒx‡†KécdÇ-ÔTž‡˜®w<º´×øtM%ývš©W§²,¸l½bô AïªÁÌRC8³(µN›WÃæ CÓºDÿ,|XÎa¸`k|¥¿øõŽ@2ùp3Aʘoè›go›®GÒû——Z«ÔöJó9‡›ø™eDõ׌û¯K6ÎSñëYiï¯Â.ÞV–ù:´—‚ ®t.^Æ üà?bdgµmÚ'¦ˆ˜%ø6Z´Ùxyr»X`þéIˆõ ¿=ås:.K;¢i§|Êö ú ”Ÿ ­Âû Kò¶­1CËQ»ñ”œ¼TéYå³7SbBÆUBaz’;ES˜M ¬‰÷W®IftUó& OÌÖv¯Mò™Öh/\/«ofñ¥/ðæáµ)Où } «bßtù\zA/¶ëù†JÖ`ÜĪa¡‰8öè À•™Ðûö˜1ðy[-,UL%:Tñƒµ^Ê¿é“ Â“à„JÇQî¤%®¹§LîlC‹ùcôi;^Øæ¶Üüb>“×Í &qWÌ"þRC‰°ç@SzÖ¶Gæ.èYU„O˜Zð*ÝÍB¹v²y+ÈòûŽÓ"}øÖŠ_¹¿VLØé‚r+N©å¶fC6†š¼·–LZ´ù'[4VS<Ë-?æ»fæ Èú–$Ω@.SŽWœ (-oˆ‰Ä$X],½ePÍ^˜lÄ›¯¨ú±‡*æ¯*]Ás7&žæaÚm°¿Qä³ò"üL|Ãþ ~‘ª ~i²s¢Ö^×­¬ðœÎ䂤PÞœiï>Ú‘¿7cÑNY’þÒÅûè~á×F†ÒIâZÐYÕ˜ó¨' Ÿf²5Øi·v,ž/zÍ÷ñÖ¼/˾W›>+€¶…$¬¨hgð¥äÑ0ÓrûmJA=\çD'.“À³gÇ€ R¶<Ý?.ÞRW¸èÔ|oë–°5 „Kž—J8ç$8\>ë )]•”©ù’ïd6' ½¢|} FâU³»"ÓA¿µš®¦MÐÖ·Iªýê¡T(&*KÝöÂÊ%fôÉ\ËO¦«ç›d´‘m y ¿@ô’ ÿGðX«¾ô›Dð! û®½ƒàÁµ·Q­÷cÉ>IEËW‹PóÁ¢“LâsŸ®•k®cì-Ò¾äêˆ7×Y[+n>îºuyí™6n '”ö S‘ùuƒÄ,gþ©I§].#u/}eí¾ý•Òí©_¨¡ÿ.èÒd­@$šÑÑäô·Áô¡Z¯?÷ü¤•l8ù’Ãïý¨ÕÅ”È<,%¿Tw[+¼ª²ùÛÌÿÝq endstream endobj 569 0 obj << /Type /FontDescriptor /FontName /GPANTX+CMMI12 /Flags 4 /FontBBox [-31 -250 1026 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle -14 /StemV 65 /XHeight 431 /CharSet (/period) /FontFile 568 0 R >> endobj 570 0 obj << /Length1 1450 /Length2 6701 /Length3 0 /Length 7681 /Filter /FlateDecode >> stream xÚtTÔk×/¥ H·Œt3Cwƒt§ä 3ÄÐ"‚4‚””tw·tƒ JHHIŠ€Ä7ê9ïùÎ{ïZ÷®Yë?Ïîý{öo?Lµt¹dlVEÉâŠäÔÕ•…@ 7È‹ËĤE ©q™ ®nP\ô9ȹBÀH”NŒDù©#àwÄ Š‚„D@/(ò·#ÂU ö€ÚÔ¹*8Ä —Iáìí µ³G¢Êü}°Z³@""Bœ¿Ã2NW¨5P#í!N¨ŠÖ`@a … ½ÿ•‚U܉tåáñôôä;¹q#\í$Ù8žP¤=@âqõ€Ø~h€ qã2ôì¡nôº[¤'Ø@)`PkÜ á·¸PźÊjMgü³ÚNÀ_wqƒþ“î¯è_‰ ðßÁ`kk„“3î …Ûl¡0@SQé…ä€á6¿Á07*ì†ÂÀV(‡ßƒŠ2Ú0 à_ðܬ]¡ÎH7n7(ìDž_iP·¬·‘C89AàH7Ü_ýÉC]!Ö¨k÷æù3YG8Âîû—` …ÛØþaãîÌ£‡º¸C”åÿrA©pÿÑÙA °Ÿ0/â€xYÛóüJ¯çí ùmýR£øù:#œ¶(?¨-õ‡ëëö€®î?ßÿmø·„ l ÖH€Ä Çý';J ±ý#£†ï õ˜QÜ€¿~ÿ9™¡èeƒ€Ã¼ÿqÿ=_ý§†O•9þ þMVáðå¸x€HBüþå?øÿÆþ[«†þÕðŸ„Êp[üƒuyãðø‹¬­ àß%4(.C¬ÿPß(´F}@ÿß ð;äÿÆû_Yþ_Ôÿï†Ýa°ßfÖßöÿà v‚¼ÿr@QÙ‰Z uj9àÿíjù³Ê꨻Ó[•‘`ÔzÈÀíPçñsùÿè¡nŠP/ˆimÿ‡HÏU…C´nÐ_/* ü/jë¬Q¯ŠjbL`7Ô "÷— A-Ù¿ûP€[#l~m#¯€ ìê öÆE% |A¨µµxýæ;€‡Ž@¢B(Ì~[„+î¯1 óxt©þHü½ÿH &ûD €ù[üW Öî®®¨3Õßßòï×ñ‚XãÎÏ ¬Å‚ªƒZÏ+e¨=¹6ÆÄï$Ÿñråšã {&-VãtÓÓT‹ç{@Šæ².çŸgO|×kèj½ùϸè¿ÚÑYÅÎÜž¡OÅûþ ¡Ÿ!hDË2L”}$ZàÚ‹¦Eùðý=)»^]&‚g,ÕÝsñžÌ$…ŠB*Á­íï+ ÓÔÈhD öÖtMVz§,™kN1/¿¼2 OÒxK¯*Þ~çYñp¥h`‰°‡¶32@Å#pã1I¨ 6@#Ï]a°”•Yà±û–È×ê ±¬›É$[|aìFj¯á.–hÅÓfÔ¦{ŽX× ‡Ýâ«4™OAµ´‚Îi–Ú#}ßjªN–TNén‡(0î¶Æ”óJg<ÚË=VjÒTÀzJðúk4º—pèéÛ{³t>ú¼ÑKg‡*p7FšhûÑóö—˜÷Û¼1)~Ùmÿ©rò"/"Én÷éž ¹T­;E¸ì•ãÇÂ&ÉrÃÖÁ#\a2Ùêês͹Âw-¢HšxDD´î¤ë4Ð݇ÙæTqÚ˜âß+½^.SÐ量 nû‰.}—ýÒáIÙÅk¼wáÏ-›Y_»IeÅyk¬Tÿµ¨.¬Ýw»Hò½ÛÔ\an¦HÍçãIÚ,o˜ºrÍ_Ý/ª g)#ÚÀtÉÐ#½7¥ö]ö5Sp%vôÈFzÐ&ÆÙ—«&Þ£e ›’ ˆxT2z‘†>ë-úÚi$D§¥“+Êò±‡xT|¹+ 7EÔÐc¤vp‰þ¶´š€Í!9kR»u;êªhʳîmÖcHSx¤X öœ¢‰ Rµ:v”Ó“§F·"Ú6.7[Br&Eüi†fôÙVñ ˆ4k«åk&®o4Ëh?%ñkšR™‡Ïê[›ÓLFãbªœcÖ¾ÜA ÆÝŽ¯° ±È–Ëpµ>Q¦_`p†…0â·®w†2^u“…î^ŸÎö–g°S¥™s=U²7‹½¸Sï¶g®ô´E¼\¯{Zcá•R¯™]÷ñü  ~• :+ìc™A"ÞÒB¬»BÞèËê0έªcüê{Ç)ƒ{È·„¦®/oò“à:cÓ3oÂzÔ õ^»Ó[™78AY é¨Ûx5ºî/5:‘Ý|×^óºîŒ8+꾯°-x€ñ#{Š¿ ¢PÀŠ?XŒ·Ùñˆ†œ¢‹SŽÔ…ŒÔü£%ÚôƒZ/ ®¥@¬å$gÓÞ…¼Û¨èËà‡¶‚ÓŽXª¢ Wv1 šAc^{§ð xʦQŽC8¡T¥µìbéê»äï͘‡üžÑ­«BH~.¯7šªÏ¸©ºT”’˜FS¹~+A±Š¯³$avߘoæ=+󂧞…ÈR³e¿J Ì ¸<Lñð;%Éçç• “ÄÇè-œ9q)e:zþE¼¬Ìk”ßrHÑ=–«èHЙӸ;›NNùµ®[隃¬“‰+?>$©åÌ }Ò?²(ËÝ ^„L›.[ݤ¢w­Ðb¦¶íºÞP,JÀñªÊRภ‹Ô›[Ñq*£UtSŠb5ì³W¯*ðúlæûßb$ Éq†ó0ÇÐÑ:R´=Qëa¢–Ùx¿ø9´Ã_¨ ypeª¡ÊC:kµ$y{Ÿc*º :¼äyÇ þs~¼Nòä1ú †dø㺶ïyÃz.ÊírŒìUÂøB×®çtÃMT d‚Á¹Ò~êWN@ñ]ÚM€*dƒ¥Zæy@¥B˧¥™¨™!ˇ MïÛ1´r¹åÀ÷ú„á­O6ï&)C²¬ÉaUß.ûØF´»MUu3ëq­ÎÌ…iöC®3‘]²T1Úà"ô~m\ϦÀ05&‡ ñU[ÌI'$gò¬Í¡l –ÄPþ“‘)~àgÂp>å§)úĘÓçR{O–lÈ=0XßÓXM¹†¾¨¾¬5"Ž9o„ªï±…1ܬĔu­Oïp”8¹mŠoaßêë“c¶õÓp7ÅE<[”1o†“£ Àk^÷¸)—ûbq½€ÛâX㪹“Á½{̪hpâa‹†¡ëÊ¢…èõVò@Ú®‰ý':yÝ2lÑFÃ;âÝS¢¢ˆË8Ð]áˆõäw?¡,²ßùÚ‘-Y‘-W®Ù¥Ìu­$1âȲ×ò¾RçµÜ8r² gÑ}ìš|°Uëi!×p‡R#FtrÓøy8“ EöŒàìaÈÂF1¨æ¥àÁIù¹ÈˆNåG©´½i÷û$Ïdf›|šû56å+IH©ÍI ž*7b?.­ût?¿oï©-Š(n>êÃ\³5øý#·¿oð˜`äß[ÉVóáˆÛŽ kxžbx¾Š=ÜiÕ5N?önû¸qÏk}óÉAI\Ž÷y*mâ)Æ™Úk"JhG¶D%¾Ú)¨G®£U¹ßjÇ993 ™ˆ¸,j#”¿]_Õ$bŨóš{b.¬hteW«/®ŸUÙÎó¬)Ƹ_à¼!Ð1ð¸zm~z‚uX~ýläYO×ç9¯'ûט%QéØþR,Ø[‘v>sd°êÂøÐóÃÎwÔc5 ùo›dêåËR2‚ÍïïI¿â&Οs›iŽ=¤¶}lF37«Bønò£ÜÃ'וîÍÛÓÚdÑ“Þr1­å†nód_ðº+טë”õ¨ G_¨ì·C†O¾F1sUC Þ;2‘WßëY"ÛOô€1œ±¥Þ¬>ÄSZn— œJÍ1«„ΆòAŒq¼†GÖ7Âx¼)mÍqw$ÏÑ]Ì7,ãŽ.«»Ð7Ÿ³Ô¤ûaZžðÝ`unO±n®ƒJféžwmûLé8Èxž»—ƒ…C•.Yw&ð s¢NxIòZW3íƒ&iöŽô벎ȺêuoBZ_оboÉvb÷K¶sEÕ€~*Üç¤i‡ø}–@ío¾Èó1b8RróI;Së”Á3ÂXY%”44¯Cœµ>i»ÖÉuAKSæÍ\dŸÓ1ç½$ +¿ÎxcÚ ¥ghêÇÒ,€ß·óп —é“?`múDúþ›cvîWÄv­Èã ó9)¯ ‰¤5…º7uËL:л×â2ÎU$™WèÃeîQèZ¿8¥|4äç/ °á$¯ŸØj?µ­êRgsì;œÃaÓ:Ãaââ>CîÞiL¾±nûI÷ÀÂþý²}úQ”ãqRhGëÒkÚúÐA¹º*àt Åbvd¶$×%í=ˆ9¨ô0C8Š0ÍñÕ” ðÎõ »^úo› nØÈ11sBƒ¼^ì·¹kÉåfø¥öµå6–éd$KßÍöð~Ûã5ÅÚé‰Û*aÙÆÛùàž¥V6´šŠzí¨&« iŠ^Ž8s­A™ëîtÅ=~+XAZ¢OX±î8¼\PbWñÓ[ê,LYdÖ!ñ{›Ÿ Ò¤åãìúª/ ÓɳWëpž¯3q•Ü”êÌ|žñ·ÏÖòéÕqÜXÆr¹;¥Îf€´›o‘íüÀ«6…©ÆdFa”"…ÌÖw³‹‰¼4d 䵡Úu2•1„zóÂSàð·c8xŲ 3MÁÖåwt¢¦òzhõÁ?§êÓ±4®{?ÛR@Ë9#žç£¾¢­2VD¼³ì2svÃÀ O`j=ÜðY”ÇkDÍýX:˜¼·òæ)Æ{Sßêæ]y.gÍAñè‰æààO~)Tin´™õä® ÝåyÐ4-æ›sÝ3¡òQTKöfzsºõJíà®\c!½%ü'ü)V~›*ÅÃN{ÉÅéŒE‡(qþó*¶;kº„D­COŠjeìÙªvÄ©ÊMgÈ#)7Ms˜ãu=šÏn˜¨U“´w"ÖX›9þUØ×Tü"QŒmÓQ¤J8òƒ@co{6Ö¡-±#±ÄÂä¦Ê‰«)Â-oN…•£‹•iƒŸ½TüÃñGôž`_®kr-q@™aw‘ Èƹ걛à{ÔYdSœa~›GÕâ+—&ãëŒÞ´ý™ E‘l¬qw¼\€ªß׶{®—&fÛeáï©ñ±ù­ôyA<êñe3DÞ- ß/p!ƒ´B6X4†tϳ¿[± Ž÷‡IÍ[[Œ9d_âš-¶LÛKpe²^Yô›¿¢µô•Ê¿•íÐÿ‰=‹ÍœÕŒ~wcéôlêæÞ¼ˆR‹>ïñ×6(É:ÿE«Í¡|ýý\J¹÷:窛 —PƒÏ/·.šj«Ä\âàl"c¯4™„ }âO’öžWuèÛ»´mìoÅDëvÒ$Ö.Ž’ˆÛNoA5[Gö%óŒT£Õxé{%E*ÃÓiE?–‰}ñ¿›°ŒuÄUÀS¬ìD§¡u€¥>“˜½/v¯mW] > Ü£—¸Bæàæ#¿ni6Ÿ#äÞåÿðƒÜ2róœOÜó‰ðµ»TS祋|]˜¾ŒƒÄúÍϦ@7¦¹ùFCúÇê™%¨œbïëUÿXä¼³uøjBb´«°ä-‘\:™yöšÞÏÍÅ5»ê£F_ã¡ XdƃÇsÙ¹7Ä÷ûáØ®åx‹_Kj2?_bgu7ë§õI<µ2ýX‰TfŽøPz)¤Ö¦oHÆ/5J+\›]‡qvʺôªsa°K9tîWlOê‹ý­‰ú;HúNñÙÌ•&ï„­>nsõdÜ ËÅŠÓ)é˜ÏP«Ü*—–H[Go¤Zùž•›QA0Ø"W‰ôh€#úQ,є‚~&RµÈÏÏ.¹À<ó2CnÅȎݹ8™F?dÞ!ƒQÓk#Ø8kÏÞ?.-Íû–ƒ–¶xðÁµÒÛèá¦mÑœÁ Z’_3ßä?ƒÖÖTE{±9$®XOçÂv‚Œ~<Ä+©­âû2Çe  ‡åWö€gó^AY|Ô»R¥öq.{MnêDÏháž‘óÃS RRçu¾1©ìŸ‚»#ŒðªÓóI’ÞlR9—UºŽ‹Â4/ujKO¢òZKù„Dið)ŽEñÛß,s·ï: ð}ɪ7v:bpghŠP³\jÐD/)–<…ˆâÒŽÊ8Þj ñ“ï×iŒ’R4;Zkºœ¿¢¦.`fS^؉“Ž+}÷*׉U¢Ð„Ÿß¥Áßåé#÷¡  –Ïëù‚]©z÷ø¦ýàú¶\1éWµ€Š±é¹Í̈Äpz+AVè[?fèõ*;“@ I'÷Æ–dá°AÂö,Øš[,·ó÷ƈû4à žÈ g¦-Xá»ÛÅ{ìîôê#ö‚ÉœëWùÔá$‚½Ÿó´%lOu ¾Séu~SÛÚï-XÀ¯%žòÅqçëÅ(pˆAcíÜ,*‰'¯çeÚ>örS¾¶DÔøjb±QBÝíˆë¿’ÅÄ˲¬‘_Z=bO },=À.¸ÌçLÂ%à¸Ç®ð òq}Ÿ°eAÄÊ<`þÂstG|ÕNfé[Ùà¢p‹…P|)Ù„}‡áôè‡Ö¡s™—R¼Å«¯ãáÚöáÀ°CN†TÓã'å#s ÜÐ% .ü­òÀn6Þù'=w¶ñLá ù—9?FÅ-}¨Â¬ÜÖbBÞްѧOäW‰‰‘nœÇ?ã»)Ö âvxQ»ùäûíJ9@xíÌ@O`- ÕZÔÄ2VK$4w®†”ç–ÞÝ’õš¬•öæäCc`goÕ2æ½W¼–žR>ðbìÌ{ÍnNO²äôœñܤ,‘È(ÞW´$=”R-÷¸T ûÞdÏ6O:|NK¹Ù& ¥ägò•ÛõÅ8±ë-Ö¢h‚Έée©Ó[ˆcp+iè+&Ï҇õô„%,5RÔ8x`MD_´‡÷Ê\ÚHfq«R=O'FÍ w={®‹µåÍ(R»ŸK ?g}CótòZ?T ó­*=ú¤€¼ÞÍ .4)ÙÊõqL‘ÓáP¼Â߈BÛÖKîKk‚‘èý“4¦° ƒ-.Ãó7{ð¬‡ñ¸Ô;íàcq›Žóñ=FlJ‚æF{J“Þèäd¡„g8—hdÑLÆÙ_ç_¬æíz?8Ѽêa@Œ1vh5YÚŸÇ4ñËùzçÈÿ~ïÙTI¬ž qYN^ëØÐŃG™Xp)µDlmÉO_†½×Uß^ë;¿î¥é¥wL±“S›ŠÁý8÷“¾p<þ]Ì£q CÚN6¶Y¼ì u‡6£€÷þ;|“e •g»pÊfK½]·B“ºzâÑ…Ì48ÕËÓI‡5nù¯ÃDîx÷y5µƒÆÀ”™§ÖºÉ6 …µ³}úÎÃ]¿¸º€î×wDwƒØ÷ÉHê¼x»~ß’w÷ïÞÉ›q¢"[¿¬$™+ˆî«;é Ñô£¡é3—Óo¼(HÅܬ³_?ï²}~ÑF%íÔ[ã1©ìÆùsUØm„I¾ÛúZ設4©Alк§}Ùñ ¬7d%Œ¾¡ÞX¦âçLëìßÿ°e—ƒƒ&º­»Þ¡ëp)-2“búÉŽäDh1I%ìò@r†ü­$5FÈS¼ŸÃ`ùØ䃹ªº©hiŸ9¬T—)ÞsU¯;¦’D| ~8vòZr Õ8÷# >ƒ½ÎÒauËãŒZ,÷,ÒméiqÇ&¿Ê5Ý(#c Ž¯–¸ª½§ŒÈ늺×´’¸ rë¢[P7%>äR¥ñÞ«é_”FUÕGý·ñçEäŸ Î>ëgÏ×µé(¢_ AÈôýäcËQ· ª³(Ük}àù] ³Ô¯8¢5_ÿãç/;ï¸s\š\¾ïÄ7¶dzm¥<´ÁÎæéõ‘Ìäè/x­öúh/õIñëÛ°«æú^ðŠ©˜<ŒbŸ–Õ»0SÔkÉRúºçÏL“«¥é"¥d†‚ó³Ô³LÛýue[´b$y‹ímüöTQ˜oèR\Œk€Îì#7S?$[›èx7p¤Ûu#à 9a)O¢äËomŸÒÉŠí0JˆÓ½Œó¿Äå‹’(½êËÂH,Xk â{g‚“aX¿AóV`eà¢*!F‡hÙ'Gg¥Øúäø9[•ŸÐïv—Žü{E¯pôÍrŽÙb¨”Ë&s$76yÿ€é…Ù ÅP_Ëx>=“1玉~Ùb Ç¢¢q™P|¬p[áT<¼Îí !!ÚjI‡]ÛÎCËHõ[ìkd‚z"’—¨ùUh¢Ø]‹þçC=ÇÏ4ßÃâM;Ê'…Úb7Ò]Œ>Æ׉»ÛÙÔSKΞ/÷ÄÎW{A8:Eu,Ñ«w‰Ã­{Âaís†-Eœj9T¾|öIaó¯‘,~.Hý!ö˜ÙdM=ª1Âg‹ÔŒ°¹dØ°NÝ43ÞËèo`ßÚCÃv>CçGúŸÅǾò§?ºÝ馊¬4§Ûbùêiœè¶zr£Ø¦(+šë†G¯­ñŽÎáÔš4'±ÞÑ~ùÌmßÇ endstream endobj 571 0 obj << /Type /FontDescriptor /FontName /VUZWZI+CMMI7 /Flags 4 /FontBBox [-1 -250 1171 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle -14 /StemV 81 /XHeight 431 /CharSet (/S/T/h/t) /FontFile 570 0 R >> endobj 572 0 obj << /Length1 2814 /Length2 24159 /Length3 0 /Length 25726 /Filter /FlateDecode >> stream xÚŒöP\ ׊Üݵq îîîî»»;Á‚»“à’àÜ‚»»<ÀíÌÌ7ÉüïUÝ[T5½¶®mç4%©²ƒˆ¹£)PÒÑÁ…‘™ ¦ Ê `ffcdff…§¤T·v³þ#†§Ôº¸Z;:ðþa æ4qÉÄMÜ@v ŽYw; €…“—…‹—™ÀÊÌÌó?CG^€¸‰‡µ9@ ëèt…§stòv±¶´r¥ùßW-€…‡‡‹þ/w€ˆ=ÐÅÚÌÄ `âf´e43±¨9šYݼÿ‚†ßÊÍ͉—‰ÉÓÓ“ÑÄÞ•ÑÑÅR–àiífPº]<€æ€_MìWÆO P·²vý[®æháæiâ€vÖf@W‡»ƒ9ÐJP“‘(9þ6–ÿÛ€ðOo,Œ,ÿ†ûÇûW k‡¿œMÌÌíL¼­,Öv@€’¤<£›—=ÀÄÁü—¡‰«#ÈßÄÃÄÚÎÄdðs€¤ˆ ÀTà?幚¹X;¹¹2ºZÛý*‘éWP—%ÌÅíín®ð¿ø‰[»Í@m÷fú{²¶Žž¾ÿ ks‹_E˜»;1i8X;»eÄÿ1‰àË,nfff.6Ðô2³bú^ÝÛ ø—’å—T¿¯“£ÀTÐßÚúïëj⸹¸ý}ÿTüÁ³°Ì­Íܦ@KkøßÑAb Åß4|k/€3h÷XÌ¿þþýfZ/sG;ïßæÍ—ILNMDUüíßÿ«uôø2°3X9˜,¿–Œ ôÅÿ¿aþmÀÿŠÿKªlbý¹?"Ê8X8xþ®Ô¼ÿÕáñÏZÐüs2´€ÿfPtí2@ó{õõ™9˜Í@,ÿŸà/—ÿ{ÿ+ÊÿÛêÿ_B’îvv©iþÒÿÿ¨Mì­í¼ÿ1­²»è,AÇáðMµ€Ÿ²ÐÜÚÝþÿjeÜL@ç!â`i÷o­]%­½€æÊÖnfVïÐÿ¦ ogíTvtµþõ°0€öt ƒ3³=P\A³úKÝÓSJ8˜9šÿ:Îî #ÿ·ä_F^fv&öD Éâ7ùXüÙAë?Ò€ðoÈÁö zü&ÆòKð;Ç/sGw—?² ,ÿ€ ø¿ ³ƒ¶ÀÊÛÉ èð‡HöG~fPå6@P³lÿ€ ~ÛýAÃø£RÐÛéwd«èèÿЃjwüMäìø5¨§ßjP0'ÐÞá?{ÁÎòô¿[Áb Z4kÇßsf5ÂÉÎýÿêóïáýBî@׿žUÿnë/¡£ÐÜÔî?yÙØ+þÏBrþ£ù¯=Ï?Òÿ³üš÷Ób5ÿ7C“+ÐÞú¿ÍñËèñÇÌ8@A\A/ÙKuÚÕîÏÍda±úôžbr³rþ±à îºy:þáŠáþ ÚãbæùÇ’‚¼½þ€ ðÞ@P}~“Eòºüê?Ïz3wÐ Ýþzƒ.ëø¯_\@ Ð ~yÁÑŒ/̦!¬ã¾N„À“aB`–r_+ƒ–ÁwÙ¥Óý&•¶6'dÓåV$u¤umW‚æFx…äÙ÷¤õ3Ld[²Jû“ßO£$Õéývø¥)ìÁÉ’‘ODp„ êÂ~ÏÎ~šÁ¶­o¾ÈR8»s#+aÜ{öKy}¨X‹XØW9¨å”CøY1çñN?øÃe¡iî<.´,ú…ÊÜÍí,zþä+‰lÒ[xÿÓ8¶R_Ý-Öø‡yŸõ*uV×n< <]\"ˆô±i*_Ñ£4YœEߥkƒK^­ü¥$ùHôék ¨ŒG¬ÙµÖª±Í}õcË],{©€0j‚AŒ½äúòfL#2%¬Úv£X ·z6[ ÑQ—…èzÇ­f…M:á Ï̧WÀ’ŽÕIPKïÓgçõ‘ÑA†»ˆô¶û‘æÑÝ­BB„–ž,tVz1k«¼ÙDéPnãàÝZ@LTúTîŸP&áü¾!—¢ø,;%Ì̺ÜP}oÆ¿sø]ÆûW7^(vmÍ¡-Úy¢„¾†r*¾š~I¿¸(Á³b“0Ή )Ì–è‰.ÜH Vák6Î…V0]lUc3Š—{“È¿ßáXº¢(e—‘êÛ_¬‰Ññ¶yà)fü®Y­ÑžÈQ¬BºwË0~Ô<,ÞÏsk~´s[Y)jˆuì¨ùpQí%:¿­ÎVÝ¥”ßíª”)% ^v·;ßgJ~¦.êAjßœ€¢¥.ð¸;Þ]öÓ“¾BFœ’ºtYa@î˜?ÒoÙ`I¼´¯.H;ú¦9ˆµ¡Séž 1u=ž2ç`‚ܨs¤Yóò_”@Mý¾ˆÜg ¬oqf|—ôëô.…¯]µþöþÇ»L»$*ÒÅÝ ¬ëMšw1/1-ž"ŸWë³ç›§Ãc¢ä0l̘‚§Ò€’rêœ ùÒ·˜¯ Éy6;>¹Â$ -5®ú ˜7üá•úÝ:o(6Å…¢4¾ÁMüäLÍŸñ’*Tqª$ÈŠÁÛ³®¥\HÉ#]œ†—gé×ËËBû±[HKúÎ"\;Öì-l—žs¸!!íRC™M¢4Œ·mëeJY¥–j¹¿ALvLÖ­ŒªÏ— :‘³ž‘w²cx™ôîŽ U¬ý¸>îï3 "ç8é²ÚéÊz‘*§_y¾L|Üê/–KÁ6£Åý:y·­a™ïVM%T¾?ÙÿãÉZýij3ù ƒ¢À\Q_¬%»dbEévaR¸T‹Õ‹äˆÛ™TÞ|¦f—Àñ$`E“éÝ°¨€pýÇ3Ræ÷=:…Ž>gSwCA”ýÕ_¦G°<·7¶Y +ú65FÏB2V_QÜ Eí¿KBãð6² Ã.¥™Ã–{sÞ…t¯lˆ$‘>†áÊ;p¨]yR•3œÌÖÕæIùÜäù†+0Lý~fì¹C槕âãçß=%tr „¼‡Ù¼=”ucY7Õ0™Âé7û~áf­ùˆjÜ’jû5SJæå (ºG㬘þÂäÍd&‹›¾\»NJe ÖB^bMZ5Qy¦þ ìïby"Å›w¹v|5¾_»hÈÛ–´¡$¡ß“ÁÆ‚e€…qûª.9¾GëéWÇ¡Ù3Òº7y ”ósT@0ÂX˜M×BÛ|!LêDòÞS8zå ª,¨7ì¼3qË#Vb9)dÊ“¼$Iibó&&ÏÜ5CQPXœ’Ð}^׃°¯zmó™|' ‡nWñPIÖ++X„\ÒMÐ%ô?Ô¤M„\S^µÆ£/<Þøp®ŠŽÝ‚]ÚÙ.7QÑ©œËxÔ)9äuY†k¤7¡­…†3týC¥ I]ùõÆ#´à8JÿÞée?Ô%Ð*ù±%Ùû21ìñ[;_|Ø; ÊÝB¢‘°'¾ô¦²‰Ç´žÆ8–Q]þ8æ n% 1]ÅÞPzm‚ÂÛ!S§ >ßõŠ1¸àj6ì#MM¾¥ÂŽñ¨Yd$ô%F¥¼-kúnîÊâÐÓ¾ˆpË|}-a2É­G9É{õBÓ§Œ¤.Íàx;;ËšžÜÓ™ê¸uÒ–£Šù´ù¯úÛÏ&ì*,8uc€JžgÍÒ–c¥€÷®†¶gE®æñÙÈ>I=°0ÕŇ%¼ „òy>xñh.1¥E¡Šâ]± R\<2òÖ/TÉ"K–ÛvœÞo"eá$•¯øåàöO”ÇK”âEDpG="’7f슨ïuö?S/O€i­Lí‡Ru1Ë^𰲘¬á¬—gÜáLóð{Å็ú}D¤KçóÙÞÀ{3^éxµî¬»±ˆ¸WWä":‰L2걫-±šz¦¼5¸•—|WâãZŠ5¬# e’ìUò½årÒ/ñôÂC×Ù‘‚7\ç¨_;JÆB'Ì7ZkM“j¼Û¾8¢!A´kƘþÎb¼ÆíÎxíþöûî2Ùãµ ß} ÏÈçiJxÇöÚÍ/ˆaæ ×´…arƒMÙ*FÎÅÊÕ½)˜å+îþ6—l,ùH°ôNñ:¦ì ßÖv©ùKUïÓÙ›÷Õ¨?7é:bøË Sw0Â0* \»Ëxø¥Ä$ŒÃ5‹¬¶:Gú)±T’'$K•;ûw¦ÑB)*;ɦÙØ:î”yyNuã\y"ßPïV#º¬h=ð*¦”ž»ÎÞ ¥4“C[„"æi­‡S±²{¢—Ûù P̱jc4x®‡ž*ñ˜¾ï“)•åcŒŽkõÑI¢¬3•{W¼S©‡‹IÑWIí%¤«X³VǾŒ;2TÜš+‡–D¨QªRl“ãJ¨…}«š¹pªçRšýsXçfãLÇèßQ¿DˆX{·¤©üø~Bò†DÑéõË»‹Y¹ÐîyéwÔ ‚otU„'Pd–·Ü(‹÷^Órºõ>ÒrõSuý,°špÈE¬Ç;Ö¡ž[5émRﻤÖv œÛÌdr0rH…•/ÄF€¥I†o8,ø:•_ݨHä+'Ù¸¹zah›mºÑëð-ûÌX¾¶ØvÕ¤D£ðMë€ïÏ(tsù͵¶ƒ"öä,.ö"¯ß]S1{¯¯t7!è2ÛÊïF]o.³1M…}“¼`IÅÄHb}qÌ`µu›Nω˜q¶LÂ-]•3Ì)¦õok'沩äù¾@¢· Øa úµdæ>zdéOkzk11äãýÑ#”dÛ¨AÔ§f42?â«Ç\,4ø·ëŽ›ÅÈ>í7&ŤÜxó%öði«‘¸–žË¤0ð°÷\û’p:ÂÞj—áùà™ÕvŽ¢ ÇUÉp$i¹¤ÌGÍ1’)!ˆë›ßË%6Mô¢B,؃¤Ã °ü¾ÁhýüÌ·*E¼€‰ªƒAÆ&úƒcùúçÁý¶´>Ùl¥ô=KÚD晇â=O…“ +—l»èóu£+Ä÷˜&Kšå^X*ôÈn‚z5;ÜãÉR®-Á¼$ª<œ˜TQöÞ5´Öx1#Ç6½·ZcåûUE ‰TEM쾜x}2*XÔÉåmàPøP ¹yð}ó<#¾½¥‘ ðã“MIøÖÀr!©ÿ†qÊ÷q*- ኽíV hé͇(cn2%ÕpÃóŒË:„—ÂKX•.i¨F?NÖ‚{a‘º”~(B1È#9¤Å¦ Am`…¯Zb¾o ÈÃLà‹3&®›:û('¹qÁ ìoêY#©MjL9²û¢â”_Y8KÛÑ”ûÐXzÅÇ£†GhØzûç)[o#ü Ó«òS¨ ³Ô(ßDÖªŠ3x|ùPŠ­:uëE*_¢3ÃÒž{°›¼K²v?€c?Þ9i±ßy¦4Xh/vʇELím7a±2K_1p\u­R6Mae4,ÕŽær¶‘–¸ 8¢²Ïdï¤È!ÇõFëãGÛ·º´a#V½¥Û:[Ëî§áÿe ÿ°ïÇGhL À4é×4ÔÓo`¤sod`çtö?ÎæãÉQ™•JÔ¶œ?e ˆ.É©A³ÜȯgÛЬÇôT"ä­*töCÔ\^¼M8 Ê:RåóS|ÄÙÆÍCÍBE»2f`ÂjÒTiü¯Pï¿C=À¸1‚s%Cõw5ë+Ø®MªEH½½;vy/gßb晑{]@¥…˜N*¼,Do3Yø³m¦eŸ|-Ú%“*OC«>¤¶Pp†™#ÑÖÒxöÿyÛØÜ¢Óßgˆ4·Hi3>D*Ýu«$ý ;2ObôÐËwÙ0q˜´#ÛâQˆÜl°FO± S²J-f%̑ɦ†ûLÔ~öµ®çR8¹7.ˤêsf¦H YLı£Ö›Ï 4W Ð.`ÍÈW§t|mVÙüìÀ=ˆjŒÛ¨eì ž·êI÷?ÿ,¼™Uî=õM)‚–¨Í8˜p292D^²:Q²…0Îmþž½ëtÿˆXÍíî½Fár•¶~êoáoæÜ÷–£Ç;€ôyÝ`>÷‘à¾ûYƒ¾úM—[í5¯ôUA—Rxÿ*MP)ø˜HR³ëÅy [°Êýh«ŸAŠ7jû²ß'4/<[ZWŸ2AãÌc©ŒiÊg×wë«hœ7e¢úNK›nöÉ–P‡=¦ìû{l†Y¶°;"ëÝEiáµÄ`‹ÉÐgÛUÆ“ì›gê !{FtêqµÝ^ñö±e;ïŸ$¸\ÉØEˆ:7 bŸªì ›j¥Ü9Œ¤²aî—YÊžPܘÞÍ!¼lÅí\Ào±G׳T;D=‰ ú;A¿=°¨°ä±¢ zü8ðÆ@ø\áÁxÉp¦UJî–£ºÄsè¤rOÆÅù\ä#›…HȦšµ{UPïú^ßUçôùé ºŽ ê1‘øÍ-oBÜŠ91Œj)Ä: YÄ ñ„¡"‘“v§Í¤¢d¤Íjg’Goîƒû+¬Ú!.Ü{¼0´~u¹rmŠ=OË‘ä&¥P½p¯Xç¡ÐboHš´×Tù2Ýfþ~VÄÝI>â;“½‰ží:qo;Ÿ«ty'Îû'KrX¾\5Ú.» †Þ»ß ƒãûAV’`-¬E}Î4\á$øΔç=ýdlrQˆ^6Œ£W;ƒj<Ó5&‘WÜë‰ßujBL€Xès`}%o†ƒîo3Zw8"üT³ï?è…rp®Õ“¹ïéŸÁì@‡ì‹\k'¤[îs›:Š+ØrÈ}FâÄ ?M5\üq.g,0þü‘²×8­èûú—× ¡6¯íƒ†ú?£éÞc-<«ŒnT4µ»Úѵ–çH·üA®ÃgúÚò›å¸É^|¢ûgÉ‚éLþ> íGïõ–Šª)ðGºðaËÛWv!mVƒÞDöÒYãEÙ‹WY†=SÎò@džœ ³ëÄ»Ò÷笠OiK®3¥óÀÛ>V‹p‘ûŠG¨ò3±º=+ ýxpÝ/ z²å‘ÑþñÞ¢¸aâånˆlw@ô¬ìü#…%aAZ~-+ã=…Ž(Á×Å¢‘×€màÖ™¦¸ì¼_z[›6Šÿô1—˜aœAõa‘á# ÜgðŒâ÷)Êþ|P1d³r·³äIêÍÈ’wú‡øÏw†sÉDø|™pÝ~ßTâúý!HÒîsœ¯*ÏSÔ¹*læ|^ä-ñ$l×$jc¼6¦hg«”-n²I0L‚£…J¯ßsˆ\47‚{ñ¼ êZ¡;iwÎó{ ‚ìr 8»Põ §$ùPé©>RcX—Çè×+ªôÈ\IÏÿ˜"éRç=^’<Ç9T|E€QÓîYg®ç¯¢m·ÚÒZ€îd·h•o¶JXe\ú¤Nk¨5Í@îàéÿL¥«Ø"5%öæGí‚Bœ*°Ñ§wîö‚­cF¾iÉíìåEg›Ã8G2À(Û«'.B#Ï/–Zû}ãPd˜”0ŠÆ*§ ‚>IfØáÚ­àOÞM£'ðÁù2:fìÙF}2ß%,Øs6ŸÁË÷=É ˆ±å’ðåÍ£´‰QÜ(!?5Js=ik.,1b¾b9Ïñn™Û—¶Ö®aEYÁ8!”æt¸:"1´ ¿‡—ƒâJØ%«öS™Š?¨xÜè^ù¸ú…‡ø÷ËÏVÈ)å ²¨˜·ïøÐ+Âvž°p¡†ÀÚ/€—´ ÷ɼy)ù§lŽþÚ'lâjÂ+l³ÓÜ Ÿ(~Ð_ݺlX¦³E]^b°jº§k^ðÆd=zéåHüÞÀ]}ŸLÕÜHLÌÏø™­öYomƒ_£G›—2deUÈìí-åV=Ü™bûš¨OÄ}hϧ7qyd} ý9Ÿ,Ô;Ö÷ M˵`¡Wiè(ï<¡«îh±bÞ%ï†b*’ºT÷éø”ò—FPḤó‰˜Ëˆ3EûÃ3ØÞpúèµ»B{ŽÉ‘cǧ–cÀ[\×*UÛWŽ¯©¢íÇî_{Äù453&qκ4%­ÌÕƒSK|¦³§5ÂÐ 9‚.¡´h5,½“OfpÉJɯÒz°pae¸M¼{Ä•ï­‹Š:]¸Æ ž´ò#F#¥ªOæ~KkÄÒwÏXXDÃœ6Ùfí'PÓào~ã?ä–6ý)+É€.á›+{¹ÙÝí<;Å%ëªd=tå‰'ÿ’ñÎÇ-.ZäªJ£¾eDæL™©ëó%ÝÐv;‹ÖŒÚuŽ®ó-ý£3·ïšH£Tk Å/˜; lšÙ¯X :à±»ž}²¢ÎImÁ§íWnÍÂð€= Ù¢DÔ#\äâ+£²È›a9ά½2Ô JO¶¡Øb|²SOŸzΰÊ.úï_ÂàgAk!áÐfÅ@”e/•)}ðn˜s¨Ký’*TR½ð”¡Ã›£öd߬Äo Ud Ý´d¼é¿æ(H?¼)?r,Zv-„ãIg¢n…j{,*u¥2ZwçèºLxï<¨¶Ÿ‡s™«fPM×[×_€íZ=ËšôØW) G¶åž½(TvÄýñÖRŽm¬§Ã#k¥ôÑ}ÍN6o…Þ½¸Ž ‡ÏŽAgÜÙH3§ê‹cã‡K•—ïM™á"²*ëe°뀻¶:5sdÍ%"çkmß½W=,®$g–°YügÿXõ'Žj™Ï/e0e àÐЀÐoÃ$ÔÂÓå¾Ü6¸sªk¸Ÿ•`‚±÷OkB3ÆžüI±E²ÉîOSrí†"‰ël¢Ýþ{ YtÎVä(öNVËWý·ŸùÏO³*Ó3lõ“6ðT 8s1. L(Ýé‘;Ï”h‹2D¡YÚ¦x)¸aðe¢p.M°’¦’±V§p ƒ¶ûN´ô'@€Õ&§´ŽÝª;Èz¡,@o>Wj^êì@œJP^mƒÑ½ú»7ƒ’}³ªLÜÂÔð ¾W¤ð"´6DŽÞð#¥»lãcÊã z&t]Ç£I°³}Íåc¶Æv‡‹Ôg¥[Ó»êx¶ïïûnúõqOÄLß 5Ÿ„pKøÓÖ{ûÆí@ÉZ–jy›mvà/.¨m/ÈëëjgHÉìŒSÎéyÅí?îÛuÓü˜Yc§+©ãÙ¡LaéÖaa](çÝÈ|]»òC&No¥¥0š@<‚³Q¿1”±:ðÇY~ffDˆVJQ¶áº×¨‘“öóÛlî&·ØçzCR÷¹øÓ‘>ȯ4²€û´E}]’ ­ç*„Ü“u>HÞŠŠ²V»Np‹ÝoÐS`EGe8ùÁ¶ŸÀ¢ ßõ_Šlfľƒš…æôÖuAàp§çà{åÖN:” †*5.ìMDJÒnJ8ŸälQÔ­PÙÇDÐÞ¾öh†ßOÚú’…{^YšRÑÚf½ã• ©ìß¾Ë͈L:à;ˆ×ñ<ˆÂGu±"žb3n¥ë$€ô¦±ÅØìÛÑ= ƒy½¬b~çâ;Û•n/cÖ´ð.î:BÚ9ÕÏìK•o#‰ÌÅžÂ\¢ò4îé ´ .çÏÖçîôú ƒ« TZ=œÉw« ºPª¢Ä„Ý?0釢×È?>¨$`•'¼®lópDœoZ3cç¾[º7ßÐ3€¬ttk Ãî³ô3-HäÓ"òò™¤)¤gô½,â LA'!›±ø4P/R;`GB²†0Í<µ{tvn¯3O4|léÃ?±¥›N}?z¾´<ôñü(Ss „ f»Êе…íOE·ÒJéÊ·ÈGØl­² LÈC¼ÞGàÚ<$¡˜B¢|Ü.¬kèÝÞü0p[¿&`g¤Ð:÷–QÖÏ‹ÀÊHüKÜ™zâŒuuuidÉÜ6éƒÕÛS{=ƒ‚ÑË4‹Ô–s”¸³Ô£ÛÀðK ݽV˜?Ž„ªqºÐ&O½=š D-u6Ö»Âînïoí•ý{a&â01œkûºôŠÜ›ž]¹*nF“«{KŸè…Ö›1b±Ñ¸È²–j À}oE‹­1[‡&n‹UYxBEmSp7‹d9+?$P´L[ª~†óÂûMsÇǼå—l0Z |‰ÁýfÜòxú ¯mÁ[üöœó+aÙ]n^Ϋ2Ýûç)˜SãâÞ'IxÚQ(eXîœ)ƒ×KÙ+ox¥Ù h Hž ïºtû„:ãyS:çaøÌ{¾…tŠK”²rV;V¡2»»`:°¼”}ºèÔïïã4¦ŸY8—qQkQy8\"Ùùn*T¼mç…ºr){¥übV&#ó¡ÓRbg)N‘zÿìi¢‡jÜ…®ºl5’ÕCü+:‰ ßdµ)œ_itšÆÈ0žKz£;Ç$ØÇË0bí^>Îäw‹éz•ž/úƒW‚ŠÖoãWêùoŒo¬;¬!F=R’‹[aqr,ä²ff‹ "®»Vû(4‚)"!O[ˆ¯ç¤!0º°rûD¢©¦•å¢:¿†¯gÂ}]È.צQ…5ÞÊLéŠû4Vœ¹~ø”´9IY˜vû¦ìúSã>™°gwM;s?˜;·]©«|«VY„¬‡æp㔌KÒÖ˜·ïº ÷—#éY°T"¸½†mS±‡õ2èè’xƒ7{Ë’ôº£a„NN >ÕȈj–ݘ+ _[˜›Ÿ†©ÚSýäƒT^ªvT|ùaT¨ÆÔÓŽ’¾› ¹ùo%Dzçâ•ôCR»c"ÌÑ?úG¤¸”òyR'y LÌ|ŘkNÎÓ­Ÿ=h1d §¦„ÇõŸýÌ÷ŽDW´Õg^À_ÖË_,H'šë´bê%¥Î¤„Îþ¡\Ì{DTp†)7ã:šuËz;̲®¶Èb áŸSÌé…ãR®!Íq×'ñÞÔ©5¨aïLñsE—Š ßOµ¾©‰–,ªGs™-ZÚ||ësҚط8&ænÓ`;öñ̪©õSÅœÌW¢àŸêÛÀã”0Mߢ@c®hú]M=dÒbY”šò¨¦–æY˜4B”—v; ²Mí#Øî— /öÝØ1ìΞC„;;‡îÓÕ}lÖ•H4ΫßX|±ä34{oº½ö&¹~(Æ+·’Qö•3yðE”\«¿ÊC~zøt¹Y} ›ºPÚÜóeimÞ>WÙÞ÷üµò•ÁÓÐ=ÿ›/ Ñ9£ªlíP$XèÒÐÇm}Ã$i·P’Z S–£ Ú—Ï3ï4h%³%”ä™(Ç2«OÞ:¶È2›«7¥.3‚¦×‚)CŒ÷ŵPÆâ$>Ó±RqîÞoŸÅx€•˜Ý´Ú£Ò’¢ oŠwð Ww kx-r‰Íª@O+ŠÊ:QÔ_.ì>îœC ªB›né8F/b÷ìj{òe]ú¹Øë ˜ÙR.‚`–Ÿå1¹±Žq¢äwºl}cðwS;Þ~’/¼s"+jgÚ(~g³›_7cîQ­¯ËQˆŠÄS'Yÿ$ÈûM†ø54(tQÉJ #ãÑŸ(þ uÚ‘ÞÀp$ÎYÀ E<ÜÄSƒÒJÅE8Ž`T&bR/D%× «vžz1؛ïÊ,ÌâŽÜ1Ja:;R‹¥b/©¾†ñåñ~'ßXy€´•Ðõ~®ôpäÌ(–ªœ2Kíîo?¡rø=¤È$«¦…Ü0k|¢áÐùFÚ¹ÀqãnÚbØØâ§ÁR¢>‘¹ìq÷çýÓòt«ã656˜ +ßE/ýº…þ3“Ü .Z2. úW–yHå÷#GóbÙÈ›Ìò4½¯¶¶ì$‡Ä²îƒ\{4ALåã aï9Å—Ù›ïÂm³— šc™™3¨šžö®?¶ðDw·²ñë\Õ½W¯&<àÞÙAÂ`©9> lÃFíïé»90œ)fˆìW«qw® |øÆ={æ=¥éóSaU™2#:·Ä¿8 ˆÝ¨`ÐF„œKÈ\Á=Å°¸ è»ë|9‰a ²al êˆÈVÖ¾ôzáYjèŽ/(`LU,Z°¾¢+¢ã)Ì7IÀ‰›mX’â…J¿ÃRh$­jƒìô=‚n%¿øúlŠ[z”+™ÀÔ¼ŒOÝûÜ©^kOÍ[Dðs©+FAôýÛñ%¾°øà$÷~,ìÑLclF»&«v½p%¼÷È%ú¥ÙØÚ),Îöµ^åzHxR?˜Éyñ‰'fm9ÊxwËtxï”æ‰Î‘këühŽP¶»Š$’ù¨è¬Cû¶ù.íæaá6ŸEù9±¥²èmQŽ´Tìªé½:¹ÝY(ƒxL¶C¯ÉoóÅ5Éõ…«:z+%Ú?îƒoÚi|Ég'©BÓ`¯H¤PIί‰,‚5lCm×ôu½/‚ôIcÚ5®J„ˆc›ªÊ—¢Œ¤‘¯¹«ë@k¿ÕЄþ±û®.'Ð?úƒE*ß‘ý˜} RS¸Ñ"S˜":/]?:ég•— —:¯wƒBÔ± Ñ&_R÷â hoçz$°Q+RÈÜa?‘rc/¤“Ÿ¹ø]òÛxÚ¹¸CìÅy&èܶ³@y\7´žýŒÍµ„È»–¶´zÇùôMí3þŽ92ÍŒJÈãÓ¥ |@|ì´Û¤gáxJMÎu´çüªb:Ž=ú­gAóõ¯Oœk°ògkuÒÚwÞúœŽŽŸ¨61Ë`h„ms’ˆbUÃü`"Ó2‚÷ëÙü ãÏÝÞ&š(SâÈH™¢Ê«K“‚Wc´Åe¸|±Æ]G\©X$Ü0EÌ]·(ÖûIìæ«3Al63•1¾¦2¥ç¸!Þ+ƺ0‰WM|ã=¾ó v­à9ϵԨ ˆ‡¸Øüu³Ô Ë4­Ë—oðÐœD2Mu)â:[´kLåÍî¢Çgë¤mSH¦AMz þÉš¥¥4 2LËóïâoOÐrbö⽕ìówõJpŸÍá2ŠLfßM G`²Wé Ü’K®Fu˜wÆfM%%ÁH§Ê):DÑɤõÌyx+þàÙ¾a F‚Y²<ºL LJæ¿Ü¼ B|BF‡ ˜9¯SÉÉDù„”•G8I*#¥bFÁõ©Ää іΛ¼ŸT¥3²1›¶šElZÍaÛéÓÞvÀâÛº1×ÒÆ™ë¼#%ÆTo®A‰ïj(0·»aŽ]^¬NãÕq'«¬OØàÎ;XOvª<­ŽmEJ‹ºÒÕŒÇZšÛìçN$!ÏÒp‡K…äU5òÕ‘I¯Zˆ‡wpÒšÛX]v0c5§L`ZøNzø3×|¡<ÌSKÊ(:W9O]yè¢ÆîmZãþbßùÉ-5‰ÙÂQÐÙQ¾öRdÙý+_ —ØvŠNªö¯÷VØ'vï,>&º§íPñ=¬kcÁaÅ\›t3CéÒ5†¬ ½ëê»ùìw:Ôã¡ñ&7Ab³'F2¯K(›£¥>ˆ>è¿’WFfj¹±¯¶j?“ÄcŸZ¹² 38&ö5÷S‚54Bw*4üjN;_úp>qµûÙøÃyŒÂw¥Gþ»oDö†`8—ž*رœ “õ˜ç©†G,yWÞœ³^´ªõƒ%†‰ƒhñðŠ>„Ú.UÒÜ1F71)Ònn¥kÝì„ç~Í$ QâŒ@™ 9n ô×úù xsËSÂQ5…²ÉKò¾I®èÛ\×$Ý3|W¥m$&>^}H–s¢ðÈ0îV]‘lÉ ¬lI _³Ò`ye‹î—퉵¦1_öhT ð6ê¶xgì†Qz ºóñŽí˜C>§ŸRPöYñ.Á· Æ­‡#^½OÐ@ãM=CËÿZðód~¾œ0Ö'ðGµèL^(…5Aèù¦V7&Á(”M?·³ÄèËQ˜2§ÆcJÞëw)L…Ën='8Î<õäú\èŸ?Ëâ@B_Ä!ÃUe_øpÓÏmMòŠÓì诮Iaw9¡Ý— °+å«©£;dçài´…ªÁ´ºþ§ …­pp]”}½ÒZzˆ.œs2rãè¸ÉØËj}Bûû/*ˆÕE_–à Ó }uÈì{ækß7¸1H¼o;C¡.Õ¸ýäñ¬3ìÇÙ’WêÔÛÏoO{ YË°Dr›æ6íla›Ä¾Ïs¡Ò%Ã-[À•Õ^—Aœµ£æî ëð¡nš¤®0G‚Ýmj•{NçZ·ãDÅ]Ö¾¬|Ò£ŸG¢ÎH’]ƒ[ËWj½û¤}êF}i- ËCý>2e‰_¢ái±W„móR•òr žØø4÷UôRî½^õ ÑÎ7 t!Jçï *ï2ysµgå³êüX4Û:¿™P %·wQ-8iTì2ëÐDéOþÈt‡›™)µ ÷ñœLU©ƒ¼ù EÖÅrQ¸9ÎÀŽØœè/QùÐpÙ׬/—_Mû­A¨Û]½Œç±°51MpÀÇBSþö/õ¹GÌóë׶Œ™ìÚâÎùNZg‰ì; Ñî‡Ä”» †Ãg‡›Q6Âkꜰæ*œ.鳚ó•.¯µÐ~îƒRÀÞ8líô»á+Q¼2!amÁ¸è/Ž£OE!ÂYð0Z9¤ö¬+Ã’uº4¯ùèÌ­å׉‚g»T1þæ#{àœ5b1ë¯g-ŸÁi…WŠÚ¥Ÿ“MÓÞOÇ}†´N+8iÿ`"RJ£Ñ]®Õÿ#Dö˜šNýpðè6Ølµõ\X•)4š¹ÀsBÁ÷@‚VÍŽÁ#˜µÏèýã—ÙÞý+é~û ƒÜPj÷£Ä´ÏýÀàYw·¡%_Ù:N»|Mîéº=!¹2kn}Êø±.üÚá—dl¾-Ö²³xmTvÙMCG=ò‰txxŠê²a-¶_- óÙ†Ta¢© ‚*Ù( C¦ ÖÄÞKÖ[Úv×+ïú^GÊ rŸËä´6}Üðšm©Ú‚ZÙÒÊ^¢¸ ŒU˜My Õ뉭$1ÀVq’“±ßÛ›‹å;kƒ}i·(n8+¹å¢áÒãÙ—ùRþÆýQmJ¤ñjHÖä-¿È–»ý«,mGÒ°ƒ3ŸL „ô Akß&RÏs¶‚Í"Ceü2òiÒjÙÈj†“^£ÅO¶«µšVüLykx,Ó>‘›Å ÂLGc7%,Àò1 Ø;ù™HÕ>³BKCþk³õÌ“*<ìcÄkí¦.8ËîD0ë§Ê…¨EAÖÆ|œ ‡L[”à±7Ê¥\~âߤkÕÛ^ٟؗIN¹ßŸ&èÐ-ŒÕößPe±Co/ZSäûÍܶ,g”'Ç_qþÀô;«Z·Tëâhœk³£çÕŽˆâŠ2qgÁA㦃PV|ä(L¬Ji_+‹ -0b"Æl§¯!ßÎƾѕcB²Š=M_xEÀ>(„`ür÷Mª¦’QÒÿ§TËžz:³[©aã.ï¡÷þíyÂ'*`ú$“µ¾ÜöÖ­vâŠËA:'>$ÝzÚ"¶ãþ¶í.|R¬©<{§iŽ!@Óž­–¹Ÿû¥LÍâD‰ƒ„kæ[¶4'D攫!¸,2E[z½Î(vºP`ž ãñç›)OÙ¡aƯ%ƒž5m“BßæÀ¥©d!´)T7 $©¹Ý ‹ª0ÊZÀ6Ÿ'pw<*áfÕfÙ„-ÐÒ­V+œÛ¿I %"¥} {­àÔÚ\tÂÒ¾L º4cè:|¼Dã{š "w¾]äR÷7óOfÒñmŸQdaöùªÈ».œÅyHr“ óvú$±ÜÒ“YÏL¤Í‘*UÊÊ>n _jh|éâÌ91Óv³ºâó¯íùàXoàh#µÑ»ÞÔŽ˜J9˜¢0ŠEµ¯Í!o‹è1¥yzh{¼ý™]ÂîªñþØñ6ÓÆ—Á#í¦Û|QØ+H‚kI“oÃ’zA×!¨|–£>Kõ+}&ˆ Üp•=bª¢„CëJÍøI:ÍC£ó ×kíx§}|rF‹TIj õ~‚íÇéçÜ'›Ì°r…äÉj ±YXÚÄ4×JȹeÊ™‰“¥Ý=îÇòÛQ íž½õy´S^Òt5?ÜTºµ¦¡…îùÆHij¶ôÇ™Ä-ýdƃô“[±£ù¥É«£N[ßLH¡yï¡ü½§y'µN§?áÎ c$¯örd™˜ö?Ê%QcÁ#Qƒgçôè<úB#Ãq8x»Ë Û_CG-‘|׈}?5weæhßëÁà*e1•>fÛ*oœR˜c§fECëá)]}†TÐ(Ù"9|=i_Gk³Ûo í+Ù)N ÄW)‘¾Ê™>šyYz* G`åËdãÔS»M*ß¿(Š84Üy©ëà‹9«ÙoÓp«ŸXZͱ%5Y',ðÎzÀê%uÌ5:pfGÆv^Èw«í{ÚÚ²3¹Û!Î959B £-¨g3`)kÙvEzi?Æb)Ûs¹¢¢n/~6¼Üƒ?¦Ö˜Žk1?ñ®A)#Ê!úÔ‹âû“K2˜ë{oAçpóq…Óÿ3x>uºß«>ž_÷XÚ6ŒÍœ¸é„ >Ìü¦ßolŸ Ò²ŠèhôXØĶp¶¥ R|TzkVämåöî±MJÔúþÖ D'1žÕzwW0?Ø3š¦ oÄŸª²42á†î‡ê¡—ƒ#~fPS¹ïaNHÞ©¡þïBë¡:ß_‡}Ž7Œ:]ª=´0²M±ò¢ùÏc(þ4_ ÀÚ9éNC[þ.µMÅ9÷i‚Jgù³Ú/SÈÙMEr–/)I3táÅ”"’bP2½úh_¸ƒPŒæ±Çµ»^bãŸø¡!òxWnI“¥k]ïV‘ \FfoAgÔ(Áq|x-˜¼‚({Ðd ñEñÉ—Ÿ€ä/Ka¬âdËv•c.ÏëJ±ü|)åÀöÐ É ÙJĽ¼gøÜêÊ€½"Mé}ço-Åtï M´—²§&é‹óñŒ&=W݆«úW¼…Þtòÿ'Š"uÝ·î¯øujj-£•Ìuáüpz89“ò{X:ë 1ž&M$ÈsÞ^ßmBˆ?`¦;æ^^ý? £üñ6öÈ£t=-~®å;ðüGŽ?Omô‹¯Ê‡—Ã^g¢Ïåâ Žös¢NýŒh| \?è,? ¾á\ÔÞ…1ä&òɨÚ-‹Dn`wg\Ûv÷hø«FøJC(‹i©ç­ W?·;òò¦*ОDåÎÇéK©*(zã 0ˆž—àÒ¢›)ƒk;ˆx^7bÍ£÷ü#f` µåVlšê¥AµÓ£CCú:`2/x¨~„V]™^ë—LlPi’ÔžÆûemT{x·Ëa"Ã1>• E.þÎA‰Äõõi‹œâìq5äW8œñÃEÞ—•´-™O#_©hbÖBkêåRÄL†­²Ïpû‘»ÝF"óô(Kº¨h,²2Y ÝYB\­®8ÀŸüwþ¹I'^R™;…Dø¥ïÉ6‹"Ü·Èé\pÁ?Ú}®”3ÓÞ¼Òcž¾¢eœ9H±f5Ðésd2DPbip4½ç'ÌÖçø4½”ÜFâ_ÙÐj›Ÿp“ý¨dHßu8þöò—vZhªÑª“\‰_ j;pb¡Í@RéÁ) »K[ ŒAý¼Ì•#˜¸Á¢]jBmZ @i͸ÿþ¹œE+ì !zú2¾XäëÉÅf†€:ö4¦Ñ¿ãŸÁj.^ÚîRì‹o¢Äje„pd`“>?%µêŠnsFžáÙðÔ½„G*˜óx`¶ó?ázÿRòXrôJ‚W4Ô ­9½aÌ[åe7Z"°ZºµÉÞóFÚNǶg´$ìwø•Ã*Îa¨.1 2áþCþêÐj5˜^/ÔÇ° ÄßZÈóÐØ›Þõoc,þ¬ß aÉL?p5XKž›ãtu#k lO˜TŠÂ„oý|ë6>ØåE?ÓRƒMØ[2zóúÅ¿à[•,ppÕ—ÎÓT–/æéêè6&KÒ€Y¥¢ADùuÌVG=%6uuÈÕò¥¤¡<`¡x·Ùí,Ã(A_[XW)Ƚ¬L1%:îˆ1· ÉZÝÏ,FüT™ ³–¹Ð<ëý¡h†ÔQ¹…R§(ÉÂ|ë–ýˆz|šö³ÛKË™¼Ž;á»°É:„P³Mšuº9ä>phÜ…nB¾ÃªùAêLÀx01=餷 ÿ1O„ºr˜å…“ Í Êδ¿œONV„K”;ô N¥ÀH‰Ÿ‚íœV蓤ã+êaã­3>±dšÕnÏu~làÚ*:ÿ —_ ûÎ\ˆ~Ø¿:ÓL«&Ä:¬Y¿;À€IÇÁÏ~¤ŠááÍóy(¿È—C––¹#h¤¦ŠRp÷ËoÐl½ZË ãƒ…ÃJd0Uê”åZ} UÏù(Ï=é‘ï q¨³¡NZê$3éOm‘¬€=1¢æ"úžÌºÕKG­¾D4Ó lÇ@0F!àóud™v6.‚ÜÕE~Žñ-M,(]- ©Éæ‹ð “Vº¼âT1BQ®B}¹¦@ÊÆÀþÙöõTø Ï!”˜î™]>¤U¨OB2ÌÌ®˜Xû¾Ó²]8•±ÒO5×ßÇSÛn›NhÕöDó{…ÓÓu5ëýW0¶¡n¹š¿Äœ†=#Ø°\öíQµ‚éÄIÙùúq|ë ò±bíz&of+€™ ÖÀ&ú›1ñcŽOy+ί3HGÂQ…ŠÅä¼ÀÜ`¦éÓݵì+2Q0‘‹qàõ‰¤‰’›Äc X…«¯ î>K„Ûl"U4[‰>rWâ'qd˜·:Û<è!·þàÑÒtüKÏ}ï»Ñ¥+”|M4Ž°¹#‰=ÔM…)DQ‰hQÊ̤ŸÃÔ¼Ýùm¸xËÆÕ’8#j”Êbúòé.zËq|Q6t¨L´t}6X0±ˆrüØx¸v9ŠÂ3÷õíV“õ;)\â忺½b˜ ëÿÅoQ*%Y ˆ–rbý¶ KŒ†™í(-ÛLa<ª™,j2C(="¤N€'{ˆ;O8­°Ïû…@¸cp»:¿ÆÙêŒ 8%qÃÙ›ºl¹\ѦœšÈ¢ö|å:Kíg¿šÁõ2Úöwu ,°N"‘0¿#^¨ÑàLÍÉâ« ðg@Ë´cýw‹Ý{¾Ïë^71ÂsV  ­P†BÛ¡â2u°-ÍPZçÔuWÃ'X…baëˆÑNñ¹lÞv?*„ëÖ%4VCXøK÷ô,+<-léÐꇻG9%¼­×{銊øíL¯YÇi•yù.ÐÇoE›7•Uo¢øÆ/˜Ž6†—C×yX»îÖ±Êcê–¿¾Kɤ%ŸUŠßöÝúÉÓúÑqZ±PÅß-^¥èçÖàó /%~‹Œ*ô JΠ•rˆ¸¶4jbÅ1;î(ÇXÄC™¸ÎVÑü ÝÖ_™«†¸óË*ÇêÿX —7‚†?—ƒpü‹òòtò|pýȾ¤ Ý õéeU¶, !t—ûè—ÑÐ Yá04—eœ¶ìÙï3Ιæ;‘ú äokZŒv¸O %„¶àÊêõ¦îmúÛèö‡HOvTBåœ7-¢}ùÁÛÏ¿u­l+¥r8kIW¶›¸(çºY æ¼ ¸®Œß_&SÆîÃMįìiÜf>ÝÖ‚ˆ/J…4â5WªM„Ö›ïN˜Mø4œÞµËYŸðmaOËaå»i‡†þRZ:?ƒçžf¡hPª&«œô---‡VΚŽG11lаZø°¿isöÚ§n|–uÏóùzõ"ÇŠ M~3…ìW©ãŒ¿¿m#د z±O«.Ê3”ÌÙ,aðL¯=zzãÚÔZ<ô5Ê»°¤ññ~Æ&©1µloT«ªJýy­ýdf0”­­hî’ªX9¡æåX5LDK4%„ !žÏ‡&×ÇŒº:ç(÷ã[ ¯šáüR‡Ú1ù¬‚“«ÌÒ‡D Öƒ2Ð~uÁ'å1}‰ÅJsœRíŒ#B©¨ ÈÞzžˆ§½L‹Oƒ‚uë­¤¹ìŽØ½›üAƒÔ¿Î¶Ô¢K•ž- ÊaéÙhèYaˆÛ’úGÉFüp ±ù¶Ÿ«UF †Í¯¦R¸´4ᤠ]3"RXJƒæ\ªA€~Á»¤ªõªÿ´‡|iG#/MŒÎˆ¦ó#õ?|?¼0Yý¿–Œ9vÄ€1-qÂJ3îBYQƒÖªÛve´Ÿ•ªYñ³ÿŒwQEë"ëäVpfÊ0z> Š•zts ¾ÉKH¦A ‹Bè)Ú«ÕÝ"Ë¢ð2ÿï2`òÙìZúô˜Æ’I#V9„IÿhØW†£òIM 1à¨OQTtrz}"O¥ç%íÄÕÑÈoh°Qƒ¯ÆÙ¿|Ô‹Ê ]6ÿrAêOû#.pO[8#bXý8úˆÙQá¹»¶H>©IM¿;^Kz ãöúý)ÎŒÏz>„(6Bî:•ú'} qØŸ0ÞƒWp(ÄuŠ&Í’®kb ä7äwì‘t—ˆŸÅ 9–lö)Nbk]?‡zGïgÚxÚº¸ôÙ1Ku¾åf”×a»<•4@øäλKa&G žéÉÕ·Í·PÏÉ@KQ‘S¥¥|Û)[¤„Æ_"µàNhGªý¢œOçõ‰— p”wB'š<aÝKYZ_(×D' TBD PK†ÄY/™Î8…WW¨8‚'¨p+gQ£ò^΢Ⱦ´@ãf¨‰k¥Ä5r#}žhp{nµË«‰—üã-´ÜüE=ï©ö*#kÅ϶°wb_¼RH,®ÓNiþ1[LïßµRbGÆtP×fâÓm»ˆãÿ¼¦ö9'òš+¹nÅ,L„ r,ýÇ5ò¹ÉžêzT”uŒØrñ3Z´îßïórb´«+^/yÇ„’Ú̾­„~Ü}¹±æ8t½É+¤.â¤LÎPIV’)(œ.ÈZÕSÈÌÁ̳ÂGÖHkOygf3,9‚Ì(+6AÐ;ò€ 9¨ì)N1¾ï!|' ãs^é`¯ž¸L»À£sõ×õðö LjŠ˜qˆ§,Ñ\Ç«·Ài(é’ÒB€ÝßX‚ b{œÍ‚˜€« ¸1RÄQèAxÌ݇¾ŒéɳäŠ-›ÂÈ]!=`ÎŒýýd£ÿ¥ÉJü*Ó“Ÿç“ãâW—\¿ÝúC«e95sê‰ÝB#oÞ™'Ï0ìX¦ÈÝc6˜èö.ö$½L‡ÍÒ«»]9.Vü_o ¤i82 ðÌå}ŒÀÖ+ýµ9ôU¬wýôyd›A£ˆiؾÍ[?u1dèßÆŒ”l'$T-€¶wê¥úG?E€6ò¢«rÍ 4 ™ÛI™:ÞÞ„öïßâàÏNìƒp=:ƒTiVë dî¤Uú8%Mâ¸a`à÷tá³ÎçõÁÌ´ÃìDz¾E;Õ¡š7‹"8~gI’ts³ ÎÀ óߙ供Mç”ÞÝ"µqõ¿íZ®È4ñõK¦—•RxÄG?AeÇQͨLœ‚®—½…4岌ü”3ÿ+ó°R.²–Ýi\žÁÒEÆŽó d”8’` ÍÐ¥AÇǘȬ”½{óጕ`"²ÝXlÿB…ÁÿÀ×´aoƒUåѳU‡D©=¬ n¿'ÕyK›f1GPj q¤r7|.›<0S&)OÒGÁ¿~V"Ì#QZ`zÝúT~…hɈYpd,º·¢£ÔÝ*Þ£"nåùø…Š'}j Á»Hø9)Txã·å=x"A‹KļUŽ±º^³½ Ю¸å;ºÑ±áb~ÿµEÀÏj¢ÒDˆ´>·xE´æ*ð½=øMǪlõ¾M6àìÄeÕlÝN¤ëFŠ¢L*ËâŠÛ@kÈ –_‹&$€— ±xâ[¹ˆõgWŽB‚¼ ]„]Õ¼ÉW…Ånçû“"„9XTÒ!yݘeÞ·®F˜Óë2¥g§TÖ„ZE¯BdZ-ÆÀ ñ¼A:$Ñe íEá×LvLCzÄ[bF„±9þôMëÈ£ó—û¡gú½&_ùe‚'aÓ(ÈcéÓ—ØËÛç¶üÿÚôD}GÞX—IÈ?ÿÄ&“ÊåÑZW|ÂLoéšY4œNXäÐ]t=Úäê¾æŸRͶ|¬¾7x¼›!4].jû áCËÔ?öë:e“ÒÁñj‚=ʱͳTj¾Ãï£ïú&⧡¤CIâÆI\@þ™iv»ò.ZÍÁ‚øj¶/ý Ä„ÁQðî\!ú;Dèæ kMŠ9±ÒVY÷C ÑæaQëð ’ÒÖE·§ªF©…¥Ê‚*U“UÓœ¬#±Œ×¸z¹{pßV¬5ÏÈé¯Ý­ Ãýi¨¯b]}P«óB»Äwœs½‡·åÑObW·Áƒ±#ÁñsaA÷Zn·Ù÷õîk:ó=å¦àßW¡Ð~Ø›æB^“¶nè'+/DEÇ"ìDáWÎÞ­Î¥ëºC!ù ËB{|šÉ§_^˜æóX]ñæãçÓ?3cá“á‡\Óð[Ý¡„<ÿ½l3H—;Ux–"GqHg`ScŒ7`Ì@­ùßz0a›4Nér=Vtš²ñˆqýñø>r£=¸é„óK×BÒF…6Èùö°³äÔ8-QçÛ}-±:tUþó_ò¹-³ÓTnƒy«ˆ¥rŠú¤QÓ4ßmÄßççëZ,ý¨ÍZK€pû¤V÷ N;ä6öGýXT›Ù¤L@/¢$\lŸÓØ0gnJÚÒP®.~®öÀG5•E®p‰%$ùÙþ1 "NÝο/ÖrÂ÷µÁî$J03 $2º,Ìb–ñº5{Æ?Æ80XD+â5Ì1HòO…’è—S%&—]O:(Ùd@~qãH”¾×áP°«Á”?ìüØÃ%€7öõèkOÆÛdò³8;¹¾1ìuøüs‚…ȯXÄòÎO±2É£ôAtUÙ$¸ ”m,#p!)-žm©1ç(RÏ\?Y¼LÞ¸è‡=Ú†ý"!“C¦)2Rt. ’Ì•{¯fÊÓq€ºê-?57—Ž ïr{ÝÁ&rîï+!¸÷MÚGG"ù™1:âÊDÚR4þl0˜¸¢oå^¯sþ¥=¯äX‹åÕÙ’¨G”a=ñ!±¹Te‹“ÔŸÈ€¬-žù»&‹ÅôD:‰$`0ˆÉÞwkSRŽuÍ °;(:Ÿ‡òXra~Ïo¿÷,BœÍ]’P¦§šiâB<|ØXF¹§¢bqT’ú³—ÃíÜ’¦QÆ/ïáD’¬Ên95+Ɉ0éµÆn#ßðEž{\²Ýì£FŒ.Ô}Ú¤æs i#aÄ”vbçNÃ꩜ȧGü0Æêý¨ŸBª“:Öç1y˱õþàËTâsŽ³µÆî£ýoéîàø¶Ø#Ü`':á×b*Ö 2Žt·˜I¹¨‹‹ òº$zÔYH²"_#¯Àï~2évaŠ´ž†ÂÅ0>¿b=¦ì>ù+£”¢· Úì¤= U~%Æ xϨʾ{mç<«çôvH˜1\eMò@6 ô®Ë¶v5ÂüF÷Xá¼ ÅLA±70™y+\ýÅazY¸^ƒ\³©¤àpääV_†ä'NzóÌ¢÷Ú¿ž÷ϾP"ż-¼È'“ÂPÁ]å% 5ÙVT¨‘zE°\Š…÷=42!3 @¬‰}ó¦—HŠOf¹¡N@@K§/Öä…_róQÎr8I§Ì’VüÔoÈÃhJJ@a終ټ.çÅ;^¸˜íÔúÜŒÀ³œËÈ}Ö„ùå1ì+íØöëÞ·QÀk:ÜÎw†tï]7Ü,!F|•ssÊy+ÅÛ_$I®Íþ’Üùý´Í¡ cÒ<ÝÅt«.¥‚²­yt¶¿VÁá~—¥CêùÕ°ãlǵ¡Üß&,œ|Ý;?”tþ•²¯G¿aÇ.Þÿ \ž1µmóÅe†ÙÅh:Ó!L’}½sÔG$†N:2oWWÞ.=IÅË= ¿<¬pX±ûà¸!o÷öVì6\GQHè<öµ)7AE&•‘dcaïßS7Y)áRkâî—–Ù©s½¹În—€éƒ}q Vñ4Xcœó¢Kp*É5WTù©{ŒAlš¥™ ®WcÊ݃Ÿ“ñžû{)Ô4E{ºd1_d *‰:©¼ /|RO4&µŸ¨N££Ÿ2êDŠTfÂ&ÙèÒ++Óƒzî^@]È3…é¹÷ 0t¸¼Ï€õiY$EÕ©†Ú/ôZ†U)ôÚ½¬ŽÄ‡òÌ(Ôì[N”^ ðé[8ÜS\4Ñ¡b¸éÄتº‡nD¾=s!`M*y³ôn¶»¢£ÛÁá,.«ÊÇÊûo‚ÈòãÑ<Ù…V÷!"’u!ê|ÄD‚¼VÿÓò;¢6ñPFÑÝóÒdêfž¶PÕ*óq:Œ.Z[P¾õ‡¶ŸBô×ïò„ jøvK#Ü+>ÂÛÉigÀŠuX›HÈMèoÍÝÑ_:{O//=e‚¡fù†.¼ 3IG3Uk,Ð@ÅkF@#öz߱à òÉÎ?ÅÕõçêÇHÚSúˆý8™pƹh7?©yÜ‘rƒgà´ˆdTÜ^éú,â.*`@½K‘Ösæip‚¡{ð³j˜¤ÿÞ4‡ƒùîT4K ûW¡Ø„w‹·ô<7Q ïj̃pÖNO’ ¾ªô|l´¡ !ÒzØGöçÓ˼á–Ü„¡…2CýWUIJ ¿KòÎip÷*7 ;Ežó@C ì÷[[°46IÉp‚!Æ\˜8† Œ*yiþp$4M¦âœ¶È­lË”µlxoù1!§å»j}µPåü`º^ë|œIb;ÏYºÅÂñœ™Fâód`¥èkB”X@t1Ò;˜ßÀô¢¯M#|éPýÜ×?.(sÌ Ë q>Ã¥†Ë^üøãí—ƒ,† ð§¸ŽÚ\¨ª„¼ÿµÊ\ûŠ¸e± T[¾KzJ ûk{j|^°ÊR””ÝCôh[/€LÙ¡øßèQ«=¤–d%špt×½„t‰þ€áíUzç‘ÉÞœòU.pÒ¿`,¼fªeá, “Üõ¿¸žèÙxó7ÕHŸX{€WÏ'}Ö1¾R xZÛZbàîu1ôœ8üoûÀò£­o~‰w¬ü˜°)v»Š²ÑUtN·s ÛAñÞ¾c¨ÝƒiÎ ,#Rq` ¢S)›Vižc #Í`–çŽÀÖÓQž2­–©(eç)Œ¤XC=7-] >/, ‘±VÓ+ãï¾{¸9'‡dïR;ák™Ml¤ âŽœàèøI1`àk‰¨©½^²cÒ•5iÝ(t²ÂÅßË'{Vßnï\àÄ„¶~ J{½!æ鯽s6ãj1}`â³Y³Äó£cû¹\ýó2ŸúÛ<öÙ¦¤2²#¶‰ðÛ^æE©œ×Õ¿¬.Ò‰aäK%ÔàfË<–—!ý´mP`zœ ïô%Y±°,)^ï_3°#âˆH¯öohKðž%–ù°{¢(uª›+cæÂgηÂT@©ZÉy5ѺÔýVgy™G 4®åy“•9åÒÙÐrÌ:øϾY€öIPæ}Þ$Í?<Ž°ôÛ_C[rYnTø$<«¦ endstream endobj 573 0 obj << /Type /FontDescriptor /FontName /CKSARD+CMR10 /Flags 4 /FontBBox [-40 -250 1009 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle 0 /StemV 69 /XHeight 431 /CharSet (/A/B/C/D/E/F/G/H/I/J/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/a/acute/ampersand/b/bracketleft/bracketright/c/colon/comma/d/dieresis/e/eight/endash/equal/exclam/f/ff/ffi/fi/five/fl/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/plus/q/question/quotedblleft/quotedblright/quoteleft/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/v/w/x/y/z/zero) /FontFile 572 0 R >> endobj 574 0 obj << /Length1 1430 /Length2 6437 /Length3 0 /Length 7406 /Filter /FlateDecode >> stream xÚvTìÛ>%1:¤‘I(½énI ©16±Á"(%)© )H(¢HKƒ€HIHH§’RÒ|Ó·~ïïÿ?çûÎÎÙžçºã¹¯ç¾îçŒ÷º¡‰°²#Ú®Fa…!"`Y ª¾± ƒE¼¼¦H¬üÀ{ŽñB¢Q²ÿaWÅÀ¡X¦ÅâÜôÑ( Ž·"„HÊB¤dÁ` (,ó—## Tƒú ú"@4 îàUE{øcNÎXÜ)-|0~ DFFJèw8PÙŽA ( >ë wǃºMÐ0$ëÿ¯|rÎX¬‡,äëë+u÷Acœø…€¾H¬3ÐîÇøÀ¿è  îðßÄD¼@Sg¤×° õ…bà@à†„ÁQ^¸o”#Ä 4ÑÖÞö€£þpÖûÃAøçÕ!"¿Óýý+õ; ƒ¡Ý= ($Ê ˆ@ºÁ·5ôD°~X! åøËêæ…ÆÅC} H7¨ÎáwáP †²Šã÷';/éõñBºýbú•wÉê(GU´»;…õüªO ‰Ãp·îúÝVWÚøÇD9"~Qpôö™¡žÞpmµ?=pàÌ ŽJ€Á`)0î „ûÁœA¿’›ú{À!¿`\ýÁh GŒDÀq?€@/¨ˆÅxÃÿÓðï:"aX Ü ‰ü“ÃìqÇ ý€wÁ8áA€à_Ÿ¿W68m9¢Qnþÿ¸ÿn.È@O×ÄÄDð7á¿M**h?` °¨PXT „@DER¸Eð¿³üÍÿ/î¿QC(òÏÚÀÿdÔF!Ð@™?(àîî/>j‚ïÏqáþû4NÇp ß?²·K€a¸/ÈÿYü¿Cþšÿ•å‘ý×£áíæöÛÊ÷ËüÿX¡îH7ÿ?í8{cq¡ÆÍê¿]Íá ±>ÜéíþßVm,7Ê('·¿/é¥ôƒ;"±0ç?ôWpéÝ(¸!Ú ùë™ CÀàÿ²áf æŠ{J¼púm‚ãFéßGª£`hÇ_3'*! „b0P®ñ¸0‚NG¸ßo]A"(4ÄÑ "ÐÀ¯~JˆA´7æú—‚p¯×ß{\Ã@Xg ü?0ñEÿÞÿ«˜7ƒ›ÏßZÁú×þ÷c‡ûÁa€‰14ìÖ—·ÞU(³ù /÷Ëó.›gð N`½O¨HRù_g…Íb•S{Úh¾.ªó(Mrž®×½#‰¬O6j8 :³K2ZnŒ2~x¾®\ÙÉAÆ.lª´tîtç¾+a~³o®§·4•a>ý‘o‡¦_egéÔ§ˆ±e£•×’ºäg¥Ÿ…ãÌb­ï¿áÍsx6ÊÌEŒæ  Ûñ£98¦Ë¸äÔIoĉZ͉ÆL¿4õjaáa±bæ < û4t#Pe-M‡éK`qáLÁˆµwQ´Ø×<ͱ2)9d’ôÅnÂë+Nó?7šÉk{QBšQå“iÏWÎ…Êî•{H¬¬žrºïÑlŽq”ÒU¿åj>{.¥zôîÉÕÉèPîë¬òò7S8w0&}8&95÷YÒʯG€(9(5¨ôß…t"@î×Øòø²¹®#KZsº¡ô gdŽÉB:¶eUÙXˆ„vlÂló«LL¬ŸØÈv«£\K† \nû®5~õÜ Ûq½!”¼b§úäÓEOìW2Jñ°¨Ô<*™?;9mô'} k?aYœk{ÚJLªýfœÕ«š”vÐ~‚ %yš@Ÿbjñ=XÉRʲy§º)i+é|”õcù[‡V¤´3Ü먩ˆyò §^œ_#/é˜Þ§öãáÓPCŠ;[ËÅŒã‰-HפZ{—íÑ%û–̪Võ23~4éÖ÷*órÄ£Ö©–ÚpÃÓØqâú¢ÏP;žío4¯({¼Õ"ÆÅâHÓUX¬LþÞâkÙÅ~msEõó³CÇr9±q¶Ï yó®©RLÃÚ™u ¼lgkÁÃ÷ã7§–MŸ\ò—„\åÑæí¿ôœ{l¨Í])¬O—<°vÇϵŸªÍ¯sCiæýÈT½Õ¬Ž¤sèö«…IygåÉŠÙþOIJ4Í܉h‡1Ÿú0¼ÉúœsŸ:o¿-¯“œÜ³våføZ% °“5'?{Tí‰ù>­ùôf`;äK‹’c¿Zˆ¿¦)U­ü¶Ub±zÈ@âWùõd>^ÛâFè–Z&þÚ&Ögß?wv-ñÍîlºo׳ êYH®Ð±Ç‹‚™íg¢kLõÜ÷Aø‡KFôñz?²‡QèŽës¸¿áì+|S˜µs6N&hû­vÌG¹ò=­Þ{¡éÇYêþ±iQ£í§Lгgþ.ç9I÷ɨ‚ߤj[ióºÄQxÊþöuß¼aÛoÉÇ ã…ã>)|„ûCâBÂað¶ï‡ HAÆÑ‹éŠñj•žpÏÖ´6Úgqe줕Ây¹Å¤~ê›[@žƒ¯qŒ‰ùbè÷óåa–#‚à@A‘“óªÐN…¨¨›ò¹÷kº´uNÙÛ›O‘ª\^¨°Š\Ñ0Y Ø‰¼úÙ¤Kù:øÁˆ•ÁGQÞëÝßûõŠøûŒÏ׶¸ÓÞåFÉ”²ÞÚ¼#R¾ÂÿÔПŠ\**ø«m•»7›ÆVÖx—èIL^ÊË ¿wÉ6b¹;¶ºn„œýwü–?çR/”¦Ö¤9Ê[é\ê¨éhR‰ri¤Z}Ón’aŸhmKÍzùôT°Ð&›ÚiqÓPÕ%eR“D.±äaq8-­þÒ?˜š±MEóe]kÅé ⌺]P¾”Öûò>v¹÷S–M²Ø· ò'fÁƒèÓ<¥X²½»TšÓ6~Ý2oŸV#=^@÷INsB¸>6'é;Éhíl²‡à©ù¦©vQSˆ~vV»þ¤"É-¬ۘÅè7ý©G KeÔœâ7H5;1…ÖA’™ÅTOºõøá¾mEÌI_Û3T1#*‰°Õ©ì\±‡­>€Ìô¹ëï^Ê‚½Yô×Ú󕯑L¹zŠ™Ûªà•Ü|6ÍwNÏlYˆ×팙w¯%˜Ì+âyÓãMvPœl¤[urVT§F% “PïG?ÊO4ÖNæveð¯'Vy½–_s·»–ÚìMëf«élÐÍ9N¬tº>ÇÇžžèEéGÔp"y5y‚ý ‘É~äý›tßI«o–uJ.+.-¯£š•së³²+žp 56cF«ýë,Cr Þ1#&«Gy¯v‡p<ÔÔŸ3 ‘7ìÝVpÃ[Ú×£5õè²üࡳxHÁe›1z&»5‹ç’üm±xVvôØ_–M³Ök-!+ca6t‰!0Îœuâ¶Ù&0÷¬ÊÚ¶ª-NZl}ÚÚ‹ÎU%|¶¶íÏ•MºþÖ…[°k¡«ÛúÉX`r_Ê=ÿÔÕÒT›ÁFêÛGE¬S¾êðǤwN÷Nƒ€¯ƒÎ´m¬_®f«ªÐM+Žwtx”ʃ¶]kŒ`Š%ø^ÌÚ”éï»ÃxNCK¡›C=p}7” \¾¶.vDèéC”.¢QnÇa¡œ–§|øHÂ\Åß–€&8Ö\adX4àvªç Ñ‹÷<+ bÙ¸²/0Ú=!=_9y^(x­Ìl_WX*×wKœ”¬ÑÔj7Æ(Ðò¿²ö=¨únz#œSYT¾EåXq«à}+—qm ÕÉ®G(¤úô§§ˆz…þ4n*y ©hãðI<|z?ûžÝrAÈL02yY£7 Y¿‘¬çhÕ¼/a¾—I+².þ">\d«Á–·O p£’±Wm"hÛJ±róÔƒxsÈþ+ J59ÃEH¯‹Íqôy€NýQjî4ñ÷Ç ?ÔXs í.·±ƒè¼¾=ݘÔD½˜›°Ò˜ƒ¼ƒ²¯ì³‘¹Ü™LˆZ…ŸÅŽs%ÅSܺ׿p×B¸<™ÿ(Õ~P¥¤„®îG9³ï¼é¼36­!Øë+F?“¾ÄolAÍÍQ[tœ/Sè þÃ"šë-·Ãµ/¡^`6 /B#ÔàÞ¼ éÍ̱¹F1#IغCöcQ¶/¦“¨-‘Ͳpàƒæ^¶Ô R»Îkô;̳‰µ®|¯4.ݨEiì3vK<±c.'¼ob&*ã/¯÷¥ïöyÍH¿'ì_œŽ LKEfÔN|S“ªëaT;k8.ßã^~}0Õ‚V?Õ7ƒ=JP¥Ÿ©[ßï˜(?çJûhGÞ`ô“4 ܸ#šr€©†Vyœ%”›‹â!u¸z§=³Éœs»ŠÁxÇ{ç©íFÍ;)QîˆWÍ‘;/~R Ë5&êŒ ©·³Ç·Í>Ê*¢_yRTÒ˜[S_|¼úc™3Ç3† ˆ‰Épï#Vîàª3þbU[Wß¼±Ïk©GÔêxa+õV ò¬ í™Çé$Ov:DzŽ ¸¯68›Ð+Wn(ˆv̇“ÞUt£æòœá£Rû~;"òÀÛõ€PÜ.˜sª+›»„¯ÐÞ 9êlPFFÓ`§ºürBEnA¾Ìi]÷6tm¼¾y=r$™Ï^§÷Õ‘È.ã‚Þb‰ IÑ7Tº^åOûÄñchió«±¾Rï†7.¾jÌ™n][s)½K|¾ªÏÍ®ZkÒ˜Î{Lª XÆ.b;Ò‡e߆¯ÓS4>ˆ€8µ;Ùk>;ü¸RíFV}ºpÇmZgW¦Îñ"8D§g¥º~ßá;ÕMB"3ÿ nï xÁÚôÉš€\>;qg0ñåµàèGr÷¬ÞÕ@¨^î¥ÚHU§/¢Öž§®4SÉÓHF®ÃB®qÛ¿"BëÛ×jÏ-=ÖTauÎiÇ·ñ!hñßQ@¨R¿)’Xê’°©Z1<ä-Mñbà÷ø<ðsÆoçðRë6“šñçz§ѱ‘S´ %%Š ¡ï‡JS5‰O»ÚÝ„xý¨è«Ìç¼W?è´˜¦ç¦EIAsû$ËC,ÝÑò 裡xÆÚbX\V4ô°‚1´ô¬®á oC°]Í3ƒeIº<&ñ¦ÙŠ¾^E™T„½·l©'Ä­þýÂ'¼wì¼VZ1”ZiPîí¥»bÉvûƒ§ mµçÃÍ–[éL-R£¶fàÈ®úöMB=‡h‚€¢§dS6Å_O‰©TMvò=Æz‡›»/­»£Ž;™E… ³¦7tŒ·U½oƒÔâ¸+àMýÉA½§Á×tN|[F?cÎ ¸Ýoiš¦j³‚é|ø~ Ôe±­*Š4"†v«^CæÆߟ^BGòÀþEäæ-€R¥¹êtïO×hQK­9š”DMžu‰Žƒ‘äôÛU º‚÷)Ù5¦öDÈyu¿næ_~1Ÿ¤¦šü6cnu…"ÕÆnD“:jÏP”¸jú’]õ8­°Y ?ÌLÛŒ‰½¥1xMsìÅ›çM²o;K ¯n0ZD ‚´ßØôøy‚V™!¤‘gõ^È"´ÐÏ5rf`-õãÊ›]_ñ-™^w ½èÍ+è`üÖfZtSº¡Ç#õ¹Ð+õï¾L‡<±ò9‘ éÈÍ1U+‰LÑE4êkg„~Æk(n59bÞü­C5tôºõf ç s~Ý~_º †pú*š’ŒÌÛjJ¿‰ÈGõ­]þÈ4=È(l.øà2m¾¤Z¾³uÌ÷Pd0Ö«³Íx^8#ÊÒ2X13ëå÷yáXÌ™8ÓܪA;‘¾±sws§É~0'6êÓr{+<0mƒ9„ëÉ:räçlf½YËÕi>ãÇ”<¨w^íˆÇsÃËVÀ.þx­ôÈyÊzšq›‡Éý†•³Á}’[$•ÕÜï”5%U«9;»@t—pÛë 7ŠÏö£íJ6Ò©&”ñ[µŠZ·LïQïi:4*íwÃêSË=€“ôT×âdj°BÐØÔ ’ñÇi£/ó']|g×DhO'ú$VÈ?açóÝû&7ÜzW½ÍŠaX†˜vaPg¯Š„9»˜PZÿMØøÊú};–‘%â\By=!€Y°Bpª~•¢;ÒM8w¸­¨ª¼ãPu•ÌÏâ&þIr¡0tXÆHo5ïŠÔPÃ^-Þ&Š$8ûê‚ÕϤ·ü/¤=ŠîFRù~«íà+ãj¸{£Ì;_¶G€ðæ©÷–pYŒ|FqFUåå4Êvø`'«Ïiøhõ¶¤T=`RÎám”|Ï?`"rMî-î?ÎeÀÀ³‘)†xrâÚV„|äKô›â—L»ÇÏG©Ê9#}vɉ–ë­` ­^ñ Aý)-B¬ï&3p0¶õÑ()_ð±[è^Çä{hˆJÁ¹­,I (X˜á0°— n/~ZHЦ‡,¹-Z3ÒÐ:ב™ ¹já÷v”$¤hë…Åå9ó¯Ý3èï/žb\,ÕU Wa‹ì)ìo¿ ••xO­¿‘ýt18)èhÙÊ Á¬ëgüúuîYJ£ÏÔªiÙÚÍ€º4ÛOr`P6QÌ.„Õä'“Uµ9*ó|žd7j˜Xåp…I— „ u"f'(ž!d<ŠÝ¥…%hÌú»™¾Ódˆ¬j:æ¯Q= ådUÖY½Ê+N&75Rì6 ŸïŽ_*“ÛCô8=ŒTœ¥XN­Xr+µ„Ød¼c1u.}1_ã·øá3Õœl è9#ÜlI¾…ÒÍš•©Õ»ßJ[.ÀPf_/¡|Cغ›ž¹Í\îÒ9øiJkwÏkûsëÃà®f‹N8Âec¹i]ùÉ.b¡•PS¥á)‘¬[psJl:O­ßå Ðg°/òèϱ•]¸/8òT&óÐc‰à+cnRPè׳ò(J>¶-_±(ëoO¬-²•»›3ï‰gÚ²y½™”ì±>) iæO Ï>˜ãØ(I$"¥Q諸šÃƒŒëH8f®0ó4ÛßDŸ°†{†•§Õ…rÎãù„™²Í¶Ìft ¬)Y7ò~ ‰€«Úm(´ÓóXHÃTvko") sP9F×ÞZ|ÀW& rŠ‚!3$*”+ßž0Ù fÅ~yºÚ¶*L=Lª^pàê²2°þÕåÊõ˜í‹Ä —ChlÈËE‡G êåeö¢¸[5ÒÜ-§JVC‚ Ô<^¥›²›JZñþ8Ô"ƒÑœub]JwÄr²&­¯Rh*AàzöBcŽ»™òÅÚGAs°oâc¥›Ixº3g¯m+ï‘Ï‹9lóª°*ñ”ê;VoðHó­{%?2üh+²¼Ü‘M2¸±ëIKÔ÷U<ã ‘'P|ÇÒ§²íƒV5q“ 0ŒEC.¨˜PV"Ù³¤°à¸s£¦¼D‰Ò"€–béô-÷’–– o¬Uˆùí8Å;¤bb„ä‡ïgÉ â“äîrQp5TaÜ_³¢Ò×3zÇG.Äô8Y¥V²žuU¦¿_7&²7Ò•~Ãi}´³5™Š;來ʕ_J3ä=¤ôÿ‰êµ~o8{¼¡Qgûª ¢7ùôÀú!M…j“†Ãöž›¾~@œg}ïBÞŽöÔk¼ éZ„E™ðDÿïdváíûÃ*¦w1i•LY2 ¶xè›f{Þº{4é°ˆE÷X><‡æ{QLç´U ˜YêÕ«ÚÝ Ó2'R¡ë0rB¬íwšØCØh‹ã7îú}š"Lø{,’|r‘äµ ™,~éÆ»–½{=l;š”žp{ûʉ/:Ð]q.õxÕöÐ )°±Ÿ«¥„0Ès¢Êá°wäê¬ §c.~‰!_X¦gõÂÔ‹K°Äš·›1ôÐ0Ùù=%˜»´ÿ¤ÁM5»ÜœØ— g6SlVè¿'À9ˆ~£Û>4UÄçj_zò¦Æ=„°Böh1ÜyÅm60>e¾OLR8’Þ­lD‘éþÎD¸MÅ(~绽1Q½º>mý'Ö·“ào¶™ÜÉÑ)•¬K›kÜ»Ÿ§ŒsSî”xˆÜ]Ú2{ÃíÂM­²ä“%´•à9ùÍÝ»Õ å‘<‚1·x g mœ¶ž´)ùéW½é÷i(Õ¨-ÿ|eº¨å¥ÞÔÕ7öí o¯¼d³#v­E¼Œ©§¯—…­?³Ìͪ€êš’/ÎD˜™Û m?¸ Dú}ŽM?.½6À}_‡=Å?ËÓ¼»xNºKÿA^)1ÉÃ×i 4Âø*f„¦ŸIuy^ç^Ñ m |ŒJz€kâ¾¼µµÂTÿLš¶Ëñ™i¡‡\³>[ôìÆð=´«"¿&>ž!-þöNŽá.'—:áâ‡DjDë–Kë-]Få9^Ýú%ŽYš÷Ó×µH™ÊƇž,u½ó _»ÎÙûN ÄÈ}ôK)u< ‘~Ú‹/—®tÈÃô\(´VÔäïs¹kfÞdU³Ç¢[Únñå¡ñ çêƒb;«y&)’|„ácëƒfað• ››,µãÓi‚‘«séBßn/×E‰ñÅ}AP|5Ë÷TT©¢)IbU>'<…|Èæ J,·åKU³ó_U¿xüôŠ9j endstream endobj 575 0 obj << /Type /FontDescriptor /FontName /NLKSSS+CMR7 /Flags 4 /FontBBox [-27 -250 1122 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle 0 /StemV 79 /XHeight 431 /CharSet (/four/one/three/two) /FontFile 574 0 R >> endobj 576 0 obj << /Length1 1470 /Length2 6400 /Length3 0 /Length 7394 /Filter /FlateDecode >> stream xÚxTÓ}Û?% ’RÒéÜ@Zº»Kš±Á`lÈFw‡tI ‚Ò 4 ÒÒ Ò*è;½½Ÿç¹Ÿÿÿœ÷=;gû}¯þ\×çúng¬úF ŽHˆ* ¥J:F …‰88Œah8äo9‡)ÄC"¤þÃBÉbÆÈ”íÑC$ é €D 1)¸%ÿ6DzH”í½`ŽA€&Aq(!Ý}=`NÎhLž¿Ü`HRRœÿ·;@Á âÛ#:öhgˆ&#Ø0B‚a´ï?BpßwF£Ý¥„„¼½½íÝP‚H'Y~€7 í 0„  ^GÀ/È]{7Èh‚Dcgê/…Šö¶÷€08 A 0.žGˆ“`¤¡ Ðs‡ þ2ÖþË€ð§9 è_áþxÿ Cüv¶ƒ‘nîö_ …Á!=UmA´š`püehG!1þö^ö0¸½ÆàwéöU€=á|(°ÌDÁà¿0 ý ƒi³ ÂQ éæA QD¿êS†y@À˜¾û ý®+éðÿû…!¡¿`8zº ™ `=!Êl0"¢Ëœ h€(PRLL€<@|ÀÎB¿ûºC~+‹1ýÝ‘î($…`>ˆüQö^ÚÃèÿŸŠžˆ@ €# Œ8@œ`¢GLj!пΘù{À|–@ ý@à¯×¿ž¬1 sD"à¾ÿ6ÿ=b!}3%c-¾?ÿ¥TTDúü„%’b@ˆ‹‹ÿç_øýo©¾=ìOuÿQE$ÿéÞß@¼þ0ƒûÏÚðþ™A‰á3Àýoú[E`Ìèÿ¼¿]þÜÿå¥ÿW¤ê ‡ÿÖsÿeðÿèíÝ`pß?>{¢1»¡ƒÄlâ¿MÍ -´ÄæéößZ ´=fGNž €î ïý%‡¡Ta>G}ìü—þ&†€è#Q°_÷Æ ü/fõÀ®˜»…Ùo³YÿÌ«‚#­ °¨ÀÞÃÃÞ—ÃÌIàÂìª#Äç7ÅB‚$ãÀ` @‘D¿ 9`z„¡=Fþ—H †y€áð¯1þ[! 9ýºü ‡ž˜‰ý­„Ü`OÔoÁ?Ê{zx`6ø70µÿ}þ}]@ >0Ñü ,áRÑqY«Àà-°1‚¿¼Ò›lÑ#Šæœ}êï¬M£6ùPÑαúÎðcý¹ò¨‰™ÞÃËQ«×y¡K™êh,•¾5ÅcÂÁ¯§¯ ÌŽHz§1ñDZkG)Ldv–x–\if3W‘â="[/6Ÿ_w¡¶HîÜ%ç䬙 è…ü®=œG¬ì+è! +òÄÛ–YžÆ&c×8`‰Šñt_}×,³‡>~|›×ß÷Xä¤H«·F¬:Š’ŽÊO“58u€Ž:%Oó% ‹SQô\©<#™®Ø-Šs ×N|éûTQ{Ê€ˆg““®Rè-½ wÍž HÑ™üž¥FÛõ\ã¯B$wZRcùk³+rÔ8beÕˆÀ zñh˜ø ]‹?u¦¥eÚ8 ÍñAá"6›ãw.írR@ÂÖ2p‰OÏÅôáÌîÃP³…«ûJzJ} \]V—Ïá»ü‚_žõÁ*ÍYÒgÛ-o;†z¢‘ì‡LÔ“¡Éæ9{ovS^jˆž¿§0åUC×iÍ"»my’ò“¦‚ òñôÛ»Ô¤ÈKγ%™ŠSÌkoaeéÞ´ŠT™"'¥t=,gz±P%öî©LX‹L†D0hqü[Ù`?‰¼ní–AÏ×6ÉÇB„6Z]œíJu¹4Ñ÷’aÍ{ÉWÛŠ“¡Çâ3KŠ?L‚m)Ë‚¬   ß¿l5˜+4Ä<€Ç¦wO¯Ù>{ÇÔù ?‘1ëÕø~o'WÆ–zÓ·s¼cJ‡!5©¶ˆbxes’h›ÒÇ~êXË~{펳BžwÐæ³¯Ä Ë é{ë¡î6ÛMºGîß+**n“qÍEJŠ¬Uë„pJúãǘ+“|‘¸Mb?Þ&<ƒÄr†6­Ãå´hŠö,ÙµÄQ4|Ss?>ïeüHÙVÇ(¤9à¾À-S•øî¥/òᓹžØ[_dwÝaÐÞ–µÙCå0Vü‹{Ë¥§Q-EIÓïŠÌõUŽµ¯…×l…[oU·–#Õ3ü‰@´>“tTƒ»\ÝžtíH’Ëóofº,L†9*é'%Ù­IS8gß9Óײà,ª?i¬‚µ)p A/˜Uó>—TòEÃI”.­%Å‹=Ü„Œ^Ðid8tìNžÎÞKCà\ŽÌ»ÃvXmlXµi]áµNþV¡U¡78™Èªq+¾~ªþûÖ/†?lÑSfÒÙÝï>g xÊsß­@ó¾+¥œºeò4Ï?`í˃@{‘ Õ28nFש„^ÁóItªº™BYOõªtë‚éÒø¥¶!ªpSdÃãE¯¶üýT¹ž†téô¼:™á²üýk¥•]Vl•_›3rh' nx*eÌãå(;Ñ‘NÉÛòçÐ ç‘uºÞ¦Ip€Â·4.õmp*²½çs(K5Õý\¹Á"á>ß“™ãC÷†Lô5 þZ£å#(úHâËšŽÂ¡}¯×Ic–…­ßç˜[´9ô å÷²ÕãÒnß_ÒçJÔ|6¼ì•2ÍßÏÞÈælRª#wÖ°'·’æÎ;!îE:K+³¨B®©‘¥É?×Mµ9Ɉ5Þh€¶Eè} J¢Ã[õx"Iª€âS›“¤‘7#ÔˆŸK5ô{Fyz Ýñ·¡Pvþpv½È?;{U1cxw&ðÛ«þù|”0”KéÔwiµÖvàÅÔ yk0³DZ‚^ü!W8Ý&¶VÌÕ=W=Úƒ•ò3&€Ô²pþúH•GK´›®8ï³yIÅ âZ.°âï_|{9:·=e…l³™eÉ¿qzbM!ÏHZ‰j匈x-”¼ºjÓÃj¼ñ&Äžäg¥êp~¼a…&´Óˆ­P:i;ãÊÓË(–HAô$[LQ†b±È ±˜m¼FXT7ÖÁ9qQNi-„?"è3Ñ?(_0•É÷ˆ1FŠ}]¶uG .®5N}šö¯ Ñ-Ã:ræ@}­Ø9Î`µÎ®è>§ [ߨ2]Xï¶/ϱ>Û–›æ'Æ98q@ÂÓ²œÉÅR~êÅxõØ–âî¼kL6Øàê°¸_Ü|ÌpÑê!vÑñZº¸áAævwÿº×³¤+±/E"M“zª¯»4½òàì Í…î”7.ula]õ1×ÁOMIŽ#,ò±Ø›u».sD,a¸ØP›}óe«ÔÏÎ÷<ƒ‰*w綋¹ªz7ºZ›‰ß c 1ô8>'FÏw3ÄÏ} %vŽ¬ypEÿ¦H›TbìÕÙ|xø´i I5S—«­^ü¾MëÃÙis>OÖ‚‡ù|³‹` ߌ¾‘öâ‚\l"J[wñ×vò ÀÛ¦ø× \gycuãçåh£²ÁçdŽrëÌ©ñ(¹Ã-Â#ß\¸êš5Y¼:P»¿­عãÚ°ØK°lxÀ½0=f#<ÇAÄQ¸ºÞw‹hÇŠ%Û¸…#§Þî—ߣ3Øh£®Ž(ô}B–´àÅrûˆ/(ùyó›t•&pâûúyÜTþ½Y¡ês&š=ô\$î•:$'j^_©qÇK÷p‹MM,¸dŸä  ߺ T¨@›ü*>/`«–{½ÕtúórœZY\…@Ê“J %]XÞ® Ñw˜/ÕA<â„eI0¶„ñÞ£0v ÓÜÐÆÊ^S9X÷íÛ±~§[ý}ÝŲŽ?]|sB{›LÝ6¯Ð=,}ç¤4D—ršr4÷ª-[ÒïFû†qŒÒR°ÐtP[J_VÔR$ïÁcÉø~±iG…H—“­sJ—Â6Á›üø#—| Ú™úÏĽ¹peí#ƒ¸"¡ÍúäYÇI'×ýq‹Îe|ˆÀ>Hè’4¾@<4žWEôîcÇèÏÏ‘‰™þÖJ²ì?pUoú9±ŽÇð>C¶aMÝp‰{/ û=ô`¤x¤y"‘Ô§åmàô1Á=dCI&8ód´g¯ŽXÛ46èìíÏ«K7*¸ý(‰5Õ¾ [‰]r{¹í ƒ—0Æ`úu÷Wç}‰ÌC¨TQ_Aóð$\ÆÉ‘<Ÿ7‹Œ °JÎAZE®••ïâ\>W2 €~´j/˜VXƾLÚ³/73Øáð‹˜º£Yß:gþœ¾¨G­á |ÓõLoênlŸeÚÝçLáÊwUÞ‡¥º»×¨òV–}©[Êò:òЛrEˆ#n=§˜Ä…J†óÖ0ì›K}éÚ’èÈ‘âYÒf‚âŒ$P÷J¦rÚ§ºHó1ùS·£oòŒ/(¤:õÖjñkõà,š6sùÍ?8}§À´Àsqx>v«aÚ¸#¢7;yQ{t™TsïèdÇFVvmYr,…ºÿäC‹pëgª%“èo¹X™wñ¿ŠšFìA'Lâvê‡^\MÈüŒÏÁüžéÕ ÐïÅßFåH~.eN \ßHã%bâsrWá¯å-àR),J¡4&žûeš8õ(³¦éñ#y°àŽjÃ`ë0°(m˜·Ò‡#ÈÆè !v¦§ë&Õy YŸqs?9ÔŒF6Ê×Ö­f†þ´=ÞU˜ )]5 ÞéVd6= b?–T)j£Iv‘!zd-¨Ü~âï}£Æ–LTä¢XõÐiª»áÞÅìíõÜ}…²ÊÛ+ëÇŽ‡ÉX–_-MÜk"ˆcŽ~ž<~z¡½óþfÕ)ÿŒQ_ØÙZÇ Æ§ÏK-S>¾ö²ûDÜÑT÷=ö¬;ØçBýgCDñî˜``aëè­wé/Ëh?Œu©Žd§ƒkërRÂdîT¿†²Òb³ðwVâ my㿉5”hã–ŸŸ”ãGné”ïÕåÔp{œÿñ™¬9ë[· Èç!ùQ8 ©ÙO¶IS%õíË'ï]i§SnÜ÷½ÌÓõ$±O'Ø-.ëì,é?ÂAë6¿‰ ד·¸*hXGóÐê\’7mþ´ÈœG4ч%àãg'Ms–ñÚ$2 ¤p]å±ÈVï\q¾ ¸¿<Ú÷üñEóýAíퟻó|é`Òêæû…A¾\nû¨ûÙ&;¡’]8¥ _Ö¹JtsÕVndÉ’âô•¼r±n¼81—Õ,ô“›W>‘ѽŒÄît@0%ø?¤u°à–e›—àÝ~Ô58âZæ+r‰\»Äú9U_ë!IRö^m½´~BÜÉL½çøÔ_%•z¨¸÷‘wè<ÝJ6… ;µéÊ–3=:ïÜÏ•ÝÕ•ÝúÞ^ 5Þ1ÚRø­†¼] Ï,Sþdøô»È“óÇî,pƒš§i›Ù±x+eÔBî§ØM§OÓv©NHàÙþ˜V HíFìQ¼'øY䦕èÏé'}º;?ÔídÍ&þnŒ¦q/ïÙg.^šë‡æ!Æ؈ô}†éx×!B¹ra7:žüá1èYkÍAÆÊjÑ¥ï]îµ;Žÿ òRÖæ²ÛÞÄ' #X¶* ¡XÕv…ÙŸ"=5ÅEž“ï6žx­ìvŸk-šùçéL-‰ÈÍ&%”ëœX•2£“¦¢ðbIŽ$Ϻa¾*}#B‘%õfl©9e’ þŠ†´\«ñó€à­—(š}Üsëõá©2æq?n]§Š6¾Š ñÑAËúÊÔDñ®…:(ávÙt¢û<ê á\Í—}%W§ØVgsƒŒÚ¡8{á…úiœâh4ι§šŸ´–Ó½…Ó‰fé—žedöxu_}Q jëÖ oJUe3¬Ênáãœñ}Ð2˜ŠÒ± MUNÈì…~Fí,„û 5­Wf+Xßy_‰é} |”‚Þ¥8.2].oà«¢(~YUýêŠI<®Á–ób¦¼ßwkcèMqA¼’è•š‡Óª þrÑwìIÑã9j“šºãƒ2>ªU¬ÏIä?Þ%)¬Á×ñÚXæv¡E—†¯-H>!>äZZ÷à¼3»©7—BãF*ÿ,±úø¦¡eíxR÷¾ËÝMÂ\a[o:@Õ”s¤¯¤YÈŽ#­t‚Ÿ€g¸¥æ Iurç‘Qk”²ï1kÅ8Eã•÷m?ï)ß"£”Ï3®JLsÙŸ³qôkØh~*z»vâ©•—KxÊrýFBRðz¦´}ËÞK̬ÒÍ'G<(Zà —<3oÕ—G8ÝÔPÝ’’ëA§Ï%ã™è‚ûI]„•Ü,‹?Uê‰Ë†ºš}s-.*ïÄ6¯á ¯?d*¡É#£î¹oRZ?«»(¡ttYDÍ’ŠGËgße ÿœ9æ2Ïp¤–äS¯;Ö]Ç'ÌvŒ—ðï³>‰wk}"Mw«ÿ3y~ûl"u±#½Ý# œ(|‹Ìó,ÞHwʳlÖl•7úOÄUåwÆÞ¸è“I®žT³å¾vJSŒ{?Ú7¯˜x&­hc¤Wž&òµ›Wñ–HC¸'¢—ýå²F?éîÏ[=|È»÷D,Y쯖íÂ$© „Þoè4@Bòåæ^ îNÖ6a3“ï;¯ãZÇ•8wß¼Þiß­´Ý¾?q9’ÙχG¾f쩨µË«‹¡Ó,üQ®'ÿœC'E#li‡]Ò4ç…5mEß*ä°6Ñ{¢cªJ=ý9Ê窱!l&) Í , ¿|Ó|&‚Žn®üÙVèRUÒÀVÚ¸yv˜q‰yŸ¬‰™×+‘w+k1ëнŽ†ær;É{[CKL³‡{,wƒƒöâAª_w˜mÈD¼ªn¬êåzMÖ06 c{ù}Û0nYú6 œÿHåp÷<Û2×Ïw,ušªZt}ìh¨°oÇÝ)ïŸ,sÃ×L¶û8f]ö[JÍ–¯üfßÏV“•o„¿ÿRèU—ûgß÷Ut/‡³rú$µß/~”A(àXˆ·Øé¹¾k…Õ3‚³É–|Áåy8@Í*»(òؘ@ÛÛñÌfúEúžélÿ—zI­µz3ß„É ËzÉ|Þnï²Äôžy+:§¬v\]·çç²ÍVÀsŽÏý¤[ë²4|§­Tfo¼Þu÷(sÕ!~)/ßá|õT$# Þ;‹6ºØ|ÃÁzÀ³-än8p¹4ÿª‚íŽp“'Q– $Uô’ïÍ|-ªôÁ =!U]ké—¬O[1õôgǵFðÛ.}ç€d:z?/:,ò¥Õ AJ-?+]ªÂ¸ˆ­«µ •]þ5ˆ©ð$…Œ-’’‡J T<`úé¹Ô$½É¼ðD‹ì (fömY·YÛÓp½ë/)÷xõü¾· ‚[N]Àé•œWËææÆ(“öweöÄo§[ÜÉn<¿|{¼Ë¯ ŠÒXVËÊ“»z—½BbmlÔú¡4ÝŽCŠ¦ýp­©& ô „09H>6¢ãüšWE¸ ÜðèúT©Yʬ’r#ô G·Úª[Îæ×aÞ¶Cù`ûË+.)­I;owð˜1efë‡EÛŸÄçêY µ—q­ ã¢RN0ùgöÑ,þPïv{€F¦J^ÚªìZN)0ÈxÙ5ï“ý÷@ïy)óÓˆ¸4Ç6GÕén0˜ˆ­2ëVÀ1¥3³¦¡"½Õ܆*Žwb=ëõ"Û5š< aN´õ|Æ='±¯K/±:¢†<Ë„œ63=:ÐüZ(¾Ïü›mÁ¹G“h%ÐR*É4ªêX•1’ùo£õ ó5ÏEÊ™ò«y ƒ#W·HBX'©‰øÍ‹[³{ •µ–äbÃìy×ì|ÉÊò ¤o+yëeØ£®7Û¿êÓÙ¥îH”ªY@±Kéü?'5¬Y¥Ò®…‡Ù9P\Q£ð÷ KL×ß}¦òQÍ “ÚØè‹iýãÐ6gûþ ¦ú ÛS‹ø5OiŸ•!sÛOª‰_é¦|ª'^¢J;—Å*$i“¾HǪxÜÕÀaO’xq[f£‡vÝ@SÐð3×K2dIèÈhÍhdÊâ‰/:CÈ£ï‡QöϨ½žªº1Òø‰Œ€’§øtûÒ;ߤQÆ‘Ò-5æÛsV?ÎR™JXÀ÷ ·ò¯ÃS·Çé „³­¾àKÌc+úÞ‘ŠrØ•#vm íN‹Ðp]ªð 1©¾OØŒjx¯v¾«¾ÑÊãˆ7º+±)¡SAQZïM¾ä@Ûðý¬Í„íÛµäXró’›\·Q‡6RɉÙ/{ï—ù„b ­Ç¦]xvBC³… eOY‚VRÚuUx?ãÌKÞ;2-ïÞ._^*~íLMø ©ZÐ endstream endobj 577 0 obj << /Type /FontDescriptor /FontName /PQWCTK+CMSY10 /Flags 4 /FontBBox [-29 -960 1116 775] /Ascent 750 /CapHeight 683 /Descent -194 /ItalicAngle -14 /StemV 40 /XHeight 431 /CharSet (/bullet/circlecopyrt/greaterequal/minus) /FontFile 576 0 R >> endobj 578 0 obj << /Length1 1812 /Length2 12067 /Length3 0 /Length 13207 /Filter /FlateDecode >> stream xÚ¶PX.Œ Np 4îî‚»kph ‘Fºq .A‚{ ¸;—àî\ƒîÿç?7ðoöJUMAU÷ˆr`K€À¿H¼ÜÞ¿‰¸þ5ô­ à¿3(;¼Ì3@ÿ÷ø°ó°›¿|qü?/ÁŸ.ÿ³ÿG”ÿëøÿoEÒ.vvêéÿeðÿћڃì<þ²x™gèËn(9¼løMu€ÿZh% ÈÅþµrPÓ—[½Ì9 7+;÷¿ä ˆ4Èh¡ ‚š[ÿk–þÝŒ—v 0PÕúãÝyñbgÿÝËê™Û¾¼-—–ý©¾lÖç•›;Xü±‚œ<¼SggS”— xA</Ž—]µºÿ9â6V°ôÅðÂÑ`éàŒòGcyùlˆþD|6™¿/€Mñ?HàÅÒôoÄ`3û ØÌÿƒx^tæv/”þ-ùƒ›Å?àKà? '€Íò ÀfõÈ `³þäæyAŽÖÀF‘þ_*µý|)Çîð¥Vû¿á˱ý#ÔËæ²9ü¾Tæøwî— q|]‡Páx©Îùð¥Èß/•@ìL!Öÿ0x‰ý|±pù|)ÎíoÈùRÇŸð¿šnîâìüò.þ¹/ñoüç# ºÍQ~Ì9˜ ÙÔµÞT‰“¸±ìŒqr£÷E\ ëlK¹îªHßžsåF.ˆwÎüŒ¼]sÈYôÜh«‹Ïnk´æ)ˆÿ£®ÁÒl‹Ù{âÈÝ!DÑ…ó§BG‡¾ Ø ÿä›ú€ÛÅ»if§ß;³û2´ß*®Ë­OèŽXÑàÆ¢"‘ùù¹Ðà‚ÚÄ3Ú*ÞW‹OÏ´ËQCÎÞýŠ+½›Ú;ÌɳٷX ÚH%98@wT¸È8MÙëæ%V0™LÓlwKÞÇÒ\´}¤7ƒŒhˆQ eÊmOœÉžmGÉ©[}“í_‡ïM†—X¥<]-þÅÝŒnÓHˆ±C²¨9âG¢f¾']Iwi© ŽˆôkÔž…×Ò“GA5¬_°¼«'ãŒ4!‰™Ó©ùÌÃé8 ªç^ó“毇#£AÌïÛÞnù©ÂdE!ÙÌÛ¯ŒC«µòZ¿cÊ¢ÒP`Fü¾';¤ ÐÎ#õæ?‘åà%ܳµÒ±5 ¼‰c;„©>&êÿnq—í0ÇqÞ×£3i,Ö3‡ÒžUmŠæªHéh ¯q—ÄRTHøÕj·!ÔzÖ²ñ΋ˆ6±xBoú2Ó$\%Ð{é+{d9ýØ´E:jøT+ FèùP}zNO²Ë<ÕI~~«U=bù9µÔg<Ç)ÊÈœ9ø]Y¢WXí0o·ïÉšX„¼FGMIO­ë%uBí¨–’úwÊ'”¯iä_´¨};„YÙCæ„9+-ãâ-qɃ-3ñySãâ›[Ó ³IV¾•›$pÙ±ó½šjTI¤É’ÕìÍÙô@é±_ º Ù4ZãañÑöÇœJò\’7‹w_JR¦r©ʵŒí{§jÙK¿áq…zd¸‰±pß±ëÓSíÏêº3ê|‚Dª¾zú®xm­û¤%DœÏÚkJΧÛ?Åç勤”ê¹+Û‡Ú¡¹™xiS(æOÐsÿv# ÑeVѺ¼¢à^Šïƒõ8‰´…KÛ¾Ë,®Úpƒ©~yz¤ì! ðPÚØšØÝ“°ÄŠPs§4þ¿¸æ«l]AÃ~b²*Y¾³Îítü{Œ&ô™í÷•n}vQ†L3 š›¾Eˆë¤[;2õ'%5=Ï,†7k‚úõq´É‚̇R<÷ñR%mC?¡ 2£È|ÃMüãLdϸ\y.iqšÃw±¶ÙÑSäëçSlþp¥†YVç=8‡¯ú „ îÃiÖâÁã:ô¸<.røk´S«¹r¯ó,uªZ¡¥†É·†í\œä—pfgûÅYÚpõ“¾þ*—Åõè{´ &ûÖëºqÊÚ-š]ÌÏ}£É”“ÖÇ-ÂÏõÑÚ||o*¬©²©HR‘4ÇÇ#r h¯%`ɬ2gšÕÕ¹¾.ù(™û˜tŸ%}Î{ü˜*S\iÀf= v6œs¯ ‚ÍØø|žè¥¾ý²ÝƒŠÞßqeQ<¡½aXÑPœ«W$zÊXø)Ž{,nØÚDЊDÍ*-o× ª¼ž4 @ÙD•+Éø›º¿¤5ãͦ‡‡A H@&O Ë˃26SMÜí‚í÷d(›˜y.¹9-¦——G0ZLÃË™Š³ñ6ø5v4Ó¹á¯öÞ!Wü²šOk‡ =]OÚ"†hZü¾#cÛQ¸€¥³îPJž]¡·çøMB6 [òOL7 M™‘»%… q¬FÂ8È“_žgŒ¬”í´É¢.ßÑçáÞ‘OÚP³ÆÞ~Æ‘X"º±pÞÆîÔËñìæJ•$6¢$§¿_)ñˆ++©\ºƒ”„@$ƒ¡Üd<¤H ¤773Næù_ µóS}Vû{T—†åèžÔ¥¬—›ûáïÉH[üaÁŽÇ¹> –ŽOvN²tyq¢pœw—IÈ5‹â*ãvñAœ¥€Ê<ªø;D´-$ÃiNr‡¯h¯ašï%¡g÷û¦Û oýÇü’}~`µ °)ý0´üÕ‚¨ûÃÎò,—åNzÌ{ð]€*ÎqF¢Ö—ˆYÅÆùÄÐÀÛOÛi)>`3Jž¶Ð~†üÁt;OÞ³ö›l{ŒKæ6žõ„Fã’Ã'6=$:+Ü¡’}AƒªkÌ/z Î2m‰MêYçïÖ°æ™{u¦õVž%kDã)Ôï ùQ¿–}QßmºP½¨û­c]׳0Úæi(…'·Óá¹T»÷SqÌ›RBªÊÍçýό޶üý ö .ZÇs×`n5A—~…·¶ &°ÄŒ¯kÇÕÔ&«6@0Ù´–Ý#€Ü‰Hÿ¸MÙ©é:¯Ä÷%°îÄ lýÜíX C”¤ÿöy[D´ÓoÒ>Üö‡gŽ2ÏCØë7ÄyhSçÌÃÔœl”¿`0qÏ-ý ¿ðæÓ0¨Ó ™­ðÿ°)ÎäEŠ#·?ÁK¯wB–Rc‘ G…$)4ÎhQ S«AKdÓžµ¨Ý¨€E^éfzz¿» ‡Wy«CD(÷û$`™TîÒ1Sü²Çš±©ðY¡êû6ÉÙ•1f^¶–m‘çœ íNÔ¶€ÉZ[˜ºØXÓªPñp¡ÁåñÕ…¹§€Ø‰QÝ´ÇC5½PYgõò¯ƒ‹–…_¾r‚^C¬Ë£Îå…´j‰óìÚÓ'Å• ³,guŠ5¸’E‚šnRž‚µDïN>~]¦úöH?Ù©)ö™(0u”Ý”Cñk[ÃÈ4$xU¶¼ôiÿšJ"ŠÅÄJ„˜©Âr…E3¾FJ&Äï>”˜.ç"…è &Mb…:Í“Ú(ùS‡Aá1!£çü=€z.ç'àä˹âvgï n¼µà¡Í[Ðë ÉsÒP~[RÖ›c»_•Ý˜ÞvÞØØŸÑŠkÙJo–Ó„èRé9U …_o€¯§«gnPì z$ü×s7>eÐy³LC<‚ñæx`[Ã’… ä@ì{©ðñÑ®ÅdŒü‚¯¤‰7=ì_yÁäÍÅþ®å¢1ŒtDØÇ&N¸ßõ“ñçA!y¡¦´É°uyÎúƒ)CVŽ[ä-:à×Otì»»0Eo”Ú ‚¤1­:×úúö¤™ìœ¸æðkŠq¡P]uxEòl„9¬Ã€á¢üÞ÷3Ü°;¯¢GTí±2{¬ÃvÛOÊ͆¾­Þ*«;µ Ó°+¯Ÿô³nµF™ñ÷h~M•ðŠ`VÅsù%€úŠ†¥½/ãÍhÏB3ö…Q€‚¶Ü’gSÑ—Û–·5]|˜ºâTi› -çY>‘¤°n æå„ìØu¼ëÌtÀª¨n2wÈ!Iï í%Ôе]‹ëlÐ)§©;h»®gFÆyëwÚd/kÎáãôØRj¬Ê‰ï½bÊ”?è6ðÐrþþ}ø¿µQ_gœú©CIMPu¼u¤Óà¸s̭અíÜõÍ7‘±çucÅÄw!ù×%nß•§¾!ùH/[è !7}Š8v‹ìÿy2FÓlªTdþ=Ûïíë1éo332?&¼ôtN§ÕRKKlµ€è ¬.„W”(à=\EÌy¶ˆ:·¨]Tä2#Fœ¯ ¦5Eùaá ¿ï#6Þb$&`Ús1ÔÑqîð™ꂯۭžrÓÃPŸƒÚ)j¬êÐýé,¿‹9Õºµ„Cç3¾êÏÞC¯/i&á²™…©`6õR˜=Sn{=#':¢~TÒpP$æÁôg7TÕ†èP:ºŒ?ì/LÕ9ŠÖ¶œªpÞI„Ò£e6¢C6žÕØ B"G oN¼f;0­Þ×ÞSή^ŸHZÞP¬¯‰xGÆ«Í£Ào >üŽ§ïxý!â»o‘ vÄ•ÌÆ/u(Þ¶TÕŠt‹í”°Vqóü*ÖØP †,»¡+Ñó€<Mó„™Z»xRÛfôxI­þ"æëí³ÏfûZc!4hvXÍi¤â×Ô)[ó±«c¯¼Ì×Þ…êÍ·pŠ°X¨{}†¸®âÖ{Ô}˜ô<9¢ü‡âüü˜Ã7yU%áá9C*hâ®bb‘É Ùk-³p[MŸµm!"v®f«ã¹°püƒÞ5ß ÚŒi¼N§ŠjEii=Iåð2.«0tî´Û4î@ZâQ'Ú¹L+0ÓqÔ’>qh­—2—{™@KEoÌ>Ó/†u¬ÈL#)“«Æ’Æýe9׸7Û$Ç|'þ–Ø ­µL–IÏlNÈï^„¢§†n¦®}¿ööðAQq°Ÿã&ÛÜo´ºÏÑ3ƒù+9KšÑÌï4ƒ…ÜJQŸ®‹gˆ¾W•x´N®ãxg¯‘áWlãÌE<ûO/M·oeMfM¨ ’®¸{°ï0QÆ#×ßÈþ1Ê`£ƒ"ë<ë ©]DLzk"}Eý)ÆÈwýî é¸õ¨¦¦Èwx‚ó£åì=Àq &Çp"ósÜ\ûì÷£{?qšý£oÜÐOÜæØ]bºRU®G©ßí§³Çú¢ÕöÂÉøo£*ä°@·œuÝ‹¿×j‚§Ãy}¥Mã4w)¾"Šw9ɾª\Üf_“D·ææü"*ñÞÝîÛÄ»Ôù.‡¯‹5Í7®åÛV~iÜ… ~B7`r·,Uæ"Û÷UöD±oÜâa ÙçüîÐ||æ|î×l´ï ïÐMˆ#ãÃåIý}|ñsduš”æݪ²ç3aªÑ耂^˜µè²3V€øáÍû`OFXÐÁrr°Çe ‚–Êkýžl±L{øÉ2ÅþãçÝù߈vªö•±O–Jß™=üºI¹çðG!…°C‚½îÊéõ™û º¦œTw(ÈÑð.P7ú†‡@*_h/NMÝÖHþÞü&†hKßbÎ ³ô*øÜÃÐRÖøÑHHÃCV+m…Š’löú ñ„µxØ¿¸“b<äîž•@ôÖËïÍCâbMÂÌ;r¢°«±%U¨z+‘Ƕ+>!o;óYáPƒã¬-e[ÞT ÞsE§’;œ0n!Y…€¬+{÷&ÃÀb)3ΦÝË}™üHg€iÇóSP)¼«´WÇ5X‘ãqá©øòˆNX½Ó[âÙNd"žìxÜü6ßÏ>XWûÊ–ÿÆCxå ZðU3†S’ø`wü2œäaxÓ>·òûä³Î-(愧¡cYÓ@ae~t«X÷HÜdå Û²Ýò»ÚŒ]\â7áê¾1:nï)r/â®ïÁ†}üLr‚|;­s«¾Ùkü¡*>¡_'i󪛂Rsód¢æ¹Ôv Åþ<3ö¾¤áìÈ´Uë^ýùÓõ@\ùÂ~€(ãŒL ªtÌ¢-/! : œ¹®=›9c!”÷ë\*íæW)ûäs0Ñ«(Vu™­çQñ`MILoÞ>gªÎ[o¡äj¤âI@º(¼{lÝ=Å-Þ×è~4tT¥QñËÔ¡Êë…þ ³ç-.ôö¯lœK1a#œ¢åWW «â¤ÕÈ <õÞ…Ký8aoR_E?iÌço{äVÜä“5Üvl]½ºêðLÞr–fA^9ÖchR9a†<ÀÌéÞü†d•ÙÌ­ïgaµ)•òõgû“­*WMêÄ–b‘2óUC"$P%‚Z²ÎÎg¥$±º—§Nˆ54Æ`ˆ¡*fá¯K Ò4EØ~Ü_ÜûC&{/{;É#¯ ¥bµª–Ò…Wiï—YM%ÑKP,¬ÁJšu]"“Ž¤#J»ÿ°¡ùõmRïWo÷‰‚ÎcÇYzÔjÒn›ž-ô]{6«€ÏÙ­›ðw5 *‹¹¼Ÿ÷Sj€'L¥‹–q̈yQÏ÷r"*$Ù®s¡2Áƒ {ÙT¢†z.É–²¯$ÝöñÏãô÷3’^=‹ÕD &a¶³ü°E1d§¤ÛÍ{•%ñ$NWçà@äûøÉÓ­ †Dš0¸ñJý7üâ¼ úJÖ$IöR×2ŽºY3ÙW[ÙÆB-ÄÛ.o Ø Æ´¨­5[ÉÙ™¢Ïí„éñO–%n$f†¢Þ&Ϥi#ƒÒ]™ëÉÅ™L¯mωlüVaǘYÁS?‚Is#bÇOmäË‘W›õx6Êh—&f›ŽoŸ_õÙDþæÒùÙ©Nðê^ôâI*Ã,ØcЀÁˤ¥^Ó¶wÅïê#½Ý«,¤à¬ñphà{¼c±Úƒþ÷SÂ9ùH¶-ww±T¸J©…dK€$ulÊùIÈð[¢‡á¤ñ€ï>f. \]Ũ˜ÁX,õNwTÿ·2×Á-m’µ›Ï¼ü ©¿r,.Òï½ñH*[SÇRDóÌ–º3ï‹0ø“C²Oê÷å>Æ>qd¿OÁ>ètÔiÂŽz;i)sðŒ°ŸÖ£ºöºE_qþE¼ÕmöQé§ÿ”P*‹Ÿ‹¤Ç(o2ƒ+¾xÚ¯l)†}Røº4uØuìYÉ«^8Š/ /̳¼•´ùw{c‚ô8¹j¾w,ѨçP&¯zTXXgóç ùüñ²¬Å„éòtú fJ}`5n°pN©fM Ïç®*ýqéD&¹˜<óô…WÄóδøun#O*ò}wC—!ØSøT YQæÅ.»lËR¹ÜÕU„/ÊŸ3ýYú.˜¿k¬Kùî™ÝàÌ<¨ö쌈Ñ9fËå妆d™ßó¸:º­{Od34²cFiµcÜSHd1÷ˆ€£DÍ›L=×Pž÷*ýHË?Qlè_¿E3 › Mmí•FÈ×.€²íšÄKÚxªGfÁšksÃÀkg€Í_=Öÿ™…êô.:VûwÃ|A{ï= SÞmlÜêmɘ׼­ˆ<µ²`¿Ô¬ÿ·ð!ár½¤ö4óöfÌ-G0¢±–¾ø»‹iö0ÝìFZ&©k2Ï}ˆ®É{åÂËÑ´î· ˜Ž1ÚEœ^w]; ¹ó·ªnsÑ=æt]f”VÜdiÆà7¹•æfEUÔ.¸šËÆæô‘¤@f?ÝƵ—ܘøkäWŒ£ûâï-:AÉTNå T’ü£Cò¾4ï‰-ÌýFï‚ ºùvð„M¯¿ƒCÁyùoQ=ùí¿‘Tdþlü&ýÁ_‘‹•Ú“Ú ¿IÉ÷ø e] ¯äzã·!oü,j™Õ0Gak…¡ùMY‘€6Â<›ÐS½~!])çŽÝ¼&ÌœÂ±ðÖf¨][ÈBÕ!™ËdéxBeG2@ÏqBVÜ6—´ ¾m“šþãâÛóôã‰Ls÷»NÅპàÖ·sRàn“³í+½íÚ á¥u÷åež/:î•‹¡èÍfÝuM"sT¿xô8°§)“ƒ8‘q{îR‹–ß›ô”c…e4ã§roŽø(g"~º£ô¶žbÐ>Z¯°Ó˜–8€¿x ŽX,Uœ?Ž úw–ÆMöîìãlª$(î“ â›dym‘µš™3uîó_!WbmñÓiM×3Ažê;|ú&.Cñú*?Uìeì°ý^Ñ2ÇGÊ’¬.yôºµ…½Ð-MåµQuÇ°„ŒK¼S}Ç´Z›cwå×…¨³n†3(G¤9©ë°X´›½ÞÎ?òîÁxÌ "Îmñ^:Ú:Þ¶1ŽÆÆ[µ6Œ‡3C$”Í¢uÆ!”ˆàº …þQzj|¤D¸{t09By8W±´2WÐÏ  ¸Ý¥ˆiágO8mº^U|:°gZÖf`I,V¨Òiì ‹ø®½¢d[›i:`¶Øf)ÏB÷°’üW™„ä‚ö)µÿïìv;Ÿ%¦×·"͸H*즂_­Ñ×>ñß¿m_*ß+PìE8[ª‹0YžŸ5Ðá·¦iÊ_¶2ËM¹)¨i+1ÿå…¶`w'ƒâ¤™> Lý Y.óXÄ*‹g§/]PWûÃèl¾'ˆªØhÉAï7(/‘¹JÔIS-žŠ720V¡¦O¢¥²b2>}–D/0¼+É}×ZÞØ]óÙº—«Äw-‡±1©7Þ KºWâ²zÕLÛ~€ïk ´&Ht-^þÔE?ÀѽàGÂ…•öÞÎñ4ÛPãámÜéhWš‹ø´RNfMŸ~½s«ºøã`qVâ'¦•¯¡½-¦}ƒ4 ND± µ½ŒÁ[Ù YÚîkdÖ\·1 Ëø@}fDÂe²Û3@QðJªÅ‰°v™Kh ™ N¬£ïö_׸7kv–ù Úc±åZÌøX;Ð0Ù@¿˜×½óÀ1ÜCb6 QŸÛÔ‹úS.ÀçcI¼¸µd_TôŸkЋi½Hk~”‰?]E]XÁ’´ç}ÏÒkùñ£ëÁs «j¦Gñ’›I&MZ­‘6.í<8(Ž ÝsZrj¾P_Ó7ÙÅÆvë>`^2,ÅÉŒ‰‡‡–þ!•­¸P]µ} 0ïÿŽ¡óèy ž >oŽ¨¡dD£8¤˜Y~ÏnòM¡ ;¤o½ÿHt‘d5Žép?Ô®3û»“/BxÉ»4ÍðÀ Ð¥ì+¥¬µØ%ÈòѪF”ðìeÞ}ljò¬jÝ¢ ܳäÔ½TÛ†’…¬‹ê²üì£#È*Û:A‘°?K…ö±ªUa&mEÛãÞï«8)¬Ä,u1‡ãŽþƒµÍývÂqøá+ í‡‰®0àCärŽ‘šø6 aÖWxžBÏsA¸«¹€:ORB†*Ë=_;oL´ÁÉô†¡­¦*²õ¥ßwyÒšBŸE2÷×ï[Üx¯×b’œý޷À·)ê)û²Ù©ÞŽZ÷gGò O0ÿ ¢¥Æ½ Tg $ÓJàß-][¤ƒzõyBV‹vcÁ²çü›¢±EÞ6}yUó†òQoÝU°DË"º¤ ÐSõÎÃÌÏú-Y¹WEüK½º,LuLz 殺3ÐQäÖ¾»4SԚϬ4²Bf‹Ü­Fág @ÉØçAÄ]o¾ Åbp§¨`è ¯íZìýÔÝoºü`üS ½Ëx‚ÄÈÎtì$£FdÚ¶ ±°$È훥×êÀQ§öÞ'=ø}+ÍÖ¦tV‹Øx€Â¥d¨Ê]v„á{IPf™|ÁÜÛÁb„ÚÊ>àœÜ1*í¾Ú¦Ë¤NðOïaÇøF 7CT´êkØe\ÜÇZæeë•adÄÐØ N¶]Åo™ , Fe’6åÇo³x?a®ûî§×ø!5RLpÏFo±“Õ`½^{Ïêá[ÞYÑ0‰kuÀs‡]hÐqU~BÌzýÍn©­—©Z,ó¤e­-þÄ:w®­i¡yÁCNÁ—ûydÙwDž!žT²j¼ÀjeL¼ÒŠE”·&e0¥6Óî«ëo¼ Ôgb}¬8W ¡¬•gLË|ü;ppSv?íI‰­ÎÊ«ßg(Å¿I¬Kë”#)E‰ž6Ìì¡EHÀâÇ8Àûí·4ŽËÛ«:€>Ë+Ú©1é a¡`ŽëÑ€õ%2Dú/ë™ iJ§ÑïpbïJ~ø•‘À >éÆ!Sçˆë·OÿBË® ˆë¡B#c±u$©½ä`óT Ü´)ì)¥õ˜#*4ëhHD| ‘¹Fàd…‰gQpuk†1ŸËîqbs@ ©­Ò(ïùncO!¯0³Gõ’é[žÀ춬«9|ÀÃH!¨J¸ínÞôpÓ¼ç8Á^F¾†oÅ ¾½F¤"êI&È•ºÞ1›ýH)Ÿ “‰f <­ÂZ­HÊ X¨ó  JýÆxŠSÛ;Å ۑ.¹/R]5 Ç_Ýœ=0åJöN:(EõTdÎúcë(¦=LM£rYÇç梚¦Súö{Ê÷!¥õ!Ɉ ³q~ù%ÊåM<©® ÊÓº]*”¡¾Þ ‹ újÕò,×QW¬ž=¿ß4VÜò¯ê¿^ÜBgj‹1¸>üþÝ)e^ LKÒw<콶9›â‘*ãK* ø/c Á´H¼^5 ªÁcZ0z3Ç# Öé8ŸÏ’ך.­öväÛň;ž®Ï§S°P(†¼{é‚é s­¤§ý//ú”ȩ奈ƠõnT5ì3õ¦3Üò±YŽûÆCözÖlfW6‹Òõä»CÜ ¾….‘ SBoÒŒýÀ´ÛŸÀvY¯~³º>žÕ$?T! [BËE+¸¶J½÷±$Cµ¶ðŸ±Õæv_PwÞ{¡? Å7˜'áÝIö˜ °;{»~j0Wîò¥ØUïÎìîmÖ3«h¨’û.ÇÎàïòãÔÜ=âjª+ô²Ãâm2š–vµŽé}ªÍ¶rEäJÍ›Õ(éº:¨xä«‘ yÜ g¤tÈšPþ0ñ×|I!Ñ'›¢yîü”w§¯~98JÚª?é¶÷­ûŬ'Ôbá²€®89Bñp9EÏÝSñôý†cÍ ÒO«È|·Ÿ}7}â Nñ dpçm))åŽÞï›Ì|(·Ÿ¦žòáFØNåpîxåñì%ü2OT _5çl6àœÅÜAÏ4•·¨`¿#n`Ÿ5"þ mM]J9é`1·’»1Æl³ £iõÕöWyšÖ™cì3öŸIW8³Eò%´$Mjâ*&"Ù]*t4·$*"}d‰ä?.ÖéŽ_ÝO?¿.“g¿¹F1«¨5ã51*ÊM±¥®8Ó[ºÅjˆ÷`–›¬†Ãl'¢4"c™»–{-¼ãâê ]éVÓ$TÏVNkd”6J!v®èÔªé½ñåýìîÁ08v‰¡!šã«´9õ,_¼:ôìùnÚ´ ¢ëùÕPÒ†X~^ð‘N›ŸŒÁâ| %jè.¸i˜wr>Ю՗8œ?¯pÎó“usˆdl¼ÃlRœ-Cþ#âDwÏÀÅØTHù­Ô a…*L eRær]øê–ãoBYÍwlùINvB§£‡¾Êü]ùùÃÚêKãÚd}Ñn/U&î#“åq‘ƒ$¨´]¢ð;ÒdÜ CzBñÇ'º^çu±.œç½ë#ý´=Á-z·9±×Ë.ðzAÈ¿âõ„”6ø¾¨‹ %›¦øwt6ûë—K«2¿†¥§¹€¿J¡q*.¸c¬K–3JðšZž" ¦hÅÂ|Jj?í E¸Ÿ3ëý"æÿû½‡ÅfÂ¥$ê^ëDŽ¶±«Ò„Ã]› ¥tѿܘ¬ðN7;°ÜgîMºâ†šm±'v‹­£†úfþ˜ÖIÄ’ÿ'O7±ë¢=úVñöŒ~/p°f}ýLhºE‡2PKKH…Ië^µf….l¾½LÎúˆ^ñ? ‹¶ ûVÖl³TèÕÊÇ÷‰unK»?ÌÚÁšžÓÏåKܺð]ÂaR£Iñ¾‘ÇØ>ÜL›Ëk’ƒŽ†5Ïtï“Ïœ> ×@hg]`ïð˜‘/‡¾ËýTmÇoM­ Ôø…¼5ú÷²$(<Ô± #ëEb9Ϩ‘öF92¦r}T)V•Ì*q~xØÀPŽdc*ùdHy×å-däç«ê(@e>´XMy¿Ðù !FˆàÉàˆ¸‹¤†JÄP±Æ¥MûíÊËm…Jç• ή>~»€/Ão »i:f‡€œCÆ­PdM=³mð*ö»ês™ú¦i?3î)¦¥LMì¥ivpÛ¢éZÍ–jwæ1ÓsÌâñ¿.v±uÙ؈¹êTWC“ƒ¥TÇ•¹j|Þ¿E¾2s4C»«ˆv¼WCºÞøŒ&€%ƒñ{ˆuçuÕOiïGÇ$>?«Æôù@#4å ÐULZ"`²&¢;îóâíi†K e4§ˆ¸F¥·2·Ìy<˜ªRdº8¦G•n{ù¢l™}ˆÉo•‹í…?‘3¬œ…ô¥ni-õN°Í-Sbh²Îa&G䇳rT††Ž­ä"HE¶<ºÚã” ì B&Á9|°Ýžt ™è•Ñ¦²øá2’*|Ít½›$!¤(ŠM+s+õL2dEJ¾ÉÄ`½ž\áàNÞ2 —ч)Ír =ÙZ>Ï%¿°x­˜úc”k]ÄA\úP±!šü*>ÒÞ¥Õ#@kS¹ƒøƒ_”£[¢DÙû@»ù u¦ÒFón7| è. 8/™çÓýò 'S2oÂM<û¯dÂYÓ&ã”:\Šž¦½.Ø»§T-ÃÞ‘Y•·tÏåLª_ó˹"`Ž³Ú.Âåý2óCKÔ)®1>¥™1¨˜½9ŽŒ[¯KYÍ ŽŽ–v/†‘ÿx¸éªêæ2 Šž[ڔЦ-î$ÑÍÊÉc?°vúÈbî³-k ©Ñ2Zñº*W=ìA}<¨n·)!›zÿ“óˆ„ 4qsÁÂé½_\ñ.mc!“¿|µo §Ao* ºÝÅ e™(Z©`›€ÃÔJO]++µ„=Í×áØËÁG\äMçɽޘ>éäîWüÊýlån©øé•t…ÍÓÒó¤Ù&ëlLå²iõÀ­æëÀ%:‹Z´nož&¨yû¸(ú„ ±|Ÿveû{šD‰e⾈n1L§5yvÖÑßµ~HËÔ2’#ßÀ¦4u¥¨éf¨³”,Ú„~—ãÏ>F•D2¿-uó0o¯`+e*Tû^õC;fB”Ê}ûC: ¾É*YN”‰tÄ=|g¢`ùÑ¢=@ÈnO2öË.8ÅDT"®œ$\ª§K~åW¾µtH®‚?ï ¾!½ÝlãNÏjÀ–¢rŒƒ¯â‡ø…[7WÌè7\UŽ)㘠§ï9Ì;žj1Ûê›÷ø4€r¯¢q¶ž€ V­|lû©©Ë–•û!Åé¥ ù­~Ãg«_ìӨذ¿è¥ÓùŸ$c5UIÚ?ο.íð}˜¥MÀÀnÛëd óÇhº«P¦ýÌè¡j8ÜÀ?û™Î¸c´Uu¶ ºô±œÃááîµH@åå{uigüYé«„$j?1¢Z¶E>G~(p/î¯ $†Œ–gŽ¯Ã ]Kö?îm&P»">>szÝÚX>\§`} &Ó>3õ ™N^УVp+õXmûú–q;wµÃ»3dÝçŽÜ ñÐĨÚáÆ–ü$¹kœÎ¶¼k»NeÚ’õëU50× ØBŽ´ˆ0•M$){ùWJ%¹e:æªä~¥õ,¥lzõYÛ„6'¹Šv»eÌ>~´ãÀ‘ûó†ã°×™´Þpd®x$O·«åd"Ì|cFªkÖz>„ÔÍxÚéGYAQCf3Ž†±Ñ!vP_Åq±Df;CµCÔ¨•YWú’ŒßØzÔòvÄ÷øS™ÕhaÚ¡t Ò„9:% ÝB¯ôR„ƒû'òúî”pŠœsƤ¢½s¬)ó#-<IC$£”ÐIᕪ`Ú)†“Rê`däæäØ»cq4'£Uˆ§ÿ§¤îÎ…ª¼¡?œJÇÕ(ªáúÂÞwÔ¡£‚¶SJË|éBÒÄo>dQ43¾Ê]ÃWB®C‘TþâÜOpDhOú¤2ó*Îöçžö÷íVµ9îéÚºÖýG‡kCK±á[oæü#Ë¿5°"C•.A•…·Ï€#—+qAqb_‹„Ïôn[xßÂCpÔüß\ R¼Äøµç½ä\+‘¥ž¬ÁÒ™‘ÍÈ^Ôï²yFdsŽf{õëqQ.Aâøá…Š6(áfP}~v¡‹ýëðè–íÜ4žÄ¥FÔ5¦›ò“"j9;d¿àh±Î-|â¡uýjýÑn?b¢·à°ã¿¡r‘Î ZôzvW0 MfåˆFü‰ÒĶp·usO%¯ë¡Fˆ&Û˜„Ol@ãÿ>ì endstream endobj 579 0 obj << /Type /FontDescriptor /FontName /THNRYL+CMTI10 /Flags 4 /FontBBox [-35 -250 1124 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle -14 /StemV 68 /XHeight 431 /CharSet (/C/G/L/a/b/c/colon/d/e/f/g/h/hyphen/i/k/l/m/n/o/p/period/r/s/slash/t/u/w/y) /FontFile 578 0 R >> endobj 580 0 obj << /Length1 2871 /Length2 20454 /Length3 0 /Length 22075 /Filter /FlateDecode >> stream xÚŒ·PÙ-Œ“à»»»'ØÁÝÝ<¸»»îœàw‚ë;™;w’¹ÿ_õ^¥Š°zw÷jÝûƒœXI•^ØÄÎ(agëLÏÌÀÄ•WScf01±201±À‘“«Y8[ÿ+‡#tt²°³åùCCÔhè ’‰:ƒåíl2.ÖfV33'€…‰‰û¿ŠvŽ<1CW €<@ÆÎèG.jgïáhafî âùï¯*cj377'Ý_æa £…±¡-@ÞÐÙhb46´¨Ú[=þå‚ŠÏÜÙÙž‡‘ÑÍÍÁÐƉÁÎÑL€šàfálP:]&€_) m€§ÆGP3·púϪ©³›¡#X[m@&.¶&@Gˆ *-P´ÚþGYî? t€¿‹`f`þÇÝßÖ¿YØþelhllgcohëaak0µ°%äœÝ醶&¿ ­ì@ö†®†Ö†F …¿B7H+ AþŸ“±£…½³ƒ“…õ¯¹•YÜÖDÔÎÆhëì÷+>1 G 1¨îŒ7×ÊÖÎÍÖë¿ÈÔÂÖÄôW&.öŒê¶.@i±¿u@"¸ß23 3€‰‰‰‹•tÝͨyØÿ:dþ%åàãeog0¥ô±0‚þƒór2tœ]€>^üÁ13L,ŒF@3 [¸ßÞAb é0¨ÿŽî&Ðø1˜~ýûç7=Є™ØÙZ{üVÿ«ÅŒÂj*’ÂJ´§üÏ¡ˆˆ;À‹ž @ÏÂÊ `gåpps|þíåŸüÿ›û_R%C‹¿cûß´­©€û?)€j÷ß4\ÿž ª¿—†ðo;Ð4T¿‡_—‰Éôƒùÿyþ2ùÿ›ü_^þ¯Ãÿ¿I¸X[ÿuNõ…ÿϹ¡…µÇß ivqm†¼h?lÿWUøŸu–šX¸Øüï©´³!hC„mͬÿ)¤…“„…;ÐDÉÂÙØü¯‰ùo@Þ­-lJvN¿î=3ÓÿœVÎØ t§8šõ×´Qÿf·5¶3ùµz,ìCGGC8&Ð|±°³¼˜A;jtÿk´Œ ¶vÎ (;€©#ܯ–r°ƒ¦é—è?ˆÀ(òqE#.£ØoÄ `ÿq2%~#f£äoÄ`”úXŒÒ¿€Qæ7±ËýF vùßÄ®ðØÿA\ v¥ßħòøT#ŸÚoÊ]ý7±¿ÿ@쿈]ó7±kýƒ¸Aš†ÿ fЙ¡1h~þ‘°‚l mìA;óë:üGDgèdlê½µÉom6–_bÐøY8Yý.6(lCçߌ F¿ÈÂÈÐØÊÉÚÐÉüÿl¿ÄŽ@•0r44ZMÿ³ÿ-þϦþã•ù?b+ ó¿ô¹Yÿ‘ÿ(qã;(Dc;kÐTÿ“Û/‰Í¥;ã‚ bbgmýgÌ {ñwm@Îü)ǯsеñÛTÓß& pM-\ÿðñëØÎåOŠÙo s³_;ðOPì¿K˪˜¹‡½9Ðö ÌâŠÔò«? ¨8¿#æUÁú׊ÿ>•Òæ7ÝðŒ¿©ØA¾lAWÃﺨm]lŒ~]Êf„z{í~ òi÷‡33(QûßÇ {Ð‚í¿šÍÆü·ôß­½+Œ y}ü¡Êñ—ÌÂîwCÙ@…µ·vù#1ÐG£ÃïÄ! Ó_—ß?¾Ù~ íœ&F¿KÄÊý·ðßq03ƒ”ÿh3¨¿ÙØAFN@‹!û/ ë½c9q½Àÿ„ Êîv‰”ÜoZÐ+Æèlîüc¨@Õsv³ûÃäÃå÷j€8ÿúØr2¶sü³ 9pý‚vûc1ANÝÿ€ V? ¨}ž¿cyò:þ'‚½Æ.Ž þ9ÿõ„ƒÿ⿾Ӏ@w 1ÜÒ¼1o°e]ð—»a|7ú þòjz¯%Ç—$Ø$êêŒÀuÇá¤á”•mqªk¡e¢g¯£ÖØ°¶åöGï§q*Ó;íp‹SX“GÂõýïÞЫ íz?;x¿°‚lï’!ÏqpáBRÊC¿së“t¯ï/û>:¿£¼[Í! ÿTöþ£z´n@ñ,y®Qæ Œ3ý»74hçîȳ×73hÙ“¯D2q´p>ÇY ½´7X>ÝÏy®V¨±8}Å%ÃÕÆyy66Má%²ÿY{Á«¤(z!‹‰šl}¬ŸÈ{´‹ø„GGN ›ÉÚq‰[rŒÌ§½ž1@³ámÆŽª=MýÒ­©››„džbKQŸþîPØÛÛpGZy×X¯ÝÍ%¨k­£kÙ£“ºIÏÓ­·p[˜+Í"«bÏa>ò0W»\_½ ,ÓKÉj½z-'ígÜwÝU;ÊÅO]à` ’R‘QÐ Òš8ɇã®kÑÙtßVs·½Õí¦ÖÆ]–PÿÎàp±ûÂv’;¦Â%ûèéæFÐèa8Y$Ín„ÖLdiw¢Y”I—À™]0?\&[ËsG*$óݤJhº]â|\>lï¶ûCYî£ *©mÝÃó¾ÀQ$Ô¬vf˜¡_Ks²A¤Â5F¤»ãò6ŸvÝ@Á~AnX8¾øx¡ÎèEÎGiø¶ý¹ÛÄè0Ÿ‘qÌí­L›Ãt*3ȱDž†G.«%zÍTReKëõ"ÆcùTg”[¾¾"ÇTò_—méŒô&,éÕú¦ŒiÏtk/zŒ¸UG×…ÕhPˆéÄÍ€¥S 5î´Íñ’p´‡(ùÜûtÆ­wõN^Ï[2|xžø˜³<*EÔ¸j»ûQÿðnÀ-fxF¾y†ÆݦekW«*cLàx‘Áq½"ÖÞÔ‹Iì«7‡Pù^öA&¯Þ!cu§¹÷äÃ]±Š0ÔÚpì,¤M†õþ …ÆŠ?vÔê asÞù³DÞêYù»Ì†ä.üå¹ÔaÖX Y_i¬ÐBN!,5NáùGE%¤HÞO«±ÑR#´¡šµY¼>uñwY»–ýZš×â .åD_òÙÛí¿ÇŠH)ÚÌT`=•æpÚ+w|dc2—Jc;wÑ9FtÓêèýœ–µ“ÉòEÇyêÛðÈçåüè† Aó«ÔÈ£ŒÍš¥wdþp&…‘d¥„ôž’Àœ‹RêO¥ÞêÓg¥GѦØ0÷åèbÎw(³&É=Å9üéìã?¿øÑâ7œZrv“Y½&cm¡¡Rã‚O‡ª1‚M9„㩯LIÔÞƶ2':‹O~k^ÍBœÎóÇfÆíͯ“ÐWüLŸ™”yÙSä€ «ŸAü AÃlæv»Çò5—±('»…µK¨|K·†Óó»¡çá43ÁuD3ÃFêùÏ€(q÷@-ʶ¡²ÛCöp c?~[ËN–­Ž9˜ycŒýX7f„Owcû¬þFÙÒza‘Ý-u<ŸÆ~ šÎç–®F%ì^=–˜š“wÙç>òY\)RQz•ÆÌÕ"¹•¿¨îªÓ)¹Ä^/F§ñ·êY&'¾îúÞJTú‹Ì•ØÍ|l‹;Aׇ êN>Õ.ʆ?Zz¥LŠ­ EWôš–H‰è5ÜL× x¼›äe_Í(P²ž¢Íy¿0â¹:’ŸnŒE†cÀª¯†—­ä GWS³Ý}X§w«¢’^&Z( ¥_ÍþÌMz%|²I+8(rD¶·2H}(_ÇSL¥A¹Kö"Ò/Y†€Kï?¦–š4‡¥eá…,Bg• Y²Gâ7Q.N’îrѾ¤µñPjp&€:­o@Ö@•T9C c“úð^–Yvk‘R 5C|CIŽG~ß+R•U’EIˆC7{Cþ|NKó#¥ÿ÷ýk? ,ó”^è[-üìËGë@ò·±%…*uûñbƒÊÊ«­4yîZ˜0d̾¹o%#Œ}qê Qû–V)öÒ(p˜GÃXÏÏb ×­=Áàu¿  6šr§Ç`Ã\¦AM-FºÜV*hý£)µc<þòÓmoŽÚêÍüv@ŠÿÍÂ*€²„Ð>|‰Šª\‹¹u÷¦<"G½kº¢„ñXñZ ŽÜ€â˜À+˜ G¶Ÿ‡AôØb\–;¯Ë]ªŸÝuKüi–Íý;aøNLÎRÛSdZÝUV±É–5;¥Ñ¨ÑªÝg©€bBÍ>Wÿæ[Û[í>ÉKhX—qÂæÁÚyùDˆÎ«n³ÇƒYFHX»_š¾ŽÏh›mÈ#]@ û»ÑF8æÓ:;dY°cªÏg^ÂxSNòÛï ¨Y£>¸(Þh—h`h%úß–‹©—™»\³åÁ5Ÿ…-c‰ßCý ²bç? H×Ê=¶ \rû:ê]‚“ê*Z¥ôÜ–€ª]ûx` ´%«HüµüÅs w°7_œš+_8ÃÙ€6yÂîpé0ñMU%¢'†Á.±÷‹_¥!Mոɞ:|,,5ƒ³4¹CÜÂK8! dŽÃ©[­µÀ^°æ úÛ~Ö¢¡˜ Nä>nEç&VïçìŽL?[í_¹`ד4RÄäú;¾|òZ91¨ÃH2qKÄ÷^F””yõdlÎØ—¢ìÔ& ŽXK]”Ÿ(àúX°ñ)f@e,üxÁ>Îu¯j9û5ÔÞÛ÷Ôäèh›ûV#+¬AÁÇ©jvO¢¶>lÍÚ¯ŽC5^íŽØÝêÚ¯ÜâeÙó³’U›.qlÜËv¸ãŒ›¾Hî[ŸcTC¼3L¹‰*¿j^0¸ ‰¸›J‰?1¸ið>†¤ÚÑ}}‹]("ge%ÛèËmúÆÌì‰ÜúÀ»œâ ¾ÿ7$ù!CšüY²›ˆw]®¤+MÇœêÇÆ~ã½M°å`”Ía¶- ÈS©ÌÑi{Ekå/°%K¯ïWJS\`h¹_—‘Ù8Q£<$‘©¦{^Ö×K{¾F’TzŽl!Ù)ö|Hô®0Ö~!ð)Ø jÖö&Zí¼ß2̺ÞÁ7ŒÝ ™ÀL†Õúrvš1q Vd&Ò` …¾ô‘[ýYâP¦ZMÇ^¯~zÄ~ÂñÁ#x½9ÿÃÐ>0(„ Asj.Š1LFCÓ ›Ï ÄØmLáçÎ(Íò|ýQšLàžÌëdd˜Í>|ëÌ–;[œ{Ïdlµ@ðš†zÀ^©ÜëD®š‹ò¾]+Ïê%ÿ…Ï»Fñ†ÑªmÕ‘Ñq&†„®êOÌkÔð&XQA¤?G¤aÆyÛý•ô°Ñ:†/Z±TÀ»^’žö“Ú¤!éI†Ó3n¶D²''†ž¸¼W¾KNf­­žéò¶I!ÀÙl³„¯W»iNÀ`ä0 òl`n¢¶~ÞAÁr&%ìÝÀ$o¾M2 ŽTíêx¦eÇÁB|#ëæÔÉbÇ–ô!o‚ûŽƒ9\¯=] b…Œ‚ÞFõ¿µpo0X5püŽFáøuIúø-7f¹õƒê›DfÕCUè+0œ-²Óê‚žÊëé>œèH¬Ó®$T=ø;4½) é*5+÷ótK3£,©“7 TçHTZUÔÁ×C_v*Zv%wàU­/ïÒ6Àjñ榜JåçÞ'GQ—Ý¥|þÙ½[&s¡õþb4«áø+s÷3Œ ©Œ3– º|à :IºQñ˜r7ÁYg«©qóÔL¶cCG5<Ÿ™µïdzä8v­jÙIþÕ ½#8¡ðÿ°ìsRN×+˜‡Œ—[mQcVï V]vÍ~ø%>çFÍŸ¢øP²Y'M%îÝWw}P”^oåÄMŸdôŠÕ‡òô 7qÇqG4ÅÏí#z@ã”YŸž¿¸ ^˜ùzÛ šYºM™‡ïé…ÛzdÔX8cl¥dôÆw lŽ)·¶§÷®hÜ[z¦’8Q-¨%J¥Œl†®0°ä˜1g_¬àx+€B<†«»>uðIþ­›úmÆ1[òâr]ƆEQ˜–Áz+ pQO‹ö£Ã•|\Ms¦oþWÏ•6¾5õ]Ñ)¡Ðd­üPül1½¶Ñu—ÌÐ ŽGÅ\q5£FmÔ¹Vß4Ô¬‘ïóNqs`ðÙTHbÞaÔM5žo"!!–Ú…Ê$Òè¦èÂlõÖЦº>œ’’{;,´6Ái¢Ø›¿;ì jw‰[½R‰Åã„MëJHC"Ï7C˜âq°°eÉ­ ­ 2ÀþÑ|n™^7!òþ‡¡Ñ,f7]µ™¢-%æðÓPYe16žøl(%ï»—f,@Øvhƈ%îOCí€õAÉLÅ ç=Iî„‘¿Ú7¡Ï$Êø‰nö–é˜ sæšÌ·õ¼”×%SÐ úEÈ|“Tg?ýºÙ%¿Â¹P>ÄNèÃã}xk’Lk]®FâEhÁQóÁÕñ½âw¬¼Ð7౦0Ÿ÷²Ë̃ÖÍSÝÛsk¦OfÔY/ÍDO1”Ê1Híá|´¤aeuïûÃé:gn…SÎT”ƈ`•¬,øn5ÔÀw b7Ž Â'Ãã•Ò¬ÇbnÔ¼ht™ÔàÇ É‡D–wrrê¡™“íq_O^äÎ5j—×îÅ `v п°-$Ì áÞ›t–%w'î¹V³cÔC¶e°1ûÄLUh›ù•, ^Ê¿kÆq½{I›²±‰òOûÎ+^Y-wا—!å]©šÐSSÖ ½ê‚í*>¿}×P¼³Wóµ}¹Ìzéºÿ>u0t[r¬Ê„u¹{,8íî"f÷#¢¥f†’³ S냥–«f˜2ž]> aŠ™>k–]Ô>ûr®YôÖ9‘9—…ZxÉk½äîlÛ8h¡&'®¼ÄS‰Fy´4YuAeÇ„†hÏZá{1ÆÝr8¬­ÃåC1$Ó:ká‡.›^~HÆýu?å‹«zÓ«­<¸ Jé· Pyí[‚Ãè–e©Ôp#ŸŽÒfêh³šr…ѧßM9æmµ—rPHM%ŠrÏÛ8B{÷r:Ö¡ý”¼'ç »”q|iâ[£*7“Ôïék¨÷­vW:€Ñ÷—ÝZ›ÅÅîÞÐzÐ M ¹kI$Ã4mæ$L^N[÷Am×ýa·¾Çú”A¹E«ôæ¼öÍv¿ã–茟‡I$a¸À¥$Zl¿1ƒãVpFÅ}ÂØîba¼ë4þCÆß ÎXÛ»©šLtHgšÐ"rxÿäì±n£s€Õ[8ÎSbS‹íFvQ•@j$Ef³8ë€Ú÷ƒ<£ØH§ UQ°÷¢Ÿ3[Å-l½uP¼’=_$KcÇÛŸw®Jšãô#D¢&¥®Iä¾ìý•“K4®—²0µžÌ¡3¬æÆ'L V—h4Vµtö8#oBߣ‡x¾–ǯœ¸FÂ>!Ù©x…rš³Š{Œ(”’‡EØ#‚ÔÆñ+Ðk??§½rnÊÂs‰Œt|²fXA€°»&œÄjœs w…“mVgÒæ+{÷åR^?ËNbsþ,‘O3ÜÄ(‹¨ï;¸ÑìOû–©sƒÏF²Õõ£‡·@q !óAщn%p¢Bº AÕ uXDZ­9znÖõm ¸ß˜KôV¥ÝÊ՚̻Òâö˜ÉÁþ¼NÙlÚÑn[êA9¼>ÕÕób/½?è¾tÁcP28,5ºMi,OYmè~ŽIˆÐC³9Žõv0¼Ý7J~GTô*/¢*ñšé‰c¾Sú„ªhÕ.Ï7„GÙÇY}>bú"f²v¹Ä5yTTiz¬¹DéS0æ0Ò 4îSŠTéÈÒZÀd¿Ù§õ&cšvTpÚ’JÌ [“PyŸI-—T#%ÈæÀJ×´=cÁfòVìÚv}v«?J²ëƒ¾™æ„Búb¯ŸHöÌ>-6‡Óe£äT¤l›Y ëAˆs¡7 B¦d/†+0ØÃ#ïMl°°X@–<8¾¥bÔéÚöæ-ZÓ3täØžÓ¼F Öh¡ƒø" ¦ˆu¡|¡eP²g óA¤zƒÐ¼xÖáâ ˜w˜árr¿‹¦¯KNþ¶bðl/ݨ+±H^7ÙÐËÈN6]z×vZ=Ø®ßmÎìÝ%k|÷ÜGï8•N‡w‚¨ç唥ȻàªóvÒóïuû`¿ëYÌ«™ E}Ôù°®ÝøáØ2” *ÿ%‘½ º„RË Y>œ–VœÇ5.r„$²e¦ì¬Ôo3Á°È‹wR á“A½ ÂmíÄðãåÙY)‰‘Ó†…ƒ]ž¶íȻޒtÖÝžhàÔUa­ÙÀ¢Ýcæ?Ù±Ê}ókvãËJÅtu6%ä– ±ekQ ) œB|#«¨h,¯"ʈ+ ŸÖP½° 7×l˜aü ÎÆÃüh{dÓ …Ü®­Kf‘N!Û÷ì÷:c´ yBŒKÈœoÊc™š|†çgº§Ÿª½~”óñ¥»ß®´¬cyÎ_…ñ=Àƒ]|šÊ_ãs„YÃi É0 tnJI!ó8˜*›Ï} ÐÓøŒÓ3ÿmV u› 2 õÚH©@$¾Yƒæ¶èð@z¤bÖ¡j€ÿÛ#¦úÿ9Ãì¶À‰ù¯m0;ªÁµìI·ô>œof°–è»Ói°[¤E«b¼˜‡ZC…#SÖµûëÀVá:*ÆQI¾Ç³MAãØ&Âø“Çm±Í¾n„*ö¬p[GDHé&׃ˆ¾C‡VgI’t¦áZï!?adêšÞZpO@A7*[„2ÝôER'Ð4䤓"¡Té«{K…4NZêëQAŒ?òhrξ'O Ž ìðA`jZ¯!wOÚÚµÊCéjéÉ$zF‡2еÍsÚíï´9˜q!÷çêMU®c4¯Ì8¤¹L­ 6+L§ÖsJ2GÚtç´ç°]Nê`êuŠ(91åYÄm9ÎêÊz³ÿæ€Ð…ŸqãqM$ á_¿¼šÂQÄÓŸi¶àk°åGny8 ª¯-ñlÒS ʈ)‹ º0X[Ý1úðùt§?Ê¡N#rplcWõSÚ†y²õ“å½z¹Åú›1¦ Ƹ¦WE¶ù–5Hê5œ¾¿e÷éA ØõÕ›T~žö=û4ô(ÑþÕêuzzŒÕ¡?œ|†É ¸æ$øp‰Ú¸ã+¦,ۜӚe’ðþK"1è%½ñ·» ”$šB"úDÛ‰¯Ï1t2šÆ¥íè0hO‚Õ’ r 4:AT¦?É%ñ÷eà ᧺iÕ‰[—(Å“ysÅ4DŠ¾†Ë"#Žß¦2ͧw€ßV©5C8öp™aMóæ8¨MŸW§+̾—ÁV=ö/?p4:{)3^eÁˆ2½ê°<¬¨”ýV©ÎRËÄ9ô.A˜×¹Ç¦œà-†â|A¦QCY‹ªÅ°?Ò•WÒû¾©«ãÜ•=T E‰+7ü๚"yÙ6±µ:¡ÇûÓhߊÙ(„­ñ¦GIK¯7‚8à+Á—ß½Øqs|úùv¿Wëh® ¿g#3xãÈ~¿‹Èûåzè~Åp^…©!üæÂ@ç29$‹xã.6„°þ UB—gù ˜¾û‰@s—ÖN^çõ>o…áÖóÔý¼òºð­$Œê›¬j~8úÕy^÷cN»J³©.zÖ—̸£w¼òoä>èݹŽŽ-1K“^³lA^8ñ§Ø‘Ø…uÎŽ¶C¡wï·ÃHz F^³HÐ,'Ïbãqäëgê”Ý›gÚ÷Ù¤€ª®×/&Ž––Õв­˜âÌG§ãº‘:Ý!ȇVâ?'¦þP_tF[“»­“u¹©‡Ô¨º’Ì©ï"VƒÂ}²;µætÅE$0fè\¨Ø‹ÇùâPÿÑá+¬:ØE÷ä ç'¸goAÎ$ý´È¬p´²3*Š¯Æq§å¾?ømû᳋Á^…3oÄ¢P%¾(¡Å‰Ô‘!fÀTk´œ‹¨óˆçÕhX—.Hšh<§lV›§‘,3ÐÜR¢MëA¨ßí"reM0˜|;“옞¨³‰1ô퇃ðªÁÄèH¥îÇë"?Ú§ R~bã :§¹_²9^È7:èÏÅIŸQÏ§Ï b+r¡4™ta®Fäô1\ñÎhÜՌǬÀÌc¼Š²s¾Ç”ñO‘u ìèVÝ,ìûNÚ0Ì}$NÎ+D¢ófœú Z/µò”3냴Éi!v¼×w¸Jjæ$#C›©>D„"Móû PÙ +>¯2ßy›5 G•yYÝÂÔK  âÄ‘§Åi¿•oF+)*•ù¨Fdv0˜_Ž ï л ¨ÑEßyõÂÈíÆ;<®#–\½?IŸXÈ'ʆŠÌ1â"Ô¸J[0€„ž’!~†éˆáñ-BzÖÎ)Á¿yÏ0¦™¥h&úù.r%VgóÁ¬âHg_µüÌnŠÿÀ§'AÛcdmÁ¥8Ê{×J9ÙšÓBæ ñÝfe8Üž³„ü«DµìÆr>Õ¾&ô‚ ¸¡<ÒÔcÛÏ©¸`¯¡ºõ®ÌŸKµ›´A26à'#e~øÚ4ßò±›}ñ‚ Ž¸#× ½Üýþ©Ä×jeSðmÇEŒ»‚{œDÞÙŒ]ºÍÔù}èAȇŸ¼rÎu{?ë•Ûƒ˜Gô‘ªÈâðqó(#’Œü¶—¼¿gÄXºµÔæ1¹[3"ñQŒ–¬44öÙKø -d‘½Éàg°v"²6æ&ÀÇœû8¥û¹‰«¦,»ó‡•1תM,~y>ìWN'Ú¹dª%ö…3ù¯øßñHü‚c0\dŒi¦ÙÒ¤SÃ8¾HÛ*ß?~7~œüÐ!;p”fƒ[ÞÝäCð”$€ü9¨/U½ˆ ƒw‰Õ¨v§#<˜tJ5ä¶Õ§»˜F&F¥ûMË­˜W½àBuF\ô÷ök—œOÝ_¥Üç#.PjCÒ³påÀnÁŽÚl wó…3‘¼ö`=•ŸŸ„šiW!QÊ îÄO´91^w{öáO«¾§¬‘nW½Y9sÿª‰¸’!š ³—Cë­ Â9r¤›gݶ멖.r7B·•"èÞÌÔÕ7eÖ¦O…øûFoM‹%!à©£s¹¬³äsߪ'²íÊSé· q@EÑì;hÖ­7¶ÙQ´j´ÇW¥ùU;¤sÖp :¥ny¸ÎŸ'z¬yÕ·@³]7•ˆ”Ç+P"cE¡Â'g"ŸYô2È@ëãdSó“|c]…¼fVPã“»0ø‰ ó5?FwJ:]À1ÿécù˜~®Ýâµ@L%«Í)¢DYT  @b:ò$³éÓêÃv¸ šÈìùCžf" Ĺ+ÒâpX‚-7ÂûePþVzÏàÕ·bË ÍƒSñ™D6$Ïârvúv=jêäF ì˼´˜"—8áÍ¥òÓʇD×ÏÈ7‰šiìŠòT+ºsï,cΊÉÉngø·z/Ãn¨˜»¡$zÔóµé„4am©½WšÙsü¦¤_ûDa‹‹×hÌ›PôÂÌt>åF­ Ä“ˆ·å©bŒ¹ 5k³þ°^ EC;øcÄF/”?+¡ÃÜqôZ˜]z×Æ°ÕVÑóE¹äý¾ÀêúÜb]¤Ø£)1tWe×4Ä‚)ˆSzq-)roXs™L:™ûÖWõ.ÎJ׃ëéòZ¢åœŸB}É£Ø6 º½^Ô.þ³E–ê¯cCGâ ¯9 ´8œ9¥1¬ACûá’’•àâ®!‘¤'Iy½6ŸëÅ‘ßRŒbžÇF”¿sD7N/º†µ4ýPWIVçÅ:[öìÜsÞc­äS{úûîó ÿűXõÓ]Éú·ì£Ñ¦_ã]Ò^Š ¶[g¢Ó2ÊRR£«ÊÔÝ ø¢‰y”\û¸žM’ƒ<¶Ï¸'beŒúf‘hø»ê¡”PÂfLòëi-ìÃô†¼ŒaØôÜ},ñ2=·*P¤£™8´ªt2ÆÅ·/˜tB¯4”ž'º":Vç u‡SÄ#áP#Þp<3ÜεøÄ|ßí°#¡}ÇÕƒ†w«y£¦„ )Ga‹ÕæKðt©=C9­b€R6xuqr.q¸$²ª–ø¾}br®l¤,Ç“Kp¹÷v )7no4¤ky™V¹t±ÔÅîY@I¸ÇÒ*<cLºA¨|þ±æo›!<1‹0sõCr09Øþ~Ï®±a^hDTSGŸæMŽ¤†;òÏ0†œ›·^êlVooÝ Ñ_8-ÍÌÒ­’ƒË™„¸ ¯]ÇH7€{ì7šÃÒgî–áÈ“ÀaíÏ ÷ v_´jz=Æ8Y<ˆ¯Uл±ìÙ bs{êjHT#( À:_áqcéó»”:†H´šböš^¡ >Zi‚?¬iû:ï¶þ\õ@¯øy©%ìtØCf‰*¨á%M«Bd92š'+1Fì®Yì†:éc놉ì?9Ji|)ÓèwFNE³x;C‘Yüdäå§É+NPp¥k4B/òô½6åú¸0ÑpÆ õþG;´œL±í•”À ©Áu͉˜ÅÙO6d÷À‰rµdµŽ-†ÔçéŽPç\;é*©†©v+ÕyX½§Â:QgܾnÚà1ëañKò÷DèÑcg°òB&æÒOÓñúŒÌ’ŒâF¬ƒMƒ«öEE&´'ƒCr…%Ž¡ÚõFwÔÍžhtÀÀðÔXcG¯O¥›"¸H)Žu¨Ã™MÎæ:€»ÞD©³ÐgÈ<_«]´Gi5#²Î÷$+nÍjˆYpÑEëA6bBR‘{à вË÷“MW©üßöœ½·¶´Æx?Gz.?5@(—¨¿_!³Ç€pÕˆÉÁ“{ì¸oÌXXûÈãÂ|êe· —ˆE›ÿ¶¬2/–Þ(Óa’£d•µæKÔä%ÞÄšÈF즸¿µÊmád{4v3UîÏáæ+,J’ i)ÿA.Ýüþ%‡õP›uÏÃú˜Ë¼2@¼ËËZpE"ÅùªXÖ#? Q嶂¤…•úÞW¿Õ…˜Ï°O’°¨$©îÉl ·qBO 7»äR°‘ÄÇ™rÿY¨Ú5}­Ÿ\ŠÜ¼®~=ÞU¥›ÝDE58X£3zµX„&ýÌî ì~¦\Å(1‰†‚z²èëÇø5ªÎN³/Ôd± m?²†F6Ô/ÍTUŸ{EíýuR>«z‰F¯Gˆ­jÄ$2tÔQ:¸¼M(W9?¢û™à‹³OU¿ãR¢?”Æ«!µ,óù2nŠ2ÂgÌ¢’! SÕ\ â=à#¿I7¿r·¹´PÅ6YT¡ËÜ@Ì-ýõj?cc{ñ bóx$ìiÀýƒ‡ió¹›Î…ù6øõZ.SL/Ú/Ü–oX2iÙDâ8JmyC‚ü©?%¢@ÇA#¢!ÊúŠ ¥të½ù”êÌÑçô˜‡ì²µs`àpŒc¥Ãþà¨ß3?ÙQÏ-*†G 7™à-¦ž®õøc™2×ýÌ0aœÂöÀÒ™Ö“ãáÅÛ42å®Çõg¶h «@®€x’†ãåI9W´ãÃQœÆijŸl wQßBæÂa„E¾Cgìb†Qü#ô f­Æ>­Z ¤ôÕ‹r,YdÝ7ŠüƺõVܺÞ ºWô*qLÑä¤n¤zDiTˆ3}XÖTJ Óâ€Ò·Ñõ·œV¯Ä™„éÞï šÁ/¦l_Ô« YexVÏÛÄä &o¦,Ý´÷«Çyû;?ÃR §ßÞKöæ@âD¢Ù~W$¦âKÚÈlÙ×:>JðKö<ã‹GÓ5ZsÓôïÕI¾ë]!·Æ¦ðzk×ÀÝj5·ý2ûÈ´<Ëû¸èkXV2®+GÅ·7ykÖþ¶¡zÏjsÅ»ÝM¡ÂÛX'çAUå¸ù—Ü„¡\­Ðœâ!¤jyOEÀªïÞÎÊg…ëÆñJ¤÷Ú55ýmWÛO|R»4®.%WJöUÖNgGH÷p‚,¼ëûRíš ¡WÝþ$»°„ ó±0”nº_áé}ÝkWYc„‡pËÏ€_”ï¯DýÒ^Úü÷‹Ì„ÉT¾r \«yq–nŠ¸ëêÝÁ‰RCe5C [24/\w?{¤¼KU]ôé¾ó+’@£ÐÏíãá{¨Ù¨ôË;b“ú6Ö©”ÜŒ¶4Z3­Ó4È„jå¢× )¾˜ç¸ðHaãåüFñL ¾'dÂ7ROÈË1Š_‰§–ìw1š.—'”…ãi|+5pOó9ÂÅÐD°y[=-Õ—s´mï0”™Ñ¼2µÒìZÈðÄ =ÂÎG1Æó süb5<öa¹>+L;Íñ´oÛvÁOչ膙9Éü_dE™e4!òù?Þ-UA¾;„øaŒ­Ð´ÀYÛ"¡¨5¦ðZ?û¸S¤è->›+ÖFV¯ÜLÚÂWàJ_W‘>i|q0‘k^MQ4Bt°‡ v]q„#ìý°©éŠ‡?Äþ½èÝî‡f­ ÉÌaée)ïé5Öcp€È?ršh2F¶õp‹A%ùìæÌ—ðÐp‰Ã\ÆÂQ!$qËКÞö&hÈbäõ-}ÜƾíËR´¦– öb3+Á Pžø™Etš™£u™¥UAí<'ùTÃÊÖ€ç)JoÅ]àSLJDþJÅ¡ŒÊîuiÅÌÉ8À_è×;K'Ûy3×ËÖ#Àº‡óÚ±î\“å' Sù¥ÜÓ½ÔSÕci²â“jöØ,ðb3l³äâGâ·§˜]Æeln~>åWM–tóYÅ–Î'§¤{²‘ªˆ˜ü7ý>žòÐ⇠+ÅKD½±$Úø~»‚”ÂqÐòÔ&?å†)Zšó'že4IB£)Æ(VDy¤´RZh"T…v6‘ɱl•HÛw!¿„þÎüPsïŠ4¹2܆¨>½×Çf’¶w, AzSáßNæLU-5E…O ö†b£-ÄK¸G‡˜ñ˜¨«i˜ñ"ðž%›VfŽéÍJ,hÓÜÊô©»I7ÕxŽ÷Šî|žñ^ŠN‘˨¼žÔ<Ú+¤¥“?hLNþug ÃþÚ¡_’€B§àÅÈn-¸¸W Œ+-·ÈÉÓ–ž)~r9v§¸uB¾½keþYÑÛ9&§jжWÁÁ° yŽ›o~Z|*ÀœôI ‘[åú®rôVß #ÞCž;j.CJ]o2‚8¨}ŸÞªHŠV9ém fq?κPÒÜB<¥=ûvQ2S7(ζOán¶ð£³!¼uÕ Ûº<ˆ"löi”¥^p«°t™ÇivÂ\ñqe*…‘íOý‰ÞUIãNª»•>Þ-¥ã;½YÙ_atݾ¢˜~©° 6‚Qý bû½jÁϨ.q‚ïÌ/eÕf0d~ëLâx5ÞÁ“®dÎx¬rÂ](Ü XÒ.ß-ð4K'm½@êëÒ3þªÃÅ1è~÷¥V«Sb&‚¼@ìV¼yFF‹”9†”E›HÎaO’MÛèA¦µC7ˆH}D™êô°žÒ R@J“*ž^M„nO"iæqÇ›ño ›¯ÝzÇ4‡Ñ¸AØŸ“¼Ò¸xVËÕᎇ§öžÃ”Š¾»ÒÃ>(m)or®"ºg);`”Àkäa¤Êûà0ðÇÙÁÉãÅX& ¿ÆS½Ú÷æAh°åÌÆp|[ˆ_z¿ýÉ­OÃg<^ÖŽWòNÚ­²›¼\ó@ZQ‰÷æÖH~úùÈ¥|›§ÍÕ$eh5=˜æê“ŠKý¤à•û‹úÐ÷­áìЕ£>yí q9QS^¥¬i)í£@ nyvMÉk!¼~欃ñaô/øú×ÄûJ^æ$Gn'HÛ›cf•8-Ú ûÔÖvtQÈ97¤ˆ!]³dà¬;… Æ'«ÚoyÏ­BBô9âš5Ô•Ã!ËuÚÔ_¯á³S‹9ÖŽÊõ¹Û.IªîNfœçöxý0/æ¦nXòÞñ)±¿1£r 4«Ä® ÓzGgQ¥÷%UµLÍÚµkíËI‘ckù,à“öêAZ&:oHÉ‚ NZ¬"1¡ëe=Êó¾ø"‰ÜI˜ErM¥ )„kÖXÔ¸6fì\› ò¤çäXû|â>u-~ò'’¼è ߀±¬È³–!wéüh2Y™× i ‘eŒ¥žƒêO°›«å`š]äÂÜÓÉ묋èØ¡xýjZQódS‹9ÑŸ$ ¸ôŠñP³íM-i,A4‚ÐR´ëF¡«9ö|M>š¦^öß<>y äî}C„,6ý /?Wd®㔊VÉÞïÍÌöTÊM[˹'ý6øŠëâþc9¤´ì­¾ýj,œLbcóRÍ+ÍíQö}›ýKîô°û>Öt…Cv¤¹ úc:ùdë¥Èè…î”`²Ñë9-œ„ê o4RcÒ®qb¾#HºyÓzƒ•£ñ°MÎ\¼#ÅN.¤ÉM†×pýliÌ#ÏŠZÄP:lü¨…ÂÚuÖ©ÁK6Å/Nk¢¼RÃw™Ÿù]Ó’¼#ƒw'.QkÍ?#ºrH¡,¾yáÜqÄT†pÙaYʺ€žp‰Éc|³²gMˆ‹']Pqi¶ºþÕ}gÑ8¯øHao¹[Û49vr•$‡wXè쇿ñG²Úy™7ù“\@†’|♕¡ÚÇ)n ÙpÁzÉU­qimìÈò[˜2›íì«yûjú[Ž~bÔR˜ýþŽ]Þ=4sô[ì÷I¶¼´©NÓ=Z"Ox1NÜ›\ßDOçRyó´êä+ j`áˆ+â2vÔîáÖ·´“ŒûVñ‹‰Gcœ¢\a©ÌŽxÐ: |£ûvÑx…ó2õ…Jôë‹åš…|‡F&FöÆI1“ï3äÍ·àj¬N.’å?!ZKH #BÒFC' ‰r‹_$'#ƒè,ƒßyÓYÆ Îóƒq¼þøá+R¡î$ÞIíVJµõUn] ë«\;³LÀRȆx`Ô´’™g¸|ï® Íë~œÚŒÒ€àzaNaçP#…âR¾F7žá:~ïÇ'‡b‹þAŠD¥ÌÝÏn¼!˜b™Øê..³óV0QgI)Ç!‘–”N”YçRçÖvòl¨¸¸žJyßßõ®¿zç]§ÉÄ#tPUcƒel°óæéT›çâå(ÌÔFt`}ÿ8=Ï)|˜UØpìÕ¨qPAGÕp€þlØae,¢gs9Uu8{)4ïµèjø gÚ´¼½"šm2RIOS7Œ_¬A«.l$KV<ÄYŸ¦ìüëÂñHò)y­Ç[§!Ê÷ªˆ:¯ýï»Êß'~¨p(²¿™QYU¾ÔûØÛ¹ÁhŸX\x¤d´½sfÍNÿ2ƒÁàÒCÇ®O¿«Ü®{ª—]ô)/…geº¥´­0ƒ_ý<3úÜÒmzÜ™o:Š&c ÿ\s ç›æ”-êà©"˜Ù0]dÂ7¯Ø»zëtQ<)¹Â6¯Û(¸V˜™ºca.Ö¤{s[Šóy8írb¾‹^FXD^{Ã]•wõâ¦nuÁó7æ–ÈòLù˜{Õ7u&¤†÷õQ7V¢ÈYÙO¾â­¨\ù°wçHÙ¬,[µ}cûd•©QÓ†oÍÙ Brñízö ¦H„¸1Dó»)ýêa´x±^Ξ6;‘¶Î lí-§l”÷rsZáap­&|,'©ÁëÕ¯w¬þq‹‰¼C6dPåQ, Fìz>ñ6&inC£È$c Ì³©,ßP÷2ƒ«óÎ)8#ίvôýRbàûÕT èQÖj°îN¸¥Bø˜¼­HÉ¥è¶Ìî ­òÈ×HMõÏÏÍ_R'R Œ¾÷À=ŒÈtTRÅ­lf#´\)‘å« |(ìŽã¨ 3Ú£mܨXRÊLÞá.bâw@ \LRåpÜ×Ç6Ô:[5é Y¶ôÚ²YÄ[…Zc·wˆÁ'‚HÈS^“ 2œà´2Í2jT“´ŒàK9ª6ƤUªRßÒXI¤3ÂR×EÛ‘3«¬n~=a‡“HB/—h@½$*øÐ.½ã`tR‘˜Œ Q½NžnÌC\ÁÅõ´1h Š4@©ÏKèOêl6rŽ&B)s´AJk\Ö  bvµÔò(qó|å#иÇtÓ2ÀÙ„ÛÉÖk3Ü´îÜ**âÏüÂ=³Q®‹˜Œ{¦—è žƒÙ·ùÞŠöy—7ð<µéÓ(aŠeõLó*w—D•½ IJ? ÌÅåjáç7-‘Ô°Š^|#ÂoÙñ:,msDY<5£¢uf?ÖEr©rgÊYæE½qGnëµ/‰ùP@¬ñe%A™x•3N×\RtÎÔK›#¶¡odÞ¤üœ¢¤ÁN ¼x /Ê᪕ò€æ~QQóÇݱ½ÙY|ó´G8ó}£ºØÑh)Gµ£áf¼{½ø•VÚÛ×aÈ{"Ñë¦ Õ/Ìlïטò–vÜU?\ûy,n4D眽»¢“ ÖócÒTh%|»O×¢GÔQ0øÙj»lÈ8s¾yÇs1t$zµÓÛßIˆ}Y!-7;žwHW¶ìèb±; 1(±dŸô8‹2†rðÁ0»í½œä†,‹˜c/g¸óìáÕ×ûLÏåwBP¢cé(…)¹ð˜ƒ5Õ–Œ“j,RŠ-µðV—¦’†­ûs±!Âv©ï²Â9Æ®>ç´^ãçó—ŒÁðrÑt†Eç.còü?7È뢡;ãÕ-í|½¼{_bs¢Ìì|Ì;ËÚ“æ‹š$wRûžŽ5@pU¨`p˜^§ÓåÉs:í<Õ¿‹Wѳ Óq–:lÏÿ2]¦¿µ@•†"ó5‹Èäß ×lÉtßâÐVLŽs¸TÝó<ÅlƒælŽÊ5Ä€^%RpŸ™0¹§«²3Â툤W>ðöi\ãâ²Ù”qÝ›‡Î°uÕ%s ¾ž¾g>|vW~©Z­`D |lý‚¤#/TH”áEØm´‘Î9è•/ÐV©ÞnWppk[Éû1 _ãrØ¥SZ²¾S (…ÀœÙS‚Wó{JŸPª\`Q ÇÕXNv¿ÙÒºu›ç@Þ~8²oX‡¼âD¼æì°«ÉXV%1®¬ 1ФR6õ„Øl¤áÅGž Þt‚ËÝG]ñH3Ák€º+ÏÐ)sÄE¸=ïñì:ñ)T#¾a@´=B왫(QñJuj´=éÝñïš+4m™Ý»RoüJ¢J Ùâžá¸¯»’],#ç.kX¼ödWv{yœƒ6Ý<(º7 È ¹æ€]9A+«ê,7·“2}¾ùÓN>¬X[Æ”²ÒÛJ1)ãŒ"7ßvù(Ý"¸°@UëóVsf7; h"hMT¹R@ÁÞU µ¼Â´ pùº‚sÅ ²¿É¤ÔKžáe4Ú r™–1x)'#UÏßzã_FÕËx*¶¹i¼Äš"Žma#y ‡pFcMûöùÕEvzí"@ø•”Pœ'OÚI"­Sïߣع¡õÕ÷ÿ½PñK óDžˆq¼§É­ü+ÅÑ3¶ÅQ-‘v7Άeòë§ðÖN¼…¬Zà{Ù‘õùÄÚóÊ3hå äÌ÷R8·G{Â3J½××1£ŒF¶×$ôâú]äÌ?ñKÀ=r´S`\ÝK‘þÔÊ.}ö¯ö¸1Ì€… saÎ?žå©ÝK«[Ë&¼Ú"ï@•;± 0%!3Ÿ½a4íÆ¥Ér"ŸÙÒŽ5{}µÕ6uù¶G•HÅËøN iLàT«°‘‘äKoYI€¤ã衽 Q3>ƒ¿ ”wçò$=C¡.—´=з¨{zZè å_a|ë#.ت)¦äã§Xb{û÷èØo uX¸¿"‰ôSXSi4g(K ´sùܦ¾Ë¶Ñœ|s†'RbPÚ:²“©€ñz<;¤ûø÷B’ ã­6+~ä àÏH+6Ç»œLí@ÆÀ „B¹`‰Ë‘ „sÇŒ8Ï„„M“{…ÁXêi!Y|œ}Ç{Ç^½`ÂÑÅ5S;2FgpÐzˆ(³K«‡³1¬A4ÎÀÊ2ìÊá4o'}ÇmiÆAL•‰i”0¹ØmÜ v"+AMÑ(¼ŠãžøÃÏÁð©Ô< ´A#"è‘×ÆíÃ…V¡ÑÎTØXú†–fÅ8&®´ 7êÊç8òIF6"ך6;ð:üö÷\ÐäðEdqpn¶C/UŽ+j2c-ÓÇ‚K2uëŽ`ƒ˜®à}çIè>\ÝW …ê*•Òk3Іǚ-×u`Å(‰mʼÓÏ¥ñQßû3³så·®ÍXÐÊc¦ÚãªÿSG–ˆI¥¿ß-ÏZ…¤]ÛŤ¾\Íú(-ž¼é¥áã$؆ªŒ`2¤kI€Qüâk( NݽÊÀaã ÕN:’ß2{?¹&c›ëÕ+¹³©L‚¨í#‰Žîô…^Ÿd…qŸ‚”Ár> -¥¡»~a ºתÔ}—6›Ù6HŽlïzoY.rž?ªZÈftj„a•x=ØpdB¯ÀsÓôYIÞ­¨TÊÀØDKÄ%§`S¯¶ÊXÌ]áµà˜Ó_ÁÀª€Ä °|w_¦ã„Éw jæPÒÖ[;ážb¾ed+üË´rîÍ¥ÇÇïúËÆúu«Ô]/š¢wd`ðf-r È †ÖbåkƒJ/y9é’‡®ÀFm«ƒëö¥|ó_Š¯Ý¾@ái|ÊgÔëÀ™Ta‰$‘sR| wÈ}Á?œô6ƒ²z;t±°À?:5[^6EŒ±æ<•‰áboî4¡ŠÎŒðL_kC4*‡ÿÌžb¥íÂý¶ï@FQAM‹«Q˘Ë¯ŸÌãԲܪ•Ž™ 4¦Úk$C«ˆqÔ9*ËþŸ4…å/@ קØ}¼U ð´çH4íäŸâó|ëY€,t³I>ÅŸ‰lþ¦)»ÈITâÞWÿ'IB²¶Ð®kDs?ÆW5uYê(·¸¨'oüéÁ.Ÿ5œXõ‘|hŒ0‡‡C{ û¨h= ú–ʳØ0¸Kkz°,õÃâ礔âÆÐ/:Ïô6Q™‡\·ÖUŠòÍÆŽÕ€`xƒÐ§ßT¸îÈÝŽžòb›Y-,†8PÎ/ £ ,N'16‘Âe¤ü-£? Îòb#Ö¨]g`ˆ¢q1¾¡hËÍGèbZ3®iñG—'}YÕ†Gœµßo,$؇à–`ÃøQiHÀíðËýÚq•ÅÇ þQ8˜Pm•Ö=…ÓÄâÔ/‰º3©‚ÔV±Ñ"°‚¼kŠä¡ç?~1 (Boy¯¶.ˆÈæyuê-Úø‰‡²Uö"ö‚ØiL„ÑD£Ýå2cª†Ô_FM —áJ…u¬fŒùÊ’¡±¿¤ílwv1'°rö¶øe´7»RõççSra§2ôédŽÃîÅÅ×(q^eHǤŒsaQí'FLR[Œ‰ Ý$G7¼‰JÉÍ-aU]›Ã©Wt¨Ü2´gÊ´¢”¹Üh•j‡ßû/GZÍ–U/dÞß}¸~ú‘Èù`βû”9c±“ý˜é|Þ'‘S²‹Ljõ2$p}™Yk==†>°´jfùèF]@²Ñ%Y‰ŸÅÆ)òí&B§Ï¹“á2*Rðµûy{^”<%(æM1#ÀÝ_Ç!ªAG§Œ$ä\µÒô†Ô–ˆéûy~k¹ˆQülUÉñk\Ég¦ÁÚÝäúžÑoD1ÃV ²@„(Ëõ‰«”»÷hj‡Øÿ=D MÁñ\¿(…êaõÔÍì¼ÏýLº/´x~ßØ¡íP-áÿL £þÎ0÷…ašD1¥õkÿÌEõ¸3´å]¨¿‡Õ¨À‰d…D¯ã}Tc•³€Ãó®uä…>â¶&Å›×€MX>°– ŸX.Ì®š³¢ËHìíùÆíÎ[û)Íô¾—9•&eÅ $ iCB"r&{Âk…Ö ý§;pû“'ÒÑ(1û 0¶ž†ã¨nÏ!‚„ã/_à¨u‡8³åGKŸI„K1|~[ÖƃÜ3¡«yAöThÞEEYùŸ›ð˜ðd^;ã%ÞúÔóâ‹úÔă5aBžCÇøå¦ÜLmr.HiÊ­7z¡¡rSI@Äg;Ücä=õe«èéd}h¶¤ˆ5‚ÀŸ‘Ϩ‰´$C2a×ÛNßXŒ#w}ºP8:£©LO`vIú¢BßÚ}M(ÜŠ1‹2-ßÅtƒ£ >x³¦ã3Pg©ÒöœÒݹ¦´oÅa(Ëgð/wW¤¼\Et+u h5lÌì.&–QÓåV5±s‹s@v¢þÄößpâ”ì/QPj»®´9º˜Î N Çpñ"Uâç„<‰ÙýWZRñÔq~áhE0½®Ø¢16Ʋ¬ÄɤÖ¨äK7ï`˜è”Rñ2ª¨gù§ê¢Ý¤!Å8ä2{¨&"&Ç÷ˆF´Ðh_‡ § ½AUÞs'Š•M~×Ö>`óÖÎMñKã?¸±ø÷†¾gÄ€Ó°r½b~Ç:&>¨ ba¬”MŒ‘ˆZûáªÀ[èTH¥ÃÏYmÚÐý'³ñ›DÀÒ˜ØÖ·RË0„?À¶†ódÖÈõÏCNú§bÃÓ)í`ÞÒXÔE¦[¿—ü(ä†kƒÄ÷L;›`ÖŽ;Þ¸`‡K öŽ¡;'ÍÛÆ'aýA„w•éüιZ(죞ðVg. ò¶ŽäzûåU]½çH…<ÇÕ+ ·½ëŒ Ú t莛ìyHævOÔ­äG„‡Âü@ÄYMlã§ú$ýÇèè"sNÉy†Õ™0ý|v•Cí¥ËÛ!ç/Ù5u ãI(2,{žýi;toGíËoh—E½'o6”i2¸KíðŠ3dúâðØDíí2F†ÞEN¤¨ÒÂ@M°}DŽp¨•ùg@Þ7°\èÙxHûîÆ÷*$ÊH¶,ðUg‡´0x.$­@ý£aï–‹î v|O‚àm‘ÕÆç“óN¦B}ÂQËZÆäk8{ØåõÊôàMŸ(—©eôeã¯eÃ’@y]ÞZì§,w®½¦ÞÈKýô•éP L+ýÛ@è¶?6´w9“VŠQúK*N[v÷ÔsŹÙœ)cgH=lYÏŒ¢êÛÁ(þQí§Ì ’Eð¥âŸ.4| uc^OøÞ•ö^†H7,O?ÓhÊ&:*’äΊ:ÅËåï-ÔÃE ³ò ;Fê4°xÕKlÑM§µ!%ÊÓضi\ŠÌm“s}ˆ§|\P ÚÁâ•#øYŠ‡9ãÌ‚zöŒˆó9û»Ó!X ç—Ñ€žòÝÞF#§3ê¥Yv¬Þ³cµ!ß`£/µQw•a\ [ÓgvTšQ‡U7^ŸœÃ6.´îÃÃÇd‚(ŒêO+Ö—·ÈwÀŠ &bôŸÿ¡¶Ã÷Îeõ#cœE,Ás’¾32Ut2¦WºO¯±ÐB|’òìèlSÒ¢-£ÿøøòá0³}"eñÙ7z7óÐ[Û®ç¹fɬæ÷^ƒ’¢éûî%?O@øoªÚ endstream endobj 581 0 obj << /Type /FontDescriptor /FontName /ATRGAP+CMTT10 /Flags 4 /FontBBox [-4 -233 537 696] /Ascent 611 /CapHeight 611 /Descent -222 /ItalicAngle 0 /StemV 69 /XHeight 431 /CharSet (/A/B/C/D/E/F/G/H/I/J/L/M/N/O/P/R/S/T/U/V/W/X/Y/a/acute/ampersand/asciitilde/asterisk/at/b/backslash/bar/braceleft/braceright/bracketleft/bracketright/c/colon/comma/d/dollar/e/eight/equal/f/five/four/g/greater/h/hyphen/i/j/k/l/less/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/question/quotedbl/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero) /FontFile 580 0 R >> endobj 582 0 obj << /Length1 1747 /Length2 4392 /Length3 0 /Length 5459 /Filter /FlateDecode >> stream xÚt 8ÔmÔ~ic,•Ý/;1‹}ß÷-kd©Æ, f†™±gJ‘²–%²%"²+"YRÙ³'YÆ’õ-o½ïÿ]ßwÍuÍÌ}Îýœsîçœóœ1µWGâQ:xI†*šÆ––0 •C¡ K É õÛ8"1xœÂ_ M N¢Ø´à$ Ñ <ݘ$“Q€É*@¡€*ÿ›ˆ'(Zp/ 0xŠÐÄ»û0NÎ$Jžßa„“——ûqPÇ¢ÃIÎ(,%#îXàÉ÷_!„•œI$wÄÛÛ ÇÁx‚“Šˆà!9æ("Šà…Bû’8õK$X:cˆ?x4ÉN@ƒÂ)G(¤)†„pþ11¿Û@‰î†Á¡LñDÌþ{ˆÃ Ðÿø(+‡p¥¼)DJ³~¸P”úwFmÜ_= iN À}APÊ|IHKþ0ÊŽ"Q>?F€€qxå@Q ñÐ~Kåe|ßôÉÇ?H€ þARRDYÄ?ìýz!È¿ € þ‚ý”¡ §ý“r³(”˜Î2HS¯»3å!úàØ0AJ¹®AJ½nRPÊqÛ¿¬?~Šì£þŠMÙNþ/H©Ðý/( @<þ‚”RÿªF©ë¯D0Bú RÊôü RÊôúÿÕ;„'@yÖ~¬¥±¿ñ7…òA!@úñÅp—ÒðšuoñÉN )ú–åëdjë m6¯i³PM¥ï+’¢Ôz§¢¿2}‘Èß«pµ9u½8r%%ZáÔ‡§5GÐŽŸÅ®t1)o~!yJLÖ×Û^–Ä!N}«4oõ&«õˆœóXšìKÕU¬|¼^äüí˜Ð³y0UçÍèc¬rr’tTáµê©µ5ž¨÷ôÖéó—Õ:¿ÞáÒ™ýžÒÜ.!=Þò±@ì f,…cnŽÞÝœ:§’<Ó$Ãnx¹ è˜hÒfݺ%J® v$¾1½•#ÅŽ¶\®ø’ãyŽ7<„PùµtBïí£B‰ÏïTÉ–æó²á¢Nvq“`†FÔŸ$žQß2®Qº ®Õ¨áô¸c-G•ïQí¾¾¿Mý’wgÿ{«.aÉX³´ëWó>OæÁí%òBVÉ‘¨cË›W63ÝÕÒ tËž}~Í°By@–W—ù^Ýß~ç3~ÄñB2ý'Öf=+k0b+Z2ŸkóÔ¾çûU%Æë>¬:œó‚È„´þP-¯hò9oå—”®›³À^Òê-z7j$$›ñW® ‰náWzèu ˜¯5ÜMó–Šû´ÔðˆLh¿4Tq±°G ²ˆ¾Êo0|¨ŒÔð:z†³f(¦ÜÐ|þ ¹L÷‘ýI•ÁùD]Ô·CgŒŸm¦—ܳ)æˆ|Ëú‰Æ#2ÑÙÏÃÖ%‡9þLÓó1Õ¹î¬Ï1³Î,-ö£Œx(¤õ;YM/j_Â먖,4µÔ¿Û­R§Îo3=HÊ%¬\ Gß ÷  ~ˆÊ²–ŸaP°]ºW•×s¼1ÂB3]g¼¢Öd0pfI`èžfâ²³!9Qµ1ú –²žmÕÕóÏ›L<÷†WÌ]?PšÓX`|ˆQ2ð…Ù| YZ?%”E.âb;·7òNÏ<ÔûáPtl+§ßùŒÕveØf[SE«Å_py}%ynbÒ¤9¦¢"[ cçJ=iUúˆ-ØÍJFþÊÖAóžO)—Å® Ô>7\ÎHðŸÆËkÊ ßµJ•\vÑaH«ùš²yµ¶ç7I`÷x|L³Ç™'­Ý7¿7/5¸-b·Ì9@’æÛ<7Ør5Æ+” ¯;ȯ ­Æ† ò¿p´}rÎ~]i/†êæ¨Ä„œ³ Ô\âtQÖÛ¸«@qè¬W°¬~hb¨sCÌàå§÷ßu©|åë&D²·jçÞ,UÖPZ÷b;,^¥áýš]áÜ^+{ôÂKMoÔJ_É gÄ´0”ªu¥öûôŽÁ@ߢÿ‡ê– {Ï]÷P¦¹D³šìíT”åTÚdzLpè‹DîE[õ°~Usoµ÷Ä_Ë6’ÛÛåtŒÛLØéœÚÝõ§u Q4çÔNñ8mT1ºï“‹NÝX”ˆ@¡5“vï¶Ú—ÜOXú:¡€š*úœéÛÏäØ@rÀë,—DM'‰§ÝFôÁŪšD5èY¹½Ku£"šc‚;P#ƒ‡ïà.ñý–8VÝç@öÁF«ëO-ÔÿïœlgÎ?Ì ÿ,J…;)ùå&j¸øÂYË8ì+Q/oÓ‹œÒ³M,nWß^VÏ–|G3¾<Š úeʉ¸,Æäùn`»üÆ­SU2K$ êè›%›¦ßÆZ )\[ßá^‰™RrꅈݒÐgUÅȆn?–•,‚CíBCãc¾#+6nøÔö!e4hQ§ól=âlé™\û/±n Æõr¼1r Ã\?ÿ)†‘Û!¸oð*øe£8 ‹£ D‘¶¯1lf^~^]eˆ«o‡—é€x2—ÞÂtD—vçòÍš–-чA­­൬Y—,ýÚyÓqÞïeß°9-•­ · ©ûJÖïp‰Eiß,-Ï<°r ’ÄõÎçá)×-Ö(à ãøpÆhaÂÿpLÞáÍž/4Žáå॓Šü5Etû3Mw›V°-ké F£öÔWž3 òvÔyGð/pVš6œ–‰ÃÛˆE3Æä ê,É‘MA±ÍÌx>-`Ìw1Vd²»‚w=9¤l:yli’k=}†¥L±®JÏqáqjX©A~üåC¹GÆñÒï6ðËÑ­xâ¾}Ôá vô0srL!¸ÂÆ«÷©øâºIfYÙÌù7zÇtÒÃ\â»49Î šÓfL‚¦E§Üãkb+ ßK[{Ô:bUÇ2XhÈVZ™×Gmè7[ ¥¢TÒ©±ñ¬‹Ls·³'iÆ }ëª5ÏM peHYöx°Ó‘»° °oÏ$æN[®¾˜(Ùõ¬Ü {Ûë6cž{ª¸Mp휉ÏÁtWÝØô õ2FZ¡mÍõ¦?\Á˜oùŸƒÂvXîð¨}ÍFæ—­/ÂZÔƳ-HçWÚ ½r‹˜¹k`"TSÈ…|­0ËùËÚ@¹*O^`žnd›Ÿò æ»7Ës¹"HgæÔ›./ÇóoY¸©f¼ ñ"åïÖ/­p¼q×;zt×.Æ£Âà s§‘ÍJÛÆÉW¢~×+OE÷áÔâ*¥#¼3­…GæP-ÏkjŽ‡2à£ÞZ¬K}¢+ütÖk¹>…5ç:ý‰âÅ “l<ÇŸÊ›†õh æ >œ™N+ØNm84-øÖS‹ —î²Ï«~p±tèV_í!ø—£Œ¾dÝ´÷Í©,µ A.ƒ±×îû=ÓŠ·!¾n|Y„ÚBW³¿5àœµÞäÞázóDmuè”t?ïÆz«Cñ¢ê^ãÖ{åã‚}·ËmdŽ›ˆA<'ÎÌ¢¶"jj¹,iU™®ƒ¶`Ôã.Ì=¹ÄumRß_Oöˆð#£TþÛ!‚»@`˜ÖA«Înöä¥*Ù\¡E3ÖÎXà^|jÁýÉÇ:÷Xb_¾È|Û‘aÊÕŒ5N:P–¸Äè2lŸf¦®K…G‚NòÌ%0ïb9 B°lëñ7Ã/ ™Ö[½*U\Kÿªx_núÄY¥jLë„ì ooŒÒ”!L?zϾª· 2ó+Þü°Ó2`—œ[zÜ¥s7\P#ß„‹A³høyõxÓÚäǽOyÖÁ,ÄUó<úd±‹wêâV&£Éü²q{–W, X"y>Wà '٘账Ž9i7xuÊ—c}™·IȺ2ŸäÂ|9;å¡VD–XÉ£§y…9ev¾!_±wê>2ž¸k™›ÿ~Ah*VJã“´¯ý·´ÊÄA´‰ˆÚdÉô‰«m,“Sɧ†ዧ-¶àc ·—n¼*˜Îü²€F|„Æ¢^Y¸´pßžù–_¾÷rò†¿Y»²ú…hn¾ð‡ F"ði;Ù-±ÓOwS߉<ŸfüY.24ÁMk*fw¸0išðq„‘›Ÿ_Uq0ùw;]mWœ}ét¿ º&-éJ~«o,Yé’‚œM>ñŽáØðçÂ|êR™¸G[=‡<Ž6Ž¦ê‰]|ækÀ«›þv÷¿!ïbKyÐáIm3IZe“­ü~[è+yºD}µzû‹¯Âúø‡Ü”i=Lè{¤RK®Ý4ðº²å†èÚ.Ù“OñU¹“–Ðvv¤9·ôµ¯Yæø {ÞgÉêÞs|y2æ4z òýÕO½¼³¾ž1¦ÌCß0|Ïö}!&‘g'.t.vó+MæØä<È€8†·±)*i#·Ëæ^±ß1þÎÑg³ í8Œ.w< HSne­éÕ+dšö¯ÞÜQá#¨zÞ~&Ww­ûLuw¤›9Jš½NØÜq¯q:¤n)Ksj×­¯Þ†Eww÷¼µØ†{në.øÈÛZ’»UÓv¼ˆõŒ4!Ó~FE<25þ ²ãTEª}>§9³Nð¦¯é,4‰ ×Ô ô‰Áo óC¬®–xm.Ú£짯™eÑáÓK]W¡Ùè¯=WqÜókîYõ5]‘#™Ù“]±¼-¢ÎëªdMšN»ŒClâQʹ0E}UÍ[zŸ»¬Y\Ť… £^(€lc»výleB†äW&n»Õ7™fÒ8Ðú»¤¥žíÖ¶“ã>a[{àúÁy¶%þ9˜›ÜƒøôÛ¡—Ï?8œ÷òQô–ë²þÀøLã‡i-Ÿ>¤/ó1g6KE’í ŠíUso¯fl°ÖŽ—×›ÒùäÝ•=QÏ;¥x² ìj.ýjGü‘¦‚ß2^jØu°h‰æ=³ëìI¹Úe‰£ ÷‘— »`×£o3\Ø.ö/ÄAëv1ZÜóvÌ°:±e1«;*"ùrPl@D…óûÜ‹¬úH_Óظ…ñ¡ë"!ÜØ*ÝPŒ×$ç0ž°˜{¾Yr;—ŸWkÐý¡äš3'ÝmÛ xýÞ\Ä"YÈç´^K ¹ÿÕx:ëúX¨Sºh׳èA›$‚ ]X94hŒã½uÈØƒë± f7èؽè‘üuÝØð.+v]ÅÛ‚YÀ å!fÖfµisjÎlVoƒ§wxŠmu6:ÛÁ#•áeua5îQX½=L ¹1¾8>>SYÚt˜wá(§v˜¡¤£cY¥TÑ௻'Zø‡”h_×ò++fÁ´„Y‡Ó=¢ªvŒ_fõ°Æ¾êæ1¤Ý®q¯uHØ‹{.©û§۬ ‰ ›¤^Ëèn¯)'8(Âé½CEéšTŸÅ„0™ôFpȪM‹,3‘¶>ÐÓUü¾ü%p¨Z»úéBqAƒ7í{Z?ºe³¹WØ┌àœÆ:Ó$šK}{«wÍ‚†×¯jóMÔpÍRÑ<·*êAå¼´ÐÛ]’{ðä­fVºÀý…Æχm‚ò>PŸrèk®Og+7bÈ ™›;¶i‘agíɘԻұÚ5}> endobj 362 0 obj << /Type /Font /Subtype /Type1 /BaseFont /ZWIIUE+CMB10 /FontDescriptor 561 0 R /FirstChar 45 /LastChar 120 /Widths 552 0 R /ToUnicode 1 0 R >> endobj 7 0 obj << /Type /Font /Subtype /Type1 /BaseFont /PKLDRG+CMBX12 /FontDescriptor 563 0 R /FirstChar 12 /LastChar 122 /Widths 559 0 R /ToUnicode 1 0 R >> endobj 385 0 obj << /Type /Font /Subtype /Type1 /BaseFont /XPUFLM+CMEX10 /FontDescriptor 565 0 R /FirstChar 26 /LastChar 62 /Widths 549 0 R >> endobj 61 0 obj << /Type /Font /Subtype /Type1 /BaseFont /MJYXVL+CMMI10 /FontDescriptor 567 0 R /FirstChar 18 /LastChar 122 /Widths 554 0 R >> endobj 60 0 obj << /Type /Font /Subtype /Type1 /BaseFont /GPANTX+CMMI12 /FontDescriptor 569 0 R /FirstChar 58 /LastChar 58 /Widths 555 0 R >> endobj 376 0 obj << /Type /Font /Subtype /Type1 /BaseFont /VUZWZI+CMMI7 /FontDescriptor 571 0 R /FirstChar 83 /LastChar 116 /Widths 551 0 R >> endobj 8 0 obj << /Type /Font /Subtype /Type1 /BaseFont /CKSARD+CMR10 /FontDescriptor 573 0 R /FirstChar 11 /LastChar 127 /Widths 558 0 R /ToUnicode 1 0 R >> endobj 377 0 obj << /Type /Font /Subtype /Type1 /BaseFont /NLKSSS+CMR7 /FontDescriptor 575 0 R /FirstChar 49 /LastChar 52 /Widths 550 0 R >> endobj 14 0 obj << /Type /Font /Subtype /Type1 /BaseFont /PQWCTK+CMSY10 /FontDescriptor 577 0 R /FirstChar 0 /LastChar 21 /Widths 556 0 R >> endobj 361 0 obj << /Type /Font /Subtype /Type1 /BaseFont /THNRYL+CMTI10 /FontDescriptor 579 0 R /FirstChar 45 /LastChar 121 /Widths 553 0 R /ToUnicode 2 0 R >> endobj 13 0 obj << /Type /Font /Subtype /Type1 /BaseFont /ATRGAP+CMTT10 /FontDescriptor 581 0 R /FirstChar 19 /LastChar 126 /Widths 557 0 R /ToUnicode 3 0 R >> endobj 417 0 obj << /Type /Font /Subtype /Type1 /BaseFont /SRPVJS+CMTT12 /FontDescriptor 583 0 R /FirstChar 44 /LastChar 118 /Widths 548 0 R /ToUnicode 3 0 R >> endobj 9 0 obj << /Type /Pages /Count 6 /Parent 584 0 R /Kids [5 0 R 11 0 R 57 0 R 100 0 R 359 0 R 369 0 R] >> endobj 378 0 obj << /Type /Pages /Count 6 /Parent 584 0 R /Kids [373 0 R 382 0 R 391 0 R 394 0 R 398 0 R 402 0 R] >> endobj 408 0 obj << /Type /Pages /Count 6 /Parent 584 0 R /Kids [405 0 R 411 0 R 415 0 R 419 0 R 422 0 R 425 0 R] >> endobj 430 0 obj << /Type /Pages /Count 6 /Parent 584 0 R /Kids [428 0 R 432 0 R 438 0 R 445 0 R 448 0 R 452 0 R] >> endobj 460 0 obj << /Type /Pages /Count 6 /Parent 584 0 R /Kids [457 0 R 463 0 R 467 0 R 470 0 R 474 0 R 477 0 R] >> endobj 483 0 obj << /Type /Pages /Count 6 /Parent 584 0 R /Kids [480 0 R 488 0 R 493 0 R 497 0 R 500 0 R 503 0 R] >> endobj 510 0 obj << /Type /Pages /Count 6 /Parent 585 0 R /Kids [507 0 R 512 0 R 517 0 R 522 0 R 526 0 R 529 0 R] >> endobj 535 0 obj << /Type /Pages /Count 4 /Parent 585 0 R /Kids [533 0 R 537 0 R 541 0 R 545 0 R] >> endobj 584 0 obj << /Type /Pages /Count 36 /Parent 586 0 R /Kids [9 0 R 378 0 R 408 0 R 430 0 R 460 0 R 483 0 R] >> endobj 585 0 obj << /Type /Pages /Count 10 /Parent 586 0 R /Kids [510 0 R 535 0 R] >> endobj 586 0 obj << /Type /Pages /Count 46 /Kids [584 0 R 585 0 R] >> endobj 587 0 obj << /Type /Outlines /First 116 0 R /Last 352 0 R /Count 6 >> endobj 352 0 obj << /Title 353 0 R /A 350 0 R /Parent 587 0 R /Prev 348 0 R >> endobj 348 0 obj << /Title 349 0 R /A 346 0 R /Parent 587 0 R /Prev 316 0 R /Next 352 0 R >> endobj 344 0 obj << /Title 345 0 R /A 342 0 R /Parent 316 0 R /Prev 340 0 R >> endobj 340 0 obj << /Title 341 0 R /A 338 0 R /Parent 316 0 R /Prev 336 0 R /Next 344 0 R >> endobj 336 0 obj << /Title 337 0 R /A 334 0 R /Parent 316 0 R /Prev 324 0 R /Next 340 0 R >> endobj 332 0 obj << /Title 333 0 R /A 330 0 R /Parent 324 0 R /Prev 328 0 R >> endobj 328 0 obj << /Title 329 0 R /A 326 0 R /Parent 324 0 R /Next 332 0 R >> endobj 324 0 obj << /Title 325 0 R /A 322 0 R /Parent 316 0 R /Prev 320 0 R /Next 336 0 R /First 328 0 R /Last 332 0 R /Count -2 >> endobj 320 0 obj << /Title 321 0 R /A 318 0 R /Parent 316 0 R /Next 324 0 R >> endobj 316 0 obj << /Title 317 0 R /A 314 0 R /Parent 587 0 R /Prev 228 0 R /Next 348 0 R /First 320 0 R /Last 344 0 R /Count -5 >> endobj 312 0 obj << /Title 313 0 R /A 310 0 R /Parent 304 0 R /Prev 308 0 R >> endobj 308 0 obj << /Title 309 0 R /A 306 0 R /Parent 304 0 R /Next 312 0 R >> endobj 304 0 obj << /Title 305 0 R /A 302 0 R /Parent 228 0 R /Prev 300 0 R /First 308 0 R /Last 312 0 R /Count -2 >> endobj 300 0 obj << /Title 301 0 R /A 298 0 R /Parent 228 0 R /Prev 296 0 R /Next 304 0 R >> endobj 296 0 obj << /Title 297 0 R /A 294 0 R /Parent 228 0 R /Prev 232 0 R /Next 300 0 R >> endobj 292 0 obj << /Title 293 0 R /A 290 0 R /Parent 232 0 R /Prev 288 0 R >> endobj 288 0 obj << /Title 289 0 R /A 286 0 R /Parent 232 0 R /Prev 284 0 R /Next 292 0 R >> endobj 284 0 obj << /Title 285 0 R /A 282 0 R /Parent 232 0 R /Prev 280 0 R /Next 288 0 R >> endobj 280 0 obj << /Title 281 0 R /A 278 0 R /Parent 232 0 R /Prev 272 0 R /Next 284 0 R >> endobj 276 0 obj << /Title 277 0 R /A 274 0 R /Parent 272 0 R >> endobj 272 0 obj << /Title 273 0 R /A 270 0 R /Parent 232 0 R /Prev 260 0 R /Next 280 0 R /First 276 0 R /Last 276 0 R /Count -1 >> endobj 268 0 obj << /Title 269 0 R /A 266 0 R /Parent 260 0 R /Prev 264 0 R >> endobj 264 0 obj << /Title 265 0 R /A 262 0 R /Parent 260 0 R /Next 268 0 R >> endobj 260 0 obj << /Title 261 0 R /A 258 0 R /Parent 232 0 R /Prev 248 0 R /Next 272 0 R /First 264 0 R /Last 268 0 R /Count -2 >> endobj 256 0 obj << /Title 257 0 R /A 254 0 R /Parent 248 0 R /Prev 252 0 R >> endobj 252 0 obj << /Title 253 0 R /A 250 0 R /Parent 248 0 R /Next 256 0 R >> endobj 248 0 obj << /Title 249 0 R /A 246 0 R /Parent 232 0 R /Prev 244 0 R /Next 260 0 R /First 252 0 R /Last 256 0 R /Count -2 >> endobj 244 0 obj << /Title 245 0 R /A 242 0 R /Parent 232 0 R /Prev 236 0 R /Next 248 0 R >> endobj 240 0 obj << /Title 241 0 R /A 238 0 R /Parent 236 0 R >> endobj 236 0 obj << /Title 237 0 R /A 234 0 R /Parent 232 0 R /Next 244 0 R /First 240 0 R /Last 240 0 R /Count -1 >> endobj 232 0 obj << /Title 233 0 R /A 230 0 R /Parent 228 0 R /Next 296 0 R /First 236 0 R /Last 292 0 R /Count -9 >> endobj 228 0 obj << /Title 229 0 R /A 226 0 R /Parent 587 0 R /Prev 128 0 R /Next 316 0 R /First 232 0 R /Last 304 0 R /Count -4 >> endobj 224 0 obj << /Title 225 0 R /A 222 0 R /Parent 128 0 R /Prev 152 0 R >> endobj 220 0 obj << /Title 221 0 R /A 218 0 R /Parent 152 0 R /Prev 216 0 R >> endobj 216 0 obj << /Title 217 0 R /A 214 0 R /Parent 152 0 R /Prev 212 0 R /Next 220 0 R >> endobj 212 0 obj << /Title 213 0 R /A 210 0 R /Parent 152 0 R /Prev 208 0 R /Next 216 0 R >> endobj 208 0 obj << /Title 209 0 R /A 206 0 R /Parent 152 0 R /Prev 204 0 R /Next 212 0 R >> endobj 204 0 obj << /Title 205 0 R /A 202 0 R /Parent 152 0 R /Prev 200 0 R /Next 208 0 R >> endobj 200 0 obj << /Title 201 0 R /A 198 0 R /Parent 152 0 R /Prev 196 0 R /Next 204 0 R >> endobj 196 0 obj << /Title 197 0 R /A 194 0 R /Parent 152 0 R /Prev 192 0 R /Next 200 0 R >> endobj 192 0 obj << /Title 193 0 R /A 190 0 R /Parent 152 0 R /Prev 188 0 R /Next 196 0 R >> endobj 188 0 obj << /Title 189 0 R /A 186 0 R /Parent 152 0 R /Prev 184 0 R /Next 192 0 R >> endobj 184 0 obj << /Title 185 0 R /A 182 0 R /Parent 152 0 R /Prev 180 0 R /Next 188 0 R >> endobj 180 0 obj << /Title 181 0 R /A 178 0 R /Parent 152 0 R /Prev 176 0 R /Next 184 0 R >> endobj 176 0 obj << /Title 177 0 R /A 174 0 R /Parent 152 0 R /Prev 172 0 R /Next 180 0 R >> endobj 172 0 obj << /Title 173 0 R /A 170 0 R /Parent 152 0 R /Prev 168 0 R /Next 176 0 R >> endobj 168 0 obj << /Title 169 0 R /A 166 0 R /Parent 152 0 R /Prev 164 0 R /Next 172 0 R >> endobj 164 0 obj << /Title 165 0 R /A 162 0 R /Parent 152 0 R /Prev 160 0 R /Next 168 0 R >> endobj 160 0 obj << /Title 161 0 R /A 158 0 R /Parent 152 0 R /Prev 156 0 R /Next 164 0 R >> endobj 156 0 obj << /Title 157 0 R /A 154 0 R /Parent 152 0 R /Next 160 0 R >> endobj 152 0 obj << /Title 153 0 R /A 150 0 R /Parent 128 0 R /Prev 148 0 R /Next 224 0 R /First 156 0 R /Last 220 0 R /Count -17 >> endobj 148 0 obj << /Title 149 0 R /A 146 0 R /Parent 128 0 R /Prev 136 0 R /Next 152 0 R >> endobj 144 0 obj << /Title 145 0 R /A 142 0 R /Parent 136 0 R /Prev 140 0 R >> endobj 140 0 obj << /Title 141 0 R /A 138 0 R /Parent 136 0 R /Next 144 0 R >> endobj 136 0 obj << /Title 137 0 R /A 134 0 R /Parent 128 0 R /Prev 132 0 R /Next 148 0 R /First 140 0 R /Last 144 0 R /Count -2 >> endobj 132 0 obj << /Title 133 0 R /A 130 0 R /Parent 128 0 R /Next 136 0 R >> endobj 128 0 obj << /Title 129 0 R /A 126 0 R /Parent 587 0 R /Prev 116 0 R /Next 228 0 R /First 132 0 R /Last 224 0 R /Count -5 >> endobj 124 0 obj << /Title 125 0 R /A 122 0 R /Parent 116 0 R /Prev 120 0 R >> endobj 120 0 obj << /Title 121 0 R /A 118 0 R /Parent 116 0 R /Next 124 0 R >> endobj 116 0 obj << /Title 117 0 R /A 114 0 R /Parent 587 0 R /Next 128 0 R /First 120 0 R /Last 124 0 R /Count -2 >> endobj 588 0 obj << /Names [(-1) 59 0 R (-2) 102 0 R (1) 62 0 R (10) 68 0 R (11) 69 0 R (12) 70 0 R] /Limits [(-1) (12)] >> endobj 589 0 obj << /Names [(13) 71 0 R (14) 72 0 R (15) 73 0 R (16) 74 0 R (17) 75 0 R (18) 76 0 R] /Limits [(13) (18)] >> endobj 590 0 obj << /Names [(19) 450 0 R (2) 63 0 R (20) 454 0 R (21) 77 0 R (22) 78 0 R (23) 79 0 R] /Limits [(19) (23)] >> endobj 591 0 obj << /Names [(24) 103 0 R (25) 104 0 R (26) 105 0 R (27) 482 0 R (28) 490 0 R (29) 495 0 R] /Limits [(24) (29)] >> endobj 592 0 obj << /Names [(3) 375 0 R (30) 106 0 R (31) 107 0 R (32) 505 0 R (33) 509 0 R (34) 514 0 R] /Limits [(3) (34)] >> endobj 593 0 obj << /Names [(35) 108 0 R (36) 109 0 R (37) 110 0 R (38) 111 0 R (39) 112 0 R (4) 384 0 R] /Limits [(35) (4)] >> endobj 594 0 obj << /Names [(40) 539 0 R (41) 113 0 R (42) 547 0 R (5) 64 0 R (6) 65 0 R (7) 66 0 R] /Limits [(40) (7)] >> endobj 595 0 obj << /Names [(8) 67 0 R (9) 407 0 R (A First Example) 131 0 R (Bas03a) 365 0 R (Bas03b) 543 0 R (Bas04) 364 0 R] /Limits [(8) (Bas04)] >> endobj 596 0 obj << /Names [(Bas11) 441 0 R (Basic Installation) 335 0 R (Basic Library Utilization) 307 0 R (Basics) 119 0 R (CLooG Data Structures) 231 0 R (CLooG Library) 227 0 R] /Limits [(Bas11) (CLooG Library)] >> endobj 597 0 obj << /Names [(CLooG Options) 151 0 R (CLooG Output) 295 0 R (CLooG Software) 127 0 R (Callable Code) 199 0 R (Calling CLooG) 147 0 R (CloogDomain) 247 0 R] /Limits [(CLooG Options) (CloogDomain)] >> endobj 598 0 obj << /Names [(CloogDomain/PolyLib) 251 0 R (CloogDomain/isl) 255 0 R (CloogInput) 287 0 R (CloogMatrix) 243 0 R (CloogOptions) 283 0 R (CloogScattering) 259 0 R] /Limits [(CloogDomain/PolyLib) (CloogScattering)] >> endobj 599 0 obj << /Names [(CloogScattering/PolyLib) 263 0 R (CloogScattering/isl) 267 0 R (CloogState) 235 0 R (CloogState/isl) 239 0 R (CloogStatement) 279 0 R (CloogUnionDomain) 271 0 R] /Limits [(CloogScattering/PolyLib) (CloogUnionDomain)] >> endobj 600 0 obj << /Names [(CloogUnionDomain/isl) 275 0 R (Compilable Code) 195 0 R (Documentation) 347 0 R (Domain Representation) 139 0 R (Dump CLooG Input File Function) 291 0 R (Equality Spreading) 175 0 R] /Limits [(CloogUnionDomain/isl) (Equality Spreading)] >> endobj 601 0 obj << /Names [(Example of Library Utilization) 303 0 R (Fea92) 379 0 R (First Depth to Optimize Control) 159 0 R (First Level for Spreading) 179 0 R (Full Example) 223 0 R (GMP Library) 331 0 R] /Limits [(Example of Library Utilization) (GMP Library)] >> endobj 602 0 obj << /Names [(Gri04) 366 0 R (Help) 211 0 R (Installing) 315 0 R (Introduction) 115 0 R (Last Depth to Optimize Control) 155 0 R (License) 319 0 R] /Limits [(Gri04) (License)] >> endobj 603 0 obj << /Names [(Loop Strides) 187 0 R (Once Time Loop Elimination) 171 0 R (OpenScop) 207 0 R (Optional Features) 339 0 R (Output) 203 0 R (PolyLib) 327 0 R] /Limits [(Loop Strides) (PolyLib)] >> endobj 604 0 obj << /Names [(Qui00) 363 0 R (Quiet) 219 0 R (References) 351 0 R (Requirements) 323 0 R (Retrieving version information) 299 0 R (Scanning isl Sets) 311 0 R] /Limits [(Qui00) (Scanning isl Sets)] >> endobj 605 0 obj << /Names [(Scattering) 123 0 R (Scattering Representation) 143 0 R (Simple Convex Hull) 167 0 R (Statement Block) 183 0 R (Statement-wise First and Last Depths to Optimize Control) 163 0 R (Uninstallation) 343 0 R] /Limits [(Scattering) (Uninstallation)] >> endobj 606 0 obj << /Names [(Unrolling) 191 0 R (Version) 215 0 R (Wil93) 400 0 R (Writing The Input File) 135 0 R] /Limits [(Unrolling) (Writing The Input File)] >> endobj 607 0 obj << /Kids [588 0 R 589 0 R 590 0 R 591 0 R 592 0 R 593 0 R] /Limits [(-1) (4)] >> endobj 608 0 obj << /Kids [594 0 R 595 0 R 596 0 R 597 0 R 598 0 R 599 0 R] /Limits [(40) (CloogUnionDomain)] >> endobj 609 0 obj << /Kids [600 0 R 601 0 R 602 0 R 603 0 R 604 0 R 605 0 R] /Limits [(CloogUnionDomain/isl) (Uninstallation)] >> endobj 610 0 obj << /Kids [606 0 R] /Limits [(Unrolling) (Writing The Input File)] >> endobj 611 0 obj << /Kids [607 0 R 608 0 R 609 0 R 610 0 R] /Limits [(-1) (Writing The Input File)] >> endobj 612 0 obj << /Dests 611 0 R >> endobj 613 0 obj << /Type /Catalog /Pages 586 0 R /Outlines 587 0 R /Names 612 0 R /PageMode /UseOutlines >> endobj 614 0 obj << /Producer (pdfTeX-1.40.10) /Creator (TeX) /CreationDate (D:20131218043833-08'00') /ModDate (D:20131218043833-08'00') /Trapped /False /PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0) >> endobj xref 0 615 0000000000 65535 f 0000000015 00000 n 0000000681 00000 n 0000001358 00000 n 0000002475 00000 n 0000002371 00000 n 0000001962 00000 n 0000307921 00000 n 0000308651 00000 n 0000309573 00000 n 0000004227 00000 n 0000004120 00000 n 0000002554 00000 n 0000309252 00000 n 0000308950 00000 n 0000007447 00000 n 0000007573 00000 n 0000007700 00000 n 0000007827 00000 n 0000007953 00000 n 0000008080 00000 n 0000008207 00000 n 0000008334 00000 n 0000008461 00000 n 0000008589 00000 n 0000008717 00000 n 0000008845 00000 n 0000008973 00000 n 0000009100 00000 n 0000009228 00000 n 0000009356 00000 n 0000009484 00000 n 0000009612 00000 n 0000009740 00000 n 0000009868 00000 n 0000009996 00000 n 0000010124 00000 n 0000010252 00000 n 0000010380 00000 n 0000010508 00000 n 0000010636 00000 n 0000010763 00000 n 0000010890 00000 n 0000011017 00000 n 0000011145 00000 n 0000011273 00000 n 0000011400 00000 n 0000011528 00000 n 0000011656 00000 n 0000011784 00000 n 0000011911 00000 n 0000012038 00000 n 0000012166 00000 n 0000012293 00000 n 0000014361 00000 n 0000014489 00000 n 0000012470 00000 n 0000007055 00000 n 0000004320 00000 n 0000012419 00000 n 0000308366 00000 n 0000308223 00000 n 0000027262 00000 n 0000051053 00000 n 0000072626 00000 n 0000074748 00000 n 0000078643 00000 n 0000081061 00000 n 0000084732 00000 n 0000087086 00000 n 0000089896 00000 n 0000091396 00000 n 0000093203 00000 n 0000095335 00000 n 0000097017 00000 n 0000099814 00000 n 0000102787 00000 n 0000108507 00000 n 0000111993 00000 n 0000114419 00000 n 0000014617 00000 n 0000014745 00000 n 0000014873 00000 n 0000015000 00000 n 0000015127 00000 n 0000015255 00000 n 0000015383 00000 n 0000015511 00000 n 0000015638 00000 n 0000015766 00000 n 0000015893 00000 n 0000016021 00000 n 0000016149 00000 n 0000016277 00000 n 0000016405 00000 n 0000016533 00000 n 0000016661 00000 n 0000016789 00000 n 0000016917 00000 n 0000017097 00000 n 0000014093 00000 n 0000012586 00000 n 0000017044 00000 n 0000117528 00000 n 0000120128 00000 n 0000123034 00000 n 0000131984 00000 n 0000133753 00000 n 0000138968 00000 n 0000142329 00000 n 0000145838 00000 n 0000147435 00000 n 0000149275 00000 n 0000151517 00000 n 0000017201 00000 n 0000027314 00000 n 0000316414 00000 n 0000017251 00000 n 0000017283 00000 n 0000027367 00000 n 0000316335 00000 n 0000017327 00000 n 0000017376 00000 n 0000051105 00000 n 0000316256 00000 n 0000017424 00000 n 0000017491 00000 n 0000072678 00000 n 0000316124 00000 n 0000017543 00000 n 0000017587 00000 n 0000072731 00000 n 0000316045 00000 n 0000017640 00000 n 0000017675 00000 n 0000074800 00000 n 0000315913 00000 n 0000017735 00000 n 0000017777 00000 n 0000078695 00000 n 0000315834 00000 n 0000017836 00000 n 0000017877 00000 n 0000081113 00000 n 0000315755 00000 n 0000017940 00000 n 0000017994 00000 n 0000084784 00000 n 0000315662 00000 n 0000018045 00000 n 0000018078 00000 n 0000087138 00000 n 0000315529 00000 n 0000018129 00000 n 0000018162 00000 n 0000087191 00000 n 0000315450 00000 n 0000018230 00000 n 0000018291 00000 n 0000087247 00000 n 0000315357 00000 n 0000018360 00000 n 0000018422 00000 n 0000089948 00000 n 0000315264 00000 n 0000018516 00000 n 0000018617 00000 n 0000090005 00000 n 0000315171 00000 n 0000018673 00000 n 0000018725 00000 n 0000091448 00000 n 0000315078 00000 n 0000018789 00000 n 0000018850 00000 n 0000091505 00000 n 0000314985 00000 n 0000018906 00000 n 0000018959 00000 n 0000093255 00000 n 0000314892 00000 n 0000019022 00000 n 0000019080 00000 n 0000093312 00000 n 0000314799 00000 n 0000019133 00000 n 0000019185 00000 n 0000095387 00000 n 0000314706 00000 n 0000019235 00000 n 0000019286 00000 n 0000095440 00000 n 0000314613 00000 n 0000019333 00000 n 0000019396 00000 n 0000095497 00000 n 0000314520 00000 n 0000019449 00000 n 0000019504 00000 n 0000097069 00000 n 0000314427 00000 n 0000019555 00000 n 0000019608 00000 n 0000099866 00000 n 0000314334 00000 n 0000019652 00000 n 0000019690 00000 n 0000099923 00000 n 0000314241 00000 n 0000019736 00000 n 0000019774 00000 n 0000099980 00000 n 0000314148 00000 n 0000019816 00000 n 0000019853 00000 n 0000102839 00000 n 0000314055 00000 n 0000019898 00000 n 0000019941 00000 n 0000102892 00000 n 0000313976 00000 n 0000019984 00000 n 0000020023 00000 n 0000102949 00000 n 0000313897 00000 n 0000020073 00000 n 0000020107 00000 n 0000108559 00000 n 0000313765 00000 n 0000020158 00000 n 0000020201 00000 n 0000108612 00000 n 0000313647 00000 n 0000020260 00000 n 0000020313 00000 n 0000108669 00000 n 0000313529 00000 n 0000020361 00000 n 0000020391 00000 n 0000108726 00000 n 0000313464 00000 n 0000020443 00000 n 0000020466 00000 n 0000108783 00000 n 0000313371 00000 n 0000020515 00000 n 0000020546 00000 n 0000112045 00000 n 0000313239 00000 n 0000020595 00000 n 0000020626 00000 n 0000114471 00000 n 0000313160 00000 n 0000020683 00000 n 0000020710 00000 n 0000114528 00000 n 0000313081 00000 n 0000020763 00000 n 0000020786 00000 n 0000114585 00000 n 0000312949 00000 n 0000020839 00000 n 0000020874 00000 n 0000114642 00000 n 0000312870 00000 n 0000020935 00000 n 0000020962 00000 n 0000114699 00000 n 0000312791 00000 n 0000021019 00000 n 0000021042 00000 n 0000117581 00000 n 0000312659 00000 n 0000021096 00000 n 0000021132 00000 n 0000117638 00000 n 0000312594 00000 n 0000021190 00000 n 0000021213 00000 n 0000120181 00000 n 0000312501 00000 n 0000021265 00000 n 0000021299 00000 n 0000120234 00000 n 0000312408 00000 n 0000021349 00000 n 0000021381 00000 n 0000123087 00000 n 0000312315 00000 n 0000021429 00000 n 0000021459 00000 n 0000123144 00000 n 0000312236 00000 n 0000021527 00000 n 0000021577 00000 n 0000123201 00000 n 0000312143 00000 n 0000021627 00000 n 0000021659 00000 n 0000132037 00000 n 0000312050 00000 n 0000021727 00000 n 0000021777 00000 n 0000132094 00000 n 0000311932 00000 n 0000021845 00000 n 0000021895 00000 n 0000132151 00000 n 0000311853 00000 n 0000021958 00000 n 0000022003 00000 n 0000133806 00000 n 0000311774 00000 n 0000022058 00000 n 0000022095 00000 n 0000139021 00000 n 0000311642 00000 n 0000022143 00000 n 0000022179 00000 n 0000139074 00000 n 0000311563 00000 n 0000022224 00000 n 0000022251 00000 n 0000139131 00000 n 0000311431 00000 n 0000022301 00000 n 0000022333 00000 n 0000139188 00000 n 0000311352 00000 n 0000022378 00000 n 0000022418 00000 n 0000142382 00000 n 0000311273 00000 n 0000022467 00000 n 0000022511 00000 n 0000142439 00000 n 0000311180 00000 n 0000022567 00000 n 0000022611 00000 n 0000145891 00000 n 0000311087 00000 n 0000022666 00000 n 0000022703 00000 n 0000147488 00000 n 0000311008 00000 n 0000022755 00000 n 0000022789 00000 n 0000149328 00000 n 0000310915 00000 n 0000022840 00000 n 0000022873 00000 n 0000151570 00000 n 0000310836 00000 n 0000022921 00000 n 0000026719 00000 n 0000026855 00000 n 0000026990 00000 n 0000027127 00000 n 0000027424 00000 n 0000026565 00000 n 0000022951 00000 n 0000309091 00000 n 0000307761 00000 n 0000151982 00000 n 0000151742 00000 n 0000151623 00000 n 0000151922 00000 n 0000027543 00000 n 0000051162 00000 n 0000050943 00000 n 0000048894 00000 n 0000054063 00000 n 0000054252 00000 n 0000053931 00000 n 0000051304 00000 n 0000054199 00000 n 0000308508 00000 n 0000308809 00000 n 0000309684 00000 n 0000151862 00000 n 0000054384 00000 n 0000069633 00000 n 0000069468 00000 n 0000068268 00000 n 0000069580 00000 n 0000308080 00000 n 0000072040 00000 n 0000072193 00000 n 0000072337 00000 n 0000072473 00000 n 0000072788 00000 n 0000071884 00000 n 0000069801 00000 n 0000074857 00000 n 0000074636 00000 n 0000072881 00000 n 0000078507 00000 n 0000078752 00000 n 0000078375 00000 n 0000074963 00000 n 0000152042 00000 n 0000081170 00000 n 0000080949 00000 n 0000078882 00000 n 0000082848 00000 n 0000082683 00000 n 0000081313 00000 n 0000082795 00000 n 0000309801 00000 n 0000084588 00000 n 0000084841 00000 n 0000084456 00000 n 0000082980 00000 n 0000086945 00000 n 0000087304 00000 n 0000086813 00000 n 0000084934 00000 n 0000309412 00000 n 0000090062 00000 n 0000089784 00000 n 0000087424 00000 n 0000091562 00000 n 0000091284 00000 n 0000090182 00000 n 0000093369 00000 n 0000093091 00000 n 0000091682 00000 n 0000095554 00000 n 0000095223 00000 n 0000093489 00000 n 0000309918 00000 n 0000097126 00000 n 0000096905 00000 n 0000095674 00000 n 0000099259 00000 n 0000099395 00000 n 0000099680 00000 n 0000100036 00000 n 0000099103 00000 n 0000097246 00000 n 0000099538 00000 n 0000151802 00000 n 0000102515 00000 n 0000102651 00000 n 0000103006 00000 n 0000102375 00000 n 0000100181 00000 n 0000104194 00000 n 0000104029 00000 n 0000103163 00000 n 0000104141 00000 n 0000105521 00000 n 0000105356 00000 n 0000104276 00000 n 0000105468 00000 n 0000108247 00000 n 0000108840 00000 n 0000108107 00000 n 0000105603 00000 n 0000108378 00000 n 0000310035 00000 n 0000111698 00000 n 0000112102 00000 n 0000111558 00000 n 0000108933 00000 n 0000111846 00000 n 0000114756 00000 n 0000114307 00000 n 0000112245 00000 n 0000117695 00000 n 0000117416 00000 n 0000114849 00000 n 0000119984 00000 n 0000120291 00000 n 0000119852 00000 n 0000117788 00000 n 0000123258 00000 n 0000122922 00000 n 0000120408 00000 n 0000124413 00000 n 0000124248 00000 n 0000123375 00000 n 0000124360 00000 n 0000310152 00000 n 0000127637 00000 n 0000127783 00000 n 0000127921 00000 n 0000128255 00000 n 0000127481 00000 n 0000124495 00000 n 0000128202 00000 n 0000128062 00000 n 0000130017 00000 n 0000129852 00000 n 0000128337 00000 n 0000129964 00000 n 0000132208 00000 n 0000131872 00000 n 0000130099 00000 n 0000133863 00000 n 0000133641 00000 n 0000132313 00000 n 0000135092 00000 n 0000134927 00000 n 0000133956 00000 n 0000135039 00000 n 0000135779 00000 n 0000135614 00000 n 0000135174 00000 n 0000135726 00000 n 0000310269 00000 n 0000136149 00000 n 0000135984 00000 n 0000135861 00000 n 0000136096 00000 n 0000138832 00000 n 0000139245 00000 n 0000138700 00000 n 0000136190 00000 n 0000142044 00000 n 0000142181 00000 n 0000142496 00000 n 0000141904 00000 n 0000139350 00000 n 0000145690 00000 n 0000145948 00000 n 0000145558 00000 n 0000142601 00000 n 0000147544 00000 n 0000147323 00000 n 0000146053 00000 n 0000149134 00000 n 0000149381 00000 n 0000149002 00000 n 0000147649 00000 n 0000310386 00000 n 0000149762 00000 n 0000149597 00000 n 0000149474 00000 n 0000149709 00000 n 0000152102 00000 n 0000151405 00000 n 0000149803 00000 n 0000151682 00000 n 0000152496 00000 n 0000152331 00000 n 0000152208 00000 n 0000152443 00000 n 0000152537 00000 n 0000153006 00000 n 0000153239 00000 n 0000153282 00000 n 0000153507 00000 n 0000153943 00000 n 0000154406 00000 n 0000155003 00000 n 0000155026 00000 n 0000155168 00000 n 0000155619 00000 n 0000156263 00000 n 0000156904 00000 n 0000168495 00000 n 0000168781 00000 n 0000187305 00000 n 0000187740 00000 n 0000195295 00000 n 0000195570 00000 n 0000207987 00000 n 0000208280 00000 n 0000215252 00000 n 0000215479 00000 n 0000223280 00000 n 0000223506 00000 n 0000249353 00000 n 0000249932 00000 n 0000257458 00000 n 0000257693 00000 n 0000265207 00000 n 0000265466 00000 n 0000278794 00000 n 0000279088 00000 n 0000301284 00000 n 0000301900 00000 n 0000307479 00000 n 0000310487 00000 n 0000310603 00000 n 0000310689 00000 n 0000310759 00000 n 0000316532 00000 n 0000316656 00000 n 0000316780 00000 n 0000316905 00000 n 0000317035 00000 n 0000317163 00000 n 0000317291 00000 n 0000317414 00000 n 0000317567 00000 n 0000317787 00000 n 0000318001 00000 n 0000318231 00000 n 0000318480 00000 n 0000318749 00000 n 0000319018 00000 n 0000319212 00000 n 0000319421 00000 n 0000319636 00000 n 0000319912 00000 n 0000320078 00000 n 0000320176 00000 n 0000320289 00000 n 0000320418 00000 n 0000320504 00000 n 0000320607 00000 n 0000320645 00000 n 0000320754 00000 n trailer << /Size 615 /Root 613 0 R /Info 614 0 R /ID [ ] >> startxref 321021 %%EOF cloog-0.18.2/CLOOG_HEAD0000664000175000017500000000000712254314447011202 000000000000000.18.2 cloog-0.18.2/examples/0000775000175000017500000000000012254312305011523 500000000000000cloog-0.18.2/examples/README0000664000175000017500000000602612254312305012327 00000000000000# # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** Library use examples ** # **-------------------------------------------------------------------** # ** First version of this file: july 15th 2003 ** # **-------------------------------------------------------------------**/ # In this directory are presented various examples of how to use the CLooG library. For each case, you will need to edit the makefile file according to your system, in particular you will have to set where your CLooG library has been installed, and where are the CLooG header files. Don't forget to update your LD_LIBRARY_PATH environment variable to reach the CLooG library. If you performed the default installation of CLooG, the library is in /usr/local/lib thus you need to set LD_LIBRARY_PATH thanks to one of the following command: 'setenv LD_LIBRARY_PATH /usr/local/lib' for tcsh-like shells, or 'export LD_LIBRARY_PATH=/usr/local/lib' for bash-like shells. For any problem: . # **-------------------------------------------------------------------** # ** I. example ** # **-------------------------------------------------------------------**/ This directory includes two basic examples: - The first example program creates a simple CLooG-like loop generation program in a few lines. The input problem has to be given on standard input. Users can test it for instance by typing 'more FILE.cloog | ./example' (or example.exe under Cygwin) after compilation. - The second example shows how to build a CLooG input from isl sets, generate the scanning code AST and pretty-printing it to the standard output. Users can test it by typing './example-isl' (or example-isl.exe under Cygwin) after compilation. # **-------------------------------------------------------------------** # ** II. cloog2loopgen ** # **-------------------------------------------------------------------**/ NO MORE EXISTS ! This example creates a program converting a CLooG input file to a LoopGen input file. This can be useful to compare the two tools (I do not support LoopGen, don't ask me if you find some bugs !). The usage of the created tool is: 'cloog2loopgen input_file output_file'. # **-------------------------------------------------------------------** # ** III. cloog2Omega ** # **-------------------------------------------------------------------**/ NO MORE EXISTS ! This example creates a program converting a CLooG input file to an Omega CodeGen input file. This can be useful to compare the two tools (I do not support CodeGen, don't ask me if you find some bugs !). The usage of the created tool is: 'cloog2omega input_file output_file'. cloog-0.18.2/examples/example/0000775000175000017500000000000012254312305013156 500000000000000cloog-0.18.2/examples/example/Makefile0000664000175000017500000000163712254312305014545 00000000000000# Please enter here the locations for the CLooG include and library if they # aren't the default values (/usr/lib and /usr/include). CLOOG_INC = $(HOME)/usr/include CLOOG_LIB = $(HOME)/usr/lib CC = gcc LDLIBS= -lcloog-isl CFLAGS= -DCLOOG_INT_GMP -I $(CLOOG_INC) -L $(CLOOG_LIB) example: example.c example-isl.c @echo " /*-----------------------------------------------*" @echo " * Making examples *" @echo " *-----------------------------------------------*/" $(CC) example.c -o example $(CFLAGS) $(LDLIBS) $(CC) example-isl.c -o example-isl $(CFLAGS) $(LDLIBS) clean: @echo " /*-----------------------------------------------*" @echo " * Cleaning examples *" @echo " *-----------------------------------------------*/" -rm -f example example.exe example-isl example-isl.exe core cloog-0.18.2/examples/example/example.c0000664000175000017500000000135212254312305014676 00000000000000/* This is a very simple example of how to use the CLooGLib inside your * programs. You should compile it by typing 'make' (after edition of the * makefile), then test it for instance by typing * 'more FILE.cloog | ./example' (or example.exe under Cygwin). */ # include # include int main() { CloogState *state; CloogInput *input; CloogOptions * options ; struct clast_stmt *root; state = cloog_state_malloc(); options = cloog_options_malloc(state); input = cloog_input_read(stdin, options); root = cloog_clast_create_from_input(input, options); clast_pprint(stdout, root, 0, options); cloog_clast_free(root); cloog_options_free(options) ; cloog_state_free(state); return 0 ; } cloog-0.18.2/examples/example/example-isl.c0000664000175000017500000000515012254312305015463 00000000000000/* example-isl.c */ #include #include /* Input problem */ int nb_parameters = 1; char *parameter_name[] = {"N"}; char *iterator_name[] = {"i", "j"}; char *scattering_name[] = {"t0", "t1", "t2"}; char *str_context = "[N] -> { : N > 0}"; char *str_domain1 = "[N] -> {[i, j] : 0 <= i < N and 0 <= j < N}"; char *str_domain2 = "[N] -> {[i, j] : 0 <= i < N and 0 <= j < N}"; char *str_scattering1 = "[N] -> {[i, j] -> [0, i + j, j]}"; char *str_scattering2 = "[N] -> {[i, j] -> [1, i, -j]}"; int main() { isl_ctx *ctx; isl_set *set_context, *set1, *set2; isl_map *map1, *map2; CloogDomain *context, *domain1, *domain2; CloogScattering *scattering1, *scattering2; CloogUnionDomain *domains; CloogInput *input; CloogState *state; CloogOptions *options; struct clast_stmt *root; /* Build isl structures for context, sets and mapping */ ctx = isl_ctx_alloc(); set_context = isl_set_read_from_str(ctx, str_context); set1 = isl_set_read_from_str(ctx, str_domain1); set2 = isl_set_read_from_str(ctx, str_domain2); map1 = isl_map_read_from_str(ctx, str_scattering1); map2 = isl_map_read_from_str(ctx, str_scattering2); /* Translate them to CLooG context, domains and scattering */ context = cloog_domain_from_isl_set(set_context); domain1 = cloog_domain_from_isl_set(set1); domain2 = cloog_domain_from_isl_set(set2); scattering1 = cloog_scattering_from_isl_map(map1); scattering2 = cloog_scattering_from_isl_map(map2); /* Prepare the list of domains to scan */ domains = cloog_union_domain_alloc(nb_parameters); cloog_union_domain_add_domain(domains, "S1", domain1, scattering1, NULL); cloog_union_domain_add_domain(domains, "S2", domain2, scattering2, NULL); cloog_union_domain_set_name(domains, CLOOG_PARAM, 0, parameter_name[0]); cloog_union_domain_set_name(domains, CLOOG_ITER, 0, iterator_name[0]); cloog_union_domain_set_name(domains, CLOOG_ITER, 1, iterator_name[1]); cloog_union_domain_set_name(domains, CLOOG_SCAT, 0, scattering_name[0]); cloog_union_domain_set_name(domains, CLOOG_SCAT, 1, scattering_name[1]); cloog_union_domain_set_name(domains, CLOOG_SCAT, 2, scattering_name[2]); /* Build the input, generate the AST of the scanning code and print it */ input = cloog_input_alloc(context, domains); state = cloog_isl_state_malloc(ctx); options = cloog_options_malloc(state); root = cloog_clast_create_from_input(input, options); clast_pprint(stdout, root, 0, options); /* Recycle allocated memory */ cloog_clast_free(root); cloog_options_free(options); cloog_state_free(state); isl_ctx_free(ctx); } cloog-0.18.2/m4/0000775000175000017500000000000012254314446010235 500000000000000cloog-0.18.2/m4/ltversion.m40000644000175000017500000000131312254313265012436 00000000000000# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004, 2011-2013 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # @configure_input@ # serial 4038 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.4.2.418]) m4_define([LT_PACKAGE_REVISION], [2.4.2.418]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.4.2.418' macro_revision='2.4.2.418' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) cloog-0.18.2/m4/ax_cflags_warn_all.m40000664000175000017500000001420412254312305014216 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_cflags_warn_all.html # =========================================================================== # # SYNOPSIS # # AX_CFLAGS_WARN_ALL [(shellvar [,default, [A/NA]])] # # DESCRIPTION # # Try to find a compiler option that enables most reasonable warnings. # # For the GNU CC compiler it will be -Wall (and -ansi -pedantic) The # result is added to the shellvar being CFLAGS by default. # # Currently this macro knows about GCC, Solaris C compiler, Digital Unix C # compiler, C for AIX Compiler, HP-UX C compiler, IRIX C compiler, NEC # SX-5 (Super-UX 10) C compiler, and Cray J90 (Unicos 10.0.0.8) C # compiler. # # - $1 shell-variable-to-add-to : CFLAGS # - $2 add-value-if-not-found : nothing # - $3 action-if-found : add value to shellvariable # - $4 action-if-not-found : nothing # # LICENSE # # Copyright (c) 2008 Guido U. Draheim # # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation; either version 2 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_CFLAGS_WARN_ALL],[dnl AS_VAR_PUSHDEF([FLAGS],[CFLAGS])dnl AS_VAR_PUSHDEF([VAR],[ac_cv_cflags_warn_all])dnl AC_CACHE_CHECK([m4_ifval($1,$1,FLAGS) for maximum warnings], VAR,[VAR="no, unknown" AC_LANG_SAVE AC_LANG_C ac_save_[]FLAGS="$[]FLAGS" for ac_arg dnl in "-pedantic % -Wall" dnl GCC "-xstrconst % -v" dnl Solaris C "-std1 % -verbose -w0 -warnprotos" dnl Digital Unix "-qlanglvl=ansi % -qsrcmsg -qinfo=all:noppt:noppc:noobs:nocnd" dnl AIX "-ansi -ansiE % -fullwarn" dnl IRIX "+ESlit % +w1" dnl HP-UX C "-Xc % -pvctl[,]fullmsg" dnl NEC SX-5 (Super-UX 10) "-h conform % -h msglevel 2" dnl Cray C (Unicos) # do FLAGS="$ac_save_[]FLAGS "`echo $ac_arg | sed -e 's,%%.*,,' -e 's,%,,'` AC_TRY_COMPILE([],[return 0;], [VAR=`echo $ac_arg | sed -e 's,.*% *,,'` ; break]) done FLAGS="$ac_save_[]FLAGS" AC_LANG_RESTORE ]) case ".$VAR" in .ok|.ok,*) m4_ifvaln($3,$3) ;; .|.no|.no,*) m4_ifvaln($4,$4,[m4_ifval($2,[ AC_RUN_LOG([: m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $2"]) m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $2"])]) ;; *) m4_ifvaln($3,$3,[ if echo " $[]m4_ifval($1,$1,FLAGS) " | grep " $VAR " 2>&1 >/dev/null then AC_RUN_LOG([: m4_ifval($1,$1,FLAGS) does contain $VAR]) else AC_RUN_LOG([: m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $VAR"]) m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $VAR" fi ]) ;; esac AS_VAR_POPDEF([VAR])dnl AS_VAR_POPDEF([FLAGS])dnl ]) dnl the only difference - the LANG selection... and the default FLAGS AC_DEFUN([AX_CXXFLAGS_WARN_ALL],[dnl AS_VAR_PUSHDEF([FLAGS],[CXXFLAGS])dnl AS_VAR_PUSHDEF([VAR],[ax_cv_cxxflags_warn_all])dnl AC_CACHE_CHECK([m4_ifval($1,$1,FLAGS) for maximum warnings], VAR,[VAR="no, unknown" AC_LANG_SAVE AC_LANG_CPLUSPLUS ac_save_[]FLAGS="$[]FLAGS" for ac_arg dnl in "-pedantic % -Wall" dnl GCC "-xstrconst % -v" dnl Solaris C "-std1 % -verbose -w0 -warnprotos" dnl Digital Unix "-qlanglvl=ansi % -qsrcmsg -qinfo=all:noppt:noppc:noobs:nocnd" dnl AIX "-ansi -ansiE % -fullwarn" dnl IRIX "+ESlit % +w1" dnl HP-UX C "-Xc % -pvctl[,]fullmsg" dnl NEC SX-5 (Super-UX 10) "-h conform % -h msglevel 2" dnl Cray C (Unicos) # do FLAGS="$ac_save_[]FLAGS "`echo $ac_arg | sed -e 's,%%.*,,' -e 's,%,,'` AC_TRY_COMPILE([],[return 0;], [VAR=`echo $ac_arg | sed -e 's,.*% *,,'` ; break]) done FLAGS="$ac_save_[]FLAGS" AC_LANG_RESTORE ]) case ".$VAR" in .ok|.ok,*) m4_ifvaln($3,$3) ;; .|.no|.no,*) m4_ifvaln($4,$4,[m4_ifval($2,[ AC_RUN_LOG([: m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $2"]) m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $2"])]) ;; *) m4_ifvaln($3,$3,[ if echo " $[]m4_ifval($1,$1,FLAGS) " | grep " $VAR " 2>&1 >/dev/null then AC_RUN_LOG([: m4_ifval($1,$1,FLAGS) does contain $VAR]) else AC_RUN_LOG([: m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $VAR"]) m4_ifval($1,$1,FLAGS)="$m4_ifval($1,$1,FLAGS) $VAR" fi ]) ;; esac AS_VAR_POPDEF([VAR])dnl AS_VAR_POPDEF([FLAGS])dnl ]) dnl implementation tactics: dnl the for-argument contains a list of options. The first part of dnl these does only exist to detect the compiler - usually it is dnl a global option to enable -ansi or -extrawarnings. All other dnl compilers will fail about it. That was needed since a lot of dnl compilers will give false positives for some option-syntax dnl like -Woption or -Xoption as they think of it is a pass-through dnl to later compile stages or something. The "%" is used as a dnl delimimiter. A non-option comment can be given after "%%" marks dnl which will be shown but not added to the respective C/CXXFLAGS. cloog-0.18.2/m4/ax_compiler_vendor.m40000664000175000017500000000601012254312305014263 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_compiler_vendor.html # =========================================================================== # # SYNOPSIS # # AX_COMPILER_VENDOR # # DESCRIPTION # # Determine the vendor of the C/C++ compiler, e.g., gnu, intel, ibm, sun, # hp, borland, comeau, dec, cray, kai, lcc, metrowerks, sgi, microsoft, # watcom, etc. The vendor is returned in the cache variable # $ax_cv_c_compiler_vendor for C and $ax_cv_cxx_compiler_vendor for C++. # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_COMPILER_VENDOR], [ AC_CACHE_CHECK([for _AC_LANG compiler vendor], ax_cv_[]_AC_LANG_ABBREV[]_compiler_vendor, [ax_cv_[]_AC_LANG_ABBREV[]_compiler_vendor=unknown # note: don't check for gcc first since some other compilers define __GNUC__ for ventest in intel:__ICC,__ECC,__INTEL_COMPILER ibm:__xlc__,__xlC__,__IBMC__,__IBMCPP__ pathscale:__PATHCC__,__PATHSCALE__ gnu:__GNUC__ sun:__SUNPRO_C,__SUNPRO_CC hp:__HP_cc,__HP_aCC dec:__DECC,__DECCXX,__DECC_VER,__DECCXX_VER borland:__BORLANDC__,__TURBOC__ comeau:__COMO__ cray:_CRAYC kai:__KCC lcc:__LCC__ metrowerks:__MWERKS__ sgi:__sgi,sgi microsoft:_MSC_VER watcom:__WATCOMC__ portland:__PGI; do vencpp="defined("`echo $ventest | cut -d: -f2 | sed 's/,/) || defined(/g'`")" AC_COMPILE_IFELSE([AC_LANG_PROGRAM(,[ #if !($vencpp) thisisanerror; #endif ])], [ax_cv_]_AC_LANG_ABBREV[_compiler_vendor=`echo $ventest | cut -d: -f1`; break]) done ]) ]) cloog-0.18.2/m4/libtool.m40000644000175000017500000105432112254313265012065 00000000000000# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # Copyright (C) 1996-2001, 2003-2013 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. m4_define([_LT_COPYING], [dnl # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; either version 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. ]) # serial 58 LT_INIT # LT_PREREQ(VERSION) # ------------------ # Complain and exit if this libtool version is less that VERSION. m4_defun([LT_PREREQ], [m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1, [m4_default([$3], [m4_fatal([Libtool version $1 or higher is required], 63)])], [$2])]) # _LT_CHECK_BUILDDIR # ------------------ # Complain if the absolute build directory name contains unusual characters m4_defun([_LT_CHECK_BUILDDIR], [case `pwd` in *\ * | *\ *) AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;; esac ]) # LT_INIT([OPTIONS]) # ------------------ AC_DEFUN([LT_INIT], [AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl AC_BEFORE([$0], [LT_LANG])dnl AC_BEFORE([$0], [LT_OUTPUT])dnl AC_BEFORE([$0], [LTDL_INIT])dnl m4_require([_LT_CHECK_BUILDDIR])dnl dnl Autoconf doesn't catch unexpanded LT_ macros by default: m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4 dnl unless we require an AC_DEFUNed macro: AC_REQUIRE([LTOPTIONS_VERSION])dnl AC_REQUIRE([LTSUGAR_VERSION])dnl AC_REQUIRE([LTVERSION_VERSION])dnl AC_REQUIRE([LTOBSOLETE_VERSION])dnl m4_require([_LT_PROG_LTMAIN])dnl _LT_SHELL_INIT([SHELL=${CONFIG_SHELL-/bin/sh}]) dnl Parse OPTIONS _LT_SET_OPTIONS([$0], [$1]) # This can be used to rebuild libtool when needed LIBTOOL_DEPS=$ltmain # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' AC_SUBST(LIBTOOL)dnl _LT_SETUP # Only expand once: m4_define([LT_INIT]) ])# LT_INIT # Old names: AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT]) AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PROG_LIBTOOL], []) dnl AC_DEFUN([AM_PROG_LIBTOOL], []) # _LT_CC_BASENAME(CC) # ------------------- # Calculate cc_basename. Skip known compiler wrappers and cross-prefix. m4_defun([_LT_CC_BASENAME], [for cc_temp in $1""; do case $cc_temp in compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;; distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` ]) # _LT_FILEUTILS_DEFAULTS # ---------------------- # It is okay to use these file commands and assume they have been set # sensibly after 'm4_require([_LT_FILEUTILS_DEFAULTS])'. m4_defun([_LT_FILEUTILS_DEFAULTS], [: ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} ])# _LT_FILEUTILS_DEFAULTS # _LT_SETUP # --------- m4_defun([_LT_SETUP], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_REQUIRE([_LT_PREPARE_SED_QUOTE_VARS])dnl AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl _LT_DECL([], [PATH_SEPARATOR], [1], [The PATH separator for the build system])dnl dnl _LT_DECL([], [host_alias], [0], [The host system])dnl _LT_DECL([], [host], [0])dnl _LT_DECL([], [host_os], [0])dnl dnl _LT_DECL([], [build_alias], [0], [The build system])dnl _LT_DECL([], [build], [0])dnl _LT_DECL([], [build_os], [0])dnl dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl dnl AC_REQUIRE([AC_PROG_LN_S])dnl test -z "$LN_S" && LN_S="ln -s" _LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl dnl AC_REQUIRE([LT_CMD_MAX_LEN])dnl _LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl _LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl m4_require([_LT_PATH_CONVERSION_FUNCTIONS])dnl m4_require([_LT_CMD_RELOAD])dnl m4_require([_LT_CHECK_MAGIC_METHOD])dnl m4_require([_LT_CHECK_SHAREDLIB_FROM_LINKLIB])dnl m4_require([_LT_CMD_OLD_ARCHIVE])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_WITH_SYSROOT])dnl _LT_CONFIG_LIBTOOL_INIT([ # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi ]) if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi _LT_CHECK_OBJDIR m4_require([_LT_TAG_COMPILER])dnl case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a '.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld=$lt_cv_prog_gnu_ld old_CC=$CC old_CFLAGS=$CFLAGS # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o _LT_CC_BASENAME([$compiler]) # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then _LT_PATH_MAGIC fi ;; esac # Use C for the default configuration in the libtool script LT_SUPPORTED_TAG([CC]) _LT_LANG_C_CONFIG _LT_LANG_DEFAULT_CONFIG _LT_CONFIG_COMMANDS ])# _LT_SETUP # _LT_PREPARE_SED_QUOTE_VARS # -------------------------- # Define a few sed substitution that help us do robust quoting. m4_defun([_LT_PREPARE_SED_QUOTE_VARS], [# Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\([["`$\\]]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([["`\\]]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ]) # _LT_PROG_LTMAIN # --------------- # Note that this code is called both from 'configure', and 'config.status' # now that we use AC_CONFIG_COMMANDS to generate libtool. Notably, # 'config.status' has no value for ac_aux_dir unless we are using Automake, # so we pass a copy along to make sure it has a sensible value anyway. m4_defun([_LT_PROG_LTMAIN], [m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl _LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir']) ltmain=$ac_aux_dir/ltmain.sh ])# _LT_PROG_LTMAIN ## ------------------------------------- ## ## Accumulate code for creating libtool. ## ## ------------------------------------- ## # So that we can recreate a full libtool script including additional # tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS # in macros and then make a single call at the end using the 'libtool' # label. # _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS]) # ---------------------------------------- # Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL_INIT], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_INIT], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_INIT]) # _LT_CONFIG_LIBTOOL([COMMANDS]) # ------------------------------ # Register COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS]) # _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS]) # ----------------------------------------------------- m4_defun([_LT_CONFIG_SAVE_COMMANDS], [_LT_CONFIG_LIBTOOL([$1]) _LT_CONFIG_LIBTOOL_INIT([$2]) ]) # _LT_FORMAT_COMMENT([COMMENT]) # ----------------------------- # Add leading comment marks to the start of each line, and a trailing # full-stop to the whole comment if one is not present already. m4_define([_LT_FORMAT_COMMENT], [m4_ifval([$1], [ m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])], [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.]) )]) ## ------------------------ ## ## FIXME: Eliminate VARNAME ## ## ------------------------ ## # _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?]) # ------------------------------------------------------------------- # CONFIGNAME is the name given to the value in the libtool script. # VARNAME is the (base) name used in the configure script. # VALUE may be 0, 1 or 2 for a computed quote escaped value based on # VARNAME. Any other value will be used directly. m4_define([_LT_DECL], [lt_if_append_uniq([lt_decl_varnames], [$2], [, ], [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name], [m4_ifval([$1], [$1], [$2])]) lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3]) m4_ifval([$4], [lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])]) lt_dict_add_subkey([lt_decl_dict], [$2], [tagged?], [m4_ifval([$5], [yes], [no])])]) ]) # _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION]) # -------------------------------------------------------- m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])]) # lt_decl_tag_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_tag_varnames], [_lt_decl_filter([tagged?], [yes], $@)]) # _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..]) # --------------------------------------------------------- m4_define([_lt_decl_filter], [m4_case([$#], [0], [m4_fatal([$0: too few arguments: $#])], [1], [m4_fatal([$0: too few arguments: $#: $1])], [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)], [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)], [lt_dict_filter([lt_decl_dict], $@)])[]dnl ]) # lt_decl_quote_varnames([SEPARATOR], [VARNAME1...]) # -------------------------------------------------- m4_define([lt_decl_quote_varnames], [_lt_decl_filter([value], [1], $@)]) # lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_dquote_varnames], [_lt_decl_filter([value], [2], $@)]) # lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_varnames_tagged], [m4_assert([$# <= 2])dnl _$0(m4_quote(m4_default([$1], [[, ]])), m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]), m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))]) m4_define([_lt_decl_varnames_tagged], [m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])]) # lt_decl_all_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_all_varnames], [_$0(m4_quote(m4_default([$1], [[, ]])), m4_if([$2], [], m4_quote(lt_decl_varnames), m4_quote(m4_shift($@))))[]dnl ]) m4_define([_lt_decl_all_varnames], [lt_join($@, lt_decl_varnames_tagged([$1], lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl ]) # _LT_CONFIG_STATUS_DECLARE([VARNAME]) # ------------------------------------ # Quote a variable value, and forward it to 'config.status' so that its # declaration there will have the same value as in 'configure'. VARNAME # must have a single quote delimited value for this to work. m4_define([_LT_CONFIG_STATUS_DECLARE], [$1='`$ECHO "$][$1" | $SED "$delay_single_quote_subst"`']) # _LT_CONFIG_STATUS_DECLARATIONS # ------------------------------ # We delimit libtool config variables with single quotes, so when # we write them to config.status, we have to be sure to quote all # embedded single quotes properly. In configure, this macro expands # each variable declared with _LT_DECL (and _LT_TAGDECL) into: # # ='`$ECHO "$" | $SED "$delay_single_quote_subst"`' m4_defun([_LT_CONFIG_STATUS_DECLARATIONS], [m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames), [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAGS # ---------------- # Output comment and list of tags supported by the script m4_defun([_LT_LIBTOOL_TAGS], [_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl available_tags='_LT_TAGS'dnl ]) # _LT_LIBTOOL_DECLARE(VARNAME, [TAG]) # ----------------------------------- # Extract the dictionary values for VARNAME (optionally with TAG) and # expand to a commented shell variable setting: # # # Some comment about what VAR is for. # visible_name=$lt_internal_name m4_define([_LT_LIBTOOL_DECLARE], [_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [description])))[]dnl m4_pushdef([_libtool_name], m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])), [0], [_libtool_name=[$]$1], [1], [_libtool_name=$lt_[]$1], [2], [_libtool_name=$lt_[]$1], [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl ]) # _LT_LIBTOOL_CONFIG_VARS # ----------------------- # Produce commented declarations of non-tagged libtool config variables # suitable for insertion in the LIBTOOL CONFIG section of the 'libtool' # script. Tagged libtool config variables (even for the LIBTOOL CONFIG # section) are produced by _LT_LIBTOOL_TAG_VARS. m4_defun([_LT_LIBTOOL_CONFIG_VARS], [m4_foreach([_lt_var], m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAG_VARS(TAG) # ------------------------- m4_define([_LT_LIBTOOL_TAG_VARS], [m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])]) # _LT_TAGVAR(VARNAME, [TAGNAME]) # ------------------------------ m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])]) # _LT_CONFIG_COMMANDS # ------------------- # Send accumulated output to $CONFIG_STATUS. Thanks to the lists of # variables for single and double quote escaping we saved from calls # to _LT_DECL, we can put quote escaped variables declarations # into 'config.status', and then the shell code to quote escape them in # for loops in 'config.status'. Finally, any additional code accumulated # from calls to _LT_CONFIG_LIBTOOL_INIT is expanded. m4_defun([_LT_CONFIG_COMMANDS], [AC_PROVIDE_IFELSE([LT_OUTPUT], dnl If the libtool generation code has been placed in $CONFIG_LT, dnl instead of duplicating it all over again into config.status, dnl then we will have config.status run $CONFIG_LT later, so it dnl needs to know what name is stored there: [AC_CONFIG_COMMANDS([libtool], [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])], dnl If the libtool generation code is destined for config.status, dnl expand the accumulated commands and init code now: [AC_CONFIG_COMMANDS([libtool], [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])]) ])#_LT_CONFIG_COMMANDS # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT], [ # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' _LT_CONFIG_STATUS_DECLARATIONS LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$[]1 _LTECHO_EOF' } # Quote evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_quote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_dquote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done _LT_OUTPUT_LIBTOOL_INIT ]) # _LT_GENERATED_FILE_INIT(FILE, [COMMENT]) # ------------------------------------ # Generate a child script FILE with all initialization necessary to # reuse the environment learned by the parent script, and make the # file executable. If COMMENT is supplied, it is inserted after the # '#!' sequence but before initialization text begins. After this # macro, additional text can be appended to FILE to form the body of # the child script. The macro ends with non-zero status if the # file could not be fully written (such as if the disk is full). m4_ifdef([AS_INIT_GENERATED], [m4_defun([_LT_GENERATED_FILE_INIT],[AS_INIT_GENERATED($@)])], [m4_defun([_LT_GENERATED_FILE_INIT], [m4_require([AS_PREPARE])]dnl [m4_pushdef([AS_MESSAGE_LOG_FD])]dnl [lt_write_fail=0 cat >$1 <<_ASEOF || lt_write_fail=1 #! $SHELL # Generated by $as_me. $2 SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$1 <<\_ASEOF || lt_write_fail=1 AS_SHELL_SANITIZE _AS_PREPARE exec AS_MESSAGE_FD>&1 _ASEOF test 0 = "$lt_write_fail" && chmod +x $1[]dnl m4_popdef([AS_MESSAGE_LOG_FD])])])# _LT_GENERATED_FILE_INIT # LT_OUTPUT # --------- # This macro allows early generation of the libtool script (before # AC_OUTPUT is called), incase it is used in configure for compilation # tests. AC_DEFUN([LT_OUTPUT], [: ${CONFIG_LT=./config.lt} AC_MSG_NOTICE([creating $CONFIG_LT]) _LT_GENERATED_FILE_INIT(["$CONFIG_LT"], [# Run this file to recreate a libtool stub with the current configuration.]) cat >>"$CONFIG_LT" <<\_LTEOF lt_cl_silent=false exec AS_MESSAGE_LOG_FD>>config.log { echo AS_BOX([Running $as_me.]) } >&AS_MESSAGE_LOG_FD lt_cl_help="\ '$as_me' creates a local libtool stub from the current configuration, for use in further configure time tests before the real libtool is generated. Usage: $[0] [[OPTIONS]] -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files Report bugs to ." lt_cl_version="\ m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION]) configured by $[0], generated by m4_PACKAGE_STRING. Copyright (C) 2011 Free Software Foundation, Inc. This config.lt script is free software; the Free Software Foundation gives unlimited permision to copy, distribute and modify it." while test 0 != $[#] do case $[1] in --version | --v* | -V ) echo "$lt_cl_version"; exit 0 ;; --help | --h* | -h ) echo "$lt_cl_help"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --quiet | --q* | --silent | --s* | -q ) lt_cl_silent=: ;; -*) AC_MSG_ERROR([unrecognized option: $[1] Try '$[0] --help' for more information.]) ;; *) AC_MSG_ERROR([unrecognized argument: $[1] Try '$[0] --help' for more information.]) ;; esac shift done if $lt_cl_silent; then exec AS_MESSAGE_FD>/dev/null fi _LTEOF cat >>"$CONFIG_LT" <<_LTEOF _LT_OUTPUT_LIBTOOL_COMMANDS_INIT _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AC_MSG_NOTICE([creating $ofile]) _LT_OUTPUT_LIBTOOL_COMMANDS AS_EXIT(0) _LTEOF chmod +x "$CONFIG_LT" # configure is writing to config.log, but config.lt does its own redirection, # appending to config.log, which fails on DOS, as config.log is still kept # open by configure. Here we exec the FD to /dev/null, effectively closing # config.log, so it can be properly (re)opened and appended to by config.lt. lt_cl_success=: test yes = "$silent" && lt_config_lt_args="$lt_config_lt_args --quiet" exec AS_MESSAGE_LOG_FD>/dev/null $SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false exec AS_MESSAGE_LOG_FD>>config.log $lt_cl_success || AS_EXIT(1) ])# LT_OUTPUT # _LT_CONFIG(TAG) # --------------- # If TAG is the built-in tag, create an initial libtool script with a # default configuration from the untagged config vars. Otherwise add code # to config.status for appending the configuration named by TAG from the # matching tagged config vars. m4_defun([_LT_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_CONFIG_SAVE_COMMANDS([ m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl m4_if(_LT_TAG, [C], [ # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi cfgfile=${ofile}T trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # _LT_COPYING _LT_LIBTOOL_TAGS # ### BEGIN LIBTOOL CONFIG _LT_LIBTOOL_CONFIG_VARS _LT_LIBTOOL_TAG_VARS # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac _LT_PROG_LTMAIN # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ], [cat <<_LT_EOF >> "$ofile" dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded dnl in a comment (ie after a #). # ### BEGIN LIBTOOL TAG CONFIG: $1 _LT_LIBTOOL_TAG_VARS(_LT_TAG) # ### END LIBTOOL TAG CONFIG: $1 _LT_EOF ])dnl /m4_if ], [m4_if([$1], [], [ PACKAGE='$PACKAGE' VERSION='$VERSION' RM='$RM' ofile='$ofile'], []) ])dnl /_LT_CONFIG_SAVE_COMMANDS ])# _LT_CONFIG # LT_SUPPORTED_TAG(TAG) # --------------------- # Trace this macro to discover what tags are supported by the libtool # --tag option, using: # autoconf --trace 'LT_SUPPORTED_TAG:$1' AC_DEFUN([LT_SUPPORTED_TAG], []) # C support is built-in for now m4_define([_LT_LANG_C_enabled], []) m4_define([_LT_TAGS], []) # LT_LANG(LANG) # ------------- # Enable libtool support for the given language if not already enabled. AC_DEFUN([LT_LANG], [AC_BEFORE([$0], [LT_OUTPUT])dnl m4_case([$1], [C], [_LT_LANG(C)], [C++], [_LT_LANG(CXX)], [Go], [_LT_LANG(GO)], [Java], [_LT_LANG(GCJ)], [Fortran 77], [_LT_LANG(F77)], [Fortran], [_LT_LANG(FC)], [Windows Resource], [_LT_LANG(RC)], [m4_ifdef([_LT_LANG_]$1[_CONFIG], [_LT_LANG($1)], [m4_fatal([$0: unsupported language: "$1"])])])dnl ])# LT_LANG # _LT_LANG(LANGNAME) # ------------------ m4_defun([_LT_LANG], [m4_ifdef([_LT_LANG_]$1[_enabled], [], [LT_SUPPORTED_TAG([$1])dnl m4_append([_LT_TAGS], [$1 ])dnl m4_define([_LT_LANG_]$1[_enabled], [])dnl _LT_LANG_$1_CONFIG($1)])dnl ])# _LT_LANG m4_ifndef([AC_PROG_GO], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_GO. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_GO], [AC_LANG_PUSH(Go)dnl AC_ARG_VAR([GOC], [Go compiler command])dnl AC_ARG_VAR([GOFLAGS], [Go compiler flags])dnl _AC_ARG_VAR_LDFLAGS()dnl AC_CHECK_TOOL(GOC, gccgo) if test -z "$GOC"; then if test -n "$ac_tool_prefix"; then AC_CHECK_PROG(GOC, [${ac_tool_prefix}gccgo], [${ac_tool_prefix}gccgo]) fi fi if test -z "$GOC"; then AC_CHECK_PROG(GOC, gccgo, gccgo, false) fi ])#m4_defun ])#m4_ifndef # _LT_LANG_DEFAULT_CONFIG # ----------------------- m4_defun([_LT_LANG_DEFAULT_CONFIG], [AC_PROVIDE_IFELSE([AC_PROG_CXX], [LT_LANG(CXX)], [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])]) AC_PROVIDE_IFELSE([AC_PROG_F77], [LT_LANG(F77)], [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])]) AC_PROVIDE_IFELSE([AC_PROG_FC], [LT_LANG(FC)], [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])]) dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal dnl pulling things in needlessly. AC_PROVIDE_IFELSE([AC_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([A][M_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([LT_PROG_GCJ], [LT_LANG(GCJ)], [m4_ifdef([AC_PROG_GCJ], [m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([A][M_PROG_GCJ], [m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([LT_PROG_GCJ], [m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])]) AC_PROVIDE_IFELSE([AC_PROG_GO], [LT_LANG(GO)], [m4_define([AC_PROG_GO], defn([AC_PROG_GO])[LT_LANG(GO)])]) AC_PROVIDE_IFELSE([LT_PROG_RC], [LT_LANG(RC)], [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])]) ])# _LT_LANG_DEFAULT_CONFIG # Obsolete macros: AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)]) AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)]) AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)]) AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)]) AU_DEFUN([AC_LIBTOOL_RC], [LT_LANG(Windows Resource)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_CXX], []) dnl AC_DEFUN([AC_LIBTOOL_F77], []) dnl AC_DEFUN([AC_LIBTOOL_FC], []) dnl AC_DEFUN([AC_LIBTOOL_GCJ], []) dnl AC_DEFUN([AC_LIBTOOL_RC], []) # _LT_TAG_COMPILER # ---------------- m4_defun([_LT_TAG_COMPILER], [AC_REQUIRE([AC_PROG_CC])dnl _LT_DECL([LTCC], [CC], [1], [A C compiler])dnl _LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl _LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl _LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC ])# _LT_TAG_COMPILER # _LT_COMPILER_BOILERPLATE # ------------------------ # Check for compiler boilerplate output or warnings with # the simple compiler test code. m4_defun([_LT_COMPILER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ])# _LT_COMPILER_BOILERPLATE # _LT_LINKER_BOILERPLATE # ---------------------- # Check for linker boilerplate output or warnings with # the simple link test code. m4_defun([_LT_LINKER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ])# _LT_LINKER_BOILERPLATE # _LT_REQUIRED_DARWIN_CHECKS # ------------------------- m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[ case $host_os in rhapsody* | darwin*) AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:]) AC_CHECK_TOOL([NMEDIT], [nmedit], [:]) AC_CHECK_TOOL([LIPO], [lipo], [:]) AC_CHECK_TOOL([OTOOL], [otool], [:]) AC_CHECK_TOOL([OTOOL64], [otool64], [:]) _LT_DECL([], [DSYMUTIL], [1], [Tool to manipulate archived DWARF debug symbol files on Mac OS X]) _LT_DECL([], [NMEDIT], [1], [Tool to change global to local symbols on Mac OS X]) _LT_DECL([], [LIPO], [1], [Tool to manipulate fat objects and archives on Mac OS X]) _LT_DECL([], [OTOOL], [1], [ldd/readelf like tool for Mach-O binaries on Mac OS X]) _LT_DECL([], [OTOOL64], [1], [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4]) AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod], [lt_cv_apple_cc_single_mod=no if test -z "$LT_MULTI_MODULE"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test 0 = "$_lt_result"; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -rf libconftest.dylib* rm -f conftest.* fi]) AC_CACHE_CHECK([for -exported_symbols_list linker flag], [lt_cv_ld_exported_symbols_list], [lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [lt_cv_ld_exported_symbols_list=yes], [lt_cv_ld_exported_symbols_list=no]) LDFLAGS=$save_LDFLAGS ]) AC_CACHE_CHECK([for -force_load linker flag],[lt_cv_ld_force_load], [lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&AS_MESSAGE_LOG_FD echo "$AR cru libconftest.a conftest.o" >&AS_MESSAGE_LOG_FD $AR cru libconftest.a conftest.o 2>&AS_MESSAGE_LOG_FD echo "$RANLIB libconftest.a" >&AS_MESSAGE_LOG_FD $RANLIB libconftest.a 2>&AS_MESSAGE_LOG_FD cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD elif test -f conftest && test 0 = "$_lt_result" && $GREP forced_load conftest >/dev/null 2>&1; then lt_cv_ld_force_load=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM ]) case $host_os in rhapsody* | darwin1.[[012]]) _lt_dar_allow_undefined='$wl-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[[91]]*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; 10.[[012]]*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test yes = "$lt_cv_apple_cc_single_mod"; then _lt_dar_single_mod='$single_module' fi if test yes = "$lt_cv_ld_exported_symbols_list"; then _lt_dar_export_syms=' $wl-exported_symbols_list,$output_objdir/$libname-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/$libname-symbols.expsym $lib' fi if test : != "$DSYMUTIL" && test no = "$lt_cv_ld_force_load"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ]) # _LT_DARWIN_LINKER_FEATURES([TAG]) # --------------------------------- # Checks for linker and compiler features on darwin m4_defun([_LT_DARWIN_LINKER_FEATURES], [ m4_require([_LT_REQUIRED_DARWIN_CHECKS]) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported if test yes = "$lt_cv_ld_force_load"; then _LT_TAGVAR(whole_archive_flag_spec, $1)='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience $wl-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' m4_case([$1], [F77], [_LT_TAGVAR(compiler_needs_object, $1)=yes], [FC], [_LT_TAGVAR(compiler_needs_object, $1)=yes]) else _LT_TAGVAR(whole_archive_flag_spec, $1)='' fi _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=$_lt_dar_allow_undefined case $cc_basename in ifort*|nagfor*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test yes = "$_lt_dar_can_shared"; then output_verbose_link_cmd=func_echo_all _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dsymutil" _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dsymutil" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil" _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dar_export_syms$_lt_dsymutil" m4_if([$1], [CXX], [ if test yes != "$lt_cv_apple_cc_single_mod"; then _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \$lib-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$lib-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring$_lt_dsymutil" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \$lib-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$lib-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring$_lt_dar_export_syms$_lt_dsymutil" fi ],[]) else _LT_TAGVAR(ld_shlibs, $1)=no fi ]) # _LT_SYS_MODULE_PATH_AIX([TAGNAME]) # ---------------------------------- # Links a minimal program and checks the executable # for the system default hardcoded library path. In most cases, # this is /usr/lib:/lib, but when the MPI compilers are used # the location of the communication and MPI libs are included too. # If we don't find anything, use the default library path according # to the aix ld manual. # Store the results from the different compilers for each TAGNAME. # Allow to override them for all tags through lt_cv_aix_libpath. m4_defun([_LT_SYS_MODULE_PATH_AIX], [m4_require([_LT_DECL_SED])dnl if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else AC_CACHE_VAL([_LT_TAGVAR([lt_cv_aix_libpath_], [$1])], [AC_LINK_IFELSE([AC_LANG_PROGRAM],[ lt_aix_libpath_sed='[ /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }]' _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi],[]) if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=/usr/lib:/lib fi ]) aix_libpath=$_LT_TAGVAR([lt_cv_aix_libpath_], [$1]) fi ])# _LT_SYS_MODULE_PATH_AIX # _LT_SHELL_INIT(ARG) # ------------------- m4_define([_LT_SHELL_INIT], [m4_divert_text([M4SH-INIT], [$1 ])])# _LT_SHELL_INIT # _LT_PROG_ECHO_BACKSLASH # ----------------------- # Find how we can fake an echo command that does not interpret backslash. # In particular, with Autoconf 2.60 or later we add some code to the start # of the generated configure script that will find a shell with a builtin # printf (that we can use as an echo command). m4_defun([_LT_PROG_ECHO_BACKSLASH], [ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO AC_MSG_CHECKING([how to print strings]) # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $[]1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } case $ECHO in printf*) AC_MSG_RESULT([printf]) ;; print*) AC_MSG_RESULT([print -r]) ;; *) AC_MSG_RESULT([cat]) ;; esac m4_ifdef([_AS_DETECT_SUGGESTED], [_AS_DETECT_SUGGESTED([ test -n "${ZSH_VERSION+set}${BASH_VERSION+set}" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test "X`printf %s $ECHO`" = "X$ECHO" \ || test "X`print -r -- $ECHO`" = "X$ECHO" )])]) _LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts]) _LT_DECL([], [ECHO], [1], [An echo program that protects backslashes]) ])# _LT_PROG_ECHO_BACKSLASH # _LT_WITH_SYSROOT # ---------------- AC_DEFUN([_LT_WITH_SYSROOT], [AC_MSG_CHECKING([for sysroot]) AC_ARG_WITH([sysroot], [AS_HELP_STRING([--with-sysroot@<:@=DIR@:>@], [Search for dependent libraries within DIR (or the compiler's sysroot if not specified).])], [], [with_sysroot=no]) dnl lt_sysroot will always be passed unquoted. We quote it here dnl in case the user passed a directory name. lt_sysroot= case $with_sysroot in #( yes) if test yes = "$GCC"; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) AC_MSG_RESULT([$with_sysroot]) AC_MSG_ERROR([The sysroot must be an absolute path.]) ;; esac AC_MSG_RESULT([${lt_sysroot:-no}]) _LT_DECL([], [lt_sysroot], [0], [The root where to search for ]dnl [dependent libraries, and where our libraries should be installed.])]) # _LT_ENABLE_LOCK # --------------- m4_defun([_LT_ENABLE_LOCK], [AC_ARG_ENABLE([libtool-lock], [AS_HELP_STRING([--disable-libtool-lock], [avoid locking (might break parallel builds)])]) test no = "$enable_libtool_lock" || enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out what ABI is being produced by ac_compile, and set mode # options accordingly. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE=32 ;; *ELF-64*) HPUX_IA64_MODE=64 ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test yes = "$lt_cv_prog_gnu_ld"; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; mips64*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then emul=elf case `/usr/bin/file conftest.$ac_objext` in *32-bit*) emul="${emul}32" ;; *64-bit*) emul="${emul}64" ;; esac case `/usr/bin/file conftest.$ac_objext` in *MSB*) emul="${emul}btsmip" ;; *LSB*) emul="${emul}ltsmip" ;; esac case `/usr/bin/file conftest.$ac_objext` in *N32*) emul="${emul}n32" ;; esac LD="${LD-ld} -m $emul" fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. Note that the listed cases only cover the # situations where additional linker options are needed (such as when # doing 32-bit compilation for a host where ld defaults to 64-bit, or # vice versa); the common cases where no linker options are needed do # not appear in the list. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*linux*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*linux*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS=$CFLAGS CFLAGS="$CFLAGS -belf" AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf, [AC_LANG_PUSH(C) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no]) AC_LANG_POP]) if test yes != "$lt_cv_cc_needs_belf"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS=$SAVE_CFLAGS fi ;; *-*solaris*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*|x86_64-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD=${LD-ld}_sol2 fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks=$enable_libtool_lock ])# _LT_ENABLE_LOCK # _LT_PROG_AR # ----------- m4_defun([_LT_PROG_AR], [AC_CHECK_TOOLS(AR, [ar], false) : ${AR=ar} : ${AR_FLAGS=cru} _LT_DECL([], [AR], [1], [The archiver]) _LT_DECL([], [AR_FLAGS], [1], [Flags to create an archive]) AC_CACHE_CHECK([for archiver @FILE support], [lt_cv_ar_at_file], [lt_cv_ar_at_file=no AC_COMPILE_IFELSE([AC_LANG_PROGRAM], [echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&AS_MESSAGE_LOG_FD' AC_TRY_EVAL([lt_ar_try]) if test 0 -eq "$ac_status"; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a AC_TRY_EVAL([lt_ar_try]) if test 0 -ne "$ac_status"; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a ]) ]) if test no = "$lt_cv_ar_at_file"; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi _LT_DECL([], [archiver_list_spec], [1], [How to feed a file listing to the archiver]) ])# _LT_PROG_AR # _LT_CMD_OLD_ARCHIVE # ------------------- m4_defun([_LT_CMD_OLD_ARCHIVE], [_LT_PROG_AR AC_CHECK_TOOL(STRIP, strip, :) test -z "$STRIP" && STRIP=: _LT_DECL([], [STRIP], [1], [A symbol stripping program]) AC_CHECK_TOOL(RANLIB, ranlib, :) test -z "$RANLIB" && RANLIB=: _LT_DECL([], [RANLIB], [1], [Commands used to install an old-style archive]) # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in bitrig* | openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac _LT_DECL([], [old_postinstall_cmds], [2]) _LT_DECL([], [old_postuninstall_cmds], [2]) _LT_TAGDECL([], [old_archive_cmds], [2], [Commands used to build an old-style archive]) _LT_DECL([], [lock_old_archive_extraction], [0], [Whether to use a lock for old archive extraction]) ])# _LT_CMD_OLD_ARCHIVE # _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------------------- # Check whether the given compiler option works AC_DEFUN([_LT_COMPILER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4]) echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$3" ## exclude from sc_useless_quotes_in_assignment # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi fi $RM conftest* ]) if test yes = "[$]$2"; then m4_if([$5], , :, [$5]) else m4_if([$6], , :, [$6]) fi ])# _LT_COMPILER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], []) # _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------- # Check whether the given linker option works AC_DEFUN([_LT_LINKER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS $3" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&AS_MESSAGE_LOG_FD $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi else $2=yes fi fi $RM -r conftest* LDFLAGS=$save_LDFLAGS ]) if test yes = "[$]$2"; then m4_if([$4], , :, [$4]) else m4_if([$5], , :, [$5]) fi ])# _LT_LINKER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], []) # LT_CMD_MAX_LEN #--------------- AC_DEFUN([LT_CMD_MAX_LEN], [AC_REQUIRE([AC_CANONICAL_HOST])dnl # find the maximum length of command line arguments AC_MSG_CHECKING([the maximum length of command line arguments]) AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl i=0 teststring=ABCD case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; bitrig* | darwin* | dragonfly* | freebsd* | netbsd* | openbsd*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[ ]]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test X`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test 17 != "$i" # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac ]) if test -n "$lt_cv_sys_max_cmd_len"; then AC_MSG_RESULT($lt_cv_sys_max_cmd_len) else AC_MSG_RESULT(none) fi max_cmd_len=$lt_cv_sys_max_cmd_len _LT_DECL([], [max_cmd_len], [0], [What is the maximum length of a command?]) ])# LT_CMD_MAX_LEN # Old name: AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], []) # _LT_HEADER_DLFCN # ---------------- m4_defun([_LT_HEADER_DLFCN], [AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl ])# _LT_HEADER_DLFCN # _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE, # ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING) # ---------------------------------------------------------------- m4_defun([_LT_TRY_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test yes = "$cross_compiling"; then : [$4] else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF [#line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; }] _LT_EOF if AC_TRY_EVAL(ac_link) && test -s "conftest$ac_exeext" 2>/dev/null; then (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) $1 ;; x$lt_dlneed_uscore) $2 ;; x$lt_dlunknown|x*) $3 ;; esac else : # compilation failed $3 fi fi rm -fr conftest* ])# _LT_TRY_DLOPEN_SELF # LT_SYS_DLOPEN_SELF # ------------------ AC_DEFUN([LT_SYS_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test yes != "$enable_dlopen"; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen=load_add_on lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen=LoadLibrary lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen=dlopen lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl],[ lt_cv_dlopen=dyld lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ]) ;; tpf*) # Don't try to run any link tests for TPF. We know it's impossible # because TPF is a cross-compiler, and we know how we open DSOs. lt_cv_dlopen=dlopen lt_cv_dlopen_libs= lt_cv_dlopen_self=no ;; *) AC_CHECK_FUNC([shl_load], [lt_cv_dlopen=shl_load], [AC_CHECK_LIB([dld], [shl_load], [lt_cv_dlopen=shl_load lt_cv_dlopen_libs=-ldld], [AC_CHECK_FUNC([dlopen], [lt_cv_dlopen=dlopen], [AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl], [AC_CHECK_LIB([svld], [dlopen], [lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-lsvld], [AC_CHECK_LIB([dld], [dld_link], [lt_cv_dlopen=dld_link lt_cv_dlopen_libs=-ldld]) ]) ]) ]) ]) ]) ;; esac if test no = "$lt_cv_dlopen"; then enable_dlopen=no else enable_dlopen=yes fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS=$CPPFLAGS test yes = "$ac_cv_header_dlfcn_h" && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS=$LDFLAGS wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS=$LIBS LIBS="$lt_cv_dlopen_libs $LIBS" AC_CACHE_CHECK([whether a program can dlopen itself], lt_cv_dlopen_self, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes, lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross) ]) if test yes = "$lt_cv_dlopen_self"; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" AC_CACHE_CHECK([whether a statically linked program can dlopen itself], lt_cv_dlopen_self_static, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross) ]) fi CPPFLAGS=$save_CPPFLAGS LDFLAGS=$save_LDFLAGS LIBS=$save_LIBS ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi _LT_DECL([dlopen_support], [enable_dlopen], [0], [Whether dlopen is supported]) _LT_DECL([dlopen_self], [enable_dlopen_self], [0], [Whether dlopen of programs is supported]) _LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0], [Whether dlopen of statically linked programs is supported]) ])# LT_SYS_DLOPEN_SELF # Old name: AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], []) # _LT_COMPILER_C_O([TAGNAME]) # --------------------------- # Check to see if options -c and -o are simultaneously supported by compiler. # This macro does not hard code the compiler like AC_PROG_CC_C_O. m4_defun([_LT_COMPILER_C_O], [m4_require([_LT_DECL_SED])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes fi fi chmod u+w . 2>&AS_MESSAGE_LOG_FD $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* ]) _LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1], [Does compiler simultaneously support -c and -o options?]) ])# _LT_COMPILER_C_O # _LT_COMPILER_FILE_LOCKS([TAGNAME]) # ---------------------------------- # Check to see if we can do hard links to lock some files if needed m4_defun([_LT_COMPILER_FILE_LOCKS], [m4_require([_LT_ENABLE_LOCK])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_COMPILER_C_O([$1]) hard_links=nottested if test no = "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" && test no != "$need_locks"; then # do not overwrite the value of need_locks provided by the user AC_MSG_CHECKING([if we can lock with hard links]) hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no AC_MSG_RESULT([$hard_links]) if test no = "$hard_links"; then AC_MSG_WARN(['$CC' does not support '-c -o', so 'make -j' may be unsafe]) need_locks=warn fi else need_locks=no fi _LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?]) ])# _LT_COMPILER_FILE_LOCKS # _LT_CHECK_OBJDIR # ---------------- m4_defun([_LT_CHECK_OBJDIR], [AC_CACHE_CHECK([for objdir], [lt_cv_objdir], [rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null]) objdir=$lt_cv_objdir _LT_DECL([], [objdir], [0], [The name of the directory that contains temporary libtool files])dnl m4_pattern_allow([LT_OBJDIR])dnl AC_DEFINE_UNQUOTED([LT_OBJDIR], "$lt_cv_objdir/", [Define to the sub-directory where libtool stores uninstalled libraries.]) ])# _LT_CHECK_OBJDIR # _LT_LINKER_HARDCODE_LIBPATH([TAGNAME]) # -------------------------------------- # Check hardcoding attributes. m4_defun([_LT_LINKER_HARDCODE_LIBPATH], [AC_MSG_CHECKING([how to hardcode library paths into programs]) _LT_TAGVAR(hardcode_action, $1)= if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" || test -n "$_LT_TAGVAR(runpath_var, $1)" || test yes = "$_LT_TAGVAR(hardcode_automatic, $1)"; then # We can hardcode non-existent directories. if test no != "$_LT_TAGVAR(hardcode_direct, $1)" && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test no != "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" && test no != "$_LT_TAGVAR(hardcode_minus_L, $1)"; then # Linking always hardcodes the temporary library directory. _LT_TAGVAR(hardcode_action, $1)=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. _LT_TAGVAR(hardcode_action, $1)=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. _LT_TAGVAR(hardcode_action, $1)=unsupported fi AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)]) if test relink = "$_LT_TAGVAR(hardcode_action, $1)" || test yes = "$_LT_TAGVAR(inherit_rpath, $1)"; then # Fast installation is not supported enable_fast_install=no elif test yes = "$shlibpath_overrides_runpath" || test no = "$enable_shared"; then # Fast installation is not necessary enable_fast_install=needless fi _LT_TAGDECL([], [hardcode_action], [0], [How to hardcode a shared library path into an executable]) ])# _LT_LINKER_HARDCODE_LIBPATH # _LT_CMD_STRIPLIB # ---------------- m4_defun([_LT_CMD_STRIPLIB], [m4_require([_LT_DECL_EGREP]) striplib= old_striplib= AC_MSG_CHECKING([whether stripping libraries is possible]) if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" AC_MSG_RESULT([yes]) else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP"; then striplib="$STRIP -x" old_striplib="$STRIP -S" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi ;; *) AC_MSG_RESULT([no]) ;; esac fi _LT_DECL([], [old_striplib], [1], [Commands to strip libraries]) _LT_DECL([], [striplib], [1]) ])# _LT_CMD_STRIPLIB # _LT_SYS_DYNAMIC_LINKER([TAG]) # ----------------------------- # PORTME Fill in your ld.so characteristics m4_defun([_LT_SYS_DYNAMIC_LINKER], [AC_REQUIRE([AC_CANONICAL_HOST])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_OBJDUMP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl AC_MSG_CHECKING([dynamic linker characteristics]) m4_if([$1], [], [ if test yes = "$GCC"; then case $host_os in darwin*) lt_awk_arg='/^libraries:/,/LR/' ;; *) lt_awk_arg='/^libraries:/' ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq='s|=\([[A-Za-z]]:\)|\1|g' ;; *) lt_sed_strip_eq='s|=/|/|g' ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary... lt_tmp_lt_search_path_spec= lt_multi_os_dir=/`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` # ...but if some path component already ends with the multilib dir we assume # that all is fine and trust -print-search-dirs as is (GCC 4.2? or newer). case "$lt_multi_os_dir; $lt_search_path_spec " in "/; "* | "/.; "* | "/./; "* | *"$lt_multi_os_dir "* | *"$lt_multi_os_dir/ "*) lt_multi_os_dir= ;; esac for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path$lt_multi_os_dir" elif test -n "$lt_multi_os_dir"; then test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS = " "; FS = "/|\n";} { lt_foo = ""; lt_count = 0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo = "/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[[lt_foo]]++; } if (lt_freq[[lt_foo]] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's|/\([[A-Za-z]]:\)|\1|g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi]) library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=.so postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='$libname$release$shared_ext$major' ;; aix[[4-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test ia64 = "$host_cpu"; then # AIX 5 supports IA64 library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line '#! .'. This would cause the generated library to # depend on '.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[[01]] | aix4.[[01]].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test yes = "$aix_use_runtimelinking"; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='$libname$release.a $libname.a' soname_spec='$libname$release$shared_ext$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='$libname$shared_ext' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[[45]]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=.dll need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api"]) ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' library_names_spec='$libname.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([[a-zA-Z]]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec=$LIB if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='$libname$release$major$shared_ext $libname$shared_ext' soname_spec='$libname$release$major$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"]) sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[[23]].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[[01]]* | freebsdelf3.[[01]]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \ freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=no sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' if test 32 = "$HPUX_IA64_MODE"; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[[3-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test yes = "$lt_cv_prog_gnu_ld"; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff" sys_lib_dlsearch_path_spec="/usr/lib$libsuff /lib$libsuff" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; linux*android*) version_type=none # Android doesn't support versioned libraries. need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext' soname_spec='$libname$release$shared_ext' finish_cmds= shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes dynamic_linker='Android linker' # Don't embed -rpath directories since the linker doesn't support them. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH AC_CACHE_VAL([lt_cv_shlibpath_overrides_runpath], [lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \ LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\"" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null], [lt_cv_shlibpath_overrides_runpath=yes])]) LDFLAGS=$save_LDFLAGS libdir=$save_libdir ]) shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd* | bitrig*) version_type=sunos sys_lib_dlsearch_path_spec=/usr/lib need_lib_prefix=no if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then need_version=no else need_version=yes fi library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; os2*) libname_spec='$name' shrext_cmds=.dll need_lib_prefix=no library_names_spec='$libname$shared_ext $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test yes = "$with_gnu_ld"; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec; then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext' soname_spec='$libname$shared_ext.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test yes = "$with_gnu_ld"; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac AC_MSG_RESULT([$dynamic_linker]) test no = "$dynamic_linker" && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test yes = "$GCC"; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test set = "${lt_cv_sys_lib_search_path_spec+set}"; then sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec fi if test set = "${lt_cv_sys_lib_dlsearch_path_spec+set}"; then sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec fi _LT_DECL([], [variables_saved_for_relink], [1], [Variables whose values should be saved in libtool wrapper scripts and restored at link time]) _LT_DECL([], [need_lib_prefix], [0], [Do we need the "lib" prefix for modules?]) _LT_DECL([], [need_version], [0], [Do we need a version for libraries?]) _LT_DECL([], [version_type], [0], [Library versioning type]) _LT_DECL([], [runpath_var], [0], [Shared library runtime path variable]) _LT_DECL([], [shlibpath_var], [0],[Shared library path variable]) _LT_DECL([], [shlibpath_overrides_runpath], [0], [Is shlibpath searched before the hard-coded library search path?]) _LT_DECL([], [libname_spec], [1], [Format of library name prefix]) _LT_DECL([], [library_names_spec], [1], [[List of archive names. First name is the real one, the rest are links. The last name is the one that the linker finds with -lNAME]]) _LT_DECL([], [soname_spec], [1], [[The coded name of the library, if different from the real name]]) _LT_DECL([], [install_override_mode], [1], [Permission mode override for installation of shared libraries]) _LT_DECL([], [postinstall_cmds], [2], [Command to use after installation of a shared archive]) _LT_DECL([], [postuninstall_cmds], [2], [Command to use after uninstallation of a shared archive]) _LT_DECL([], [finish_cmds], [2], [Commands used to finish a libtool library installation in a directory]) _LT_DECL([], [finish_eval], [1], [[As "finish_cmds", except a single script fragment to be evaled but not shown]]) _LT_DECL([], [hardcode_into_libs], [0], [Whether we should hardcode library paths into libraries]) _LT_DECL([], [sys_lib_search_path_spec], [2], [Compile-time system search path for libraries]) _LT_DECL([], [sys_lib_dlsearch_path_spec], [2], [Run-time system search path for libraries]) ])# _LT_SYS_DYNAMIC_LINKER # _LT_PATH_TOOL_PREFIX(TOOL) # -------------------------- # find a file program that can recognize shared library AC_DEFUN([_LT_PATH_TOOL_PREFIX], [m4_require([_LT_DECL_EGREP])dnl AC_MSG_CHECKING([for $1]) AC_CACHE_VAL(lt_cv_path_MAGIC_CMD, [case $MAGIC_CMD in [[\\/*] | ?:[\\/]*]) lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD=$MAGIC_CMD lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR dnl $ac_dummy forces splitting on constant user-supplied paths. dnl POSIX.2 word splitting is done only on the output of word expansions, dnl not every word. This closes a longstanding sh security hole. ac_dummy="m4_if([$2], , $PATH, [$2])" for ac_dir in $ac_dummy; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$1"; then lt_cv_path_MAGIC_CMD=$ac_dir/"$1" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD=$lt_cv_path_MAGIC_CMD if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS=$lt_save_ifs MAGIC_CMD=$lt_save_MAGIC_CMD ;; esac]) MAGIC_CMD=$lt_cv_path_MAGIC_CMD if test -n "$MAGIC_CMD"; then AC_MSG_RESULT($MAGIC_CMD) else AC_MSG_RESULT(no) fi _LT_DECL([], [MAGIC_CMD], [0], [Used to examine libraries when file_magic_cmd begins with "file"])dnl ])# _LT_PATH_TOOL_PREFIX # Old name: AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], []) # _LT_PATH_MAGIC # -------------- # find a file program that can recognize a shared library m4_defun([_LT_PATH_MAGIC], [_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH) if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH) else MAGIC_CMD=: fi fi ])# _LT_PATH_MAGIC # LT_PATH_LD # ---------- # find the pathname to the GNU or non-GNU linker AC_DEFUN([LT_PATH_LD], [AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PROG_ECHO_BACKSLASH])dnl AC_ARG_WITH([gnu-ld], [AS_HELP_STRING([--with-gnu-ld], [assume the C compiler uses GNU ld @<:@default=no@:>@])], [test no = "$withval" || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test yes = "$GCC"; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by $CC]) case $host in *-*-mingw*) # gcc leaves a trailing carriage return, which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [[\\/]]* | ?:[[\\/]]*) re_direlt='/[[^/]][[^/]]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD=$ac_prog ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test yes = "$with_gnu_ld"; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(lt_cv_path_LD, [if test -z "$LD"; then lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD=$ac_dir/$ac_prog # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &1 /dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]'] lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]]\.[[0-9]]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[[3-9]]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd* | bitrig*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac ]) file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[[\1]]\/[[\1]]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown _LT_DECL([], [deplibs_check_method], [1], [Method to check whether dependent libraries are shared objects]) _LT_DECL([], [file_magic_cmd], [1], [Command to use when deplibs_check_method = "file_magic"]) _LT_DECL([], [file_magic_glob], [1], [How to find potential files when deplibs_check_method = "file_magic"]) _LT_DECL([], [want_nocaseglob], [1], [Find potential files using nocaseglob when deplibs_check_method = "file_magic"]) ])# _LT_CHECK_MAGIC_METHOD # LT_PATH_NM # ---------- # find the pathname to a BSD- or MS-compatible name lister AC_DEFUN([LT_PATH_NM], [AC_REQUIRE([AC_PROG_CC])dnl AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM, [if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM=$NM else lt_nm_to_check=${ac_tool_prefix}nm if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. tmp_nm=$ac_dir/$lt_tmp_nm if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext"; then # Check to see if the nm accepts a BSD-compat flag. # Adding the 'sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break 2 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break 2 ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS=$lt_save_ifs done : ${lt_cv_path_NM=no} fi]) if test no != "$lt_cv_path_NM"; then NM=$lt_cv_path_NM else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else AC_CHECK_TOOLS(DUMPBIN, [dumpbin "link -dump"], :) case `$DUMPBIN -symbols -headers /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols -headers" ;; *) DUMPBIN=: ;; esac fi AC_SUBST([DUMPBIN]) if test : != "$DUMPBIN"; then NM=$DUMPBIN fi fi test -z "$NM" && NM=nm AC_SUBST([NM]) _LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface], [lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: output\"" >&AS_MESSAGE_LOG_FD) cat conftest.out >&AS_MESSAGE_LOG_FD if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest*]) ])# LT_PATH_NM # Old names: AU_ALIAS([AM_PROG_NM], [LT_PATH_NM]) AU_ALIAS([AC_PROG_NM], [LT_PATH_NM]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_PROG_NM], []) dnl AC_DEFUN([AC_PROG_NM], []) # _LT_CHECK_SHAREDLIB_FROM_LINKLIB # -------------------------------- # how to determine the name of the shared library # associated with a specific link library. # -- PORTME fill in with the dynamic library characteristics m4_defun([_LT_CHECK_SHAREDLIB_FROM_LINKLIB], [m4_require([_LT_DECL_EGREP]) m4_require([_LT_DECL_OBJDUMP]) m4_require([_LT_DECL_DLLTOOL]) AC_CACHE_CHECK([how to associate runtime and link libraries], lt_cv_sharedlib_from_linklib_cmd, [lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh; # decide which one to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd=$ECHO ;; esac ]) sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO _LT_DECL([], [sharedlib_from_linklib_cmd], [1], [Command to associate shared and link libraries]) ])# _LT_CHECK_SHAREDLIB_FROM_LINKLIB # _LT_PATH_MANIFEST_TOOL # ---------------------- # locate the manifest tool m4_defun([_LT_PATH_MANIFEST_TOOL], [AC_CHECK_TOOL(MANIFEST_TOOL, mt, :) test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt AC_CACHE_CHECK([if $MANIFEST_TOOL is a manifest tool], [lt_cv_path_mainfest_tool], [lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&AS_MESSAGE_LOG_FD $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&AS_MESSAGE_LOG_FD if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest*]) if test yes != "$lt_cv_path_mainfest_tool"; then MANIFEST_TOOL=: fi _LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl ])# _LT_PATH_MANIFEST_TOOL # _LT_DLL_DEF_P([FILE]) # --------------------- # True iff FILE is a Windows DLL '.def' file. # Keep in sync with func_dll_def_p in the libtool script AC_DEFUN([_LT_DLL_DEF_P], [dnl test DEF = "`$SED -n dnl -e '\''s/^[[ ]]*//'\'' dnl Strip leading whitespace -e '\''/^\(;.*\)*$/d'\'' dnl Delete empty lines and comments -e '\''s/^\(EXPORTS\|LIBRARY\)\([[ ]].*\)*$/DEF/p'\'' dnl -e q dnl Only consider the first "real" line $1`" dnl ])# _LT_DLL_DEF_P # LT_LIB_M # -------- # check for math library AC_DEFUN([LT_LIB_M], [AC_REQUIRE([AC_CANONICAL_HOST])dnl LIBM= case $host in *-*-beos* | *-*-cegcc* | *-*-cygwin* | *-*-haiku* | *-*-pw32* | *-*-darwin*) # These system don't have libm, or don't need it ;; *-ncr-sysv4.3*) AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM=-lmw) AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm") ;; *) AC_CHECK_LIB(m, cos, LIBM=-lm) ;; esac AC_SUBST([LIBM]) ])# LT_LIB_M # Old name: AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_CHECK_LIBM], []) # _LT_COMPILER_NO_RTTI([TAGNAME]) # ------------------------------- m4_defun([_LT_COMPILER_NO_RTTI], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= if test yes = "$GCC"; then case $cc_basename in nvcc*) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -Xcompiler -fno-builtin' ;; *) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' ;; esac _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions], lt_cv_prog_compiler_rtti_exceptions, [-fno-rtti -fno-exceptions], [], [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"]) fi _LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1], [Compiler flag to turn off builtin functions]) ])# _LT_COMPILER_NO_RTTI # _LT_CMD_GLOBAL_SYMBOLS # ---------------------- m4_defun([_LT_CMD_GLOBAL_SYMBOLS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([LT_PATH_NM])dnl AC_REQUIRE([LT_PATH_LD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_TAG_COMPILER])dnl # Check for command to grab the raw symbol name followed by C symbol from nm. AC_MSG_CHECKING([command to parse $NM output from $compiler object]) AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe], [ # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[[BCDEGRST]]' # Regexp to match symbols that can be accessed directly from C. sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[[BCDT]]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[[ABCDGISTW]]' ;; hpux*) if test ia64 = "$host_cpu"; then symcode='[[ABCDEGRST]]' fi ;; irix* | nonstopux*) symcode='[[BCDEGRST]]' ;; osf*) symcode='[[BCDEGQRST]]' ;; solaris*) symcode='[[BDRT]]' ;; sco3.2v5*) symcode='[[DT]]' ;; sysv4.2uw2*) symcode='[[DT]]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[[ABDT]]' ;; sysv4) symcode='[[DFNSTU]]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[[ABCDGIRSTW]]' ;; esac if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Gets list of data symbols to import. lt_cv_sys_global_symbol_to_import="sed -n -e 's/^I .* \(.*\)$/\1/p'" # Adjust the below global symbol transforms to fixup imported variables. lt_cdecl_hook=" -e 's/^I .* \(.*\)$/extern __declspec(dllimport) char \1;/p'" lt_c_name_hook=" -e 's/^I .* \(.*\)$/ {\"\1\", (void *) 0},/p'" lt_c_name_lib_hook="\ -e 's/^I .* \(lib.*\)$/ {\"\1\", (void *) 0},/p'\ -e 's/^I .* \(.*\)$/ {\"lib\1\", (void *) 0},/p'" else # Disable hooks by default. lt_cv_sys_global_symbol_to_import= lt_cdecl_hook= lt_c_name_hook= lt_c_name_lib_hook= fi # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n"\ $lt_cdecl_hook\ " -e 's/^T .* \(.*\)$/extern int \1();/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n"\ $lt_c_name_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/p'" # Transform an extracted symbol line into symbol name with lib prefix and # symbol address. lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n"\ $lt_c_name_lib_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(lib.*\)$/ {\"\1\", (void *) \&\1},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"lib\1\", (void *) \&\1},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function, # D for any global variable and I for any imported variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK ['"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " /^ *Symbol name *: /{split(\$ 0,sn,\":\"); si=substr(sn[2],2)};"\ " /^ *Type *: code/{print \"T\",si,substr(si,length(prfx))};"\ " /^ *Type *: data/{print \"I\",si,substr(si,length(prfx))};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=\"D\"}; \$ 0~/\(\).*\|/{f=\"T\"};"\ " {split(\$ 0,a,/\||\r/); split(a[2],s)};"\ " s[1]~/^[@?]/{print f,s[1],s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print f,t[1],substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx]" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if AC_TRY_EVAL(ac_compile); then # Now try to grab the symbols. nlist=conftest.nm if AC_TRY_EVAL(NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE /* DATA imports from DLLs on WIN32 can't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT@&t@_DLSYM_CONST #elif defined __osf__ /* This system does not cope well with relocations in const data. */ # define LT@&t@_DLSYM_CONST #else # define LT@&t@_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT@&t@_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[[]] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS=conftstm.$ac_objext CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)" if AC_TRY_EVAL(ac_link) && test -s conftest$ac_exeext; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD fi else echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test yes = "$pipe_works"; then break else lt_cv_sys_global_symbol_pipe= fi done ]) if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then AC_MSG_RESULT(failed) else AC_MSG_RESULT(ok) fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[[@]]FILE' >/dev/null; then nm_file_list_spec='@' fi _LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1], [Take the output of nm and produce a listing of raw symbols and C names]) _LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1], [Transform the output of nm in a proper C declaration]) _LT_DECL([global_symbol_to_import], [lt_cv_sys_global_symbol_to_import], [1], [Transform the output of nm into a list of symbols to manually relocate]) _LT_DECL([global_symbol_to_c_name_address], [lt_cv_sys_global_symbol_to_c_name_address], [1], [Transform the output of nm in a C name address pair]) _LT_DECL([global_symbol_to_c_name_address_lib_prefix], [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1], [Transform the output of nm in a C name address pair when lib prefix is needed]) _LT_DECL([nm_interface], [lt_cv_nm_interface], [1], [The name lister interface]) _LT_DECL([], [nm_file_list_spec], [1], [Specify filename containing input files for $NM]) ]) # _LT_CMD_GLOBAL_SYMBOLS # _LT_COMPILER_PIC([TAGNAME]) # --------------------------- m4_defun([_LT_COMPILER_PIC], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_wl, $1)= _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)= m4_if([$1], [CXX], [ # C++ specific cases for pic, static, wl, etc. if test yes = "$GXX"; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the '-m68020' flag to GCC prevents building anything better, # like '-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else case $host_os in aix[[4-9]]*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; dgux*) case $cc_basename in ec++*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; ghcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive' if test ia64 != "$host_cpu"; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' fi ;; aCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # KAI C++ Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64, which still supported -KPIC. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xlc* | xlC* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL 8.0, 9.0 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall' ;; *) ;; esac ;; netbsd*) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; cxx*) # Digital/Compaq C++ _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; lcc*) # Lucid _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ], [ if test yes = "$GCC"; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the '-m68020' flag to GCC prevents building anything better, # like '-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Xlinker ' if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_TAGVAR(lt_prog_compiler_pic, $1)="-Xcompiler $_LT_TAGVAR(lt_prog_compiler_pic, $1)" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' case $cc_basename in nagfor*) # NAG Fortran compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; hpux9* | hpux10* | hpux11*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC (with -KPIC) is the default. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64, which still supported -KPIC. ecc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # Lahey Fortran 8.1. lf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared' _LT_TAGVAR(lt_prog_compiler_static, $1)='--static' ;; nagfor*) # NAG Fortran compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; tcc*) # Fabrice Bellard et al's Tiny C Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; ccc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All Alpha code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [[1-7]].* | *Sun*Fortran*\ 8.[[0-3]]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='' ;; *Sun\ F* | *Sun*Fortran*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' ;; *Intel*\ [[CF]]*Compiler*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; *Portland\ Group*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; esac ;; newsos6) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All OSF/1 code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; rdos*) _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; solaris*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';; *) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';; esac ;; sunos4*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; unicos*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; uts4*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ]) case $host_os in # For platforms that do not support PIC, -DPIC is meaningless: *djgpp*) _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])" ;; esac AC_CACHE_CHECK([for $compiler option to produce PIC], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_prog_compiler_pic, $1)]) _LT_TAGVAR(lt_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_cv_prog_compiler_pic, $1) # # Check to make sure the PIC flag actually works. # if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works], [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)], [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [], [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in "" | " "*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;; esac], [_LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no]) fi _LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1], [Additional compiler flags for building library objects]) _LT_TAGDECL([wl], [lt_prog_compiler_wl], [1], [How to pass a linker flag through the compiler]) # # Check to make sure the static flag actually works. # wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\" _LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works], _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1), $lt_tmp_static_flag, [], [_LT_TAGVAR(lt_prog_compiler_static, $1)=]) _LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1], [Compiler flag to prevent dynamic linking]) ])# _LT_COMPILER_PIC # _LT_LINKER_SHLIBS([TAGNAME]) # ---------------------------- # See if the linker supports building shared libraries. m4_defun([_LT_LINKER_SHLIBS], [AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) m4_if([$1], [CXX], [ _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] case $host_os in aix[[4-9]]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global defined # symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) _LT_TAGVAR(export_symbols_cmds, $1)=$ltdll_cmds ;; cygwin* | mingw* | cegcc*) case $cc_basename in cl*) _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] ;; esac ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac ], [ runpath_var= _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_cmds, $1)= _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(old_archive_from_new_cmds, $1)= _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)= _LT_TAGVAR(thread_safe_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list _LT_TAGVAR(include_expsyms, $1)= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ' (' and ')$', so one must not match beginning or # end of line. Example: 'a|bc|.*d.*' will exclude the symbols 'a' and 'bc', # as well as any symbol that contains 'd'. _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. dnl Note also adjust exclude_expsyms for C++ above. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test yes != "$GCC"; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd* | bitrig*) with_gnu_ld=no ;; esac _LT_TAGVAR(ld_shlibs, $1)=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test yes = "$with_gnu_ld"; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[[2-9]]*) ;; *\ \(GNU\ Binutils\)\ [[3-9]]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test yes = "$lt_use_gnu_ld_interface"; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='$wl' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi supports_anon_versioning=no case `$LD -v | $SED -e 's/([^)]\+)\s\+//' 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[[3-9]]*) # On AIX/PPC, the GNU linker is very broken if test ia64 != "$host_cpu"; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file, use it as # is; otherwise, prepend EXPORTS... _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s|^|_|" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test linux-dietlibc = "$host_os"; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test no = "$tmp_diet" then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 _LT_TAGVAR(whole_archive_flag_spec, $1)= tmp_sharedflag='--shared' ;; nagfor*) # NAGFOR 5.3 tmp_sharedflag='-Wl,-shared' ;; xl[[cC]]* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac _LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' if test yes = "$supports_anon_versioning"; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test yes = "$supports_anon_versioning"; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*) _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 cannot *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; sunos4*) _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac if test no = "$_LT_TAGVAR(ld_shlibs, $1)"; then runpath_var= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. _LT_TAGVAR(hardcode_minus_L, $1)=yes if test yes = "$GCC" && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. _LT_TAGVAR(hardcode_direct, $1)=unsupported fi ;; aix[[4-9]]*) if test ia64 = "$host_cpu"; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag= else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do if (test x-brtl = "x$ld_flag" || test x-Wl,-brtl = "x$ld_flag"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='$wl-f,' if test yes = "$GCC"; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`$CC -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi ;; esac shared_flag='-shared' if test yes = "$aix_use_runtimelinking"; then shared_flag="$shared_flag "'$wl-G' fi else # not using gcc if test ia64 = "$host_cpu"; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test yes = "$aix_use_runtimelinking"; then shared_flag='$wl-G' else shared_flag='$wl-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. _LT_TAGVAR(always_export_symbols, $1)=yes if test yes = "$aix_use_runtimelinking"; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n "$allow_undefined_flag"; then func_echo_all "$wl$allow_undefined_flag"; else :; fi` $wl'$exp_sym_flag:\$export_symbols' '$shared_flag else if test ia64 = "$host_cpu"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\$wl$no_entry_flag"' $compiler_flags $wl$allow_undefined_flag '"\$wl$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' $wl-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-berok' if test yes = "$with_gnu_ld"; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $wl-bnoentry $compiler_flags $wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; bsdi[[45]]*) _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp "$export_symbols" "$output_objdir/$soname.def"; echo "$tool_output_objdir$soname.def" > "$output_objdir/$soname.exp"; else $SED -e '\''s/^/-link -EXPORT:/'\'' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1,DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile=$lt_outputfile.exe lt_tool_outputfile=$lt_tool_outputfile.exe ;; esac~ if test : != "$MANIFEST_TOOL" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' # FIXME: Should let the user specify the lib program. _LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; hpux9*) if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' else _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' ;; hpux10*) if test yes,no = "$GCC,$with_gnu_ld"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test no = "$with_gnu_ld"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes fi ;; hpux11*) if test yes,no = "$GCC,$with_gnu_ld"; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) m4_if($1, [], [ # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) _LT_LINKER_OPTION([if $CC understands -b], _LT_TAGVAR(lt_cv_prog_compiler__b, $1), [-b], [_LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'], [_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'])], [_LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags']) ;; esac fi if test no = "$with_gnu_ld"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. AC_CACHE_CHECK([whether the $host_os linker accepts -exported_symbol], [lt_cv_irix_exported_symbol], [save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS -shared $wl-exported_symbol ${wl}foo $wl-update_registry $wl/dev/null" AC_LINK_IFELSE( [AC_LANG_SOURCE( [AC_LANG_CASE([C], [[int foo (void) { return 0; }]], [C++], [[int foo (void) { return 0; }]], [Fortran 77], [[ subroutine foo end]], [Fortran], [[ subroutine foo end]])])], [lt_cv_irix_exported_symbol=yes], [lt_cv_irix_exported_symbol=no]) LDFLAGS=$save_LDFLAGS]) if test yes = "$lt_cv_irix_exported_symbol"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations $wl-exports_file $wl$export_symbols -o $lib' fi else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -exports_file $export_symbols -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes _LT_TAGVAR(link_all_deplibs, $1)=yes ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else _LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; newsos6) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *nto* | *qnx*) ;; openbsd* | bitrig*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags $wl-retain-symbols-file,$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' fi else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; os2*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test yes = "$GCC"; then _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test yes = "$GCC"; then _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $pic_flag $libobjs $deplibs $compiler_flags $wl-msym $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $wl-input $wl$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; solaris*) _LT_TAGVAR(no_undefined_flag, $1)=' -z defs' if test yes = "$GCC"; then wlarc='$wl' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl-z ${wl}text $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag $wl-z ${wl}text $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' _LT_TAGVAR(archive_cmds, $1)='$LD -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='$wl' _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands '-z linker_flag'. GCC discards it without '$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test yes = "$GCC"; then _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract' else _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' fi ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes ;; sunos4*) if test sequent = "$host_vendor"; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h $soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4) case $host_vendor in sni) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs' _LT_TAGVAR(hardcode_direct, $1)=no ;; motorola) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4.3*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes _LT_TAGVAR(ld_shlibs, $1)=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We CANNOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='$wl-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Bexport' runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(ld_shlibs, $1)=no ;; esac if test sni = "$host_vendor"; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Blargedynsym' ;; esac fi fi ]) AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test no = "$_LT_TAGVAR(ld_shlibs, $1)" && can_build_shared=no _LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld _LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl _LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl _LT_DECL([], [extract_expsyms_cmds], [2], [The commands to extract the exported symbol list from a shared archive]) # # Do we need to explicitly link libc? # case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in x|xyes) # Assume -lc should be added _LT_TAGVAR(archive_cmds_need_lc, $1)=yes if test yes,yes = "$GCC,$enable_shared"; then case $_LT_TAGVAR(archive_cmds, $1) in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. AC_CACHE_CHECK([whether -lc should be explicitly linked in], [lt_cv_]_LT_TAGVAR(archive_cmds_need_lc, $1), [$RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if AC_TRY_EVAL(ac_compile) 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1) compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1) _LT_TAGVAR(allow_undefined_flag, $1)= if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) then lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=no else lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=yes fi _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* ]) _LT_TAGVAR(archive_cmds_need_lc, $1)=$lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1) ;; esac fi ;; esac _LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0], [Whether or not to add -lc for building shared libraries]) _LT_TAGDECL([allow_libtool_libs_with_static_runtimes], [enable_shared_with_static_runtimes], [0], [Whether or not to disallow shared libs when runtime libs are static]) _LT_TAGDECL([], [export_dynamic_flag_spec], [1], [Compiler flag to allow reflexive dlopens]) _LT_TAGDECL([], [whole_archive_flag_spec], [1], [Compiler flag to generate shared objects directly from archives]) _LT_TAGDECL([], [compiler_needs_object], [1], [Whether the compiler copes with passing no objects directly]) _LT_TAGDECL([], [old_archive_from_new_cmds], [2], [Create an old-style archive from a shared archive]) _LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2], [Create a temporary old-style archive to link instead of a shared archive]) _LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive]) _LT_TAGDECL([], [archive_expsym_cmds], [2]) _LT_TAGDECL([], [module_cmds], [2], [Commands used to build a loadable module if different from building a shared archive.]) _LT_TAGDECL([], [module_expsym_cmds], [2]) _LT_TAGDECL([], [with_gnu_ld], [1], [Whether we are building with GNU ld or not]) _LT_TAGDECL([], [allow_undefined_flag], [1], [Flag that allows shared libraries with undefined symbols to be built]) _LT_TAGDECL([], [no_undefined_flag], [1], [Flag that enforces no undefined symbols]) _LT_TAGDECL([], [hardcode_libdir_flag_spec], [1], [Flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]) _LT_TAGDECL([], [hardcode_libdir_separator], [1], [Whether we need a single "-rpath" flag with a separated argument]) _LT_TAGDECL([], [hardcode_direct], [0], [Set to "yes" if using DIR/libNAME$shared_ext during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_direct_absolute], [0], [Set to "yes" if using DIR/libNAME$shared_ext during linking hardcodes DIR into the resulting binary and the resulting library dependency is "absolute", i.e impossible to change by setting $shlibpath_var if the library is relocated]) _LT_TAGDECL([], [hardcode_minus_L], [0], [Set to "yes" if using the -LDIR flag during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_shlibpath_var], [0], [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_automatic], [0], [Set to "yes" if building a shared library automatically hardcodes DIR into the library and all subsequent libraries and executables linked against it]) _LT_TAGDECL([], [inherit_rpath], [0], [Set to yes if linker adds runtime paths of dependent libraries to runtime path list]) _LT_TAGDECL([], [link_all_deplibs], [0], [Whether libtool must link a program against all its dependency libraries]) _LT_TAGDECL([], [always_export_symbols], [0], [Set to "yes" if exported symbols are required]) _LT_TAGDECL([], [export_symbols_cmds], [2], [The commands to list exported symbols]) _LT_TAGDECL([], [exclude_expsyms], [1], [Symbols that should not be listed in the preloaded symbols]) _LT_TAGDECL([], [include_expsyms], [1], [Symbols that must always be exported]) _LT_TAGDECL([], [prelink_cmds], [2], [Commands necessary for linking programs (against libraries) with templates]) _LT_TAGDECL([], [postlink_cmds], [2], [Commands necessary for finishing linking programs]) _LT_TAGDECL([], [file_list_spec], [1], [Specify filename containing input files]) dnl FIXME: Not yet implemented dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1], dnl [Compiler flag to generate thread safe objects]) ])# _LT_LINKER_SHLIBS # _LT_LANG_C_CONFIG([TAG]) # ------------------------ # Ensure that the configuration variables for a C compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to 'libtool'. m4_defun([_LT_LANG_C_CONFIG], [m4_require([_LT_DECL_EGREP])dnl lt_save_CC=$CC AC_LANG_PUSH(C) # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' _LT_TAG_COMPILER # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) LT_SYS_DLOPEN_SELF _LT_CMD_STRIPLIB # Report what library types will actually be built AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_CONFIG($1) fi AC_LANG_POP CC=$lt_save_CC ])# _LT_LANG_C_CONFIG # _LT_LANG_CXX_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a C++ compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to 'libtool'. m4_defun([_LT_LANG_CXX_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl if test -n "$CXX" && ( test no != "$CXX" && ( (test g++ = "$CXX" && `g++ -v >/dev/null 2>&1` ) || (test g++ != "$CXX"))); then AC_PROG_CXXCPP else _lt_caught_CXX_error=yes fi AC_LANG_PUSH(C++) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test yes != "$_lt_caught_CXX_error"; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} CFLAGS=$CXXFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test yes = "$GXX"; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' else _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= fi if test yes = "$GXX"; then # Set up default GNU C++ configuration LT_PATH_LD # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test yes = "$with_gnu_ld"; then _LT_TAGVAR(archive_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='$wl' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) _LT_TAGVAR(ld_shlibs, $1)=yes case $host_os in aix3*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aix[[4-9]]*) if test ia64 = "$host_cpu"; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag= else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='$wl-f,' if test yes = "$GXX"; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`$CC -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi esac shared_flag='-shared' if test yes = "$aix_use_runtimelinking"; then shared_flag=$shared_flag' $wl-G' fi else # not using gcc if test ia64 = "$host_cpu"; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test yes = "$aix_use_runtimelinking"; then shared_flag='$wl-G' else shared_flag='$wl-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. _LT_TAGVAR(always_export_symbols, $1)=yes if test yes = "$aix_use_runtimelinking"; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an empty # executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n "$allow_undefined_flag"; then func_echo_all "$wl$allow_undefined_flag"; else :; fi` $wl'$exp_sym_flag:\$export_symbols' '$shared_flag else if test ia64 = "$host_cpu"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\$wl$no_entry_flag"' $compiler_flags $wl$allow_undefined_flag '"\$wl$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' $wl-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-berok' if test yes = "$with_gnu_ld"; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared # libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $wl-bnoentry $compiler_flags $wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) case $GXX,$cc_basename in ,cl* | no,cl*) # Native MSVC # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp "$export_symbols" "$output_objdir/$soname.def"; echo "$tool_output_objdir$soname.def" > "$output_objdir/$soname.exp"; else $SED -e '\''s/^/-link -EXPORT:/'\'' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile=$lt_outputfile.exe lt_tool_outputfile=$lt_tool_outputfile.exe ;; esac~ func_to_tool_file "$lt_outputfile"~ if test : != "$MANIFEST_TOOL" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # g++ # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file, use it as # is; otherwise, prepend EXPORTS... _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; freebsd2.*) # C++ shared libraries reported to be fairly broken before # switch to ELF _LT_TAGVAR(ld_shlibs, $1)=no ;; freebsd-elf*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions _LT_TAGVAR(ld_shlibs, $1)=yes ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; hpux9*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes = "$GXX"; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; hpux10*|hpux11*) if test no = "$with_gnu_ld"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) ;; *) _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes = "$GXX"; then if test no = "$with_gnu_ld"; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s|^|_|" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test yes = "$GXX"; then if test no = "$with_gnu_ld"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` -o $lib' fi fi _LT_TAGVAR(link_all_deplibs, $1)=yes ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib $wl-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [[1-5]].* | *pgcpp\ [[1-5]].*) _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"' _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~ $RANLIB $oldlib' _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 6 and above use weak symbols _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl--rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' ;; cxx*) # Compaq C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib $wl-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed' ;; xl* | mpixl* | bgxl*) # IBM XL 8.0 on PPC, with GNU ld _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' if test yes = "$supports_anon_versioning"; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file $wl$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; m88k*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) _LT_TAGVAR(ld_shlibs, $1)=yes ;; openbsd* | bitrig*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file,$export_symbols -o $lib' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' fi output_verbose_link_cmd=func_echo_all else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; cxx*) case $host in osf3*) _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $soname `test -n "$verstring" && func_echo_all "$wl-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' ;; *) _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname $wl-input $wl$lib.exp `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib~ $RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' ;; esac _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes,no = "$GXX,$with_gnu_ld"; then _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' case $host in osf3*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-msym $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(archive_cmds_need_lc,$1)=yes _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G$allow_undefined_flag $wl-M $wl$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands '-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test yes,no = "$GXX,$with_gnu_ld"; then _LT_TAGVAR(no_undefined_flag, $1)=' $wl-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # g++ 2.7 appears to require '-G' NOT '-shared' on this # platform. _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $wl$libdir' case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We CANNOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='$wl-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(old_archive_cmds, $1)='$CC -Tprelink_objects $oldobjs~ '"$_LT_TAGVAR(old_archive_cmds, $1)" _LT_TAGVAR(reload_cmds, $1)='$CC -Tprelink_objects $reload_objs~ '"$_LT_TAGVAR(reload_cmds, $1)" ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test no = "$_LT_TAGVAR(ld_shlibs, $1)" && can_build_shared=no _LT_TAGVAR(GCC, $1)=$GXX _LT_TAGVAR(LD, $1)=$LD ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test yes != "$_lt_caught_CXX_error" AC_LANG_POP ])# _LT_LANG_CXX_CONFIG # _LT_FUNC_STRIPNAME_CNF # ---------------------- # func_stripname_cnf prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # # This function is identical to the (non-XSI) version of func_stripname, # except this one can be used by m4 code that may be executed by configure, # rather than the libtool script. m4_defun([_LT_FUNC_STRIPNAME_CNF],[dnl AC_REQUIRE([_LT_DECL_SED]) AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH]) func_stripname_cnf () { case @S|@2 in .*) func_stripname_result=`$ECHO "@S|@3" | $SED "s%^@S|@1%%; s%\\\\@S|@2\$%%"`;; *) func_stripname_result=`$ECHO "@S|@3" | $SED "s%^@S|@1%%; s%@S|@2\$%%"`;; esac } # func_stripname_cnf ])# _LT_FUNC_STRIPNAME_CNF # _LT_SYS_HIDDEN_LIBDEPS([TAGNAME]) # --------------------------------- # Figure out "hidden" library dependencies from verbose # compiler output when linking a shared library. # Parse the compiler output and extract the necessary # objects, libraries and library flags. m4_defun([_LT_SYS_HIDDEN_LIBDEPS], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl AC_REQUIRE([_LT_FUNC_STRIPNAME_CNF])dnl # Dependencies to place before and after the object being linked: _LT_TAGVAR(predep_objects, $1)= _LT_TAGVAR(postdep_objects, $1)= _LT_TAGVAR(predeps, $1)= _LT_TAGVAR(postdeps, $1)= _LT_TAGVAR(compiler_lib_search_path, $1)= dnl we can't use the lt_simple_compile_test_code here, dnl because it contains code intended for an executable, dnl not a library. It's possible we should let each dnl tag define a new lt_????_link_test_code variable, dnl but it's only used here... m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF int a; void foo (void) { a = 0; } _LT_EOF ], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF ], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer*4 a a=0 return end _LT_EOF ], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer a a=0 return end _LT_EOF ], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF public class foo { private int a; public void bar (void) { a = 0; } }; _LT_EOF ], [$1], [GO], [cat > conftest.$ac_ext <<_LT_EOF package foo func foo() { } _LT_EOF ]) _lt_libdeps_save_CFLAGS=$CFLAGS case "$CC $CFLAGS " in #( *\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;; *\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;; *\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;; esac dnl Parse the compiler output and extract the necessary dnl objects, libraries and library flags. if AC_TRY_EVAL(ac_compile); then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $prev$p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test x-L = "$p" || test x-R = "$p"; then prev=$p continue fi # Expand the sysroot to ease extracting the directories later. if test -z "$prev"; then case $p in -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;; -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;; -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;; esac fi case $p in =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;; esac if test no = "$pre_test_object_deps_done"; then case $prev in -L | -R) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then _LT_TAGVAR(compiler_lib_search_path, $1)=$prev$p else _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} $prev$p" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$_LT_TAGVAR(postdeps, $1)"; then _LT_TAGVAR(postdeps, $1)=$prev$p else _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} $prev$p" fi fi prev= ;; *.lto.$objext) ;; # Ignore GCC LTO objects *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test no = "$pre_test_object_deps_done"; then if test -z "$_LT_TAGVAR(predep_objects, $1)"; then _LT_TAGVAR(predep_objects, $1)=$p else _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p" fi else if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then _LT_TAGVAR(postdep_objects, $1)=$p else _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling $1 test program" fi $RM -f confest.$objext CFLAGS=$_lt_libdeps_save_CFLAGS # PORTME: override above test on systems where it is broken m4_if([$1], [CXX], [case $host_os in interix[[3-9]]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. _LT_TAGVAR(predep_objects,$1)= _LT_TAGVAR(postdep_objects,$1)= _LT_TAGVAR(postdeps,$1)= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test yes != "$solaris_use_stlport4"; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test yes != "$solaris_use_stlport4"; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; esac ]) case " $_LT_TAGVAR(postdeps, $1) " in *" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; esac _LT_TAGVAR(compiler_lib_search_dirs, $1)= if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | $SED -e 's! -L! !g' -e 's!^ !!'` fi _LT_TAGDECL([], [compiler_lib_search_dirs], [1], [The directories searched by this compiler when creating a shared library]) _LT_TAGDECL([], [predep_objects], [1], [Dependencies to place before and after the objects being linked to create a shared library]) _LT_TAGDECL([], [postdep_objects], [1]) _LT_TAGDECL([], [predeps], [1]) _LT_TAGDECL([], [postdeps], [1]) _LT_TAGDECL([], [compiler_lib_search_path], [1], [The library search path used internally by the compiler when linking a shared library]) ])# _LT_SYS_HIDDEN_LIBDEPS # _LT_LANG_F77_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a Fortran 77 compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_F77_CONFIG], [AC_LANG_PUSH(Fortran 77) if test -z "$F77" || test no = "$F77"; then _lt_disable_F77=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the F77 compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test yes != "$_lt_disable_F77"; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${F77-"f77"} CFLAGS=$FFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) GCC=$G77 if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)=$G77 _LT_TAGVAR(LD, $1)=$LD ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS fi # test yes != "$_lt_disable_F77" AC_LANG_POP ])# _LT_LANG_F77_CONFIG # _LT_LANG_FC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for a Fortran compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_FC_CONFIG], [AC_LANG_PUSH(Fortran) if test -z "$FC" || test no = "$FC"; then _lt_disable_FC=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for fc test sources. ac_ext=${ac_fc_srcext-f} # Object file extension for compiled fc test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the FC compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test yes != "$_lt_disable_FC"; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${FC-"f95"} CFLAGS=$FCFLAGS compiler=$CC GCC=$ac_cv_fc_compiler_gnu _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)=$ac_cv_fc_compiler_gnu _LT_TAGVAR(LD, $1)=$LD ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS fi # test yes != "$_lt_disable_FC" AC_LANG_POP ])# _LT_LANG_FC_CONFIG # _LT_LANG_GCJ_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Java Compiler compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_GCJ_CONFIG], [AC_REQUIRE([LT_PROG_GCJ])dnl AC_LANG_SAVE # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GCJ-"gcj"} CFLAGS=$GCJFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)=$LD _LT_CC_BASENAME([$compiler]) # GCJ did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GCJ_CONFIG # _LT_LANG_GO_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Go compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_GO_CONFIG], [AC_REQUIRE([LT_PROG_GO])dnl AC_LANG_SAVE # Source file extension for Go test sources. ac_ext=go # Object file extension for compiled Go test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="package main; func main() { }" # Code to be used in simple link tests lt_simple_link_test_code='package main; func main() { }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GOC-"gccgo"} CFLAGS=$GOFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)=$LD _LT_CC_BASENAME([$compiler]) # Go did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GO_CONFIG # _LT_LANG_RC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for the Windows resource compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_RC_CONFIG], [AC_REQUIRE([LT_PROG_RC])dnl AC_LANG_SAVE # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }' # Code to be used in simple link tests lt_simple_link_test_code=$lt_simple_compile_test_code # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC= CC=${RC-"windres"} CFLAGS= compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes if test -n "$compiler"; then : _LT_CONFIG($1) fi GCC=$lt_save_GCC AC_LANG_RESTORE CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_RC_CONFIG # LT_PROG_GCJ # ----------- AC_DEFUN([LT_PROG_GCJ], [m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ], [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ], [AC_CHECK_TOOL(GCJ, gcj,) test set = "${GCJFLAGS+set}" || GCJFLAGS="-g -O2" AC_SUBST(GCJFLAGS)])])[]dnl ]) # Old name: AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_GCJ], []) # LT_PROG_GO # ---------- AC_DEFUN([LT_PROG_GO], [AC_CHECK_TOOL(GOC, gccgo,) ]) # LT_PROG_RC # ---------- AC_DEFUN([LT_PROG_RC], [AC_CHECK_TOOL(RC, windres,) ]) # Old name: AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_RC], []) # _LT_DECL_EGREP # -------------- # If we don't have a new enough Autoconf to choose the best grep # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_EGREP], [AC_REQUIRE([AC_PROG_EGREP])dnl AC_REQUIRE([AC_PROG_FGREP])dnl test -z "$GREP" && GREP=grep _LT_DECL([], [GREP], [1], [A grep program that handles long lines]) _LT_DECL([], [EGREP], [1], [An ERE matcher]) _LT_DECL([], [FGREP], [1], [A literal string matcher]) dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too AC_SUBST([GREP]) ]) # _LT_DECL_OBJDUMP # -------------- # If we don't have a new enough Autoconf to choose the best objdump # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_OBJDUMP], [AC_CHECK_TOOL(OBJDUMP, objdump, false) test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [An object symbol dumper]) AC_SUBST([OBJDUMP]) ]) # _LT_DECL_DLLTOOL # ---------------- # Ensure DLLTOOL variable is set. m4_defun([_LT_DECL_DLLTOOL], [AC_CHECK_TOOL(DLLTOOL, dlltool, false) test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program]) AC_SUBST([DLLTOOL]) ]) # _LT_DECL_SED # ------------ # Check for a fully-functional sed program, that truncates # as few characters as possible. Prefer GNU sed if found. m4_defun([_LT_DECL_SED], [AC_PROG_SED test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" _LT_DECL([], [SED], [1], [A sed program that does not truncate output]) _LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"], [Sed that helps us avoid accidentally triggering echo(1) options like -n]) ])# _LT_DECL_SED m4_ifndef([AC_PROG_SED], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_SED. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_SED], [AC_MSG_CHECKING([for a sed that does not truncate output]) AC_CACHE_VAL(lt_cv_path_SED, [# Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done IFS=$as_save_IFS lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f "$lt_ac_sed" && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test 10 -lt "$lt_ac_count" && break lt_ac_count=`expr $lt_ac_count + 1` if test "$lt_ac_count" -gt "$lt_ac_max"; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done ]) SED=$lt_cv_path_SED AC_SUBST([SED]) AC_MSG_RESULT([$SED]) ])#AC_PROG_SED ])#m4_ifndef # Old name: AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_SED], []) # _LT_CHECK_SHELL_FEATURES # ------------------------ # Find out whether the shell is Bourne or XSI compatible, # or has some other useful features. m4_defun([_LT_CHECK_SHELL_FEATURES], [if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi _LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac _LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl _LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl ])# _LT_CHECK_SHELL_FEATURES # _LT_PATH_CONVERSION_FUNCTIONS # ----------------------------- # Determine what file name conversion functions should be used by # func_to_host_file (and, implicitly, by func_to_host_path). These are needed # for certain cross-compile configurations and native mingw. m4_defun([_LT_PATH_CONVERSION_FUNCTIONS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_MSG_CHECKING([how to convert $build file names to $host format]) AC_CACHE_VAL(lt_cv_to_host_file_cmd, [case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac ]) to_host_file_cmd=$lt_cv_to_host_file_cmd AC_MSG_RESULT([$lt_cv_to_host_file_cmd]) _LT_DECL([to_host_file_cmd], [lt_cv_to_host_file_cmd], [0], [convert $build file names to $host format])dnl AC_MSG_CHECKING([how to convert $build file names to toolchain format]) AC_CACHE_VAL(lt_cv_to_tool_file_cmd, [#assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac ]) to_tool_file_cmd=$lt_cv_to_tool_file_cmd AC_MSG_RESULT([$lt_cv_to_tool_file_cmd]) _LT_DECL([to_tool_file_cmd], [lt_cv_to_tool_file_cmd], [0], [convert $build files to toolchain format])dnl ])# _LT_PATH_CONVERSION_FUNCTIONS cloog-0.18.2/m4/ax_submodule.m40000664000175000017500000000316012254312305013076 00000000000000AC_DEFUN([AX_SUBMODULE], [ AC_ARG_WITH($1, [AS_HELP_STRING([--with-$1=$2], [Which $1 to use])]) case "system" in $2) AC_ARG_WITH($1_prefix, [AS_HELP_STRING([--with-$1-prefix=DIR], [Prefix of $1 installation])]) AC_ARG_WITH($1_exec_prefix, [AS_HELP_STRING([--with-$1-exec-prefix=DIR], [Exec prefix of $1 installation])]) esac case "build" in $2) AC_ARG_WITH($1_builddir, [AS_HELP_STRING([--with-$1-builddir=DIR], [Location of $1 builddir])]) esac if test "x$with_$1_prefix" != "x" -a "x$with_$1_exec_prefix" = "x"; then with_$1_exec_prefix=$with_$1_prefix fi if test "x$with_$1_prefix" != "x" -o "x$with_$1_exec_prefix" != "x"; then if test "x$with_$1" != "x" -a "x$with_$1" != "xsystem"; then AC_MSG_ERROR([Setting $with_$1_prefix implies use of system $1]) fi with_$1="system" fi if test "x$with_$1_builddir" != "x"; then if test "x$with_$1" != "x" -a "x$with_$1" != "xbuild"; then AC_MSG_ERROR([Setting $with_$1_builddir implies use of build $1]) fi with_$1="build" $1_srcdir=`echo @abs_srcdir@ | $with_$1_builddir/config.status --file=-` AC_MSG_NOTICE($1 sources in $$1_srcdir) fi case "$with_$1" in $2) ;; *) if test -d $srcdir/.git -a \ -d $srcdir/$1 -a \ ! -d $srcdir/$1/.git; then AC_MSG_WARN( [git repo detected, but submodule $1 not initialized]) AC_MSG_WARN([You may want to run]) AC_MSG_WARN([ git submodule init]) AC_MSG_WARN([ git submodule update]) AC_MSG_WARN([ sh autogen.sh]) fi if test -f $srcdir/$1/configure -a "$3" != "no"; then with_$1="bundled" else with_$1="$3" fi ;; esac AC_MSG_CHECKING([which $1 to use]) AC_MSG_RESULT($with_$1) ]) cloog-0.18.2/m4/ltoptions.m40000644000175000017500000002775312254313265012464 00000000000000# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004-2005, 2007-2009, 2011-2013 Free Software # Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 8 ltoptions.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) # _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) # ------------------------------------------ m4_define([_LT_MANGLE_OPTION], [[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) # _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) # --------------------------------------- # Set option OPTION-NAME for macro MACRO-NAME, and if there is a # matching handler defined, dispatch to it. Other OPTION-NAMEs are # saved as a flag. m4_define([_LT_SET_OPTION], [m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), _LT_MANGLE_DEFUN([$1], [$2]), [m4_warning([Unknown $1 option '$2'])])[]dnl ]) # _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) # ------------------------------------------------------------ # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. m4_define([_LT_IF_OPTION], [m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) # _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) # ------------------------------------------------------- # Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME # are set. m4_define([_LT_UNLESS_OPTIONS], [m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), [m4_define([$0_found])])])[]dnl m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 ])[]dnl ]) # _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) # ---------------------------------------- # OPTION-LIST is a space-separated list of Libtool options associated # with MACRO-NAME. If any OPTION has a matching handler declared with # LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about # the unknown option and exit. m4_defun([_LT_SET_OPTIONS], [# Set options m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [_LT_SET_OPTION([$1], _LT_Option)]) m4_if([$1],[LT_INIT],[ dnl dnl Simply set some default values (i.e off) if boolean options were not dnl specified: _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no ]) _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no ]) dnl dnl If no reference was made to various pairs of opposing options, then dnl we run the default mode handler for the pair. For example, if neither dnl 'shared' nor 'disable-shared' was passed, we enable building of shared dnl archives by default: _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], [_LT_ENABLE_FAST_INSTALL]) ]) ])# _LT_SET_OPTIONS ## --------------------------------- ## ## Macros to handle LT_INIT options. ## ## --------------------------------- ## # _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) # ----------------------------------------- m4_define([_LT_MANGLE_DEFUN], [[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) # LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) # ----------------------------------------------- m4_define([LT_OPTION_DEFINE], [m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl ])# LT_OPTION_DEFINE # dlopen # ------ LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes ]) AU_DEFUN([AC_LIBTOOL_DLOPEN], [_LT_SET_OPTION([LT_INIT], [dlopen]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'dlopen' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) # win32-dll # --------- # Declare package support for building win32 dll's. LT_OPTION_DEFINE([LT_INIT], [win32-dll], [enable_win32_dll=yes case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*) AC_CHECK_TOOL(AS, as, false) AC_CHECK_TOOL(DLLTOOL, dlltool, false) AC_CHECK_TOOL(OBJDUMP, objdump, false) ;; esac test -z "$AS" && AS=as _LT_DECL([], [AS], [1], [Assembler program])dnl test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl ])# win32-dll AU_DEFUN([AC_LIBTOOL_WIN32_DLL], [AC_REQUIRE([AC_CANONICAL_HOST])dnl _LT_SET_OPTION([LT_INIT], [win32-dll]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'win32-dll' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) # _LT_ENABLE_SHARED([DEFAULT]) # ---------------------------- # implement the --enable-shared flag, and supports the 'shared' and # 'disable-shared' LT_INIT options. # DEFAULT is either 'yes' or 'no'. If omitted, it defaults to 'yes'. m4_define([_LT_ENABLE_SHARED], [m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([shared], [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], [build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS=$lt_save_ifs ;; esac], [enable_shared=]_LT_ENABLE_SHARED_DEFAULT) _LT_DECL([build_libtool_libs], [enable_shared], [0], [Whether or not to build shared libraries]) ])# _LT_ENABLE_SHARED LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) # Old names: AC_DEFUN([AC_ENABLE_SHARED], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) ]) AC_DEFUN([AC_DISABLE_SHARED], [_LT_SET_OPTION([LT_INIT], [disable-shared]) ]) AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_SHARED], []) dnl AC_DEFUN([AM_DISABLE_SHARED], []) # _LT_ENABLE_STATIC([DEFAULT]) # ---------------------------- # implement the --enable-static flag, and support the 'static' and # 'disable-static' LT_INIT options. # DEFAULT is either 'yes' or 'no'. If omitted, it defaults to 'yes'. m4_define([_LT_ENABLE_STATIC], [m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([static], [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], [build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS=$lt_save_ifs ;; esac], [enable_static=]_LT_ENABLE_STATIC_DEFAULT) _LT_DECL([build_old_libs], [enable_static], [0], [Whether or not to build static libraries]) ])# _LT_ENABLE_STATIC LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) # Old names: AC_DEFUN([AC_ENABLE_STATIC], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) ]) AC_DEFUN([AC_DISABLE_STATIC], [_LT_SET_OPTION([LT_INIT], [disable-static]) ]) AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_STATIC], []) dnl AC_DEFUN([AM_DISABLE_STATIC], []) # _LT_ENABLE_FAST_INSTALL([DEFAULT]) # ---------------------------------- # implement the --enable-fast-install flag, and support the 'fast-install' # and 'disable-fast-install' LT_INIT options. # DEFAULT is either 'yes' or 'no'. If omitted, it defaults to 'yes'. m4_define([_LT_ENABLE_FAST_INSTALL], [m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([fast-install], [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS=$lt_save_ifs ;; esac], [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) _LT_DECL([fast_install], [enable_fast_install], [0], [Whether or not to optimize for fast installation])dnl ])# _LT_ENABLE_FAST_INSTALL LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) # Old names: AU_DEFUN([AC_ENABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'fast-install' option into LT_INIT's first parameter.]) ]) AU_DEFUN([AC_DISABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], [disable-fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'disable-fast-install' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) # _LT_WITH_PIC([MODE]) # -------------------- # implement the --with-pic flag, and support the 'pic-only' and 'no-pic' # LT_INIT options. # MODE is either 'yes' or 'no'. If omitted, it defaults to 'both'. m4_define([_LT_WITH_PIC], [AC_ARG_WITH([pic], [AS_HELP_STRING([--with-pic@<:@=PKGS@:>@], [try to use only PIC/non-PIC objects @<:@default=use both@:>@])], [lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for lt_pkg in $withval; do IFS=$lt_save_ifs if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS=$lt_save_ifs ;; esac], [pic_mode=m4_default([$1], [default])]) _LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl ])# _LT_WITH_PIC LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) # Old name: AU_DEFUN([AC_LIBTOOL_PICMODE], [_LT_SET_OPTION([LT_INIT], [pic-only]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'pic-only' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) ## ----------------- ## ## LTDL_INIT Options ## ## ----------------- ## m4_define([_LTDL_MODE], []) LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], [m4_define([_LTDL_MODE], [nonrecursive])]) LT_OPTION_DEFINE([LTDL_INIT], [recursive], [m4_define([_LTDL_MODE], [recursive])]) LT_OPTION_DEFINE([LTDL_INIT], [subproject], [m4_define([_LTDL_MODE], [subproject])]) m4_define([_LTDL_TYPE], []) LT_OPTION_DEFINE([LTDL_INIT], [installable], [m4_define([_LTDL_TYPE], [installable])]) LT_OPTION_DEFINE([LTDL_INIT], [convenience], [m4_define([_LTDL_TYPE], [convenience])]) cloog-0.18.2/m4/ax_gcc_x86_cpuid.m40000664000175000017500000000634312254312305013532 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_gcc_x86_cpuid.html # =========================================================================== # # SYNOPSIS # # AX_GCC_X86_CPUID(OP) # # DESCRIPTION # # On Pentium and later x86 processors, with gcc or a compiler that has a # compatible syntax for inline assembly instructions, run a small program # that executes the cpuid instruction with input OP. This can be used to # detect the CPU type. # # On output, the values of the eax, ebx, ecx, and edx registers are stored # as hexadecimal strings as "eax:ebx:ecx:edx" in the cache variable # ax_cv_gcc_x86_cpuid_OP. # # If the cpuid instruction fails (because you are running a # cross-compiler, or because you are not using gcc, or because you are on # a processor that doesn't have this instruction), ax_cv_gcc_x86_cpuid_OP # is set to the string "unknown". # # This macro mainly exists to be used in AX_GCC_ARCHFLAG. # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_GCC_X86_CPUID], [AC_REQUIRE([AC_PROG_CC]) AC_LANG_PUSH([C]) AC_CACHE_CHECK(for x86 cpuid $1 output, ax_cv_gcc_x86_cpuid_$1, [AC_RUN_IFELSE([AC_LANG_PROGRAM([#include ], [ int op = $1, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ])], [ax_cv_gcc_x86_cpuid_$1=`cat conftest_cpuid`; rm -f conftest_cpuid], [ax_cv_gcc_x86_cpuid_$1=unknown; rm -f conftest_cpuid], [ax_cv_gcc_x86_cpuid_$1=unknown])]) AC_LANG_POP([C]) ]) cloog-0.18.2/m4/ax_create_pkgconfig_info.m40000664000175000017500000003420112254312305015404 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_create_pkgconfig_info.html # =========================================================================== # # SYNOPSIS # # AX_CREATE_PKGCONFIG_INFO [(outputfile, [requires [,libs [,summary [,cflags [, ldflags]]]]])] # # DESCRIPTION # # Defaults: # # $1 = $PACKAGE_NAME.pc # $2 = (empty) # $3 = $PACKAGE_LIBS $LIBS (as set at that point in configure.ac) # $4 = $PACKAGE_SUMMARY (or $1 Library) # $5 = $CPPFLAGS $PACKAGE_CFLAGS (as set at the point in configure.ac) # $6 = $LDFLAGS $PACKAGE_LDFLAGS (as set at the point in configure.ac) # # PACKAGE_NAME defaults to $PACKAGE if not set. # PACKAGE_LIBS defaults to -l$PACKAGE_NAME if not set. # # The resulting file is called $PACKAGE.pc.in / $PACKAGE.pc # # You will find this macro most useful in conjunction with # ax_spec_defaults that can read good initializers from the .spec file. In # consequencd, most of the generatable installable stuff can be made from # information being updated in a single place for the whole project. # # LICENSE # # Copyright (c) 2008 Guido U. Draheim # Copyright (c) 2008 Sven Verdoolaege # # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation; either version 2 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_CREATE_PKGCONFIG_INFO],[dnl AS_VAR_PUSHDEF([PKGCONFIG_suffix],[ax_create_pkgconfig_suffix])dnl AS_VAR_PUSHDEF([PKGCONFIG_libdir],[ax_create_pkgconfig_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_libfile],[ax_create_pkgconfig_libfile])dnl AS_VAR_PUSHDEF([PKGCONFIG_libname],[ax_create_pkgconfig_libname])dnl AS_VAR_PUSHDEF([PKGCONFIG_version],[ax_create_pkgconfig_version])dnl AS_VAR_PUSHDEF([PKGCONFIG_description],[ax_create_pkgconfig_description])dnl AS_VAR_PUSHDEF([PKGCONFIG_requires],[ax_create_pkgconfig_requires])dnl AS_VAR_PUSHDEF([PKGCONFIG_pkglibs],[ax_create_pkgconfig_pkglibs])dnl AS_VAR_PUSHDEF([PKGCONFIG_libs],[ax_create_pkgconfig_libs])dnl AS_VAR_PUSHDEF([PKGCONFIG_ldflags],[ax_create_pkgconfig_ldflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_cppflags],[ax_create_pkgconfig_cppflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_generate],[ax_create_pkgconfig_generate])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_libdir],[ax_create_pkgconfig_src_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_headers],[ax_create_pkgconfig_src_headers])dnl # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' AC_MSG_CHECKING(our pkgconfig libname) test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="ifelse($1,,${PACKAGE_NAME},`basename $1 .pc`)" test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="$PACKAGE" PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` AC_MSG_RESULT($PKGCONFIG_libname) AC_MSG_CHECKING(our pkgconfig version) test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="${PACKAGE_VERSION}" test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="$VERSION" PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` AC_MSG_RESULT($PKGCONFIG_version) AC_MSG_CHECKING(our pkgconfig_libdir) test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' PKGCONFIG_libdir=`eval echo "$pkgconfig_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` AC_MSG_RESULT($pkgconfig_libdir) test "$pkgconfig_libdir" != "$PKGCONFIG_libdir" && ( AC_MSG_RESULT(expanded our pkgconfig_libdir... $PKGCONFIG_libdir)) AC_SUBST([pkgconfig_libdir]) AC_MSG_CHECKING(our pkgconfig_libfile) test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="ifelse($1,,$PKGCONFIG_libname.pc,`basename $1`)" PKGCONFIG_libfile=`eval echo "$pkgconfig_libfile"` PKGCONFIG_libfile=`eval echo "$PKGCONFIG_libfile"` AC_MSG_RESULT($pkgconfig_libfile) test "$pkgconfig_libfile" != "$PKGCONFIG_libfile" && ( AC_MSG_RESULT(expanded our pkgconfig_libfile... $PKGCONFIG_libfile)) AC_SUBST([pkgconfig_libfile]) AC_MSG_CHECKING(our package / suffix) PKGCONFIG_suffix="$program_suffix" test ".$PKGCONFIG_suffix" != .NONE || PKGCONFIG_suffix="" AC_MSG_RESULT(${PACKAGE_NAME} / ${PKGCONFIG_suffix}) AC_MSG_CHECKING(our pkgconfig description) PKGCONFIG_description="ifelse($4,,$PACKAGE_SUMMARY,$4)" test ".$PKGCONFIG_description" != "." || \ PKGCONFIG_description="$PKGCONFIG_libname Library" PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` AC_MSG_RESULT($PKGCONFIG_description) AC_MSG_CHECKING(our pkgconfig requires) PKGCONFIG_requires="ifelse($2,,$PACKAGE_REQUIRES,$2)" PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` AC_MSG_RESULT($PKGCONFIG_requires) AC_MSG_CHECKING(our pkgconfig ext libs) PKGCONFIG_pkglibs="$PACKAGE_LIBS" test ".$PKGCONFIG_pkglibs" != "." || PKGCONFIG_pkglibs="-l$PKGCONFIG_libname" PKGCONFIG_libs="ifelse($3,,$PKGCONFIG_pkglibs $LIBS,$3)" PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` AC_MSG_RESULT($PKGCONFIG_libs) AC_MSG_CHECKING(our pkgconfig cppflags) PKGCONFIG_cppflags="ifelse($5,,$CPPFLAGS $PACKAGE_CFLAGS,$5)" PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` AC_MSG_RESULT($PKGCONFIG_cppflags) AC_MSG_CHECKING(our pkgconfig ldflags) PKGCONFIG_ldflags="ifelse($6,,$LDFLAGS $PACKAGE_LDFLAGS,$5)" PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` AC_MSG_RESULT($PKGCONFIG_ldflags) test ".$PKGCONFIG_generate" != "." || \ PKGCONFIG_generate="ifelse($1,,$PKGCONFIG_libname.pc,$1)" PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` test "$pkgconfig_libfile" != "$PKGCONFIG_generate" && ( AC_MSG_RESULT(generate the pkgconfig later... $PKGCONFIG_generate)) if test ".$PKGCONFIG_src_libdir" = "." ; then PKGCONFIG_src_libdir=`pwd` PKGCONFIG_src_libdir=`AS_DIRNAME("$PKGCONFIG_src_libdir/$PKGCONFIG_generate")` test ! -d $PKGCONFIG_src_libdir/src || \ PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/src" case ".$objdir" in *libs) PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/$objdir" ;; esac AC_MSG_RESULT(noninstalled pkgconfig -L $PKGCONFIG_src_libdir) fi if test ".$PKGCONFIG_src_headers" = "." ; then PKGCONFIG_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) PKGCONFIG_src_headers="" ;; esac PKGCONFIG_src_headers=`AS_DIRNAME("$PKGCONFIG_src_headers/$v/x")` test ! -d $PKGCONFIG_src_headers/incl[]ude || \ PKGCONFIG_src_headers="$PKGCONFIG_src_headers/incl[]ude" AC_MSG_RESULT(noninstalled pkgconfig -I $PKGCONFIG_src_headers) fi dnl AC_CONFIG_COMMANDS crap disallows to use $PKGCONFIG_libfile here... AC_CONFIG_COMMANDS([$ax_create_pkgconfig_generate],[ pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then AC_MSG_NOTICE(creating $pkgconfig_generate.in) cat > $pkgconfig_generate.in <conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then AC_MSG_ERROR([$pkgconfig_generate is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ],[ dnl AC_CONFIG_COMMANDS crap, the AS_PUSHVAR defines are invalid here... ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' ])dnl AS_VAR_POPDEF([PKGCONFIG_suffix])dnl AS_VAR_POPDEF([PKGCONFIG_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_libfile])dnl AS_VAR_POPDEF([PKGCONFIG_libname])dnl AS_VAR_POPDEF([PKGCONFIG_version])dnl AS_VAR_POPDEF([PKGCONFIG_description])dnl AS_VAR_POPDEF([PKGCONFIG_requires])dnl AS_VAR_POPDEF([PKGCONFIG_pkglibs])dnl AS_VAR_POPDEF([PKGCONFIG_libs])dnl AS_VAR_POPDEF([PKGCONFIG_ldflags])dnl AS_VAR_POPDEF([PKGCONFIG_cppflags])dnl AS_VAR_POPDEF([PKGCONFIG_generate])dnl AS_VAR_POPDEF([PKGCONFIG_src_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_src_headers])dnl ]) cloog-0.18.2/m4/ax_gcc_archflag.m40000664000175000017500000002141412254312305013464 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_gcc_archflag.html # =========================================================================== # # SYNOPSIS # # AX_GCC_ARCHFLAG([PORTABLE?], [ACTION-SUCCESS], [ACTION-FAILURE]) # # DESCRIPTION # # This macro tries to guess the "native" arch corresponding to the target # architecture for use with gcc's -march=arch or -mtune=arch flags. If # found, the cache variable $ax_cv_gcc_archflag is set to this flag and # ACTION-SUCCESS is executed; otherwise $ax_cv_gcc_archflag is is set to # "unknown" and ACTION-FAILURE is executed. The default ACTION-SUCCESS is # to add $ax_cv_gcc_archflag to the end of $CFLAGS. # # PORTABLE? should be either [yes] (default) or [no]. In the former case, # the flag is set to -mtune (or equivalent) so that the architecture is # only used for tuning, but the instruction set used is still portable. In # the latter case, the flag is set to -march (or equivalent) so that # architecture-specific instructions are enabled. # # The user can specify --with-gcc-arch= in order to override the # macro's choice of architecture, or --without-gcc-arch to disable this. # # When cross-compiling, or if $CC is not gcc, then ACTION-FAILURE is # called unless the user specified --with-gcc-arch manually. # # Requires macros: AX_CHECK_COMPILER_FLAGS, AX_GCC_X86_CPUID # # (The main emphasis here is on recent CPUs, on the principle that doing # high-performance computing on old hardware is uncommon.) # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_GCC_ARCHFLAG], [AC_REQUIRE([AC_PROG_CC]) AC_REQUIRE([AC_CANONICAL_HOST]) AC_ARG_WITH(gcc-arch, [AC_HELP_STRING([--with-gcc-arch=], [use architecture for gcc -march/-mtune, instead of guessing])], ax_gcc_arch=$withval, ax_gcc_arch=yes) AC_MSG_CHECKING([for gcc architecture flag]) AC_MSG_RESULT([]) AC_CACHE_VAL(ax_cv_gcc_archflag, [ ax_cv_gcc_archflag="unknown" if test "$GCC" = yes; then if test "x$ax_gcc_arch" = xyes; then ax_gcc_arch="" if test "$cross_compiling" = no; then case $host_cpu in i[[3456]]86*|x86_64*) # use cpuid codes, in part from x86info-1.7 by D. Jones AX_GCC_X86_CPUID(0) AX_GCC_X86_CPUID(1) case $ax_cv_gcc_x86_cpuid_0 in *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *5[[48]]?:*:*:*) ax_gcc_arch="pentium-mmx pentium" ;; *5??:*:*:*) ax_gcc_arch=pentium ;; *6[[3456]]?:*:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[[01]]:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[[234]]:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6[[9d]]?:*:*:*) ax_gcc_arch="pentium-m pentium3 pentiumpro" ;; *6[[78b]]?:*:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6??:*:*:*) ax_gcc_arch=pentiumpro ;; *f3[[347]]:*:*:*|*f4[1347]:*:*:*) case $host_cpu in x86_64*) ax_gcc_arch="nocona pentium4 pentiumpro" ;; *) ax_gcc_arch="prescott pentium4 pentiumpro" ;; esac ;; *f??:*:*:*) ax_gcc_arch="pentium4 pentiumpro";; esac ;; *:68747541:*:*) # AMD case $ax_cv_gcc_x86_cpuid_1 in *5[[67]]?:*:*:*) ax_gcc_arch=k6 ;; *5[[8d]]?:*:*:*) ax_gcc_arch="k6-2 k6" ;; *5[[9]]?:*:*:*) ax_gcc_arch="k6-3 k6" ;; *60?:*:*:*) ax_gcc_arch=k7 ;; *6[[12]]?:*:*:*) ax_gcc_arch="athlon k7" ;; *6[[34]]?:*:*:*) ax_gcc_arch="athlon-tbird k7" ;; *67?:*:*:*) ax_gcc_arch="athlon-4 athlon k7" ;; *6[[68a]]?:*:*:*) AX_GCC_X86_CPUID(0x80000006) # L2 cache size case $ax_cv_gcc_x86_cpuid_0x80000006 in *:*:*[[1-9a-f]]??????:*) # (L2 = ecx >> 16) >= 256 ax_gcc_arch="athlon-xp athlon-4 athlon k7" ;; *) ax_gcc_arch="athlon-4 athlon k7" ;; esac ;; *f[[4cef8b]]?:*:*:*) ax_gcc_arch="athlon64 k8" ;; *f5?:*:*:*) ax_gcc_arch="opteron k8" ;; *f7?:*:*:*) ax_gcc_arch="athlon-fx opteron k8" ;; *f??:*:*:*) ax_gcc_arch="k8" ;; esac ;; *:746e6543:*:*) # IDT case $ax_cv_gcc_x86_cpuid_1 in *54?:*:*:*) ax_gcc_arch=winchip-c6 ;; *58?:*:*:*) ax_gcc_arch=winchip2 ;; *6[[78]]?:*:*:*) ax_gcc_arch=c3 ;; *69?:*:*:*) ax_gcc_arch="c3-2 c3" ;; esac ;; esac if test x"$ax_gcc_arch" = x; then # fallback case $host_cpu in i586*) ax_gcc_arch=pentium ;; i686*) ax_gcc_arch=pentiumpro ;; esac fi ;; sparc*) AC_PATH_PROG([PRTDIAG], [prtdiag], [prtdiag], [$PATH:/usr/platform/`uname -i`/sbin/:/usr/platform/`uname -m`/sbin/]) cputype=`(((grep cpu /proc/cpuinfo | cut -d: -f2) ; ($PRTDIAG -v |grep -i sparc) ; grep -i cpu /var/run/dmesg.boot ) | head -n 1) 2> /dev/null` cputype=`echo "$cputype" | tr -d ' -' |tr $as_cr_LETTERS $as_cr_letters` case $cputype in *ultrasparciv*) ax_gcc_arch="ultrasparc4 ultrasparc3 ultrasparc v9" ;; *ultrasparciii*) ax_gcc_arch="ultrasparc3 ultrasparc v9" ;; *ultrasparc*) ax_gcc_arch="ultrasparc v9" ;; *supersparc*|*tms390z5[[05]]*) ax_gcc_arch="supersparc v8" ;; *hypersparc*|*rt62[[056]]*) ax_gcc_arch="hypersparc v8" ;; *cypress*) ax_gcc_arch=cypress ;; esac ;; alphaev5) ax_gcc_arch=ev5 ;; alphaev56) ax_gcc_arch=ev56 ;; alphapca56) ax_gcc_arch="pca56 ev56" ;; alphapca57) ax_gcc_arch="pca57 pca56 ev56" ;; alphaev6) ax_gcc_arch=ev6 ;; alphaev67) ax_gcc_arch=ev67 ;; alphaev68) ax_gcc_arch="ev68 ev67" ;; alphaev69) ax_gcc_arch="ev69 ev68 ev67" ;; alphaev7) ax_gcc_arch="ev7 ev69 ev68 ev67" ;; alphaev79) ax_gcc_arch="ev79 ev7 ev69 ev68 ev67" ;; powerpc*) cputype=`((grep cpu /proc/cpuinfo | head -n 1 | cut -d: -f2 | cut -d, -f1 | sed 's/ //g') ; /usr/bin/machine ; /bin/machine; grep CPU /var/run/dmesg.boot | head -n 1 | cut -d" " -f2) 2> /dev/null` cputype=`echo $cputype | sed -e 's/ppc//g;s/ *//g'` case $cputype in *750*) ax_gcc_arch="750 G3" ;; *740[[0-9]]*) ax_gcc_arch="$cputype 7400 G4" ;; *74[[4-5]][[0-9]]*) ax_gcc_arch="$cputype 7450 G4" ;; *74[[0-9]][[0-9]]*) ax_gcc_arch="$cputype G4" ;; *970*) ax_gcc_arch="970 G5 power4";; *POWER4*|*power4*|*gq*) ax_gcc_arch="power4 970";; *POWER5*|*power5*|*gr*|*gs*) ax_gcc_arch="power5 power4 970";; 603ev|8240) ax_gcc_arch="$cputype 603e 603";; *) ax_gcc_arch=$cputype ;; esac ax_gcc_arch="$ax_gcc_arch powerpc" ;; esac fi # not cross-compiling fi # guess arch if test "x$ax_gcc_arch" != x -a "x$ax_gcc_arch" != xno; then for arch in $ax_gcc_arch; do if test "x[]m4_default([$1],yes)" = xyes; then # if we require portable code flags="-mtune=$arch" # -mcpu=$arch and m$arch generate nonportable code on every arch except # x86. And some other arches (e.g. Alpha) don't accept -mtune. Grrr. case $host_cpu in i*86|x86_64*) flags="$flags -mcpu=$arch -m$arch";; esac else flags="-march=$arch -mcpu=$arch -m$arch" fi for flag in $flags; do AX_CHECK_COMPILER_FLAGS($flag, [ax_cv_gcc_archflag=$flag; break]) done test "x$ax_cv_gcc_archflag" = xunknown || break done fi fi # $GCC=yes ]) AC_MSG_CHECKING([for gcc architecture flag]) AC_MSG_RESULT($ax_cv_gcc_archflag) if test "x$ax_cv_gcc_archflag" = xunknown; then m4_default([$3],:) else m4_default([$2], [CFLAGS="$CFLAGS $ax_cv_gcc_archflag"]) fi ]) cloog-0.18.2/m4/ax_check_compiler_flags.m40000664000175000017500000000632312254312305015226 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_check_compiler_flags.html # =========================================================================== # # SYNOPSIS # # AX_CHECK_COMPILER_FLAGS(FLAGS, [ACTION-SUCCESS], [ACTION-FAILURE]) # # DESCRIPTION # # Check whether the given compiler FLAGS work with the current language's # compiler, or whether they give an error. (Warnings, however, are # ignored.) # # ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on # success/failure. # # LICENSE # # Copyright (c) 2009 Steven G. Johnson # Copyright (c) 2009 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_CHECK_COMPILER_FLAGS], [AC_PREREQ(2.59) dnl for _AC_LANG_PREFIX AC_MSG_CHECKING([whether _AC_LANG compiler accepts $1]) dnl Some hackery here since AC_CACHE_VAL can't handle a non-literal varname: AS_LITERAL_IF([$1], [AC_CACHE_VAL(AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1]), [ ax_save_FLAGS=$[]_AC_LANG_PREFIX[]FLAGS _AC_LANG_PREFIX[]FLAGS="$1" AC_COMPILE_IFELSE([AC_LANG_PROGRAM()], AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=yes, AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=no) _AC_LANG_PREFIX[]FLAGS=$ax_save_FLAGS])], [ax_save_FLAGS=$[]_AC_LANG_PREFIX[]FLAGS _AC_LANG_PREFIX[]FLAGS="$1" AC_COMPILE_IFELSE([AC_LANG_PROGRAM()], eval AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=yes, eval AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=no) _AC_LANG_PREFIX[]FLAGS=$ax_save_FLAGS]) eval ax_check_compiler_flags=$AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1]) AC_MSG_RESULT($ax_check_compiler_flags) if test "x$ax_check_compiler_flags" = xyes; then m4_default([$2], :) else m4_default([$3], :) fi ])dnl AX_CHECK_COMPILER_FLAGS cloog-0.18.2/m4/ltsugar.m40000644000175000017500000001044012254313265012073 00000000000000# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004-2005, 2007-2008, 2011-2013 Free Software # Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltsugar.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) # lt_join(SEP, ARG1, [ARG2...]) # ----------------------------- # Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their # associated separator. # Needed until we can rely on m4_join from Autoconf 2.62, since all earlier # versions in m4sugar had bugs. m4_define([lt_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) m4_define([_lt_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) # lt_car(LIST) # lt_cdr(LIST) # ------------ # Manipulate m4 lists. # These macros are necessary as long as will still need to support # Autoconf-2.59, which quotes differently. m4_define([lt_car], [[$1]]) m4_define([lt_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) m4_define([lt_unquote], $1) # lt_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus 'SEPARATOR''STRING'. # Note that neither SEPARATOR nor STRING are expanded; they are appended # to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). # No SEPARATOR is output if MACRO-NAME was previously undefined (different # than defined and empty). # # This macro is needed until we can rely on Autoconf 2.62, since earlier # versions of m4sugar mistakenly expanded SEPARATOR but not STRING. m4_define([lt_append], [m4_define([$1], m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) # lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) # ---------------------------------------------------------- # Produce a SEP delimited list of all paired combinations of elements of # PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list # has the form PREFIXmINFIXSUFFIXn. # Needed until we can rely on m4_combine added in Autoconf 2.62. m4_define([lt_combine], [m4_if(m4_eval([$# > 3]), [1], [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl [[m4_foreach([_Lt_prefix], [$2], [m4_foreach([_Lt_suffix], ]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[, [_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])]) # lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) # ----------------------------------------------------------------------- # Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited # by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. m4_define([lt_if_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], [lt_append([$1], [$2], [$3])$4], [$5])], [lt_append([$1], [$2], [$3])$4])]) # lt_dict_add(DICT, KEY, VALUE) # ----------------------------- m4_define([lt_dict_add], [m4_define([$1($2)], [$3])]) # lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) # -------------------------------------------- m4_define([lt_dict_add_subkey], [m4_define([$1($2:$3)], [$4])]) # lt_dict_fetch(DICT, KEY, [SUBKEY]) # ---------------------------------- m4_define([lt_dict_fetch], [m4_ifval([$3], m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) # lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------------------- m4_define([lt_if_dict_fetch], [m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], [$5], [$6])]) # lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) # -------------------------------------------------------------- m4_define([lt_dict_filter], [m4_if([$5], [], [], [lt_join(m4_quote(m4_default([$4], [[, ]])), lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl ]) cloog-0.18.2/m4/ax_cc_maxopt.m40000664000175000017500000001604612254312305013063 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_cc_maxopt.html # =========================================================================== # # SYNOPSIS # # AX_CC_MAXOPT # # DESCRIPTION # # Try to turn on "good" C optimization flags for various compilers and # architectures, for some definition of "good". (In our case, good for # FFTW and hopefully for other scientific codes. Modify as needed.) # # The user can override the flags by setting the CFLAGS environment # variable. The user can also specify --enable-portable-binary in order to # disable any optimization flags that might result in a binary that only # runs on the host architecture. # # Note also that the flags assume that ANSI C aliasing rules are followed # by the code (e.g. for gcc's -fstrict-aliasing), and that floating-point # computations can be re-ordered as needed. # # Requires macros: AX_CHECK_COMPILER_FLAGS, AX_COMPILER_VENDOR, # AX_GCC_ARCHFLAG, AX_GCC_X86_CPUID. # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_CC_MAXOPT], [ AC_REQUIRE([AC_PROG_CC]) AC_REQUIRE([AX_COMPILER_VENDOR]) AC_REQUIRE([AC_CANONICAL_HOST]) AC_ARG_ENABLE(portable-binary, [AC_HELP_STRING([--enable-portable-binary], [disable compiler optimizations that would produce unportable binaries])], acx_maxopt_portable=$withval, acx_maxopt_portable=no) # Try to determine "good" native compiler flags if none specified via CFLAGS if test "$ac_test_CFLAGS" != "set"; then CFLAGS="" case $ax_cv_c_compiler_vendor in dec) CFLAGS="-newc -w0 -O5 -ansi_alias -ansi_args -fp_reorder -tune host" if test "x$acx_maxopt_portable" = xno; then CFLAGS="$CFLAGS -arch host" fi;; sun) CFLAGS="-native -fast -xO5 -dalign" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS -xarch=generic" fi;; hp) CFLAGS="+Oall +Optrs_ansi +DSnative" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS +DAportable" fi;; ibm) if test "x$acx_maxopt_portable" = xno; then xlc_opt="-qarch=auto -qtune=auto" else xlc_opt="-qtune=auto" fi AX_CHECK_COMPILER_FLAGS($xlc_opt, CFLAGS="-O3 -qansialias -w $xlc_opt", [CFLAGS="-O3 -qansialias -w" echo "******************************************************" echo "* You seem to have the IBM C compiler. It is *" echo "* recommended for best performance that you use: *" echo "* *" echo "* CFLAGS=-O3 -qarch=xxx -qtune=xxx -qansialias -w *" echo "* ^^^ ^^^ *" echo "* where xxx is pwr2, pwr3, 604, or whatever kind of *" echo "* CPU you have. (Set the CFLAGS environment var. *" echo "* and re-run configure.) For more info, man cc. *" echo "******************************************************"]) ;; intel) CFLAGS="-O3 -ansi_alias" if test "x$acx_maxopt_portable" = xno; then icc_archflag=unknown icc_flags="" case $host_cpu in i686*|x86_64*) # icc accepts gcc assembly syntax, so these should work: AX_GCC_X86_CPUID(0) AX_GCC_X86_CPUID(1) case $ax_cv_gcc_x86_cpuid_0 in # see AX_GCC_ARCHFLAG *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *6a?:*[[234]]:*:*|*6[[789b]]?:*:*:*) icc_flags="-xK";; *f3[[347]]:*:*:*|*f4[1347]:*:*:*) icc_flags="-xP -xN -xW -xK";; *f??:*:*:*) icc_flags="-xN -xW -xK";; esac ;; esac ;; esac if test "x$icc_flags" != x; then for flag in $icc_flags; do AX_CHECK_COMPILER_FLAGS($flag, [icc_archflag=$flag; break]) done fi AC_MSG_CHECKING([for icc architecture flag]) AC_MSG_RESULT($icc_archflag) if test "x$icc_archflag" != xunknown; then CFLAGS="$CFLAGS $icc_archflag" fi fi ;; gnu) # default optimization flags for gcc on all systems CFLAGS="-O3 -fomit-frame-pointer" # -malign-double for x86 systems AX_CHECK_COMPILER_FLAGS(-malign-double, CFLAGS="$CFLAGS -malign-double") # -fstrict-aliasing for gcc-2.95+ AX_CHECK_COMPILER_FLAGS(-fstrict-aliasing, CFLAGS="$CFLAGS -fstrict-aliasing") # note that we enable "unsafe" fp optimization with other compilers, too AX_CHECK_COMPILER_FLAGS(-ffast-math, CFLAGS="$CFLAGS -ffast-math") AX_GCC_ARCHFLAG($acx_maxopt_portable) ;; esac if test -z "$CFLAGS"; then echo "" echo "********************************************************" echo "* WARNING: Don't know the best CFLAGS for this system *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "* (otherwise, a default of CFLAGS=-O3 will be used) *" echo "********************************************************" echo "" CFLAGS="-O3" fi AX_CHECK_COMPILER_FLAGS($CFLAGS, [], [ echo "" echo "********************************************************" echo "* WARNING: The guessed CFLAGS don't seem to work with *" echo "* your compiler. *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "********************************************************" echo "" CFLAGS="" ]) fi ]) cloog-0.18.2/m4/lt~obsolete.m40000644000175000017500000001377412254313265013001 00000000000000# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004-2005, 2007, 2009, 2011-2013 Free Software # Foundation, Inc. # Written by Scott James Remnant, 2004. # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 5 lt~obsolete.m4 # These exist entirely to fool aclocal when bootstrapping libtool. # # In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN), # which have later been changed to m4_define as they aren't part of the # exported API, or moved to Autoconf or Automake where they belong. # # The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN # in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us # using a macro with the same name in our local m4/libtool.m4 it'll # pull the old libtool.m4 in (it doesn't see our shiny new m4_define # and doesn't know about Autoconf macros at all.) # # So we provide this file, which has a silly filename so it's always # included after everything else. This provides aclocal with the # AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything # because those macros already exist, or will be overwritten later. # We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. # # Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. # Yes, that means every name once taken will need to remain here until # we give up compatibility with versions before 1.7, at which point # we need to keep only those names which we still refer to. # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) m4_ifndef([_LT_REQUIRED_DARWIN_CHECKS], [AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])]) m4_ifndef([_LT_AC_PROG_CXXCPP], [AC_DEFUN([_LT_AC_PROG_CXXCPP])]) m4_ifndef([_LT_PREPARE_SED_QUOTE_VARS], [AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])]) m4_ifndef([_LT_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_PROG_F77], [AC_DEFUN([_LT_PROG_F77])]) m4_ifndef([_LT_PROG_FC], [AC_DEFUN([_LT_PROG_FC])]) m4_ifndef([_LT_PROG_CXX], [AC_DEFUN([_LT_PROG_CXX])]) cloog-0.18.2/ChangeLog0000664000175000017500000000217112254312305011400 00000000000000version: 0.18.1 date: Tue Jul 2 07:32:18 PDT 2013 changes: - Update to isl 0.12.1 - Support for OpenScop column coordinates - Consistent output on different platforms version: 0.18.0 date: Thu Dec 20 17:50:41 CET 2012 changes: - Update to isl 0.11.1 - clast annotations for openmp and vectorization - statement-wise loop separation - clast traversal and node filtering support - Do not call some deprecated isl functions - Support for OpenSCoP coordinates extension version: 0.17.0 date: Mon Dec 12 00:51:44 CET 2011 changes: - Support openscop as input format - update isl backend to changes in isl 0.08 - Add CLOOG_ prefix to LANGUAGE defines in public header files - Replace cloog_union_domain_from_isl_union_set() with cloog_union_domain_from_isl_set() - Allow to build CLooG from gmp build directory - Smaller improvements version: 0.16.3 date: Wed Jul 13 18:18:19 CEST 2011 changes: - update isl backend to recent changes in isl - add support for unrolling --- version: 0.16.2 date: Sun Mar 20 15:51:13 CET 2011 changes: - update isl backend to recent changes in isl - improved output in case of stride detection cloog-0.18.2/configure.ac0000664000175000017500000002245112254313026012120 00000000000000 dnl /**-------------------------------------------------------------------** dnl ** CLooG ** dnl **-------------------------------------------------------------------** dnl ** configure.ac ** dnl **-------------------------------------------------------------------** dnl ** First version: august 7th 2002 ** dnl **-------------------------------------------------------------------**/ dnl dnl Input file for autoconf to build a configuration shellscript. dnl To build the configure script from the CLooG's top-level directory, use dnl autoconf -l autoconf autoconf/configure.in > configure dnl if it doesn't work (invalid option -l) try -I instead dnl autoconf -I autoconf autoconf/configure.in > configure dnl /************************************************************************** dnl * CLooG : the Chunky Loop Generator (experimental) * dnl *************************************************************************** dnl * * dnl * Copyright (C) 2001 Cedric Bastoul * dnl * * dnl * This library is free software; you can redistribute it and/or * dnl * modify it under the terms of the GNU Lesser General Public * dnl * License as published by the Free Software Foundation; either * dnl * version 2.1 of the License, or (at your option) any later version. * dnl * * dnl * This library is distributed in the hope that it will be useful, * dnl * but WITHOUT ANY WARRANTY; without even the implied warranty of * dnl * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * dnl * Lesser General Public License for more details. * dnl * * dnl * You should have received a copy of the GNU Lesser General Public * dnl * License along with this library; if not, write to the Free Software * dnl * Foundation, Inc., 51 Franklin Street, Fifth Floor, * dnl * Boston, MA 02110-1301 USA * dnl * * dnl * CLooG, the Chunky Loop Generator * dnl * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * dnl * * dnl ***************************************************************************/ m4_define([version_major], [0]) m4_define([version_minor], [18]) m4_define([version_revision], [2]) AC_PREREQ(2.53) AC_INIT([cloog], [version_major.version_minor.version_revision], [cloog-development@googlegroups.com]) AC_CONFIG_SRCDIR(source/cloog.c) AC_CONFIG_AUX_DIR(autoconf) AC_CONFIG_MACRO_DIR([m4]) VERSION_MAJOR=version_major VERSION_MINOR=version_minor VERSION_REVISION=version_revision AC_SUBST(versioninfo) versioninfo=4:0:0 AM_INIT_AUTOMAKE([foreign]) m4_ifdef([AM_SILENT_RULES],[AM_SILENT_RULES([yes])]) dnl /************************************************************************** dnl * Checking * dnl **************************************************************************/ dnl Checks for programs. AC_PROG_CC AC_PROG_LN_S AC_PROG_MAKE_SET AC_CHECK_PROG(CD, cd) dnl Configure needs an empty install.sh file with this, i HATE that... AC_PROG_INSTALL AC_PROG_LIBTOOL AC_CHECK_PROG(TEXI2DVI, texi2dvi, texi2dvi, []) AM_CONDITIONAL(HAVE_TEXI2DVI, test -n "$TEXI2DVI") AX_CC_MAXOPT AC_SUBST(CFLAGS_WARN) AX_CFLAGS_WARN_ALL(CFLAGS_WARN) dnl Checks for typedefs, structures, and compiler characteristics. AC_C_CONST AC_TYPE_SIZE_T dnl Checks for header files. AC_HEADER_STDC dnl Checks for library functions. AC_CHECK_FUNCS(strtol) dnl /************************************************************************** dnl * Option setting * dnl **************************************************************************/ AC_CHECK_FUNCS([getrusage], [AC_DEFINE([CLOOG_RUSAGE], [], [Print time required to generate code])]) AX_SUBMODULE(isl,no|system|build|bundled,bundled) BITS="gmp" dnl /************************************************************************** dnl * Where is GMP? * dnl **************************************************************************/ AX_SUBMODULE(gmp,system|build,system) need_get_memory_functions=false case "$with_gmp" in build) CPPFLAGS="-I$with_gmp_builddir $CPPFLAGS" LDFLAGS="-L$with_gmp_builddir/$lt_cv_objdir $LDFLAGS" ;; system) if test "x$with_gmp_prefix" != "x"; then CPPFLAGS="-I$with_gmp_prefix/include $CPPFLAGS" fi if test "$with_gmp_exec_prefix" != "yes" ; then LDFLAGS="-L$with_gmp_exec_prefix/lib $LDFLAGS" fi ;; esac case "$with_gmp" in build|system) AC_CHECK_HEADER(gmp.h, [], [AC_MSG_ERROR(Can't find gmp headers.)]) AC_CHECK_LIB(gmp, __gmpz_init, [LIBS="$LIBS -lgmp"], [AC_MSG_ERROR(Can't find gmp library.)]) AC_CHECK_DECLS(mp_get_memory_functions,[],[ need_get_memory_functions=true ],[#include ]) ;; esac AM_CONDITIONAL(NEED_GET_MEMORY_FUNCTIONS, test x$need_get_memory_functions = xtrue) dnl /************************************************************************** dnl * Where is isl? * dnl **************************************************************************/ AC_SUBST(ISL_CPPFLAGS) AC_SUBST(ISL_LDFLAGS) AC_SUBST(ISL_LIBS) case "$with_isl" in bundled) ISL_CPPFLAGS="-I$srcdir/isl/include -Iisl/include" ;; build) ISL_CPPFLAGS="-I$isl_srcdir/include -I$with_isl_builddir/include" ISL_LIBS="$with_isl_builddir/libisl.la" ;; system) if test "x$with_isl_prefix" != "x"; then ISL_CPPFLAGS="-I$with_isl_prefix/include" fi if test "x$with_isl_exec_prefix" != "x"; then ISL_LDFLAGS="-L$with_isl_exec_prefix/lib" fi ISL_LIBS="-lisl" esac AM_CONDITIONAL(BUNDLED_ISL, test $with_isl = bundled) AM_CONDITIONAL(NO_ISL, test $with_isl = no) dnl /************************************************************************** dnl * Where is the OpenScop Library? * dnl **************************************************************************/ AX_SUBMODULE(osl,no|system|build|bundled,no) osl_flag="OSL_SUPPORT" AC_SUBST(OSL_CPPFLAGS) AC_SUBST(OSL_LDFLAGS) AC_SUBST(OSL_LIBS) case "$with_osl" in bundled) OSL_CPPFLAGS="-D$osl_flag -I$srcdir/osl/include -Iosl/include" ;; build) OSL_CPPFLAGS="-D$osl_flag -I$osl_srcdir/include -I$with_osl_builddir/include" OSL_LIBS="$with_osl_builddir/libosl.la" ;; system) if test "x$with_osl_prefix" != "x"; then OSL_CPPFLAGS="-D$osl_flag -I$with_osl_prefix/include" fi if test "x$with_osl_exec_prefix" != "x"; then OSL_LDFLAGS="-L$with_osl_exec_prefix/lib" fi OSL_LIBS="-losl" esac AM_CONDITIONAL(BUNDLED_OSL, test $with_osl = bundled) AM_CONDITIONAL(NO_OSL, test $with_osl = no) AC_DEFINE([CLOOG_INT_GMP], 1, [Use arbitrary precision integers]) AC_SUBST(GIT_INDEX) if test -f $srcdir/.git/HEAD; then GIT_INDEX="\$(top_srcdir)/.git/index" fi dnl /************************************************************************** dnl * Substitutions * dnl **************************************************************************/ dnl Substitutions to do in Makefile.in. AC_SUBST(CC) AC_SUBST(LN_S) AC_SUBST(prefix) AC_SUBST(exec_prefix) AC_SUBST(INSTALL) AC_SUBST(BITS) AC_SUBST(VERSION_MAJOR) AC_SUBST(VERSION_MINOR) AC_SUBST(VERSION_REVISION) PACKAGE_NAME="cloog-isl" PACKAGE_CFLAGS="-DCLOOG_INT_GMP=1" AX_CREATE_PKGCONFIG_INFO AC_CONFIG_FILES(Makefile test/Makefile) AC_CONFIG_FILES(autoconf/Doxyfile) AC_CONFIG_FILES(doc/Makefile) AC_CONFIG_FILES(source/version.c) AC_CONFIG_FILES(include/cloog/version.h) AC_CONFIG_FILES([genversion.sh], [chmod +x genversion.sh]) AC_CONFIG_COMMANDS([version.h], [echo '#define CLOOG_HEAD "'`./genversion.sh`'"' > version.h]) AC_CONFIG_COMMANDS([doc/gitversion.texi], [echo '@set VERSION '`./genversion.sh`'' > doc/gitversion.texi]) if test $with_isl = bundled; then AC_CONFIG_SUBDIRS(isl) fi if test $with_osl = bundled; then AC_CONFIG_SUBDIRS(osl) fi AC_CONFIG_COMMANDS_POST([ ac_configure_args="$ac_configure_args $cloog_configure_args" ]) AC_OUTPUT echo " /*-----------------------------------------------*" echo " * CLooG configuration is OK *" echo " *-----------------------------------------------*/" echo "It appears that your system is OK to start CLooG compilation. You need" echo "now to type \"make\". After compilation, you should check CLooG by typing" echo "\"make check\". If no problem occur, you can type \"make uninstall\" if" echo "you are upgrading an old version. Lastly type \"make install\" to install" echo "CLooG on your system (log as root if necessary)." cloog-0.18.2/include/0000775000175000017500000000000012254314446011340 500000000000000cloog-0.18.2/include/cloog/0000775000175000017500000000000012254314446012443 500000000000000cloog-0.18.2/include/cloog/options.h0000664000175000017500000001740712254312305014230 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** options.h ** **-------------------------------------------------------------------** ** First version: april 19th 2003 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #include #ifndef CLOOG_OPTIONS_H #define CLOOG_OPTIONS_H #if defined(__cplusplus) extern "C" { #endif /* Uncomment the following line if you want some information about * maximum total allocated memory for code generation. #define CLOOG_MEMORY */ #define CLOOG_SCALARS struct osl_scop; struct cloogoptions; typedef struct cloogoptions CloogOptions; struct osl_scop; struct cloogoptions { CloogState *state; /* State. */ /* OPTIONS FOR LOOP GENERATION */ int l ; /* Last level to optimize. */ int f ; /* First level to optimize. */ int *ls; /* Last level to optimize (statement-wise). */ int *fs; /* First level to optimize (statement-wise). */ int fs_ls_size; /* Size of the fs and ls arrays (same size) */ int stop ; /* Level to stop code generation. */ int strides ; /* 1 if user wants to handle non-unit strides (then loop * increment can be something else than one), 0 otherwise. */ int sh; /* 1 for computing simple hulls */ int first_unroll; /* The first dimension to unroll */ /* OPTIONS FOR PRETTY PRINTING */ int esp ; /* 1 if user wants to spread all equalities, i.e. when there * is something like "i = 3*j + 1 ; A[i] = 0 ;" the generator * will write "A[3*j + 1] = 0 ;", 0 otherwise. */ int fsp ; /* The iteration level where equalities spreading can begin * (it might happen that the user wants not to spread values * of scattering iterators). */ int otl ; /* 1 for eliminate loops running just one time and write them * as an affectation of the iterator, 0 otherwise. */ int block ; /* 1 to make one new block {...} per new dimension, * 0 otherwise. */ int compilable; /* 1 to generate a compilable code by using * preprocessing, 0 otherwise. */ int callable; /* 1 to generate callable code by using * preprocessing, 0 otherwise. */ int language; /* 1 to generate FORTRAN, 0 for C otherwise. */ int save_domains;/* Save unsimplified copy of domain. */ /* MISC OPTIONS */ char * name ; /* Name of the input file. */ float time ; /* Time spent for code generation in seconds. */ int openscop; /* 1 if the input file has OpenScop format, 0 otherwise. */ struct osl_scop *scop; /* Input OpenScop scop if any, NULL otherwise. */ #ifdef CLOOG_MEMORY int memory ; /* Memory spent for code generation in kilobytes. */ #endif int quiet; /* Don't print any informational messages. */ /* UNDOCUMENTED OPTIONS FOR THE AUTHOR ONLY */ int leaks ; /* 1 if I want to print the allocation statistics, * 0 otherwise. */ int backtrack; /* 1 to perform backtracking in * Quillere's algorithm, 0 otherwise. */ int override ; /* 1 if I want to bypass CLooG decisions on option correctness * (generated code may be incorrect), 0 otherwise. */ int structure ; /* 1 if I want to print the CloogProgram structure before the * pretty printed code, 0 otherwise. */ int noblocks ; /* 1 if I don't want to make statement blocks, 0 otherwise. */ int noscalars ; /* 1 if I don't want to use scalar dimensions, 0 otherwise. */ int nosimplify; /* 1 if I don't want to simplify polyhedra, 0 otherwise. */ } ; /****************************************************************************** * Error reporting functions * ******************************************************************************/ enum cloog_msg_type { CLOOG_ERROR, CLOOG_WARNING, CLOOG_INFO }; void cloog_msg(CloogOptions *options, enum cloog_msg_type type, const char *msg, ...); void cloog_die(const char *msg, ...); /****************************************************************************** * Structure display function * ******************************************************************************/ void cloog_options_print(FILE *, CloogOptions *) ; /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_options_free(CloogOptions *) ; /****************************************************************************** * Reading function * ******************************************************************************/ void cloog_options_read(CloogState *state, int argc, char **argv, FILE **input, FILE **output, CloogOptions **options); /****************************************************************************** * Processing functions * ******************************************************************************/ CloogOptions *cloog_options_malloc(CloogState *state); void cloog_options_copy_from_osl_scop(struct osl_scop *, CloogOptions *); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/matrix/0000775000175000017500000000000012254314446013747 500000000000000cloog-0.18.2/include/cloog/matrix/constraintset.h0000664000175000017500000000072112254312305016730 00000000000000#ifndef CLOOG_MATRIX_CONSTRAINTSET_H #define CLOOG_MATRIX_CONSTRAINTSET_H #if defined(__cplusplus) extern "C" { #endif struct cloogconstraintset { CloogMatrix M; }; struct cloogequalities { CloogConstraintSet *constraints; int *types; }; struct cloogconstraint { CloogConstraintSet *set; cloog_int_t **line; }; CloogConstraintSet *cloog_constraint_set_from_cloog_matrix(CloogMatrix *M); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/clast.h0000664000175000017500000001116712254312305013640 00000000000000#ifndef CLOOG_CLAST_H #define CLOOG_CLAST_H #if defined(__cplusplus) extern "C" { #endif enum clast_expr_type { clast_expr_name, clast_expr_term, clast_expr_bin, clast_expr_red }; struct clast_expr { enum clast_expr_type type; }; struct clast_name { struct clast_expr expr; const char * name; }; /* Represents the term * val * var (if var != NULL) * or * val (if var == NULL) */ struct clast_term { struct clast_expr expr; cloog_int_t val; struct clast_expr *var; }; #define CLAST_PARALLEL_NOT 0 #define CLAST_PARALLEL_OMP 1 #define CLAST_PARALLEL_MPI 2 #define CLAST_PARALLEL_VEC 4 enum clast_red_type { clast_red_sum, clast_red_min, clast_red_max }; struct clast_reduction { struct clast_expr expr; enum clast_red_type type; int n; struct clast_expr* elts[1]; }; enum clast_bin_type { clast_bin_fdiv, clast_bin_cdiv, clast_bin_div, clast_bin_mod }; struct clast_binary { struct clast_expr expr; enum clast_bin_type type; struct clast_expr* LHS; cloog_int_t RHS; }; struct clast_stmt; struct clast_stmt_op { void (*free)(struct clast_stmt *); }; #define CLAST_STMT_IS_A(stmt, type) ((stmt)->op == &(type)) extern const struct clast_stmt_op stmt_root; extern const struct clast_stmt_op stmt_ass; extern const struct clast_stmt_op stmt_user; extern const struct clast_stmt_op stmt_block; extern const struct clast_stmt_op stmt_for; extern const struct clast_stmt_op stmt_guard; struct clast_stmt { const struct clast_stmt_op *op; struct clast_stmt *next; }; struct clast_root { struct clast_stmt stmt; CloogNames * names; /**< Names of iterators and parameters. */ }; struct clast_assignment { struct clast_stmt stmt; const char * LHS; struct clast_expr * RHS; }; struct clast_block { struct clast_stmt stmt; struct clast_stmt * body; }; struct clast_user_stmt { struct clast_stmt stmt; CloogDomain * domain; CloogStatement * statement; struct clast_stmt * substitutions; }; struct clast_for { struct clast_stmt stmt; CloogDomain * domain; const char * iterator; struct clast_expr * LB; struct clast_expr * UB; cloog_int_t stride; struct clast_stmt * body; int parallel; /* Comma separated list of loop private variables for OpenMP parallelization */ char *private_vars; /* Comma separated list of reduction variable/operators for OpenMP parallelization */ char *reduction_vars; }; struct clast_equation { struct clast_expr * LHS; struct clast_expr * RHS; int sign; }; struct clast_guard { struct clast_stmt stmt; struct clast_stmt * then; int n; struct clast_equation eq[1]; }; struct clast_stmt *cloog_clast_create_from_input(CloogInput *input, CloogOptions *options); struct clast_stmt *cloog_clast_create(CloogProgram *program, CloogOptions *options); void cloog_clast_free(struct clast_stmt *s); struct clast_name *new_clast_name(const char *name); struct clast_term *new_clast_term(cloog_int_t c, struct clast_expr *v); struct clast_binary *new_clast_binary(enum clast_bin_type t, struct clast_expr *lhs, cloog_int_t rhs); struct clast_reduction *new_clast_reduction(enum clast_red_type t, int n); struct clast_root *new_clast_root(CloogNames *names); struct clast_assignment *new_clast_assignment(const char *lhs, struct clast_expr *rhs); struct clast_user_stmt *new_clast_user_stmt(CloogDomain *domain, CloogStatement *stmt, struct clast_stmt *subs); struct clast_block *new_clast_block(void); struct clast_for *new_clast_for(CloogDomain *domain, const char *it, struct clast_expr *LB, struct clast_expr *UB, CloogStride *stride); struct clast_guard *new_clast_guard(int n); void free_clast_name(struct clast_name *t); void free_clast_term(struct clast_term *t); void free_clast_binary(struct clast_binary *b); void free_clast_reduction(struct clast_reduction *r); void free_clast_expr(struct clast_expr *e); void free_clast_stmt(struct clast_stmt *s); int clast_expr_equal(struct clast_expr *e1, struct clast_expr *e2); struct clast_expr *clast_bound_from_constraint(CloogConstraint *constraint, int level, CloogNames *names); typedef enum filterType {exact, subset} ClastFilterType; typedef struct clastFilter{ const char *iter; const int *stmts_filter; int nstmts_filter; ClastFilterType filter_type; } ClastFilter; void clast_filter(struct clast_stmt *node, ClastFilter filter, struct clast_for ***loops, int *nloops, int **stmts, int *nstmts); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/loop.h0000664000175000017500000001422412254312305013500 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** loop.h ** **-------------------------------------------------------------------** ** First version: october 26th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_LOOP_H #define CLOOG_LOOP_H #if defined(__cplusplus) extern "C" { #endif /** * CloogLoop structure: * this structure contains all the informations of a loop generated or to be * generated. * - if the loop has not been processed yet (it is not a result of a call to * cloog_loop_generate), the domain is the whole iteration domain of a given * block, the stride is 1 (i.e. there is no stride), block is necessarily not * NULL and inner is NULL. * - if the loop comes as a result of a cloog_loop_generate call, the domain * describes the constraints (guards and loop bounds) for only one dimension * (the last one: outer dimensions being considered as parameters), the stride * may differ from one (this means that on the considered dimension, a step of * 'stride' must be considered between integral point, the first integral * point to be considered being the lower bound of the loop), inner may differ * from NULL, meaning that there are further dimensions and nesting levels in * the loop. */ struct cloogloop { CloogState *state; /**< State. */ CloogDomain * domain ; /**< The iteration domain. */ CloogDomain *unsimplified; /**< Unsimplified version of domain. */ int otl; /**< Loop is executed at most once. */ CloogStride *stride; /**< If not NULL, stride information on iterator * (filled only after loop generation). */ CloogBlock * block ; /**< The included statement block, NULL if none.*/ void * usr; /**< User field, for library user convenience. * This pointer is not freed when the * CloogLoop structure is freed. */ struct cloogloop * inner ; /**< Loops at the next level. */ struct cloogloop * next ; /**< Next loop at the same level. */ } ; typedef struct cloogloop CloogLoop ; /****************************************************************************** * Structure display function * ******************************************************************************/ void cloog_loop_print_structure(FILE *, CloogLoop *, int) ; void cloog_loop_print(FILE *, CloogLoop *) ; /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_loop_free(CloogLoop *) ; /****************************************************************************** * Reading functions * ******************************************************************************/ CloogLoop *cloog_loop_from_domain(CloogState *state, CloogDomain *domain, int number); CloogLoop * cloog_loop_read(CloogState *state, FILE * foo, int number, int nb_parameters); /****************************************************************************** * Processing functions * ******************************************************************************/ CloogLoop * cloog_loop_block(CloogLoop *loop, int *scaldims, int nb_scattdims); CloogLoop * cloog_loop_malloc(CloogState *state); CloogLoop *cloog_loop_generate(CloogLoop *loop, CloogDomain *context, int level, int scalar, int *scaldims, int nb_scattdims, CloogOptions *options); CloogLoop *cloog_loop_simplify(CloogLoop *loop, CloogDomain *context, int level, int nb_scattdims, CloogOptions *options); void cloog_loop_scatter(CloogLoop *, CloogScattering *); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/pprint.h0000664000175000017500000000626512254312305014051 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** pprint.h ** **-------------------------------------------------------------------** ** First version: october 26th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_PPRINT_H #define CLOOG_PPRINT_H #if defined(__cplusplus) extern "C" { #endif # define MAX_STRING_VAL 32 # define INDENT_STEP 2 # define EQTYPE_NONE 0 # define EQTYPE_CONSTANT 1 # define EQTYPE_PUREITEM 2 # define EQTYPE_EXAFFINE 3 #define CLOOG_LANGUAGE_C 0 #define CLOOG_LANGUAGE_FORTRAN 1 /****************************************************************************** * Structure display function * ******************************************************************************/ void clast_pprint(FILE *foo, struct clast_stmt *root, int indent, CloogOptions *options); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/stride.h0000664000175000017500000000147512254312305014025 00000000000000#ifndef CLOOG_STRIDE_H #define CLOOG_STRIDE_H #if defined(__cplusplus) extern "C" { #endif /** * Information about strides. */ struct cloogstride { int references; cloog_int_t stride; /**< The actual stride. */ cloog_int_t offset; /**< Offset of strided loop. */ cloog_int_t factor; CloogConstraint *constraint; }; typedef struct cloogstride CloogStride; CloogStride *cloog_stride_alloc(cloog_int_t stride, cloog_int_t offset); CloogStride *cloog_stride_alloc_from_constraint(cloog_int_t stride, CloogConstraint *constraint, cloog_int_t factor); CloogStride *cloog_stride_copy(CloogStride *stride); void cloog_stride_free(CloogStride *stride); CloogConstraint *cloog_constraint_stride_lower_bound(CloogConstraint *c, int level, CloogStride *stride); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/include/cloog/matrix.h0000664000175000017500000000426512254312305014037 00000000000000#ifndef CLOOG_MATRIX_H #define CLOOG_MATRIX_H #if defined(__cplusplus) extern "C" { #endif /* The CloogMatrix structure is equivalent to the PolyLib Matrix data structure * (see Wil93). This structure is devoted to represent a set of constraints. * * The whole matrix is stored in memory row after row at the p_Init address. p * is an array of pointers where p[i] points to the first element of the i^{th * row. NbRows and NbColumns are respectively the number of rows and columns of * the matrix. Each row corresponds to a constraint. The first element of each * row is an equality/inequality tag. The constraint is an equality p(x) = 0 if * the first element is 0, but it is an inequality p(x) \geq 0 if the first * element is 1. The next elements are the unknown coefficients, followed by * the parameter coefficients, then the constant term. For instance, the * following three constraints: * * -i + m = 0 * -j + n >= 0 * i + j - k >= 0 * * would be represented by the following rows: * * # eq/in i j k m n cst * 0 0 -1 0 1 0 0 * 1 -1 0 0 0 1 0 * 1 1 1 -1 0 0 0 * * To be able to provide different precision version (CLooG supports 32 bits, * 64 bits and arbitrary precision through the GMP library), the cloog_int_t * type depends on the configuration options (it may be long int for 32 bits * version, long long int for 64 bits version, and mpz_t for multiple precision * version). */ struct cloogmatrix { unsigned NbRows; /* Number of rows. */ unsigned NbColumns; /* Number of columns. */ cloog_int_t ** p; /* Array of pointers to the matrix rows. */ cloog_int_t * p_Init; /* Matrix rows contiguously in memory. */ }; typedef struct cloogmatrix CloogMatrix; CloogMatrix *cloog_matrix_alloc (unsigned, unsigned); void cloog_matrix_free (CloogMatrix *); void cloog_matrix_print_structure(FILE *file, CloogMatrix *M, const char *prefix, const char *suffix); CloogMatrix *cloog_matrix_read(FILE *input); CloogMatrix *cloog_matrix_read_of_size(FILE *input, unsigned n_row, unsigned n_col); void cloog_matrix_print(FILE*, CloogMatrix*); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/program.h0000664000175000017500000001317112254312305014176 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** program.h ** **-------------------------------------------------------------------** ** First version: october 25th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_PROGRAM_H #define CLOOG_PROGRAM_H #if defined(__cplusplus) extern "C" { #endif # define MAX_STRING 1024 # define MEGA 1000000 /* One million. */ /** * CloogProgram structure: * this structure contains all the informations of a program generated or to be * generated. */ struct cloogprogram { /* Basic program description fields. */ char language ; /**< The language of the program. */ int nb_scattdims ; /**< Scattering dimension number. */ CloogDomain * context ; /**< The context of the program. */ CloogLoop * loop ; /**< The loops of the program. */ CloogNames * names ; /**< Iterators and parameters names. */ CloogBlockList * blocklist ; /**< The statement block list. */ /* Internal service fields, filled up by cloog_program_scatter function. */ int * scaldims ; /**< Boolean array saying whether a given * scattering dimension is scalar or not. */ /* Library user reserved field. */ void * usr; /**< User field, for library user convenience. * This pointer is not freed when the * CloogProgram structure is freed. */ } ; typedef struct cloogprogram CloogProgram ; /****************************************************************************** * Structure display function * ******************************************************************************/ void cloog_program_print_structure(FILE *, CloogProgram *, int) ; void cloog_program_print(FILE *, CloogProgram *) ; void cloog_program_pprint(FILE *, CloogProgram *, CloogOptions *) ; void cloog_program_dump_cloog(FILE *, CloogProgram *, CloogScatteringList *); /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_program_free(CloogProgram *) ; /****************************************************************************** * Reading function * ******************************************************************************/ CloogProgram * cloog_program_read(FILE *, CloogOptions *) ; /****************************************************************************** * Processing functions * ******************************************************************************/ CloogProgram * cloog_program_malloc(void); CloogProgram * cloog_program_alloc(CloogDomain *context, CloogUnionDomain *ud, CloogOptions *options); CloogProgram * cloog_program_generate(CloogProgram *, CloogOptions *) ; void cloog_program_block(CloogProgram *program, CloogScatteringList *scattering, CloogOptions *options); void cloog_program_extract_scalars(CloogProgram *program, CloogScatteringList *scattering, CloogOptions *options); void cloog_program_scatter(CloogProgram *program, CloogScatteringList *scattering, CloogOptions *options); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/union_domain.h0000664000175000017500000000324112254312305015203 00000000000000#ifndef CLOOG_UNION_DOMAIN_H #define CLOOG_UNION_DOMAIN_H #if defined(__cplusplus) extern "C" { #endif struct osl_scop; /** * CloogNamedDomainList structure: * this structure reprensents a node of a linked list of CloogDomain structures. */ struct cloognameddomainlist { CloogDomain *domain; /**< An element of the list. */ CloogScattering *scattering; /**< Scattering function for domain. */ char *name; /**< Name of the domain. */ void *usr; /**< A pointer for library user's convenience. */ struct cloognameddomainlist *next;/**< Pointer to the next element of the list.*/ }; typedef struct cloognameddomainlist CloogNamedDomainList; /** * A structure representing the input domains and scattering functions. */ struct clooguniondomain { int n_name[3]; char **name[3]; CloogNamedDomainList *domain; CloogNamedDomainList **next_domain; }; typedef struct clooguniondomain CloogUnionDomain; enum cloog_dim_type { CLOOG_PARAM, CLOOG_ITER, CLOOG_SCAT }; CloogUnionDomain *cloog_union_domain_read(FILE *file, int nb_par, CloogOptions *options); CloogUnionDomain *cloog_union_domain_alloc(int nb_par); CloogUnionDomain *cloog_union_domain_add_domain(CloogUnionDomain *ud, const char *name, CloogDomain *domain, CloogScattering *scattering, void *usr); CloogUnionDomain *cloog_union_domain_set_name(CloogUnionDomain *ud, enum cloog_dim_type type, int index, const char *name); void cloog_union_domain_free(CloogUnionDomain *ud); CloogUnionDomain *cloog_union_domain_from_osl_scop(CloogState *, struct osl_scop *); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/include/cloog/version.h.in0000664000175000017500000000460112254312305014617 00000000000000/****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_VERSION_H #define CLOOG_VERSION_H #if defined(__cplusplus) extern "C" { #endif #define CLOOG_VERSION_MAJOR @VERSION_MAJOR@ #define CLOOG_VERSION_MINOR @VERSION_MINOR@ #define CLOOG_VERSION_REVISION @VERSION_REVISION@ const char *cloog_version(void); int cloog_version_major(void); int cloog_version_minor(void); int cloog_version_revision(void); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/version.h0000664000175000017500000000452512254313327014224 00000000000000/****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_VERSION_H #define CLOOG_VERSION_H #if defined(__cplusplus) extern "C" { #endif #define CLOOG_VERSION_MAJOR 0 #define CLOOG_VERSION_MINOR 18 #define CLOOG_VERSION_REVISION 2 const char *cloog_version(void); int cloog_version_major(void); int cloog_version_minor(void); int cloog_version_revision(void); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/int.h0000664000175000017500000001312112254312305013314 00000000000000#ifndef CLOOG_INT_H #define CLOOG_INT_H #include #include #if defined(CLOOG_INT_GMP) #include #include #ifndef mp_get_memory_functions void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)); #endif #endif #if defined(__cplusplus) extern "C" { #endif #if defined(CLOOG_INT_INT) typedef int cloog_int_t; #define CLOOG_INT_FORMAT "%d" #elif defined(CLOOG_INT_LONG) typedef long cloog_int_t; #define CLOOG_INT_FORMAT "%ld" #elif defined(CLOOG_INT_LONG_LONG) typedef long long cloog_int_t; #define CLOOG_INT_FORMAT "%lld" #elif defined(CLOOG_INT_GMP) typedef mpz_t cloog_int_t; #else #error "No integer type defined" #endif #if defined(CLOOG_INT_GMP) #define cloog_int_init(i) mpz_init(i) #define cloog_int_clear(i) mpz_clear(i); #define cloog_int_set(r,i) mpz_set(r,i) #define cloog_int_set_si(r,i) mpz_set_si(r,i) #define cloog_int_abs(r,i) mpz_abs(r,i) #define cloog_int_neg(r,i) mpz_neg(r,i) #define cloog_int_swap(i,j) mpz_swap(i,j) #define cloog_int_add(r,i,j) mpz_add(r,i,j) #define cloog_int_add_ui(r,i,j) mpz_add_ui(r,i,j) #define cloog_int_sub(r,i,j) mpz_sub(r,i,j) #define cloog_int_sub_ui(r,i,j) mpz_sub_ui(r,i,j) #define cloog_int_mul(r,i,j) mpz_mul(r,i,j) #define cloog_int_addmul(r,i,j) mpz_addmul(r,i,j) #define cloog_int_divexact(r,i,j) mpz_divexact(r,i,j) #define cloog_int_tdiv_q(r,i,j) mpz_tdiv_q(r,i,j) #define cloog_int_fdiv_q(r,i,j) mpz_fdiv_q(r,i,j) #define cloog_int_fdiv_r(r,i,j) mpz_fdiv_r(r,i,j) #define cloog_int_cdiv_q(r,i,j) mpz_cdiv_q(r,i,j) #define cloog_int_gcd(r,i,j) mpz_gcd(r,i,j) #define cloog_int_sgn(i) mpz_sgn(i) #define cloog_int_cmp(i,j) mpz_cmp(i,j) #define cloog_int_abs_cmp(i,j) mpz_cmpabs(i,j) #define cloog_int_cmp_si(i,si) mpz_cmp_si(i,si) #define cloog_int_eq(i,j) (mpz_cmp(i,j) == 0) #define cloog_int_ne(i,j) (mpz_cmp(i,j) != 0) #define cloog_int_gt(i,j) (mpz_cmp(i,j) > 0) #define cloog_int_is_divisible_by(i,j) mpz_divisible_p(i,j) #define cloog_int_read(r,s) mpz_set_str(r,s,10) typedef void (*cloog_int_print_gmp_free_t)(void *, size_t); #define cloog_int_print(out,i) \ do { \ char *s; \ cloog_int_print_gmp_free_t gmp_free; \ s = mpz_get_str(0, 10, i); \ fprintf(out, "%s", s); \ mp_get_memory_functions(NULL, NULL, &gmp_free); \ (*gmp_free)(s, strlen(s)+1); \ } while (0) #else #define cloog_int_init(i) ((i) = 0) #define cloog_int_clear(i) do { } while (0) #define cloog_int_set(r,i) ((r) = (i)) #define cloog_int_set_si(r,i) ((r) = (i)) #define cloog_int_abs(r,i) ((r) = (i) > 0 ? (i) : -(i)) #define cloog_int_neg(r,i) ((r) = -(i)) #define cloog_int_swap(i,j) do { \ cloog_int_t _t = i; \ i = j; \ j = _t; \ } while (0) #define cloog_int_add(r,i,j) ((r) = (i) + (j)) #define cloog_int_add_ui(r,i,j) ((r) = (i) + (j)) #define cloog_int_sub(r,i,j) ((r) = (i) - (j)) #define cloog_int_sub_ui(r,i,j) ((r) = (i) - (j)) #define cloog_int_mul(r,i,j) ((r) = (i) * (j)) #define cloog_int_addmul(r,i,j) ((r) += (i) * (j)) #define cloog_int_divexact(r,i,j) ((r) = (i) / (j)) #define cloog_int_tdiv_q(r,i,j) ((r) = (i) / (j)) #define cloog_int_fdiv_q(r,i,j) do { \ assert((j) > 0); \ (r) = (i) >= 0 ? (i) / (j) : \ -((-(i)+(j)-1)/(j)); \ } while (0) #define cloog_int_fdiv_r(r,i,j) do { \ assert((j) > 0); \ (r) = (i) >= 0 ? (i) % (j) : \ (j)-1 - ((-(i)+(j)-1)%(j)); \ } while (0) #define cloog_int_cdiv_q(r,i,j) do { \ assert((j) > 0); \ (r) = (i) >= 0 ? \ ((i)+(j)-1) / (j) : \ -(-(i)/(j)); \ } while (0) cloog_int_t cloog_gcd(cloog_int_t a, cloog_int_t b); #define cloog_int_gcd(r,i,j) (r) = cloog_gcd(i,j) #define cloog_int_sgn(i) ((i) > 0 ? 1 : (i) < 0 ? -1 : 0) #define cloog_int_cmp(i,j) (i - j) #define cloog_int_abs_cmp(i,j) (((i) > 0 ? (i) : -(i)) - ((j) > 0 ? (j) : -(j))) #define cloog_int_cmp_si(i,si) (i - si) #define cloog_int_eq(i,j) ((i) == (j)) #define cloog_int_ne(i,j) ((i) != (j)) #define cloog_int_gt(i,j) ((i) > (j)) #define cloog_int_is_divisible_by(i,j) ((i) % (j) == 0) #define cloog_int_read(i,s) sscanf(s, CLOOG_INT_FORMAT, &i) #define cloog_int_print(out,i) fprintf(out, CLOOG_INT_FORMAT, i) #endif #define cloog_int_is_pos(i) (cloog_int_sgn(i) > 0) #define cloog_int_is_neg(i) (cloog_int_sgn(i) < 0) #define cloog_int_is_zero(i) (cloog_int_sgn(i) == 0) #define cloog_int_is_one(i) (cloog_int_cmp_si(i,1) == 0) #define cloog_int_is_neg_one(i) (cloog_int_cmp_si(i,-1) == 0) #define cloog_int_gt_si(i,si) (cloog_int_cmp_si(i,si) > 0) #define cloog_int_ne_si(i,j) (cloog_int_cmp_si(i,j) != 0) #define cloog_int_lt(i,j) (cloog_int_cmp(i,j) < 0) #define cloog_int_le(i,j) (cloog_int_cmp(i,j) <= 0) #define cloog_int_abs_ne(i,j) (cloog_int_abs_cmp(i,j) != 0) #define cloog_int_abs_ge(i,j) (cloog_int_abs_cmp(i,j) >= 0) #define cloog_int_abs_lt(i,j) (cloog_int_abs_cmp(i,j) < 0) struct cloog_vec { unsigned size; cloog_int_t *p; }; struct cloog_vec *cloog_vec_alloc(unsigned size); void cloog_vec_free(struct cloog_vec *vec); int cloog_seq_first_non_zero(cloog_int_t *p, unsigned len); void cloog_seq_cpy(cloog_int_t *dst, cloog_int_t *src, unsigned len); void cloog_seq_neg(cloog_int_t *dst, cloog_int_t *src, unsigned len); void cloog_seq_combine(cloog_int_t *dst, cloog_int_t m1, cloog_int_t *src1, cloog_int_t m2, cloog_int_t *src2, unsigned len); void cloog_seq_gcd(cloog_int_t *p, unsigned len, cloog_int_t *gcd); int cloog_seq_is_neg(cloog_int_t *p1, cloog_int_t *p2, unsigned len); void cloog_seq_normalize(cloog_int_t *p, unsigned len); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/include/cloog/statement.h0000664000175000017500000001041412254312305014530 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** statement.h ** **-------------------------------------------------------------------** ** First version: november 4th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_STATEMENT_H #define CLOOG_STATEMENT_H #if defined(__cplusplus) extern "C" { #endif struct cloogstatement { CloogState *state; /* State. */ char *name; /* Name of the statement. */ int number; /* The statement unique number. */ void * usr ; /* A pointer for library users convenience. */ struct cloogstatement * next ; /* Pointer to the next statement with the * same original domain and the same * scattering function. */ } ; typedef struct cloogstatement CloogStatement ; /****************************************************************************** * Structure display function * ******************************************************************************/ void cloog_statement_print_structure(FILE *, CloogStatement *, int) ; void cloog_statement_print(FILE *, CloogStatement *) ; /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_statement_free(CloogStatement *) ; /****************************************************************************** * Processing functions * ******************************************************************************/ CloogStatement * cloog_statement_malloc(CloogState *state); CloogStatement * cloog_statement_alloc(CloogState *state, int); CloogStatement * cloog_statement_copy(CloogStatement *) ; void cloog_statement_add(CloogStatement**, CloogStatement**, CloogStatement*) ; #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/block.h0000664000175000017500000001351612254312305013624 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** block.h ** **-------------------------------------------------------------------** ** First version: June 11th 2005 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_BLOCK_H #define CLOOG_BLOCK_H #if defined(__cplusplus) extern "C" { #endif /** * CloogBlock structure: * this structure contains the informations of a statement block. It may happen * that users are lazy enough to ask CLooG to generate the code for statements * with exactly the same domain/scattering pair (possibly differing by only one * constant) instead of giving only one pair. CLooG provides them a last chance * to save time and memory by trying to find these blocks itself. The block * contains the statement list and the common informations of the statements. * This structure contains also the number of existing active references to it: * because CLooG uses many copies of blocks there is no need to actually copy * these blocks but just to return a pointer to them and to increment the number * of active references. Each time a CloogBlock will be freed, we will decrement * the active reference counter and actually free it if its value is zero. */ struct cloogblock { CloogState *state; /**< State. */ CloogStatement * statement ; /**< The list of statements in the block. */ int nb_scaldims ; /**< Number of scalar dimensions. */ cloog_int_t *scaldims; /**< Scalar dimension values. */ int depth ; /**< Original block depth (outer loop number).*/ int references ; /**< Number of references to this structure. */ void * usr; /**< User field, for library user convenience. * This pointer is not freed when the * CloogBlock structure is freed. */ } ; typedef struct cloogblock CloogBlock ; /** * CloogBlockList structure: * this structure reprensents a node of a linked list of CloogBlock structures. */ struct cloogblocklist { CloogBlock * block ; /**< An element of the list. */ struct cloogblocklist * next ;/**< Pointer to the next element of the list.*/ } ; typedef struct cloogblocklist CloogBlockList ; /****************************************************************************** * Structure display function * ******************************************************************************/ void cloog_block_print_structure(FILE *, CloogBlock *, int) ; void cloog_block_print(FILE *, CloogBlock *) ; void cloog_block_list_print(FILE *, CloogBlockList *) ; /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_block_free(CloogBlock *) ; void cloog_block_list_free(CloogBlockList *) ; /****************************************************************************** * Processing functions * ******************************************************************************/ CloogBlock * cloog_block_malloc(CloogState *state); CloogBlock * cloog_block_alloc(CloogStatement *statement, int nb_scaldims, cloog_int_t *scaldims, int depth); CloogBlockList * cloog_block_list_malloc(void); CloogBlockList * cloog_block_list_alloc(CloogBlock *) ; CloogBlock * cloog_block_copy(CloogBlock * block) ; void cloog_block_merge(CloogBlock *, CloogBlock *) ; #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/names.h0000664000175000017500000001204412254312305013630 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** names.h ** **-------------------------------------------------------------------** ** First version: august 1st 2002 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_NAMES_H #define CLOOG_NAMES_H #if defined(__cplusplus) extern "C" { #endif # define MAX_NAME 50 # define FIRST_PARAMETER 'M' # define FIRST_ITERATOR 'i' /** * CloogNames structure: * this structure contains all the informations about parameter and iterator * names (as strings). */ struct cloognames { int nb_scalars ; /**< Scalar dimension number. */ int nb_scattering ; /**< Scattering iterator number. */ int nb_iterators ; /**< Iterator number. */ int nb_parameters ; /**< Parameter number. */ char ** scalars ; /**< The scalar names (an array of strings). */ char ** scattering ; /**< The scattering names (an array of strings). */ char ** iterators ; /**< The iterator names (an array of strings). */ char ** parameters ; /**< The parameter names (an array of strings). */ int references; /**< Number of references to this structure. */ } ; typedef struct cloognames CloogNames ; /****************************************************************************** * Structure display function * ******************************************************************************/ void cloog_names_print_structure(FILE *, CloogNames *, int) ; void cloog_names_print(FILE *, CloogNames *) ; /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_names_free(CloogNames *) ; /****************************************************************************** * Reading functions * ******************************************************************************/ char ** cloog_names_read_strings(FILE *file, int nb_items); /****************************************************************************** * Processing functions * ******************************************************************************/ CloogNames * cloog_names_malloc(void); CloogNames * cloog_names_copy(CloogNames *names); CloogNames * cloog_names_alloc(void); char ** cloog_names_generate_items(int, char *, char) ; CloogNames * cloog_names_generate(int, int, int, int, char, char, char, char) ; void cloog_names_scalarize(CloogNames *, int, int *) ; const char * cloog_names_name_at_level(CloogNames *names, int level); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/input.h0000664000175000017500000000112412254312305013661 00000000000000#ifndef CLOOG_INPUT_H #define CLOOG_INPUT_H #if defined(__cplusplus) extern "C" { #endif struct osl_scop; struct clooginput { CloogDomain *context; CloogUnionDomain *ud; }; typedef struct clooginput CloogInput; CloogInput *cloog_input_from_osl_scop(CloogState *, struct osl_scop *); CloogInput *cloog_input_read(FILE *file, CloogOptions *options); CloogInput *cloog_input_alloc(CloogDomain *context, CloogUnionDomain *ud); void cloog_input_free(CloogInput *input); void cloog_input_dump_cloog(FILE *file, CloogInput *input, CloogOptions *opt); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/include/cloog/constraints.h0000664000175000017500000001504412254312305015077 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** constraints.h ** **-------------------------------------------------------------------** ** First version: april 17th 2005 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_CONSTRAINTS_H #define CLOOG_CONSTRAINTS_H struct cloogconstraint; typedef struct cloogconstraint CloogConstraint; struct cloogconstraintset; typedef struct cloogconstraintset CloogConstraintSet; struct cloogequalities; typedef struct cloogequalities CloogEqualities; #if defined(__cplusplus) extern "C" { #endif /****************************************************************************** * Equalities spreading functions * ******************************************************************************/ CloogEqualities *cloog_equal_alloc(int n, int nb_levels, int nb_parameters); void cloog_equal_free(CloogEqualities *equal); int cloog_equal_count(CloogEqualities *equal); int cloog_equal_type(CloogEqualities *equal, int level); void cloog_equal_del(CloogEqualities *equal, int level); int cloog_equal_total_dimension(CloogEqualities *equal); /****************************************************************************** * Processing functions * ******************************************************************************/ void cloog_constraint_set_normalize(CloogConstraintSet *, int); void cloog_constraint_set_free(CloogConstraintSet *); int cloog_constraint_set_contains_level(CloogConstraintSet *constraints, int level, int nb_parameters); int cloog_constraint_set_total_dimension(CloogConstraintSet *constraints); int cloog_constraint_set_n_iterators(CloogConstraintSet *constraints, int nb_parameters); CloogConstraintSet *cloog_constraint_set_copy(CloogConstraintSet *); CloogConstraintSet *cloog_constraint_set_simplify(CloogConstraintSet *, CloogEqualities *, int, int); int cloog_constraint_needs_reduction(CloogConstraint *upper, int level); CloogConstraintSet *cloog_constraint_set_for_reduction(CloogConstraint *upper, CloogConstraint *lower); CloogConstraintSet *cloog_constraint_set_reduce(CloogConstraintSet *constraints, int level, CloogEqualities *equal, int nb_par, cloog_int_t *bound); int cloog_constraint_set_foreach_constraint(CloogConstraintSet *constraints, int (*fn)(CloogConstraint *constraint, void *user), void *user); int cloog_constraint_is_valid(CloogConstraint *constraint); CloogConstraint *cloog_constraint_copy(CloogConstraint *constraint); void cloog_constraint_release(CloogConstraint *constraint); CloogConstraint *cloog_constraint_invalid(void); int cloog_constraint_total_dimension(CloogConstraint *constraint); CloogConstraint *cloog_equal_constraint(CloogEqualities *equal, int j); void cloog_equal_add(CloogEqualities *equal, CloogConstraintSet *constraints, int level, CloogConstraint *line, int nb_par); CloogConstraint *cloog_constraint_set_defining_equality( CloogConstraintSet *constraints, int level); CloogConstraint *cloog_constraint_set_defining_inequalities( CloogConstraintSet *constraints, int level, CloogConstraint **lower, int nb_parameters); int cloog_constraint_involves(CloogConstraint *constraint, int v); int cloog_constraint_is_lower_bound(CloogConstraint *constraint, int v); int cloog_constraint_is_upper_bound(CloogConstraint *constraint, int v); int cloog_constraint_is_equality(CloogConstraint *constraint); void cloog_constraint_constant_get(CloogConstraint *constraint, cloog_int_t *val); void cloog_constraint_coefficient_get(CloogConstraint *constraint, int var, cloog_int_t *val); void cloog_constraint_coefficient_set(CloogConstraint *constraint, int var, cloog_int_t val); void cloog_constraint_copy_coefficients(CloogConstraint *constraint, cloog_int_t *dst); CloogConstraintSet *cloog_constraint_set_drop_constraint( CloogConstraintSet *constraints, CloogConstraint *constraint); struct clast_expr *cloog_constraint_variable_expr(CloogConstraint *constraint, int level, CloogNames *names); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/state.h0000664000175000017500000000140412254312305013643 00000000000000#ifndef CLOOG_STATE_H #define CLOOG_STATE_H struct cloogbackend; typedef struct cloogbackend CloogBackend; #if defined(__cplusplus) extern "C" { #endif struct cloogstate { CloogBackend *backend; cloog_int_t zero; cloog_int_t one; cloog_int_t negone; int block_allocated; int block_freed; int block_max; int domain_allocated; int domain_freed; int domain_max; int loop_allocated; int loop_freed; int loop_max; int statement_allocated; int statement_freed; int statement_max; }; typedef struct cloogstate CloogState; CloogState *cloog_core_state_malloc(void); CloogState *cloog_state_malloc(void); void cloog_core_state_free(CloogState *state); void cloog_state_free(CloogState *state); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/include/cloog/domain.h0000664000175000017500000002201412254312305013772 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** domain.h ** **-------------------------------------------------------------------** ** First version: october 28th 2001 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ #ifndef CLOOG_DOMAIN_H #define CLOOG_DOMAIN_H #if defined(__cplusplus) extern "C" { #endif struct cloogdomain; typedef struct cloogdomain CloogDomain ; struct cloogscattering; typedef struct cloogscattering CloogScattering; struct osl_relation; /** * CloogDomainList structure: * this structure reprensents a node of a linked list of CloogDomain structures. */ struct cloogdomainlist { CloogDomain *domain; /**< An element of the list. */ struct cloogdomainlist *next;/**< Pointer to the next element of the list.*/ } ; typedef struct cloogdomainlist CloogDomainList; /** * CloogScatteringList structure: * this structure reprensents a node of a linked list of CloogScattering structures. */ struct cloogscatteringlist { CloogScattering *scatt; /**< An element of the list. */ struct cloogscatteringlist *next;/**< Pointer to the next element of the list.*/ } ; typedef struct cloogscatteringlist CloogScatteringList; /****************************************************************************** * PolyLib interface * ******************************************************************************/ void cloog_domain_print_constraints(FILE *, CloogDomain *, int print_number); void cloog_scattering_print_constraints(FILE *, CloogScattering *); void cloog_domain_free(CloogDomain *) ; void cloog_scattering_free(CloogScattering *); CloogDomain * cloog_domain_copy(CloogDomain *) ; CloogDomain * cloog_domain_convex(CloogDomain * Pol) ; CloogDomain * cloog_domain_simple_convex(CloogDomain * domain); CloogDomain * cloog_domain_simplify(CloogDomain *, CloogDomain *) ; CloogDomain * cloog_domain_union(CloogDomain *, CloogDomain *) ; CloogDomain * cloog_domain_intersection(CloogDomain *, CloogDomain *) ; CloogDomain * cloog_domain_difference(CloogDomain *, CloogDomain *) ; void cloog_domain_sort(CloogDomain**,unsigned,unsigned,int *); int cloog_domain_follows(CloogDomain *dom1, CloogDomain *dom2, unsigned level); CloogDomain * cloog_domain_empty(CloogDomain *model); int cloog_domain_is_bounded(CloogDomain *dim, unsigned level); CloogDomain *cloog_domain_bound_splitter(CloogDomain *dom, int level); /****************************************************************************** * Structure display function * ******************************************************************************/ void cloog_domain_print_structure(FILE *file, CloogDomain *domain, int level, const char *name); /****************************************************************************** * Memory deallocation function * ******************************************************************************/ void cloog_domain_list_free(CloogDomainList *); void cloog_scattering_list_free(CloogScatteringList *); /*+**************************************************************************** * Reading function * ******************************************************************************/ CloogDomain * cloog_domain_read_context(CloogState *state, FILE * foo); CloogDomain * cloog_domain_union_read(CloogState *state, FILE *foo, int nb_par); CloogScattering *cloog_domain_read_scattering(CloogDomain *domain, FILE *foo); CloogDomain * cloog_domain_from_cloog_matrix(CloogState *state, CloogMatrix *matrix, int nb_par); CloogScattering * cloog_scattering_from_cloog_matrix(CloogState *state, CloogMatrix *matrix, int nb_scat, int nb_par); /****************************************************************************** * Processing functions * ******************************************************************************/ CloogDomain *cloog_domain_from_osl_relation(CloogState *, struct osl_relation *); CloogScattering *cloog_scattering_from_osl_relation(CloogState *, struct osl_relation *); CloogConstraintSet *cloog_domain_constraints(CloogDomain *); int cloog_domain_isempty(CloogDomain *) ; CloogDomain * cloog_domain_universe(CloogState *state, unsigned dim); CloogDomain * cloog_domain_project(CloogDomain *, int); CloogDomain * cloog_domain_extend(CloogDomain *, int); int cloog_domain_never_integral(CloogDomain *) ; void cloog_domain_stride(CloogDomain *, int, cloog_int_t *, cloog_int_t *); int cloog_domain_can_stride(CloogDomain *domain, int level); int cloog_domain_is_otl(CloogDomain *domain, int level); CloogDomain * cloog_domain_stride_lower_bound(CloogDomain *domain, int level, CloogStride *stride); CloogDomain * cloog_domain_add_stride_constraint(CloogDomain *domain, CloogStride *stride); int cloog_domain_can_unroll(CloogDomain *domain, int level, cloog_int_t *n, CloogConstraint **lb); CloogDomain * cloog_domain_fixed_offset(CloogDomain *domain, int level, CloogConstraint *lb, cloog_int_t offset); int cloog_domain_lazy_disjoint(CloogDomain *, CloogDomain *) ; int cloog_domain_lazy_equal(CloogDomain *, CloogDomain *) ; int cloog_scattering_lazy_block(CloogScattering *, CloogScattering *, CloogScatteringList *, int); int cloog_scattering_lazy_isscalar(CloogScattering *, int, cloog_int_t *); int cloog_domain_lazy_isconstant(CloogDomain *domain, int dimension, cloog_int_t *value); int cloog_scattering_list_lazy_same(CloogScatteringList *); CloogDomain * cloog_domain_cut_first(CloogDomain *domain, CloogDomain **rest); CloogDomain * cloog_domain_simplify_union(CloogDomain *domain); CloogScattering * cloog_scattering_erase_dimension(CloogScattering *, int); int cloog_domain_dimension(CloogDomain *) ; int cloog_domain_parameter_dimension(CloogDomain *domain); int cloog_scattering_dimension(CloogScattering *, CloogDomain *); int cloog_domain_isconvex(CloogDomain *) ; CloogDomain * cloog_domain_cube(CloogState *state, int dim, cloog_int_t min, cloog_int_t max); CloogDomain * cloog_domain_from_context(CloogDomain *context); CloogDomain * cloog_domain_scatter(CloogDomain *domain, CloogScattering *scatt); int cloog_scattering_fully_specified(CloogScattering *scattering, CloogDomain *domain); CloogStride *cloog_domain_list_stride(CloogDomainList *list, int level); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/isl/0000775000175000017500000000000012254314446013232 500000000000000cloog-0.18.2/include/cloog/isl/constraintset.h0000664000175000017500000000136512254312305016220 00000000000000#ifndef CLOOG_ISL_CONSTRAINTSET_H #define CLOOG_ISL_CONSTRAINTSET_H #include #if defined(__cplusplus) extern "C" { #endif struct cloogconstraintset { int dummy; /* Solaris cc doesn't like zero-sized structs */ }; struct cloogequalities { int n; unsigned total_dim; isl_constraint **constraints; int *types; }; struct cloogconstraint { int dummy; /* Solaris cc doesn't like zero-sized structs */ }; CloogConstraintSet *cloog_constraint_set_from_isl_basic_set(struct isl_basic_set *bset); CloogConstraint *cloog_constraint_from_isl_constraint(struct isl_constraint *constraint); isl_constraint *cloog_constraint_to_isl(CloogConstraint *constraint); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/isl/backend.h0000664000175000017500000000027212254312305014703 00000000000000#ifndef CLOOG_ISL_BACKEND_H #define CLOOG_ISL_BACKEND_H #include struct cloogbackend { struct isl_ctx *ctx; unsigned ctx_allocated : 1; }; #endif /* define _H */ cloog-0.18.2/include/cloog/isl/domain.h0000664000175000017500000000146112254312305014564 00000000000000#ifndef CLOOG_ISL_DOMAIN_H #define CLOOG_ISL_DOMAIN_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct cloogdomain { int dummy; /* Solaris cc doesn't like zero-sized structs */ }; struct cloogscattering { int dummy; /* Solaris cc doesn't like zero-sized structs */ }; CloogDomain *cloog_domain_from_isl_set(__isl_take isl_set *set); CloogScattering *cloog_scattering_from_isl_map(__isl_take isl_map *map); CloogUnionDomain *cloog_union_domain_from_isl_union_map( __isl_take isl_union_map *umap); CloogUnionDomain *cloog_union_domain_from_isl_set( __isl_take isl_set *set); __isl_give isl_set *isl_set_from_cloog_domain(CloogDomain *domain); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/isl/cloog.h0000664000175000017500000000053612254312305014422 00000000000000#ifndef CLOOG_ISL_H #define CLOOG_ISL_H #ifndef CLOOG_INT_GMP #define CLOOG_INT_GMP #endif #include #include #include #if defined(__cplusplus) extern "C" { #endif CloogState *cloog_isl_state_malloc(struct isl_ctx *ctx); #if defined(__cplusplus) } #endif #endif /* define _H */ cloog-0.18.2/include/cloog/cloog.h0000664000175000017500000000632512254312305013635 00000000000000 /**-------------------------------------------------------------------** ** CLooG ** **-------------------------------------------------------------------** ** cloog.h ** **-------------------------------------------------------------------** ** First version: july 25th 2002 ** **-------------------------------------------------------------------**/ /****************************************************************************** * CLooG : the Chunky Loop Generator (experimental) * ****************************************************************************** * * * Copyright (C) 2001-2005 Cedric Bastoul * * * * This library is free software; you can redistribute it and/or * * modify it under the terms of the GNU Lesser General Public * * License as published by the Free Software Foundation; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * Lesser General Public License for more details. * * * * You should have received a copy of the GNU Lesser General Public * * License along with this library; if not, write to the Free Software * * Foundation, Inc., 51 Franklin Street, Fifth Floor, * * Boston, MA 02110-1301 USA * * * * CLooG, the Chunky Loop Generator * * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * * * ******************************************************************************/ /****************************************************************************** * THIS FILE HAS BEEN AUTOMATICALLY GENERATED FROM clooh.h.in BY configure * ******************************************************************************/ #ifndef CLOOG_H #define CLOOG_H #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif /* !CLOOG_H */ cloog-0.18.2/Makefile.am0000664000175000017500000001533412254312305011667 00000000000000# # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** makefile.in ** # **-------------------------------------------------------------------** # ** First version: october 25th 2001 ** # **-------------------------------------------------------------------**/ # # makefile.in (or makefile if generated) of CLooG, the Chunky LOOp Generator. # makefile.in is not a makefile, you must run the 'configure' shellscript to # generate the makefile thanks to this file. #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2001 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ if BUNDLED_ISL MAYBE_ISL = isl ISL_LA = $(top_builddir)/isl/libisl.la endif if BUNDLED_OSL MAYBE_OSL = osl OSL_LA = $(top_builddir)/osl/libosl.la endif SUBDIRS = $(MAYBE_ISL) $(MAYBE_OSL) . doc test DIST_SUBDIRS = $(MAYBE_ISL) $(MAYBE_OSL) . doc test ACLOCAL_AMFLAGS = -I m4 FORCE: isl/libisl.la: FORCE cd isl; $(MAKE) $(AM_MAKEFLAGS) libisl.la if NO_ISL CLOOG = LIBCLOOG = else CLOOG = cloog LIBCLOOG = libcloog-isl.la endif bin_PROGRAMS = $(CLOOG) lib_LTLIBRARIES = $(LIBCLOOG) if NEED_GET_MEMORY_FUNCTIONS GET_MEMORY_FUNCTIONS=source/mp_get_memory_functions.c endif SOURCES_CORE = \ $(GET_MEMORY_FUNCTIONS) \ source/block.c \ source/clast.c \ source/matrix.c \ source/state.c \ source/input.c \ source/int.c \ source/loop.c \ source/names.c \ source/options.c \ source/pprint.c \ source/program.c \ source/statement.c \ source/stride.c \ source/union_domain.c \ source/version.c AM_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include AM_CFLAGS = $(CFLAGS_WARN) libcloog_isl_la_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include @ISL_CPPFLAGS@ @OSL_CPPFLAGS@ libcloog_isl_la_LDFLAGS = -version-info @versioninfo@ \ -rpath $(libdir) @ISL_LDFLAGS@ @OSL_LDFLAGS@ libcloog_isl_la_LIBADD = @ISL_LIBS@ @OSL_LIBS@ $(ISL_LA) $(OSL_LA) libcloog_isl_la_SOURCES = \ $(SOURCES_CORE) \ source/isl/domain.c \ source/isl/constraints.c \ source/isl/backend.c LDADD = libcloog-isl.la cloog_DEPENDENCIES = libcloog-isl.la cloog_SOURCES = source/cloog.c pkginclude_HEADERS = \ include/cloog/block.h \ include/cloog/clast.h \ include/cloog/cloog.h \ include/cloog/input.h \ include/cloog/int.h \ include/cloog/matrix.h \ include/cloog/state.h \ include/cloog/domain.h \ include/cloog/loop.h \ include/cloog/constraints.h \ include/cloog/names.h \ include/cloog/options.h \ include/cloog/pprint.h \ include/cloog/program.h \ include/cloog/statement.h \ include/cloog/stride.h \ include/cloog/union_domain.h \ include/cloog/version.h pkgmatrixincludedir = $(pkgincludedir)/matrix pkgmatrixinclude_HEADERS = \ include/cloog/matrix/constraintset.h pkgislincludedir = $(pkgincludedir)/isl pkgislinclude_HEADERS = \ include/cloog/isl/backend.h \ include/cloog/isl/cloog.h \ include/cloog/isl/domain.h \ include/cloog/isl/constraintset.h version.h: @GIT_INDEX@ echo '#define CLOOG_HEAD "'`$(top_builddir)/genversion.sh`'"' > $@ EXTRA_DIST = \ autoconf/Doxyfile.in \ source/matrix/constraintset.c \ doc/cloog.texi \ doc/images \ examples install-data-local: @test -z "$(pkgconfig_libdir)" || $(mkdir_p) "$(DESTDIR)$(pkgconfig_libdir)" $(INSTALL_DATA) $(pkgconfig_libfile) "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" @test -z "$(DESTDIR)$(libdir)/isl" || $(mkdir_p) "$(DESTDIR)$(libdir)/isl" $(INSTALL_DATA) "$(top_srcdir)/cmake/isl-config.cmake" "$(DESTDIR)$(libdir)/isl/" @test -z "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)" || $(mkdir_p) "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)" $(INSTALL_DATA) "$(top_srcdir)/cmake/cloog-isl-config.cmake" "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)/" uninstall-local: rm -f "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" dist-hook: rm -f $(distdir)/test/Makefile $(top_builddir)/genversion.sh > $(distdir)/CLOOG_HEAD (cd doc; make cloog.pdf) && cp doc/cloog.pdf $(distdir)/doc/ #/***************************************************************************** # * Rules * # *****************************************************************************/ valcheck: $(MAKE) valgrind -C test total: @echo " /*-----------------------------------------------*" @echo " * CLooG *" @echo " *-----------------------------------------------*/" $(MAKE) uninstall $(MAKE) clean $(MAKE) $(MAKE) install doc: @echo " /*-----------------------------------------------*" @echo " * Generating CLooG's documentation *" @echo " *-----------------------------------------------*/" doxygen ./autoconf/Doxyfile cloog-0.18.2/Makefile.in0000664000175000017500000020703712254313270011705 00000000000000# Makefile.in generated by automake 1.11.3 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # # /**-------------------------------------------------------------------** # ** CLooG ** # **-------------------------------------------------------------------** # ** makefile.in ** # **-------------------------------------------------------------------** # ** First version: october 25th 2001 ** # **-------------------------------------------------------------------**/ # # makefile.in (or makefile if generated) of CLooG, the Chunky LOOp Generator. # makefile.in is not a makefile, you must run the 'configure' shellscript to # generate the makefile thanks to this file. VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ bin_PROGRAMS = $(am__EXEEXT_1) subdir = . DIST_COMMON = README $(am__configure_deps) $(pkginclude_HEADERS) \ $(pkgislinclude_HEADERS) $(pkgmatrixinclude_HEADERS) \ $(srcdir)/Makefile.am $(srcdir)/Makefile.in \ $(srcdir)/genversion.sh.in $(top_srcdir)/autoconf/Doxyfile.in \ $(top_srcdir)/configure \ $(top_srcdir)/include/cloog/version.h.in \ $(top_srcdir)/source/version.c.in ChangeLog \ autoconf/config.guess autoconf/config.sub autoconf/depcomp \ autoconf/install-sh autoconf/ltmain.sh autoconf/missing ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_cc_maxopt.m4 \ $(top_srcdir)/m4/ax_cflags_warn_all.m4 \ $(top_srcdir)/m4/ax_check_compiler_flags.m4 \ $(top_srcdir)/m4/ax_compiler_vendor.m4 \ $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/ax_gcc_archflag.m4 \ $(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \ $(top_srcdir)/m4/ax_submodule.m4 $(top_srcdir)/m4/libtool.m4 \ $(top_srcdir)/m4/ltoptions.m4 $(top_srcdir)/m4/ltsugar.m4 \ $(top_srcdir)/m4/ltversion.m4 $(top_srcdir)/m4/lt~obsolete.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_CLEAN_FILES = autoconf/Doxyfile source/version.c \ include/cloog/version.h genversion.sh CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" \ "$(DESTDIR)$(pkgincludedir)" "$(DESTDIR)$(pkgislincludedir)" \ "$(DESTDIR)$(pkgmatrixincludedir)" LTLIBRARIES = $(lib_LTLIBRARIES) libcloog_isl_la_DEPENDENCIES = $(ISL_LA) $(OSL_LA) am__libcloog_isl_la_SOURCES_DIST = source/mp_get_memory_functions.c \ source/block.c source/clast.c source/matrix.c source/state.c \ source/input.c source/int.c source/loop.c source/names.c \ source/options.c source/pprint.c source/program.c \ source/statement.c source/stride.c source/union_domain.c \ source/version.c source/isl/domain.c source/isl/constraints.c \ source/isl/backend.c @NEED_GET_MEMORY_FUNCTIONS_TRUE@am__objects_1 = libcloog_isl_la-mp_get_memory_functions.lo am__objects_2 = $(am__objects_1) libcloog_isl_la-block.lo \ libcloog_isl_la-clast.lo libcloog_isl_la-matrix.lo \ libcloog_isl_la-state.lo libcloog_isl_la-input.lo \ libcloog_isl_la-int.lo libcloog_isl_la-loop.lo \ libcloog_isl_la-names.lo libcloog_isl_la-options.lo \ libcloog_isl_la-pprint.lo libcloog_isl_la-program.lo \ libcloog_isl_la-statement.lo libcloog_isl_la-stride.lo \ libcloog_isl_la-union_domain.lo libcloog_isl_la-version.lo am_libcloog_isl_la_OBJECTS = $(am__objects_2) \ libcloog_isl_la-domain.lo libcloog_isl_la-constraints.lo \ libcloog_isl_la-backend.lo libcloog_isl_la_OBJECTS = $(am_libcloog_isl_la_OBJECTS) AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent libcloog_isl_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC \ $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CCLD) \ $(AM_CFLAGS) $(CFLAGS) $(libcloog_isl_la_LDFLAGS) $(LDFLAGS) \ -o $@ @NO_ISL_FALSE@am_libcloog_isl_la_rpath = -rpath $(libdir) @NO_ISL_FALSE@am__EXEEXT_1 = cloog$(EXEEXT) PROGRAMS = $(bin_PROGRAMS) am_cloog_OBJECTS = cloog.$(OBJEXT) cloog_OBJECTS = $(am_cloog_OBJECTS) cloog_LDADD = $(LDADD) DEFAULT_INCLUDES = -I.@am__isrc@ depcomp = $(SHELL) $(top_srcdir)/autoconf/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) AM_V_CC = $(am__v_CC_@AM_V@) am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@) am__v_CC_0 = @echo " CC " $@; AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ CCLD = $(CC) LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CCLD = $(am__v_CCLD_@AM_V@) am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@) am__v_CCLD_0 = @echo " CCLD " $@; AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; SOURCES = $(libcloog_isl_la_SOURCES) $(cloog_SOURCES) DIST_SOURCES = $(am__libcloog_isl_la_SOURCES_DIST) $(cloog_SOURCES) RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive HEADERS = $(pkginclude_HEADERS) $(pkgislinclude_HEADERS) \ $(pkgmatrixinclude_HEADERS) RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ distdir dist dist-all distcheck ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ if test -d "$(distdir)"; then \ find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -rf "$(distdir)" \ || { sleep 5 && rm -rf "$(distdir)"; }; \ else :; fi am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" DIST_ARCHIVES = $(distdir).tar.gz GZIP_ENV = --best distuninstallcheck_listfiles = find . -type f -print am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \ | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$' distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ BITS = @BITS@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CD = @CD@ CFLAGS = @CFLAGS@ CFLAGS_WARN = @CFLAGS_WARN@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GIT_INDEX = @GIT_INDEX@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ ISL_CPPFLAGS = @ISL_CPPFLAGS@ ISL_LDFLAGS = @ISL_LDFLAGS@ ISL_LIBS = @ISL_LIBS@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OSL_CPPFLAGS = @OSL_CPPFLAGS@ OSL_LDFLAGS = @OSL_LDFLAGS@ OSL_LIBS = @OSL_LIBS@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ TEXI2DVI = @TEXI2DVI@ VERSION = @VERSION@ VERSION_MAJOR = @VERSION_MAJOR@ VERSION_MINOR = @VERSION_MINOR@ VERSION_REVISION = @VERSION_REVISION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ subdirs = @subdirs@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ #/***************************************************************************** # * CLooG : the Chunky Loop Generator (experimental) * # ***************************************************************************** # * * # * Copyright (C) 2001 Cedric Bastoul * # * * # * This library is free software; you can redistribute it and/or * # * modify it under the terms of the GNU Lesser General Public * # * License as published by the Free Software Foundation; either * # * version 2.1 of the License, or (at your option) any later version. * # * * # * This library is distributed in the hope that it will be useful, * # * but WITHOUT ANY WARRANTY; without even the implied warranty of * # * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * # * Lesser General Public License for more details. * # * * # * You should have received a copy of the GNU Lesser General Public * # * License along with this library; if not, write to the Free Software * # * Foundation, Inc., 51 Franklin Street, Fifth Floor, * # * Boston, MA 02110-1301 USA * # * * # * CLooG, the Chunky Loop Generator * # * Written by Cedric Bastoul, Cedric.Bastoul@inria.fr * # * * # *****************************************************************************/ @BUNDLED_ISL_TRUE@MAYBE_ISL = isl @BUNDLED_ISL_TRUE@ISL_LA = $(top_builddir)/isl/libisl.la @BUNDLED_OSL_TRUE@MAYBE_OSL = osl @BUNDLED_OSL_TRUE@OSL_LA = $(top_builddir)/osl/libosl.la SUBDIRS = $(MAYBE_ISL) $(MAYBE_OSL) . doc test DIST_SUBDIRS = $(MAYBE_ISL) $(MAYBE_OSL) . doc test ACLOCAL_AMFLAGS = -I m4 @NO_ISL_FALSE@CLOOG = cloog @NO_ISL_TRUE@CLOOG = @NO_ISL_FALSE@LIBCLOOG = libcloog-isl.la @NO_ISL_TRUE@LIBCLOOG = lib_LTLIBRARIES = $(LIBCLOOG) @NEED_GET_MEMORY_FUNCTIONS_TRUE@GET_MEMORY_FUNCTIONS = source/mp_get_memory_functions.c SOURCES_CORE = \ $(GET_MEMORY_FUNCTIONS) \ source/block.c \ source/clast.c \ source/matrix.c \ source/state.c \ source/input.c \ source/int.c \ source/loop.c \ source/names.c \ source/options.c \ source/pprint.c \ source/program.c \ source/statement.c \ source/stride.c \ source/union_domain.c \ source/version.c AM_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include AM_CFLAGS = $(CFLAGS_WARN) libcloog_isl_la_CPPFLAGS = -I. -I$(top_builddir)/include -I$(top_srcdir)/include @ISL_CPPFLAGS@ @OSL_CPPFLAGS@ libcloog_isl_la_LDFLAGS = -version-info @versioninfo@ \ -rpath $(libdir) @ISL_LDFLAGS@ @OSL_LDFLAGS@ libcloog_isl_la_LIBADD = @ISL_LIBS@ @OSL_LIBS@ $(ISL_LA) $(OSL_LA) libcloog_isl_la_SOURCES = \ $(SOURCES_CORE) \ source/isl/domain.c \ source/isl/constraints.c \ source/isl/backend.c LDADD = libcloog-isl.la cloog_DEPENDENCIES = libcloog-isl.la cloog_SOURCES = source/cloog.c pkginclude_HEADERS = \ include/cloog/block.h \ include/cloog/clast.h \ include/cloog/cloog.h \ include/cloog/input.h \ include/cloog/int.h \ include/cloog/matrix.h \ include/cloog/state.h \ include/cloog/domain.h \ include/cloog/loop.h \ include/cloog/constraints.h \ include/cloog/names.h \ include/cloog/options.h \ include/cloog/pprint.h \ include/cloog/program.h \ include/cloog/statement.h \ include/cloog/stride.h \ include/cloog/union_domain.h \ include/cloog/version.h pkgmatrixincludedir = $(pkgincludedir)/matrix pkgmatrixinclude_HEADERS = \ include/cloog/matrix/constraintset.h pkgislincludedir = $(pkgincludedir)/isl pkgislinclude_HEADERS = \ include/cloog/isl/backend.h \ include/cloog/isl/cloog.h \ include/cloog/isl/domain.h \ include/cloog/isl/constraintset.h EXTRA_DIST = \ autoconf/Doxyfile.in \ source/matrix/constraintset.c \ doc/cloog.texi \ doc/images \ examples all: all-recursive .SUFFIXES: .SUFFIXES: .c .lo .o .obj am--refresh: Makefile @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): autoconf/Doxyfile: $(top_builddir)/config.status $(top_srcdir)/autoconf/Doxyfile.in cd $(top_builddir) && $(SHELL) ./config.status $@ source/version.c: $(top_builddir)/config.status $(top_srcdir)/source/version.c.in cd $(top_builddir) && $(SHELL) ./config.status $@ include/cloog/version.h: $(top_builddir)/config.status $(top_srcdir)/include/cloog/version.h.in cd $(top_builddir) && $(SHELL) ./config.status $@ genversion.sh: $(top_builddir)/config.status $(srcdir)/genversion.sh.in cd $(top_builddir) && $(SHELL) ./config.status $@ install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done libcloog-isl.la: $(libcloog_isl_la_OBJECTS) $(libcloog_isl_la_DEPENDENCIES) $(EXTRA_libcloog_isl_la_DEPENDENCIES) $(AM_V_CCLD)$(libcloog_isl_la_LINK) $(am_libcloog_isl_la_rpath) $(libcloog_isl_la_OBJECTS) $(libcloog_isl_la_LIBADD) $(LIBS) install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)" @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ for p in $$list; do echo "$$p $$p"; done | \ sed 's/$(EXEEXT)$$//' | \ while read p p1; do if test -f $$p || test -f $$p1; \ then echo "$$p"; echo "$$p"; else :; fi; \ done | \ sed -e 'p;s,.*/,,;n;h' -e 's|.*|.|' \ -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \ sed 'N;N;N;s,\n, ,g' | \ $(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1 } \ { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \ if ($$2 == $$4) files[d] = files[d] " " $$1; \ else { print "f", $$3 "/" $$4, $$1; } } \ END { for (d in files) print "f", d, files[d] }' | \ while read type dir files; do \ if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \ test -z "$$files" || { \ echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'"; \ $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \ } \ ; done uninstall-binPROGRAMS: @$(NORMAL_UNINSTALL) @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ files=`for p in $$list; do echo "$$p"; done | \ sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \ -e 's/$$/$(EXEEXT)/' `; \ test -n "$$list" || exit 0; \ echo " ( cd '$(DESTDIR)$(bindir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(bindir)" && rm -f $$files clean-binPROGRAMS: @list='$(bin_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list cloog$(EXEEXT): $(cloog_OBJECTS) $(cloog_DEPENDENCIES) $(EXTRA_cloog_DEPENDENCIES) @rm -f cloog$(EXEEXT) $(AM_V_CCLD)$(LINK) $(cloog_OBJECTS) $(cloog_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cloog.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-backend.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-block.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-clast.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-constraints.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-domain.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-input.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-int.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-loop.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-matrix.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-mp_get_memory_functions.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-names.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-options.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-pprint.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-program.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-state.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-statement.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-stride.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-union_domain.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libcloog_isl_la-version.Plo@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(AM_V_CC)$(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LTCOMPILE) -c -o $@ $< libcloog_isl_la-mp_get_memory_functions.lo: source/mp_get_memory_functions.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-mp_get_memory_functions.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-mp_get_memory_functions.Tpo -c -o libcloog_isl_la-mp_get_memory_functions.lo `test -f 'source/mp_get_memory_functions.c' || echo '$(srcdir)/'`source/mp_get_memory_functions.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-mp_get_memory_functions.Tpo $(DEPDIR)/libcloog_isl_la-mp_get_memory_functions.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/mp_get_memory_functions.c' object='libcloog_isl_la-mp_get_memory_functions.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-mp_get_memory_functions.lo `test -f 'source/mp_get_memory_functions.c' || echo '$(srcdir)/'`source/mp_get_memory_functions.c libcloog_isl_la-block.lo: source/block.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-block.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-block.Tpo -c -o libcloog_isl_la-block.lo `test -f 'source/block.c' || echo '$(srcdir)/'`source/block.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-block.Tpo $(DEPDIR)/libcloog_isl_la-block.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/block.c' object='libcloog_isl_la-block.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-block.lo `test -f 'source/block.c' || echo '$(srcdir)/'`source/block.c libcloog_isl_la-clast.lo: source/clast.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-clast.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-clast.Tpo -c -o libcloog_isl_la-clast.lo `test -f 'source/clast.c' || echo '$(srcdir)/'`source/clast.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-clast.Tpo $(DEPDIR)/libcloog_isl_la-clast.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/clast.c' object='libcloog_isl_la-clast.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-clast.lo `test -f 'source/clast.c' || echo '$(srcdir)/'`source/clast.c libcloog_isl_la-matrix.lo: source/matrix.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-matrix.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-matrix.Tpo -c -o libcloog_isl_la-matrix.lo `test -f 'source/matrix.c' || echo '$(srcdir)/'`source/matrix.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-matrix.Tpo $(DEPDIR)/libcloog_isl_la-matrix.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/matrix.c' object='libcloog_isl_la-matrix.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-matrix.lo `test -f 'source/matrix.c' || echo '$(srcdir)/'`source/matrix.c libcloog_isl_la-state.lo: source/state.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-state.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-state.Tpo -c -o libcloog_isl_la-state.lo `test -f 'source/state.c' || echo '$(srcdir)/'`source/state.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-state.Tpo $(DEPDIR)/libcloog_isl_la-state.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/state.c' object='libcloog_isl_la-state.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-state.lo `test -f 'source/state.c' || echo '$(srcdir)/'`source/state.c libcloog_isl_la-input.lo: source/input.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-input.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-input.Tpo -c -o libcloog_isl_la-input.lo `test -f 'source/input.c' || echo '$(srcdir)/'`source/input.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-input.Tpo $(DEPDIR)/libcloog_isl_la-input.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/input.c' object='libcloog_isl_la-input.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-input.lo `test -f 'source/input.c' || echo '$(srcdir)/'`source/input.c libcloog_isl_la-int.lo: source/int.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-int.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-int.Tpo -c -o libcloog_isl_la-int.lo `test -f 'source/int.c' || echo '$(srcdir)/'`source/int.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-int.Tpo $(DEPDIR)/libcloog_isl_la-int.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/int.c' object='libcloog_isl_la-int.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-int.lo `test -f 'source/int.c' || echo '$(srcdir)/'`source/int.c libcloog_isl_la-loop.lo: source/loop.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-loop.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-loop.Tpo -c -o libcloog_isl_la-loop.lo `test -f 'source/loop.c' || echo '$(srcdir)/'`source/loop.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-loop.Tpo $(DEPDIR)/libcloog_isl_la-loop.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/loop.c' object='libcloog_isl_la-loop.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-loop.lo `test -f 'source/loop.c' || echo '$(srcdir)/'`source/loop.c libcloog_isl_la-names.lo: source/names.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-names.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-names.Tpo -c -o libcloog_isl_la-names.lo `test -f 'source/names.c' || echo '$(srcdir)/'`source/names.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-names.Tpo $(DEPDIR)/libcloog_isl_la-names.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/names.c' object='libcloog_isl_la-names.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-names.lo `test -f 'source/names.c' || echo '$(srcdir)/'`source/names.c libcloog_isl_la-options.lo: source/options.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-options.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-options.Tpo -c -o libcloog_isl_la-options.lo `test -f 'source/options.c' || echo '$(srcdir)/'`source/options.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-options.Tpo $(DEPDIR)/libcloog_isl_la-options.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/options.c' object='libcloog_isl_la-options.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-options.lo `test -f 'source/options.c' || echo '$(srcdir)/'`source/options.c libcloog_isl_la-pprint.lo: source/pprint.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-pprint.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-pprint.Tpo -c -o libcloog_isl_la-pprint.lo `test -f 'source/pprint.c' || echo '$(srcdir)/'`source/pprint.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-pprint.Tpo $(DEPDIR)/libcloog_isl_la-pprint.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/pprint.c' object='libcloog_isl_la-pprint.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-pprint.lo `test -f 'source/pprint.c' || echo '$(srcdir)/'`source/pprint.c libcloog_isl_la-program.lo: source/program.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-program.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-program.Tpo -c -o libcloog_isl_la-program.lo `test -f 'source/program.c' || echo '$(srcdir)/'`source/program.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-program.Tpo $(DEPDIR)/libcloog_isl_la-program.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/program.c' object='libcloog_isl_la-program.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-program.lo `test -f 'source/program.c' || echo '$(srcdir)/'`source/program.c libcloog_isl_la-statement.lo: source/statement.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-statement.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-statement.Tpo -c -o libcloog_isl_la-statement.lo `test -f 'source/statement.c' || echo '$(srcdir)/'`source/statement.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-statement.Tpo $(DEPDIR)/libcloog_isl_la-statement.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/statement.c' object='libcloog_isl_la-statement.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-statement.lo `test -f 'source/statement.c' || echo '$(srcdir)/'`source/statement.c libcloog_isl_la-stride.lo: source/stride.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-stride.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-stride.Tpo -c -o libcloog_isl_la-stride.lo `test -f 'source/stride.c' || echo '$(srcdir)/'`source/stride.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-stride.Tpo $(DEPDIR)/libcloog_isl_la-stride.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/stride.c' object='libcloog_isl_la-stride.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-stride.lo `test -f 'source/stride.c' || echo '$(srcdir)/'`source/stride.c libcloog_isl_la-union_domain.lo: source/union_domain.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-union_domain.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-union_domain.Tpo -c -o libcloog_isl_la-union_domain.lo `test -f 'source/union_domain.c' || echo '$(srcdir)/'`source/union_domain.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-union_domain.Tpo $(DEPDIR)/libcloog_isl_la-union_domain.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/union_domain.c' object='libcloog_isl_la-union_domain.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-union_domain.lo `test -f 'source/union_domain.c' || echo '$(srcdir)/'`source/union_domain.c libcloog_isl_la-version.lo: source/version.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-version.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-version.Tpo -c -o libcloog_isl_la-version.lo `test -f 'source/version.c' || echo '$(srcdir)/'`source/version.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-version.Tpo $(DEPDIR)/libcloog_isl_la-version.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/version.c' object='libcloog_isl_la-version.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-version.lo `test -f 'source/version.c' || echo '$(srcdir)/'`source/version.c libcloog_isl_la-domain.lo: source/isl/domain.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-domain.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-domain.Tpo -c -o libcloog_isl_la-domain.lo `test -f 'source/isl/domain.c' || echo '$(srcdir)/'`source/isl/domain.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-domain.Tpo $(DEPDIR)/libcloog_isl_la-domain.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/isl/domain.c' object='libcloog_isl_la-domain.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-domain.lo `test -f 'source/isl/domain.c' || echo '$(srcdir)/'`source/isl/domain.c libcloog_isl_la-constraints.lo: source/isl/constraints.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-constraints.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-constraints.Tpo -c -o libcloog_isl_la-constraints.lo `test -f 'source/isl/constraints.c' || echo '$(srcdir)/'`source/isl/constraints.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-constraints.Tpo $(DEPDIR)/libcloog_isl_la-constraints.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/isl/constraints.c' object='libcloog_isl_la-constraints.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-constraints.lo `test -f 'source/isl/constraints.c' || echo '$(srcdir)/'`source/isl/constraints.c libcloog_isl_la-backend.lo: source/isl/backend.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libcloog_isl_la-backend.lo -MD -MP -MF $(DEPDIR)/libcloog_isl_la-backend.Tpo -c -o libcloog_isl_la-backend.lo `test -f 'source/isl/backend.c' || echo '$(srcdir)/'`source/isl/backend.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libcloog_isl_la-backend.Tpo $(DEPDIR)/libcloog_isl_la-backend.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/isl/backend.c' object='libcloog_isl_la-backend.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libcloog_isl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libcloog_isl_la-backend.lo `test -f 'source/isl/backend.c' || echo '$(srcdir)/'`source/isl/backend.c cloog.o: source/cloog.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cloog.o -MD -MP -MF $(DEPDIR)/cloog.Tpo -c -o cloog.o `test -f 'source/cloog.c' || echo '$(srcdir)/'`source/cloog.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/cloog.Tpo $(DEPDIR)/cloog.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/cloog.c' object='cloog.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cloog.o `test -f 'source/cloog.c' || echo '$(srcdir)/'`source/cloog.c cloog.obj: source/cloog.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cloog.obj -MD -MP -MF $(DEPDIR)/cloog.Tpo -c -o cloog.obj `if test -f 'source/cloog.c'; then $(CYGPATH_W) 'source/cloog.c'; else $(CYGPATH_W) '$(srcdir)/source/cloog.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/cloog.Tpo $(DEPDIR)/cloog.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='source/cloog.c' object='cloog.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cloog.obj `if test -f 'source/cloog.c'; then $(CYGPATH_W) 'source/cloog.c'; else $(CYGPATH_W) '$(srcdir)/source/cloog.c'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool config.lt install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkgincludedir)" || $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkgincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgincludedir)" || exit $$?; \ done uninstall-pkgincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgincludedir)'; $(am__uninstall_files_from_dir) install-pkgislincludeHEADERS: $(pkgislinclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkgislincludedir)" || $(MKDIR_P) "$(DESTDIR)$(pkgislincludedir)" @list='$(pkgislinclude_HEADERS)'; test -n "$(pkgislincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkgislincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgislincludedir)" || exit $$?; \ done uninstall-pkgislincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkgislinclude_HEADERS)'; test -n "$(pkgislincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgislincludedir)'; $(am__uninstall_files_from_dir) install-pkgmatrixincludeHEADERS: $(pkgmatrixinclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkgmatrixincludedir)" || $(MKDIR_P) "$(DESTDIR)$(pkgmatrixincludedir)" @list='$(pkgmatrixinclude_HEADERS)'; test -n "$(pkgmatrixincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkgmatrixincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgmatrixincludedir)" || exit $$?; \ done uninstall-pkgmatrixincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkgmatrixinclude_HEADERS)'; test -n "$(pkgmatrixincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgmatrixincludedir)'; $(am__uninstall_files_from_dir) # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev=''; for subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__remove_distdir) dist-lzma: distdir tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma $(am__remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lzma*) \ lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\ *.tar.lz*) \ lzip -dc $(distdir).tar.lz | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @test -n '$(distuninstallcheck_dir)' || { \ echo 'ERROR: trying to run $@ with an empty' \ '$$(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ $(am__cd) '$(distuninstallcheck_dir)' || { \ echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am check: check-recursive all-am: Makefile $(LTLIBRARIES) $(PROGRAMS) $(HEADERS) install-binPROGRAMS: install-libLTLIBRARIES installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" "$(DESTDIR)$(pkgincludedir)" "$(DESTDIR)$(pkgislincludedir)" "$(DESTDIR)$(pkgmatrixincludedir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-data-local install-pkgincludeHEADERS \ install-pkgislincludeHEADERS install-pkgmatrixincludeHEADERS install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-binPROGRAMS install-libLTLIBRARIES install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-binPROGRAMS uninstall-libLTLIBRARIES \ uninstall-local uninstall-pkgincludeHEADERS \ uninstall-pkgislincludeHEADERS \ uninstall-pkgmatrixincludeHEADERS .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) ctags-recursive \ install-am install-strip tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am am--refresh check check-am clean clean-binPROGRAMS \ clean-generic clean-libLTLIBRARIES clean-libtool ctags \ ctags-recursive dist dist-all dist-bzip2 dist-gzip dist-hook \ dist-lzip dist-lzma dist-shar dist-tarZ dist-xz dist-zip \ distcheck distclean distclean-compile distclean-generic \ distclean-libtool distclean-tags distcleancheck distdir \ distuninstallcheck dvi dvi-am html html-am info info-am \ install install-am install-binPROGRAMS install-data \ install-data-am install-data-local install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-libLTLIBRARIES \ install-man install-pdf install-pdf-am \ install-pkgincludeHEADERS install-pkgislincludeHEADERS \ install-pkgmatrixincludeHEADERS install-ps install-ps-am \ install-strip installcheck installcheck-am installdirs \ installdirs-am maintainer-clean maintainer-clean-generic \ mostlyclean mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am tags tags-recursive \ uninstall uninstall-am uninstall-binPROGRAMS \ uninstall-libLTLIBRARIES uninstall-local \ uninstall-pkgincludeHEADERS uninstall-pkgislincludeHEADERS \ uninstall-pkgmatrixincludeHEADERS FORCE: isl/libisl.la: FORCE cd isl; $(MAKE) $(AM_MAKEFLAGS) libisl.la version.h: @GIT_INDEX@ echo '#define CLOOG_HEAD "'`$(top_builddir)/genversion.sh`'"' > $@ install-data-local: @test -z "$(pkgconfig_libdir)" || $(mkdir_p) "$(DESTDIR)$(pkgconfig_libdir)" $(INSTALL_DATA) $(pkgconfig_libfile) "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" @test -z "$(DESTDIR)$(libdir)/isl" || $(mkdir_p) "$(DESTDIR)$(libdir)/isl" $(INSTALL_DATA) "$(top_srcdir)/cmake/isl-config.cmake" "$(DESTDIR)$(libdir)/isl/" @test -z "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)" || $(mkdir_p) "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)" $(INSTALL_DATA) "$(top_srcdir)/cmake/cloog-isl-config.cmake" "$(DESTDIR)$(libdir)/$(PACKAGE_NAME)/" uninstall-local: rm -f "$(DESTDIR)$(pkgconfig_libdir)/$(pkgconfig_libfile)" dist-hook: rm -f $(distdir)/test/Makefile $(top_builddir)/genversion.sh > $(distdir)/CLOOG_HEAD (cd doc; make cloog.pdf) && cp doc/cloog.pdf $(distdir)/doc/ #/***************************************************************************** # * Rules * # *****************************************************************************/ valcheck: $(MAKE) valgrind -C test total: @echo " /*-----------------------------------------------*" @echo " * CLooG *" @echo " *-----------------------------------------------*/" $(MAKE) uninstall $(MAKE) clean $(MAKE) $(MAKE) install doc: @echo " /*-----------------------------------------------*" @echo " * Generating CLooG's documentation *" @echo " *-----------------------------------------------*/" doxygen ./autoconf/Doxyfile # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: cloog-0.18.2/genversion.sh.in0000775000175000017500000000054012254312305012747 00000000000000#! /bin/sh srcdir=@abs_srcdir@ PACKAGE=@PACKAGE@ VERSION=@VERSION@ if test -f $srcdir/.git/HEAD; then GIT_REPO="$srcdir/.git" GIT_HEAD_ID=`GIT_DIR=$GIT_REPO git describe` elif test -f $srcdir/CLOOG_HEAD; then GIT_HEAD_ID=`cat $srcdir/CLOOG_HEAD` else GIT_HEAD_ID="$PACKAGE-$VERSION-UNKNOWN" fi echo $GIT_HEAD_ID | sed -e 's/cloog-//' cloog-0.18.2/autoconf/0000775000175000017500000000000012254314446011533 500000000000000cloog-0.18.2/autoconf/depcomp0000755000175000017500000004755612254313270013041 00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2011-12-04.11; # UTC # Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007, 2009, 2010, # 2011 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by `PROGRAMS ARGS'. object Object file output by `PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputting dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi cygpath_u="cygpath -u -f -" if test "$depmode" = msvcmsys; then # This is just like msvisualcpp but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvisualcpp fi if test "$depmode" = msvc7msys; then # This is just like msvc7 but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvc7 fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. hp depmode also adds that space, but also prefixes the VPATH ## to the object. Take care to not repeat it in the output. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile" # Add `dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mechanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; msvc7) if test "$libtool" = yes; then showIncludes=-Wc,-showIncludes else showIncludes=-showIncludes fi "$@" $showIncludes > "$tmpdepfile" stat=$? grep -v '^Note: including file: ' "$tmpdepfile" if test "$stat" = 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # The first sed program below extracts the file names and escapes # backslashes for cygpath. The second sed program outputs the file # name when reading, but also accumulates all include files in the # hold buffer in order to output them again at the end. This only # works with sed implementations that can handle large buffers. sed < "$tmpdepfile" -n ' /^Note: including file: *\(.*\)/ { s//\1/ s/\\/\\\\/g p }' | $cygpath_u | sort -u | sed -n ' s/ /\\ /g s/\(.*\)/ \1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/ / G p }' >> "$depfile" rm -f "$tmpdepfile" ;; msvc7msys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # X makedepend shift cleared=no eat=no for arg do case $cleared in no) set ""; shift cleared=yes ;; esac if test $eat = yes; then eat=no continue fi case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -arch) eat=yes ;; -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix=`echo "$object" | sed 's/^.*\././'` touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" # makedepend may prepend the VPATH from the source file name to the object. # No need to regex-escape $object, excess matching of '.' is harmless. sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi IFS=" " for arg do case "$arg" in -o) shift ;; $object) shift ;; "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E 2>/dev/null | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; msvcmsys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: cloog-0.18.2/autoconf/config.sub0000755000175000017500000010541212254313265013435 00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2013 Free Software Foundation, Inc. timestamp='2013-10-01' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # Please send patches with a ChangeLog entry to config-patches@gnu.org. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright 1992-2013 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \ linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \ knetbsd*-gnu* | netbsd*-gnu* | \ kopensolaris*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; android-linux) os=-linux-android basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray | -microblaze*) os= basic_machine=$1 ;; -bluegene*) os=-cnk ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*178) os=-lynxos178 ;; -lynx*5) os=-lynxos5 ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | aarch64 | aarch64_be \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arceb \ | arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \ | avr | avr32 \ | be32 | be64 \ | bfin \ | c4x | c8051 | clipper \ | d10v | d30v | dlx | dsp16xx \ | epiphany \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | hexagon \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | k1om \ | le32 | le64 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | microblazeel | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipsr5900 | mipsr5900el \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nds32 | nds32le | nds32be \ | nios | nios2 | nios2eb | nios2el \ | ns16k | ns32k \ | open8 \ | or1k | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle \ | pyramid \ | rl78 | rx \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu \ | tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \ | ubicom32 \ | v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \ | we32k \ | x86 | xc16x | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; c54x) basic_machine=tic54x-unknown ;; c55x) basic_machine=tic55x-unknown ;; c6x) basic_machine=tic6x-unknown ;; m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip) basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; strongarm | thumb | xscale) basic_machine=arm-unknown ;; xgate) basic_machine=$basic_machine-unknown os=-none ;; xscaleeb) basic_machine=armeb-unknown ;; xscaleel) basic_machine=armel-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | aarch64-* | aarch64_be-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | be32-* | be64-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* \ | c8051-* | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | hexagon-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | k1om-* \ | le32-* | le64-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | microblaze-* | microblazeel-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipsr5900-* | mipsr5900el-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nds32-* | nds32le-* | nds32be-* \ | nios-* | nios2-* | nios2eb-* | nios2el-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | open8-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \ | pyramid-* \ | rl78-* | romp-* | rs6000-* | rx-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx?-* \ | tahoe-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tile*-* \ | tron-* \ | ubicom32-* \ | v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \ | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; bluegene*) basic_machine=powerpc-ibm os=-cnk ;; c54x-*) basic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c55x-*) basic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c6x-*) basic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16 | cr16-*) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; microblaze*) basic_machine=microblaze-xilinx ;; mingw64) basic_machine=x86_64-pc os=-mingw64 ;; mingw32) basic_machine=i686-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; msys) basic_machine=i686-pc os=-msys ;; mvs) basic_machine=i370-ibm os=-mvs ;; nacl) basic_machine=le32-unknown os=-nacl ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; neo-tandem) basic_machine=neo-tandem ;; nse-tandem) basic_machine=nse-tandem ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc | ppcbe) basic_machine=powerpc-unknown ;; ppc-* | ppcbe-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos | rdos64) basic_machine=x86_64-pc os=-rdos ;; rdos32) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; strongarm-* | thumb-*) basic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'` ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tile*) basic_machine=$basic_machine-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; xscale-* | xscalee[bl]-*) basic_machine=`echo $basic_machine | sed 's/^xscale/arm/'` ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -auroraux) os=-auroraux ;; -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \ | -sym* | -kopensolaris* | -plan9* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -bitrig* | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* \ | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \ | -linux-newlib* | -linux-musl* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -nacl*) ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; c8051-*) os=-elf ;; hexagon-*) os=-elf ;; tic54x-*) os=-coff ;; tic55x-*) os=-coff ;; tic6x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or1k-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -cnk*|-aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: cloog-0.18.2/autoconf/ltmain.sh0000644000175000017500000115505212254313265013300 00000000000000#! /bin/sh # libtool (GNU libtool) 2.4.2.418 # Provide generalized library-building support services. # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996-2013 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # GNU Libtool is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program. If not, see . PROGRAM=libtool PACKAGE=libtool VERSION=2.4.2.418 package_revision=2.4.2.418 ## ------ ## ## Usage. ## ## ------ ## # Run './libtool --help' for help with using this script from the # command line. ## ------------------------------- ## ## User overridable command paths. ## ## ------------------------------- ## # After configure completes, it has a better idea of some of the # shell tools we need than the defaults used by the functions shared # with bootstrap, so set those here where they can still be over- # ridden by the user, but otherwise take precedence. : ${AUTOCONF="autoconf"} : ${AUTOMAKE="automake"} ## -------------------------- ## ## Source external libraries. ## ## -------------------------- ## # Much of our low-level functionality needs to be sourced from external # libraries, which are installed to $pkgauxdir. # Set a version string for this script. scriptversion=2013-08-23.20; # UTC # General shell script boiler plate, and helper functions. # Written by Gary V. Vaughan, 2004 # Copyright (C) 2004-2013 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # As a special exception to the GNU General Public License, if you distribute # this file as part of a program or library that is built using GNU Libtool, # you may include this file under the same distribution terms that you use # for the rest of that program. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNES FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # Please report bugs or propose patches to gary@gnu.org. ## ------ ## ## Usage. ## ## ------ ## # Evaluate this file near the top of your script to gain access to # the functions and variables defined here: # # . `echo "$0" | ${SED-sed} 's|[^/]*$||'`/build-aux/funclib.sh # # If you need to override any of the default environment variable # settings, do that before evaluating this file. ## -------------------- ## ## Shell normalisation. ## ## -------------------- ## # Some shells need a little help to be as Bourne compatible as possible. # Before doing anything else, make sure all that help has been provided! DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix ;; esac fi # NLS nuisances: We save the old values in case they are required later. _G_user_locale= _G_safe_locale= for _G_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test set = \"\${$_G_var+set}\"; then save_$_G_var=\$$_G_var $_G_var=C export $_G_var _G_user_locale=\"$_G_var=\\\$save_\$_G_var; \$_G_user_locale\" _G_safe_locale=\"$_G_var=C; \$_G_safe_locale\" fi" done # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Make sure IFS has a sensible default sp=' ' nl=' ' IFS="$sp $nl" # There are still modern systems that have problems with 'echo' mis- # handling backslashes, among others, so make sure $bs_echo is set to a # command that correctly interprets backslashes. # (this code from Autoconf 2.68) # Printing a long string crashes Solaris 7 /usr/bin/printf. bs_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' bs_echo=$bs_echo$bs_echo$bs_echo$bs_echo$bs_echo bs_echo=$bs_echo$bs_echo$bs_echo$bs_echo$bs_echo$bs_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $bs_echo`" = "X$bs_echo") 2>/dev/null; then bs_echo='print -r --' bs_echo_n='print -rn --' elif (test "X`printf %s $bs_echo`" = "X$bs_echo") 2>/dev/null; then bs_echo='printf %s\n' bs_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $bs_echo) 2>/dev/null`" = "X-n $bs_echo"; then bs_echo_body='eval /usr/ucb/echo -n "$1$nl"' bs_echo_n='/usr/ucb/echo -n' else bs_echo_body='eval expr "X$1" : "X\\(.*\\)"' bs_echo_n_body='eval arg=$1; case $arg in #( *"$nl"*) expr "X$arg" : "X\\(.*\\)$nl"; arg=`expr "X$arg" : ".*$nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$nl" ' export bs_echo_n_body bs_echo_n='sh -c $bs_echo_n_body bs_echo' fi export bs_echo_body bs_echo='sh -c $bs_echo_body bs_echo' fi ## ------------------------------- ## ## User overridable command paths. ## ## ------------------------------- ## # All uppercase variable names are used for environment variables. These # variables can be overridden by the user before calling a script that # uses them if a suitable command of that name is not already available # in the command search PATH. : ${CP="cp -f"} : ${ECHO="$bs_echo"} : ${EGREP="grep -E"} : ${FGREP="grep -F"} : ${GREP="grep"} : ${LN_S="ln -s"} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SED="sed"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} ## -------------------- ## ## Useful sed snippets. ## ## -------------------- ## sed_dirname='s|/[^/]*$||' sed_basename='s|^.*/||' # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s|\([`"$\\]\)|\\\1|g' # Same as above, but do not quote variable references. sed_double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution that turns a string into a regex matching for the # string literally. sed_make_literal_regex='s|[].[^$\\*\/]|\\&|g' # Sed substitution that converts a w32 file name or path # that contains forward slashes, into one that contains # (escaped) backslashes. A very naive implementation. sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Re-'\' parameter expansions in output of sed_double_quote_subst that # were '\'-ed in input to the same. If an odd number of '\' preceded a # '$' in input to sed_double_quote_subst, that '$' was protected from # expansion. Since each input '\' is now two '\'s, look for any number # of runs of four '\'s followed by two '\'s and then a '$'. '\' that '$'. _G_bs='\\' _G_bs2='\\\\' _G_bs4='\\\\\\\\' _G_dollar='\$' sed_double_backslash="\ s/$_G_bs4/&\\ /g s/^$_G_bs2$_G_dollar/$_G_bs&/ s/\\([^$_G_bs]\\)$_G_bs2$_G_dollar/\\1$_G_bs2$_G_bs$_G_dollar/g s/\n//g" ## ----------------- ## ## Global variables. ## ## ----------------- ## # Except for the global variables explicitly listed below, the following # functions in the '^func_' namespace, and the '^require_' namespace # variables initialised in the 'Resource management' section, sourcing # this file will not pollute your global namespace with anything # else. There's no portable way to scope variables in Bourne shell # though, so actually running these functions will sometimes place # results into a variable named after the function, and often use # temporary variables in the '^_G_' namespace. If you are careful to # avoid using those namespaces casually in your sourcing script, things # should continue to work as you expect. And, of course, you can freely # overwrite any of the functions or variables defined here before # calling anything to customize them. EXIT_SUCCESS=0 EXIT_FAILURE=1 EXIT_MISMATCH=63 # $? = 63 is used to indicate version mismatch to missing. EXIT_SKIP=77 # $? = 77 is used to indicate a skipped test to automake. # Allow overriding, eg assuming that you follow the convention of # putting '$debug_cmd' at the start of all your functions, you can get # bash to show function call trace with: # # debug_cmd='eval echo "${FUNCNAME[0]} $*" >&2' bash your-script-name debug_cmd=${debug_cmd-":"} exit_cmd=: # By convention, finish your script with: # # exit $exit_status # # so that you can set exit_status to non-zero if you want to indicate # something went wrong during execution without actually bailing out at # the point of failure. exit_status=$EXIT_SUCCESS # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath=$0 # The name of this program. progname=`$bs_echo "$progpath" |$SED "$sed_basename"` # Make sure we have an absolute progpath for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=`$bs_echo "$progpath" |$SED "$sed_dirname"` progdir=`cd "$progdir" && pwd` progpath=$progdir/$progname ;; *) _G_IFS=$IFS IFS=${PATH_SEPARATOR-:} for progdir in $PATH; do IFS=$_G_IFS test -x "$progdir/$progname" && break done IFS=$_G_IFS test -n "$progdir" || progdir=`pwd` progpath=$progdir/$progname ;; esac ## ----------------- ## ## Standard options. ## ## ----------------- ## # The following options affect the operation of the functions defined # below, and should be set appropriately depending on run-time para- # meters passed on the command line. opt_dry_run=false opt_quiet=false opt_verbose=false # Categories 'all' and 'none' are always available. Append any others # you will pass as the first argument to func_warning from your own # code. warning_categories= # By default, display warnings according to 'opt_warning_types'. Set # 'warning_func' to ':' to elide all warnings, or func_fatal_error to # treat the next displayed warning as a fatal error. warning_func=func_warn_and_continue # Set to 'all' to display all warnings, 'none' to suppress all # warnings, or a space delimited list of some subset of # 'warning_categories' to display only the listed warnings. opt_warning_types=all ## -------------------- ## ## Resource management. ## ## -------------------- ## # This section contains definitions for functions that each ensure a # particular resource (a file, or a non-empty configuration variable for # example) is available, and if appropriate to extract default values # from pertinent package files. Call them using their associated # 'require_*' variable to ensure that they are executed, at most, once. # # It's entirely deliberate that calling these functions can set # variables that don't obey the namespace limitations obeyed by the rest # of this file, in order that that they be as useful as possible to # callers. # require_term_colors # ------------------- # Allow display of bold text on terminals that support it. require_term_colors=func_require_term_colors func_require_term_colors () { $debug_cmd test -t 1 && { # COLORTERM and USE_ANSI_COLORS environment variables take # precedence, because most terminfo databases neglect to describe # whether color sequences are supported. test -n "${COLORTERM+set}" && : ${USE_ANSI_COLORS="1"} if test 1 = "$USE_ANSI_COLORS"; then # Standard ANSI escape sequences tc_reset='' tc_bold=''; tc_standout='' tc_red=''; tc_green='' tc_blue=''; tc_cyan='' else # Otherwise trust the terminfo database after all. test -n "`tput sgr0 2>/dev/null`" && { tc_reset=`tput sgr0` test -n "`tput bold 2>/dev/null`" && tc_bold=`tput bold` tc_standout=$tc_bold test -n "`tput smso 2>/dev/null`" && tc_standout=`tput smso` test -n "`tput setaf 1 2>/dev/null`" && tc_red=`tput setaf 1` test -n "`tput setaf 2 2>/dev/null`" && tc_green=`tput setaf 2` test -n "`tput setaf 4 2>/dev/null`" && tc_blue=`tput setaf 4` test -n "`tput setaf 5 2>/dev/null`" && tc_cyan=`tput setaf 5` } fi } require_term_colors=: } ## ----------------- ## ## Function library. ## ## ----------------- ## # This section contains a variety of useful functions to call in your # scripts. Take note of the portable wrappers for features provided by # some modern shells, which will fall back to slower equivalents on # less featureful shells. # func_append VAR VALUE # --------------------- # Append VALUE onto the existing contents of VAR. # We should try to minimise forks, especially on Windows where they are # unreasonably slow, so skip the feature probes when bash or zsh are # being used: if test set = "${BASH_VERSION+set}${ZSH_VERSION+set}"; then : ${_G_HAVE_ARITH_OP="yes"} : ${_G_HAVE_XSI_OPS="yes"} # The += operator was introduced in bash 3.1 case $BASH_VERSION in [12].* | 3.0 | 3.0*) ;; *) : ${_G_HAVE_PLUSEQ_OP="yes"} ;; esac fi # _G_HAVE_PLUSEQ_OP # Can be empty, in which case the shell is probed, "yes" if += is # useable or anything else if it does not work. test -z "$_G_HAVE_PLUSEQ_OP" \ && (eval 'x=a; x+=" b"; test "a b" = "$x"') 2>/dev/null \ && _G_HAVE_PLUSEQ_OP=yes if test yes = "$_G_HAVE_PLUSEQ_OP" then # This is an XSI compatible shell, allowing a faster implementation... eval 'func_append () { $debug_cmd eval "$1+=\$2" }' else # ...otherwise fall back to using expr, which is often a shell builtin. func_append () { $debug_cmd eval "$1=\$$1\$2" } fi # func_append_quoted VAR VALUE # ---------------------------- # Quote VALUE and append to the end of shell variable VAR, separated # by a space. if test yes = "$_G_HAVE_PLUSEQ_OP"; then eval 'func_append_quoted () { $debug_cmd func_quote_for_eval "$2" eval "$1+=\\ \$func_quote_for_eval_result" }' else func_append_quoted () { $debug_cmd func_quote_for_eval "$2" eval "$1=\$$1\\ \$func_quote_for_eval_result" } fi # func_append_uniq VAR VALUE # -------------------------- # Append unique VALUE onto the existing contents of VAR, assuming # entries are delimited by the first character of VALUE. For example: # # func_append_uniq options " --another-option option-argument" # # will only append to $options if " --another-option option-argument " # is not already present somewhere in $options already (note spaces at # each end implied by leading space in second argument). func_append_uniq () { $debug_cmd eval _G_current_value='`$bs_echo $'$1'`' _G_delim=`expr "$2" : '\(.\)'` case $_G_delim$_G_current_value$_G_delim in *"$2$_G_delim"*) ;; *) func_append "$@" ;; esac } # func_arith TERM... # ------------------ # Set func_arith_result to the result of evaluating TERMs. test -z "$_G_HAVE_ARITH_OP" \ && (eval 'test 2 = $(( 1 + 1 ))') 2>/dev/null \ && _G_HAVE_ARITH_OP=yes if test yes = "$_G_HAVE_ARITH_OP"; then eval 'func_arith () { $debug_cmd func_arith_result=$(( $* )) }' else func_arith () { $debug_cmd func_arith_result=`expr "$@"` } fi # func_basename FILE # ------------------ # Set func_basename_result to FILE with everything up to and including # the last / stripped. if test yes = "$_G_HAVE_XSI_OPS"; then # If this shell supports suffix pattern removal, then use it to avoid # forking. Hide the definitions single quotes in case the shell chokes # on unsupported syntax... _b='func_basename_result=${1##*/}' _d='case $1 in */*) func_dirname_result=${1%/*}$2 ;; * ) func_dirname_result=$3 ;; esac' else # ...otherwise fall back to using sed. _b='func_basename_result=`$ECHO "$1" |$SED "$sed_basename"`' _d='func_dirname_result=`$ECHO "$1" |$SED "$sed_dirname"` if test "X$func_dirname_result" = "X$1"; then func_dirname_result=$3 else func_append func_dirname_result "$2" fi' fi eval 'func_basename () { $debug_cmd '"$_b"' }' # func_dirname FILE APPEND NONDIR_REPLACEMENT # ------------------------------------------- # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. eval 'func_dirname () { $debug_cmd '"$_d"' }' # func_dirname_and_basename FILE APPEND NONDIR_REPLACEMENT # -------------------------------------------------------- # Perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # For efficiency, we do not delegate to the functions above but instead # duplicate the functionality here. eval 'func_dirname_and_basename () { $debug_cmd '"$_b"' '"$_d"' }' # func_echo ARG... # ---------------- # Echo program name prefixed message. func_echo () { $debug_cmd _G_message=$* func_echo_IFS=$IFS IFS=$nl for _G_line in $_G_message; do IFS=$func_echo_IFS $bs_echo "$progname: $_G_line" done IFS=$func_echo_IFS } # func_echo_all ARG... # -------------------- # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } # func_echo_infix_1 INFIX ARG... # ------------------------------ # Echo program name, followed by INFIX on the first line, with any # additional lines not showing INFIX. func_echo_infix_1 () { $debug_cmd $require_term_colors _G_infix=$1; shift _G_indent=$_G_infix _G_prefix="$progname: $_G_infix: " _G_message=$* # Strip color escape sequences before counting printable length for _G_tc in "$tc_reset" "$tc_bold" "$tc_standout" "$tc_red" "$tc_green" "$tc_blue" "$tc_cyan" do test -n "$_G_tc" && { _G_esc_tc=`$bs_echo "$_G_tc" | sed "$sed_make_literal_regex"` _G_indent=`$bs_echo "$_G_indent" | sed "s|$_G_esc_tc||g"` } done _G_indent="$progname: "`echo "$_G_indent" | sed 's|.| |g'`" " ## exclude from sc_prohibit_nested_quotes func_echo_infix_1_IFS=$IFS IFS=$nl for _G_line in $_G_message; do IFS=$func_echo_infix_1_IFS $bs_echo "$_G_prefix$tc_bold$_G_line$tc_reset" >&2 _G_prefix=$_G_indent done IFS=$func_echo_infix_1_IFS } # func_error ARG... # ----------------- # Echo program name prefixed message to standard error. func_error () { $debug_cmd $require_term_colors func_echo_infix_1 " $tc_standout${tc_red}error$tc_reset" "$*" >&2 } # func_fatal_error ARG... # ----------------------- # Echo program name prefixed message to standard error, and exit. func_fatal_error () { $debug_cmd func_error "$*" exit $EXIT_FAILURE } # func_grep EXPRESSION FILENAME # ----------------------------- # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $debug_cmd $GREP "$1" "$2" >/dev/null 2>&1 } # func_len STRING # --------------- # Set func_len_result to the length of STRING. STRING may not # start with a hyphen. test -z "$_G_HAVE_XSI_OPS" \ && (eval 'x=a/b/c; test 5aa/bb/cc = "${#x}${x%%/*}${x%/*}${x#*/}${x##*/}"') 2>/dev/null \ && _G_HAVE_XSI_OPS=yes if test yes = "$_G_HAVE_XSI_OPS"; then eval 'func_len () { $debug_cmd func_len_result=${#1} }' else func_len () { $debug_cmd func_len_result=`expr "$1" : ".*" 2>/dev/null || echo $max_cmd_len` } fi # func_mkdir_p DIRECTORY-PATH # --------------------------- # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { $debug_cmd _G_directory_path=$1 _G_dir_list= if test -n "$_G_directory_path" && test : != "$opt_dry_run"; then # Protect directory names starting with '-' case $_G_directory_path in -*) _G_directory_path=./$_G_directory_path ;; esac # While some portion of DIR does not yet exist... while test ! -d "$_G_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. _G_dir_list=$_G_directory_path:$_G_dir_list # If the last portion added has no slash in it, the list is done case $_G_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop _G_directory_path=`$ECHO "$_G_directory_path" | $SED -e "$sed_dirname"` done _G_dir_list=`$ECHO "$_G_dir_list" | $SED 's|:*$||'` func_mkdir_p_IFS=$IFS; IFS=: for _G_dir in $_G_dir_list; do IFS=$func_mkdir_p_IFS # mkdir can fail with a 'File exist' error if two processes # try to create one of the directories concurrently. Don't # stop in that case! $MKDIR "$_G_dir" 2>/dev/null || : done IFS=$func_mkdir_p_IFS # Bail out if we (or some other process) failed to create a directory. test -d "$_G_directory_path" || \ func_fatal_error "Failed to create '$1'" fi } # func_mktempdir [BASENAME] # ------------------------- # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, BASENAME is the basename for that directory. func_mktempdir () { $debug_cmd _G_template=${TMPDIR-/tmp}/${1-$progname} if test : = "$opt_dry_run"; then # Return a directory name, but don't create it in dry-run mode _G_tmpdir=$_G_template-$$ else # If mktemp works, use that first and foremost _G_tmpdir=`mktemp -d "$_G_template-XXXXXXXX" 2>/dev/null` if test ! -d "$_G_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race _G_tmpdir=$_G_template-${RANDOM-0}$$ func_mktempdir_umask=`umask` umask 0077 $MKDIR "$_G_tmpdir" umask $func_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$_G_tmpdir" || \ func_fatal_error "cannot create temporary directory '$_G_tmpdir'" fi $ECHO "$_G_tmpdir" } # func_normal_abspath PATH # ------------------------ # Remove doubled-up and trailing slashes, "." path components, # and cancel out any ".." path components in PATH after making # it an absolute path. func_normal_abspath () { $debug_cmd # These SED scripts presuppose an absolute path with a trailing slash. _G_pathcar='s|^/\([^/]*\).*$|\1|' _G_pathcdr='s|^/[^/]*||' _G_removedotparts=':dotsl s|/\./|/|g t dotsl s|/\.$|/|' _G_collapseslashes='s|/\{1,\}|/|g' _G_finalslash='s|/*$|/|' # Start from root dir and reassemble the path. func_normal_abspath_result= func_normal_abspath_tpath=$1 func_normal_abspath_altnamespace= case $func_normal_abspath_tpath in "") # Empty path, that just means $cwd. func_stripname '' '/' "`pwd`" func_normal_abspath_result=$func_stripname_result return ;; # The next three entries are used to spot a run of precisely # two leading slashes without using negated character classes; # we take advantage of case's first-match behaviour. ///*) # Unusual form of absolute path, do nothing. ;; //*) # Not necessarily an ordinary path; POSIX reserves leading '//' # and for example Cygwin uses it to access remote file shares # over CIFS/SMB, so we conserve a leading double slash if found. func_normal_abspath_altnamespace=/ ;; /*) # Absolute path, do nothing. ;; *) # Relative path, prepend $cwd. func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath ;; esac # Cancel out all the simple stuff to save iterations. We also want # the path to end with a slash for ease of parsing, so make sure # there is one (and only one) here. func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$_G_removedotparts" -e "$_G_collapseslashes" -e "$_G_finalslash"` while :; do # Processed it all yet? if test / = "$func_normal_abspath_tpath"; then # If we ascended to the root using ".." the result may be empty now. if test -z "$func_normal_abspath_result"; then func_normal_abspath_result=/ fi break fi func_normal_abspath_tcomponent=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$_G_pathcar"` func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$_G_pathcdr"` # Figure out what to do with it case $func_normal_abspath_tcomponent in "") # Trailing empty path component, ignore it. ;; ..) # Parent dir; strip last assembled component from result. func_dirname "$func_normal_abspath_result" func_normal_abspath_result=$func_dirname_result ;; *) # Actual path component, append it. func_append func_normal_abspath_result "/$func_normal_abspath_tcomponent" ;; esac done # Restore leading double-slash if one was found on entry. func_normal_abspath_result=$func_normal_abspath_altnamespace$func_normal_abspath_result } # func_notquiet ARG... # -------------------- # Echo program name prefixed message only when not in quiet mode. func_notquiet () { $debug_cmd $opt_quiet || func_echo ${1+"$@"} # A bug in bash halts the script if the last line of a function # fails when set -e is in force, so we need another command to # work around that: : } # func_relative_path SRCDIR DSTDIR # -------------------------------- # Set func_relative_path_result to the relative path from SRCDIR to DSTDIR. func_relative_path () { $debug_cmd func_relative_path_result= func_normal_abspath "$1" func_relative_path_tlibdir=$func_normal_abspath_result func_normal_abspath "$2" func_relative_path_tbindir=$func_normal_abspath_result # Ascend the tree starting from libdir while :; do # check if we have found a prefix of bindir case $func_relative_path_tbindir in $func_relative_path_tlibdir) # found an exact match func_relative_path_tcancelled= break ;; $func_relative_path_tlibdir*) # found a matching prefix func_stripname "$func_relative_path_tlibdir" '' "$func_relative_path_tbindir" func_relative_path_tcancelled=$func_stripname_result if test -z "$func_relative_path_result"; then func_relative_path_result=. fi break ;; *) func_dirname $func_relative_path_tlibdir func_relative_path_tlibdir=$func_dirname_result if test -z "$func_relative_path_tlibdir"; then # Have to descend all the way to the root! func_relative_path_result=../$func_relative_path_result func_relative_path_tcancelled=$func_relative_path_tbindir break fi func_relative_path_result=../$func_relative_path_result ;; esac done # Now calculate path; take care to avoid doubling-up slashes. func_stripname '' '/' "$func_relative_path_result" func_relative_path_result=$func_stripname_result func_stripname '/' '/' "$func_relative_path_tcancelled" if test -n "$func_stripname_result"; then func_append func_relative_path_result "/$func_stripname_result" fi # Normalisation. If bindir is libdir, return '.' else relative path. if test -n "$func_relative_path_result"; then func_stripname './' '' "$func_relative_path_result" func_relative_path_result=$func_stripname_result fi test -n "$func_relative_path_result" || func_relative_path_result=. : } # func_quote_for_eval ARG... # -------------------------- # Aesthetically quote ARGs to be evaled later. # This function returns two values: # i) func_quote_for_eval_result # double-quoted, suitable for a subsequent eval # ii) func_quote_for_eval_unquoted_result # has all characters that are still active within double # quotes backslashified. func_quote_for_eval () { $debug_cmd func_quote_for_eval_unquoted_result= func_quote_for_eval_result= while test 0 -lt $#; do case $1 in *[\\\`\"\$]*) _G_unquoted_arg=`printf '%s\n' "$1" |$SED "$sed_quote_subst"` ;; *) _G_unquoted_arg=$1 ;; esac if test -n "$func_quote_for_eval_unquoted_result"; then func_append func_quote_for_eval_unquoted_result " $_G_unquoted_arg" else func_append func_quote_for_eval_unquoted_result "$_G_unquoted_arg" fi case $_G_unquoted_arg in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and variable expansion # for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") _G_quoted_arg=\"$_G_unquoted_arg\" ;; *) _G_quoted_arg=$_G_unquoted_arg ;; esac if test -n "$func_quote_for_eval_result"; then func_append func_quote_for_eval_result " $_G_quoted_arg" else func_append func_quote_for_eval_result "$_G_quoted_arg" fi shift done } # func_quote_for_expand ARG # ------------------------- # Aesthetically quote ARG to be evaled later; same as above, # but do not quote variable references. func_quote_for_expand () { $debug_cmd case $1 in *[\\\`\"]*) _G_arg=`$ECHO "$1" | $SED \ -e "$sed_double_quote_subst" -e "$sed_double_backslash"` ;; *) _G_arg=$1 ;; esac case $_G_arg in # Double-quote args containing shell metacharacters to delay # word splitting and command substitution for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") _G_arg=\"$_G_arg\" ;; esac func_quote_for_expand_result=$_G_arg } # func_stripname PREFIX SUFFIX NAME # --------------------------------- # strip PREFIX and SUFFIX from NAME, and store in func_stripname_result. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). if test yes = "$_G_HAVE_XSI_OPS"; then eval 'func_stripname () { $debug_cmd # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary variable first. func_stripname_result=$3 func_stripname_result=${func_stripname_result#"$1"} func_stripname_result=${func_stripname_result%"$2"} }' else func_stripname () { $debug_cmd case $2 in .*) func_stripname_result=`$ECHO "$3" | $SED -e "s%^$1%%" -e "s%\\\\$2\$%%"`;; *) func_stripname_result=`$ECHO "$3" | $SED -e "s%^$1%%" -e "s%$2\$%%"`;; esac } fi # func_show_eval CMD [FAIL_EXP] # ----------------------------- # Unless opt_quiet is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. func_show_eval () { $debug_cmd _G_cmd=$1 _G_fail_exp=${2-':'} func_quote_for_expand "$_G_cmd" eval "func_notquiet $func_quote_for_expand_result" $opt_dry_run || { eval "$_G_cmd" _G_status=$? if test 0 -ne "$_G_status"; then eval "(exit $_G_status); $_G_fail_exp" fi } } # func_show_eval_locale CMD [FAIL_EXP] # ------------------------------------ # Unless opt_quiet is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. Use the saved locale for evaluation. func_show_eval_locale () { $debug_cmd _G_cmd=$1 _G_fail_exp=${2-':'} $opt_quiet || { func_quote_for_expand "$_G_cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || { eval "$_G_user_locale $_G_cmd" _G_status=$? eval "$_G_safe_locale" if test 0 -ne "$_G_status"; then eval "(exit $_G_status); $_G_fail_exp" fi } } # func_tr_sh # ---------- # Turn $1 into a string suitable for a shell variable name. # Result is stored in $func_tr_sh_result. All characters # not in the set a-zA-Z0-9_ are replaced with '_'. Further, # if $1 begins with a digit, a '_' is prepended as well. func_tr_sh () { $debug_cmd case $1 in [0-9]* | *[!a-zA-Z0-9_]*) func_tr_sh_result=`$ECHO "$1" | $SED -e 's/^\([0-9]\)/_\1/' -e 's/[^a-zA-Z0-9_]/_/g'` ;; * ) func_tr_sh_result=$1 ;; esac } # func_verbose ARG... # ------------------- # Echo program name prefixed message in verbose mode only. func_verbose () { $debug_cmd $opt_verbose && func_echo "$*" : } # func_warn_and_continue ARG... # ----------------------------- # Echo program name prefixed warning message to standard error. func_warn_and_continue () { $debug_cmd $require_term_colors func_echo_infix_1 "${tc_red}warning$tc_reset" "$*" >&2 } # func_warning CATEGORY ARG... # ---------------------------- # Echo program name prefixed warning message to standard error. Warning # messages can be filtered according to CATEGORY, where this function # elides messages where CATEGORY is not listed in the global variable # 'opt_warning_types'. func_warning () { $debug_cmd # CATEGORY must be in the warning_categories list! case " $warning_categories " in *" $1 "*) ;; *) func_internal_error "invalid warning category '$1'" ;; esac _G_category=$1 shift case " $opt_warning_types " in *" $_G_category "*) $warning_func ${1+"$@"} ;; esac } # func_sort_ver VER1 VER2 # ----------------------- # 'sort -V' is not generally available. # Note this deviates from the version comparison in automake # in that it treats 1.5 < 1.5.0, and treats 1.4.4a < 1.4-p3a # but this should suffice as we won't be specifying old # version formats or redundant trailing .0 in bootstrap.conf. # If we did want full compatibility then we should probably # use m4_version_compare from autoconf. func_sort_ver () { $debug_cmd ver1=$1 ver2=$2 # Split on '.' and compare each component. i=1 while :; do p1=`echo "$ver1" |cut -d. -f$i` p2=`echo "$ver2" |cut -d. -f$i` if test ! "$p1"; then echo "$1 $2" break elif test ! "$p2"; then echo "$2 $1" break elif test ! "$p1" = "$p2"; then if test "$p1" -gt "$p2" 2>/dev/null; then # numeric comparison echo "$2 $1" elif test "$p2" -gt "$p1" 2>/dev/null; then # numeric comparison echo "$1 $2" else # numeric, then lexicographic comparison lp=`printf "$p1\n$p2\n" |sort -n |tail -n1` if test "$lp" = "$p2"; then echo "$1 $2" else echo "$2 $1" fi fi break fi i=`expr $i + 1` done } # Local variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-pattern: "10/scriptversion=%:y-%02m-%02d.%02H; # UTC" # time-stamp-time-zone: "UTC" # End: #! /bin/sh # Set a version string for this script. scriptversion=2012-10-21.11; # UTC # A portable, pluggable option parser for Bourne shell. # Written by Gary V. Vaughan, 2010 # Copyright (C) 2010-2013 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # This program is free software: you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation, either version 3 of the License, or # (at your option) any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # Please report bugs or propose patches to gary@gnu.org. ## ------ ## ## Usage. ## ## ------ ## # This file is a library for parsing options in your shell scripts along # with assorted other useful supporting features that you can make use # of too. # # For the simplest scripts you might need only: # # #!/bin/sh # . relative/path/to/funclib.sh # . relative/path/to/options-parser # scriptversion=1.0 # func_options ${1+"$@"} # eval set dummy "$func_options_result"; shift # ...rest of your script... # # In order for the '--version' option to work, you will need to have a # suitably formatted comment like the one at the top of this file # starting with '# Written by ' and ending with '# warranty; '. # # For '-h' and '--help' to work, you will also need a one line # description of your script's purpose in a comment directly above the # '# Written by ' line, like the one at the top of this file. # # The default options also support '--debug', which will turn on shell # execution tracing (see the comment above debug_cmd below for another # use), and '--verbose' and the func_verbose function to allow your script # to display verbose messages only when your user has specified # '--verbose'. # # After sourcing this file, you can plug processing for additional # options by amending the variables from the 'Configuration' section # below, and following the instructions in the 'Option parsing' # section further down. ## -------------- ## ## Configuration. ## ## -------------- ## # You should override these variables in your script after sourcing this # file so that they reflect the customisations you have added to the # option parser. # The usage line for option parsing errors and the start of '-h' and # '--help' output messages. You can embed shell variables for delayed # expansion at the time the message is displayed, but you will need to # quote other shell meta-characters carefully to prevent them being # expanded when the contents are evaled. usage='$progpath [OPTION]...' # Short help message in response to '-h' and '--help'. Add to this or # override it after sourcing this library to reflect the full set of # options your script accepts. usage_message="\ --debug enable verbose shell tracing -W, --warnings=CATEGORY report the warnings falling in CATEGORY [all] -v, --verbose verbosely report processing --version print version information and exit -h, --help print short or long help message and exit " # Additional text appended to 'usage_message' in response to '--help'. long_help_message=" Warning categories include: 'all' show all warnings 'none' turn off all the warnings 'error' warnings are treated as fatal errors" # Help message printed before fatal option parsing errors. fatal_help="Try '\$progname --help' for more information." ## ------------------------- ## ## Hook function management. ## ## ------------------------- ## # This section contains functions for adding, removing, and running hooks # to the main code. A hook is just a named list of of function, that can # be run in order later on. # func_hookable FUNC_NAME # ----------------------- # Declare that FUNC_NAME will run hooks added with # 'func_add_hook FUNC_NAME ...'. func_hookable () { $debug_cmd func_append hookable_fns " $1" } # func_add_hook FUNC_NAME HOOK_FUNC # --------------------------------- # Request that FUNC_NAME call HOOK_FUNC before it returns. FUNC_NAME must # first have been declared "hookable" by a call to 'func_hookable'. func_add_hook () { $debug_cmd case " $hookable_fns " in *" $1 "*) ;; *) func_fatal_error "'$1' does not accept hook functions." ;; esac eval func_append ${1}_hooks '" $2"' } # func_remove_hook FUNC_NAME HOOK_FUNC # ------------------------------------ # Remove HOOK_FUNC from the list of functions called by FUNC_NAME. func_remove_hook () { $debug_cmd eval ${1}_hooks='`$bs_echo "\$'$1'_hooks" |$SED "s| '$2'||"`' } # func_run_hooks FUNC_NAME [ARG]... # --------------------------------- # Run all hook functions registered to FUNC_NAME. # It is assumed that the list of hook functions contains nothing more # than a whitespace-delimited list of legal shell function names, and # no effort is wasted trying to catch shell meta-characters or preserve # whitespace. func_run_hooks () { $debug_cmd case " $hookable_fns " in *" $1 "*) ;; *) func_fatal_error "'$1' does not support hook funcions.n" ;; esac eval _G_hook_fns=\$$1_hooks; shift for _G_hook in $_G_hook_fns; do eval $_G_hook '"$@"' # store returned options list back into positional # parameters for next 'cmd' execution. eval _G_hook_result=\$${_G_hook}_result eval set dummy "$_G_hook_result"; shift done func_quote_for_eval ${1+"$@"} func_run_hooks_result=$func_quote_for_eval_result } ## --------------- ## ## Option parsing. ## ## --------------- ## # In order to add your own option parsing hooks, you must accept the # full positional parameter list in your hook function, remove any # options that you action, and then pass back the remaining unprocessed # options in '_result', escaped suitably for # 'eval'. Like this: # # my_options_prep () # { # $debug_cmd # # # Extend the existing usage message. # usage_message=$usage_message' # -s, --silent don'\''t print informational messages # ' # # func_quote_for_eval ${1+"$@"} # my_options_prep_result=$func_quote_for_eval_result # } # func_add_hook func_options_prep my_options_prep # # # my_silent_option () # { # $debug_cmd # # # Note that for efficiency, we parse as many options as we can # # recognise in a loop before passing the remainder back to the # # caller on the first unrecognised argument we encounter. # while test $# -gt 0; do # opt=$1; shift # case $opt in # --silent|-s) opt_silent=: ;; # # Separate non-argument short options: # -s*) func_split_short_opt "$_G_opt" # set dummy "$func_split_short_opt_name" \ # "-$func_split_short_opt_arg" ${1+"$@"} # shift # ;; # *) set dummy "$_G_opt" "$*"; shift; break ;; # esac # done # # func_quote_for_eval ${1+"$@"} # my_silent_option_result=$func_quote_for_eval_result # } # func_add_hook func_parse_options my_silent_option # # # my_option_validation () # { # $debug_cmd # # $opt_silent && $opt_verbose && func_fatal_help "\ # '--silent' and '--verbose' options are mutually exclusive." # # func_quote_for_eval ${1+"$@"} # my_option_validation_result=$func_quote_for_eval_result # } # func_add_hook func_validate_options my_option_validation # # You'll alse need to manually amend $usage_message to reflect the extra # options you parse. It's preferable to append if you can, so that # multiple option parsing hooks can be added safely. # func_options [ARG]... # --------------------- # All the functions called inside func_options are hookable. See the # individual implementations for details. func_hookable func_options func_options () { $debug_cmd func_options_prep ${1+"$@"} eval func_parse_options \ ${func_options_prep_result+"$func_options_prep_result"} eval func_validate_options \ ${func_parse_options_result+"$func_parse_options_result"} eval func_run_hooks func_options \ ${func_validate_options_result+"$func_validate_options_result"} # save modified positional parameters for caller func_options_result=$func_run_hooks_result } # func_options_prep [ARG]... # -------------------------- # All initialisations required before starting the option parse loop. # Note that when calling hook functions, we pass through the list of # positional parameters. If a hook function modifies that list, and # needs to propogate that back to rest of this script, then the complete # modified list must be put in 'func_run_hooks_result' before # returning. func_hookable func_options_prep func_options_prep () { $debug_cmd # Option defaults: opt_verbose=false opt_warning_types= func_run_hooks func_options_prep ${1+"$@"} # save modified positional parameters for caller func_options_prep_result=$func_run_hooks_result } # func_parse_options [ARG]... # --------------------------- # The main option parsing loop. func_hookable func_parse_options func_parse_options () { $debug_cmd func_parse_options_result= # this just eases exit handling while test $# -gt 0; do # Defer to hook functions for initial option parsing, so they # get priority in the event of reusing an option name. func_run_hooks func_parse_options ${1+"$@"} # Adjust func_parse_options positional parameters to match eval set dummy "$func_run_hooks_result"; shift # Break out of the loop if we already parsed every option. test $# -gt 0 || break _G_opt=$1 shift case $_G_opt in --debug|-x) debug_cmd='set -x' func_echo "enabling shell trace mode" $debug_cmd ;; --no-warnings|--no-warning|--no-warn) set dummy --warnings none ${1+"$@"} shift ;; --warnings|--warning|-W) test $# = 0 && func_missing_arg $_G_opt && break case " $warning_categories $1" in *" $1 "*) # trailing space prevents matching last $1 above func_append_uniq opt_warning_types " $1" ;; *all) opt_warning_types=$warning_categories ;; *none) opt_warning_types=none warning_func=: ;; *error) opt_warning_types=$warning_categories warning_func=func_fatal_error ;; *) func_fatal_error \ "unsupported warning category: '$1'" ;; esac shift ;; --verbose|-v) opt_verbose=: ;; --version) func_version ;; -\?|-h) func_usage ;; --help) func_help ;; # Separate optargs to long options (plugins may need this): --*=*) func_split_equals "$_G_opt" set dummy "$func_split_equals_lhs" \ "$func_split_equals_rhs" ${1+"$@"} shift ;; # Separate optargs to short options: -W*) func_split_short_opt "$_G_opt" set dummy "$func_split_short_opt_name" \ "$func_split_short_opt_arg" ${1+"$@"} shift ;; # Separate non-argument short options: -\?*|-h*|-v*|-x*) func_split_short_opt "$_G_opt" set dummy "$func_split_short_opt_name" \ "-$func_split_short_opt_arg" ${1+"$@"} shift ;; --) break ;; -*) func_fatal_help "unrecognised option: '$_G_opt'" ;; *) set dummy "$_G_opt" ${1+"$@"}; shift; break ;; esac done # save modified positional parameters for caller func_quote_for_eval ${1+"$@"} func_parse_options_result=$func_quote_for_eval_result } # func_validate_options [ARG]... # ------------------------------ # Perform any sanity checks on option settings and/or unconsumed # arguments. func_hookable func_validate_options func_validate_options () { $debug_cmd # Display all warnings if -W was not given. test -n "$opt_warning_types" || opt_warning_types=" $warning_categories" func_run_hooks func_validate_options ${1+"$@"} # Bail if the options were screwed! $exit_cmd $EXIT_FAILURE # save modified positional parameters for caller func_validate_options_result=$func_run_hooks_result } ## ------------------## ## Helper functions. ## ## ------------------## # This section contains the helper functions used by the rest of the # hookable option parser framework in ascii-betical order. # func_fatal_help ARG... # ---------------------- # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { $debug_cmd eval \$bs_echo \""Usage: $usage"\" eval \$bs_echo \""$fatal_help"\" func_error ${1+"$@"} exit $EXIT_FAILURE } # func_help # --------- # Echo long help message to standard output and exit. func_help () { $debug_cmd func_usage_message $bs_echo "$long_help_message" exit 0 } # func_missing_arg ARGNAME # ------------------------ # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { $debug_cmd func_error "Missing argument for '$1'." exit_cmd=exit } # func_split_equals STRING # ------------------------ # Set func_split_equals_lhs and func_split_equals_rhs shell variables after # splitting STRING at the '=' sign. test -z "$_G_HAVE_XSI_OPS" \ && (eval 'x=a/b/c; test 5aa/bb/cc = "${#x}${x%%/*}${x%/*}${x#*/}${x##*/}"') 2>/dev/null \ && _G_HAVE_XSI_OPS=yes if test yes = "$_G_HAVE_XSI_OPS" then # This is an XSI compatible shell, allowing a faster implementation... eval 'func_split_equals () { $debug_cmd func_split_equals_lhs=${1%%=*} func_split_equals_rhs=${1#*=} test "x$func_split_equals_lhs" = "x$1" \ && func_split_equals_rhs= }' else # ...otherwise fall back to using expr, which is often a shell builtin. func_split_equals () { $debug_cmd func_split_equals_lhs=`expr "x$1" : 'x\([^=]*\)'` func_split_equals_rhs= test "x$func_split_equals_lhs" = "x$1" \ || func_split_equals_rhs=`expr "x$1" : 'x[^=]*=\(.*\)$'` } fi #func_split_equals # func_split_short_opt SHORTOPT # ----------------------------- # Set func_split_short_opt_name and func_split_short_opt_arg shell # variables after splitting SHORTOPT after the 2nd character. if test yes = "$_G_HAVE_XSI_OPS" then # This is an XSI compatible shell, allowing a faster implementation... eval 'func_split_short_opt () { $debug_cmd func_split_short_opt_arg=${1#??} func_split_short_opt_name=${1%"$func_split_short_opt_arg"} }' else # ...otherwise fall back to using expr, which is often a shell builtin. func_split_short_opt () { $debug_cmd func_split_short_opt_name=`expr "x$1" : 'x-\(.\)'` func_split_short_opt_arg=`expr "x$1" : 'x-.\(.*\)$'` } fi #func_split_short_opt # func_usage # ---------- # Echo short help message to standard output and exit. func_usage () { $debug_cmd func_usage_message $bs_echo "Run '$progname --help |${PAGER-more}' for full usage" exit 0 } # func_usage_message # ------------------ # Echo short help message to standard output. func_usage_message () { $debug_cmd eval \$bs_echo \""Usage: $usage"\" echo $SED -n 's|^# || /^Written by/{ x;p;x } h /^Written by/q' < "$progpath" echo eval \$bs_echo \""$usage_message"\" } # func_version # ------------ # Echo version message to standard output and exit. func_version () { $debug_cmd printf '%s\n' "$progname $scriptversion" $SED -n '/^##/q /(C)/!b go :more /\./!{ N s|\n# | | b more } :go /^# Written by /,/# warranty; / { s|^# || s|^# *$|| s|\((C)\)[ 0-9,-]*[ ,-]\([1-9][0-9]* \)|\1 \2| p } /^# Written by / { s|^# || p } /^warranty; /q' < "$progpath" exit $? } # Local variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-pattern: "10/scriptversion=%:y-%02m-%02d.%02H; # UTC" # time-stamp-time-zone: "UTC" # End: # Set a version string. scriptversion='(GNU libtool) 2.4.2.418' # func_echo ARG... # ---------------- # Libtool also displays the current mode in messages, so override # funclib.sh func_echo with this custom definition. func_echo () { $debug_cmd _G_message=$* func_echo_IFS=$IFS IFS=$nl for _G_line in $_G_message; do IFS=$func_echo_IFS $bs_echo "$progname${opt_mode+: $opt_mode}: $_G_line" done IFS=$func_echo_IFS } # func_warning ARG... # ------------------- # Libtool warnings are not categorized, so override funclib.sh # func_warning with this simpler definition. func_warning () { $debug_cmd $warning_func ${1+"$@"} } ## ---------------- ## ## Options parsing. ## ## ---------------- ## # Hook in the functions to make sure our own options are parsed during # the option parsing loop. usage='$progpath [OPTION]... [MODE-ARG]...' # Short help message in response to '-h'. usage_message="Options: --config show all configuration variables --debug enable verbose shell tracing -n, --dry-run display commands without modifying any files --features display basic configuration information and exit --mode=MODE use operation mode MODE --no-warnings equivalent to '-Wnone' --preserve-dup-deps don't remove duplicate dependency libraries --quiet, --silent don't print informational messages --tag=TAG use configuration variables from tag TAG -v, --verbose print more informational messages than default --version print version information -W, --warnings=CATEGORY report the warnings falling in CATEGORY [all] -h, --help, --help-all print short, long, or detailed help message " # Additional text appended to 'usage_message' in response to '--help'. long_help_message=$long_help_message" MODE must be one of the following: clean remove files from the build directory compile compile a source file into a libtool object execute automatically set library path, then run a program finish complete the installation of libtool libraries install install libraries or executables link create a library or an executable uninstall remove libraries from an installed directory MODE-ARGS vary depending on the MODE. When passed as first option, '--mode=MODE' may be abbreviated as 'MODE' or a unique abbreviation of that. Try '$progname --help --mode=MODE' for a more detailed description of MODE. When reporting a bug, please describe a test case to reproduce it and include the following information: host-triplet: $host shell: $SHELL compiler: $LTCC compiler flags: $LTCFLAGS linker: $LD (gnu? $with_gnu_ld) version: $progname (GNU libtool) 2.4.2.418 automake: `($AUTOMAKE --version) 2>/dev/null |$SED 1q` autoconf: `($AUTOCONF --version) 2>/dev/null |$SED 1q` Report bugs to . GNU libtool home page: . General help using GNU software: ." # func_lo2o OBJECT-NAME # --------------------- # Transform OBJECT-NAME from a '.lo' suffix to the platform specific # object suffix. lo2o=s/\\.lo\$/.$objext/ o2lo=s/\\.$objext\$/.lo/ if test yes = "$_G_HAVE_XSI_OPS"; then eval 'func_lo2o () { case $1 in *.lo) func_lo2o_result=${1%.lo}.$objext ;; * ) func_lo2o_result=$1 ;; esac }' # func_xform LIBOBJ-OR-SOURCE # --------------------------- # Transform LIBOBJ-OR-SOURCE from a '.o' or '.c' (or otherwise) # suffix to a '.lo' libtool-object suffix. eval 'func_xform () { func_xform_result=${1%.*}.lo }' else # ...otherwise fall back to using sed. func_lo2o () { func_lo2o_result=`$ECHO "$1" | $SED "$lo2o"` } func_xform () { func_xform_result=`$ECHO "$1" | $SED 's|\.[^.]*$|.lo|'` } fi # func_fatal_configuration ARG... # ------------------------------- # Echo program name prefixed message to standard error, followed by # a configuration failure hint, and exit. func_fatal_configuration () { func__fatal_error ${1+"$@"} \ "See the $PACKAGE documentation for more information." \ "Fatal configuration error." } # func_config # ----------- # Display the configuration for all the tags in this script. func_config () { re_begincf='^# ### BEGIN LIBTOOL' re_endcf='^# ### END LIBTOOL' # Default configuration. $SED "1,/$re_begincf CONFIG/d;/$re_endcf CONFIG/,\$d" < "$progpath" # Now print the configurations for the tags. for tagname in $taglist; do $SED -n "/$re_begincf TAG CONFIG: $tagname\$/,/$re_endcf TAG CONFIG: $tagname\$/p" < "$progpath" done exit $? } # func_features # ------------- # Display the features supported by this script. func_features () { echo "host: $host" if test yes = "$build_libtool_libs"; then echo "enable shared libraries" else echo "disable shared libraries" fi if test yes = "$build_old_libs"; then echo "enable static libraries" else echo "disable static libraries" fi exit $? } # func_enable_tag TAGNAME # ----------------------- # Verify that TAGNAME is valid, and either flag an error and exit, or # enable the TAGNAME tag. We also add TAGNAME to the global $taglist # variable here. func_enable_tag () { # Global variable: tagname=$1 re_begincf="^# ### BEGIN LIBTOOL TAG CONFIG: $tagname\$" re_endcf="^# ### END LIBTOOL TAG CONFIG: $tagname\$" sed_extractcf=/$re_begincf/,/$re_endcf/p # Validate tagname. case $tagname in *[!-_A-Za-z0-9,/]*) func_fatal_error "invalid tag name: $tagname" ;; esac # Don't test for the "default" C tag, as we know it's # there but not specially marked. case $tagname in CC) ;; *) if $GREP "$re_begincf" "$progpath" >/dev/null 2>&1; then taglist="$taglist $tagname" # Evaluate the configuration. Be careful to quote the path # and the sed script, to avoid splitting on whitespace, but # also don't use non-portable quotes within backquotes within # quotes we have to do it in 2 steps: extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"` eval "$extractedcf" else func_error "ignoring unknown tag $tagname" fi ;; esac } # func_check_version_match # ------------------------ # Ensure that we are using m4 macros, and libtool script from the same # release of libtool. func_check_version_match () { if test "$package_revision" != "$macro_revision"; then if test "$VERSION" != "$macro_version"; then if test -z "$macro_version"; then cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from an older release. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from $PACKAGE $macro_version. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF fi else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, revision $package_revision, $progname: but the definition of this LT_INIT comes from revision $macro_revision. $progname: You should recreate aclocal.m4 with macros from revision $package_revision $progname: of $PACKAGE $VERSION and run autoconf again. _LT_EOF fi exit $EXIT_MISMATCH fi } # libtool_options_prep [ARG]... # ----------------------------- # Preparation for options parsed by libtool. libtool_options_prep () { $debug_mode # Option defaults: opt_config=false opt_dlopen= opt_dry_run=false opt_help=false opt_mode= opt_preserve_dup_deps=false opt_quiet=false nonopt= preserve_args= # Shorthand for --mode=foo, only valid as the first argument case $1 in clean|clea|cle|cl) shift; set dummy --mode clean ${1+"$@"}; shift ;; compile|compil|compi|comp|com|co|c) shift; set dummy --mode compile ${1+"$@"}; shift ;; execute|execut|execu|exec|exe|ex|e) shift; set dummy --mode execute ${1+"$@"}; shift ;; finish|finis|fini|fin|fi|f) shift; set dummy --mode finish ${1+"$@"}; shift ;; install|instal|insta|inst|ins|in|i) shift; set dummy --mode install ${1+"$@"}; shift ;; link|lin|li|l) shift; set dummy --mode link ${1+"$@"}; shift ;; uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u) shift; set dummy --mode uninstall ${1+"$@"}; shift ;; esac # Pass back the list of options. func_quote_for_eval ${1+"$@"} libtool_options_prep_result=$func_quote_for_eval_result } func_add_hook func_options_prep libtool_options_prep # libtool_parse_options [ARG]... # --------------------------------- # Provide handling for libtool specific options. libtool_parse_options () { $debug_cmd # Perform our own loop to consume as many options as possible in # each iteration. while test $# -gt 0; do _G_opt=$1 shift case $_G_opt in --dry-run|--dryrun|-n) opt_dry_run=: ;; --config) func_config ;; --dlopen|-dlopen) opt_dlopen="${opt_dlopen+$opt_dlopen }$1" shift ;; --preserve-dup-deps) opt_preserve_dup_deps=: ;; --features) func_features ;; --finish) set dummy --mode finish ${1+"$@"}; shift ;; --help) opt_help=: ;; --help-all) opt_help=': help-all' ;; --mode) test $# = 0 && func_missing_arg $_G_opt && break opt_mode=$1 case $1 in # Valid mode arguments: clean|compile|execute|finish|install|link|relink|uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $_G_opt" exit_cmd=exit break ;; esac shift ;; --no-silent|--no-quiet) opt_quiet=false func_append preserve_args " $_G_opt" ;; --no-warnings|--no-warning|--no-warn) opt_warning=false func_append preserve_args " $_G_opt" ;; --no-verbose) opt_verbose=false func_append preserve_args " $_G_opt" ;; --silent|--quiet) opt_quiet=: opt_verbose=false func_append preserve_args " $_G_opt" ;; --tag) test $# = 0 && func_missing_arg $_G_opt && break opt_tag=$1 func_append preserve_args " $_G_opt $1" func_enable_tag "$1" shift ;; --verbose|-v) opt_quiet=false opt_verbose=: func_append preserve_args " $_G_opt" ;; # An option not handled by this hook function: *) set dummy "$_G_opt" ${1+"$@"}; shift; break ;; esac done # save modified positional parameters for caller func_quote_for_eval ${1+"$@"} libtool_parse_options_result=$func_quote_for_eval_result } func_add_hook func_parse_options libtool_parse_options # libtool_validate_options [ARG]... # --------------------------------- # Perform any sanity checks on option settings and/or unconsumed # arguments. libtool_validate_options () { # save first non-option argument if test 0 -lt $#; then nonopt=$1 shift fi # preserve --debug test : = "$debug_cmd" || func_append preserve_args " --debug" case $host in *cygwin* | *mingw* | *pw32* | *cegcc*) # don't eliminate duplications in $postdeps and $predeps opt_duplicate_compiler_generated_deps=: ;; *) opt_duplicate_compiler_generated_deps=$opt_preserve_dup_deps ;; esac $opt_help || { # Sanity checks first: func_check_version_match test yes != "$build_libtool_libs" \ && test yes != "$build_old_libs" \ && func_fatal_configuration "not configured to build any kind of library" # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$opt_dlopen" && test execute != "$opt_mode"; then func_error "unrecognized option '-dlopen'" $ECHO "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help=$help help="Try '$progname --help --mode=$opt_mode' for more information." } # Pass back the unparsed argument list func_quote_for_eval ${1+"$@"} libtool_validate_options_result=$func_quote_for_eval_result } func_add_hook func_validate_options libtool_validate_options # Process options as early as possible so that --help and --version # can return quickly. func_options ${1+"$@"} eval set dummy "$func_options_result"; shift ## ----------- ## ## Main. ## ## ----------- ## magic='%%%MAGIC variable%%%' magic_exe='%%%MAGIC EXE variable%%%' # Global variables. extracted_archives= extracted_serial=0 # If this variable is set in any of the actions, the command in it # will be execed at the end. This prevents here-documents from being # left over by shells. exec_cmd= # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } # func_lalib_p file # True iff FILE is a libtool '.la' library or '.lo' object file. # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_lalib_p () { test -f "$1" && $SED -e 4q "$1" 2>/dev/null \ | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1 } # func_lalib_unsafe_p file # True iff FILE is a libtool '.la' library or '.lo' object file. # This function implements the same check as func_lalib_p without # resorting to external programs. To this end, it redirects stdin and # closes it afterwards, without saving the original file descriptor. # As a safety measure, use it only where a negative result would be # fatal anyway. Works if 'file' does not exist. func_lalib_unsafe_p () { lalib_p=no if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then for lalib_p_l in 1 2 3 4 do read lalib_p_line case $lalib_p_line in \#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;; esac done exec 0<&5 5<&- fi test yes = "$lalib_p" } # func_ltwrapper_script_p file # True iff FILE is a libtool wrapper script # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_script_p () { func_lalib_p "$1" } # func_ltwrapper_executable_p file # True iff FILE is a libtool wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_executable_p () { func_ltwrapper_exec_suffix= case $1 in *.exe) ;; *) func_ltwrapper_exec_suffix=.exe ;; esac $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1 } # func_ltwrapper_scriptname file # Assumes file is an ltwrapper_executable # uses $file to determine the appropriate filename for a # temporary ltwrapper_script. func_ltwrapper_scriptname () { func_dirname_and_basename "$1" "" "." func_stripname '' '.exe' "$func_basename_result" func_ltwrapper_scriptname_result=$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper } # func_ltwrapper_p file # True iff FILE is a libtool wrapper script or wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_p () { func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1" } # func_execute_cmds commands fail_cmd # Execute tilde-delimited COMMANDS. # If FAIL_CMD is given, eval that upon failure. # FAIL_CMD may read-access the current command in variable CMD! func_execute_cmds () { $debug_cmd save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$sp$nl eval cmd=\"$cmd\" IFS=$save_ifs func_show_eval "$cmd" "${2-:}" done IFS=$save_ifs } # func_source file # Source FILE, adding directory component if necessary. # Note that it is not necessary on cygwin/mingw to append a dot to # FILE even if both FILE and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # 'FILE.' does not work on cygwin managed mounts. func_source () { $debug_cmd case $1 in */* | *\\*) . "$1" ;; *) . "./$1" ;; esac } # func_resolve_sysroot PATH # Replace a leading = in PATH with a sysroot. Store the result into # func_resolve_sysroot_result func_resolve_sysroot () { func_resolve_sysroot_result=$1 case $func_resolve_sysroot_result in =*) func_stripname '=' '' "$func_resolve_sysroot_result" func_resolve_sysroot_result=$lt_sysroot$func_stripname_result ;; esac } # func_replace_sysroot PATH # If PATH begins with the sysroot, replace it with = and # store the result into func_replace_sysroot_result. func_replace_sysroot () { case $lt_sysroot:$1 in ?*:"$lt_sysroot"*) func_stripname "$lt_sysroot" '' "$1" func_replace_sysroot_result='='$func_stripname_result ;; *) # Including no sysroot. func_replace_sysroot_result=$1 ;; esac } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { $debug_cmd if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`$SED -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case "$@ " in " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then func_echo "unable to infer tagged configuration" func_fatal_error "specify a tag with '--tag'" # else # func_verbose "using $tagname tagged configuration" fi ;; esac fi } # func_write_libtool_object output_name pic_name nonpic_name # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. func_write_libtool_object () { write_libobj=$1 if test yes = "$build_libtool_libs"; then write_lobj=\'$2\' else write_lobj=none fi if test yes = "$build_old_libs"; then write_oldobj=\'$3\' else write_oldobj=none fi $opt_dry_run || { cat >${write_libobj}T </dev/null` if test "$?" -eq 0 && test -n "$func_convert_core_file_wine_to_w32_tmp"; then func_convert_core_file_wine_to_w32_result=`$ECHO "$func_convert_core_file_wine_to_w32_tmp" | $SED -e "$sed_naive_backslashify"` else func_convert_core_file_wine_to_w32_result= fi fi } # end: func_convert_core_file_wine_to_w32 # func_convert_core_path_wine_to_w32 ARG # Helper function used by path conversion functions when $build is *nix, and # $host is mingw, cygwin, or some other w32 environment. Relies on a correctly # configured wine environment available, with the winepath program in $build's # $PATH. Assumes ARG has no leading or trailing path separator characters. # # ARG is path to be converted from $build format to win32. # Result is available in $func_convert_core_path_wine_to_w32_result. # Unconvertible file (directory) names in ARG are skipped; if no directory names # are convertible, then the result may be empty. func_convert_core_path_wine_to_w32 () { $debug_cmd # unfortunately, winepath doesn't convert paths, only file names func_convert_core_path_wine_to_w32_result= if test -n "$1"; then oldIFS=$IFS IFS=: for func_convert_core_path_wine_to_w32_f in $1; do IFS=$oldIFS func_convert_core_file_wine_to_w32 "$func_convert_core_path_wine_to_w32_f" if test -n "$func_convert_core_file_wine_to_w32_result"; then if test -z "$func_convert_core_path_wine_to_w32_result"; then func_convert_core_path_wine_to_w32_result=$func_convert_core_file_wine_to_w32_result else func_append func_convert_core_path_wine_to_w32_result ";$func_convert_core_file_wine_to_w32_result" fi fi done IFS=$oldIFS fi } # end: func_convert_core_path_wine_to_w32 # func_cygpath ARGS... # Wrapper around calling the cygpath program via LT_CYGPATH. This is used when # when (1) $build is *nix and Cygwin is hosted via a wine environment; or (2) # $build is MSYS and $host is Cygwin, or (3) $build is Cygwin. In case (1) or # (2), returns the Cygwin file name or path in func_cygpath_result (input # file name or path is assumed to be in w32 format, as previously converted # from $build's *nix or MSYS format). In case (3), returns the w32 file name # or path in func_cygpath_result (input file name or path is assumed to be in # Cygwin format). Returns an empty string on error. # # ARGS are passed to cygpath, with the last one being the file name or path to # be converted. # # Specify the absolute *nix (or w32) name to cygpath in the LT_CYGPATH # environment variable; do not put it in $PATH. func_cygpath () { $debug_cmd if test -n "$LT_CYGPATH" && test -f "$LT_CYGPATH"; then func_cygpath_result=`$LT_CYGPATH "$@" 2>/dev/null` if test "$?" -ne 0; then # on failure, ensure result is empty func_cygpath_result= fi else func_cygpath_result= func_error "LT_CYGPATH is empty or specifies non-existent file: '$LT_CYGPATH'" fi } #end: func_cygpath # func_convert_core_msys_to_w32 ARG # Convert file name or path ARG from MSYS format to w32 format. Return # result in func_convert_core_msys_to_w32_result. func_convert_core_msys_to_w32 () { $debug_cmd # awkward: cmd appends spaces to result func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null | $SED -e 's/[ ]*$//' -e "$sed_naive_backslashify"` } #end: func_convert_core_msys_to_w32 # func_convert_file_check ARG1 ARG2 # Verify that ARG1 (a file name in $build format) was converted to $host # format in ARG2. Otherwise, emit an error message, but continue (resetting # func_to_host_file_result to ARG1). func_convert_file_check () { $debug_cmd if test -z "$2" && test -n "$1"; then func_error "Could not determine host file name corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback: func_to_host_file_result=$1 fi } # end func_convert_file_check # func_convert_path_check FROM_PATHSEP TO_PATHSEP FROM_PATH TO_PATH # Verify that FROM_PATH (a path in $build format) was converted to $host # format in TO_PATH. Otherwise, emit an error message, but continue, resetting # func_to_host_file_result to a simplistic fallback value (see below). func_convert_path_check () { $debug_cmd if test -z "$4" && test -n "$3"; then func_error "Could not determine the host path corresponding to" func_error " '$3'" func_error "Continuing, but uninstalled executables may not work." # Fallback. This is a deliberately simplistic "conversion" and # should not be "improved". See libtool.info. if test "x$1" != "x$2"; then lt_replace_pathsep_chars="s|$1|$2|g" func_to_host_path_result=`echo "$3" | $SED -e "$lt_replace_pathsep_chars"` else func_to_host_path_result=$3 fi fi } # end func_convert_path_check # func_convert_path_front_back_pathsep FRONTPAT BACKPAT REPL ORIG # Modifies func_to_host_path_result by prepending REPL if ORIG matches FRONTPAT # and appending REPL if ORIG matches BACKPAT. func_convert_path_front_back_pathsep () { $debug_cmd case $4 in $1 ) func_to_host_path_result=$3$func_to_host_path_result ;; esac case $4 in $2 ) func_append func_to_host_path_result "$3" ;; esac } # end func_convert_path_front_back_pathsep ################################################## # $build to $host FILE NAME CONVERSION FUNCTIONS # ################################################## # invoked via '$to_host_file_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # Result will be available in $func_to_host_file_result. # func_to_host_file ARG # Converts the file name ARG from $build format to $host format. Return result # in func_to_host_file_result. func_to_host_file () { $debug_cmd $to_host_file_cmd "$1" } # end func_to_host_file # func_to_tool_file ARG LAZY # converts the file name ARG from $build format to toolchain format. Return # result in func_to_tool_file_result. If the conversion in use is listed # in (the comma separated) LAZY, no conversion takes place. func_to_tool_file () { $debug_cmd case ,$2, in *,"$to_tool_file_cmd",*) func_to_tool_file_result=$1 ;; *) $to_tool_file_cmd "$1" func_to_tool_file_result=$func_to_host_file_result ;; esac } # end func_to_tool_file # func_convert_file_noop ARG # Copy ARG to func_to_host_file_result. func_convert_file_noop () { func_to_host_file_result=$1 } # end func_convert_file_noop # func_convert_file_msys_to_w32 ARG # Convert file name ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_file_result. func_convert_file_msys_to_w32 () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_to_host_file_result=$func_convert_core_msys_to_w32_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_w32 # func_convert_file_cygwin_to_w32 ARG # Convert file name ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_file_cygwin_to_w32 () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then # because $build is cygwin, we call "the" cygpath in $PATH; no need to use # LT_CYGPATH in this case. func_to_host_file_result=`cygpath -m "$1"` fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_cygwin_to_w32 # func_convert_file_nix_to_w32 ARG # Convert file name ARG from *nix to w32 format. Requires a wine environment # and a working winepath. Returns result in func_to_host_file_result. func_convert_file_nix_to_w32 () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then func_convert_core_file_wine_to_w32 "$1" func_to_host_file_result=$func_convert_core_file_wine_to_w32_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_w32 # func_convert_file_msys_to_cygwin ARG # Convert file name ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_file_msys_to_cygwin () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_cygpath -u "$func_convert_core_msys_to_w32_result" func_to_host_file_result=$func_cygpath_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_cygwin # func_convert_file_nix_to_cygwin ARG # Convert file name ARG from *nix to Cygwin format. Requires Cygwin installed # in a wine environment, working winepath, and LT_CYGPATH set. Returns result # in func_to_host_file_result. func_convert_file_nix_to_cygwin () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then # convert from *nix to w32, then use cygpath to convert from w32 to cygwin. func_convert_core_file_wine_to_w32 "$1" func_cygpath -u "$func_convert_core_file_wine_to_w32_result" func_to_host_file_result=$func_cygpath_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_cygwin ############################################# # $build to $host PATH CONVERSION FUNCTIONS # ############################################# # invoked via '$to_host_path_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # The result will be available in $func_to_host_path_result. # # Path separators are also converted from $build format to $host format. If # ARG begins or ends with a path separator character, it is preserved (but # converted to $host format) on output. # # All path conversion functions are named using the following convention: # file name conversion function : func_convert_file_X_to_Y () # path conversion function : func_convert_path_X_to_Y () # where, for any given $build/$host combination the 'X_to_Y' value is the # same. If conversion functions are added for new $build/$host combinations, # the two new functions must follow this pattern, or func_init_to_host_path_cmd # will break. # func_init_to_host_path_cmd # Ensures that function "pointer" variable $to_host_path_cmd is set to the # appropriate value, based on the value of $to_host_file_cmd. to_host_path_cmd= func_init_to_host_path_cmd () { $debug_cmd if test -z "$to_host_path_cmd"; then func_stripname 'func_convert_file_' '' "$to_host_file_cmd" to_host_path_cmd=func_convert_path_$func_stripname_result fi } # func_to_host_path ARG # Converts the path ARG from $build format to $host format. Return result # in func_to_host_path_result. func_to_host_path () { $debug_cmd func_init_to_host_path_cmd $to_host_path_cmd "$1" } # end func_to_host_path # func_convert_path_noop ARG # Copy ARG to func_to_host_path_result. func_convert_path_noop () { func_to_host_path_result=$1 } # end func_convert_path_noop # func_convert_path_msys_to_w32 ARG # Convert path ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_path_result. func_convert_path_msys_to_w32 () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # Remove leading and trailing path separator characters from ARG. MSYS # behavior is inconsistent here; cygpath turns them into '.;' and ';.'; # and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result=$func_convert_core_msys_to_w32_result func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_msys_to_w32 # func_convert_path_cygwin_to_w32 ARG # Convert path ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_path_cygwin_to_w32 () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_to_host_path_result=`cygpath -m -p "$func_to_host_path_tmp1"` func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_cygwin_to_w32 # func_convert_path_nix_to_w32 ARG # Convert path ARG from *nix to w32 format. Requires a wine environment and # a working winepath. Returns result in func_to_host_file_result. func_convert_path_nix_to_w32 () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result=$func_convert_core_path_wine_to_w32_result func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_nix_to_w32 # func_convert_path_msys_to_cygwin ARG # Convert path ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_path_msys_to_cygwin () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_msys_to_w32_result" func_to_host_path_result=$func_cygpath_result func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_msys_to_cygwin # func_convert_path_nix_to_cygwin ARG # Convert path ARG from *nix to Cygwin format. Requires Cygwin installed in a # a wine environment, working winepath, and LT_CYGPATH set. Returns result in # func_to_host_file_result. func_convert_path_nix_to_cygwin () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # Remove leading and trailing path separator characters from # ARG. msys behavior is inconsistent here, cygpath turns them # into '.;' and ';.', and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_path_wine_to_w32_result" func_to_host_path_result=$func_cygpath_result func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_nix_to_cygwin # func_dll_def_p FILE # True iff FILE is a Windows DLL '.def' file. # Keep in sync with _LT_DLL_DEF_P in libtool.m4 func_dll_def_p () { $debug_cmd func_dll_def_p_tmp=`$SED -n \ -e 's/^[ ]*//' \ -e '/^\(;.*\)*$/d' \ -e 's/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p' \ -e q \ "$1"` test DEF = "$func_dll_def_p_tmp" } # func_mode_compile arg... func_mode_compile () { $debug_cmd # Get the compilation command and the source file. base_compile= srcfile=$nonopt # always keep a non-empty value in "srcfile" suppress_opt=yes suppress_output= arg_mode=normal libobj= later= pie_flag= for arg do case $arg_mode in arg ) # do not "continue". Instead, add this to base_compile lastarg=$arg arg_mode=normal ;; target ) libobj=$arg arg_mode=normal continue ;; normal ) # Accept any command-line options. case $arg in -o) test -n "$libobj" && \ func_fatal_error "you cannot specify '-o' more than once" arg_mode=target continue ;; -pie | -fpie | -fPIE) func_append pie_flag " $arg" continue ;; -shared | -static | -prefer-pic | -prefer-non-pic) func_append later " $arg" continue ;; -no-suppress) suppress_opt=no continue ;; -Xcompiler) arg_mode=arg # the next one goes into the "base_compile" arg list continue # The current "srcfile" will either be retained or ;; # replaced later. I would guess that would be a bug. -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result lastarg= save_ifs=$IFS; IFS=, for arg in $args; do IFS=$save_ifs func_append_quoted lastarg "$arg" done IFS=$save_ifs func_stripname ' ' '' "$lastarg" lastarg=$func_stripname_result # Add the arguments to base_compile. func_append base_compile " $lastarg" continue ;; *) # Accept the current argument as the source file. # The previous "srcfile" becomes the current argument. # lastarg=$srcfile srcfile=$arg ;; esac # case $arg ;; esac # case $arg_mode # Aesthetically quote the previous argument. func_append_quoted base_compile "$lastarg" done # for arg case $arg_mode in arg) func_fatal_error "you must specify an argument for -Xcompile" ;; target) func_fatal_error "you must specify a target with '-o'" ;; *) # Get the name of the library object. test -z "$libobj" && { func_basename "$srcfile" libobj=$func_basename_result } ;; esac # Recognize several different file suffixes. # If the user specifies -o file.o, it is replaced with file.lo case $libobj in *.[cCFSifmso] | \ *.ada | *.adb | *.ads | *.asm | \ *.c++ | *.cc | *.ii | *.class | *.cpp | *.cxx | \ *.[fF][09]? | *.for | *.java | *.go | *.obj | *.sx | *.cu | *.cup) func_xform "$libobj" libobj=$func_xform_result ;; esac case $libobj in *.lo) func_lo2o "$libobj"; obj=$func_lo2o_result ;; *) func_fatal_error "cannot determine name of library object from '$libobj'" ;; esac func_infer_tag $base_compile for arg in $later; do case $arg in -shared) test yes = "$build_libtool_libs" \ || func_fatal_configuration "cannot build a shared library" build_old_libs=no continue ;; -static) build_libtool_libs=no build_old_libs=yes continue ;; -prefer-pic) pic_mode=yes continue ;; -prefer-non-pic) pic_mode=no continue ;; esac done func_quote_for_eval "$libobj" test "X$libobj" != "X$func_quote_for_eval_result" \ && $ECHO "X$libobj" | $GREP '[]~#^*{};<>?"'"'"' &()|`$[]' \ && func_warning "libobj name '$libobj' may not contain shell special characters." func_dirname_and_basename "$obj" "/" "" objname=$func_basename_result xdir=$func_dirname_result lobj=$xdir$objdir/$objname test -z "$base_compile" && \ func_fatal_help "you must specify a compilation command" # Delete any leftover library objects. if test yes = "$build_old_libs"; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2* | cegcc*) pic_mode=default ;; esac if test no = "$pic_mode" && test pass_all != "$deplibs_check_method"; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test no = "$compiler_c_o"; then output_obj=`$ECHO "$srcfile" | $SED 's%^.*/%%; s%\.[^.]*$%%'`.$objext lockfile=$output_obj.lock else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test yes = "$need_locks"; then until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done elif test warn = "$need_locks"; then if test -f "$lockfile"; then $ECHO "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support '-c' and '-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi func_append removelist " $output_obj" $ECHO "$srcfile" > "$lockfile" fi $opt_dry_run || $RM $removelist func_append removelist " $lockfile" trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15 func_to_tool_file "$srcfile" func_convert_file_msys_to_w32 srcfile=$func_to_tool_file_result func_quote_for_eval "$srcfile" qsrcfile=$func_quote_for_eval_result # Only build a PIC object if we are building libtool libraries. if test yes = "$build_libtool_libs"; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test no != "$pic_mode"; then command="$base_compile $qsrcfile $pic_flag" else # Don't build PIC code command="$base_compile $qsrcfile" fi func_mkdir_p "$xdir$objdir" if test -z "$output_obj"; then # Place PIC objects in $objdir func_append command " -o $lobj" fi func_show_eval_locale "$command" \ 'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE' if test warn = "$need_locks" && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support '-c' and '-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then func_show_eval '$MV "$output_obj" "$lobj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi # Allow error messages only from the first compilation. if test yes = "$suppress_opt"; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test yes = "$build_old_libs"; then if test yes != "$pic_mode"; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test yes = "$compiler_c_o"; then func_append command " -o $obj" fi # Suppress compiler output if we already did a PIC compilation. func_append command "$suppress_output" func_show_eval_locale "$command" \ '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' if test warn = "$need_locks" && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support '-c' and '-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then func_show_eval '$MV "$output_obj" "$obj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi fi $opt_dry_run || { func_write_libtool_object "$libobj" "$objdir/$objname" "$objname" # Unlock the critical section if it was locked if test no != "$need_locks"; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test compile = "$opt_mode" && func_mode_compile ${1+"$@"} } func_mode_help () { # We need to display help for each of the modes. case $opt_mode in "") # Generic help is extracted from the usage comments # at the start of this file. func_help ;; clean) $ECHO \ "Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically '/bin/rm'). RM-OPTIONS are options (such as '-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $ECHO \ "Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -no-suppress do not suppress compiler output for multiple passes -prefer-pic try to build PIC objects only -prefer-non-pic try to build non-PIC objects only -shared do not build a '.o' file suitable for static linking -static only build a '.o' file suitable for static linking -Wc,FLAG pass FLAG directly to the compiler COMPILE-COMMAND is a command to be used in creating a 'standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix '.c' with the library object suffix, '.lo'." ;; execute) $ECHO \ "Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to '-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $ECHO \ "Usage: $progname [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the '--dry-run' option if you just want to see what would be executed." ;; install) $ECHO \ "Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the 'install' or 'cp' program. The following components of INSTALL-COMMAND are treated specially: -inst-prefix-dir PREFIX-DIR Use PREFIX-DIR as a staging area for installation The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $ECHO \ "Usage: $progname [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -bindir BINDIR specify path to binaries directory (for systems where libraries must be found in the PATH setting at runtime) -dlopen FILE '-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -shared only do dynamic linking of libtool libraries -shrext SUFFIX override the standard shared library file extension -static do not do any dynamic linking of uninstalled libtool libraries -static-libtool-libs do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] -weak LIBNAME declare that the target provides the LIBNAME interface -Wc,FLAG -Xcompiler FLAG pass linker-specific FLAG directly to the compiler -Wl,FLAG -Xlinker FLAG pass linker-specific FLAG directly to the linker -XCClinker FLAG pass link-specific FLAG to the compiler driver (CC) All other options (arguments beginning with '-') are ignored. Every other argument is treated as a filename. Files ending in '.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in '.la', then a libtool library is created, only library objects ('.lo' files) may be specified, and '-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in '.a' or '.lib', then a standard library is created using 'ar' and 'ranlib', or on Windows using 'lib'. If OUTPUT-FILE ends in '.lo' or '.$objext', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $ECHO \ "Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically '/bin/rm'). RM-OPTIONS are options (such as '-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) func_fatal_help "invalid operation mode '$opt_mode'" ;; esac echo $ECHO "Try '$progname --help' for more information about other modes." } # Now that we've collected a possible --mode arg, show help if necessary if $opt_help; then if test : = "$opt_help"; then func_mode_help else { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do func_mode_help done } | sed -n '1p; 2,$s/^Usage:/ or: /p' { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do echo func_mode_help done } | sed '1d /^When reporting/,/^Report/{ H d } $x /information about other modes/d /more detailed .*MODE/d s/^Usage:.*--mode=\([^ ]*\) .*/Description of \1 mode:/' fi exit $? fi # func_mode_execute arg... func_mode_execute () { $debug_cmd # The first argument is the command name. cmd=$nonopt test -z "$cmd" && \ func_fatal_help "you must specify a COMMAND" # Handle -dlopen flags immediately. for file in $opt_dlopen; do test -f "$file" \ || func_fatal_help "'$file' is not a file" dir= case $file in *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "'$lib' is not a valid libtool archive" # Read the libtool library. dlname= library_names= func_source "$file" # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && \ func_warning "'$file' was not linked with '-export-dynamic'" continue fi func_dirname "$file" "" "." dir=$func_dirname_result if test -f "$dir/$objdir/$dlname"; then func_append dir "/$objdir" else if test ! -f "$dir/$dlname"; then func_fatal_error "cannot find '$dlname' in '$dir' or '$dir/$objdir'" fi fi ;; *.lo) # Just add the directory containing the .lo file. func_dirname "$file" "" "." dir=$func_dirname_result ;; *) func_warning "'-dlopen' is ignored for non-libtool libraries and objects" continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir=$absdir # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic=$magic # Check if any of the arguments is a wrapper script. args= for file do case $file in -* | *.la | *.lo ) ;; *) # Do a test to see if this is really a libtool program. if func_ltwrapper_script_p "$file"; then func_source "$file" # Transform arg to wrapped name. file=$progdir/$program elif func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" func_source "$func_ltwrapper_scriptname_result" # Transform arg to wrapped name. file=$progdir/$program fi ;; esac # Quote arguments (to preserve shell metacharacters). func_append_quoted args "$file" done if $opt_dry_run; then # Display what would be done. if test -n "$shlibpath_var"; then eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\"" echo "export $shlibpath_var" fi $ECHO "$cmd$args" exit $EXIT_SUCCESS else if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${save_$lt_var+set}\" = set; then $lt_var=\$save_$lt_var; export $lt_var else $lt_unset $lt_var fi" done # Now prepare to actually exec the command. exec_cmd=\$cmd$args fi } test execute = "$opt_mode" && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $debug_cmd libs= libdirs= admincmds= for opt in "$nonopt" ${1+"$@"} do if test -d "$opt"; then func_append libdirs " $opt" elif test -f "$opt"; then if func_lalib_unsafe_p "$opt"; then func_append libs " $opt" else func_warning "'$opt' is not a valid libtool archive" fi else func_fatal_error "invalid argument '$opt'" fi done if test -n "$libs"; then if test -n "$lt_sysroot"; then sysroot_regex=`$ECHO "$lt_sysroot" | $SED "$sed_make_literal_regex"` sysroot_cmd="s/\([ ']\)$sysroot_regex/\1/g;" else sysroot_cmd= fi # Remove sysroot references if $opt_dry_run; then for lib in $libs; do echo "removing references to $lt_sysroot and '=' prefixes from $lib" done else tmpdir=`func_mktempdir` for lib in $libs; do sed -e "$sysroot_cmd s/\([ ']-[LR]\)=/\1/g; s/\([ ']\)=/\1/g" $lib \ > $tmpdir/tmp-la mv -f $tmpdir/tmp-la $lib done ${RM}r "$tmpdir" fi fi if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. func_execute_cmds "$finish_cmds" 'admincmds="$admincmds '"$cmd"'"' fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $opt_dry_run || eval "$cmds" || func_append admincmds " $cmds" fi done fi # Exit here if they wanted silent mode. $opt_quiet && exit $EXIT_SUCCESS if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then echo "----------------------------------------------------------------------" echo "Libraries have been installed in:" for libdir in $libdirs; do $ECHO " $libdir" done echo echo "If you ever happen to want to link against installed libraries" echo "in a given directory, LIBDIR, you must either use libtool, and" echo "specify the full pathname of the library, or use the '-LLIBDIR'" echo "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then echo " - add LIBDIR to the '$shlibpath_var' environment variable" echo " during execution" fi if test -n "$runpath_var"; then echo " - add LIBDIR to the '$runpath_var' environment variable" echo " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $ECHO " - use the '$flag' linker flag" fi if test -n "$admincmds"; then $ECHO " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then echo " - have your system administrator add LIBDIR to '/etc/ld.so.conf'" fi echo echo "See any operating system documentation about shared libraries for" case $host in solaris2.[6789]|solaris2.1[0-9]) echo "more information, such as the ld(1), crle(1) and ld.so(8) manual" echo "pages." ;; *) echo "more information, such as the ld(1) and ld.so(8) manual pages." ;; esac echo "----------------------------------------------------------------------" fi exit $EXIT_SUCCESS } test finish = "$opt_mode" && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $debug_cmd # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$SHELL" = "$nonopt" || test /bin/sh = "$nonopt" || # Allow the use of GNU shtool's install command. case $nonopt in *shtool*) :;; *) false;; esac then # Aesthetically quote it. func_quote_for_eval "$nonopt" install_prog="$func_quote_for_eval_result " arg=$1 shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. func_quote_for_eval "$arg" func_append install_prog "$func_quote_for_eval_result" install_shared_prog=$install_prog case " $install_prog " in *[\\\ /]cp\ *) install_cp=: ;; *) install_cp=false ;; esac # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=false stripme= no_mode=: for arg do arg2= if test -n "$dest"; then func_append files " $dest" dest=$arg continue fi case $arg in -d) isdir=: ;; -f) if $install_cp; then :; else prev=$arg fi ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then if test X-m = "X$prev" && test -n "$install_override_mode"; then arg2=$install_override_mode no_mode=false fi prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. func_quote_for_eval "$arg" func_append install_prog " $func_quote_for_eval_result" if test -n "$arg2"; then func_quote_for_eval "$arg2" fi func_append install_shared_prog " $func_quote_for_eval_result" done test -z "$install_prog" && \ func_fatal_help "you must specify an install program" test -n "$prev" && \ func_fatal_help "the '$prev' option requires an argument" if test -n "$install_override_mode" && $no_mode; then if $install_cp; then :; else func_quote_for_eval "$install_override_mode" func_append install_shared_prog " -m $func_quote_for_eval_result" fi fi if test -z "$files"; then if test -z "$dest"; then func_fatal_help "no file or destination specified" else func_fatal_help "you must specify a destination" fi fi # Strip any trailing slash from the destination. func_stripname '' '/' "$dest" dest=$func_stripname_result # Check to see that the destination is a directory. test -d "$dest" && isdir=: if $isdir; then destdir=$dest destname= else func_dirname_and_basename "$dest" "" "." destdir=$func_dirname_result destname=$func_basename_result # Not a directory, so check to see that there is only one file specified. set dummy $files; shift test "$#" -gt 1 && \ func_fatal_help "'$dest' is not a directory" fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) func_fatal_help "'$destdir' must be an absolute directory name" ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic=$magic staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. func_append staticlibs " $file" ;; *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "'$file' is not a valid libtool archive" library_names= old_library= relink_command= func_source "$file" # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) func_append current_libdirs " $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) func_append future_libdirs " $libdir" ;; esac fi func_dirname "$file" "/" "" dir=$func_dirname_result func_append dir "$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$ECHO "$destdir" | $SED -e "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. test "$inst_prefix_dir" = "$destdir" && \ func_fatal_error "error: cannot install '$file' to a directory not ending in $libdir" if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%%"` fi func_warning "relinking '$file'" func_show_eval "$relink_command" \ 'func_fatal_error "error: relink '\''$file'\'' with the above command before installing it"' fi # See the names of the shared library. set dummy $library_names; shift if test -n "$1"; then realname=$1 shift srcname=$realname test -n "$relink_command" && srcname=${realname}T # Install the shared library and build the symlinks. func_show_eval "$install_shared_prog $dir/$srcname $destdir/$realname" \ 'exit $?' tstripme=$stripme case $host_os in cygwin* | mingw* | pw32* | cegcc*) case $realname in *.dll.a) tstripme= ;; esac ;; esac if test -n "$tstripme" && test -n "$striplib"; then func_show_eval "$striplib $destdir/$realname" 'exit $?' fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try 'ln -sf' first, because the 'ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do test "$linkname" != "$realname" \ && func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })" done fi # Do each command in the postinstall commands. lib=$destdir/$realname func_execute_cmds "$postinstall_cmds" 'exit $?' fi # Install the pseudo-library for information purposes. func_basename "$file" name=$func_basename_result instname=$dir/${name}i func_show_eval "$install_prog $instname $destdir/$name" 'exit $?' # Maybe install the static library, too. test -n "$old_library" && func_append staticlibs " $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile=$destdir/$destname else func_basename "$file" destfile=$func_basename_result destfile=$destdir/$destfile fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) func_lo2o "$destfile" staticdest=$func_lo2o_result ;; *.$objext) staticdest=$destfile destfile= ;; *) func_fatal_help "cannot copy a libtool object to '$destfile'" ;; esac # Install the libtool object if requested. test -n "$destfile" && \ func_show_eval "$install_prog $file $destfile" 'exit $?' # Install the old object if enabled. if test yes = "$build_old_libs"; then # Deduce the name of the old-style object file. func_lo2o "$file" staticobj=$func_lo2o_result func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?' fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile=$destdir/$destname else func_basename "$file" destfile=$func_basename_result destfile=$destdir/$destfile fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext= case $file in *.exe) if test ! -f "$file"; then func_stripname '' '.exe' "$file" file=$func_stripname_result stripped_ext=.exe fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin* | *mingw*) if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" wrapper=$func_ltwrapper_scriptname_result else func_stripname '' '.exe' "$file" wrapper=$func_stripname_result fi ;; *) wrapper=$file ;; esac if func_ltwrapper_script_p "$wrapper"; then notinst_deplibs= relink_command= func_source "$wrapper" # Check the variables that should have been set. test -z "$generated_by_libtool_version" && \ func_fatal_error "invalid libtool wrapper script '$wrapper'" finalize=: for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then func_source "$lib" fi libfile=$libdir/`$ECHO "$lib" | $SED 's%^.*/%%g'` if test -n "$libdir" && test ! -f "$libfile"; then func_warning "'$lib' has not been installed in '$libdir'" finalize=false fi done relink_command= func_source "$wrapper" outputname= if test no = "$fast_install" && test -n "$relink_command"; then $opt_dry_run || { if $finalize; then tmpdir=`func_mktempdir` func_basename "$file$stripped_ext" file=$func_basename_result outputname=$tmpdir/$file # Replace the output file specification. relink_command=`$ECHO "$relink_command" | $SED 's%@OUTPUT@%'"$outputname"'%g'` $opt_quiet || { func_quote_for_expand "$relink_command" eval "func_echo $func_quote_for_expand_result" } if eval "$relink_command"; then : else func_error "error: relink '$file' with the above command before installing it" $opt_dry_run || ${RM}r "$tmpdir" continue fi file=$outputname else func_warning "cannot relink '$file'" fi } else # Install the binary that we compiled earlier. file=`$ECHO "$file$stripped_ext" | $SED "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) func_stripname '' '.exe' "$destfile" destfile=$func_stripname_result ;; esac ;; esac func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?' $opt_dry_run || if test -n "$outputname"; then ${RM}r "$tmpdir" fi ;; esac done for file in $staticlibs; do func_basename "$file" name=$func_basename_result # Set up the ranlib parameters. oldlib=$destdir/$name func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result func_show_eval "$install_prog \$file \$oldlib" 'exit $?' if test -n "$stripme" && test -n "$old_striplib"; then func_show_eval "$old_striplib $tool_oldlib" 'exit $?' fi # Do each command in the postinstall commands. func_execute_cmds "$old_postinstall_cmds" 'exit $?' done test -n "$future_libdirs" && \ func_warning "remember to run '$progname --finish$future_libdirs'" if test -n "$current_libdirs"; then # Maybe just do a dry run. $opt_dry_run && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL "$progpath" $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi } test install = "$opt_mode" && func_mode_install ${1+"$@"} # func_generate_dlsyms outputname originator pic_p # Extract symbols from dlprefiles and create ${outputname}S.o with # a dlpreopen symbol table. func_generate_dlsyms () { $debug_cmd my_outputname=$1 my_originator=$2 my_pic_p=${3-false} my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test no != "$dlself"; then if test -n "$NM" && test -n "$global_symbol_pipe"; then my_dlsyms=${my_outputname}S.c else func_error "not configured to extract global symbols from dlpreopened files" fi fi if test -n "$my_dlsyms"; then case $my_dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist=$output_objdir/$my_outputname.nm func_show_eval "$RM $nlist ${nlist}S ${nlist}T" # Parse the name list into a source file. func_verbose "creating $output_objdir/$my_dlsyms" $opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\ /* $my_dlsyms - symbol resolution table for '$my_outputname' dlsym emulation. */ /* Generated by $PROGRAM (GNU $PACKAGE) $VERSION */ #ifdef __cplusplus extern \"C\" { #endif #if defined __GNUC__ && (((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4)) || (__GNUC__ > 4)) #pragma GCC diagnostic ignored \"-Wstrict-prototypes\" #endif /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE /* DATA imports from DLLs on WIN32 can't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined __osf__ /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif #define STREQ(s1, s2) (strcmp ((s1), (s2)) == 0) /* External symbol declarations for the compiler. */\ " if test yes = "$dlself"; then func_verbose "generating symbol list for '$output'" $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$ECHO "$objs$old_deplibs" | $SP2NL | $SED "$lo2o" | $NL2SP` for progfile in $progfiles; do func_to_tool_file "$progfile" func_convert_file_msys_to_w32 func_verbose "extracting global C symbols from '$func_to_tool_file_result'" $opt_dry_run || eval "$NM $func_to_tool_file_result | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $opt_dry_run || { eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi if test -n "$export_symbols_regex"; then $opt_dry_run || { eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols=$output_objdir/$outputname.exp $opt_dry_run || { $RM $export_symbols eval "$SED -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac } else $opt_dry_run || { eval "$SED -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac } fi fi for dlprefile in $dlprefiles; do func_verbose "extracting global C symbols from '$dlprefile'" func_basename "$dlprefile" name=$func_basename_result case $host in *cygwin* | *mingw* | *cegcc* ) # if an import library, we need to obtain dlname if func_win32_import_lib_p "$dlprefile"; then func_tr_sh "$dlprefile" eval "curr_lafile=\$libfile_$func_tr_sh_result" dlprefile_dlbasename= if test -n "$curr_lafile" && func_lalib_p "$curr_lafile"; then # Use subshell, to avoid clobbering current variable values dlprefile_dlname=`source "$curr_lafile" && echo "$dlname"` if test -n "$dlprefile_dlname"; then func_basename "$dlprefile_dlname" dlprefile_dlbasename=$func_basename_result else # no lafile. user explicitly requested -dlpreopen . $sharedlib_from_linklib_cmd "$dlprefile" dlprefile_dlbasename=$sharedlib_from_linklib_result fi fi $opt_dry_run || { if test -n "$dlprefile_dlbasename"; then eval '$ECHO ": $dlprefile_dlbasename" >> "$nlist"' else func_warning "Could not compute DLL name from $name" eval '$ECHO ": $name " >> "$nlist"' fi func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe | $SED -e '/I __imp/d' -e 's/I __nm_/D /;s/_nm__//' >> '$nlist'" } else # not an import lib $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } fi ;; *) $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } ;; esac done $opt_dry_run || { # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $MV "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if $GREP -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else $GREP -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"' else echo '/* NONE */' >> "$output_objdir/$my_dlsyms" fi func_show_eval '$RM "${nlist}I"' if test -n "$global_symbol_to_import"; then eval "$global_symbol_to_import"' < "$nlist"S > "$nlist"I' fi echo >> "$output_objdir/$my_dlsyms" "\ /* The mapping between symbol names and symbols. */ typedef struct { const char *name; void *address; } lt_dlsymlist; extern LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[];\ " if test -s "$nlist"I; then echo >> "$output_objdir/$my_dlsyms" "\ static void lt_syminit(void) { LT_DLSYM_CONST lt_dlsymlist *symbol = lt_${my_prefix}_LTX_preloaded_symbols; for (; symbol->name; ++symbol) {" $SED 's/.*/ if (STREQ (symbol->name, \"&\")) symbol->address = (void *) \&&;/' < "$nlist"I >> "$output_objdir/$my_dlsyms" echo >> "$output_objdir/$my_dlsyms" "\ } }" fi echo >> "$output_objdir/$my_dlsyms" "\ LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = { {\"$my_originator\", (void *) 0}," if test -s "$nlist"I; then echo >> "$output_objdir/$my_dlsyms" "\ {\"@INIT@\", (void *) <_syminit}," fi case $need_lib_prefix in no) eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; *) eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; esac echo >> "$output_objdir/$my_dlsyms" "\ {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_${my_prefix}_LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " } # !$opt_dry_run pic_flag_for_symtable= case "$compile_command " in *" -static "*) ;; *) case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2.*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;; *-*-hpux*) pic_flag_for_symtable=" $pic_flag" ;; *) $my_pic_p && pic_flag_for_symtable=" $pic_flag" ;; esac ;; esac symtab_cflags= for arg in $LTCFLAGS; do case $arg in -pie | -fpie | -fPIE) ;; *) func_append symtab_cflags " $arg" ;; esac done # Now compile the dynamic symbol file. func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?' # Clean up the generated files. func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T" "${nlist}I"' # Transform the symbol file into the correct name. symfileobj=$output_objdir/${my_outputname}S.$objext case $host in *cygwin* | *mingw* | *cegcc* ) if test -f "$output_objdir/$my_outputname.def"; then compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` else compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` fi ;; *) compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` ;; esac ;; *) func_fatal_error "unknown suffix for '$my_dlsyms'" ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$ECHO "$compile_command" | $SED "s% @SYMFILE@%%"` finalize_command=`$ECHO "$finalize_command" | $SED "s% @SYMFILE@%%"` fi } # func_cygming_gnu_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is a GNU/binutils-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_gnu_implib_p () { $debug_cmd func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_gnu_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $EGREP ' (_head_[A-Za-z0-9_]+_[ad]l*|[A-Za-z0-9_]+_[ad]l*_iname)$'` test -n "$func_cygming_gnu_implib_tmp" } # func_cygming_ms_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is an MS-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_ms_implib_p () { $debug_cmd func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_ms_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $GREP '_NULL_IMPORT_DESCRIPTOR'` test -n "$func_cygming_ms_implib_tmp" } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. # Despite the name, also deal with 64 bit binaries. func_win32_libid () { $debug_cmd win32_libid_type=unknown win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static # Keep the egrep pattern in sync with the one in _LT_CHECK_MAGIC_METHOD. if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | $EGREP 'file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' >/dev/null; then case $nm_interface in "MS dumpbin") if func_cygming_ms_implib_p "$1" || func_cygming_gnu_implib_p "$1" then win32_nmres=import else win32_nmres= fi ;; *) func_to_tool_file "$1" func_convert_file_msys_to_w32 win32_nmres=`eval $NM -f posix -A \"$func_to_tool_file_result\" | $SED -n -e ' 1,100{ / I /{ s|.*|import| p q } }'` ;; esac case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $ECHO "$win32_libid_type" } # func_cygming_dll_for_implib ARG # # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib () { $debug_cmd sharedlib_from_linklib_result=`$DLLTOOL --identify-strict --identify "$1"` } # func_cygming_dll_for_implib_fallback_core SECTION_NAME LIBNAMEs # # The is the core of a fallback implementation of a # platform-specific function to extract the name of the # DLL associated with the specified import library LIBNAME. # # SECTION_NAME is either .idata$6 or .idata$7, depending # on the platform and compiler that created the implib. # # Echos the name of the DLL associated with the # specified import library. func_cygming_dll_for_implib_fallback_core () { $debug_cmd match_literal=`$ECHO "$1" | $SED "$sed_make_literal_regex"` $OBJDUMP -s --section "$1" "$2" 2>/dev/null | $SED '/^Contents of section '"$match_literal"':/{ # Place marker at beginning of archive member dllname section s/.*/====MARK====/ p d } # These lines can sometimes be longer than 43 characters, but # are always uninteresting /:[ ]*file format pe[i]\{,1\}-/d /^In archive [^:]*:/d # Ensure marker is printed /^====MARK====/p # Remove all lines with less than 43 characters /^.\{43\}/!d # From remaining lines, remove first 43 characters s/^.\{43\}//' | $SED -n ' # Join marker and all lines until next marker into a single line /^====MARK====/ b para H $ b para b :para x s/\n//g # Remove the marker s/^====MARK====// # Remove trailing dots and whitespace s/[\. \t]*$// # Print /./p' | # we now have a list, one entry per line, of the stringified # contents of the appropriate section of all members of the # archive that possess that section. Heuristic: eliminate # all those that have a first or second character that is # a '.' (that is, objdump's representation of an unprintable # character.) This should work for all archives with less than # 0x302f exports -- but will fail for DLLs whose name actually # begins with a literal '.' or a single character followed by # a '.'. # # Of those that remain, print the first one. $SED -e '/^\./d;/^.\./d;q' } # func_cygming_dll_for_implib_fallback ARG # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # # This fallback implementation is for use when $DLLTOOL # does not support the --identify-strict option. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib_fallback () { $debug_cmd if func_cygming_gnu_implib_p "$1"; then # binutils import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$7' "$1"` elif func_cygming_ms_implib_p "$1"; then # ms-generated import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$6' "$1"` else # unknown sharedlib_from_linklib_result= fi } # func_extract_an_archive dir oldlib func_extract_an_archive () { $debug_cmd f_ex_an_ar_dir=$1; shift f_ex_an_ar_oldlib=$1 if test yes = "$lock_old_archive_extraction"; then lockfile=$f_ex_an_ar_oldlib.lock until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done fi func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" \ 'stat=$?; rm -f "$lockfile"; exit $stat' if test yes = "$lock_old_archive_extraction"; then $opt_dry_run || rm -f "$lockfile" fi if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" fi } # func_extract_archives gentop oldlib ... func_extract_archives () { $debug_cmd my_gentop=$1; shift my_oldlibs=${1+"$@"} my_oldobjs= my_xlib= my_xabs= my_xdir= for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs=$my_xlib ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac func_basename "$my_xlib" my_xlib=$func_basename_result my_xlib_u=$my_xlib while :; do case " $extracted_archives " in *" $my_xlib_u "*) func_arith $extracted_serial + 1 extracted_serial=$func_arith_result my_xlib_u=lt$extracted_serial-$my_xlib ;; *) break ;; esac done extracted_archives="$extracted_archives $my_xlib_u" my_xdir=$my_gentop/$my_xlib_u func_mkdir_p "$my_xdir" case $host in *-darwin*) func_verbose "Extracting $my_xabs" # Do not bother doing anything if just a dry run $opt_dry_run || { darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` func_basename "$darwin_archive" darwin_base_archive=$func_basename_result darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true` if test -n "$darwin_arches"; then darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= func_verbose "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches; do func_mkdir_p "unfat-$$/$darwin_base_archive-$darwin_arch" $LIPO -thin $darwin_arch -output "unfat-$$/$darwin_base_archive-$darwin_arch/$darwin_base_archive" "$darwin_archive" cd "unfat-$$/$darwin_base_archive-$darwin_arch" func_extract_an_archive "`pwd`" "$darwin_base_archive" cd "$darwin_curdir" $RM "unfat-$$/$darwin_base_archive-$darwin_arch/$darwin_base_archive" done # $darwin_arches ## Okay now we've a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP` $LIPO -create -output "$darwin_file" $darwin_files done # $darwin_filelist $RM -rf unfat-$$ cd "$darwin_orig_dir" else cd $darwin_orig_dir func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches } # !$opt_dry_run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | sort | $NL2SP` done func_extract_archives_result=$my_oldobjs } # func_emit_wrapper [arg=no] # # Emit a libtool wrapper script on stdout. # Don't directly open a file because we may want to # incorporate the script contents within a cygwin/mingw # wrapper executable. Must ONLY be called from within # func_mode_link because it depends on a number of variables # set therein. # # ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR # variable will take. If 'yes', then the emitted script # will assume that the directory where it is stored is # the $objdir directory. This is a cygwin/mingw-specific # behavior. func_emit_wrapper () { func_emit_wrapper_arg1=${1-no} $ECHO "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM (GNU $PACKAGE) $VERSION # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='$sed_quote_subst' # Be Bourne compatible if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variables: generated_by_libtool_version='$macro_version' notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$ECHO are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then file=\"\$0\"" qECHO=`$ECHO "$ECHO" | $SED "$sed_quote_subst"` $ECHO "\ # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } ECHO=\"$qECHO\" fi # Very basic option parsing. These options are (a) specific to # the libtool wrapper, (b) are identical between the wrapper # /script/ and the wrapper /executable/ that is used only on # windows platforms, and (c) all begin with the string "--lt-" # (application programs are unlikely to have options that match # this pattern). # # There are only two supported options: --lt-debug and # --lt-dump-script. There is, deliberately, no --lt-help. # # The first argument to this parsing function should be the # script's $0 value, followed by "$@". lt_option_debug= func_parse_lt_options () { lt_script_arg0=\$0 shift for lt_opt do case \"\$lt_opt\" in --lt-debug) lt_option_debug=1 ;; --lt-dump-script) lt_dump_D=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%/[^/]*$%%'\` test \"X\$lt_dump_D\" = \"X\$lt_script_arg0\" && lt_dump_D=. lt_dump_F=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%^.*/%%'\` cat \"\$lt_dump_D/\$lt_dump_F\" exit 0 ;; --lt-*) \$ECHO \"Unrecognized --lt- option: '\$lt_opt'\" 1>&2 exit 1 ;; esac done # Print the debug banner immediately: if test -n \"\$lt_option_debug\"; then echo \"$outputname:$output:\$LINENO: libtool wrapper (GNU $PACKAGE) $VERSION\" 1>&2 fi } # Used when --lt-debug. Prints its arguments to stdout # (redirection is the responsibility of the caller) func_lt_dump_args () { lt_dump_args_N=1; for lt_arg do \$ECHO \"$outputname:$output:\$LINENO: newargv[\$lt_dump_args_N]: \$lt_arg\" lt_dump_args_N=\`expr \$lt_dump_args_N + 1\` done } # Core function for launching the target application func_exec_program_core () { " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2* | *-cegcc*) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"$outputname:$output:\$LINENO: newargv[0]: \$progdir\\\\\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"$outputname:$output:\$LINENO: newargv[0]: \$progdir/\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $ECHO "\ \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2 exit 1 } # A function to encapsulate launching the target application # Strips options in the --lt-* namespace from \$@ and # launches target application with the remaining arguments. func_exec_program () { case \" \$* \" in *\\ --lt-*) for lt_wr_arg do case \$lt_wr_arg in --lt-*) ;; *) set x \"\$@\" \"\$lt_wr_arg\"; shift;; esac shift done ;; esac func_exec_program_core \${1+\"\$@\"} } # Parse options func_parse_lt_options \"\$0\" \${1+\"\$@\"} # Find the directory that this script lives in. thisdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | $SED -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$ECHO \"\$file\" | $SED 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | $SED -n 's/.*-> //p'\` done # Usually 'no', except on cygwin/mingw when embedded into # the cwrapper. WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1 if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then # special case for '.' if test \"\$thisdir\" = \".\"; then thisdir=\`pwd\` fi # remove .libs from thisdir case \"\$thisdir\" in *[\\\\/]$objdir ) thisdir=\`\$ECHO \"\$thisdir\" | $SED 's%[\\\\/][^\\\\/]*$%%'\` ;; $objdir ) thisdir=. ;; esac fi # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test yes = "$fast_install"; then $ECHO "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | $SED 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $MKDIR \"\$progdir\" else $RM \"\$progdir/\$file\" fi" $ECHO "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $ECHO \"\$relink_command_output\" >&2 $RM \"\$progdir/\$file\" exit 1 fi fi $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $RM \"\$progdir/\$program\"; $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; } $RM \"\$progdir/\$file\" fi" else $ECHO "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $ECHO "\ if test -f \"\$progdir/\$program\"; then" # fixup the dll searchpath if we need to. # # Fix the DLL searchpath if we need to. Do this before prepending # to shlibpath, because on Windows, both are PATH and uninstalled # libraries must come first. if test -n "$dllsearchpath"; then $ECHO "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi # Export our shlibpath_var if we have one. if test yes = "$shlibpath_overrides_runpath" && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $ECHO "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$ECHO \"\$$shlibpath_var\" | $SED 's/::*\$//'\` export $shlibpath_var " fi $ECHO "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. func_exec_program \${1+\"\$@\"} fi else # The program doesn't exist. \$ECHO \"\$0: error: '\$progdir/\$program' does not exist\" 1>&2 \$ECHO \"This script is just a wrapper for \$program.\" 1>&2 \$ECHO \"See the $PACKAGE documentation for more information.\" 1>&2 exit 1 fi fi\ " } # func_emit_cwrapperexe_src # emit the source code for a wrapper executable on stdout # Must ONLY be called from within func_mode_link because # it depends on a number of variable set therein. func_emit_cwrapperexe_src () { cat < #include #ifdef _MSC_VER # include # include # include #else # include # include # ifdef __CYGWIN__ # include # endif #endif #include #include #include #include #include #include #include #include #define STREQ(s1, s2) (strcmp ((s1), (s2)) == 0) /* declarations of non-ANSI functions */ #if defined __MINGW32__ # ifdef __STRICT_ANSI__ int _putenv (const char *); # endif #elif defined __CYGWIN__ # ifdef __STRICT_ANSI__ char *realpath (const char *, char *); int putenv (char *); int setenv (const char *, const char *, int); # endif /* #elif defined other_platform || defined ... */ #endif /* portability defines, excluding path handling macros */ #if defined _MSC_VER # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv # define S_IXUSR _S_IEXEC #elif defined __MINGW32__ # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv #elif defined __CYGWIN__ # define HAVE_SETENV # define FOPEN_WB "wb" /* #elif defined other platforms ... */ #endif #if defined PATH_MAX # define LT_PATHMAX PATH_MAX #elif defined MAXPATHLEN # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef S_IXOTH # define S_IXOTH 0 #endif #ifndef S_IXGRP # define S_IXGRP 0 #endif /* path handling portability macros */ #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined _WIN32 || defined __MSDOS__ || defined __DJGPP__ || \ defined __OS2__ # define HAVE_DOS_BASED_FILE_SYSTEM # define FOPEN_WB "wb" # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #ifndef FOPEN_WB # define FOPEN_WB "w" #endif #ifndef _O_BINARY # define _O_BINARY 0 #endif #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free (stale); stale = 0; } \ } while (0) #if defined LT_DEBUGWRAPPER static int lt_debug = 1; #else static int lt_debug = 0; #endif const char *program_name = "libtool-wrapper"; /* in case xstrdup fails */ void *xmalloc (size_t num); char *xstrdup (const char *string); const char *base_name (const char *name); char *find_executable (const char *wrapper); char *chase_symlinks (const char *pathspec); int make_executable (const char *path); int check_executable (const char *path); char *strendzap (char *str, const char *pat); void lt_debugprintf (const char *file, int line, const char *fmt, ...); void lt_fatal (const char *file, int line, const char *message, ...); static const char *nonnull (const char *s); static const char *nonempty (const char *s); void lt_setenv (const char *name, const char *value); char *lt_extend_str (const char *orig_value, const char *add, int to_end); void lt_update_exe_path (const char *name, const char *value); void lt_update_lib_path (const char *name, const char *value); char **prepare_spawn (char **argv); void lt_dump_script (FILE *f); EOF cat <= 0) && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return 1; else return 0; } int make_executable (const char *path) { int rval = 0; struct stat st; lt_debugprintf (__FILE__, __LINE__, "(make_executable): %s\n", nonempty (path)); if ((!path) || (!*path)) return 0; if (stat (path, &st) >= 0) { rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR); } return rval; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise Does not chase symlinks, even on platforms that support them. */ char * find_executable (const char *wrapper) { int has_slash = 0; const char *p; const char *p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; size_t tmp_len; char *concat_name; lt_debugprintf (__FILE__, __LINE__, "(find_executable): %s\n", nonempty (wrapper)); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined HAVE_DOS_BASED_FILE_SYSTEM if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } #if defined HAVE_DOS_BASED_FILE_SYSTEM } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char *path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char *q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR (*q)) break; p_len = (size_t) (q - p); p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC (char, p_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); return NULL; } char * chase_symlinks (const char *pathspec) { #ifndef S_ISLNK return xstrdup (pathspec); #else char buf[LT_PATHMAX]; struct stat s; char *tmp_pathspec = xstrdup (pathspec); char *p; int has_symlinks = 0; while (strlen (tmp_pathspec) && !has_symlinks) { lt_debugprintf (__FILE__, __LINE__, "checking path component for symlinks: %s\n", tmp_pathspec); if (lstat (tmp_pathspec, &s) == 0) { if (S_ISLNK (s.st_mode) != 0) { has_symlinks = 1; break; } /* search backwards for last DIR_SEPARATOR */ p = tmp_pathspec + strlen (tmp_pathspec) - 1; while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) p--; if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) { /* no more DIR_SEPARATORS left */ break; } *p = '\0'; } else { lt_fatal (__FILE__, __LINE__, "error accessing file \"%s\": %s", tmp_pathspec, nonnull (strerror (errno))); } } XFREE (tmp_pathspec); if (!has_symlinks) { return xstrdup (pathspec); } tmp_pathspec = realpath (pathspec, buf); if (tmp_pathspec == 0) { lt_fatal (__FILE__, __LINE__, "could not follow symlinks for %s", pathspec); } return xstrdup (tmp_pathspec); #endif } char * strendzap (char *str, const char *pat) { size_t len, patlen; assert (str != NULL); assert (pat != NULL); len = strlen (str); patlen = strlen (pat); if (patlen <= len) { str += len - patlen; if (STREQ (str, pat)) *str = '\0'; } return str; } void lt_debugprintf (const char *file, int line, const char *fmt, ...) { va_list args; if (lt_debug) { (void) fprintf (stderr, "%s:%s:%d: ", program_name, file, line); va_start (args, fmt); (void) vfprintf (stderr, fmt, args); va_end (args); } } static void lt_error_core (int exit_status, const char *file, int line, const char *mode, const char *message, va_list ap) { fprintf (stderr, "%s:%s:%d: %s: ", program_name, file, line, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *file, int line, const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, file, line, "FATAL", message, ap); va_end (ap); } static const char * nonnull (const char *s) { return s ? s : "(null)"; } static const char * nonempty (const char *s) { return (s && !*s) ? "(empty)" : nonnull (s); } void lt_setenv (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_setenv) setting '%s' to '%s'\n", nonnull (name), nonnull (value)); { #ifdef HAVE_SETENV /* always make a copy, for consistency with !HAVE_SETENV */ char *str = xstrdup (value); setenv (name, str, 1); #else size_t len = strlen (name) + 1 + strlen (value) + 1; char *str = XMALLOC (char, len); sprintf (str, "%s=%s", name, value); if (putenv (str) != EXIT_SUCCESS) { XFREE (str); } #endif } } char * lt_extend_str (const char *orig_value, const char *add, int to_end) { char *new_value; if (orig_value && *orig_value) { size_t orig_value_len = strlen (orig_value); size_t add_len = strlen (add); new_value = XMALLOC (char, add_len + orig_value_len + 1); if (to_end) { strcpy (new_value, orig_value); strcpy (new_value + orig_value_len, add); } else { strcpy (new_value, add); strcpy (new_value + add_len, orig_value); } } else { new_value = xstrdup (add); } return new_value; } void lt_update_exe_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_exe_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); /* some systems can't cope with a ':'-terminated path #' */ size_t len = strlen (new_value); while ((len > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[--len] = '\0'; } lt_setenv (name, new_value); XFREE (new_value); } } void lt_update_lib_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_lib_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); } } EOF case $host_os in mingw*) cat <<"EOF" /* Prepares an argument vector before calling spawn(). Note that spawn() does not by itself call the command interpreter (getenv ("COMSPEC") != NULL ? getenv ("COMSPEC") : ({ OSVERSIONINFO v; v.dwOSVersionInfoSize = sizeof(OSVERSIONINFO); GetVersionEx(&v); v.dwPlatformId == VER_PLATFORM_WIN32_NT; }) ? "cmd.exe" : "command.com"). Instead it simply concatenates the arguments, separated by ' ', and calls CreateProcess(). We must quote the arguments since Win32 CreateProcess() interprets characters like ' ', '\t', '\\', '"' (but not '<' and '>') in a special way: - Space and tab are interpreted as delimiters. They are not treated as delimiters if they are surrounded by double quotes: "...". - Unescaped double quotes are removed from the input. Their only effect is that within double quotes, space and tab are treated like normal characters. - Backslashes not followed by double quotes are not special. - But 2*n+1 backslashes followed by a double quote become n backslashes followed by a double quote (n >= 0): \" -> " \\\" -> \" \\\\\" -> \\" */ #define SHELL_SPECIAL_CHARS "\"\\ \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" #define SHELL_SPACE_CHARS " \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" char ** prepare_spawn (char **argv) { size_t argc; char **new_argv; size_t i; /* Count number of arguments. */ for (argc = 0; argv[argc] != NULL; argc++) ; /* Allocate new argument vector. */ new_argv = XMALLOC (char *, argc + 1); /* Put quoted arguments into the new argument vector. */ for (i = 0; i < argc; i++) { const char *string = argv[i]; if (string[0] == '\0') new_argv[i] = xstrdup ("\"\""); else if (strpbrk (string, SHELL_SPECIAL_CHARS) != NULL) { int quote_around = (strpbrk (string, SHELL_SPACE_CHARS) != NULL); size_t length; unsigned int backslashes; const char *s; char *quoted_string; char *p; length = 0; backslashes = 0; if (quote_around) length++; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') length += backslashes + 1; length++; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) length += backslashes + 1; quoted_string = XMALLOC (char, length + 1); p = quoted_string; backslashes = 0; if (quote_around) *p++ = '"'; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') { unsigned int j; for (j = backslashes + 1; j > 0; j--) *p++ = '\\'; } *p++ = c; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) { unsigned int j; for (j = backslashes; j > 0; j--) *p++ = '\\'; *p++ = '"'; } *p = '\0'; new_argv[i] = quoted_string; } else new_argv[i] = (char *) string; } new_argv[argc] = NULL; return new_argv; } EOF ;; esac cat <<"EOF" void lt_dump_script (FILE* f) { EOF func_emit_wrapper yes | $SED -n -e ' s/^\(.\{79\}\)\(..*\)/\1\ \2/ h s/\([\\"]\)/\\\1/g s/$/\\n/ s/\([^\n]*\).*/ fputs ("\1", f);/p g D' cat <<"EOF" } EOF } # end: func_emit_cwrapperexe_src # func_win32_import_lib_p ARG # True if ARG is an import lib, as indicated by $file_magic_cmd func_win32_import_lib_p () { $debug_cmd case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in *import*) : ;; *) false ;; esac } # func_mode_link arg... func_mode_link () { $debug_cmd case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) # It is impossible to link a dll without this setting, and # we shouldn't force the makefile maintainer to figure out # what system we are compiling for in order to pass an extra # flag for every libtool invocation. # allow_undefined=no # FIXME: Unfortunately, there are problems with the above when trying # to make a dll that has undefined symbols, in which case not # even a static library is built. For now, we need to specify # -no-undefined on the libtool link line when we can be certain # that all symbols are satisfied, otherwise we get a static library. allow_undefined=yes ;; *) allow_undefined=yes ;; esac libtool_args=$nonopt base_compile="$nonopt $@" compile_command=$nonopt finalize_command=$nonopt compile_rpath= finalize_rpath= compile_shlibpath= finalize_shlibpath= convenience= old_convenience= deplibs= old_deplibs= compiler_flags= linker_flags= dllsearchpath= lib_search_path=`pwd` inst_prefix_dir= new_inherited_linker_flags= avoid_version=no bindir= dlfiles= dlprefiles= dlself=no export_dynamic=no export_symbols= export_symbols_regex= generated= libobjs= ltlibs= module=no no_install=no objs= non_pic_objects= precious_files_regex= prefer_static_libs=no preload=false prev= prevarg= release= rpath= xrpath= perm_rpath= temp_rpath= thread_safe=no vinfo= vinfo_number=no weak_libs= single_module=$wl-single_module func_infer_tag $base_compile # We need to know -static, to get the right output filenames. for arg do case $arg in -shared) test yes != "$build_libtool_libs" \ && func_fatal_configuration "cannot build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test yes = "$build_libtool_libs" && test -z "$link_static_flag"; then func_warning "complete static linking is impossible in this configuration" fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; -static) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built ;; -static-libtool-libs) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; esac build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg=$1 shift func_quote_for_eval "$arg" qarg=$func_quote_for_eval_unquoted_result func_append libtool_args " $func_quote_for_eval_result" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) func_append compile_command " @OUTPUT@" func_append finalize_command " @OUTPUT@" ;; esac case $prev in bindir) bindir=$arg prev= continue ;; dlfiles|dlprefiles) $preload || { # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=: } case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test no = "$dlself"; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test dlprefiles = "$prev"; then dlself=yes elif test dlfiles = "$prev" && test yes != "$dlopen_self"; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test dlfiles = "$prev"; then func_append dlfiles " $arg" else func_append dlprefiles " $arg" fi prev= continue ;; esac ;; expsyms) export_symbols=$arg test -f "$arg" \ || func_fatal_error "symbol file '$arg' does not exist" prev= continue ;; expsyms_regex) export_symbols_regex=$arg prev= continue ;; framework) case $host in *-*-darwin*) case "$deplibs " in *" $qarg.ltframework "*) ;; *) func_append deplibs " $qarg.ltframework" # this is fixed later ;; esac ;; esac prev= continue ;; inst_prefix) inst_prefix_dir=$arg prev= continue ;; mllvm) # Clang does not use LLVM to link, so we can simply discard any # '-mllvm $arg' options when doing the link step. prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat "$save_arg"` do # func_append moreargs " $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test none = "$pic_object" && test none = "$non_pic_object"; then func_fatal_error "cannot find name of object for '$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result if test none != "$pic_object"; then # Prepend the subdirectory the object is found in. pic_object=$xdir$pic_object if test dlfiles = "$prev"; then if test yes = "$build_libtool_libs" && test yes = "$dlopen_support"; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test dlprefiles = "$prev"; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg=$pic_object fi # Non-PIC object. if test none != "$non_pic_object"; then # Prepend the subdirectory the object is found in. non_pic_object=$xdir$non_pic_object # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test none = "$pic_object"; then arg=$non_pic_object fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object=$pic_object func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "'$arg' is not a valid libtool object" fi fi done else func_fatal_error "link input file '$arg' does not exist" fi arg=$save_arg prev= continue ;; precious_regex) precious_files_regex=$arg prev= continue ;; release) release=-$arg prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac if test rpath = "$prev"; then case "$rpath " in *" $arg "*) ;; *) func_append rpath " $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) func_append xrpath " $arg" ;; esac fi prev= continue ;; shrext) shrext_cmds=$arg prev= continue ;; weak) func_append weak_libs " $arg" prev= continue ;; xcclinker) func_append linker_flags " $qarg" func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xcompiler) func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xlinker) func_append linker_flags " $qarg" func_append compiler_flags " $wl$qarg" prev= func_append compile_command " $wl$qarg" func_append finalize_command " $wl$qarg" continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg=$arg case $arg in -all-static) if test -n "$link_static_flag"; then # See comment for -static flag below, for more details. func_append compile_command " $link_static_flag" func_append finalize_command " $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. func_fatal_error "'-allow-undefined' must not be used because it is the default" ;; -avoid-version) avoid_version=yes continue ;; -bindir) prev=bindir continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then func_fatal_error "more than one -exported-symbols argument is not allowed" fi if test X-export-symbols = "X$arg"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework) prev=framework continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) func_append compile_command " $arg" func_append finalize_command " $arg" ;; esac continue ;; -L*) func_stripname "-L" '' "$arg" if test -z "$func_stripname_result"; then if test "$#" -gt 0; then func_fatal_error "require no space between '-L' and '$1'" else func_fatal_error "need path for '-L' option" fi fi func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` test -z "$absdir" && \ func_fatal_error "cannot determine absolute directory name of '$dir'" dir=$absdir ;; esac case "$deplibs " in *" -L$dir "* | *" $arg "*) # Will only happen for absolute or sysroot arguments ;; *) # Preserve sysroot, but never include relative directories case $dir in [\\/]* | [A-Za-z]:[\\/]* | =*) func_append deplibs " $arg" ;; *) func_append deplibs " -L$dir" ;; esac func_append lib_search_path " $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "$dir" | $SED 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; ::) dllsearchpath=$dir;; *) func_append dllsearchpath ":$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac continue ;; -l*) if test X-lc = "X$arg" || test X-lm = "X$arg"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc* | *-*-haiku*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test X-lc = "X$arg" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly* | *-*-bitrig*) # Do not include libc due to us having libc/libc_r. test X-lc = "X$arg" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework func_append deplibs " System.ltframework" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test X-lc = "X$arg" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test X-lc = "X$arg" && continue ;; esac elif test X-lc_r = "X$arg"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly* | *-*-bitrig*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi func_append deplibs " $arg" continue ;; -mllvm) prev=mllvm continue ;; -module) module=yes continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. # Darwin uses the -arch flag to determine output architecture. -model|-arch|-isysroot|--sysroot) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" case "$new_inherited_linker_flags " in *" $arg "*) ;; * ) func_append new_inherited_linker_flags " $arg" ;; esac continue ;; -multi_module) single_module=$wl-multi_module continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*) # The PATH hackery in wrapper scripts is required on Windows # and Darwin in order for the loader to find any dlls it needs. func_warning "'-no-install' is ignored for $host" func_warning "assuming '-no-fast-install' instead" fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) func_stripname '-R' '' "$arg" dir=$func_stripname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; =*) func_stripname '=' '' "$dir" dir=$lt_sysroot$func_stripname_result ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac continue ;; -shared) # The effects of -shared are defined in a previous loop. continue ;; -shrext) prev=shrext continue ;; -static | -static-libtool-libs) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -weak) prev=weak continue ;; -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result arg= save_ifs=$IFS; IFS=, for flag in $args; do IFS=$save_ifs func_quote_for_eval "$flag" func_append arg " $func_quote_for_eval_result" func_append compiler_flags " $func_quote_for_eval_result" done IFS=$save_ifs func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Wl,*) func_stripname '-Wl,' '' "$arg" args=$func_stripname_result arg= save_ifs=$IFS; IFS=, for flag in $args; do IFS=$save_ifs func_quote_for_eval "$flag" func_append arg " $wl$func_quote_for_eval_result" func_append compiler_flags " $wl$func_quote_for_eval_result" func_append linker_flags " $func_quote_for_eval_result" done IFS=$save_ifs func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # -msg_* for osf cc -msg_*) func_quote_for_eval "$arg" arg=$func_quote_for_eval_result ;; # Flags to be passed through unchanged, with rationale: # -64, -mips[0-9] enable 64-bit mode for the SGI compiler # -r[0-9][0-9]* specify processor for the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode for the Sun compiler # +DA*, +DD* enable 64-bit mode for the HP compiler # -q* compiler args for the IBM compiler # -m*, -t[45]*, -txscale* architecture-specific flags for GCC # -F/path path to uninstalled frameworks, gcc on darwin # -p, -pg, --coverage, -fprofile-* profiling flags for GCC # @file GCC response files # -tp=* Portland pgcc target processor selection # --sysroot=* for sysroot support # -O*, -g*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization # -stdlib=* select c++ std lib with clang -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \ -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*|-tp=*|--sysroot=*| \ -O*|-g*|-flto*|-fwhopr*|-fuse-linker-plugin|-stdlib=*) func_quote_for_eval "$arg" arg=$func_quote_for_eval_result func_append compile_command " $arg" func_append finalize_command " $arg" func_append compiler_flags " $arg" continue ;; # Some other compiler flag. -* | +*) func_quote_for_eval "$arg" arg=$func_quote_for_eval_result ;; *.$objext) # A standard object. func_append objs " $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test none = "$pic_object" && test none = "$non_pic_object"; then func_fatal_error "cannot find name of object for '$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result test none = "$pic_object" || { # Prepend the subdirectory the object is found in. pic_object=$xdir$pic_object if test dlfiles = "$prev"; then if test yes = "$build_libtool_libs" && test yes = "$dlopen_support"; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test dlprefiles = "$prev"; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg=$pic_object } # Non-PIC object. if test none != "$non_pic_object"; then # Prepend the subdirectory the object is found in. non_pic_object=$xdir$non_pic_object # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test none = "$pic_object"; then arg=$non_pic_object fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object=$pic_object func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "'$arg' is not a valid libtool object" fi fi ;; *.$libext) # An archive. func_append deplibs " $arg" func_append old_deplibs " $arg" continue ;; *.la) # A libtool-controlled library. func_resolve_sysroot "$arg" if test dlfiles = "$prev"; then # This library was specified with -dlopen. func_append dlfiles " $func_resolve_sysroot_result" prev= elif test dlprefiles = "$prev"; then # The library was specified with -dlpreopen. func_append dlprefiles " $func_resolve_sysroot_result" prev= else func_append deplibs " $func_resolve_sysroot_result" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. func_quote_for_eval "$arg" arg=$func_quote_for_eval_result ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then func_append compile_command " $arg" func_append finalize_command " $arg" fi done # argument parsing loop test -n "$prev" && \ func_fatal_help "the '$prevarg' option requires an argument" if test yes = "$export_dynamic" && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" func_append compile_command " $arg" func_append finalize_command " $arg" fi oldlibs= # calculate the name of the file, without its directory func_basename "$output" outputname=$func_basename_result libobjs_save=$libobjs if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$ECHO \"\$$shlibpath_var\" \| \$SED \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" func_dirname "$output" "/" "" output_objdir=$func_dirname_result$objdir func_to_tool_file "$output_objdir/" tool_output_objdir=$func_to_tool_file_result # Create the object directory. func_mkdir_p "$output_objdir" # Determine the type of output case $output in "") func_fatal_help "you must specify an output file" ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if $opt_preserve_dup_deps; then case "$libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append libs " $deplib" done if test lib = "$linkmode"; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if $opt_duplicate_compiler_generated_deps; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) func_append specialdeplibs " $pre_post_deps" ;; esac func_append pre_post_deps " $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries notinst_path= # paths that contain not-installed libtool libraries case $linkmode in lib) passes="conv dlpreopen link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) func_fatal_help "libraries can '-dlopen' only libtool libraries: $file" ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=false newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do # The preopen pass in lib mode reverses $deplibs; put it back here # so that -L comes before libs that need it for instance... if test lib,link = "$linkmode,$pass"; then ## FIXME: Find the place where the list is rebuilt in the wrong ## order, and fix it there properly tmp_deplibs= for deplib in $deplibs; do tmp_deplibs="$deplib $tmp_deplibs" done deplibs=$tmp_deplibs fi if test lib,link = "$linkmode,$pass" || test prog,scan = "$linkmode,$pass"; then libs=$deplibs deplibs= fi if test prog = "$linkmode"; then case $pass in dlopen) libs=$dlfiles ;; dlpreopen) libs=$dlprefiles ;; link) libs="$deplibs %DEPLIBS% $dependency_libs" ;; esac fi if test lib,dlpreopen = "$linkmode,$pass"; then # Collect and forward deplibs of preopened libtool libs for lib in $dlprefiles; do # Ignore non-libtool-libs dependency_libs= func_resolve_sysroot "$lib" case $lib in *.la) func_source "$func_resolve_sysroot_result" ;; esac # Collect preopened libtool deplibs, except any this library # has declared as weak libs for deplib in $dependency_libs; do func_basename "$deplib" deplib_base=$func_basename_result case " $weak_libs " in *" $deplib_base "*) ;; *) func_append deplibs " $deplib" ;; esac done done libs=$dlprefiles fi if test dlopen = "$pass"; then # Collect dlpreopened libraries save_deplibs=$deplibs deplibs= fi for deplib in $libs; do lib= found=false case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append compiler_flags " $deplib" if test lib = "$linkmode"; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -l*) if test lib != "$linkmode" && test prog != "$linkmode"; then func_warning "'-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test lib = "$linkmode"; then searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path" else searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path" fi for searchdir in $searchdirs; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib=$searchdir/lib$name$search_ext if test -f "$lib"; then if test .la = "$search_ext"; then found=: else found=false fi break 2 fi done done if $found; then # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test yes = "$allow_libtool_libs_with_static_runtimes"; then case " $predeps $postdeps " in *" $deplib "*) if func_lalib_p "$lib"; then library_names= old_library= func_source "$lib" for l in $old_library $library_names; do ll=$l done if test "X$ll" = "X$old_library"; then # only static version available found=false func_dirname "$lib" "" "." ladir=$func_dirname_result lib=$ladir/$old_library if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test lib = "$linkmode" && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi else # deplib doesn't seem to be a libtool library if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test lib = "$linkmode" && newdependency_libs="$deplib $newdependency_libs" fi continue fi ;; # -l *.ltframework) if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test lib = "$linkmode"; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test conv = "$pass" && continue newdependency_libs="$deplib $newdependency_libs" func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; prog) if test conv = "$pass"; then deplibs="$deplib $deplibs" continue fi if test scan = "$pass"; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; *) func_warning "'-L' is ignored for archives/objects" ;; esac # linkmode continue ;; # -L -R*) if test link = "$pass"; then func_stripname '-R' '' "$deplib" func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) func_resolve_sysroot "$deplib" lib=$func_resolve_sysroot_result ;; *.$libext) if test conv = "$pass"; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) # Linking convenience modules into shared libraries is allowed, # but linking other static libraries is non-portable. case " $dlpreconveniencelibs " in *" $deplib "*) ;; *) valid_a_lib=false case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` if eval "\$ECHO \"$deplib\"" 2>/dev/null | $SED 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=: fi ;; pass_all) valid_a_lib=: ;; esac if $valid_a_lib; then echo $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" else echo $ECHO "*** Warning: Trying to link with static lib archive $deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because the file extensions .$libext of this argument makes me believe" echo "*** that it is just a static archive that I should not use here." fi ;; esac continue ;; prog) if test link != "$pass"; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test conv = "$pass"; then deplibs="$deplib $deplibs" elif test prog = "$linkmode"; then if test dlpreopen = "$pass" || test yes != "$dlopen_support" || test no = "$build_libtool_libs"; then # If there is no dlopen support or we're linking statically, # we need to preload. func_append newdlprefiles " $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append newdlfiles " $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=: continue ;; esac # case $deplib $found || test -f "$lib" \ || func_fatal_error "cannot find the library '$lib' or unhandled argument '$deplib'" # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$lib" \ || func_fatal_error "'$lib' is not a valid libtool archive" func_dirname "$lib" "" "." ladir=$func_dirname_result dlname= dlopen= dlpreopen= libdir= library_names= old_library= inherited_linker_flags= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file func_source "$lib" # Convert "-framework foo" to "foo.ltframework" if test -n "$inherited_linker_flags"; then tmp_inherited_linker_flags=`$ECHO "$inherited_linker_flags" | $SED 's/-framework \([^ $]*\)/\1.ltframework/g'` for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do case " $new_inherited_linker_flags " in *" $tmp_inherited_linker_flag "*) ;; *) func_append new_inherited_linker_flags " $tmp_inherited_linker_flag";; esac done fi dependency_libs=`$ECHO " $dependency_libs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` if test lib,link = "$linkmode,$pass" || test prog,scan = "$linkmode,$pass" || { test prog != "$linkmode" && test lib != "$linkmode"; }; then test -n "$dlopen" && func_append dlfiles " $dlopen" test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen" fi if test conv = "$pass"; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then func_fatal_error "cannot find name of link library for '$lib'" fi # It is a libtool convenience library, so add in its objects. func_append convenience " $ladir/$objdir/$old_library" func_append old_convenience " $ladir/$objdir/$old_library" elif test prog != "$linkmode" && test lib != "$linkmode"; then func_fatal_error "'$lib' is not a convenience library" fi tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if $opt_preserve_dup_deps; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done continue fi # $pass = conv # Get the name of the library we link against. linklib= if test -n "$old_library" && { test yes = "$prefer_static_libs" || test built,no = "$prefer_static_libs,$installed"; }; then linklib=$old_library else for l in $old_library $library_names; do linklib=$l done fi if test -z "$linklib"; then func_fatal_error "cannot find name of link library for '$lib'" fi # This library was specified with -dlopen. if test dlopen = "$pass"; then test -z "$libdir" \ && func_fatal_error "cannot -dlopen a convenience library: '$lib'" if test -z "$dlname" || test yes != "$dlopen_support" || test no = "$build_libtool_libs" then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. func_append dlprefiles " $lib $dependency_libs" else func_append newdlfiles " $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir=$ladir ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then func_warning "cannot determine absolute directory name of '$ladir'" func_warning "passing it literally to the linker, although it might fail" abs_ladir=$ladir fi ;; esac func_basename "$lib" laname=$func_basename_result # Find the relevant object directory and library name. if test yes = "$installed"; then if test ! -f "$lt_sysroot$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then func_warning "library '$lib' was moved." dir=$ladir absdir=$abs_ladir libdir=$abs_ladir else dir=$lt_sysroot$libdir absdir=$lt_sysroot$libdir fi test yes = "$hardcode_automatic" && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir=$ladir absdir=$abs_ladir # Remove this search path later func_append notinst_path " $abs_ladir" else dir=$ladir/$objdir absdir=$abs_ladir/$objdir # Remove this search path later func_append notinst_path " $abs_ladir" fi fi # $installed = yes func_stripname 'lib' '.la' "$laname" name=$func_stripname_result # This library was specified with -dlpreopen. if test dlpreopen = "$pass"; then if test -z "$libdir" && test prog = "$linkmode"; then func_fatal_error "only libraries may -dlpreopen a convenience library: '$lib'" fi case $host in # special handling for platforms with PE-DLLs. *cygwin* | *mingw* | *cegcc* ) # Linker will automatically link against shared library if both # static and shared are present. Therefore, ensure we extract # symbols from the import library if a shared library is present # (otherwise, the dlopen module name will be incorrect). We do # this by putting the import library name into $newdlprefiles. # We recover the dlopen module name by 'saving' the la file # name in a special purpose variable, and (later) extracting the # dlname from the la file. if test -n "$dlname"; then func_tr_sh "$dir/$linklib" eval "libfile_$func_tr_sh_result=\$abs_ladir/\$laname" func_append newdlprefiles " $dir/$linklib" else func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" fi ;; * ) # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then func_append newdlprefiles " $dir/$dlname" else func_append newdlprefiles " $dir/$linklib" fi ;; esac fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test lib = "$linkmode"; then deplibs="$dir/$old_library $deplibs" elif test prog,link = "$linkmode,$pass"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test prog = "$linkmode" && test link != "$pass"; then func_append newlib_search_path " $ladir" deplibs="$lib $deplibs" linkalldeplibs=false if test no != "$link_all_deplibs" || test -z "$library_names" || test no = "$build_libtool_libs"; then linkalldeplibs=: fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; esac # Need to link against all dependency_libs? if $linkalldeplibs; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if $opt_preserve_dup_deps; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done # for deplib continue fi # $linkmode = prog... if test prog,link = "$linkmode,$pass"; then if test -n "$library_names" && { { test no = "$prefer_static_libs" || test built,yes = "$prefer_static_libs,$installed"; } || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath"; then # Make sure the rpath contains only unique directories. case $temp_rpath: in *"$absdir:"*) ;; *) func_append temp_rpath "$absdir:" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi # $linkmode,$pass = prog,link... if $alldeplibs && { test pass_all = "$deplibs_check_method" || { test yes = "$build_libtool_libs" && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test built = "$use_static_libs" && test yes = "$installed"; then use_static_libs=no fi if test -n "$library_names" && { test no = "$use_static_libs" || test -z "$old_library"; }; then case $host in *cygwin* | *mingw* | *cegcc*) # No point in relinking DLLs because paths are not encoded func_append notinst_deplibs " $lib" need_relink=no ;; *) if test no = "$installed"; then func_append notinst_deplibs " $lib" need_relink=yes fi ;; esac # This is a shared library # Warn about portability, can't link against -module's on some # systems (darwin). Don't bleat about dlopened modules though! dlopenmodule= for dlpremoduletest in $dlprefiles; do if test "X$dlpremoduletest" = "X$lib"; then dlopenmodule=$dlpremoduletest break fi done if test -z "$dlopenmodule" && test yes = "$shouldnotlink" && test link = "$pass"; then echo if test prog = "$linkmode"; then $ECHO "*** Warning: Linking the executable $output against the loadable module" else $ECHO "*** Warning: Linking the shared library $output against the loadable module" fi $ECHO "*** $linklib is not portable!" fi if test lib = "$linkmode" && test yes = "$hardcode_into_libs"; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names shift realname=$1 shift libname=`eval "\\$ECHO \"$libname_spec\""` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname=$dlname elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw* | *cegcc*) func_arith $current - $age major=$func_arith_result versuffix=-$major ;; esac eval soname=\"$soname_spec\" else soname=$realname fi # Make a new name for the extract_expsyms_cmds to use soroot=$soname func_basename "$soroot" soname=$func_basename_result func_stripname 'lib' '.dll' "$soname" newlib=libimp-$func_stripname_result.a # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else func_verbose "extracting exported symbol list from '$soname'" func_execute_cmds "$extract_expsyms_cmds" 'exit $?' fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else func_verbose "generating import library for '$soname'" func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?' fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test prog = "$linkmode" || test relink != "$opt_mode"; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test no = "$hardcode_direct"; then add=$dir/$linklib case $host in *-*-sco3.2v5.0.[024]*) add_dir=-L$dir ;; *-*-sysv4*uw2*) add_dir=-L$dir ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir=-L$dir ;; *-*-darwin* ) # if the lib is a (non-dlopened) module then we cannot # link against it, someone is ignoring the earlier warnings if /usr/bin/file -L $add 2> /dev/null | $GREP ": [^:]* bundle" >/dev/null; then if test "X$dlopenmodule" != "X$lib"; then $ECHO "*** Warning: lib $linklib is a module, not a shared library" if test -z "$old_library"; then echo echo "*** And there doesn't seem to be a static archive available" echo "*** The link will probably fail, sorry" else add=$dir/$old_library fi elif test -n "$old_library"; then add=$dir/$old_library fi fi esac elif test no = "$hardcode_minus_L"; then case $host in *-*-sunos*) add_shlibpath=$dir ;; esac add_dir=-L$dir add=-l$name elif test no = "$hardcode_shlibpath_var"; then add_shlibpath=$dir add=-l$name else lib_linked=no fi ;; relink) if test yes = "$hardcode_direct" && test no = "$hardcode_direct_absolute"; then add=$dir/$linklib elif test yes = "$hardcode_minus_L"; then add_dir=-L$absdir # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add=-l$name elif test yes = "$hardcode_shlibpath_var"; then add_shlibpath=$dir add=-l$name else lib_linked=no fi ;; *) lib_linked=no ;; esac if test yes != "$lib_linked"; then func_fatal_configuration "unsupported hardcode properties" fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) func_append compile_shlibpath "$add_shlibpath:" ;; esac fi if test prog = "$linkmode"; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test yes != "$hardcode_direct" && test yes != "$hardcode_minus_L" && test yes = "$hardcode_shlibpath_var"; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac fi fi fi if test prog = "$linkmode" || test relink = "$opt_mode"; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test yes = "$hardcode_direct" && test no = "$hardcode_direct_absolute"; then add=$libdir/$linklib elif test yes = "$hardcode_minus_L"; then add_dir=-L$libdir add=-l$name elif test yes = "$hardcode_shlibpath_var"; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac add=-l$name elif test yes = "$hardcode_automatic"; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib"; then add=$inst_prefix_dir$libdir/$linklib else add=$libdir/$linklib fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir=-L$libdir # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add=-l$name fi if test prog = "$linkmode"; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test prog = "$linkmode"; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test unsupported != "$hardcode_direct"; then test -n "$old_library" && linklib=$old_library compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test yes = "$build_libtool_libs"; then # Not a shared library if test pass_all != "$deplibs_check_method"; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. echo $ECHO "*** Warning: This system cannot link to static lib archive $lib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have." if test yes = "$module"; then echo "*** But as you try to build a module library, libtool will still create " echo "*** a static module, that should work as long as the dlopening application" echo "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using 'nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** 'nm' from GNU binutils and a full rebuild may help." fi if test no = "$build_old_libs"; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test lib = "$linkmode"; then if test -n "$dependency_libs" && { test yes != "$hardcode_into_libs" || test yes = "$build_old_libs" || test yes = "$link_static"; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) func_stripname '-R' '' "$libdir" temp_xrpath=$func_stripname_result case " $xrpath " in *" $temp_xrpath "*) ;; *) func_append xrpath " $temp_xrpath";; esac;; *) func_append temp_deplibs " $libdir";; esac done dependency_libs=$temp_deplibs fi func_append newlib_search_path " $absdir" # Link against this library test no = "$link_static" && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result";; *) func_resolve_sysroot "$deplib" ;; esac if $opt_preserve_dup_deps; then case "$tmp_libs " in *" $func_resolve_sysroot_result "*) func_append specialdeplibs " $func_resolve_sysroot_result" ;; esac fi func_append tmp_libs " $func_resolve_sysroot_result" done if test no != "$link_all_deplibs"; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do path= case $deplib in -L*) path=$deplib ;; *.la) func_resolve_sysroot "$deplib" deplib=$func_resolve_sysroot_result func_dirname "$deplib" "" "." dir=$func_dirname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir=$dir ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then func_warning "cannot determine absolute directory name of '$dir'" absdir=$dir fi ;; esac if $GREP "^installed=no" $deplib > /dev/null; then case $host in *-*-darwin*) depdepl= eval deplibrary_names=`$SED -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names"; then for tmp in $deplibrary_names; do depdepl=$tmp done if test -f "$absdir/$objdir/$depdepl"; then depdepl=$absdir/$objdir/$depdepl darwin_install_name=`$OTOOL -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` if test -z "$darwin_install_name"; then darwin_install_name=`$OTOOL64 -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` fi func_append compiler_flags " $wl-dylib_file $wl$darwin_install_name:$depdepl" func_append linker_flags " -dylib_file $darwin_install_name:$depdepl" path= fi fi ;; *) path=-L$absdir/$objdir ;; esac else eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "'$deplib' is not a valid libtool archive" test "$absdir" != "$libdir" && \ func_warning "'$deplib' seems to be moved" path=-L$absdir fi ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs if test link = "$pass"; then if test prog = "$linkmode"; then compile_deplibs="$new_inherited_linker_flags $compile_deplibs" finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs" else compiler_flags="$compiler_flags "`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` fi fi dependency_libs=$newdependency_libs if test dlpreopen = "$pass"; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test dlopen != "$pass"; then test conv = "$pass" || { # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) func_append lib_search_path " $dir" ;; esac done newlib_search_path= } if test prog,link = "$linkmode,$pass"; then vars="compile_deplibs finalize_deplibs" else vars=deplibs fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) func_append tmp_libs " $deplib" ;; esac ;; *) func_append tmp_libs " $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i= ;; esac if test -n "$i"; then func_append tmp_libs " $i" fi done dependency_libs=$tmp_libs done # for pass if test prog = "$linkmode"; then dlfiles=$newdlfiles fi if test prog = "$linkmode" || test lib = "$linkmode"; then dlprefiles=$newdlprefiles fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test no != "$dlself"; then func_warning "'-dlopen' is ignored for archives" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "'-l' and '-L' are ignored for archives" ;; esac test -n "$rpath" && \ func_warning "'-rpath' is ignored for archives" test -n "$xrpath" && \ func_warning "'-R' is ignored for archives" test -n "$vinfo" && \ func_warning "'-version-info/-version-number' is ignored for archives" test -n "$release" && \ func_warning "'-release' is ignored for archives" test -n "$export_symbols$export_symbols_regex" && \ func_warning "'-export-symbols' is ignored for archives" # Now set the variables for building old libraries. build_libtool_libs=no oldlibs=$output func_append objs "$old_deplibs" ;; lib) # Make sure we only generate libraries of the form 'libNAME.la'. case $outputname in lib*) func_stripname 'lib' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) test no = "$module" \ && func_fatal_help "libtool library '$output' must begin with 'lib'" if test no != "$need_lib_prefix"; then # Add the "lib" prefix for modules if required func_stripname '' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else func_stripname '' '.la' "$outputname" libname=$func_stripname_result fi ;; esac if test -n "$objs"; then if test pass_all != "$deplibs_check_method"; then func_fatal_error "cannot build libtool library '$output' from non-libtool objects on this host:$objs" else echo $ECHO "*** Warning: Linking the shared library $output against the non-libtool" $ECHO "*** objects $objs is not portable!" func_append libobjs " $objs" fi fi test no = "$dlself" \ || func_warning "'-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test 1 -lt "$#" \ && func_warning "ignoring multiple '-rpath's for a libtool library" install_libdir=$1 oldlibs= if test -z "$rpath"; then if test yes = "$build_libtool_libs"; then # Building a libtool convenience library. # Some compilers have problems with a '.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi test -n "$vinfo" && \ func_warning "'-version-info/-version-number' is ignored for convenience libraries" test -n "$release" && \ func_warning "'-release' is ignored for convenience libraries" else # Parse the version information argument. save_ifs=$IFS; IFS=: set dummy $vinfo 0 0 0 shift IFS=$save_ifs test -n "$7" && \ func_fatal_help "too many parameters to '-version-info'" # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major=$1 number_minor=$2 number_revision=$3 # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # that has an extra 1 added just for fun # case $version_type in # correct linux to gnu/linux during the next big refactor darwin|linux|osf|windows|none) func_arith $number_major + $number_minor current=$func_arith_result age=$number_minor revision=$number_revision ;; freebsd-aout|freebsd-elf|qnx|sunos) current=$number_major revision=$number_minor age=0 ;; irix|nonstopux) func_arith $number_major + $number_minor current=$func_arith_result age=$number_minor revision=$number_minor lt_irix_increment=no ;; esac ;; no) current=$1 revision=$2 age=$3 ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "CURRENT '$current' must be a nonnegative integer" func_fatal_error "'$vinfo' is not valid version information" ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "REVISION '$revision' must be a nonnegative integer" func_fatal_error "'$vinfo' is not valid version information" ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "AGE '$age' must be a nonnegative integer" func_fatal_error "'$vinfo' is not valid version information" ;; esac if test "$age" -gt "$current"; then func_error "AGE '$age' is greater than the current interface number '$current'" func_fatal_error "'$vinfo' is not valid version information" fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header func_arith $current - $age major=.$func_arith_result versuffix=$major.$age.$revision # Darwin ld doesn't like 0 for these options... func_arith $current + 1 minor_current=$func_arith_result xlcverstring="$wl-compatibility_version $wl$minor_current $wl-current_version $wl$minor_current.$revision" verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" # On Darwin other compilers case $CC in nagfor*) verstring="$wl-compatibility_version $wl$minor_current $wl-current_version $wl$minor_current.$revision" ;; *) verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" ;; esac ;; freebsd-aout) major=.$current versuffix=.$current.$revision ;; freebsd-elf) major=.$current versuffix=.$current ;; irix | nonstopux) if test no = "$lt_irix_increment"; then func_arith $current - $age else func_arith $current - $age + 1 fi major=$func_arith_result case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring=$verstring_prefix$major.$revision # Add in all the interfaces that we are compatible with. loop=$revision while test 0 -ne "$loop"; do func_arith $revision - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring=$verstring_prefix$major.$iface:$verstring done # Before this point, $major must not contain '.'. major=.$major versuffix=$major.$revision ;; linux) # correct to gnu/linux during the next big refactor func_arith $current - $age major=.$func_arith_result versuffix=$major.$age.$revision ;; osf) func_arith $current - $age major=.$func_arith_result versuffix=.$current.$age.$revision verstring=$current.$age.$revision # Add in all the interfaces that we are compatible with. loop=$age while test 0 -ne "$loop"; do func_arith $current - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring=$verstring:$iface.0 done # Make executables depend on our current version. func_append verstring ":$current.0" ;; qnx) major=.$current versuffix=.$current ;; sunos) major=.$current versuffix=.$current.$revision ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 file systems. func_arith $current - $age major=$func_arith_result versuffix=-$major ;; *) func_fatal_configuration "unknown library version type '$version_type'" ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring=0.0 ;; esac if test no = "$need_version"; then versuffix= else versuffix=.0.0 fi fi # Remove version info from name if versioning should be avoided if test yes,no = "$avoid_version,$need_version"; then major= versuffix= verstring= fi # Check to see if the archive will have undefined symbols. if test yes = "$allow_undefined"; then if test unsupported = "$allow_undefined_flag"; then if test yes = "$build_old_libs"; then func_warning "undefined symbols not allowed in $host shared libraries; building static only" build_libtool_libs=no else func_fatal_error "can't build $host shared library unless -no-undefined is specified" fi fi else # Don't allow undefined symbols. allow_undefined_flag=$no_undefined_flag fi fi func_generate_dlsyms "$libname" "$libname" : func_append libobjs " $symfileobj" test " " = "$libobjs" && libobjs= if test relink != "$opt_mode"; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$ECHO "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext | *.gcno) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/$libname$release.*) if test -n "$precious_files_regex"; then if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi func_append removelist " $p" ;; *) ;; esac done test -n "$removelist" && \ func_show_eval "${RM}r \$removelist" fi # Now set the variables for building old libraries. if test yes = "$build_old_libs" && test convenience != "$build_libtool_libs"; then func_append oldlibs " $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.$libext$/d; $lo2o" | $NL2SP` fi # Eliminate all temporary directories. #for path in $notinst_path; do # lib_search_path=`$ECHO "$lib_search_path " | $SED "s% $path % %g"` # deplibs=`$ECHO "$deplibs " | $SED "s% -L$path % %g"` # dependency_libs=`$ECHO "$dependency_libs " | $SED "s% -L$path % %g"` #done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do func_replace_sysroot "$libdir" func_append temp_xrpath " -R$func_replace_sysroot_result" case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done if test yes != "$hardcode_into_libs" || test yes = "$build_old_libs"; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles=$dlfiles dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) func_append dlfiles " $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles=$dlprefiles dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) func_append dlprefiles " $lib" ;; esac done if test yes = "$build_libtool_libs"; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc* | *-*-haiku*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework func_append deplibs " System.ltframework" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test yes = "$build_libtool_need_lc"; then func_append deplibs " -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release= versuffix= major= newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $opt_dry_run || $RM conftest.c cat > conftest.c </dev/null` $nocaseglob else potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null` fi for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null | $GREP " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib=$potent_lib while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | $SED 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib=$potliblink;; *) potlib=`$ECHO "$potlib" | $SED 's|[^/]*$||'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null | $SED -e 10q | $EGREP "$file_magic_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib= break 2 fi done done fi if test -n "$a_deplib"; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib"; then $ECHO "*** with $libname but no candidates were found. (...for file magic test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a file magic. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` for a_deplib in $deplibs; do case $a_deplib in -l*) func_stripname -l '' "$a_deplib" name=$func_stripname_result if test yes = "$allow_libtool_libs_with_static_runtimes"; then case " $predeps $postdeps " in *" $a_deplib "*) func_append newdeplibs " $a_deplib" a_deplib= ;; esac fi if test -n "$a_deplib"; then libname=`eval "\\$ECHO \"$libname_spec\""` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib=$potent_lib # see symlink-check above in file_magic test if eval "\$ECHO \"$potent_lib\"" 2>/dev/null | $SED 10q | \ $EGREP "$match_pattern_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib= break 2 fi done done fi if test -n "$a_deplib"; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib"; then $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a regex pattern. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; none | unknown | *) newdeplibs= tmp_deplibs=`$ECHO " $deplibs" | $SED 's/ -lc$//; s/ -[LR][^ ]*//g'` if test yes = "$allow_libtool_libs_with_static_runtimes"; then for i in $predeps $postdeps; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$ECHO " $tmp_deplibs" | $SED "s|$i||"` done fi case $tmp_deplibs in *[!\ \ ]*) echo if test none = "$deplibs_check_method"; then echo "*** Warning: inter-library dependencies are not supported in this platform." else echo "*** Warning: inter-library dependencies are not known to be supported." fi echo "*** All declared inter-library dependencies are being dropped." droppeddeps=yes ;; esac ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library with the System framework newdeplibs=`$ECHO " $newdeplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac if test yes = "$droppeddeps"; then if test yes = "$module"; then echo echo "*** Warning: libtool could not satisfy all declared inter-library" $ECHO "*** dependencies of module $libname. Therefore, libtool will create" echo "*** a static module, that should work as long as the dlopening" echo "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using 'nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** 'nm' from GNU binutils and a full rebuild may help." fi if test no = "$build_old_libs"; then oldlibs=$output_objdir/$libname.$libext build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else echo "*** The inter-library dependencies that have been dropped here will be" echo "*** automatically added whenever a program is linked with this library" echo "*** or is declared to -dlopen it." if test no = "$allow_undefined"; then echo echo "*** Since this library must not contain undefined symbols," echo "*** because either the platform does not support them or" echo "*** it was explicitly requested with -no-undefined," echo "*** libtool will only create a static version of it." if test no = "$build_old_libs"; then oldlibs=$output_objdir/$libname.$libext build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" case $host in *-*-darwin*) newdeplibs=`$ECHO " $newdeplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` new_inherited_linker_flags=`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` deplibs=`$ECHO " $deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done deplibs=$new_libs # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test yes = "$build_libtool_libs"; then # Remove $wl instances when linking with ld. # FIXME: should test the right _cmds variable. case $archive_cmds in *\$LD\ *) wl= ;; esac if test yes = "$hardcode_into_libs"; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath=$finalize_rpath test relink = "$opt_mode" || rpath=$compile_rpath$rpath for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then func_replace_sysroot "$libdir" libdir=$func_replace_sysroot_result if test -z "$hardcode_libdirs"; then hardcode_libdirs=$libdir else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append dep_rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir=$hardcode_libdirs eval "dep_rpath=\"$hardcode_libdir_flag_spec\"" fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath=$finalize_shlibpath test relink = "$opt_mode" || shlibpath=$compile_shlibpath$shlibpath if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names shift realname=$1 shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname=$realname fi if test -z "$dlname"; then dlname=$soname fi lib=$output_objdir/$realname linknames= for link do func_append linknames " $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$ECHO "$libobjs" | $SP2NL | $SED "$lo2o" | $NL2SP` test "X$libobjs" = "X " && libobjs= delfiles= if test -n "$export_symbols" && test -n "$include_expsyms"; then $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp" export_symbols=$output_objdir/$libname.uexp func_append delfiles " $export_symbols" fi orig_export_symbols= case $host_os in cygwin* | mingw* | cegcc*) if test -n "$export_symbols" && test -z "$export_symbols_regex"; then # exporting using user supplied symfile func_dll_def_p "$export_symbols" || { # and it's NOT already a .def file. Must figure out # which of the given symbols are data symbols and tag # them as such. So, trigger use of export_symbols_cmds. # export_symbols gets reassigned inside the "prepare # the list of exported symbols" if statement, so the # include_expsyms logic still works. orig_export_symbols=$export_symbols export_symbols= always_export_symbols=yes } fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test yes = "$always_export_symbols" || test -n "$export_symbols_regex"; then func_verbose "generating symbol list for '$libname.la'" export_symbols=$output_objdir/$libname.exp $opt_dry_run || $RM $export_symbols cmds=$export_symbols_cmds save_ifs=$IFS; IFS='~' for cmd1 in $cmds; do IFS=$save_ifs # Take the normal branch if the nm_file_list_spec branch # doesn't work or if tool conversion is not needed. case $nm_file_list_spec~$to_tool_file_cmd in *~func_convert_file_noop | *~func_convert_file_msys_to_w32 | ~*) try_normal_branch=yes eval cmd=\"$cmd1\" func_len " $cmd" len=$func_len_result ;; *) try_normal_branch=no ;; esac if test yes = "$try_normal_branch" \ && { test "$len" -lt "$max_cmd_len" \ || test "$max_cmd_len" -le -1; } then func_show_eval "$cmd" 'exit $?' skipped_export=false elif test -n "$nm_file_list_spec"; then func_basename "$output" output_la=$func_basename_result save_libobjs=$libobjs save_output=$output output=$output_objdir/$output_la.nm func_to_tool_file "$output" libobjs=$nm_file_list_spec$func_to_tool_file_result func_append delfiles " $output" func_verbose "creating $NM input file list: $output" for obj in $save_libobjs; do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > "$output" eval cmd=\"$cmd1\" func_show_eval "$cmd" 'exit $?' output=$save_output libobjs=$save_libobjs skipped_export=false else # The command line is too long to execute in one step. func_verbose "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS=$save_ifs if test -n "$export_symbols_regex" && test : != "$skipped_export"; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols=$export_symbols test -n "$orig_export_symbols" && tmp_export_symbols=$orig_export_symbols $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test : != "$skipped_export" && test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for '$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands, which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) func_append tmp_deplibs " $test_deplib" ;; esac done deplibs=$tmp_deplibs if test -n "$convenience"; then if test -n "$whole_archive_flag_spec" && test yes = "$compiler_needs_object" && test -z "$libobjs"; then # extract the archives, so we have objects to list. # TODO: could optimize this to just extract one archive. whole_archive_flag_spec= fi if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= else gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $convenience func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi fi if test yes = "$thread_safe" && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" func_append linker_flags " $flag" fi # Make a backup of the uninstalled library when relinking if test relink = "$opt_mode"; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test yes = "$module" && test -n "$module_cmds"; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test : != "$skipped_export" && func_len " $test_cmds" && len=$func_len_result && test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise # or, if using GNU ld and skipped_export is not :, use a linker # script. # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output func_basename "$output" output_la=$func_basename_result # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= last_robj= k=1 if test -n "$save_libobjs" && test : != "$skipped_export" && test yes = "$with_gnu_ld"; then output=$output_objdir/$output_la.lnkscript func_verbose "creating GNU ld script: $output" echo 'INPUT (' > $output for obj in $save_libobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done echo ')' >> $output func_append delfiles " $output" func_to_tool_file "$output" output=$func_to_tool_file_result elif test -n "$save_libobjs" && test : != "$skipped_export" && test -n "$file_list_spec"; then output=$output_objdir/$output_la.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test yes = "$compiler_needs_object"; then firstobj="$1 " shift fi for obj do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done func_append delfiles " $output" func_to_tool_file "$output" output=$firstobj\"$file_list_spec$func_to_tool_file_result\" else if test -n "$save_libobjs"; then func_verbose "creating reloadable object files..." output=$output_objdir/$output_la-$k.$objext eval test_cmds=\"$reload_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 # Loop over the list of objects to be linked. for obj in $save_libobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result if test -z "$objlist" || test "$len" -lt "$max_cmd_len"; then func_append objlist " $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test 1 -eq "$k"; then # The first file doesn't have a previous command to add. reload_objs=$objlist eval concat_cmds=\"$reload_cmds\" else # All subsequent reloadable object files will link in # the last one created. reload_objs="$objlist $last_robj" eval concat_cmds=\"\$concat_cmds~$reload_cmds~\$RM $last_robj\" fi last_robj=$output_objdir/$output_la-$k.$objext func_arith $k + 1 k=$func_arith_result output=$output_objdir/$output_la-$k.$objext objlist=" $obj" func_len " $last_robj" func_arith $len0 + $func_len_result len=$func_arith_result fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ reload_objs="$objlist $last_robj" eval concat_cmds=\"\$concat_cmds$reload_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi func_append delfiles " $output" else output= fi ${skipped_export-false} && { func_verbose "generating symbol list for '$libname.la'" export_symbols=$output_objdir/$libname.exp $opt_dry_run || $RM $export_symbols libobjs=$output # Append the command to create the export file. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi } test -n "$save_libobjs" && func_verbose "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs=$IFS; IFS='~' for cmd in $concat_cmds; do IFS=$save_ifs $opt_quiet || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test relink = "$opt_mode"; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS=$save_ifs if test -n "$export_symbols_regex" && ${skipped_export-false}; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi ${skipped_export-false} && { if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols=$export_symbols test -n "$orig_export_symbols" && tmp_export_symbols=$orig_export_symbols $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for '$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands, which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi } libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test yes = "$module" && test -n "$module_cmds"; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi fi if test -n "$delfiles"; then # Append the command to remove temporary files to $cmds. eval cmds=\"\$cmds~\$RM $delfiles\" fi # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi save_ifs=$IFS; IFS='~' for cmd in $cmds; do IFS=$sp$nl eval cmd=\"$cmd\" IFS=$save_ifs $opt_quiet || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test relink = "$opt_mode"; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS=$save_ifs # Restore the uninstalled library and exit if test relink = "$opt_mode"; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then func_show_eval '${RM}r "$gentop"' fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?' fi done # If -module or -export-dynamic was specified, set the dlname. if test yes = "$module" || test yes = "$export_dynamic"; then # On all known operating systems, these are identical. dlname=$soname fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test no != "$dlself"; then func_warning "'-dlopen' is ignored for objects" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "'-l' and '-L' are ignored for objects" ;; esac test -n "$rpath" && \ func_warning "'-rpath' is ignored for objects" test -n "$xrpath" && \ func_warning "'-R' is ignored for objects" test -n "$vinfo" && \ func_warning "'-version-info' is ignored for objects" test -n "$release" && \ func_warning "'-release' is ignored for objects" case $output in *.lo) test -n "$objs$old_deplibs" && \ func_fatal_error "cannot build library object '$output' from non-libtool objects" libobj=$output func_lo2o "$libobj" obj=$func_lo2o_result ;; *) libobj= obj=$output ;; esac # Delete the old objects. $opt_dry_run || $RM $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec and hope we can get by with # turning comma into space.. wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\" reload_conv_objs=$reload_objs\ `$ECHO "$tmp_whole_archive_flags" | $SED 's|,| |g'` else gentop=$output_objdir/${obj}x func_append generated " $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # If we're not building shared, we need to use non_pic_objs test yes = "$build_libtool_libs" || libobjs=$non_pic_objects # Create the old-style object. reload_objs=$objs$old_deplibs' '`$ECHO "$libobjs" | $SP2NL | $SED "/\.$libext$/d; /\.lib$/d; $lo2o" | $NL2SP`' '$reload_conv_objs output=$obj func_execute_cmds "$reload_cmds" 'exit $?' # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS fi test yes = "$build_libtool_libs" || { if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $opt_dry_run || eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS } if test -n "$pic_flag" || test default != "$pic_mode"; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output=$libobj func_execute_cmds "$reload_cmds" 'exit $?' fi if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) func_stripname '' '.exe' "$output" output=$func_stripname_result.exe;; esac test -n "$vinfo" && \ func_warning "'-version-info' is ignored for programs" test -n "$release" && \ func_warning "'-release' is ignored for programs" $preload \ && test unknown,unknown,unknown = "$dlopen_support,$dlopen_self,$dlopen_self_static" \ && func_warning "'LT_INIT([dlopen])' not used. Assuming no dlopen support." case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's/ -lc / System.ltframework /'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac case $host in *-*-darwin*) # Don't allow lazy linking, it breaks C++ global constructors # But is supposedly fixed on 10.4 or later (yay!). if test CXX = "$tagname"; then case ${MACOSX_DEPLOYMENT_TARGET-10.0} in 10.[0123]) func_append compile_command " $wl-bind_at_load" func_append finalize_command " $wl-bind_at_load" ;; esac fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done compile_deplibs=$new_libs func_append compile_command " $compile_deplibs" func_append finalize_command " $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs=$libdir else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "$libdir" | $SED -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; ::) dllsearchpath=$libdir;; *) func_append dllsearchpath ":$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir=$hardcode_libdirs eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath=$rpath rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs=$libdir else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) func_append finalize_perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir=$hardcode_libdirs eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath=$rpath if test -n "$libobjs" && test yes = "$build_old_libs"; then # Transform all the library objects into standard objects. compile_command=`$ECHO "$compile_command" | $SP2NL | $SED "$lo2o" | $NL2SP` finalize_command=`$ECHO "$finalize_command" | $SP2NL | $SED "$lo2o" | $NL2SP` fi func_generate_dlsyms "$outputname" "@PROGRAM@" false # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=: case $host in *cegcc* | *mingw32ce*) # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway. wrappers_required=false ;; *cygwin* | *mingw* ) test yes = "$build_libtool_libs" || wrappers_required=false ;; *) if test no = "$need_relink" || test yes != "$build_libtool_libs"; then wrappers_required=false fi ;; esac $wrappers_required || { # Replace the output file specification. compile_command=`$ECHO "$compile_command" | $SED 's%@OUTPUT@%'"$output"'%g'` link_command=$compile_command$compile_rpath # We have no uninstalled library dependencies, so finalize right now. exit_status=0 func_show_eval "$link_command" 'exit_status=$?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Delete the generated files. if test -f "$output_objdir/${outputname}S.$objext"; then func_show_eval '$RM "$output_objdir/${outputname}S.$objext"' fi exit $exit_status } if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do func_append rpath "$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test yes = "$no_install"; then # We don't need to create a wrapper script. link_command=$compile_var$compile_command$compile_rpath # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $opt_dry_run || $RM $output # Link the executable and exit func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi exit $EXIT_SUCCESS fi case $hardcode_action,$fast_install in relink,*) # Fast installation is not supported link_command=$compile_var$compile_command$compile_rpath relink_command=$finalize_var$finalize_command$finalize_rpath func_warning "this platform does not like uninstalled shared libraries" func_warning "'$output' will be relinked during installation" ;; *,yes) link_command=$finalize_var$compile_command$finalize_rpath relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'` ;; *,no) link_command=$compile_var$compile_command$compile_rpath relink_command=$finalize_var$finalize_command$finalize_rpath ;; *,needless) link_command=$finalize_var$compile_command$finalize_rpath relink_command= ;; esac # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output_objdir/$outputname" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Now create the wrapper script. func_verbose "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` fi # Only actually do things if not in dry run mode. $opt_dry_run || { # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) func_stripname '' '.exe' "$output" output=$func_stripname_result ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe func_stripname '' '.exe' "$outputname" outputname=$func_stripname_result ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) func_dirname_and_basename "$output" "" "." output_name=$func_basename_result output_path=$func_dirname_result cwrappersource=$output_path/$objdir/lt-$output_name.c cwrapper=$output_path/$output_name.exe $RM $cwrappersource $cwrapper trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 func_emit_cwrapperexe_src > $cwrappersource # The wrapper executable is built using the $host compiler, # because it contains $host paths and files. If cross- # compiling, it, like the target executable, must be # executed on the $host or under an emulation environment. $opt_dry_run || { $LTCC $LTCFLAGS -o $cwrapper $cwrappersource $STRIP $cwrapper } # Now, create the wrapper script for func_source use: func_ltwrapper_scriptname $cwrapper $RM $func_ltwrapper_scriptname_result trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15 $opt_dry_run || { # note: this script will not be executed, so do not chmod. if test "x$build" = "x$host"; then $cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result else func_emit_wrapper no > $func_ltwrapper_scriptname_result fi } ;; * ) $RM $output trap "$RM $output; exit $EXIT_FAILURE" 1 2 15 func_emit_wrapper no > $output chmod +x $output ;; esac } exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do case $build_libtool_libs in convenience) oldobjs="$libobjs_save $symfileobj" addlibs=$convenience build_libtool_libs=no ;; module) oldobjs=$libobjs_save addlibs=$old_convenience build_libtool_libs=no ;; *) oldobjs="$old_deplibs $non_pic_objects" $preload && test -f "$symfileobj" \ && func_append oldobjs " $symfileobj" addlibs=$old_convenience ;; esac if test -n "$addlibs"; then gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $addlibs func_append oldobjs " $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test yes = "$build_libtool_libs"; then cmds=$old_archive_from_new_cmds else # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append oldobjs " $func_extract_archives_result" fi # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do func_basename "$obj" $ECHO "$func_basename_result" done | sort | sort -uc >/dev/null 2>&1); then : else echo "copying selected object files to avoid basename conflicts..." gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_mkdir_p "$gentop" save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do func_basename "$obj" objbase=$func_basename_result case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase func_arith $counter + 1 counter=$func_arith_result case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" func_append oldobjs " $gentop/$newobj" ;; *) func_append oldobjs " $obj" ;; esac done fi func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result eval cmds=\"$old_archive_cmds\" func_len " $cmds" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds elif test -n "$archiver_list_spec"; then func_verbose "using command file archive linking..." for obj in $oldobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > $output_objdir/$libname.libcmd func_to_tool_file "$output_objdir/$libname.libcmd" oldobjs=" $archiver_list_spec$func_to_tool_file_result" cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts func_verbose "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs oldobjs= # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done eval test_cmds=\"$old_archive_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 for obj in $save_oldobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result func_append objlist " $obj" if test "$len" -lt "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj"; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$old_archive_cmds\" objlist= len=$len0 fi done RANLIB=$save_RANLIB oldobjs=$objlist if test -z "$oldobjs"; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi func_execute_cmds "$cmds" 'exit $?' done test -n "$generated" && \ func_show_eval "${RM}r$generated" # Now create the libtool archive. case $output in *.la) old_library= test yes = "$build_old_libs" && old_library=$libname.$libext func_verbose "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL \"$progpath\" $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` if test yes = "$hardcode_automatic"; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test yes = "$installed"; then if test -z "$install_libdir"; then break fi output=$output_objdir/${outputname}i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) func_basename "$deplib" name=$func_basename_result func_resolve_sysroot "$deplib" eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $func_resolve_sysroot_result` test -z "$libdir" && \ func_fatal_error "'$deplib' is not a valid libtool archive" func_append newdependency_libs " ${lt_sysroot:+=}$libdir/$name" ;; -L*) func_stripname -L '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -L$func_replace_sysroot_result" ;; -R*) func_stripname -R '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -R$func_replace_sysroot_result" ;; *) func_append newdependency_libs " $deplib" ;; esac done dependency_libs=$newdependency_libs newdlfiles= for lib in $dlfiles; do case $lib in *.la) func_basename "$lib" name=$func_basename_result eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "'$lib' is not a valid libtool archive" func_append newdlfiles " ${lt_sysroot:+=}$libdir/$name" ;; *) func_append newdlfiles " $lib" ;; esac done dlfiles=$newdlfiles newdlprefiles= for lib in $dlprefiles; do case $lib in *.la) # Only pass preopened files to the pseudo-archive (for # eventual linking with the app. that links it) if we # didn't already link the preopened objects directly into # the library: func_basename "$lib" name=$func_basename_result eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "'$lib' is not a valid libtool archive" func_append newdlprefiles " ${lt_sysroot:+=}$libdir/$name" ;; esac done dlprefiles=$newdlprefiles else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs=$lib ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlfiles " $abs" done dlfiles=$newdlfiles newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs=$lib ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlprefiles " $abs" done dlprefiles=$newdlprefiles fi $RM $output # place dlname in correct position for cygwin # In fact, it would be nice if we could use this code for all target # systems that can't hard-code library paths into their executables # and that have no shared library path variable independent of PATH, # but it turns out we can't easily determine that from inspecting # libtool variables, so we have to hard-code the OSs to which it # applies here; at the moment, that means platforms that use the PE # object format with DLL files. See the long comment at the top of # tests/bindir.at for full details. tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll) # If a -bindir argument was supplied, place the dll there. if test -n "$bindir"; then func_relative_path "$install_libdir" "$bindir" tdlname=$func_relative_path_result/$dlname else # Otherwise fall back on heuristic. tdlname=../bin/$dlname fi ;; esac $ECHO > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM (GNU $PACKAGE) $VERSION # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Linker flags that cannot go in dependency_libs. inherited_linker_flags='$new_inherited_linker_flags' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Names of additional weak libraries provided by this library weak_library_names='$weak_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test no,yes = "$installed,$need_relink"; then $ECHO >> $output "\ relink_command=\"$relink_command\"" fi done } # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?' ;; esac exit $EXIT_SUCCESS } if test link = "$opt_mode" || test relink = "$opt_mode"; then func_mode_link ${1+"$@"} fi # func_mode_uninstall arg... func_mode_uninstall () { $debug_cmd RM=$nonopt files= rmforce=false exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic=$magic for arg do case $arg in -f) func_append RM " $arg"; rmforce=: ;; -*) func_append RM " $arg" ;; *) func_append files " $arg" ;; esac done test -z "$RM" && \ func_fatal_help "you must specify an RM program" rmdirs= for file in $files; do func_dirname "$file" "" "." dir=$func_dirname_result if test . = "$dir"; then odir=$objdir else odir=$dir/$objdir fi func_basename "$file" name=$func_basename_result test uninstall = "$opt_mode" && odir=$dir # Remember odir for removal later, being careful to avoid duplicates if test clean = "$opt_mode"; then case " $rmdirs " in *" $odir "*) ;; *) func_append rmdirs " $odir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if { test -L "$file"; } >/dev/null 2>&1 || { test -h "$file"; } >/dev/null 2>&1 || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif $rmforce; then continue fi rmfiles=$file case $name in *.la) # Possibly a libtool archive, so verify it. if func_lalib_p "$file"; then func_source $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do func_append rmfiles " $odir/$n" done test -n "$old_library" && func_append rmfiles " $odir/$old_library" case $opt_mode in clean) case " $library_names " in *" $dlname "*) ;; *) test -n "$dlname" && func_append rmfiles " $odir/$dlname" ;; esac test -n "$libdir" && func_append rmfiles " $odir/$name $odir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. func_execute_cmds "$postuninstall_cmds" '$rmforce || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" '$rmforce || exit_status=1' fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if func_lalib_p "$file"; then # Read the .lo file func_source $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" && test none != "$pic_object"; then func_append rmfiles " $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" && test none != "$non_pic_object"; then func_append rmfiles " $dir/$non_pic_object" fi fi ;; *) if test clean = "$opt_mode"; then noexename=$name case $file in *.exe) func_stripname '' '.exe' "$file" file=$func_stripname_result func_stripname '' '.exe' "$name" noexename=$func_stripname_result # $file with .exe has already been added to rmfiles, # add $file without .exe func_append rmfiles " $file" ;; esac # Do a test to see if this is a libtool program. if func_ltwrapper_p "$file"; then if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" relink_command= func_source $func_ltwrapper_scriptname_result func_append rmfiles " $func_ltwrapper_scriptname_result" else relink_command= func_source $dir/$noexename fi # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles func_append rmfiles " $odir/$name $odir/${name}S.$objext" if test yes = "$fast_install" && test -n "$relink_command"; then func_append rmfiles " $odir/lt-$name" fi if test "X$noexename" != "X$name"; then func_append rmfiles " $odir/lt-$noexename.c" fi fi fi ;; esac func_show_eval "$RM $rmfiles" 'exit_status=1' done # Try to remove the $objdir's in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then func_show_eval "rmdir $dir >/dev/null 2>&1" fi done exit $exit_status } if test uninstall = "$opt_mode" || test clean = "$opt_mode"; then func_mode_uninstall ${1+"$@"} fi test -z "$opt_mode" && { help=$generic_help func_fatal_help "you must specify a MODE" } test -z "$exec_cmd" && \ func_fatal_help "invalid operation mode '$opt_mode'" if test -n "$exec_cmd"; then eval exec "$exec_cmd" exit $EXIT_FAILURE fi exit $exit_status # The TAGs below are defined such that we never get into a situation # where we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared build_libtool_libs=no build_old_libs=yes # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: cloog-0.18.2/autoconf/Doxyfile.in0000664000175000017500000012747312254312305013574 00000000000000# Doxyfile 1.3.5 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = CLooG # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = @RELEASE@ # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc/source # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Brazilian, Catalan, Chinese, Chinese-Traditional, Croatian, Czech, Danish, Dutch, # Finnish, French, German, Greek, Hungarian, Italian, Japanese, Japanese-en # (Japanese with English messages), Korean, Norwegian, Polish, Portuguese, # Romanian, Russian, Serbian, Slovak, Slovene, Spanish, Swedish, and Ukrainian. OUTPUT_LANGUAGE = English # This tag can be used to specify the encoding used in the generated output. # The encoding is not always determined by the language that is chosen, # but also whether or not the output is meant for Windows or non-Windows users. # In case there is a difference, setting the USE_WINDOWS_ENCODING tag to YES # forces the Windows encoding (this is the default for the Windows binary), # whereas setting the tag to NO uses a Unix-style encoding (the default for # all platforms other than Windows). USE_WINDOWS_ENCODING = NO # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is used # as the annotated text. Otherwise, the brief description is used as-is. If left # blank, the following values are used ("$name" is automatically replaced with the # name of the entity): "The $name class" "The $name widget" "The $name file" # "is" "provides" "specifies" "contains" "represents" "a" "an" "the" ABBREVIATE_BRIEF = # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = YES # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all inherited # members of a class in the documentation of that class as if those members were # ordinary class members. Constructors, destructors and assignment operators of # the base classes will not be shown. INLINE_INHERITED_MEMB = YES # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = NO # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. It is allowed to use relative paths in the argument list. STRIP_FROM_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like the Qt-style comments (thus requiring an # explicit @brief command for a brief description. JAVADOC_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the DETAILS_AT_TOP tag is set to YES then Doxygen # will output the detailed description near the top, like JavaDoc. # If set to NO, the detailed description appears after the member # documentation. DETAILS_AT_TOP = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 8 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources # only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = NO # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources # only. Doxygen will then generate output that is more tailored for Java. # For instance, namespaces will be presented as packages, qualified scopes # will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = YES # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = YES # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = YES # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = YES # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = NO # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = NO # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = YES # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = YES # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #WARN_LOGFILE = doc/doxygen.log #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = source \ include/cloog # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx *.hpp # *.h++ *.idl *.odl *.cs *.php *.php3 *.inc FILE_PATTERNS = # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or directories # that are symbolic links (a Unix filesystem feature) are excluded from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. EXCLUDE_PATTERNS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. INPUT_FILTER = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES (the default) # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = YES # If the REFERENCES_RELATION tag is set to YES (the default) # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = YES # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compressed HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # If the GENERATE_TREEVIEW tag is set to YES, a side panel will be # generated containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (for instance Mozilla 1.0+, # Netscape 6.0+, Internet explorer 5.0+, or Konqueror). Windows users are # probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = YES # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = NO # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = NO # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = YES # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. This is useful # if you want to understand what is going on. On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_PREDEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse the # parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::addtions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base or # super classes. Setting the tag to NO turns the diagrams off. Note that this # option is superseded by the HAVE_DOT option below. This is only a fallback. It is # recommended to install and use dot, since it yields more powerful graphs. CLASS_DIAGRAMS = YES # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = YES # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = NO # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT tags are set to YES then doxygen will # generate a call dependency graph for every global function or class method. # Note that enabling this option will significantly increase the time of a run. # So in most cases it will be better to enable call graphs for selected # functions only using the \callgraph command. CALL_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found on the path. DOT_PATH = /usr/bin/ # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). # DOTFILE_DIRS = src # The MAX_DOT_GRAPH_WIDTH tag can be used to set the maximum allowed width # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_WIDTH = 1024 # The MAX_DOT_GRAPH_HEIGHT tag can be used to set the maximum allows height # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_HEIGHT = 1024 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes that # lay further from the root node will be omitted. Note that setting this option to # 1 or 2 may greatly reduce the computation time needed for large code bases. Also # note that a graph may be further truncated if the graph's image dimensions are # not sufficient to fit the graph (see MAX_DOT_GRAPH_WIDTH and MAX_DOT_GRAPH_HEIGHT). # If 0 is used for the depth value (the default), the graph is not depth-constrained. MAX_DOT_GRAPH_DEPTH = 0 # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES #--------------------------------------------------------------------------- # Configuration::addtions related to the search engine #--------------------------------------------------------------------------- # The SEARCHENGINE tag specifies whether or not a search engine should be # used. If set to NO the values of all tags below this one will be ignored. SEARCHENGINE = NO cloog-0.18.2/autoconf/missing0000755000175000017500000002415212254313267013054 00000000000000#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2012-01-06.13; # UTC # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006, # 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' sed_minuso='s/.* -o \([^ ]*\).*/\1/p' # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case $1 in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' autom4te touch the output file, or create a stub one automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file yacc create \`y.tab.[ch]', if possible, from existing .[ch] Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and \`g' are ignored when checking the name. Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # normalize program name to check for. program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). This is about non-GNU programs, so use $1 not # $program. case $1 in lex*|yacc*) # Not GNU programs, they don't have --version. ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case $program in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case $f in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te*) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison*|yacc*) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if test $# -ne 1; then eval LASTARG=\${$#} case $LASTARG in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.h fi ;; esac fi if test ! -f y.tab.h; then echo >y.tab.h fi if test ! -f y.tab.c; then echo 'main() { return 0; }' >y.tab.c fi ;; lex*|flex*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if test $# -ne 1; then eval LASTARG=\${$#} case $LASTARG in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if test ! -f lex.yy.c; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit $? fi ;; makeinfo*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n ' /^@setfilename/{ s/.* \([^ ]*\) *$/\1/ p q }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: cloog-0.18.2/autoconf/install-sh0000755000175000017500000003325512254313265013463 00000000000000#!/bin/sh # install - install a program, script, or datafile scriptversion=2011-11-20.07; # UTC # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # 'make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call 'install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then do_exit='(exit $ret); exit $ret' trap "ret=129; $do_exit" 1 trap "ret=130; $do_exit" 2 trap "ret=141; $do_exit" 13 trap "ret=143; $do_exit" 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names problematic for 'test' and other utilities. case $src in -* | [=\(\)!]) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; [-=\(\)!]*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test X"$d" = X && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: cloog-0.18.2/autoconf/config.guess0000755000175000017500000013036112254313265013773 00000000000000#! /bin/sh # Attempt to guess a canonical system name. # Copyright 1992-2013 Free Software Foundation, Inc. timestamp='2013-06-10' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # # Originally written by Per Bothner. # # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD # # Please send patches with a ChangeLog entry to config-patches@gnu.org. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright 1992-2013 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown case "${UNAME_SYSTEM}" in Linux|GNU|GNU/*) # If the system lacks a compiler, then just pick glibc. # We could probably try harder. LIBC=gnu eval $set_cc_for_build cat <<-EOF > $dummy.c #include #if defined(__UCLIBC__) LIBC=uclibc #elif defined(__dietlibc__) LIBC=dietlibc #else LIBC=gnu #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC'` ;; esac # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:Bitrig:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'` echo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE} exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` # Reset EXIT trap before exiting to avoid spurious non-zero exit code. exitcode=$? trap '' 0 exit $exitcode ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm*:riscos:*:*|arm*:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*) echo i386-pc-auroraux${UNAME_RELEASE} exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval $set_cc_for_build SUN_ARCH="i386" # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH="x86_64" fi fi echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[4567]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) UNAME_PROCESSOR=`/usr/bin/uname -p` case ${UNAME_PROCESSOR} in amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW64*:*) echo ${UNAME_MACHINE}-pc-mingw64 exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:MSYS*:*) echo ${UNAME_MACHINE}-pc-msys exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; authenticamd | genuineintel | EM64T) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; 8664:Windows_NT:*) echo x86_64-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC} exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; aarch64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; aarch64_be:Linux:*:*) UNAME_MACHINE=aarch64_be echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC="gnulibc1" ; fi echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; arc:Linux:*:* | arceb:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-${LIBC} else if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_PCS_VFP then echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi else echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf fi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; cris:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; crisv32:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; frv:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; hexagon:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:Linux:*:*) echo ${UNAME_MACHINE}-pc-linux-${LIBC} exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; mips:Linux:*:* | mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef ${UNAME_MACHINE} #undef ${UNAME_MACHINE}el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=${UNAME_MACHINE}el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=${UNAME_MACHINE} #else CPU= #endif #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'` test x"${CPU}" != x && { echo "${CPU}-unknown-linux-${LIBC}"; exit; } ;; or1k:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; or32:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; padre:Linux:*:*) echo sparc-unknown-linux-${LIBC} exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-${LIBC} exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-${LIBC} ;; PA8*) echo hppa2.0-unknown-linux-${LIBC} ;; *) echo hppa-unknown-linux-${LIBC} ;; esac exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-${LIBC} exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-${LIBC} exit ;; ppc64le:Linux:*:*) echo powerpc64le-unknown-linux-${LIBC} exit ;; ppcle:Linux:*:*) echo powerpcle-unknown-linux-${LIBC} exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux-${LIBC} exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; tile*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-${LIBC} exit ;; x86_64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configury will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; x86_64:Haiku:*:*) echo x86_64-unknown-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown eval $set_cc_for_build if test "$UNAME_PROCESSOR" = unknown ; then UNAME_PROCESSOR=powerpc fi if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then case $UNAME_PROCESSOR in i386) UNAME_PROCESSOR=x86_64 ;; powerpc) UNAME_PROCESSOR=powerpc64 ;; esac fi fi echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NEO-?:NONSTOP_KERNEL:*:*) echo neo-tandem-nsk${UNAME_RELEASE} exit ;; NSE-*:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; i*86:AROS:*:*) echo ${UNAME_MACHINE}-pc-aros exit ;; x86_64:VMkernel:*:*) echo ${UNAME_MACHINE}-unknown-esx exit ;; esac eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: cloog-0.18.2/isl/0000775000175000017500000000000012254314447010505 500000000000000cloog-0.18.2/isl/print_templ.c0000664000175000017500000000123712254313240013117 00000000000000#define xCAT(A,B) A ## B #define CAT(A,B) xCAT(A,B) #undef TYPE #define TYPE CAT(isl_,BASE) #define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) void FN(TYPE,dump)(__isl_keep TYPE *obj) { isl_printer *p; if (!obj) return; p = isl_printer_to_file(FN(TYPE,get_ctx)(obj), stderr); p = FN(isl_printer_print,BASE)(p, obj); p = isl_printer_end_line(p); isl_printer_free(p); } __isl_give char *FN(TYPE,to_str)(__isl_keep TYPE *obj) { isl_printer *p; char *s; if (!obj) return NULL; p = isl_printer_to_str(FN(TYPE,get_ctx)(obj)); p = FN(isl_printer_print,BASE)(p, obj); s = isl_printer_get_str(p); isl_printer_free(p); return s; } cloog-0.18.2/isl/isl_band_private.h0000664000175000017500000000241612254313240014074 00000000000000#ifndef ISL_BAND_PRIVATE_H #define ISL_BAND_PRIVATE_H #include #include #include #include /* Information about a band within a schedule. * * n is the number of scheduling dimensions within the band. * zero is an array of length n, indicating whether a scheduling dimension * results in zero dependence distances for the proximity dependences. * pma is the partial schedule corresponding to this band. * schedule is the schedule that contains this band. * parent is the parent of this band (or NULL if the band is a root). * children are the children of this band (or NULL if the band is a leaf). * * To avoid circular dependences in the reference counting, * the schedule and parent pointers are not reference counted. * isl_band_copy increments the reference count of schedule to ensure * that outside references to the band keep the schedule alive. */ struct isl_band { int ref; int n; int *zero; isl_union_pw_multi_aff *pma; isl_schedule *schedule; isl_band *parent; isl_band_list *children; }; #undef EL #define EL isl_band #include __isl_give isl_band *isl_band_alloc(isl_ctx *ctx); __isl_give isl_union_map *isl_band_list_get_suffix_schedule( __isl_keep isl_band_list *list); #endif cloog-0.18.2/isl/depcomp0000755000175000017500000004755612254313260012011 00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2011-12-04.11; # UTC # Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007, 2009, 2010, # 2011 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by `PROGRAMS ARGS'. object Object file output by `PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputting dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi cygpath_u="cygpath -u -f -" if test "$depmode" = msvcmsys; then # This is just like msvisualcpp but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvisualcpp fi if test "$depmode" = msvc7msys; then # This is just like msvc7 but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvc7 fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. hp depmode also adds that space, but also prefixes the VPATH ## to the object. Take care to not repeat it in the output. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile" # Add `dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mechanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; msvc7) if test "$libtool" = yes; then showIncludes=-Wc,-showIncludes else showIncludes=-showIncludes fi "$@" $showIncludes > "$tmpdepfile" stat=$? grep -v '^Note: including file: ' "$tmpdepfile" if test "$stat" = 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # The first sed program below extracts the file names and escapes # backslashes for cygpath. The second sed program outputs the file # name when reading, but also accumulates all include files in the # hold buffer in order to output them again at the end. This only # works with sed implementations that can handle large buffers. sed < "$tmpdepfile" -n ' /^Note: including file: *\(.*\)/ { s//\1/ s/\\/\\\\/g p }' | $cygpath_u | sort -u | sed -n ' s/ /\\ /g s/\(.*\)/ \1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/ / G p }' >> "$depfile" rm -f "$tmpdepfile" ;; msvc7msys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # X makedepend shift cleared=no eat=no for arg do case $cleared in no) set ""; shift cleared=yes ;; esac if test $eat = yes; then eat=no continue fi case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -arch) eat=yes ;; -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix=`echo "$object" | sed 's/^.*\././'` touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" # makedepend may prepend the VPATH from the source file name to the object. # No need to regex-escape $object, excess matching of '.' is harmless. sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi IFS=" " for arg do case "$arg" in -o) shift ;; $object) shift ;; "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E 2>/dev/null | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; msvcmsys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: cloog-0.18.2/isl/isl_ast_graft.c0000664000175000017500000010034412254313240013402 00000000000000/* * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include static __isl_give isl_ast_graft *isl_ast_graft_copy( __isl_keep isl_ast_graft *graft); #undef BASE #define BASE ast_graft #include #undef BASE #define BASE ast_graft #include isl_ctx *isl_ast_graft_get_ctx(__isl_keep isl_ast_graft *graft) { if (!graft) return NULL; return isl_basic_set_get_ctx(graft->enforced); } __isl_give isl_ast_node *isl_ast_graft_get_node( __isl_keep isl_ast_graft *graft) { return graft ? isl_ast_node_copy(graft->node) : NULL; } /* Create a graft for "node" with no guards and no enforced conditions. */ __isl_give isl_ast_graft *isl_ast_graft_alloc( __isl_take isl_ast_node *node, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_space *space; isl_ast_graft *graft; if (!node) return NULL; ctx = isl_ast_node_get_ctx(node); graft = isl_calloc_type(ctx, isl_ast_graft); if (!graft) goto error; space = isl_ast_build_get_space(build, 1); graft->ref = 1; graft->node = node; graft->guard = isl_set_universe(isl_space_copy(space)); graft->enforced = isl_basic_set_universe(space); if (!graft->guard || !graft->enforced) return isl_ast_graft_free(graft); return graft; error: isl_ast_node_free(node); return NULL; } /* Create a graft with no guards and no enforced conditions * encapsulating a call to the domain element specified by "executed". * "executed" is assumed to be single-valued. */ __isl_give isl_ast_graft *isl_ast_graft_alloc_domain( __isl_take isl_map *executed, __isl_keep isl_ast_build *build) { isl_ast_node *node; node = isl_ast_build_call_from_executed(build, executed); return isl_ast_graft_alloc(node, build); } static __isl_give isl_ast_graft *isl_ast_graft_copy( __isl_keep isl_ast_graft *graft) { if (!graft) return NULL; graft->ref++; return graft; } /* Do all the grafts in "list" have the same guard and is this guard * independent of the current depth? */ static int equal_independent_guards(__isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { int i, n; int depth; isl_ast_graft *graft_0; int equal = 1; int skip; graft_0 = isl_ast_graft_list_get_ast_graft(list, 0); if (!graft_0) return -1; depth = isl_ast_build_get_depth(build); skip = isl_set_involves_dims(graft_0->guard, isl_dim_set, depth, 1); if (skip < 0 || skip) { isl_ast_graft_free(graft_0); return skip < 0 ? -1 : 0; } n = isl_ast_graft_list_n_ast_graft(list); for (i = 1; i < n; ++i) { isl_ast_graft *graft; graft = isl_ast_graft_list_get_ast_graft(list, i); if (!graft) equal = -1; else equal = isl_set_is_equal(graft_0->guard, graft->guard); isl_ast_graft_free(graft); if (equal < 0 || !equal) break; } isl_ast_graft_free(graft_0); return equal; } /* Extract a common guard from the grafts in "list" that can be hoisted * out of the current level. If no such guard can be found, then return * a universal set. * * If all the grafts in the list have the same guard and if this guard * is independent of the current level, then it can be hoisted out. * Otherwise, we return the unshifted simple hull of the guards. * * The special case for equal guards is needed in case those guards * are non-convex. Taking the simple hull would remove information * and would not allow for these guards to be hoisted completely. */ static __isl_give isl_set *extract_hoistable_guard( __isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { int i, n; int depth; isl_ast_graft *graft_0; int equal; isl_set *guard; if (!list || !build) return NULL; n = isl_ast_graft_list_n_ast_graft(list); if (n == 0) return isl_set_universe(isl_ast_build_get_space(build, 1)); equal = equal_independent_guards(list, build); if (equal < 0) return NULL; graft_0 = isl_ast_graft_list_get_ast_graft(list, 0); if (!graft_0) return NULL; guard = isl_set_copy(graft_0->guard); isl_ast_graft_free(graft_0); if (equal) return guard; depth = isl_ast_build_get_depth(build); if (depth < isl_set_dim(guard, isl_dim_set)) { guard = isl_set_remove_divs_involving_dims(guard, isl_dim_set, depth, 1); guard = isl_set_eliminate(guard, isl_dim_set, depth, 1); guard = isl_set_compute_divs(guard); } for (i = 1; i < n; ++i) { isl_ast_graft *graft; isl_basic_set *hull; int is_universe; is_universe = isl_set_plain_is_universe(guard); if (is_universe < 0) guard = isl_set_free(guard); if (is_universe) break; graft = isl_ast_graft_list_get_ast_graft(list, i); if (!graft) { guard = isl_set_free(guard); break; } guard = isl_set_union(guard, isl_set_copy(graft->guard)); hull = isl_set_unshifted_simple_hull(guard); guard = isl_set_from_basic_set(hull); isl_ast_graft_free(graft); } return guard; } /* Internal data structure used inside insert_if. * * list is the list of guarded nodes created by each call to insert_if. * node is the original node that is guarded by insert_if. * build is the build in which the AST is constructed. */ struct isl_insert_if_data { isl_ast_node_list *list; isl_ast_node *node; isl_ast_build *build; }; static int insert_if(__isl_take isl_basic_set *bset, void *user); /* Insert an if node around "node" testing the condition encoded * in guard "guard". * * If the user does not want any disjunctions in the if conditions * and if "guard" does involve a disjunction, then we make the different * disjuncts disjoint and insert an if node corresponding to each disjunct * around a copy of "node". The result is then a block node containing * this sequence of guarded copies of "node". */ static __isl_give isl_ast_node *ast_node_insert_if( __isl_take isl_ast_node *node, __isl_take isl_set *guard, __isl_keep isl_ast_build *build) { struct isl_insert_if_data data; isl_ctx *ctx; ctx = isl_ast_build_get_ctx(build); if (isl_options_get_ast_build_allow_or(ctx) || isl_set_n_basic_set(guard) <= 1) { isl_ast_node *if_node; isl_ast_expr *expr; expr = isl_ast_build_expr_from_set(build, guard); if_node = isl_ast_node_alloc_if(expr); return isl_ast_node_if_set_then(if_node, node); } guard = isl_set_make_disjoint(guard); data.list = isl_ast_node_list_alloc(ctx, 0); data.node = node; data.build = build; if (isl_set_foreach_basic_set(guard, &insert_if, &data) < 0) data.list = isl_ast_node_list_free(data.list); isl_set_free(guard); isl_ast_node_free(data.node); return isl_ast_node_alloc_block(data.list); } /* Insert an if node around a copy of "data->node" testing the condition * encoded in guard "bset" and add the result to data->list. */ static int insert_if(__isl_take isl_basic_set *bset, void *user) { struct isl_insert_if_data *data = user; isl_ast_node *node; isl_set *set; set = isl_set_from_basic_set(bset); node = isl_ast_node_copy(data->node); node = ast_node_insert_if(node, set, data->build); data->list = isl_ast_node_list_add(data->list, node); return 0; } /* Insert an if node around graft->node testing the condition encoded * in guard "guard", assuming guard involves any conditions. */ static __isl_give isl_ast_graft *insert_if_node( __isl_take isl_ast_graft *graft, __isl_take isl_set *guard, __isl_keep isl_ast_build *build) { int univ; if (!graft) goto error; univ = isl_set_plain_is_universe(guard); if (univ < 0) goto error; if (univ) { isl_set_free(guard); return graft; } build = isl_ast_build_copy(build); build = isl_ast_build_set_enforced(build, isl_ast_graft_get_enforced(graft)); graft->node = ast_node_insert_if(graft->node, guard, build); isl_ast_build_free(build); if (!graft->node) return isl_ast_graft_free(graft); return graft; error: isl_set_free(guard); return isl_ast_graft_free(graft); } /* Insert an if node around graft->node testing the condition encoded * in graft->guard, assuming graft->guard involves any conditions. */ static __isl_give isl_ast_graft *insert_pending_guard_node( __isl_take isl_ast_graft *graft, __isl_keep isl_ast_build *build) { if (!graft) return NULL; return insert_if_node(graft, isl_set_copy(graft->guard), build); } /* Replace graft->enforced by "enforced". */ __isl_give isl_ast_graft *isl_ast_graft_set_enforced( __isl_take isl_ast_graft *graft, __isl_take isl_basic_set *enforced) { if (!graft || !enforced) goto error; isl_basic_set_free(graft->enforced); graft->enforced = enforced; return graft; error: isl_basic_set_free(enforced); return isl_ast_graft_free(graft); } /* Update "enforced" such that it only involves constraints that are * also enforced by "graft". */ static __isl_give isl_basic_set *update_enforced( __isl_take isl_basic_set *enforced, __isl_keep isl_ast_graft *graft, int depth) { isl_basic_set *enforced_g; enforced_g = isl_ast_graft_get_enforced(graft); if (depth < isl_basic_set_dim(enforced_g, isl_dim_set)) enforced_g = isl_basic_set_eliminate(enforced_g, isl_dim_set, depth, 1); enforced_g = isl_basic_set_remove_unknown_divs(enforced_g); enforced_g = isl_basic_set_align_params(enforced_g, isl_basic_set_get_space(enforced)); enforced = isl_basic_set_align_params(enforced, isl_basic_set_get_space(enforced_g)); enforced = isl_set_simple_hull(isl_basic_set_union(enforced, enforced_g)); return enforced; } /* Extend the node at *body with node. * * If body points to the else branch, then *body may still be NULL. * If so, we simply attach node to this else branch. * Otherwise, we attach a list containing the statements already * attached at *body followed by node. */ static void extend_body(__isl_keep isl_ast_node **body, __isl_take isl_ast_node *node) { isl_ast_node_list *list; if (!*body) { *body = node; return; } if ((*body)->type == isl_ast_node_block) { list = isl_ast_node_block_get_children(*body); isl_ast_node_free(*body); } else list = isl_ast_node_list_from_ast_node(*body); list = isl_ast_node_list_add(list, node); *body = isl_ast_node_alloc_block(list); } /* Merge "graft" into the last graft of "list". * body points to the then or else branch of an if node in that last graft. * * We attach graft->node to this branch and update the enforced * set of the last graft of "list" to take into account the enforced * set of "graft". */ static __isl_give isl_ast_graft_list *graft_extend_body( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_node **body, __isl_take isl_ast_graft *graft, __isl_keep isl_ast_build *build) { int n; int depth; isl_ast_graft *last; isl_space *space; isl_basic_set *enforced; if (!list || !graft) goto error; extend_body(body, isl_ast_node_copy(graft->node)); if (!*body) goto error; n = isl_ast_graft_list_n_ast_graft(list); last = isl_ast_graft_list_get_ast_graft(list, n - 1); depth = isl_ast_build_get_depth(build); space = isl_ast_build_get_space(build, 1); enforced = isl_basic_set_empty(space); enforced = update_enforced(enforced, last, depth); enforced = update_enforced(enforced, graft, depth); last = isl_ast_graft_set_enforced(last, enforced); list = isl_ast_graft_list_set_ast_graft(list, n - 1, last); isl_ast_graft_free(graft); return list; error: isl_ast_graft_free(graft); return isl_ast_graft_list_free(list); } /* Merge "graft" into the last graft of "list", attaching graft->node * to the then branch of "last_if". */ static __isl_give isl_ast_graft_list *extend_then( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_node *last_if, __isl_take isl_ast_graft *graft, __isl_keep isl_ast_build *build) { return graft_extend_body(list, &last_if->u.i.then, graft, build); } /* Merge "graft" into the last graft of "list", attaching graft->node * to the else branch of "last_if". */ static __isl_give isl_ast_graft_list *extend_else( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_node *last_if, __isl_take isl_ast_graft *graft, __isl_keep isl_ast_build *build) { return graft_extend_body(list, &last_if->u.i.else_node, graft, build); } /* This data structure keeps track of an if node. * * "node" is the actual if-node * "guard" is the original, non-simplified guard of the node * "complement" is the complement of "guard" in the context of outer if nodes */ struct isl_if_node { isl_ast_node *node; isl_set *guard; isl_set *complement; }; /* Given a list of "n" if nodes, clear those starting at "first" * and return "first" (i.e., the updated size of the array). */ static int clear_if_nodes(struct isl_if_node *if_node, int first, int n) { int i; for (i = first; i < n; ++i) { isl_set_free(if_node[i].guard); isl_set_free(if_node[i].complement); } return first; } /* For each graft in "list", * insert an if node around graft->node testing the condition encoded * in graft->guard, assuming graft->guard involves any conditions. * * We keep track of a list of generated if nodes that can be extended * without changing the order of the elements in "list". * If the guard of a graft is a subset of either the guard or its complement * of one of those if nodes, then the node * of the new graft is inserted into the then or else branch of the last graft * and the current graft is discarded. * The guard of the node is then simplified based on the conditions * enforced at that then or else branch. * Otherwise, the current graft is appended to the list. * * We only construct else branches if allowed by the user. */ static __isl_give isl_ast_graft_list *insert_pending_guard_nodes( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { int i, j, n, n_if; int allow_else; isl_ctx *ctx; isl_ast_graft_list *res; struct isl_if_node *if_node = NULL; if (!build || !list) return isl_ast_graft_list_free(list); ctx = isl_ast_build_get_ctx(build); n = isl_ast_graft_list_n_ast_graft(list); allow_else = isl_options_get_ast_build_allow_else(ctx); n_if = 0; if (n > 1) { if_node = isl_alloc_array(ctx, struct isl_if_node, n - 1); if (!if_node) return isl_ast_graft_list_free(list); } res = isl_ast_graft_list_alloc(ctx, n); for (i = 0; i < n; ++i) { isl_set *guard; isl_ast_graft *graft; int subset, found_then, found_else; isl_ast_node *node; graft = isl_ast_graft_list_get_ast_graft(list, i); if (!graft) break; subset = 0; found_then = found_else = -1; if (n_if > 0) { isl_set *test; test = isl_set_copy(graft->guard); test = isl_set_intersect(test, isl_set_copy(build->domain)); for (j = n_if - 1; j >= 0; --j) { subset = isl_set_is_subset(test, if_node[j].guard); if (subset < 0 || subset) { found_then = j; break; } if (!allow_else) continue; subset = isl_set_is_subset(test, if_node[j].complement); if (subset < 0 || subset) { found_else = j; break; } } n_if = clear_if_nodes(if_node, j + 1, n_if); isl_set_free(test); } if (subset < 0) { graft = isl_ast_graft_free(graft); break; } guard = isl_set_copy(graft->guard); if (found_then >= 0) graft->guard = isl_set_gist(graft->guard, isl_set_copy(if_node[found_then].guard)); else if (found_else >= 0) graft->guard = isl_set_gist(graft->guard, isl_set_copy(if_node[found_else].complement)); node = graft->node; if (!graft->guard) graft = isl_ast_graft_free(graft); graft = insert_pending_guard_node(graft, build); if (graft && graft->node != node && i != n - 1) { isl_set *set; if_node[n_if].node = graft->node; if_node[n_if].guard = guard; if (found_then >= 0) set = if_node[found_then].guard; else if (found_else >= 0) set = if_node[found_else].complement; else set = build->domain; set = isl_set_copy(set); set = isl_set_subtract(set, isl_set_copy(guard)); if_node[n_if].complement = set; n_if++; } else isl_set_free(guard); if (!graft) break; if (found_then >= 0) res = extend_then(res, if_node[found_then].node, graft, build); else if (found_else >= 0) res = extend_else(res, if_node[found_else].node, graft, build); else res = isl_ast_graft_list_add(res, graft); } if (i < n) res = isl_ast_graft_list_free(res); isl_ast_graft_list_free(list); clear_if_nodes(if_node, 0, n_if); free(if_node); return res; } /* Collect the nodes contained in the grafts in "list" in a node list. */ static __isl_give isl_ast_node_list *extract_node_list( __isl_keep isl_ast_graft_list *list) { int i, n; isl_ctx *ctx; isl_ast_node_list *node_list; if (!list) return NULL; ctx = isl_ast_graft_list_get_ctx(list); n = isl_ast_graft_list_n_ast_graft(list); node_list = isl_ast_node_list_alloc(ctx, n); for (i = 0; i < n; ++i) { isl_ast_node *node; isl_ast_graft *graft; graft = isl_ast_graft_list_get_ast_graft(list, i); node = isl_ast_graft_get_node(graft); node_list = isl_ast_node_list_add(node_list, node); isl_ast_graft_free(graft); } return node_list; } /* Look for shared enforced constraints by all the elements in "list" * on outer loops (with respect to the current depth) and return the result. * * We assume that the number of children is at least one. */ static __isl_give isl_basic_set *extract_shared_enforced( __isl_keep isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { int i, n; int depth; isl_space *space; isl_basic_set *enforced; if (!list) return NULL; n = isl_ast_graft_list_n_ast_graft(list); if (n == 0) isl_die(isl_ast_graft_list_get_ctx(list), isl_error_invalid, "for node should have at least one child", return NULL); space = isl_ast_build_get_space(build, 1); enforced = isl_basic_set_empty(space); depth = isl_ast_build_get_depth(build); for (i = 0; i < n; ++i) { isl_ast_graft *graft; graft = isl_ast_graft_list_get_ast_graft(list, i); enforced = update_enforced(enforced, graft, depth); isl_ast_graft_free(graft); } return enforced; } /* Record "guard" in "graft" so that it will be enforced somewhere * up the tree. If the graft already has a guard, then it may be partially * redundant in combination with the new guard and in the context * of build->domain. We therefore (re)compute the gist of the intersection * and coalesce the result. */ static __isl_give isl_ast_graft *store_guard(__isl_take isl_ast_graft *graft, __isl_take isl_set *guard, __isl_keep isl_ast_build *build) { int is_universe; if (!graft) goto error; is_universe = isl_set_plain_is_universe(guard); if (is_universe < 0) goto error; if (is_universe) { isl_set_free(guard); return graft; } graft->guard = isl_set_intersect(graft->guard, guard); graft->guard = isl_ast_build_compute_gist(build, graft->guard); graft->guard = isl_set_coalesce(graft->guard); if (!graft->guard) return isl_ast_graft_free(graft); return graft; error: isl_set_free(guard); return isl_ast_graft_free(graft); } /* For each graft in "list", replace its guard with the gist with * respect to "context". */ static __isl_give isl_ast_graft_list *gist_guards( __isl_take isl_ast_graft_list *list, __isl_keep isl_set *context) { int i, n; if (!list) return NULL; n = isl_ast_graft_list_n_ast_graft(list); for (i = 0; i < n; ++i) { isl_ast_graft *graft; graft = isl_ast_graft_list_get_ast_graft(list, i); if (!graft) break; graft->guard = isl_set_gist(graft->guard, isl_set_copy(context)); if (!graft->guard) graft = isl_ast_graft_free(graft); list = isl_ast_graft_list_set_ast_graft(list, i, graft); } if (i < n) return isl_ast_graft_list_free(list); return list; } /* Combine the grafts in the list into a single graft. * * If "up" is set then the resulting graft will be used at an outer level. * In this case, "build" refers to the outer level, while "sub_build" * refers to the inner level. If "up" is not set, then the same build * should be passed to both arguments. * * The guard is initialized to the shared guard of the list elements (if any), * provided it does not depend on the current dimension. * The guards in the elements are then simplified with respect to the * hoisted guard and materialized as if nodes around the contained AST nodes * in the context of "sub_build". * * The enforced set is initialized to the simple hull of the enforced sets * of the elements, provided the ast_build_exploit_nested_bounds option is set * or the new graft will be used at the same level. * * The node is initialized to either a block containing the nodes of "list" * or, if there is only a single element, the node of that element. */ static __isl_give isl_ast_graft *ast_graft_list_fuse( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build, __isl_keep isl_ast_build *sub_build, int up) { isl_ctx *ctx; isl_ast_node *node; isl_ast_graft *graft; isl_ast_node_list *node_list; isl_set *guard; if (!list) return NULL; ctx = isl_ast_build_get_ctx(build); guard = extract_hoistable_guard(list, build); list = gist_guards(list, guard); list = insert_pending_guard_nodes(list, sub_build); node_list = extract_node_list(list); node = isl_ast_node_from_ast_node_list(node_list); graft = isl_ast_graft_alloc(node, build); if (!up || isl_options_get_ast_build_exploit_nested_bounds(ctx)) { isl_basic_set *enforced; enforced = extract_shared_enforced(list, build); graft = isl_ast_graft_enforce(graft, enforced); } graft = store_guard(graft, guard, build); isl_ast_graft_list_free(list); return graft; } /* Combine the grafts in the list into a single graft. * Return a list containing this single graft. * If the original list is empty, then return an empty list. */ __isl_give isl_ast_graft_list *isl_ast_graft_list_fuse( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { isl_ast_graft *graft; if (!list) return NULL; if (isl_ast_graft_list_n_ast_graft(list) <= 1) return list; graft = ast_graft_list_fuse(list, build, build, 0); return isl_ast_graft_list_from_ast_graft(graft); } /* Combine the two grafts into a single graft. * Return a list containing this single graft. */ static __isl_give isl_ast_graft *isl_ast_graft_fuse( __isl_take isl_ast_graft *graft1, __isl_take isl_ast_graft *graft2, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_ast_graft_list *list; ctx = isl_ast_build_get_ctx(build); list = isl_ast_graft_list_alloc(ctx, 2); list = isl_ast_graft_list_add(list, graft1); list = isl_ast_graft_list_add(list, graft2); return ast_graft_list_fuse(list, build, build, 0); } /* Allocate a graft for the current level based on the list of grafts * of the inner level. * "build" represents the context of the current level. * "sub_build" represents the context of the inner level. * * The node is initialized to either a block containing the nodes of "children" * or, if there is only a single child, the node of that child. * If the current level requires a for node, it should be inserted by * a subsequent call to isl_ast_graft_insert_for. */ __isl_give isl_ast_graft *isl_ast_graft_alloc_level( __isl_take isl_ast_graft_list *children, __isl_keep isl_ast_build *build, __isl_keep isl_ast_build *sub_build) { return ast_graft_list_fuse(children, build, sub_build, 1); } /* Insert a for node enclosing the current graft->node. */ __isl_give isl_ast_graft *isl_ast_graft_insert_for( __isl_take isl_ast_graft *graft, __isl_take isl_ast_node *node) { if (!graft) goto error; graft->node = isl_ast_node_for_set_body(node, graft->node); if (!graft->node) return isl_ast_graft_free(graft); return graft; error: isl_ast_node_free(node); isl_ast_graft_free(graft); return NULL; } /* Represent the graft list as an AST node. * This operation drops the information about guards in the grafts, so * if there are any pending guards, then they are materialized as if nodes. */ __isl_give isl_ast_node *isl_ast_node_from_graft_list( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build) { isl_ast_node_list *node_list; list = insert_pending_guard_nodes(list, build); node_list = extract_node_list(list); isl_ast_graft_list_free(list); return isl_ast_node_from_ast_node_list(node_list); } void *isl_ast_graft_free(__isl_take isl_ast_graft *graft) { if (!graft) return NULL; if (--graft->ref > 0) return NULL; isl_ast_node_free(graft->node); isl_set_free(graft->guard); isl_basic_set_free(graft->enforced); free(graft); return NULL; } /* Record that the grafted tree enforces * "enforced" by intersecting graft->enforced with "enforced". */ __isl_give isl_ast_graft *isl_ast_graft_enforce( __isl_take isl_ast_graft *graft, __isl_take isl_basic_set *enforced) { if (!graft || !enforced) goto error; enforced = isl_basic_set_align_params(enforced, isl_basic_set_get_space(graft->enforced)); graft->enforced = isl_basic_set_align_params(graft->enforced, isl_basic_set_get_space(enforced)); graft->enforced = isl_basic_set_intersect(graft->enforced, enforced); if (!graft->enforced) return isl_ast_graft_free(graft); return graft; error: isl_basic_set_free(enforced); return isl_ast_graft_free(graft); } __isl_give isl_basic_set *isl_ast_graft_get_enforced( __isl_keep isl_ast_graft *graft) { return graft ? isl_basic_set_copy(graft->enforced) : NULL; } __isl_give isl_set *isl_ast_graft_get_guard(__isl_keep isl_ast_graft *graft) { return graft ? isl_set_copy(graft->guard) : NULL; } /* Record that "guard" needs to be inserted in "graft". * * We first simplify the guard in the context of the enforced set and * then we store the guard in case we may be able * to hoist it to higher levels and/or combine it with those of other grafts. */ __isl_give isl_ast_graft *isl_ast_graft_add_guard( __isl_take isl_ast_graft *graft, __isl_take isl_set *guard, __isl_keep isl_ast_build *build) { isl_basic_set *enforced; if (!graft || !build) goto error; enforced = isl_basic_set_copy(graft->enforced); guard = isl_set_gist(guard, isl_set_from_basic_set(enforced)); graft = store_guard(graft, guard, build); return graft; error: isl_set_free(guard); isl_ast_graft_free(graft); return NULL; } /* Reformulate the "graft", which was generated in the context * of an inner code generation, in terms of the outer code generation * AST build. * * If "product" is set, then the domain of the inner code generation build is * * [O -> S] * * with O the domain of the outer code generation build. * We essentially need to project out S. * * If "product" is not set, then we need to project the domains onto * their parameter spaces. */ __isl_give isl_ast_graft *isl_ast_graft_unembed(__isl_take isl_ast_graft *graft, int product) { isl_basic_set *enforced; if (!graft) return NULL; if (product) { enforced = graft->enforced; enforced = isl_basic_map_domain(isl_basic_set_unwrap(enforced)); graft->enforced = enforced; graft->guard = isl_map_domain(isl_set_unwrap(graft->guard)); } else { graft->enforced = isl_basic_set_params(graft->enforced); graft->guard = isl_set_params(graft->guard); } graft->guard = isl_set_compute_divs(graft->guard); if (!graft->enforced || !graft->guard) return isl_ast_graft_free(graft); return graft; } /* Reformulate the grafts in "list", which were generated in the context * of an inner code generation, in terms of the outer code generation * AST build. */ __isl_give isl_ast_graft_list *isl_ast_graft_list_unembed( __isl_take isl_ast_graft_list *list, int product) { int i, n; n = isl_ast_graft_list_n_ast_graft(list); for (i = 0; i < n; ++i) { isl_ast_graft *graft; graft = isl_ast_graft_list_get_ast_graft(list, i); graft = isl_ast_graft_unembed(graft, product); list = isl_ast_graft_list_set_ast_graft(list, i, graft); } return list; } /* Compute the preimage of "graft" under the function represented by "ma". * In other words, plug in "ma" in "enforced" and "guard" fields of "graft". */ __isl_give isl_ast_graft *isl_ast_graft_preimage_multi_aff( __isl_take isl_ast_graft *graft, __isl_take isl_multi_aff *ma) { isl_basic_set *enforced; if (!graft) return NULL; enforced = graft->enforced; graft->enforced = isl_basic_set_preimage_multi_aff(enforced, isl_multi_aff_copy(ma)); graft->guard = isl_set_preimage_multi_aff(graft->guard, ma); if (!graft->enforced || !graft->guard) return isl_ast_graft_free(graft); return graft; } /* Compute the preimage of all the grafts in "list" under * the function represented by "ma". */ __isl_give isl_ast_graft_list *isl_ast_graft_list_preimage_multi_aff( __isl_take isl_ast_graft_list *list, __isl_take isl_multi_aff *ma) { int i, n; n = isl_ast_graft_list_n_ast_graft(list); for (i = 0; i < n; ++i) { isl_ast_graft *graft; graft = isl_ast_graft_list_get_ast_graft(list, i); graft = isl_ast_graft_preimage_multi_aff(graft, isl_multi_aff_copy(ma)); list = isl_ast_graft_list_set_ast_graft(list, i, graft); } isl_multi_aff_free(ma); return list; } /* Compare two grafts based on their guards. */ static int cmp_graft(__isl_keep isl_ast_graft *a, __isl_keep isl_ast_graft *b, void *user) { return isl_set_plain_cmp(a->guard, b->guard); } /* Order the elements in "list" based on their guards. */ __isl_give isl_ast_graft_list *isl_ast_graft_list_sort_guard( __isl_take isl_ast_graft_list *list) { return isl_ast_graft_list_sort(list, &cmp_graft, NULL); } /* Merge the given two lists into a single list of grafts, * merging grafts with the same guard into a single graft. * * "list2" has been sorted using isl_ast_graft_list_sort. * "list1" may be the result of a previous call to isl_ast_graft_list_merge * and may therefore not be completely sorted. * * The elements in "list2" need to be executed after those in "list1", * but if the guard of a graft in "list2" is disjoint from the guards * of some final elements in "list1", then it can be moved up to before * those final elements. * * In particular, we look at each element g of "list2" in turn * and move it up beyond elements of "list1" that would be sorted * after g as long as each of these elements has a guard that is disjoint * from that of g. * * We do not allow the second or any later element of "list2" to be moved * before a previous elements of "list2" even if the reason that * that element didn't move up further was that its guard was not disjoint * from that of the previous element in "list1". */ __isl_give isl_ast_graft_list *isl_ast_graft_list_merge( __isl_take isl_ast_graft_list *list1, __isl_take isl_ast_graft_list *list2, __isl_keep isl_ast_build *build) { int i, j, first; if (!list1 || !list2 || !build) goto error; if (list2->n == 0) { isl_ast_graft_list_free(list2); return list1; } if (list1->n == 0) { isl_ast_graft_list_free(list1); return list2; } first = 0; for (i = 0; i < list2->n; ++i) { isl_ast_graft *graft; graft = isl_ast_graft_list_get_ast_graft(list2, i); if (!graft) break; for (j = list1->n; j >= 0; --j) { int cmp, disjoint; isl_ast_graft *graft_j; if (j == first) cmp = -1; else cmp = isl_set_plain_cmp(list1->p[j - 1]->guard, graft->guard); if (cmp > 0) { disjoint = isl_set_is_disjoint(graft->guard, list1->p[j - 1]->guard); if (disjoint < 0) { list1 = isl_ast_graft_list_free(list1); break; } if (!disjoint) cmp = -1; } if (cmp > 0) continue; if (cmp < 0) { list1 = isl_ast_graft_list_insert(list1, j, graft); break; } --j; graft_j = isl_ast_graft_list_get_ast_graft(list1, j); graft_j = isl_ast_graft_fuse(graft_j, graft, build); list1 = isl_ast_graft_list_set_ast_graft(list1, j, graft_j); break; } if (j < 0) isl_die(isl_ast_build_get_ctx(build), isl_error_internal, "element failed to get inserted", break); first = j + 1; if (!list1) break; } if (i < list2->n) list1 = isl_ast_graft_list_free(list1); isl_ast_graft_list_free(list2); return list1; error: isl_ast_graft_list_free(list1); isl_ast_graft_list_free(list2); return NULL; } __isl_give isl_printer *isl_printer_print_ast_graft(__isl_take isl_printer *p, __isl_keep isl_ast_graft *graft) { if (!p) return NULL; if (!graft) return isl_printer_free(p); p = isl_printer_print_str(p, "("); p = isl_printer_print_str(p, "guard: "); p = isl_printer_print_set(p, graft->guard); p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, "enforced: "); p = isl_printer_print_basic_set(p, graft->enforced); p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, "node: "); p = isl_printer_print_ast_node(p, graft->node); p = isl_printer_print_str(p, ")"); return p; } cloog-0.18.2/isl/polyhedron_sample.c0000664000175000017500000000161112254313240014302 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include "isl_sample.h" #include int main(int argc, char **argv) { struct isl_ctx *ctx = isl_ctx_alloc(); struct isl_basic_set *bset; struct isl_vec *sample; isl_printer *p; bset = isl_basic_set_read_from_file(ctx, stdin); sample = isl_basic_set_sample_vec(isl_basic_set_copy(bset)); p = isl_printer_to_file(ctx, stdout); p = isl_printer_print_vec(p, sample); p = isl_printer_end_line(p); isl_printer_free(p); assert(sample); if (sample->size > 0) assert(isl_basic_set_contains(bset, sample)); isl_basic_set_free(bset); isl_vec_free(sample); isl_ctx_free(ctx); return 0; } cloog-0.18.2/isl/isl_id.c0000664000175000017500000000771312254313240012032 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #undef BASE #define BASE id #include /* A special, static isl_id to use as domains (and ranges) * of sets and parameters domains. * The user should never get a hold on this isl_id. */ isl_id isl_id_none = { .ref = -1, .ctx = NULL, .name = "#none", .user = NULL }; isl_ctx *isl_id_get_ctx(__isl_keep isl_id *id) { return id ? id->ctx : NULL; } void *isl_id_get_user(__isl_keep isl_id *id) { return id ? id->user : NULL; } const char *isl_id_get_name(__isl_keep isl_id *id) { return id ? id->name : NULL; } static __isl_give isl_id *id_alloc(isl_ctx *ctx, const char *name, void *user) { const char *copy = name ? strdup(name) : NULL; isl_id *id; if (name && !copy) return NULL; id = isl_calloc_type(ctx, struct isl_id); if (!id) goto error; id->ctx = ctx; isl_ctx_ref(id->ctx); id->ref = 1; id->name = copy; id->user = user; id->hash = isl_hash_init(); if (name) id->hash = isl_hash_string(id->hash, name); else id->hash = isl_hash_builtin(id->hash, user); return id; error: free((char *)copy); return NULL; } struct isl_name_and_user { const char *name; void *user; }; static int isl_id_has_name_and_user(const void *entry, const void *val) { isl_id *id = (isl_id *)entry; struct isl_name_and_user *nu = (struct isl_name_and_user *) val; if (id->user != nu->user) return 0; if (!id->name && !nu->name) return 1; return !strcmp(id->name, nu->name); } __isl_give isl_id *isl_id_alloc(isl_ctx *ctx, const char *name, void *user) { struct isl_hash_table_entry *entry; uint32_t id_hash; struct isl_name_and_user nu = { name, user }; id_hash = isl_hash_init(); if (name) id_hash = isl_hash_string(id_hash, name); else id_hash = isl_hash_builtin(id_hash, user); entry = isl_hash_table_find(ctx, &ctx->id_table, id_hash, isl_id_has_name_and_user, &nu, 1); if (!entry) return NULL; if (entry->data) return isl_id_copy(entry->data); entry->data = id_alloc(ctx, name, user); if (!entry->data) ctx->id_table.n--; return entry->data; } /* If the id has a negative refcount, then it is a static isl_id * which should not be changed. */ __isl_give isl_id *isl_id_copy(isl_id *id) { if (!id) return NULL; if (id->ref < 0) return id; id->ref++; return id; } static int isl_id_eq(const void *entry, const void *name) { return entry == name; } uint32_t isl_hash_id(uint32_t hash, __isl_keep isl_id *id) { if (id) isl_hash_hash(hash, id->hash); return hash; } /* Replace the free_user callback by "free_user". */ __isl_give isl_id *isl_id_set_free_user(__isl_take isl_id *id, __isl_give void (*free_user)(void *user)) { if (!id) return NULL; id->free_user = free_user; return id; } /* If the id has a negative refcount, then it is a static isl_id * and should not be freed. */ void *isl_id_free(__isl_take isl_id *id) { struct isl_hash_table_entry *entry; if (!id) return NULL; if (id->ref < 0) return NULL; if (--id->ref > 0) return NULL; entry = isl_hash_table_find(id->ctx, &id->ctx->id_table, id->hash, isl_id_eq, id, 0); if (!entry) isl_die(id->ctx, isl_error_unknown, "unable to find id", (void)0); else isl_hash_table_remove(id->ctx, &id->ctx->id_table, entry); if (id->free_user) id->free_user(id->user); free((char *)id->name); isl_ctx_deref(id->ctx); free(id); return NULL; } __isl_give isl_printer *isl_printer_print_id(__isl_take isl_printer *p, __isl_keep isl_id *id) { if (!id) goto error; if (id->name) p = isl_printer_print_str(p, id->name); if (id->user) { char buffer[50]; snprintf(buffer, sizeof(buffer), "@%p", id->user); p = isl_printer_print_str(p, buffer); } return p; error: isl_printer_free(p); return NULL; } cloog-0.18.2/isl/isl_aff.c0000664000175000017500000040512212254313240012166 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2011 Sven Verdoolaege * Copyright 2012-2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #define ISL_DIM_H #include #include #include #include #include #include #include #include #include #include #include #undef BASE #define BASE aff #include #undef BASE #define BASE pw_aff #include __isl_give isl_aff *isl_aff_alloc_vec(__isl_take isl_local_space *ls, __isl_take isl_vec *v) { isl_aff *aff; if (!ls || !v) goto error; aff = isl_calloc_type(v->ctx, struct isl_aff); if (!aff) goto error; aff->ref = 1; aff->ls = ls; aff->v = v; return aff; error: isl_local_space_free(ls); isl_vec_free(v); return NULL; } __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls) { isl_ctx *ctx; isl_vec *v; unsigned total; if (!ls) return NULL; ctx = isl_local_space_get_ctx(ls); if (!isl_local_space_divs_known(ls)) isl_die(ctx, isl_error_invalid, "local space has unknown divs", goto error); if (!isl_local_space_is_set(ls)) isl_die(ctx, isl_error_invalid, "domain of affine expression should be a set", goto error); total = isl_local_space_dim(ls, isl_dim_all); v = isl_vec_alloc(ctx, 1 + 1 + total); return isl_aff_alloc_vec(ls, v); error: isl_local_space_free(ls); return NULL; } __isl_give isl_aff *isl_aff_zero_on_domain(__isl_take isl_local_space *ls) { isl_aff *aff; aff = isl_aff_alloc(ls); if (!aff) return NULL; isl_int_set_si(aff->v->el[0], 1); isl_seq_clr(aff->v->el + 1, aff->v->size - 1); return aff; } /* Return a piecewise affine expression defined on the specified domain * that is equal to zero. */ __isl_give isl_pw_aff *isl_pw_aff_zero_on_domain(__isl_take isl_local_space *ls) { return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls)); } /* Return an affine expression that is equal to the specified dimension * in "ls". */ __isl_give isl_aff *isl_aff_var_on_domain(__isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos) { isl_space *space; isl_aff *aff; if (!ls) return NULL; space = isl_local_space_get_space(ls); if (!space) goto error; if (isl_space_is_map(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "expecting (parameter) set space", goto error); if (pos >= isl_local_space_dim(ls, type)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "position out of bounds", goto error); isl_space_free(space); aff = isl_aff_alloc(ls); if (!aff) return NULL; pos += isl_local_space_offset(aff->ls, type); isl_int_set_si(aff->v->el[0], 1); isl_seq_clr(aff->v->el + 1, aff->v->size - 1); isl_int_set_si(aff->v->el[1 + pos], 1); return aff; error: isl_local_space_free(ls); isl_space_free(space); return NULL; } /* Return a piecewise affine expression that is equal to * the specified dimension in "ls". */ __isl_give isl_pw_aff *isl_pw_aff_var_on_domain(__isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos) { return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls, type, pos)); } __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff) { if (!aff) return NULL; aff->ref++; return aff; } __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff) { if (!aff) return NULL; return isl_aff_alloc_vec(isl_local_space_copy(aff->ls), isl_vec_copy(aff->v)); } __isl_give isl_aff *isl_aff_cow(__isl_take isl_aff *aff) { if (!aff) return NULL; if (aff->ref == 1) return aff; aff->ref--; return isl_aff_dup(aff); } void *isl_aff_free(__isl_take isl_aff *aff) { if (!aff) return NULL; if (--aff->ref > 0) return NULL; isl_local_space_free(aff->ls); isl_vec_free(aff->v); free(aff); return NULL; } isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff) { return aff ? isl_local_space_get_ctx(aff->ls) : NULL; } /* Externally, an isl_aff has a map space, but internally, the * ls field corresponds to the domain of that space. */ int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type) { if (!aff) return 0; if (type == isl_dim_out) return 1; if (type == isl_dim_in) type = isl_dim_set; return isl_local_space_dim(aff->ls, type); } __isl_give isl_space *isl_aff_get_domain_space(__isl_keep isl_aff *aff) { return aff ? isl_local_space_get_space(aff->ls) : NULL; } __isl_give isl_space *isl_aff_get_space(__isl_keep isl_aff *aff) { isl_space *space; if (!aff) return NULL; space = isl_local_space_get_space(aff->ls); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, 1); return space; } __isl_give isl_local_space *isl_aff_get_domain_local_space( __isl_keep isl_aff *aff) { return aff ? isl_local_space_copy(aff->ls) : NULL; } __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff) { isl_local_space *ls; if (!aff) return NULL; ls = isl_local_space_copy(aff->ls); ls = isl_local_space_from_domain(ls); ls = isl_local_space_add_dims(ls, isl_dim_out, 1); return ls; } /* Externally, an isl_aff has a map space, but internally, the * ls field corresponds to the domain of that space. */ const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff, enum isl_dim_type type, unsigned pos) { if (!aff) return NULL; if (type == isl_dim_out) return NULL; if (type == isl_dim_in) type = isl_dim_set; return isl_local_space_get_dim_name(aff->ls, type, pos); } __isl_give isl_aff *isl_aff_reset_domain_space(__isl_take isl_aff *aff, __isl_take isl_space *dim) { aff = isl_aff_cow(aff); if (!aff || !dim) goto error; aff->ls = isl_local_space_reset_space(aff->ls, dim); if (!aff->ls) return isl_aff_free(aff); return aff; error: isl_aff_free(aff); isl_space_free(dim); return NULL; } /* Reset the space of "aff". This function is called from isl_pw_templ.c * and doesn't know if the space of an element object is represented * directly or through its domain. It therefore passes along both. */ __isl_give isl_aff *isl_aff_reset_space_and_domain(__isl_take isl_aff *aff, __isl_take isl_space *space, __isl_take isl_space *domain) { isl_space_free(space); return isl_aff_reset_domain_space(aff, domain); } /* Reorder the coefficients of the affine expression based * on the given reodering. * The reordering r is assumed to have been extended with the local * variables. */ static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec, __isl_take isl_reordering *r, int n_div) { isl_vec *res; int i; if (!vec || !r) goto error; res = isl_vec_alloc(vec->ctx, 2 + isl_space_dim(r->dim, isl_dim_all) + n_div); isl_seq_cpy(res->el, vec->el, 2); isl_seq_clr(res->el + 2, res->size - 2); for (i = 0; i < r->len; ++i) isl_int_set(res->el[2 + r->pos[i]], vec->el[2 + i]); isl_reordering_free(r); isl_vec_free(vec); return res; error: isl_vec_free(vec); isl_reordering_free(r); return NULL; } /* Reorder the dimensions of the domain of "aff" according * to the given reordering. */ __isl_give isl_aff *isl_aff_realign_domain(__isl_take isl_aff *aff, __isl_take isl_reordering *r) { aff = isl_aff_cow(aff); if (!aff) goto error; r = isl_reordering_extend(r, aff->ls->div->n_row); aff->v = vec_reorder(aff->v, isl_reordering_copy(r), aff->ls->div->n_row); aff->ls = isl_local_space_realign(aff->ls, r); if (!aff->v || !aff->ls) return isl_aff_free(aff); return aff; error: isl_aff_free(aff); isl_reordering_free(r); return NULL; } __isl_give isl_aff *isl_aff_align_params(__isl_take isl_aff *aff, __isl_take isl_space *model) { if (!aff || !model) goto error; if (!isl_space_match(aff->ls->dim, isl_dim_param, model, isl_dim_param)) { isl_reordering *exp; model = isl_space_drop_dims(model, isl_dim_in, 0, isl_space_dim(model, isl_dim_in)); model = isl_space_drop_dims(model, isl_dim_out, 0, isl_space_dim(model, isl_dim_out)); exp = isl_parameter_alignment_reordering(aff->ls->dim, model); exp = isl_reordering_extend_space(exp, isl_aff_get_domain_space(aff)); aff = isl_aff_realign_domain(aff, exp); } isl_space_free(model); return aff; error: isl_space_free(model); isl_aff_free(aff); return NULL; } int isl_aff_plain_is_zero(__isl_keep isl_aff *aff) { if (!aff) return -1; return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0; } int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2) { int equal; if (!aff1 || !aff2) return -1; equal = isl_local_space_is_equal(aff1->ls, aff2->ls); if (equal < 0 || !equal) return equal; return isl_vec_is_equal(aff1->v, aff2->v); } int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v) { if (!aff) return -1; isl_int_set(*v, aff->v->el[0]); return 0; } /* Return the common denominator of "aff". */ __isl_give isl_val *isl_aff_get_denominator_val(__isl_keep isl_aff *aff) { isl_ctx *ctx; if (!aff) return NULL; ctx = isl_aff_get_ctx(aff); return isl_val_int_from_isl_int(ctx, aff->v->el[0]); } int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v) { if (!aff) return -1; isl_int_set(*v, aff->v->el[1]); return 0; } /* Return the constant term of "aff". */ __isl_give isl_val *isl_aff_get_constant_val(__isl_keep isl_aff *aff) { isl_ctx *ctx; isl_val *v; if (!aff) return NULL; ctx = isl_aff_get_ctx(aff); v = isl_val_rat_from_isl_int(ctx, aff->v->el[1], aff->v->el[0]); return isl_val_normalize(v); } int isl_aff_get_coefficient(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos, isl_int *v) { if (!aff) return -1; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "output/set dimension does not have a coefficient", return -1); if (type == isl_dim_in) type = isl_dim_set; if (pos >= isl_local_space_dim(aff->ls, type)) isl_die(aff->v->ctx, isl_error_invalid, "position out of bounds", return -1); pos += isl_local_space_offset(aff->ls, type); isl_int_set(*v, aff->v->el[1 + pos]); return 0; } /* Return the coefficient of the variable of type "type" at position "pos" * of "aff". */ __isl_give isl_val *isl_aff_get_coefficient_val(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos) { isl_ctx *ctx; isl_val *v; if (!aff) return NULL; ctx = isl_aff_get_ctx(aff); if (type == isl_dim_out) isl_die(ctx, isl_error_invalid, "output/set dimension does not have a coefficient", return NULL); if (type == isl_dim_in) type = isl_dim_set; if (pos >= isl_local_space_dim(aff->ls, type)) isl_die(ctx, isl_error_invalid, "position out of bounds", return NULL); pos += isl_local_space_offset(aff->ls, type); v = isl_val_rat_from_isl_int(ctx, aff->v->el[1 + pos], aff->v->el[0]); return isl_val_normalize(v); } __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v) { aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_set(aff->v->el[0], v); return aff; } __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v) { aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_set(aff->v->el[1], v); return aff; } /* Replace the constant term of "aff" by "v". */ __isl_give isl_aff *isl_aff_set_constant_val(__isl_take isl_aff *aff, __isl_take isl_val *v) { if (!aff || !v) goto error; if (!isl_val_is_rat(v)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "expecting rational value", goto error); if (isl_int_eq(aff->v->el[1], v->n) && isl_int_eq(aff->v->el[0], v->d)) { isl_val_free(v); return aff; } aff = isl_aff_cow(aff); if (!aff) goto error; aff->v = isl_vec_cow(aff->v); if (!aff->v) goto error; if (isl_int_eq(aff->v->el[0], v->d)) { isl_int_set(aff->v->el[1], v->n); } else if (isl_int_is_one(v->d)) { isl_int_mul(aff->v->el[1], aff->v->el[0], v->n); } else { isl_seq_scale(aff->v->el + 1, aff->v->el + 1, v->d, aff->v->size - 1); isl_int_mul(aff->v->el[1], aff->v->el[0], v->n); isl_int_mul(aff->v->el[0], aff->v->el[0], v->d); aff->v = isl_vec_normalize(aff->v); if (!aff->v) goto error; } isl_val_free(v); return aff; error: isl_aff_free(aff); isl_val_free(v); return NULL; } __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v) { if (isl_int_is_zero(v)) return aff; aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_addmul(aff->v->el[1], aff->v->el[0], v); return aff; } /* Add "v" to the constant term of "aff". */ __isl_give isl_aff *isl_aff_add_constant_val(__isl_take isl_aff *aff, __isl_take isl_val *v) { if (!aff || !v) goto error; if (isl_val_is_zero(v)) { isl_val_free(v); return aff; } if (!isl_val_is_rat(v)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "expecting rational value", goto error); aff = isl_aff_cow(aff); if (!aff) goto error; aff->v = isl_vec_cow(aff->v); if (!aff->v) goto error; if (isl_int_is_one(v->d)) { isl_int_addmul(aff->v->el[1], aff->v->el[0], v->n); } else if (isl_int_eq(aff->v->el[0], v->d)) { isl_int_add(aff->v->el[1], aff->v->el[1], v->n); aff->v = isl_vec_normalize(aff->v); if (!aff->v) goto error; } else { isl_seq_scale(aff->v->el + 1, aff->v->el + 1, v->d, aff->v->size - 1); isl_int_addmul(aff->v->el[1], aff->v->el[0], v->n); isl_int_mul(aff->v->el[0], aff->v->el[0], v->d); aff->v = isl_vec_normalize(aff->v); if (!aff->v) goto error; } isl_val_free(v); return aff; error: isl_aff_free(aff); isl_val_free(v); return NULL; } __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v) { isl_int t; isl_int_init(t); isl_int_set_si(t, v); aff = isl_aff_add_constant(aff, t); isl_int_clear(t); return aff; } /* Add "v" to the numerator of the constant term of "aff". */ __isl_give isl_aff *isl_aff_add_constant_num(__isl_take isl_aff *aff, isl_int v) { if (isl_int_is_zero(v)) return aff; aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_add(aff->v->el[1], aff->v->el[1], v); return aff; } /* Add "v" to the numerator of the constant term of "aff". */ __isl_give isl_aff *isl_aff_add_constant_num_si(__isl_take isl_aff *aff, int v) { isl_int t; if (v == 0) return aff; isl_int_init(t); isl_int_set_si(t, v); aff = isl_aff_add_constant_num(aff, t); isl_int_clear(t); return aff; } __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v) { aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_set_si(aff->v->el[1], v); return aff; } __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, isl_int v) { if (!aff) return NULL; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "output/set dimension does not have a coefficient", return isl_aff_free(aff)); if (type == isl_dim_in) type = isl_dim_set; if (pos >= isl_local_space_dim(aff->ls, type)) isl_die(aff->v->ctx, isl_error_invalid, "position out of bounds", return isl_aff_free(aff)); aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); pos += isl_local_space_offset(aff->ls, type); isl_int_set(aff->v->el[1 + pos], v); return aff; } __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, int v) { if (!aff) return NULL; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "output/set dimension does not have a coefficient", return isl_aff_free(aff)); if (type == isl_dim_in) type = isl_dim_set; if (pos >= isl_local_space_dim(aff->ls, type)) isl_die(aff->v->ctx, isl_error_invalid, "position out of bounds", return isl_aff_free(aff)); aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); pos += isl_local_space_offset(aff->ls, type); isl_int_set_si(aff->v->el[1 + pos], v); return aff; } /* Replace the coefficient of the variable of type "type" at position "pos" * of "aff" by "v". */ __isl_give isl_aff *isl_aff_set_coefficient_val(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, __isl_take isl_val *v) { if (!aff || !v) goto error; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "output/set dimension does not have a coefficient", goto error); if (type == isl_dim_in) type = isl_dim_set; if (pos >= isl_local_space_dim(aff->ls, type)) isl_die(aff->v->ctx, isl_error_invalid, "position out of bounds", goto error); if (!isl_val_is_rat(v)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "expecting rational value", goto error); pos += isl_local_space_offset(aff->ls, type); if (isl_int_eq(aff->v->el[1 + pos], v->n) && isl_int_eq(aff->v->el[0], v->d)) { isl_val_free(v); return aff; } aff = isl_aff_cow(aff); if (!aff) goto error; aff->v = isl_vec_cow(aff->v); if (!aff->v) goto error; if (isl_int_eq(aff->v->el[0], v->d)) { isl_int_set(aff->v->el[1 + pos], v->n); } else if (isl_int_is_one(v->d)) { isl_int_mul(aff->v->el[1 + pos], aff->v->el[0], v->n); } else { isl_seq_scale(aff->v->el + 1, aff->v->el + 1, v->d, aff->v->size - 1); isl_int_mul(aff->v->el[1 + pos], aff->v->el[0], v->n); isl_int_mul(aff->v->el[0], aff->v->el[0], v->d); aff->v = isl_vec_normalize(aff->v); if (!aff->v) goto error; } isl_val_free(v); return aff; error: isl_aff_free(aff); isl_val_free(v); return NULL; } __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, isl_int v) { if (!aff) return NULL; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "output/set dimension does not have a coefficient", return isl_aff_free(aff)); if (type == isl_dim_in) type = isl_dim_set; if (pos >= isl_local_space_dim(aff->ls, type)) isl_die(aff->v->ctx, isl_error_invalid, "position out of bounds", return isl_aff_free(aff)); aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); pos += isl_local_space_offset(aff->ls, type); isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v); return aff; } /* Add "v" to the coefficient of the variable of type "type" * at position "pos" of "aff". */ __isl_give isl_aff *isl_aff_add_coefficient_val(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, __isl_take isl_val *v) { if (!aff || !v) goto error; if (isl_val_is_zero(v)) { isl_val_free(v); return aff; } if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "output/set dimension does not have a coefficient", goto error); if (type == isl_dim_in) type = isl_dim_set; if (pos >= isl_local_space_dim(aff->ls, type)) isl_die(aff->v->ctx, isl_error_invalid, "position out of bounds", goto error); if (!isl_val_is_rat(v)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "expecting rational value", goto error); aff = isl_aff_cow(aff); if (!aff) goto error; aff->v = isl_vec_cow(aff->v); if (!aff->v) goto error; pos += isl_local_space_offset(aff->ls, type); if (isl_int_is_one(v->d)) { isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v->n); } else if (isl_int_eq(aff->v->el[0], v->d)) { isl_int_add(aff->v->el[1 + pos], aff->v->el[1 + pos], v->n); aff->v = isl_vec_normalize(aff->v); if (!aff->v) goto error; } else { isl_seq_scale(aff->v->el + 1, aff->v->el + 1, v->d, aff->v->size - 1); isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v->n); isl_int_mul(aff->v->el[0], aff->v->el[0], v->d); aff->v = isl_vec_normalize(aff->v); if (!aff->v) goto error; } isl_val_free(v); return aff; error: isl_aff_free(aff); isl_val_free(v); return NULL; } __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, int v) { isl_int t; isl_int_init(t); isl_int_set_si(t, v); aff = isl_aff_add_coefficient(aff, type, pos, t); isl_int_clear(t); return aff; } __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos) { if (!aff) return NULL; return isl_local_space_get_div(aff->ls, pos); } __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff) { aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1); return aff; } /* Remove divs from the local space that do not appear in the affine * expression. * We currently only remove divs at the end. * Some intermediate divs may also not appear directly in the affine * expression, but we would also need to check that no other divs are * defined in terms of them. */ __isl_give isl_aff *isl_aff_remove_unused_divs( __isl_take isl_aff *aff) { int pos; int off; int n; if (!aff) return NULL; n = isl_local_space_dim(aff->ls, isl_dim_div); off = isl_local_space_offset(aff->ls, isl_dim_div); pos = isl_seq_last_non_zero(aff->v->el + 1 + off, n) + 1; if (pos == n) return aff; aff = isl_aff_cow(aff); if (!aff) return NULL; aff->ls = isl_local_space_drop_dims(aff->ls, isl_dim_div, pos, n - pos); aff->v = isl_vec_drop_els(aff->v, 1 + off + pos, n - pos); if (!aff->ls || !aff->v) return isl_aff_free(aff); return aff; } /* Given two affine expressions "p" of length p_len (including the * denominator and the constant term) and "subs" of length subs_len, * plug in "subs" for the variable at position "pos". * The variables of "subs" and "p" are assumed to match up to subs_len, * but "p" may have additional variables. * "v" is an initialized isl_int that can be used internally. * * In particular, if "p" represents the expression * * (a i + g)/m * * with i the variable at position "pos" and "subs" represents the expression * * f/d * * then the result represents the expression * * (a f + d g)/(m d) * */ void isl_seq_substitute(isl_int *p, int pos, isl_int *subs, int p_len, int subs_len, isl_int v) { isl_int_set(v, p[1 + pos]); isl_int_set_si(p[1 + pos], 0); isl_seq_combine(p + 1, subs[0], p + 1, v, subs + 1, subs_len - 1); isl_seq_scale(p + subs_len, p + subs_len, subs[0], p_len - subs_len); isl_int_mul(p[0], p[0], subs[0]); } /* Look for any divs in the aff->ls with a denominator equal to one * and plug them into the affine expression and any subsequent divs * that may reference the div. */ static __isl_give isl_aff *plug_in_integral_divs(__isl_take isl_aff *aff) { int i, n; int len; isl_int v; isl_vec *vec; isl_local_space *ls; unsigned pos; if (!aff) return NULL; n = isl_local_space_dim(aff->ls, isl_dim_div); len = aff->v->size; for (i = 0; i < n; ++i) { if (!isl_int_is_one(aff->ls->div->row[i][0])) continue; ls = isl_local_space_copy(aff->ls); ls = isl_local_space_substitute_seq(ls, isl_dim_div, i, aff->ls->div->row[i], len, i + 1, n - (i + 1)); vec = isl_vec_copy(aff->v); vec = isl_vec_cow(vec); if (!ls || !vec) goto error; isl_int_init(v); pos = isl_local_space_offset(aff->ls, isl_dim_div) + i; isl_seq_substitute(vec->el, pos, aff->ls->div->row[i], len, len, v); isl_int_clear(v); isl_vec_free(aff->v); aff->v = vec; isl_local_space_free(aff->ls); aff->ls = ls; } return aff; error: isl_vec_free(vec); isl_local_space_free(ls); return isl_aff_free(aff); } /* Look for any divs j that appear with a unit coefficient inside * the definitions of other divs i and plug them into the definitions * of the divs i. * * In particular, an expression of the form * * floor((f(..) + floor(g(..)/n))/m) * * is simplified to * * floor((n * f(..) + g(..))/(n * m)) * * This simplification is correct because we can move the expression * f(..) into the inner floor in the original expression to obtain * * floor(floor((n * f(..) + g(..))/n)/m) * * from which we can derive the simplified expression. */ static __isl_give isl_aff *plug_in_unit_divs(__isl_take isl_aff *aff) { int i, j, n; int off; if (!aff) return NULL; n = isl_local_space_dim(aff->ls, isl_dim_div); off = isl_local_space_offset(aff->ls, isl_dim_div); for (i = 1; i < n; ++i) { for (j = 0; j < i; ++j) { if (!isl_int_is_one(aff->ls->div->row[i][1 + off + j])) continue; aff->ls = isl_local_space_substitute_seq(aff->ls, isl_dim_div, j, aff->ls->div->row[j], aff->v->size, i, 1); if (!aff->ls) return isl_aff_free(aff); } } return aff; } /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL. * * Even though this function is only called on isl_affs with a single * reference, we are careful to only change aff->v and aff->ls together. */ static __isl_give isl_aff *swap_div(__isl_take isl_aff *aff, int a, int b) { unsigned off = isl_local_space_offset(aff->ls, isl_dim_div); isl_local_space *ls; isl_vec *v; ls = isl_local_space_copy(aff->ls); ls = isl_local_space_swap_div(ls, a, b); v = isl_vec_copy(aff->v); v = isl_vec_cow(v); if (!ls || !v) goto error; isl_int_swap(v->el[1 + off + a], v->el[1 + off + b]); isl_vec_free(aff->v); aff->v = v; isl_local_space_free(aff->ls); aff->ls = ls; return aff; error: isl_vec_free(v); isl_local_space_free(ls); return isl_aff_free(aff); } /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL. * * We currently do not actually remove div "b", but simply add its * coefficient to that of "a" and then zero it out. */ static __isl_give isl_aff *merge_divs(__isl_take isl_aff *aff, int a, int b) { unsigned off = isl_local_space_offset(aff->ls, isl_dim_div); if (isl_int_is_zero(aff->v->el[1 + off + b])) return aff; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_add(aff->v->el[1 + off + a], aff->v->el[1 + off + a], aff->v->el[1 + off + b]); isl_int_set_si(aff->v->el[1 + off + b], 0); return aff; } /* Sort the divs in the local space of "aff" according to * the comparison function "cmp_row" in isl_local_space.c, * combining the coefficients of identical divs. * * Reordering divs does not change the semantics of "aff", * so there is no need to call isl_aff_cow. * Moreover, this function is currently only called on isl_affs * with a single reference. */ static __isl_give isl_aff *sort_divs(__isl_take isl_aff *aff) { int i, j, n; unsigned off; if (!aff) return NULL; off = isl_local_space_offset(aff->ls, isl_dim_div); n = isl_aff_dim(aff, isl_dim_div); for (i = 1; i < n; ++i) { for (j = i - 1; j >= 0; --j) { int cmp = isl_mat_cmp_div(aff->ls->div, j, j + 1); if (cmp < 0) break; if (cmp == 0) aff = merge_divs(aff, j, j + 1); else aff = swap_div(aff, j, j + 1); if (!aff) return NULL; } } return aff; } /* Normalize the representation of "aff". * * This function should only be called of "new" isl_affs, i.e., * with only a single reference. We therefore do not need to * worry about affecting other instances. */ __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff) { if (!aff) return NULL; aff->v = isl_vec_normalize(aff->v); if (!aff->v) return isl_aff_free(aff); aff = plug_in_integral_divs(aff); aff = plug_in_unit_divs(aff); aff = sort_divs(aff); aff = isl_aff_remove_unused_divs(aff); return aff; } /* Given f, return floor(f). * If f is an integer expression, then just return f. * If f is a constant, then return the constant floor(f). * Otherwise, if f = g/m, write g = q m + r, * create a new div d = [r/m] and return the expression q + d. * The coefficients in r are taken to lie between -m/2 and m/2. */ __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff) { int i; int size; isl_ctx *ctx; isl_vec *div; if (!aff) return NULL; if (isl_int_is_one(aff->v->el[0])) return aff; aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); if (isl_aff_is_cst(aff)) { isl_int_fdiv_q(aff->v->el[1], aff->v->el[1], aff->v->el[0]); isl_int_set_si(aff->v->el[0], 1); return aff; } div = isl_vec_copy(aff->v); div = isl_vec_cow(div); if (!div) return isl_aff_free(aff); ctx = isl_aff_get_ctx(aff); isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two); for (i = 1; i < aff->v->size; ++i) { isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]); isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]); if (isl_int_gt(div->el[i], aff->v->el[0])) { isl_int_sub(div->el[i], div->el[i], div->el[0]); isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1); } } aff->ls = isl_local_space_add_div(aff->ls, div); if (!aff->ls) return isl_aff_free(aff); size = aff->v->size; aff->v = isl_vec_extend(aff->v, size + 1); if (!aff->v) return isl_aff_free(aff); isl_int_set_si(aff->v->el[0], 1); isl_int_set_si(aff->v->el[size], 1); aff = isl_aff_normalize(aff); return aff; } /* Compute * * aff mod m = aff - m * floor(aff/m) */ __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m) { isl_aff *res; res = isl_aff_copy(aff); aff = isl_aff_scale_down(aff, m); aff = isl_aff_floor(aff); aff = isl_aff_scale(aff, m); res = isl_aff_sub(res, aff); return res; } /* Compute * * aff mod m = aff - m * floor(aff/m) * * with m an integer value. */ __isl_give isl_aff *isl_aff_mod_val(__isl_take isl_aff *aff, __isl_take isl_val *m) { isl_aff *res; if (!aff || !m) goto error; if (!isl_val_is_int(m)) isl_die(isl_val_get_ctx(m), isl_error_invalid, "expecting integer modulo", goto error); res = isl_aff_copy(aff); aff = isl_aff_scale_down_val(aff, isl_val_copy(m)); aff = isl_aff_floor(aff); aff = isl_aff_scale_val(aff, m); res = isl_aff_sub(res, aff); return res; error: isl_aff_free(aff); isl_val_free(m); return NULL; } /* Compute * * pwaff mod m = pwaff - m * floor(pwaff/m) */ __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m) { isl_pw_aff *res; res = isl_pw_aff_copy(pwaff); pwaff = isl_pw_aff_scale_down(pwaff, m); pwaff = isl_pw_aff_floor(pwaff); pwaff = isl_pw_aff_scale(pwaff, m); res = isl_pw_aff_sub(res, pwaff); return res; } /* Compute * * pa mod m = pa - m * floor(pa/m) * * with m an integer value. */ __isl_give isl_pw_aff *isl_pw_aff_mod_val(__isl_take isl_pw_aff *pa, __isl_take isl_val *m) { if (!pa || !m) goto error; if (!isl_val_is_int(m)) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "expecting integer modulo", goto error); pa = isl_pw_aff_mod(pa, m->n); isl_val_free(m); return pa; error: isl_pw_aff_free(pa); isl_val_free(m); return NULL; } /* Given f, return ceil(f). * If f is an integer expression, then just return f. * Otherwise, let f be the expression * * e/m * * then return * * floor((e + m - 1)/m) */ __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff) { if (!aff) return NULL; if (isl_int_is_one(aff->v->el[0])) return aff; aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_add(aff->v->el[1], aff->v->el[1], aff->v->el[0]); isl_int_sub_ui(aff->v->el[1], aff->v->el[1], 1); aff = isl_aff_floor(aff); return aff; } /* Apply the expansion computed by isl_merge_divs. * The expansion itself is given by "exp" while the resulting * list of divs is given by "div". */ __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff, __isl_take isl_mat *div, int *exp) { int i, j; int old_n_div; int new_n_div; int offset; aff = isl_aff_cow(aff); if (!aff || !div) goto error; old_n_div = isl_local_space_dim(aff->ls, isl_dim_div); new_n_div = isl_mat_rows(div); if (new_n_div < old_n_div) isl_die(isl_mat_get_ctx(div), isl_error_invalid, "not an expansion", goto error); aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div); if (!aff->v) goto error; offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div); j = old_n_div - 1; for (i = new_n_div - 1; i >= 0; --i) { if (j >= 0 && exp[j] == i) { if (i != j) isl_int_swap(aff->v->el[offset + i], aff->v->el[offset + j]); j--; } else isl_int_set_si(aff->v->el[offset + i], 0); } aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div)); if (!aff->ls) goto error; isl_mat_free(div); return aff; error: isl_aff_free(aff); isl_mat_free(div); return NULL; } /* Add two affine expressions that live in the same local space. */ static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { isl_int gcd, f; aff1 = isl_aff_cow(aff1); if (!aff1 || !aff2) goto error; aff1->v = isl_vec_cow(aff1->v); if (!aff1->v) goto error; isl_int_init(gcd); isl_int_init(f); isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]); isl_int_divexact(f, aff2->v->el[0], gcd); isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1); isl_int_divexact(f, aff1->v->el[0], gcd); isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1); isl_int_divexact(f, aff2->v->el[0], gcd); isl_int_mul(aff1->v->el[0], aff1->v->el[0], f); isl_int_clear(f); isl_int_clear(gcd); isl_aff_free(aff2); return aff1; error: isl_aff_free(aff1); isl_aff_free(aff2); return NULL; } __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { isl_ctx *ctx; int *exp1 = NULL; int *exp2 = NULL; isl_mat *div; int n_div1, n_div2; if (!aff1 || !aff2) goto error; ctx = isl_aff_get_ctx(aff1); if (!isl_space_is_equal(aff1->ls->dim, aff2->ls->dim)) isl_die(ctx, isl_error_invalid, "spaces don't match", goto error); n_div1 = isl_aff_dim(aff1, isl_dim_div); n_div2 = isl_aff_dim(aff2, isl_dim_div); if (n_div1 == 0 && n_div2 == 0) return add_expanded(aff1, aff2); exp1 = isl_alloc_array(ctx, int, n_div1); exp2 = isl_alloc_array(ctx, int, n_div2); if ((n_div1 && !exp1) || (n_div2 && !exp2)) goto error; div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2); aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1); aff2 = isl_aff_expand_divs(aff2, div, exp2); free(exp1); free(exp2); return add_expanded(aff1, aff2); error: free(exp1); free(exp2); isl_aff_free(aff1); isl_aff_free(aff2); return NULL; } __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { return isl_aff_add(aff1, isl_aff_neg(aff2)); } __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f) { isl_int gcd; if (isl_int_is_one(f)) return aff; aff = isl_aff_cow(aff); if (!aff) return NULL; aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); if (isl_int_is_pos(f) && isl_int_is_divisible_by(aff->v->el[0], f)) { isl_int_divexact(aff->v->el[0], aff->v->el[0], f); return aff; } isl_int_init(gcd); isl_int_gcd(gcd, aff->v->el[0], f); isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd); isl_int_divexact(gcd, f, gcd); isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1); isl_int_clear(gcd); return aff; } /* Multiple "aff" by "v". */ __isl_give isl_aff *isl_aff_scale_val(__isl_take isl_aff *aff, __isl_take isl_val *v) { if (!aff || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return aff; } if (!isl_val_is_rat(v)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "expecting rational factor", goto error); aff = isl_aff_scale(aff, v->n); aff = isl_aff_scale_down(aff, v->d); isl_val_free(v); return aff; error: isl_aff_free(aff); isl_val_free(v); return NULL; } __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f) { isl_int gcd; if (isl_int_is_one(f)) return aff; aff = isl_aff_cow(aff); if (!aff) return NULL; if (isl_int_is_zero(f)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "cannot scale down by zero", return isl_aff_free(aff)); aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); isl_int_init(gcd); isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd); isl_int_gcd(gcd, gcd, f); isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1); isl_int_divexact(gcd, f, gcd); isl_int_mul(aff->v->el[0], aff->v->el[0], gcd); isl_int_clear(gcd); return aff; } /* Divide "aff" by "v". */ __isl_give isl_aff *isl_aff_scale_down_val(__isl_take isl_aff *aff, __isl_take isl_val *v) { if (!aff || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return aff; } if (!isl_val_is_rat(v)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "expecting rational factor", goto error); if (!isl_val_is_pos(v)) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "factor needs to be positive", goto error); aff = isl_aff_scale(aff, v->d); aff = isl_aff_scale_down(aff, v->n); isl_val_free(v); return aff; error: isl_aff_free(aff); isl_val_free(v); return NULL; } __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f) { isl_int v; if (f == 1) return aff; isl_int_init(v); isl_int_set_ui(v, f); aff = isl_aff_scale_down(aff, v); isl_int_clear(v); return aff; } __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned pos, const char *s) { aff = isl_aff_cow(aff); if (!aff) return NULL; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "cannot set name of output/set dimension", return isl_aff_free(aff)); if (type == isl_dim_in) type = isl_dim_set; aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s); if (!aff->ls) return isl_aff_free(aff); return aff; } __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { aff = isl_aff_cow(aff); if (!aff) return isl_id_free(id); if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "cannot set name of output/set dimension", goto error); if (type == isl_dim_in) type = isl_dim_set; aff->ls = isl_local_space_set_dim_id(aff->ls, type, pos, id); if (!aff->ls) return isl_aff_free(aff); return aff; error: isl_id_free(id); isl_aff_free(aff); return NULL; } /* Exploit the equalities in "eq" to simplify the affine expression * and the expressions of the integer divisions in the local space. * The integer divisions in this local space are assumed to appear * as regular dimensions in "eq". */ static __isl_give isl_aff *isl_aff_substitute_equalities_lifted( __isl_take isl_aff *aff, __isl_take isl_basic_set *eq) { int i, j; unsigned total; unsigned n_div; if (!eq) goto error; if (eq->n_eq == 0) { isl_basic_set_free(eq); return aff; } aff = isl_aff_cow(aff); if (!aff) goto error; aff->ls = isl_local_space_substitute_equalities(aff->ls, isl_basic_set_copy(eq)); aff->v = isl_vec_cow(aff->v); if (!aff->ls || !aff->v) goto error; total = 1 + isl_space_dim(eq->dim, isl_dim_all); n_div = eq->n_div; for (i = 0; i < eq->n_eq; ++i) { j = isl_seq_last_non_zero(eq->eq[i], total + n_div); if (j < 0 || j == 0 || j >= total) continue; isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total, &aff->v->el[0]); } isl_basic_set_free(eq); aff = isl_aff_normalize(aff); return aff; error: isl_basic_set_free(eq); isl_aff_free(aff); return NULL; } /* Exploit the equalities in "eq" to simplify the affine expression * and the expressions of the integer divisions in the local space. */ static __isl_give isl_aff *isl_aff_substitute_equalities( __isl_take isl_aff *aff, __isl_take isl_basic_set *eq) { int n_div; if (!aff || !eq) goto error; n_div = isl_local_space_dim(aff->ls, isl_dim_div); if (n_div > 0) eq = isl_basic_set_add_dims(eq, isl_dim_set, n_div); return isl_aff_substitute_equalities_lifted(aff, eq); error: isl_basic_set_free(eq); isl_aff_free(aff); return NULL; } /* Look for equalities among the variables shared by context and aff * and the integer divisions of aff, if any. * The equalities are then used to eliminate coefficients and/or integer * divisions from aff. */ __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff, __isl_take isl_set *context) { isl_basic_set *hull; int n_div; if (!aff) goto error; n_div = isl_local_space_dim(aff->ls, isl_dim_div); if (n_div > 0) { isl_basic_set *bset; isl_local_space *ls; context = isl_set_add_dims(context, isl_dim_set, n_div); ls = isl_aff_get_domain_local_space(aff); bset = isl_basic_set_from_local_space(ls); bset = isl_basic_set_lift(bset); bset = isl_basic_set_flatten(bset); context = isl_set_intersect(context, isl_set_from_basic_set(bset)); } hull = isl_set_affine_hull(context); return isl_aff_substitute_equalities_lifted(aff, hull); error: isl_aff_free(aff); isl_set_free(context); return NULL; } __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff, __isl_take isl_set *context) { isl_set *dom_context = isl_set_universe(isl_aff_get_domain_space(aff)); dom_context = isl_set_intersect_params(dom_context, context); return isl_aff_gist(aff, dom_context); } /* Return a basic set containing those elements in the space * of aff where it is non-negative. * If "rational" is set, then return a rational basic set. */ static __isl_give isl_basic_set *aff_nonneg_basic_set( __isl_take isl_aff *aff, int rational) { isl_constraint *ineq; isl_basic_set *bset; ineq = isl_inequality_from_aff(aff); bset = isl_basic_set_from_constraint(ineq); if (rational) bset = isl_basic_set_set_rational(bset); bset = isl_basic_set_simplify(bset); return bset; } /* Return a basic set containing those elements in the space * of aff where it is non-negative. */ __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff) { return aff_nonneg_basic_set(aff, 0); } /* Return a basic set containing those elements in the domain space * of aff where it is negative. */ __isl_give isl_basic_set *isl_aff_neg_basic_set(__isl_take isl_aff *aff) { aff = isl_aff_neg(aff); aff = isl_aff_add_constant_num_si(aff, -1); return isl_aff_nonneg_basic_set(aff); } /* Return a basic set containing those elements in the space * of aff where it is zero. * If "rational" is set, then return a rational basic set. */ static __isl_give isl_basic_set *aff_zero_basic_set(__isl_take isl_aff *aff, int rational) { isl_constraint *ineq; isl_basic_set *bset; ineq = isl_equality_from_aff(aff); bset = isl_basic_set_from_constraint(ineq); if (rational) bset = isl_basic_set_set_rational(bset); bset = isl_basic_set_simplify(bset); return bset; } /* Return a basic set containing those elements in the space * of aff where it is zero. */ __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff) { return aff_zero_basic_set(aff, 0); } /* Return a basic set containing those elements in the shared space * of aff1 and aff2 where aff1 is greater than or equal to aff2. */ __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { aff1 = isl_aff_sub(aff1, aff2); return isl_aff_nonneg_basic_set(aff1); } /* Return a basic set containing those elements in the shared space * of aff1 and aff2 where aff1 is smaller than or equal to aff2. */ __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { return isl_aff_ge_basic_set(aff2, aff1); } __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom, __isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { aff1 = isl_aff_add(aff1, aff2); aff1 = isl_aff_gist(aff1, isl_set_copy(dom)); return aff1; } int isl_aff_is_empty(__isl_keep isl_aff *aff) { if (!aff) return -1; return 0; } /* Check whether the given affine expression has non-zero coefficient * for any dimension in the given range or if any of these dimensions * appear with non-zero coefficients in any of the integer divisions * involved in the affine expression. */ int isl_aff_involves_dims(__isl_keep isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n) { int i; isl_ctx *ctx; int *active = NULL; int involves = 0; if (!aff) return -1; if (n == 0) return 0; ctx = isl_aff_get_ctx(aff); if (first + n > isl_aff_dim(aff, type)) isl_die(ctx, isl_error_invalid, "range out of bounds", return -1); active = isl_local_space_get_active(aff->ls, aff->v->el + 2); if (!active) goto error; first += isl_local_space_offset(aff->ls, type) - 1; for (i = 0; i < n; ++i) if (active[first + i]) { involves = 1; break; } free(active); return involves; error: free(active); return -1; } __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n) { isl_ctx *ctx; if (!aff) return NULL; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "cannot drop output/set dimension", return isl_aff_free(aff)); if (type == isl_dim_in) type = isl_dim_set; if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type)) return aff; ctx = isl_aff_get_ctx(aff); if (first + n > isl_local_space_dim(aff->ls, type)) isl_die(ctx, isl_error_invalid, "range out of bounds", return isl_aff_free(aff)); aff = isl_aff_cow(aff); if (!aff) return NULL; aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n); if (!aff->ls) return isl_aff_free(aff); first += 1 + isl_local_space_offset(aff->ls, type); aff->v = isl_vec_drop_els(aff->v, first, n); if (!aff->v) return isl_aff_free(aff); return aff; } /* Project the domain of the affine expression onto its parameter space. * The affine expression may not involve any of the domain dimensions. */ __isl_give isl_aff *isl_aff_project_domain_on_params(__isl_take isl_aff *aff) { isl_space *space; unsigned n; int involves; n = isl_aff_dim(aff, isl_dim_in); involves = isl_aff_involves_dims(aff, isl_dim_in, 0, n); if (involves < 0) return isl_aff_free(aff); if (involves) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "affine expression involves some of the domain dimensions", return isl_aff_free(aff)); aff = isl_aff_drop_dims(aff, isl_dim_in, 0, n); space = isl_aff_get_domain_space(aff); space = isl_space_params(space); aff = isl_aff_reset_domain_space(aff, space); return aff; } __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n) { isl_ctx *ctx; if (!aff) return NULL; if (type == isl_dim_out) isl_die(aff->v->ctx, isl_error_invalid, "cannot insert output/set dimensions", return isl_aff_free(aff)); if (type == isl_dim_in) type = isl_dim_set; if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type)) return aff; ctx = isl_aff_get_ctx(aff); if (first > isl_local_space_dim(aff->ls, type)) isl_die(ctx, isl_error_invalid, "position out of bounds", return isl_aff_free(aff)); aff = isl_aff_cow(aff); if (!aff) return NULL; aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n); if (!aff->ls) return isl_aff_free(aff); first += 1 + isl_local_space_offset(aff->ls, type); aff->v = isl_vec_insert_zero_els(aff->v, first, n); if (!aff->v) return isl_aff_free(aff); return aff; } __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned n) { unsigned pos; pos = isl_aff_dim(aff, type); return isl_aff_insert_dims(aff, type, pos, n); } __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff, enum isl_dim_type type, unsigned n) { unsigned pos; pos = isl_pw_aff_dim(pwaff, type); return isl_pw_aff_insert_dims(pwaff, type, pos, n); } __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff) { isl_set *dom = isl_set_universe(isl_aff_get_domain_space(aff)); return isl_pw_aff_alloc(dom, aff); } #undef PW #define PW isl_pw_aff #undef EL #define EL isl_aff #undef EL_IS_ZERO #define EL_IS_ZERO is_empty #undef ZERO #define ZERO empty #undef IS_ZERO #define IS_ZERO is_empty #undef FIELD #define FIELD aff #undef DEFAULT_IS_ZERO #define DEFAULT_IS_ZERO 0 #define NO_EVAL #define NO_OPT #define NO_MOVE_DIMS #define NO_LIFT #define NO_MORPH #include static __isl_give isl_set *align_params_pw_pw_set_and( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2, __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2)) { if (!pwaff1 || !pwaff2) goto error; if (isl_space_match(pwaff1->dim, isl_dim_param, pwaff2->dim, isl_dim_param)) return fn(pwaff1, pwaff2); if (!isl_space_has_named_params(pwaff1->dim) || !isl_space_has_named_params(pwaff2->dim)) isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid, "unaligned unnamed parameters", goto error); pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2)); pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1)); return fn(pwaff1, pwaff2); error: isl_pw_aff_free(pwaff1); isl_pw_aff_free(pwaff2); return NULL; } /* Compute a piecewise quasi-affine expression with a domain that * is the union of those of pwaff1 and pwaff2 and such that on each * cell, the quasi-affine expression is the better (according to cmp) * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2 * is defined on a given cell, then the associated expression * is the defined one. */ static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2, __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2)) { int i, j, n; isl_pw_aff *res; isl_ctx *ctx; isl_set *set; if (!pwaff1 || !pwaff2) goto error; ctx = isl_space_get_ctx(pwaff1->dim); if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim)) isl_die(ctx, isl_error_invalid, "arguments should live in same space", goto error); if (isl_pw_aff_is_empty(pwaff1)) { isl_pw_aff_free(pwaff1); return pwaff2; } if (isl_pw_aff_is_empty(pwaff2)) { isl_pw_aff_free(pwaff2); return pwaff1; } n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1); res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n); for (i = 0; i < pwaff1->n; ++i) { set = isl_set_copy(pwaff1->p[i].set); for (j = 0; j < pwaff2->n; ++j) { struct isl_set *common; isl_set *better; common = isl_set_intersect( isl_set_copy(pwaff1->p[i].set), isl_set_copy(pwaff2->p[j].set)); better = isl_set_from_basic_set(cmp( isl_aff_copy(pwaff2->p[j].aff), isl_aff_copy(pwaff1->p[i].aff))); better = isl_set_intersect(common, better); if (isl_set_plain_is_empty(better)) { isl_set_free(better); continue; } set = isl_set_subtract(set, isl_set_copy(better)); res = isl_pw_aff_add_piece(res, better, isl_aff_copy(pwaff2->p[j].aff)); } res = isl_pw_aff_add_piece(res, set, isl_aff_copy(pwaff1->p[i].aff)); } for (j = 0; j < pwaff2->n; ++j) { set = isl_set_copy(pwaff2->p[j].set); for (i = 0; i < pwaff1->n; ++i) set = isl_set_subtract(set, isl_set_copy(pwaff1->p[i].set)); res = isl_pw_aff_add_piece(res, set, isl_aff_copy(pwaff2->p[j].aff)); } isl_pw_aff_free(pwaff1); isl_pw_aff_free(pwaff2); return res; error: isl_pw_aff_free(pwaff1); isl_pw_aff_free(pwaff2); return NULL; } /* Compute a piecewise quasi-affine expression with a domain that * is the union of those of pwaff1 and pwaff2 and such that on each * cell, the quasi-affine expression is the maximum of those of pwaff1 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given * cell, then the associated expression is the defined one. */ static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set); } __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_union_max); } /* Compute a piecewise quasi-affine expression with a domain that * is the union of those of pwaff1 and pwaff2 and such that on each * cell, the quasi-affine expression is the minimum of those of pwaff1 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given * cell, then the associated expression is the defined one. */ static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set); } __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_union_min); } __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2, int max) { if (max) return isl_pw_aff_union_max(pwaff1, pwaff2); else return isl_pw_aff_union_min(pwaff1, pwaff2); } /* Construct a map with as domain the domain of pwaff and * one-dimensional range corresponding to the affine expressions. */ static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff) { int i; isl_space *dim; isl_map *map; if (!pwaff) return NULL; dim = isl_pw_aff_get_space(pwaff); map = isl_map_empty(dim); for (i = 0; i < pwaff->n; ++i) { isl_basic_map *bmap; isl_map *map_i; bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff)); map_i = isl_map_from_basic_map(bmap); map_i = isl_map_intersect_domain(map_i, isl_set_copy(pwaff->p[i].set)); map = isl_map_union_disjoint(map, map_i); } isl_pw_aff_free(pwaff); return map; } /* Construct a map with as domain the domain of pwaff and * one-dimensional range corresponding to the affine expressions. */ __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff) { if (!pwaff) return NULL; if (isl_space_is_set(pwaff->dim)) isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid, "space of input is not a map", return isl_pw_aff_free(pwaff)); return map_from_pw_aff(pwaff); } /* Construct a one-dimensional set with as parameter domain * the domain of pwaff and the single set dimension * corresponding to the affine expressions. */ __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff) { if (!pwaff) return NULL; if (!isl_space_is_set(pwaff->dim)) isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid, "space of input is not a set", return isl_pw_aff_free(pwaff)); return map_from_pw_aff(pwaff); } /* Return a set containing those elements in the domain * of pwaff where it is non-negative. */ __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff) { int i; isl_set *set; if (!pwaff) return NULL; set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff)); for (i = 0; i < pwaff->n; ++i) { isl_basic_set *bset; isl_set *set_i; int rational; rational = isl_set_has_rational(pwaff->p[i].set); bset = aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff), rational); set_i = isl_set_from_basic_set(bset); set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set)); set = isl_set_union_disjoint(set, set_i); } isl_pw_aff_free(pwaff); return set; } /* Return a set containing those elements in the domain * of pwaff where it is zero (if complement is 0) or not zero * (if complement is 1). */ static __isl_give isl_set *pw_aff_zero_set(__isl_take isl_pw_aff *pwaff, int complement) { int i; isl_set *set; if (!pwaff) return NULL; set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff)); for (i = 0; i < pwaff->n; ++i) { isl_basic_set *bset; isl_set *set_i, *zero; int rational; rational = isl_set_has_rational(pwaff->p[i].set); bset = aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff), rational); zero = isl_set_from_basic_set(bset); set_i = isl_set_copy(pwaff->p[i].set); if (complement) set_i = isl_set_subtract(set_i, zero); else set_i = isl_set_intersect(set_i, zero); set = isl_set_union_disjoint(set, set_i); } isl_pw_aff_free(pwaff); return set; } /* Return a set containing those elements in the domain * of pwaff where it is zero. */ __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff) { return pw_aff_zero_set(pwaff, 0); } /* Return a set containing those elements in the domain * of pwaff where it is not zero. */ __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff) { return pw_aff_zero_set(pwaff, 1); } /* Return a set containing those elements in the shared domain * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2. * * We compute the difference on the shared domain and then construct * the set of values where this difference is non-negative. * If strict is set, we first subtract 1 from the difference. * If equal is set, we only return the elements where pwaff1 and pwaff2 * are equal. */ static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2, int strict, int equal) { isl_set *set1, *set2; set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)); set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)); set1 = isl_set_intersect(set1, set2); pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1)); pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1)); pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2)); if (strict) { isl_space *dim = isl_set_get_space(set1); isl_aff *aff; aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim)); aff = isl_aff_add_constant_si(aff, -1); pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff)); } else isl_set_free(set1); if (equal) return isl_pw_aff_zero_set(pwaff1); return isl_pw_aff_nonneg_set(pwaff1); } /* Return a set containing those elements in the shared domain * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2. */ static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return pw_aff_gte_set(pwaff1, pwaff2, 0, 1); } __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set); } /* Return a set containing those elements in the shared domain * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2. */ static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return pw_aff_gte_set(pwaff1, pwaff2, 0, 0); } __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set); } /* Return a set containing those elements in the shared domain * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2. */ static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return pw_aff_gte_set(pwaff1, pwaff2, 1, 0); } __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set); } __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_ge_set(pwaff2, pwaff1); } __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_gt_set(pwaff2, pwaff1); } /* Return a set containing those elements in the shared domain * of the elements of list1 and list2 where each element in list1 * has the relation specified by "fn" with each element in list2. */ static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2, __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2)) { int i, j; isl_ctx *ctx; isl_set *set; if (!list1 || !list2) goto error; ctx = isl_pw_aff_list_get_ctx(list1); if (list1->n < 1 || list2->n < 1) isl_die(ctx, isl_error_invalid, "list should contain at least one element", goto error); set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0])); for (i = 0; i < list1->n; ++i) for (j = 0; j < list2->n; ++j) { isl_set *set_ij; set_ij = fn(isl_pw_aff_copy(list1->p[i]), isl_pw_aff_copy(list2->p[j])); set = isl_set_intersect(set, set_ij); } isl_pw_aff_list_free(list1); isl_pw_aff_list_free(list2); return set; error: isl_pw_aff_list_free(list1); isl_pw_aff_list_free(list2); return NULL; } /* Return a set containing those elements in the shared domain * of the elements of list1 and list2 where each element in list1 * is equal to each element in list2. */ __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) { return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set); } __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) { return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set); } /* Return a set containing those elements in the shared domain * of the elements of list1 and list2 where each element in list1 * is less than or equal to each element in list2. */ __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) { return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set); } __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) { return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set); } __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) { return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set); } __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) { return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set); } /* Return a set containing those elements in the shared domain * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2. */ static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { isl_set *set_lt, *set_gt; set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1), isl_pw_aff_copy(pwaff2)); set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2); return isl_set_union_disjoint(set_lt, set_gt); } __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set); } __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff, isl_int v) { int i; if (isl_int_is_one(v)) return pwaff; if (!isl_int_is_pos(v)) isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid, "factor needs to be positive", return isl_pw_aff_free(pwaff)); pwaff = isl_pw_aff_cow(pwaff); if (!pwaff) return NULL; if (pwaff->n == 0) return pwaff; for (i = 0; i < pwaff->n; ++i) { pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v); if (!pwaff->p[i].aff) return isl_pw_aff_free(pwaff); } return pwaff; } /* Divide "pa" by "f". */ __isl_give isl_pw_aff *isl_pw_aff_scale_down_val(__isl_take isl_pw_aff *pa, __isl_take isl_val *f) { int i; if (!pa || !f) goto error; if (isl_val_is_one(f)) { isl_val_free(f); return pa; } if (!isl_val_is_rat(f)) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "expecting rational factor", goto error); if (!isl_val_is_pos(f)) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "factor needs to be positive", goto error); pa = isl_pw_aff_cow(pa); if (!pa) return NULL; if (pa->n == 0) return pa; for (i = 0; i < pa->n; ++i) { pa->p[i].aff = isl_aff_scale_down_val(pa->p[i].aff, isl_val_copy(f)); if (!pa->p[i].aff) goto error; } isl_val_free(f); return pa; error: isl_pw_aff_free(pa); isl_val_free(f); return NULL; } __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff) { int i; pwaff = isl_pw_aff_cow(pwaff); if (!pwaff) return NULL; if (pwaff->n == 0) return pwaff; for (i = 0; i < pwaff->n; ++i) { pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff); if (!pwaff->p[i].aff) return isl_pw_aff_free(pwaff); } return pwaff; } __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff) { int i; pwaff = isl_pw_aff_cow(pwaff); if (!pwaff) return NULL; if (pwaff->n == 0) return pwaff; for (i = 0; i < pwaff->n; ++i) { pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff); if (!pwaff->p[i].aff) return isl_pw_aff_free(pwaff); } return pwaff; } /* Assuming that "cond1" and "cond2" are disjoint, * return an affine expression that is equal to pwaff1 on cond1 * and to pwaff2 on cond2. */ static __isl_give isl_pw_aff *isl_pw_aff_select( __isl_take isl_set *cond1, __isl_take isl_pw_aff *pwaff1, __isl_take isl_set *cond2, __isl_take isl_pw_aff *pwaff2) { pwaff1 = isl_pw_aff_intersect_domain(pwaff1, cond1); pwaff2 = isl_pw_aff_intersect_domain(pwaff2, cond2); return isl_pw_aff_add_disjoint(pwaff1, pwaff2); } /* Return an affine expression that is equal to pwaff_true for elements * where "cond" is non-zero and to pwaff_false for elements where "cond" * is zero. * That is, return cond ? pwaff_true : pwaff_false; */ __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_pw_aff *cond, __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false) { isl_set *cond_true, *cond_false; cond_true = isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond)); cond_false = isl_pw_aff_zero_set(cond); return isl_pw_aff_select(cond_true, pwaff_true, cond_false, pwaff_false); } int isl_aff_is_cst(__isl_keep isl_aff *aff) { if (!aff) return -1; return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1; } /* Check whether pwaff is a piecewise constant. */ int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff) { int i; if (!pwaff) return -1; for (i = 0; i < pwaff->n; ++i) { int is_cst = isl_aff_is_cst(pwaff->p[i].aff); if (is_cst < 0 || !is_cst) return is_cst; } return 1; } __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1)) return isl_aff_mul(aff2, aff1); if (!isl_aff_is_cst(aff2)) isl_die(isl_aff_get_ctx(aff1), isl_error_invalid, "at least one affine expression should be constant", goto error); aff1 = isl_aff_cow(aff1); if (!aff1 || !aff2) goto error; aff1 = isl_aff_scale(aff1, aff2->v->el[1]); aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]); isl_aff_free(aff2); return aff1; error: isl_aff_free(aff1); isl_aff_free(aff2); return NULL; } /* Divide "aff1" by "aff2", assuming "aff2" is a piecewise constant. */ __isl_give isl_aff *isl_aff_div(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2) { int is_cst; int neg; is_cst = isl_aff_is_cst(aff2); if (is_cst < 0) goto error; if (!is_cst) isl_die(isl_aff_get_ctx(aff2), isl_error_invalid, "second argument should be a constant", goto error); if (!aff2) goto error; neg = isl_int_is_neg(aff2->v->el[1]); if (neg) { isl_int_neg(aff2->v->el[0], aff2->v->el[0]); isl_int_neg(aff2->v->el[1], aff2->v->el[1]); } aff1 = isl_aff_scale(aff1, aff2->v->el[0]); aff1 = isl_aff_scale_down(aff1, aff2->v->el[1]); if (neg) { isl_int_neg(aff2->v->el[0], aff2->v->el[0]); isl_int_neg(aff2->v->el[1], aff2->v->el[1]); } isl_aff_free(aff2); return aff1; error: isl_aff_free(aff1); isl_aff_free(aff2); return NULL; } static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add); } __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add); } __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_union_add_(pwaff1, pwaff2); } static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul); } __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul); } static __isl_give isl_pw_aff *pw_aff_div(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { return isl_pw_aff_on_shared_domain(pa1, pa2, &isl_aff_div); } /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant. */ __isl_give isl_pw_aff *isl_pw_aff_div(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { int is_cst; is_cst = isl_pw_aff_is_cst(pa2); if (is_cst < 0) goto error; if (!is_cst) isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid, "second argument should be a piecewise constant", goto error); return isl_pw_aff_align_params_pw_pw_and(pa1, pa2, &pw_aff_div); error: isl_pw_aff_free(pa1); isl_pw_aff_free(pa2); return NULL; } /* Compute the quotient of the integer division of "pa1" by "pa2" * with rounding towards zero. * "pa2" is assumed to be a piecewise constant. * * In particular, return * * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2) * */ __isl_give isl_pw_aff *isl_pw_aff_tdiv_q(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { int is_cst; isl_set *cond; isl_pw_aff *f, *c; is_cst = isl_pw_aff_is_cst(pa2); if (is_cst < 0) goto error; if (!is_cst) isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid, "second argument should be a piecewise constant", goto error); pa1 = isl_pw_aff_div(pa1, pa2); cond = isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1)); f = isl_pw_aff_floor(isl_pw_aff_copy(pa1)); c = isl_pw_aff_ceil(pa1); return isl_pw_aff_cond(isl_set_indicator_function(cond), f, c); error: isl_pw_aff_free(pa1); isl_pw_aff_free(pa2); return NULL; } /* Compute the remainder of the integer division of "pa1" by "pa2" * with rounding towards zero. * "pa2" is assumed to be a piecewise constant. * * In particular, return * * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)) * */ __isl_give isl_pw_aff *isl_pw_aff_tdiv_r(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2) { int is_cst; isl_pw_aff *res; is_cst = isl_pw_aff_is_cst(pa2); if (is_cst < 0) goto error; if (!is_cst) isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid, "second argument should be a piecewise constant", goto error); res = isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1), isl_pw_aff_copy(pa2)); res = isl_pw_aff_mul(pa2, res); res = isl_pw_aff_sub(pa1, res); return res; error: isl_pw_aff_free(pa1); isl_pw_aff_free(pa2); return NULL; } static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { isl_set *le; isl_set *dom; dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)), isl_pw_aff_domain(isl_pw_aff_copy(pwaff2))); le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1), isl_pw_aff_copy(pwaff2)); dom = isl_set_subtract(dom, isl_set_copy(le)); return isl_pw_aff_select(le, pwaff1, dom, pwaff2); } __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min); } static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { isl_set *ge; isl_set *dom; dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)), isl_pw_aff_domain(isl_pw_aff_copy(pwaff2))); ge = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1), isl_pw_aff_copy(pwaff2)); dom = isl_set_subtract(dom, isl_set_copy(ge)); return isl_pw_aff_select(ge, pwaff1, dom, pwaff2); } __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2) { return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max); } static __isl_give isl_pw_aff *pw_aff_list_reduce( __isl_take isl_pw_aff_list *list, __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2)) { int i; isl_ctx *ctx; isl_pw_aff *res; if (!list) return NULL; ctx = isl_pw_aff_list_get_ctx(list); if (list->n < 1) isl_die(ctx, isl_error_invalid, "list should contain at least one element", return isl_pw_aff_list_free(list)); res = isl_pw_aff_copy(list->p[0]); for (i = 1; i < list->n; ++i) res = fn(res, isl_pw_aff_copy(list->p[i])); isl_pw_aff_list_free(list); return res; } /* Return an isl_pw_aff that maps each element in the intersection of the * domains of the elements of list to the minimal corresponding affine * expression. */ __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list) { return pw_aff_list_reduce(list, &isl_pw_aff_min); } /* Return an isl_pw_aff that maps each element in the intersection of the * domains of the elements of list to the maximal corresponding affine * expression. */ __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list) { return pw_aff_list_reduce(list, &isl_pw_aff_max); } /* Mark the domains of "pwaff" as rational. */ __isl_give isl_pw_aff *isl_pw_aff_set_rational(__isl_take isl_pw_aff *pwaff) { int i; pwaff = isl_pw_aff_cow(pwaff); if (!pwaff) return NULL; if (pwaff->n == 0) return pwaff; for (i = 0; i < pwaff->n; ++i) { pwaff->p[i].set = isl_set_set_rational(pwaff->p[i].set); if (!pwaff->p[i].set) return isl_pw_aff_free(pwaff); } return pwaff; } /* Mark the domains of the elements of "list" as rational. */ __isl_give isl_pw_aff_list *isl_pw_aff_list_set_rational( __isl_take isl_pw_aff_list *list) { int i, n; if (!list) return NULL; if (list->n == 0) return list; n = list->n; for (i = 0; i < n; ++i) { isl_pw_aff *pa; pa = isl_pw_aff_list_get_pw_aff(list, i); pa = isl_pw_aff_set_rational(pa); list = isl_pw_aff_list_set_pw_aff(list, i, pa); } return list; } /* Check that the domain space of "aff" matches "space". * * Return 0 on success and -1 on error. */ int isl_aff_check_match_domain_space(__isl_keep isl_aff *aff, __isl_keep isl_space *space) { isl_space *aff_space; int match; if (!aff || !space) return -1; aff_space = isl_aff_get_domain_space(aff); match = isl_space_match(space, isl_dim_param, aff_space, isl_dim_param); if (match < 0) goto error; if (!match) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "parameters don't match", goto error); match = isl_space_tuple_match(space, isl_dim_in, aff_space, isl_dim_set); if (match < 0) goto error; if (!match) isl_die(isl_aff_get_ctx(aff), isl_error_invalid, "domains don't match", goto error); isl_space_free(aff_space); return 0; error: isl_space_free(aff_space); return -1; } #undef BASE #define BASE aff #include /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe * domain. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_aff( __isl_take isl_multi_aff *ma) { isl_set *dom = isl_set_universe(isl_multi_aff_get_domain_space(ma)); return isl_pw_multi_aff_alloc(dom, ma); } /* Create a piecewise multi-affine expression in the given space that maps each * input dimension to the corresponding output dimension. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_identity( __isl_take isl_space *space) { return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space)); } __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2) { return isl_multi_aff_bin_op(maff1, maff2, &isl_aff_add); } /* Subtract "ma2" from "ma1" and return the result. */ __isl_give isl_multi_aff *isl_multi_aff_sub(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2) { return isl_multi_aff_bin_op(ma1, ma2, &isl_aff_sub); } /* Given two multi-affine expressions A -> B and C -> D, * construct a multi-affine expression [A -> C] -> [B -> D]. */ __isl_give isl_multi_aff *isl_multi_aff_product( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2) { int i; isl_aff *aff; isl_space *space; isl_multi_aff *res; int in1, in2, out1, out2; in1 = isl_multi_aff_dim(ma1, isl_dim_in); in2 = isl_multi_aff_dim(ma2, isl_dim_in); out1 = isl_multi_aff_dim(ma1, isl_dim_out); out2 = isl_multi_aff_dim(ma2, isl_dim_out); space = isl_space_product(isl_multi_aff_get_space(ma1), isl_multi_aff_get_space(ma2)); res = isl_multi_aff_alloc(isl_space_copy(space)); space = isl_space_domain(space); for (i = 0; i < out1; ++i) { aff = isl_multi_aff_get_aff(ma1, i); aff = isl_aff_insert_dims(aff, isl_dim_in, in1, in2); aff = isl_aff_reset_domain_space(aff, isl_space_copy(space)); res = isl_multi_aff_set_aff(res, i, aff); } for (i = 0; i < out2; ++i) { aff = isl_multi_aff_get_aff(ma2, i); aff = isl_aff_insert_dims(aff, isl_dim_in, 0, in1); aff = isl_aff_reset_domain_space(aff, isl_space_copy(space)); res = isl_multi_aff_set_aff(res, out1 + i, aff); } isl_space_free(space); isl_multi_aff_free(ma1); isl_multi_aff_free(ma2); return res; } /* Exploit the equalities in "eq" to simplify the affine expressions. */ static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities( __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq) { int i; maff = isl_multi_aff_cow(maff); if (!maff || !eq) goto error; for (i = 0; i < maff->n; ++i) { maff->p[i] = isl_aff_substitute_equalities(maff->p[i], isl_basic_set_copy(eq)); if (!maff->p[i]) goto error; } isl_basic_set_free(eq); return maff; error: isl_basic_set_free(eq); isl_multi_aff_free(maff); return NULL; } __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff, isl_int f) { int i; maff = isl_multi_aff_cow(maff); if (!maff) return NULL; for (i = 0; i < maff->n; ++i) { maff->p[i] = isl_aff_scale(maff->p[i], f); if (!maff->p[i]) return isl_multi_aff_free(maff); } return maff; } __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom, __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2) { maff1 = isl_multi_aff_add(maff1, maff2); maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom)); return maff1; } int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff) { if (!maff) return -1; return 0; } int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1, __isl_keep isl_multi_aff *maff2) { int i; int equal; if (!maff1 || !maff2) return -1; if (maff1->n != maff2->n) return 0; equal = isl_space_is_equal(maff1->space, maff2->space); if (equal < 0 || !equal) return equal; for (i = 0; i < maff1->n; ++i) { equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]); if (equal < 0 || !equal) return equal; } return 1; } /* Return the set of domain elements where "ma1" is lexicographically * smaller than or equal to "ma2". */ __isl_give isl_set *isl_multi_aff_lex_le_set(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2) { return isl_multi_aff_lex_ge_set(ma2, ma1); } /* Return the set of domain elements where "ma1" is lexicographically * greater than or equal to "ma2". */ __isl_give isl_set *isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2) { isl_space *space; isl_map *map1, *map2; isl_map *map, *ge; map1 = isl_map_from_multi_aff(ma1); map2 = isl_map_from_multi_aff(ma2); map = isl_map_range_product(map1, map2); space = isl_space_range(isl_map_get_space(map)); space = isl_space_domain(isl_space_unwrap(space)); ge = isl_map_lex_ge(space); map = isl_map_intersect_range(map, isl_map_wrap(ge)); return isl_map_domain(map); } #undef PW #define PW isl_pw_multi_aff #undef EL #define EL isl_multi_aff #undef EL_IS_ZERO #define EL_IS_ZERO is_empty #undef ZERO #define ZERO empty #undef IS_ZERO #define IS_ZERO is_empty #undef FIELD #define FIELD maff #undef DEFAULT_IS_ZERO #define DEFAULT_IS_ZERO 0 #define NO_NEG #define NO_EVAL #define NO_OPT #define NO_INVOLVES_DIMS #define NO_MOVE_DIMS #define NO_INSERT_DIMS #define NO_LIFT #define NO_MORPH #include #undef UNION #define UNION isl_union_pw_multi_aff #undef PART #define PART isl_pw_multi_aff #undef PARTS #define PARTS pw_multi_aff #define ALIGN_DOMAIN #define NO_EVAL #include /* Given a function "cmp" that returns the set of elements where * "ma1" is "better" than "ma2", return the intersection of this * set with "dom1" and "dom2". */ static __isl_give isl_set *shared_and_better(__isl_keep isl_set *dom1, __isl_keep isl_set *dom2, __isl_keep isl_multi_aff *ma1, __isl_keep isl_multi_aff *ma2, __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)) { isl_set *common; isl_set *better; int is_empty; common = isl_set_intersect(isl_set_copy(dom1), isl_set_copy(dom2)); is_empty = isl_set_plain_is_empty(common); if (is_empty >= 0 && is_empty) return common; if (is_empty < 0) return isl_set_free(common); better = cmp(isl_multi_aff_copy(ma1), isl_multi_aff_copy(ma2)); better = isl_set_intersect(common, better); return better; } /* Given a function "cmp" that returns the set of elements where * "ma1" is "better" than "ma2", return a piecewise multi affine * expression defined on the union of the definition domains * of "pma1" and "pma2" that maps to the "best" of "pma1" and * "pma2" on each cell. If only one of the two input functions * is defined on a given cell, then it is considered the best. */ static __isl_give isl_pw_multi_aff *pw_multi_aff_union_opt( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2, __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)) { int i, j, n; isl_pw_multi_aff *res = NULL; isl_ctx *ctx; isl_set *set = NULL; if (!pma1 || !pma2) goto error; ctx = isl_space_get_ctx(pma1->dim); if (!isl_space_is_equal(pma1->dim, pma2->dim)) isl_die(ctx, isl_error_invalid, "arguments should live in the same space", goto error); if (isl_pw_multi_aff_is_empty(pma1)) { isl_pw_multi_aff_free(pma1); return pma2; } if (isl_pw_multi_aff_is_empty(pma2)) { isl_pw_multi_aff_free(pma2); return pma1; } n = 2 * (pma1->n + 1) * (pma2->n + 1); res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma1->dim), n); for (i = 0; i < pma1->n; ++i) { set = isl_set_copy(pma1->p[i].set); for (j = 0; j < pma2->n; ++j) { isl_set *better; int is_empty; better = shared_and_better(pma2->p[j].set, pma1->p[i].set, pma2->p[j].maff, pma1->p[i].maff, cmp); is_empty = isl_set_plain_is_empty(better); if (is_empty < 0 || is_empty) { isl_set_free(better); if (is_empty < 0) goto error; continue; } set = isl_set_subtract(set, isl_set_copy(better)); res = isl_pw_multi_aff_add_piece(res, better, isl_multi_aff_copy(pma2->p[j].maff)); } res = isl_pw_multi_aff_add_piece(res, set, isl_multi_aff_copy(pma1->p[i].maff)); } for (j = 0; j < pma2->n; ++j) { set = isl_set_copy(pma2->p[j].set); for (i = 0; i < pma1->n; ++i) set = isl_set_subtract(set, isl_set_copy(pma1->p[i].set)); res = isl_pw_multi_aff_add_piece(res, set, isl_multi_aff_copy(pma2->p[j].maff)); } isl_pw_multi_aff_free(pma1); isl_pw_multi_aff_free(pma2); return res; error: isl_pw_multi_aff_free(pma1); isl_pw_multi_aff_free(pma2); isl_set_free(set); return isl_pw_multi_aff_free(res); } static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmax( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_ge_set); } /* Given two piecewise multi affine expressions, return a piecewise * multi-affine expression defined on the union of the definition domains * of the inputs that is equal to the lexicographic maximum of the two * inputs on each cell. If only one of the two inputs is defined on * a given cell, then it is considered to be the maximum. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmax( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2, &pw_multi_aff_union_lexmax); } static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmin( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_le_set); } /* Given two piecewise multi affine expressions, return a piecewise * multi-affine expression defined on the union of the definition domains * of the inputs that is equal to the lexicographic minimum of the two * inputs on each cell. If only one of the two inputs is defined on * a given cell, then it is considered to be the minimum. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmin( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2, &pw_multi_aff_union_lexmin); } static __isl_give isl_pw_multi_aff *pw_multi_aff_add( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_on_shared_domain(pma1, pma2, &isl_multi_aff_add); } __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2, &pw_multi_aff_add); } static __isl_give isl_pw_multi_aff *pw_multi_aff_sub( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_on_shared_domain(pma1, pma2, &isl_multi_aff_sub); } /* Subtract "pma2" from "pma1" and return the result. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_sub( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2, &pw_multi_aff_sub); } __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_union_add_(pma1, pma2); } /* Given two piecewise multi-affine expressions A -> B and C -> D, * construct a piecewise multi-affine expression [A -> C] -> [B -> D]. */ static __isl_give isl_pw_multi_aff *pw_multi_aff_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { int i, j, n; isl_space *space; isl_pw_multi_aff *res; if (!pma1 || !pma2) goto error; n = pma1->n * pma2->n; space = isl_space_product(isl_space_copy(pma1->dim), isl_space_copy(pma2->dim)); res = isl_pw_multi_aff_alloc_size(space, n); for (i = 0; i < pma1->n; ++i) { for (j = 0; j < pma2->n; ++j) { isl_set *domain; isl_multi_aff *ma; domain = isl_set_product(isl_set_copy(pma1->p[i].set), isl_set_copy(pma2->p[j].set)); ma = isl_multi_aff_product( isl_multi_aff_copy(pma1->p[i].maff), isl_multi_aff_copy(pma2->p[j].maff)); res = isl_pw_multi_aff_add_piece(res, domain, ma); } } isl_pw_multi_aff_free(pma1); isl_pw_multi_aff_free(pma2); return res; error: isl_pw_multi_aff_free(pma1); isl_pw_multi_aff_free(pma2); return NULL; } __isl_give isl_pw_multi_aff *isl_pw_multi_aff_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2, &pw_multi_aff_product); } /* Construct a map mapping the domain of the piecewise multi-affine expression * to its range, with each dimension in the range equated to the * corresponding affine expression on its cell. */ __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma) { int i; isl_map *map; if (!pma) return NULL; map = isl_map_empty(isl_pw_multi_aff_get_space(pma)); for (i = 0; i < pma->n; ++i) { isl_multi_aff *maff; isl_basic_map *bmap; isl_map *map_i; maff = isl_multi_aff_copy(pma->p[i].maff); bmap = isl_basic_map_from_multi_aff(maff); map_i = isl_map_from_basic_map(bmap); map_i = isl_map_intersect_domain(map_i, isl_set_copy(pma->p[i].set)); map = isl_map_union_disjoint(map, map_i); } isl_pw_multi_aff_free(pma); return map; } __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma) { if (!pma) return NULL; if (!isl_space_is_set(pma->dim)) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "isl_pw_multi_aff cannot be converted into an isl_set", return isl_pw_multi_aff_free(pma)); return isl_map_from_pw_multi_aff(pma); } /* Given a basic map with a single output dimension that is defined * in terms of the parameters and input dimensions using an equality, * extract an isl_aff that expresses the output dimension in terms * of the parameters and input dimensions. * * Since some applications expect the result of isl_pw_multi_aff_from_map * to only contain integer affine expressions, we compute the floor * of the expression before returning. * * This function shares some similarities with * isl_basic_map_has_defining_equality and isl_constraint_get_bound. */ static __isl_give isl_aff *extract_isl_aff_from_basic_map( __isl_take isl_basic_map *bmap) { int i; unsigned offset; unsigned total; isl_local_space *ls; isl_aff *aff; if (!bmap) return NULL; if (isl_basic_map_dim(bmap, isl_dim_out) != 1) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "basic map should have a single output dimension", goto error); offset = isl_basic_map_offset(bmap, isl_dim_out); total = isl_basic_map_total_dim(bmap); for (i = 0; i < bmap->n_eq; ++i) { if (isl_int_is_zero(bmap->eq[i][offset])) continue; if (isl_seq_first_non_zero(bmap->eq[i] + offset + 1, 1 + total - (offset + 1)) != -1) continue; break; } if (i >= bmap->n_eq) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "unable to find suitable equality", goto error); ls = isl_basic_map_get_local_space(bmap); aff = isl_aff_alloc(isl_local_space_domain(ls)); if (!aff) goto error; if (isl_int_is_neg(bmap->eq[i][offset])) isl_seq_cpy(aff->v->el + 1, bmap->eq[i], offset); else isl_seq_neg(aff->v->el + 1, bmap->eq[i], offset); isl_seq_clr(aff->v->el + 1 + offset, aff->v->size - (1 + offset)); isl_int_abs(aff->v->el[0], bmap->eq[i][offset]); isl_basic_map_free(bmap); aff = isl_aff_remove_unused_divs(aff); aff = isl_aff_floor(aff); return aff; error: isl_basic_map_free(bmap); return NULL; } /* Given a basic map where each output dimension is defined * in terms of the parameters and input dimensions using an equality, * extract an isl_multi_aff that expresses the output dimensions in terms * of the parameters and input dimensions. */ static __isl_give isl_multi_aff *extract_isl_multi_aff_from_basic_map( __isl_take isl_basic_map *bmap) { int i; unsigned n_out; isl_multi_aff *ma; if (!bmap) return NULL; ma = isl_multi_aff_alloc(isl_basic_map_get_space(bmap)); n_out = isl_basic_map_dim(bmap, isl_dim_out); for (i = 0; i < n_out; ++i) { isl_basic_map *bmap_i; isl_aff *aff; bmap_i = isl_basic_map_copy(bmap); bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out, i + 1, n_out - (1 + i)); bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out, 0, i); aff = extract_isl_aff_from_basic_map(bmap_i); ma = isl_multi_aff_set_aff(ma, i, aff); } isl_basic_map_free(bmap); return ma; } /* Create an isl_pw_multi_aff that is equivalent to * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain). * The given basic map is such that each output dimension is defined * in terms of the parameters and input dimensions using an equality. */ static __isl_give isl_pw_multi_aff *plain_pw_multi_aff_from_map( __isl_take isl_set *domain, __isl_take isl_basic_map *bmap) { isl_multi_aff *ma; ma = extract_isl_multi_aff_from_basic_map(bmap); return isl_pw_multi_aff_alloc(domain, ma); } /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map. * This obviously only works if the input "map" is single-valued. * If so, we compute the lexicographic minimum of the image in the form * of an isl_pw_multi_aff. Since the image is unique, it is equal * to its lexicographic minimum. * If the input is not single-valued, we produce an error. */ static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_base( __isl_take isl_map *map) { int i; int sv; isl_pw_multi_aff *pma; sv = isl_map_is_single_valued(map); if (sv < 0) goto error; if (!sv) isl_die(isl_map_get_ctx(map), isl_error_invalid, "map is not single-valued", goto error); map = isl_map_make_disjoint(map); if (!map) return NULL; pma = isl_pw_multi_aff_empty(isl_map_get_space(map)); for (i = 0; i < map->n; ++i) { isl_pw_multi_aff *pma_i; isl_basic_map *bmap; bmap = isl_basic_map_copy(map->p[i]); pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap); pma = isl_pw_multi_aff_add_disjoint(pma, pma_i); } isl_map_free(map); return pma; error: isl_map_free(map); return NULL; } /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map, * taking into account that the output dimension at position "d" * can be represented as * * x = floor((e(...) + c1) / m) * * given that constraint "i" is of the form * * e(...) + c1 - m x >= 0 * * * Let "map" be of the form * * A -> B * * We construct a mapping * * A -> [A -> x = floor(...)] * * apply that to the map, obtaining * * [A -> x = floor(...)] -> B * * and equate dimension "d" to x. * We then compute a isl_pw_multi_aff representation of the resulting map * and plug in the mapping above. */ static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_div( __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i) { isl_ctx *ctx; isl_space *space; isl_local_space *ls; isl_multi_aff *ma; isl_aff *aff; isl_vec *v; isl_map *insert; int offset; int n; int n_in; isl_pw_multi_aff *pma; int is_set; is_set = isl_map_is_set(map); offset = isl_basic_map_offset(hull, isl_dim_out); ctx = isl_map_get_ctx(map); space = isl_space_domain(isl_map_get_space(map)); n_in = isl_space_dim(space, isl_dim_set); n = isl_space_dim(space, isl_dim_all); v = isl_vec_alloc(ctx, 1 + 1 + n); if (v) { isl_int_neg(v->el[0], hull->ineq[i][offset + d]); isl_seq_cpy(v->el + 1, hull->ineq[i], 1 + n); } isl_basic_map_free(hull); ls = isl_local_space_from_space(isl_space_copy(space)); aff = isl_aff_alloc_vec(ls, v); aff = isl_aff_floor(aff); if (is_set) { isl_space_free(space); ma = isl_multi_aff_from_aff(aff); } else { ma = isl_multi_aff_identity(isl_space_map_from_set(space)); ma = isl_multi_aff_range_product(ma, isl_multi_aff_from_aff(aff)); } insert = isl_map_from_multi_aff(isl_multi_aff_copy(ma)); map = isl_map_apply_domain(map, insert); map = isl_map_equate(map, isl_dim_in, n_in, isl_dim_out, d); pma = isl_pw_multi_aff_from_map(map); pma = isl_pw_multi_aff_pullback_multi_aff(pma, ma); return pma; } /* Is constraint "c" of the form * * e(...) + c1 - m x >= 0 * * or * * -e(...) + c2 + m x >= 0 * * where m > 1 and e only depends on parameters and input dimemnsions? * * "offset" is the offset of the output dimensions * "pos" is the position of output dimension x. */ static int is_potential_div_constraint(isl_int *c, int offset, int d, int total) { if (isl_int_is_zero(c[offset + d])) return 0; if (isl_int_is_one(c[offset + d])) return 0; if (isl_int_is_negone(c[offset + d])) return 0; if (isl_seq_first_non_zero(c + offset, d) != -1) return 0; if (isl_seq_first_non_zero(c + offset + d + 1, total - (offset + d + 1)) != -1) return 0; return 1; } /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map. * * As a special case, we first check if there is any pair of constraints, * shared by all the basic maps in "map" that force a given dimension * to be equal to the floor of some affine combination of the input dimensions. * * In particular, if we can find two constraints * * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1 * * and * * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2 * * where m > 1 and e only depends on parameters and input dimemnsions, * and such that * * c1 + c2 < m i.e., -c2 >= c1 - (m - 1) * * then we know that we can take * * x = floor((e(...) + c1) / m) * * without having to perform any computation. * * Note that we know that * * c1 + c2 >= 1 * * If c1 + c2 were 0, then we would have detected an equality during * simplification. If c1 + c2 were negative, then we would have detected * a contradiction. */ static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_check_div( __isl_take isl_map *map) { int d, dim; int i, j, n; int offset, total; isl_int sum; isl_basic_map *hull; hull = isl_map_unshifted_simple_hull(isl_map_copy(map)); if (!hull) goto error; isl_int_init(sum); dim = isl_map_dim(map, isl_dim_out); offset = isl_basic_map_offset(hull, isl_dim_out); total = 1 + isl_basic_map_total_dim(hull); n = hull->n_ineq; for (d = 0; d < dim; ++d) { for (i = 0; i < n; ++i) { if (!is_potential_div_constraint(hull->ineq[i], offset, d, total)) continue; for (j = i + 1; j < n; ++j) { if (!isl_seq_is_neg(hull->ineq[i] + 1, hull->ineq[j] + 1, total - 1)) continue; isl_int_add(sum, hull->ineq[i][0], hull->ineq[j][0]); if (isl_int_abs_lt(sum, hull->ineq[i][offset + d])) break; } if (j >= n) continue; isl_int_clear(sum); if (isl_int_is_pos(hull->ineq[j][offset + d])) j = i; return pw_multi_aff_from_map_div(map, hull, d, j); } } isl_int_clear(sum); isl_basic_map_free(hull); return pw_multi_aff_from_map_base(map); error: isl_map_free(map); isl_basic_map_free(hull); return NULL; } /* Given an affine expression * * [A -> B] -> f(A,B) * * construct an isl_multi_aff * * [A -> B] -> B' * * such that dimension "d" in B' is set to "aff" and the remaining * dimensions are set equal to the corresponding dimensions in B. * "n_in" is the dimension of the space A. * "n_out" is the dimension of the space B. * * If "is_set" is set, then the affine expression is of the form * * [B] -> f(B) * * and we construct an isl_multi_aff * * B -> B' */ static __isl_give isl_multi_aff *range_map(__isl_take isl_aff *aff, int d, unsigned n_in, unsigned n_out, int is_set) { int i; isl_multi_aff *ma; isl_space *space, *space2; isl_local_space *ls; space = isl_aff_get_domain_space(aff); ls = isl_local_space_from_space(isl_space_copy(space)); space2 = isl_space_copy(space); if (!is_set) space2 = isl_space_range(isl_space_unwrap(space2)); space = isl_space_map_from_domain_and_range(space, space2); ma = isl_multi_aff_alloc(space); ma = isl_multi_aff_set_aff(ma, d, aff); for (i = 0; i < n_out; ++i) { if (i == d) continue; aff = isl_aff_var_on_domain(isl_local_space_copy(ls), isl_dim_set, n_in + i); ma = isl_multi_aff_set_aff(ma, i, aff); } isl_local_space_free(ls); return ma; } /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map, * taking into account that the dimension at position "d" can be written as * * x = m a + f(..) (1) * * where m is equal to "gcd". * "i" is the index of the equality in "hull" that defines f(..). * In particular, the equality is of the form * * f(..) - x + m g(existentials) = 0 * * or * * -f(..) + x + m g(existentials) = 0 * * We basically plug (1) into "map", resulting in a map with "a" * in the range instead of "x". The corresponding isl_pw_multi_aff * defining "a" is then plugged back into (1) to obtain a definition fro "x". * * Specifically, given the input map * * A -> B * * We first wrap it into a set * * [A -> B] * * and define (1) on top of the corresponding space, resulting in "aff". * We use this to create an isl_multi_aff that maps the output position "d" * from "a" to "x", leaving all other (intput and output) dimensions unchanged. * We plug this into the wrapped map, unwrap the result and compute the * corresponding isl_pw_multi_aff. * The result is an expression * * A -> T(A) * * We adjust that to * * A -> [A -> T(A)] * * so that we can plug that into "aff", after extending the latter to * a mapping * * [A -> B] -> B' * * * If "map" is actually a set, then there is no "A" space, meaning * that we do not need to perform any wrapping, and that the result * of the recursive call is of the form * * [T] * * which is plugged into a mapping of the form * * B -> B' */ static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_stride( __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i, isl_int gcd) { isl_set *set; isl_space *space; isl_local_space *ls; isl_aff *aff; isl_multi_aff *ma; isl_pw_multi_aff *pma, *id; unsigned n_in; unsigned o_out; unsigned n_out; int is_set; is_set = isl_map_is_set(map); n_in = isl_basic_map_dim(hull, isl_dim_in); n_out = isl_basic_map_dim(hull, isl_dim_out); o_out = isl_basic_map_offset(hull, isl_dim_out); if (is_set) set = map; else set = isl_map_wrap(map); space = isl_space_map_from_set(isl_set_get_space(set)); ma = isl_multi_aff_identity(space); ls = isl_local_space_from_space(isl_set_get_space(set)); aff = isl_aff_alloc(ls); if (aff) { isl_int_set_si(aff->v->el[0], 1); if (isl_int_is_one(hull->eq[i][o_out + d])) isl_seq_neg(aff->v->el + 1, hull->eq[i], aff->v->size - 1); else isl_seq_cpy(aff->v->el + 1, hull->eq[i], aff->v->size - 1); isl_int_set(aff->v->el[1 + o_out + d], gcd); } ma = isl_multi_aff_set_aff(ma, n_in + d, isl_aff_copy(aff)); set = isl_set_preimage_multi_aff(set, ma); ma = range_map(aff, d, n_in, n_out, is_set); if (is_set) map = set; else map = isl_set_unwrap(set); pma = isl_pw_multi_aff_from_map(set); if (!is_set) { space = isl_pw_multi_aff_get_domain_space(pma); space = isl_space_map_from_set(space); id = isl_pw_multi_aff_identity(space); pma = isl_pw_multi_aff_range_product(id, pma); } id = isl_pw_multi_aff_from_multi_aff(ma); pma = isl_pw_multi_aff_pullback_pw_multi_aff(id, pma); isl_basic_map_free(hull); return pma; } /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map. * * As a special case, we first check if all output dimensions are uniquely * defined in terms of the parameters and input dimensions over the entire * domain. If so, we extract the desired isl_pw_multi_aff directly * from the affine hull of "map" and its domain. * * Otherwise, we check if any of the output dimensions is "strided". * That is, we check if can be written as * * x = m a + f(..) * * with m greater than 1, a some combination of existentiall quantified * variables and f and expression in the parameters and input dimensions. * If so, we remove the stride in pw_multi_aff_from_map_stride. * * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further * special case. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map) { int i, j; int sv; isl_basic_map *hull; unsigned n_out; unsigned o_out; unsigned n_div; unsigned o_div; isl_int gcd; if (!map) return NULL; hull = isl_map_affine_hull(isl_map_copy(map)); sv = isl_basic_map_plain_is_single_valued(hull); if (sv >= 0 && sv) return plain_pw_multi_aff_from_map(isl_map_domain(map), hull); if (sv < 0) hull = isl_basic_map_free(hull); if (!hull) goto error; n_div = isl_basic_map_dim(hull, isl_dim_div); o_div = isl_basic_map_offset(hull, isl_dim_div); if (n_div == 0) { isl_basic_map_free(hull); return pw_multi_aff_from_map_check_div(map); } isl_int_init(gcd); n_out = isl_basic_map_dim(hull, isl_dim_out); o_out = isl_basic_map_offset(hull, isl_dim_out); for (i = 0; i < n_out; ++i) { for (j = 0; j < hull->n_eq; ++j) { isl_int *eq = hull->eq[j]; isl_pw_multi_aff *res; if (!isl_int_is_one(eq[o_out + i]) && !isl_int_is_negone(eq[o_out + i])) continue; if (isl_seq_first_non_zero(eq + o_out, i) != -1) continue; if (isl_seq_first_non_zero(eq + o_out + i + 1, n_out - (i + 1)) != -1) continue; isl_seq_gcd(eq + o_div, n_div, &gcd); if (isl_int_is_zero(gcd)) continue; if (isl_int_is_one(gcd)) continue; res = pw_multi_aff_from_map_stride(map, hull, i, j, gcd); isl_int_clear(gcd); return res; } } isl_int_clear(gcd); isl_basic_map_free(hull); return pw_multi_aff_from_map_check_div(map); error: isl_map_free(map); return NULL; } __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set) { return isl_pw_multi_aff_from_map(set); } /* Convert "map" into an isl_pw_multi_aff (if possible) and * add it to *user. */ static int pw_multi_aff_from_map(__isl_take isl_map *map, void *user) { isl_union_pw_multi_aff **upma = user; isl_pw_multi_aff *pma; pma = isl_pw_multi_aff_from_map(map); *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma); return *upma ? 0 : -1; } /* Try and create an isl_union_pw_multi_aff that is equivalent * to the given isl_union_map. * The isl_union_map is required to be single-valued in each space. * Otherwise, an error is produced. */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_map( __isl_take isl_union_map *umap) { isl_space *space; isl_union_pw_multi_aff *upma; space = isl_union_map_get_space(umap); upma = isl_union_pw_multi_aff_empty(space); if (isl_union_map_foreach_map(umap, &pw_multi_aff_from_map, &upma) < 0) upma = isl_union_pw_multi_aff_free(upma); isl_union_map_free(umap); return upma; } /* Try and create an isl_union_pw_multi_aff that is equivalent * to the given isl_union_set. * The isl_union_set is required to be a singleton in each space. * Otherwise, an error is produced. */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_set( __isl_take isl_union_set *uset) { return isl_union_pw_multi_aff_from_union_map(uset); } /* Return the piecewise affine expression "set ? 1 : 0". */ __isl_give isl_pw_aff *isl_set_indicator_function(__isl_take isl_set *set) { isl_pw_aff *pa; isl_space *space = isl_set_get_space(set); isl_local_space *ls = isl_local_space_from_space(space); isl_aff *zero = isl_aff_zero_on_domain(isl_local_space_copy(ls)); isl_aff *one = isl_aff_zero_on_domain(ls); one = isl_aff_add_constant_si(one, 1); pa = isl_pw_aff_alloc(isl_set_copy(set), one); set = isl_set_complement(set); pa = isl_pw_aff_add_disjoint(pa, isl_pw_aff_alloc(set, zero)); return pa; } /* Plug in "subs" for dimension "type", "pos" of "aff". * * Let i be the dimension to replace and let "subs" be of the form * * f/d * * and "aff" of the form * * (a i + g)/m * * The result is * * (a f + d g')/(m d) * * where g' is the result of plugging in "subs" in each of the integer * divisions in g. */ __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs) { isl_ctx *ctx; isl_int v; aff = isl_aff_cow(aff); if (!aff || !subs) return isl_aff_free(aff); ctx = isl_aff_get_ctx(aff); if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim)) isl_die(ctx, isl_error_invalid, "spaces don't match", return isl_aff_free(aff)); if (isl_local_space_dim(subs->ls, isl_dim_div) != 0) isl_die(ctx, isl_error_unsupported, "cannot handle divs yet", return isl_aff_free(aff)); aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs); if (!aff->ls) return isl_aff_free(aff); aff->v = isl_vec_cow(aff->v); if (!aff->v) return isl_aff_free(aff); pos += isl_local_space_offset(aff->ls, type); isl_int_init(v); isl_seq_substitute(aff->v->el, pos, subs->v->el, aff->v->size, subs->v->size, v); isl_int_clear(v); return aff; } /* Plug in "subs" for dimension "type", "pos" in each of the affine * expressions in "maff". */ __isl_give isl_multi_aff *isl_multi_aff_substitute( __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs) { int i; maff = isl_multi_aff_cow(maff); if (!maff || !subs) return isl_multi_aff_free(maff); if (type == isl_dim_in) type = isl_dim_set; for (i = 0; i < maff->n; ++i) { maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs); if (!maff->p[i]) return isl_multi_aff_free(maff); } return maff; } /* Plug in "subs" for dimension "type", "pos" of "pma". * * pma is of the form * * A_i(v) -> M_i(v) * * while subs is of the form * * v' = B_j(v) -> S_j * * Each pair i,j such that C_ij = A_i \cap B_i is non-empty * has a contribution in the result, in particular * * C_ij(S_j) -> M_i(S_j) * * Note that plugging in S_j in C_ij may also result in an empty set * and this contribution should simply be discarded. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos, __isl_keep isl_pw_aff *subs) { int i, j, n; isl_pw_multi_aff *res; if (!pma || !subs) return isl_pw_multi_aff_free(pma); n = pma->n * subs->n; res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n); for (i = 0; i < pma->n; ++i) { for (j = 0; j < subs->n; ++j) { isl_set *common; isl_multi_aff *res_ij; int empty; common = isl_set_intersect( isl_set_copy(pma->p[i].set), isl_set_copy(subs->p[j].set)); common = isl_set_substitute(common, type, pos, subs->p[j].aff); empty = isl_set_plain_is_empty(common); if (empty < 0 || empty) { isl_set_free(common); if (empty < 0) goto error; continue; } res_ij = isl_multi_aff_substitute( isl_multi_aff_copy(pma->p[i].maff), type, pos, subs->p[j].aff); res = isl_pw_multi_aff_add_piece(res, common, res_ij); } } isl_pw_multi_aff_free(pma); return res; error: isl_pw_multi_aff_free(pma); isl_pw_multi_aff_free(res); return NULL; } /* Compute the preimage of a range of dimensions in the affine expression "src" * under "ma" and put the result in "dst". The number of dimensions in "src" * that precede the range is given by "n_before". The number of dimensions * in the range is given by the number of output dimensions of "ma". * The number of dimensions that follow the range is given by "n_after". * If "has_denom" is set (to one), * then "src" and "dst" have an extra initial denominator. * "n_div_ma" is the number of existentials in "ma" * "n_div_bset" is the number of existentials in "src" * The resulting "dst" (which is assumed to have been allocated by * the caller) contains coefficients for both sets of existentials, * first those in "ma" and then those in "src". * f, c1, c2 and g are temporary objects that have been initialized * by the caller. * * Let src represent the expression * * (a(p) + f_u u + b v + f_w w + c(divs))/d * * and let ma represent the expressions * * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i * * We start out with the following expression for dst: * * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d * * with the multiplication factor f initially equal to 1 * and f \sum_i b_i v_i kept separately. * For each x_i that we substitute, we multiply the numerator * (and denominator) of dst by c_1 = m_i and add the numerator * of the x_i expression multiplied by c_2 = f b_i, * after removing the common factors of c_1 and c_2. * The multiplication factor f also needs to be multiplied by c_1 * for the next x_j, j > i. */ void isl_seq_preimage(isl_int *dst, isl_int *src, __isl_keep isl_multi_aff *ma, int n_before, int n_after, int n_div_ma, int n_div_bmap, isl_int f, isl_int c1, isl_int c2, isl_int g, int has_denom) { int i; int n_param, n_in, n_out; int o_dst, o_src; n_param = isl_multi_aff_dim(ma, isl_dim_param); n_in = isl_multi_aff_dim(ma, isl_dim_in); n_out = isl_multi_aff_dim(ma, isl_dim_out); isl_seq_cpy(dst, src, has_denom + 1 + n_param + n_before); o_dst = o_src = has_denom + 1 + n_param + n_before; isl_seq_clr(dst + o_dst, n_in); o_dst += n_in; o_src += n_out; isl_seq_cpy(dst + o_dst, src + o_src, n_after); o_dst += n_after; o_src += n_after; isl_seq_clr(dst + o_dst, n_div_ma); o_dst += n_div_ma; isl_seq_cpy(dst + o_dst, src + o_src, n_div_bmap); isl_int_set_si(f, 1); for (i = 0; i < n_out; ++i) { int offset = has_denom + 1 + n_param + n_before + i; if (isl_int_is_zero(src[offset])) continue; isl_int_set(c1, ma->p[i]->v->el[0]); isl_int_mul(c2, f, src[offset]); isl_int_gcd(g, c1, c2); isl_int_divexact(c1, c1, g); isl_int_divexact(c2, c2, g); isl_int_mul(f, f, c1); o_dst = has_denom; o_src = 1; isl_seq_combine(dst + o_dst, c1, dst + o_dst, c2, ma->p[i]->v->el + o_src, 1 + n_param); o_dst += 1 + n_param; o_src += 1 + n_param; isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_before); o_dst += n_before; isl_seq_combine(dst + o_dst, c1, dst + o_dst, c2, ma->p[i]->v->el + o_src, n_in); o_dst += n_in; o_src += n_in; isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_after); o_dst += n_after; isl_seq_combine(dst + o_dst, c1, dst + o_dst, c2, ma->p[i]->v->el + o_src, n_div_ma); o_dst += n_div_ma; o_src += n_div_ma; isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_div_bmap); if (has_denom) isl_int_mul(dst[0], dst[0], c1); } } /* Compute the pullback of "aff" by the function represented by "ma". * In other words, plug in "ma" in "aff". The result is an affine expression * defined over the domain space of "ma". * * If "aff" is represented by * * (a(p) + b x + c(divs))/d * * and ma is represented by * * x = D(p) + F(y) + G(divs') * * then the result is * * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d * * The divs in the local space of the input are similarly adjusted * through a call to isl_local_space_preimage_multi_aff. */ __isl_give isl_aff *isl_aff_pullback_multi_aff(__isl_take isl_aff *aff, __isl_take isl_multi_aff *ma) { isl_aff *res = NULL; isl_local_space *ls; int n_div_aff, n_div_ma; isl_int f, c1, c2, g; ma = isl_multi_aff_align_divs(ma); if (!aff || !ma) goto error; n_div_aff = isl_aff_dim(aff, isl_dim_div); n_div_ma = ma->n ? isl_aff_dim(ma->p[0], isl_dim_div) : 0; ls = isl_aff_get_domain_local_space(aff); ls = isl_local_space_preimage_multi_aff(ls, isl_multi_aff_copy(ma)); res = isl_aff_alloc(ls); if (!res) goto error; isl_int_init(f); isl_int_init(c1); isl_int_init(c2); isl_int_init(g); isl_seq_preimage(res->v->el, aff->v->el, ma, 0, 0, n_div_ma, n_div_aff, f, c1, c2, g, 1); isl_int_clear(f); isl_int_clear(c1); isl_int_clear(c2); isl_int_clear(g); isl_aff_free(aff); isl_multi_aff_free(ma); res = isl_aff_normalize(res); return res; error: isl_aff_free(aff); isl_multi_aff_free(ma); isl_aff_free(res); return NULL; } /* Compute the pullback of "ma1" by the function represented by "ma2". * In other words, plug in "ma2" in "ma1". */ __isl_give isl_multi_aff *isl_multi_aff_pullback_multi_aff( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2) { int i; isl_space *space = NULL; ma2 = isl_multi_aff_align_divs(ma2); ma1 = isl_multi_aff_cow(ma1); if (!ma1 || !ma2) goto error; space = isl_space_join(isl_multi_aff_get_space(ma2), isl_multi_aff_get_space(ma1)); for (i = 0; i < ma1->n; ++i) { ma1->p[i] = isl_aff_pullback_multi_aff(ma1->p[i], isl_multi_aff_copy(ma2)); if (!ma1->p[i]) goto error; } ma1 = isl_multi_aff_reset_space(ma1, space); isl_multi_aff_free(ma2); return ma1; error: isl_space_free(space); isl_multi_aff_free(ma2); isl_multi_aff_free(ma1); return NULL; } /* Extend the local space of "dst" to include the divs * in the local space of "src". */ __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst, __isl_keep isl_aff *src) { isl_ctx *ctx; int *exp1 = NULL; int *exp2 = NULL; isl_mat *div; if (!src || !dst) return isl_aff_free(dst); ctx = isl_aff_get_ctx(src); if (!isl_space_is_equal(src->ls->dim, dst->ls->dim)) isl_die(ctx, isl_error_invalid, "spaces don't match", goto error); if (src->ls->div->n_row == 0) return dst; exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row); exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row); if (!exp1 || (dst->ls->div->n_row && !exp2)) goto error; div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2); dst = isl_aff_expand_divs(dst, div, exp2); free(exp1); free(exp2); return dst; error: free(exp1); free(exp2); return isl_aff_free(dst); } /* Adjust the local spaces of the affine expressions in "maff" * such that they all have the save divs. */ __isl_give isl_multi_aff *isl_multi_aff_align_divs( __isl_take isl_multi_aff *maff) { int i; if (!maff) return NULL; if (maff->n == 0) return maff; maff = isl_multi_aff_cow(maff); if (!maff) return NULL; for (i = 1; i < maff->n; ++i) maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]); for (i = 1; i < maff->n; ++i) { maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]); if (!maff->p[i]) return isl_multi_aff_free(maff); } return maff; } __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff) { aff = isl_aff_cow(aff); if (!aff) return NULL; aff->ls = isl_local_space_lift(aff->ls); if (!aff->ls) return isl_aff_free(aff); return aff; } /* Lift "maff" to a space with extra dimensions such that the result * has no more existentially quantified variables. * If "ls" is not NULL, then *ls is assigned the local space that lies * at the basis of the lifting applied to "maff". */ __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff, __isl_give isl_local_space **ls) { int i; isl_space *space; unsigned n_div; if (ls) *ls = NULL; if (!maff) return NULL; if (maff->n == 0) { if (ls) { isl_space *space = isl_multi_aff_get_domain_space(maff); *ls = isl_local_space_from_space(space); if (!*ls) return isl_multi_aff_free(maff); } return maff; } maff = isl_multi_aff_cow(maff); maff = isl_multi_aff_align_divs(maff); if (!maff) return NULL; n_div = isl_aff_dim(maff->p[0], isl_dim_div); space = isl_multi_aff_get_space(maff); space = isl_space_lift(isl_space_domain(space), n_div); space = isl_space_extend_domain_with_range(space, isl_multi_aff_get_space(maff)); if (!space) return isl_multi_aff_free(maff); isl_space_free(maff->space); maff->space = space; if (ls) { *ls = isl_aff_get_domain_local_space(maff->p[0]); if (!*ls) return isl_multi_aff_free(maff); } for (i = 0; i < maff->n; ++i) { maff->p[i] = isl_aff_lift(maff->p[i]); if (!maff->p[i]) goto error; } return maff; error: if (ls) isl_local_space_free(*ls); return isl_multi_aff_free(maff); } /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma". */ __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff( __isl_keep isl_pw_multi_aff *pma, int pos) { int i; int n_out; isl_space *space; isl_pw_aff *pa; if (!pma) return NULL; n_out = isl_pw_multi_aff_dim(pma, isl_dim_out); if (pos < 0 || pos >= n_out) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "index out of bounds", return NULL); space = isl_pw_multi_aff_get_space(pma); space = isl_space_drop_dims(space, isl_dim_out, pos + 1, n_out - pos - 1); space = isl_space_drop_dims(space, isl_dim_out, 0, pos); pa = isl_pw_aff_alloc_size(space, pma->n); for (i = 0; i < pma->n; ++i) { isl_aff *aff; aff = isl_multi_aff_get_aff(pma->p[i].maff, pos); pa = isl_pw_aff_add_piece(pa, isl_set_copy(pma->p[i].set), aff); } return pa; } /* Return an isl_pw_multi_aff with the given "set" as domain and * an unnamed zero-dimensional range. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain( __isl_take isl_set *set) { isl_multi_aff *ma; isl_space *space; space = isl_set_get_space(set); space = isl_space_from_domain(space); ma = isl_multi_aff_zero(space); return isl_pw_multi_aff_alloc(set, ma); } /* Add an isl_pw_multi_aff with the given "set" as domain and * an unnamed zero-dimensional range to *user. */ static int add_pw_multi_aff_from_domain(__isl_take isl_set *set, void *user) { isl_union_pw_multi_aff **upma = user; isl_pw_multi_aff *pma; pma = isl_pw_multi_aff_from_domain(set); *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma); return 0; } /* Return an isl_union_pw_multi_aff with the given "uset" as domain and * an unnamed zero-dimensional range. */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_domain( __isl_take isl_union_set *uset) { isl_space *space; isl_union_pw_multi_aff *upma; if (!uset) return NULL; space = isl_union_set_get_space(uset); upma = isl_union_pw_multi_aff_empty(space); if (isl_union_set_foreach_set(uset, &add_pw_multi_aff_from_domain, &upma) < 0) goto error; isl_union_set_free(uset); return upma; error: isl_union_set_free(uset); isl_union_pw_multi_aff_free(upma); return NULL; } /* Convert "pma" to an isl_map and add it to *umap. */ static int map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma, void *user) { isl_union_map **umap = user; isl_map *map; map = isl_map_from_pw_multi_aff(pma); *umap = isl_union_map_add_map(*umap, map); return 0; } /* Construct a union map mapping the domain of the union * piecewise multi-affine expression to its range, with each dimension * in the range equated to the corresponding affine expression on its cell. */ __isl_give isl_union_map *isl_union_map_from_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma) { isl_space *space; isl_union_map *umap; if (!upma) return NULL; space = isl_union_pw_multi_aff_get_space(upma); umap = isl_union_map_empty(space); if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma, &map_from_pw_multi_aff, &umap) < 0) goto error; isl_union_pw_multi_aff_free(upma); return umap; error: isl_union_pw_multi_aff_free(upma); isl_union_map_free(umap); return NULL; } /* Local data for bin_entry and the callback "fn". */ struct isl_union_pw_multi_aff_bin_data { isl_union_pw_multi_aff *upma2; isl_union_pw_multi_aff *res; isl_pw_multi_aff *pma; int (*fn)(void **entry, void *user); }; /* Given an isl_pw_multi_aff from upma1, store it in data->pma * and call data->fn for each isl_pw_multi_aff in data->upma2. */ static int bin_entry(void **entry, void *user) { struct isl_union_pw_multi_aff_bin_data *data = user; isl_pw_multi_aff *pma = *entry; data->pma = pma; if (isl_hash_table_foreach(data->upma2->dim->ctx, &data->upma2->table, data->fn, data) < 0) return -1; return 0; } /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2". * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is * passed as user field) and the isl_pw_multi_aff from upma2 is available * as *entry. The callback should adjust data->res if desired. */ static __isl_give isl_union_pw_multi_aff *bin_op( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2, int (*fn)(void **entry, void *user)) { isl_space *space; struct isl_union_pw_multi_aff_bin_data data = { NULL, NULL, NULL, fn }; space = isl_union_pw_multi_aff_get_space(upma2); upma1 = isl_union_pw_multi_aff_align_params(upma1, space); space = isl_union_pw_multi_aff_get_space(upma1); upma2 = isl_union_pw_multi_aff_align_params(upma2, space); if (!upma1 || !upma2) goto error; data.upma2 = upma2; data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma1->dim), upma1->table.n); if (isl_hash_table_foreach(upma1->dim->ctx, &upma1->table, &bin_entry, &data) < 0) goto error; isl_union_pw_multi_aff_free(upma1); isl_union_pw_multi_aff_free(upma2); return data.res; error: isl_union_pw_multi_aff_free(upma1); isl_union_pw_multi_aff_free(upma2); isl_union_pw_multi_aff_free(data.res); return NULL; } /* Given two aligned isl_pw_multi_affs A -> B and C -> D, * construct an isl_pw_multi_aff (A * C) -> [B -> D]. */ static __isl_give isl_pw_multi_aff *pw_multi_aff_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { isl_space *space; space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1), isl_pw_multi_aff_get_space(pma2)); return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space, &isl_multi_aff_range_product); } /* Given two isl_pw_multi_affs A -> B and C -> D, * construct an isl_pw_multi_aff (A * C) -> [B -> D]. */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2, &pw_multi_aff_range_product); } /* Given two aligned isl_pw_multi_affs A -> B and C -> D, * construct an isl_pw_multi_aff (A * C) -> (B, D). */ static __isl_give isl_pw_multi_aff *pw_multi_aff_flat_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { isl_space *space; space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1), isl_pw_multi_aff_get_space(pma2)); space = isl_space_flatten_range(space); return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space, &isl_multi_aff_flat_range_product); } /* Given two isl_pw_multi_affs A -> B and C -> D, * construct an isl_pw_multi_aff (A * C) -> (B, D). */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_flat_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2) { return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2, &pw_multi_aff_flat_range_product); } /* If data->pma and *entry have the same domain space, then compute * their flat range product and the result to data->res. */ static int flat_range_product_entry(void **entry, void *user) { struct isl_union_pw_multi_aff_bin_data *data = user; isl_pw_multi_aff *pma2 = *entry; if (!isl_space_tuple_match(data->pma->dim, isl_dim_in, pma2->dim, isl_dim_in)) return 0; pma2 = isl_pw_multi_aff_flat_range_product( isl_pw_multi_aff_copy(data->pma), isl_pw_multi_aff_copy(pma2)); data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma2); return 0; } /* Given two isl_union_pw_multi_affs A -> B and C -> D, * construct an isl_union_pw_multi_aff (A * C) -> (B, D). */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_flat_range_product( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2) { return bin_op(upma1, upma2, &flat_range_product_entry); } /* Replace the affine expressions at position "pos" in "pma" by "pa". * The parameters are assumed to have been aligned. * * The implementation essentially performs an isl_pw_*_on_shared_domain, * except that it works on two different isl_pw_* types. */ static __isl_give isl_pw_multi_aff *pw_multi_aff_set_pw_aff( __isl_take isl_pw_multi_aff *pma, unsigned pos, __isl_take isl_pw_aff *pa) { int i, j, n; isl_pw_multi_aff *res = NULL; if (!pma || !pa) goto error; if (!isl_space_tuple_match(pma->dim, isl_dim_in, pa->dim, isl_dim_in)) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "domains don't match", goto error); if (pos >= isl_pw_multi_aff_dim(pma, isl_dim_out)) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "index out of bounds", goto error); n = pma->n * pa->n; res = isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma), n); for (i = 0; i < pma->n; ++i) { for (j = 0; j < pa->n; ++j) { isl_set *common; isl_multi_aff *res_ij; int empty; common = isl_set_intersect(isl_set_copy(pma->p[i].set), isl_set_copy(pa->p[j].set)); empty = isl_set_plain_is_empty(common); if (empty < 0 || empty) { isl_set_free(common); if (empty < 0) goto error; continue; } res_ij = isl_multi_aff_set_aff( isl_multi_aff_copy(pma->p[i].maff), pos, isl_aff_copy(pa->p[j].aff)); res_ij = isl_multi_aff_gist(res_ij, isl_set_copy(common)); res = isl_pw_multi_aff_add_piece(res, common, res_ij); } } isl_pw_multi_aff_free(pma); isl_pw_aff_free(pa); return res; error: isl_pw_multi_aff_free(pma); isl_pw_aff_free(pa); return isl_pw_multi_aff_free(res); } /* Replace the affine expressions at position "pos" in "pma" by "pa". */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_pw_aff( __isl_take isl_pw_multi_aff *pma, unsigned pos, __isl_take isl_pw_aff *pa) { if (!pma || !pa) goto error; if (isl_space_match(pma->dim, isl_dim_param, pa->dim, isl_dim_param)) return pw_multi_aff_set_pw_aff(pma, pos, pa); if (!isl_space_has_named_params(pma->dim) || !isl_space_has_named_params(pa->dim)) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "unaligned unnamed parameters", goto error); pma = isl_pw_multi_aff_align_params(pma, isl_pw_aff_get_space(pa)); pa = isl_pw_aff_align_params(pa, isl_pw_multi_aff_get_space(pma)); return pw_multi_aff_set_pw_aff(pma, pos, pa); error: isl_pw_multi_aff_free(pma); isl_pw_aff_free(pa); return NULL; } /* Check that the domain space of "pa" matches "space". * * Return 0 on success and -1 on error. */ int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff *pa, __isl_keep isl_space *space) { isl_space *pa_space; int match; if (!pa || !space) return -1; pa_space = isl_pw_aff_get_space(pa); match = isl_space_match(space, isl_dim_param, pa_space, isl_dim_param); if (match < 0) goto error; if (!match) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "parameters don't match", goto error); match = isl_space_tuple_match(space, isl_dim_in, pa_space, isl_dim_in); if (match < 0) goto error; if (!match) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "domains don't match", goto error); isl_space_free(pa_space); return 0; error: isl_space_free(pa_space); return -1; } #undef BASE #define BASE pw_aff #include /* Scale the elements of "pma" by the corresponding elements of "mv". */ __isl_give isl_pw_multi_aff *isl_pw_multi_aff_scale_multi_val( __isl_take isl_pw_multi_aff *pma, __isl_take isl_multi_val *mv) { int i; pma = isl_pw_multi_aff_cow(pma); if (!pma || !mv) goto error; if (!isl_space_tuple_match(pma->dim, isl_dim_out, mv->space, isl_dim_set)) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid, "spaces don't match", goto error); if (!isl_space_match(pma->dim, isl_dim_param, mv->space, isl_dim_param)) { pma = isl_pw_multi_aff_align_params(pma, isl_multi_val_get_space(mv)); mv = isl_multi_val_align_params(mv, isl_pw_multi_aff_get_space(pma)); if (!pma || !mv) goto error; } for (i = 0; i < pma->n; ++i) { pma->p[i].maff = isl_multi_aff_scale_multi_val(pma->p[i].maff, isl_multi_val_copy(mv)); if (!pma->p[i].maff) goto error; } isl_multi_val_free(mv); return pma; error: isl_multi_val_free(mv); isl_pw_multi_aff_free(pma); return NULL; } /* Internal data structure for isl_union_pw_multi_aff_scale_multi_val. * mv contains the mv argument. * res collects the results. */ struct isl_union_pw_multi_aff_scale_multi_val_data { isl_multi_val *mv; isl_union_pw_multi_aff *res; }; /* This function is called for each entry of an isl_union_pw_multi_aff. * If the space of the entry matches that of data->mv, * then apply isl_pw_multi_aff_scale_multi_val and add the result * to data->res. */ static int union_pw_multi_aff_scale_multi_val_entry(void **entry, void *user) { struct isl_union_pw_multi_aff_scale_multi_val_data *data = user; isl_pw_multi_aff *pma = *entry; if (!pma) return -1; if (!isl_space_tuple_match(pma->dim, isl_dim_out, data->mv->space, isl_dim_set)) return 0; pma = isl_pw_multi_aff_copy(pma); pma = isl_pw_multi_aff_scale_multi_val(pma, isl_multi_val_copy(data->mv)); data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma); if (!data->res) return -1; return 0; } /* Scale the elements of "upma" by the corresponding elements of "mv", * for those entries that match the space of "mv". */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_scale_multi_val( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_multi_val *mv) { struct isl_union_pw_multi_aff_scale_multi_val_data data; upma = isl_union_pw_multi_aff_align_params(upma, isl_multi_val_get_space(mv)); mv = isl_multi_val_align_params(mv, isl_union_pw_multi_aff_get_space(upma)); if (!upma || !mv) goto error; data.mv = mv; data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma->dim), upma->table.n); if (isl_hash_table_foreach(upma->dim->ctx, &upma->table, &union_pw_multi_aff_scale_multi_val_entry, &data) < 0) goto error; isl_multi_val_free(mv); isl_union_pw_multi_aff_free(upma); return data.res; error: isl_multi_val_free(mv); isl_union_pw_multi_aff_free(upma); return NULL; } cloog-0.18.2/isl/bound.c0000664000175000017500000001522012254313240011666 00000000000000#include #include #include #include #include struct bound_options { struct isl_options *isl; unsigned verify; int print_all; int continue_on_error; }; ISL_ARGS_START(struct bound_options, bound_options_args) ISL_ARG_CHILD(struct bound_options, isl, "isl", &isl_options_args, "isl options") ISL_ARG_BOOL(struct bound_options, verify, 'T', "verify", 0, NULL) ISL_ARG_BOOL(struct bound_options, print_all, 'A', "print-all", 0, NULL) ISL_ARG_BOOL(struct bound_options, continue_on_error, '\0', "continue-on-error", 0, NULL) ISL_ARGS_END ISL_ARG_DEF(bound_options, struct bound_options, bound_options_args) static __isl_give isl_set *set_bounds(__isl_take isl_set *set) { unsigned nparam; int i, r; isl_point *pt, *pt2; isl_set *box; nparam = isl_set_dim(set, isl_dim_param); r = nparam >= 8 ? 5 : nparam >= 5 ? 15 : 50; pt = isl_set_sample_point(isl_set_copy(set)); pt2 = isl_point_copy(pt); for (i = 0; i < nparam; ++i) { pt = isl_point_add_ui(pt, isl_dim_param, i, r); pt2 = isl_point_sub_ui(pt2, isl_dim_param, i, r); } box = isl_set_box_from_points(pt, pt2); return isl_set_intersect(set, box); } struct verify_point_bound { struct bound_options *options; int stride; int n; int exact; int error; isl_pw_qpolynomial_fold *pwf; isl_pw_qpolynomial_fold *bound; }; static int verify_point(__isl_take isl_point *pnt, void *user) { int i; unsigned nvar; unsigned nparam; struct verify_point_bound *vpb = (struct verify_point_bound *) user; isl_int t; isl_ctx *ctx; isl_pw_qpolynomial_fold *pwf; isl_qpolynomial *bound = NULL; isl_qpolynomial *opt = NULL; isl_set *dom = NULL; isl_printer *p; const char *minmax; int bounded; int sign; int ok; FILE *out = vpb->options->print_all ? stdout : stderr; vpb->n--; if (1) { minmax = "ub"; sign = 1; } else { minmax = "lb"; sign = -1; } ctx = isl_point_get_ctx(pnt); p = isl_printer_to_file(ctx, out); isl_int_init(t); pwf = isl_pw_qpolynomial_fold_copy(vpb->pwf); nparam = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_param); for (i = 0; i < nparam; ++i) { isl_point_get_coordinate(pnt, isl_dim_param, i, &t); pwf = isl_pw_qpolynomial_fold_fix_dim(pwf, isl_dim_param, i, t); } bound = isl_pw_qpolynomial_fold_eval( isl_pw_qpolynomial_fold_copy(vpb->bound), isl_point_copy(pnt)); dom = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf)); bounded = isl_set_is_bounded(dom); if (bounded < 0) goto error; if (!bounded) opt = isl_pw_qpolynomial_fold_eval( isl_pw_qpolynomial_fold_copy(pwf), isl_set_sample_point(isl_set_copy(dom))); else if (sign > 0) opt = isl_pw_qpolynomial_fold_max(isl_pw_qpolynomial_fold_copy(pwf)); else opt = isl_pw_qpolynomial_fold_min(isl_pw_qpolynomial_fold_copy(pwf)); nvar = isl_set_dim(dom, isl_dim_set); opt = isl_qpolynomial_project_domain_on_params(opt); if (vpb->exact && bounded) ok = isl_qpolynomial_plain_is_equal(opt, bound); else if (sign > 0) ok = isl_qpolynomial_le_cst(opt, bound); else ok = isl_qpolynomial_le_cst(bound, opt); if (ok < 0) goto error; if (vpb->options->print_all || !ok) { p = isl_printer_print_str(p, minmax); p = isl_printer_print_str(p, "("); for (i = 0; i < nparam; ++i) { if (i) p = isl_printer_print_str(p, ", "); isl_point_get_coordinate(pnt, isl_dim_param, i, &t); p = isl_printer_print_isl_int(p, t); } p = isl_printer_print_str(p, ") = "); p = isl_printer_print_qpolynomial(p, bound); p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, bounded ? "opt" : "sample"); p = isl_printer_print_str(p, " = "); p = isl_printer_print_qpolynomial(p, opt); if (ok) p = isl_printer_print_str(p, ". OK"); else p = isl_printer_print_str(p, ". NOT OK"); p = isl_printer_end_line(p); } else if ((vpb->n % vpb->stride) == 0) { p = isl_printer_print_str(p, "o"); p = isl_printer_flush(p); } if (0) { error: ok = 0; } isl_pw_qpolynomial_fold_free(pwf); isl_qpolynomial_free(bound); isl_qpolynomial_free(opt); isl_point_free(pnt); isl_set_free(dom); isl_int_clear(t); isl_printer_free(p); if (!ok) vpb->error = 1; if (vpb->options->continue_on_error) ok = 1; return (vpb->n >= 1 && ok) ? 0 : -1; } static int check_solution(__isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_pw_qpolynomial_fold *bound, int exact, struct bound_options *options) { struct verify_point_bound vpb; isl_int count, max; isl_set *dom; isl_set *context; int i, r, n; dom = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf)); context = isl_set_params(isl_set_copy(dom)); context = isl_set_remove_divs(context); context = set_bounds(context); isl_int_init(count); isl_int_init(max); isl_int_set_si(max, 200); r = isl_set_count_upto(context, max, &count); assert(r >= 0); n = isl_int_get_si(count); isl_int_clear(max); isl_int_clear(count); vpb.options = options; vpb.pwf = pwf; vpb.bound = bound; vpb.n = n; vpb.stride = n > 70 ? 1 + (n + 1)/70 : 1; vpb.error = 0; vpb.exact = exact; if (!options->print_all) { for (i = 0; i < vpb.n; i += vpb.stride) printf("."); printf("\r"); fflush(stdout); } isl_set_foreach_point(context, verify_point, &vpb); isl_set_free(context); isl_set_free(dom); isl_pw_qpolynomial_fold_free(pwf); isl_pw_qpolynomial_fold_free(bound); if (!options->print_all) printf("\n"); if (vpb.error) { fprintf(stderr, "Check failed !\n"); return -1; } return 0; } int main(int argc, char **argv) { isl_ctx *ctx; isl_pw_qpolynomial_fold *copy; isl_pw_qpolynomial_fold *pwf; struct isl_stream *s; struct isl_obj obj; struct bound_options *options; int exact; int r = 0; options = bound_options_new_with_defaults(); assert(options); argc = bound_options_parse(options, argc, argv, ISL_ARG_ALL); ctx = isl_ctx_alloc_with_options(&bound_options_args, options); s = isl_stream_new_file(ctx, stdin); obj = isl_stream_read_obj(s); if (obj.type == isl_obj_pw_qpolynomial) pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial(isl_fold_max, obj.v); else if (obj.type == isl_obj_pw_qpolynomial_fold) pwf = obj.v; else { obj.type->free(obj.v); isl_die(ctx, isl_error_invalid, "invalid input", goto error); } if (options->verify) copy = isl_pw_qpolynomial_fold_copy(pwf); pwf = isl_pw_qpolynomial_fold_bound(pwf, &exact); pwf = isl_pw_qpolynomial_fold_coalesce(pwf); if (options->verify) { r = check_solution(copy, pwf, exact, options); } else { if (!exact) printf("# NOT exact\n"); isl_pw_qpolynomial_fold_print(pwf, stdout, 0); fprintf(stdout, "\n"); isl_pw_qpolynomial_fold_free(pwf); } error: isl_stream_free(s); isl_ctx_free(ctx); return r; } cloog-0.18.2/isl/isl_multi_templ.c0000664000175000017500000005165512254313240013775 00000000000000/* * Copyright 2011 Sven Verdoolaege * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #define xCAT(A,B) A ## B #define CAT(A,B) xCAT(A,B) #undef EL #define EL CAT(isl_,BASE) #define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) #define xMULTI(BASE) isl_multi_ ## BASE #define MULTI(BASE) xMULTI(BASE) #define MULTI_NAME(BASE) "isl_multi_" #BASE #define xLIST(EL) EL ## _list #define LIST(EL) xLIST(EL) isl_ctx *FN(MULTI(BASE),get_ctx)(__isl_keep MULTI(BASE) *multi) { return multi ? isl_space_get_ctx(multi->space) : NULL; } __isl_give isl_space *FN(MULTI(BASE),get_space)(__isl_keep MULTI(BASE) *multi) { return multi ? isl_space_copy(multi->space) : NULL; } __isl_give isl_space *FN(MULTI(BASE),get_domain_space)( __isl_keep MULTI(BASE) *multi) { return multi ? isl_space_domain(isl_space_copy(multi->space)) : NULL; } __isl_give MULTI(BASE) *FN(MULTI(BASE),alloc)(__isl_take isl_space *space) { isl_ctx *ctx; int n; MULTI(BASE) *multi; if (!space) return NULL; ctx = isl_space_get_ctx(space); n = isl_space_dim(space, isl_dim_out); multi = isl_calloc(ctx, MULTI(BASE), sizeof(MULTI(BASE)) + (n - 1) * sizeof(struct EL *)); if (!multi) goto error; multi->space = space; multi->n = n; multi->ref = 1; return multi; error: isl_space_free(space); return NULL; } __isl_give MULTI(BASE) *FN(MULTI(BASE),dup)(__isl_keep MULTI(BASE) *multi) { int i; MULTI(BASE) *dup; if (!multi) return NULL; dup = FN(MULTI(BASE),alloc)(isl_space_copy(multi->space)); if (!dup) return NULL; for (i = 0; i < multi->n; ++i) dup = FN(FN(MULTI(BASE),set),BASE)(dup, i, FN(EL,copy)(multi->p[i])); return dup; } __isl_give MULTI(BASE) *FN(MULTI(BASE),cow)(__isl_take MULTI(BASE) *multi) { if (!multi) return NULL; if (multi->ref == 1) return multi; multi->ref--; return FN(MULTI(BASE),dup)(multi); } __isl_give MULTI(BASE) *FN(MULTI(BASE),copy)(__isl_keep MULTI(BASE) *multi) { if (!multi) return NULL; multi->ref++; return multi; } void *FN(MULTI(BASE),free)(__isl_take MULTI(BASE) *multi) { int i; if (!multi) return NULL; if (--multi->ref > 0) return NULL; isl_space_free(multi->space); for (i = 0; i < multi->n; ++i) FN(EL,free)(multi->p[i]); free(multi); return NULL; } __isl_give MULTI(BASE) *FN(MULTI(BASE),insert_dims)( __isl_take MULTI(BASE) *multi, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!multi) return NULL; if (type == isl_dim_out) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "cannot insert output/set dimensions", return FN(MULTI(BASE),free)(multi)); if (n == 0 && !isl_space_is_named_or_nested(multi->space, type)) return multi; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; multi->space = isl_space_insert_dims(multi->space, type, first, n); if (!multi->space) return FN(MULTI(BASE),free)(multi); for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,insert_dims)(multi->p[i], type, first, n); if (!multi->p[i]) return FN(MULTI(BASE),free)(multi); } return multi; } __isl_give MULTI(BASE) *FN(MULTI(BASE),add_dims)(__isl_take MULTI(BASE) *multi, enum isl_dim_type type, unsigned n) { unsigned pos; pos = FN(MULTI(BASE),dim)(multi, type); return FN(MULTI(BASE),insert_dims)(multi, type, pos, n); } unsigned FN(MULTI(BASE),dim)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type) { return multi ? isl_space_dim(multi->space, type) : 0; } __isl_give MULTI(BASE) *FN(MULTI(BASE),set_dim_name)( __isl_take MULTI(BASE) *multi, enum isl_dim_type type, unsigned pos, const char *s) { int i; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; multi->space = isl_space_set_dim_name(multi->space, type, pos, s); if (!multi->space) return FN(MULTI(BASE),free)(multi); if (type == isl_dim_out) return multi; for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,set_dim_name)(multi->p[i], type, pos, s); if (!multi->p[i]) return FN(MULTI(BASE),free)(multi); } return multi; } const char *FN(MULTI(BASE),get_tuple_name)(__isl_keep MULTI(BASE) *multi, enum isl_dim_type type) { return multi ? isl_space_get_tuple_name(multi->space, type) : NULL; } __isl_give EL *FN(FN(MULTI(BASE),get),BASE)(__isl_keep MULTI(BASE) *multi, int pos) { isl_ctx *ctx; if (!multi) return NULL; ctx = FN(MULTI(BASE),get_ctx)(multi); if (pos < 0 || pos >= multi->n) isl_die(ctx, isl_error_invalid, "index out of bounds", return NULL); return FN(EL,copy)(multi->p[pos]); } __isl_give MULTI(BASE) *FN(FN(MULTI(BASE),set),BASE)( __isl_take MULTI(BASE) *multi, int pos, __isl_take EL *el) { isl_space *multi_space = NULL; isl_space *el_space = NULL; multi = FN(MULTI(BASE),cow)(multi); if (!multi || !el) goto error; multi_space = FN(MULTI(BASE),get_space)(multi); if (FN(EL,check_match_domain_space)(el, multi_space) < 0) goto error; if (pos < 0 || pos >= multi->n) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "index out of bounds", goto error); FN(EL,free)(multi->p[pos]); multi->p[pos] = el; isl_space_free(multi_space); isl_space_free(el_space); return multi; error: FN(MULTI(BASE),free)(multi); FN(EL,free)(el); isl_space_free(multi_space); isl_space_free(el_space); return NULL; } /* Reset the space of "multi". This function is called from isl_pw_templ.c * and doesn't know if the space of an element object is represented * directly or through its domain. It therefore passes along both, * which we pass along to the element function since we don't how * that is represented either. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),reset_space_and_domain)( __isl_take MULTI(BASE) *multi, __isl_take isl_space *space, __isl_take isl_space *domain) { int i; multi = FN(MULTI(BASE),cow)(multi); if (!multi || !space || !domain) goto error; for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,reset_domain_space)(multi->p[i], isl_space_copy(domain)); if (!multi->p[i]) goto error; } isl_space_free(domain); isl_space_free(multi->space); multi->space = space; return multi; error: isl_space_free(domain); isl_space_free(space); FN(MULTI(BASE),free)(multi); return NULL; } __isl_give MULTI(BASE) *FN(MULTI(BASE),reset_domain_space)( __isl_take MULTI(BASE) *multi, __isl_take isl_space *domain) { isl_space *space; space = isl_space_extend_domain_with_range(isl_space_copy(domain), isl_space_copy(multi->space)); return FN(MULTI(BASE),reset_space_and_domain)(multi, space, domain); } __isl_give MULTI(BASE) *FN(MULTI(BASE),reset_space)( __isl_take MULTI(BASE) *multi, __isl_take isl_space *space) { isl_space *domain; domain = isl_space_domain(isl_space_copy(space)); return FN(MULTI(BASE),reset_space_and_domain)(multi, space, domain); } __isl_give MULTI(BASE) *FN(MULTI(BASE),set_tuple_name)( __isl_keep MULTI(BASE) *multi, enum isl_dim_type type, const char *s) { isl_space *space; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; space = FN(MULTI(BASE),get_space)(multi); space = isl_space_set_tuple_name(space, type, s); return FN(MULTI(BASE),reset_space)(multi, space); } __isl_give MULTI(BASE) *FN(MULTI(BASE),set_tuple_id)( __isl_keep MULTI(BASE) *multi, enum isl_dim_type type, __isl_take isl_id *id) { isl_space *space; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return isl_id_free(id); space = FN(MULTI(BASE),get_space)(multi); space = isl_space_set_tuple_id(space, type, id); return FN(MULTI(BASE),reset_space)(multi, space); } __isl_give MULTI(BASE) *FN(MULTI(BASE),realign_domain)( __isl_take MULTI(BASE) *multi, __isl_take isl_reordering *exp) { int i; multi = FN(MULTI(BASE),cow)(multi); if (!multi || !exp) goto error; for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,realign_domain)(multi->p[i], isl_reordering_copy(exp)); if (!multi->p[i]) goto error; } multi = FN(MULTI(BASE),reset_domain_space)(multi, isl_space_copy(exp->dim)); isl_reordering_free(exp); return multi; error: isl_reordering_free(exp); FN(MULTI(BASE),free)(multi); return NULL; } /* Align the parameters of "multi" to those of "model". */ __isl_give MULTI(BASE) *FN(MULTI(BASE),align_params)( __isl_take MULTI(BASE) *multi, __isl_take isl_space *model) { isl_ctx *ctx; if (!multi || !model) goto error; ctx = isl_space_get_ctx(model); if (!isl_space_has_named_params(model)) isl_die(ctx, isl_error_invalid, "model has unnamed parameters", goto error); if (!isl_space_has_named_params(multi->space)) isl_die(ctx, isl_error_invalid, "input has unnamed parameters", goto error); if (!isl_space_match(multi->space, isl_dim_param, model, isl_dim_param)) { isl_reordering *exp; model = isl_space_params(model); exp = isl_parameter_alignment_reordering(multi->space, model); exp = isl_reordering_extend_space(exp, FN(MULTI(BASE),get_domain_space)(multi)); multi = FN(MULTI(BASE),realign_domain)(multi, exp); } isl_space_free(model); return multi; error: isl_space_free(model); FN(MULTI(BASE),free)(multi); return NULL; } #ifndef NO_GIST static __isl_give MULTI(BASE) *FN(MULTI(BASE),align_params_multi_set_and)( __isl_take MULTI(BASE) *multi, __isl_take isl_set *set, __isl_give MULTI(BASE) *(*fn)(__isl_take MULTI(BASE) *multi, __isl_take isl_set *set)) { isl_ctx *ctx; if (!multi || !set) goto error; if (isl_space_match(multi->space, isl_dim_param, set->dim, isl_dim_param)) return fn(multi, set); ctx = FN(MULTI(BASE),get_ctx)(multi); if (!isl_space_has_named_params(multi->space) || !isl_space_has_named_params(set->dim)) isl_die(ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); multi = FN(MULTI(BASE),align_params)(multi, isl_set_get_space(set)); set = isl_set_align_params(set, FN(MULTI(BASE),get_space)(multi)); return fn(multi, set); error: FN(MULTI(BASE),free)(multi); isl_set_free(set); return NULL; } __isl_give MULTI(BASE) *FN(MULTI(BASE),gist_aligned)( __isl_take MULTI(BASE) *multi, __isl_take isl_set *context) { int i; multi = FN(MULTI(BASE),cow)(multi); if (!multi || !context) goto error; for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,gist)(multi->p[i], isl_set_copy(context)); if (!multi->p[i]) goto error; } isl_set_free(context); return multi; error: isl_set_free(context); FN(MULTI(BASE),free)(multi); return NULL; } __isl_give MULTI(BASE) *FN(MULTI(BASE),gist)(__isl_take MULTI(BASE) *multi, __isl_take isl_set *context) { return FN(MULTI(BASE),align_params_multi_set_and)(multi, context, &FN(MULTI(BASE),gist_aligned)); } __isl_give MULTI(BASE) *FN(MULTI(BASE),gist_params)( __isl_take MULTI(BASE) *multi, __isl_take isl_set *context) { isl_space *space = FN(MULTI(BASE),get_domain_space)(multi); isl_set *dom_context = isl_set_universe(space); dom_context = isl_set_intersect_params(dom_context, context); return FN(MULTI(BASE),gist)(multi, dom_context); } #endif __isl_give MULTI(BASE) *FN(FN(MULTI(BASE),from),LIST(BASE))( __isl_take isl_space *space, __isl_take LIST(EL) *list) { int i; int n; isl_ctx *ctx; MULTI(BASE) *multi; if (!space || !list) goto error; ctx = isl_space_get_ctx(space); n = FN(FN(LIST(EL),n),BASE)(list); if (n != isl_space_dim(space, isl_dim_out)) isl_die(ctx, isl_error_invalid, "invalid number of elements in list", goto error); multi = FN(MULTI(BASE),alloc)(isl_space_copy(space)); for (i = 0; i < n; ++i) { multi = FN(FN(MULTI(BASE),set),BASE)(multi, i, FN(FN(LIST(EL),get),BASE)(list, i)); } isl_space_free(space); FN(LIST(EL),free)(list); return multi; error: isl_space_free(space); FN(LIST(EL),free)(list); return NULL; } #ifndef NO_IDENTITY /* Create a multi expression in the given space that maps each * input dimension to the corresponding output dimension. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),identity)(__isl_take isl_space *space) { int i, n; isl_local_space *ls; MULTI(BASE) *multi; if (!space) return NULL; if (isl_space_is_set(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "expecting map space", goto error); n = isl_space_dim(space, isl_dim_out); if (n != isl_space_dim(space, isl_dim_in)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "number of input and output dimensions needs to be " "the same", goto error); multi = FN(MULTI(BASE),alloc)(isl_space_copy(space)); if (!n) { isl_space_free(space); return multi; } space = isl_space_domain(space); ls = isl_local_space_from_space(space); for (i = 0; i < n; ++i) { EL *el; el = FN(EL,var_on_domain)(isl_local_space_copy(ls), isl_dim_set, i); multi = FN(FN(MULTI(BASE),set),BASE)(multi, i, el); } isl_local_space_free(ls); return multi; error: isl_space_free(space); return NULL; } #endif /* Construct a multi expression in the given space with value zero in * each of the output dimensions. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),zero)(__isl_take isl_space *space) { int n; MULTI(BASE) *multi; if (!space) return NULL; n = isl_space_dim(space , isl_dim_out); multi = FN(MULTI(BASE),alloc)(isl_space_copy(space)); if (!n) isl_space_free(space); else { int i; isl_local_space *ls; EL *el; space = isl_space_domain(space); ls = isl_local_space_from_space(space); el = FN(EL,zero_on_domain)(ls); for (i = 0; i < n; ++i) multi = FN(FN(MULTI(BASE),set),BASE)(multi, i, FN(EL,copy)(el)); FN(EL,free)(el); } return multi; } #ifndef NO_FROM_BASE __isl_give MULTI(BASE) *FN(FN(MULTI(BASE),from),BASE)(__isl_take EL *el) { MULTI(BASE) *multi; multi = FN(MULTI(BASE),alloc)(FN(EL,get_space)(el)); multi = FN(FN(MULTI(BASE),set),BASE)(multi, 0, el); return multi; } #endif __isl_give MULTI(BASE) *FN(MULTI(BASE),drop_dims)( __isl_take MULTI(BASE) *multi, enum isl_dim_type type, unsigned first, unsigned n) { int i; unsigned dim; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; dim = FN(MULTI(BASE),dim)(multi, type); if (first + n > dim || first + n < first) isl_die(FN(MULTI(BASE),get_ctx)(multi), isl_error_invalid, "index out of bounds", return FN(MULTI(BASE),cow)(multi)); multi->space = isl_space_drop_dims(multi->space, type, first, n); if (!multi->space) return FN(MULTI(BASE),cow)(multi); if (type == isl_dim_out) { for (i = 0; i < n; ++i) FN(EL,free)(multi->p[first + i]); for (i = first; i + n < multi->n; ++i) multi->p[i] = multi->p[i + n]; multi->n -= n; return multi; } for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,drop_dims)(multi->p[i], type, first, n); if (!multi->p[i]) return FN(MULTI(BASE),cow)(multi); } return multi; } /* Given two MULTI(BASE)s A -> B and C -> D, * construct a MULTI(BASE) (A * C) -> (B, D). */ __isl_give MULTI(BASE) *FN(MULTI(BASE),range_product)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2) { int i, n1, n2; EL *el; isl_space *space; MULTI(BASE) *res; if (!multi1 || !multi2) goto error; space = isl_space_range_product(FN(MULTI(BASE),get_space)(multi1), FN(MULTI(BASE),get_space)(multi2)); res = FN(MULTI(BASE),alloc)(space); n1 = FN(MULTI(BASE),dim)(multi1, isl_dim_out); n2 = FN(MULTI(BASE),dim)(multi2, isl_dim_out); for (i = 0; i < n1; ++i) { el = FN(FN(MULTI(BASE),get),BASE)(multi1, i); res = FN(FN(MULTI(BASE),set),BASE)(res, i, el); } for (i = 0; i < n2; ++i) { el = FN(FN(MULTI(BASE),get),BASE)(multi2, i); res = FN(FN(MULTI(BASE),set),BASE)(res, n1 + i, el); } FN(MULTI(BASE),free)(multi1); FN(MULTI(BASE),free)(multi2); return res; error: FN(MULTI(BASE),free)(multi1); FN(MULTI(BASE),free)(multi2); return NULL; } __isl_give MULTI(BASE) *FN(MULTI(BASE),flatten_range)( __isl_take MULTI(BASE) *multi) { if (!multi) return NULL; if (!multi->space->nested[1]) return multi; multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; multi->space = isl_space_flatten_range(multi->space); if (!multi->space) return FN(MULTI(BASE),free)(multi); return multi; } /* Given two MULTI(BASE)s A -> B and C -> D, * construct a MULTI(BASE) (A * C) -> [B -> D]. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),flat_range_product)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2) { MULTI(BASE) *multi; multi = FN(MULTI(BASE),range_product)(multi1, multi2); multi = FN(MULTI(BASE),flatten_range)(multi); return multi; } /* Given two multi expressions, "multi1" * * [A] -> [B1 B2] * * where B2 starts at position "pos", and "multi2" * * [A] -> [D] * * return the multi expression * * [A] -> [B1 D B2] */ __isl_give MULTI(BASE) *FN(MULTI(BASE),range_splice)( __isl_take MULTI(BASE) *multi1, unsigned pos, __isl_take MULTI(BASE) *multi2) { MULTI(BASE) *res; unsigned dim; if (!multi1 || !multi2) goto error; dim = FN(MULTI(BASE),dim)(multi1, isl_dim_out); if (pos > dim) isl_die(FN(MULTI(BASE),get_ctx)(multi1), isl_error_invalid, "index out of bounds", goto error); res = FN(MULTI(BASE),copy)(multi1); res = FN(MULTI(BASE),drop_dims)(res, isl_dim_out, pos, dim - pos); multi1 = FN(MULTI(BASE),drop_dims)(multi1, isl_dim_out, 0, pos); res = FN(MULTI(BASE),flat_range_product)(res, multi2); res = FN(MULTI(BASE),flat_range_product)(res, multi1); return res; error: FN(MULTI(BASE),free)(multi1); FN(MULTI(BASE),free)(multi2); return NULL; } /* Given two multi expressions, "multi1" * * [A1 A2] -> [B1 B2] * * where A2 starts at position "in_pos" and B2 starts at position "out_pos", * and "multi2" * * [C] -> [D] * * return the multi expression * * [A1 C A2] -> [B1 D B2] * * We first insert input dimensions to obtain * * [A1 C A2] -> [B1 B2] * * and * * [A1 C A2] -> [D] * * and then apply range_splice. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),splice)( __isl_take MULTI(BASE) *multi1, unsigned in_pos, unsigned out_pos, __isl_take MULTI(BASE) *multi2) { unsigned n_in1; unsigned n_in2; if (!multi1 || !multi2) goto error; n_in1 = FN(MULTI(BASE),dim)(multi1, isl_dim_in); if (in_pos > n_in1) isl_die(FN(MULTI(BASE),get_ctx)(multi1), isl_error_invalid, "index out of bounds", goto error); n_in2 = FN(MULTI(BASE),dim)(multi2, isl_dim_in); multi1 = FN(MULTI(BASE),insert_dims)(multi1, isl_dim_in, in_pos, n_in2); multi2 = FN(MULTI(BASE),insert_dims)(multi2, isl_dim_in, n_in2, n_in1 - in_pos); multi2 = FN(MULTI(BASE),insert_dims)(multi2, isl_dim_in, 0, in_pos); return FN(MULTI(BASE),range_splice)(multi1, out_pos, multi2); error: FN(MULTI(BASE),free)(multi1); FN(MULTI(BASE),free)(multi2); return NULL; } /* This function is currently only used from isl_aff.c */ static __isl_give MULTI(BASE) *FN(MULTI(BASE),bin_op)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2, __isl_give EL *(*fn)(__isl_take EL *, __isl_take EL *)) __attribute__ ((unused)); /* Pairwise perform "fn" to the elements of "multi1" and "multi2" and * return the result. */ static __isl_give MULTI(BASE) *FN(MULTI(BASE),bin_op)( __isl_take MULTI(BASE) *multi1, __isl_take MULTI(BASE) *multi2, __isl_give EL *(*fn)(__isl_take EL *, __isl_take EL *)) { int i; isl_ctx *ctx; multi1 = FN(MULTI(BASE),cow)(multi1); if (!multi1 || !multi2) goto error; ctx = FN(MULTI(BASE),get_ctx)(multi1); if (!isl_space_is_equal(multi1->space, multi2->space)) isl_die(ctx, isl_error_invalid, "spaces don't match", goto error); for (i = 0; i < multi1->n; ++i) { multi1->p[i] = fn(multi1->p[i], FN(EL,copy)(multi2->p[i])); if (!multi1->p[i]) goto error; } FN(MULTI(BASE),free)(multi2); return multi1; error: FN(MULTI(BASE),free)(multi1); FN(MULTI(BASE),free)(multi2); return NULL; } /* Multiply the elements of "multi" by "v" and return the result. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),scale_val)(__isl_take MULTI(BASE) *multi, __isl_take isl_val *v) { int i; if (!multi || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return multi; } if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational factor", goto error); multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; for (i = 0; i < multi->n; ++i) { multi->p[i] = FN(EL,scale_val)(multi->p[i], isl_val_copy(v)); if (!multi->p[i]) goto error; } isl_val_free(v); return multi; error: isl_val_free(v); return FN(MULTI(BASE),free)(multi); } /* Multiply the elements of "multi" by the corresponding element of "mv" * and return the result. */ __isl_give MULTI(BASE) *FN(MULTI(BASE),scale_multi_val)( __isl_take MULTI(BASE) *multi, __isl_take isl_multi_val *mv) { int i; if (!multi || !mv) goto error; if (!isl_space_tuple_match(multi->space, isl_dim_out, mv->space, isl_dim_set)) isl_die(isl_multi_val_get_ctx(mv), isl_error_invalid, "spaces don't match", goto error); multi = FN(MULTI(BASE),cow)(multi); if (!multi) return NULL; for (i = 0; i < multi->n; ++i) { isl_val *v; v = isl_multi_val_get_val(mv, i); multi->p[i] = FN(EL,scale_val)(multi->p[i], v); if (!multi->p[i]) goto error; } isl_multi_val_free(mv); return multi; error: isl_multi_val_free(mv); return FN(MULTI(BASE),free)(multi); } cloog-0.18.2/isl/isl_mat.c0000664000175000017500000011336112254313240012214 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include #include #include isl_ctx *isl_mat_get_ctx(__isl_keep isl_mat *mat) { return mat ? mat->ctx : NULL; } struct isl_mat *isl_mat_alloc(struct isl_ctx *ctx, unsigned n_row, unsigned n_col) { int i; struct isl_mat *mat; mat = isl_alloc_type(ctx, struct isl_mat); if (!mat) return NULL; mat->row = NULL; mat->block = isl_blk_alloc(ctx, n_row * n_col); if (isl_blk_is_error(mat->block)) goto error; mat->row = isl_alloc_array(ctx, isl_int *, n_row); if (n_row && !mat->row) goto error; for (i = 0; i < n_row; ++i) mat->row[i] = mat->block.data + i * n_col; mat->ctx = ctx; isl_ctx_ref(ctx); mat->ref = 1; mat->n_row = n_row; mat->n_col = n_col; mat->max_col = n_col; mat->flags = 0; return mat; error: isl_blk_free(ctx, mat->block); free(mat); return NULL; } struct isl_mat *isl_mat_extend(struct isl_mat *mat, unsigned n_row, unsigned n_col) { int i; isl_int *old; isl_int **row; if (!mat) return NULL; if (mat->max_col >= n_col && mat->n_row >= n_row) { if (mat->n_col < n_col) mat->n_col = n_col; return mat; } if (mat->max_col < n_col) { struct isl_mat *new_mat; if (n_row < mat->n_row) n_row = mat->n_row; new_mat = isl_mat_alloc(mat->ctx, n_row, n_col); if (!new_mat) goto error; for (i = 0; i < mat->n_row; ++i) isl_seq_cpy(new_mat->row[i], mat->row[i], mat->n_col); isl_mat_free(mat); return new_mat; } mat = isl_mat_cow(mat); if (!mat) goto error; old = mat->block.data; mat->block = isl_blk_extend(mat->ctx, mat->block, n_row * mat->max_col); if (isl_blk_is_error(mat->block)) goto error; row = isl_realloc_array(mat->ctx, mat->row, isl_int *, n_row); if (n_row && !row) goto error; mat->row = row; for (i = 0; i < mat->n_row; ++i) mat->row[i] = mat->block.data + (mat->row[i] - old); for (i = mat->n_row; i < n_row; ++i) mat->row[i] = mat->block.data + i * mat->max_col; mat->n_row = n_row; if (mat->n_col < n_col) mat->n_col = n_col; return mat; error: isl_mat_free(mat); return NULL; } __isl_give isl_mat *isl_mat_sub_alloc6(isl_ctx *ctx, isl_int **row, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col) { int i; struct isl_mat *mat; mat = isl_alloc_type(ctx, struct isl_mat); if (!mat) return NULL; mat->row = isl_alloc_array(ctx, isl_int *, n_row); if (n_row && !mat->row) goto error; for (i = 0; i < n_row; ++i) mat->row[i] = row[first_row+i] + first_col; mat->ctx = ctx; isl_ctx_ref(ctx); mat->ref = 1; mat->n_row = n_row; mat->n_col = n_col; mat->block = isl_blk_empty(); mat->flags = ISL_MAT_BORROWED; return mat; error: free(mat); return NULL; } __isl_give isl_mat *isl_mat_sub_alloc(__isl_keep isl_mat *mat, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col) { if (!mat) return NULL; return isl_mat_sub_alloc6(mat->ctx, mat->row, first_row, n_row, first_col, n_col); } void isl_mat_sub_copy(struct isl_ctx *ctx, isl_int **dst, isl_int **src, unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col) { int i; for (i = 0; i < n_row; ++i) isl_seq_cpy(dst[i]+dst_col, src[i]+src_col, n_col); } void isl_mat_sub_neg(struct isl_ctx *ctx, isl_int **dst, isl_int **src, unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col) { int i; for (i = 0; i < n_row; ++i) isl_seq_neg(dst[i]+dst_col, src[i]+src_col, n_col); } struct isl_mat *isl_mat_copy(struct isl_mat *mat) { if (!mat) return NULL; mat->ref++; return mat; } struct isl_mat *isl_mat_dup(struct isl_mat *mat) { int i; struct isl_mat *mat2; if (!mat) return NULL; mat2 = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col); if (!mat2) return NULL; for (i = 0; i < mat->n_row; ++i) isl_seq_cpy(mat2->row[i], mat->row[i], mat->n_col); return mat2; } struct isl_mat *isl_mat_cow(struct isl_mat *mat) { struct isl_mat *mat2; if (!mat) return NULL; if (mat->ref == 1 && !ISL_F_ISSET(mat, ISL_MAT_BORROWED)) return mat; mat2 = isl_mat_dup(mat); isl_mat_free(mat); return mat2; } void *isl_mat_free(struct isl_mat *mat) { if (!mat) return NULL; if (--mat->ref > 0) return NULL; if (!ISL_F_ISSET(mat, ISL_MAT_BORROWED)) isl_blk_free(mat->ctx, mat->block); isl_ctx_deref(mat->ctx); free(mat->row); free(mat); return NULL; } int isl_mat_rows(__isl_keep isl_mat *mat) { return mat ? mat->n_row : -1; } int isl_mat_cols(__isl_keep isl_mat *mat) { return mat ? mat->n_col : -1; } int isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v) { if (!mat) return -1; if (row < 0 || row >= mat->n_row) isl_die(mat->ctx, isl_error_invalid, "row out of range", return -1); if (col < 0 || col >= mat->n_col) isl_die(mat->ctx, isl_error_invalid, "column out of range", return -1); isl_int_set(*v, mat->row[row][col]); return 0; } /* Extract the element at row "row", oolumn "col" of "mat". */ __isl_give isl_val *isl_mat_get_element_val(__isl_keep isl_mat *mat, int row, int col) { isl_ctx *ctx; if (!mat) return NULL; ctx = isl_mat_get_ctx(mat); if (row < 0 || row >= mat->n_row) isl_die(ctx, isl_error_invalid, "row out of range", return NULL); if (col < 0 || col >= mat->n_col) isl_die(ctx, isl_error_invalid, "column out of range", return NULL); return isl_val_int_from_isl_int(ctx, mat->row[row][col]); } __isl_give isl_mat *isl_mat_set_element(__isl_take isl_mat *mat, int row, int col, isl_int v) { mat = isl_mat_cow(mat); if (!mat) return NULL; if (row < 0 || row >= mat->n_row) isl_die(mat->ctx, isl_error_invalid, "row out of range", goto error); if (col < 0 || col >= mat->n_col) isl_die(mat->ctx, isl_error_invalid, "column out of range", goto error); isl_int_set(mat->row[row][col], v); return mat; error: isl_mat_free(mat); return NULL; } __isl_give isl_mat *isl_mat_set_element_si(__isl_take isl_mat *mat, int row, int col, int v) { mat = isl_mat_cow(mat); if (!mat) return NULL; if (row < 0 || row >= mat->n_row) isl_die(mat->ctx, isl_error_invalid, "row out of range", goto error); if (col < 0 || col >= mat->n_col) isl_die(mat->ctx, isl_error_invalid, "column out of range", goto error); isl_int_set_si(mat->row[row][col], v); return mat; error: isl_mat_free(mat); return NULL; } /* Replace the element at row "row", column "col" of "mat" by "v". */ __isl_give isl_mat *isl_mat_set_element_val(__isl_take isl_mat *mat, int row, int col, __isl_take isl_val *v) { if (!v) return isl_mat_free(mat); if (!isl_val_is_int(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting integer value", goto error); mat = isl_mat_set_element(mat, row, col, v->n); isl_val_free(v); return mat; error: isl_val_free(v); return isl_mat_free(mat); } __isl_give isl_mat *isl_mat_diag(isl_ctx *ctx, unsigned n_row, isl_int d) { int i; struct isl_mat *mat; mat = isl_mat_alloc(ctx, n_row, n_row); if (!mat) return NULL; for (i = 0; i < n_row; ++i) { isl_seq_clr(mat->row[i], i); isl_int_set(mat->row[i][i], d); isl_seq_clr(mat->row[i]+i+1, n_row-(i+1)); } return mat; } __isl_give isl_mat *isl_mat_identity(isl_ctx *ctx, unsigned n_row) { if (!ctx) return NULL; return isl_mat_diag(ctx, n_row, ctx->one); } struct isl_vec *isl_mat_vec_product(struct isl_mat *mat, struct isl_vec *vec) { int i; struct isl_vec *prod; if (!mat || !vec) goto error; isl_assert(mat->ctx, mat->n_col == vec->size, goto error); prod = isl_vec_alloc(mat->ctx, mat->n_row); if (!prod) goto error; for (i = 0; i < prod->size; ++i) isl_seq_inner_product(mat->row[i], vec->el, vec->size, &prod->block.data[i]); isl_mat_free(mat); isl_vec_free(vec); return prod; error: isl_mat_free(mat); isl_vec_free(vec); return NULL; } __isl_give isl_vec *isl_mat_vec_inverse_product(__isl_take isl_mat *mat, __isl_take isl_vec *vec) { struct isl_mat *vec_mat; int i; if (!mat || !vec) goto error; vec_mat = isl_mat_alloc(vec->ctx, vec->size, 1); if (!vec_mat) goto error; for (i = 0; i < vec->size; ++i) isl_int_set(vec_mat->row[i][0], vec->el[i]); vec_mat = isl_mat_inverse_product(mat, vec_mat); isl_vec_free(vec); if (!vec_mat) return NULL; vec = isl_vec_alloc(vec_mat->ctx, vec_mat->n_row); if (vec) for (i = 0; i < vec->size; ++i) isl_int_set(vec->el[i], vec_mat->row[i][0]); isl_mat_free(vec_mat); return vec; error: isl_mat_free(mat); isl_vec_free(vec); return NULL; } struct isl_vec *isl_vec_mat_product(struct isl_vec *vec, struct isl_mat *mat) { int i, j; struct isl_vec *prod; if (!mat || !vec) goto error; isl_assert(mat->ctx, mat->n_row == vec->size, goto error); prod = isl_vec_alloc(mat->ctx, mat->n_col); if (!prod) goto error; for (i = 0; i < prod->size; ++i) { isl_int_set_si(prod->el[i], 0); for (j = 0; j < vec->size; ++j) isl_int_addmul(prod->el[i], vec->el[j], mat->row[j][i]); } isl_mat_free(mat); isl_vec_free(vec); return prod; error: isl_mat_free(mat); isl_vec_free(vec); return NULL; } struct isl_mat *isl_mat_aff_direct_sum(struct isl_mat *left, struct isl_mat *right) { int i; struct isl_mat *sum; if (!left || !right) goto error; isl_assert(left->ctx, left->n_row == right->n_row, goto error); isl_assert(left->ctx, left->n_row >= 1, goto error); isl_assert(left->ctx, left->n_col >= 1, goto error); isl_assert(left->ctx, right->n_col >= 1, goto error); isl_assert(left->ctx, isl_seq_first_non_zero(left->row[0]+1, left->n_col-1) == -1, goto error); isl_assert(left->ctx, isl_seq_first_non_zero(right->row[0]+1, right->n_col-1) == -1, goto error); sum = isl_mat_alloc(left->ctx, left->n_row, left->n_col + right->n_col - 1); if (!sum) goto error; isl_int_lcm(sum->row[0][0], left->row[0][0], right->row[0][0]); isl_int_divexact(left->row[0][0], sum->row[0][0], left->row[0][0]); isl_int_divexact(right->row[0][0], sum->row[0][0], right->row[0][0]); isl_seq_clr(sum->row[0]+1, sum->n_col-1); for (i = 1; i < sum->n_row; ++i) { isl_int_mul(sum->row[i][0], left->row[0][0], left->row[i][0]); isl_int_addmul(sum->row[i][0], right->row[0][0], right->row[i][0]); isl_seq_scale(sum->row[i]+1, left->row[i]+1, left->row[0][0], left->n_col-1); isl_seq_scale(sum->row[i]+left->n_col, right->row[i]+1, right->row[0][0], right->n_col-1); } isl_int_divexact(left->row[0][0], sum->row[0][0], left->row[0][0]); isl_int_divexact(right->row[0][0], sum->row[0][0], right->row[0][0]); isl_mat_free(left); isl_mat_free(right); return sum; error: isl_mat_free(left); isl_mat_free(right); return NULL; } static void exchange(struct isl_mat *M, struct isl_mat **U, struct isl_mat **Q, unsigned row, unsigned i, unsigned j) { int r; for (r = row; r < M->n_row; ++r) isl_int_swap(M->row[r][i], M->row[r][j]); if (U) { for (r = 0; r < (*U)->n_row; ++r) isl_int_swap((*U)->row[r][i], (*U)->row[r][j]); } if (Q) isl_mat_swap_rows(*Q, i, j); } static void subtract(struct isl_mat *M, struct isl_mat **U, struct isl_mat **Q, unsigned row, unsigned i, unsigned j, isl_int m) { int r; for (r = row; r < M->n_row; ++r) isl_int_submul(M->row[r][j], m, M->row[r][i]); if (U) { for (r = 0; r < (*U)->n_row; ++r) isl_int_submul((*U)->row[r][j], m, (*U)->row[r][i]); } if (Q) { for (r = 0; r < (*Q)->n_col; ++r) isl_int_addmul((*Q)->row[i][r], m, (*Q)->row[j][r]); } } static void oppose(struct isl_mat *M, struct isl_mat **U, struct isl_mat **Q, unsigned row, unsigned col) { int r; for (r = row; r < M->n_row; ++r) isl_int_neg(M->row[r][col], M->row[r][col]); if (U) { for (r = 0; r < (*U)->n_row; ++r) isl_int_neg((*U)->row[r][col], (*U)->row[r][col]); } if (Q) isl_seq_neg((*Q)->row[col], (*Q)->row[col], (*Q)->n_col); } /* Given matrix M, compute * * M U = H * M = H Q * * with U and Q unimodular matrices and H a matrix in column echelon form * such that on each echelon row the entries in the non-echelon column * are non-negative (if neg == 0) or non-positive (if neg == 1) * and stricly smaller (in absolute value) than the entries in the echelon * column. * If U or Q are NULL, then these matrices are not computed. */ struct isl_mat *isl_mat_left_hermite(struct isl_mat *M, int neg, struct isl_mat **U, struct isl_mat **Q) { isl_int c; int row, col; if (U) *U = NULL; if (Q) *Q = NULL; if (!M) goto error; M = isl_mat_cow(M); if (!M) goto error; if (U) { *U = isl_mat_identity(M->ctx, M->n_col); if (!*U) goto error; } if (Q) { *Q = isl_mat_identity(M->ctx, M->n_col); if (!*Q) goto error; } col = 0; isl_int_init(c); for (row = 0; row < M->n_row; ++row) { int first, i, off; first = isl_seq_abs_min_non_zero(M->row[row]+col, M->n_col-col); if (first == -1) continue; first += col; if (first != col) exchange(M, U, Q, row, first, col); if (isl_int_is_neg(M->row[row][col])) oppose(M, U, Q, row, col); first = col+1; while ((off = isl_seq_first_non_zero(M->row[row]+first, M->n_col-first)) != -1) { first += off; isl_int_fdiv_q(c, M->row[row][first], M->row[row][col]); subtract(M, U, Q, row, col, first, c); if (!isl_int_is_zero(M->row[row][first])) exchange(M, U, Q, row, first, col); else ++first; } for (i = 0; i < col; ++i) { if (isl_int_is_zero(M->row[row][i])) continue; if (neg) isl_int_cdiv_q(c, M->row[row][i], M->row[row][col]); else isl_int_fdiv_q(c, M->row[row][i], M->row[row][col]); if (isl_int_is_zero(c)) continue; subtract(M, U, Q, row, col, i, c); } ++col; } isl_int_clear(c); return M; error: if (Q) { isl_mat_free(*Q); *Q = NULL; } if (U) { isl_mat_free(*U); *U = NULL; } isl_mat_free(M); return NULL; } struct isl_mat *isl_mat_right_kernel(struct isl_mat *mat) { int i, rank; struct isl_mat *U = NULL; struct isl_mat *K; mat = isl_mat_left_hermite(mat, 0, &U, NULL); if (!mat || !U) goto error; for (i = 0, rank = 0; rank < mat->n_col; ++rank) { while (i < mat->n_row && isl_int_is_zero(mat->row[i][rank])) ++i; if (i >= mat->n_row) break; } K = isl_mat_alloc(U->ctx, U->n_row, U->n_col - rank); if (!K) goto error; isl_mat_sub_copy(K->ctx, K->row, U->row, U->n_row, 0, rank, U->n_col-rank); isl_mat_free(mat); isl_mat_free(U); return K; error: isl_mat_free(mat); isl_mat_free(U); return NULL; } struct isl_mat *isl_mat_lin_to_aff(struct isl_mat *mat) { int i; struct isl_mat *mat2; if (!mat) return NULL; mat2 = isl_mat_alloc(mat->ctx, 1+mat->n_row, 1+mat->n_col); if (!mat2) goto error; isl_int_set_si(mat2->row[0][0], 1); isl_seq_clr(mat2->row[0]+1, mat->n_col); for (i = 0; i < mat->n_row; ++i) { isl_int_set_si(mat2->row[1+i][0], 0); isl_seq_cpy(mat2->row[1+i]+1, mat->row[i], mat->n_col); } isl_mat_free(mat); return mat2; error: isl_mat_free(mat); return NULL; } /* Given two matrices M1 and M2, return the block matrix * * [ M1 0 ] * [ 0 M2 ] */ __isl_give isl_mat *isl_mat_diagonal(__isl_take isl_mat *mat1, __isl_take isl_mat *mat2) { int i; isl_mat *mat; if (!mat1 || !mat2) goto error; mat = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row, mat1->n_col + mat2->n_col); if (!mat) goto error; for (i = 0; i < mat1->n_row; ++i) { isl_seq_cpy(mat->row[i], mat1->row[i], mat1->n_col); isl_seq_clr(mat->row[i] + mat1->n_col, mat2->n_col); } for (i = 0; i < mat2->n_row; ++i) { isl_seq_clr(mat->row[mat1->n_row + i], mat1->n_col); isl_seq_cpy(mat->row[mat1->n_row + i] + mat1->n_col, mat2->row[i], mat2->n_col); } isl_mat_free(mat1); isl_mat_free(mat2); return mat; error: isl_mat_free(mat1); isl_mat_free(mat2); return NULL; } static int row_first_non_zero(isl_int **row, unsigned n_row, unsigned col) { int i; for (i = 0; i < n_row; ++i) if (!isl_int_is_zero(row[i][col])) return i; return -1; } static int row_abs_min_non_zero(isl_int **row, unsigned n_row, unsigned col) { int i, min = row_first_non_zero(row, n_row, col); if (min < 0) return -1; for (i = min + 1; i < n_row; ++i) { if (isl_int_is_zero(row[i][col])) continue; if (isl_int_abs_lt(row[i][col], row[min][col])) min = i; } return min; } static void inv_exchange(struct isl_mat *left, struct isl_mat *right, unsigned i, unsigned j) { left = isl_mat_swap_rows(left, i, j); right = isl_mat_swap_rows(right, i, j); } static void inv_oppose( struct isl_mat *left, struct isl_mat *right, unsigned row) { isl_seq_neg(left->row[row]+row, left->row[row]+row, left->n_col-row); isl_seq_neg(right->row[row], right->row[row], right->n_col); } static void inv_subtract(struct isl_mat *left, struct isl_mat *right, unsigned row, unsigned i, isl_int m) { isl_int_neg(m, m); isl_seq_combine(left->row[i]+row, left->ctx->one, left->row[i]+row, m, left->row[row]+row, left->n_col-row); isl_seq_combine(right->row[i], right->ctx->one, right->row[i], m, right->row[row], right->n_col); } /* Compute inv(left)*right */ struct isl_mat *isl_mat_inverse_product(struct isl_mat *left, struct isl_mat *right) { int row; isl_int a, b; if (!left || !right) goto error; isl_assert(left->ctx, left->n_row == left->n_col, goto error); isl_assert(left->ctx, left->n_row == right->n_row, goto error); if (left->n_row == 0) { isl_mat_free(left); return right; } left = isl_mat_cow(left); right = isl_mat_cow(right); if (!left || !right) goto error; isl_int_init(a); isl_int_init(b); for (row = 0; row < left->n_row; ++row) { int pivot, first, i, off; pivot = row_abs_min_non_zero(left->row+row, left->n_row-row, row); if (pivot < 0) { isl_int_clear(a); isl_int_clear(b); isl_assert(left->ctx, pivot >= 0, goto error); } pivot += row; if (pivot != row) inv_exchange(left, right, pivot, row); if (isl_int_is_neg(left->row[row][row])) inv_oppose(left, right, row); first = row+1; while ((off = row_first_non_zero(left->row+first, left->n_row-first, row)) != -1) { first += off; isl_int_fdiv_q(a, left->row[first][row], left->row[row][row]); inv_subtract(left, right, row, first, a); if (!isl_int_is_zero(left->row[first][row])) inv_exchange(left, right, row, first); else ++first; } for (i = 0; i < row; ++i) { if (isl_int_is_zero(left->row[i][row])) continue; isl_int_gcd(a, left->row[row][row], left->row[i][row]); isl_int_divexact(b, left->row[i][row], a); isl_int_divexact(a, left->row[row][row], a); isl_int_neg(b, b); isl_seq_combine(left->row[i] + i, a, left->row[i] + i, b, left->row[row] + i, left->n_col - i); isl_seq_combine(right->row[i], a, right->row[i], b, right->row[row], right->n_col); } } isl_int_clear(b); isl_int_set(a, left->row[0][0]); for (row = 1; row < left->n_row; ++row) isl_int_lcm(a, a, left->row[row][row]); if (isl_int_is_zero(a)){ isl_int_clear(a); isl_assert(left->ctx, 0, goto error); } for (row = 0; row < left->n_row; ++row) { isl_int_divexact(left->row[row][row], a, left->row[row][row]); if (isl_int_is_one(left->row[row][row])) continue; isl_seq_scale(right->row[row], right->row[row], left->row[row][row], right->n_col); } isl_int_clear(a); isl_mat_free(left); return right; error: isl_mat_free(left); isl_mat_free(right); return NULL; } void isl_mat_col_scale(struct isl_mat *mat, unsigned col, isl_int m) { int i; for (i = 0; i < mat->n_row; ++i) isl_int_mul(mat->row[i][col], mat->row[i][col], m); } void isl_mat_col_combine(struct isl_mat *mat, unsigned dst, isl_int m1, unsigned src1, isl_int m2, unsigned src2) { int i; isl_int tmp; isl_int_init(tmp); for (i = 0; i < mat->n_row; ++i) { isl_int_mul(tmp, m1, mat->row[i][src1]); isl_int_addmul(tmp, m2, mat->row[i][src2]); isl_int_set(mat->row[i][dst], tmp); } isl_int_clear(tmp); } struct isl_mat *isl_mat_right_inverse(struct isl_mat *mat) { struct isl_mat *inv; int row; isl_int a, b; mat = isl_mat_cow(mat); if (!mat) return NULL; inv = isl_mat_identity(mat->ctx, mat->n_col); inv = isl_mat_cow(inv); if (!inv) goto error; isl_int_init(a); isl_int_init(b); for (row = 0; row < mat->n_row; ++row) { int pivot, first, i, off; pivot = isl_seq_abs_min_non_zero(mat->row[row]+row, mat->n_col-row); if (pivot < 0) { isl_int_clear(a); isl_int_clear(b); isl_assert(mat->ctx, pivot >= 0, goto error); } pivot += row; if (pivot != row) exchange(mat, &inv, NULL, row, pivot, row); if (isl_int_is_neg(mat->row[row][row])) oppose(mat, &inv, NULL, row, row); first = row+1; while ((off = isl_seq_first_non_zero(mat->row[row]+first, mat->n_col-first)) != -1) { first += off; isl_int_fdiv_q(a, mat->row[row][first], mat->row[row][row]); subtract(mat, &inv, NULL, row, row, first, a); if (!isl_int_is_zero(mat->row[row][first])) exchange(mat, &inv, NULL, row, row, first); else ++first; } for (i = 0; i < row; ++i) { if (isl_int_is_zero(mat->row[row][i])) continue; isl_int_gcd(a, mat->row[row][row], mat->row[row][i]); isl_int_divexact(b, mat->row[row][i], a); isl_int_divexact(a, mat->row[row][row], a); isl_int_neg(a, a); isl_mat_col_combine(mat, i, a, i, b, row); isl_mat_col_combine(inv, i, a, i, b, row); } } isl_int_clear(b); isl_int_set(a, mat->row[0][0]); for (row = 1; row < mat->n_row; ++row) isl_int_lcm(a, a, mat->row[row][row]); if (isl_int_is_zero(a)){ isl_int_clear(a); goto error; } for (row = 0; row < mat->n_row; ++row) { isl_int_divexact(mat->row[row][row], a, mat->row[row][row]); if (isl_int_is_one(mat->row[row][row])) continue; isl_mat_col_scale(inv, row, mat->row[row][row]); } isl_int_clear(a); isl_mat_free(mat); return inv; error: isl_mat_free(mat); isl_mat_free(inv); return NULL; } struct isl_mat *isl_mat_transpose(struct isl_mat *mat) { struct isl_mat *transpose = NULL; int i, j; if (!mat) return NULL; if (mat->n_col == mat->n_row) { mat = isl_mat_cow(mat); if (!mat) return NULL; for (i = 0; i < mat->n_row; ++i) for (j = i + 1; j < mat->n_col; ++j) isl_int_swap(mat->row[i][j], mat->row[j][i]); return mat; } transpose = isl_mat_alloc(mat->ctx, mat->n_col, mat->n_row); if (!transpose) goto error; for (i = 0; i < mat->n_row; ++i) for (j = 0; j < mat->n_col; ++j) isl_int_set(transpose->row[j][i], mat->row[i][j]); isl_mat_free(mat); return transpose; error: isl_mat_free(mat); return NULL; } struct isl_mat *isl_mat_swap_cols(struct isl_mat *mat, unsigned i, unsigned j) { int r; mat = isl_mat_cow(mat); if (!mat) return NULL; isl_assert(mat->ctx, i < mat->n_col, goto error); isl_assert(mat->ctx, j < mat->n_col, goto error); for (r = 0; r < mat->n_row; ++r) isl_int_swap(mat->row[r][i], mat->row[r][j]); return mat; error: isl_mat_free(mat); return NULL; } struct isl_mat *isl_mat_swap_rows(struct isl_mat *mat, unsigned i, unsigned j) { isl_int *t; if (!mat) return NULL; mat = isl_mat_cow(mat); if (!mat) return NULL; t = mat->row[i]; mat->row[i] = mat->row[j]; mat->row[j] = t; return mat; } __isl_give isl_mat *isl_mat_product(__isl_take isl_mat *left, __isl_take isl_mat *right) { int i, j, k; struct isl_mat *prod; if (!left || !right) goto error; isl_assert(left->ctx, left->n_col == right->n_row, goto error); prod = isl_mat_alloc(left->ctx, left->n_row, right->n_col); if (!prod) goto error; if (left->n_col == 0) { for (i = 0; i < prod->n_row; ++i) isl_seq_clr(prod->row[i], prod->n_col); isl_mat_free(left); isl_mat_free(right); return prod; } for (i = 0; i < prod->n_row; ++i) { for (j = 0; j < prod->n_col; ++j) { isl_int_mul(prod->row[i][j], left->row[i][0], right->row[0][j]); for (k = 1; k < left->n_col; ++k) isl_int_addmul(prod->row[i][j], left->row[i][k], right->row[k][j]); } } isl_mat_free(left); isl_mat_free(right); return prod; error: isl_mat_free(left); isl_mat_free(right); return NULL; } /* Replace the variables x in the rows q by x' given by x = M x', * with M the matrix mat. * * If the number of new variables is greater than the original * number of variables, then the rows q have already been * preextended. If the new number is smaller, then the coefficients * of the divs, which are not changed, need to be shifted down. * The row q may be the equalities, the inequalities or the * div expressions. In the latter case, has_div is true and * we need to take into account the extra denominator column. */ static int preimage(struct isl_ctx *ctx, isl_int **q, unsigned n, unsigned n_div, int has_div, struct isl_mat *mat) { int i; struct isl_mat *t; int e; if (mat->n_col >= mat->n_row) e = 0; else e = mat->n_row - mat->n_col; if (has_div) for (i = 0; i < n; ++i) isl_int_mul(q[i][0], q[i][0], mat->row[0][0]); t = isl_mat_sub_alloc6(mat->ctx, q, 0, n, has_div, mat->n_row); t = isl_mat_product(t, mat); if (!t) return -1; for (i = 0; i < n; ++i) { isl_seq_swp_or_cpy(q[i] + has_div, t->row[i], t->n_col); isl_seq_cpy(q[i] + has_div + t->n_col, q[i] + has_div + t->n_col + e, n_div); isl_seq_clr(q[i] + has_div + t->n_col + n_div, e); } isl_mat_free(t); return 0; } /* Replace the variables x in bset by x' given by x = M x', with * M the matrix mat. * * If there are fewer variables x' then there are x, then we perform * the transformation in place, which that, in principle, * this frees up some extra variables as the number * of columns remains constant, but we would have to extend * the div array too as the number of rows in this array is assumed * to be equal to extra. */ struct isl_basic_set *isl_basic_set_preimage(struct isl_basic_set *bset, struct isl_mat *mat) { struct isl_ctx *ctx; if (!bset || !mat) goto error; ctx = bset->ctx; bset = isl_basic_set_cow(bset); if (!bset) goto error; isl_assert(ctx, bset->dim->nparam == 0, goto error); isl_assert(ctx, 1+bset->dim->n_out == mat->n_row, goto error); isl_assert(ctx, mat->n_col > 0, goto error); if (mat->n_col > mat->n_row) { bset = isl_basic_set_extend(bset, 0, mat->n_col-1, 0, 0, 0); if (!bset) goto error; } else if (mat->n_col < mat->n_row) { bset->dim = isl_space_cow(bset->dim); if (!bset->dim) goto error; bset->dim->n_out -= mat->n_row - mat->n_col; } if (preimage(ctx, bset->eq, bset->n_eq, bset->n_div, 0, isl_mat_copy(mat)) < 0) goto error; if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0, isl_mat_copy(mat)) < 0) goto error; if (preimage(ctx, bset->div, bset->n_div, bset->n_div, 1, mat) < 0) goto error2; ISL_F_CLR(bset, ISL_BASIC_SET_NO_IMPLICIT); ISL_F_CLR(bset, ISL_BASIC_SET_NO_REDUNDANT); ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED); ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED_DIVS); ISL_F_CLR(bset, ISL_BASIC_SET_ALL_EQUALITIES); bset = isl_basic_set_simplify(bset); bset = isl_basic_set_finalize(bset); return bset; error: isl_mat_free(mat); error2: isl_basic_set_free(bset); return NULL; } struct isl_set *isl_set_preimage(struct isl_set *set, struct isl_mat *mat) { struct isl_ctx *ctx; int i; set = isl_set_cow(set); if (!set) return NULL; ctx = set->ctx; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_preimage(set->p[i], isl_mat_copy(mat)); if (!set->p[i]) goto error; } if (mat->n_col != mat->n_row) { set->dim = isl_space_cow(set->dim); if (!set->dim) goto error; set->dim->n_out += mat->n_col; set->dim->n_out -= mat->n_row; } isl_mat_free(mat); ISL_F_CLR(set, ISL_SET_NORMALIZED); return set; error: isl_set_free(set); isl_mat_free(mat); return NULL; } /* Replace the variables x starting at pos in the rows q * by x' with x = M x' with M the matrix mat. * That is, replace the corresponding coefficients c by c M. */ static int transform(isl_ctx *ctx, isl_int **q, unsigned n, unsigned pos, __isl_take isl_mat *mat) { int i; isl_mat *t; t = isl_mat_sub_alloc6(ctx, q, 0, n, pos, mat->n_row); t = isl_mat_product(t, mat); if (!t) return -1; for (i = 0; i < n; ++i) isl_seq_swp_or_cpy(q[i] + pos, t->row[i], t->n_col); isl_mat_free(t); return 0; } /* Replace the variables x of type "type" starting at "first" in "bset" * by x' with x = M x' with M the matrix trans. * That is, replace the corresponding coefficients c by c M. * * The transformation matrix should be a square matrix. */ __isl_give isl_basic_set *isl_basic_set_transform_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, __isl_take isl_mat *trans) { isl_ctx *ctx; unsigned pos; bset = isl_basic_set_cow(bset); if (!bset || !trans) goto error; ctx = isl_basic_set_get_ctx(bset); if (trans->n_row != trans->n_col) isl_die(trans->ctx, isl_error_invalid, "expecting square transformation matrix", goto error); if (first + trans->n_row > isl_basic_set_dim(bset, type)) isl_die(trans->ctx, isl_error_invalid, "oversized transformation matrix", goto error); pos = isl_basic_set_offset(bset, type) + first; if (transform(ctx, bset->eq, bset->n_eq, pos, isl_mat_copy(trans)) < 0) goto error; if (transform(ctx, bset->ineq, bset->n_ineq, pos, isl_mat_copy(trans)) < 0) goto error; if (transform(ctx, bset->div, bset->n_div, 1 + pos, isl_mat_copy(trans)) < 0) goto error; ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED); ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED_DIVS); isl_mat_free(trans); return bset; error: isl_mat_free(trans); isl_basic_set_free(bset); return NULL; } void isl_mat_print_internal(__isl_keep isl_mat *mat, FILE *out, int indent) { int i, j; if (!mat) { fprintf(out, "%*snull mat\n", indent, ""); return; } if (mat->n_row == 0) fprintf(out, "%*s[]\n", indent, ""); for (i = 0; i < mat->n_row; ++i) { if (!i) fprintf(out, "%*s[[", indent, ""); else fprintf(out, "%*s[", indent+1, ""); for (j = 0; j < mat->n_col; ++j) { if (j) fprintf(out, ","); isl_int_print(out, mat->row[i][j], 0); } if (i == mat->n_row-1) fprintf(out, "]]\n"); else fprintf(out, "]\n"); } } void isl_mat_dump(__isl_keep isl_mat *mat) { isl_mat_print_internal(mat, stderr, 0); } struct isl_mat *isl_mat_drop_cols(struct isl_mat *mat, unsigned col, unsigned n) { int r; if (n == 0) return mat; mat = isl_mat_cow(mat); if (!mat) return NULL; if (col != mat->n_col-n) { for (r = 0; r < mat->n_row; ++r) isl_seq_cpy(mat->row[r]+col, mat->row[r]+col+n, mat->n_col - col - n); } mat->n_col -= n; return mat; } struct isl_mat *isl_mat_drop_rows(struct isl_mat *mat, unsigned row, unsigned n) { int r; mat = isl_mat_cow(mat); if (!mat) return NULL; for (r = row; r+n < mat->n_row; ++r) mat->row[r] = mat->row[r+n]; mat->n_row -= n; return mat; } __isl_give isl_mat *isl_mat_insert_cols(__isl_take isl_mat *mat, unsigned col, unsigned n) { isl_mat *ext; if (!mat) return NULL; if (n == 0) return mat; ext = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col + n); if (!ext) goto error; isl_mat_sub_copy(mat->ctx, ext->row, mat->row, mat->n_row, 0, 0, col); isl_mat_sub_copy(mat->ctx, ext->row, mat->row, mat->n_row, col + n, col, mat->n_col - col); isl_mat_free(mat); return ext; error: isl_mat_free(mat); return NULL; } __isl_give isl_mat *isl_mat_insert_zero_cols(__isl_take isl_mat *mat, unsigned first, unsigned n) { int i; if (!mat) return NULL; mat = isl_mat_insert_cols(mat, first, n); if (!mat) return NULL; for (i = 0; i < mat->n_row; ++i) isl_seq_clr(mat->row[i] + first, n); return mat; } __isl_give isl_mat *isl_mat_add_zero_cols(__isl_take isl_mat *mat, unsigned n) { if (!mat) return NULL; return isl_mat_insert_zero_cols(mat, mat->n_col, n); } __isl_give isl_mat *isl_mat_insert_rows(__isl_take isl_mat *mat, unsigned row, unsigned n) { isl_mat *ext; if (!mat) return NULL; if (n == 0) return mat; ext = isl_mat_alloc(mat->ctx, mat->n_row + n, mat->n_col); if (!ext) goto error; isl_mat_sub_copy(mat->ctx, ext->row, mat->row, row, 0, 0, mat->n_col); isl_mat_sub_copy(mat->ctx, ext->row + row + n, mat->row + row, mat->n_row - row, 0, 0, mat->n_col); isl_mat_free(mat); return ext; error: isl_mat_free(mat); return NULL; } __isl_give isl_mat *isl_mat_add_rows(__isl_take isl_mat *mat, unsigned n) { if (!mat) return NULL; return isl_mat_insert_rows(mat, mat->n_row, n); } __isl_give isl_mat *isl_mat_insert_zero_rows(__isl_take isl_mat *mat, unsigned row, unsigned n) { int i; mat = isl_mat_insert_rows(mat, row, n); if (!mat) return NULL; for (i = 0; i < n; ++i) isl_seq_clr(mat->row[row + i], mat->n_col); return mat; } __isl_give isl_mat *isl_mat_add_zero_rows(__isl_take isl_mat *mat, unsigned n) { if (!mat) return NULL; return isl_mat_insert_zero_rows(mat, mat->n_row, n); } void isl_mat_col_submul(struct isl_mat *mat, int dst_col, isl_int f, int src_col) { int i; for (i = 0; i < mat->n_row; ++i) isl_int_submul(mat->row[i][dst_col], f, mat->row[i][src_col]); } void isl_mat_col_add(__isl_keep isl_mat *mat, int dst_col, int src_col) { int i; if (!mat) return; for (i = 0; i < mat->n_row; ++i) isl_int_add(mat->row[i][dst_col], mat->row[i][dst_col], mat->row[i][src_col]); } void isl_mat_col_mul(struct isl_mat *mat, int dst_col, isl_int f, int src_col) { int i; for (i = 0; i < mat->n_row; ++i) isl_int_mul(mat->row[i][dst_col], f, mat->row[i][src_col]); } struct isl_mat *isl_mat_unimodular_complete(struct isl_mat *M, int row) { int r; struct isl_mat *H = NULL, *Q = NULL; if (!M) return NULL; isl_assert(M->ctx, M->n_row == M->n_col, goto error); M->n_row = row; H = isl_mat_left_hermite(isl_mat_copy(M), 0, NULL, &Q); M->n_row = M->n_col; if (!H) goto error; for (r = 0; r < row; ++r) isl_assert(M->ctx, isl_int_is_one(H->row[r][r]), goto error); for (r = row; r < M->n_row; ++r) isl_seq_cpy(M->row[r], Q->row[r], M->n_col); isl_mat_free(H); isl_mat_free(Q); return M; error: isl_mat_free(H); isl_mat_free(Q); isl_mat_free(M); return NULL; } __isl_give isl_mat *isl_mat_concat(__isl_take isl_mat *top, __isl_take isl_mat *bot) { struct isl_mat *mat; if (!top || !bot) goto error; isl_assert(top->ctx, top->n_col == bot->n_col, goto error); if (top->n_row == 0) { isl_mat_free(top); return bot; } if (bot->n_row == 0) { isl_mat_free(bot); return top; } mat = isl_mat_alloc(top->ctx, top->n_row + bot->n_row, top->n_col); if (!mat) goto error; isl_mat_sub_copy(mat->ctx, mat->row, top->row, top->n_row, 0, 0, mat->n_col); isl_mat_sub_copy(mat->ctx, mat->row + top->n_row, bot->row, bot->n_row, 0, 0, mat->n_col); isl_mat_free(top); isl_mat_free(bot); return mat; error: isl_mat_free(top); isl_mat_free(bot); return NULL; } int isl_mat_is_equal(__isl_keep isl_mat *mat1, __isl_keep isl_mat *mat2) { int i; if (!mat1 || !mat2) return -1; if (mat1->n_row != mat2->n_row) return 0; if (mat1->n_col != mat2->n_col) return 0; for (i = 0; i < mat1->n_row; ++i) if (!isl_seq_eq(mat1->row[i], mat2->row[i], mat1->n_col)) return 0; return 1; } __isl_give isl_mat *isl_mat_from_row_vec(__isl_take isl_vec *vec) { struct isl_mat *mat; if (!vec) return NULL; mat = isl_mat_alloc(vec->ctx, 1, vec->size); if (!mat) goto error; isl_seq_cpy(mat->row[0], vec->el, vec->size); isl_vec_free(vec); return mat; error: isl_vec_free(vec); return NULL; } __isl_give isl_mat *isl_mat_vec_concat(__isl_take isl_mat *top, __isl_take isl_vec *bot) { return isl_mat_concat(top, isl_mat_from_row_vec(bot)); } __isl_give isl_mat *isl_mat_move_cols(__isl_take isl_mat *mat, unsigned dst_col, unsigned src_col, unsigned n) { isl_mat *res; if (!mat) return NULL; if (n == 0 || dst_col == src_col) return mat; res = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col); if (!res) goto error; if (dst_col < src_col) { isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, 0, 0, dst_col); isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, dst_col, src_col, n); isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, dst_col + n, dst_col, src_col - dst_col); isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, src_col + n, src_col + n, res->n_col - src_col - n); } else { isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, 0, 0, src_col); isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, src_col, src_col + n, dst_col - src_col); isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, dst_col, src_col, n); isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row, dst_col + n, dst_col + n, res->n_col - dst_col - n); } isl_mat_free(mat); return res; error: isl_mat_free(mat); return NULL; } void isl_mat_gcd(__isl_keep isl_mat *mat, isl_int *gcd) { int i; isl_int g; isl_int_set_si(*gcd, 0); if (!mat) return; isl_int_init(g); for (i = 0; i < mat->n_row; ++i) { isl_seq_gcd(mat->row[i], mat->n_col, &g); isl_int_gcd(*gcd, *gcd, g); } isl_int_clear(g); } __isl_give isl_mat *isl_mat_scale_down(__isl_take isl_mat *mat, isl_int m) { int i; if (isl_int_is_one(m)) return mat; mat = isl_mat_cow(mat); if (!mat) return NULL; for (i = 0; i < mat->n_row; ++i) isl_seq_scale_down(mat->row[i], mat->row[i], m, mat->n_col); return mat; } __isl_give isl_mat *isl_mat_scale_down_row(__isl_take isl_mat *mat, int row, isl_int m) { if (isl_int_is_one(m)) return mat; mat = isl_mat_cow(mat); if (!mat) return NULL; isl_seq_scale_down(mat->row[row], mat->row[row], m, mat->n_col); return mat; } __isl_give isl_mat *isl_mat_normalize(__isl_take isl_mat *mat) { isl_int gcd; if (!mat) return NULL; isl_int_init(gcd); isl_mat_gcd(mat, &gcd); mat = isl_mat_scale_down(mat, gcd); isl_int_clear(gcd); return mat; } __isl_give isl_mat *isl_mat_normalize_row(__isl_take isl_mat *mat, int row) { mat = isl_mat_cow(mat); if (!mat) return NULL; isl_seq_normalize(mat->ctx, mat->row[row], mat->n_col); return mat; } /* Number of initial non-zero columns. */ int isl_mat_initial_non_zero_cols(__isl_keep isl_mat *mat) { int i; if (!mat) return -1; for (i = 0; i < mat->n_col; ++i) if (row_first_non_zero(mat->row, mat->n_row, i) < 0) break; return i; } cloog-0.18.2/isl/isl_factorization.c0000664000175000017500000001772712254313240014320 00000000000000/* * Copyright 2005-2007 Universiteit Leiden * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, Leiden Institute of Advanced Computer Science, * Universiteit Leiden, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands * and K.U.Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A, * B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include #include static __isl_give isl_factorizer *isl_factorizer_alloc( __isl_take isl_morph *morph, int n_group) { isl_factorizer *f = NULL; int *len = NULL; if (!morph) return NULL; if (n_group > 0) { len = isl_alloc_array(morph->dom->ctx, int, n_group); if (!len) goto error; } f = isl_alloc_type(morph->dom->ctx, struct isl_factorizer); if (!f) goto error; f->morph = morph; f->n_group = n_group; f->len = len; return f; error: free(len); isl_morph_free(morph); return NULL; } void isl_factorizer_free(__isl_take isl_factorizer *f) { if (!f) return; isl_morph_free(f->morph); free(f->len); free(f); } void isl_factorizer_dump(__isl_take isl_factorizer *f) { int i; if (!f) return; isl_morph_print_internal(f->morph, stderr); fprintf(stderr, "["); for (i = 0; i < f->n_group; ++i) { if (i) fprintf(stderr, ", "); fprintf(stderr, "%d", f->len[i]); } fprintf(stderr, "]\n"); } __isl_give isl_factorizer *isl_factorizer_identity(__isl_keep isl_basic_set *bset) { return isl_factorizer_alloc(isl_morph_identity(bset), 0); } __isl_give isl_factorizer *isl_factorizer_groups(__isl_keep isl_basic_set *bset, __isl_take isl_mat *Q, __isl_take isl_mat *U, int n, int *len) { int i; unsigned nvar; unsigned ovar; isl_space *dim; isl_basic_set *dom; isl_basic_set *ran; isl_morph *morph; isl_factorizer *f; isl_mat *id; if (!bset || !Q || !U) goto error; ovar = 1 + isl_space_offset(bset->dim, isl_dim_set); id = isl_mat_identity(bset->ctx, ovar); Q = isl_mat_diagonal(isl_mat_copy(id), Q); U = isl_mat_diagonal(id, U); nvar = isl_basic_set_dim(bset, isl_dim_set); dim = isl_basic_set_get_space(bset); dom = isl_basic_set_universe(isl_space_copy(dim)); dim = isl_space_drop_dims(dim, isl_dim_set, 0, nvar); dim = isl_space_add_dims(dim, isl_dim_set, nvar); ran = isl_basic_set_universe(dim); morph = isl_morph_alloc(dom, ran, Q, U); f = isl_factorizer_alloc(morph, n); if (!f) return NULL; for (i = 0; i < n; ++i) f->len[i] = len[i]; return f; error: isl_mat_free(Q); isl_mat_free(U); return NULL; } struct isl_factor_groups { int *pos; /* for each column: row position of pivot */ int *group; /* group to which a column belongs */ int *cnt; /* number of columns in the group */ int *rowgroup; /* group to which a constraint belongs */ }; /* Initialize isl_factor_groups structure: find pivot row positions, * each column initially belongs to its own group and the groups * of the constraints are still unknown. */ static int init_groups(struct isl_factor_groups *g, __isl_keep isl_mat *H) { int i, j; if (!H) return -1; g->pos = isl_alloc_array(H->ctx, int, H->n_col); g->group = isl_alloc_array(H->ctx, int, H->n_col); g->cnt = isl_alloc_array(H->ctx, int, H->n_col); g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row); if (!g->pos || !g->group || !g->cnt || !g->rowgroup) return -1; for (i = 0; i < H->n_row; ++i) g->rowgroup[i] = -1; for (i = 0, j = 0; i < H->n_col; ++i) { for ( ; j < H->n_row; ++j) if (!isl_int_is_zero(H->row[j][i])) break; g->pos[i] = j; } for (i = 0; i < H->n_col; ++i) { g->group[i] = i; g->cnt[i] = 1; } return 0; } /* Update group[k] to the group column k belongs to. * When merging two groups, only the group of the current * group leader is changed. Here we change the group of * the other members to also point to the group that the * old group leader now points to. */ static void update_group(struct isl_factor_groups *g, int k) { int p = g->group[k]; while (g->cnt[p] == 0) p = g->group[p]; g->group[k] = p; } /* Merge group i with all groups of the subsequent columns * with non-zero coefficients in row j of H. * (The previous columns are all zero; otherwise we would have handled * the row before.) */ static int update_group_i_with_row_j(struct isl_factor_groups *g, int i, int j, __isl_keep isl_mat *H) { int k; g->rowgroup[j] = g->group[i]; for (k = i + 1; k < H->n_col && j >= g->pos[k]; ++k) { update_group(g, k); update_group(g, i); if (g->group[k] != g->group[i] && !isl_int_is_zero(H->row[j][k])) { isl_assert(H->ctx, g->cnt[g->group[k]] != 0, return -1); isl_assert(H->ctx, g->cnt[g->group[i]] != 0, return -1); if (g->group[i] < g->group[k]) { g->cnt[g->group[i]] += g->cnt[g->group[k]]; g->cnt[g->group[k]] = 0; g->group[g->group[k]] = g->group[i]; } else { g->cnt[g->group[k]] += g->cnt[g->group[i]]; g->cnt[g->group[i]] = 0; g->group[g->group[i]] = g->group[k]; } } } return 0; } /* Update the group information based on the constraint matrix. */ static int update_groups(struct isl_factor_groups *g, __isl_keep isl_mat *H) { int i, j; for (i = 0; i < H->n_col && g->cnt[0] < H->n_col; ++i) { if (g->pos[i] == H->n_row) continue; /* A line direction */ if (g->rowgroup[g->pos[i]] == -1) g->rowgroup[g->pos[i]] = i; for (j = g->pos[i] + 1; j < H->n_row; ++j) { if (isl_int_is_zero(H->row[j][i])) continue; if (g->rowgroup[j] != -1) continue; if (update_group_i_with_row_j(g, i, j, H) < 0) return -1; } } for (i = 1; i < H->n_col; ++i) update_group(g, i); return 0; } static void clear_groups(struct isl_factor_groups *g) { if (!g) return; free(g->pos); free(g->group); free(g->cnt); free(g->rowgroup); } /* Determine if the set variables of the basic set can be factorized and * return the results in an isl_factorizer. * * The algorithm works by first computing the Hermite normal form * and then grouping columns linked by one or more constraints together, * where a constraints "links" two or more columns if the constraint * has nonzero coefficients in the columns. */ __isl_give isl_factorizer *isl_basic_set_factorizer( __isl_keep isl_basic_set *bset) { int i, j, n, done; isl_mat *H, *U, *Q; unsigned nvar; struct isl_factor_groups g = { 0 }; isl_factorizer *f; if (!bset) return NULL; isl_assert(bset->ctx, isl_basic_set_dim(bset, isl_dim_div) == 0, return NULL); nvar = isl_basic_set_dim(bset, isl_dim_set); if (nvar <= 1) return isl_factorizer_identity(bset); H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar); if (!H) return NULL; isl_mat_sub_copy(bset->ctx, H->row, bset->eq, bset->n_eq, 0, 1 + isl_space_offset(bset->dim, isl_dim_set), nvar); isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq, 0, 1 + isl_space_offset(bset->dim, isl_dim_set), nvar); H = isl_mat_left_hermite(H, 0, &U, &Q); if (init_groups(&g, H) < 0) goto error; if (update_groups(&g, H) < 0) goto error; if (g.cnt[0] == nvar) { isl_mat_free(H); isl_mat_free(U); isl_mat_free(Q); clear_groups(&g); return isl_factorizer_identity(bset); } done = 0; n = 0; while (done != nvar) { int group = g.group[done]; for (i = 1; i < g.cnt[group]; ++i) { if (g.group[done + i] == group) continue; for (j = done + g.cnt[group]; j < nvar; ++j) if (g.group[j] == group) break; if (j == nvar) isl_die(bset->ctx, isl_error_internal, "internal error", goto error); g.group[j] = g.group[done + i]; Q = isl_mat_swap_rows(Q, done + i, j); U = isl_mat_swap_cols(U, done + i, j); } done += g.cnt[group]; g.pos[n++] = g.cnt[group]; } f = isl_factorizer_groups(bset, Q, U, n, g.pos); isl_mat_free(H); clear_groups(&g); return f; error: isl_mat_free(H); isl_mat_free(U); isl_mat_free(Q); clear_groups(&g); return NULL; } cloog-0.18.2/isl/isl_deprecated.c0000664000175000017500000000043012254313240013523 00000000000000#include /* This function was never documented and has been replaced by * isl_basic_set_add_dims. */ __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned n) { return isl_basic_set_add_dims(bset, type, n); } cloog-0.18.2/isl/isl_val_gmp.c0000664000175000017500000000600612254313240013055 00000000000000#include #include #include /* Return a reference to an isl_val representing the integer "z". */ __isl_give isl_val *isl_val_int_from_gmp(isl_ctx *ctx, mpz_t z) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set(v->n, z); isl_int_set_si(v->d, 1); return v; } /* Return a reference to an isl_val representing the rational value "n"/"d". */ __isl_give isl_val *isl_val_from_gmp(isl_ctx *ctx, const mpz_t n, const mpz_t d) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set(v->n, n); isl_int_set(v->d, d); return isl_val_normalize(v); } /* Extract the numerator of a rational value "v" in "z". * * If "v" is not a rational value, then the result is undefined. */ int isl_val_get_num_gmp(__isl_keep isl_val *v, mpz_t z) { if (!v) return -1; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return -1); mpz_set(z, v->n); return 0; } /* Extract the denominator of a rational value "v" in "z". * * If "v" is not a rational value, then the result is undefined. */ int isl_val_get_den_gmp(__isl_keep isl_val *v, mpz_t z) { if (!v) return -1; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return -1); mpz_set(z, v->d); return 0; } /* Return a reference to an isl_val representing the unsigned * integer value stored in the "n" chunks of size "size" at "chunks". * The least significant chunk is assumed to be stored first. */ __isl_give isl_val *isl_val_int_from_chunks(isl_ctx *ctx, size_t n, size_t size, const void *chunks) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; mpz_import(v->n, n, -1, size, 0, 0, chunks); isl_int_set_si(v->d, 1); return v; } /* Return the number of chunks of size "size" required to * store the absolute value of the numerator of "v". */ size_t isl_val_n_abs_num_chunks(__isl_keep isl_val *v, size_t size) { if (!v) return 0; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return 0); size *= 8; return (mpz_sizeinbase(v->n, 2) + size - 1) / size; } /* Store a representation of the absolute value of the numerator of "v" * in terms of chunks of size "size" at "chunks". * The least significant chunk is stored first. * The number of chunks in the result can be obtained by calling * isl_val_n_abs_num_chunks. The user is responsible for allocating * enough memory to store the results. * * In the special case of a zero value, isl_val_n_abs_num_chunks will * return one, while mpz_export will not fill in any chunks. We therefore * do it ourselves. */ int isl_val_get_abs_num_chunks(__isl_keep isl_val *v, size_t size, void *chunks) { if (!v || !chunks) return -1; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return -1); mpz_export(chunks, NULL, -1, size, 0, 0, v->n); if (isl_val_is_zero(v)) memset(chunks, 0, size); return 0; } cloog-0.18.2/isl/isl_set_list.c0000664000175000017500000000041512254313240013254 00000000000000#include #undef EL #define EL isl_basic_set #include #undef EL #define EL isl_set #include #undef BASE #define BASE basic_set #include #undef BASE #define BASE set #include cloog-0.18.2/isl/isl_space.c0000664000175000017500000013226312254313240012530 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include #include #include isl_ctx *isl_space_get_ctx(__isl_keep isl_space *dim) { return dim ? dim->ctx : NULL; } __isl_give isl_space *isl_space_alloc(isl_ctx *ctx, unsigned nparam, unsigned n_in, unsigned n_out) { isl_space *dim; dim = isl_alloc_type(ctx, struct isl_space); if (!dim) return NULL; dim->ctx = ctx; isl_ctx_ref(ctx); dim->ref = 1; dim->nparam = nparam; dim->n_in = n_in; dim->n_out = n_out; dim->tuple_id[0] = NULL; dim->tuple_id[1] = NULL; dim->nested[0] = NULL; dim->nested[1] = NULL; dim->n_id = 0; dim->ids = NULL; return dim; } /* Mark the space as being that of a set, by setting the domain tuple * to isl_id_none. */ static __isl_give isl_space *mark_as_set(__isl_take isl_space *space) { space = isl_space_cow(space); if (!space) return NULL; space = isl_space_set_tuple_id(space, isl_dim_in, &isl_id_none); return space; } /* Is the space that of a set? */ int isl_space_is_set(__isl_keep isl_space *space) { if (!space) return -1; if (space->n_in != 0 || space->nested[0]) return 0; if (space->tuple_id[0] != &isl_id_none) return 0; return 1; } /* Is the given space that of a map? */ int isl_space_is_map(__isl_keep isl_space *space) { if (!space) return -1; return space->tuple_id[0] != &isl_id_none && space->tuple_id[1] != &isl_id_none; } __isl_give isl_space *isl_space_set_alloc(isl_ctx *ctx, unsigned nparam, unsigned dim) { isl_space *space; space = isl_space_alloc(ctx, nparam, 0, dim); space = mark_as_set(space); return space; } /* Mark the space as being that of a parameter domain, by setting * both tuples to isl_id_none. */ static __isl_give isl_space *mark_as_params(isl_space *space) { if (!space) return NULL; space = isl_space_set_tuple_id(space, isl_dim_in, &isl_id_none); space = isl_space_set_tuple_id(space, isl_dim_out, &isl_id_none); return space; } /* Is the space that of a parameter domain? */ int isl_space_is_params(__isl_keep isl_space *space) { if (!space) return -1; if (space->n_in != 0 || space->nested[0] || space->n_out != 0 || space->nested[1]) return 0; if (space->tuple_id[0] != &isl_id_none) return 0; if (space->tuple_id[1] != &isl_id_none) return 0; return 1; } /* Create a space for a parameter domain. */ __isl_give isl_space *isl_space_params_alloc(isl_ctx *ctx, unsigned nparam) { isl_space *space; space = isl_space_alloc(ctx, nparam, 0, 0); space = mark_as_params(space); return space; } static unsigned global_pos(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { struct isl_ctx *ctx = dim->ctx; switch (type) { case isl_dim_param: isl_assert(ctx, pos < dim->nparam, return isl_space_dim(dim, isl_dim_all)); return pos; case isl_dim_in: isl_assert(ctx, pos < dim->n_in, return isl_space_dim(dim, isl_dim_all)); return pos + dim->nparam; case isl_dim_out: isl_assert(ctx, pos < dim->n_out, return isl_space_dim(dim, isl_dim_all)); return pos + dim->nparam + dim->n_in; default: isl_assert(ctx, 0, return isl_space_dim(dim, isl_dim_all)); } return isl_space_dim(dim, isl_dim_all); } /* Extend length of ids array to the total number of dimensions. */ static __isl_give isl_space *extend_ids(__isl_take isl_space *dim) { isl_id **ids; int i; if (isl_space_dim(dim, isl_dim_all) <= dim->n_id) return dim; if (!dim->ids) { dim->ids = isl_calloc_array(dim->ctx, isl_id *, isl_space_dim(dim, isl_dim_all)); if (!dim->ids) goto error; } else { ids = isl_realloc_array(dim->ctx, dim->ids, isl_id *, isl_space_dim(dim, isl_dim_all)); if (!ids) goto error; dim->ids = ids; for (i = dim->n_id; i < isl_space_dim(dim, isl_dim_all); ++i) dim->ids[i] = NULL; } dim->n_id = isl_space_dim(dim, isl_dim_all); return dim; error: isl_space_free(dim); return NULL; } static __isl_give isl_space *set_id(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { dim = isl_space_cow(dim); if (!dim) goto error; pos = global_pos(dim, type, pos); if (pos == isl_space_dim(dim, isl_dim_all)) goto error; if (pos >= dim->n_id) { if (!id) return dim; dim = extend_ids(dim); if (!dim) goto error; } dim->ids[pos] = id; return dim; error: isl_id_free(id); isl_space_free(dim); return NULL; } static __isl_keep isl_id *get_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { if (!dim) return NULL; pos = global_pos(dim, type, pos); if (pos == isl_space_dim(dim, isl_dim_all)) return NULL; if (pos >= dim->n_id) return NULL; return dim->ids[pos]; } static unsigned offset(__isl_keep isl_space *dim, enum isl_dim_type type) { switch (type) { case isl_dim_param: return 0; case isl_dim_in: return dim->nparam; case isl_dim_out: return dim->nparam + dim->n_in; default: return 0; } } static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type) { switch (type) { case isl_dim_param: return dim->nparam; case isl_dim_in: return dim->n_in; case isl_dim_out: return dim->n_out; case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out; default: return 0; } } unsigned isl_space_dim(__isl_keep isl_space *dim, enum isl_dim_type type) { if (!dim) return 0; return n(dim, type); } unsigned isl_space_offset(__isl_keep isl_space *dim, enum isl_dim_type type) { if (!dim) return 0; return offset(dim, type); } static __isl_give isl_space *copy_ids(__isl_take isl_space *dst, enum isl_dim_type dst_type, unsigned offset, __isl_keep isl_space *src, enum isl_dim_type src_type) { int i; isl_id *id; if (!dst) return NULL; for (i = 0; i < n(src, src_type); ++i) { id = get_id(src, src_type, i); if (!id) continue; dst = set_id(dst, dst_type, offset + i, isl_id_copy(id)); if (!dst) return NULL; } return dst; } __isl_take isl_space *isl_space_dup(__isl_keep isl_space *dim) { isl_space *dup; if (!dim) return NULL; dup = isl_space_alloc(dim->ctx, dim->nparam, dim->n_in, dim->n_out); if (!dup) return NULL; if (dim->tuple_id[0] && !(dup->tuple_id[0] = isl_id_copy(dim->tuple_id[0]))) goto error; if (dim->tuple_id[1] && !(dup->tuple_id[1] = isl_id_copy(dim->tuple_id[1]))) goto error; if (dim->nested[0] && !(dup->nested[0] = isl_space_copy(dim->nested[0]))) goto error; if (dim->nested[1] && !(dup->nested[1] = isl_space_copy(dim->nested[1]))) goto error; if (!dim->ids) return dup; dup = copy_ids(dup, isl_dim_param, 0, dim, isl_dim_param); dup = copy_ids(dup, isl_dim_in, 0, dim, isl_dim_in); dup = copy_ids(dup, isl_dim_out, 0, dim, isl_dim_out); return dup; error: isl_space_free(dup); return NULL; } __isl_give isl_space *isl_space_cow(__isl_take isl_space *dim) { if (!dim) return NULL; if (dim->ref == 1) return dim; dim->ref--; return isl_space_dup(dim); } __isl_give isl_space *isl_space_copy(__isl_keep isl_space *dim) { if (!dim) return NULL; dim->ref++; return dim; } void *isl_space_free(__isl_take isl_space *dim) { int i; if (!dim) return NULL; if (--dim->ref > 0) return NULL; isl_id_free(dim->tuple_id[0]); isl_id_free(dim->tuple_id[1]); isl_space_free(dim->nested[0]); isl_space_free(dim->nested[1]); for (i = 0; i < dim->n_id; ++i) isl_id_free(dim->ids[i]); free(dim->ids); isl_ctx_deref(dim->ctx); free(dim); return NULL; } /* Check if "s" is a valid dimension or tuple name. * We currently only forbid names that look like a number. * * s is assumed to be non-NULL. */ static int name_ok(isl_ctx *ctx, const char *s) { char *p; long dummy; dummy = strtol(s, &p, 0); if (p != s) isl_die(ctx, isl_error_invalid, "name looks like a number", return 0); return 1; } /* Is it possible for the given dimension type to have a tuple id? */ static int space_can_have_id(__isl_keep isl_space *space, enum isl_dim_type type) { if (!space) return 0; if (isl_space_is_params(space)) isl_die(space->ctx, isl_error_invalid, "parameter spaces don't have tuple ids", return 0); if (isl_space_is_set(space) && type != isl_dim_set) isl_die(space->ctx, isl_error_invalid, "set spaces can only have a set id", return 0); if (type != isl_dim_in && type != isl_dim_out) isl_die(space->ctx, isl_error_invalid, "only input, output and set tuples can have ids", return 0); return 1; } /* Does the tuple have an id? */ int isl_space_has_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type) { if (!space_can_have_id(dim, type)) return -1; return dim->tuple_id[type - isl_dim_in] != NULL; } __isl_give isl_id *isl_space_get_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type) { int has_id; if (!dim) return NULL; has_id = isl_space_has_tuple_id(dim, type); if (has_id < 0) return NULL; if (!has_id) isl_die(dim->ctx, isl_error_invalid, "tuple has no id", return NULL); return isl_id_copy(dim->tuple_id[type - isl_dim_in]); } __isl_give isl_space *isl_space_set_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type, __isl_take isl_id *id) { dim = isl_space_cow(dim); if (!dim || !id) goto error; if (type != isl_dim_in && type != isl_dim_out) isl_die(dim->ctx, isl_error_invalid, "only input, output and set tuples can have names", goto error); isl_id_free(dim->tuple_id[type - isl_dim_in]); dim->tuple_id[type - isl_dim_in] = id; return dim; error: isl_id_free(id); isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_reset_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type) { dim = isl_space_cow(dim); if (!dim) return NULL; if (type != isl_dim_in && type != isl_dim_out) isl_die(dim->ctx, isl_error_invalid, "only input, output and set tuples can have names", goto error); isl_id_free(dim->tuple_id[type - isl_dim_in]); dim->tuple_id[type - isl_dim_in] = NULL; return dim; error: isl_space_free(dim); return NULL; } /* Set the id of the given dimension of "space" to "id". * If the dimension already has an id, then it is replaced. * If the dimension is a parameter, then we need to change it * in the nested spaces (if any) as well. */ __isl_give isl_space *isl_space_set_dim_id(__isl_take isl_space *space, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { space = isl_space_cow(space); if (!space || !id) goto error; if (type == isl_dim_param) { int i; for (i = 0; i < 2; ++i) { if (!space->nested[i]) continue; space->nested[i] = isl_space_set_dim_id(space->nested[i], type, pos, isl_id_copy(id)); if (!space->nested[i]) goto error; } } isl_id_free(get_id(space, type, pos)); return set_id(space, type, pos, id); error: isl_id_free(id); isl_space_free(space); return NULL; } /* Reset the id of the given dimension of "space". * If the dimension already has an id, then it is removed. * If the dimension is a parameter, then we need to reset it * in the nested spaces (if any) as well. */ __isl_give isl_space *isl_space_reset_dim_id(__isl_take isl_space *space, enum isl_dim_type type, unsigned pos) { space = isl_space_cow(space); if (!space) goto error; if (type == isl_dim_param) { int i; for (i = 0; i < 2; ++i) { if (!space->nested[i]) continue; space->nested[i] = isl_space_reset_dim_id(space->nested[i], type, pos); if (!space->nested[i]) goto error; } } isl_id_free(get_id(space, type, pos)); return set_id(space, type, pos, NULL); error: isl_space_free(space); return NULL; } int isl_space_has_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { if (!dim) return -1; return get_id(dim, type, pos) != NULL; } __isl_give isl_id *isl_space_get_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { if (!dim) return NULL; if (!get_id(dim, type, pos)) isl_die(dim->ctx, isl_error_invalid, "dim has no id", return NULL); return isl_id_copy(get_id(dim, type, pos)); } __isl_give isl_space *isl_space_set_tuple_name(__isl_take isl_space *dim, enum isl_dim_type type, const char *s) { isl_id *id; if (!dim) return NULL; if (!s) return isl_space_reset_tuple_id(dim, type); if (!name_ok(dim->ctx, s)) goto error; id = isl_id_alloc(dim->ctx, s, NULL); return isl_space_set_tuple_id(dim, type, id); error: isl_space_free(dim); return NULL; } /* Does the tuple have a name? */ int isl_space_has_tuple_name(__isl_keep isl_space *space, enum isl_dim_type type) { isl_id *id; if (!space_can_have_id(space, type)) return -1; id = space->tuple_id[type - isl_dim_in]; return id && id->name; } const char *isl_space_get_tuple_name(__isl_keep isl_space *dim, enum isl_dim_type type) { isl_id *id; if (!dim) return NULL; if (type != isl_dim_in && type != isl_dim_out) return NULL; id = dim->tuple_id[type - isl_dim_in]; return id ? id->name : NULL; } __isl_give isl_space *isl_space_set_dim_name(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, const char *s) { isl_id *id; if (!dim) return NULL; if (!s) return isl_space_reset_dim_id(dim, type, pos); if (!name_ok(dim->ctx, s)) goto error; id = isl_id_alloc(dim->ctx, s, NULL); return isl_space_set_dim_id(dim, type, pos, id); error: isl_space_free(dim); return NULL; } /* Does the given dimension have a name? */ int isl_space_has_dim_name(__isl_keep isl_space *space, enum isl_dim_type type, unsigned pos) { isl_id *id; if (!space) return -1; id = get_id(space, type, pos); return id && id->name; } __isl_keep const char *isl_space_get_dim_name(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { isl_id *id = get_id(dim, type, pos); return id ? id->name : NULL; } int isl_space_find_dim_by_id(__isl_keep isl_space *dim, enum isl_dim_type type, __isl_keep isl_id *id) { int i; int offset; int n; if (!dim || !id) return -1; offset = isl_space_offset(dim, type); n = isl_space_dim(dim, type); for (i = 0; i < n && offset + i < dim->n_id; ++i) if (dim->ids[offset + i] == id) return i; return -1; } int isl_space_find_dim_by_name(__isl_keep isl_space *space, enum isl_dim_type type, const char *name) { int i; int offset; int n; if (!space || !name) return -1; offset = isl_space_offset(space, type); n = isl_space_dim(space, type); for (i = 0; i < n && offset + i < space->n_id; ++i) if (space->ids[offset + i]->name && !strcmp(space->ids[offset + i]->name, name)) return i; return -1; } static __isl_keep isl_id *tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type) { if (!dim) return NULL; if (type == isl_dim_in) return dim->tuple_id[0]; if (type == isl_dim_out) return dim->tuple_id[1]; return NULL; } static __isl_keep isl_space *nested(__isl_keep isl_space *dim, enum isl_dim_type type) { if (!dim) return NULL; if (type == isl_dim_in) return dim->nested[0]; if (type == isl_dim_out) return dim->nested[1]; return NULL; } int isl_space_tuple_match(__isl_keep isl_space *dim1, enum isl_dim_type dim1_type, __isl_keep isl_space *dim2, enum isl_dim_type dim2_type) { isl_id *id1, *id2; isl_space *nested1, *nested2; if (!dim1 || !dim2) return -1; if (dim1 == dim2 && dim1_type == dim2_type) return 1; if (n(dim1, dim1_type) != n(dim2, dim2_type)) return 0; id1 = tuple_id(dim1, dim1_type); id2 = tuple_id(dim2, dim2_type); if (!id1 ^ !id2) return 0; if (id1 && id1 != id2) return 0; nested1 = nested(dim1, dim1_type); nested2 = nested(dim2, dim2_type); if (!nested1 ^ !nested2) return 0; if (nested1 && !isl_space_is_equal(nested1, nested2)) return 0; return 1; } static int match(__isl_keep isl_space *dim1, enum isl_dim_type dim1_type, __isl_keep isl_space *dim2, enum isl_dim_type dim2_type) { int i; if (dim1 == dim2 && dim1_type == dim2_type) return 1; if (!isl_space_tuple_match(dim1, dim1_type, dim2, dim2_type)) return 0; if (!dim1->ids && !dim2->ids) return 1; for (i = 0; i < n(dim1, dim1_type); ++i) { if (get_id(dim1, dim1_type, i) != get_id(dim2, dim2_type, i)) return 0; } return 1; } int isl_space_match(__isl_keep isl_space *dim1, enum isl_dim_type dim1_type, __isl_keep isl_space *dim2, enum isl_dim_type dim2_type) { if (!dim1 || !dim2) return -1; return match(dim1, dim1_type, dim2, dim2_type); } static void get_ids(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned first, unsigned n, __isl_keep isl_id **ids) { int i; for (i = 0; i < n ; ++i) ids[i] = get_id(dim, type, first + i); } __isl_give isl_space *isl_space_extend(__isl_take isl_space *dim, unsigned nparam, unsigned n_in, unsigned n_out) { isl_id **ids = NULL; if (!dim) return NULL; if (dim->nparam == nparam && dim->n_in == n_in && dim->n_out == n_out) return dim; isl_assert(dim->ctx, dim->nparam <= nparam, goto error); isl_assert(dim->ctx, dim->n_in <= n_in, goto error); isl_assert(dim->ctx, dim->n_out <= n_out, goto error); dim = isl_space_cow(dim); if (!dim) goto error; if (dim->ids) { ids = isl_calloc_array(dim->ctx, isl_id *, nparam + n_in + n_out); if (!ids) goto error; get_ids(dim, isl_dim_param, 0, dim->nparam, ids); get_ids(dim, isl_dim_in, 0, dim->n_in, ids + nparam); get_ids(dim, isl_dim_out, 0, dim->n_out, ids + nparam + n_in); free(dim->ids); dim->ids = ids; dim->n_id = nparam + n_in + n_out; } dim->nparam = nparam; dim->n_in = n_in; dim->n_out = n_out; return dim; error: free(ids); isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_add_dims(__isl_take isl_space *dim, enum isl_dim_type type, unsigned n) { if (!dim) return NULL; dim = isl_space_reset(dim, type); switch (type) { case isl_dim_param: dim = isl_space_extend(dim, dim->nparam + n, dim->n_in, dim->n_out); if (dim && dim->nested[0] && !(dim->nested[0] = isl_space_add_dims(dim->nested[0], isl_dim_param, n))) goto error; if (dim && dim->nested[1] && !(dim->nested[1] = isl_space_add_dims(dim->nested[1], isl_dim_param, n))) goto error; return dim; case isl_dim_in: return isl_space_extend(dim, dim->nparam, dim->n_in + n, dim->n_out); case isl_dim_out: return isl_space_extend(dim, dim->nparam, dim->n_in, dim->n_out + n); default: isl_die(dim->ctx, isl_error_invalid, "cannot add dimensions of specified type", goto error); } error: isl_space_free(dim); return NULL; } static int valid_dim_type(enum isl_dim_type type) { switch (type) { case isl_dim_param: case isl_dim_in: case isl_dim_out: return 1; default: return 0; } } /* Insert "n" dimensions of type "type" at position "pos". * If we are inserting parameters, then they are also inserted in * any nested spaces. */ __isl_give isl_space *isl_space_insert_dims(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, unsigned n) { isl_id **ids = NULL; if (!dim) return NULL; if (n == 0) return isl_space_reset(dim, type); if (!valid_dim_type(type)) isl_die(dim->ctx, isl_error_invalid, "cannot insert dimensions of specified type", goto error); isl_assert(dim->ctx, pos <= isl_space_dim(dim, type), goto error); dim = isl_space_cow(dim); if (!dim) return NULL; if (dim->ids) { enum isl_dim_type t, o = isl_dim_param; int off; int s[3]; ids = isl_calloc_array(dim->ctx, isl_id *, dim->nparam + dim->n_in + dim->n_out + n); if (!ids) goto error; off = 0; s[isl_dim_param - o] = dim->nparam; s[isl_dim_in - o] = dim->n_in; s[isl_dim_out - o] = dim->n_out; for (t = isl_dim_param; t <= isl_dim_out; ++t) { if (t != type) { get_ids(dim, t, 0, s[t - o], ids + off); off += s[t - o]; } else { get_ids(dim, t, 0, pos, ids + off); off += pos + n; get_ids(dim, t, pos, s[t - o] - pos, ids + off); off += s[t - o] - pos; } } free(dim->ids); dim->ids = ids; dim->n_id = dim->nparam + dim->n_in + dim->n_out + n; } switch (type) { case isl_dim_param: dim->nparam += n; break; case isl_dim_in: dim->n_in += n; break; case isl_dim_out: dim->n_out += n; break; default: ; } dim = isl_space_reset(dim, type); if (type == isl_dim_param) { if (dim && dim->nested[0] && !(dim->nested[0] = isl_space_insert_dims(dim->nested[0], isl_dim_param, pos, n))) goto error; if (dim && dim->nested[1] && !(dim->nested[1] = isl_space_insert_dims(dim->nested[1], isl_dim_param, pos, n))) goto error; } return dim; error: isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_move_dims(__isl_take isl_space *dim, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { int i; if (!dim) return NULL; if (n == 0) return dim; isl_assert(dim->ctx, src_pos + n <= isl_space_dim(dim, src_type), goto error); if (dst_type == src_type && dst_pos == src_pos) return dim; isl_assert(dim->ctx, dst_type != src_type, goto error); dim = isl_space_reset(dim, src_type); dim = isl_space_reset(dim, dst_type); dim = isl_space_cow(dim); if (!dim) return NULL; if (dim->ids) { isl_id **ids; enum isl_dim_type t, o = isl_dim_param; int off; int s[3]; ids = isl_calloc_array(dim->ctx, isl_id *, dim->nparam + dim->n_in + dim->n_out); if (!ids) goto error; off = 0; s[isl_dim_param - o] = dim->nparam; s[isl_dim_in - o] = dim->n_in; s[isl_dim_out - o] = dim->n_out; for (t = isl_dim_param; t <= isl_dim_out; ++t) { if (t == dst_type) { get_ids(dim, t, 0, dst_pos, ids + off); off += dst_pos; get_ids(dim, src_type, src_pos, n, ids + off); off += n; get_ids(dim, t, dst_pos, s[t - o] - dst_pos, ids + off); off += s[t - o] - dst_pos; } else if (t == src_type) { get_ids(dim, t, 0, src_pos, ids + off); off += src_pos; get_ids(dim, t, src_pos + n, s[t - o] - src_pos - n, ids + off); off += s[t - o] - src_pos - n; } else { get_ids(dim, t, 0, s[t - o], ids + off); off += s[t - o]; } } free(dim->ids); dim->ids = ids; dim->n_id = dim->nparam + dim->n_in + dim->n_out; } switch (dst_type) { case isl_dim_param: dim->nparam += n; break; case isl_dim_in: dim->n_in += n; break; case isl_dim_out: dim->n_out += n; break; default: ; } switch (src_type) { case isl_dim_param: dim->nparam -= n; break; case isl_dim_in: dim->n_in -= n; break; case isl_dim_out: dim->n_out -= n; break; default: ; } if (dst_type != isl_dim_param && src_type != isl_dim_param) return dim; for (i = 0; i < 2; ++i) { if (!dim->nested[i]) continue; dim->nested[i] = isl_space_replace(dim->nested[i], isl_dim_param, dim); if (!dim->nested[i]) goto error; } return dim; error: isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_join(__isl_take isl_space *left, __isl_take isl_space *right) { isl_space *dim; if (!left || !right) goto error; isl_assert(left->ctx, match(left, isl_dim_param, right, isl_dim_param), goto error); isl_assert(left->ctx, isl_space_tuple_match(left, isl_dim_out, right, isl_dim_in), goto error); dim = isl_space_alloc(left->ctx, left->nparam, left->n_in, right->n_out); if (!dim) goto error; dim = copy_ids(dim, isl_dim_param, 0, left, isl_dim_param); dim = copy_ids(dim, isl_dim_in, 0, left, isl_dim_in); dim = copy_ids(dim, isl_dim_out, 0, right, isl_dim_out); if (dim && left->tuple_id[0] && !(dim->tuple_id[0] = isl_id_copy(left->tuple_id[0]))) goto error; if (dim && right->tuple_id[1] && !(dim->tuple_id[1] = isl_id_copy(right->tuple_id[1]))) goto error; if (dim && left->nested[0] && !(dim->nested[0] = isl_space_copy(left->nested[0]))) goto error; if (dim && right->nested[1] && !(dim->nested[1] = isl_space_copy(right->nested[1]))) goto error; isl_space_free(left); isl_space_free(right); return dim; error: isl_space_free(left); isl_space_free(right); return NULL; } __isl_give isl_space *isl_space_product(__isl_take isl_space *left, __isl_take isl_space *right) { isl_space *dom1, *dom2, *nest1, *nest2; if (!left || !right) goto error; isl_assert(left->ctx, match(left, isl_dim_param, right, isl_dim_param), goto error); dom1 = isl_space_domain(isl_space_copy(left)); dom2 = isl_space_domain(isl_space_copy(right)); nest1 = isl_space_wrap(isl_space_join(isl_space_reverse(dom1), dom2)); dom1 = isl_space_range(left); dom2 = isl_space_range(right); nest2 = isl_space_wrap(isl_space_join(isl_space_reverse(dom1), dom2)); return isl_space_join(isl_space_reverse(nest1), nest2); error: isl_space_free(left); isl_space_free(right); return NULL; } /* Given two spaces { A -> C } and { B -> C }, construct the space * { [A -> B] -> C } */ __isl_give isl_space *isl_space_domain_product(__isl_take isl_space *left, __isl_take isl_space *right) { isl_space *ran, *dom1, *dom2, *nest; if (!left || !right) goto error; if (!match(left, isl_dim_param, right, isl_dim_param)) isl_die(left->ctx, isl_error_invalid, "parameters need to match", goto error); if (!isl_space_tuple_match(left, isl_dim_out, right, isl_dim_out)) isl_die(left->ctx, isl_error_invalid, "ranges need to match", goto error); ran = isl_space_range(isl_space_copy(left)); dom1 = isl_space_domain(left); dom2 = isl_space_domain(right); nest = isl_space_wrap(isl_space_join(isl_space_reverse(dom1), dom2)); return isl_space_join(isl_space_reverse(nest), ran); error: isl_space_free(left); isl_space_free(right); return NULL; } __isl_give isl_space *isl_space_range_product(__isl_take isl_space *left, __isl_take isl_space *right) { isl_space *dom, *ran1, *ran2, *nest; if (!left || !right) goto error; isl_assert(left->ctx, match(left, isl_dim_param, right, isl_dim_param), goto error); if (!isl_space_tuple_match(left, isl_dim_in, right, isl_dim_in)) isl_die(left->ctx, isl_error_invalid, "domains need to match", goto error); dom = isl_space_domain(isl_space_copy(left)); ran1 = isl_space_range(left); ran2 = isl_space_range(right); nest = isl_space_wrap(isl_space_join(isl_space_reverse(ran1), ran2)); return isl_space_join(isl_space_reverse(dom), nest); error: isl_space_free(left); isl_space_free(right); return NULL; } __isl_give isl_space *isl_space_map_from_set(__isl_take isl_space *dim) { isl_ctx *ctx; isl_id **ids = NULL; if (!dim) return NULL; ctx = isl_space_get_ctx(dim); if (!isl_space_is_set(dim)) isl_die(ctx, isl_error_invalid, "not a set space", goto error); dim = isl_space_cow(dim); if (!dim) return NULL; if (dim->ids) { ids = isl_calloc_array(dim->ctx, isl_id *, dim->nparam + dim->n_out + dim->n_out); if (!ids) goto error; get_ids(dim, isl_dim_param, 0, dim->nparam, ids); get_ids(dim, isl_dim_out, 0, dim->n_out, ids + dim->nparam); } dim->n_in = dim->n_out; if (ids) { free(dim->ids); dim->ids = ids; dim->n_id = dim->nparam + dim->n_out + dim->n_out; dim = copy_ids(dim, isl_dim_out, 0, dim, isl_dim_in); } isl_id_free(dim->tuple_id[0]); dim->tuple_id[0] = isl_id_copy(dim->tuple_id[1]); isl_space_free(dim->nested[0]); dim->nested[0] = isl_space_copy(dim->nested[1]); return dim; error: isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_map_from_domain_and_range( __isl_take isl_space *domain, __isl_take isl_space *range) { if (!domain || !range) goto error; if (!isl_space_is_set(domain)) isl_die(isl_space_get_ctx(domain), isl_error_invalid, "domain is not a set space", goto error); if (!isl_space_is_set(range)) isl_die(isl_space_get_ctx(range), isl_error_invalid, "range is not a set space", goto error); return isl_space_join(isl_space_reverse(domain), range); error: isl_space_free(domain); isl_space_free(range); return NULL; } static __isl_give isl_space *set_ids(__isl_take isl_space *dim, enum isl_dim_type type, unsigned first, unsigned n, __isl_take isl_id **ids) { int i; for (i = 0; i < n ; ++i) dim = set_id(dim, type, first + i, ids[i]); return dim; } __isl_give isl_space *isl_space_reverse(__isl_take isl_space *dim) { unsigned t; isl_space *nested; isl_id **ids = NULL; isl_id *id; if (!dim) return NULL; if (match(dim, isl_dim_in, dim, isl_dim_out)) return dim; dim = isl_space_cow(dim); if (!dim) return NULL; id = dim->tuple_id[0]; dim->tuple_id[0] = dim->tuple_id[1]; dim->tuple_id[1] = id; nested = dim->nested[0]; dim->nested[0] = dim->nested[1]; dim->nested[1] = nested; if (dim->ids) { int n_id = dim->n_in + dim->n_out; ids = isl_alloc_array(dim->ctx, isl_id *, n_id); if (n_id && !ids) goto error; get_ids(dim, isl_dim_in, 0, dim->n_in, ids); get_ids(dim, isl_dim_out, 0, dim->n_out, ids + dim->n_in); } t = dim->n_in; dim->n_in = dim->n_out; dim->n_out = t; if (dim->ids) { dim = set_ids(dim, isl_dim_out, 0, dim->n_out, ids); dim = set_ids(dim, isl_dim_in, 0, dim->n_in, ids + dim->n_out); free(ids); } return dim; error: free(ids); isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_drop_dims(__isl_take isl_space *dim, enum isl_dim_type type, unsigned first, unsigned num) { int i; if (!dim) return NULL; if (num == 0) return isl_space_reset(dim, type); if (!valid_dim_type(type)) isl_die(dim->ctx, isl_error_invalid, "cannot drop dimensions of specified type", goto error); isl_assert(dim->ctx, first + num <= n(dim, type), goto error); dim = isl_space_cow(dim); if (!dim) goto error; if (dim->ids) { dim = extend_ids(dim); if (!dim) goto error; for (i = 0; i < num; ++i) isl_id_free(get_id(dim, type, first + i)); for (i = first+num; i < n(dim, type); ++i) set_id(dim, type, i - num, get_id(dim, type, i)); switch (type) { case isl_dim_param: get_ids(dim, isl_dim_in, 0, dim->n_in, dim->ids + offset(dim, isl_dim_in) - num); case isl_dim_in: get_ids(dim, isl_dim_out, 0, dim->n_out, dim->ids + offset(dim, isl_dim_out) - num); default: ; } dim->n_id -= num; } switch (type) { case isl_dim_param: dim->nparam -= num; break; case isl_dim_in: dim->n_in -= num; break; case isl_dim_out: dim->n_out -= num; break; default: ; } dim = isl_space_reset(dim, type); if (type == isl_dim_param) { if (dim && dim->nested[0] && !(dim->nested[0] = isl_space_drop_dims(dim->nested[0], isl_dim_param, first, num))) goto error; if (dim && dim->nested[1] && !(dim->nested[1] = isl_space_drop_dims(dim->nested[1], isl_dim_param, first, num))) goto error; } return dim; error: isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_drop_inputs(__isl_take isl_space *dim, unsigned first, unsigned n) { if (!dim) return NULL; return isl_space_drop_dims(dim, isl_dim_in, first, n); } __isl_give isl_space *isl_space_drop_outputs(__isl_take isl_space *dim, unsigned first, unsigned n) { if (!dim) return NULL; return isl_space_drop_dims(dim, isl_dim_out, first, n); } __isl_give isl_space *isl_space_domain(__isl_take isl_space *dim) { if (!dim) return NULL; dim = isl_space_drop_outputs(dim, 0, dim->n_out); dim = isl_space_reverse(dim); dim = mark_as_set(dim); return dim; } __isl_give isl_space *isl_space_from_domain(__isl_take isl_space *dim) { if (!dim) return NULL; if (!isl_space_is_set(dim)) isl_die(isl_space_get_ctx(dim), isl_error_invalid, "not a set space", goto error); dim = isl_space_reverse(dim); dim = isl_space_reset(dim, isl_dim_out); return dim; error: isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_range(__isl_take isl_space *dim) { if (!dim) return NULL; dim = isl_space_drop_inputs(dim, 0, dim->n_in); dim = mark_as_set(dim); return dim; } __isl_give isl_space *isl_space_from_range(__isl_take isl_space *dim) { if (!dim) return NULL; if (!isl_space_is_set(dim)) isl_die(isl_space_get_ctx(dim), isl_error_invalid, "not a set space", goto error); return isl_space_reset(dim, isl_dim_in); error: isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_params(__isl_take isl_space *space) { if (isl_space_is_params(space)) return space; space = isl_space_drop_dims(space, isl_dim_in, 0, isl_space_dim(space, isl_dim_in)); space = isl_space_drop_dims(space, isl_dim_out, 0, isl_space_dim(space, isl_dim_out)); space = mark_as_params(space); return space; } __isl_give isl_space *isl_space_set_from_params(__isl_take isl_space *space) { if (!space) return NULL; if (!isl_space_is_params(space)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "not a parameter space", goto error); return isl_space_reset(space, isl_dim_set); error: isl_space_free(space); return NULL; } __isl_give isl_space *isl_space_as_set_space(__isl_take isl_space *dim) { dim = isl_space_cow(dim); if (!dim) return NULL; dim->n_out += dim->n_in; dim->n_in = 0; dim = isl_space_reset(dim, isl_dim_in); dim = isl_space_reset(dim, isl_dim_out); return dim; } __isl_give isl_space *isl_space_underlying(__isl_take isl_space *dim, unsigned n_div) { int i; if (!dim) return NULL; if (n_div == 0 && dim->nparam == 0 && dim->n_in == 0 && dim->n_id == 0) return isl_space_reset(isl_space_reset(dim, isl_dim_in), isl_dim_out); dim = isl_space_cow(dim); if (!dim) return NULL; dim->n_out += dim->nparam + dim->n_in + n_div; dim->nparam = 0; dim->n_in = 0; for (i = 0; i < dim->n_id; ++i) isl_id_free(get_id(dim, isl_dim_out, i)); dim->n_id = 0; dim = isl_space_reset(dim, isl_dim_in); dim = isl_space_reset(dim, isl_dim_out); return dim; } /* Are the two spaces the same, including positions and names of parameters? */ int isl_space_is_equal(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2) { if (!dim1 || !dim2) return -1; if (dim1 == dim2) return 1; return match(dim1, isl_dim_param, dim2, isl_dim_param) && isl_space_tuple_match(dim1, isl_dim_in, dim2, isl_dim_in) && isl_space_tuple_match(dim1, isl_dim_out, dim2, isl_dim_out); } /* Is space1 equal to the domain of space2? * * In the internal version we also allow space2 to be the space of a set, * provided space1 is a parameter space. */ int isl_space_is_domain_internal(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space1 || !space2) return -1; if (!isl_space_is_set(space1)) return 0; return match(space1, isl_dim_param, space2, isl_dim_param) && isl_space_tuple_match(space1, isl_dim_set, space2, isl_dim_in); } /* Is space1 equal to the domain of space2? */ int isl_space_is_domain(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space2) return -1; if (!isl_space_is_map(space2)) return 0; return isl_space_is_domain_internal(space1, space2); } /* Is space1 equal to the range of space2? * * In the internal version, space2 is allowed to be the space of a set, * in which case it should be equal to space1. */ int isl_space_is_range_internal(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space1 || !space2) return -1; if (!isl_space_is_set(space1)) return 0; return match(space1, isl_dim_param, space2, isl_dim_param) && isl_space_tuple_match(space1, isl_dim_set, space2, isl_dim_out); } /* Is space1 equal to the range of space2? */ int isl_space_is_range(__isl_keep isl_space *space1, __isl_keep isl_space *space2) { if (!space2) return -1; if (!isl_space_is_map(space2)) return 0; return isl_space_is_range_internal(space1, space2); } int isl_space_compatible(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2) { return dim1->nparam == dim2->nparam && dim1->n_in + dim1->n_out == dim2->n_in + dim2->n_out; } static uint32_t isl_hash_dim(uint32_t hash, __isl_keep isl_space *dim) { int i; isl_id *id; if (!dim) return hash; isl_hash_byte(hash, dim->nparam % 256); isl_hash_byte(hash, dim->n_in % 256); isl_hash_byte(hash, dim->n_out % 256); for (i = 0; i < dim->nparam; ++i) { id = get_id(dim, isl_dim_param, i); hash = isl_hash_id(hash, id); } id = tuple_id(dim, isl_dim_in); hash = isl_hash_id(hash, id); id = tuple_id(dim, isl_dim_out); hash = isl_hash_id(hash, id); hash = isl_hash_dim(hash, dim->nested[0]); hash = isl_hash_dim(hash, dim->nested[1]); return hash; } uint32_t isl_space_get_hash(__isl_keep isl_space *dim) { uint32_t hash; if (!dim) return 0; hash = isl_hash_init(); hash = isl_hash_dim(hash, dim); return hash; } int isl_space_is_wrapping(__isl_keep isl_space *dim) { if (!dim) return -1; if (!isl_space_is_set(dim)) return 0; return dim->nested[1] != NULL; } __isl_give isl_space *isl_space_wrap(__isl_take isl_space *dim) { isl_space *wrap; if (!dim) return NULL; wrap = isl_space_set_alloc(dim->ctx, dim->nparam, dim->n_in + dim->n_out); wrap = copy_ids(wrap, isl_dim_param, 0, dim, isl_dim_param); wrap = copy_ids(wrap, isl_dim_set, 0, dim, isl_dim_in); wrap = copy_ids(wrap, isl_dim_set, dim->n_in, dim, isl_dim_out); if (!wrap) goto error; wrap->nested[1] = dim; return wrap; error: isl_space_free(dim); return NULL; } __isl_give isl_space *isl_space_unwrap(__isl_take isl_space *dim) { isl_space *unwrap; if (!dim) return NULL; if (!isl_space_is_wrapping(dim)) isl_die(dim->ctx, isl_error_invalid, "not a wrapping space", goto error); unwrap = isl_space_copy(dim->nested[1]); isl_space_free(dim); return unwrap; error: isl_space_free(dim); return NULL; } int isl_space_is_named_or_nested(__isl_keep isl_space *dim, enum isl_dim_type type) { if (type != isl_dim_in && type != isl_dim_out) return 0; if (!dim) return -1; if (dim->tuple_id[type - isl_dim_in]) return 1; if (dim->nested[type - isl_dim_in]) return 1; return 0; } int isl_space_may_be_set(__isl_keep isl_space *dim) { if (!dim) return -1; if (isl_space_is_set(dim)) return 1; if (isl_space_dim(dim, isl_dim_in) != 0) return 0; if (isl_space_is_named_or_nested(dim, isl_dim_in)) return 0; return 1; } __isl_give isl_space *isl_space_reset(__isl_take isl_space *dim, enum isl_dim_type type) { if (!isl_space_is_named_or_nested(dim, type)) return dim; dim = isl_space_cow(dim); if (!dim) return NULL; isl_id_free(dim->tuple_id[type - isl_dim_in]); dim->tuple_id[type - isl_dim_in] = NULL; isl_space_free(dim->nested[type - isl_dim_in]); dim->nested[type - isl_dim_in] = NULL; return dim; } __isl_give isl_space *isl_space_flatten(__isl_take isl_space *dim) { if (!dim) return NULL; if (!dim->nested[0] && !dim->nested[1]) return dim; if (dim->nested[0]) dim = isl_space_reset(dim, isl_dim_in); if (dim && dim->nested[1]) dim = isl_space_reset(dim, isl_dim_out); return dim; } __isl_give isl_space *isl_space_flatten_domain(__isl_take isl_space *dim) { if (!dim) return NULL; if (!dim->nested[0]) return dim; return isl_space_reset(dim, isl_dim_in); } __isl_give isl_space *isl_space_flatten_range(__isl_take isl_space *dim) { if (!dim) return NULL; if (!dim->nested[1]) return dim; return isl_space_reset(dim, isl_dim_out); } /* Replace the dimensions of the given type of dst by those of src. */ __isl_give isl_space *isl_space_replace(__isl_take isl_space *dst, enum isl_dim_type type, __isl_keep isl_space *src) { dst = isl_space_cow(dst); if (!dst || !src) goto error; dst = isl_space_drop_dims(dst, type, 0, isl_space_dim(dst, type)); dst = isl_space_add_dims(dst, type, isl_space_dim(src, type)); dst = copy_ids(dst, type, 0, src, type); if (dst && type == isl_dim_param) { int i; for (i = 0; i <= 1; ++i) { if (!dst->nested[i]) continue; dst->nested[i] = isl_space_replace(dst->nested[i], type, src); if (!dst->nested[i]) goto error; } } return dst; error: isl_space_free(dst); return NULL; } /* Given a dimension specification "dim" of a set, create a dimension * specification for the lift of the set. In particular, the result * is of the form [dim -> local[..]], with n_local variables in the * range of the wrapped map. */ __isl_give isl_space *isl_space_lift(__isl_take isl_space *dim, unsigned n_local) { isl_space *local_dim; if (!dim) return NULL; local_dim = isl_space_dup(dim); local_dim = isl_space_drop_dims(local_dim, isl_dim_set, 0, dim->n_out); local_dim = isl_space_add_dims(local_dim, isl_dim_set, n_local); local_dim = isl_space_set_tuple_name(local_dim, isl_dim_set, "local"); dim = isl_space_join(isl_space_from_domain(dim), isl_space_from_range(local_dim)); dim = isl_space_wrap(dim); dim = isl_space_set_tuple_name(dim, isl_dim_set, "lifted"); return dim; } int isl_space_can_zip(__isl_keep isl_space *dim) { if (!dim) return -1; return dim->nested[0] && dim->nested[1]; } __isl_give isl_space *isl_space_zip(__isl_take isl_space *dim) { isl_space *dom, *ran; isl_space *dom_dom, *dom_ran, *ran_dom, *ran_ran; if (!isl_space_can_zip(dim)) isl_die(dim->ctx, isl_error_invalid, "dim cannot be zipped", goto error); if (!dim) return NULL; dom = isl_space_unwrap(isl_space_domain(isl_space_copy(dim))); ran = isl_space_unwrap(isl_space_range(dim)); dom_dom = isl_space_domain(isl_space_copy(dom)); dom_ran = isl_space_range(dom); ran_dom = isl_space_domain(isl_space_copy(ran)); ran_ran = isl_space_range(ran); dom = isl_space_join(isl_space_from_domain(dom_dom), isl_space_from_range(ran_dom)); ran = isl_space_join(isl_space_from_domain(dom_ran), isl_space_from_range(ran_ran)); return isl_space_join(isl_space_from_domain(isl_space_wrap(dom)), isl_space_from_range(isl_space_wrap(ran))); error: isl_space_free(dim); return NULL; } /* Can we apply isl_space_curry to "space"? * That is, does it have a nested relation in its domain? */ int isl_space_can_curry(__isl_keep isl_space *space) { if (!space) return -1; return !!space->nested[0]; } /* Given a space (A -> B) -> C, return the corresponding space * A -> (B -> C). */ __isl_give isl_space *isl_space_curry(__isl_take isl_space *space) { isl_space *dom, *ran; isl_space *dom_dom, *dom_ran; if (!space) return NULL; if (!isl_space_can_curry(space)) isl_die(space->ctx, isl_error_invalid, "space cannot be curried", goto error); dom = isl_space_unwrap(isl_space_domain(isl_space_copy(space))); ran = isl_space_range(space); dom_dom = isl_space_domain(isl_space_copy(dom)); dom_ran = isl_space_range(dom); ran = isl_space_join(isl_space_from_domain(dom_ran), isl_space_from_range(ran)); return isl_space_join(isl_space_from_domain(dom_dom), isl_space_from_range(isl_space_wrap(ran))); error: isl_space_free(space); return NULL; } /* Can we apply isl_space_uncurry to "space"? * That is, does it have a nested relation in its range? */ int isl_space_can_uncurry(__isl_keep isl_space *space) { if (!space) return -1; return !!space->nested[1]; } /* Given a space A -> (B -> C), return the corresponding space * (A -> B) -> C. */ __isl_give isl_space *isl_space_uncurry(__isl_take isl_space *space) { isl_space *dom, *ran; isl_space *ran_dom, *ran_ran; if (!space) return NULL; if (!isl_space_can_uncurry(space)) isl_die(space->ctx, isl_error_invalid, "space cannot be uncurried", return isl_space_free(space)); dom = isl_space_domain(isl_space_copy(space)); ran = isl_space_unwrap(isl_space_range(space)); ran_dom = isl_space_domain(isl_space_copy(ran)); ran_ran = isl_space_range(ran); dom = isl_space_join(isl_space_from_domain(dom), isl_space_from_range(ran_dom)); return isl_space_join(isl_space_from_domain(isl_space_wrap(dom)), isl_space_from_range(ran_ran)); } int isl_space_has_named_params(__isl_keep isl_space *dim) { int i; unsigned off; if (!dim) return -1; if (dim->nparam == 0) return 1; off = isl_space_offset(dim, isl_dim_param); if (off + dim->nparam > dim->n_id) return 0; for (i = 0; i < dim->nparam; ++i) if (!dim->ids[off + i]) return 0; return 1; } /* Align the initial parameters of dim1 to match the order in dim2. */ __isl_give isl_space *isl_space_align_params(__isl_take isl_space *dim1, __isl_take isl_space *dim2) { isl_reordering *exp; if (!isl_space_has_named_params(dim1) || !isl_space_has_named_params(dim2)) isl_die(isl_space_get_ctx(dim1), isl_error_invalid, "parameter alignment requires named parameters", goto error); dim2 = isl_space_params(dim2); exp = isl_parameter_alignment_reordering(dim1, dim2); exp = isl_reordering_extend_space(exp, dim1); isl_space_free(dim2); if (!exp) return NULL; dim1 = isl_space_copy(exp->dim); isl_reordering_free(exp); return dim1; error: isl_space_free(dim1); isl_space_free(dim2); return NULL; } /* Given the space of set (domain), construct a space for a map * with as domain the given space and as range the range of "model". */ __isl_give isl_space *isl_space_extend_domain_with_range( __isl_take isl_space *space, __isl_take isl_space *model) { if (!model) goto error; space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, isl_space_dim(model, isl_dim_out)); if (isl_space_has_tuple_id(model, isl_dim_out)) space = isl_space_set_tuple_id(space, isl_dim_out, isl_space_get_tuple_id(model, isl_dim_out)); if (!space) goto error; if (model->nested[1]) { isl_space *nested = isl_space_copy(model->nested[1]); int n_nested, n_space; nested = isl_space_align_params(nested, isl_space_copy(space)); n_nested = isl_space_dim(nested, isl_dim_param); n_space = isl_space_dim(space, isl_dim_param); if (n_nested > n_space) nested = isl_space_drop_dims(nested, isl_dim_param, n_space, n_nested - n_space); if (!nested) goto error; space->nested[1] = nested; } isl_space_free(model); return space; error: isl_space_free(model); isl_space_free(space); return NULL; } cloog-0.18.2/isl/isl_union_templ.c0000664000175000017500000004622012254313240013763 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) #define xS(TYPE,NAME) struct TYPE ## _ ## NAME #define S(TYPE,NAME) xS(TYPE,NAME) struct UNION { int ref; #ifdef HAS_TYPE enum isl_fold type; #endif isl_space *dim; struct isl_hash_table table; }; __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u); isl_ctx *FN(UNION,get_ctx)(__isl_keep UNION *u) { return u ? u->dim->ctx : NULL; } __isl_give isl_space *FN(UNION,get_space)(__isl_keep UNION *u) { if (!u) return NULL; return isl_space_copy(u->dim); } #ifdef HAS_TYPE static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_space *dim, enum isl_fold type, int size) #else static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_space *dim, int size) #endif { UNION *u; dim = isl_space_params(dim); if (!dim) return NULL; u = isl_calloc_type(dim->ctx, UNION); if (!u) return NULL; u->ref = 1; #ifdef HAS_TYPE u->type = type; #endif u->dim = dim; if (isl_hash_table_init(dim->ctx, &u->table, size) < 0) goto error; return u; error: isl_space_free(dim); FN(UNION,free)(u); return NULL; } #ifdef HAS_TYPE __isl_give UNION *FN(UNION,ZERO)(__isl_take isl_space *dim, enum isl_fold type) { return FN(UNION,alloc)(dim, type, 16); } #else __isl_give UNION *FN(UNION,ZERO)(__isl_take isl_space *dim) { return FN(UNION,alloc)(dim, 16); } #endif __isl_give UNION *FN(UNION,copy)(__isl_keep UNION *u) { if (!u) return NULL; u->ref++; return u; } S(UNION,foreach_data) { int (*fn)(__isl_take PART *part, void *user); void *user; }; static int call_on_copy(void **entry, void *user) { PART *part = *entry; S(UNION,foreach_data) *data = (S(UNION,foreach_data) *)user; return data->fn(FN(PART,copy)(part), data->user); } int FN(FN(UNION,foreach),PARTS)(__isl_keep UNION *u, int (*fn)(__isl_take PART *part, void *user), void *user) { S(UNION,foreach_data) data = { fn, user }; if (!u) return -1; return isl_hash_table_foreach(u->dim->ctx, &u->table, &call_on_copy, &data); } static int has_dim(const void *entry, const void *val) { PART *part = (PART *)entry; isl_space *dim = (isl_space *)val; return isl_space_is_equal(part->dim, dim); } __isl_give PART *FN(FN(UNION,extract),PARTS)(__isl_keep UNION *u, __isl_take isl_space *dim) { uint32_t hash; struct isl_hash_table_entry *entry; if (!u || !dim) goto error; hash = isl_space_get_hash(dim); entry = isl_hash_table_find(u->dim->ctx, &u->table, hash, &has_dim, dim, 0); if (!entry) #ifdef HAS_TYPE return FN(PART,ZERO)(dim, u->type); #else return FN(PART,ZERO)(dim); #endif isl_space_free(dim); return FN(PART,copy)(entry->data); error: isl_space_free(dim); return NULL; } __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u, __isl_take PART *part) { uint32_t hash; struct isl_hash_table_entry *entry; if (!part) goto error; if (DEFAULT_IS_ZERO && FN(PART,IS_ZERO)(part)) { FN(PART,free)(part); return u; } u = FN(UNION,cow)(u); if (!u) goto error; isl_assert(u->dim->ctx, isl_space_match(part->dim, isl_dim_param, u->dim, isl_dim_param), goto error); hash = isl_space_get_hash(part->dim); entry = isl_hash_table_find(u->dim->ctx, &u->table, hash, &has_dim, part->dim, 1); if (!entry) goto error; if (!entry->data) entry->data = part; else { entry->data = FN(PART,add)(entry->data, FN(PART,copy)(part)); if (!entry->data) goto error; FN(PART,free)(part); if (DEFAULT_IS_ZERO && FN(PART,IS_ZERO)(entry->data)) { FN(PART,free)(entry->data); isl_hash_table_remove(u->dim->ctx, &u->table, entry); } } return u; error: FN(PART,free)(part); FN(UNION,free)(u); return NULL; } static int add_part(__isl_take PART *part, void *user) { UNION **u = (UNION **)user; *u = FN(FN(UNION,add),PARTS)(*u, part); return 0; } __isl_give UNION *FN(UNION,dup)(__isl_keep UNION *u) { UNION *dup; if (!u) return NULL; #ifdef HAS_TYPE dup = FN(UNION,ZERO)(isl_space_copy(u->dim), u->type); #else dup = FN(UNION,ZERO)(isl_space_copy(u->dim)); #endif if (FN(FN(UNION,foreach),PARTS)(u, &add_part, &dup) < 0) goto error; return dup; error: FN(UNION,free)(dup); return NULL; } __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u) { if (!u) return NULL; if (u->ref == 1) return u; u->ref--; return FN(UNION,dup)(u); } static int free_u_entry(void **entry, void *user) { PART *part = *entry; FN(PART,free)(part); return 0; } void *FN(UNION,free)(__isl_take UNION *u) { if (!u) return NULL; if (--u->ref > 0) return NULL; isl_hash_table_foreach(u->dim->ctx, &u->table, &free_u_entry, NULL); isl_hash_table_clear(&u->table); isl_space_free(u->dim); free(u); return NULL; } S(UNION,align) { isl_reordering *exp; UNION *res; }; #ifdef ALIGN_DOMAIN static int align_entry(__isl_take PART *part, void *user) { isl_reordering *exp; S(UNION,align) *data = user; exp = isl_reordering_extend_space(isl_reordering_copy(data->exp), FN(PART,get_domain_space)(part)); data->res = FN(FN(UNION,add),PARTS)(data->res, FN(PART,realign_domain)(part, exp)); return 0; } #else static int align_entry(__isl_take PART *part, void *user) { isl_reordering *exp; S(UNION,align) *data = user; exp = isl_reordering_extend_space(isl_reordering_copy(data->exp), FN(PART,get_space)(part)); data->res = FN(FN(UNION,add),PARTS)(data->res, FN(PART,realign)(part, exp)); return 0; } #endif __isl_give UNION *FN(UNION,align_params)(__isl_take UNION *u, __isl_take isl_space *model) { S(UNION,align) data = { NULL, NULL }; if (!u || !model) goto error; if (isl_space_match(u->dim, isl_dim_param, model, isl_dim_param)) { isl_space_free(model); return u; } data.exp = isl_parameter_alignment_reordering(u->dim, model); if (!data.exp) goto error; #ifdef HAS_TYPE data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim), u->type, u->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim), u->table.n); #endif if (FN(FN(UNION,foreach),PARTS)(u, &align_entry, &data) < 0) goto error; isl_reordering_free(data.exp); FN(UNION,free)(u); isl_space_free(model); return data.res; error: isl_reordering_free(data.exp); FN(UNION,free)(u); FN(UNION,free)(data.res); isl_space_free(model); return NULL; } __isl_give UNION *FN(UNION,add)(__isl_take UNION *u1, __isl_take UNION *u2) { u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2)); u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1)); u1 = FN(UNION,cow)(u1); if (!u1 || !u2) goto error; if (FN(FN(UNION,foreach),PARTS)(u2, &add_part, &u1) < 0) goto error; FN(UNION,free)(u2); return u1; error: FN(UNION,free)(u1); FN(UNION,free)(u2); return NULL; } __isl_give UNION *FN(FN(UNION,from),PARTS)(__isl_take PART *part) { isl_space *dim; UNION *u; if (!part) return NULL; dim = FN(PART,get_space)(part); dim = isl_space_drop_dims(dim, isl_dim_in, 0, isl_space_dim(dim, isl_dim_in)); dim = isl_space_drop_dims(dim, isl_dim_out, 0, isl_space_dim(dim, isl_dim_out)); #ifdef HAS_TYPE u = FN(UNION,ZERO)(dim, part->type); #else u = FN(UNION,ZERO)(dim); #endif u = FN(FN(UNION,add),PARTS)(u, part); return u; } S(UNION,match_bin_data) { UNION *u2; UNION *res; __isl_give PART *(*fn)(__isl_take PART *, __isl_take PART *); }; /* Check if data->u2 has an element living in the same space as *entry. * If so, call data->fn on the two elements and add the result to * data->res. */ static int match_bin_entry(void **entry, void *user) { S(UNION,match_bin_data) *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_space *space; PART *part = *entry; space = FN(PART,get_space)(part); hash = isl_space_get_hash(space); entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table, hash, &has_dim, space, 0); isl_space_free(space); if (!entry2) return 0; part = FN(PART, copy)(part); part = data->fn(part, FN(PART, copy)(entry2->data)); if (DEFAULT_IS_ZERO) { int empty; empty = FN(PART,IS_ZERO)(part); if (empty < 0) { FN(PART,free)(part); return -1; } if (empty) { FN(PART,free)(part); return 0; } } data->res = FN(FN(UNION,add),PARTS)(data->res, part); return 0; } /* This function is currently only used from isl_polynomial.c * and not from isl_fold.c. */ static __isl_give UNION *match_bin_op(__isl_take UNION *u1, __isl_take UNION *u2, __isl_give PART *(*fn)(__isl_take PART *, __isl_take PART *)) __attribute__ ((unused)); /* For each pair of elements in "u1" and "u2" living in the same space, * call "fn" and collect the results. */ static __isl_give UNION *match_bin_op(__isl_take UNION *u1, __isl_take UNION *u2, __isl_give PART *(*fn)(__isl_take PART *, __isl_take PART *)) { S(UNION,match_bin_data) data = { NULL, NULL, fn }; u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2)); u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1)); if (!u1 || !u2) goto error; data.u2 = u2; #ifdef HAS_TYPE data.res = FN(UNION,alloc)(isl_space_copy(u1->dim), u1->type, u1->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(u1->dim), u1->table.n); #endif if (isl_hash_table_foreach(u1->dim->ctx, &u1->table, &match_bin_entry, &data) < 0) goto error; FN(UNION,free)(u1); FN(UNION,free)(u2); return data.res; error: FN(UNION,free)(u1); FN(UNION,free)(u2); FN(UNION,free)(data.res); return NULL; } #ifndef NO_SUB /* Subtract "u2" from "u1" and return the result. */ __isl_give UNION *FN(UNION,sub)(__isl_take UNION *u1, __isl_take UNION *u2) { return match_bin_op(u1, u2, &FN(PART,sub)); } #endif S(UNION,any_set_data) { isl_set *set; UNION *res; __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*); }; static int any_set_entry(void **entry, void *user) { S(UNION,any_set_data) *data = user; PW *pw = *entry; pw = FN(PW,copy)(pw); pw = data->fn(pw, isl_set_copy(data->set)); if (DEFAULT_IS_ZERO) { int empty; empty = FN(PW,IS_ZERO)(pw); if (empty < 0) { FN(PW,free)(pw); return -1; } if (empty) { FN(PW,free)(pw); return 0; } } data->res = FN(FN(UNION,add),PARTS)(data->res, pw); return 0; } /* Update each element of "u" by calling "fn" on the element and "set". */ static __isl_give UNION *any_set_op(__isl_take UNION *u, __isl_take isl_set *set, __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*)) { S(UNION,any_set_data) data = { NULL, NULL, fn }; u = FN(UNION,align_params)(u, isl_set_get_space(set)); set = isl_set_align_params(set, FN(UNION,get_space)(u)); if (!u || !set) goto error; data.set = set; #ifdef HAS_TYPE data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->type, u->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->table.n); #endif if (isl_hash_table_foreach(u->dim->ctx, &u->table, &any_set_entry, &data) < 0) goto error; FN(UNION,free)(u); isl_set_free(set); return data.res; error: FN(UNION,free)(u); isl_set_free(set); FN(UNION,free)(data.res); return NULL; } /* Intersect the domain of "u" with the parameter domain "context". */ __isl_give UNION *FN(UNION,intersect_params)(__isl_take UNION *u, __isl_take isl_set *set) { return any_set_op(u, set, &FN(PW,intersect_params)); } /* Compute the gist of the domain of "u" with respect to * the parameter domain "context". */ __isl_give UNION *FN(UNION,gist_params)(__isl_take UNION *u, __isl_take isl_set *set) { return any_set_op(u, set, &FN(PW,gist_params)); } S(UNION,match_domain_data) { isl_union_set *uset; UNION *res; __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*); }; static int set_has_dim(const void *entry, const void *val) { isl_set *set = (isl_set *)entry; isl_space *dim = (isl_space *)val; return isl_space_is_equal(set->dim, dim); } /* Find the set in data->uset that live in the same space as the domain * of *entry, apply data->fn to *entry and this set (if any), and add * the result to data->res. */ static int match_domain_entry(void **entry, void *user) { S(UNION,match_domain_data) *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; PW *pw = *entry; isl_space *space; space = FN(PW,get_domain_space)(pw); hash = isl_space_get_hash(space); entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table, hash, &set_has_dim, space, 0); isl_space_free(space); if (!entry2) return 0; pw = FN(PW,copy)(pw); pw = data->fn(pw, isl_set_copy(entry2->data)); if (DEFAULT_IS_ZERO) { int empty; empty = FN(PW,IS_ZERO)(pw); if (empty < 0) { FN(PW,free)(pw); return -1; } if (empty) { FN(PW,free)(pw); return 0; } } data->res = FN(FN(UNION,add),PARTS)(data->res, pw); return 0; } /* Apply fn to each pair of PW in u and set in uset such that * the set lives in the same space as the domain of PW * and collect the results. */ static __isl_give UNION *match_domain_op(__isl_take UNION *u, __isl_take isl_union_set *uset, __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*)) { S(UNION,match_domain_data) data = { NULL, NULL, fn }; u = FN(UNION,align_params)(u, isl_union_set_get_space(uset)); uset = isl_union_set_align_params(uset, FN(UNION,get_space)(u)); if (!u || !uset) goto error; data.uset = uset; #ifdef HAS_TYPE data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->type, u->table.n); #else data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->table.n); #endif if (isl_hash_table_foreach(u->dim->ctx, &u->table, &match_domain_entry, &data) < 0) goto error; FN(UNION,free)(u); isl_union_set_free(uset); return data.res; error: FN(UNION,free)(u); isl_union_set_free(uset); FN(UNION,free)(data.res); return NULL; } /* Intersect the domain of "u" with "uset". * If "uset" is a parameters domain, then intersect the parameter * domain of "u" with this set. */ __isl_give UNION *FN(UNION,intersect_domain)(__isl_take UNION *u, __isl_take isl_union_set *uset) { if (isl_union_set_is_params(uset)) return FN(UNION,intersect_params)(u, isl_set_from_union_set(uset)); return match_domain_op(u, uset, &FN(PW,intersect_domain)); } __isl_give UNION *FN(UNION,gist)(__isl_take UNION *u, __isl_take isl_union_set *uset) { if (isl_union_set_is_params(uset)) return FN(UNION,gist_params)(u, isl_set_from_union_set(uset)); return match_domain_op(u, uset, &FN(PW,gist)); } #ifndef NO_EVAL __isl_give isl_qpolynomial *FN(UNION,eval)(__isl_take UNION *u, __isl_take isl_point *pnt) { uint32_t hash; struct isl_hash_table_entry *entry; isl_space *space; isl_qpolynomial *qp; if (!u || !pnt) goto error; space = isl_space_copy(pnt->dim); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, 1); if (!space) goto error; hash = isl_space_get_hash(space); entry = isl_hash_table_find(u->dim->ctx, &u->table, hash, &has_dim, space, 0); isl_space_free(space); if (!entry) { qp = isl_qpolynomial_zero_on_domain(isl_space_copy(pnt->dim)); isl_point_free(pnt); } else { qp = FN(PART,eval)(FN(PART,copy)(entry->data), pnt); } FN(UNION,free)(u); return qp; error: FN(UNION,free)(u); isl_point_free(pnt); return NULL; } #endif static int coalesce_entry(void **entry, void *user) { PW **pw = (PW **)entry; *pw = FN(PW,coalesce)(*pw); if (!*pw) return -1; return 0; } __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u) { if (!u) return NULL; if (isl_hash_table_foreach(u->dim->ctx, &u->table, &coalesce_entry, NULL) < 0) goto error; return u; error: FN(UNION,free)(u); return NULL; } static int domain(__isl_take PART *part, void *user) { isl_union_set **uset = (isl_union_set **)user; *uset = isl_union_set_add_set(*uset, FN(PART,domain)(part)); return 0; } __isl_give isl_union_set *FN(UNION,domain)(__isl_take UNION *u) { isl_union_set *uset; uset = isl_union_set_empty(FN(UNION,get_space)(u)); if (FN(FN(UNION,foreach),PARTS)(u, &domain, &uset) < 0) goto error; FN(UNION,free)(u); return uset; error: isl_union_set_free(uset); FN(UNION,free)(u); return NULL; } static int mul_isl_int(void **entry, void *user) { PW **pw = (PW **)entry; isl_int *v = user; *pw = FN(PW,mul_isl_int)(*pw, *v); if (!*pw) return -1; return 0; } __isl_give UNION *FN(UNION,mul_isl_int)(__isl_take UNION *u, isl_int v) { if (isl_int_is_one(v)) return u; if (DEFAULT_IS_ZERO && u && isl_int_is_zero(v)) { UNION *zero; isl_space *dim = FN(UNION,get_space)(u); #ifdef HAS_TYPE zero = FN(UNION,ZERO)(dim, u->type); #else zero = FN(UNION,ZERO)(dim); #endif FN(UNION,free)(u); return zero; } u = FN(UNION,cow)(u); if (!u) return NULL; #ifdef HAS_TYPE if (isl_int_is_neg(v)) u->type = isl_fold_type_negate(u->type); #endif if (isl_hash_table_foreach(u->dim->ctx, &u->table, &mul_isl_int, v) < 0) goto error; return u; error: FN(UNION,free)(u); return NULL; } /* Multiply *entry by the isl_val "user". * * Return 0 on success and -1 on error. */ static int scale_val(void **entry, void *user) { PW **pw = (PW **)entry; isl_val *v = user; *pw = FN(PW,scale_val)(*pw, isl_val_copy(v)); if (!*pw) return -1; return 0; } /* Multiply "u" by "v" and return the result. */ __isl_give UNION *FN(UNION,scale_val)(__isl_take UNION *u, __isl_take isl_val *v) { if (!u || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return u; } if (DEFAULT_IS_ZERO && u && isl_val_is_zero(v)) { UNION *zero; isl_space *space = FN(UNION,get_space)(u); #ifdef HAS_TYPE zero = FN(UNION,ZERO)(space, u->type); #else zero = FN(UNION,ZERO)(space); #endif FN(UNION,free)(u); isl_val_free(v); return zero; } if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational factor", goto error); u = FN(UNION,cow)(u); if (!u) return NULL; #ifdef HAS_TYPE if (isl_val_is_neg(v)) u->type = isl_fold_type_negate(u->type); #endif if (isl_hash_table_foreach(u->dim->ctx, &u->table, &scale_val, v) < 0) goto error; isl_val_free(v); return u; error: isl_val_free(v); FN(UNION,free)(u); return NULL; } S(UNION,plain_is_equal_data) { UNION *u2; int is_equal; }; static int plain_is_equal_entry(void **entry, void *user) { S(UNION,plain_is_equal_data) *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; PW *pw = *entry; hash = isl_space_get_hash(pw->dim); entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table, hash, &has_dim, pw->dim, 0); if (!entry2) { data->is_equal = 0; return -1; } data->is_equal = FN(PW,plain_is_equal)(pw, entry2->data); if (data->is_equal < 0 || !data->is_equal) return -1; return 0; } int FN(UNION,plain_is_equal)(__isl_keep UNION *u1, __isl_keep UNION *u2) { S(UNION,plain_is_equal_data) data = { NULL, 1 }; if (!u1 || !u2) return -1; if (u1 == u2) return 1; if (u1->table.n != u2->table.n) return 0; u1 = FN(UNION,copy)(u1); u2 = FN(UNION,copy)(u2); u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2)); u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1)); if (!u1 || !u2) goto error; data.u2 = u2; if (isl_hash_table_foreach(u1->dim->ctx, &u1->table, &plain_is_equal_entry, &data) < 0 && data.is_equal) goto error; FN(UNION,free)(u1); FN(UNION,free)(u2); return data.is_equal; error: FN(UNION,free)(u1); FN(UNION,free)(u2); return -1; } cloog-0.18.2/isl/isl_ctx.c0000664000175000017500000001055312254313240012230 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #define __isl_calloc(type,size) ((type *)calloc(1, size)) #define __isl_calloc_type(type) __isl_calloc(type,sizeof(type)) void isl_handle_error(isl_ctx *ctx, enum isl_error error, const char *msg, const char *file, int line) { if (!ctx) return; isl_ctx_set_error(ctx, error); switch (ctx->opt->on_error) { case ISL_ON_ERROR_WARN: fprintf(stderr, "%s:%d: %s\n", file, line, msg); return; case ISL_ON_ERROR_CONTINUE: return; case ISL_ON_ERROR_ABORT: fprintf(stderr, "%s:%d: %s\n", file, line, msg); abort(); return; } } static struct isl_options *find_nested_options(struct isl_args *args, void *opt, struct isl_args *wanted) { int i; struct isl_options *options; if (args == wanted) return opt; for (i = 0; args->args[i].type != isl_arg_end; ++i) { if (args->args[i].type != isl_arg_child) continue; options = find_nested_options(args->args[i].u.child.child, *(void **)(((char *)opt) + args->args[i].offset), wanted); if (options) return options; } return NULL; } static struct isl_options *find_nested_isl_options(struct isl_args *args, void *opt) { return find_nested_options(args, opt, &isl_options_args); } void *isl_ctx_peek_options(isl_ctx *ctx, struct isl_args *args) { if (!ctx) return NULL; if (args == &isl_options_args) return ctx->opt; return find_nested_options(ctx->user_args, ctx->user_opt, args); } isl_ctx *isl_ctx_alloc_with_options(struct isl_args *args, void *user_opt) { struct isl_ctx *ctx = NULL; struct isl_options *opt = NULL; int opt_allocated = 0; if (!user_opt) return NULL; opt = find_nested_isl_options(args, user_opt); if (!opt) { opt = isl_options_new_with_defaults(); if (!opt) goto error; opt_allocated = 1; } ctx = __isl_calloc_type(struct isl_ctx); if (!ctx) goto error; if (isl_hash_table_init(ctx, &ctx->id_table, 0)) goto error; ctx->stats = isl_calloc_type(ctx, struct isl_stats); if (!ctx->stats) goto error; ctx->user_args = args; ctx->user_opt = user_opt; ctx->opt_allocated = opt_allocated; ctx->opt = opt; ctx->ref = 0; isl_int_init(ctx->zero); isl_int_set_si(ctx->zero, 0); isl_int_init(ctx->one); isl_int_set_si(ctx->one, 1); isl_int_init(ctx->two); isl_int_set_si(ctx->two, 2); isl_int_init(ctx->negone); isl_int_set_si(ctx->negone, -1); isl_int_init(ctx->normalize_gcd); ctx->n_cached = 0; ctx->n_miss = 0; ctx->error = isl_error_none; return ctx; error: isl_args_free(args, user_opt); if (opt_allocated) isl_options_free(opt); free(ctx); return NULL; } struct isl_ctx *isl_ctx_alloc() { struct isl_options *opt; opt = isl_options_new_with_defaults(); return isl_ctx_alloc_with_options(&isl_options_args, opt); } void isl_ctx_ref(struct isl_ctx *ctx) { ctx->ref++; } void isl_ctx_deref(struct isl_ctx *ctx) { isl_assert(ctx, ctx->ref > 0, return); ctx->ref--; } void isl_ctx_free(struct isl_ctx *ctx) { if (!ctx) return; if (ctx->ref != 0) isl_die(ctx, isl_error_invalid, "isl_ctx freed, but some objects still reference it", return); isl_hash_table_clear(&ctx->id_table); isl_blk_clear_cache(ctx); isl_int_clear(ctx->zero); isl_int_clear(ctx->one); isl_int_clear(ctx->two); isl_int_clear(ctx->negone); isl_int_clear(ctx->normalize_gcd); isl_args_free(ctx->user_args, ctx->user_opt); if (ctx->opt_allocated) isl_options_free(ctx->opt); free(ctx->stats); free(ctx); } struct isl_options *isl_ctx_options(isl_ctx *ctx) { if (!ctx) return NULL; return ctx->opt; } enum isl_error isl_ctx_last_error(isl_ctx *ctx) { return ctx->error; } void isl_ctx_reset_error(isl_ctx *ctx) { ctx->error = isl_error_none; } void isl_ctx_set_error(isl_ctx *ctx, enum isl_error error) { if (ctx) ctx->error = error; } void isl_ctx_abort(isl_ctx *ctx) { if (ctx) ctx->abort = 1; } void isl_ctx_resume(isl_ctx *ctx) { if (ctx) ctx->abort = 0; } int isl_ctx_aborted(isl_ctx *ctx) { return ctx ? ctx->abort : -1; } int isl_ctx_parse_options(isl_ctx *ctx, int argc, char **argv, unsigned flags) { if (!ctx) return -1; return isl_args_parse(ctx->user_args, argc, argv, ctx->user_opt, flags); } cloog-0.18.2/isl/bound_test.sh.in0000775000175000017500000000130712254313240013526 00000000000000#!/bin/sh EXEEXT=@EXEEXT@ BOUND_TESTS="\ basicLinear2.pwqp \ basicLinear.pwqp \ basicTestParameterPosNeg.pwqp \ basicTest.pwqp \ devos.pwqp \ equality1.pwqp \ equality2.pwqp \ equality3.pwqp \ equality4.pwqp \ equality5.pwqp \ faddeev.pwqp \ linearExample.pwqp \ neg.pwqp \ philippe3vars3pars.pwqp \ philippe3vars.pwqp \ philippeNeg.pwqp \ philippePolynomialCoeff1P.pwqp \ philippePolynomialCoeff.pwqp \ philippe.pwqp \ product.pwqp \ split.pwqp \ test3Deg3Var.pwqp \ toplas.pwqp \ unexpanded.pwqp" for i in $BOUND_TESTS; do echo $i; ./isl_bound$EXEEXT -T --bound=bernstein < $srcdir/test_inputs/$i || exit ./isl_bound$EXEEXT -T --bound=range < $srcdir/test_inputs/$i || exit done cloog-0.18.2/isl/isl_range.h0000664000175000017500000000042412254313240012527 00000000000000#include int isl_qpolynomial_bound_on_domain_range(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct isl_bound *bound); __isl_give isl_qpolynomial *isl_qpolynomial_terms_of_sign( __isl_keep isl_qpolynomial *poly, int *signs, int sign); cloog-0.18.2/isl/isl_union_map.c0000664000175000017500000016571312254313240013430 00000000000000/* * Copyright 2010-2011 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #define ISL_DIM_H #include #include #include #include #include #include #include #include #include /* Is this union set a parameter domain? */ int isl_union_set_is_params(__isl_keep isl_union_set *uset) { isl_set *set; int params; if (!uset) return -1; if (uset->table.n != 1) return 0; set = isl_set_from_union_set(isl_union_set_copy(uset)); params = isl_set_is_params(set); isl_set_free(set); return params; } static __isl_give isl_union_map *isl_union_map_alloc(__isl_take isl_space *dim, int size) { isl_union_map *umap; dim = isl_space_params(dim); if (!dim) return NULL; umap = isl_calloc_type(dim->ctx, isl_union_map); if (!umap) return NULL; umap->ref = 1; umap->dim = dim; if (isl_hash_table_init(dim->ctx, &umap->table, size) < 0) return isl_union_map_free(umap); return umap; } __isl_give isl_union_map *isl_union_map_empty(__isl_take isl_space *dim) { return isl_union_map_alloc(dim, 16); } __isl_give isl_union_set *isl_union_set_empty(__isl_take isl_space *dim) { return isl_union_map_empty(dim); } isl_ctx *isl_union_map_get_ctx(__isl_keep isl_union_map *umap) { return umap ? umap->dim->ctx : NULL; } isl_ctx *isl_union_set_get_ctx(__isl_keep isl_union_set *uset) { return uset ? uset->dim->ctx : NULL; } __isl_give isl_space *isl_union_map_get_space(__isl_keep isl_union_map *umap) { if (!umap) return NULL; return isl_space_copy(umap->dim); } __isl_give isl_space *isl_union_set_get_space(__isl_keep isl_union_set *uset) { return isl_union_map_get_space(uset); } static int free_umap_entry(void **entry, void *user) { isl_map *map = *entry; isl_map_free(map); return 0; } static int add_map(__isl_take isl_map *map, void *user) { isl_union_map **umap = (isl_union_map **)user; *umap = isl_union_map_add_map(*umap, map); return 0; } __isl_give isl_union_map *isl_union_map_dup(__isl_keep isl_union_map *umap) { isl_union_map *dup; if (!umap) return NULL; dup = isl_union_map_empty(isl_space_copy(umap->dim)); if (isl_union_map_foreach_map(umap, &add_map, &dup) < 0) goto error; return dup; error: isl_union_map_free(dup); return NULL; } __isl_give isl_union_map *isl_union_map_cow(__isl_take isl_union_map *umap) { if (!umap) return NULL; if (umap->ref == 1) return umap; umap->ref--; return isl_union_map_dup(umap); } struct isl_union_align { isl_reordering *exp; isl_union_map *res; }; static int align_entry(void **entry, void *user) { isl_map *map = *entry; isl_reordering *exp; struct isl_union_align *data = user; exp = isl_reordering_extend_space(isl_reordering_copy(data->exp), isl_map_get_space(map)); data->res = isl_union_map_add_map(data->res, isl_map_realign(isl_map_copy(map), exp)); return 0; } /* Align the parameters of umap along those of model. * The result has the parameters of model first, in the same order * as they appear in model, followed by any remaining parameters of * umap that do not appear in model. */ __isl_give isl_union_map *isl_union_map_align_params( __isl_take isl_union_map *umap, __isl_take isl_space *model) { struct isl_union_align data = { NULL, NULL }; if (!umap || !model) goto error; if (isl_space_match(umap->dim, isl_dim_param, model, isl_dim_param)) { isl_space_free(model); return umap; } model = isl_space_params(model); data.exp = isl_parameter_alignment_reordering(umap->dim, model); if (!data.exp) goto error; data.res = isl_union_map_alloc(isl_space_copy(data.exp->dim), umap->table.n); if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, &align_entry, &data) < 0) goto error; isl_reordering_free(data.exp); isl_union_map_free(umap); isl_space_free(model); return data.res; error: isl_reordering_free(data.exp); isl_union_map_free(umap); isl_union_map_free(data.res); isl_space_free(model); return NULL; } __isl_give isl_union_set *isl_union_set_align_params( __isl_take isl_union_set *uset, __isl_take isl_space *model) { return isl_union_map_align_params(uset, model); } __isl_give isl_union_map *isl_union_map_union(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2)); umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1)); umap1 = isl_union_map_cow(umap1); if (!umap1 || !umap2) goto error; if (isl_union_map_foreach_map(umap2, &add_map, &umap1) < 0) goto error; isl_union_map_free(umap2); return umap1; error: isl_union_map_free(umap1); isl_union_map_free(umap2); return NULL; } __isl_give isl_union_set *isl_union_set_union(__isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { return isl_union_map_union(uset1, uset2); } __isl_give isl_union_map *isl_union_map_copy(__isl_keep isl_union_map *umap) { if (!umap) return NULL; umap->ref++; return umap; } __isl_give isl_union_set *isl_union_set_copy(__isl_keep isl_union_set *uset) { return isl_union_map_copy(uset); } void *isl_union_map_free(__isl_take isl_union_map *umap) { if (!umap) return NULL; if (--umap->ref > 0) return NULL; isl_hash_table_foreach(umap->dim->ctx, &umap->table, &free_umap_entry, NULL); isl_hash_table_clear(&umap->table); isl_space_free(umap->dim); free(umap); return NULL; } void *isl_union_set_free(__isl_take isl_union_set *uset) { return isl_union_map_free(uset); } static int has_dim(const void *entry, const void *val) { isl_map *map = (isl_map *)entry; isl_space *dim = (isl_space *)val; return isl_space_is_equal(map->dim, dim); } __isl_give isl_union_map *isl_union_map_add_map(__isl_take isl_union_map *umap, __isl_take isl_map *map) { uint32_t hash; struct isl_hash_table_entry *entry; if (!map || !umap) goto error; if (isl_map_plain_is_empty(map)) { isl_map_free(map); return umap; } if (!isl_space_match(map->dim, isl_dim_param, umap->dim, isl_dim_param)) { umap = isl_union_map_align_params(umap, isl_map_get_space(map)); map = isl_map_align_params(map, isl_union_map_get_space(umap)); } umap = isl_union_map_cow(umap); if (!map || !umap) goto error; hash = isl_space_get_hash(map->dim); entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash, &has_dim, map->dim, 1); if (!entry) goto error; if (!entry->data) entry->data = map; else { entry->data = isl_map_union(entry->data, isl_map_copy(map)); if (!entry->data) goto error; isl_map_free(map); } return umap; error: isl_map_free(map); isl_union_map_free(umap); return NULL; } __isl_give isl_union_set *isl_union_set_add_set(__isl_take isl_union_set *uset, __isl_take isl_set *set) { return isl_union_map_add_map(uset, (isl_map *)set); } __isl_give isl_union_map *isl_union_map_from_map(__isl_take isl_map *map) { isl_space *dim; isl_union_map *umap; if (!map) return NULL; dim = isl_map_get_space(map); dim = isl_space_params(dim); umap = isl_union_map_empty(dim); umap = isl_union_map_add_map(umap, map); return umap; } __isl_give isl_union_set *isl_union_set_from_set(__isl_take isl_set *set) { return isl_union_map_from_map((isl_map *)set); } __isl_give isl_union_map *isl_union_map_from_basic_map( __isl_take isl_basic_map *bmap) { return isl_union_map_from_map(isl_map_from_basic_map(bmap)); } __isl_give isl_union_set *isl_union_set_from_basic_set( __isl_take isl_basic_set *bset) { return isl_union_map_from_basic_map(bset); } struct isl_union_map_foreach_data { int (*fn)(__isl_take isl_map *map, void *user); void *user; }; static int call_on_copy(void **entry, void *user) { isl_map *map = *entry; struct isl_union_map_foreach_data *data; data = (struct isl_union_map_foreach_data *)user; return data->fn(isl_map_copy(map), data->user); } int isl_union_map_n_map(__isl_keep isl_union_map *umap) { return umap ? umap->table.n : 0; } int isl_union_set_n_set(__isl_keep isl_union_set *uset) { return uset ? uset->table.n : 0; } int isl_union_map_foreach_map(__isl_keep isl_union_map *umap, int (*fn)(__isl_take isl_map *map, void *user), void *user) { struct isl_union_map_foreach_data data = { fn, user }; if (!umap) return -1; return isl_hash_table_foreach(umap->dim->ctx, &umap->table, &call_on_copy, &data); } static int copy_map(void **entry, void *user) { isl_map *map = *entry; isl_map **map_p = user; *map_p = isl_map_copy(map); return -1; } __isl_give isl_map *isl_map_from_union_map(__isl_take isl_union_map *umap) { isl_ctx *ctx; isl_map *map = NULL; if (!umap) return NULL; ctx = isl_union_map_get_ctx(umap); if (umap->table.n != 1) isl_die(ctx, isl_error_invalid, "union map needs to contain elements in exactly " "one space", return isl_union_map_free(umap)); isl_hash_table_foreach(ctx, &umap->table, ©_map, &map); isl_union_map_free(umap); return map; } __isl_give isl_set *isl_set_from_union_set(__isl_take isl_union_set *uset) { return isl_map_from_union_map(uset); } /* Extract the map in "umap" that lives in the given space (ignoring * parameters). */ __isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap, __isl_take isl_space *space) { uint32_t hash; struct isl_hash_table_entry *entry; space = isl_space_drop_dims(space, isl_dim_param, 0, isl_space_dim(space, isl_dim_param)); space = isl_space_align_params(space, isl_union_map_get_space(umap)); if (!umap || !space) goto error; hash = isl_space_get_hash(space); entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash, &has_dim, space, 0); if (!entry) return isl_map_empty(space); isl_space_free(space); return isl_map_copy(entry->data); error: isl_space_free(space); return NULL; } __isl_give isl_set *isl_union_set_extract_set(__isl_keep isl_union_set *uset, __isl_take isl_space *dim) { return (isl_set *)isl_union_map_extract_map(uset, dim); } /* Check if umap contains a map in the given space. */ __isl_give int isl_union_map_contains(__isl_keep isl_union_map *umap, __isl_keep isl_space *dim) { uint32_t hash; struct isl_hash_table_entry *entry; if (!umap || !dim) return -1; hash = isl_space_get_hash(dim); entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash, &has_dim, dim, 0); return !!entry; } __isl_give int isl_union_set_contains(__isl_keep isl_union_set *uset, __isl_keep isl_space *dim) { return isl_union_map_contains(uset, dim); } int isl_union_set_foreach_set(__isl_keep isl_union_set *uset, int (*fn)(__isl_take isl_set *set, void *user), void *user) { return isl_union_map_foreach_map(uset, (int(*)(__isl_take isl_map *, void*))fn, user); } struct isl_union_set_foreach_point_data { int (*fn)(__isl_take isl_point *pnt, void *user); void *user; }; static int foreach_point(__isl_take isl_set *set, void *user) { struct isl_union_set_foreach_point_data *data = user; int r; r = isl_set_foreach_point(set, data->fn, data->user); isl_set_free(set); return r; } int isl_union_set_foreach_point(__isl_keep isl_union_set *uset, int (*fn)(__isl_take isl_point *pnt, void *user), void *user) { struct isl_union_set_foreach_point_data data = { fn, user }; return isl_union_set_foreach_set(uset, &foreach_point, &data); } struct isl_union_map_gen_bin_data { isl_union_map *umap2; isl_union_map *res; }; static int subtract_entry(void **entry, void *user) { struct isl_union_map_gen_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_map *map = *entry; hash = isl_space_get_hash(map->dim); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, map->dim, 0); map = isl_map_copy(map); if (entry2) { int empty; map = isl_map_subtract(map, isl_map_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } if (empty) { isl_map_free(map); return 0; } } data->res = isl_union_map_add_map(data->res, map); return 0; } static __isl_give isl_union_map *gen_bin_op(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2, int (*fn)(void **, void *)) { struct isl_union_map_gen_bin_data data = { NULL, NULL }; umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2)); umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1)); if (!umap1 || !umap2) goto error; data.umap2 = umap2; data.res = isl_union_map_alloc(isl_space_copy(umap1->dim), umap1->table.n); if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table, fn, &data) < 0) goto error; isl_union_map_free(umap1); isl_union_map_free(umap2); return data.res; error: isl_union_map_free(umap1); isl_union_map_free(umap2); isl_union_map_free(data.res); return NULL; } __isl_give isl_union_map *isl_union_map_subtract( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return gen_bin_op(umap1, umap2, &subtract_entry); } __isl_give isl_union_set *isl_union_set_subtract( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { return isl_union_map_subtract(uset1, uset2); } struct isl_union_map_gen_bin_set_data { isl_set *set; isl_union_map *res; }; static int intersect_params_entry(void **entry, void *user) { struct isl_union_map_gen_bin_set_data *data = user; isl_map *map = *entry; int empty; map = isl_map_copy(map); map = isl_map_intersect_params(map, isl_set_copy(data->set)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } data->res = isl_union_map_add_map(data->res, map); return 0; } static __isl_give isl_union_map *gen_bin_set_op(__isl_take isl_union_map *umap, __isl_take isl_set *set, int (*fn)(void **, void *)) { struct isl_union_map_gen_bin_set_data data = { NULL, NULL }; umap = isl_union_map_align_params(umap, isl_set_get_space(set)); set = isl_set_align_params(set, isl_union_map_get_space(umap)); if (!umap || !set) goto error; data.set = set; data.res = isl_union_map_alloc(isl_space_copy(umap->dim), umap->table.n); if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, &data) < 0) goto error; isl_union_map_free(umap); isl_set_free(set); return data.res; error: isl_union_map_free(umap); isl_set_free(set); isl_union_map_free(data.res); return NULL; } __isl_give isl_union_map *isl_union_map_intersect_params( __isl_take isl_union_map *umap, __isl_take isl_set *set) { return gen_bin_set_op(umap, set, &intersect_params_entry); } __isl_give isl_union_set *isl_union_set_intersect_params( __isl_take isl_union_set *uset, __isl_take isl_set *set) { return isl_union_map_intersect_params(uset, set); } static __isl_give isl_union_map *union_map_intersect_params( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { return isl_union_map_intersect_params(umap, isl_set_from_union_set(uset)); } static __isl_give isl_union_map *union_map_gist_params( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { return isl_union_map_gist_params(umap, isl_set_from_union_set(uset)); } struct isl_union_map_match_bin_data { isl_union_map *umap2; isl_union_map *res; __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*); }; static int match_bin_entry(void **entry, void *user) { struct isl_union_map_match_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_map *map = *entry; int empty; hash = isl_space_get_hash(map->dim); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, map->dim, 0); if (!entry2) return 0; map = isl_map_copy(map); map = data->fn(map, isl_map_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } if (empty) { isl_map_free(map); return 0; } data->res = isl_union_map_add_map(data->res, map); return 0; } static __isl_give isl_union_map *match_bin_op(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2, __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*)) { struct isl_union_map_match_bin_data data = { NULL, NULL, fn }; umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2)); umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1)); if (!umap1 || !umap2) goto error; data.umap2 = umap2; data.res = isl_union_map_alloc(isl_space_copy(umap1->dim), umap1->table.n); if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table, &match_bin_entry, &data) < 0) goto error; isl_union_map_free(umap1); isl_union_map_free(umap2); return data.res; error: isl_union_map_free(umap1); isl_union_map_free(umap2); isl_union_map_free(data.res); return NULL; } __isl_give isl_union_map *isl_union_map_intersect( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return match_bin_op(umap1, umap2, &isl_map_intersect); } /* Compute the intersection of the two union_sets. * As a special case, if exactly one of the two union_sets * is a parameter domain, then intersect the parameter domain * of the other one with this set. */ __isl_give isl_union_set *isl_union_set_intersect( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { int p1, p2; p1 = isl_union_set_is_params(uset1); p2 = isl_union_set_is_params(uset2); if (p1 < 0 || p2 < 0) goto error; if (!p1 && p2) return union_map_intersect_params(uset1, uset2); if (p1 && !p2) return union_map_intersect_params(uset2, uset1); return isl_union_map_intersect(uset1, uset2); error: isl_union_set_free(uset1); isl_union_set_free(uset2); return NULL; } static int gist_params_entry(void **entry, void *user) { struct isl_union_map_gen_bin_set_data *data = user; isl_map *map = *entry; int empty; map = isl_map_copy(map); map = isl_map_gist_params(map, isl_set_copy(data->set)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } data->res = isl_union_map_add_map(data->res, map); return 0; } __isl_give isl_union_map *isl_union_map_gist_params( __isl_take isl_union_map *umap, __isl_take isl_set *set) { return gen_bin_set_op(umap, set, &gist_params_entry); } __isl_give isl_union_set *isl_union_set_gist_params( __isl_take isl_union_set *uset, __isl_take isl_set *set) { return isl_union_map_gist_params(uset, set); } __isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap, __isl_take isl_union_map *context) { return match_bin_op(umap, context, &isl_map_gist); } __isl_give isl_union_set *isl_union_set_gist(__isl_take isl_union_set *uset, __isl_take isl_union_set *context) { if (isl_union_set_is_params(context)) return union_map_gist_params(uset, context); return isl_union_map_gist(uset, context); } static __isl_give isl_map *lex_le_set(__isl_take isl_map *set1, __isl_take isl_map *set2) { return isl_set_lex_le_set((isl_set *)set1, (isl_set *)set2); } static __isl_give isl_map *lex_lt_set(__isl_take isl_map *set1, __isl_take isl_map *set2) { return isl_set_lex_lt_set((isl_set *)set1, (isl_set *)set2); } __isl_give isl_union_map *isl_union_set_lex_lt_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { return match_bin_op(uset1, uset2, &lex_lt_set); } __isl_give isl_union_map *isl_union_set_lex_le_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { return match_bin_op(uset1, uset2, &lex_le_set); } __isl_give isl_union_map *isl_union_set_lex_gt_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2, uset1)); } __isl_give isl_union_map *isl_union_set_lex_ge_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2, uset1)); } __isl_give isl_union_map *isl_union_map_lex_gt_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2, umap1)); } __isl_give isl_union_map *isl_union_map_lex_ge_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2, umap1)); } static int intersect_domain_entry(void **entry, void *user) { struct isl_union_map_gen_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_space *dim; isl_map *map = *entry; int empty; dim = isl_map_get_space(map); dim = isl_space_domain(dim); hash = isl_space_get_hash(dim); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, dim, 0); isl_space_free(dim); if (!entry2) return 0; map = isl_map_copy(map); map = isl_map_intersect_domain(map, isl_set_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } if (empty) { isl_map_free(map); return 0; } data->res = isl_union_map_add_map(data->res, map); return 0; } /* Intersect the domain of "umap" with "uset". * If "uset" is a parameters domain, then intersect the parameter * domain of "umap" with this set. */ __isl_give isl_union_map *isl_union_map_intersect_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { if (isl_union_set_is_params(uset)) return union_map_intersect_params(umap, uset); return gen_bin_op(umap, uset, &intersect_domain_entry); } /* Remove the elements of data->umap2 from the domain of *entry * and add the result to data->res. */ static int subtract_domain_entry(void **entry, void *user) { struct isl_union_map_gen_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_space *dim; isl_map *map = *entry; int empty; dim = isl_map_get_space(map); dim = isl_space_domain(dim); hash = isl_space_get_hash(dim); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, dim, 0); isl_space_free(dim); map = isl_map_copy(map); if (!entry2) { data->res = isl_union_map_add_map(data->res, map); return 0; } map = isl_map_subtract_domain(map, isl_set_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } if (empty) { isl_map_free(map); return 0; } data->res = isl_union_map_add_map(data->res, map); return 0; } /* Remove the elements of "uset" from the domain of "umap". */ __isl_give isl_union_map *isl_union_map_subtract_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom) { return gen_bin_op(umap, dom, &subtract_domain_entry); } /* Remove the elements of data->umap2 from the range of *entry * and add the result to data->res. */ static int subtract_range_entry(void **entry, void *user) { struct isl_union_map_gen_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_space *space; isl_map *map = *entry; int empty; space = isl_map_get_space(map); space = isl_space_range(space); hash = isl_space_get_hash(space); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, space, 0); isl_space_free(space); map = isl_map_copy(map); if (!entry2) { data->res = isl_union_map_add_map(data->res, map); return 0; } map = isl_map_subtract_range(map, isl_set_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } if (empty) { isl_map_free(map); return 0; } data->res = isl_union_map_add_map(data->res, map); return 0; } /* Remove the elements of "uset" from the range of "umap". */ __isl_give isl_union_map *isl_union_map_subtract_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom) { return gen_bin_op(umap, dom, &subtract_range_entry); } static int gist_domain_entry(void **entry, void *user) { struct isl_union_map_gen_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_space *dim; isl_map *map = *entry; int empty; dim = isl_map_get_space(map); dim = isl_space_domain(dim); hash = isl_space_get_hash(dim); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, dim, 0); isl_space_free(dim); if (!entry2) return 0; map = isl_map_copy(map); map = isl_map_gist_domain(map, isl_set_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } data->res = isl_union_map_add_map(data->res, map); return 0; } /* Compute the gist of "umap" with respect to the domain "uset". * If "uset" is a parameters domain, then compute the gist * with respect to this parameter domain. */ __isl_give isl_union_map *isl_union_map_gist_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { if (isl_union_set_is_params(uset)) return union_map_gist_params(umap, uset); return gen_bin_op(umap, uset, &gist_domain_entry); } static int gist_range_entry(void **entry, void *user) { struct isl_union_map_gen_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_space *space; isl_map *map = *entry; int empty; space = isl_map_get_space(map); space = isl_space_range(space); hash = isl_space_get_hash(space); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, space, 0); isl_space_free(space); if (!entry2) return 0; map = isl_map_copy(map); map = isl_map_gist_range(map, isl_set_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } data->res = isl_union_map_add_map(data->res, map); return 0; } /* Compute the gist of "umap" with respect to the range "uset". */ __isl_give isl_union_map *isl_union_map_gist_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { return gen_bin_op(umap, uset, &gist_range_entry); } static int intersect_range_entry(void **entry, void *user) { struct isl_union_map_gen_bin_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_space *dim; isl_map *map = *entry; int empty; dim = isl_map_get_space(map); dim = isl_space_range(dim); hash = isl_space_get_hash(dim); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, dim, 0); isl_space_free(dim); if (!entry2) return 0; map = isl_map_copy(map); map = isl_map_intersect_range(map, isl_set_copy(entry2->data)); empty = isl_map_is_empty(map); if (empty < 0) { isl_map_free(map); return -1; } if (empty) { isl_map_free(map); return 0; } data->res = isl_union_map_add_map(data->res, map); return 0; } __isl_give isl_union_map *isl_union_map_intersect_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset) { return gen_bin_op(umap, uset, &intersect_range_entry); } struct isl_union_map_bin_data { isl_union_map *umap2; isl_union_map *res; isl_map *map; int (*fn)(void **entry, void *user); }; static int apply_range_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; int empty; if (!isl_space_tuple_match(data->map->dim, isl_dim_out, map2->dim, isl_dim_in)) return 0; map2 = isl_map_apply_range(isl_map_copy(data->map), isl_map_copy(map2)); empty = isl_map_is_empty(map2); if (empty < 0) { isl_map_free(map2); return -1; } if (empty) { isl_map_free(map2); return 0; } data->res = isl_union_map_add_map(data->res, map2); return 0; } static int bin_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map = *entry; data->map = map; if (isl_hash_table_foreach(data->umap2->dim->ctx, &data->umap2->table, data->fn, data) < 0) return -1; return 0; } static __isl_give isl_union_map *bin_op(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2, int (*fn)(void **entry, void *user)) { struct isl_union_map_bin_data data = { NULL, NULL, NULL, fn }; umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2)); umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1)); if (!umap1 || !umap2) goto error; data.umap2 = umap2; data.res = isl_union_map_alloc(isl_space_copy(umap1->dim), umap1->table.n); if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table, &bin_entry, &data) < 0) goto error; isl_union_map_free(umap1); isl_union_map_free(umap2); return data.res; error: isl_union_map_free(umap1); isl_union_map_free(umap2); isl_union_map_free(data.res); return NULL; } __isl_give isl_union_map *isl_union_map_apply_range( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &apply_range_entry); } __isl_give isl_union_map *isl_union_map_apply_domain( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { umap1 = isl_union_map_reverse(umap1); umap1 = isl_union_map_apply_range(umap1, umap2); return isl_union_map_reverse(umap1); } __isl_give isl_union_set *isl_union_set_apply( __isl_take isl_union_set *uset, __isl_take isl_union_map *umap) { return isl_union_map_apply_range(uset, umap); } static int map_lex_lt_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_match(data->map->dim, isl_dim_out, map2->dim, isl_dim_out)) return 0; map2 = isl_map_lex_lt_map(isl_map_copy(data->map), isl_map_copy(map2)); data->res = isl_union_map_add_map(data->res, map2); return 0; } __isl_give isl_union_map *isl_union_map_lex_lt_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &map_lex_lt_entry); } static int map_lex_le_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_match(data->map->dim, isl_dim_out, map2->dim, isl_dim_out)) return 0; map2 = isl_map_lex_le_map(isl_map_copy(data->map), isl_map_copy(map2)); data->res = isl_union_map_add_map(data->res, map2); return 0; } __isl_give isl_union_map *isl_union_map_lex_le_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &map_lex_le_entry); } static int product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; map2 = isl_map_product(isl_map_copy(data->map), isl_map_copy(map2)); data->res = isl_union_map_add_map(data->res, map2); return 0; } __isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &product_entry); } static int set_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_set *set2 = *entry; set2 = isl_set_product(isl_set_copy(data->map), isl_set_copy(set2)); data->res = isl_union_set_add_set(data->res, set2); return 0; } __isl_give isl_union_set *isl_union_set_product(__isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2) { return bin_op(uset1, uset2, &set_product_entry); } static int domain_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_match(data->map->dim, isl_dim_out, map2->dim, isl_dim_out)) return 0; map2 = isl_map_domain_product(isl_map_copy(data->map), isl_map_copy(map2)); data->res = isl_union_map_add_map(data->res, map2); return 0; } /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D) */ __isl_give isl_union_map *isl_union_map_domain_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &domain_product_entry); } static int range_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_match(data->map->dim, isl_dim_in, map2->dim, isl_dim_in)) return 0; map2 = isl_map_range_product(isl_map_copy(data->map), isl_map_copy(map2)); data->res = isl_union_map_add_map(data->res, map2); return 0; } __isl_give isl_union_map *isl_union_map_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &range_product_entry); } static int flat_range_product_entry(void **entry, void *user) { struct isl_union_map_bin_data *data = user; isl_map *map2 = *entry; if (!isl_space_tuple_match(data->map->dim, isl_dim_in, map2->dim, isl_dim_in)) return 0; map2 = isl_map_flat_range_product(isl_map_copy(data->map), isl_map_copy(map2)); data->res = isl_union_map_add_map(data->res, map2); return 0; } __isl_give isl_union_map *isl_union_map_flat_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2) { return bin_op(umap1, umap2, &flat_range_product_entry); } static __isl_give isl_union_set *cond_un_op(__isl_take isl_union_map *umap, int (*fn)(void **, void *)) { isl_union_set *res; if (!umap) return NULL; res = isl_union_map_alloc(isl_space_copy(umap->dim), umap->table.n); if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, &res) < 0) goto error; isl_union_map_free(umap); return res; error: isl_union_map_free(umap); isl_union_set_free(res); return NULL; } static int from_range_entry(void **entry, void *user) { isl_map *set = *entry; isl_union_set **res = user; *res = isl_union_map_add_map(*res, isl_map_from_range(isl_set_copy(set))); return 0; } __isl_give isl_union_map *isl_union_map_from_range( __isl_take isl_union_set *uset) { return cond_un_op(uset, &from_range_entry); } __isl_give isl_union_map *isl_union_map_from_domain( __isl_take isl_union_set *uset) { return isl_union_map_reverse(isl_union_map_from_range(uset)); } __isl_give isl_union_map *isl_union_map_from_domain_and_range( __isl_take isl_union_set *domain, __isl_take isl_union_set *range) { return isl_union_map_apply_range(isl_union_map_from_domain(domain), isl_union_map_from_range(range)); } static __isl_give isl_union_map *un_op(__isl_take isl_union_map *umap, int (*fn)(void **, void *)) { umap = isl_union_map_cow(umap); if (!umap) return NULL; if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, NULL) < 0) goto error; return umap; error: isl_union_map_free(umap); return NULL; } static int affine_entry(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_from_basic_map(isl_map_affine_hull(*map)); return *map ? 0 : -1; } __isl_give isl_union_map *isl_union_map_affine_hull( __isl_take isl_union_map *umap) { return un_op(umap, &affine_entry); } __isl_give isl_union_set *isl_union_set_affine_hull( __isl_take isl_union_set *uset) { return isl_union_map_affine_hull(uset); } static int polyhedral_entry(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_from_basic_map(isl_map_polyhedral_hull(*map)); return *map ? 0 : -1; } __isl_give isl_union_map *isl_union_map_polyhedral_hull( __isl_take isl_union_map *umap) { return un_op(umap, &polyhedral_entry); } __isl_give isl_union_set *isl_union_set_polyhedral_hull( __isl_take isl_union_set *uset) { return isl_union_map_polyhedral_hull(uset); } static int simple_entry(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_from_basic_map(isl_map_simple_hull(*map)); return *map ? 0 : -1; } __isl_give isl_union_map *isl_union_map_simple_hull( __isl_take isl_union_map *umap) { return un_op(umap, &simple_entry); } __isl_give isl_union_set *isl_union_set_simple_hull( __isl_take isl_union_set *uset) { return isl_union_map_simple_hull(uset); } static int inplace_entry(void **entry, void *user) { __isl_give isl_map *(*fn)(__isl_take isl_map *); isl_map **map = (isl_map **)entry; isl_map *copy; fn = *(__isl_give isl_map *(**)(__isl_take isl_map *)) user; copy = fn(isl_map_copy(*map)); if (!copy) return -1; isl_map_free(*map); *map = copy; return 0; } static __isl_give isl_union_map *inplace(__isl_take isl_union_map *umap, __isl_give isl_map *(*fn)(__isl_take isl_map *)) { if (!umap) return NULL; if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, &inplace_entry, &fn) < 0) goto error; return umap; error: isl_union_map_free(umap); return NULL; } __isl_give isl_union_map *isl_union_map_coalesce( __isl_take isl_union_map *umap) { return inplace(umap, &isl_map_coalesce); } __isl_give isl_union_set *isl_union_set_coalesce( __isl_take isl_union_set *uset) { return isl_union_map_coalesce(uset); } __isl_give isl_union_map *isl_union_map_detect_equalities( __isl_take isl_union_map *umap) { return inplace(umap, &isl_map_detect_equalities); } __isl_give isl_union_set *isl_union_set_detect_equalities( __isl_take isl_union_set *uset) { return isl_union_map_detect_equalities(uset); } __isl_give isl_union_map *isl_union_map_compute_divs( __isl_take isl_union_map *umap) { return inplace(umap, &isl_map_compute_divs); } __isl_give isl_union_set *isl_union_set_compute_divs( __isl_take isl_union_set *uset) { return isl_union_map_compute_divs(uset); } static int lexmin_entry(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_lexmin(*map); return *map ? 0 : -1; } __isl_give isl_union_map *isl_union_map_lexmin( __isl_take isl_union_map *umap) { return un_op(umap, &lexmin_entry); } __isl_give isl_union_set *isl_union_set_lexmin( __isl_take isl_union_set *uset) { return isl_union_map_lexmin(uset); } static int lexmax_entry(void **entry, void *user) { isl_map **map = (isl_map **)entry; *map = isl_map_lexmax(*map); return *map ? 0 : -1; } __isl_give isl_union_map *isl_union_map_lexmax( __isl_take isl_union_map *umap) { return un_op(umap, &lexmax_entry); } __isl_give isl_union_set *isl_union_set_lexmax( __isl_take isl_union_set *uset) { return isl_union_map_lexmax(uset); } static int universe_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; map = isl_map_universe(isl_map_get_space(map)); *res = isl_union_map_add_map(*res, map); return 0; } __isl_give isl_union_map *isl_union_map_universe(__isl_take isl_union_map *umap) { return cond_un_op(umap, &universe_entry); } __isl_give isl_union_set *isl_union_set_universe(__isl_take isl_union_set *uset) { return isl_union_map_universe(uset); } static int reverse_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; *res = isl_union_map_add_map(*res, isl_map_reverse(isl_map_copy(map))); return 0; } __isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap) { return cond_un_op(umap, &reverse_entry); } static int params_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; *res = isl_union_set_add_set(*res, isl_map_params(isl_map_copy(map))); return 0; } /* Compute the parameter domain of the given union map. */ __isl_give isl_set *isl_union_map_params(__isl_take isl_union_map *umap) { int empty; empty = isl_union_map_is_empty(umap); if (empty < 0) return isl_union_map_free(umap); if (empty) return isl_set_empty(isl_union_map_get_space(umap)); return isl_set_from_union_set(cond_un_op(umap, ¶ms_entry)); } /* Compute the parameter domain of the given union set. */ __isl_give isl_set *isl_union_set_params(__isl_take isl_union_set *uset) { return isl_union_map_params(uset); } static int domain_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; *res = isl_union_set_add_set(*res, isl_map_domain(isl_map_copy(map))); return 0; } __isl_give isl_union_set *isl_union_map_domain(__isl_take isl_union_map *umap) { return cond_un_op(umap, &domain_entry); } static int range_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; *res = isl_union_set_add_set(*res, isl_map_range(isl_map_copy(map))); return 0; } __isl_give isl_union_set *isl_union_map_range(__isl_take isl_union_map *umap) { return cond_un_op(umap, &range_entry); } static int domain_map_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; *res = isl_union_map_add_map(*res, isl_map_domain_map(isl_map_copy(map))); return 0; } __isl_give isl_union_map *isl_union_map_domain_map( __isl_take isl_union_map *umap) { return cond_un_op(umap, &domain_map_entry); } static int range_map_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; *res = isl_union_map_add_map(*res, isl_map_range_map(isl_map_copy(map))); return 0; } __isl_give isl_union_map *isl_union_map_range_map( __isl_take isl_union_map *umap) { return cond_un_op(umap, &range_map_entry); } static int deltas_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out)) return 0; *res = isl_union_set_add_set(*res, isl_map_deltas(isl_map_copy(map))); return 0; } __isl_give isl_union_set *isl_union_map_deltas(__isl_take isl_union_map *umap) { return cond_un_op(umap, &deltas_entry); } static int deltas_map_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out)) return 0; *res = isl_union_map_add_map(*res, isl_map_deltas_map(isl_map_copy(map))); return 0; } __isl_give isl_union_map *isl_union_map_deltas_map( __isl_take isl_union_map *umap) { return cond_un_op(umap, &deltas_map_entry); } static int identity_entry(void **entry, void *user) { isl_set *set = *entry; isl_union_map **res = user; *res = isl_union_map_add_map(*res, isl_set_identity(isl_set_copy(set))); return 0; } __isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_set *uset) { return cond_un_op(uset, &identity_entry); } static int unwrap_entry(void **entry, void *user) { isl_set *set = *entry; isl_union_set **res = user; if (!isl_set_is_wrapping(set)) return 0; *res = isl_union_map_add_map(*res, isl_set_unwrap(isl_set_copy(set))); return 0; } __isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_set *uset) { return cond_un_op(uset, &unwrap_entry); } static int wrap_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_set **res = user; *res = isl_union_set_add_set(*res, isl_map_wrap(isl_map_copy(map))); return 0; } __isl_give isl_union_set *isl_union_map_wrap(__isl_take isl_union_map *umap) { return cond_un_op(umap, &wrap_entry); } struct isl_union_map_is_subset_data { isl_union_map *umap2; int is_subset; }; static int is_subset_entry(void **entry, void *user) { struct isl_union_map_is_subset_data *data = user; uint32_t hash; struct isl_hash_table_entry *entry2; isl_map *map = *entry; hash = isl_space_get_hash(map->dim); entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table, hash, &has_dim, map->dim, 0); if (!entry2) { int empty = isl_map_is_empty(map); if (empty < 0) return -1; if (empty) return 0; data->is_subset = 0; return -1; } data->is_subset = isl_map_is_subset(map, entry2->data); if (data->is_subset < 0 || !data->is_subset) return -1; return 0; } int isl_union_map_is_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { struct isl_union_map_is_subset_data data = { NULL, 1 }; umap1 = isl_union_map_copy(umap1); umap2 = isl_union_map_copy(umap2); umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2)); umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1)); if (!umap1 || !umap2) goto error; data.umap2 = umap2; if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table, &is_subset_entry, &data) < 0 && data.is_subset) goto error; isl_union_map_free(umap1); isl_union_map_free(umap2); return data.is_subset; error: isl_union_map_free(umap1); isl_union_map_free(umap2); return -1; } int isl_union_set_is_subset(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { return isl_union_map_is_subset(uset1, uset2); } int isl_union_map_is_equal(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { int is_subset; if (!umap1 || !umap2) return -1; is_subset = isl_union_map_is_subset(umap1, umap2); if (is_subset != 1) return is_subset; is_subset = isl_union_map_is_subset(umap2, umap1); return is_subset; } int isl_union_set_is_equal(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { return isl_union_map_is_equal(uset1, uset2); } int isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2) { int is_subset; if (!umap1 || !umap2) return -1; is_subset = isl_union_map_is_subset(umap1, umap2); if (is_subset != 1) return is_subset; is_subset = isl_union_map_is_subset(umap2, umap1); if (is_subset == -1) return is_subset; return !is_subset; } int isl_union_set_is_strict_subset(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2) { return isl_union_map_is_strict_subset(uset1, uset2); } static int sample_entry(void **entry, void *user) { isl_basic_map **sample = (isl_basic_map **)user; isl_map *map = *entry; *sample = isl_map_sample(isl_map_copy(map)); if (!*sample) return -1; if (!isl_basic_map_plain_is_empty(*sample)) return -1; return 0; } __isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap) { isl_basic_map *sample = NULL; if (!umap) return NULL; if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, &sample_entry, &sample) < 0 && !sample) goto error; if (!sample) sample = isl_basic_map_empty(isl_union_map_get_space(umap)); isl_union_map_free(umap); return sample; error: isl_union_map_free(umap); return NULL; } __isl_give isl_basic_set *isl_union_set_sample(__isl_take isl_union_set *uset) { return (isl_basic_set *)isl_union_map_sample(uset); } struct isl_forall_data { int res; int (*fn)(__isl_keep isl_map *map); }; static int forall_entry(void **entry, void *user) { struct isl_forall_data *data = user; isl_map *map = *entry; data->res = data->fn(map); if (data->res < 0) return -1; if (!data->res) return -1; return 0; } static int union_map_forall(__isl_keep isl_union_map *umap, int (*fn)(__isl_keep isl_map *map)) { struct isl_forall_data data = { 1, fn }; if (!umap) return -1; if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, &forall_entry, &data) < 0 && data.res) return -1; return data.res; } struct isl_forall_user_data { int res; int (*fn)(__isl_keep isl_map *map, void *user); void *user; }; static int forall_user_entry(void **entry, void *user) { struct isl_forall_user_data *data = user; isl_map *map = *entry; data->res = data->fn(map, data->user); if (data->res < 0) return -1; if (!data->res) return -1; return 0; } /* Check if fn(map, user) returns true for all maps "map" in umap. */ static int union_map_forall_user(__isl_keep isl_union_map *umap, int (*fn)(__isl_keep isl_map *map, void *user), void *user) { struct isl_forall_user_data data = { 1, fn, user }; if (!umap) return -1; if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, &forall_user_entry, &data) < 0 && data.res) return -1; return data.res; } int isl_union_map_is_empty(__isl_keep isl_union_map *umap) { return union_map_forall(umap, &isl_map_is_empty); } int isl_union_set_is_empty(__isl_keep isl_union_set *uset) { return isl_union_map_is_empty(uset); } static int is_subset_of_identity(__isl_keep isl_map *map) { int is_subset; isl_space *dim; isl_map *id; if (!map) return -1; if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out)) return 0; dim = isl_map_get_space(map); id = isl_map_identity(dim); is_subset = isl_map_is_subset(map, id); isl_map_free(id); return is_subset; } /* Check if the given map is single-valued. * We simply compute * * M \circ M^-1 * * and check if the result is a subset of the identity mapping. */ int isl_union_map_is_single_valued(__isl_keep isl_union_map *umap) { isl_union_map *test; int sv; if (isl_union_map_n_map(umap) == 1) { isl_map *map; umap = isl_union_map_copy(umap); map = isl_map_from_union_map(umap); sv = isl_map_is_single_valued(map); isl_map_free(map); return sv; } test = isl_union_map_reverse(isl_union_map_copy(umap)); test = isl_union_map_apply_range(test, isl_union_map_copy(umap)); sv = union_map_forall(test, &is_subset_of_identity); isl_union_map_free(test); return sv; } int isl_union_map_is_injective(__isl_keep isl_union_map *umap) { int in; umap = isl_union_map_copy(umap); umap = isl_union_map_reverse(umap); in = isl_union_map_is_single_valued(umap); isl_union_map_free(umap); return in; } /* Represents a map that has a fixed value (v) for one of its * range dimensions. * The map in this structure is not reference counted, so it * is only valid while the isl_union_map from which it was * obtained is still alive. */ struct isl_fixed_map { isl_int v; isl_map *map; }; static struct isl_fixed_map *alloc_isl_fixed_map_array(isl_ctx *ctx, int n) { int i; struct isl_fixed_map *v; v = isl_calloc_array(ctx, struct isl_fixed_map, n); if (!v) return NULL; for (i = 0; i < n; ++i) isl_int_init(v[i].v); return v; } static void free_isl_fixed_map_array(struct isl_fixed_map *v, int n) { int i; if (!v) return; for (i = 0; i < n; ++i) isl_int_clear(v[i].v); free(v); } /* Compare the "v" field of two isl_fixed_map structs. */ static int qsort_fixed_map_cmp(const void *p1, const void *p2) { const struct isl_fixed_map *e1 = (const struct isl_fixed_map *) p1; const struct isl_fixed_map *e2 = (const struct isl_fixed_map *) p2; return isl_int_cmp(e1->v, e2->v); } /* Internal data structure used while checking whether all maps * in a union_map have a fixed value for a given output dimension. * v is the list of maps, with the fixed value for the dimension * n is the number of maps considered so far * pos is the output dimension under investigation */ struct isl_fixed_dim_data { struct isl_fixed_map *v; int n; int pos; }; static int fixed_at_pos(__isl_keep isl_map *map, void *user) { struct isl_fixed_dim_data *data = user; data->v[data->n].map = map; return isl_map_plain_is_fixed(map, isl_dim_out, data->pos, &data->v[data->n++].v); } static int plain_injective_on_range(__isl_take isl_union_map *umap, int first, int n_range); /* Given a list of the maps, with their fixed values at output dimension "pos", * check whether the ranges of the maps form an obvious partition. * * We first sort the maps according to their fixed values. * If all maps have a different value, then we know the ranges form * a partition. * Otherwise, we collect the maps with the same fixed value and * check whether each such collection is obviously injective * based on later dimensions. */ static int separates(struct isl_fixed_map *v, int n, __isl_take isl_space *dim, int pos, int n_range) { int i; if (!v) goto error; qsort(v, n, sizeof(*v), &qsort_fixed_map_cmp); for (i = 0; i + 1 < n; ++i) { int j, k; isl_union_map *part; int injective; for (j = i + 1; j < n; ++j) if (isl_int_ne(v[i].v, v[j].v)) break; if (j == i + 1) continue; part = isl_union_map_alloc(isl_space_copy(dim), j - i); for (k = i; k < j; ++k) part = isl_union_map_add_map(part, isl_map_copy(v[k].map)); injective = plain_injective_on_range(part, pos + 1, n_range); if (injective < 0) goto error; if (!injective) break; i = j - 1; } isl_space_free(dim); free_isl_fixed_map_array(v, n); return i + 1 >= n; error: isl_space_free(dim); free_isl_fixed_map_array(v, n); return -1; } /* Check whether the maps in umap have obviously distinct ranges. * In particular, check for an output dimension in the range * [first,n_range) for which all maps have a fixed value * and then check if these values, possibly along with fixed values * at later dimensions, entail distinct ranges. */ static int plain_injective_on_range(__isl_take isl_union_map *umap, int first, int n_range) { isl_ctx *ctx; int n; struct isl_fixed_dim_data data = { NULL }; ctx = isl_union_map_get_ctx(umap); n = isl_union_map_n_map(umap); if (!umap) goto error; if (n <= 1) { isl_union_map_free(umap); return 1; } if (first >= n_range) { isl_union_map_free(umap); return 0; } data.v = alloc_isl_fixed_map_array(ctx, n); if (!data.v) goto error; for (data.pos = first; data.pos < n_range; ++data.pos) { int fixed; int injective; isl_space *dim; data.n = 0; fixed = union_map_forall_user(umap, &fixed_at_pos, &data); if (fixed < 0) goto error; if (!fixed) continue; dim = isl_union_map_get_space(umap); injective = separates(data.v, n, dim, data.pos, n_range); isl_union_map_free(umap); return injective; } free_isl_fixed_map_array(data.v, n); isl_union_map_free(umap); return 0; error: free_isl_fixed_map_array(data.v, n); isl_union_map_free(umap); return -1; } /* Check whether the maps in umap that map to subsets of "ran" * have obviously distinct ranges. */ static int plain_injective_on_range_wrap(__isl_keep isl_set *ran, void *user) { isl_union_map *umap = user; umap = isl_union_map_copy(umap); umap = isl_union_map_intersect_range(umap, isl_union_set_from_set(isl_set_copy(ran))); return plain_injective_on_range(umap, 0, isl_set_dim(ran, isl_dim_set)); } /* Check if the given union_map is obviously injective. * * In particular, we first check if all individual maps are obviously * injective and then check if all the ranges of these maps are * obviously disjoint. */ int isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap) { int in; isl_union_map *univ; isl_union_set *ran; in = union_map_forall(umap, &isl_map_plain_is_injective); if (in < 0) return -1; if (!in) return 0; univ = isl_union_map_universe(isl_union_map_copy(umap)); ran = isl_union_map_range(univ); in = union_map_forall_user(ran, &plain_injective_on_range_wrap, umap); isl_union_set_free(ran); return in; } int isl_union_map_is_bijective(__isl_keep isl_union_map *umap) { int sv; sv = isl_union_map_is_single_valued(umap); if (sv < 0 || !sv) return sv; return isl_union_map_is_injective(umap); } static int zip_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_can_zip(map)) return 0; *res = isl_union_map_add_map(*res, isl_map_zip(isl_map_copy(map))); return 0; } __isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap) { return cond_un_op(umap, &zip_entry); } static int uncurry_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_can_uncurry(map)) return 0; *res = isl_union_map_add_map(*res, isl_map_uncurry(isl_map_copy(map))); return 0; } /* Given a union map, take the maps of the form A -> (B -> C) and * return the union of the corresponding maps (A -> B) -> C. */ __isl_give isl_union_map *isl_union_map_uncurry(__isl_take isl_union_map *umap) { return cond_un_op(umap, &uncurry_entry); } static int curry_entry(void **entry, void *user) { isl_map *map = *entry; isl_union_map **res = user; if (!isl_map_can_curry(map)) return 0; *res = isl_union_map_add_map(*res, isl_map_curry(isl_map_copy(map))); return 0; } /* Given a union map, take the maps of the form (A -> B) -> C and * return the union of the corresponding maps A -> (B -> C). */ __isl_give isl_union_map *isl_union_map_curry(__isl_take isl_union_map *umap) { return cond_un_op(umap, &curry_entry); } static int lift_entry(void **entry, void *user) { isl_set *set = *entry; isl_union_set **res = user; *res = isl_union_set_add_set(*res, isl_set_lift(isl_set_copy(set))); return 0; } __isl_give isl_union_set *isl_union_set_lift(__isl_take isl_union_set *uset) { return cond_un_op(uset, &lift_entry); } static int coefficients_entry(void **entry, void *user) { isl_set *set = *entry; isl_union_set **res = user; set = isl_set_copy(set); set = isl_set_from_basic_set(isl_set_coefficients(set)); *res = isl_union_set_add_set(*res, set); return 0; } __isl_give isl_union_set *isl_union_set_coefficients( __isl_take isl_union_set *uset) { isl_ctx *ctx; isl_space *dim; isl_union_set *res; if (!uset) return NULL; ctx = isl_union_set_get_ctx(uset); dim = isl_space_set_alloc(ctx, 0, 0); res = isl_union_map_alloc(dim, uset->table.n); if (isl_hash_table_foreach(uset->dim->ctx, &uset->table, &coefficients_entry, &res) < 0) goto error; isl_union_set_free(uset); return res; error: isl_union_set_free(uset); isl_union_set_free(res); return NULL; } static int solutions_entry(void **entry, void *user) { isl_set *set = *entry; isl_union_set **res = user; set = isl_set_copy(set); set = isl_set_from_basic_set(isl_set_solutions(set)); if (!*res) *res = isl_union_set_from_set(set); else *res = isl_union_set_add_set(*res, set); if (!*res) return -1; return 0; } __isl_give isl_union_set *isl_union_set_solutions( __isl_take isl_union_set *uset) { isl_union_set *res = NULL; if (!uset) return NULL; if (uset->table.n == 0) { res = isl_union_set_empty(isl_union_set_get_space(uset)); isl_union_set_free(uset); return res; } if (isl_hash_table_foreach(uset->dim->ctx, &uset->table, &solutions_entry, &res) < 0) goto error; isl_union_set_free(uset); return res; error: isl_union_set_free(uset); isl_union_set_free(res); return NULL; } /* Internal data structure for isl_union_map_preimage_domain_multi_aff. * * "ma" is the function under which the preimage should be taken. * "space" is the space of "ma". * "res" collects the results. */ struct isl_union_map_preimage_domain_data { isl_space *space; isl_multi_aff *ma; isl_union_map *res; }; /* Compute the preimage of the domain of *entry under the function * represented by data->ma, provided the domain space of *entry * match the target space of data->ma, and add the result to data->res. */ static int preimage_domain_entry(void **entry, void *user) { int m; isl_map *map = *entry; struct isl_union_map_preimage_domain_data *data = user; int empty; m = isl_space_tuple_match(map->dim, isl_dim_in, data->space, isl_dim_out); if (m < 0) return -1; if (!m) return 0; map = isl_map_copy(map); map = isl_map_preimage_domain_multi_aff(map, isl_multi_aff_copy(data->ma)); empty = isl_map_is_empty(map); if (empty < 0 || empty) { isl_map_free(map); return empty < 0 ? -1 : 0; } data->res = isl_union_map_add_map(data->res, map); return 0; } /* Compute the preimage of the domain of "umap" under the function * represented by "ma". * In other words, plug in "ma" in the domain of "umap". * The result contains maps that live in the same spaces as the maps of "umap" * with domain space equal to the target space of "ma", * except that the domain has been replaced by the domain space of "ma". */ __isl_give isl_union_map *isl_union_map_preimage_domain_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma) { isl_ctx *ctx; isl_space *space; struct isl_union_map_preimage_domain_data data; if (!umap || !ma) goto error; ctx = isl_union_map_get_ctx(umap); space = isl_union_map_get_space(umap); data.space = isl_multi_aff_get_space(ma); data.ma = ma; data.res = isl_union_map_alloc(space, umap->table.n); if (isl_hash_table_foreach(ctx, &umap->table, &preimage_domain_entry, &data) < 0) data.res = isl_union_map_free(data.res); isl_space_free(data.space); isl_union_map_free(umap); isl_multi_aff_free(ma); return data.res; error: isl_union_map_free(umap); isl_multi_aff_free(ma); return NULL; } cloog-0.18.2/isl/isl_factorization.h0000664000175000017500000000131512254313240014307 00000000000000#include #include #if defined(__cplusplus) extern "C" { #endif /* Data for factorizing a particular basic set. * After applying "morph" to the basic set, there are "n_group" * groups of consecutive set variables, each of length "len[i]", * with 0 <= i < n_group. * If no factorization is possible, then "n_group" is set to 0. */ struct isl_factorizer { isl_morph *morph; int n_group; int *len; }; typedef struct isl_factorizer isl_factorizer; __isl_give isl_factorizer *isl_basic_set_factorizer( __isl_keep isl_basic_set *bset); void isl_factorizer_free(__isl_take isl_factorizer *f); void isl_factorizer_dump(__isl_take isl_factorizer *f); #if defined(__cplusplus) } #endif cloog-0.18.2/isl/isl_polynomial_private.h0000664000175000017500000001741712254313240015362 00000000000000#include #include #include #include #include #include struct isl_upoly { int ref; struct isl_ctx *ctx; int var; }; struct isl_upoly_cst { struct isl_upoly up; isl_int n; isl_int d; }; struct isl_upoly_rec { struct isl_upoly up; int n; size_t size; struct isl_upoly *p[]; }; /* dim represents the domain space. */ struct isl_qpolynomial { int ref; isl_space *dim; struct isl_mat *div; struct isl_upoly *upoly; }; struct isl_term { int ref; isl_int n; isl_int d; isl_space *dim; struct isl_mat *div; int pow[1]; }; struct isl_pw_qpolynomial_piece { struct isl_set *set; struct isl_qpolynomial *qp; }; struct isl_pw_qpolynomial { int ref; isl_space *dim; int n; size_t size; struct isl_pw_qpolynomial_piece p[1]; }; /* dim represents the domain space. */ struct isl_qpolynomial_fold { int ref; enum isl_fold type; isl_space *dim; int n; size_t size; struct isl_qpolynomial *qp[1]; }; struct isl_pw_qpolynomial_fold_piece { struct isl_set *set; struct isl_qpolynomial_fold *fold; }; struct isl_pw_qpolynomial_fold { int ref; enum isl_fold type; isl_space *dim; int n; size_t size; struct isl_pw_qpolynomial_fold_piece p[1]; }; __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx); __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up); __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up); __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up); void isl_upoly_free(__isl_take struct isl_upoly *up); __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1, __isl_take struct isl_upoly *up2); int isl_upoly_is_cst(__isl_keep struct isl_upoly *up); int isl_upoly_is_zero(__isl_keep struct isl_upoly *up); int isl_upoly_is_one(__isl_keep struct isl_upoly *up); int isl_upoly_is_negone(__isl_keep struct isl_upoly *up); __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up); __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up); __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1, __isl_take struct isl_upoly *up2); __isl_give struct isl_upoly *isl_upoly_mul_isl_int( __isl_take struct isl_upoly *up, isl_int v); __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_space *dim, unsigned n_div, __isl_take struct isl_upoly *up); __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_cst_on_domain(__isl_take isl_space *dim, isl_int v); __isl_give isl_qpolynomial *isl_qpolynomial_var_pow_on_domain(__isl_take isl_space *dim, int pos, int power); int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain( __isl_keep isl_set *dom, __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1, __isl_keep isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_max_cst( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_min_cst( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly); __isl_give isl_qpolynomial *isl_qpolynomial_coeff( __isl_keep isl_qpolynomial *poly, enum isl_dim_type type, unsigned pos, int deg); __isl_give isl_vec *isl_qpolynomial_extract_affine( __isl_keep isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_space *dim, isl_int *f, isl_int denom); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_cow( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_piece( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_set *set, __isl_take isl_qpolynomial *qp); int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_project_out( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max); enum isl_fold isl_fold_type_negate(enum isl_fold type); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_cow( __isl_take isl_qpolynomial_fold *fold); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_dup( __isl_keep isl_qpolynomial_fold *fold); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_cow( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_on_domain( __isl_keep isl_set *set, __isl_take isl_qpolynomial_fold *fold1, __isl_take isl_qpolynomial_fold *fold2); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold_on_domain( __isl_keep isl_set *set, __isl_take isl_qpolynomial_fold *fold1, __isl_take isl_qpolynomial_fold *fold2); __isl_give isl_qpolynomial *isl_qpolynomial_fold_opt_on_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *set, int max); int isl_pw_qpolynomial_fold_covers(__isl_keep isl_pw_qpolynomial_fold *pwf1, __isl_keep isl_pw_qpolynomial_fold *pwf2); __isl_give isl_qpolynomial *isl_qpolynomial_morph_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_morph *morph); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_morph_domain( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_morph *morph); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_morph_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_morph *morph); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_morph_domain( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_morph *morph); __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp, __isl_take isl_space *dim); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_lift( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim); __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities( __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute_equalities( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_basic_set *eq); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context); __isl_give isl_qpolynomial *isl_qpolynomial_realign_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_realign_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_reordering *r); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_realign_domain( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_reordering *r); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_realign_domain( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_reordering *r); __isl_give isl_qpolynomial *isl_qpolynomial_reset_domain_space( __isl_take isl_qpolynomial *qp, __isl_take isl_space *dim); __isl_give isl_qpolynomial *isl_qpolynomial_reset_space_and_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_space *space, __isl_take isl_space *domain); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_domain_space( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_space_and_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *space, __isl_take isl_space *domain); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_reset_domain_space( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_space *dim); cloog-0.18.2/isl/isl_seq.c0000664000175000017500000001404012254313240012215 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include void isl_seq_clr(isl_int *p, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_set_si(p[i], 0); } void isl_seq_set_si(isl_int *p, int v, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_set_si(p[i], v); } void isl_seq_set(isl_int *p, isl_int v, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_set(p[i], v); } void isl_seq_neg(isl_int *dst, isl_int *src, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_neg(dst[i], src[i]); } void isl_seq_cpy(isl_int *dst, isl_int *src, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_set(dst[i], src[i]); } void isl_seq_submul(isl_int *dst, isl_int f, isl_int *src, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_submul(dst[i], f, src[i]); } void isl_seq_addmul(isl_int *dst, isl_int f, isl_int *src, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_addmul(dst[i], f, src[i]); } void isl_seq_swp_or_cpy(isl_int *dst, isl_int *src, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_swap_or_set(dst[i], src[i]); } void isl_seq_scale(isl_int *dst, isl_int *src, isl_int m, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_mul(dst[i], src[i], m); } void isl_seq_scale_down(isl_int *dst, isl_int *src, isl_int m, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_divexact(dst[i], src[i], m); } void isl_seq_cdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_cdiv_q(dst[i], src[i], m); } void isl_seq_fdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_fdiv_q(dst[i], src[i], m); } void isl_seq_fdiv_r(isl_int *dst, isl_int *src, isl_int m, unsigned len) { int i; for (i = 0; i < len; ++i) isl_int_fdiv_r(dst[i], src[i], m); } void isl_seq_combine(isl_int *dst, isl_int m1, isl_int *src1, isl_int m2, isl_int *src2, unsigned len) { int i; isl_int tmp; isl_int_init(tmp); for (i = 0; i < len; ++i) { isl_int_mul(tmp, m1, src1[i]); isl_int_addmul(tmp, m2, src2[i]); isl_int_set(dst[i], tmp); } isl_int_clear(tmp); } /* * Let d = dst[pos] and s = src[pos] * dst is replaced by |s| dst - sgn(s)d src */ void isl_seq_elim(isl_int *dst, isl_int *src, unsigned pos, unsigned len, isl_int *m) { isl_int a; isl_int b; if (isl_int_is_zero(dst[pos])) return; isl_int_init(a); isl_int_init(b); isl_int_gcd(a, src[pos], dst[pos]); isl_int_divexact(b, dst[pos], a); if (isl_int_is_pos(src[pos])) isl_int_neg(b, b); isl_int_divexact(a, src[pos], a); isl_int_abs(a, a); isl_seq_combine(dst, a, dst, b, src, len); if (m) isl_int_mul(*m, *m, a); isl_int_clear(a); isl_int_clear(b); } int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len) { int i; for (i = 0; i < len; ++i) if (isl_int_ne(p1[i], p2[i])) return 0; return 1; } int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len) { int i; int cmp; for (i = 0; i < len; ++i) if ((cmp = isl_int_cmp(p1[i], p2[i])) != 0) return cmp; return 0; } int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len) { int i; for (i = 0; i < len; ++i) { if (isl_int_abs_ne(p1[i], p2[i])) return 0; if (isl_int_is_zero(p1[i])) continue; if (isl_int_eq(p1[i], p2[i])) return 0; } return 1; } int isl_seq_first_non_zero(isl_int *p, unsigned len) { int i; for (i = 0; i < len; ++i) if (!isl_int_is_zero(p[i])) return i; return -1; } int isl_seq_last_non_zero(isl_int *p, unsigned len) { int i; for (i = len - 1; i >= 0; --i) if (!isl_int_is_zero(p[i])) return i; return -1; } void isl_seq_abs_max(isl_int *p, unsigned len, isl_int *max) { int i; isl_int_set_si(*max, 0); for (i = 0; i < len; ++i) if (isl_int_abs_gt(p[i], *max)) isl_int_abs(*max, p[i]); } int isl_seq_abs_min_non_zero(isl_int *p, unsigned len) { int i, min = isl_seq_first_non_zero(p, len); if (min < 0) return -1; for (i = min + 1; i < len; ++i) { if (isl_int_is_zero(p[i])) continue; if (isl_int_abs_lt(p[i], p[min])) min = i; } return min; } void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd) { int i, min = isl_seq_abs_min_non_zero(p, len); if (min < 0) { isl_int_set_si(*gcd, 0); return; } isl_int_abs(*gcd, p[min]); for (i = 0; isl_int_cmp_si(*gcd, 1) > 0 && i < len; ++i) { if (i == min) continue; if (isl_int_is_zero(p[i])) continue; isl_int_gcd(*gcd, *gcd, p[i]); } } void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len) { if (len == 0) return; isl_seq_gcd(p, len, &ctx->normalize_gcd); if (!isl_int_is_zero(ctx->normalize_gcd) && !isl_int_is_one(ctx->normalize_gcd)) isl_seq_scale_down(p, p, ctx->normalize_gcd, len); } void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm) { int i; if (len == 0) { isl_int_set_si(*lcm, 1); return; } isl_int_set(*lcm, p[0]); for (i = 1; i < len; ++i) isl_int_lcm(*lcm, *lcm, p[i]); } void isl_seq_inner_product(isl_int *p1, isl_int *p2, unsigned len, isl_int *prod) { int i; if (len == 0) { isl_int_set_si(*prod, 0); return; } isl_int_mul(*prod, p1[0], p2[0]); for (i = 1; i < len; ++i) isl_int_addmul(*prod, p1[i], p2[i]); } uint32_t isl_seq_hash(isl_int *p, unsigned len, uint32_t hash) { int i; for (i = 0; i < len; ++i) { if (isl_int_is_zero(p[i])) continue; hash *= 16777619; hash ^= (i & 0xFF); hash = isl_int_hash(p[i], hash); } return hash; } uint32_t isl_seq_get_hash(isl_int *p, unsigned len) { uint32_t hash = isl_hash_init(); return isl_seq_hash(p, len, hash); } uint32_t isl_seq_get_hash_bits(isl_int *p, unsigned len, unsigned bits) { uint32_t hash; hash = isl_seq_get_hash(p, len); return isl_hash_bits(hash, bits); } void isl_seq_dump(isl_int *p, unsigned len) { int i; for (i = 0; i < len; ++i) { if (i) fprintf(stderr, " "); isl_int_print(stderr, p[i], 0); } fprintf(stderr, "\n"); } cloog-0.18.2/isl/isl_ast_build_expr.c0000664000175000017500000006377212254313240014451 00000000000000/* * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include /* Compute the "opposite" of the (numerator of the) argument of a div * with denonimator "d". * * In particular, compute * * -aff + (d - 1) */ static __isl_give isl_aff *oppose_div_arg(__isl_take isl_aff *aff, __isl_take isl_val *d) { aff = isl_aff_neg(aff); aff = isl_aff_add_constant_val(aff, d); aff = isl_aff_add_constant_si(aff, -1); return aff; } /* Create an isl_ast_expr evaluating the div at position "pos" in "ls". * The result is simplified in terms of build->domain. * * *change_sign is set by this function if the sign of * the expression has changed. * "ls" is known to be non-NULL. * * Let the div be of the form floor(e/d). * If the ast_build_prefer_pdiv option is set then we check if "e" * is non-negative, so that we can generate * * (pdiv_q, expr(e), expr(d)) * * instead of * * (fdiv_q, expr(e), expr(d)) * * If the ast_build_prefer_pdiv option is set and * if "e" is not non-negative, then we check if "-e + d - 1" is non-negative. * If so, we can rewrite * * floor(e/d) = -ceil(-e/d) = -floor((-e + d - 1)/d) * * and still use pdiv_q. */ static __isl_give isl_ast_expr *var_div(int *change_sign, __isl_keep isl_local_space *ls, int pos, __isl_keep isl_ast_build *build) { isl_ctx *ctx = isl_local_space_get_ctx(ls); isl_aff *aff; isl_ast_expr *num, *den; isl_val *d; enum isl_ast_op_type type; aff = isl_local_space_get_div(ls, pos); d = isl_aff_get_denominator_val(aff); aff = isl_aff_scale_val(aff, isl_val_copy(d)); den = isl_ast_expr_from_val(isl_val_copy(d)); type = isl_ast_op_fdiv_q; if (isl_options_get_ast_build_prefer_pdiv(ctx)) { int non_neg = isl_ast_build_aff_is_nonneg(build, aff); if (non_neg >= 0 && !non_neg) { isl_aff *opp = oppose_div_arg(isl_aff_copy(aff), isl_val_copy(d)); non_neg = isl_ast_build_aff_is_nonneg(build, opp); if (non_neg >= 0 && non_neg) { *change_sign = 1; isl_aff_free(aff); aff = opp; } else isl_aff_free(opp); } if (non_neg < 0) aff = isl_aff_free(aff); else if (non_neg) type = isl_ast_op_pdiv_q; } isl_val_free(d); num = isl_ast_expr_from_aff(aff, build); return isl_ast_expr_alloc_binary(type, num, den); } /* Create an isl_ast_expr evaluating the specified dimension of "ls". * The result is simplified in terms of build->domain. * * *change_sign is set by this function if the sign of * the expression has changed. * * The isl_ast_expr is constructed based on the type of the dimension. * - divs are constructed by var_div * - set variables are constructed from the iterator isl_ids in "build" * - parameters are constructed from the isl_ids in "ls" */ static __isl_give isl_ast_expr *var(int *change_sign, __isl_keep isl_local_space *ls, enum isl_dim_type type, int pos, __isl_keep isl_ast_build *build) { isl_ctx *ctx = isl_local_space_get_ctx(ls); isl_id *id; if (type == isl_dim_div) return var_div(change_sign, ls, pos, build); if (type == isl_dim_set) { id = isl_ast_build_get_iterator_id(build, pos); return isl_ast_expr_from_id(id); } if (!isl_local_space_has_dim_id(ls, type, pos)) isl_die(ctx, isl_error_internal, "unnamed dimension", return NULL); id = isl_local_space_get_dim_id(ls, type, pos); return isl_ast_expr_from_id(id); } /* Does "expr" represent the zero integer? */ static int ast_expr_is_zero(__isl_keep isl_ast_expr *expr) { if (!expr) return -1; if (expr->type != isl_ast_expr_int) return 0; return isl_val_is_zero(expr->u.v); } /* Create an expression representing the sum of "expr1" and "expr2", * provided neither of the two expressions is identically zero. */ static __isl_give isl_ast_expr *ast_expr_add(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { if (!expr1 || !expr2) goto error; if (ast_expr_is_zero(expr1)) { isl_ast_expr_free(expr1); return expr2; } if (ast_expr_is_zero(expr2)) { isl_ast_expr_free(expr2); return expr1; } return isl_ast_expr_add(expr1, expr2); error: isl_ast_expr_free(expr1); isl_ast_expr_free(expr2); return NULL; } /* Subtract expr2 from expr1. * * If expr2 is zero, we simply return expr1. * If expr1 is zero, we return * * (isl_ast_op_minus, expr2) * * Otherwise, we return * * (isl_ast_op_sub, expr1, expr2) */ static __isl_give isl_ast_expr *ast_expr_sub(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { if (!expr1 || !expr2) goto error; if (ast_expr_is_zero(expr2)) { isl_ast_expr_free(expr2); return expr1; } if (ast_expr_is_zero(expr1)) { isl_ast_expr_free(expr1); return isl_ast_expr_neg(expr2); } return isl_ast_expr_sub(expr1, expr2); error: isl_ast_expr_free(expr1); isl_ast_expr_free(expr2); return NULL; } /* Return an isl_ast_expr that represents * * v * (aff mod d) * * v is assumed to be non-negative. * The result is simplified in terms of build->domain. */ static __isl_give isl_ast_expr *isl_ast_expr_mod(__isl_keep isl_val *v, __isl_keep isl_aff *aff, __isl_keep isl_val *d, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_ast_expr *expr; isl_ast_expr *c; if (!aff) return NULL; ctx = isl_aff_get_ctx(aff); expr = isl_ast_expr_from_aff(isl_aff_copy(aff), build); c = isl_ast_expr_from_val(isl_val_copy(d)); expr = isl_ast_expr_alloc_binary(isl_ast_op_pdiv_r, expr, c); if (!isl_val_is_one(v)) { c = isl_ast_expr_from_val(isl_val_copy(v)); expr = isl_ast_expr_mul(c, expr); } return expr; } /* Create an isl_ast_expr that scales "expr" by "v". * * If v is 1, we simply return expr. * If v is -1, we return * * (isl_ast_op_minus, expr) * * Otherwise, we return * * (isl_ast_op_mul, expr(v), expr) */ static __isl_give isl_ast_expr *scale(__isl_take isl_ast_expr *expr, __isl_take isl_val *v) { isl_ast_expr *c; if (!expr || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return expr; } if (isl_val_is_negone(v)) { isl_val_free(v); expr = isl_ast_expr_neg(expr); } else { c = isl_ast_expr_from_val(v); expr = isl_ast_expr_mul(c, expr); } return expr; error: isl_val_free(v); isl_ast_expr_free(expr); return NULL; } /* Add an expression for "*v" times the specified dimension of "ls" * to expr. * * Let e be the expression for the specified dimension, * multiplied by the absolute value of "*v". * If "*v" is negative, we create * * (isl_ast_op_sub, expr, e) * * except when expr is trivially zero, in which case we create * * (isl_ast_op_minus, e) * * instead. * * If "*v" is positive, we simply create * * (isl_ast_op_add, expr, e) * */ static __isl_give isl_ast_expr *isl_ast_expr_add_term( __isl_take isl_ast_expr *expr, __isl_keep isl_local_space *ls, enum isl_dim_type type, int pos, __isl_take isl_val *v, __isl_keep isl_ast_build *build) { isl_ast_expr *term; int change_sign; if (!expr) return NULL; change_sign = 0; term = var(&change_sign, ls, type, pos, build); if (change_sign) v = isl_val_neg(v); if (isl_val_is_neg(v) && !ast_expr_is_zero(expr)) { v = isl_val_neg(v); term = scale(term, v); return ast_expr_sub(expr, term); } else { term = scale(term, v); return ast_expr_add(expr, term); } } /* Add an expression for "v" to expr. */ static __isl_give isl_ast_expr *isl_ast_expr_add_int( __isl_take isl_ast_expr *expr, __isl_take isl_val *v) { isl_ctx *ctx; isl_ast_expr *expr_int; if (!expr || !v) goto error; if (isl_val_is_zero(v)) { isl_val_free(v); return expr; } ctx = isl_ast_expr_get_ctx(expr); if (isl_val_is_neg(v) && !ast_expr_is_zero(expr)) { v = isl_val_neg(v); expr_int = isl_ast_expr_from_val(v); return ast_expr_sub(expr, expr_int); } else { expr_int = isl_ast_expr_from_val(v); return ast_expr_add(expr, expr_int); } error: isl_ast_expr_free(expr); isl_val_free(v); return NULL; } /* Check if "aff" involves any (implicit) modulo computations based * on div "j". * If so, remove them from aff and add expressions corresponding * to those modulo computations to *pos and/or *neg. * "v" is the coefficient of div "j". * * In particular, check if (v * div_j) / d is of the form * * (f * m * floor(a / m)) / d * * and, if so, rewrite it as * * (f * (a - (a mod m))) / d = (f * a) / d - (f * (a mod m)) / d * * and extract out -f * (a mod m). * In particular, if f > 0, we add (f * (a mod m)) to *neg. * If f < 0, we add ((-f) * (a mod m)) to *pos. * * Note that in order to represent "a mod m" as * * (isl_ast_op_pdiv_r, a, m) * * we need to make sure that a is non-negative. * If not, we check if "-a + m - 1" is non-negative. * If so, we can rewrite * * floor(a/m) = -ceil(-a/m) = -floor((-a + m - 1)/m) * * and still extract a modulo. * * The caller is responsible for dividing *neg and/or *pos by d. */ static __isl_give isl_aff *extract_modulo(__isl_take isl_aff *aff, __isl_keep isl_ast_expr **pos, __isl_keep isl_ast_expr **neg, __isl_keep isl_ast_build *build, int j, __isl_take isl_val *v) { isl_ast_expr *expr; isl_aff *div; int s; int mod; isl_val *d; div = isl_aff_get_div(aff, j); d = isl_aff_get_denominator_val(div); mod = isl_val_is_divisible_by(v, d); if (mod) { div = isl_aff_scale_val(div, isl_val_copy(d)); mod = isl_ast_build_aff_is_nonneg(build, div); if (mod >= 0 && !mod) { isl_aff *opp = oppose_div_arg(isl_aff_copy(div), isl_val_copy(d)); mod = isl_ast_build_aff_is_nonneg(build, opp); if (mod >= 0 && mod) { isl_aff_free(div); div = opp; v = isl_val_neg(v); } else isl_aff_free(opp); } } if (mod < 0) { isl_aff_free(div); isl_val_free(d); isl_val_free(v); return isl_aff_free(aff); } else if (!mod) { isl_aff_free(div); isl_val_free(d); isl_val_free(v); return aff; } v = isl_val_div(v, isl_val_copy(d)); s = isl_val_sgn(v); v = isl_val_abs(v); expr = isl_ast_expr_mod(v, div, d, build); isl_val_free(d); if (s > 0) *neg = ast_expr_add(*neg, expr); else *pos = ast_expr_add(*pos, expr); aff = isl_aff_set_coefficient_si(aff, isl_dim_div, j, 0); if (s < 0) v = isl_val_neg(v); div = isl_aff_scale_val(div, v); d = isl_aff_get_denominator_val(aff); div = isl_aff_scale_down_val(div, d); aff = isl_aff_add(aff, div); return aff; } /* Check if "aff" involves any (implicit) modulo computations. * If so, remove them from aff and add expressions corresponding * to those modulo computations to *pos and/or *neg. * We only do this if the option ast_build_prefer_pdiv is set. * * "aff" is assumed to be an integer affine expression. * * A modulo expression is of the form * * a mod m = a - m * floor(a / m) * * To detect them in aff, we look for terms of the form * * f * m * floor(a / m) * * rewrite them as * * f * (a - (a mod m)) = f * a - f * (a mod m) * * and extract out -f * (a mod m). * In particular, if f > 0, we add (f * (a mod m)) to *neg. * If f < 0, we add ((-f) * (a mod m)) to *pos. */ static __isl_give isl_aff *extract_modulos(__isl_take isl_aff *aff, __isl_keep isl_ast_expr **pos, __isl_keep isl_ast_expr **neg, __isl_keep isl_ast_build *build) { isl_ctx *ctx; int j, n; if (!aff) return NULL; ctx = isl_aff_get_ctx(aff); if (!isl_options_get_ast_build_prefer_pdiv(ctx)) return aff; n = isl_aff_dim(aff, isl_dim_div); for (j = 0; j < n; ++j) { isl_val *v; v = isl_aff_get_coefficient_val(aff, isl_dim_div, j); if (!v) return isl_aff_free(aff); if (isl_val_is_zero(v) || isl_val_is_one(v) || isl_val_is_negone(v)) { isl_val_free(v); continue; } aff = extract_modulo(aff, pos, neg, build, j, v); if (!aff) break; } return aff; } /* Construct an isl_ast_expr that evaluates the affine expression "aff", * The result is simplified in terms of build->domain. * * We first extract hidden modulo computations from the affine expression * and then add terms for each variable with a non-zero coefficient. * Finally, if the affine expression has a non-trivial denominator, * we divide the resulting isl_ast_expr by this denominator. */ __isl_give isl_ast_expr *isl_ast_expr_from_aff(__isl_take isl_aff *aff, __isl_keep isl_ast_build *build) { int i, j; int n; isl_val *v, *d; isl_ctx *ctx = isl_aff_get_ctx(aff); isl_ast_expr *expr, *expr_neg; enum isl_dim_type t[] = { isl_dim_param, isl_dim_in, isl_dim_div }; enum isl_dim_type l[] = { isl_dim_param, isl_dim_set, isl_dim_div }; isl_local_space *ls; if (!aff) return NULL; expr = isl_ast_expr_alloc_int_si(ctx, 0); expr_neg = isl_ast_expr_alloc_int_si(ctx, 0); d = isl_aff_get_denominator_val(aff); aff = isl_aff_scale_val(aff, isl_val_copy(d)); aff = extract_modulos(aff, &expr, &expr_neg, build); expr = ast_expr_sub(expr, expr_neg); ls = isl_aff_get_domain_local_space(aff); for (i = 0; i < 3; ++i) { n = isl_aff_dim(aff, t[i]); for (j = 0; j < n; ++j) { v = isl_aff_get_coefficient_val(aff, t[i], j); if (!v) expr = isl_ast_expr_free(expr); if (isl_val_is_zero(v)) { isl_val_free(v); continue; } expr = isl_ast_expr_add_term(expr, ls, l[i], j, v, build); } } v = isl_aff_get_constant_val(aff); expr = isl_ast_expr_add_int(expr, v); if (!isl_val_is_one(d)) expr = isl_ast_expr_div(expr, isl_ast_expr_from_val(d)); else isl_val_free(d); isl_local_space_free(ls); isl_aff_free(aff); return expr; } /* Add terms to "expr" for each variable in "aff" with a coefficient * with sign equal to "sign". * The result is simplified in terms of build->domain. */ static __isl_give isl_ast_expr *add_signed_terms(__isl_take isl_ast_expr *expr, __isl_keep isl_aff *aff, int sign, __isl_keep isl_ast_build *build) { int i, j; isl_val *v; enum isl_dim_type t[] = { isl_dim_param, isl_dim_in, isl_dim_div }; enum isl_dim_type l[] = { isl_dim_param, isl_dim_set, isl_dim_div }; isl_local_space *ls; ls = isl_aff_get_domain_local_space(aff); for (i = 0; i < 3; ++i) { int n = isl_aff_dim(aff, t[i]); for (j = 0; j < n; ++j) { v = isl_aff_get_coefficient_val(aff, t[i], j); if (sign * isl_val_sgn(v) <= 0) { isl_val_free(v); continue; } v = isl_val_abs(v); expr = isl_ast_expr_add_term(expr, ls, l[i], j, v, build); } } isl_local_space_free(ls); return expr; } /* Should the constant term "v" be considered positive? * * A positive constant will be added to "pos" by the caller, * while a negative constant will be added to "neg". * If either "pos" or "neg" is exactly zero, then we prefer * to add the constant "v" to that side, irrespective of the sign of "v". * This results in slightly shorter expressions and may reduce the risk * of overflows. */ static int constant_is_considered_positive(__isl_keep isl_val *v, __isl_keep isl_ast_expr *pos, __isl_keep isl_ast_expr *neg) { if (ast_expr_is_zero(pos)) return 1; if (ast_expr_is_zero(neg)) return 0; return isl_val_is_pos(v); } /* Construct an isl_ast_expr that evaluates the condition "constraint", * The result is simplified in terms of build->domain. * * Let the constraint by either "a >= 0" or "a == 0". * We first extract hidden modulo computations from "a" * and then collect all the terms with a positive coefficient in cons_pos * and the terms with a negative coefficient in cons_neg. * * The result is then of the form * * (isl_ast_op_ge, expr(pos), expr(-neg))) * * or * * (isl_ast_op_eq, expr(pos), expr(-neg))) * * However, if the first expression is an integer constant (and the second * is not), then we swap the two expressions. This ensures that we construct, * e.g., "i <= 5" rather than "5 >= i". * * Furthermore, is there are no terms with positive coefficients (or no terms * with negative coefficients), then the constant term is added to "pos" * (or "neg"), ignoring the sign of the constant term. */ static __isl_give isl_ast_expr *isl_ast_expr_from_constraint( __isl_take isl_constraint *constraint, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_ast_expr *expr_pos; isl_ast_expr *expr_neg; isl_ast_expr *expr; isl_aff *aff; isl_val *v; int eq; enum isl_ast_op_type type; if (!constraint) return NULL; aff = isl_constraint_get_aff(constraint); ctx = isl_constraint_get_ctx(constraint); expr_pos = isl_ast_expr_alloc_int_si(ctx, 0); expr_neg = isl_ast_expr_alloc_int_si(ctx, 0); aff = extract_modulos(aff, &expr_pos, &expr_neg, build); expr_pos = add_signed_terms(expr_pos, aff, 1, build); expr_neg = add_signed_terms(expr_neg, aff, -1, build); v = isl_aff_get_constant_val(aff); if (constant_is_considered_positive(v, expr_pos, expr_neg)) { expr_pos = isl_ast_expr_add_int(expr_pos, v); } else { v = isl_val_neg(v); expr_neg = isl_ast_expr_add_int(expr_neg, v); } eq = isl_constraint_is_equality(constraint); if (isl_ast_expr_get_type(expr_pos) == isl_ast_expr_int && isl_ast_expr_get_type(expr_neg) != isl_ast_expr_int) { type = eq ? isl_ast_op_eq : isl_ast_op_le; expr = isl_ast_expr_alloc_binary(type, expr_neg, expr_pos); } else { type = eq ? isl_ast_op_eq : isl_ast_op_ge; expr = isl_ast_expr_alloc_binary(type, expr_pos, expr_neg); } isl_constraint_free(constraint); isl_aff_free(aff); return expr; } struct isl_expr_from_basic_data { isl_ast_build *build; int first; isl_ast_expr *res; }; /* Construct an isl_ast_expr that evaluates the condition "c", * except if it is a div constraint, and add it to the data->res. * The result is simplified in terms of data->build->domain. */ static int expr_from_basic_set(__isl_take isl_constraint *c, void *user) { struct isl_expr_from_basic_data *data = user; isl_ast_expr *expr; if (isl_constraint_is_div_constraint(c)) { isl_constraint_free(c); return 0; } expr = isl_ast_expr_from_constraint(c, data->build); if (data->first) data->res = expr; else data->res = isl_ast_expr_and(data->res, expr); data->first = 0; if (!data->res) return -1; return 0; } /* Construct an isl_ast_expr that evaluates the conditions defining "bset". * The result is simplified in terms of build->domain. * * We filter out the div constraints during printing, so we do not know * in advance how many constraints are going to be printed. * * If it turns out that there was no constraint, then we contruct * the expression "1", i.e., "true". */ __isl_give isl_ast_expr *isl_ast_build_expr_from_basic_set( __isl_keep isl_ast_build *build, __isl_take isl_basic_set *bset) { struct isl_expr_from_basic_data data = { build, 1, NULL }; if (isl_basic_set_foreach_constraint(bset, &expr_from_basic_set, &data) < 0) { data.res = isl_ast_expr_free(data.res); } else if (data.res == NULL) { isl_ctx *ctx = isl_basic_set_get_ctx(bset); data.res = isl_ast_expr_alloc_int_si(ctx, 1); } isl_basic_set_free(bset); return data.res; } struct isl_expr_from_set_data { isl_ast_build *build; int first; isl_ast_expr *res; }; /* Construct an isl_ast_expr that evaluates the conditions defining "bset" * and add it to data->res. * The result is simplified in terms of data->build->domain. */ static int expr_from_set(__isl_take isl_basic_set *bset, void *user) { struct isl_expr_from_set_data *data = user; isl_ast_expr *expr; expr = isl_ast_build_expr_from_basic_set(data->build, bset); if (data->first) data->res = expr; else data->res = isl_ast_expr_or(data->res, expr); data->first = 0; if (!data->res) return -1; return 0; } /* Construct an isl_ast_expr that evaluates the conditions defining "set". * The result is simplified in terms of build->domain. */ __isl_give isl_ast_expr *isl_ast_build_expr_from_set( __isl_keep isl_ast_build *build, __isl_take isl_set *set) { struct isl_expr_from_set_data data = { build, 1, NULL }; if (isl_set_foreach_basic_set(set, &expr_from_set, &data) < 0) data.res = isl_ast_expr_free(data.res); isl_set_free(set); return data.res; } struct isl_from_pw_aff_data { isl_ast_build *build; int n; isl_ast_expr **next; isl_set *dom; }; /* This function is called during the construction of an isl_ast_expr * that evaluates an isl_pw_aff. * Adjust data->next to take into account this piece. * * data->n is the number of pairs of set and aff to go. * data->dom is the domain of the entire isl_pw_aff. * * If this is the last pair, then data->next is set to evaluate aff * and the domain is ignored. * Otherwise, data->next is set to a select operation that selects * an isl_ast_expr correponding to "aff" on "set" and to an expression * that will be filled in by later calls otherwise. */ static int ast_expr_from_pw_aff(__isl_take isl_set *set, __isl_take isl_aff *aff, void *user) { struct isl_from_pw_aff_data *data = user; isl_ctx *ctx; ctx = isl_set_get_ctx(set); data->n--; if (data->n == 0) { *data->next = isl_ast_expr_from_aff(aff, data->build); isl_set_free(set); if (!*data->next) return -1; } else { isl_ast_expr *ternary, *arg; ternary = isl_ast_expr_alloc_op(ctx, isl_ast_op_select, 3); set = isl_set_gist(set, isl_set_copy(data->dom)); arg = isl_ast_build_expr_from_set(data->build, set); ternary = isl_ast_expr_set_op_arg(ternary, 0, arg); arg = isl_ast_expr_from_aff(aff, data->build); ternary = isl_ast_expr_set_op_arg(ternary, 1, arg); if (!ternary) return -1; *data->next = ternary; data->next = &ternary->u.op.args[2]; } return 0; } /* Construct an isl_ast_expr that evaluates "pa". * The result is simplified in terms of build->domain. * * The domain of "pa" lives in the internal schedule space. */ __isl_give isl_ast_expr *isl_ast_build_expr_from_pw_aff_internal( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa) { struct isl_from_pw_aff_data data; isl_ast_expr *res = NULL; if (!pa) return NULL; data.build = build; data.n = isl_pw_aff_n_piece(pa); data.next = &res; data.dom = isl_pw_aff_domain(isl_pw_aff_copy(pa)); if (isl_pw_aff_foreach_piece(pa, &ast_expr_from_pw_aff, &data) < 0) res = isl_ast_expr_free(res); else if (!res) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "cannot handle void expression", res = NULL); isl_pw_aff_free(pa); isl_set_free(data.dom); return res; } /* Construct an isl_ast_expr that evaluates "pa". * The result is simplified in terms of build->domain. * * The domain of "pa" lives in the external schedule space. */ __isl_give isl_ast_expr *isl_ast_build_expr_from_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa) { isl_ast_expr *expr; if (isl_ast_build_need_schedule_map(build)) { isl_multi_aff *ma; ma = isl_ast_build_get_schedule_map_multi_aff(build); pa = isl_pw_aff_pullback_multi_aff(pa, ma); } expr = isl_ast_build_expr_from_pw_aff_internal(build, pa); return expr; } /* Set the ids of the input dimensions of "pma" to the iterator ids * of "build". * * The domain of "pma" is assumed to live in the internal schedule domain. */ static __isl_give isl_pw_multi_aff *set_iterator_names( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma) { int i, n; n = isl_pw_multi_aff_dim(pma, isl_dim_in); for (i = 0; i < n; ++i) { isl_id *id; id = isl_ast_build_get_iterator_id(build, i); pma = isl_pw_multi_aff_set_dim_id(pma, isl_dim_in, i, id); } return pma; } /* Construct an isl_ast_expr that calls the domain element specified by "pma". * The name of the function is obtained from the output tuple name. * The arguments are given by the piecewise affine expressions. * * The domain of "pma" is assumed to live in the internal schedule domain. */ static __isl_give isl_ast_expr *isl_ast_build_call_from_pw_multi_aff_internal( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma) { int i, n; isl_ctx *ctx; isl_id *id; isl_ast_expr *expr; pma = set_iterator_names(build, pma); if (!build || !pma) return isl_pw_multi_aff_free(pma); ctx = isl_ast_build_get_ctx(build); n = isl_pw_multi_aff_dim(pma, isl_dim_out); expr = isl_ast_expr_alloc_op(ctx, isl_ast_op_call, 1 + n); if (isl_pw_multi_aff_has_tuple_id(pma, isl_dim_out)) id = isl_pw_multi_aff_get_tuple_id(pma, isl_dim_out); else id = isl_id_alloc(ctx, "", NULL); expr = isl_ast_expr_set_op_arg(expr, 0, isl_ast_expr_from_id(id)); for (i = 0; i < n; ++i) { isl_pw_aff *pa; isl_ast_expr *arg; pa = isl_pw_multi_aff_get_pw_aff(pma, i); arg = isl_ast_build_expr_from_pw_aff_internal(build, pa); expr = isl_ast_expr_set_op_arg(expr, 1 + i, arg); } isl_pw_multi_aff_free(pma); return expr; } /* Construct an isl_ast_expr that calls the domain element specified by "pma". * The name of the function is obtained from the output tuple name. * The arguments are given by the piecewise affine expressions. * * The domain of "pma" is assumed to live in the external schedule domain. */ __isl_give isl_ast_expr *isl_ast_build_call_from_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma) { int is_domain; isl_ast_expr *expr; isl_space *space_build, *space_pma; space_build = isl_ast_build_get_space(build, 0); space_pma = isl_pw_multi_aff_get_space(pma); is_domain = isl_space_tuple_match(space_build, isl_dim_set, space_pma, isl_dim_in); isl_space_free(space_build); isl_space_free(space_pma); if (is_domain < 0) return isl_pw_multi_aff_free(pma); if (!is_domain) isl_die(isl_ast_build_get_ctx(build), isl_error_invalid, "spaces don't match", return isl_pw_multi_aff_free(pma)); if (isl_ast_build_need_schedule_map(build)) { isl_multi_aff *ma; ma = isl_ast_build_get_schedule_map_multi_aff(build); pma = isl_pw_multi_aff_pullback_multi_aff(pma, ma); } expr = isl_ast_build_call_from_pw_multi_aff_internal(build, pma); return expr; } /* Construct an isl_ast_expr that calls the domain element * specified by "executed". * * "executed" is assumed to be single-valued, with a domain that lives * in the internal schedule space. */ __isl_give isl_ast_node *isl_ast_build_call_from_executed( __isl_keep isl_ast_build *build, __isl_take isl_map *executed) { isl_pw_multi_aff *iteration; isl_ast_expr *expr; iteration = isl_pw_multi_aff_from_map(executed); iteration = isl_ast_build_compute_gist_pw_multi_aff(build, iteration); iteration = isl_pw_multi_aff_intersect_domain(iteration, isl_ast_build_get_domain(build)); expr = isl_ast_build_call_from_pw_multi_aff_internal(build, iteration); return isl_ast_node_alloc_user(expr); } cloog-0.18.2/isl/isl_val.c0000664000175000017500000007103312254313240012214 00000000000000/* * Copyright 2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France */ #include #include #include #undef BASE #define BASE val #include /* Allocate an isl_val object with indeterminate value. */ __isl_give isl_val *isl_val_alloc(isl_ctx *ctx) { isl_val *v; v = isl_alloc_type(ctx, struct isl_val); if (!v) return NULL; v->ctx = ctx; isl_ctx_ref(ctx); v->ref = 1; isl_int_init(v->n); isl_int_init(v->d); return v; } /* Return a reference to an isl_val representing zero. */ __isl_give isl_val *isl_val_zero(isl_ctx *ctx) { return isl_val_int_from_si(ctx, 0); } /* Return a reference to an isl_val representing one. */ __isl_give isl_val *isl_val_one(isl_ctx *ctx) { return isl_val_int_from_si(ctx, 1); } /* Return a reference to an isl_val representing NaN. */ __isl_give isl_val *isl_val_nan(isl_ctx *ctx) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set_si(v->n, 0); isl_int_set_si(v->d, 0); return v; } /* Change "v" into a NaN. */ __isl_give isl_val *isl_val_set_nan(__isl_take isl_val *v) { if (!v) return NULL; if (isl_val_is_nan(v)) return v; v = isl_val_cow(v); if (!v) return NULL; isl_int_set_si(v->n, 0); isl_int_set_si(v->d, 0); return v; } /* Return a reference to an isl_val representing +infinity. */ __isl_give isl_val *isl_val_infty(isl_ctx *ctx) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set_si(v->n, 1); isl_int_set_si(v->d, 0); return v; } /* Return a reference to an isl_val representing -infinity. */ __isl_give isl_val *isl_val_neginfty(isl_ctx *ctx) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set_si(v->n, -1); isl_int_set_si(v->d, 0); return v; } /* Return a reference to an isl_val representing the integer "i". */ __isl_give isl_val *isl_val_int_from_si(isl_ctx *ctx, long i) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set_si(v->n, i); isl_int_set_si(v->d, 1); return v; } /* Change the value of "v" to be equal to the integer "i". */ __isl_give isl_val *isl_val_set_si(__isl_take isl_val *v, long i) { if (!v) return NULL; if (isl_val_is_int(v) && isl_int_cmp_si(v->n, i) == 0) return v; v = isl_val_cow(v); if (!v) return NULL; isl_int_set_si(v->n, i); isl_int_set_si(v->d, 1); return v; } /* Change the value of "v" to be equal to zero. */ __isl_give isl_val *isl_val_set_zero(__isl_take isl_val *v) { return isl_val_set_si(v, 0); } /* Return a reference to an isl_val representing the unsigned integer "u". */ __isl_give isl_val *isl_val_int_from_ui(isl_ctx *ctx, unsigned long u) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set_ui(v->n, u); isl_int_set_si(v->d, 1); return v; } /* Return a reference to an isl_val representing the integer "n". */ __isl_give isl_val *isl_val_int_from_isl_int(isl_ctx *ctx, isl_int n) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set(v->n, n); isl_int_set_si(v->d, 1); return v; } /* Return a reference to an isl_val representing the rational value "n"/"d". * Normalizing the isl_val (if needed) is left to the caller. */ __isl_give isl_val *isl_val_rat_from_isl_int(isl_ctx *ctx, isl_int n, isl_int d) { isl_val *v; v = isl_val_alloc(ctx); if (!v) return NULL; isl_int_set(v->n, n); isl_int_set(v->d, d); return v; } /* Return a new reference to "v". */ __isl_give isl_val *isl_val_copy(__isl_keep isl_val *v) { if (!v) return NULL; v->ref++; return v; } /* Return a fresh copy of "val". */ __isl_give isl_val *isl_val_dup(__isl_keep isl_val *val) { isl_val *dup; if (!val) return NULL; dup = isl_val_alloc(isl_val_get_ctx(val)); if (!dup) return NULL; isl_int_set(dup->n, val->n); isl_int_set(dup->d, val->d); return dup; } /* Return an isl_val that is equal to "val" and that has only * a single reference. */ __isl_give isl_val *isl_val_cow(__isl_take isl_val *val) { if (!val) return NULL; if (val->ref == 1) return val; val->ref--; return isl_val_dup(val); } /* Free "v" and return NULL. */ void *isl_val_free(__isl_take isl_val *v) { if (!v) return NULL; if (--v->ref > 0) return NULL; isl_ctx_deref(v->ctx); isl_int_clear(v->n); isl_int_clear(v->d); free(v); return NULL; } /* Extract the numerator of a rational value "v" as an integer. * * If "v" is not a rational value, then the result is undefined. */ long isl_val_get_num_si(__isl_keep isl_val *v) { if (!v) return 0; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return 0); if (!isl_int_fits_slong(v->n)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "numerator too large", return 0); return isl_int_get_si(v->n); } /* Extract the numerator of a rational value "v" as an isl_int. * * If "v" is not a rational value, then the result is undefined. */ int isl_val_get_num_isl_int(__isl_keep isl_val *v, isl_int *n) { if (!v) return -1; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return -1); isl_int_set(*n, v->n); return 0; } /* Extract the denominator of a rational value "v" as an integer. * * If "v" is not a rational value, then the result is undefined. */ long isl_val_get_den_si(__isl_keep isl_val *v) { if (!v) return 0; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return 0); if (!isl_int_fits_slong(v->d)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "denominator too large", return 0); return isl_int_get_si(v->d); } /* Return an approximation of "v" as a double. */ double isl_val_get_d(__isl_keep isl_val *v) { if (!v) return 0; if (!isl_val_is_rat(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting rational value", return 0); return isl_int_get_d(v->n) / isl_int_get_d(v->d); } /* Return the isl_ctx to which "val" belongs. */ isl_ctx *isl_val_get_ctx(__isl_keep isl_val *val) { return val ? val->ctx : NULL; } /* Normalize "v". * * In particular, make sure that the denominator of a rational value * is positive and the numerator and denominator do not have any * common divisors. * * This function should not be called by an external user * since it will only be given normalized values. */ __isl_give isl_val *isl_val_normalize(__isl_take isl_val *v) { isl_ctx *ctx; if (!v) return NULL; if (isl_val_is_int(v)) return v; if (!isl_val_is_rat(v)) return v; if (isl_int_is_neg(v->d)) { isl_int_neg(v->d, v->d); isl_int_neg(v->n, v->n); } ctx = isl_val_get_ctx(v); isl_int_gcd(ctx->normalize_gcd, v->n, v->d); if (isl_int_is_one(ctx->normalize_gcd)) return v; isl_int_divexact(v->n, v->n, ctx->normalize_gcd); isl_int_divexact(v->d, v->d, ctx->normalize_gcd); return v; } /* Return the opposite of "v". */ __isl_give isl_val *isl_val_neg(__isl_take isl_val *v) { if (!v) return NULL; if (isl_val_is_nan(v)) return v; if (isl_val_is_zero(v)) return v; v = isl_val_cow(v); if (!v) return NULL; isl_int_neg(v->n, v->n); return v; } /* Return the absolute value of "v". */ __isl_give isl_val *isl_val_abs(__isl_take isl_val *v) { if (!v) return NULL; if (isl_val_is_nan(v)) return v; if (isl_val_is_nonneg(v)) return v; return isl_val_neg(v); } /* Return the "floor" (greatest integer part) of "v". * That is, return the result of rounding towards -infinity. */ __isl_give isl_val *isl_val_floor(__isl_take isl_val *v) { if (!v) return NULL; if (isl_val_is_int(v)) return v; if (!isl_val_is_rat(v)) return v; v = isl_val_cow(v); if (!v) return NULL; isl_int_fdiv_q(v->n, v->n, v->d); isl_int_set_si(v->d, 1); return v; } /* Return the "ceiling" of "v". * That is, return the result of rounding towards +infinity. */ __isl_give isl_val *isl_val_ceil(__isl_take isl_val *v) { if (!v) return NULL; if (isl_val_is_int(v)) return v; if (!isl_val_is_rat(v)) return v; v = isl_val_cow(v); if (!v) return NULL; isl_int_cdiv_q(v->n, v->n, v->d); isl_int_set_si(v->d, 1); return v; } /* Truncate "v". * That is, return the result of rounding towards zero. */ __isl_give isl_val *isl_val_trunc(__isl_take isl_val *v) { if (!v) return NULL; if (isl_val_is_int(v)) return v; if (!isl_val_is_rat(v)) return v; v = isl_val_cow(v); if (!v) return NULL; isl_int_tdiv_q(v->n, v->n, v->d); isl_int_set_si(v->d, 1); return v; } /* Return 2^v, where v is an integer (that is not too large). */ __isl_give isl_val *isl_val_2exp(__isl_take isl_val *v) { unsigned long exp; int neg; v = isl_val_cow(v); if (!v) return NULL; if (!isl_val_is_int(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "can only compute integer powers", return isl_val_free(v)); neg = isl_val_is_neg(v); if (neg) isl_int_neg(v->n, v->n); if (!isl_int_fits_ulong(v->n)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "exponent too large", return isl_val_free(v)); exp = isl_int_get_ui(v->n); if (neg) { isl_int_mul_2exp(v->d, v->d, exp); isl_int_set_si(v->n, 1); } else { isl_int_mul_2exp(v->n, v->d, exp); } return v; } /* Return the minimum of "v1" and "v2". */ __isl_give isl_val *isl_val_min(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (isl_val_is_nan(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_nan(v2)) { isl_val_free(v1); return v2; } if (isl_val_le(v1, v2)) { isl_val_free(v2); return v1; } else { isl_val_free(v1); return v2; } error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Return the maximum of "v1" and "v2". */ __isl_give isl_val *isl_val_max(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (isl_val_is_nan(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_nan(v2)) { isl_val_free(v1); return v2; } if (isl_val_ge(v1, v2)) { isl_val_free(v2); return v1; } else { isl_val_free(v1); return v2; } error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Return the sum of "v1" and "v2". */ __isl_give isl_val *isl_val_add(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (isl_val_is_nan(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_nan(v2)) { isl_val_free(v1); return v2; } if ((isl_val_is_infty(v1) && isl_val_is_neginfty(v2)) || (isl_val_is_neginfty(v1) && isl_val_is_infty(v2))) { isl_val_free(v2); return isl_val_set_nan(v1); } if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) { isl_val_free(v1); return v2; } if (isl_val_is_zero(v1)) { isl_val_free(v1); return v2; } if (isl_val_is_zero(v2)) { isl_val_free(v2); return v1; } v1 = isl_val_cow(v1); if (!v1) goto error; if (isl_val_is_int(v1) && isl_val_is_int(v2)) isl_int_add(v1->n, v1->n, v2->n); else { if (isl_int_eq(v1->d, v2->d)) isl_int_add(v1->n, v1->n, v2->n); else { isl_int_mul(v1->n, v1->n, v2->d); isl_int_addmul(v1->n, v2->n, v1->d); isl_int_mul(v1->d, v1->d, v2->d); } v1 = isl_val_normalize(v1); } isl_val_free(v2); return v1; error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Return the sum of "v1" and "v2". */ __isl_give isl_val *isl_val_add_ui(__isl_take isl_val *v1, unsigned long v2) { if (!v1) return NULL; if (!isl_val_is_rat(v1)) return v1; if (v2 == 0) return v1; v1 = isl_val_cow(v1); if (!v1) return NULL; isl_int_addmul_ui(v1->n, v1->d, v2); return v1; } /* Subtract "v2" from "v1". */ __isl_give isl_val *isl_val_sub(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (isl_val_is_nan(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_nan(v2)) { isl_val_free(v1); return v2; } if ((isl_val_is_infty(v1) && isl_val_is_infty(v2)) || (isl_val_is_neginfty(v1) && isl_val_is_neginfty(v2))) { isl_val_free(v2); return isl_val_set_nan(v1); } if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) { isl_val_free(v1); return isl_val_neg(v2); } if (isl_val_is_zero(v2)) { isl_val_free(v2); return v1; } if (isl_val_is_zero(v1)) { isl_val_free(v1); return isl_val_neg(v2); } v1 = isl_val_cow(v1); if (!v1) goto error; if (isl_val_is_int(v1) && isl_val_is_int(v2)) isl_int_sub(v1->n, v1->n, v2->n); else { if (isl_int_eq(v1->d, v2->d)) isl_int_sub(v1->n, v1->n, v2->n); else { isl_int_mul(v1->n, v1->n, v2->d); isl_int_submul(v1->n, v2->n, v1->d); isl_int_mul(v1->d, v1->d, v2->d); } v1 = isl_val_normalize(v1); } isl_val_free(v2); return v1; error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Subtract "v2" from "v1". */ __isl_give isl_val *isl_val_sub_ui(__isl_take isl_val *v1, unsigned long v2) { if (!v1) return NULL; if (!isl_val_is_rat(v1)) return v1; if (v2 == 0) return v1; v1 = isl_val_cow(v1); if (!v1) return NULL; isl_int_submul_ui(v1->n, v1->d, v2); return v1; } /* Return the product of "v1" and "v2". */ __isl_give isl_val *isl_val_mul(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (isl_val_is_nan(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_nan(v2)) { isl_val_free(v1); return v2; } if ((!isl_val_is_rat(v1) && isl_val_is_zero(v2)) || (isl_val_is_zero(v1) && !isl_val_is_rat(v2))) { isl_val_free(v2); return isl_val_set_nan(v1); } if (isl_val_is_zero(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_zero(v2)) { isl_val_free(v1); return v2; } if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) { if (isl_val_is_neg(v2)) v1 = isl_val_neg(v1); isl_val_free(v2); return v1; } if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) { if (isl_val_is_neg(v1)) v2 = isl_val_neg(v2); isl_val_free(v1); return v2; } v1 = isl_val_cow(v1); if (!v1) goto error; if (isl_val_is_int(v1) && isl_val_is_int(v2)) isl_int_mul(v1->n, v1->n, v2->n); else { isl_int_mul(v1->n, v1->n, v2->n); isl_int_mul(v1->d, v1->d, v2->d); v1 = isl_val_normalize(v1); } isl_val_free(v2); return v1; error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Return the product of "v1" and "v2". * * This is a private copy of isl_val_mul for use in the generic * isl_multi_*_scale_val instantiated for isl_val. */ __isl_give isl_val *isl_val_scale_val(__isl_take isl_val *v1, __isl_take isl_val *v2) { return isl_val_mul(v1, v2); } /* Return the product of "v1" and "v2". */ __isl_give isl_val *isl_val_mul_ui(__isl_take isl_val *v1, unsigned long v2) { if (!v1) return NULL; if (isl_val_is_nan(v1)) return v1; if (!isl_val_is_rat(v1)) { if (v2 == 0) v1 = isl_val_set_nan(v1); return v1; } if (v2 == 1) return v1; v1 = isl_val_cow(v1); if (!v1) return NULL; isl_int_mul_ui(v1->n, v1->n, v2); return isl_val_normalize(v1); } /* Divide "v1" by "v2". */ __isl_give isl_val *isl_val_div(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (isl_val_is_nan(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_nan(v2)) { isl_val_free(v1); return v2; } if (isl_val_is_zero(v2) || (!isl_val_is_rat(v1) && !isl_val_is_rat(v2))) { isl_val_free(v2); return isl_val_set_nan(v1); } if (isl_val_is_zero(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_infty(v1) || isl_val_is_neginfty(v1)) { if (isl_val_is_neg(v2)) v1 = isl_val_neg(v1); isl_val_free(v2); return v1; } if (isl_val_is_infty(v2) || isl_val_is_neginfty(v2)) { isl_val_free(v2); return isl_val_set_zero(v1); } v1 = isl_val_cow(v1); if (!v1) goto error; if (isl_val_is_int(v2)) { isl_int_mul(v1->d, v1->d, v2->n); v1 = isl_val_normalize(v1); } else { isl_int_mul(v1->d, v1->d, v2->n); isl_int_mul(v1->n, v1->n, v2->d); v1 = isl_val_normalize(v1); } isl_val_free(v2); return v1; error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Given two integer values "v1" and "v2", check if "v1" is divisible by "v2". */ int isl_val_is_divisible_by(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { if (!v1 || !v2) return -1; if (!isl_val_is_int(v1) || !isl_val_is_int(v2)) isl_die(isl_val_get_ctx(v1), isl_error_invalid, "expecting two integers", return -1); return isl_int_is_divisible_by(v1->n, v2->n); } /* Given two integer values "v1" and "v2", return the residue of "v1" * modulo "v2". */ __isl_give isl_val *isl_val_mod(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (!isl_val_is_int(v1) || !isl_val_is_int(v2)) isl_die(isl_val_get_ctx(v1), isl_error_invalid, "expecting two integers", goto error); if (isl_val_is_nonneg(v1) && isl_val_lt(v1, v2)) { isl_val_free(v2); return v1; } v1 = isl_val_cow(v1); if (!v1) goto error; isl_int_fdiv_r(v1->n, v1->n, v2->n); isl_val_free(v2); return v1; error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Given two integer values, return their greatest common divisor. */ __isl_give isl_val *isl_val_gcd(__isl_take isl_val *v1, __isl_take isl_val *v2) { if (!v1 || !v2) goto error; if (!isl_val_is_int(v1) || !isl_val_is_int(v2)) isl_die(isl_val_get_ctx(v1), isl_error_invalid, "expecting two integers", goto error); if (isl_val_eq(v1, v2)) { isl_val_free(v2); return v1; } if (isl_val_is_one(v1)) { isl_val_free(v2); return v1; } if (isl_val_is_one(v2)) { isl_val_free(v1); return v2; } v1 = isl_val_cow(v1); if (!v1) goto error; isl_int_gcd(v1->n, v1->n, v2->n); isl_val_free(v2); return v1; error: isl_val_free(v1); isl_val_free(v2); return NULL; } /* Given two integer values v1 and v2, return their greatest common divisor g, * as well as two integers x and y such that x * v1 + y * v2 = g. */ __isl_give isl_val *isl_val_gcdext(__isl_take isl_val *v1, __isl_take isl_val *v2, __isl_give isl_val **x, __isl_give isl_val **y) { isl_ctx *ctx; isl_val *a = NULL, *b = NULL; if (!x && !y) return isl_val_gcd(v1, v2); if (!v1 || !v2) goto error; ctx = isl_val_get_ctx(v1); if (!isl_val_is_int(v1) || !isl_val_is_int(v2)) isl_die(ctx, isl_error_invalid, "expecting two integers", goto error); v1 = isl_val_cow(v1); a = isl_val_alloc(ctx); b = isl_val_alloc(ctx); if (!v1 || !a || !b) goto error; isl_int_gcdext(v1->n, a->n, b->n, v1->n, v2->n); if (x) { isl_int_set_si(a->d, 1); *x = a; } else isl_val_free(a); if (y) { isl_int_set_si(b->d, 1); *y = b; } else isl_val_free(b); isl_val_free(v2); return v1; error: isl_val_free(v1); isl_val_free(v2); isl_val_free(a); isl_val_free(b); if (x) *x = NULL; if (y) *y = NULL; return NULL; } /* Does "v" represent an integer value? */ int isl_val_is_int(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_one(v->d); } /* Does "v" represent a rational value? */ int isl_val_is_rat(__isl_keep isl_val *v) { if (!v) return -1; return !isl_int_is_zero(v->d); } /* Does "v" represent NaN? */ int isl_val_is_nan(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_zero(v->n) && isl_int_is_zero(v->d); } /* Does "v" represent +infinity? */ int isl_val_is_infty(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_pos(v->n) && isl_int_is_zero(v->d); } /* Does "v" represent -infinity? */ int isl_val_is_neginfty(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_neg(v->n) && isl_int_is_zero(v->d); } /* Does "v" represent the integer zero? */ int isl_val_is_zero(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_zero(v->n) && !isl_int_is_zero(v->d); } /* Does "v" represent the integer one? */ int isl_val_is_one(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_eq(v->n, v->d); } /* Does "v" represent the integer negative one? */ int isl_val_is_negone(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_neg(v->n) && isl_int_abs_eq(v->n, v->d); } /* Is "v" (strictly) positive? */ int isl_val_is_pos(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_pos(v->n); } /* Is "v" (strictly) negative? */ int isl_val_is_neg(__isl_keep isl_val *v) { if (!v) return -1; return isl_int_is_neg(v->n); } /* Is "v" non-negative? */ int isl_val_is_nonneg(__isl_keep isl_val *v) { if (!v) return -1; if (isl_val_is_nan(v)) return 0; return isl_int_is_nonneg(v->n); } /* Is "v" non-positive? */ int isl_val_is_nonpos(__isl_keep isl_val *v) { if (!v) return -1; if (isl_val_is_nan(v)) return 0; return isl_int_is_nonpos(v->n); } /* Return the sign of "v". * * The sign of NaN is undefined. */ int isl_val_sgn(__isl_keep isl_val *v) { if (!v) return 0; if (isl_val_is_zero(v)) return 0; if (isl_val_is_pos(v)) return 1; return -1; } /* Is "v1" (strictly) less than "v2"? */ int isl_val_lt(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { isl_int t; int lt; if (!v1 || !v2) return -1; if (isl_val_is_int(v1) && isl_val_is_int(v2)) return isl_int_lt(v1->n, v2->n); if (isl_val_is_nan(v1) || isl_val_is_nan(v2)) return 0; if (isl_val_eq(v1, v2)) return 0; if (isl_val_is_infty(v2)) return 1; if (isl_val_is_infty(v1)) return 0; if (isl_val_is_neginfty(v1)) return 1; if (isl_val_is_neginfty(v2)) return 0; isl_int_init(t); isl_int_mul(t, v1->n, v2->d); isl_int_submul(t, v2->n, v1->d); lt = isl_int_is_neg(t); isl_int_clear(t); return lt; } /* Is "v1" (strictly) greater than "v2"? */ int isl_val_gt(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { return isl_val_lt(v2, v1); } /* Is "v1" less than or equal to "v2"? */ int isl_val_le(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { isl_int t; int le; if (!v1 || !v2) return -1; if (isl_val_is_int(v1) && isl_val_is_int(v2)) return isl_int_le(v1->n, v2->n); if (isl_val_is_nan(v1) || isl_val_is_nan(v2)) return 0; if (isl_val_eq(v1, v2)) return 1; if (isl_val_is_infty(v2)) return 1; if (isl_val_is_infty(v1)) return 0; if (isl_val_is_neginfty(v1)) return 1; if (isl_val_is_neginfty(v2)) return 0; isl_int_init(t); isl_int_mul(t, v1->n, v2->d); isl_int_submul(t, v2->n, v1->d); le = isl_int_is_nonpos(t); isl_int_clear(t); return le; } /* Is "v1" greater than or equal to "v2"? */ int isl_val_ge(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { return isl_val_le(v2, v1); } /* How does "v" compare to "i"? * * Return 1 if v is greater, -1 if v is smaller and 0 if v is equal to i. * * If v is NaN (or NULL), then the result is undefined. */ int isl_val_cmp_si(__isl_keep isl_val *v, long i) { isl_int t; int cmp; if (!v) return 0; if (isl_val_is_int(v)) return isl_int_cmp_si(v->n, i); if (isl_val_is_nan(v)) return 0; if (isl_val_is_infty(v)) return 1; if (isl_val_is_neginfty(v)) return -1; isl_int_init(t); isl_int_mul_si(t, v->d, i); isl_int_sub(t, v->n, t); cmp = isl_int_sgn(t); isl_int_clear(t); return cmp; } /* Is "v1" equal to "v2"? */ int isl_val_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { if (!v1 || !v2) return -1; if (isl_val_is_nan(v1) || isl_val_is_nan(v2)) return 0; return isl_int_eq(v1->n, v2->n) && isl_int_eq(v1->d, v2->d); } /* Is "v1" different from "v2"? */ int isl_val_ne(__isl_keep isl_val *v1, __isl_keep isl_val *v2) { if (!v1 || !v2) return -1; if (isl_val_is_nan(v1) || isl_val_is_nan(v2)) return 0; return isl_int_ne(v1->n, v2->n) || isl_int_ne(v1->d, v2->d); } /* Print a textual representation of "v" onto "p". */ __isl_give isl_printer *isl_printer_print_val(__isl_take isl_printer *p, __isl_keep isl_val *v) { int neg; if (!p || !v) return isl_printer_free(p); neg = isl_int_is_neg(v->n); if (neg) { p = isl_printer_print_str(p, "-"); isl_int_neg(v->n, v->n); } if (isl_int_is_zero(v->d)) { int sgn = isl_int_sgn(v->n); p = isl_printer_print_str(p, sgn < 0 ? "-infty" : sgn == 0 ? "NaN" : "infty"); } else p = isl_printer_print_isl_int(p, v->n); if (neg) isl_int_neg(v->n, v->n); if (!isl_int_is_zero(v->d) && !isl_int_is_one(v->d)) { p = isl_printer_print_str(p, "/"); p = isl_printer_print_isl_int(p, v->d); } return p; } /* Insert "n" dimensions of type "type" at position "first". * * This function is only meant to be used in the generic isl_multi_* * functions which have to deal with base objects that have an associated * space. Since an isl_val does not have an associated space, this function * does not do anything. */ __isl_give isl_val *isl_val_insert_dims(__isl_take isl_val *v, enum isl_dim_type type, unsigned first, unsigned n) { return v; } /* Drop the the "n" first dimensions of type "type" at position "first". * * This function is only meant to be used in the generic isl_multi_* * functions which have to deal with base objects that have an associated * space. Since an isl_val does not have an associated space, this function * does not do anything. */ __isl_give isl_val *isl_val_drop_dims(__isl_take isl_val *v, enum isl_dim_type type, unsigned first, unsigned n) { return v; } /* Change the name of the dimension of type "type" at position "pos" to "s". * * This function is only meant to be used in the generic isl_multi_* * functions which have to deal with base objects that have an associated * space. Since an isl_val does not have an associated space, this function * does not do anything. */ __isl_give isl_val *isl_val_set_dim_name(__isl_take isl_val *v, enum isl_dim_type type, unsigned pos, const char *s) { return v; } /* Reset the domain space of "v" to "space". * * This function is only meant to be used in the generic isl_multi_* * functions which have to deal with base objects that have an associated * space. Since an isl_val does not have an associated space, this function * does not do anything, apart from error handling and cleaning up memory. */ __isl_give isl_val *isl_val_reset_domain_space(__isl_take isl_val *v, __isl_take isl_space *space) { if (!space) return isl_val_free(v); isl_space_free(space); return v; } /* Reorder the dimensions of the domain of "v" according * to the given reordering. * * This function is only meant to be used in the generic isl_multi_* * functions which have to deal with base objects that have an associated * space. Since an isl_val does not have an associated space, this function * does not do anything, apart from error handling and cleaning up memory. */ __isl_give isl_val *isl_val_realign_domain(__isl_take isl_val *v, __isl_take isl_reordering *r) { if (!r) return isl_val_free(v); isl_reordering_free(r); return v; } /* Return an isl_val that is zero on "ls". * * This function is only meant to be used in the generic isl_multi_* * functions which have to deal with base objects that have an associated * space. Since an isl_val does not have an associated space, this function * simply returns a zero isl_val in the same context as "ls". */ __isl_give isl_val *isl_val_zero_on_domain(__isl_take isl_local_space *ls) { isl_ctx *ctx; if (!ls) return NULL; ctx = isl_local_space_get_ctx(ls); isl_local_space_free(ls); return isl_val_zero(ctx); } /* Check that the domain space of "v" matches "space". * * Return 0 on success and -1 on error. * * This function is only meant to be used in the generic isl_multi_* * functions which have to deal with base objects that have an associated * space. Since an isl_val does not have an associated space, this function * simply returns 0, except if "v" or "space" are NULL. */ int isl_val_check_match_domain_space(__isl_keep isl_val *v, __isl_keep isl_space *space) { if (!v || !space) return -1; return 0; } #undef BASE #define BASE val #define NO_GIST #define NO_IDENTITY #define NO_FROM_BASE #include /* Apply "fn" to each of the elements of "mv" with as second argument "v". */ static __isl_give isl_multi_val *isl_multi_val_fn_val( __isl_take isl_multi_val *mv, __isl_give isl_val *(*fn)(__isl_take isl_val *v1, __isl_take isl_val *v2), __isl_take isl_val *v) { int i; mv = isl_multi_val_cow(mv); if (!mv || !v) goto error; for (i = 0; i < mv->n; ++i) { mv->p[i] = fn(mv->p[i], isl_val_copy(v)); if (!mv->p[i]) goto error; } isl_val_free(v); return mv; error: isl_val_free(v); isl_multi_val_free(mv); return NULL; } /* Add "v" to each of the elements of "mv". */ __isl_give isl_multi_val *isl_multi_val_add_val(__isl_take isl_multi_val *mv, __isl_take isl_val *v) { if (!v) return isl_multi_val_free(mv); if (isl_val_is_zero(v)) { isl_val_free(v); return mv; } return isl_multi_val_fn_val(mv, &isl_val_add, v); } /* Reduce the elements of "mv" modulo "v". */ __isl_give isl_multi_val *isl_multi_val_mod_val(__isl_take isl_multi_val *mv, __isl_take isl_val *v) { return isl_multi_val_fn_val(mv, &isl_val_mod, v); } cloog-0.18.2/isl/isl_tarjan.c0000664000175000017500000000622112254313240012706 00000000000000/* * Copyright 2010-2011 INRIA Saclay * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include void isl_tarjan_graph_free(struct isl_tarjan_graph *g) { if (!g) return; free(g->node); free(g->stack); free(g->order); free(g); } static struct isl_tarjan_graph *isl_tarjan_graph_alloc(isl_ctx *ctx, int len) { struct isl_tarjan_graph *g; int i; g = isl_calloc_type(ctx, struct isl_tarjan_graph); if (!g) return NULL; g->len = len; g->node = isl_alloc_array(ctx, struct isl_tarjan_node, len); if (len && !g->node) goto error; for (i = 0; i < len; ++i) g->node[i].index = -1; g->stack = isl_alloc_array(ctx, int, len); if (len && !g->stack) goto error; g->order = isl_alloc_array(ctx, int, 2 * len); if (len && !g->order) goto error; g->sp = 0; g->index = 0; g->op = 0; return g; error: isl_tarjan_graph_free(g); return NULL; } /* Perform Tarjan's algorithm for computing the strongly connected components * in the graph with g->len nodes and with edges defined by "follows". */ static int isl_tarjan_components(struct isl_tarjan_graph *g, int i, int (*follows)(int i, int j, void *user), void *user) { int j; g->node[i].index = g->index; g->node[i].min_index = g->index; g->node[i].on_stack = 1; g->index++; g->stack[g->sp++] = i; for (j = g->len - 1; j >= 0; --j) { int f; if (j == i) continue; if (g->node[j].index >= 0 && (!g->node[j].on_stack || g->node[j].index > g->node[i].min_index)) continue; f = follows(i, j, user); if (f < 0) return -1; if (!f) continue; if (g->node[j].index < 0) { isl_tarjan_components(g, j, follows, user); if (g->node[j].min_index < g->node[i].min_index) g->node[i].min_index = g->node[j].min_index; } else if (g->node[j].index < g->node[i].min_index) g->node[i].min_index = g->node[j].index; } if (g->node[i].index != g->node[i].min_index) return 0; do { j = g->stack[--g->sp]; g->node[j].on_stack = 0; g->order[g->op++] = j; } while (j != i); g->order[g->op++] = -1; return 0; } /* Decompose the graph with "len" nodes and edges defined by "follows" * into strongly connected components (SCCs). * follows(i, j, user) should return 1 if "i" follows "j" and 0 otherwise. * It should return -1 on error. * * If SCC a contains a node i that follows a node j in another SCC b * (i.e., follows(i, j, user) returns 1), then SCC a will appear after SCC b * in the result. */ struct isl_tarjan_graph *isl_tarjan_graph_init(isl_ctx *ctx, int len, int (*follows)(int i, int j, void *user), void *user) { int i; struct isl_tarjan_graph *g = NULL; g = isl_tarjan_graph_alloc(ctx, len); if (!g) return NULL; for (i = len - 1; i >= 0; --i) { if (g->node[i].index >= 0) continue; if (isl_tarjan_components(g, i, follows, user) < 0) goto error; } return g; error: isl_tarjan_graph_free(g); return NULL; } cloog-0.18.2/isl/isl_local_space_private.h0000664000175000017500000000435712254313240015443 00000000000000#ifndef ISL_LOCAL_SPACE_PRIVATE_H #define ISL_LOCAL_SPACE_PRIVATE_H #include #include #include struct isl_local_space { int ref; isl_space *dim; isl_mat *div; }; __isl_give isl_local_space *isl_local_space_alloc(__isl_take isl_space *dim, unsigned n_div); __isl_give isl_local_space *isl_local_space_alloc_div(__isl_take isl_space *dim, __isl_take isl_mat *div); __isl_give isl_local_space *isl_local_space_swap_div( __isl_take isl_local_space *ls, int a, int b); __isl_give isl_local_space *isl_local_space_add_div( __isl_take isl_local_space *ls, __isl_take isl_vec *div); int isl_mat_cmp_div(__isl_keep isl_mat *div, int i, int j); __isl_give isl_mat *isl_merge_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2, int *exp1, int *exp2); unsigned isl_local_space_offset(__isl_keep isl_local_space *ls, enum isl_dim_type type); __isl_give isl_local_space *isl_local_space_replace_divs( __isl_take isl_local_space *ls, __isl_take isl_mat *div); int isl_local_space_divs_known(__isl_keep isl_local_space *ls); __isl_give isl_local_space *isl_local_space_substitute_equalities( __isl_take isl_local_space *ls, __isl_take isl_basic_set *eq); int isl_local_space_is_named_or_nested(__isl_keep isl_local_space *ls, enum isl_dim_type type); __isl_give isl_local_space *isl_local_space_reset_space( __isl_take isl_local_space *ls, __isl_take isl_space *dim); __isl_give isl_local_space *isl_local_space_realign( __isl_take isl_local_space *ls, __isl_take isl_reordering *r); int isl_local_space_is_div_constraint(__isl_keep isl_local_space *ls, isl_int *constraint, unsigned div); int *isl_local_space_get_active(__isl_keep isl_local_space *ls, isl_int *l); __isl_give isl_local_space *isl_local_space_substitute_seq( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, isl_int *subs, int subs_len, int first, int n); __isl_give isl_local_space *isl_local_space_substitute( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs); __isl_give isl_local_space *isl_local_space_lift( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_preimage_multi_aff( __isl_take isl_local_space *ls, __isl_take isl_multi_aff *ma); #endif cloog-0.18.2/isl/README0000664000175000017500000000272512254313240011301 00000000000000isl is a thread-safe C library for manipulating sets and relations of integer points bounded by affine constraints. The descriptions of the sets and relations may involve both parameters and existentially quantified variables. All computations are performed in exact integer arithmetic using GMP. isl is released under the MIT license, but depends on the LGPL GMP library. Minimal compilation instructions: ./configure make make install If you are taking the source from the git repository, then you first need to do git clone git://repo.or.cz/isl.git ./autogen.sh For more information, see doc/user.pod or the generated documentation. New releases are announced on http://freecode.com/projects/isl If you use isl, you can let me know by stacking https://www.ohloh.net/p/isl on ohloh. For bug reports, feature requests and questions, contact http://groups.google.com/group/isl-development If you use isl for your research, you are invited do cite the following paper and/or the paper(s) describing the specific operations you use. @incollection{Verdoolaege2010isl, author = {Verdoolaege, Sven}, title = {isl: An Integer Set Library for the Polyhedral Model}, booktitle = {Mathematical Software - ICMS 2010}, series = {Lecture Notes in Computer Science}, editor = {Fukuda, Komei and Hoeven, Joris and Joswig, Michael and Takayama, Nobuki}, publisher = {Springer}, isbn = {978-3-642-15581-9}, pages = {299-302}, volume = {6327}, year = {2010} } cloog-0.18.2/isl/isl_lp_piplib.c0000664000175000017500000000535412254313240013407 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include "isl_piplib.h" #include "isl_map_piplib.h" static void copy_solution(struct isl_vec *vec, int maximize, isl_int *opt, isl_int *opt_denom, PipQuast *sol) { int i; PipList *list; isl_int tmp; if (opt) { if (opt_denom) { isl_seq_cpy_from_pip(opt, &sol->list->vector->the_vector[0], 1); isl_seq_cpy_from_pip(opt_denom, &sol->list->vector->the_deno[0], 1); } else if (maximize) mpz_fdiv_q(*opt, sol->list->vector->the_vector[0], sol->list->vector->the_deno[0]); else mpz_cdiv_q(*opt, sol->list->vector->the_vector[0], sol->list->vector->the_deno[0]); } if (!vec) return; isl_int_init(tmp); isl_int_set_si(vec->el[0], 1); for (i = 0, list = sol->list->next; list; ++i, list = list->next) { isl_seq_cpy_from_pip(&vec->el[1 + i], &list->vector->the_deno[0], 1); isl_int_lcm(vec->el[0], vec->el[0], vec->el[1 + i]); } for (i = 0, list = sol->list->next; list; ++i, list = list->next) { isl_seq_cpy_from_pip(&tmp, &list->vector->the_deno[0], 1); isl_int_divexact(tmp, vec->el[0], tmp); isl_seq_cpy_from_pip(&vec->el[1 + i], &list->vector->the_vector[0], 1); isl_int_mul(vec->el[1 + i], vec->el[1 + i], tmp); } isl_int_clear(tmp); } enum isl_lp_result isl_pip_solve_lp(struct isl_basic_map *bmap, int maximize, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **vec) { enum isl_lp_result res = isl_lp_ok; PipMatrix *domain = NULL; PipOptions *options; PipQuast *sol; unsigned total; total = isl_basic_map_total_dim(bmap); domain = isl_basic_map_to_pip(bmap, 0, 1, 0); if (!domain) goto error; entier_set_si(domain->p[0][1], -1); isl_int_set(domain->p[0][domain->NbColumns - 1], f[0]); isl_seq_cpy_to_pip(domain->p[0]+2, f+1, total); options = pip_options_init(); if (!options) goto error; options->Urs_unknowns = -1; options->Maximize = maximize; options->Nq = 0; sol = pip_solve(domain, NULL, -1, options); pip_options_free(options); if (!sol) goto error; if (vec) { isl_ctx *ctx = isl_basic_map_get_ctx(bmap); *vec = isl_vec_alloc(ctx, 1 + total); } if (vec && !*vec) res = isl_lp_error; else if (!sol->list) res = isl_lp_empty; else if (entier_zero_p(sol->list->vector->the_deno[0])) res = isl_lp_unbounded; else copy_solution(*vec, maximize, opt, opt_denom, sol); pip_matrix_free(domain); pip_quast_free(sol); return res; error: if (domain) pip_matrix_free(domain); return isl_lp_error; } cloog-0.18.2/isl/isl_tarjan.h0000664000175000017500000000214512254313240012714 00000000000000#ifndef ISL_TARJAN_H #define ISL_TARJAN_H /* Structure for representing the nodes in the graph being traversed * using Tarjan's algorithm. * index represents the order in which nodes are visited. * min_index is the index of the root of a (sub)component. * on_stack indicates whether the node is currently on the stack. */ struct isl_tarjan_node { int index; int min_index; int on_stack; }; /* Structure for representing the graph being traversed * using Tarjan's algorithm. * len is the number of nodes * node is an array of nodes * stack contains the nodes on the path from the root to the current node * sp is the stack pointer * index is the index of the last node visited * order contains the elements of the components separated by -1 * op represents the current position in order */ struct isl_tarjan_graph { int len; struct isl_tarjan_node *node; int *stack; int sp; int index; int *order; int op; }; struct isl_tarjan_graph *isl_tarjan_graph_init(isl_ctx *ctx, int len, int (*follows)(int i, int j, void *user), void *user); void isl_tarjan_graph_free(struct isl_tarjan_graph *g); #endif cloog-0.18.2/isl/test_inputs/0000775000175000017500000000000012254313240013054 500000000000000cloog-0.18.2/isl/test_inputs/linearExample.pwqp0000664000175000017500000000021312254313240016467 00000000000000[N, M, L] -> { [i, j, k] -> ((1/2 * i + 5 * j) + 1/7 * k) : i >= 0 and k >= -N + i and k >= -M - j and j <= L + i and L >= 0 and L >= -M } cloog-0.18.2/isl/test_inputs/toplas.pwqp0000664000175000017500000000034112254313240015205 00000000000000[n] -> { [i0, i1] -> (((4 * n - n^2) + (-3/2 + 2 * n) * i0 - 1/2 * i0^2) - i1) : i1 >= -1 + 3n - i0 and i1 >= -1 + 2n - i0 and i0 >= 0 and i1 <= -2 + 4n - i0 and i0 <= -2 + 4n and i0 <= -1 + 3n and i1 >= 0 and i1 <= -1 + n } cloog-0.18.2/isl/test_inputs/sor1d.pip0000664000175000017500000000061612254313240014541 000000000000002 4 1 1 0 0 1 0 1 0 -1 20 8 0 -1 0 0 0 0 0 2 0 0 -1 0 0 0 0 1 0 0 0 -1 0 0 0 2 0 0 0 0 -1 0 0 4 1 0 0 0 1 0 0 -2 1 -2 0 2 1 0 0 -4 1 0 0 0 -1 0 1 -1 1 2 0 -2 -1 0 0 5 1 0 0 1 0 0 0 -1 1 0 -2 1 0 0 0 0 1 -2 0 2 0 0 1 -5 1 0 0 -1 0 1 0 0 1 0 2 -1 0 0 0 1 1 2 0 -2 0 0 0 3 1 0 1 0 0 0 0 0 1 -2 4 0 0 0 1 -3 1 0 -2 0 0 1 0 0 1 2 -4 0 0 0 0 3 1 2 0 0 0 0 0 1 1 -2 0 0 0 2 1 -5 cloog-0.18.2/isl/test_inputs/ex2.pip0000664000175000017500000000010512254313240014200 000000000000001 5 1 -1 1 1 0 -1 3 7 1 0 -1 0 1 0 0 1 -1 0 0 0 1 0 1 1 1 -1 0 0 0 cloog-0.18.2/isl/test_inputs/philippePolynomialCoeff.pwqp0000664000175000017500000000015412254313240020526 00000000000000[N, M] -> { [i, j] -> ((N * i + (1/5 * N + N^2) * i^2) + 5 * j) : i <= N and j >= 0 and j <= i and M >= 0 } cloog-0.18.2/isl/test_inputs/basicTest.pwqp0000664000175000017500000000007612254313240015631 00000000000000[p] -> { [n, m] -> (n + n^2) : n >= 1 and m >= n and m <= p } cloog-0.18.2/isl/test_inputs/affine3.polylib0000664000175000017500000000005412254313240015702 000000000000003 4 1 1 0 0 1 -7 4 2 1 5 -4 2 1 4 0 3 -2 0 cloog-0.18.2/isl/test_inputs/faddeev.pwqp0000664000175000017500000000024312254313240015302 00000000000000[N] -> { [i, j, k] -> (((4 + 6 * N + 2 * N^2) + (-2 - 2 * N) * j) + ((-2 - N) + j) * k) : j = 1 + i and k = 1 + i and i >= 3 and N <= 100 and i <= N and N >= 10 } cloog-0.18.2/isl/test_inputs/philippe.pwqp0000664000175000017500000000012012254313240015510 00000000000000[N] -> { [i, j] -> ((1/2 * i + 1/2 * i^2) + j) : i <= N and j >= 0 and j <= i } cloog-0.18.2/isl/test_inputs/convex13.polylib0000664000175000017500000000041212254313240016033 000000000000003 5 1 0 0 -1 3 1 0 -1 0 2 1 1 1 1 -4 3 5 1 0 0 1 0 1 1 0 0 -1 1 1 2 0 1 6 5 1 3 2 0 -1 1 3 0 2 -3 1 1 0 1 -1 1 1 1 1 0 1 1 1 0 0 1 1 0 0 1 cloog-0.18.2/isl/test_inputs/equality4.pwqp0000664000175000017500000000013112254313240015621 00000000000000[m,n] -> { [x,y] -> x^2 * y + m + 13 * n: n = 2x + 4y and 0 <= x,y <= 10 and 3 n = 5 m } cloog-0.18.2/isl/test_inputs/codegen/0000775000175000017500000000000012254313240014460 500000000000000cloog-0.18.2/isl/test_inputs/codegen/dwt.c0000664000175000017500000000023012254313240015335 00000000000000for (int c0 = 0; c0 < Ncl; c0 += 1) if (Ncl >= c0 + 2 && c0 >= 1) { S(c0, 28); } else if (c0 == 0) { S(0, 26); } else S(Ncl - 1, 27); cloog-0.18.2/isl/test_inputs/codegen/stride5.in0000664000175000017500000000012412254313240016304 00000000000000[n] -> { S[t] -> [t] : exists e : 2 t - n = 4e and 0 <= t <= 100 } [n] -> { : } { } cloog-0.18.2/isl/test_inputs/codegen/disjuncts.c0000664000175000017500000000054412254313240016555 00000000000000for (int c0 = 0; c0 <= n; c0 += 1) for (int c1 = 0; c1 <= n; c1 += 1) if (c1 == n || c0 == n || c1 == 0 || c0 == 0) { for (int c3 = 0; c3 <= n; c3 += 1) for (int c4 = 0; c4 <= n; c4 += 1) a(c0, c1, c3, c4); for (int c3 = 0; c3 <= n; c3 += 1) for (int c4 = 0; c4 <= n; c4 += 1) b(c0, c1, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/stride.c0000664000175000017500000000022512254313240016035 00000000000000for (int c0 = 0; c0 <= 100; c0 += 2) { for (int c3 = 0; c3 <= 100; c3 += 1) A(c0, c3); for (int c2 = 0; c2 <= 100; c2 += 1) B(c0, c2); } cloog-0.18.2/isl/test_inputs/codegen/hoist2.in0000664000175000017500000000111412254313240016135 00000000000000# Check that the constraints hoisted from the inner loop # do not end up involving the inner loop iterator. [t1, b] -> { A[i1, i2] -> [i1, 8 - 64b + i2] : exists (e0, e1 = [(-8 + t1 - i2)/64]: 64e1 = -8 + t1 - i2 and i2 >= 1 and i2 <= 127 and 2e0 >= -3 + i1 and 2e0 >= -1 - i1 and 2e0 <= 8 - i1 and 2e0 <= 6 + i1 and 2e0 >= -65 - 64b + i2 and 2e0 >= -1 + 64b - i2 and e0 <= 1 and e0 >= 0 and 2e0 <= 62 + 64b - i2 and b <= 1 and b >= 0 and i1 >= 1 and i1 <= 2046 and t1 >= 5 and t1 <= 8) } [t1, b] -> { : b >= 0 and b <= 1 and t1 >= 5 and t1 <= 8 } [t1] -> { [i0, i1, i5, a] -> atomic[x]} cloog-0.18.2/isl/test_inputs/codegen/unroll3.in0000664000175000017500000000074312254313240016332 00000000000000# Check that the entire schedule is completely unrolled and # in particular that no spurious loop is introduced. [t1] -> { write_shared_A[i2] -> [1, 3, 6 + i2, 0, t1] : (exists (e0 = [(-6 + t1 - i2)/128]: 128e0 = -6 + t1 - i2 and i2 <= 122 and i2 >= 1 and t1 >= 0 and t1 <= 127)) or (exists (e0 = [(-6 + t1 - i2)/128]: 128e0 = -6 + t1 - i2 and i2 >= 123 and i2 <= 124 and t1 <= 127 and t1 >= 0 )) } [t1] -> { : t1 >= 0 and t1 <= 127 } [t1] -> { [i0, i1, i2, i3, i4] -> unroll[o0] } cloog-0.18.2/isl/test_inputs/codegen/mod.in0000664000175000017500000000021312254313240015503 00000000000000# check that modulo constraint is generated correctly [n, m] -> { A[] -> [] : 2 * (n % 100) = 3 * (m % 200) } [n, m] -> { : m, n >= 0 } {} cloog-0.18.2/isl/test_inputs/codegen/shift2.in0000664000175000017500000000301512254313240016126 00000000000000# Check that the shifting code is not confused by domains that # have a non-obviously fixed value. [tsteps, length] -> { S_4[iter] -> [iter, 0, o2, o3, 0, o5, o6, 3] : exists (e0 = [(o2)/32], e1 = [(o3)/32], e2 = [(-length + o5)/32], e3 = [(-2length + o6)/32]: tsteps = 2 and 32e0 = o2 and 32e1 = o3 and 32e2 = -length + o5 and 32e3 = -2length + o6 and o2 <= length and o2 >= -31 + length and o3 <= 2length and o3 >= -30 + 2length and o5 >= 0 and o5 <= 31 and o6 >= 0 and o6 <= 30 and iter <= 1 and iter >= 0); S_3[iter, i, j] -> [iter, o1, o2, o3, o4, o5, o6, 2] : exists (e0 = [(o1)/32], e1 = [(o2)/32], e2 = [(o3)/32], e3 = [(-i + o4)/32], e4 = [(-j + o5)/32], e5 = [(-2j + o6)/32]: tsteps = 2 and 32e0 = o1 and 32e1 = o2 and 32e2 = o3 and 32e3 = -i + o4 and 32e4 = -j + o5 and 32e5 = -2j + o6 and o1 <= i and o1 >= -31 + i and o2 <= j and o2 >= -31 + j and o3 <= 2j and o3 >= -30 + 2j and o4 >= 0 and o4 <= 31 and o5 >= 0 and o5 <= 31 and o6 >= 0 and o6 <= 30 and j >= 1 + i and i >= 0 and iter <= 1 and iter >= 0 and j <= -1 + length); S_0[iter, i, j] -> [iter, 0, o2, o3, 0, o5, o6, 4] : exists (e0 = [(o2)/32], e1 = [(o3)/32], e2 = [(-i + o5)/32], e3 = [(-31 + j - o6)/32]: tsteps = 2 and 32e0 = o2 and 32e1 = o3 and 32e2 = -i + o5 and 32e3 = -31 + j - o6 and o2 <= i and o2 >= -31 + i and o3 <= 1 + j and o3 >= -30 + j and o5 >= 0 and o5 <= 31 and o6 >= 0 and o6 <= 31 and i <= -1 + length and i >= 0 and iter >= 0 and iter <= 1 and j <= -1 + length and j >= 0) } [tsteps, length] -> { : length >= 0 and length <= 1024 and tsteps = 2 } { } cloog-0.18.2/isl/test_inputs/codegen/shift.in0000664000175000017500000000010612254313240016042 00000000000000{ A[i] -> [2i]: 0 <= i < 10; B[i] -> [2i+1] : 0 <= i < 10 } { : } { } cloog-0.18.2/isl/test_inputs/codegen/separate.c0000664000175000017500000000013112254313240016343 00000000000000{ a(0); for (int c0 = 1; c0 <= 9; c0 += 1) { b(c0 - 1); a(c0); } b(9); } cloog-0.18.2/isl/test_inputs/codegen/unroll2.in0000664000175000017500000000024612254313240016327 00000000000000# Check that the different disjuncts in the unroll option # are handled separately. { A[i] -> [i] : 0 <= i < 100000 } { : } { [i] -> unroll[0] : i < 4 or i > 99996 } cloog-0.18.2/isl/test_inputs/codegen/atomic3.in0000664000175000017500000000032012254313240016262 00000000000000# Check that isl is not confused by inconsistent # separation_class and atomic options. { sync[] -> [i, 0] : 0 <= i <= 64 } { : } { [i, 0] -> separation_class[[1] -> [0]] : 1 <= i <= 62; [i, 0] -> atomic[1]} cloog-0.18.2/isl/test_inputs/codegen/separate2.in0000664000175000017500000000222412254313240016616 00000000000000# Check that rational affine expressions are printer properly. [tsteps, length] -> { S_0[iter, i, j] -> [iter, 0, o2, o3, 0, o5, o6, 4] : exists (e0 = [(o2)/32], e1 = [(o3)/32], e2 = [(-i + o5)/32], e3 = [(-31 + j - o6)/32]: tsteps = 2 and 32e0 = o2 and 32e1 = o3 and 32e2 = -i + o5 and 32e3 = -31 + j - o6 and o2 <= i and o2 >= -31 + i and o3 <= 1 + j and o3 >= -30 + j and o5 >= 0 and o5 <= 31 and o6 >= 0 and o6 <= 31 and i <= -1 + length and i >= 0 and iter >= 0 and iter <= 1 and j <= -1 + length and j >= 0 and o2 >= -31 + length and o3 >= -30 + 2length); S_3[iter, 0, j] -> [iter, 0, o2, o3, o4, o5, o6, 2] : exists (e0 = [(o2)/32], e1 = [(o3)/32], e2 = [(o4)/32], e3 = [(-2o5 + o6)/32], e4 = [(j - o5)/32]: tsteps = 2 and 32e0 = o2 and 32e1 = o3 and 32e2 = o4 and 32e3 = -2o5 + o6 and 32e4 = j - o5 and iter <= 1 and j <= -1 + length and o2 <= j and o2 >= -31 + j and o3 <= 2j and o3 >= -30 + 2j and o4 >= 0 and o4 <= 31 and o5 >= 0 and o5 <= 31 and o6 >= 0 and o6 <= 30 and j >= 1 and iter >= 0 and o2 >= -31 + length and o3 >= -30 + 2length) } [tsteps, length] -> { : length >= 1 and length <= 1024 and tsteps = 2 } { [o0,o1,o2,o3,o4,o5,o6,o7] -> separate[x] } cloog-0.18.2/isl/test_inputs/codegen/mod.c0000664000175000017500000000005312254313240015321 00000000000000if (2 * (n % 100) == 3 * (m % 200)) A(); cloog-0.18.2/isl/test_inputs/codegen/shift_unroll.c0000664000175000017500000000032312254313240017252 00000000000000for (int c0 = 0; c0 <= 9; c0 += 1) { A(c0, 0); A(c0, 1); A(c0, 2); A(c0, 3); A(c0, 4); A(c0, 5); A(c0, 6); A(c0, 7); A(c0, 8); A(c0, 9); for (int c2 = 0; c2 <= 9; c2 += 1) B(c0, c2); } cloog-0.18.2/isl/test_inputs/codegen/separation_class3.c0000664000175000017500000000165612254313240020171 00000000000000for (int c0 = 0; c0 <= 4; c0 += 1) { if (c0 == 0) { S_0(0, 4); } else { S_0(2 * c0 - 1, 1); if (c0 == 4) { for (int c6 = 3; c6 <= 5; c6 += 1) S_0(7, c6); } else for (int c4 = 2 * c0 - 1; c4 <= 2 * c0; c4 += 1) for (int c6 = -2 * c0 + c4 + 4; c6 <= 2 * c0 - c4 + 4; c6 += 1) S_0(c4, c6); } for (int c4 = max(2 * c0 - 1, 0); c4 <= min(7, 2 * c0); c4 += 1) for (int c6 = -2 * c0 + c4 + 8; c6 <= 8; c6 += 1) S_0(c4, c6); if (c0 <= 3 && c0 >= 1) { for (int c2 = 0; c2 <= 1; c2 += 1) for (int c4 = 2 * c0 - 1; c4 <= 2 * c0; c4 += 1) for (int c6 = 2 * c0 + 4 * c2 - c4 + 1; c6 <= -2 * c0 + 4 * c2 + c4 + 3; c6 += 1) S_0(c4, c6); } else if (c0 == 4) { for (int c2 = 0; c2 <= 1; c2 += 1) S_0(7, 4 * c2 + 2); } else for (int c2 = 0; c2 <= 1; c2 += 1) for (int c6 = 4 * c2 + 1; c6 <= 4 * c2 + 3; c6 += 1) S_0(0, c6); } cloog-0.18.2/isl/test_inputs/codegen/unroll3.c0000664000175000017500000000010712254313240016140 00000000000000if ((t1 + 121) % 128 <= 123) write_shared_A(((t1 + 125) % 128) - 3); cloog-0.18.2/isl/test_inputs/codegen/disjuncts.in0000664000175000017500000000044412254313240016740 00000000000000# Check that conditions are hoisted up from the innermost loop [n] -> { a[i,j,k,l] -> [i,j,0,k,l] : 0 <= i,j,k,l <= n and (i = 0 or j = 0 or i = n or j = n); b[i,j,k,l] -> [i,j,1,k,l] : 0 <= i,j,k,l <= n and (i = 0 or j = 0 or i = n or j = n) } { : } { [i,j,t,k,l] -> atomic[x] } cloog-0.18.2/isl/test_inputs/codegen/separate2.c0000664000175000017500000000115712254313240016436 00000000000000if ((length - 1) % 16 <= 14) for (int c0 = 0; c0 <= 1; c0 += 1) for (int c5 = 0; c5 <= 31; c5 += 1) for (int c6 = 0; c6 <= 30; c6 += 1) { if ((2 * c5 - c6 + 31) % 32 == 31 && 2 * ((length - 1) % 16) + 2 * c5 == 2 * ((length - 1) % 32) + c6 && c6 + 62 >= 2 * ((length - 1) % 16) + 2 * c5 && 2 * length + c6 >= 2 * ((length - 1) % 16) + 4 && 2 * ((length - 1) % 16) >= c6 && 2 * ((length - 1) % 16) + 2 * c5 >= c6) S_3(c0, 0, (-(2 * ((length - 1) % 16)) + 2 * length + c6 - 2) / 2); if (length <= 16 && length >= c5 + 1 && c6 >= 1 && length >= c6) S_0(c0, c5, c6 - 1); } cloog-0.18.2/isl/test_inputs/codegen/unroll6.c0000664000175000017500000000063212254313240016146 00000000000000{ if (((-t1 + 128) % 128) + nn >= 128 * g + 130 && 128 * g + 127 >= (-t1 + 128) % 128 && nn >= 128 * g + 6) for (int c1 = 393214; c1 < nn - 1; c1 += 393216) A(c1, ((t1 + 127) % 128) + 128 * g + 1, ((t1 + 127) % 128) + 1); if (nn >= t1 + 128 * g + 130 && t1 + 128 * g >= -127 && t1 <= 2 && t1 >= 1) for (int c1 = 393214; c1 < nn - 1; c1 += 393216) A(c1, t1 + 128 * g + 128, t1 + 128); } cloog-0.18.2/isl/test_inputs/codegen/atomic4.in0000664000175000017500000000031312254313240016265 00000000000000# Check that isl is not confused by inconsistent separate and atomic options. { sync[] -> [i, 0] : 0 <= i <= 64 } { : } { [i, 0] -> separate[1] : 1 <= i <= 62; [i, 0] -> atomic[1] : i <= 10 or i >= 20 } cloog-0.18.2/isl/test_inputs/codegen/hoist2.c0000664000175000017500000000023612254313240015755 00000000000000for (int c0 = 1; c0 <= 5; c0 += 1) for (int c1 = max(t1, t1 - 64 * b + 64); c1 <= min(70, -((c0 + 1) % 2) - c0 + 73); c1 += 64) A(c0, 64 * b + c1 - 8); cloog-0.18.2/isl/test_inputs/codegen/shift2.c0000664000175000017500000000475212254313240015753 00000000000000for (int c0 = 0; c0 <= 1; c0 += 1) { for (int c1 = 0; c1 < length - 1; c1 += 32) { for (int c2 = c1; c2 < length; c2 += 32) { if (c1 == 0) for (int c3 = 0; c3 <= min(length, 2 * c2 - 32); c3 += 32) for (int c5 = 0; c5 <= min(31, length - c2 - 1); c5 += 1) for (int c6 = max(-c3 + 1, 0); c6 <= min(31, length - c3); c6 += 1) S_0(c0, c2 + c5, c3 + c6 - 1); for (int c3 = max(2 * c1, 2 * c2); c3 <= min(2 * c2 + 62, 2 * length - 2); c3 += 32) for (int c4 = 0; c4 <= min(min(length - c1 - 2, -c1 + c3 / 2 + 14), 31); c4 += 1) { if (c4 == 0 && c3 == 0 && c2 == 0 && c1 == 0) { for (int c6 = 1; c6 <= min(31, length); c6 += 1) S_0(c0, 0, c6 - 1); } else if (c4 == 0 && c3 == 2 * c2 + 32 && c1 == 0) for (int c5 = 0; c5 <= 15; c5 += 1) for (int c6 = 0; c6 <= min(31, length - 2 * c2 - 32); c6 += 1) S_0(c0, c2 + c5, 2 * c2 + c6 + 31); for (int c5 = max((-2 * c2 + c3) / 2, c1 - c2 + c4 + 1); c5 <= min(-c2 + c3 / 2 + 15, length - c2 - 1); c5 += 1) { if (c4 == 0 && c1 == 0) for (int c6 = max(-c3 + 1, 0); c6 <= min(2 * c2 - c3 + 2 * c5 - 1, length - c3); c6 += 1) S_0(c0, c2 + c5, c3 + c6 - 1); S_3(c0, c1 + c4, c2 + c5); if (c4 == 0 && c1 == 0 && length >= 2 * c2 + 2 * c5) S_0(c0, c2 + c5, 2 * c2 + 2 * c5 - 1); if (c4 == 0 && c1 == 0) for (int c6 = 2 * c2 - c3 + 2 * c5 + 1; c6 <= min(length - c3, 31); c6 += 1) S_0(c0, c2 + c5, c3 + c6 - 1); } if (c4 == 0 && c1 == 0 && c3 + 30 >= 2 * length) S_4(c0); if (c4 == 0 && c3 == 2 * c2 && c1 == 0) for (int c5 = 16; c5 <= min(length - c2 - 1, 31); c5 += 1) for (int c6 = max(0, -2 * c2 + 1); c6 <= min(31, length - 2 * c2); c6 += 1) S_0(c0, c2 + c5, 2 * c2 + c6 - 1); } if (32 * floord(length - 16, 32) + 16 == length && c2 + 16 == length && c1 == 0) S_4(c0); if (c1 == 0) for (int c3 = 2 * c2 + 64; c3 <= length; c3 += 32) for (int c5 = 0; c5 <= 31; c5 += 1) for (int c6 = 0; c6 <= min(31, length - c3); c6 += 1) S_0(c0, c2 + c5, c3 + c6 - 1); } if (length % 32 == 0 && c1 == 0) S_4(c0); } if (length <= 1) for (int c5 = 0; c5 <= length; c5 += 1) if (c5 == length) { S_4(c0); } else S_0(c0, 0, 0); } cloog-0.18.2/isl/test_inputs/codegen/omega/0000775000175000017500000000000012254313240015550 500000000000000cloog-0.18.2/isl/test_inputs/codegen/omega/iter5-0.in0000664000175000017500000000030412254313240017202 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_2 >= 1 + In_1 and In_2 <= 2In_1 and In_2 <= 16 and In_1 <= 9 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m8-1.c0000664000175000017500000000031512254313240016315 00000000000000for (int c0 = 2; c0 <= 8; c0 += 2) if (c0 % 4 == 0) { for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c1, c0); s1(c1, c0); } } else for (int c1 = 1; c1 <= 9; c1 += 1) s1(c1, c0); cloog-0.18.2/isl/test_inputs/codegen/omega/m7-0.in0000664000175000017500000000040112254313240016473 00000000000000{ s0[i, j] -> [j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [j, i, 1] : exists (e0 = [(j)/2]: 2e0 = j and i >= 1 and i <= 9 and j >= 2 and j <= 8) } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/basics-1.in0000664000175000017500000000027212254313240017423 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_2 >= 1 - In_1 and In_2 >= 1 and In_2 <= 10 - In_1 and In_2 <= 10 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/code_gen-1.in0000664000175000017500000000037212254313240017723 00000000000000{ s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_1 <= 6 and In_2 >= 0 and In_2 <= 4; s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_2 >= -1 + In_1 and In_2 <= 7 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_ijk-2.c0000664000175000017500000000044712254313240017255 00000000000000if (n >= 2) for (int c0 = 1; c0 <= n; c0 += 1) { for (int c1 = 2; c1 <= c0; c1 += 1) for (int c3 = 1; c3 < c1; c3 += 1) s1(c3, c1, c0); for (int c1 = c0 + 1; c1 <= n; c1 += 1) { for (int c3 = 1; c3 < c0; c3 += 1) s1(c3, c1, c0); s0(c0, c1); } } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_spmd-1.in0000664000175000017500000000121012254313240017613 00000000000000[n, lb, ub] -> { s1[k, i, j] -> [k, i, 1, j, 0, 0, 0, 0] : k >= 1 and j >= k and j <= n and j <= ub and i >= k and i <= n and j >= lb; s3[k, i, lb, k, i] -> [k, i, 1, lb, -1, k, i, 0] : k >= 1 and k <= -1 + lb and lb <= n and ub >= lb and i >= k and i <= n; s0[k, i] -> [k, i, 0, 0, 0, 0, 0, 0] : k >= 1 and k >= lb and i >= 1 + k and i <= n and k <= ub; s2[k, i] -> [k, i, 0, 0, 1, 0, 0, 0] : k >= 1 and k >= lb and k <= ub and ub <= -1 + n and i >= 1 + k and i <= n } [lb, n, ub] -> { : ub <= n and lb >= 1 } [n, lb, ub] -> { [i0, i1, i2, i3, i4, i5, i6, i7] -> atomic[o0] : o0 <= 6; [i0, i1, i2, i3, i4, i5, i6, i7] -> separate[o0] : o0 >= 7 } cloog-0.18.2/isl/test_inputs/codegen/omega/m9-0.in0000664000175000017500000000034012254313240016477 00000000000000{ s0[i, j] -> [2j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [2j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/fc1-0.c0000664000175000017500000000034612254313240016445 00000000000000for (int c0 = 0; c0 < n - 1; c0 += 1) { for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) s0(c0 + 1, n - c3); for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) for (int c6 = c0 + 2; c6 <= n; c6 += 1) s1(c0 + 1, n - c3, c6); } cloog-0.18.2/isl/test_inputs/codegen/omega/guard1-1.c0000664000175000017500000000007012254313240017152 00000000000000if (n + 2 * floord(-n + m - 1, 2) + 1 == m) s0(n, m); cloog-0.18.2/isl/test_inputs/codegen/omega/dagstuhl1-1.c0000664000175000017500000000012212254313240017661 00000000000000for (int c0 = 0; c0 <= 99; c0 += 1) s0(c0, (c0 + 10) % 10, (c0 + 10) / 10 - 1); cloog-0.18.2/isl/test_inputs/codegen/omega/gc-0.in0000664000175000017500000000024412254313240016546 00000000000000{ s0[In_1] -> [In_1] : exists (e0 = [(In_1)/2]: 2e0 = In_1 and In_1 >= 2 and In_1 <= 8) } { : } { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-mp-i_ts-m_b-0.in0000664000175000017500000000312012254313240021125 00000000000000[T, N] -> { s1[2, t, 1, i, 1] -> [2, tb, 1, proc, t + i, t - 500tb, 0] : 4000proc >= 3000 + t + i - 1000tb and 500tb <= t and 4000proc <= 3999 - t + i and i >= 1 and i <= -2 + N and t >= 0 and t <= -1 + T; s0[1, -1, c, 0, 0] -> [1, -1, c, 0, 0, 0, 0] : c >= 0 and c <= -1 + N; s0[1, b, 0, 0, 0] -> [1, b, 0, 0, 0, 0, 0] : b >= 0 and b <= -1 + T; s0[1, b, -1 + N, 0, 0] -> [1, b, -1 + N, 0, 0, 0, 0] : b >= 0 and b <= -1 + T; s6[2, -1 + T, 1, i, 1] -> [3, tb, 7, proc, -1 + T + i, -1 + T - 500tb, 0] : 500tb <= -1 + T and 500tb >= -500 + T and 4000proc >= 1 - T + i and 4000proc <= 4000 - T + i and i >= 1 and i <= -2 + N and T >= 1; s3[2, t, 1, i, 1] -> [2, tb, 3, proc, t + i, t - 500tb, 0] : 500tb <= t and 500tb >= -499 + t and 4000proc <= 2999 + t + i - 1000tb and 4000proc >= t + i - 1000tb and i >= 1 and i <= -2 + N and t >= 0 and t <= -1 + T; s2[2, t, 1, i, 1] -> [2, tb, 2, proc, t + i, t - 500tb, 0] : 500tb <= t and 500tb >= -499 + t and 4000proc <= 3999 - t + i and 4000proc >= 3998 - t + i and i >= 1 and i <= -2 + N and t >= 0 and t <= -1 + T; s4[2, t, 1, i, 1] -> [2, tb, 4, Out_4, t + i, t - 500tb, 0] : 500tb <= t and 500tb >= -499 + t and 4000Out_4 <= -1 - t + i and 4000Out_4 >= -2 - t + i and i >= 1 and i <= -2 + N and t >= 0 and t <= -1 + T; s5[2, t, 1, i, 1] -> [2, tb, 5, proc, t + i, t - 500tb, 0] : 500tb >= -499 + t and 4000proc <= -1 + t + i - 1000tb and 4000proc >= -t + i and i >= 1 and i <= -2 + N and t >= 0 and t <= -1 + T } [T, N] -> { : T >= 0 and N >= 4 } [N, T] -> { [i0, i1, i2, i3, i4, i5, i6] -> atomic[o0] : o0 <= 5; [i0, i1, i2, i3, i4, i5, i6] -> separate[o0] : o0 >= 6 } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-4.c0000664000175000017500000000014312254313240020303 00000000000000if (n >= 3 * floord(n + 1, 3)) for (int c0 = m; c0 <= 5 * floord(n + 1, 3); c0 += 1) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/gist-3.c0000664000175000017500000000013412254313240016740 00000000000000for (int c0 = 1; c0 < n; c0 += 4) for (int c1 = c0 + 1; c1 <= n; c1 += 6) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/stride6-1.in0000664000175000017500000000037212254313240017540 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(In_1)/2], e1 = [(In_2)/2]: 2e0 = In_1 and 2e1 = In_2 and In_1 >= 2 and In_2 >= In_1 and In_2 <= 400 and In_1 <= 100) } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_ijk-1.c0000664000175000017500000000027412254313240017252 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) for (int c1 = 2; c1 <= n; c1 += 1) { for (int c3 = 1; c3 < min(c0, c1); c3 += 1) s1(c3, c1, c0); if (c1 >= c0 + 1) s0(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/code_gen-0.c0000664000175000017500000000025712254313240017540 00000000000000for (int c0 = 1; c0 <= 8; c0 += 1) for (int c1 = 0; c1 <= 7; c1 += 1) { if (c1 <= 4 && c0 <= 6 && c0 >= 2) s1(c0, c1); if (c1 + 1 >= c0) s0(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/lu-2.in0000664000175000017500000000106112254313240016575 00000000000000[n] -> { s1[k, i, j] -> [t1, t2, j, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and i >= 1 + k and j >= 1 + k and k >= 1 and i <= n and j <= n); s0[k, i] -> [t1, t2, k, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and k >= 1 and i >= 1 + k and i <= n) } { : } [n] -> { [t1, t2, i2, i3, i4] -> separate[o0] : o0 >= 3; [t1, t2, i2, i3, i4] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-3.in0000664000175000017500000000016312254313240020734 00000000000000[n] -> { s0[19 + n] -> [19 + n] } { : } [n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/fc2-0.c0000664000175000017500000000034612254313240016446 00000000000000for (int c0 = 0; c0 < n - 1; c0 += 1) { for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) s0(c0 + 1, n - c3); for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) for (int c6 = c0 + 2; c6 <= n; c6 += 1) s1(c0 + 1, n - c3, c6); } cloog-0.18.2/isl/test_inputs/codegen/omega/m2-0.in0000664000175000017500000000040012254313240016465 00000000000000{ s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 5 and In_1 <= 9 and In_2 >= 1 and In_2 <= 9; s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_1 <= 9 and In_2 >= 2 and In_2 <= 9 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-0.c0000664000175000017500000000013112254313240016732 00000000000000for (int c0 = 1; c0 <= n; c0 += 4) for (int c1 = c0; c1 <= n; c1 += 3) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/m1-0.c0000664000175000017500000000020012254313240016276 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c0, c1); if (c0 == 5) s1(5, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/wak4-0.in0000664000175000017500000000067212254313240017030 00000000000000[a1, a2, a3, a4, a5, b1, b2, b3, b4, b5] -> { s0[i] -> [i, 0] : i >= a1 and i >= a2 and i >= a3 and i >= a4 and i >= a5 and i <= b1 and i <= b2 and i <= b3 and i <= b4 and i <= b5; s1[i] -> [i, 1] : i >= a1 and i >= a2 and i >= a3 and i >= a4 and i >= a5 and i <= b1 and i <= b2 and i <= b3 and i <= b4 and i <= b5 } { : } [a1, a2, a3, a4, a5, b1, b2, b3, b4, b5] -> { [i0, i1] -> separate[o0] : o0 >= 1; [i0, i1] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/m10-1.c0000664000175000017500000000052712254313240016373 00000000000000for (int c0 = 1; c0 <= 18; c0 += 1) if (c0 <= 9 && c0 >= 2) { for (int c1 = 1; c1 <= 9; c1 += 1) { if (c0 % 2 == 0) s0(c1, c0 / 2); s1(c1, c0); } } else if (c0 == 1) { for (int c1 = 1; c1 <= 9; c1 += 1) s1(c1, 1); } else if (c0 % 2 == 0) for (int c1 = 1; c1 <= 9; c1 += 1) s0(c1, c0 / 2); cloog-0.18.2/isl/test_inputs/codegen/omega/x-1.in0000664000175000017500000000035712254313240016432 00000000000000{ s0[i, j] -> [8 - i + j, i, 0] : i >= 1 and i <= 8 and j >= 1 and j <= 4; s1[i, j] -> [-1 + i + j, i, 1] : i >= 1 and i <= 8 and j >= 1 and j <= 4 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/p.delft-0.in0000664000175000017500000000055012254313240017511 00000000000000[P2, P1] -> { s0[In_1, In_1, In_3, In_3] -> [In_1, In_1, In_3, In_3] : exists (e0 = [(-2P2 - 2In_1 + In_3)/3]: P1 = P2 and 3e0 = -2P2 - 2In_1 + In_3 and P2 >= 0 and P2 <= 3 and In_1 <= 4 - P2 and In_1 >= 0 and In_1 <= 2 and In_3 >= 0 and In_3 <= 3) } { : } [P2, P1] -> { [i0, i1, i2, i3] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur00-0.c0000664000175000017500000000101612254313240017244 00000000000000for (int c0 = 0; c0 <= 15; c0 += 1) for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(c0 + 1, 15); c1 += 1) for (int c2 = max(max(max(67 * c0 - (c0 + 1) / 3, 1), 67 * c1 - (c1 + 2) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(100 * c0 + 99, 1000), 133 * c0 - 67 * c1 + floord(c0 + c1 - 1, 3) + 133); c2 += 1) for (int c3 = max(max(100 * c1 + (c2 + 1) / 2, 200 * c0 - c2), c2); c3 <= min(min(200 * c0 - c2 + 199, 100 * c1 + (c2 + 1) / 2 + 99), 2 * c2 + 1); c3 += 1) s0(c0, c1, c2, c3); cloog-0.18.2/isl/test_inputs/codegen/omega/iter4-0.in0000664000175000017500000000026512254313240017207 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_2 >= 1 + In_1 and In_2 <= 2In_1 and In_1 <= 9 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m10-0.c0000664000175000017500000000023512254313240016366 00000000000000for (int c0 = 1; c0 <= 18; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { if (c0 % 2 == 0) s0(c1, c0 / 2); if (c0 <= 9) s1(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/lu-1.c0000664000175000017500000000064012254313240016412 00000000000000for (int c0 = 1; c0 < n; c0 += 64) for (int c1 = c0 - 1; c1 <= n; c1 += 64) for (int c2 = c0; c2 <= n; c2 += 1) { for (int c3 = c0; c3 <= min(min(c0 + 63, c1 + 62), c2 - 1); c3 += 1) for (int c4 = max(c3 + 1, c1); c4 <= min(c1 + 63, n); c4 += 1) s1(c3, c4, c2); if (c0 + 63 >= c2) for (int c4 = max(c2 + 1, c1); c4 <= min(n, c1 + 63); c4 += 1) s0(c2, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-2.c0000664000175000017500000000033212254313240017405 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) if (n >= 2) { s0(c0); for (int c1 = 1; c1 <= 100; c1 += 1) { s1(c0, c1); s2(c0, c1); } } else for (int c1 = 1; c1 <= 100; c1 += 1) s2(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/stride5-0.in0000664000175000017500000000041512254313240017534 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(In_1)/2], e1 = [(In_2)/2]: 2e0 = In_1 and 2e1 = In_2 and In_1 >= 2 and In_1 <= 100 and In_2 <= 400 and In_2 >= 2n + In_1) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-1.in0000664000175000017500000000053412254313240017574 00000000000000[n] -> { s0[In_1] -> [In_1,0] : In_1 >= 1 and In_1 <= 100 and n >= 2; s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and n >= 2; s2[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 } { : } [n] -> { [i0,i1] -> separate[o0] : o0 >= 2; [i0,i1] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/fc2-1.in0000664000175000017500000000071112254313240016627 00000000000000[n] -> { s1[i, j, k] -> [-1 + i, 1, n - i, n - j] : j >= 1 + i and k >= 1 + i and i >= 1 and j <= n and k <= n; s3[i, j] -> [-1 + n + j, 0, i, j] : j >= 1 and j <= -1 + i and i <= n; s4[i] -> [-2 + n + i, 1, 0, 0] : i >= 1 and i <= n; s0[i, j] -> [-1 + i, 0, n - i, n - j] : i >= 1 and j >= 1 + i and j <= n; s2[i] -> [0, 0, 0, i] : i >= 1 and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/collard-0.in0000664000175000017500000000070012254313240017572 00000000000000[n] -> { s1[i, j, k] -> [1, i, 1, n - j, k] : j >= 1 + i and k >= 1 + i and i >= 1 and j <= n and k <= n; s2[i] -> [0, 0, 0, 0, i] : i >= 1 and i <= n; s4[i] -> [2, i, 0, 0, 0] : i >= 1 and i <= n; s0[i, j] -> [1, i, 0, n - i, n - j] : i >= 1 and j >= 1 + i and j <= n; s3[i, j] -> [2, j, 1, i, j] : j >= 1 and j <= -1 + i and i <= n } { : } [n] -> { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 4; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-0.c0000664000175000017500000000046712254313240017017 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); if (c0 <= 60) s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/wak4-1.c0000664000175000017500000000020512254313240016635 00000000000000for (int c0 = max(max(max(max(a1, a2), a3), a4), a5); c0 <= min(min(min(min(b5, b4), b3), b2), b1); c0 += 1) { s0(c0); s1(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/wak4-0.c0000664000175000017500000000020512254313240016634 00000000000000for (int c0 = max(max(max(max(a1, a2), a3), a4), a5); c0 <= min(min(min(min(b5, b4), b3), b2), b1); c0 += 1) { s0(c0); s1(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/chosol-0.in0000664000175000017500000000041312254313240017442 00000000000000[n] -> { s0[i] -> [0, i, 0, 0] : i >= 2 and i <= n; s1[i, j] -> [1, j, 0, i] : j >= 1 and j <= -1 + i and i <= n; s2[i] -> [1, -1 + i, 1, 0] : i >= 2 and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter9-0.in0000664000175000017500000000215312254313240017212 00000000000000[exprVar2, exprVar1] -> { s3[In_1] -> [In_1] : exists (e0: exprVar2 = 0 and 8e0 >= -15 + exprVar1 and exprVar1 <= 15 and In_1 >= 1 and 8e0 <= exprVar1 - In_1); s4[In_1] -> [In_1] : exists (e0: exprVar2 = 0 and 8e0 >= -15 + exprVar1 and exprVar1 <= 15 and In_1 >= 1 and 8e0 <= exprVar1 - In_1); s1[In_1] -> [In_1] : exists (e0: exprVar2 = 0 and 8e0 >= -15 + exprVar1 and exprVar1 <= 15 and In_1 >= 1 and 8e0 <= exprVar1 - In_1); s5[In_1] -> [In_1] : (exists (e0: exprVar2 = 0 and 8e0 >= -15 + exprVar1 and exprVar1 <= 15 and In_1 >= 1 and 8e0 <= exprVar1 - In_1)) or (exists (e0 = [(-1 - exprVar1 + In_1)/8]: exprVar2 = 0 and 8e0 = -1 - exprVar1 + In_1 and In_1 >= 1 + exprVar1 and In_1 >= 1 and In_1 <= 15)); s0[In_1] -> [In_1] : exists (e0: exprVar2 = 0 and 8e0 >= -15 + exprVar1 and exprVar1 <= 15 and In_1 >= 1 and 8e0 <= exprVar1 - In_1); s2[In_1] -> [In_1] : exists (e0: exprVar2 = 0 and 8e0 >= -15 + exprVar1 and exprVar1 <= 15 and In_1 >= 1 and 8e0 <= exprVar1 - In_1) } [exprVar2, exprVar1] -> { : exprVar2 = 0 and exprVar1 <= 15 } [exprVar2, exprVar1] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak3-0.c0000664000175000017500000000022712254313240016637 00000000000000for (int c0 = a; c0 <= b + 20; c0 += 1) { if (b >= c0) s0(c0); if (c0 >= a + 10 && b + 10 >= c0) s1(c0); if (c0 >= a + 20) s2(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-0.c0000664000175000017500000000035112254313240017042 00000000000000for (int c0 = 1; c0 <= min(2 * b - 1, n); c0 += 1) for (int c1 = max(-b + 1, -n + 1); c1 <= min(n - c0, b - c0); c1 += 1) for (int c2 = max(1, c0 + c1); c2 <= min(n + c1, n); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-2.c0000664000175000017500000000071212254313240017012 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) if (c0 >= 61) { for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/README0000664000175000017500000000036312254313240016352 00000000000000The tests in this directory have been adapted from the corresponding omega+ test cases. The options have been derived semi-automatically and may not always correspond to the intended meaning of the specified "effort" in the omega+ test cases. cloog-0.18.2/isl/test_inputs/codegen/omega/wak3-1.in0000664000175000017500000000035412254313240017025 00000000000000[a, b] -> { s2[i] -> [i, 2] : i >= 20 + a and i <= 20 + b; s0[i] -> [i, 0] : i >= a and i <= b; s1[i] -> [i, 1] : i >= 10 + a and i <= 10 + b } { : } [a, b] -> { [i0, i1] -> atomic[o0] : o0 <= -1; [i0, i1] -> separate[o0] : o0 >= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/ge-0.c0000664000175000017500000000027412254313240016367 00000000000000for (int c0 = 2; c0 <= n; c0 += 1) for (int c1 = 1; c1 <= n; c1 += 1) { for (int c3 = 1; c3 < min(c0, c1); c3 += 1) s1(c3, c0, c1); if (c0 >= c1 + 1) s0(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur01-1.in0000664000175000017500000000053212254313240017434 00000000000000{ s0[In_1, In_2, In_3, In_4] -> [In_1, In_2, In_3, In_4] : In_3 >= 1 and In_4 >= In_3 and In_4 <= 1 + 2In_3 and In_3 <= 1000 and In_4 >= 200In_1 - In_3 and In_4 <= 199 + 200In_1 - In_3 and 2In_4 >= 200In_2 + In_3 and 2In_4 <= 199 + 200In_2 + In_3 } { : } { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 1; [i0, i1, i2, i3] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/p.delft2-0.in0000664000175000017500000000250612254313240017576 00000000000000[P1, P2] -> { s0[In_1, P2, In_3, In_4, In_5, In_6] -> [In_1, P2, In_3, In_4, In_5, In_6] : (exists (e0 = [(8 + 4In_1 + 16In_3 + In_5)/9], e1 = [(12 - 4P1 + 9e0)/16], e2 = [(-2In_1 - 2In_3 + In_5)/3], e3 = [(-5P2 - 2In_4 + In_6)/9]: 3e2 = -2In_1 - 2In_3 + In_5 and 9e3 = -5P2 - 2In_4 + In_6 and P1 >= 0 and In_1 >= 1 + P1 and In_1 <= 3 and P2 >= 0 and P2 <= 3 and In_6 >= 0 and In_6 <= 3 and In_5 >= 0 and In_5 <= 3 and In_5 >= 1 - 4In_1 - 16In_3 and In_5 <= 126 - 4In_1 - 16In_3 and In_6 <= 126 - 4P2 - 16In_4 and 16e1 <= -4P1 + 9e0 and 2In_6 <= P2 + 4In_4 and 9e0 <= 3 + 4In_1 + 16In_3 + In_5 and 9e0 >= 4In_1 + 16In_3 + In_5 and 16e1 >= -3 - 4P1 + 9e0)) or (exists (e0 = [(8 + 4In_1 + 16In_3 + In_5)/9], e1 = [(12 - 4P1 + 9e0)/16], e2 = [(-2In_1 - 2In_3 + In_5)/3], e3 = [(-5P2 - 2In_4 + In_6)/9]: 3e2 = -2In_1 - 2In_3 + In_5 and 9e3 = -5P2 - 2In_4 + In_6 and In_1 >= 0 and In_1 <= -1 + P1 and P1 <= 3 and In_6 >= 0 and In_6 <= 3 and In_6 <= 1 + 2In_4 and P2 >= 0 and P2 <= 3 and In_5 >= 0 and In_5 <= 3 and In_5 >= 1 - 4In_1 - 16In_3 and In_5 <= 126 - 4In_1 - 16In_3 and In_6 <= 126 - 4P2 - 16In_4 and 16e1 <= -4P1 + 9e0 and 9e0 <= 3 + 4In_1 + 16In_3 + In_5 and 9e0 >= 4In_1 + 16In_3 + In_5 and 16e1 >= -3 - 4P1 + 9e0)) } { : } [P1, P2] -> { [i0, i1, i2, i3, i4, i5] -> atomic[o0] : o0 <= 4; [i0, i1, i2, i3, i4, i5] -> separate[o0] : o0 >= 5 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-5.in0000664000175000017500000000103412254313240017200 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 5 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 0; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/code_gen-2.in0000664000175000017500000000037312254313240017725 00000000000000{ s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_1 <= 6 and In_2 >= 0 and In_2 <= 4; s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_2 >= -1 + In_1 and In_2 <= 7 } { : } { [i0, i1] -> atomic[o0] : o0 <= -1; [i0, i1] -> separate[o0] : o0 >= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/chosol-1.c0000664000175000017500000000025512254313240017263 00000000000000{ for (int c1 = 2; c1 <= n; c1 += 1) s0(c1); for (int c1 = 1; c1 < n; c1 += 1) { for (int c3 = c1 + 1; c3 <= n; c3 += 1) s1(c3, c1); s2(c1 + 1); } } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-2.in0000664000175000017500000000041612254313240017126 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-1 + In_1)/256], e1 = [(-1 + In_2)/8]: 256e0 = -1 + In_1 and 8e1 = -1 + In_2 and In_1 >= 1 and In_2 >= In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride3-0.in0000664000175000017500000000037012254313240017532 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-3 + In_1)/32]: 32e0 = -3 + In_1 and In_2 <= 31 + In_1 and In_1 >= 3 and In_2 >= In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m11-0.in0000664000175000017500000000106512254313240016555 00000000000000[m] -> { s0[In_1, In_2, In_3, In_4, In_5, In_6, 5 - 5In_2 - 5In_3 + In_5] -> [In_1, In_2, In_3, In_4, In_5, In_6, 5 - 5In_2 - 5In_3 + In_5] : In_2 >= 1 and 2In_3 >= 1 - In_2 and In_2 <= 2 and 2In_3 <= 6 - In_2 and In_4 <= 30 and In_1 >= 1 and 2In_6 <= 18 - 17In_1 + 2In_4 and 2In_6 >= 17 - 17In_1 + 2In_4 and In_5 <= 5In_2 + 10In_3 and In_5 >= -4 + 5In_2 + 10In_3 and 2In_4 <= 17In_1 and 2In_4 >= -16 + 17In_1 and In_5 <= 1 + m - In_4 } { : } [m] -> { [i0, i1, i2, i3, i4, i5, i6] -> atomic[o0] : o0 <= 5; [i0, i1, i2, i3, i4, i5, i6] -> separate[o0] : o0 >= 6 } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-2.in0000664000175000017500000000020612254313240020731 00000000000000{ s0[i, 4 + i] -> [i, 4 + i] : i >= -3 and i <= 96 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-0.c0000664000175000017500000000012012254313240020272 00000000000000for (int c0 = 4 * floord(m - 1, 12) + 4; c0 <= floord(n, 3); c0 += 4) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-3.in0000664000175000017500000000103312254313240017175 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 5 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 2; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-0.in0000664000175000017500000000103312254313240017171 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 5; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 4 } cloog-0.18.2/isl/test_inputs/codegen/omega/p6-1.c0000664000175000017500000000016712254313240016323 00000000000000for (int c0 = -9; c0 <= 9; c0 += 1) for (int c1 = max(-c0 + 1, 1); c1 <= min(-c0 + 10, 10); c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/lu_spmd-1.c0000664000175000017500000000052612254313240017440 00000000000000if (ub >= lb) for (int c0 = 1; c0 <= ub; c0 += 1) for (int c1 = c0; c1 <= n; c1 += 1) { if (lb >= c0 + 1) { s3(c0, c1, lb, c0, c1); } else if (c1 >= c0 + 1) { s0(c0, c1); if (n >= ub + 1) s2(c0, c1); } for (int c3 = max(c0, lb); c3 <= ub; c3 += 1) s1(c0, c1, c3); } cloog-0.18.2/isl/test_inputs/codegen/omega/stride6-2.c0000664000175000017500000000013512254313240017352 00000000000000for (int c0 = 2; c0 <= 100; c0 += 2) for (int c1 = c0; c1 <= 400; c1 += 2) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/m9-1.in0000664000175000017500000000034012254313240016500 00000000000000{ s0[i, j] -> [2j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [2j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/m12-1.c0000664000175000017500000000103312254313240016366 00000000000000{ for (int c1 = 1; c1 <= n; c1 += 1) for (int c2 = 1; c2 <= m; c2 += 1) { s0(1, c1, c2, 0); s1(1, c1, c2, 0); } for (int c1 = 1; c1 <= n; c1 += 1) { s3(2, c1, 0, 0); s2(2, c1, 0, 0); } for (int c1 = 1; c1 <= m; c1 += 1) { for (int c3 = 1; c3 <= n; c3 += 1) { s5(3, c1, 1, c3); s4(3, c1, 1, c3); } for (int c3 = 1; c3 <= n; c3 += 1) { s7(3, c1, 2, c3); s6(3, c1, 2, c3); } } for (int c1 = 1; c1 <= m; c1 += 1) { s8(4, c1, 0, 0); s9(4, c1, 0, 0); } } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-3.c0000664000175000017500000000076312254313240017021 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) if (c0 >= 61) { for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/m11-0.c0000664000175000017500000000100412254313240016362 00000000000000for (int c0 = 1; c0 <= min(4, floord(2 * m - 1, 17) + 1); c0 += 1) for (int c1 = 1; c1 <= 2; c1 += 1) for (int c2 = 0; c2 <= min(-c1 + c1 / 2 + 3, -c0 - c1 + (2 * m + 3 * c0 + 10 * c1 + 6) / 20 + 1); c2 += 1) for (int c3 = 8 * c0 + (c0 + 1) / 2 - 8; c3 <= min(min(8 * c0 + c0 / 2, 30), m - 5 * c1 - 10 * c2 + 5); c3 += 1) for (int c4 = 5 * c1 + 10 * c2 - 4; c4 <= min(m - c3 + 1, 5 * c1 + 10 * c2); c4 += 1) s0(c0, c1, c2, c3, c4, -9 * c0 + c3 + c0 / 2 + 9, -5 * c1 - 5 * c2 + c4 + 5); cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-2.in0000664000175000017500000000053412254313240017575 00000000000000[n] -> { s0[In_1] -> [In_1,0] : In_1 >= 1 and In_1 <= 100 and n >= 2; s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and n >= 2; s2[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 } { : } [n] -> { [i0,i1] -> separate[o0] : o0 >= 1; [i0,i1] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/m8-0.in0000664000175000017500000000044412254313240016503 00000000000000{ s0[i, j] -> [j, i, 0] : exists (e0 = [(j)/4]: 4e0 = j and i >= 1 and i <= 9 and j >= 4 and j <= 8); s1[i, j] -> [j, i, 1] : exists (e0 = [(j)/2]: 2e0 = j and i >= 1 and i <= 9 and j >= 2 and j <= 8) } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak2-1.c0000664000175000017500000000222712254313240016641 00000000000000{ for (int c0 = a1; c0 <= min(a2 - 1, b1); c0 += 1) for (int c1_0 = c1; c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); if (c2 >= d2 + 1) { for (int c0 = max(a1, a2); c0 <= min(b2, b1); c0 += 1) for (int c1_0 = c1; c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); } else for (int c0 = a2; c0 <= b2; c0 += 1) if (a1 >= c0 + 1) { for (int c1_0 = c2; c1_0 <= d2; c1_0 += 1) s1(c0, c1_0); } else if (c0 >= b1 + 1) { for (int c1_0 = c2; c1_0 <= d2; c1_0 += 1) s1(c0, c1_0); } else { for (int c1_0 = c1; c1_0 <= min(c2 - 1, d1); c1_0 += 1) s0(c0, c1_0); for (int c1_0 = c2; c1_0 <= min(d2, c1 - 1); c1_0 += 1) s1(c0, c1_0); for (int c1_0 = max(c2, c1); c1_0 <= min(d1, d2); c1_0 += 1) { s0(c0, c1_0); s1(c0, c1_0); } for (int c1_0 = max(d2 + 1, c1); c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); for (int c1_0 = max(max(d1 + 1, c1), c2); c1_0 <= d2; c1_0 += 1) s1(c0, c1_0); } for (int c0 = max(max(a1, a2), b2 + 1); c0 <= b1; c0 += 1) for (int c1_0 = c1; c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); } cloog-0.18.2/isl/test_inputs/codegen/omega/fc1-2.c0000664000175000017500000000072512254313240016450 00000000000000{ for (int c3 = 1; c3 <= n; c3 += 1) s2(c3); for (int c0 = 0; c0 < n - 1; c0 += 1) { for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) s0(c0 + 1, n - c3); for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) for (int c6 = c0 + 2; c6 <= n; c6 += 1) s1(c0 + 1, n - c3, c6); } for (int c0 = n - 1; c0 < 2 * n - 1; c0 += 1) { if (c0 >= n) for (int c2 = -n + c0 + 2; c2 <= n; c2 += 1) s3(c2, -n + c0 + 1); s4(-n + c0 + 2); } } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur01-0.c0000664000175000017500000000101612254313240017245 00000000000000for (int c0 = 0; c0 <= 15; c0 += 1) for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(c0 + 1, 15); c1 += 1) for (int c2 = max(max(max(67 * c0 - (c0 + 1) / 3, 1), 67 * c1 - (c1 + 2) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(100 * c0 + 99, 1000), 133 * c0 - 67 * c1 + floord(c0 + c1 - 1, 3) + 133); c2 += 1) for (int c3 = max(max(100 * c1 + (c2 + 1) / 2, 200 * c0 - c2), c2); c3 <= min(min(200 * c0 - c2 + 199, 100 * c1 + (c2 + 1) / 2 + 99), 2 * c2 + 1); c3 += 1) s0(c0, c1, c2, c3); cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-1.c0000664000175000017500000000024212254313240017404 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) { if (n >= 2) s0(c0); for (int c1 = 1; c1 <= 100; c1 += 1) { if (n >= 2) s1(c0, c1); s2(c0, c1); } } cloog-0.18.2/isl/test_inputs/codegen/omega/dagstuhl1-1.in0000664000175000017500000000020312254313240020045 00000000000000{s0[p,i,j] -> [p,i,j] : 0 <= i,j <= 9 && p = i+10j} { : } { [p,i,j] -> separate[o0] : o0 >= 2; [p,i,j] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-5.c0000664000175000017500000000027312254313240017414 00000000000000for (int c0 = 4; c0 <= 100; c0 += 4) { for (int c1 = 1; c1 <= 100; c1 += 1) s0(c0, c1); if (c0 <= 96 && c0 >= 8) for (int c1 = 10; c1 <= 100; c1 += 1) s1(c0 + 2, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-check0-0.c0000664000175000017500000000111412254313240017774 00000000000000{ for (int c1 = 0; c1 < N; c1 += 1) s0(1, c1, 1, 0, 0); for (int c1 = 0; c1 <= floord(T - 1, 500); c1 += 1) for (int c2 = 1000 * c1; c2 <= min(N + 2 * T - 3, N + 1000 * c1 + 997); c2 += 1) { for (int c3 = max(-((N + c2) % 2) - N - 1000 * c1 + c2 + 2, 0); c3 <= min(min(998, 2 * T - 1000 * c1 - 2), -1000 * c1 + c2 - 2); c3 += 2) { s1(2, 1000 * c1 + c3, 0, -1000 * c1 + c2 - c3, 1); s2(2, 1000 * c1 + c3 + 1, 0, -1000 * c1 + c2 - c3 - 1, 1); } if (2 * T >= c2 + 1 && 1000 * c1 + 999 >= c2) s1(2, -(c2 % 2) + c2, 0, c2 % 2, 1); } } cloog-0.18.2/isl/test_inputs/codegen/omega/stride2-0.in0000664000175000017500000000035612254313240017535 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(In_1)/32]: 32e0 = In_1 and In_2 <= 31 + In_1 and In_1 >= 0 and In_2 >= In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-0.in0000664000175000017500000000023312254313240020727 00000000000000{ s0[i, j] -> [i + j, i + 2j] : i >= 0 and i <= 4 and j >= 0 and j <= 6 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/fc1-0.in0000664000175000017500000000044312254313240016627 00000000000000[n] -> { s0[i, j] -> [-1 + i, 0, n - i, n - j] : i >= 1 and j >= 1 + i and j <= n; s1[i, j, k] -> [-1 + i, 1, n - i, n - j] : j >= 1 + i and k >= 1 + i and i >= 1 and j <= n and k <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter4-0.c0000664000175000017500000000014212254313240017015 00000000000000for (int c0 = 2; c0 <= 9; c0 += 1) for (int c1 = c0 + 1; c1 <= 2 * c0; c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/m9-1.c0000664000175000017500000000015612254313240016321 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c1, c0); s1(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-mp-i_ts-m_b-0.c0000664000175000017500000000550012254313240020745 00000000000000{ for (int c1 = -1; c1 < (T >= 1 ? T : 0); c1 += 1) for (int c2 = 0; c2 < N; c2 += 1) if (c2 == 0 && T >= c1 + 1 && c1 >= 0) { s0(1, c1, 0, 0, 0); } else if (c2 + 1 == N && T >= c1 + 1 && c1 >= 0) { s0(1, c1, N - 1, 0, 0); } else if (c1 == -1 && c2 >= 0 && N >= c2 + 1) s0(1, -1, c2, 0, 0); for (int c1 = 0; c1 <= floord(T - 1, 500); c1 += 1) { for (int c3 = -((c1 + 9) / 8) + 2; c3 <= floord(N - 500 * c1 - 3, 4000) + 1; c3 += 1) for (int c4 = max(1000 * c1 + 4000 * c3 - 3999, 500 * c1 + 1); c4 <= min(min(2 * N - 4000 * c3 + 3995, N + T - 3), 1000 * c1 + 4000 * c3 - 3000); c4 += 1) for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(-500 * c1 + c4 - 1, -500 * c1 - 2000 * c3 + (c4 + 1) / 2 + 1999), T - 500 * c1 - 1); c5 += 1) s1(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1); for (int c3 = max(-((T + 4000) / 4000) + 2, -((c1 + 9) / 8) + 2); c3 <= floord(N - 500 * c1 - 3, 4000) + 1; c3 += 1) for (int c4 = max(1000 * c1 + 4000 * c3 - 3999, -4000 * c3 + 4000); c4 <= min(min(2 * N - 4000 * c3 + 3995, 2 * T + 4000 * c3 - 4000), 1000 * c1 + 4000 * c3 - 3000); c4 += 1) s2(2, -2000 * c3 + (c4 + 1) / 2 + 1999, 1, 2000 * c3 + c4 - (c4 + 1) / 2 - 1999, 1); for (int c3 = -((c1 + 7) / 8) + 1; c3 <= min(floord(N + T - 1000 * c1 - 1004, 4000) + 1, floord(N - 500 * c1 - 504, 4000) + 1); c3 += 1) for (int c4 = max(1000 * c1 + 4000 * c3 - 2999, 500 * c1 + 1); c4 <= min(min(N + T - 3, N + 500 * c1 + 497), 1000 * c1 + 4000 * c3); c4 += 1) for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(-500 * c1 + c4 - 1, 499), T - 500 * c1 - 1); c5 += 1) s3(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1); for (int c3 = max(-((T + 4000) / 4000) + 1, -((c1 + 9) / 8) + 1); c3 <= floord(N - 500 * c1 - 3, 4000); c3 += 1) for (int c4 = max(1000 * c1 + 4000 * c3 + 1, -4000 * c3); c4 <= min(min(2 * N - 4000 * c3 - 5, 2 * T + 4000 * c3), 1000 * c1 + 4000 * c3 + 1000); c4 += 1) s4(2, -2000 * c3 + (c4 + 1) / 2 - 1, 1, 2000 * c3 + c4 - (c4 + 1) / 2 + 1, 1); for (int c3 = -((c1 + 8) / 8) + 1; c3 <= min(floord(N + T - 1000 * c1 - 4, 4000), floord(N - 500 * c1 + 496, 4000)); c3 += 1) for (int c4 = max(-4000 * c3 + 2, 1000 * c1 + 4000 * c3 + 1); c4 <= min(min(min(N + T - 3, N + 500 * c1 + 497), 2 * T + 4000 * c3 - 2), 1000 * c1 + 4000 * c3 + 998); c4 += 1) for (int c5 = max(-500 * c1 - 2000 * c3 + (c4 + 1) / 2, -N - 500 * c1 + c4 + 2); c5 <= min(min(499, -500 * c1 + c4 - 1), T - 500 * c1 - 1); c5 += 1) s5(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1); } if (T >= 1) for (int c3 = -((T + 3998) / 4000) + 1; c3 <= floord(N - T - 2, 4000) + 1; c3 += 1) for (int c4 = max(T, 2 * T + 4000 * c3 - 4001); c4 < min(N + T - 2, 2 * T + 4000 * c3 - 1); c4 += 1) s6(2, T - 1, 1, -T + c4 + 1, 1); } cloog-0.18.2/isl/test_inputs/codegen/omega/lu-3.in0000664000175000017500000000106112254313240016576 00000000000000[n] -> { s1[k, i, j] -> [t1, t2, j, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and i >= 1 + k and j >= 1 + k and k >= 1 and i <= n and j <= n); s0[k, i] -> [t1, t2, k, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and k >= 1 and i >= 1 + k and i <= n) } { : } [n] -> { [t1, t2, i2, i3, i4] -> separate[o0] : o0 >= 2; [t1, t2, i2, i3, i4] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-4.in0000664000175000017500000000103312254313240017175 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 1; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride2-0.c0000664000175000017500000000015012254313240017341 00000000000000for (int c0 = 0; c0 <= n; c0 += 32) for (int c1 = c0; c1 <= min(c0 + 31, n); c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/dagstuhl1-0.c0000664000175000017500000000007412254313240017666 00000000000000for (int c0 = 0; c0 <= 99; c0 += 1) s0(c0 % 10, c0 / 10); cloog-0.18.2/isl/test_inputs/codegen/omega/stride6-0.in0000664000175000017500000000033212254313240017533 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(In_2)/2]: 2e0 = In_2 and In_1 >= 1 and In_2 >= In_1 and In_2 <= 400 and In_1 <= 101) } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride6-2.in0000664000175000017500000000037212254313240017541 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(In_1)/2], e1 = [(In_2)/2]: 2e0 = In_1 and 2e1 = In_2 and In_1 >= 2 and In_2 >= In_1 and In_2 <= 400 and In_1 <= 100) } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/olda-0.in0000664000175000017500000000050412254313240017073 00000000000000[np, morb] -> { s0[mp, mq, mi] -> [mi, mq, mp, 0] : mq >= 1 and mq <= mp and mp <= np and mi >= 1 and mi <= morb; s1[mp, mq, mi] -> [mi, mp, mq, 1] : mq >= 1 and mq <= mp and mp <= np and mi >= 1 and mi <= morb } { : } [np, morb] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/m7-0.c0000664000175000017500000000020512254313240016311 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c1, c0); if (c0 % 2 == 0) s1(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-3.in0000664000175000017500000000037212254313240020472 00000000000000[m, n] -> { s0[In_1] -> [In_1] : exists (e0 = [(m)/3], e1 = [(m)/4]: 4e1 <= m and 3e0 <= m and 4e1 >= -3 + m and 3e0 >= -2 + m and In_1 <= n and 4e1 <= In_1 - 3e0) } { : } [m, n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-2.c0000664000175000017500000000114612254313240017015 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) if (c0 >= 61) { for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else if (c0 <= 4) { for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur03-0.c0000664000175000017500000000163612254313240017257 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) for (int c1 = max(2 * c0 - 3, 0); c1 <= min(3, c0 + c0 / 2 + 1); c1 += 1) for (int c2 = c0; c2 <= min(min(2 * c0 - c1 + 1, 3 * c1 + 2), 3); c2 += 1) for (int c3 = max(max(max(c2 + floord(3 * c1 - c2 - 1, 6), c1 - (-c1 + 3) / 3), c0 - (-c0 + 3) / 3), 0); c3 <= min(c0 + 1, 3); c3 += 1) for (int c4 = max(max(max(max(250 * c3 + 1, 333 * c2 + (c2 + 1) / 3), 333 * c1 + c1 / 3), -200 * c1 + 400 * c3 - 199), 667 * c0 - 333 * c1 - (c0 + c1 + 3) / 3 - 332); c4 <= min(min(min(min(1000, -200 * c1 + 400 * c3 + 400), 500 * c0 + 499), 333 * c2 - (-c2 + 3) / 3 + 333), 333 * c3 - (-c3 + 3) / 3 + 334); c4 += 1) for (int c5 = max(max(max(c4, 1000 * c3 - 2 * c4 + 2), 500 * c1 + (c4 + 1) / 2), 1000 * c0 - c4); c5 <= min(min(min(1000 * c0 - c4 + 999, 500 * c1 + (c4 + 1) / 2 + 499), 1000 * c3 - 2 * c4 + 1001), 2 * c4 + 1); c5 += 1) s0(c0, c1, c2, c3, c4, c5); cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-0.c0000664000175000017500000000051012254313240017401 00000000000000if (m <= 1) { for (int c0 = 1; c0 <= n; c0 += 1) for (int c1 = 1; c1 <= n; c1 += 1) s2(c0, c1); } else if (n >= m + 1) { for (int c0 = 1; c0 <= n; c0 += 1) for (int c1 = 1; c1 <= n; c1 += 1) s0(c0, c1); } else for (int c0 = 1; c0 <= n; c0 += 1) for (int c1 = 1; c1 <= n; c1 += 1) s1(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/code_gen-0.in0000664000175000017500000000037212254313240017722 00000000000000{ s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_1 <= 6 and In_2 >= 0 and In_2 <= 4; s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_2 >= -1 + In_1 and In_2 <= 7 } { : } { [i0, i1] -> atomic[o0] : o0 <= 1; [i0, i1] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/ge-1.c0000664000175000017500000000027412254313240016370 00000000000000for (int c0 = 2; c0 <= n; c0 += 1) for (int c1 = 1; c1 <= n; c1 += 1) { for (int c3 = 1; c3 < min(c0, c1); c3 += 1) s1(c3, c0, c1); if (c0 >= c1 + 1) s0(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/m10-0.in0000664000175000017500000000034012254313240016547 00000000000000{ s0[i, j] -> [4j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [2j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-4.c0000664000175000017500000000103212254313240017010 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) if (c0 >= 61) { for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-1.in0000664000175000017500000000023412254313240020731 00000000000000{ s0[i, j] -> [2i + j, i + 2j] : i >= 0 and i <= 4 and j >= 0 and j <= 6 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m7-1.c0000664000175000017500000000031512254313240016314 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) if (c0 % 2 == 0) { for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c1, c0); s1(c1, c0); } } else for (int c1 = 1; c1 <= 9; c1 += 1) s0(c1, c0); cloog-0.18.2/isl/test_inputs/codegen/omega/fc1-2.in0000664000175000017500000000071112254313240016627 00000000000000[n] -> { s1[i, j, k] -> [-1 + i, 1, n - i, n - j] : j >= 1 + i and k >= 1 + i and i >= 1 and j <= n and k <= n; s3[i, j] -> [-1 + n + j, 0, i, j] : j >= 1 and j <= -1 + i and i <= n; s4[i] -> [-2 + n + i, 1, 0, 0] : i >= 1 and i <= n; s0[i, j] -> [-1 + i, 0, n - i, n - j] : i >= 1 and j >= 1 + i and j <= n; s2[i] -> [0, 0, 0, i] : i >= 1 and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 1; [i0, i1, i2, i3] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride4-0.c0000664000175000017500000000005712254313240017351 00000000000000for (int c0 = 18; c0 <= 98; c0 += 5) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-0.in0000664000175000017500000000036312254313240017231 00000000000000[n, b] -> { s0[i, j, k] -> [1 - i + j, -j + k, k] : i >= 1 and j >= i and j <= n and k >= 1 and k <= n and k <= -1 + b + i and k >= 1 - b + j } { : } [n, b] -> { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-5.c0000664000175000017500000000144512254313240017022 00000000000000{ for (int c0 = 1; c0 <= 4; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); for (int c0 = 5; c0 <= 60; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } for (int c0 = 61; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur04-0.c0000664000175000017500000000240512254313240017253 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) for (int c1 = max(2 * c0 - 3, c0 / 2); c1 <= min(c0 + 1, 3); c1 += 1) for (int c2 = c0; c2 <= min(min(3, 2 * c0 - c1 + 1), 3 * c1 + 2); c2 += 1) for (int c3 = max(max(max(c2 - (c2 + 2) / 3, c2 + floord(3 * c1 - c2 - 1, 6)), c1 - (-c1 + 3) / 3), c0 - (-c2 + 3) / 3); c3 <= min(c0 + c0 / 2 + 1, 3); c3 += 1) for (int c5 = max(max(max(max(c1 - (c1 - 2 * c3 + 5) / 5, 0), c3 - (c3 + 3) / 3), 2 * c3 - 4), c2 - (c2 + 3) / 3); c5 <= min(min(c1 + 1, c3), -c2 + 2 * c3 - (c2 + 3) / 3 + 2); c5 += 1) for (int c6 = max(max(max(max(max(1000 * c0 - 500 * c5 - 501, -200 * c1 + 400 * c3 - 199), 333 * c1 + c1 / 3), 250 * c3 + 1), 667 * c0 - 333 * c1 - (c0 + c1 + 3) / 3 - 332), 333 * c2 + (c2 + 1) / 3); c6 <= min(min(min(min(min(min(-200 * c1 + 400 * c3 + 400, 500 * c0 + 499), 333 * c2 - (-c2 + 3) / 3 + 333), 333 * c3 - (-c3 + 3) / 3 + 334), 500 * c5 + 501), 1000), 1000 * c0 - 500 * c5 + 997); c6 += 1) for (int c7 = max(max(max(max(c6, 500 * c5 + 2), 1000 * c3 - 2 * c6 + 2), 500 * c1 + (c6 + 1) / 2), 1000 * c0 - c6); c7 <= min(min(min(min(500 * c5 + 501, 2 * c6 + 1), 1000 * c0 - c6 + 999), 500 * c1 + (c6 + 1) / 2 + 499), 1000 * c3 - 2 * c6 + 1001); c7 += 1) s0(c0, c1, c2, c3, c2 / 3, c5, c6, c7); cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-1.c0000664000175000017500000000102012254313240017003 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) if (c0 >= 61) { for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else if (c0 <= 4) { for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/m4-1.in0000664000175000017500000000033612254313240016500 00000000000000{ s0[i, j] -> [j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-1.c0000664000175000017500000000027612254313240020553 00000000000000for (int c0 = 0; c0 <= 14; c0 += 1) for (int c1 = max(2 * c0 - 12, -c0 + 3 * floord(c0 - 1, 2) + 3); c1 <= min(2 * c0, c0 / 2 + 9); c1 += 3) s0((2 * c0 - c1) / 3, (-c0 + 2 * c1) / 3); cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-0.in0000664000175000017500000000064612254313240017577 00000000000000[n, m] -> { s2[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= n and In_2 >= 1 and In_2 <= n and m <= 1; s0[In_1, In_2] -> [In_1, In_2] : m >= 2 and m <= -1 + n and In_1 >= 1 and In_1 <= n and In_2 >= 1 and In_2 <= n; s1[In_1, In_2] -> [In_1, In_2] : In_1 <= n and In_2 <= n and m >= n and In_1 >= 1 and In_2 >= 1 and m >= 2 } { : } [n, m] -> { [i0, i1] -> atomic[o0] : o0 <= 1; [i0, i1] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-1.c0000664000175000017500000000013112254313240016733 00000000000000for (int c0 = 1; c0 <= n; c0 += 4) for (int c1 = c0; c1 <= n; c1 += 8) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/gist-4.in0000664000175000017500000000043412254313240017130 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-1 + In_1)/6], e1 = [(-2 - In_1 + 3In_2)/12]: 6e0 = -1 + In_1 and 12e1 = -2 - In_1 + 3In_2 and In_1 >= 1 and In_2 >= In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/hpf-0.in0000664000175000017500000000055012254313240016732 00000000000000[P1, P2] -> { s0[In_1, In_1, In_3, In_3] -> [In_1, In_1, In_3, In_3] : exists (e0 = [(-2P2 - 2In_1 + In_3)/3]: P1 = P2 and 3e0 = -2P2 - 2In_1 + In_3 and P2 >= 0 and P2 <= 3 and In_1 <= 4 - P2 and In_1 >= 0 and In_1 <= 2 and In_3 >= 0 and In_3 <= 3) } { : } [P2, P1] -> { [i0, i1, i2, i3] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride6-0.c0000664000175000017500000000016312254313240017351 00000000000000for (int c0 = 1; c0 <= 101; c0 += 1) for (int c1 = -((c0 + 1) % 2) + c0 + 1; c1 <= 400; c1 += 2) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/stride6-1.c0000664000175000017500000000013512254313240017351 00000000000000for (int c0 = 2; c0 <= 100; c0 += 2) for (int c1 = c0; c1 <= 400; c1 += 2) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/iter6-1.in0000664000175000017500000000030212254313240017202 00000000000000{ s0[In_1, In_2] -> [In_1, o1] : 12In_2 = -170 + 17In_1 and 12o1 = -170 + 17In_1 and In_1 >= 46 and In_1 <= 70 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-4.in0000664000175000017500000000103312254313240017176 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 5 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 1; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-0.c0000664000175000017500000000050212254313240017006 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); if (c0 <= 60 && c0 >= 5) s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-6.in0000664000175000017500000000040012254313240020465 00000000000000[m, n] -> { s0[In_1] -> [In_1] : exists (e0 = [(1 + m)/8], e1 = [(e0)/4]: 8e0 <= m and 8e0 >= -6 + m and 4e1 <= In_1 and In_1 <= n and 32e1 <= 1 + m and 32e1 >= -30 + m) } { : } [m, n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-3.in0000664000175000017500000000103312254313240017174 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 2; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m1-1.in0000664000175000017500000000031012254313240016465 00000000000000{ s0[i, j] -> [i, j, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[5, j] -> [5, j, 1] : j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_spmd-0.in0000664000175000017500000000121012254313240017612 00000000000000[n, lb, ub] -> { s1[k, i, j] -> [k, i, 1, j, 0, 0, 0, 0] : k >= 1 and j >= k and j <= n and j <= ub and i >= k and i <= n and j >= lb; s3[k, i, lb, k, i] -> [k, i, 1, lb, -1, k, i, 0] : k >= 1 and k <= -1 + lb and lb <= n and ub >= lb and i >= k and i <= n; s0[k, i] -> [k, i, 0, 0, 0, 0, 0, 0] : k >= 1 and k >= lb and i >= 1 + k and i <= n and k <= ub; s2[k, i] -> [k, i, 0, 0, 1, 0, 0, 0] : k >= 1 and k >= lb and k <= ub and ub <= -1 + n and i >= 1 + k and i <= n } [lb, n, ub] -> { : ub <= n and lb >= 1 } [n, lb, ub] -> { [i0, i1, i2, i3, i4, i5, i6, i7] -> atomic[o0] : o0 <= 7; [i0, i1, i2, i3, i4, i5, i6, i7] -> separate[o0] : o0 >= 8 } cloog-0.18.2/isl/test_inputs/codegen/omega/fc2-1.c0000664000175000017500000000072512254313240016450 00000000000000{ for (int c3 = 1; c3 <= n; c3 += 1) s2(c3); for (int c0 = 0; c0 < n - 1; c0 += 1) { for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) s0(c0 + 1, n - c3); for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) for (int c6 = c0 + 2; c6 <= n; c6 += 1) s1(c0 + 1, n - c3, c6); } for (int c0 = n - 1; c0 < 2 * n - 1; c0 += 1) { if (c0 >= n) for (int c2 = -n + c0 + 2; c2 <= n; c2 += 1) s3(c2, -n + c0 + 1); s4(-n + c0 + 2); } } cloog-0.18.2/isl/test_inputs/codegen/omega/p.delft2-0.c0000664000175000017500000000122512254313240017407 00000000000000if (P2 <= 3 && P2 >= 0 && P1 <= 3 && P1 >= 0) for (int c0 = P1 - 1; c0 <= 3; c0 += 1) if (P1 + 2 * floord(-P1 + c0 - 1, 2) + 1 == c0) for (int c2 = 0; c2 <= -((P1 + 4) / 4) + 8; c2 += 1) if ((5 * c0 + 2 * c2 + 5) % 9 <= 2) for (int c3 = 0; c3 <= -((P2 + 4) / 4) + 8; c3 += 1) if ((5 * P2 + 2 * c3) % 9 <= 3) if (c0 + 1 == P1 && (5 * P1 + 2 * c2) % 9 <= 2 && P1 >= 1) { s0(P1 - 1, P2, c2, c3, ((5 * P1 + 2 * c2) % 9) + 1, (-4 * P2 + 2 * c3 + 9) % 9); } else if (c2 % 4 == 0 && c0 == 3 && P1 == 0) s0(3, P2, c2, c3, (-c2 + 12) / 4, (-4 * P2 + 2 * c3 + 9) % 9); cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-1.c0000664000175000017500000000007012254313240020277 00000000000000for (int c0 = floord(m, 4); c0 <= n; c0 += 1) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-0.in0000664000175000017500000000103312254313240017172 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 5 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 5; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 4 } cloog-0.18.2/isl/test_inputs/codegen/omega/x-1.c0000664000175000017500000000103512254313240016240 00000000000000for (int c0 = 1; c0 <= 11; c0 += 1) { for (int c1 = max(1, -c0 + 9); c1 <= min(-c0 + 12, c0 - 4); c1 += 1) s0(c1, c0 + c1 - 8); for (int c1 = max(c0 - 3, 1); c1 <= min(-c0 + 8, c0); c1 += 1) s1(c1, c0 - c1 + 1); for (int c1 = max(c0 - 3, -c0 + 9); c1 <= min(-c0 + 12, c0); c1 += 1) { s0(c1, c0 + c1 - 8); s1(c1, c0 - c1 + 1); } for (int c1 = max(c0 - 3, -c0 + 13); c1 <= min(8, c0); c1 += 1) s1(c1, c0 - c1 + 1); for (int c1 = max(c0 + 1, -c0 + 9); c1 <= min(-c0 + 12, 8); c1 += 1) s0(c1, c0 + c1 - 8); } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-2.in0000664000175000017500000000030712254313240020467 00000000000000[m, n] -> { s0[In_1] -> [In_1] : exists (e0 = [(m)/4]: 4e0 <= m and 4e0 >= -3 + m and 4e0 <= In_1 and In_1 <= n) } { : } [m, n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/basics-0.c0000664000175000017500000000023312254313240017233 00000000000000{ for (int c0 = 5; c0 <= 8; c0 += 1) s0(c0); for (int c0 = 10; c0 <= 16; c0 += 2) s0(c0); for (int c0 = 20; c0 <= 25; c0 += 1) s0(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/m3-0.c0000664000175000017500000000016712254313240016314 00000000000000for (int c0 = -9; c0 <= 9; c0 += 1) for (int c1 = max(-c0 + 1, 1); c1 <= min(-c0 + 10, 10); c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/iter2-0.c0000664000175000017500000000013412254313240017014 00000000000000for (int c0 = 1; c0 <= 10; c0 += 1) for (int c1 = 10; c1 <= 100; c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-2.in0000664000175000017500000000103312254313240017174 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 5 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/code_gen-1.c0000664000175000017500000000055512254313240017542 00000000000000for (int c0 = 1; c0 <= 8; c0 += 1) { if (c0 <= 6) for (int c1 = 0; c1 < c0 - 1; c1 += 1) s1(c0, c1); if (c0 >= 2) { for (int c1 = c0 - 1; c1 <= 4; c1 += 1) { s1(c0, c1); s0(c0, c1); } for (int c1 = max(c0 - 1, 5); c1 <= 7; c1 += 1) s0(c0, c1); } if (c0 == 1) for (int c1 = 0; c1 <= 7; c1 += 1) s0(1, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/stride1-0.in0000664000175000017500000000024412254313240017530 00000000000000{ s0[In_1] -> [In_1] : exists (e0 = [(In_1)/3]: 3e0 = In_1 and In_1 >= 3 and In_1 <= 9) } { : } { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/guard1-1.in0000664000175000017500000000025712254313240017345 00000000000000[n, m] -> { s0[n, m] -> [n, m] : exists (e0 = [(-1 - n + m)/2]: 2e0 = -1 - n + m) } { : } [n, m] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m2-0.c0000664000175000017500000000033012254313240016303 00000000000000for (int c0 = 2; c0 <= 9; c0 += 1) if (c0 >= 5) { s1(c0, 1); for (int c1 = 2; c1 <= 9; c1 += 1) { s1(c0, c1); s0(c0, c1); } } else for (int c1 = 2; c1 <= 9; c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/wak2-1.in0000664000175000017500000000037012254313240017022 00000000000000[a2, b2, c2, d2, a1, b1, c1, d1] -> { s0[i, j] -> [i, j, 0] : i >= a1 and i <= b1 and j >= c1 and j <= d1; s1[i, j] -> [i, j, 1] : i >= a2 and i <= b2 and j >= c2 and j <= d2 } { : } [a1, b1, c1, d1] -> { [i0, i1, i2] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-0.in0000664000175000017500000000027212254313240020466 00000000000000[m, n] -> { s0[In_1] -> [In_1] : exists (e0 = [(In_1)/4]: 4e0 = In_1 and 3In_1 >= m and 3In_1 <= n) } { : } [m, n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m10-1.in0000664000175000017500000000034012254313240016550 00000000000000{ s0[i, j] -> [4j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [2j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak3-1.c0000664000175000017500000000073712254313240016646 00000000000000{ for (int c0 = a; c0 <= min(b, a + 9); c0 += 1) s0(c0); for (int c0 = a + 10; c0 <= min(b, a + 19); c0 += 1) { s0(c0); s1(c0); } for (int c0 = max(a + 10, b + 1); c0 <= min(b + 10, a + 19); c0 += 1) s1(c0); for (int c0 = a + 20; c0 <= b; c0 += 1) { s0(c0); s1(c0); s2(c0); } for (int c0 = max(a + 20, b + 1); c0 <= b + 10; c0 += 1) { s1(c0); s2(c0); } for (int c0 = max(a + 20, b + 11); c0 <= b + 20; c0 += 1) s2(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-check0-0.in0000664000175000017500000000116712254313240020170 00000000000000[T, N] -> { s1[2, t, 0, i, 1] -> [2, tb, t + i, t - 1000tb, 1] : exists (e0 = [(t - 1000tb)/2]: 2e0 = t - 1000tb and 1000tb <= t and 1000tb >= -999 + t and i >= 0 and i <= -1 + N and t >= 0 and t <= -2 + 2T); s0[1, In_2, 1, 0, 0] -> [1, In_2, 1, 0, 0] : In_2 >= 0 and In_2 <= -1 + N; s2[2, t, 0, i, 1] -> [2, tb, t + i, t - 1000tb, 1] : exists (e0 = [(-1 + t - 1000tb)/2]: 2e0 = -1 + t - 1000tb and 1000tb <= t and 1000tb >= -999 + t and i >= 1 and i <= -2 + N and t >= 1 and t <= -1 + 2T) } [T, N] -> { : T >= 0 and N >= 4 } [N] -> { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-2.c0000664000175000017500000000006712254313240020552 00000000000000for (int c0 = -3; c0 <= 96; c0 += 1) s0(c0, c0 + 4); cloog-0.18.2/isl/test_inputs/codegen/omega/fc1-1.in0000664000175000017500000000071112254313240016626 00000000000000[n] -> { s1[i, j, k] -> [-1 + i, 1, n - i, n - j] : j >= 1 + i and k >= 1 + i and i >= 1 and j <= n and k <= n; s3[i, j] -> [-1 + n + j, 0, i, j] : j >= 1 and j <= -1 + i and i <= n; s4[i] -> [-2 + n + i, 1, 0, 0] : i >= 1 and i <= n; s0[i, j] -> [-1 + i, 0, n - i, n - j] : i >= 1 and j >= 1 + i and j <= n; s2[i] -> [0, 0, 0, i] : i >= 1 and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak3-0.in0000664000175000017500000000035312254313240017023 00000000000000[a, b] -> { s2[i] -> [i, 2] : i >= 20 + a and i <= 20 + b; s0[i] -> [i, 0] : i >= a and i <= b; s1[i] -> [i, 1] : i >= 10 + a and i <= 10 + b } { : } [a, b] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-check-sblock-0.c0000664000175000017500000000100312254313240021164 00000000000000{ for (int c1 = 0; c1 <= 1; c1 += 1) if (c1 == 1) { s0(1, 1, 1, 0, 0); s0(1, 1, 1, N - 1, 0); } else for (int c3 = 0; c3 < N; c3 += 1) s0(1, 0, 1, c3, 0); for (int c1 = 0; c1 <= floord(T - 1, 1000); c1 += 1) for (int c2 = 1000 * c1 + 1; c2 <= min(N + T - 3, N + 1000 * c1 + 997); c2 += 1) for (int c3 = max(-N - 1000 * c1 + c2 + 2, 0); c3 <= min(min(999, T - 1000 * c1 - 1), -1000 * c1 + c2 - 1); c3 += 1) s1(2, 1000 * c1 + c3, 1, -1000 * c1 + c2 - c3, 1); } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-4.in0000664000175000017500000000027512254313240020741 00000000000000[n] -> { s0[i] -> [i] : exists (e0 = [(-1 - n + i)/18]: 18e0 = -1 - n + i and i <= 16 + n and i >= 1 + n) } { : } [n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-3.in0000664000175000017500000000053512254313240017577 00000000000000[n] -> { s0[In_1] -> [In_1,0] : In_1 >= 1 and In_1 <= 100 and n >= 2; s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and n >= 2; s2[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 } { : } [n] -> { [i0,i1] -> separate[o0] : o0 >= 0; [i0,i1] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter3-0.c0000664000175000017500000000013512254313240017016 00000000000000for (int c0 = 2; c0 <= 8; c0 += 1) for (int c1 = c0 + 1; c1 <= 9; c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/ge-1.in0000664000175000017500000000041112254313240016545 00000000000000[n] -> { s0[k, i] -> [i, k, 1, 0] : k >= 1 and i >= 1 + k and i <= n; s1[k, i, j] -> [i, j, 0, k] : i >= 1 + k and j >= 1 + k and k >= 1 and i <= n and j <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 1; [i0, i1, i2, i3] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter8-0.in0000664000175000017500000000075112254313240017213 00000000000000[exprVar2, exprVar3, exprVar1] -> { s0[In_1] -> [In_1] : exists (e0 = [(-1 - exprVar2 + In_1)/8]: exprVar3 = 0 and 8e0 = -1 - exprVar2 + In_1 and exprVar1 >= 1 and In_1 >= 1 + exprVar1 and In_1 <= 16 and In_1 >= 1 + exprVar2) } [exprVar3, exprVar2, exprVar1] -> { : exists (e0: exprVar3 = 0 and 8e0 >= -15 + exprVar2 and exprVar2 <= 15 and exprVar1 >= 1 and 8e0 <= exprVar2 - exprVar1) } [exprVar2, exprVar3, exprVar1] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_ijk-0.c0000664000175000017500000000027412254313240017251 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) for (int c1 = 2; c1 <= n; c1 += 1) { for (int c3 = 1; c3 < min(c0, c1); c3 += 1) s1(c3, c1, c0); if (c1 >= c0 + 1) s0(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/iter2-0.in0000664000175000017500000000025612254313240017205 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 10 and In_2 >= 10 and In_2 <= 100 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride7-1.in0000664000175000017500000000034012254313240017534 00000000000000{ s0[i, j] -> [4j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 0; [i0, i1, i2] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter6-1.c0000664000175000017500000000010612254313240017020 00000000000000for (int c0 = 46; c0 <= 70; c0 += 12) s0(c0, (17 * c0 - 170) / 12); cloog-0.18.2/isl/test_inputs/codegen/omega/iter1-0.in0000664000175000017500000000017312254313240017202 00000000000000{ s0[In_1] -> [In_1] : In_1 >= 2 and In_1 <= 9 } { : } { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-4.c0000664000175000017500000000013112254313240016736 00000000000000for (int c0 = 1; c0 <= n; c0 += 6) for (int c1 = c0; c1 <= n; c1 += 4) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/lu-0.in0000664000175000017500000000106112254313240016573 00000000000000[n] -> { s1[k, i, j] -> [t1, t2, j, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and i >= 1 + k and j >= 1 + k and k >= 1 and i <= n and j <= n); s0[k, i] -> [t1, t2, k, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and k >= 1 and i >= 1 + k and i <= n) } { : } [n] -> { [t1, t2, i2, i3, i4] -> separate[o0] : o0 >= 5; [t1, t2, i2, i3, i4] -> atomic[o0] : o0 <= 4 } cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-3.c0000664000175000017500000000031712254313240017047 00000000000000for (int c0 = 1; c0 <= min(2 * b - 1, n); c0 += 1) for (int c1 = -b + 1; c1 <= b - c0; c1 += 1) for (int c2 = max(c0 + c1, 1); c2 <= min(n + c1, n); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.2/isl/test_inputs/codegen/omega/p6-1.in0000664000175000017500000000027212254313240016504 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_2 >= 1 - In_1 and In_2 >= 1 and In_2 <= 10 - In_1 and In_2 <= 10 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m7-1.in0000664000175000017500000000040112254313240016474 00000000000000{ s0[i, j] -> [j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [j, i, 1] : exists (e0 = [(j)/2]: 2e0 = j and i >= 1 and i <= 9 and j >= 2 and j <= 8) } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-5.c0000664000175000017500000000013212254313240016740 00000000000000for (int c0 = 1; c0 <= n; c0 += 12) for (int c1 = c0; c1 <= n; c1 += 8) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/ge-0.in0000664000175000017500000000041112254313240016544 00000000000000[n] -> { s0[k, i] -> [i, k, 1, 0] : k >= 1 and i >= 1 + k and i <= n; s1[k, i, j] -> [i, j, 0, k] : i >= 1 + k and j >= 1 + k and k >= 1 and i <= n and j <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/m8-1.in0000664000175000017500000000044412254313240016504 00000000000000{ s0[i, j] -> [j, i, 0] : exists (e0 = [(j)/4]: 4e0 = j and i >= 1 and i <= 9 and j >= 4 and j <= 8); s1[i, j] -> [j, i, 1] : exists (e0 = [(j)/2]: 2e0 = j and i >= 1 and i <= 9 and j >= 2 and j <= 8) } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride7-0.in0000664000175000017500000000033712254313240017541 00000000000000{ s0[i, j] -> [4j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-5.in0000664000175000017500000000043612254313240017133 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-1 + In_1)/12], e1 = [(-2 - In_1 + 3In_2)/24]: 12e0 = -1 + In_1 and 24e1 = -2 - In_1 + 3In_2 and In_1 >= 1 and In_2 >= In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m2-1.in0000664000175000017500000000040112254313240016467 00000000000000{ s1[In_1, In_2] -> [In_1, In_2] : In_1 >= 5 and In_1 <= 9 and In_2 >= 1 and In_2 <= 9; s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_1 <= 9 and In_2 >= 2 and In_2 <= 9 } { : } { [i0, i1] -> atomic[o0] : o0 <= -1; [i0, i1] -> separate[o0] : o0 >= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride3-0.c0000664000175000017500000000015012254313240017342 00000000000000for (int c0 = 3; c0 <= n; c0 += 32) for (int c1 = c0; c1 <= min(c0 + 31, n); c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/stride1-0.c0000664000175000017500000000005512254313240017344 00000000000000for (int c0 = 3; c0 <= 9; c0 += 3) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-4.in0000664000175000017500000000054512254313240017601 00000000000000{ s1[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-2 + In_1)/4]: 4e0 = -2 + In_1 and In_1 >= 10 and In_1 <= 98 and In_2 >= 10 and In_2 <= 100); s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(In_1)/4]: 4e0 = In_1 and In_1 >= 4 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100) } { : } { [i0, i1] -> atomic[o0] : o0 <= 1; [i0, i1] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/basics-1.c0000664000175000017500000000016712254313240017242 00000000000000for (int c0 = -9; c0 <= 9; c0 += 1) for (int c1 = max(-c0 + 1, 1); c1 <= min(-c0 + 10, 10); c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-1.in0000664000175000017500000000022512254313240020465 00000000000000[m, n] -> { s0[In_1] -> [In_1] : 4In_1 >= -3 + m and In_1 <= n } { : } [m, n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-3.c0000664000175000017500000000011712254313240020303 00000000000000for (int c0 = 3 * floord(m, 3) + 4 * floord(m, 4); c0 <= n; c0 += 1) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-5.c0000664000175000017500000000105412254313240017015 00000000000000{ for (int c0 = 1; c0 <= 60; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } for (int c0 = 61; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/lu-3.c0000664000175000017500000000112512254313240016413 00000000000000for (int c0 = 1; c0 < n; c0 += 64) for (int c1 = c0 - 1; c1 <= n; c1 += 64) { for (int c2 = c0; c2 <= min(n, c0 + 63); c2 += 1) { for (int c3 = c0; c3 <= min(c1 + 62, c2 - 1); c3 += 1) for (int c4 = max(c3 + 1, c1); c4 <= min(c1 + 63, n); c4 += 1) s1(c3, c4, c2); for (int c4 = max(c2 + 1, c1); c4 <= min(n, c1 + 63); c4 += 1) s0(c2, c4); } for (int c2 = c0 + 64; c2 <= n; c2 += 1) for (int c3 = c0; c3 <= min(c0 + 63, c1 + 62); c3 += 1) for (int c4 = max(c3 + 1, c1); c4 <= min(c1 + 63, n); c4 += 1) s1(c3, c4, c2); } cloog-0.18.2/isl/test_inputs/codegen/omega/wak2-0.in0000664000175000017500000000037012254313240017021 00000000000000[a2, b2, c2, d2, a1, b1, c1, d1] -> { s0[i, j] -> [i, j, 0] : i >= a1 and i <= b1 and j >= c1 and j <= d1; s1[i, j] -> [i, j, 1] : i >= a2 and i <= b2 and j >= c2 and j <= d2 } { : } [a1, b1, c1, d1] -> { [i0, i1, i2] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/fc1-1.c0000664000175000017500000000072512254313240016447 00000000000000{ for (int c3 = 1; c3 <= n; c3 += 1) s2(c3); for (int c0 = 0; c0 < n - 1; c0 += 1) { for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) s0(c0 + 1, n - c3); for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) for (int c6 = c0 + 2; c6 <= n; c6 += 1) s1(c0 + 1, n - c3, c6); } for (int c0 = n - 1; c0 < 2 * n - 1; c0 += 1) { if (c0 >= n) for (int c2 = -n + c0 + 2; c2 <= n; c2 += 1) s3(c2, -n + c0 + 1); s4(-n + c0 + 2); } } cloog-0.18.2/isl/test_inputs/codegen/omega/m12-0.in0000664000175000017500000000033212254313240016552 00000000000000[m, n] -> { s0[1, In_2, In_3, 0] -> [1, In_2, In_3, 0] : In_3 >= 1 and In_3 <= m and In_2 >= 1 and In_2 <= n } { : } [m, n] -> { [i0, i1, i2, i3] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-0.in0000664000175000017500000000043412254313240017124 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-1 + In_1)/4], e1 = [(-3 - In_1 + 4In_2)/12]: 4e0 = -1 + In_1 and 12e1 = -3 - In_1 + 4In_2 and In_1 >= 1 and In_2 >= In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter7-0.c0000664000175000017500000000010112254313240017013 00000000000000for (int c0 = 1; c0 <= 3; c0 += 2) s0(c0, (-3 * c0 + 15) / 2); cloog-0.18.2/isl/test_inputs/codegen/omega/m2-1.c0000664000175000017500000000035712254313240016315 00000000000000{ for (int c0 = 2; c0 <= 4; c0 += 1) for (int c1 = 2; c1 <= 9; c1 += 1) s0(c0, c1); for (int c0 = 5; c0 <= 9; c0 += 1) { s1(c0, 1); for (int c1 = 2; c1 <= 9; c1 += 1) { s1(c0, c1); s0(c0, c1); } } } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-5.c0000664000175000017500000000007512254313240020310 00000000000000for (int c0 = 4 * floord(m, 32); c0 <= n; c0 += 1) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/m8-0.c0000664000175000017500000000020512254313240016312 00000000000000for (int c0 = 2; c0 <= 8; c0 += 2) for (int c1 = 1; c1 <= 9; c1 += 1) { if (c0 % 4 == 0) s0(c1, c0); s1(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/m12-0.c0000664000175000017500000000013612254313240016370 00000000000000for (int c1 = 1; c1 <= n; c1 += 1) for (int c2 = 1; c2 <= m; c2 += 1) s0(1, c1, c2, 0); cloog-0.18.2/isl/test_inputs/codegen/omega/basics-0.in0000664000175000017500000000034412254313240017422 00000000000000{ s0[In_1] -> [In_1] : (In_1 >= 5 and In_1 <= 8) or (exists (e0 = [(In_1)/2]: 2e0 = In_1 and In_1 >= 10 and In_1 <= 16)) or (In_1 >= 20 and In_1 <= 25) } { : } { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/x-0.c0000664000175000017500000000103512254313240016237 00000000000000for (int c0 = 1; c0 <= 11; c0 += 1) { for (int c1 = max(1, -c0 + 9); c1 <= min(-c0 + 12, c0 - 4); c1 += 1) s0(c1, c0 + c1 - 8); for (int c1 = max(c0 - 3, 1); c1 <= min(-c0 + 8, c0); c1 += 1) s1(c1, c0 - c1 + 1); for (int c1 = max(c0 - 3, -c0 + 9); c1 <= min(-c0 + 12, c0); c1 += 1) { s0(c1, c0 + c1 - 8); s1(c1, c0 - c1 + 1); } for (int c1 = max(c0 - 3, -c0 + 13); c1 <= min(8, c0); c1 += 1) s1(c1, c0 - c1 + 1); for (int c1 = max(c0 + 1, -c0 + 9); c1 <= min(-c0 + 12, 8); c1 += 1) s0(c1, c0 + c1 - 8); } cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-orig0-0.c0000664000175000017500000000036012254313240017661 00000000000000{ for (int c1 = 0; c1 < N; c1 += 1) s0(1, c1, 1, 0, 0); for (int c1 = 0; c1 < T; c1 += 1) { for (int c3 = 0; c3 < N; c3 += 1) s1(2, c1, 0, c3, 1); for (int c3 = 1; c3 < N - 1; c3 += 1) s2(2, c1, 1, c3, 1); } } cloog-0.18.2/isl/test_inputs/codegen/omega/fc2-0.in0000664000175000017500000000044312254313240016630 00000000000000[n] -> { s0[i, j] -> [-1 + i, 0, n - i, n - j] : i >= 1 and j >= 1 + i and j <= n; s1[i, j, k] -> [-1 + i, 1, n - i, n - j] : j >= 1 + i and k >= 1 + i and i >= 1 and j <= n and k <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/m3-0.in0000664000175000017500000000027212254313240016475 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_2 >= 1 - In_1 and In_2 >= 1 and In_2 <= 10 - In_1 and In_2 <= 10 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/stride5-0.c0000664000175000017500000000017012254313240017346 00000000000000for (int c0 = 2; c0 <= min(-2 * n + 400, 100); c0 += 2) for (int c1 = 2 * n + c0; c1 <= 400; c1 += 2) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/m4-1.c0000664000175000017500000000015612254313240016314 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c1, c0); s1(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-2.c0000664000175000017500000000035112254313240017044 00000000000000for (int c0 = 1; c0 <= min(2 * b - 1, n); c0 += 1) for (int c1 = max(-b + 1, -n + 1); c1 <= min(n - c0, b - c0); c1 += 1) for (int c2 = max(1, c0 + c1); c2 <= min(n + c1, n); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-3.c0000664000175000017500000000001412254313240020543 00000000000000s0(n + 19); cloog-0.18.2/isl/test_inputs/codegen/omega/lu-1.in0000664000175000017500000000106112254313240016574 00000000000000[n] -> { s1[k, i, j] -> [t1, t2, j, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and i >= 1 + k and j >= 1 + k and k >= 1 and i <= n and j <= n); s0[k, i] -> [t1, t2, k, k, i] : exists (e0 = [(-1 + t1)/64], e1 = [(t2)/64]: 64e0 = -1 + t1 and 64e1 = t2 and t1 >= -63 + k and t1 <= k and t2 >= -63 + i and t2 <= i and k >= 1 and i >= 1 + k and i <= n) } { : } [n] -> { [t1, t2, i2, i3, i4] -> separate[o0] : o0 >= 4; [t1, t2, i2, i3, i4] -> atomic[o0] : o0 <= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-4.in0000664000175000017500000000031312254313240020466 00000000000000[n, m] -> { s0[In_1] -> [In_1] : exists (e0 = [(1 + n)/3]: In_1 >= m and 5e0 >= In_1 and 3e0 <= n and 3e0 >= -1 + n) } { : } [n, m] -> { [i0] -> atomic[o0] : o0 <= -1; [i0] -> separate[o0] : o0 >= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-3.c0000664000175000017500000000127012254313240017014 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) if (c0 >= 61) { for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else if (c0 <= 4) { for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-6.c0000664000175000017500000000014412254313240020306 00000000000000if (m >= 8 * floord(m + 1, 8)) for (int c0 = 4 * floord(m + 1, 32); c0 <= n; c0 += 1) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-1.in0000664000175000017500000000103312254313240017172 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 4; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-1.in0000664000175000017500000000041612254313240017231 00000000000000[n, b] -> { s0[i, j, k] -> [1 - i + j, -j + k, k] : i >= 1 and j >= i and j <= n and k >= 1 and k <= n and k <= -1 + b + i and k >= 1 - b + j } [b, n] -> { : b >= 1 and n >= b } [n, b] -> { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter6-0.c0000664000175000017500000000013212254313240017016 00000000000000for (int c0 = 1; c0 <= 5; c0 += 1) for (int c1 = 12; c1 <= 17; c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-check-sblock-0.in0000664000175000017500000000071012254313240021354 00000000000000[T, N] -> { s1[2, t, 1, i, 1] -> [2, tb, t + i, t - 1000tb, 0] : 1000tb <= t and 1000tb >= -999 + t and i >= 1 and i <= -2 + N and t >= 0 and t <= -1 + T; s0[1, 0, 1, In_4, 0] -> [1, 0, 1, In_4, 0] : In_4 >= 0 and In_4 <= -1 + N; s0[1, 1, 1, 0, 0] -> [1, 1, 1, 0, 0]; s0[1, 1, 1, -1 + N, 0] -> [1, 1, 1, -1 + N, 0] } [T, N] -> { : T >= 0 and N >= 4 } [N] -> { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_ijk-2.in0000664000175000017500000000041112254313240017430 00000000000000[n] -> { s0[k, j] -> [k, j, 1, 0] : k >= 1 and j >= 1 + k and j <= n; s1[k, j, i] -> [i, j, 0, k] : j >= 1 + k and i >= 1 + k and k >= 1 and j <= n and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 0; [i0, i1, i2, i3] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/m4-0.c0000664000175000017500000000015612254313240016313 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c1, c0); s1(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/m9-0.c0000664000175000017500000000015612254313240016320 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { s0(c1, c0); s1(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-5.in0000664000175000017500000000103412254313240017177 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 0; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur04-0.in0000664000175000017500000000121412254313240017434 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5, In_6, In_7, In_8] -> [In_1, In_2, In_3, In_4, In_5, In_6, In_7, In_8] : In_7 >= 1000In_5 and In_8 >= In_7 and In_8 <= 501 + 500In_6 and In_8 <= 1 + 2In_7 and In_7 <= 999 + 1000In_5 and In_7 <= 1000 and In_8 >= 1000In_1 - In_7 and In_8 <= 999 + 1000In_1 - In_7 and 2In_8 >= 1000In_2 + In_7 and 2In_8 <= 999 + 1000In_2 + In_7 and 3In_7 >= -1 + 1000In_3 and 3In_7 <= 998 + 1000In_3 and In_8 >= 2 + 500In_6 and In_6 >= 0 and In_8 >= 2 + 1000In_4 - 2In_7 and In_8 <= 1001 + 1000In_4 - 2In_7 } { : } { [i0, i1, i2, i3, i4, i5, i6, i7] -> atomic[o0] : o0 <= 6; [i0, i1, i2, i3, i4, i5, i6, i7] -> separate[o0] : o0 >= 7 } cloog-0.18.2/isl/test_inputs/codegen/omega/ts1d-orig0-0.in0000664000175000017500000000070712254313240020052 00000000000000[T, N] -> { s1[2, In_2, 0, In_4, 1] -> [2, In_2, 0, In_4, 1] : In_4 >= 0 and In_4 <= -1 + N and In_2 >= 0 and In_2 <= -1 + T; s0[1, In_2, 1, 0, 0] -> [1, In_2, 1, 0, 0] : In_2 >= 0 and In_2 <= -1 + N; s2[2, In_2, 1, In_4, 1] -> [2, In_2, 1, In_4, 1] : In_4 >= 1 and In_4 <= -2 + N and In_2 >= 0 and In_2 <= -1 + T } [T, N] -> { : T >= 0 and N >= 4 } [N] -> { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 4; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter8-0.c0000664000175000017500000000016612254313240017027 00000000000000for (int c0 = max(exprVar2 + 8 * floord(-exprVar2 + exprVar1 - 1, 8) + 9, exprVar2 + 1); c0 <= 16; c0 += 8) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/gc-0.c0000664000175000017500000000005512254313240016362 00000000000000for (int c0 = 2; c0 <= 8; c0 += 2) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/m1-0.in0000664000175000017500000000031012254313240016464 00000000000000{ s0[i, j] -> [i, j, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[5, j] -> [5, j, 1] : j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-2.in0000664000175000017500000000036312254313240017233 00000000000000[n, b] -> { s0[i, j, k] -> [1 - i + j, -j + k, k] : i >= 1 and j >= i and j <= n and k >= 1 and k <= n and k <= -1 + b + i and k >= 1 - b + j } { : } [n, b] -> { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-0.c0000664000175000017500000000021412254313240020542 00000000000000for (int c0 = 0; c0 <= 10; c0 += 1) for (int c1 = max(2 * c0 - 4, c0); c1 <= min(2 * c0, c0 + 6); c1 += 1) s0(2 * c0 - c1, -c0 + c1); cloog-0.18.2/isl/test_inputs/codegen/omega/lefur01-0.in0000664000175000017500000000053212254313240017433 00000000000000{ s0[In_1, In_2, In_3, In_4] -> [In_1, In_2, In_3, In_4] : In_3 >= 1 and In_4 >= In_3 and In_4 <= 1 + 2In_3 and In_3 <= 1000 and In_4 >= 200In_1 - In_3 and In_4 <= 199 + 200In_1 - In_3 and 2In_4 >= 200In_2 + In_3 and 2In_4 <= 199 + 200In_2 + In_3 } { : } { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/hpf-0.c0000664000175000017500000000030012254313240016537 00000000000000if (P1 == P2 && P2 >= 0 && P2 <= 3) for (int c0 = 0; c0 <= min(-P2 + 4, 2); c0 += 1) for (int c2 = -P2 - c0 + 3 * floord(P2 + c0 - 1, 3) + 3; c2 <= 3; c2 += 3) s0(c0, c0, c2, c2); cloog-0.18.2/isl/test_inputs/codegen/omega/lu-2.c0000664000175000017500000000064012254313240016413 00000000000000for (int c0 = 1; c0 < n; c0 += 64) for (int c1 = c0 - 1; c1 <= n; c1 += 64) for (int c2 = c0; c2 <= n; c2 += 1) { for (int c3 = c0; c3 <= min(min(c0 + 63, c1 + 62), c2 - 1); c3 += 1) for (int c4 = max(c3 + 1, c1); c4 <= min(c1 + 63, n); c4 += 1) s1(c3, c4, c2); if (c0 + 63 >= c2) for (int c4 = max(c2 + 1, c1); c4 <= min(n, c1 + 63); c4 += 1) s0(c2, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-3.in0000664000175000017500000000041612254313240017233 00000000000000[n, b] -> { s0[i, j, k] -> [1 - i + j, -j + k, k] : i >= 1 and j >= i and j <= n and k >= 1 and k <= n and k <= -1 + b + i and k >= 1 - b + j } [b, n] -> { : b >= 1 and n >= b } [n, b] -> { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur01-1.c0000664000175000017500000000101612254313240017246 00000000000000for (int c0 = 0; c0 <= 15; c0 += 1) for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(c0 + 1, 15); c1 += 1) for (int c2 = max(max(max(1, 67 * c1 - (c1 + 2) / 3), 67 * c0 - (c0 + 1) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(100 * c0 + 99, 1000), 133 * c0 - 67 * c1 + floord(c0 + c1 - 1, 3) + 133); c2 += 1) for (int c3 = max(max(100 * c1 + (c2 + 1) / 2, 200 * c0 - c2), c2); c3 <= min(min(200 * c0 - c2 + 199, 100 * c1 + (c2 + 1) / 2 + 99), 2 * c2 + 1); c3 += 1) s0(c0, c1, c2, c3); cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-5.in0000664000175000017500000000031312254313240020467 00000000000000[m, n] -> { s0[In_1] -> [In_1] : exists (e0 = [(m)/32]: 32e0 <= m and 32e0 >= -31 + m and 4e0 <= In_1 and In_1 <= n) } { : } [m, n] -> { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/chosol-0.c0000664000175000017500000000025512254313240017262 00000000000000{ for (int c1 = 2; c1 <= n; c1 += 1) s0(c1); for (int c1 = 1; c1 < n; c1 += 1) { for (int c3 = c1 + 1; c3 <= n; c3 += 1) s1(c3, c1); s2(c1 + 1); } } cloog-0.18.2/isl/test_inputs/codegen/omega/p.delft-0.c0000664000175000017500000000030012254313240017316 00000000000000if (P1 == P2 && P2 >= 0 && P2 <= 3) for (int c0 = 0; c0 <= min(-P2 + 4, 2); c0 += 1) for (int c2 = -P2 - c0 + 3 * floord(P2 + c0 - 1, 3) + 3; c2 <= 3; c2 += 3) s0(c0, c0, c2, c2); cloog-0.18.2/isl/test_inputs/codegen/omega/gist-2.c0000664000175000017500000000013312254313240016736 00000000000000for (int c0 = 1; c0 <= n; c0 += 256) for (int c1 = c0; c1 <= n; c1 += 8) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/wak4-1.in0000664000175000017500000000067312254313240017032 00000000000000[a1, a2, a3, a4, a5, b1, b2, b3, b4, b5] -> { s0[i] -> [i, 0] : i >= a1 and i >= a2 and i >= a3 and i >= a4 and i >= a5 and i <= b1 and i <= b2 and i <= b3 and i <= b4 and i <= b5; s1[i] -> [i, 1] : i >= a1 and i >= a2 and i >= a3 and i >= a4 and i >= a5 and i <= b1 and i <= b2 and i <= b3 and i <= b4 and i <= b5 } { : } [a1, a2, a3, a4, a5, b1, b2, b3, b4, b5] -> { [i0, i1] -> separate[o0] : o0 >= 0; [i0, i1] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak1-0.in0000664000175000017500000000031712254313240017021 00000000000000[a3, b3, a2, b2, a1, b1] -> { s2[i] -> [i, 2] : i >= a3 and i <= b3; s0[i] -> [i, 0] : i >= a1 and i <= b1; s1[i] -> [i, 1] : i >= a2 and i <= b2 } { : } [a1, b1] -> { [i0, i1] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/olda-0.c0000664000175000017500000000032412254313240016707 00000000000000for (int c0 = 1; c0 <= morb; c0 += 1) for (int c1 = 1; c1 <= np; c1 += 1) for (int c2 = 1; c2 <= np; c2 += 1) { if (c2 >= c1) s0(c2, c1, c0); if (c1 >= c2) s1(c1, c2, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-3.in0000664000175000017500000000043412254313240017127 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-1 + In_1)/4], e1 = [(-1 - In_1 + In_2)/6]: 4e0 = -1 + In_1 and 6e1 = -1 - In_1 + In_2 and In_1 >= 1 and In_2 >= 1 + In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/p6-0.c0000664000175000017500000000023312254313240016314 00000000000000{ for (int c0 = 5; c0 <= 8; c0 += 1) s0(c0); for (int c0 = 10; c0 <= 16; c0 += 2) s0(c0); for (int c0 = 20; c0 <= 25; c0 += 1) s0(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/m12-1.in0000664000175000017500000000170412254313240016557 00000000000000[m, n] -> { s1[1, In_2, In_3, 0] -> [1, In_2, In_3, 0] : In_3 >= 1 and In_3 <= m and In_2 >= 1 and In_2 <= n; s2[2, In_2, 0, 0] -> [2, In_2, 0, 0] : In_2 >= 1 and In_2 <= n; s3[2, In_2, 0, 0] -> [2, In_2, 0, 0] : In_2 >= 1 and In_2 <= n; s8[4, In_2, 0, 0] -> [4, In_2, 0, 0] : In_2 >= 1 and In_2 <= m; s0[1, In_2, In_3, 0] -> [1, In_2, In_3, 0] : In_3 >= 1 and In_3 <= m and In_2 >= 1 and In_2 <= n; s7[3, In_2, 2, In_4] -> [3, In_2, 2, In_4] : In_4 >= 1 and In_4 <= n and In_2 >= 1 and In_2 <= m; s4[3, In_2, 1, In_4] -> [3, In_2, 1, In_4] : In_4 >= 1 and In_4 <= n and In_2 >= 1 and In_2 <= m; s6[3, In_2, 2, In_4] -> [3, In_2, 2, In_4] : In_4 >= 1 and In_4 <= n and In_2 >= 1 and In_2 <= m; s9[4, In_2, 0, 0] -> [4, In_2, 0, 0] : In_2 >= 1 and In_2 <= m; s5[3, In_2, 1, In_4] -> [3, In_2, 1, In_4] : In_4 >= 1 and In_4 <= n and In_2 >= 1 and In_2 <= m } { : } [m, n] -> { [i0, i1, i2, i3] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/gist-1.in0000664000175000017500000000042012254313240017120 00000000000000[n] -> { s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-1 + In_1)/4], e1 = [(-In_1 + In_2)/8]: 4e0 = -1 + In_1 and 8e1 = -In_1 + In_2 and In_1 >= 1 and In_2 >= In_1 and In_2 <= n) } { : } [n] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/guard1-0.in0000664000175000017500000000025712254313240017344 00000000000000[n, m] -> { s0[n, m] -> [n, m] : exists (e0 = [(-2 - n + m)/3]: 3e0 = -2 - n + m) } { : } [n, m] -> { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/guard1-0.c0000664000175000017500000000007012254313240017151 00000000000000if (n + 3 * floord(-n + m - 2, 3) + 2 == m) s0(n, m); cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-5.in0000664000175000017500000000054512254313240017602 00000000000000{ s1[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(-2 + In_1)/4]: 4e0 = -2 + In_1 and In_1 >= 10 and In_1 <= 98 and In_2 >= 10 and In_2 <= 100); s0[In_1, In_2] -> [In_1, In_2] : exists (e0 = [(In_1)/4]: 4e0 = In_1 and In_1 >= 4 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100) } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak1-1.c0000664000175000017500000000336412254313240016643 00000000000000{ for (int c0 = a3; c0 <= min(min(a2 - 1, b3), a1 - 1); c0 += 1) s2(c0); for (int c0 = a2; c0 <= min(min(b2, a3 - 1), a1 - 1); c0 += 1) s1(c0); for (int c0 = max(a3, a2); c0 <= min(min(b2, b3), a1 - 1); c0 += 1) { s1(c0); s2(c0); } for (int c0 = max(max(a3, a2), b2 + 1); c0 <= min(b3, a1 - 1); c0 += 1) s2(c0); for (int c0 = a1; c0 <= min(min(a2 - 1, a3 - 1), b1); c0 += 1) s0(c0); for (int c0 = max(a1, a3); c0 <= min(min(a2 - 1, b3), b1); c0 += 1) { s0(c0); s2(c0); } for (int c0 = max(max(a1, b1 + 1), a3); c0 <= min(a2 - 1, b3); c0 += 1) s2(c0); for (int c0 = max(a1, a2); c0 <= min(min(b2, a3 - 1), b1); c0 += 1) { s0(c0); s1(c0); } for (int c0 = max(max(a1, b1 + 1), a2); c0 <= min(b2, a3 - 1); c0 += 1) s1(c0); for (int c0 = max(max(a1, a3), a2); c0 <= min(min(b2, b3), b1); c0 += 1) { s0(c0); s1(c0); s2(c0); } for (int c0 = max(max(max(a1, b1 + 1), a3), a2); c0 <= min(b2, b3); c0 += 1) { s1(c0); s2(c0); } for (int c0 = max(max(a1, a2), b2 + 1); c0 <= min(a3 - 1, b1); c0 += 1) s0(c0); for (int c0 = max(max(max(a1, a3), a2), b2 + 1); c0 <= min(b3, b1); c0 += 1) { s0(c0); s2(c0); } for (int c0 = max(max(max(max(a1, b1 + 1), a3), a2), b2 + 1); c0 <= b3; c0 += 1) s2(c0); for (int c0 = max(max(a3, b3 + 1), a2); c0 <= min(b2, a1 - 1); c0 += 1) s1(c0); for (int c0 = max(max(a1, a3), b3 + 1); c0 <= min(a2 - 1, b1); c0 += 1) s0(c0); for (int c0 = max(max(max(a1, a3), b3 + 1), a2); c0 <= min(b2, b1); c0 += 1) { s0(c0); s1(c0); } for (int c0 = max(max(max(max(a1, b1 + 1), a3), b3 + 1), a2); c0 <= b2; c0 += 1) s1(c0); for (int c0 = max(max(max(max(a1, a3), b3 + 1), a2), b2 + 1); c0 <= b1; c0 += 1) s0(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur00-0.in0000664000175000017500000000053212254313240017432 00000000000000{ s0[In_1, In_2, In_3, In_4] -> [In_1, In_2, In_3, In_4] : In_3 >= 1 and In_4 >= In_3 and In_4 <= 1 + 2In_3 and In_3 <= 1000 and In_4 >= 200In_1 - In_3 and In_4 <= 199 + 200In_1 - In_3 and 2In_4 >= 200In_2 + In_3 and 2In_4 <= 199 + 200In_2 + In_3 } { : } { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/syr2k-1.c0000664000175000017500000000031712254313240017045 00000000000000for (int c0 = 1; c0 <= min(2 * b - 1, n); c0 += 1) for (int c1 = -b + 1; c1 <= b - c0; c1 += 1) for (int c2 = max(c0 + c1, 1); c2 <= min(n + c1, n); c2 += 1) s0(-c0 - c1 + c2 + 1, -c1 + c2, c2); cloog-0.18.2/isl/test_inputs/codegen/omega/lu_ijk-0.in0000664000175000017500000000041112254313240017426 00000000000000[n] -> { s0[k, j] -> [k, j, 1, 0] : k >= 1 and j >= 1 + k and j <= n; s1[k, j, i] -> [i, j, 0, k] : j >= 1 + k and i >= 1 + k and k >= 1 and j <= n and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 2; [i0, i1, i2, i3] -> separate[o0] : o0 >= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter5-0.c0000664000175000017500000000015312254313240017020 00000000000000for (int c0 = 2; c0 <= 9; c0 += 1) for (int c1 = c0 + 1; c1 <= min(16, 2 * c0); c1 += 1) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/olda-1.c0000664000175000017500000000037212254313240016713 00000000000000for (int c0 = 1; c0 <= morb; c0 += 1) for (int c1 = 1; c1 <= np; c1 += 1) { for (int c2 = 1; c2 < c1; c2 += 1) s1(c1, c2, c0); s0(c1, c1, c0); s1(c1, c1, c0); for (int c2 = c1 + 1; c2 <= np; c2 += 1) s0(c2, c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_spmd-0.c0000664000175000017500000000052612254313240017437 00000000000000if (ub >= lb) for (int c0 = 1; c0 <= ub; c0 += 1) for (int c1 = c0; c1 <= n; c1 += 1) { if (lb >= c0 + 1) { s3(c0, c1, lb, c0, c1); } else if (c1 >= c0 + 1) { s0(c0, c1); if (n >= ub + 1) s2(c0, c1); } for (int c3 = max(c0, lb); c3 <= ub; c3 += 1) s1(c0, c1, c3); } cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-4.c0000664000175000017500000000027312254313240017413 00000000000000for (int c0 = 4; c0 <= 100; c0 += 4) { for (int c1 = 1; c1 <= 100; c1 += 1) s0(c0, c1); if (c0 <= 96 && c0 >= 8) for (int c1 = 10; c1 <= 100; c1 += 1) s1(c0 + 2, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/m4-0.in0000664000175000017500000000033612254313240016477 00000000000000{ s0[i, j] -> [j, i, 0] : i >= 1 and i <= 9 and j >= 1 and j <= 9; s1[i, j] -> [j, i, 1] : i >= 1 and i <= 9 and j >= 1 and j <= 9 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 2; [i0, i1, i2] -> atomic[o0] : o0 <= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter3-0.in0000664000175000017500000000024312254313240017202 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 2 and In_2 >= 1 + In_1 and In_2 <= 9 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter1-0.c0000664000175000017500000000005512254313240017015 00000000000000for (int c0 = 2; c0 <= 9; c0 += 1) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/wak2-0.c0000664000175000017500000000154412254313240016641 00000000000000{ for (int c0 = a1; c0 <= min(a2 - 1, b1); c0 += 1) for (int c1_0 = c1; c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); if (c2 >= d2 + 1) { for (int c0 = max(a1, a2); c0 <= min(b2, b1); c0 += 1) for (int c1_0 = c1; c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); } else for (int c0 = a2; c0 <= b2; c0 += 1) { if (c0 >= a1 && b1 >= c0) for (int c1_0 = c1; c1_0 <= min(c2 - 1, d1); c1_0 += 1) s0(c0, c1_0); for (int c1_0 = c2; c1_0 <= d2; c1_0 += 1) { if (c0 >= a1 && b1 >= c0 && c1_0 >= c1 && d1 >= c1_0) s0(c0, c1_0); s1(c0, c1_0); } if (c0 >= a1 && b1 >= c0) for (int c1_0 = max(d2 + 1, c1); c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); } for (int c0 = max(max(a1, a2), b2 + 1); c0 <= b1; c0 += 1) for (int c1_0 = c1; c1_0 <= d1; c1_0 += 1) s0(c0, c1_0); } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-4.c0000664000175000017500000000140612254313240017016 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) if (c0 >= 61) { for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else if (c0 <= 4) { for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/lift2-1.in0000664000175000017500000000103312254313240017173 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 5 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 4; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 3 } cloog-0.18.2/isl/test_inputs/codegen/omega/code_gen-2.c0000664000175000017500000000062412254313240017540 00000000000000{ for (int c1 = 0; c1 <= 7; c1 += 1) s0(1, c1); for (int c0 = 2; c0 <= 6; c0 += 1) { for (int c1 = 0; c1 < c0 - 1; c1 += 1) s1(c0, c1); for (int c1 = c0 - 1; c1 <= 4; c1 += 1) { s1(c0, c1); s0(c0, c1); } for (int c1 = 5; c1 <= 7; c1 += 1) s0(c0, c1); } for (int c0 = 7; c0 <= 8; c0 += 1) for (int c1 = c0 - 1; c1 <= 7; c1 += 1) s0(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/floor_bound-2.c0000664000175000017500000000007412254313240020304 00000000000000for (int c0 = 4 * floord(m, 4); c0 <= n; c0 += 1) s0(c0); cloog-0.18.2/isl/test_inputs/codegen/omega/stride4-0.in0000664000175000017500000000026012254313240017531 00000000000000{ s0[In_1] -> [In_1] : exists (e0 = [(-3 + In_1)/5]: 5e0 = -3 + In_1 and In_1 >= 18 and In_1 <= 98) } { : } { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lefur03-0.in0000664000175000017500000000100212254313240017426 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5, In_6] -> [In_1, In_2, In_3, In_4, In_5, In_6] : In_6 >= In_5 and In_6 <= 1 + 2In_5 and In_5 <= 1000 and In_6 >= 1000In_1 - In_5 and In_6 <= 999 + 1000In_1 - In_5 and In_6 >= 2 + 1000In_4 - 2In_5 and In_6 <= 1001 + 1000In_4 - 2In_5 and In_4 >= 0 and 2In_6 >= 1000In_2 + In_5 and 2In_6 <= 999 + 1000In_2 + In_5 and 3In_5 >= -1 + 1000In_3 and 3In_5 <= 998 + 1000In_3 } { : } { [i0, i1, i2, i3, i4, i5] -> separate[o0] : o0 >= 5; [i0, i1, i2, i3, i4, i5] -> atomic[o0] : o0 <= 4 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak1-1.in0000664000175000017500000000031712254313240017022 00000000000000[a3, b3, a2, b2, a1, b1] -> { s2[i] -> [i, 2] : i >= a3 and i <= b3; s0[i] -> [i, 0] : i >= a1 and i <= b1; s1[i] -> [i, 1] : i >= a2 and i <= b2 } { : } [a1, b1] -> { [i0, i1] -> separate[o0] : o0 >= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/m1-1.c0000664000175000017500000000043012254313240016304 00000000000000for (int c0 = 1; c0 <= 9; c0 += 1) if (c0 >= 6) { for (int c1 = 1; c1 <= 9; c1 += 1) s0(c0, c1); } else if (c0 <= 4) { for (int c1 = 1; c1 <= 9; c1 += 1) s0(c0, c1); } else for (int c1 = 1; c1 <= 9; c1 += 1) { s0(5, c1); s1(5, c1); } cloog-0.18.2/isl/test_inputs/codegen/omega/p6-0.in0000664000175000017500000000034412254313240016503 00000000000000{ s0[In_1] -> [In_1] : (In_1 >= 5 and In_1 <= 8) or (exists (e0 = [(In_1)/2]: 2e0 = In_1 and In_1 >= 10 and In_1 <= 16)) or (In_1 >= 20 and In_1 <= 25) } { : } { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/chosol-1.in0000664000175000017500000000041312254313240017443 00000000000000[n] -> { s0[i] -> [0, i, 0, 0] : i >= 2 and i <= n; s1[i, j] -> [1, j, 0, i] : j >= 1 and j <= -1 + i and i <= n; s2[i] -> [1, -1 + i, 1, 0] : i >= 2 and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 1; [i0, i1, i2, i3] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/dagstuhl1-0.in0000664000175000017500000000021612254313240020050 00000000000000{ s0[i, j] -> [i + 10j] : i >= 0 and i <= 9 and j >= 0 and j <= 9 } { : } { [i0] -> separate[o0] : o0 >= 0; [i0] -> atomic[o0] : o0 <= -1 } cloog-0.18.2/isl/test_inputs/codegen/omega/lu_ijk-1.in0000664000175000017500000000041112254313240017427 00000000000000[n] -> { s0[k, j] -> [k, j, 1, 0] : k >= 1 and j >= 1 + k and j <= n; s1[k, j, i] -> [i, j, 0, k] : j >= 1 + k and i >= 1 + k and k >= 1 and j <= n and i <= n } { : } [n] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 1; [i0, i1, i2, i3] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/if_then-3.c0000664000175000017500000000040512254313240017407 00000000000000if (n >= 2) { for (int c0 = 1; c0 <= 100; c0 += 1) { s0(c0); for (int c1 = 1; c1 <= 100; c1 += 1) { s1(c0, c1); s2(c0, c1); } } } else for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) s2(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/omega/collard-0.c0000664000175000017500000000061212254313240017410 00000000000000{ for (int c4 = 1; c4 <= n; c4 += 1) s2(c4); for (int c1 = 1; c1 < n; c1 += 1) { for (int c4 = 0; c4 < n - c1; c4 += 1) s0(c1, n - c4); for (int c3 = 0; c3 < n - c1; c3 += 1) for (int c4 = c1 + 1; c4 <= n; c4 += 1) s1(c1, n - c3, c4); } for (int c1 = 1; c1 <= n; c1 += 1) { s4(c1); for (int c3 = c1 + 1; c3 <= n; c3 += 1) s3(c3, c1); } } cloog-0.18.2/isl/test_inputs/codegen/omega/olda-1.in0000664000175000017500000000050412254313240017074 00000000000000[np, morb] -> { s0[mp, mq, mi] -> [mi, mq, mp, 0] : mq >= 1 and mq <= mp and mp <= np and mi >= 1 and mi <= morb; s1[mp, mq, mi] -> [mi, mp, mq, 1] : mq >= 1 and mq <= mp and mp <= np and mi >= 1 and mi <= morb } { : } [np, morb] -> { [i0, i1, i2, i3] -> atomic[o0] : o0 <= 1; [i0, i1, i2, i3] -> separate[o0] : o0 >= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-1.c0000664000175000017500000000063712254313240017017 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) for (int c2 = 1; c2 <= 100; c2 += 1) for (int c3 = 1; c3 <= 100; c3 += 1) if (c0 >= 61) { for (int c4 = 1; c4 <= 100; c4 += 1) s1(c0, c1, c2, c3, c4); } else for (int c4 = 1; c4 <= 100; c4 += 1) { s1(c0, c1, c2, c3, c4); s0(c0, c1, c2, c3, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/iter7-0.in0000664000175000017500000000027012254313240017206 00000000000000{ s0[In_1, In_2] -> [In_1, o1] : 2In_2 = 15 - 3In_1 and 2o1 = 15 - 3In_1 and In_1 <= 3 and In_1 >= 1 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/x-0.in0000664000175000017500000000035712254313240016431 00000000000000{ s0[i, j] -> [8 - i + j, i, 0] : i >= 1 and i <= 8 and j >= 1 and j <= 4; s1[i, j] -> [-1 + i + j, i, 1] : i >= 1 and i <= 8 and j >= 1 and j <= 4 } { : } { [i0, i1, i2] -> separate[o0] : o0 >= 1; [i0, i1, i2] -> atomic[o0] : o0 <= 0 } cloog-0.18.2/isl/test_inputs/codegen/omega/lu-0.c0000664000175000017500000000064012254313240016411 00000000000000for (int c0 = 1; c0 < n; c0 += 64) for (int c1 = c0 - 1; c1 <= n; c1 += 64) for (int c2 = c0; c2 <= n; c2 += 1) { for (int c3 = c0; c3 <= min(min(c0 + 63, c1 + 62), c2 - 1); c3 += 1) for (int c4 = max(c3 + 1, c1); c4 <= min(c1 + 63, n); c4 += 1) s1(c3, c4, c2); if (c0 + 63 >= c2) for (int c4 = max(c2 + 1, c1); c4 <= min(n, c1 + 63); c4 += 1) s0(c2, c4); } cloog-0.18.2/isl/test_inputs/codegen/omega/lift1-2.in0000664000175000017500000000103312254313240017173 00000000000000{ s0[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 60 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100; s1[In_1, In_2, In_3, In_4, In_5] -> [In_1, In_2, In_3, In_4, In_5] : In_1 >= 1 and In_1 <= 100 and In_2 >= 1 and In_2 <= 100 and In_3 >= 1 and In_3 <= 100 and In_4 >= 1 and In_4 <= 100 and In_5 >= 1 and In_5 <= 100 } { : } { [i0, i1, i2, i3, i4] -> separate[o0] : o0 >= 3; [i0, i1, i2, i3, i4] -> atomic[o0] : o0 <= 2 } cloog-0.18.2/isl/test_inputs/codegen/omega/iter6-0.in0000664000175000017500000000025412254313240017207 00000000000000{ s0[In_1, In_2] -> [In_1, In_2] : In_1 >= 1 and In_1 <= 5 and In_2 >= 12 and In_2 <= 17 } { : } { [i0, i1] -> atomic[o0] : o0 <= 0; [i0, i1] -> separate[o0] : o0 >= 1 } cloog-0.18.2/isl/test_inputs/codegen/omega/wak1-0.c0000664000175000017500000000133212254313240016633 00000000000000{ for (int c0 = a2; c0 <= min(min(b2, a3 - 1), a1 - 1); c0 += 1) s1(c0); for (int c0 = a3; c0 <= min(b3, a1 - 1); c0 += 1) { if (c0 >= a2 && b2 >= c0) s1(c0); s2(c0); } for (int c0 = max(max(a3, b3 + 1), a2); c0 <= min(b2, a1 - 1); c0 += 1) s1(c0); for (int c0 = a1; c0 <= b1; c0 += 1) { s0(c0); if (b2 >= c0 && c0 >= a2) s1(c0); if (b3 >= c0 && c0 >= a3) s2(c0); } for (int c0 = max(max(a1, b1 + 1), a2); c0 <= min(b2, a3 - 1); c0 += 1) s1(c0); for (int c0 = max(max(a1, b1 + 1), a3); c0 <= b3; c0 += 1) { if (c0 >= a2 && b2 >= c0) s1(c0); s2(c0); } for (int c0 = max(max(max(max(a1, b1 + 1), a3), b3 + 1), a2); c0 <= b2; c0 += 1) s1(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/stride7-1.c0000664000175000017500000000052512254313240017355 00000000000000{ for (int c0 = 1; c0 <= 3; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) s1(c1, c0); for (int c0 = 4; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) { if (c0 % 4 == 0) s0(c1, c0 / 4); s1(c1, c0); } for (int c0 = 3; c0 <= 9; c0 += 1) for (int c1 = 1; c1 <= 9; c1 += 1) s0(c1, c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/substitution-4.c0000664000175000017500000000001312254313240020543 00000000000000s0(n + 1); cloog-0.18.2/isl/test_inputs/codegen/omega/iter9-0.c0000664000175000017500000000051012254313240017021 00000000000000for (int c0 = 1; c0 <= 15; c0 += 1) { if (8 * floord(7 * exprVar1 + 7, 8) + 8 >= 7 * exprVar1 + c0) { s4(c0); s0(c0); s3(c0); s2(c0); s1(c0); } if (8 * floord(7 * exprVar1 + 7, 8) + 8 >= 7 * exprVar1 + c0 || (exprVar1 + 8 * floord(-exprVar1 + c0 - 1, 8) + 1 == c0 && c0 >= exprVar1 + 1)) s5(c0); } cloog-0.18.2/isl/test_inputs/codegen/omega/stride7-0.c0000664000175000017500000000051512254313240017353 00000000000000for (int c0 = 1; c0 <= 36; c0 += 1) if (c0 <= 3) { for (int c1 = 1; c1 <= 9; c1 += 1) s1(c1, c0); } else if (c0 <= 9) { for (int c1 = 1; c1 <= 9; c1 += 1) { if (c0 % 4 == 0) s0(c1, c0 / 4); s1(c1, c0); } } else if (c0 % 4 == 0) for (int c1 = 1; c1 <= 9; c1 += 1) s0(c1, c0 / 4); cloog-0.18.2/isl/test_inputs/codegen/unroll.in0000664000175000017500000000033412254313240016243 00000000000000# Test that unrolling takes into account stride constraints. # If it didn't, it would run essentially forever on this example. [n] -> { A[i] -> [i] : exists a : i = 100000000 a and 0 <= a <= 2 } {:} { [i] -> unroll[0] } cloog-0.18.2/isl/test_inputs/codegen/unroll4.c0000664000175000017500000000165612254313240016153 00000000000000{ write_shared_A(3, ((t1 + 3) % 4) + 1, ((t2 + 31) % 32) + 1); if (t1 % 3 == 0 && t2 >= 1 && t2 <= 2) write_shared_A(3, (-t1 + 12) / 3, t2 + 32); { int c3 = ((t1 + 3) % 4) + 1 >= t2 && t2 >= 2 && t2 <= 33 ? t2 + 32 : ((t2 + 30) % 32) + 2; if (c3 == t2 + 32 || (c3 == t2 && ((-t1 + 8) % 4) + t2 >= ((t2 + 1) % 2) + 5)) write_shared_A(3, ((t1 + 3) % 4) + 5, c3); } if (t2 >= t1 + 1 && t2 <= 4 && t1 >= 1) write_shared_A(3, t1 + 4, t2 + 32); write_shared_A(4, ((t1 + 3) % 4) + 1, ((t2 + 31) % 32) + 1); if (t1 % 3 == 0 && t2 >= 1 && t2 <= 2) write_shared_A(4, (-t1 + 12) / 3, t2 + 32); { int c3 = ((t1 + 3) % 4) + 1 >= t2 && t2 >= 2 && t2 <= 33 ? t2 + 32 : ((t2 + 30) % 32) + 2; if (c3 == t2 + 32 || (c3 == t2 && ((-t1 + 8) % 4) + t2 >= ((t2 + 1) % 2) + 5)) write_shared_A(4, ((t1 + 3) % 4) + 5, c3); } if (t2 >= t1 + 1 && t2 <= 4 && t1 >= 1) write_shared_A(4, t1 + 4, t2 + 32); } cloog-0.18.2/isl/test_inputs/codegen/separation_class2.c0000664000175000017500000000104212254313240020155 00000000000000{ for (int c0 = 0; c0 < -(n % 8) + n - 7; c0 += 8) { for (int c1 = 0; c1 < -(n % 8) + n - 7; c1 += 8) for (int c2 = 0; c2 <= 7; c2 += 1) for (int c3 = 0; c3 <= 7; c3 += 1) A(c0 + c2, c1 + c3); for (int c2 = 0; c2 <= 7; c2 += 1) for (int c3 = 0; c3 < n % 8; c3 += 1) A(c0 + c2, -((n - 1) % 8) + n + c3 - 1); } for (int c1 = 0; c1 < n; c1 += 8) for (int c2 = 0; c2 < n % 8; c2 += 1) for (int c3 = 0; c3 <= min(n - c1 - 1, 7); c3 += 1) A(-((n - 1) % 8) + n + c2 - 1, c1 + c3); } cloog-0.18.2/isl/test_inputs/codegen/dwt.in0000664000175000017500000000035212254313240015526 00000000000000[Ncl] -> { S[j, 28] -> [j] : j <= -2 + Ncl and Ncl <= 256 and Ncl >= 40 and j >= 1; S[0, 26] -> [0] : Ncl <= 256 and Ncl >= 40; S[-1 + Ncl, 27] -> [-1 + Ncl] : Ncl <= 256 and Ncl >= 40 } [Ncl] -> { : Ncl >= 40 and Ncl <= 256 } { } cloog-0.18.2/isl/test_inputs/codegen/atomic2.c0000664000175000017500000000011512254313240016077 00000000000000for (int c0 = ((b0 + 32767) % 32768) + 1; c0 <= 65534; c0 += 32768) A(c0); cloog-0.18.2/isl/test_inputs/codegen/stride5.c0000664000175000017500000000015712254313240016126 00000000000000if (2 * floord(n, 2) == n) for (int c0 = (n + 4 * floord(-n - 1, 4) + 4) / 2; c0 <= 100; c0 += 2) S(c0); cloog-0.18.2/isl/test_inputs/codegen/single_valued.in0000664000175000017500000000033712254313240017554 00000000000000# Check that isl recognizes that the inverse schedule is single-valued # and does not end up in an infinite recursion. [t1] -> {S[c2] -> [c2]: t1 <= c2 <= 134 and (c2+t1) % 128 = 0 and c2 > 0} [t1] -> {: t1 > 0} [t1] -> {} cloog-0.18.2/isl/test_inputs/codegen/hoist.c0000664000175000017500000000223412254313240015673 00000000000000if (nj >= t1 + 1 && ni >= t0 + 1) for (int c2 = 0; c2 <= min(15, nk - 1); c2 += 1) { S_1(t0, t1, c2); if (nj >= t1 + 17) { S_1(t0, t1 + 16, c2); if (nj >= t1 + 33) { S_1(t0, t1 + 32, c2); if (nj >= t1 + 49) S_1(t0, t1 + 48, c2); } } if (ni >= t0 + 17) { S_1(t0 + 16, t1, c2); if (nj >= t1 + 17) { S_1(t0 + 16, t1 + 16, c2); if (nj >= t1 + 33) { S_1(t0 + 16, t1 + 32, c2); if (nj >= t1 + 49) S_1(t0 + 16, t1 + 48, c2); } } if (ni >= t0 + 33) { S_1(t0 + 32, t1, c2); if (nj >= t1 + 17) { S_1(t0 + 32, t1 + 16, c2); if (nj >= t1 + 33) { S_1(t0 + 32, t1 + 32, c2); if (nj >= t1 + 49) S_1(t0 + 32, t1 + 48, c2); } } if (ni >= t0 + 49) { S_1(t0 + 48, t1, c2); if (nj >= t1 + 17) { S_1(t0 + 48, t1 + 16, c2); if (nj >= t1 + 33) { S_1(t0 + 48, t1 + 32, c2); if (nj >= t1 + 49) S_1(t0 + 48, t1 + 48, c2); } } } } } } cloog-0.18.2/isl/test_inputs/codegen/atomic.c0000664000175000017500000000014012254313240016013 00000000000000for (int c0 = 0; c0 <= 10; c0 += 1) { if (c0 >= 1) b(c0 - 1); if (c0 <= 9) a(c0); } cloog-0.18.2/isl/test_inputs/codegen/shift.c0000664000175000017500000000007112254313240015657 00000000000000for (int c0 = 0; c0 <= 9; c0 += 1) { A(c0); B(c0); } cloog-0.18.2/isl/test_inputs/codegen/unroll6.in0000664000175000017500000000130012254313240016323 00000000000000# Check that the right lower bound is chosen for unrolling. # Older versions of isl would pick a lower bound that resulted # in a number of slices that exceeds the maximal value of an integer # and then only generated code for a truncated number (zero) of slices. [nn, t1, g] -> { A[a, b, c] -> [c] : exists (e0 = [(2 + a)/393216], e1 = [(t1 - c)/128]: 128g = b - c and 393216e0 = 2 + a and 128e1 = t1 - c and c <= 130 and c >= 6 - nn + b and c <= 128 + b and nn >= 137 and t1 >= 0 and c >= 1 and a <= -2 + nn and a >= 1 and nn <= 9223372036854775807 and b >= 1 and b <= -2 + nn and t1 <= 127) } [nn, t1, g] -> { : nn <= 9223372036854775807 and nn >= 137 and t1 >= 0 and t1 <= 127 } { [c] -> unroll[x] } cloog-0.18.2/isl/test_inputs/codegen/separation_class2.in0000664000175000017500000000043012254313240020341 00000000000000[n] -> { A[i,j] -> [it,jt, ip, jp] : 0 <= i,j < n and ip = i % 8 and it = i - ip and jp = j % 8 and jt = j - jp} [n] -> { : n >= 10} [n] -> { [it, jt, ip, jp] -> separation_class[[x]->[1]]: (exists id, jd: 0 <= x <= 3 and it < n - id and jt < n - jd and id = n %8 and jd = n %8)} cloog-0.18.2/isl/test_inputs/codegen/stride6.in0000664000175000017500000000137512254313240016316 00000000000000[niter] -> { S_4[-1 + niter, i] -> [o0, o1, o2, o3, o4, o5, o6, o7, 4] : exists (e0 = [(o0)/32], e1 = [(o1)/32], e2 = [(o2)/32], e3 = [(o3)/32], e4 = [(-31i + o5)/32], e5 = [(-i - o4 + o6)/32], e6 = [(-o4 + o7)/32], e7 = [(-1 + niter - o4)/32]: 32e0 = o0 and 32e1 = o1 and 32e2 = o2 and 32e3 = o3 and 32e4 = -31i + o5 and 32e5 = -i - o4 + o6 and 32e6 = -o4 + o7 and 32e7 = -1 + niter - o4 and o0 <= -1 + niter and o0 >= -32 + niter and o1 <= -i and o1 >= -31 - i and o2 <= -1 + niter + i and o2 >= -32 + niter + i and o3 <= 1023 + niter and o3 >= 992 + niter and o4 >= 0 and o4 <= 31 and o5 >= 0 and o5 <= 31 and o6 >= 0 and o6 <= 31 and o7 >= 0 and o7 <= 31 and i <= 1023 and i >= 0 and niter >= 1) } [niter] -> { : niter <= 8192 and niter >= 1 } [niter] -> { } cloog-0.18.2/isl/test_inputs/codegen/separation_class3.in0000664000175000017500000000112212254313240020341 00000000000000{ S_0[t, i] -> [o0, 1, o2, 0, t, 0, i] : 4o2 >= -4 + t + i - 2o0 and 4o2 >= -3 - t + i + 2o0 and 2o0 <= 1 + t and 2o0 >= t and 4o2 <= -1 + t + i - 2o0 and t >= 0 and t <= 7 and i >= 1 and i <= 8; S_0[t, i] -> [o0, 0, o2, 0, t, 0, i] : 4o2 >= t + i - 2o0 and 4o2 <= -t + i + 2o0 and 2o0 <= 1 + t and 2o0 >= t and t >= 0 and t <= 7 and i >= 1 and i <= 8 } {:} { [i0, 1, i2, i3, i4, i5, i6] -> separation_class[[2] -> [0]] : i2 <= 1 and i2 >= 0 and i0 <= 3 and i0 >= 1; [i0, 0, 1, i3, i4, i5, i6] -> separation_class[[2] -> [0]] : i0 <= 3 and i0 >= 1; [i0, i1, i2, i3, i4, i5, i6] -> unroll[1] } cloog-0.18.2/isl/test_inputs/codegen/atomic4.c0000664000175000017500000000005612254313240016105 00000000000000for (int c0 = 0; c0 <= 64; c0 += 1) sync(); cloog-0.18.2/isl/test_inputs/codegen/unroll4.in0000664000175000017500000000144312254313240016331 00000000000000# Check that the generated code does not contain two declarations # of the same variable in the same scope. [t1, t2, g] -> { write_shared_A[a, b, c] -> [0, a, b, c] : exists (e0, e1 = [(-t1 + b)/4], e2 = [(-t2 + c)/32]: 4e1 = -t1 + b and 32e2 = -t2 + c and e0 <= 2 + 3g and e0 >= 3g and a <= 4 and a >= 3 and t2 >= 0 and t1 <= 3 and 2e0 >= 5 - c + 6g and 2e0 <= 36 - c + 6g and 2e0 >= 5 - b + 6g and 2e0 <= 8 - b + 6g and 2e0 <= 638 - c and 2e0 <= 638 - b and 2e0 >= 2 - a + 6g and 2e0 >= -8 + a + 6g and 2e0 <= 1 + a + 6g and 2e0 <= 11 - a + 6g and e0 >= 0 and e0 <= 254 and t1 >= 0 and t2 <= 31 and b >= 1 and b <= 126 and c >= 1 and c <= 126 and g <= 3 and g >= 0) } [t1, t2, g] -> { : g <= 3 and g >= 0 and t1 >= 0 and t1 <= 3 and t2 >= 0 and t2 <= 5 } [t1, t2] -> { [i0, i1, i2, i3] -> unroll[x] } cloog-0.18.2/isl/test_inputs/codegen/atomic3.c0000664000175000017500000000017312254313240016104 00000000000000for (int c0 = 0; c0 <= 64; c0 += 1) if (c0 >= 63) { sync(); } else if (c0 >= 1) { sync(); } else sync(); cloog-0.18.2/isl/test_inputs/codegen/atomic2.in0000664000175000017500000000050012254313240016261 00000000000000# Check that isl properly handles atomic domains that are unions. [nn, b0] -> { A[a] -> [a, 0, b0] : exists (e0 = [(b0 - a)/32768]: 32768e0 = b0 - a and a >= 1 and b0 >= 0 and b0 <= 32767 and a <= 65534) } [nn, b0] -> { : b0 >= 0 and b0 <= 32767 } [nn, b0] -> { [a, b, c] -> atomic[2] : c >= 1; [a, 0, c] -> atomic[2] } cloog-0.18.2/isl/test_inputs/codegen/stride.in0000664000175000017500000000034712254313240016226 00000000000000# Check that we find a common stride on the first dimension # even if it is imposed by different inner dimensions { A[i,k] -> [i,0,j,k] : 0 <= i,k <= 100 and i = 2 j; B[i,k] -> [i,1,k,j] : 0 <= i,k <= 100 and i = 2 j } { : } { } cloog-0.18.2/isl/test_inputs/codegen/separation_class.in0000664000175000017500000000037012254313240020262 00000000000000{ A[i,j] -> [([i/10]),[j/10],i,j] : 0 <= i,j and i + j <= 100 } { : } { [a,b,c,d] -> separation_class[[0]->[0]] : exists b': 0 <= 10a,10b' and 10a+9+10b'+9 <= 100; [a,b,c,d] -> separation_class[[1]->[0]] : 0 <= 10a,10b and 10a+9+10b+9 <= 100 } cloog-0.18.2/isl/test_inputs/codegen/unroll2.c0000664000175000017500000000017412254313240016143 00000000000000{ A(0); A(1); A(2); A(3); for (int c0 = 4; c0 <= 99996; c0 += 1) A(c0); A(99997); A(99998); A(99999); } cloog-0.18.2/isl/test_inputs/codegen/cloog/0000775000175000017500000000000012254313240015563 500000000000000cloog-0.18.2/isl/test_inputs/codegen/cloog/lu.in0000664000175000017500000000036112254313240016453 00000000000000[n] -> { S2[i0, i1, i2] -> [i2, i1] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 + i0 and i2 <= n; S1[i0, i1] -> [i0, n] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n } [n] -> { : } [n] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/guide.c0000664000175000017500000000015612254313240016746 00000000000000{ for (int c0 = 1; c0 <= N; c0 += 1) S1(c0); for (int c0 = N + 1; c0 <= 2 * N; c0 += 1) S2(c0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-QR.c0000664000175000017500000000226512254313240020214 00000000000000if (N >= 1) { S1(0); if (N == 1) { for (int c3 = 0; c3 < M; c3 += 1) S2(0, c3); S3(0); for (int c3 = 0; c3 < M; c3 += 1) S4(0, c3); S10(0); S5(0); } else { for (int c3 = 0; c3 < M; c3 += 1) S2(0, c3); S3(0); for (int c3 = 0; c3 < M; c3 += 1) S4(0, c3); S10(0); S1(1); S5(0); } for (int c1 = 2; c1 < N; c1 += 1) { for (int c3 = c1 - 1; c3 < N; c3 += 1) { S6(c1 - 2, c3); for (int c5 = c1 - 2; c5 < M; c5 += 1) S7(c1 - 2, c3, c5); S8(c1 - 2, c3); for (int c5 = c1 - 2; c5 < M; c5 += 1) S9(c1 - 2, c3, c5); } for (int c3 = c1 - 1; c3 < M; c3 += 1) S2(c1 - 1, c3); S3(c1 - 1); for (int c3 = c1 - 1; c3 < M; c3 += 1) S4(c1 - 1, c3); S10(c1 - 1); S1(c1); S5(c1 - 1); } if (N >= 2) { S6(N - 2, N - 1); for (int c5 = N - 2; c5 < M; c5 += 1) S7(N - 2, N - 1, c5); S8(N - 2, N - 1); for (int c5 = N - 2; c5 < M; c5 += 1) S9(N - 2, N - 1, c5); for (int c3 = N - 1; c3 < M; c3 += 1) S2(N - 1, c3); S3(N - 1); for (int c3 = N - 1; c3 < M; c3 += 1) S4(N - 1, c3); S10(N - 1); S5(N - 1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/esced.c0000664000175000017500000000014612254313240016733 00000000000000for (int c0 = 1; c0 <= m; c0 += 1) { S1(c0); for (int c1 = 1; c1 <= n; c1 += 1) S2(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/1point-1.in0000664000175000017500000000012712254313240017403 00000000000000[M] -> { S1[2M, M] -> [2M, M, 0] } [M] -> { : } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-stride.c0000664000175000017500000000007312254313240021157 00000000000000for (int c1 = 2; c1 <= M; c1 += 7) S1(c1, (c1 - 2) / 7); cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-1.c0000664000175000017500000000005512254313240020356 00000000000000for (int c0 = 0; c0 <= 2; c0 += 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/stride4.in0000664000175000017500000000026412254313240017413 00000000000000[t] -> { S1[i0, t] -> [i0, t, 0] : exists (e0 = [(t - i0)/16]: 16e0 = t - i0 and i0 >= 0 and i0 <= 99 and t >= 0 and t <= 15) } [t] -> { : } [t] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_complex1.in0000664000175000017500000000021712254313240020441 00000000000000[n] -> { S1[i0, i1] -> [2i0 + 3i1, 2i0 + 2i1] : i0 >= 0 and i0 <= n and i1 >= 0 and i1 <= n } [n] -> { : } [n] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/multi-mm-1.in0000664000175000017500000000034012254313240017727 00000000000000[M, N] -> { S1[i0, i1] -> [i0, i1, 0] : i1 >= 0 and i1 <= i0 and i0 <= M; S2[i0, i1] -> [i0, i1, 1] : i1 >= 0 and i1 <= i0 and i0 <= M and i1 <= N } [M, N] -> { : N <= M and N >= 1 } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-jacobi2.in0000664000175000017500000000024312254313240021361 00000000000000[M] -> { S1[i0, i1] -> [0, i0, 0, i1, 0] : i0 >= 0 and i0 <= -1 + M and i1 >= 0 and i1 <= -1 + M } [M] -> { : M >= 1 } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/block.in0000664000175000017500000000015712254313240017130 00000000000000{ S3[i0] -> [i0, 1] : i0 >= 0 and i0 <= 1; S1[] -> [0, 0]; S2[] -> [1, 0] } { : } { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/otl.c0000664000175000017500000000207112254313240016445 00000000000000if (M >= 3 && N >= 4) for (int c0 = 1; c0 < (2 * M + 2 * N - 2) / 5; c0 += 1) for (int c1 = max(c0 - (M + 2) / 5, (c0 + 1) / 2); c1 <= min(min((2 * N + 5 * c0 + 1) / 10, c0), (M + 2 * N) / 5 - 1); c1 += 1) for (int c2 = max(max(max(max(c0 - (M + N + 4) / 5 + 1, c1 - (N + 6) / 5 + 1), floord(-N + 5 * c0 - 3, 10) + 1), 0), c0 - c1 - 1); c2 <= min(min(min((M + N - 2) / 5, (N + 5 * c0 + 3) / 10), c0 - c1 + (N - 1) / 5 + 1), c1); c2 += 1) for (int c3 = max(max(max(2 * c1 - (2 * N + 5) / 5 + 1, 2 * c2 - (N + 2) / 5), c1 + c2 - (N + 3) / 5), c0); c3 <= min(min(min(min(min(c1 + (M - 2) / 5 + 1, 2 * c2 + (N - 2) / 5 + 1), c0 + 1), c1 + c2 + 1), (2 * M + 2 * N - 1) / 5 - 1), c2 + (M + N) / 5); c3 += 1) for (int c4 = max(max(max(max(c0 - c2, c3 - (M + 2) / 5), c0 - (M + 6) / 5 + 1), (c3 + 1) / 2), c1); c4 <= min(min(min(min(min(min(min((M + 2 * N + 1) / 5 - 1, (2 * N + 5 * c0 + 3) / 10), (2 * N + 5 * c3 + 2) / 10), c0 - c2 + N / 5 + 1), c2 + (N + 2) / 5), -c2 + c3 + (N - 1) / 5 + 1), c0), c1 + 1); c4 += 1) S1(c0, c1, c2, c3, c4, c2); cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-stride.in0000664000175000017500000000021412254313240021340 00000000000000[M] -> { S1[i0, i1] -> [0, i0, 0, 0, 0] : 7i1 = -2 + i0 and i0 >= 2 and i0 <= M } [M] -> { : } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/usvd_e_t.c0000664000175000017500000001510512254313240017461 00000000000000{ for (int c0 = 0; c0 <= 2; c0 += 1) { S1(c0, 0, 0); for (int c1 = 0; c1 <= 4; c1 += 1) S2(c0, c1, 0); } S1(3, 0, 0); for (int c1 = 0; c1 <= 4; c1 += 1) S2(3, c1, 0); for (int c1 = 7; c1 <= 11; c1 += 1) S8(3, c1, 0); S1(4, 0, 0); S2(4, 0, 0); S3(4, 0, 0); S5(4, 0, 0); for (int c1 = 1; c1 <= 4; c1 += 1) { S2(4, c1, 0); S5(4, c1, 0); } for (int c1 = 7; c1 <= 11; c1 += 1) S8(4, c1, 0); for (int c0 = 5; c0 <= 6; c0 += 1) { for (int c1 = -4; c1 < c0 - 8; c1 += 1) S6(c0, c1, 0); for (int c1 = c0 - 9; c1 < 0; c1 += 1) S7(c0, c1, 0); S3(c0, 0, 0); S7(c0, 0, 0); for (int c1 = 1; c1 < c0 - 3; c1 += 1) S4(c0, c1, -1); for (int c1 = c0 - 4; c1 <= 4; c1 += 1) S5(c0, c1, 0); for (int c1 = 7; c1 <= 11; c1 += 1) S8(c0, c1, 0); } for (int c1 = -4; c1 < -1; c1 += 1) S6(7, c1, 0); for (int c1 = -2; c1 < 0; c1 += 1) S7(7, c1, 0); S3(7, 0, 0); S7(7, 0, 0); for (int c1 = 1; c1 <= 3; c1 += 1) S4(7, c1, -1); for (int c1 = 3; c1 <= 4; c1 += 1) S5(7, c1, 0); S9(7, 4, 0); S10(7, 4, 0); S11(7, 4, 0); S21(7, 4, 0); S23(7, 4, 0); S11(7, 4, 1); S16(7, 4, 1); S17(7, 4, 1); for (int c2 = 2; c2 <= 4; c2 += 1) S11(7, 4, c2); S12(7, 5, 0); S21(7, 5, 0); S22(7, 5, 0); S23(7, 5, 0); S12(7, 5, 1); S16(7, 5, 1); S17(7, 5, 1); for (int c2 = 2; c2 <= 4; c2 += 1) S12(7, 5, c2); S21(7, 6, 0); S22(7, 6, 0); S23(7, 6, 0); for (int c1 = 7; c1 <= 8; c1 += 1) { S8(7, c1, 0); S21(7, c1, 0); S22(7, c1, 0); S23(7, c1, 0); } S8(7, 9, 0); S22(7, 9, 0); for (int c1 = 10; c1 <= 11; c1 += 1) S8(7, c1, 0); for (int c1 = -4; c1 < 0; c1 += 1) S6(8, c1, 0); S7(8, -1, 0); S3(8, 0, 0); S7(8, 0, 0); S19(8, 1, -2); S4(8, 1, -1); S19(8, 1, -1); S19(8, 1, 0); S15(8, 1, 4); S18(8, 1, 4); for (int c2 = -4; c2 < -2; c2 += 1) { S14(8, 2, c2); S20(8, 2, c2); } S14(8, 2, -2); S19(8, 2, -2); S20(8, 2, -2); S4(8, 2, -1); S14(8, 2, -1); S19(8, 2, -1); S20(8, 2, -1); S14(8, 2, 0); S19(8, 2, 0); S20(8, 2, 0); S15(8, 2, 4); S18(8, 2, 4); for (int c2 = -4; c2 < -1; c2 += 1) { S14(8, 3, c2); S20(8, 3, c2); } S4(8, 3, -1); S14(8, 3, -1); S20(8, 3, -1); S14(8, 3, 0); S20(8, 3, 0); S15(8, 3, 4); S18(8, 3, 4); for (int c2 = -4; c2 < -1; c2 += 1) { S14(8, 4, c2); S20(8, 4, c2); } S4(8, 4, -1); S14(8, 4, -1); S20(8, 4, -1); S5(8, 4, 0); S9(8, 4, 0); S10(8, 4, 0); S14(8, 4, 0); S20(8, 4, 0); S23(8, 4, 0); S13(8, 4, 1); S21(8, 4, 1); S23(8, 4, 1); S24(8, 4, 1); S13(8, 4, 2); S16(8, 4, 2); S17(8, 4, 2); S24(8, 4, 2); S13(8, 4, 3); S24(8, 4, 3); S13(8, 4, 4); S15(8, 4, 4); S23(8, 5, 0); S11(8, 5, 1); S21(8, 5, 1); S22(8, 5, 1); S23(8, 5, 1); S24(8, 5, 1); S11(8, 5, 2); S16(8, 5, 2); S17(8, 5, 2); S24(8, 5, 2); S11(8, 5, 3); S24(8, 5, 3); S11(8, 5, 4); S15(8, 5, 4); S23(8, 6, 0); S12(8, 6, 1); S21(8, 6, 1); S22(8, 6, 1); S23(8, 6, 1); S24(8, 6, 1); S12(8, 6, 2); S16(8, 6, 2); S17(8, 6, 2); S24(8, 6, 2); S12(8, 6, 3); S24(8, 6, 3); S12(8, 6, 4); for (int c1 = 7; c1 <= 8; c1 += 1) { S23(8, c1, 0); S21(8, c1, 1); S22(8, c1, 1); S23(8, c1, 1); for (int c2 = 1; c2 <= 3; c2 += 1) S24(8, c1, c2); } S22(8, 9, 1); S7(9, 0, 0); for (int c1 = 1; c1 <= 2; c1 += 1) { for (int c2 = -1; c2 <= 0; c2 += 1) S19(9, c1, c2); for (int c2 = 4; c2 <= 5; c2 += 1) { S15(9, c1, c2); S18(9, c1, c2); } } S20(9, 3, -4); for (int c2 = -3; c2 < -1; c2 += 1) { S14(9, 3, c2); S20(9, 3, c2); } for (int c2 = -1; c2 <= 0; c2 += 1) { S14(9, 3, c2); S19(9, 3, c2); S20(9, 3, c2); } for (int c2 = 4; c2 <= 5; c2 += 1) { S15(9, 3, c2); S18(9, 3, c2); } S20(9, 4, -4); for (int c2 = -3; c2 < 0; c2 += 1) { S14(9, 4, c2); S20(9, 4, c2); } S9(9, 4, 0); S10(9, 4, 0); S14(9, 4, 0); S20(9, 4, 0); for (int c2 = 0; c2 <= 1; c2 += 1) S23(9, 4, c2); S13(9, 4, 2); S21(9, 4, 2); S23(9, 4, 2); S24(9, 4, 2); S13(9, 4, 3); S16(9, 4, 3); S17(9, 4, 3); S24(9, 4, 3); S13(9, 4, 4); for (int c2 = 4; c2 <= 5; c2 += 1) { S15(9, 4, c2); S18(9, 4, c2); } for (int c2 = 0; c2 <= 1; c2 += 1) S23(9, 5, c2); S13(9, 5, 2); S21(9, 5, 2); S22(9, 5, 2); S23(9, 5, 2); S24(9, 5, 2); S13(9, 5, 3); S16(9, 5, 3); S17(9, 5, 3); S24(9, 5, 3); S13(9, 5, 4); for (int c2 = 4; c2 <= 5; c2 += 1) S15(9, 5, c2); for (int c2 = 0; c2 <= 1; c2 += 1) S23(9, 6, c2); S11(9, 6, 2); S21(9, 6, 2); S22(9, 6, 2); S23(9, 6, 2); S24(9, 6, 2); S11(9, 6, 3); S16(9, 6, 3); S17(9, 6, 3); S24(9, 6, 3); S11(9, 6, 4); for (int c2 = 0; c2 <= 1; c2 += 1) S23(9, 7, c2); S12(9, 7, 2); S21(9, 7, 2); S22(9, 7, 2); S23(9, 7, 2); S24(9, 7, 2); S12(9, 7, 3); S16(9, 7, 3); S17(9, 7, 3); S24(9, 7, 3); S12(9, 7, 4); for (int c2 = 0; c2 <= 1; c2 += 1) S23(9, 8, c2); S21(9, 8, 2); S22(9, 8, 2); S23(9, 8, 2); for (int c2 = 2; c2 <= 3; c2 += 1) S24(9, 8, c2); S22(9, 9, 2); for (int c1 = 1; c1 <= 3; c1 += 1) { S19(10, c1, 0); S26(10, c1, 3); S15(10, c1, 4); S18(10, c1, 4); S25(10, c1, 4); for (int c2 = 5; c2 <= 6; c2 += 1) { S15(10, c1, c2); S18(10, c1, c2); } } for (int c2 = -4; c2 < -2; c2 += 1) S20(10, 4, c2); for (int c2 = -2; c2 < 0; c2 += 1) { S14(10, 4, c2); S20(10, 4, c2); } S9(10, 4, 0); S10(10, 4, 0); S14(10, 4, 0); S19(10, 4, 0); S20(10, 4, 0); S13(10, 4, 3); S21(10, 4, 3); S24(10, 4, 3); S26(10, 4, 3); S13(10, 4, 4); S15(10, 4, 4); S16(10, 4, 4); S17(10, 4, 4); S18(10, 4, 4); S25(10, 4, 4); for (int c2 = 5; c2 <= 6; c2 += 1) { S15(10, 4, c2); S18(10, 4, c2); } S13(10, 5, 3); S21(10, 5, 3); S22(10, 5, 3); S24(10, 5, 3); S26(10, 5, 3); S13(10, 5, 4); S15(10, 5, 4); S16(10, 5, 4); S17(10, 5, 4); S18(10, 5, 4); S25(10, 5, 4); for (int c2 = 5; c2 <= 6; c2 += 1) { S15(10, 5, c2); S18(10, 5, c2); } S13(10, 6, 3); S21(10, 6, 3); S22(10, 6, 3); S24(10, 6, 3); S13(10, 6, 4); S16(10, 6, 4); S17(10, 6, 4); S11(10, 7, 3); S21(10, 7, 3); S22(10, 7, 3); S24(10, 7, 3); S11(10, 7, 4); S16(10, 7, 4); S17(10, 7, 4); S12(10, 8, 3); S21(10, 8, 3); S22(10, 8, 3); S24(10, 8, 3); S12(10, 8, 4); S16(10, 8, 4); S17(10, 8, 4); S22(10, 9, 3); for (int c0 = 11; c0 <= 14; c0 += 1) for (int c1 = 1; c1 <= 5; c1 += 1) { S26(c0, c1, 3); S25(c0, c1, 4); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-3.in0000664000175000017500000000015212254313240020542 00000000000000[M] -> { S1[i0] -> [i0, 0] : i0 >= 0 and i0 <= M } [M] -> { : M >= 0 } [M] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-fusion1.in0000664000175000017500000000031012254313240021427 00000000000000[M] -> { S1[i0] -> [0, i0, 0] : i0 >= 0 and i0 <= M; S3[i0] -> [2, i0, 0] : i0 >= 0 and i0 <= M; S2[i0] -> [1, i0, 0] : i0 >= 1 and i0 <= M } [M] -> { : M >= 1 } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/gauss.c0000664000175000017500000000032112254313240016765 00000000000000for (int c0 = 1; c0 < M; c0 += 1) for (int c1 = c0 + 1; c1 <= M; c1 += 1) { for (int c3 = c0 + 1; c3 <= M; c3 += 1) S2(c0, c3, c1); for (int c3 = 1; c3 < c0; c3 += 1) S1(c0, c3, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/largeur.c0000664000175000017500000000013112254313240017303 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) for (int c1 = 1; c1 <= c0; c1 += 1) S1(c1, c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/dot.c0000664000175000017500000000022612254313240016435 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) S1(0, c1); for (int c0 = 1; c0 <= N; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S2(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/merge.in0000664000175000017500000000021112254313240017124 00000000000000{ S3[i0] -> [i0, 2] : i0 >= 0 and i0 <= 10; S2[i0] -> [i0, 1] : i0 >= 2 and i0 <= 10; S1[0] -> [0, 0] } { : } { [i, j] -> atomic[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/vivien.c0000664000175000017500000000465512254313240017161 00000000000000{ for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1) S1(c0 - 1); for (int c0 = 2; c0 <= min(n + 29, 2 * n); c0 += 1) { if (2 * n >= c0 + 1 && c0 >= 3) S4(c0 - c0 / 2 - 1, c0 / 2 + 1); if (2 * n >= c0 + 1 && c0 + 2 >= 2 * n) { for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } else if (2 * n >= c0 + 3 && c0 >= 5) { S4(c0 - c0 / 2 - 2, c0 / 2 + 2); for (int c2 = 1; c2 < (c0 + 1) / 2 - 1; c2 += 1) S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2); } for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(n - c0, -1); c1 += 1) { S4(-c1, c0 + c1); S6(-c1 + 2, c0 + c1 - 2); for (int c2 = 1; c2 <= -c1; c2 += 1) S5(-c1 + 1, c0 + c1 - 1, c2); } if (2 * n >= c0 + 3 && c0 >= n + 2) { S6(-n + c0 + 1, n - 1); for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } if (2 * n >= c0 + 1 && c0 >= n + 3) { S6(-n + c0, n); } else { if (n + 1 >= c0 && c0 >= 5) { S6(2, c0 - 2); S1(c0 - 1); } else if (c0 <= 4 && c0 >= 3 && n + 1 >= c0) S1(c0 - 1); if (n + 1 >= c0 && c0 >= 3) S6(1, c0 - 1); } if (c0 >= n + 3) { S1(c0 - 1); } else if (c0 == n + 2 && n >= 3) { S6(2, n); S1(n + 1); } if (c0 == 2) { S1(1); } else if (c0 == 4 && n == 2) S1(3); if (c0 % 2 == 0) S3(c0 / 2); for (int c1 = max(-n + c0, 1); c1 < (c0 + 1) / 2; c1 += 1) S2(c0 - c1, c1); } for (int c0 = n + 30; c0 <= 2 * n; c0 += 1) { if (2 * n >= c0 + 1) { S4(c0 - c0 / 2 - 1, c0 / 2 + 1); if (c0 + 2 >= 2 * n) { for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } else { S4(c0 - c0 / 2 - 2, c0 / 2 + 2); for (int c2 = 1; c2 < (c0 + 1) / 2 - 1; c2 += 1) S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2); } for (int c1 = -c0 + c0 / 2 + 3; c1 <= n - c0; c1 += 1) { S4(-c1, c0 + c1); S6(-c1 + 2, c0 + c1 - 2); for (int c2 = 1; c2 <= -c1; c2 += 1) S5(-c1 + 1, c0 + c1 - 1, c2); } if (2 * n >= c0 + 3) { S6(-n + c0 + 1, n - 1); for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } S6(-n + c0, n); } if (c0 % 2 == 0) S3(c0 / 2); for (int c1 = -n + c0; c1 < (c0 + 1) / 2; c1 += 1) S2(c0 - c1, c1); } for (int c0 = max(2 * n + 1, -27 * n + 2); c0 <= n + 29; c0 += 1) S1(c0 - 1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam1.c0000664000175000017500000000044212254313240021276 00000000000000for (int c1 = -99; c1 <= 100; c1 += 1) { if (c1 <= 0) S1(1, -c1 + 1); for (int c3 = max(-2 * c1 + 3, 1); c3 <= min(-2 * c1 + 199, 199); c3 += 2) { S2((2 * c1 + c3 - 1) / 2, (c3 + 1) / 2); S1((2 * c1 + c3 + 1) / 2, (c3 + 1) / 2); } if (c1 >= 1) S2(100, -c1 + 101); } cloog-0.18.2/isl/test_inputs/codegen/cloog/backtrack.c0000664000175000017500000000000712254313240017571 00000000000000S1(0); cloog-0.18.2/isl/test_inputs/codegen/cloog/1point-2.c0000664000175000017500000000002212254313240017212 00000000000000S1(2 * M, N + 2); cloog-0.18.2/isl/test_inputs/codegen/cloog/yosr2.in0000664000175000017500000000053312254313240017112 00000000000000[M] -> { S3[i0, i1, i2] -> [i0] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M and i2 >= 1 and i2 <= -1 + i0; S4[i0, i1] -> [i1] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M; S1[i0, i1] -> [i0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + i0; S2[i0] -> [0] : i0 >= 1 and i0 <= M } [M] -> { : M >= 2 } [M] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/walters.in0000664000175000017500000000142712254313240017520 00000000000000{ S2[i, div36, div37, div38] -> [i, div36, k, div38, 1] : 3div37 = 2 + i and 3k = 2 + i and i >= 1 and i <= 10 and 3div36 >= -2 + i and 3div38 <= 1 + i and 3div38 >= -1 + i and 3div36 <= i; S1[i, div36, div37, div38] -> [i, j, div37, div38, 0] : 3j = i and 3div36 = i and i >= 3 and i <= 10 and 3div37 >= i and 3div38 <= 1 + i and 3div37 <= 2 + i and 3div38 >= -1 + i; S3[i, div36, div37, div38] -> [i, div36, div37, l, 2] : 3l = 1 + i and 3div38 = 1 + i and i <= 10 and i >= 2 and 3div36 >= -2 + i and 3div37 <= 2 + i and 3div36 <= i and 3div37 >= i; S4[i, div36, div37, div38] -> [i, div36, div37, div38, 3] : i >= 1 and i <= 10 and 3div36 <= i and 3div36 >= -2 + i and 3div37 <= 2 + i and 3div37 >= i and 3div38 <= 1 + i and 3div38 >= -1 + i } { : } { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/mxm-shared.in0000664000175000017500000000451412254313240020104 00000000000000[N, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { S1[g0 + t1, i1] -> [-g1 + i1, t1, t0, t1] : (exists (e0 = [(-g1)/128], e1 = [(128b1 + 31g1)/4096], e2 = [(t0 - i1)/16], e3 = [(-120b0 - g0)/128]: g4 = 0 and g2 = 8b0 and g3 = 128b1 and 128e0 = -g1 and 4096e1 = 128b1 + 31g1 and 16e2 = t0 - i1 and 128e3 = -120b0 - g0 and g1 >= 128b1 and t1 <= -1 + N - g0 and g0 >= 8b0 and i1 <= -1 + N and b0 <= 15 and b0 >= 0 and b1 <= 31 and b1 >= 0 and i1 <= 127 + g1 and t1 >= 0 and t1 <= 7 and i1 >= g1 and t0 >= 0 and t0 <= 15)) or (exists (e0 = [(-g1)/128], e1 = [(128b1 + 31g1)/4096], e2 = [(t0 - i1)/16], e3 = [(-120b0 - g0)/128]: g4 = 0 and g2 = 8b0 and g3 = 128b1 and 128e0 = -g1 and 4096e1 = 128b1 + 31g1 and 16e2 = t0 - i1 and 128e3 = -120b0 - g0 and g1 >= 128b1 and t1 <= -1 + N - g0 and g0 >= 8b0 and i1 <= -1 + N and b0 <= 15 and b0 >= 0 and b1 <= 31 and b1 >= 0 and i1 <= 127 + g1 and t1 >= 0 and t1 <= 7 and i1 >= g1 and t0 >= 0 and t0 <= 15 and N >= 1)) or (exists (e0 = [(-g1)/128], e1 = [(128b1 + 31g1)/4096], e2 = [(t0 - i1)/16], e3 = [(-120b0 - g0)/128]: g4 = 0 and g2 = 8b0 and g3 = 128b1 and 128e0 = -g1 and 4096e1 = 128b1 + 31g1 and 16e2 = t0 - i1 and 128e3 = -120b0 - g0 and g0 >= 8b0 and t1 <= -1 + N - g0 and g1 >= 128b1 and i1 <= -1 + N and N >= 1 and t1 <= 7 and b1 <= 31 and b1 >= 0 and b0 <= 15 and b0 >= 0 and t0 <= 15 and i1 <= 127 + g1 and i1 >= g1 and t1 >= 0 and t0 >= 0)); S1[g0 + t1, i1] -> [-g1 + i1, t1, t0, t1] : exists (e0 = [(g4)/4], e1 = [(-g1)/128], e2 = [(128b1 + 31g1)/4096], e3 = [(t0 - i1)/16], e4 = [(-120b0 - g0)/128]: g3 = 128b1 and g2 = 8b0 and 4e0 = g4 and 128e1 = -g1 and 4096e2 = 128b1 + 31g1 and 16e3 = t0 - i1 and 128e4 = -120b0 - g0 and g0 >= 8b0 and t1 <= -1 + N - g0 and g1 >= 128b1 and i1 <= -1 + N and g4 <= -1 + N and t1 <= 7 and b1 <= 31 and b1 >= 0 and b0 <= 15 and b0 >= 0 and g4 >= 0 and i1 <= 127 + g1 and i1 >= g1 and t1 >= 0 and t0 >= 0 and t0 <= 15) } [N, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { : exists (e0 = [(g0)/8], e1 = [(-128b1 + g1)/4096], e2 = [(8b0 - g0)/128]: g2 = 8b0 and g3 = 128b1 and 8e0 = g0 and 4096e1 = -128b1 + g1 and 128e2 = 8b0 - g0 and b0 >= 0 and g4 <= -1 + N and b0 <= 15 and g1 <= -1 + N and g4 >= 0 and b1 <= 31 and g0 <= -1 + N and g1 >= 128b1 and b1 >= 0 and g0 >= 8b0 and t0 >= 0 and t0 <= 15 and t1 >= 0 and t1 <= 15) } [N, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/pouchet.in0000664000175000017500000000063312254313240017504 00000000000000[Ny] -> { S1[i0, i1, 2i0, -2i0 + 2i1, i4] -> [i0 + i1, i1, i4, 2i0, -2i0 + 2i1, i4] : i0 >= 0 and i0 <= 1 and i1 >= 1 + i0 and 2i1 <= -1 + Ny + 2i0 and i4 >= 1 and i4 <= 2; S2[i0, i1, 2i0, -1 - 2i0 + 2i1, i4] -> [i0 + i1, i1, i4, 2i0, -2i0 + 2i1, 1 + i4] : i0 >= 0 and i0 <= 1 and i1 >= 1 + i0 and 2i1 <= Ny + 2i0 and i4 >= 1 and i4 <= 2 } [Ny] -> { : } [Ny] -> { [i, j, k, l, m, n] -> separate[x] : x >= 2 } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali4.c0000664000175000017500000000030012254313240021365 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S1(c1, c3); for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S2(c1, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/singleton.c0000664000175000017500000000002412254313240017645 00000000000000{ S2(); S1(); } cloog-0.18.2/isl/test_inputs/codegen/cloog/logopar.in0000664000175000017500000000035712254313240017503 00000000000000[m, n] -> { S1[i0, i1] -> [i0, i1, 0] : i0 >= 1 and i1 <= m and i1 >= -1 + i0; S2[i0, i1] -> [i0, i1, 1] : i0 >= 2 and i0 <= n and i1 >= 0 and i1 <= n } [m, n] -> { : n <= m and m >= 0 and n >= 2 } [m, n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-loechner3.c0000664000175000017500000000025312254313240021547 00000000000000for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 2; c3 <= M + c1; c3 += 1) for (int c5 = max(-c1 + c3, 1); c5 <= min(M, c3 - 1); c5 += 1) S1(c1, c5, c3 - c5); cloog-0.18.2/isl/test_inputs/codegen/cloog/lineality-2-1-2.c0000664000175000017500000000040312254313240020272 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) { for (int c1 = 1; c1 <= min(M, c0 + 1); c1 += 1) S1(c0, c1); if (c0 + 1 >= M) { S2(c0, c0 + 2); } else { S1(c0, c0 + 2); S2(c0, c0 + 2); } for (int c1 = c0 + 3; c1 <= M; c1 += 1) S1(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/yosr.in0000664000175000017500000000036112254313240017027 00000000000000[n] -> { S2[i0, i1, i2] -> [i2] : i0 >= 1 and i0 <= -1 + n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 + i0 and i2 <= n; S1[i0, i1] -> [i0] : i0 >= 1 and i0 <= -1 + n and i1 >= 1 + i0 and i1 <= n } [n] -> { : } [n] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-loechner4.c0000664000175000017500000000033012254313240021544 00000000000000for (int c1 = 2; c1 <= 2 * M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) for (int c5 = 1; c5 <= M; c5 += 1) for (int c7 = max(1, -M + c1); c7 <= min(c1 - 1, M); c7 += 1) S1(c5, c3, c7, c1 - c7); cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam4.in0000664000175000017500000000051112254313240021462 00000000000000[M] -> { S1[i0, i1, i2] -> [0, i0 + i1 + i2, 0, -i2, 0, i2, 0] : i0 >= 1 and i0 <= -1 + M and i1 >= 0 and i2 >= 0 and i2 <= -1 + M - i1; S2[i0, i1, i2] -> [0, i0 + i2, 0, i1 - i2, 1, i2, 0] : i0 >= 1 and i0 <= -1 + M and i1 >= 0 and i2 >= 1 + i1 and i2 <= -1 + M } [M] -> { : } [M] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-fusion1.c0000664000175000017500000000022712254313240021252 00000000000000{ for (int c1 = 0; c1 <= M; c1 += 1) S1(c1); for (int c1 = 1; c1 <= M; c1 += 1) S2(c1); for (int c1 = 0; c1 <= M; c1 += 1) S3(c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/iftest.c0000664000175000017500000000005512254313240017145 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/guide.in0000664000175000017500000000031712254313240017131 00000000000000[M, N] -> { S1[i0] -> [i0, 0] : (i0 >= 1 and i0 <= N and i0 <= 2M) or (i0 >= 1 and i0 <= N and i0 >= M); S2[i0] -> [i0, 1] : i0 >= 1 + N and i0 <= 2N } [M, N] -> { : } [M, N] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/constbound.in0000664000175000017500000000044112254313240020210 00000000000000{ S2[i0, i1, i2] -> [i0, 1, i1, i2] : i1 >= 0 and i1 <= 9999 and i2 >= 0 and i2 <= i1 and i1 >= 25 + 50i0 and i1 <= 49 + 50i0; S1[i0, i1, i2] -> [i0, 0, i1, i2] : i1 >= 0 and i1 <= 9999 and i2 >= 0 and i2 <= i1 and i1 >= 50i0 and i1 <= 24 + 50i0 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-jacobi3.in0000664000175000017500000000052112254313240021361 00000000000000[M, N] -> { S2[i0, i1, i2] -> [0, 1 + 2i0, 1, i1, 0, i2, 0] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N; S1[i0, i1, i2] -> [0, 2i0, 0, i1, 0, i2, 0] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N } [M, N] -> { : } [M, N] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/gesced2.c0000664000175000017500000000106212254313240017162 00000000000000{ for (int c0 = 1; c0 <= 4; c0 += 1) for (int c1 = 5; c1 < M - 9; c1 += 1) S1(c0, c1); for (int c0 = 5; c0 < M - 9; c0 += 1) { for (int c1 = -c0 + 1; c1 <= 4; c1 += 1) S2(c0 + c1, c0); for (int c1 = 5; c1 <= min(M - 10, M - c0); c1 += 1) { S1(c0, c1); S2(c0 + c1, c0); } for (int c1 = M - c0 + 1; c1 < M - 9; c1 += 1) S1(c0, c1); for (int c1 = M - 9; c1 <= M - c0; c1 += 1) S2(c0 + c1, c0); } for (int c0 = M - 9; c0 <= M; c0 += 1) for (int c1 = 5; c1 < M - 9; c1 += 1) S1(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/stride.c0000664000175000017500000000020412254313240017135 00000000000000{ for (int c0 = 3; c0 <= 24; c0 += 3) S2(c0, c0 / 3); S1(25); for (int c0 = 27; c0 <= 100; c0 += 3) S2(c0, c0 / 3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam5.in0000664000175000017500000000046112254313240021467 00000000000000[M] -> { S2[i0, i1] -> [1, i0, 0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S1[i0, i1] -> [0, i0, 0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S3[i0, i1] -> [2, i0, 0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M } [M] -> { : } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/yosr2.c0000664000175000017500000000047712254313240016735 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) S2(c1); for (int c0 = 2; c0 <= M; c0 += 1) { for (int c2 = c0 + 1; c2 <= M; c2 += 1) for (int c3 = 1; c3 < c0; c3 += 1) S3(c0, c2, c3); for (int c1 = 1; c1 < c0; c1 += 1) S4(c1, c0); for (int c2 = 1; c2 < c0; c2 += 1) S1(c0, c2); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-fusion2.c0000664000175000017500000000043112254313240021250 00000000000000if (N >= 1) { for (int c3 = 1; c3 <= M; c3 += 1) S1(1, c3); for (int c1 = 2; c1 <= N; c1 += 1) { for (int c3 = 1; c3 <= M; c3 += 1) S2(c1 - 1, c3); for (int c3 = 1; c3 <= M; c3 += 1) S1(c1, c3); } for (int c3 = 1; c3 <= M; c3 += 1) S2(N, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/walters2.c0000664000175000017500000000036412254313240017415 00000000000000{ for (int c1 = 0; c1 <= 51; c1 += 1) S2(0, c1); for (int c0 = 1; c0 <= 24; c0 += 1) { S2(c0, 0); for (int c1 = 1; c1 <= 50; c1 += 1) S1(c0, c1); S2(c0, 51); } for (int c1 = 0; c1 <= 51; c1 += 1) S2(25, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/mod3.c0000664000175000017500000000025512254313240016513 00000000000000for (int c0 = max(32 * h0 - 1991, 0); c0 <= min(999, 32 * h0 + 31); c0 += 1) if ((32 * h0 - c0 + 32) % 64 >= 1) for (int c1 = 0; c1 <= 999; c1 += 1) S1(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-liu-zhuge1.in0000664000175000017500000000052112254313240022041 00000000000000[M, N] -> { S2[i0, i1] -> [0, 3i0 + i1, 0, i1, 0] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N; S3[i0, i1] -> [0, 3i0 + i1, 1, i1, 0] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N; S1[i0, i1] -> [0, -4 + 3i0 + i1, 0, i1, 0] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N } [M, N] -> { : } [M, N] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/iftest.in0000664000175000017500000000024112254313240017326 00000000000000[m, n] -> { S1[i0] -> [i0, 0] : (i0 >= 1 and i0 <= n and i0 >= m) or (i0 >= 1 and i0 <= n and i0 <= 2m) } [m, n] -> { : } [m, n] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/thomasset.in0000664000175000017500000000045112254313240020042 00000000000000[n] -> { S2[i0, i1, 0, i3, i4] -> [i3 + i4, -1 + i0] : i0 <= n and i1 <= n and i1 >= 1 and i0 >= 1 and 3i4 <= i1 and 3i4 >= -2 + i1 and 3i3 <= n and 3i3 >= -2 + n; S1[i0, i1] -> [i1, 0] : i0 <= n and i0 >= 1 and 3i1 <= -1 + i0 and 3i1 >= -3 + i0 } [n] -> { : } [n] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-psinv.in0000664000175000017500000000074212254313240021614 00000000000000[M, N, O] -> { S1[i0, i1, i2] -> [0, i0, 0, -1 + 2i1, 0, i2, 0] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S2[i0, i1, i2] -> [0, i0, 0, -1 + 2i1, 0, i2, 1] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S3[i0, i1, i2] -> [0, i0, 0, 2i1, 1, i2, 0] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M } [M, N, O] -> { : } [M, N, O] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/durbin_e_s.in0000664000175000017500000000074212254313240020147 00000000000000{ S5[i0, i1, 3] -> [i0, i1, 3, 4] : i1 <= -1 + i0 and i0 <= 10 and i1 >= 1; S8[i0, 0, 3] -> [i0, 0, 3, 7] : i0 >= 1 and i0 <= 9; S2[i0, -7, 0] -> [i0, -7, 0, 1] : i0 >= 2 and i0 <= 10; S3[i0, i1, 1] -> [i0, i1, 1, 2] : i1 >= -7 and i0 <= 10 and i1 <= -9 + i0; S1[10, i1, 4] -> [10, i1, 4, 0] : i1 >= 1 and i1 <= 10; S7[1, 0, 0] -> [1, 0, 0, 6]; S4[1, 0, 0] -> [1, 0, 0, 3]; S6[i0, -9 + i0, 2] -> [i0, -9 + i0, 2, 5] : i0 >= 2 and i0 <= 10 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/durbin_e_s.c0000664000175000017500000000072112254313240017760 00000000000000{ S4(1, 0, 0); S7(1, 0, 0); S8(1, 0, 3); for (int c0 = 2; c0 <= 9; c0 += 1) { S2(c0, -7, 0); for (int c1 = -7; c1 < c0 - 8; c1 += 1) S3(c0, c1, 1); S6(c0, c0 - 9, 2); S8(c0, 0, 3); for (int c1 = 1; c1 < c0; c1 += 1) S5(c0, c1, 3); } S2(10, -7, 0); for (int c1 = -7; c1 <= 1; c1 += 1) S3(10, c1, 1); S6(10, 1, 2); for (int c1 = 1; c1 <= 9; c1 += 1) { S5(10, c1, 3); S1(10, c1, 4); } S1(10, 10, 4); } cloog-0.18.2/isl/test_inputs/codegen/cloog/min-2-1.c0000664000175000017500000000026112254313240016726 00000000000000for (int c0 = 1; c0 <= N; c0 += 1) for (int c1 = 0; c1 <= min(min(N - c0, c0), M); c1 += 1) for (int c2 = 0; c2 <= min(min(M, N - c0), c0); c2 += 1) S1(c0, c1, c2); cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_basic1.c0000664000175000017500000000006512254313240017670 00000000000000for (int c0 = 0; c0 <= M; c0 += 2) S1(c0, c0 / 2); cloog-0.18.2/isl/test_inputs/codegen/cloog/square+triangle-1-1-2-3.in0000664000175000017500000000031312254313240021724 00000000000000[M] -> { S2[i0, i1] -> [i0, i1, 1] : i1 >= 2 and i1 <= i0 and i0 <= M; S1[i0, i1] -> [i0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M } [M] -> { : M >= 1 } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-rprj3.c0000664000175000017500000000156012254313240021330 00000000000000if (M >= 2 && N >= 3) for (int c1 = 2; c1 < O; c1 += 1) { for (int c5 = 2; c5 <= M; c5 += 1) S1(c1, 2, c5); for (int c3 = 3; c3 < N; c3 += 1) { for (int c5 = 2; c5 <= M; c5 += 1) S2(c1, c3 - 1, c5); if (M >= 3) { S4(c1, c3 - 1, 2); for (int c5 = 2; c5 < M - 1; c5 += 1) { S3(c1, c3 - 1, c5); S5(c1, c3 - 1, c5); S4(c1, c3 - 1, c5 + 1); } S3(c1, c3 - 1, M - 1); S5(c1, c3 - 1, M - 1); } for (int c5 = 2; c5 <= M; c5 += 1) S1(c1, c3, c5); } for (int c5 = 2; c5 <= M; c5 += 1) S2(c1, N - 1, c5); if (M >= 3) { S4(c1, N - 1, 2); for (int c5 = 2; c5 < M - 1; c5 += 1) { S3(c1, N - 1, c5); S5(c1, N - 1, c5); S4(c1, N - 1, c5 + 1); } S3(c1, N - 1, M - 1); S5(c1, N - 1, M - 1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/wavefront.in0000664000175000017500000000021712254313240020046 00000000000000[n, m] -> { S1[i0, i1] -> [i0 + i1, i0] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= m } [n, m] -> { : } [n, m] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam4.c0000664000175000017500000000062612254313240021305 00000000000000for (int c1 = 1; c1 < 2 * M - 1; c1 += 1) { for (int c3 = max(-c1 + 1, -M + 1); c3 < 0; c3 += 1) { for (int c7 = max(-M + c1 + 1, 1); c7 <= min(M - 1, c1 + c3); c7 += 1) S1(c7, c1 + c3 - c7, -c3); for (int c5 = max(-M + c1 + 1, -c3); c5 < min(M, c1); c5 += 1) S2(c1 - c5, c3 + c5, c5); } for (int c7 = max(1, -M + c1 + 1); c7 <= min(c1, M - 1); c7 += 1) S1(c7, c1 - c7, 0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali2.in0000664000175000017500000000034212254313240021555 00000000000000[M] -> { S2[i0, i1] -> [1, i0, 1, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S1[i0, i1] -> [0, i0, 0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M } [M] -> { : } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/README0000664000175000017500000000012712254313240016363 00000000000000The tests in this directory have been adapted from the corresponding CLooG test cases. cloog-0.18.2/isl/test_inputs/codegen/cloog/vasilache.in0000664000175000017500000000147612254313240020002 00000000000000[M, N] -> { S4[i0, i1] -> [3, i0, 0, i1, 0, 0, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N; S1[] -> [0, 0, 0, 0, 0, 0, 0, 0, 0]; S6[i0, i1, i2, i3] -> [4, i0, 0, i1, 0, i2, 0, 1 + i3, 0] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N and i3 >= 0 and i3 <= -1 + N and i3 >= 32i2 and i3 <= 31 + 32i2; S7[i0, i1, i2, i3] -> [4, i0, 0, i1, 0, i2, 0, i3, 1] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N and i3 >= 0 and i3 <= -1 + N and i3 >= 32i2 and i3 <= 31 + 32i2; S5[i0, i1] -> [3, i0, 0, i1, 1, 0, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N; S2[] -> [1, 0, 0, 0, 0, 0, 0, 0, 0]; S8[] -> [5, 0, 0, 0, 0, 0, 0, 0, 0]; S3[] -> [2, 0, 0, 0, 0, 0, 0, 0, 0] : M >= 79 } [M, N] -> { : M <= 3 and N >= 100 } [M, N] -> { [i, j, k, l, m, n, o, p, q] -> separate[x] : x >= 7 } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-loechner4.in0000664000175000017500000000035212254313240021734 00000000000000[M] -> { S1[i0, i1, i2, i3] -> [0, i2 + i3, 0, i1, 0, i0, 0, i2, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= M and i3 >= 1 and i3 <= M } [M] -> { : } [M] -> { [i, j, k, l, m, n, o, p, q] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/forwardsub-2-1-2-3.c0000664000175000017500000000030212254313240020614 00000000000000{ S3(1, 0); for (int c2 = 2; c2 <= M; c2 += 1) S1(1, 1, c2); for (int c0 = 2; c0 <= M; c0 += 1) { S4(c0, 0); for (int c2 = c0 + 1; c2 <= M; c2 += 1) S2(c0, 1, c2); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/gesced.in0000664000175000017500000000042012254313240017261 00000000000000[M, N] -> { S3[i0, i1] -> [2N + i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S2[i0, i1] -> [N + i1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S1[i0] -> [i0] : i0 >= 1 and i0 <= N } [M, N] -> { : N <= M and M >= 2 and N >= 2 } [M, N] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/forwardsub-1-1-2.in0000664000175000017500000000043512254313240020646 00000000000000[M] -> { S2[i0, i1] -> [i0, i1, 1] : i1 <= -1 + i0 and i1 >= 2 and i0 <= M; S4[i0, i0] -> [i0, i0, 3] : M >= 3 and i0 <= M and i0 >= 2; S1[i0, 1] -> [i0, 1, 0] : M >= 3 and i0 <= M and i0 >= 2; S3[1, 1] -> [1, 1, 2] : M >= 3 } [M] -> { : M >= 3 } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_basic2.in0000664000175000017500000000032612254313240020055 00000000000000[n] -> { S2[i0, i1] -> [i0, j, 1] : 4j = i0 and 4i1 = i0 and i0 >= 1 and i0 <= n; S1[i0, i1] -> [i0, j, 0] : 2j = i0 and 2i1 = i0 and i0 >= 1 and i0 <= n } [n] -> { : n >= 2 } [n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali6.in0000664000175000017500000000054212254313240021563 00000000000000[M, N] -> { S2[i0, i1, i2] -> [0, 1 + 2i0, 1, i1, 0, i2, 0] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N; S1[i0, i1, i2] -> [0, 2i0, 0, i1, 0, i2, 0] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + N } [M, N] -> { : M >= 1 and N >= 1 } [M, N] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/0D-3.c0000664000175000017500000000000612254313240016246 00000000000000S1(); cloog-0.18.2/isl/test_inputs/codegen/cloog/mode.in0000664000175000017500000000033212254313240016755 00000000000000[M, N] -> { S1[i0, i1] -> [i0, i1, 0] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= i0; S2[i0, i1] -> [i0, i1, 1] : i0 >= 0 and i0 <= M and i1 >= 0 and i1 <= N } [M, N] -> { : } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/logopar.c0000664000175000017500000000064012254313240017312 00000000000000{ for (int c1 = 0; c1 <= m; c1 += 1) S1(1, c1); for (int c0 = 2; c0 <= n; c0 += 1) { for (int c1 = 0; c1 < c0 - 1; c1 += 1) S2(c0, c1); for (int c1 = c0 - 1; c1 <= n; c1 += 1) { S1(c0, c1); S2(c0, c1); } for (int c1 = n + 1; c1 <= m; c1 += 1) S1(c0, c1); } for (int c0 = n + 1; c0 <= m + 1; c0 += 1) for (int c1 = c0 - 1; c1 <= m; c1 += 1) S1(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-resid.in0000664000175000017500000000074212254313240021563 00000000000000[M, N, O] -> { S1[i0, i1, i2] -> [0, i0, 0, -1 + 2i1, 0, i2, 0] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S2[i0, i1, i2] -> [0, i0, 0, -1 + 2i1, 0, i2, 1] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S3[i0, i1, i2] -> [0, i0, 0, 2i1, 1, i2, 0] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M } [M, N, O] -> { : } [M, N, O] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/tiling.c0000664000175000017500000000016512254313240017137 00000000000000for (int c0 = 0; c0 <= n / 10; c0 += 1) for (int c1 = 10 * c0; c1 <= min(10 * c0 + 9, n); c1 += 1) S1(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/mod.in0000664000175000017500000000021412254313240016607 00000000000000{ S1[i0] -> [i0, 0] : exists (e0 = [(1 + i0)/3]: i0 >= 0 and i0 <= 3 and 3e0 <= i0 and 3e0 >= -1 + i0) } { : } { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/youcefn.in0000664000175000017500000000040212254313240017477 00000000000000[n, m] -> { S3[i0, n] -> [i0, n, 2] : i0 >= 1 and i0 <= m; S2[i0, i1] -> [i0, i1, 1] : i0 >= 1 and i0 <= n and i1 >= i0 and i1 <= n; S1[i0, i0] -> [i0, i0, 0] : i0 >= 1 and i0 <= n } [n, m] -> { : n >= 2 and m >= n } [n, m] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/gauss.in0000664000175000017500000000042412254313240017155 00000000000000[M] -> { S1[i0, i1, i2] -> [i0, i2] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + i0 and i2 >= 1 + i0 and i2 <= M; S2[i0, i1, i2] -> [i0, i2] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M and i2 >= 1 + i0 and i2 <= M } [M] -> { : } [M] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-bastoul3.in0000664000175000017500000000025312254313240021605 00000000000000{ S1[i0, i1, i2] -> [i0, i1, k, 0] : 2k = i0 - i1 and 2i2 = i0 - i1 and i1 >= 1 and i1 <= 3 and i1 <= -2 + i0 and i1 >= -6 + i0 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/walters.c0000664000175000017500000000063212254313240017331 00000000000000{ S2(1, 0, 1, 0); S4(1, 0, 1, 0); S3(2, 0, 1, 1); S4(2, 0, 1, 1); for (int c0 = 3; c0 <= 10; c0 += 1) { if (c0 % 3 == 0) { S1(c0, c0 / 3, c0 / 3, c0 / 3); } else if ((c0 - 1) % 3 == 0) { S2(c0, (c0 - 1) / 3, (c0 + 2) / 3, (c0 - 1) / 3); } else S3(c0, (c0 - 2) / 3, (c0 + 1) / 3, (c0 + 1) / 3); S4(c0, c0 / 3, (c0 - 1) / 3 + 1, c0 - (c0 - 1) / 3 - c0 / 3 - 1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/lex.in0000664000175000017500000000020412254313240016617 00000000000000{ S2[i0] -> [i0, -1, 0] : i0 >= 0 and i0 <= 10; S1[i0] -> [i0, 0, 0] : i0 >= 0 and i0 <= 10 } { : } { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/0D-2.c0000664000175000017500000000002412254313240016245 00000000000000if (M >= 0) S1(); cloog-0.18.2/isl/test_inputs/codegen/cloog/min-4-1.in0000664000175000017500000000022012254313240017107 00000000000000[M, N, O] -> { S1[i0] -> [i0, 0] : i0 >= -M and i0 >= -N and i0 <= N and i0 <= O } [M, N, O] -> { : } [M, N, O] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/lux.c0000664000175000017500000000032712254313240016461 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) { for (int c1 = 1; c1 < c0; c1 += 1) for (int c2 = c1 + 1; c2 <= M; c2 += 1) S2(c0, c1, c2, c2, c0); for (int c3 = c0 + 1; c3 <= M; c3 += 1) S1(c0, c0, M, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/mod4.in0000664000175000017500000000117212254313240016677 00000000000000{ S2[j, div41, div42, 2, mod6_a] -> [j, div41, k, 2, m, 1] : 3k = 1 + j and 3div42 = 1 + j and 3m = -2 + j and 3mod6_a = -2 + j and 3div41 >= 1 + j and 3div41 <= 2 + j and j >= 1 and j <= 10; S1[j, div41, div42, 2, mod6_a] -> [j, div41, div42, 2, m, 0] : 3m = -2 + j and 3mod6_a = -2 + j and j >= 1 and j <= 10 and 3div41 >= j and 3div42 >= -1 + j and 3div42 <= 1 + j and 3div41 <= 2 + j; S3[j, div41, div42, 2, mod6_a] -> [j, div41, div42, 2, m, 2] : 3m = -2 + j and 3mod6_a = -2 + j and j >= 1 and j <= 10 and 3div41 >= j and 3div42 >= -1 + j and 3div42 <= 1 + j and 3div41 <= 2 + j } { : } { [i, j, k, l, m, n] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/block3.c0000664000175000017500000000010512254313240017020 00000000000000{ S1(); for (int c0 = 0; c0 <= 1; c0 += 1) S3(c0); S2(); } cloog-0.18.2/isl/test_inputs/codegen/cloog/donotsimp.in0000664000175000017500000000035512254313240020052 00000000000000[M] -> { S2[i0, i1] -> [0, i0, 0, i1, 0] : i0 >= 1 and i0 <= 10 and i1 >= 11 and i1 <= M; S1[i0, i1] -> [0, i0, 0, i1, 0] : i0 >= 1 and i0 <= 10 and i1 >= 1 and i1 <= i0 } [M] -> { : M >= 20 } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-cholesky2.in0000664000175000017500000000052012254313240021751 00000000000000[M] -> { S3[i0, i1, i2] -> [0, -1 + i0 + i1 + i2, 1, i1, 1, i2, 0] : i0 >= 1 and i1 <= M and i2 >= 1 + i0 and i2 <= i1; S2[i0, i1] -> [0, -2 + 2i0 + i1, 2, i1, 0, 0, 0] : i0 >= 1 and i1 >= 1 + i0 and i1 <= M; S1[i0] -> [0, -1 + 3i0, 0, 0, 0, 0, 0] : i0 >= 1 and i0 <= M } [M] -> { : } [M] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/1point-1.c0000664000175000017500000000001612254313240017214 00000000000000S1(2 * M, M); cloog-0.18.2/isl/test_inputs/codegen/cloog/levenshtein-1-2-3.c0000664000175000017500000000137612254313240020637 00000000000000{ S1(0, 0); for (int c0 = 1; c0 <= N; c0 += 1) { S2(c0, 0); for (int c1 = 1; c1 < c0; c1 += 1) S6(c0, c1); S3(c0, c0); } S7(N + 1, 0); for (int c1 = 1; c1 <= N; c1 += 1) { S6(N + 1, c1); S8(N + 1, c1); } for (int c0 = N + 2; c0 < 2 * M - N - 1; c0 += 1) { S7(c0, -N + (N + c0 + 1) / 2 - 1); if ((-N + c0) % 2 == 0) { S5(c0, (-N + c0) / 2); S8(c0, (-N + c0) / 2); } for (int c1 = -N + (N + c0) / 2 + 1; c1 < (N + c0 + 1) / 2; c1 += 1) { S6(c0, c1); S8(c0, c1); } if ((-N + c0) % 2 == 0) { S4(c0, (N + c0) / 2); S8(c0, (N + c0) / 2); } } for (int c0 = 2 * M - N - 1; c0 < 2 * M - 1; c0 += 1) for (int c1 = -M + c0 + 1; c1 < M; c1 += 1) S6(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/logo.in0000664000175000017500000000031212254313240016767 00000000000000[M] -> { S2[i0, i1] -> [i0, i1, 1] : i0 >= 2 and i0 <= 6 and i1 >= 0 and i1 <= 4; S1[i0, i1] -> [i0, i1, 0] : i0 >= 1 and i1 <= 7 and i1 >= -1 + i0 } [M] -> { : } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-QR.in0000664000175000017500000000167612254313240020405 00000000000000[M, N] -> { S1[i0] -> [0, i0, 5, 0, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N; S9[i0, i1, i2] -> [0, 2 + i0, 0, i1, 3, i2, 0] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N and i2 >= i0 and i2 <= -1 + M; S10[i0] -> [0, 1 + i0, 4, 0, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N; S3[i0] -> [0, 1 + i0, 2, 0, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N; S6[i0, i1] -> [0, 2 + i0, 0, i1, 0, 0, 0] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N; S8[i0, i1] -> [0, 2 + i0, 0, i1, 2, 0, 0] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N; S2[i0, i1] -> [0, 1 + i0, 1, i1, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N and i1 >= i0 and i1 <= -1 + M; S4[i0, i1] -> [0, 1 + i0, 3, i1, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N and i1 >= i0 and i1 <= -1 + M; S7[i0, i1, i2] -> [0, 2 + i0, 0, i1, 1, i2, 0] : i0 >= 0 and i1 >= 1 + i0 and i1 <= -1 + N and i2 >= i0 and i2 <= -1 + M; S5[i0] -> [0, 1 + i0, 6, 0, 0, 0, 0] : i0 >= 0 and i0 <= -1 + N } [M, N] -> { : } [M, N] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-liu-zhuge1.c0000664000175000017500000000125712254313240021664 00000000000000if (N >= 0 && M >= 0) for (int c1 = -4; c1 <= 3 * M + N; c1 += 1) { if (c1 >= 3 * M) { S2(M, -3 * M + c1); } else if (3 * floord(c1 - 2, 3) + 2 == c1 && c1 >= -1 && 3 * M >= c1 + 4) S1((c1 + 4) / 3, 0); for (int c3 = max(-3 * M + c1 + 3, c1 + 3 * floord(-c1 - 1, 3) + 3); c3 <= min(N - 1, c1); c3 += 3) { S2((c1 - c3) / 3, c3); S1((c1 - c3 + 3) / 3, c3 + 1); } if (N + 3 * floord(-N + c1, 3) == c1 && 3 * M + N >= c1 + 3 && c1 >= N) { S2((-N + c1) / 3, N); } else if (N >= c1 + 4) S1(0, c1 + 4); for (int c3 = max(-3 * M + c1, c1 + 3 * floord(-c1 - 1, 3) + 3); c3 <= min(N, c1); c3 += 3) S3((c1 - c3) / 3, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/lu2.c0000664000175000017500000000033312254313240016350 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) { for (int c1 = 2; c1 <= n; c1 += 1) for (int c2 = 1; c2 < min(c0, c1); c2 += 1) S2(c0, c1, c2, c1, c0); for (int c3 = c0 + 1; c3 <= n; c3 += 1) S1(c0, n, c0, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali5.c0000664000175000017500000000060012254313240021371 00000000000000for (int c1 = 3; c1 < 2 * M; c1 += 1) { for (int c3 = c1 / 2 + 2; c3 <= M; c3 += 1) for (int c7 = c1 / 2 + 1; c7 < min(c1, c3); c7 += 1) S1(c7, c1 - c7, c3); for (int c3 = max(1, -M + c1); c3 < (c1 + 1) / 2; c3 += 1) S2(c1 - c3, c3); for (int c3 = c1 / 2 + 2; c3 <= M; c3 += 1) for (int c7 = c1 / 2 + 1; c7 < min(c1, c3); c7 += 1) S3(c7, c1 - c7, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/lex.c0000664000175000017500000000007412254313240016440 00000000000000for (int c0 = 0; c0 <= 10; c0 += 1) { S2(c0); S1(c0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-two.in0000664000175000017500000000024512254313240020663 00000000000000{ S1[i0, i1, i2] -> [i0, j, k, 0] : 2i1 = 3 - i0 and 2j = 3 - i0 and 2k = 9 + i0 and 2i2 = 9 + i0 and i0 >= 0 and i0 <= 1 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/equality2.c0000664000175000017500000000070212254313240017565 00000000000000for (int c0 = 1; c0 <= 10000; c0 += 1) for (int c1 = 1000; c1 <= 1016; c1 += 1) for (int c2 = 1; c2 < 2 * c1 - 1998; c2 += 1) { if (c2 + 1999 == 2 * c1 && c1 <= 1008) S2(c0, c1, 2 * c1 - 1999, 1, c0, 2 * c1 - 1000, 1, 2, c0, c1 - 499, 2 * c1 - 1999, c0, 2 * c1 - 1999, c1 - 999, c1 - 999); if (c1 % 2 == 0 && c2 == 1) S1(c0, c1, 1, 2, c0, (c1 + 2) / 2, c1 - 999, c0, c1 - 999, (c1 - 998) / 2, (c1 - 998) / 2); } cloog-0.18.2/isl/test_inputs/codegen/cloog/lineality-2-1-2.in0000664000175000017500000000030612254313240020460 00000000000000[M] -> { S2[i0, 2 + i0] -> [i0, 2 + i0, 1] : i0 >= 1 and i0 <= M; S1[i0, i1] -> [i0, i1, 0] : i0 >= 1 and i1 >= 1 and i0 <= M and i1 <= M } [M] -> { : M >= 2 } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam5.c0000664000175000017500000000043612254313240021305 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S1(c1, c3); for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S2(c1, c3); for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S3(c1, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/stride3.in0000664000175000017500000000017312254313240017411 00000000000000[m, n] -> { S1[i0] -> [50i0, 0] : i0 >= 1 and i0 <= n and i0 >= m } [m, n] -> { : } [m, n] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/ex1.c0000664000175000017500000000054212254313240016345 00000000000000{ for (int c0 = 0; c0 <= 14; c0 += 1) for (int c1 = 0; c1 < n - 14; c1 += 1) S1(c0, c1); for (int c0 = 15; c0 <= n; c0 += 1) { for (int c1 = 0; c1 <= 9; c1 += 1) S1(c0, c1); for (int c1 = 10; c1 < n - 14; c1 += 1) { S1(c0, c1); S2(c0, c1); } for (int c1 = n - 14; c1 <= n; c1 += 1) S2(c0, c1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/unroll2.in0000664000175000017500000000017012254313240017426 00000000000000[n] -> { S1[i] -> [i, 0] : i >= n and i <= 1 + n and n <= 9 and i >= 0 } [n] -> { : } [n] -> { [i, j] -> unroll[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.c0000664000175000017500000000105412254313240021300 00000000000000for (int c1 = 5; c1 <= 5 * M; c1 += 1) { for (int c3 = max(2, floord(-M + c1, 4)); c3 < min((c1 + 1) / 3 - 2, M); c3 += 1) for (int c5 = max(-M - c3 + (M + c1) / 2 - 2, 1); c5 < min(-2 * c3 + (c1 + c3) / 2 - 2, c3); c5 += 1) S1(c1 - 2 * c3 - 2 * c5 - 5, c3, c5); for (int c3 = max(1, floord(-M + c1, 4)); c3 < (c1 + 1) / 5; c3 += 1) S2(c1 - 4 * c3 - 3, c3); if (c1 % 5 == 0) S4(c1 / 5); for (int c3 = max(-((c1 - 1) % 3) + 3, -3 * M - c1 + 3 * ((M + c1) / 2) + 1); c3 < (c1 + 1) / 5; c3 += 3) S3((c1 - 2 * c3 - 1) / 3, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/forwardsub-3-1-2.c0000664000175000017500000000055712254313240020471 00000000000000{ S3(2, 1); S1(3, 1); for (int c0 = 4; c0 <= M + 1; c0 += 1) { S1(c0, 1); for (int c1 = 2; c1 < (c0 + 1) / 2; c1 += 1) S2(c0, c1); if (c0 % 2 == 0) S4(c0, c0 / 2); } for (int c0 = M + 2; c0 <= 2 * M; c0 += 1) { for (int c1 = -M + c0; c1 < (c0 + 1) / 2; c1 += 1) S2(c0, c1); if (c0 % 2 == 0) S4(c0, c0 / 2); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/gesced2.in0000664000175000017500000000033712254313240017352 00000000000000[M] -> { S1[i0, i1] -> [i0, i1] : i0 >= 1 and i0 <= M and i1 >= 5 and i1 <= -10 + M; S2[i0, i1] -> [i1, i0 - i1] : i0 >= 1 and i0 <= M and i1 >= 5 and i1 <= -10 + M } [M] -> { : M >= 16 } [M] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/mod.c0000664000175000017500000000011012254313240016416 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) if ((c0 + 1) % 3 >= 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/multi-stride.in0000664000175000017500000000025312254313240020455 00000000000000{ S1[i0, i1, i2] -> [i0, j, k, 0] : 2i1 = -1 + i0 and 2j = -1 + i0 and 6k = -2 + i0 and 6i2 = -2 + i0 and i0 >= 0 and i0 <= 100 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/cholesky.in0000664000175000017500000000106212254313240017653 00000000000000[n] -> { S1[i0] -> [i0, 1, 0, 0, 0, 0] : i0 >= 1 and i0 <= n; S2[i0, i1] -> [i0, 2, i1, 1, 0, 0] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= -1 + i0; S6[i0, i1] -> [i0, 4, i1, 3, 0, 0] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S3[i0] -> [i0, 3, 0, 0, 0, 0] : i0 >= 1 and i0 <= n; S4[i0, i1] -> [i0, 4, i1, 1, 0, 0] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S5[i0, i1, i2] -> [i0, 4, i1, 2, i2, 1] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 and i2 <= -1 + i0 } [n] -> { : } [n] -> { [i, j, k, l, m, n'] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam1.in0000664000175000017500000000035212254313240021462 00000000000000{ S2[i0, i1] -> [0, 1 + i0 - i1, 0, -1 + 2i1, 1] : i0 >= 1 and i0 <= 100 and i1 >= 1 and i1 <= 100; S1[i0, i1] -> [0, i0 - i1, 0, 2i1, 0] : i0 >= 1 and i0 <= 100 and i1 >= 1 and i1 <= 100 } { : } { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/byu98-1-2-3.in0000664000175000017500000000030212254313240017443 00000000000000{ S1[i0, i1] -> [i0, i1, 0] : i1 >= 6 - i0 and i0 >= 2 and i1 >= 3 and i1 <= 6 and i1 >= -1 + i0; S2[i0, 9 - i0] -> [i0, 9 - i0, 1] : i0 <= 8 and i0 >= 4 } { : } { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/dot2.c0000664000175000017500000000042312254313240016516 00000000000000{ for (int c0 = 1; c0 <= min(N, M); c0 += 1) { S1(c0); for (int c1 = 1; c1 <= M; c1 += 1) S2(c0, c1); } for (int c0 = N + 1; c0 <= M; c0 += 1) S1(c0); for (int c0 = M + 1; c0 <= N; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S2(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/orc.in0000664000175000017500000000074412254313240016623 00000000000000{ S2[i0, i1] -> [0, 1 + 3i0, 2i1] : i0 >= 0 and i0 <= 2 and i1 >= 0 and i1 <= 11 - i0; S4[i0] -> [0, 2 + 3i0, 0] : i0 >= 0 and i0 <= 2; S5[i0] -> [2, 3i0, 0] : i0 >= 0 and i0 <= 14; S6[i0, i1] -> [2, 1 + 3i0, i1] : i0 >= 0 and i0 <= 14 and i1 >= 0 and i1 <= 9; S1[i0] -> [0, 3i0, 0] : i0 >= 0 and i0 <= 2; S7[i0] -> [2, 2 + 3i0, 0] : i0 >= 0 and i0 <= 14; S3[i0, i1] -> [0, 1 + 3i0, 1 + 2i1] : i0 >= 0 and i0 <= 2 and i1 >= 0 and i1 <= 11 - i0 } { : } { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/wavefront.c0000664000175000017500000000017412254313240017664 00000000000000for (int c0 = 2; c0 <= n + m; c0 += 1) for (int c1 = max(-m + c0, 1); c1 <= min(n, c0 - 1); c1 += 1) S1(c1, c0 - c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/mxm-shared.c0000664000175000017500000000043012254313240017711 00000000000000if (g4 == 0 && t1 <= 7 && N >= g0 + t1 + 1) { for (int c0 = t0; c0 <= min(N - g1 - 1, 127); c0 += 16) S1(g0 + t1, g1 + c0); } else if (g4 % 4 == 0 && N >= g0 + t1 + 1 && t1 <= 7 && g4 >= 4) for (int c0 = t0; c0 <= min(N - g1 - 1, 127); c0 += 16) S1(g0 + t1, g1 + c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/backtrack.in0000664000175000017500000000006512254313240017761 00000000000000{ S1[0] -> [0, 0] } { : } { [i, j] -> atomic[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/multi-stride2.c0000664000175000017500000000011312254313240020346 00000000000000for (int c0 = 5; c0 <= 100; c0 += 6) S1(c0, (c0 - 1) / 2, (c0 - 2) / 3); cloog-0.18.2/isl/test_inputs/codegen/cloog/classen.in0000664000175000017500000000306612254313240017470 00000000000000[m] -> { S2[i0, i1, 1 + i0, i1, 2 + i0 - i1, i1, 3 + i0 - i1, i1] -> [i0, 0, i1, 2, 2 + i0 - i1, i1, 1] : m >= 1 and i0 <= -3 + 2m and i0 >= 0 and i1 <= 1 + i0 and i1 <= m and i1 >= 3 - m + i0 and i1 >= 1; S4[i0, i1, 2 + i0, 1 + i1, 2 + i0 - i1, i1, 3 + i0 - i1, 1 + i1] -> [i0, 0, i1, 2, 2 + i0 - i1, i1, 1] : m >= 1 and i0 <= -4 + 2m and i0 >= 0 and i1 <= 1 + i0 and i1 <= -1 + m and i1 >= 3 - m + i0 and i1 >= 1; S5[i0, i1, 1 + i0, i1, 2 + i0 - i1, i1, 3 + i0 - i1, i1] -> [1 + i0, 0, i1, 0, 2 + i0 - i1, i1, 1] : m >= 1 and i0 <= -3 + 2m and i0 >= 0 and i1 <= 1 + i0 and i1 <= m and i1 >= 3 - m + i0 and i1 >= 1; S7[i0, i1, 2 + i0, 1 + i1, 2 + i0 - i1, i1, 3 + i0 - i1, 1 + i1] -> [1 + i0, 0, 1 + i1, 0, 2 + i0 - i1, i1, 1] : m >= 1 and i0 <= -4 + 2m and i0 >= 0 and i1 <= 1 + i0 and i1 <= -1 + m and i1 >= 3 - m + i0 and i1 >= 1; S6[i0, i1, 1 + i0, 1 + i1, 2 + i0 - i1, i1, 2 + i0 - i1, 1 + i1] -> [1 + i0, 0, 1 + i1, 0, 2 + i0 - i1, i1, 1] : m >= 1 and i0 <= -3 + 2m and i0 >= 0 and i1 <= 1 + i0 and i1 <= -1 + m and i1 >= 2 - m + i0 and i1 >= 1; S3[i0, i1, 1 + i0, 1 + i1, 2 + i0 - i1, i1, 2 + i0 - i1, 1 + i1] -> [i0, 0, i1, 2, 2 + i0 - i1, i1, 1] : m >= 1 and i0 <= -3 + 2m and i0 >= 0 and i1 <= 1 + i0 and i1 <= -1 + m and i1 >= 2 - m + i0 and i1 >= 1; S8[i0, i1] -> [i0, 1, 0, 0, 0, 0, 0] : i0 <= -2 + 2m and i0 >= 0 and i1 <= 1 + i0 and i1 <= m and i1 >= 2 - m + i0 and i1 >= 1; S1[i0, i1, 2 + i0 - i1, i1] -> [i0, 0, i1, 1, 0, 0, 0] : m >= 1 and i1 >= 2 - m + i0 and i1 <= 1 + i0 and i1 <= m and i1 >= 1 } [m] -> { : m >= 0 } [m] -> { [i, j, k, l, m', n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/dot.in0000664000175000017500000000033312254313240016620 00000000000000[M, N] -> { S1[0, i1] -> [0, i1, 0] : i1 <= M and N >= 0 and i1 >= 1; S2[i0, i1] -> [i0, i1, 1] : i0 >= 1 and i1 <= M and i0 <= N and i1 >= 1 } [M, N] -> { : M >= 1 and N >= 1 } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-stride2.c0000664000175000017500000000007312254313240021241 00000000000000for (int c1 = 2; c1 <= M; c1 += 7) S1(c1, (c1 - 2) / 7); cloog-0.18.2/isl/test_inputs/codegen/cloog/block2.in0000664000175000017500000000026712254313240017214 00000000000000{ S1[i0, 1] -> [i0, 1, 6] : i0 >= 0 and i0 <= 9; S2[i0, 1] -> [i0, 1, 11] : i0 >= 0 and i0 <= 9; S3[i0, 1] -> [i0, 1, 8] : i0 >= 0 and i0 <= 9 } { : } { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali1.c0000664000175000017500000000034212254313240021370 00000000000000for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 < 2 * N; c3 += 1) { for (int c5 = max(1, -N + c3); c5 < (c3 + 1) / 2; c5 += 1) S1(c1, c3 - c5, c5); if ((c3 - 1) % 2 == 0) S2(c1, (c3 + 1) / 2); } cloog-0.18.2/isl/test_inputs/codegen/cloog/gesced3.c0000664000175000017500000000035112254313240017163 00000000000000{ for (int c0 = M + 1; c0 <= 2 * M; c0 += 1) S1(-M + c0); for (int c0 = 2 * M + 1; c0 <= M + N; c0 += 1) { S2(-2 * M + c0); S1(-M + c0); } for (int c0 = M + N + 1; c0 <= 2 * M + N; c0 += 1) S2(-2 * M + c0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/4-param.c0000664000175000017500000000053312254313240017111 00000000000000{ for (int c0 = m; c0 <= min(p - 1, n); c0 += 1) S1(c0); for (int c0 = p; c0 <= min(q, m - 1); c0 += 1) S2(c0); for (int c0 = max(m, p); c0 <= min(q, n); c0 += 1) { S1(c0); S2(c0); } for (int c0 = max(max(m, p), q + 1); c0 <= n; c0 += 1) S1(c0); for (int c0 = max(max(m, n + 1), p); c0 <= q; c0 += 1) S2(c0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam3.in0000664000175000017500000000066212254313240021470 00000000000000[M] -> { S1[i0, i1, i2] -> [0, 5 + i0 + 2i1 + 2i2, 0, i1, 0, i2, 0] : i0 <= M and i1 <= -1 + i0 and i2 >= 1 and i2 <= -1 + i1; S3[i0, i1] -> [0, 1 + 3i0 + 2i1, 2, i1, 0, 0, 0] : i0 <= M and i1 >= 1 and i1 <= -1 + i0; S2[i0, i1] -> [0, 3 + i0 + 4i1, 1, i1, 1, 0, 0] : i0 <= M and i1 >= 1 and i1 <= -1 + i0; S4[i0] -> [0, 5i0, 2, 0, 0, 0, 0] : i0 >= 1 and i0 <= M } [M] -> { : M >= 1 } [M] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/infinite2.c0000664000175000017500000000024312254313240017535 00000000000000{ for (int c0 = 1; c0 <= N; c0 += 1) { S1(c0); for (int c1 = 1; c1 <= M; c1 += 1) S2(c0, c1); } for (int c0 = N + 1; 1; c0 += 1) S1(c0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/classen.c0000664000175000017500000000646412254313240017311 00000000000000{ if (m == 1) { S1(0, 1, 1, 1); S8(0, 1); } else if (m >= 2) { S1(0, 1, 1, 1); S3(0, 1, 1, 2, 1, 1, 1, 2); S4(0, 1, 2, 2, 1, 1, 2, 2); S2(0, 1, 1, 1, 1, 1, 2, 1); S8(0, 1); } for (int c0 = 1; c0 < 2 * m - 3; c0 += 1) { if (c0 + 1 == m) { S5(m - 2, 1, m - 1, 1, m - 1, 1, m, 1); S1(m - 1, 1, m, 1); S3(m - 1, 1, m, 2, m, 1, m, 2); } else if (c0 >= m) { S5(c0 - 1, -m + c0 + 2, c0, -m + c0 + 2, m - 1, -m + c0 + 2, m, -m + c0 + 2); S6(c0 - 1, -m + c0 + 1, c0, -m + c0 + 2, m, -m + c0 + 1, m, -m + c0 + 2); S1(c0, -m + c0 + 2, m, -m + c0 + 2); S3(c0, -m + c0 + 2, c0 + 1, -m + c0 + 3, m, -m + c0 + 2, m, -m + c0 + 3); } else { S5(c0 - 1, 1, c0, 1, c0, 1, c0 + 1, 1); S1(c0, 1, c0 + 1, 1); S3(c0, 1, c0 + 1, 2, c0 + 1, 1, c0 + 1, 2); S4(c0, 1, c0 + 2, 2, c0 + 1, 1, c0 + 2, 2); S2(c0, 1, c0 + 1, 1, c0 + 1, 1, c0 + 2, 1); } for (int c2 = max(2, -m + c0 + 3); c2 <= min(c0, m - 1); c2 += 1) { S5(c0 - 1, c2, c0, c2, c0 - c2 + 1, c2, c0 - c2 + 2, c2); S7(c0 - 1, c2 - 1, c0 + 1, c2, c0 - c2 + 2, c2 - 1, c0 - c2 + 3, c2); S6(c0 - 1, c2 - 1, c0, c2, c0 - c2 + 2, c2 - 1, c0 - c2 + 2, c2); S1(c0, c2, c0 - c2 + 2, c2); S3(c0, c2, c0 + 1, c2 + 1, c0 - c2 + 2, c2, c0 - c2 + 2, c2 + 1); S4(c0, c2, c0 + 2, c2 + 1, c0 - c2 + 2, c2, c0 - c2 + 3, c2 + 1); S2(c0, c2, c0 + 1, c2, c0 - c2 + 2, c2, c0 - c2 + 3, c2); } if (c0 + 1 == m) { S7(m - 2, m - 1, m, m, 1, m - 1, 2, m); S6(m - 2, m - 1, m - 1, m, 1, m - 1, 1, m); S1(m - 1, m, 1, m); S2(m - 1, m, m, m, 1, m, 2, m); } else if (c0 >= m) { S5(c0 - 1, m, c0, m, -m + c0 + 1, m, -m + c0 + 2, m); S7(c0 - 1, m - 1, c0 + 1, m, -m + c0 + 2, m - 1, -m + c0 + 3, m); S6(c0 - 1, m - 1, c0, m, -m + c0 + 2, m - 1, -m + c0 + 2, m); S1(c0, m, -m + c0 + 2, m); S2(c0, m, c0 + 1, m, -m + c0 + 2, m, -m + c0 + 3, m); } else { S7(c0 - 1, c0, c0 + 1, c0 + 1, 1, c0, 2, c0 + 1); S6(c0 - 1, c0, c0, c0 + 1, 1, c0, 1, c0 + 1); S1(c0, c0 + 1, 1, c0 + 1); S3(c0, c0 + 1, c0 + 1, c0 + 2, 1, c0 + 1, 1, c0 + 2); S4(c0, c0 + 1, c0 + 2, c0 + 2, 1, c0 + 1, 2, c0 + 2); S2(c0, c0 + 1, c0 + 1, c0 + 1, 1, c0 + 1, 2, c0 + 1); } for (int c8 = max(1, -m + c0 + 2); c8 <= min(c0 + 1, m); c8 += 1) S8(c0, c8); } if (m >= 2) { if (m >= 3) { S5(2 * m - 4, m - 1, 2 * m - 3, m - 1, m - 1, m - 1, m, m - 1); S6(2 * m - 4, m - 2, 2 * m - 3, m - 1, m, m - 2, m, m - 1); S1(2 * m - 3, m - 1, m, m - 1); S3(2 * m - 3, m - 1, 2 * m - 2, m, m, m - 1, m, m); S5(2 * m - 4, m, 2 * m - 3, m, m - 2, m, m - 1, m); S7(2 * m - 4, m - 1, 2 * m - 2, m, m - 1, m - 1, m, m); S6(2 * m - 4, m - 1, 2 * m - 3, m, m - 1, m - 1, m - 1, m); S1(2 * m - 3, m, m - 1, m); } else { S5(0, 1, 1, 1, 1, 1, 2, 1); S1(1, 1, 2, 1); S3(1, 1, 2, 2, 2, 1, 2, 2); S7(0, 1, 2, 2, 1, 1, 2, 2); S6(0, 1, 1, 2, 1, 1, 1, 2); S1(1, 2, 1, 2); } S2(2 * m - 3, m, 2 * m - 2, m, m - 1, m, m, m); for (int c8 = m - 1; c8 <= m; c8 += 1) S8(2 * m - 3, c8); S5(2 * m - 3, m, 2 * m - 2, m, m - 1, m, m, m); S6(2 * m - 3, m - 1, 2 * m - 2, m, m, m - 1, m, m); S1(2 * m - 2, m, m, m); S8(2 * m - 2, m); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/gesced.c0000664000175000017500000000071612254313240017105 00000000000000{ for (int c0 = 1; c0 <= N; c0 += 1) S1(c0); for (int c0 = N + 1; c0 <= 2 * N; c0 += 1) for (int c1 = 1; c1 <= N; c1 += 1) S2(c1, -N + c0); for (int c0 = 2 * N + 1; c0 <= M + N; c0 += 1) { for (int c1 = 1; c1 <= N; c1 += 1) S3(c1, -2 * N + c0); for (int c1 = 1; c1 <= N; c1 += 1) S2(c1, -N + c0); } for (int c0 = M + N + 1; c0 <= M + 2 * N; c0 += 1) for (int c1 = 1; c1 <= N; c1 += 1) S3(c1, -2 * N + c0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/min-1-1.c0000664000175000017500000000015612254313240016730 00000000000000for (int c0 = 1; c0 <= N; c0 += 1) for (int c1 = 0; c1 <= min(min(N - c0, c0), M); c1 += 1) S1(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/orc.c0000664000175000017500000000043612254313240016435 00000000000000{ for (int c1 = 0; c1 <= 2; c1 += 1) { S1(c1); for (int c2 = 0; c2 <= -c1 + 11; c2 += 1) { S2(c1, c2); S3(c1, c2); } S4(c1); } for (int c1 = 0; c1 <= 14; c1 += 1) { S5(c1); for (int c2 = 0; c2 <= 9; c2 += 1) S6(c1, c2); S7(c1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-5.c0000664000175000017500000000003112254313240020354 00000000000000S1(1, floord(M + 1, 2)); cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali1.in0000664000175000017500000000043712254313240021561 00000000000000[M, N] -> { S1[i0, i1, i2] -> [0, i0, 0, i1 + i2, 0, i2, 0] : i0 >= 1 and i0 <= M and i1 <= N and i2 >= 1 and i2 <= -1 + i1; S2[i0, i1] -> [0, i0, 0, -1 + 2i1, 1, 0, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= N } [M, N] -> { : } [M, N] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/cholesky.c0000664000175000017500000000037512254313240017475 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) { S1(c0); for (int c2 = 1; c2 < c0; c2 += 1) S2(c0, c2); S3(c0); for (int c2 = c0 + 1; c2 <= n; c2 += 1) { S4(c0, c2); for (int c4 = 1; c4 < c0; c4 += 1) S5(c0, c2, c4); S6(c0, c2); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/cholesky2.c0000664000175000017500000000102412254313240017547 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) { S1(c1); for (int c2 = c1 + 1; c2 <= M; c2 += 1) S4(c1, c2); } for (int c0 = 1; c0 < 3 * M - 1; c0 += 3) { S3((c0 + 2) / 3); if (3 * M >= c0 + 8) { for (int c1 = (c0 + 5) / 3; c1 <= M; c1 += 1) { S6((c0 + 2) / 3, c1); for (int c4 = (c0 + 5) / 3; c4 < c1; c4 += 1) S5(c4, c1, (c0 + 2) / 3); } } else if (c0 + 5 == 3 * M) S6(M - 1, M); for (int c1 = (c0 + 5) / 3; c1 <= M; c1 += 1) S2(c1, (c0 + 2) / 3); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/christian.in0000664000175000017500000000033612254313240020021 00000000000000[N] -> { S1[i0, i1] -> [i0 - i1] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N; S2[i0, i1] -> [1 + i0 - i1] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N } [N] -> { : } [N] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/merge.c0000664000175000017500000000014412254313240016745 00000000000000{ S1(0); for (int c0 = 0; c0 <= 10; c0 += 1) { if (c0 >= 2) S2(c0); S3(c0); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-two.c0000664000175000017500000000001512254313240020472 00000000000000S1(1, 1, 5); cloog-0.18.2/isl/test_inputs/codegen/cloog/cholesky2.in0000664000175000017500000000100512254313240017732 00000000000000[M] -> { S2[i0, i1] -> [3i1, i0, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + i0; S4[i0, i1] -> [0, i0, i1] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M; S1[i0] -> [0, i0, 0] : i0 >= 1 and i0 <= M; S6[i0, i1] -> [-1 + 3i0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M; S3[i0] -> [-2 + 3i0, 0, 0] : i0 >= 1 and i0 <= M; S5[i0, i1, i2] -> [-1 + 3i2, i1, i2] : i0 >= 1 and i0 <= M and i1 >= 1 + i0 and i1 <= M and i2 >= 1 and i2 <= -1 + i0 } [M] -> { : } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/constant.c0000664000175000017500000000053012254313240017476 00000000000000{ for (int c1 = 0; c1 <= min(1023, M + 1024); c1 += 1) { S1(c1); S3(c1); } for (int c1 = max(M + 1025, 0); c1 <= 1023; c1 += 1) { S2(c1); S3(c1); } for (int c0 = 0; c0 <= min(1023, M + 1024); c0 += 1) { S4(c0); S6(c0); } for (int c0 = max(M + 1025, 0); c0 <= 1023; c0 += 1) { S5(c0); S6(c0); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/constbound.c0000664000175000017500000000042612254313240020027 00000000000000for (int c0 = 0; c0 <= 199; c0 += 1) { for (int c2 = 50 * c0; c2 <= 50 * c0 + 24; c2 += 1) for (int c3 = 0; c3 <= c2; c3 += 1) S1(c0, c2, c3); for (int c2 = 50 * c0 + 25; c2 <= 50 * c0 + 49; c2 += 1) for (int c3 = 0; c3 <= c2; c3 += 1) S2(c0, c2, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/pouchet.c0000664000175000017500000000075212254313240017322 00000000000000for (int c0 = 1; c0 <= floord(Ny, 2) + 2; c0 += 1) for (int c1 = max(c0 / 2 + 1, c0 - 1); c1 <= min(c0, (Ny + 2 * c0) / 4); c1 += 1) if (Ny + 2 * c0 >= 4 * c1 + 1) { for (int c2 = 1; c2 <= 2; c2 += 1) { S1(c0 - c1, c1, 2 * c0 - 2 * c1, -2 * c0 + 4 * c1, c2); S2(c0 - c1, c1, 2 * c0 - 2 * c1, -2 * c0 + 4 * c1 - 1, c2); } } else for (int c2 = 1; c2 <= 2; c2 += 1) S2((-Ny + 2 * c0) / 4, (Ny + 2 * c0) / 4, (-Ny + 2 * c0) / 2, Ny - 1, c2); cloog-0.18.2/isl/test_inputs/codegen/cloog/forwardsub-1-1-2.c0000664000175000017500000000022312254313240020455 00000000000000{ S3(1, 1); for (int c0 = 2; c0 <= M; c0 += 1) { S1(c0, 1); for (int c1 = 2; c1 < c0; c1 += 1) S2(c0, c1); S4(c0, c0); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/1point-2.in0000664000175000017500000000015012254313240017400 00000000000000[M, N] -> { S1[2M, 2 + N] -> [2M, 2 + N, 0] } [M, N] -> { : } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/0D-3.in0000664000175000017500000000012412254313240016433 00000000000000[M] -> { S1[] -> [0] : M >= 0 } [M] -> { : M >= 0 } [M] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/unroll.in0000664000175000017500000000013712254313240017347 00000000000000[n] -> { S1[i] -> [i, 0] : i >= 0 and i <= 10 } [n] -> { : } [n] -> { [i, j] -> unroll[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/param-split.c0000664000175000017500000000015312254313240020077 00000000000000for (int c0 = 0; c0 <= (M >= 0 ? M : 0); c0 += 1) { if (M >= c0) S1(c0); if (c0 == 0) S2(0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-tang-xue1.in0000664000175000017500000000042412254313240021662 00000000000000{ S1[i0, i1, i2, i3] -> [0, 2i0, 0, 2i0 + 2i1, 0, 2i0 + i2, 0, 2i0 + 2i1 + i3, 0] : i3 <= 4 - 2i0 - 2i1 and i3 >= i2 and i2 <= 9 - 2i0 and i2 >= 0 and i2 >= 1 - 2i0 and i3 <= 1 + i2 and i2 <= 1 and i3 >= 1 - 2i0 - 2i1 } { : } { [i, j, k, l, m, n, o, p, q] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-psinv.c0000664000175000017500000000041112254313240021421 00000000000000for (int c1 = 2; c1 < O; c1 += 1) for (int c3 = 3; c3 < 2 * N - 2; c3 += 2) { for (int c5 = 1; c5 <= M; c5 += 1) { S1(c1, (c3 + 1) / 2, c5); S2(c1, (c3 + 1) / 2, c5); } for (int c5 = 2; c5 < M; c5 += 1) S3(c1, (c3 + 1) / 2, c5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/otl.in0000664000175000017500000000221312254313240016627 00000000000000[M, N] -> { S1[i0, i1, i2, i3, i4, i2] -> [i0, i1, i2, i3, i4, i2] : 5i0 <= -7 + 2M + 2N and i4 >= i0 - i2 and 10i2 >= -2 - N + 5i0 and i2 >= -1 + i0 - i1 and 2i4 >= i0 and i0 >= 1 and i1 >= 1 and 2i1 >= i0 and i2 >= 0 and 5i2 >= 1 - M - N + 5i0 and 5i4 >= -1 - M + 5i0 and i3 >= i0 and 5i1 >= -2 - M + 5i0 and i3 >= 1 and 5i3 >= -3 - N + 5i1 + 5i2 and 5i2 <= 4 + N + 5i0 - 5i1 and i4 >= 1 and i2 <= i0 and 5i3 >= -2N + 10i1 and 5i1 <= -5 + M + 2N and 10i1 <= 1 + 2N + 5i0 and 5i2 >= -1 - N + 5i1 and i4 >= i1 and i3 >= i1 and i2 <= i1 and i1 <= i0 and 5i4 <= 4 + N - 5i2 + 5i3 and 5i4 <= 5 + N + 5i0 - 5i2 and 5i3 >= -2 - N + 10i2 and 5i2 <= -2 + M + N and 10i2 <= 3 + N + 5i0 and N >= 4 and i4 >= i2 and i3 >= i2 and M >= 3 and i4 <= i0 and 5i3 <= -6 + 2M + 2N and i4 >= -1 - i2 + i3 and 5i3 <= 3 + N + 10i2 and i3 <= 1 + i1 + i2 and i4 <= 1 + i1 and 2i4 >= i3 and 5i4 <= 2 + N + 5i2 and i3 <= 1 + 2i1 and i4 <= i3 and 5i3 <= M + N + 5i2 and 5i4 >= -2 - M + 5i3 and 10i4 <= 3 + 2N + 5i0 and i3 <= 1 + i0 and 5i3 <= 3 + M + 5i1 and 5i4 <= -4 + M + 2N and 10i4 <= 2 + 2N + 5i3 } [M, N] -> { : M >= 1 and N >= 1 } [M, N] -> { [i, j, k, l, m, n] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/byu98-1-2-3.c0000664000175000017500000000063612254313240017271 00000000000000{ for (int c0 = 2; c0 <= 3; c0 += 1) for (int c1 = -c0 + 6; c1 <= 6; c1 += 1) S1(c0, c1); for (int c0 = 4; c0 <= 8; c0 += 1) { if (c0 >= 6) { S2(c0, -c0 + 9); } else { if (c0 == 4) for (int c1 = 3; c1 <= 4; c1 += 1) S1(4, c1); S1(c0, -c0 + 9); S2(c0, -c0 + 9); } for (int c1 = max(c0 - 1, -c0 + 10); c1 <= 6; c1 += 1) S1(c0, c1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-loechner5.in0000664000175000017500000000034512254313240021737 00000000000000[M] -> { S1[i0, i1, i2, i3] -> [0, i2, 0, i0, 0, i1, 0, i3, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= M and i3 >= 1 and i3 <= M } [M] -> { : } [M] -> { [i, j, k, l, m, n, o, p, q] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/min-3-1.in0000664000175000017500000000024712254313240017117 00000000000000[M] -> { S1[i0, i1] -> [i0, i1, 0] : i0 >= 0 and i0 <= M and i0 <= 10 and i1 >= 0 and i1 <= M and i1 <= 10 } [M] -> { : M >= 0 } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/forwardsub-2-1-2-3.in0000664000175000017500000000045712254313240021013 00000000000000[M] -> { S1[1, 1, i2] -> [1, 1, i2, 0] : M >= 3 and i2 <= M and i2 >= 2; S2[i0, 1, i2] -> [i0, 1, i2, 1] : i2 >= 1 + i0 and i0 >= 2 and i2 <= M; S4[i0, 0] -> [i0, 0, 0, 3] : i0 >= 2 and M >= 3 and i0 <= M; S3[1, 0] -> [1, 0, 0, 2] : M >= 3 } [M] -> { : M >= 3 } [M] -> { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/ex1.in0000664000175000017500000000033712254313240016533 00000000000000[n] -> { S2[i0, i1] -> [i0, i1, 1] : i0 >= 15 and i0 <= n and i1 >= 10 and i1 <= n; S1[i0, i1] -> [i0, i1, 0] : i0 >= 0 and i0 <= n and i1 >= 0 and i1 <= -15 + n } [n] -> { : n >= 25 } [n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/youcefn.c0000664000175000017500000000030012254313240017310 00000000000000{ for (int c0 = 1; c0 <= n; c0 += 1) { S1(c0, c0); for (int c1 = c0; c1 <= n; c1 += 1) S2(c0, c1); S3(c0, n); } for (int c0 = n + 1; c0 <= m; c0 += 1) S3(c0, n); } cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-5.in0000664000175000017500000000016312254313240020546 00000000000000[M] -> { S1[1, i1] -> [1, i1, 0] : 2i1 >= M and 2i1 <= 1 + M } [M] -> { : } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/test.in0000664000175000017500000000032212254313240017007 00000000000000[M, N] -> { S1[i0, i1] -> [i0, i1, 0] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S2[i0, i0] -> [i0, i0, 1] : i0 >= 3 and i0 <= N } [M, N] -> { : N >= M and M >= 4 } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_lcpc.c0000664000175000017500000000052712254313240017452 00000000000000{ for (int c0 = 1; c0 <= 5; c0 += 2) { for (int c2 = 1; c2 <= c0; c2 += 1) { S1(c0, (c0 - 1) / 2, c2); S2(c0, (c0 - 1) / 2, c2); } for (int c2 = c0 + 1; c2 <= p; c2 += 1) S1(c0, (c0 - 1) / 2, c2); } for (int c0 = 7; c0 <= m; c0 += 2) for (int c2 = 1; c2 <= p; c2 += 1) S1(c0, (c0 - 1) / 2, c2); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam2.c0000664000175000017500000000036012254313240021276 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) S1(c1); for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 2; c3 <= N; c3 += 1) S2(c1, c3); for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) S3(c1, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/test.c0000664000175000017500000000056512254313240016634 00000000000000{ for (int c0 = 1; c0 <= 2; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); for (int c0 = 3; c0 <= N; c0 += 1) { for (int c1 = 1; c1 <= min(M, c0 - 1); c1 += 1) S1(c0, c1); if (M >= c0) { S1(c0, c0); S2(c0, c0); } for (int c1 = c0 + 1; c1 <= M; c1 += 1) S1(c0, c1); if (c0 >= M + 1) S2(c0, c0); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/lux.in0000664000175000017500000000045212254313240016644 00000000000000[M] -> { S1[i0, i0, M, i3] -> [i0, i0, M, i3, 0, 0] : i0 >= 1 and i0 <= M and i3 >= 1 + i0 and i3 <= M; S2[i0, i1, i2, i2, i0] -> [i0, i1, i2, i2, i0, 1] : i1 >= 1 and i1 <= M and i2 >= 1 + i1 and i2 <= M and i1 <= -1 + i0 and i0 <= M } [M] -> { : } [M] -> { [i, j, k, l, m, n] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/esced.in0000664000175000017500000000027412254313240017121 00000000000000[n, m] -> { S1[i0] -> [i0, 0, 0] : i0 >= 1 and i0 <= m; S2[i0, i1] -> [i0, i1, 1] : i0 >= 1 and i0 <= m and i1 >= 1 and i1 <= n } [n, m] -> { : } [n, m] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/vivien2.c0000664000175000017500000000427112254313240017235 00000000000000{ for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1) S1(c0 - 1); for (int c0 = 2; c0 <= n + 29; c0 += 1) { if (c0 >= 3) { S4(c0 - c0 / 2 - 1, c0 / 2 + 1); if (c0 + 2 >= 2 * n) { for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } else if (c0 >= 5) { S4(c0 - c0 / 2 - 2, c0 / 2 + 2); for (int c2 = 1; c2 < (c0 + 1) / 2 - 1; c2 += 1) S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2); } } for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(n - c0, -1); c1 += 1) { S4(-c1, c0 + c1); S6(-c1 + 2, c0 + c1 - 2); for (int c2 = 1; c2 <= -c1; c2 += 1) S5(-c1 + 1, c0 + c1 - 1, c2); } if (c0 >= n + 2 && 2 * n >= c0 + 3) { S6(-n + c0 + 1, n - 1); for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } if (c0 >= n + 3) { S6(-n + c0, n); S1(c0 - 1); } else { if (c0 >= 5 && n + 1 >= c0) { S6(2, c0 - 2); S1(c0 - 1); } else if (c0 <= 4 && c0 >= 3) S1(c0 - 1); if (c0 >= 3 && n + 1 >= c0) S6(1, c0 - 1); if (c0 == n + 2) { S6(2, n); S1(n + 1); } } if (c0 == 2) S1(1); if (c0 % 2 == 0) S3(c0 / 2); for (int c1 = max(-n + c0, 1); c1 < (c0 + 1) / 2; c1 += 1) S2(c0 - c1, c1); } for (int c0 = n + 30; c0 <= 2 * n; c0 += 1) { if (2 * n >= c0 + 1) { S4(c0 - c0 / 2 - 1, c0 / 2 + 1); if (c0 + 2 >= 2 * n) { for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } else { S4(c0 - c0 / 2 - 2, c0 / 2 + 2); for (int c2 = 1; c2 < (c0 + 1) / 2 - 1; c2 += 1) S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2); } for (int c1 = -c0 + c0 / 2 + 3; c1 <= n - c0; c1 += 1) { S4(-c1, c0 + c1); S6(-c1 + 2, c0 + c1 - 2); for (int c2 = 1; c2 <= -c1; c2 += 1) S5(-c1 + 1, c0 + c1 - 1, c2); } if (2 * n >= c0 + 3) { S6(-n + c0 + 1, n - 1); for (int c2 = 1; c2 < -n + c0; c2 += 1) S5(-n + c0, n, c2); } S6(-n + c0, n); } if (c0 % 2 == 0) S3(c0 / 2); for (int c1 = -n + c0; c1 < (c0 + 1) / 2; c1 += 1) S2(c0 - c1, c1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/darte.c0000664000175000017500000000101712254313240016745 00000000000000for (int c0 = -n + 1; c0 <= n; c0 += 1) { if (c0 <= 0) for (int c2 = -c0 + 4; c2 <= 2 * n - c0 + 2; c2 += 2) S1(1, -c0 + 1, (c0 + c2 - 2) / 2); for (int c1 = max(c0 + 2, -c0 + 4); c1 <= min(2 * n + c0, 2 * n - c0); c1 += 2) { for (int c2 = c1 + 2; c2 <= 2 * n + c1; c2 += 2) S1((c0 + c1) / 2, (-c0 + c1) / 2, (-c1 + c2) / 2); for (int c2 = 1; c2 <= n; c2 += 1) S2((c0 + c1 - 2) / 2, (-c0 + c1) / 2, c2); } if (c0 >= 1) for (int c2 = 1; c2 <= n; c2 += 1) S2(n, n - c0 + 1, c2); } cloog-0.18.2/isl/test_inputs/codegen/cloog/emploi.c0000664000175000017500000000014612254313240017135 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) { S1(c0); for (int c1 = 1; c1 <= m; c1 += 1) S2(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/dealII.in0000664000175000017500000000061612254313240017165 00000000000000[T_2, T_67, T_66] -> { S1[scat_0] -> [scat_0, 0] : (scat_0 <= -1 + T_2 and scat_0 >= 0) or (scat_0 <= -T_67 and scat_0 >= 0); S2[scat_0] -> [scat_0, 1] : (scat_0 <= -1 + T_2 and scat_0 >= 0 and scat_0 <= T_66) or (scat_0 <= -1 + T_67 and scat_0 >= 0 and scat_0 <= T_66) } [T_2, T_67, T_66] -> { : T_2 <= 4 and T_2 >= 0 and T_67 <= 4 and T_67 >= 0 } [T_2, T_67, T_66] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/gesced3.in0000664000175000017500000000024712254313240017353 00000000000000[M, N] -> { S2[i0] -> [2M + i0] : i0 >= 1 and i0 <= N; S1[i0] -> [M + i0] : i0 >= 1 and i0 <= N } [M, N] -> { : N >= M and M >= 2 } [M, N] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/mode.c0000664000175000017500000000036712254313240016601 00000000000000for (int c0 = 0; c0 <= M; c0 += 1) { for (int c1 = 0; c1 <= min(c0, N); c1 += 1) { S1(c0, c1); S2(c0, c1); } for (int c1 = max(0, N + 1); c1 <= c0; c1 += 1) S1(c0, c1); for (int c1 = c0 + 1; c1 <= N; c1 += 1) S2(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/uday_scalars.c0000664000175000017500000000016212254313240020320 00000000000000{ for (int c2 = 0; c2 <= n; c2 += 1) S1(c2, 0, 0); for (int c2 = 0; c2 <= n; c2 += 1) S2(0, c2, 0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/mod3.in0000664000175000017500000000050612254313240016676 00000000000000[h0] -> { S1[i0, i1] -> [i0, i1, 0] : exists (e0 = [(32 + 32h0 - i0)/64]: i0 >= 0 and i0 <= 999 and i0 >= -2015 + 32h0 and 32e0 >= -999 + 32h0 - i0 and i1 >= 0 and i1 <= 999 and 64e0 >= -31 + 32h0 - i0 and 64e0 <= 31 + 32h0 - i0 and i0 <= 32 + 32h0) } [h0] -> { : h0 <= 93 and h0 >= 0 } [h0] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-jacobi3.c0000664000175000017500000000034712254313240021203 00000000000000for (int c1 = 1; c1 <= M; c1 += 1) { for (int c3 = 2; c3 < N; c3 += 1) for (int c5 = 2; c5 < N; c5 += 1) S1(c1, c3, c5); for (int c3 = 2; c3 < N; c3 += 1) for (int c5 = 2; c5 < N; c5 += 1) S2(c1, c3, c5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-1.in0000664000175000017500000000011712254313240020541 00000000000000{ S1[i0] -> [i0, 0] : i0 >= 0 and i0 <= 2 } { : } { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/stride2.c0000664000175000017500000000022112254313240017216 00000000000000{ for (int c0 = 3; c0 <= 26; c0 += 3) S2(c0, c0 / 3); S1(27); S2(27, 9); for (int c0 = 30; c0 <= 100; c0 += 3) S2(c0, c0 / 3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/dot2.in0000664000175000017500000000031512254313240016702 00000000000000[M, N] -> { S2[i0, i1] -> [i0, i1, 1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S1[i0] -> [i0, 0, 0] : i0 >= 1 and i0 <= M } [M, N] -> { : M >= 1 and N >= 1 } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/0D-2.in0000664000175000017500000000011612254313240016433 00000000000000[M] -> { S1[] -> [0] : M >= 0 } [M] -> { : } [M] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-loechner3.in0000664000175000017500000000026612254313240021737 00000000000000[M] -> { S1[i0, i1, i2] -> [0, i0, 0, i1 + i2, 0, i1, 0] : i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= i0 } [M] -> { : } [M] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/youcef.in0000664000175000017500000000032312254313240017323 00000000000000{ S1[i0, i0] -> [i0, i0, 0] : i0 >= 0 and i0 <= 5; S2[i0, i1] -> [i0, i1, 1] : i0 >= 0 and i0 <= 5 and i1 >= i0 and i1 <= 5; S3[i0, 5] -> [i0, 5, 2] : i0 >= 0 and i0 <= 5 } { : } { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam6.c0000664000175000017500000000030012254313240021274 00000000000000{ for (int c1 = 0; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S1(c1, c3); for (int c1 = 0; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S2(c3, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/stride2.in0000664000175000017500000000020112254313240017400 00000000000000{ S1[27] -> [27, 0]; S2[i0, i1] -> [i0, j] : 3i1 = i0 and 3j = i0 and i0 >= 3 and i0 <= 100 } { : } { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/mod4.c0000664000175000017500000000031512254313240016511 00000000000000for (int c0 = 2; c0 <= 10; c0 += 3) { S1(c0, (c0 + 1) / 3, (c0 + 1) / 3, 2, (c0 - 2) / 3); S2(c0, (c0 + 1) / 3, (c0 + 1) / 3, 2, (c0 - 2) / 3); S3(c0, (c0 + 1) / 3, (c0 + 1) / 3, 2, (c0 - 2) / 3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-bastoul3.c0000664000175000017500000000021512254313240021417 00000000000000for (int c0 = 3; c0 <= 9; c0 += 1) for (int c1 = max(c0 - 6, -(c0 % 2) + 2); c1 <= min(3, c0 - 2); c1 += 2) S1(c0, c1, (c0 - c1) / 2); cloog-0.18.2/isl/test_inputs/codegen/cloog/stride4.c0000664000175000017500000000011512254313240017222 00000000000000if (t >= 0 && t <= 15) for (int c0 = t; c0 <= 99; c0 += 16) S1(c0, t); cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-2.in0000664000175000017500000000006712254313240020546 00000000000000{ S1[0] -> [0, 0] } { : } { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/block2.c0000664000175000017500000000011612254313240017021 00000000000000for (int c0 = 0; c0 <= 9; c0 += 1) { S1(c0, 1); S3(c0, 1); S2(c0, 1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_complex1.c0000664000175000017500000000032512254313240020255 00000000000000for (int c0 = 0; c0 <= 5 * n; c0 += 1) for (int c1 = max(2 * floord(c0 - 1, 3) + 2, -((n + c0 + 1) % 2) - n + c0 + 1); c1 <= min(c0, n + c0 - (n + c0 + 2) / 3); c1 += 2) S1((-2 * c0 + 3 * c1) / 2, c0 - c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/no_lindep.c0000664000175000017500000000001312254313240017610 00000000000000S1(N + 2); cloog-0.18.2/isl/test_inputs/codegen/cloog/thomasset.c0000664000175000017500000000060112254313240017653 00000000000000{ for (int c0 = 0; c0 <= floord(n - 1, 3); c0 += 1) for (int c2 = 3 * c0 + 1; c2 <= min(3 * c0 + 3, n); c2 += 1) S1(c2, c0); for (int c0 = floord(n, 3); c0 <= 2 * floord(n, 3); c0 += 1) for (int c1 = 0; c1 < n; c1 += 1) for (int c3 = max(1, (n % 3) - n + 3 * c0); c3 <= min(n, (n % 3) - n + 3 * c0 + 2); c3 += 1) S2(c1 + 1, c3, 0, n / 3, c0 - n / 3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/mod2.in0000664000175000017500000000020112254313240016665 00000000000000{ S1[i] -> [i, 0] : exists (e0 = [(i)/3]: i >= 0 and i <= 3 and 3e0 <= i and 3e0 >= -1 + i) } { : } { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/multi-stride.c0000664000175000017500000000000412254313240020263 00000000000000{ } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam6.in0000664000175000017500000000034212254313240021466 00000000000000[M] -> { S2[i0, i1] -> [1, i1, 0, i0, 0] : i0 >= 1 and i0 <= M and i1 >= 0 and i1 <= M; S1[i0, i1] -> [0, i0, 0, i1, 0] : i0 >= 0 and i0 <= M and i1 >= 1 and i1 <= M } [M] -> { : } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/classen2.c0000664000175000017500000000211212254313240017355 00000000000000for (int c0 = max(max(max(max(max(max(5 * outerTimeTileScatter, 10 * outerProcTileScatter1 - 2 * N + 2), 5 * outerProcTileScatter1 + 5 * outerProcTileScatter2 - N), 5 * outerProcTileScatter1), 10 * outerProcTileScatter2 - N + 1), 5 * outerProcTileScatter2 + 1), 4); c0 <= min(min(min(min(min(min(2 * M + 2 * N - 6, 5 * outerProcTileScatter2 + M + N), 10 * outerProcTileScatter2 + N + 3), 5 * outerProcTileScatter1 + M + 2), 5 * outerProcTileScatter1 + 5 * outerProcTileScatter2 + 5), 10 * outerProcTileScatter1 + 4), 5 * outerTimeTileScatter + 4); c0 += 1) for (int c1 = max(max(max(max(-5 * outerProcTileScatter2 + c0 - 1, -M + c0 + 2), (c0 + 1) / 2 + 2), 5 * outerProcTileScatter2 + 1), 5 * outerProcTileScatter1); c1 <= min(min(min(min(5 * outerProcTileScatter1 + 4, 5 * outerProcTileScatter2 + N + 2), N + c0 / 2 - 1), c0), -5 * outerProcTileScatter2 + N + c0); c1 += 1) for (int c2 = max(max(-N + c1 + 2, c0 - c1 + 3), 5 * outerProcTileScatter2); c2 <= min(min(5 * outerProcTileScatter2 + 4, N + c0 - c1), c1 - 1); c2 += 1) S1(c0 - c1 + 1, -c0 + c1 + c2 - 2, c1 - c2, c0, c1, c2); cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali2.c0000664000175000017500000000030012254313240021363 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S1(c1, c3); for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S2(c1, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-jacobi2.c0000664000175000017500000000012612254313240021175 00000000000000for (int c1 = 0; c1 < M; c1 += 1) for (int c3 = 0; c3 < M; c3 += 1) S1(c1, c3); cloog-0.18.2/isl/test_inputs/codegen/cloog/usvd_e_t.in0000664000175000017500000000440112254313240017642 00000000000000{ S19[i0, i1, i2] -> [i0, i1, i2, 18] : i0 >= 8 and i1 >= 1 and i2 <= 0 and i2 >= -10 + i0 and i1 <= -6 + i0; S21[i0, i1, -7 + i0] -> [i0, i1, -7 + i0, 20] : i0 <= 10 and i1 >= 4 and i1 <= 8 and i0 >= 7; S17[i0, i1, -6 + i0] -> [i0, i1, -6 + i0, 16] : i0 >= 7 and i1 >= 4 and i0 <= 10 and i1 <= -2 + i0; S4[i0, i1, -1] -> [i0, i1, -1, 3] : i0 <= 8 and i1 >= 1 and i1 <= -4 + i0; S1[i0, 0, 0] -> [i0, 0, 0, 0] : i0 >= 0 and i0 <= 4; S10[i0, 4, 0] -> [i0, 4, 0, 9] : i0 >= 7 and i0 <= 10; S16[i0, i1, -6 + i0] -> [i0, i1, -6 + i0, 15] : i0 <= 10 and i1 >= 4 and i0 >= 7 and i1 <= -2 + i0; S24[i0, i1, i2] -> [i0, i1, i2, 23] : i0 >= 8 and i1 >= 4 and i1 <= 8 and i2 <= 3 and i2 >= -7 + i0; S23[i0, i1, i2] -> [i0, i1, i2, 22] : i0 <= 9 and i1 >= 4 and i1 <= 8 and i2 >= 0 and i2 <= -7 + i0; S7[i0, i1, 0] -> [i0, i1, 0, 6] : i0 >= 5 and i1 <= 0 and i1 >= -9 + i0; S25[i0, i1, 4] -> [i0, i1, 4, 24] : i0 >= 10 and i0 <= 14 and i1 >= 1 and i1 <= 5; S18[i0, i1, i2] -> [i0, i1, i2, 17] : i0 <= 10 and i1 >= 1 and i2 >= 4 and i2 <= -4 + i0 and i1 <= -5 + i0; S14[i0, i1, i2] -> [i0, i1, i2, 13] : i0 >= 8 and i1 <= 4 and i2 <= 0 and i2 >= -12 + i0 and i1 >= -6 + i0; S6[i0, i1, 0] -> [i0, i1, 0, 5] : i0 <= 8 and i1 >= -4 and i1 <= -9 + i0; S8[i0, i1, 0] -> [i0, i1, 0, 7] : i0 >= 3 and i0 <= 7 and i1 >= 7 and i1 <= 11; S15[i0, i1, i2] -> [i0, i1, i2, 14] : i0 <= 10 and i1 >= 1 and i1 <= 5 and i2 >= 4 and i2 <= -4 + i0; S11[i0, -3 + i0, i2] -> [i0, -3 + i0, i2, 10] : i0 <= 10 and i0 >= 7 and i2 <= 4 and i2 >= -7 + i0; S20[i0, i1, i2] -> [i0, i1, i2, 19] : i0 >= 8 and i1 <= 4 and i2 >= -4 and i2 <= 0 and i1 >= -6 + i0; S12[i0, -2 + i0, i2] -> [i0, -2 + i0, i2, 11] : i0 >= 7 and i0 <= 10 and i2 <= 4 and i2 >= -7 + i0; S9[i0, 4, 0] -> [i0, 4, 0, 8] : i0 >= 7 and i0 <= 10; S22[i0, i1, -7 + i0] -> [i0, i1, -7 + i0, 21] : i0 >= 7 and i1 >= 5 and i1 <= 9 and i0 <= 10; S13[i0, i1, i2] -> [i0, i1, i2, 12] : i0 <= 10 and i1 >= 4 and i2 <= 4 and i2 >= -7 + i0 and i1 <= -4 + i0; S26[i0, i1, 3] -> [i0, i1, 3, 25] : i0 >= 10 and i0 <= 14 and i1 >= 1 and i1 <= 5; S3[i0, 0, 0] -> [i0, 0, 0, 2] : i0 >= 4 and i0 <= 8; S5[i0, i1, 0] -> [i0, i1, 0, 4] : i0 >= 4 and i1 <= 4 and i1 >= -4 + i0; S2[i0, i1, 0] -> [i0, i1, 0, 1] : i0 >= 0 and i0 <= 4 and i1 >= 0 and i1 <= 4 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/lu.c0000664000175000017500000000031412254313240016265 00000000000000for (int c0 = 1; c0 <= n; c0 += 1) { for (int c1 = 2; c1 <= n; c1 += 1) for (int c2 = 1; c2 < min(c0, c1); c2 += 1) S2(c2, c1, c0); for (int c3 = c0 + 1; c3 <= n; c3 += 1) S1(c0, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali5.in0000664000175000017500000000056212254313240021564 00000000000000[M] -> { S1[i0, i1, i2] -> [0, i0 + i1, 0, i2, 0, i2, 0] : i1 >= 1 and i1 <= -1 + i0 and i2 >= 1 + i0 and i2 <= M; S3[i0, i1, i2] -> [0, i0 + i1, 2, i2, 2, i2, 0] : i1 >= 1 and i1 <= -1 + i0 and i2 >= 1 + i0 and i2 <= M; S2[i0, i1] -> [0, i0 + i1, 1, i1, 1, 0, 0] : i0 <= M and i1 >= 1 and i1 <= -1 + i0 } [M] -> { : } [M] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/jacobi-shared.c0000664000175000017500000000041312254313240020340 00000000000000if (2 * floord(h0 - 1, 2) + 1 == h0 && g2 + 29 >= (g2 - t1 + 32) % 32 && ((g2 - t1 + 32) % 32) + N >= g2 + 33) for (int c0 = max(((g1 + t0 + 13) % 16) - g1 + 3, ((t0 + 15) % 16) + 1); c0 <= min(32, N - g1 - 1); c0 += 16) S1(g1 + c0 - 1, ((t1 + 31) % 32) + g2); cloog-0.18.2/isl/test_inputs/codegen/cloog/forwardsub-3-1-2.in0000664000175000017500000000050112254313240020642 00000000000000[M] -> { S2[i0, i1] -> [i0, i1, 1] : 2i1 <= -1 + i0 and i1 >= 2 and i1 >= -M + i0; S4[i0, i1] -> [i0, j, 3] : 2j = i0 and 2i1 = i0 and M >= 3 and i0 <= 2M and i0 >= 4; S1[i0, 1] -> [i0, 1, 0] : M >= 3 and i0 <= 1 + M and i0 >= 3; S3[2, 1] -> [2, 1, 2] : M >= 3 } [M] -> { : M >= 3 } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/square+triangle-1-1-2-3.c0000664000175000017500000000027212254313240021544 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) { S1(c0, 1); for (int c1 = 2; c1 <= c0; c1 += 1) { S1(c0, c1); S2(c0, c1); } for (int c1 = c0 + 1; c1 <= M; c1 += 1) S1(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/emploi.in0000664000175000017500000000036012254313240017317 00000000000000[m, n] -> { S1[i0] -> [i0, 0, 0] : (i0 >= 1 and i0 <= n and i0 <= 2m) or (i0 >= 1 and i0 <= n and i0 >= m); S2[i0, i1] -> [i0, i1, 1] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= m } [m, n] -> { : } [m, n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/darte.in0000664000175000017500000000046112254313240017133 00000000000000[n] -> { S2[i0, i1, i2] -> [1 + i0 - i1, 2 + i0 + i1, i2] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= n and i2 >= 1 and i2 <= n; S1[i0, i1, i2] -> [i0 - i1, i0 + i1, i0 + i1 + 2i2] : i0 >= 1 and i0 <= n and i1 >= 1 and i1 <= n and i2 >= 1 and i2 <= n } [n] -> { : } [n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/yosr.c0000664000175000017500000000047612254313240016652 00000000000000{ for (int c0 = 1; c0 < n; c0 += 1) { for (int c2 = c0 + 1; c2 <= n; c2 += 1) S1(c0, c2); for (int c1 = 1; c1 < c0; c1 += 1) for (int c2 = c1 + 1; c2 <= n; c2 += 1) S2(c1, c2, c0); } for (int c1 = 1; c1 < n; c1 += 1) for (int c2 = c1 + 1; c2 <= n; c2 += 1) S2(c1, c2, n); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-fusion2.in0000664000175000017500000000035712254313240021443 00000000000000[M, N] -> { S2[i0, i1] -> [0, 1 + i0, 0, i1, 0] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S1[i0, i1] -> [0, i0, 1, i1, 0] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M } [M, N] -> { : } [M, N] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/swim.c0000664000175000017500000000521112254313240016625 00000000000000if (M == 1) { S1(); S2(); S3(); S4(); S5(); S6(); S7(); S8(); S9(); S10(); S11(); S12(); S13(); S14(); S15(); S16(); S17(); S18(); S19(); S20(); S21(); S22(); S23(); S24(); S25(); S26(); S27(); for (int c1 = 1; c1 <= N; c1 += 1) { for (int c3 = 1; c3 <= N; c3 += 1) { S28(c1, c3); S29(c1, c3); S30(c1, c3); } S31(c1); } S32(); S33(); S34(); if (O <= 1) S35(); S36(); S37(); for (int c1 = 2; c1 <= P; c1 += 1) { S38(c1); S39(c1); for (int c3 = 1; c3 <= Q; c3 += 1) for (int c5 = 1; c5 <= R; c5 += 1) { S40(c1, c3, c5); S41(c1, c3, c5); S42(c1, c3, c5); S43(c1, c3, c5); } for (int c3 = 1; c3 <= Q; c3 += 1) { S44(c1, c3); S45(c1, c3); S46(c1, c3); S47(c1, c3); } for (int c3 = 1; c3 <= R; c3 += 1) { S48(c1, c3); S49(c1, c3); S50(c1, c3); S51(c1, c3); } S52(c1); S53(c1); S54(c1); S55(c1); S56(c1); S57(c1); S58(c1); for (int c3 = 1; c3 <= Q; c3 += 1) for (int c5 = 1; c5 <= R; c5 += 1) { S59(c1, c3, c5); S60(c1, c3, c5); S61(c1, c3, c5); } for (int c3 = 1; c3 <= Q; c3 += 1) { S62(c1, c3); S63(c1, c3); S64(c1, c3); } for (int c3 = 1; c3 <= R; c3 += 1) { S65(c1, c3); S66(c1, c3); S67(c1, c3); } S68(c1); S69(c1); S70(c1); S71(c1); S72(c1); S73(c1); S74(c1); S75(c1); S76(c1); S77(c1); S78(c1); S79(c1); S80(c1); S81(c1); S82(c1); S83(c1); S84(c1); S85(c1); S86(c1); S87(c1); S88(c1); S89(c1); S90(c1); S91(c1); S92(c1); S93(c1); S94(c1); for (int c3 = 1; c3 <= N; c3 += 1) { for (int c5 = 1; c5 <= N; c5 += 1) { S95(c1, c3, c5); S96(c1, c3, c5); S97(c1, c3, c5); } S98(c1, c3); } S99(c1); S100(c1); S101(c1); for (int c3 = 1; c3 <= Q; c3 += 1) for (int c5 = 1; c5 <= R; c5 += 1) { S102(c1, c3, c5); S103(c1, c3, c5); S104(c1, c3, c5); S105(c1, c3, c5); S106(c1, c3, c5); S107(c1, c3, c5); } for (int c3 = 1; c3 <= Q; c3 += 1) { S108(c1, c3); S109(c1, c3); S110(c1, c3); S111(c1, c3); S112(c1, c3); S113(c1, c3); } for (int c3 = 1; c3 <= R; c3 += 1) { S114(c1, c3); S115(c1, c3); S116(c1, c3); S117(c1, c3); S118(c1, c3); S119(c1, c3); } S120(c1); S121(c1); S122(c1); S123(c1); S124(c1); S125(c1); } } cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-2.c0000664000175000017500000000000712254313240020354 00000000000000S1(0); cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-interp.in0000664000175000017500000000407512254313240021761 00000000000000[M, N, O, P, Q, R, S, T, U] -> { S8[i0, i1, i2] -> [1, i0, 0, 2i1, 1, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S11[i0, i1, i2] -> [0, i0, 0, 2i1, 4, i2, 1] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S6[i0, i1, i2] -> [0, i0, 0, -2 + 2i1, 2, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S9[i0, i1, i2] -> [1, i0, 0, 1 + 2i1, 3, i2, 1] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S1[i0, i1, i2] -> [0, i0, 0, -3 + 2i1, 2, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S4[i0, i1, i2] -> [2, i0, 0, i1, 1, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S2[i0, i1, i2] -> [1, i0, 0, 2i1, 0, i2, 1] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S7[i0, i1, i2] -> [0, i0, 0, -2 + 2i1, 2, i2, 1] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S10[i0, i1, i2] -> [0, i0, 0, 1 + 2i1, 0, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S3[i0, i1, i2] -> [0, i0, 0, -1 + 2i1, 1, i2, 2] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= M; S15[i0, i1, i2] -> [7, i0, 1, i1, 1, i2, 0] : i0 >= R and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S5[i0, i1, i2] -> [3, i0, 0, i1, 1, i2, 1] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S13[i0, i1, i2] -> [5, i0, 0, i1, 1, i2, 0] : i0 >= R and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S12[i0, i1, i2] -> [4, i0, 0, i1, 0, i2, 0] : i0 >= R and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S14[i0, i1, i2] -> [6, i0, 1, i1, 0, i2, 0] : i0 >= R and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= P and i2 <= -1 + M } [M, N, O, P, Q, R, S, T, U] -> { : } [M, N, O, P, Q, R, S, T, U] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-resid.c0000664000175000017500000000041112254313240021370 00000000000000for (int c1 = 2; c1 < O; c1 += 1) for (int c3 = 3; c3 < 2 * N - 2; c3 += 2) { for (int c5 = 1; c5 <= M; c5 += 1) { S1(c1, (c3 + 1) / 2, c5); S2(c1, (c3 + 1) / 2, c5); } for (int c5 = 2; c5 < M; c5 += 1) S3(c1, (c3 + 1) / 2, c5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-interp.c0000664000175000017500000000510612254313240021571 00000000000000{ if (N >= 2) for (int c1 = 1; c1 < O; c1 += 1) { for (int c5 = 1; c5 <= M; c5 += 1) S1(c1, 1, c5); for (int c5 = 1; c5 < M; c5 += 1) { S6(c1, 1, c5); S7(c1, 1, c5); } if (N >= 3) { for (int c5 = 1; c5 <= M; c5 += 1) S3(c1, 1, c5); for (int c5 = 1; c5 <= M; c5 += 1) S1(c1, 2, c5); for (int c5 = 1; c5 < M; c5 += 1) { S6(c1, 2, c5); S7(c1, 2, c5); } for (int c5 = 1; c5 < M; c5 += 1) S11(c1, 1, c5); } else { for (int c5 = 1; c5 <= M; c5 += 1) S3(c1, 1, c5); for (int c5 = 1; c5 < M; c5 += 1) S11(c1, 1, c5); } for (int c3 = 3; c3 < 2 * N - 4; c3 += 2) { for (int c5 = 1; c5 < M; c5 += 1) S10(c1, (c3 - 1) / 2, c5); for (int c5 = 1; c5 <= M; c5 += 1) S3(c1, (c3 + 1) / 2, c5); for (int c5 = 1; c5 <= M; c5 += 1) S1(c1, (c3 + 3) / 2, c5); for (int c5 = 1; c5 < M; c5 += 1) { S6(c1, (c3 + 3) / 2, c5); S7(c1, (c3 + 3) / 2, c5); } for (int c5 = 1; c5 < M; c5 += 1) S11(c1, (c3 + 1) / 2, c5); } if (N >= 3) { for (int c5 = 1; c5 < M; c5 += 1) S10(c1, N - 2, c5); for (int c5 = 1; c5 <= M; c5 += 1) S3(c1, N - 1, c5); for (int c5 = 1; c5 < M; c5 += 1) S11(c1, N - 1, c5); } for (int c5 = 1; c5 < M; c5 += 1) S10(c1, N - 1, c5); } for (int c1 = 1; c1 < O; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) { for (int c5 = 1; c5 <= M; c5 += 1) S2(c1, c3, c5); for (int c5 = 1; c5 < M; c5 += 1) S8(c1, c3, c5); for (int c5 = 1; c5 < M; c5 += 1) S9(c1, c3, c5); } for (int c1 = 1; c1 < O; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) for (int c5 = 1; c5 < M; c5 += 1) S4(c1, c3, c5); for (int c1 = 1; c1 < O; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) for (int c5 = 1; c5 < M; c5 += 1) S5(c1, c3, c5); for (int c1 = R; c1 < O; c1 += 1) for (int c3 = Q; c3 < N; c3 += 1) for (int c5 = P; c5 < M; c5 += 1) S12(c1, c3, c5); for (int c1 = R; c1 < O; c1 += 1) for (int c3 = Q; c3 < N; c3 += 1) for (int c5 = 1; c5 < M; c5 += 1) S13(c1, c3, c5); for (int c1 = R; c1 < O; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) for (int c5 = P; c5 < M; c5 += 1) S14(c1, c3, c5); for (int c1 = R; c1 < O; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) for (int c5 = 1; c5 < M; c5 += 1) S15(c1, c3, c5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/multi-mm-1.c0000664000175000017500000000026512254313240017551 00000000000000for (int c0 = 0; c0 <= M; c0 += 1) { for (int c1 = 0; c1 <= min(N, c0); c1 += 1) { S1(c0, c1); S2(c0, c1); } for (int c1 = N + 1; c1 <= c0; c1 += 1) S1(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali3.c0000664000175000017500000000035712254313240021400 00000000000000{ for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) S1(c1, c3); for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) for (int c5 = 1; c5 <= M; c5 += 1) S2(c1, c3, c5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/4-param.in0000664000175000017500000000025012254313240017271 00000000000000[m, n, p, q] -> { S1[i0] -> [i0, 0] : i0 >= m and i0 <= n; S2[i0] -> [i0, 1] : i0 >= p and i0 <= q } [m, n, p, q] -> { : } [m, n, p, q] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-interp2.in0000664000175000017500000000122612254313240022036 00000000000000[M, N, O, P, Q, R, S, T, U] -> { S1[i0, i1, i2] -> [0, i0, 0, i1, 0, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= P and i2 <= -1 + M; S4[i0, i1, i2] -> [3, i0, 1, i1, 1, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S2[i0, i1, i2] -> [1, i0, 0, i1, 1, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= Q and i1 <= -1 + N and i2 >= 1 and i2 <= -1 + M; S3[i0, i1, i2] -> [2, i0, 1, i1, 0, i2, 0] : i0 >= 1 and i0 <= -1 + O and i1 >= 1 and i1 <= -1 + N and i2 >= P and i2 <= -1 + M } [M, N, O, P, Q, R, S, T, U] -> { : } [M, N, O, P, Q, R, S, T, U] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/no_lindep.in0000664000175000017500000000013512254313240020001 00000000000000[M, N] -> { S1[2 + N] -> [1 + M, N] } [M, N] -> { : } [M, N] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/tiling.in0000664000175000017500000000022112254313240017314 00000000000000[n] -> { S1[ii, i] -> [ii, i, 0] : i >= 0 and i <= n and i <= 9 + 10ii and i >= 10ii } [n] -> { : n >= 0 } [n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali6.c0000664000175000017500000000034712254313240021402 00000000000000for (int c1 = 1; c1 <= M; c1 += 1) { for (int c3 = 2; c3 < N; c3 += 1) for (int c5 = 2; c5 < N; c5 += 1) S1(c1, c3, c5); for (int c3 = 2; c3 < N; c3 += 1) for (int c5 = 2; c5 < N; c5 += 1) S2(c1, c3, c5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/equality.c0000664000175000017500000000030412254313240017501 00000000000000for (int c0 = 0; c0 <= 5; c0 += 1) for (int c1 = c0 <= 2 ? 2 * c0 : 4; c1 <= (c0 >= 2 ? 2 * c0 : 4); c1 += 1) { if (c1 == 2 * c0) S1(c0, 2 * c0); if (c1 == 4) S2(c0, 4); } cloog-0.18.2/isl/test_inputs/codegen/cloog/equality2.in0000664000175000017500000000124212254313240017751 00000000000000{ S1[i0, i1, 1, 2, i0, i5, -999 + i1, i0, -999 + i1, i9, i10] -> [i0, i1, 1, 2, i0, n, -999 + i1, i0, -999 + i1, r, s, 0, 0, 0, 0, 0] : 2s = -998 + i1 and 2n = 2 + i1 and 2i10 = -998 + i1 and 2i5 = 2 + i1 and 2i9 = -998 + i1 and 2r = -998 + i1 and i0 >= 1 and i0 <= 10000 and i1 >= 1000 and i1 <= 1016; S2[i0, i1, -1999 + 2i1, 1, i0, -1000 + 2i1, 1, 2, i0, -499 + i1, -1999 + 2i1, i0, -1999 + 2i1, -999 + i1, -999 + i1] -> [i0, i1, -1999 + 2i1, 1, i0, -1000 + 2i1, 1, 2, i0, -499 + i1, -1999 + 2i1, i0, -1999 + 2i1, -999 + i1, -999 + i1, 1] : i0 >= 1 and i0 <= 10000 and i1 >= 1000 and i1 <= 1008 } { : } { [i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x] -> atomic[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/christian.c0000664000175000017500000000033012254313240017627 00000000000000for (int c0 = -N + 1; c0 <= N; c0 += 1) { for (int c1 = max(c0 - 1, 0); c1 < min(N + c0 - 1, N); c1 += 1) S2(c1, -c0 + c1 + 1); for (int c1 = max(c0, 0); c1 < min(N + c0, N); c1 += 1) S1(c1, -c0 + c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/largeur.in0000664000175000017500000000021012254313240017465 00000000000000[M] -> { S1[i0, i1] -> [i1, i0] : i0 >= 1 and i0 <= M and i1 >= i0 and i1 <= M } [M] -> { : M >= 0 } [M] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/classen2.in0000664000175000017500000000137412254313240017552 00000000000000[outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, M, N] -> { S1[i0, i1, i2, 2i0 + i1 + i2, 1 + i0 + i1 + i2, 1 + i0 + i1] -> [2i0 + i1 + i2, 1 + i0 + i1 + i2, 1 + i0 + i1] : N >= 3 and i2 <= 3 + 5outerProcTileScatter1 - i0 - i1 and i1 >= -1 + 5outerProcTileScatter2 - i0 and M >= 2 and i2 <= 4 + 5outerTimeTileScatter - 2i0 - i1 and i1 <= 3 + 5outerProcTileScatter2 - i0 and i2 >= 1 and i2 <= -2 + N and i1 >= 1 and i1 <= -2 + N and i0 >= 1 and i0 <= -1 + M and i2 >= 5outerTimeTileScatter - 2i0 - i1 and i2 >= -1 + 5outerProcTileScatter1 - i0 - i1 } [outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, M, N] -> { : } [outerTimeTileScatter, outerProcTileScatter1, outerProcTileScatter2, M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/stride.in0000664000175000017500000000020112254313240017316 00000000000000{ S1[25] -> [25, 0]; S2[i0, i1] -> [i0, j] : 3i1 = i0 and 3j = i0 and i0 >= 3 and i0 <= 100 } { : } { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/walters3.in0000664000175000017500000000036212254313240017600 00000000000000{ S2[j, a, b] -> [j, j', b, 1] : 2a = j and 2j' = j and j >= 1 and j <= 10 and 2b <= j and 2b >= -1 + j; S1[j, a, b] -> [j, j', k, 0] : 2a = j and 2j' = j and 2k = j and 2b = j and j <= 8 and j >= 2 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-loechner5.c0000664000175000017500000000026412254313240021553 00000000000000for (int c1 = 1; c1 <= M; c1 += 1) for (int c3 = 1; c3 <= M; c3 += 1) for (int c5 = 1; c5 <= M; c5 += 1) for (int c7 = 1; c7 <= M; c7 += 1) S1(c3, c5, c1, c7); cloog-0.18.2/isl/test_inputs/codegen/cloog/min-4-1.c0000664000175000017500000000007712254313240016735 00000000000000for (int c0 = max(-N, -M); c0 <= min(O, N); c0 += 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/lineality-1-2.in0000664000175000017500000000027612254313240020327 00000000000000[M] -> { S2[i0, i0] -> [i0, i0, 1] : i0 >= 1 and i0 <= M; S1[i0, i1] -> [i0, i1, 0] : i0 >= 1 and i1 >= 1 and i0 <= M and i1 <= M } [M] -> { : M >= 2 } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/uday_scalars.in0000664000175000017500000000025312254313240020505 00000000000000[n] -> { S1[i0, 0, 0] -> [0, 1, i0, 0] : i0 >= 0 and i0 <= n; S2[0, i1, 0] -> [1, 0, i1, 1] : i1 >= 0 and i1 <= n } [n] -> { : } [n] -> { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/unroll2.c0000664000175000017500000000011712254313240017243 00000000000000{ if (n <= 9 && n >= 0) S1(n); if (n <= 9 && n >= -1) S1(n + 1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/logo.c0000664000175000017500000000062412254313240016611 00000000000000{ for (int c1 = 0; c1 <= 7; c1 += 1) S1(1, c1); for (int c0 = 2; c0 <= 6; c0 += 1) { for (int c1 = 0; c1 < c0 - 1; c1 += 1) S2(c0, c1); for (int c1 = c0 - 1; c1 <= 4; c1 += 1) { S1(c0, c1); S2(c0, c1); } for (int c1 = 5; c1 <= 7; c1 += 1) S1(c0, c1); } for (int c0 = 7; c0 <= 8; c0 += 1) for (int c1 = c0 - 1; c1 <= 7; c1 += 1) S1(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/dealII.c0000664000175000017500000000040612254313240016776 00000000000000{ for (int c0 = 0; c0 <= min(T_66, T_2 - 1); c0 += 1) { S1(c0); S2(c0); } for (int c0 = T_2; c0 <= min(T_67 - 1, T_66); c0 += 1) S2(c0); for (int c0 = max(0, T_66 + 1); c0 < T_2; c0 += 1) S1(c0); if (T_67 == 0 && T_2 == 0) S1(0); } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-rprj3.in0000664000175000017500000000140712254313240021514 00000000000000[M, N, O, P, Q, R] -> { S1[i0, i1, i2] -> [0, i0, 0, i1, 2, i2, 0] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= M; S4[i0, i1, i2] -> [0, i0, 0, 1 + i1, 1, -1 + i2, 2] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M; S3[i0, i1, i2] -> [0, i0, 0, 1 + i1, 1, i2, 0] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M; S5[i0, i1, i2] -> [0, i0, 0, 1 + i1, 1, i2, 1] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= -1 + M; S2[i0, i1, i2] -> [0, i0, 0, 1 + i1, 0, i2, 1] : i0 >= 2 and i0 <= -1 + O and i1 >= 2 and i1 <= -1 + N and i2 >= 2 and i2 <= M } [M, N, O, P, Q, R] -> { : } [M, N, O, P, Q, R] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/jacobi-shared.in0000664000175000017500000000241512254313240020530 00000000000000[T, N, h0, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { S1[i0, i1] -> [1 - g1 + i0, 1 - g2 + i1, t0, t1] : exists (e0 = [(-1 + h0)/2], e1 = [(-2016b0 - g1)/2048], e2 = [(-992b1 - g2)/1024], e3 = [(-1 + t0 - i0)/16], e4 = [(-1 + t1 - i1)/32]: g0 = h0 and 2e0 = -1 + h0 and 2048e1 = -2016b0 - g1 and 1024e2 = -992b1 - g2 and 16e3 = -1 + t0 - i0 and 32e4 = -1 + t1 - i1 and h0 >= 1 and h0 <= -1 + 2T and i0 >= 2 and i0 <= -2 + N and i1 >= 2 and i1 <= -2 + N and b1 <= 31 and b1 >= 0 and b0 <= 63 and b0 >= 0 and i1 <= 31 + g2 and i1 >= g2 and N >= 4 and i0 >= g1 and i0 <= 31 + g1 and g2 <= -2 + N and g2 >= -29 and g1 <= -2 + N and g1 >= -29 and g1 >= 32b0 and g2 >= 32b1 and 32b0 <= -2 + N and 32b1 <= -2 + N and t0 >= 0 and t0 <= 15 and t1 >= 0 and t1 <= 31) } [T, N, h0, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { : exists (e0 = [(-32b0 + g1)/2048], e1 = [(-32b1 + g2)/1024]: g0 = h0 and 2048e0 = -32b0 + g1 and 1024e1 = -32b1 + g2 and g2 <= -2 + N and g2 >= -29 and g1 <= -2 + N and g1 >= -29 and b1 >= 0 and b1 <= 31 and b0 <= 63 and 32b1 <= -2 + N and 32b0 <= -2 + N and b0 >= 0 and N >= 4 and h0 >= 0 and h0 <= -1 + 2T and g2 >= 32b1 and g1 >= 32b0 and t0 >= 0 and t0 <= 15 and t1 >= 0 and t1 <= 31) } [T, N, h0, b0, b1, g0, g1, g2, g3, g4, t0, t1] -> { [i, j, k, l] -> separate[x] : x >= 3 } cloog-0.18.2/isl/test_inputs/codegen/cloog/union.c0000664000175000017500000000017612254313240017003 00000000000000if (M >= 11) { for (int c0 = -100; c0 <= 0; c0 += 1) S1(-c0); } else for (int c0 = 0; c0 <= 100; c0 += 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/vasilache.c0000664000175000017500000000111412254313240017603 00000000000000{ S1(); S2(); for (int c1 = 0; c1 < N; c1 += 1) for (int c3 = 0; c3 < N; c3 += 1) { S4(c1, c3); S5(c1, c3); } for (int c1 = 0; c1 < N; c1 += 1) for (int c3 = 0; c3 < N; c3 += 1) for (int c5 = 0; c5 <= (N - 1) / 32; c5 += 1) { S7(c1, c3, c5, 32 * c5); for (int c7 = 32 * c5 + 1; c7 <= min(N - 1, 32 * c5 + 31); c7 += 1) { S6(c1, c3, c5, c7 - 1); S7(c1, c3, c5, c7); } if (N >= 32 * c5 + 33) { S6(c1, c3, c5, 32 * c5 + 31); } else S6(c1, c3, c5, N - 1); } S8(); } cloog-0.18.2/isl/test_inputs/codegen/cloog/iftest2.in0000664000175000017500000000033412254313240017413 00000000000000[M, N] -> { S1[i0, i1] -> [i0, i1, 0] : (i0 >= 1 and i0 <= N and i0 >= M and i1 >= 1 and i1 <= M) or (i0 >= 1 and i0 <= N and i0 <= 2M and i1 >= 1 and i1 <= M) } [M, N] -> { : } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/infinite2.in0000664000175000017500000000030112254313240017714 00000000000000[M, N] -> { S2[i0, i1] -> [i0, i1, 1] : i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= M; S1[i0] -> [i0, 0, 0] : i0 >= 1 } [M, N] -> { : M >= 1 and N >= 1 } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/iftest2.c0000664000175000017500000000013012254313240017221 00000000000000for (int c0 = 1; c0 <= N; c0 += 1) for (int c1 = 1; c1 <= M; c1 += 1) S1(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/min-1-1.in0000664000175000017500000000024212254313240017110 00000000000000[M, N] -> { S1[i0, i1] -> [i0, i1, 0] : i0 >= 1 and i1 >= 0 and i1 <= M and i1 <= i0 and i1 <= N - i0 } [M, N] -> { : } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/walters2.in0000664000175000017500000000044012254313240017574 00000000000000{ S1[j, i] -> [j, i, 0] : j >= 1 and j <= 24 and i >= 1 and i <= 50; S2[j, 51] -> [j, 51, 1] : j >= 1 and j <= 24; S2[25, i] -> [25, i, 1] : i >= 1 and i <= 51; S2[0, i] -> [0, i, 1] : i >= 0 and i <= 51; S2[j, 0] -> [j, 0, 1] : j >= 1 and j <= 25 } { : } { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-stride2.in0000664000175000017500000000021412254313240021422 00000000000000[M] -> { S1[i0, i1] -> [0, i0, 0, 0, 0] : 7i1 = -2 + i0 and i0 >= 0 and i0 <= M } [M] -> { : } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/0D-1.in0000664000175000017500000000006012254313240016430 00000000000000{ S1[] -> [0] } { : } { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-lim-lam2.in0000664000175000017500000000046312254313240021466 00000000000000[M, N] -> { S1[i0] -> [0, i0, 0, 0, 0] : i0 >= 1 and i0 <= M; S2[i0, i1] -> [1, i0, 1, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 2 and i1 <= N; S3[i0, i1] -> [2, i0, 2, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= -1 + N } [M, N] -> { : M >= 1 and N >= 1 } [M, N] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/swim.in0000664000175000017500000002261512254313240017020 00000000000000[M, N, O, P, Q, R] -> { S84[i0] -> [34, i0, 31, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S6[] -> [5, 0, 0, 0, 0, 0, 0] : M = 1; S25[] -> [24, 0, 0, 0, 0, 0, 0] : M = 1; S115[i0, i1] -> [34, i0, 48, i1, 1, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S64[i0, i1] -> [34, i0, 13, i1, 2, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S62[i0, i1] -> [34, i0, 13, i1, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S40[i0, i1, i2] -> [34, i0, 2, i1, 0, i2, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S123[i0] -> [34, i0, 52, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S5[] -> [4, 0, 0, 0, 0, 0, 0] : M = 1; S15[] -> [14, 0, 0, 0, 0, 0, 0] : M = 1; S76[i0] -> [34, i0, 23, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S39[i0] -> [34, i0, 1, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S13[] -> [12, 0, 0, 0, 0, 0, 0] : M = 1; S28[i0, i1] -> [27, i0, 0, i1, 0, 0, 0] : M = 1 and i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= N; S70[i0] -> [34, i0, 17, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S53[i0] -> [34, i0, 6, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S121[i0] -> [34, i0, 50, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S47[i0, i1] -> [34, i0, 3, i1, 3, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S59[i0, i1, i2] -> [34, i0, 12, i1, 0, i2, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S71[i0] -> [34, i0, 18, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S77[i0] -> [34, i0, 24, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S63[i0, i1] -> [34, i0, 13, i1, 1, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S51[i0, i1] -> [34, i0, 4, i1, 3, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S100[i0] -> [34, i0, 44, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S22[] -> [21, 0, 0, 0, 0, 0, 0] : M = 1; S95[i0, i1, i2] -> [34, i0, 42, i1, 0, i2, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N and i2 >= 1 and i2 <= N; S8[] -> [7, 0, 0, 0, 0, 0, 0] : M = 1; S120[i0] -> [34, i0, 49, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S50[i0, i1] -> [34, i0, 4, i1, 2, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S45[i0, i1] -> [34, i0, 3, i1, 1, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S72[i0] -> [34, i0, 19, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S52[i0] -> [34, i0, 5, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S7[] -> [6, 0, 0, 0, 0, 0, 0] : M = 1; S78[i0] -> [34, i0, 25, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S110[i0, i1] -> [34, i0, 47, i1, 2, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S124[i0] -> [34, i0, 53, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S60[i0, i1, i2] -> [34, i0, 12, i1, 0, i2, 1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S27[] -> [26, 0, 0, 0, 0, 0, 0] : M = 1; S114[i0, i1] -> [34, i0, 48, i1, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S49[i0, i1] -> [34, i0, 4, i1, 1, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S94[i0] -> [34, i0, 41, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S57[i0] -> [34, i0, 10, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S66[i0, i1] -> [34, i0, 14, i1, 1, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S18[] -> [17, 0, 0, 0, 0, 0, 0] : M = 1; S92[i0] -> [34, i0, 39, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S3[] -> [2, 0, 0, 0, 0, 0, 0] : M = 1; S35[] -> [31, 0, 0, 0, 0, 0, 0] : M = 1 and O <= 1; S36[] -> [32, 0, 0, 0, 0, 0, 0] : M = 1; S10[] -> [9, 0, 0, 0, 0, 0, 0] : M = 1; S2[] -> [1, 0, 0, 0, 0, 0, 0] : M = 1; S48[i0, i1] -> [34, i0, 4, i1, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S30[i0, i1] -> [27, i0, 0, i1, 2, 0, 0] : M = 1 and i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= N; S75[i0] -> [34, i0, 22, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S83[i0] -> [34, i0, 30, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S87[i0] -> [34, i0, 34, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S88[i0] -> [34, i0, 35, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S33[] -> [29, 0, 0, 0, 0, 0, 0] : M = 1; S101[i0] -> [34, i0, 45, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S21[] -> [20, 0, 0, 0, 0, 0, 0] : M = 1; S32[] -> [28, 0, 0, 0, 0, 0, 0] : M = 1; S118[i0, i1] -> [34, i0, 48, i1, 4, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S79[i0] -> [34, i0, 26, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S38[i0] -> [34, i0, 0, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S108[i0, i1] -> [34, i0, 47, i1, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S65[i0, i1] -> [34, i0, 14, i1, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S91[i0] -> [34, i0, 38, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S17[] -> [16, 0, 0, 0, 0, 0, 0] : M = 1; S80[i0] -> [34, i0, 27, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S54[i0] -> [34, i0, 7, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S46[i0, i1] -> [34, i0, 3, i1, 2, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S68[i0] -> [34, i0, 15, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S116[i0, i1] -> [34, i0, 48, i1, 2, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S43[i0, i1, i2] -> [34, i0, 2, i1, 0, i2, 3] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S26[] -> [25, 0, 0, 0, 0, 0, 0] : M = 1; S31[i0] -> [27, i0, 1, 0, 0, 0, 0] : M = 1 and i0 >= 1 and i0 <= N; S69[i0] -> [34, i0, 16, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S24[] -> [23, 0, 0, 0, 0, 0, 0] : M = 1; S90[i0] -> [34, i0, 37, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S89[i0] -> [34, i0, 36, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S82[i0] -> [34, i0, 29, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S67[i0, i1] -> [34, i0, 14, i1, 2, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S58[i0] -> [34, i0, 11, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S109[i0, i1] -> [34, i0, 47, i1, 1, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S122[i0] -> [34, i0, 51, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S61[i0, i1, i2] -> [34, i0, 12, i1, 0, i2, 2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S1[] -> [0, 0, 0, 0, 0, 0, 0] : M = 1; S4[] -> [3, 0, 0, 0, 0, 0, 0] : M = 1; S86[i0] -> [34, i0, 33, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S14[] -> [13, 0, 0, 0, 0, 0, 0] : M = 1; S93[i0] -> [34, i0, 40, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S56[i0] -> [34, i0, 9, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S37[] -> [33, 0, 0, 0, 0, 0, 0] : M = 1; S125[i0] -> [34, i0, 54, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S96[i0, i1, i2] -> [34, i0, 42, i1, 0, i2, 1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N and i2 >= 1 and i2 <= N; S9[] -> [8, 0, 0, 0, 0, 0, 0] : M = 1; S41[i0, i1, i2] -> [34, i0, 2, i1, 0, i2, 1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S102[i0, i1, i2] -> [34, i0, 46, i1, 0, i2, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S112[i0, i1] -> [34, i0, 47, i1, 4, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S16[] -> [15, 0, 0, 0, 0, 0, 0] : M = 1; S85[i0] -> [34, i0, 32, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S42[i0, i1, i2] -> [34, i0, 2, i1, 0, i2, 2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S12[] -> [11, 0, 0, 0, 0, 0, 0] : M = 1; S55[i0] -> [34, i0, 8, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S11[] -> [10, 0, 0, 0, 0, 0, 0] : M = 1; S19[] -> [18, 0, 0, 0, 0, 0, 0] : M = 1; S107[i0, i1, i2] -> [34, i0, 46, i1, 0, i2, 5] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S98[i0, i1] -> [34, i0, 42, i1, 1, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N; S104[i0, i1, i2] -> [34, i0, 46, i1, 0, i2, 2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S29[i0, i1] -> [27, i0, 0, i1, 1, 0, 0] : M = 1 and i0 >= 1 and i0 <= N and i1 >= 1 and i1 <= N; S20[] -> [19, 0, 0, 0, 0, 0, 0] : M = 1; S103[i0, i1, i2] -> [34, i0, 46, i1, 0, i2, 1] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S105[i0, i1, i2] -> [34, i0, 46, i1, 0, i2, 3] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S97[i0, i1, i2] -> [34, i0, 42, i1, 0, i2, 2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= N and i2 >= 1 and i2 <= N; S44[i0, i1] -> [34, i0, 3, i1, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S106[i0, i1, i2] -> [34, i0, 46, i1, 0, i2, 4] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and i2 <= R; S34[] -> [30, 0, 0, 0, 0, 0, 0] : M = 1; S111[i0, i1] -> [34, i0, 47, i1, 3, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S99[i0] -> [34, i0, 43, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S81[i0] -> [34, i0, 28, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S23[] -> [22, 0, 0, 0, 0, 0, 0] : M = 1; S117[i0, i1] -> [34, i0, 48, i1, 3, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S74[i0] -> [34, i0, 21, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P; S113[i0, i1] -> [34, i0, 47, i1, 5, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q; S119[i0, i1] -> [34, i0, 48, i1, 5, 0, 0] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= R; S73[i0] -> [34, i0, 20, 0, 0, 0, 0] : M = 1 and i0 >= 2 and i0 <= P } [M, N, O, P, Q, R] -> { : } [M, N, O, P, Q, R] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/multi-stride2.in0000664000175000017500000000025312254313240020537 00000000000000{ S1[i0, i1, i2] -> [i0, j, k, 0] : 2i1 = -1 + i0 and 2j = -1 + i0 and 3k = -2 + i0 and 3i2 = -2 + i0 and i0 >= 0 and i0 <= 100 } { : } { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/vivien.in0000664000175000017500000000106712254313240017337 00000000000000[n] -> { S6[i0, i1] -> [2i0 + 2i1, 2 - i0, 0] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S2[i0, i1] -> [1 + 2i0 + 2i1, i1, 0] : 29i1 >= 1 - i0 and i0 <= n and i1 >= 1 and i1 <= -1 + i0; S1[i0] -> [2 + 2i0, 0, 0] : i0 >= 1 - 27n and i0 <= 28 + n; S4[i0, i1] -> [2i0 + 2i1, -i0, 0] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S3[i0] -> [1 + 4i0, 0, 0] : i0 >= 1 and i0 <= n; S5[i0, i1, i2] -> [2i0 + 2i1, 1 - i0, i2] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 and i2 <= -1 + i0 } [n] -> { : } [n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/stride3.c0000664000175000017500000000006512254313240017225 00000000000000for (int c0 = max(m, 1); c0 <= n; c0 += 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali4.in0000664000175000017500000000035012254313240021556 00000000000000[M] -> { S2[i0, i1] -> [1, i0, 0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M; S1[i0, i1] -> [0, i0, 0, i1, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M } [M] -> { : M >= 2 } [M] -> { [i, j, k, l, m] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/mod2.c0000664000175000017500000000011012254313240016500 00000000000000for (int c0 = 0; c0 <= 3; c0 += 1) if ((c0 + 1) % 3 >= 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/levenshtein-1-2-3.in0000664000175000017500000000160412254313240021015 00000000000000[M, N] -> { S8[i0, i1] -> [i0, i1, 7] : i0 >= 1 + N and 2i1 <= N + i0 and 2i1 >= -N + i0 and i0 <= -2 + 2M - N and N <= -2 + M and N >= 1; S1[0, 0] -> [0, 0, 0] : N <= -2 + M and N >= 1; S5[i0, i1] -> [i0, j, 4] : 2j = -N + i0 and 2i1 = -N + i0 and i0 >= 2 + N and i0 <= -2 + 2M - N and N >= 1; S7[i0, i1] -> [i0, i1, 6] : i0 >= 1 + N and 2i1 <= -1 - N + i0 and i0 <= -2 + 2M - N and 2i1 >= -2 - N + i0 and N <= -2 + M and N >= 1; S2[i0, 0] -> [i0, 0, 1] : i0 >= 1 and i0 <= N and N <= -2 + M; S3[i0, i0] -> [i0, i0, 2] : i0 >= 1 and i0 <= N and N <= -2 + M; S4[i0, i1] -> [i0, j, 3] : 2j = N + i0 and 2i1 = N + i0 and i0 >= 2 + N and i0 <= -2 + 2M - N and N >= 1; S6[i0, i1] -> [i0, i1, 5] : 2i1 <= -1 + N + i0 and i1 <= -1 + i0 and i1 >= 1 - M + i0 and 2i1 >= 1 - N + i0 and i1 >= 1 and i1 <= -1 + M and N <= -2 + M } [M, N] -> { : N <= -2 + M and N >= 1 } [M, N] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-pingali3.in0000664000175000017500000000042112254313240021554 00000000000000[M] -> { S2[i0, i1, i2] -> [1, i0, 0, i1, 1, i2, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M and i2 >= 1 and i2 <= M; S1[i0, i1] -> [0, i0, 0, i1, 0, 0, 0] : i0 >= 1 and i0 <= M and i1 >= 1 and i1 <= M } [M] -> { : } [M] -> { [i, j, k, l, m, n, o] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/block3.in0000664000175000017500000000014312254313240017206 00000000000000{ S2[] -> [1]; S3[i0] -> [i0] : i0 >= 0 and i0 <= 1; S1[] -> [0] } { : } { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/lu2.in0000664000175000017500000000045412254313240016540 00000000000000[n] -> { S1[i0, n, i0, i3] -> [i0, n, i0, i3, 0, 0] : i0 >= 1 and i0 <= n and i3 >= 1 + i0 and i3 <= n; S2[i0, i1, i2, i1, i0] -> [i0, i1, i2, i1, i0, 1] : i2 >= 1 and i2 <= n and i2 <= -1 + i1 and i1 <= n and i2 <= -1 + i0 and i0 <= n } [n] -> { : } [n] -> { [i, j, k, l, m, n'] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-4.c0000664000175000017500000000006112254313240020356 00000000000000for (int c0 = 0; c0 <= M + 1; c0 += 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/donotsimp.c0000664000175000017500000000022412254313240017661 00000000000000for (int c1 = 1; c1 <= 10; c1 += 1) { for (int c3 = 1; c3 <= c1; c3 += 1) S1(c1, c3); for (int c3 = 11; c3 <= M; c3 += 1) S2(c1, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/union.in0000664000175000017500000000026212254313240017163 00000000000000[M] -> { S1[i0] -> [i0] : M <= 10 and i0 >= 0 and i0 <= 100; S1[i0] -> [-i0] : M >= 11 and i0 >= 0 and i0 <= 100 } [M] -> { : M >= 1 or M <= -1 } [M] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_lcpc.in0000664000175000017500000000050012254313240017625 00000000000000[m, n, p] -> { S1[i, k, j] -> [i, j', j, 0] : 2k = -1 + i and 2j' = -1 + i and i >= 1 and i <= m and j >= 1 and j <= p; S2[i, k, j] -> [i, j', j, 1] : 2k = -1 + i and 2j' = -1 + i and i >= 1 and i <= n and j >= 1 and j <= i } [m, n, p] -> { : n = 6 and m >= 7 and p >= 7 } [m, n, p] -> { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-cholesky2.c0000664000175000017500000000057212254313240021574 00000000000000for (int c1 = 2; c1 < 3 * M; c1 += 1) { if ((c1 - 2) % 3 == 0) S1((c1 + 1) / 3); for (int c3 = (c1 + 1) / 3 + 1; c3 <= min(c1 - 2, M); c3 += 1) for (int c5 = -c3 + (c1 + c3 + 1) / 2 + 1; c5 <= min(c1 - c3, c3); c5 += 1) S3(c1 - c3 - c5 + 1, c3, c5); for (int c3 = -c1 + 2 * ((2 * c1 + 1) / 3) + 2; c3 <= min(c1, M); c3 += 2) S2((c1 - c3 + 2) / 2, c3); } cloog-0.18.2/isl/test_inputs/codegen/cloog/block.c0000664000175000017500000000004612254313240016741 00000000000000{ S1(); S3(0); S2(); S3(1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/min-2-1.in0000664000175000017500000000034312254313240017113 00000000000000[M, N] -> { S1[i0, i1, i2] -> [i0, i1, i2, 0] : i0 >= 1 and i1 >= 0 and i1 <= M and i1 <= i0 and i1 <= N - i0 and i2 >= 0 and i2 <= M and i2 <= i0 and i2 <= N - i0 } [M, N] -> { : } [M, N] -> { [i, j, k, l] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-tang-xue1.c0000664000175000017500000000045112254313240021476 00000000000000for (int c1 = 0; c1 <= 9; c1 += 2) for (int c3 = 0; c3 <= min(4, c1 + 3); c3 += 2) for (int c5 = max(c1, 1); c5 <= min(c1 + 1, c1 - c3 + 4); c5 += 1) for (int c7 = max(-c1 + c3 + c5, 1); c7 <= min(4, -c1 + c3 + c5 + 1); c7 += 1) S1(c1 / 2, (-c1 + c3) / 2, -c1 + c5, -c3 + c7); cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-4.in0000664000175000017500000000015612254313240020547 00000000000000[M] -> { S1[i0] -> [i0, 0] : i0 >= 0 and i0 <= 1 + M } [M] -> { : M >= 0 } [M] -> { [i, j] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/reservoir-mg-interp2.c0000664000175000017500000000105412254313240021651 00000000000000{ for (int c1 = 1; c1 < O; c1 += 1) for (int c3 = Q; c3 < N; c3 += 1) for (int c5 = P; c5 < M; c5 += 1) S1(c1, c3, c5); for (int c1 = 1; c1 < O; c1 += 1) for (int c3 = Q; c3 < N; c3 += 1) for (int c5 = 1; c5 < M; c5 += 1) S2(c1, c3, c5); for (int c1 = 1; c1 < O; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) for (int c5 = P; c5 < M; c5 += 1) S3(c1, c3, c5); for (int c1 = 1; c1 < O; c1 += 1) for (int c3 = 1; c3 < N; c3 += 1) for (int c5 = 1; c5 < M; c5 += 1) S4(c1, c3, c5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/singleton.in0000664000175000017500000000007612254313240020040 00000000000000{ S2[] -> [-1]; S1[] -> [0] } { : } { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/rectangle.c0000664000175000017500000000017012254313240017611 00000000000000for (int c0 = 0; c0 <= 2 * n; c0 += 1) for (int c1 = max(0, -n + c0); c1 <= min(c0, n); c1 += 1) S1(c1, c0 - c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/rectangle.in0000664000175000017500000000020512254313240017774 00000000000000[n] -> { S1[i0, i1] -> [i0 + i1] : i0 >= 0 and i0 <= n and i1 >= 0 and i1 <= n } [n] -> { : n >= 0 } [n] -> { [i] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/equality.in0000664000175000017500000000021112254313240017662 00000000000000{ S1[i0, 2i0] -> [i0, 2i0, 0] : i0 >= 0 and i0 <= 5; S2[i0, 4] -> [i0, 4, 1] : i0 >= 0 and i0 <= 5 } { : } { [i, j, k] -> atomic[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/lineality-1-2.c0000664000175000017500000000026212254313240020136 00000000000000for (int c0 = 1; c0 <= M; c0 += 1) { for (int c1 = 1; c1 < c0; c1 += 1) S1(c0, c1); S1(c0, c0); S2(c0, c0); for (int c1 = c0 + 1; c1 <= M; c1 += 1) S1(c0, c1); } cloog-0.18.2/isl/test_inputs/codegen/cloog/vivien2.in0000664000175000017500000000107612254313240017421 00000000000000[n] -> { S6[i0, i1] -> [2i0 + 2i1, 2 - i0, 0] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S2[i0, i1] -> [1 + 2i0 + 2i1, i1, 0] : 29i1 >= 1 - i0 and i0 <= n and i1 >= 1 and i1 <= -1 + i0; S1[i0] -> [2 + 2i0, 0, 0] : i0 >= 1 - 27n and i0 <= 28 + n; S4[i0, i1] -> [2i0 + 2i1, -i0, 0] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n; S3[i0] -> [1 + 4i0, 0, 0] : i0 >= 1 and i0 <= n; S5[i0, i1, i2] -> [2i0 + 2i1, 1 - i0, i2] : i0 >= 1 and i0 <= n and i1 >= 1 + i0 and i1 <= n and i2 >= 1 and i2 <= -1 + i0 } [n] -> { : n >= 30 } [n] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/unroll.c0000664000175000017500000000015012254313240017156 00000000000000{ S1(0); S1(1); S1(2); S1(3); S1(4); S1(5); S1(6); S1(7); S1(8); S1(9); S1(10); } cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_basic2.c0000664000175000017500000000014012254313240017663 00000000000000for (int c0 = 2; c0 <= n; c0 += 2) { if (c0 % 4 == 0) S2(c0, c0 / 4); S1(c0, c0 / 2); } cloog-0.18.2/isl/test_inputs/codegen/cloog/param-split.in0000664000175000017500000000016312254313240020264 00000000000000[M] -> { S1[i0] -> [i0, 0] : i0 >= 0 and i0 <= M; S2[0] -> [0, 1] } [M] -> { : } [M] -> { [i, j] -> atomic[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/0D-1.c0000664000175000017500000000000612254313240016244 00000000000000S1(); cloog-0.18.2/isl/test_inputs/codegen/cloog/basic-bounds-3.c0000664000175000017500000000005512254313240020360 00000000000000for (int c0 = 0; c0 <= M; c0 += 1) S1(c0); cloog-0.18.2/isl/test_inputs/codegen/cloog/walters3.c0000664000175000017500000000016712254313240017417 00000000000000{ for (int c0 = 2; c0 <= 8; c0 += 2) { S1(c0, c0 / 2, c0 / 2); S2(c0, c0 / 2, c0 / 2); } S2(10, 5, 5); } cloog-0.18.2/isl/test_inputs/codegen/cloog/nul_basic1.in0000664000175000017500000000020712254313240020052 00000000000000[M] -> { S1[i0, i1] -> [i0, j, 0] : 2j = i0 and 2i1 = i0 and i0 >= 0 and i0 <= M } [M] -> { : } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/min-3-1.c0000664000175000017500000000015212254313240016726 00000000000000for (int c0 = 0; c0 <= min(M, 10); c0 += 1) for (int c1 = 0; c1 <= min(M, 10); c1 += 1) S1(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/cloog/constant.in0000664000175000017500000000064712254313240017673 00000000000000[M] -> { S5[i0] -> [i0, 0, 1] : i0 >= 0 and i0 <= 1023 and i0 >= 1025 + M; S1[i0] -> [-1, i0, 0] : i0 >= 0 and i0 <= 1023 and i0 <= 1024 + M; S3[i0] -> [-1, i0, 2] : i0 >= 0 and i0 <= 1023; S2[i0] -> [-1, i0, 1] : i0 >= 0 and i0 <= 1023 and i0 >= 1025 + M; S4[i0] -> [i0, 0, 0] : i0 >= 0 and i0 <= 1023 and i0 <= 1024 + M; S6[i0] -> [i0, 0, 2] : i0 >= 0 and i0 <= 1023 } [M] -> { : } [M] -> { [i, j, k] -> separate[o0] } cloog-0.18.2/isl/test_inputs/codegen/cloog/youcef.c0000664000175000017500000000017012254313240017137 00000000000000for (int c0 = 0; c0 <= 5; c0 += 1) { S1(c0, c0); for (int c1 = c0; c1 <= 5; c1 += 1) S2(c0, c1); S3(c0, 5); } cloog-0.18.2/isl/test_inputs/codegen/atomic.in0000664000175000017500000000012612254313240016203 00000000000000{ a[i] -> [i] : 0 <= i < 10; b[i] -> [i+1] : 0 <= i < 10 } { : } { [i] -> atomic[x] } cloog-0.18.2/isl/test_inputs/codegen/shift_unroll.in0000664000175000017500000000015312254313240017437 00000000000000{ A[i,j] -> [2i,0,j]: 0 <= i,j < 10; B[i,j] -> [2i+1,1,j] : 0 <= i,j < 10 } { : } { [i,0,j] -> unroll[2] } cloog-0.18.2/isl/test_inputs/codegen/separation_class.c0000664000175000017500000000131112254313240020072 00000000000000{ for (int c0 = 0; c0 <= 8; c0 += 1) { for (int c1 = 0; c1 <= -c0 + 8; c1 += 1) for (int c2 = 10 * c0; c2 <= 10 * c0 + 9; c2 += 1) for (int c3 = 10 * c1; c3 <= 10 * c1 + 9; c3 += 1) A(c2, c3); for (int c1 = -c0 + 9; c1 <= -c0 + 10; c1 += 1) for (int c2 = 10 * c0; c2 <= min(10 * c0 + 9, -10 * c1 + 100); c2 += 1) for (int c3 = 10 * c1; c3 <= min(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); } for (int c0 = 9; c0 <= 10; c0 += 1) for (int c1 = 0; c1 <= -c0 + 10; c1 += 1) for (int c2 = 10 * c0; c2 <= min(10 * c0 + 9, -10 * c1 + 100); c2 += 1) for (int c3 = 10 * c1; c3 <= min(-c2 + 100, 10 * c1 + 9); c3 += 1) A(c2, c3); } cloog-0.18.2/isl/test_inputs/codegen/hoist.in0000664000175000017500000000103112254313240016051 00000000000000# check that the shared conditions ni >= t0 + 1 and nj >= t1 + 1 # are hoisted out of the loop [ni, nj, nk, t0, t1] -> { S_1[i, j, k] -> [t0, t1, k, i, j] : exists (e0 = [(-t0 + i)/16], e1 = [(-t1 + j)/16]: 16e0 = -t0 + i and 16e1 = -t1 + j and k >= 0 and j >= 0 and j <= -1 + nj and i >= 0 and i <= -1 + ni and k <= -1 + nk and ni >= 1 and nj >= 1 and nk >= 1 and j <= 63 and t1 >= 0 and i <= 63 and k <= 15 and t0 >= 0 and t1 <= 15 and t0 <= 15) } [t0, t1] -> { : 0 <= t0, t1 <= 15 } { [t0, t1, i5, i6, i7] -> unroll[x] : x >= 3} cloog-0.18.2/isl/test_inputs/codegen/pldi2012/0000775000175000017500000000000012254313240015715 500000000000000cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure8_b.in0000664000175000017500000000023412254313240020036 00000000000000[n] -> { s0[i] -> [i] : exists alpha: 1 <= i <= n and i = 4 alpha; s1[i] -> [i] : exists alpha: 1 <= i <= n and i = 4 alpha + 2 } [n] -> { : } [n] -> { } cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure7_b.in0000664000175000017500000000030212254313240020031 00000000000000[n] -> { s0[i] -> [i,0] : 1 <= i <= 100 and n > 1; s1[i,j] -> [i,j] : 1 <= i,j <= 100 and n > 1; s2[i,j] -> [i,j] : 1 <= i,j <= 100 } [n] -> { : } [n] -> { [i,j] -> separate[x] : x >= 2 } cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure8_b.c0000664000175000017500000000022312254313240017650 00000000000000{ for (int c0 = 2; c0 < n - 1; c0 += 4) { s1(c0); s0(c0 + 2); } if (n >= 4 * floord(n, 4) + 2 && n >= 0) s1(-(n % 4) + n + 2); } cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure8_a.in0000664000175000017500000000022212254313240020032 00000000000000[n] -> { s0[i,j] -> [i,j] : exists alpha, beta: 1 <= i <= n and i <= j <= n and i = 1 + 4 alpha and j = i + 3 beta} [n] -> { : } [n] -> {} cloog-0.18.2/isl/test_inputs/codegen/pldi2012/README0000664000175000017500000000012512254313240016513 00000000000000These examples are taken from the "Polyhedra Scanning Revisited" paper by Chun Chen. cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure7_c.c0000664000175000017500000000033212254313240017651 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) if (n >= 2) { s0(c0); for (int c1 = 1; c1 <= 100; c1 += 1) { s1(c0, c1); s2(c0, c1); } } else for (int c1 = 1; c1 <= 100; c1 += 1) s2(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure7_d.in0000664000175000017500000000030212254313240020033 00000000000000[n] -> { s0[i] -> [i,0] : 1 <= i <= 100 and n > 1; s1[i,j] -> [i,j] : 1 <= i,j <= 100 and n > 1; s2[i,j] -> [i,j] : 1 <= i,j <= 100 } [n] -> { : } [n] -> { [i,j] -> separate[x] : x >= 0 } cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure8_a.c0000664000175000017500000000013112254313240017645 00000000000000for (int c0 = 1; c0 <= n; c0 += 4) for (int c1 = c0; c1 <= n; c1 += 3) s0(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure7_b.c0000664000175000017500000000024212254313240017650 00000000000000for (int c0 = 1; c0 <= 100; c0 += 1) { if (n >= 2) s0(c0); for (int c1 = 1; c1 <= 100; c1 += 1) { if (n >= 2) s1(c0, c1); s2(c0, c1); } } cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure7_c.in0000664000175000017500000000030212254313240020032 00000000000000[n] -> { s0[i] -> [i,0] : 1 <= i <= 100 and n > 1; s1[i,j] -> [i,j] : 1 <= i,j <= 100 and n > 1; s2[i,j] -> [i,j] : 1 <= i,j <= 100 } [n] -> { : } [n] -> { [i,j] -> separate[x] : x >= 1 } cloog-0.18.2/isl/test_inputs/codegen/pldi2012/figure7_d.c0000664000175000017500000000040512254313240017653 00000000000000if (n >= 2) { for (int c0 = 1; c0 <= 100; c0 += 1) { s0(c0); for (int c1 = 1; c1 <= 100; c1 += 1) { s1(c0, c1); s2(c0, c1); } } } else for (int c0 = 1; c0 <= 100; c0 += 1) for (int c1 = 1; c1 <= 100; c1 += 1) s2(c0, c1); cloog-0.18.2/isl/test_inputs/codegen/stride6.c0000664000175000017500000000052112254313240016122 00000000000000for (int c1 = -1024; c1 <= 0; c1 += 32) for (int c2 = max(-((niter - c1) % 32) + niter - c1 - 32, -((niter - 1) % 32) + niter - 1); c2 <= min(niter + 1022, niter - c1 - 1); c2 += 32) for (int c5 = max(max(niter - c1 - c2 - 32, -c1 - 1023), 0); c5 <= min(min(-c1, niter - c1 - c2 - 1), 31); c5 += 1) S_4(niter - 1, -c1 - c5); cloog-0.18.2/isl/test_inputs/codegen/unroll.c0000664000175000017500000000005412254313240016056 00000000000000{ A(0); A(100000000); A(200000000); } cloog-0.18.2/isl/test_inputs/codegen/separate.in0000664000175000017500000000013012254313240016526 00000000000000{ a[i] -> [i] : 0 <= i < 10; b[i] -> [i+1] : 0 <= i < 10 } { : } { [i] -> separate[x] } cloog-0.18.2/isl/test_inputs/codegen/single_valued.c0000664000175000017500000000011412254313240017361 00000000000000if (2 * (63 * t1 % 64) + t1 <= 134) S(-(2 * ((t1 - 1) % 64)) + t1 + 126); cloog-0.18.2/isl/test_inputs/test3Deg3Var.pwqp0000664000175000017500000000007612254313240016126 00000000000000[p] -> { [n, m] -> (n + n^3) : n >= 1 and m >= n and m <= p } cloog-0.18.2/isl/test_inputs/fimmel.pip0000664000175000017500000000015612254313240014761 000000000000000 4 -1 7 6 1 2 6 0 0 -9 1 5 -3 0 0 0 1 2 -10 0 0 15 1 -2 6 0 0 -3 1 -2 -6 0 0 17 1 0 1 -1 0 0 1 1 0 0 -1 0 cloog-0.18.2/isl/test_inputs/basicLinear2.pwqp0000664000175000017500000000011112254313240016174 00000000000000[P, Q] -> { [n, m] -> n : n >= 1 and m >= n and m <= P and n >= -1 + Q } cloog-0.18.2/isl/test_inputs/small.pip0000664000175000017500000000007112254313240014614 000000000000000 2 -1 4 4 1 1 0 0 1 0 1 0 1 1 -3 12 1 -2 1 3 cloog-0.18.2/isl/test_inputs/application2.omega0000664000175000017500000000015212254313240016371 00000000000000{[x] : x >= 0 && x <= 20 } {[x] -> [y] : y = 2x} {[y]: Exists ( alpha : 2alpha = y && 0 <= y && y <= 40)} cloog-0.18.2/isl/test_inputs/convex14.polylib0000664000175000017500000000013112254313240016032 000000000000003 4 0 1 0 2 1 0 1 0 1 0 -1 2 3 4 1 1 0 0 1 0 1 0 1 0 -1 2 3 4 1 1 0 2 1 0 1 0 1 0 -1 2 cloog-0.18.2/isl/test_inputs/square.pip0000664000175000017500000000010512254313240015002 000000000000000 3 -1 4 5 1 1 0 0 0 1 -1 0 1 0 1 0 1 0 0 1 0 -1 1 0 cloog-0.18.2/isl/test_inputs/tobi.pip0000664000175000017500000000035712254313240014450 000000000000002 3 1 1 -281 1 -1 14000 -1 6 6 0 -392 0 8 -1 0 0 392 8 0 1 0 1 -1 0 0 0 0 1 1 0 0 0 35 1 392 0 0 1 0 1 -392 0 0 -1 280 Urs_unknowns cloog-0.18.2/isl/test_inputs/negative.pip0000664000175000017500000000013112254313240015303 000000000000001 3 # n 1 1 1 -1 # n >= 1 -1 2 4 # i n 1 1 1 0 1 # i >= -1 1 -1 1 0 # i <= n cloog-0.18.2/isl/test_inputs/basicLinear.pwqp0000664000175000017500000000010412254313240016114 00000000000000[P, Q] -> { [n, m] -> n : n >= 1 and m >= n and m <= P and m <= Q } cloog-0.18.2/isl/test_inputs/devos.pwqp0000664000175000017500000000015712254313240015030 00000000000000[U] -> { [i0] -> ((1/3 * U + 2/3 * i0) - [(U + 2i0)/3]) : 2i0 >= -3 - U and 2i0 <= -U and U >= 0 and U <= 10 } cloog-0.18.2/isl/test_inputs/equality3.pwqp0000664000175000017500000000011512254313240015622 00000000000000[m,n] -> { [x,y] -> x^2 * y : n = 2x + 4y and 0 <= x,y <= 10 and 3 n = 5 m } cloog-0.18.2/isl/test_inputs/convex0.polylib0000664000175000017500000000006612254313240015754 000000000000002 3 1 1 0 1 -1 1 2 3 1 1 -1 1 -1 2 2 3 1 1 0 1 -1 2 cloog-0.18.2/isl/test_inputs/convex12.polylib0000664000175000017500000000024112254313240016032 000000000000003 5 1 0 0 1 1 1 0 1 0 1 1 -1 -1 0 -2 3 5 1 0 0 1 2 1 1 -1 0 0 1 1 0 0 -1 1 5 1 0 0 1 2 cloog-0.18.2/isl/test_inputs/philippeNeg.pwqp0000664000175000017500000000012112254313240016143 00000000000000[N] -> { [i, j] -> ((1/2 * i + 1/2 * i^2) + j) : i <= N and j >= -1 and j <= i } cloog-0.18.2/isl/test_inputs/convex1.polylib0000664000175000017500000000037112254313240015754 00000000000000# {j,N | 0<=j<=N-1; 2<=N} 4 4 1 1 0 0 1 -1 1 -1 1 0 1 -2 1 0 0 1 # {j, N | 1<=j<=N; 1<=N} 4 4 1 1 0 -1 1 -1 1 0 1 0 1 -1 1 0 0 1 # {j,N | 0<=j<=N; 2<=j+N} 3 4 1 1 1 -2 1 1 0 0 1 -1 1 0 cloog-0.18.2/isl/test_inputs/product.pwqp0000664000175000017500000000017512254313240015370 00000000000000[N] -> { [i0, i1, i2] -> (i0^3 * i1^2 + N * i1 * i2) : i0 >= 0 and i0 <= N and i1 >= 0 and i1 <= N and i2 >= 0 and i2 <= N } cloog-0.18.2/isl/test_inputs/convex5.polylib0000664000175000017500000000012012254313240015750 000000000000002 4 0 1 0 -2 0 0 1 -6 2 4 0 1 0 -1 0 0 1 -4 3 4 0 -2 1 -2 1 1 0 -1 1 -1 0 2 cloog-0.18.2/isl/test_inputs/affine2.polylib0000664000175000017500000000011312254313240015675 000000000000005 5 1 -2 0 1 0 1 2 0 -1 1 1 0 -2 1 0 1 0 2 -1 1 1 0 0 1 -1 1 5 0 1 -1 0 0 cloog-0.18.2/isl/test_inputs/unexpanded.pwqp0000664000175000017500000000013312254313240016035 00000000000000{ [x, y] -> ((x - x^2) * y + (-x + x^2) * y^2) : x >= 0 and x <= 2 and y >= 0 and y <= 2 } cloog-0.18.2/isl/test_inputs/basicTestParameterPosNeg.pwqp0000664000175000017500000000007712254313240020607 00000000000000[p] -> { [n, m] -> (n + n^3) : n >= -1 and m >= n and m <= p } cloog-0.18.2/isl/test_inputs/convex9.polylib0000664000175000017500000000013612254313240015763 000000000000004 4 1 1 0 0 1 -1 0 1 1 0 1 0 1 0 -1 10 2 4 1 1 0 -10 0 0 -1 5 3 4 1 1 0 0 1 0 1 0 1 0 -1 10 cloog-0.18.2/isl/test_inputs/convex2.polylib0000664000175000017500000000066612254313240015764 00000000000000# {i,j,N | 1<=i<=N; 0<=j<=N-1; 2<=N} 6 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 0 1 0 -1 1 -1 1 0 0 1 -2 1 0 0 0 1 # {i,j,N | 1<=i<=N; 1<=j<=N; 2<=N} 6 5 1 1 0 0 -1 1 -1 0 1 0 1 0 1 0 -1 1 0 -1 1 0 1 0 0 1 -2 1 0 0 0 1 # {i,j,N | 1<=i<=N; 0<=j<=N; 2<=N} 6 5 1 0 0 1 -2 1 -1 0 1 0 1 0 -1 1 0 1 1 0 0 -1 1 0 1 0 0 1 0 0 0 1 cloog-0.18.2/isl/test_inputs/convex8.polylib0000664000175000017500000000061212254313240015761 000000000000004 5 1 1 1 1 0 1 0 -1 0 0 1 -1 0 0 2 1 1 1 -1 0 4 5 1 -1 1 0 2 1 1 -2 -2 -1 1 -1 0 2 3 1 1 0 0 -1 10 5 1 1 0 1 0 1 1 1 0 0 1 0 1 1 2 1 -3 1 -1 8 1 -3 1 1 8 1 0 1 -1 2 1 1 0 -1 0 1 1 -2 -1 0 1 -1 -3 2 6 1 1 -5 -2 2 cloog-0.18.2/isl/test_inputs/seghir-vd.pip0000664000175000017500000000031012254313240015370 000000000000000 6 -1 9 8 0 0 0 1 1 0 0 2 1 2 1 0 0 1 0 0 1 0 1 0 -1 0 0 -1 1 -2 -1 0 0 0 0 -1 1 7 3 0 0 0 0 -1 1 -6 -4 0 1 0 3 1 1 -7 -3 0 0 1 6 4 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 1 Urs_parms Urs_unknowns cloog-0.18.2/isl/test_inputs/split.pwqp0000664000175000017500000000006512254313240015041 00000000000000[n] -> { [x] -> -1 + [(x+5)/7] : -n - 20 <= x <= n } cloog-0.18.2/isl/test_inputs/philippe3vars3pars.pwqp0000664000175000017500000000022112254313240017442 00000000000000[N, M, L] -> { [i, j, k] -> (((1/2 * i + 1/2 * i^2) + j) + k^3) : i >= 0 and k >= -N + i and k >= -M - j and j <= L + i and L >= 0 and L >= -M } cloog-0.18.2/isl/test_inputs/philippe3vars.pwqp0000664000175000017500000000015412254313240016476 00000000000000[N] -> { [i, j, k] -> (((1/2 * i + 1/2 * i^2) + j) + k^3) : i >= 0 and k >= -N + i and k >= -j and j <= i } cloog-0.18.2/isl/test_inputs/equality5.pwqp0000664000175000017500000000015512254313240015630 00000000000000[m,n] -> { [x,y,z] -> x^2 * y + z + m + 13 * n: n = 2x + 4y and 0 <= x,y <= 10 and 3 n = 5 m and z = x + y } cloog-0.18.2/isl/test_inputs/gist1.polylib0000664000175000017500000000015512254313240015420 000000000000004 5 0 1 0 0 -1 0 0 1 0 1 0 0 0 1 -3 1 0 0 0 1 4 5 0 1 0 0 -1 0 0 1 1 -2 1 0 0 1 0 1 0 0 -1 3 1 5 0 0 1 0 1 cloog-0.18.2/isl/test_inputs/convex7.polylib0000664000175000017500000000006212254313240015757 000000000000001 4 0 0 1 0 2 4 1 1 -1 1 1 -1 -1 1 1 4 1 0 -1 1 cloog-0.18.2/isl/test_inputs/brisebarre.pip0000664000175000017500000000200112254313240015617 00000000000000# ---------------------- CONTEXT ---------------------- 1 2 1 0 -1 # ----------------------- DOMAIN ---------------------- 26 6 1 3 0 0 0 -98300 1 -3 0 0 0 98308 1 432 36 6 1 -14757611 1 -432 -36 -6 -1 14758510 1 54 9 3 1 -1923190 1 -54 -9 -3 -1 1923303 1 48 12 6 3 -1782238 1 -48 -12 -6 -3 1782339 1 27 9 6 4 -1045164 1 -27 -9 -6 -4 1045221 1 432 180 150 125 -17434139 1 -432 -180 -150 -125 17435038 1 6 3 3 3 -252443 1 -6 -3 -3 -3 252456 1 432 252 294 343 -18949275 1 -432 -252 -294 -343 18950174 1 27 18 24 32 -1234720 1 -27 -18 -24 -32 1234777 1 48 36 54 81 -2288453 1 -48 -36 -54 -81 2288554 1 54 45 75 125 -2684050 1 -54 -45 -75 -125 2684163 1 432 396 726 1331 -22386005 1 -432 -396 -726 -1331 22386904 1 3 3 6 12 -162072 1 -3 -3 -6 -12 162080 cloog-0.18.2/isl/test_inputs/cg1.pip0000664000175000017500000000032712254313240014162 000000000000002 4 1 1 0 -1 1 -1 1 0 -1 8 7 1 0 1 0 -1 0 0 1 0 -1 0 1 0 0 1 1 0 0 0 -1 0 1 -1 0 0 0 1 0 1 0 1 0 0 0 -1 1 0 -1 0 0 1 0 1 0 -1 1 0 0 -1 1 0 0 -1 0 1 0 cloog-0.18.2/isl/test_inputs/set.omega0000664000175000017500000000004412254313240014577 00000000000000{[y]: Exists ( alpha : 2alpha = y)} cloog-0.18.2/isl/test_inputs/sven.pip0000664000175000017500000000003512254313240014457 000000000000000 3 -1 2 3 1 1 -4 1 -1 10 cloog-0.18.2/isl/test_inputs/convex6.polylib0000664000175000017500000000031612254313240015760 000000000000003 4 1 1 1 -2 1 -1 1 2 1 0 -1 2 3 4 1 0 1 -1 1 1 -1 1 1 -1 -1 5 6 4 1 -1 0 4 1 1 0 0 1 1 2 -2 1 -1 2 2 1 1 -2 4 1 -1 -2 8 cloog-0.18.2/isl/test_inputs/equality2.pwqp0000664000175000017500000000007512254313240015626 00000000000000[n] -> { [x,y] -> x^2 * y : n = 2x + 4y and 0 <= x,y <= 10 } cloog-0.18.2/isl/test_inputs/convex10.polylib0000664000175000017500000000022212254313240016027 000000000000003 4 1 54 1 -4 1 2 -1 58 1 0 -1 6 4 4 1 54 1 -4 1 2 -1 58 1 0 1 -7 1 -4 1 0 4 4 1 54 1 -4 1 2 -1 58 1 0 -1 116 1 0 0 1 cloog-0.18.2/isl/test_inputs/esced.pip0000664000175000017500000000115012254313240014566 000000000000000 2 -1 16 18 1 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 0 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 1 -1 0 -1 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 cloog-0.18.2/isl/test_inputs/convex15.polylib0000664000175000017500000000506012254313240016041 0000000000000017 8 1 -1 -8 0 16 0 0 37 1 1 0 -48 0 2 0 -3 1 0 -16 -32 16 1 0 14 1 -1 24 0 0 1 0 18 1 -1 8 16 0 0 1 21 1 0 0 -16 0 1 1 -2 1 1 32 16 -32 0 0 -1 1 -1 16 16 0 0 0 28 1 1 -8 -32 0 1 0 -1 1 0 0 0 0 1 0 -1 1 0 16 16 -16 0 1 -1 1 1 8 0 -16 0 0 0 1 0 3 2 -2 0 0 0 1 0 1 2 -1 0 0 0 1 0 -1 -1 1 0 0 0 1 -1 8 0 0 1 2 4 1 -1 -24 -32 32 1 0 36 13 8 1 -1 0 0 0 1 3 -4 1 1 0 -48 0 2 0 -2 1 0 0 0 0 1 0 -1 1 0 -8 0 0 0 1 -1 1 0 3 2 -2 0 0 0 1 1 -16 -16 0 0 0 0 1 1 -24 0 0 0 0 0 1 0 1 0 0 0 0 0 1 0 -3 -2 2 0 0 1 1 -1 0 16 0 0 2 13 1 -1 24 0 0 1 0 20 1 -1 16 16 0 0 0 29 1 -1 0 48 0 0 0 45 31 8 1 0 1 0 0 0 0 0 1 0 0 -16 0 1 1 -2 1 0 0 0 0 1 0 -1 1 -1 8 0 0 1 2 4 1 0 3 2 -2 0 0 0 1 -1 24 0 0 1 0 20 1 1 0 -48 0 2 0 -2 1 -1 -24 -32 32 1 0 36 1 0 0 0 0 0 1 -1 1 -1 24 64 -16 0 0 45 1 -15 120 112 0 15 38 52 1 1 24 32 -32 0 0 0 1 0 -2 -2 2 0 0 1 1 -1 8 16 0 0 1 21 1 -15 120 352 0 0 23 307 1 1 -8 -32 0 1 0 -1 1 1 -8 0 0 0 0 0 1 1 -8 -16 0 0 0 0 1 0 16 16 -16 0 1 -1 1 -1 16 16 0 0 0 29 1 -1 -8 0 16 0 0 37 1 -1 8 32 0 0 0 37 1 1 8 0 -16 0 0 0 1 -15 360 592 -240 0 23 307 1 -1 -6 2 14 0 2 20 1 -15 360 352 -240 15 38 52 1 -1 8 48 0 0 0 45 1 0 -16 -32 16 1 0 14 1 -1 -6 -14 14 1 3 3 1 1 -38 -78 30 2 0 13 1 1 -3 -50 2 2 0 -1 cloog-0.18.2/isl/test_inputs/convex11.polylib0000664000175000017500000000014112254313240016030 000000000000003 4 1 0 -1 6 1 -1 1 1 1 1 1 -10 3 4 1 1 0 -4 1 -1 -1 8 1 -1 1 1 3 4 1 0 -1 6 1 1 0 -4 1 -1 1 1 cloog-0.18.2/isl/test_inputs/neg.pwqp0000664000175000017500000000011412254313240014452 00000000000000[n] -> { [i0] -> i0^2 : i0 >= -20 - n and i0 <= n and i0 <= -1 and n >= 0 } cloog-0.18.2/isl/test_inputs/convex4.polylib0000664000175000017500000000006212254313240015754 000000000000001 4 1 1 1 -6 2 4 0 1 0 -1 0 0 1 -4 1 4 1 1 1 -5 cloog-0.18.2/isl/test_inputs/affine.polylib0000664000175000017500000000025412254313240015621 00000000000000# the affine hull of {[a,b] : a=b && 1 <= a <= 163} ... 3 4 0 1 -1 0 1 1 0 -1 1 -1 0 163 # ... is {[a,b] : a=b} (and not {[In_1,In_2]}, as Omega 1.2 claims) 1 4 0 1 -1 0 cloog-0.18.2/isl/test_inputs/philippePolynomialCoeff1P.pwqp0000664000175000017500000000013612254313240020727 00000000000000[N] -> { [i, j] -> ((N * i + (1/5 * N + N^2) * i^2) + 5 * j) : i <= N and j >= 0 and j <= i } cloog-0.18.2/isl/test_inputs/max.pip0000664000175000017500000000010512254313240014267 000000000000000 3 -1 4 5 1 -1 0 1 0 1 0 -1 1 0 1 -1 3 -2 12 1 2 -1 -1 3 cloog-0.18.2/isl/test_inputs/equality1.pwqp0000664000175000017500000000010612254313240015620 00000000000000[n] -> { [x] -> 1 + [(x+1)/3] : exists a : x = 3a +1 && 0 <= x <= n } cloog-0.18.2/isl/test_inputs/ex.pip0000664000175000017500000000013312254313240014117 000000000000001 5 1 -1 1 1 0 -1 3 7 1 0 -1 0 1 0 0 1 -1 0 0 0 1 0 1 1 1 -1 0 0 0 cloog-0.18.2/isl/test_inputs/application.omega0000664000175000017500000000010012254313240016300 00000000000000{[x]} {[x] -> [y] : y = 2x} {[y]: Exists ( alpha : 2alpha = y)} cloog-0.18.2/isl/test_inputs/convex3.polylib0000664000175000017500000000007412254313240015756 000000000000001 4 1 1 1 -6 3 4 1 1 1 -3 1 1 0 -5 1 -1 0 10 1 4 1 1 1 -3 cloog-0.18.2/isl/test_inputs/boulet.pip0000664000175000017500000000015612254313240015002 000000000000000 3 -1 5 6 1 1 -1 2 0 0 1 0 1 1 4 20 1 0 -1 -1 0 0 1 0 1 -1 2 10 1 0 -1 1 2 10 Urs_parms Urs_unknowns cloog-0.18.2/isl/isl_map_private.h0000664000175000017500000003435212254313240013751 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_MAP_PRIVATE_H #define ISL_MAP_PRIVATE_H #define isl_basic_set isl_basic_map #define isl_set isl_map #define isl_basic_set_list isl_basic_map_list #define isl_set_list isl_map_list #include ISL_DECLARE_LIST(basic_map) ISL_DECLARE_LIST(map) #include #include #include #include /* A "basic map" is a relation between two sets of variables, * called the "in" and "out" variables. * A "basic set" is a basic map with a zero-dimensional * domain. * * It is implemented as a set with two extra fields: * n_in is the number of in variables * n_out is the number of out variables * n_in + n_out should be equal to set.dim */ struct isl_basic_map { int ref; #define ISL_BASIC_MAP_FINAL (1 << 0) #define ISL_BASIC_MAP_EMPTY (1 << 1) #define ISL_BASIC_MAP_NO_IMPLICIT (1 << 2) #define ISL_BASIC_MAP_NO_REDUNDANT (1 << 3) #define ISL_BASIC_MAP_RATIONAL (1 << 4) #define ISL_BASIC_MAP_NORMALIZED (1 << 5) #define ISL_BASIC_MAP_NORMALIZED_DIVS (1 << 6) #define ISL_BASIC_MAP_ALL_EQUALITIES (1 << 7) #define ISL_BASIC_SET_FINAL (1 << 0) #define ISL_BASIC_SET_EMPTY (1 << 1) #define ISL_BASIC_SET_NO_IMPLICIT (1 << 2) #define ISL_BASIC_SET_NO_REDUNDANT (1 << 3) #define ISL_BASIC_SET_RATIONAL (1 << 4) #define ISL_BASIC_SET_NORMALIZED (1 << 5) #define ISL_BASIC_SET_NORMALIZED_DIVS (1 << 6) #define ISL_BASIC_SET_ALL_EQUALITIES (1 << 7) unsigned flags; struct isl_ctx *ctx; isl_space *dim; unsigned extra; unsigned n_eq; unsigned n_ineq; size_t c_size; isl_int **eq; isl_int **ineq; unsigned n_div; isl_int **div; struct isl_vec *sample; struct isl_blk block; struct isl_blk block2; }; #undef EL #define EL isl_basic_set #include /* A "map" is a (possibly disjoint) union of basic maps. * A "set" is a (possibly disjoint) union of basic sets. * * Currently, the isl_set structure is identical to the isl_map structure * and the library depends on this correspondence internally. * However, users should not depend on this correspondence. */ struct isl_map { int ref; #define ISL_MAP_DISJOINT (1 << 0) #define ISL_MAP_NORMALIZED (1 << 1) #define ISL_SET_DISJOINT (1 << 0) #define ISL_SET_NORMALIZED (1 << 1) unsigned flags; struct isl_ctx *ctx; isl_space *dim; int n; size_t size; struct isl_basic_map *p[1]; }; #undef EL #define EL isl_set #include __isl_give isl_map *isl_map_realign(__isl_take isl_map *map, __isl_take isl_reordering *r); __isl_give isl_set *isl_set_realign(__isl_take isl_set *set, __isl_take isl_reordering *r); __isl_give isl_map *isl_map_reset(__isl_take isl_map *map, enum isl_dim_type type); __isl_give isl_basic_set *isl_basic_set_reset_space( __isl_take isl_basic_set *bset, __isl_take isl_space *dim); __isl_give isl_basic_map *isl_basic_map_reset_space( __isl_take isl_basic_map *bmap, __isl_take isl_space *dim); __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map, __isl_take isl_space *dim); unsigned isl_basic_map_offset(struct isl_basic_map *bmap, enum isl_dim_type type); unsigned isl_basic_set_offset(struct isl_basic_set *bset, enum isl_dim_type type); int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap); int isl_map_may_be_set(__isl_keep isl_map *map); int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set); int isl_basic_map_compatible_domain(struct isl_basic_map *bmap, struct isl_basic_set *bset); int isl_basic_map_compatible_range(struct isl_basic_map *bmap, struct isl_basic_set *bset); struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq); struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq); struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned pos); struct isl_map *isl_map_grow(struct isl_map *map, int n); struct isl_set *isl_set_grow(struct isl_set *set, int n); int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec); int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec); __isl_give isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq); __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n, unsigned flags); __isl_give isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq); __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n, unsigned flags); unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap); int isl_basic_map_alloc_equality(struct isl_basic_map *bmap); int isl_basic_set_alloc_equality(struct isl_basic_set *bset); int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n); int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n); int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n); int isl_basic_set_alloc_inequality(struct isl_basic_set *bset); int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap); int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n); int isl_basic_map_alloc_div(struct isl_basic_map *bmap); int isl_basic_set_alloc_div(struct isl_basic_set *bset); int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n); int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n); void isl_basic_map_inequality_to_equality( struct isl_basic_map *bmap, unsigned pos); int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos); int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos); int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos); int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos); __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset, isl_int *eq); __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap, isl_int *eq); __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset, isl_int *ineq); __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap, isl_int *ineq); int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos); struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset); struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap); struct isl_set *isl_set_cow(struct isl_set *set); struct isl_map *isl_map_cow(struct isl_map *map); struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap); struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset); struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset); void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b); struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap); __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map); struct isl_basic_map *isl_basic_map_align_divs( struct isl_basic_map *dst, struct isl_basic_map *src); struct isl_basic_set *isl_basic_set_align_divs( struct isl_basic_set *dst, struct isl_basic_set *src); __isl_give isl_basic_map *isl_basic_map_sort_divs( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_sort_divs(__isl_take isl_map *map); struct isl_basic_map *isl_basic_map_gauss( struct isl_basic_map *bmap, int *progress); struct isl_basic_set *isl_basic_set_gauss( struct isl_basic_set *bset, int *progress); __isl_give isl_basic_set *isl_basic_set_sort_constraints( __isl_take isl_basic_set *bset); int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1, const __isl_keep isl_basic_map *bmap2); int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); struct isl_basic_map *isl_basic_map_normalize_constraints( struct isl_basic_map *bmap); struct isl_basic_set *isl_basic_set_normalize_constraints( struct isl_basic_set *bset); struct isl_basic_map *isl_basic_map_implicit_equalities( struct isl_basic_map *bmap); struct isl_basic_set *isl_basic_map_underlying_set(struct isl_basic_map *bmap); __isl_give isl_basic_set *isl_basic_set_underlying_set( __isl_take isl_basic_set *bset); struct isl_set *isl_map_underlying_set(struct isl_map *map); struct isl_basic_map *isl_basic_map_overlying_set(struct isl_basic_set *bset, struct isl_basic_map *like); __isl_give isl_basic_set *isl_basic_set_drop_constraints_involving( __isl_take isl_basic_set *bset, unsigned first, unsigned n); __isl_give isl_basic_set *isl_basic_set_drop(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); struct isl_basic_map *isl_basic_map_drop(struct isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); struct isl_set *isl_set_drop(struct isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); struct isl_basic_set *isl_basic_set_drop_dims( struct isl_basic_set *bset, unsigned first, unsigned n); struct isl_set *isl_set_drop_dims( struct isl_set *set, unsigned first, unsigned n); struct isl_map *isl_map_drop_inputs( struct isl_map *map, unsigned first, unsigned n); struct isl_map *isl_map_drop(struct isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); struct isl_map *isl_map_remove_empty_parts(struct isl_map *map); struct isl_set *isl_set_remove_empty_parts(struct isl_set *set); struct isl_set *isl_set_normalize(struct isl_set *set); struct isl_set *isl_set_drop_vars( struct isl_set *set, unsigned first, unsigned n); struct isl_basic_map *isl_basic_map_eliminate_vars( struct isl_basic_map *bmap, unsigned pos, unsigned n); struct isl_basic_set *isl_basic_set_eliminate_vars( struct isl_basic_set *bset, unsigned pos, unsigned n); __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); int isl_basic_set_constraint_is_redundant(struct isl_basic_set **bset, isl_int *c, isl_int *opt_n, isl_int *opt_d); int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div); struct isl_basic_map *isl_basic_map_drop_redundant_divs( struct isl_basic_map *bmap); struct isl_basic_set *isl_basic_set_drop_redundant_divs( struct isl_basic_set *bset); struct isl_basic_set *isl_basic_set_recession_cone(struct isl_basic_set *bset); struct isl_basic_set *isl_basic_set_lineality_space(struct isl_basic_set *bset); struct isl_basic_set *isl_basic_set_set_rational(struct isl_basic_set *bset); __isl_give isl_set *isl_set_set_rational(__isl_take isl_set *set); __isl_give isl_basic_map *isl_basic_map_set_rational( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_set_rational(__isl_take isl_map *map); int isl_map_has_rational(__isl_keep isl_map *map); int isl_set_has_rational(__isl_keep isl_set *set); struct isl_mat; struct isl_basic_set *isl_basic_set_preimage(struct isl_basic_set *bset, struct isl_mat *mat); struct isl_set *isl_set_preimage(struct isl_set *set, struct isl_mat *mat); __isl_give isl_basic_set *isl_basic_set_transform_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, __isl_take isl_mat *trans); isl_int *isl_set_wrap_facet(__isl_keep isl_set *set, isl_int *facet, isl_int *ridge); int isl_basic_map_contains_point(__isl_keep isl_basic_map *bmap, __isl_keep isl_point *point); int isl_set_contains_point(__isl_keep isl_set *set, __isl_keep isl_point *point); int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset, unsigned first, unsigned n, int *signs); int isl_set_foreach_orthant(__isl_keep isl_set *set, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user), void *user); int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap, unsigned pos, isl_int *div); int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset, unsigned pos, isl_int *div); int isl_basic_map_is_div_constraint(__isl_keep isl_basic_map *bmap, isl_int *constraint, unsigned div); int isl_basic_set_is_div_constraint(__isl_keep isl_basic_set *bset, isl_int *constraint, unsigned div); __isl_give isl_basic_set *isl_basic_set_from_local_space( __isl_take isl_local_space *ls); __isl_give isl_basic_map *isl_basic_map_from_local_space( __isl_take isl_local_space *ls); __isl_give isl_basic_set *isl_basic_set_expand_divs( __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp); int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap); __isl_give isl_mat *isl_basic_set_get_divs(__isl_keep isl_basic_set *bset); __isl_give isl_mat *isl_basic_map_get_divs(__isl_keep isl_basic_map *bmap); __isl_give isl_map *isl_map_inline_foreach_basic_map(__isl_take isl_map *map, __isl_give isl_basic_map *(*fn)(__isl_take isl_basic_map *bmap)); __isl_give isl_map *isl_map_align_params_map_map_and( __isl_take isl_map *map1, __isl_take isl_map *map2, __isl_give isl_map *(*fn)(__isl_take isl_map *map1, __isl_take isl_map *map2)); int isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1, __isl_keep isl_map *map2, int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2)); int isl_basic_map_foreach_lexopt(__isl_keep isl_basic_map *bmap, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user); int isl_basic_set_foreach_lexopt(__isl_keep isl_basic_set *bset, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user); __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs); __isl_give isl_set *isl_set_gist_params_basic_set(__isl_take isl_set *set, __isl_take isl_basic_set *context); int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set); int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap); int isl_map_is_set(__isl_keep isl_map *map); #endif cloog-0.18.2/isl/isl_sample.c0000664000175000017500000012017012254313240012710 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include "isl_sample.h" #include "isl_sample_piplib.h" #include #include #include #include "isl_equalities.h" #include "isl_tab.h" #include "isl_basis_reduction.h" #include #include #include static struct isl_vec *empty_sample(struct isl_basic_set *bset) { struct isl_vec *vec; vec = isl_vec_alloc(bset->ctx, 0); isl_basic_set_free(bset); return vec; } /* Construct a zero sample of the same dimension as bset. * As a special case, if bset is zero-dimensional, this * function creates a zero-dimensional sample point. */ static struct isl_vec *zero_sample(struct isl_basic_set *bset) { unsigned dim; struct isl_vec *sample; dim = isl_basic_set_total_dim(bset); sample = isl_vec_alloc(bset->ctx, 1 + dim); if (sample) { isl_int_set_si(sample->el[0], 1); isl_seq_clr(sample->el + 1, dim); } isl_basic_set_free(bset); return sample; } static struct isl_vec *interval_sample(struct isl_basic_set *bset) { int i; isl_int t; struct isl_vec *sample; bset = isl_basic_set_simplify(bset); if (!bset) return NULL; if (isl_basic_set_plain_is_empty(bset)) return empty_sample(bset); if (bset->n_eq == 0 && bset->n_ineq == 0) return zero_sample(bset); sample = isl_vec_alloc(bset->ctx, 2); if (!sample) goto error; if (!bset) return NULL; isl_int_set_si(sample->block.data[0], 1); if (bset->n_eq > 0) { isl_assert(bset->ctx, bset->n_eq == 1, goto error); isl_assert(bset->ctx, bset->n_ineq == 0, goto error); if (isl_int_is_one(bset->eq[0][1])) isl_int_neg(sample->el[1], bset->eq[0][0]); else { isl_assert(bset->ctx, isl_int_is_negone(bset->eq[0][1]), goto error); isl_int_set(sample->el[1], bset->eq[0][0]); } isl_basic_set_free(bset); return sample; } isl_int_init(t); if (isl_int_is_one(bset->ineq[0][1])) isl_int_neg(sample->block.data[1], bset->ineq[0][0]); else isl_int_set(sample->block.data[1], bset->ineq[0][0]); for (i = 1; i < bset->n_ineq; ++i) { isl_seq_inner_product(sample->block.data, bset->ineq[i], 2, &t); if (isl_int_is_neg(t)) break; } isl_int_clear(t); if (i < bset->n_ineq) { isl_vec_free(sample); return empty_sample(bset); } isl_basic_set_free(bset); return sample; error: isl_basic_set_free(bset); isl_vec_free(sample); return NULL; } static struct isl_mat *independent_bounds(struct isl_basic_set *bset) { int i, j, n; struct isl_mat *dirs = NULL; struct isl_mat *bounds = NULL; unsigned dim; if (!bset) return NULL; dim = isl_basic_set_n_dim(bset); bounds = isl_mat_alloc(bset->ctx, 1+dim, 1+dim); if (!bounds) return NULL; isl_int_set_si(bounds->row[0][0], 1); isl_seq_clr(bounds->row[0]+1, dim); bounds->n_row = 1; if (bset->n_ineq == 0) return bounds; dirs = isl_mat_alloc(bset->ctx, dim, dim); if (!dirs) { isl_mat_free(bounds); return NULL; } isl_seq_cpy(dirs->row[0], bset->ineq[0]+1, dirs->n_col); isl_seq_cpy(bounds->row[1], bset->ineq[0], bounds->n_col); for (j = 1, n = 1; n < dim && j < bset->n_ineq; ++j) { int pos; isl_seq_cpy(dirs->row[n], bset->ineq[j]+1, dirs->n_col); pos = isl_seq_first_non_zero(dirs->row[n], dirs->n_col); if (pos < 0) continue; for (i = 0; i < n; ++i) { int pos_i; pos_i = isl_seq_first_non_zero(dirs->row[i], dirs->n_col); if (pos_i < pos) continue; if (pos_i > pos) break; isl_seq_elim(dirs->row[n], dirs->row[i], pos, dirs->n_col, NULL); pos = isl_seq_first_non_zero(dirs->row[n], dirs->n_col); if (pos < 0) break; } if (pos < 0) continue; if (i < n) { int k; isl_int *t = dirs->row[n]; for (k = n; k > i; --k) dirs->row[k] = dirs->row[k-1]; dirs->row[i] = t; } ++n; isl_seq_cpy(bounds->row[n], bset->ineq[j], bounds->n_col); } isl_mat_free(dirs); bounds->n_row = 1+n; return bounds; } static void swap_inequality(struct isl_basic_set *bset, int a, int b) { isl_int *t = bset->ineq[a]; bset->ineq[a] = bset->ineq[b]; bset->ineq[b] = t; } /* Skew into positive orthant and project out lineality space. * * We perform a unimodular transformation that turns a selected * maximal set of linearly independent bounds into constraints * on the first dimensions that impose that these first dimensions * are non-negative. In particular, the constraint matrix is lower * triangular with positive entries on the diagonal and negative * entries below. * If "bset" has a lineality space then these constraints (and therefore * all constraints in bset) only involve the first dimensions. * The remaining dimensions then do not appear in any constraints and * we can select any value for them, say zero. We therefore project * out this final dimensions and plug in the value zero later. This * is accomplished by simply dropping the final columns of * the unimodular transformation. */ static struct isl_basic_set *isl_basic_set_skew_to_positive_orthant( struct isl_basic_set *bset, struct isl_mat **T) { struct isl_mat *U = NULL; struct isl_mat *bounds = NULL; int i, j; unsigned old_dim, new_dim; *T = NULL; if (!bset) return NULL; isl_assert(bset->ctx, isl_basic_set_n_param(bset) == 0, goto error); isl_assert(bset->ctx, bset->n_div == 0, goto error); isl_assert(bset->ctx, bset->n_eq == 0, goto error); old_dim = isl_basic_set_n_dim(bset); /* Try to move (multiples of) unit rows up. */ for (i = 0, j = 0; i < bset->n_ineq; ++i) { int pos = isl_seq_first_non_zero(bset->ineq[i]+1, old_dim); if (pos < 0) continue; if (isl_seq_first_non_zero(bset->ineq[i]+1+pos+1, old_dim-pos-1) >= 0) continue; if (i != j) swap_inequality(bset, i, j); ++j; } bounds = independent_bounds(bset); if (!bounds) goto error; new_dim = bounds->n_row - 1; bounds = isl_mat_left_hermite(bounds, 1, &U, NULL); if (!bounds) goto error; U = isl_mat_drop_cols(U, 1 + new_dim, old_dim - new_dim); bset = isl_basic_set_preimage(bset, isl_mat_copy(U)); if (!bset) goto error; *T = U; isl_mat_free(bounds); return bset; error: isl_mat_free(bounds); isl_mat_free(U); isl_basic_set_free(bset); return NULL; } /* Find a sample integer point, if any, in bset, which is known * to have equalities. If bset contains no integer points, then * return a zero-length vector. * We simply remove the known equalities, compute a sample * in the resulting bset, using the specified recurse function, * and then transform the sample back to the original space. */ static struct isl_vec *sample_eq(struct isl_basic_set *bset, struct isl_vec *(*recurse)(struct isl_basic_set *)) { struct isl_mat *T; struct isl_vec *sample; if (!bset) return NULL; bset = isl_basic_set_remove_equalities(bset, &T, NULL); sample = recurse(bset); if (!sample || sample->size == 0) isl_mat_free(T); else sample = isl_mat_vec_product(T, sample); return sample; } /* Return a matrix containing the equalities of the tableau * in constraint form. The tableau is assumed to have * an associated bset that has been kept up-to-date. */ static struct isl_mat *tab_equalities(struct isl_tab *tab) { int i, j; int n_eq; struct isl_mat *eq; struct isl_basic_set *bset; if (!tab) return NULL; bset = isl_tab_peek_bset(tab); isl_assert(tab->mat->ctx, bset, return NULL); n_eq = tab->n_var - tab->n_col + tab->n_dead; if (tab->empty || n_eq == 0) return isl_mat_alloc(tab->mat->ctx, 0, tab->n_var); if (n_eq == tab->n_var) return isl_mat_identity(tab->mat->ctx, tab->n_var); eq = isl_mat_alloc(tab->mat->ctx, n_eq, tab->n_var); if (!eq) return NULL; for (i = 0, j = 0; i < tab->n_con; ++i) { if (tab->con[i].is_row) continue; if (tab->con[i].index >= 0 && tab->con[i].index >= tab->n_dead) continue; if (i < bset->n_eq) isl_seq_cpy(eq->row[j], bset->eq[i] + 1, tab->n_var); else isl_seq_cpy(eq->row[j], bset->ineq[i - bset->n_eq] + 1, tab->n_var); ++j; } isl_assert(bset->ctx, j == n_eq, goto error); return eq; error: isl_mat_free(eq); return NULL; } /* Compute and return an initial basis for the bounded tableau "tab". * * If the tableau is either full-dimensional or zero-dimensional, * the we simply return an identity matrix. * Otherwise, we construct a basis whose first directions correspond * to equalities. */ static struct isl_mat *initial_basis(struct isl_tab *tab) { int n_eq; struct isl_mat *eq; struct isl_mat *Q; tab->n_unbounded = 0; tab->n_zero = n_eq = tab->n_var - tab->n_col + tab->n_dead; if (tab->empty || n_eq == 0 || n_eq == tab->n_var) return isl_mat_identity(tab->mat->ctx, 1 + tab->n_var); eq = tab_equalities(tab); eq = isl_mat_left_hermite(eq, 0, NULL, &Q); if (!eq) return NULL; isl_mat_free(eq); Q = isl_mat_lin_to_aff(Q); return Q; } /* Compute the minimum of the current ("level") basis row over "tab" * and store the result in position "level" of "min". */ static enum isl_lp_result compute_min(isl_ctx *ctx, struct isl_tab *tab, __isl_keep isl_vec *min, int level) { return isl_tab_min(tab, tab->basis->row[1 + level], ctx->one, &min->el[level], NULL, 0); } /* Compute the maximum of the current ("level") basis row over "tab" * and store the result in position "level" of "max". */ static enum isl_lp_result compute_max(isl_ctx *ctx, struct isl_tab *tab, __isl_keep isl_vec *max, int level) { enum isl_lp_result res; unsigned dim = tab->n_var; isl_seq_neg(tab->basis->row[1 + level] + 1, tab->basis->row[1 + level] + 1, dim); res = isl_tab_min(tab, tab->basis->row[1 + level], ctx->one, &max->el[level], NULL, 0); isl_seq_neg(tab->basis->row[1 + level] + 1, tab->basis->row[1 + level] + 1, dim); isl_int_neg(max->el[level], max->el[level]); return res; } /* Perform a greedy search for an integer point in the set represented * by "tab", given that the minimal rational value (rounded up to the * nearest integer) at "level" is smaller than the maximal rational * value (rounded down to the nearest integer). * * Return 1 if we have found an integer point (if tab->n_unbounded > 0 * then we may have only found integer values for the bounded dimensions * and it is the responsibility of the caller to extend this solution * to the unbounded dimensions). * Return 0 if greedy search did not result in a solution. * Return -1 if some error occurred. * * We assign a value half-way between the minimum and the maximum * to the current dimension and check if the minimal value of the * next dimension is still smaller than (or equal) to the maximal value. * We continue this process until either * - the minimal value (rounded up) is greater than the maximal value * (rounded down). In this case, greedy search has failed. * - we have exhausted all bounded dimensions, meaning that we have * found a solution. * - the sample value of the tableau is integral. * - some error has occurred. */ static int greedy_search(isl_ctx *ctx, struct isl_tab *tab, __isl_keep isl_vec *min, __isl_keep isl_vec *max, int level) { struct isl_tab_undo *snap; enum isl_lp_result res; snap = isl_tab_snap(tab); do { isl_int_add(tab->basis->row[1 + level][0], min->el[level], max->el[level]); isl_int_fdiv_q_ui(tab->basis->row[1 + level][0], tab->basis->row[1 + level][0], 2); isl_int_neg(tab->basis->row[1 + level][0], tab->basis->row[1 + level][0]); if (isl_tab_add_valid_eq(tab, tab->basis->row[1 + level]) < 0) return -1; isl_int_set_si(tab->basis->row[1 + level][0], 0); if (++level >= tab->n_var - tab->n_unbounded) return 1; if (isl_tab_sample_is_integer(tab)) return 1; res = compute_min(ctx, tab, min, level); if (res == isl_lp_error) return -1; if (res != isl_lp_ok) isl_die(ctx, isl_error_internal, "expecting bounded rational solution", return -1); res = compute_max(ctx, tab, max, level); if (res == isl_lp_error) return -1; if (res != isl_lp_ok) isl_die(ctx, isl_error_internal, "expecting bounded rational solution", return -1); } while (isl_int_le(min->el[level], max->el[level])); if (isl_tab_rollback(tab, snap) < 0) return -1; return 0; } /* Given a tableau representing a set, find and return * an integer point in the set, if there is any. * * We perform a depth first search * for an integer point, by scanning all possible values in the range * attained by a basis vector, where an initial basis may have been set * by the calling function. Otherwise an initial basis that exploits * the equalities in the tableau is created. * tab->n_zero is currently ignored and is clobbered by this function. * * The tableau is allowed to have unbounded direction, but then * the calling function needs to set an initial basis, with the * unbounded directions last and with tab->n_unbounded set * to the number of unbounded directions. * Furthermore, the calling functions needs to add shifted copies * of all constraints involving unbounded directions to ensure * that any feasible rational value in these directions can be rounded * up to yield a feasible integer value. * In particular, let B define the given basis x' = B x * and let T be the inverse of B, i.e., X = T x'. * Let a x + c >= 0 be a constraint of the set represented by the tableau, * or a T x' + c >= 0 in terms of the given basis. Assume that * the bounded directions have an integer value, then we can safely * round up the values for the unbounded directions if we make sure * that x' not only satisfies the original constraint, but also * the constraint "a T x' + c + s >= 0" with s the sum of all * negative values in the last n_unbounded entries of "a T". * The calling function therefore needs to add the constraint * a x + c + s >= 0. The current function then scans the first * directions for an integer value and once those have been found, * it can compute "T ceil(B x)" to yield an integer point in the set. * Note that during the search, the first rows of B may be changed * by a basis reduction, but the last n_unbounded rows of B remain * unaltered and are also not mixed into the first rows. * * The search is implemented iteratively. "level" identifies the current * basis vector. "init" is true if we want the first value at the current * level and false if we want the next value. * * At the start of each level, we first check if we can find a solution * using greedy search. If not, we continue with the exhaustive search. * * The initial basis is the identity matrix. If the range in some direction * contains more than one integer value, we perform basis reduction based * on the value of ctx->opt->gbr * - ISL_GBR_NEVER: never perform basis reduction * - ISL_GBR_ONCE: only perform basis reduction the first * time such a range is encountered * - ISL_GBR_ALWAYS: always perform basis reduction when * such a range is encountered * * When ctx->opt->gbr is set to ISL_GBR_ALWAYS, then we allow the basis * reduction computation to return early. That is, as soon as it * finds a reasonable first direction. */ struct isl_vec *isl_tab_sample(struct isl_tab *tab) { unsigned dim; unsigned gbr; struct isl_ctx *ctx; struct isl_vec *sample; struct isl_vec *min; struct isl_vec *max; enum isl_lp_result res; int level; int init; int reduced; struct isl_tab_undo **snap; if (!tab) return NULL; if (tab->empty) return isl_vec_alloc(tab->mat->ctx, 0); if (!tab->basis) tab->basis = initial_basis(tab); if (!tab->basis) return NULL; isl_assert(tab->mat->ctx, tab->basis->n_row == tab->n_var + 1, return NULL); isl_assert(tab->mat->ctx, tab->basis->n_col == tab->n_var + 1, return NULL); ctx = tab->mat->ctx; dim = tab->n_var; gbr = ctx->opt->gbr; if (tab->n_unbounded == tab->n_var) { sample = isl_tab_get_sample_value(tab); sample = isl_mat_vec_product(isl_mat_copy(tab->basis), sample); sample = isl_vec_ceil(sample); sample = isl_mat_vec_inverse_product(isl_mat_copy(tab->basis), sample); return sample; } if (isl_tab_extend_cons(tab, dim + 1) < 0) return NULL; min = isl_vec_alloc(ctx, dim); max = isl_vec_alloc(ctx, dim); snap = isl_alloc_array(ctx, struct isl_tab_undo *, dim); if (!min || !max || !snap) goto error; level = 0; init = 1; reduced = 0; while (level >= 0) { if (init) { int choice; res = compute_min(ctx, tab, min, level); if (res == isl_lp_error) goto error; if (res != isl_lp_ok) isl_die(ctx, isl_error_internal, "expecting bounded rational solution", goto error); if (isl_tab_sample_is_integer(tab)) break; res = compute_max(ctx, tab, max, level); if (res == isl_lp_error) goto error; if (res != isl_lp_ok) isl_die(ctx, isl_error_internal, "expecting bounded rational solution", goto error); if (isl_tab_sample_is_integer(tab)) break; choice = isl_int_lt(min->el[level], max->el[level]); if (choice) { int g; g = greedy_search(ctx, tab, min, max, level); if (g < 0) goto error; if (g) break; } if (!reduced && choice && ctx->opt->gbr != ISL_GBR_NEVER) { unsigned gbr_only_first; if (ctx->opt->gbr == ISL_GBR_ONCE) ctx->opt->gbr = ISL_GBR_NEVER; tab->n_zero = level; gbr_only_first = ctx->opt->gbr_only_first; ctx->opt->gbr_only_first = ctx->opt->gbr == ISL_GBR_ALWAYS; tab = isl_tab_compute_reduced_basis(tab); ctx->opt->gbr_only_first = gbr_only_first; if (!tab || !tab->basis) goto error; reduced = 1; continue; } reduced = 0; snap[level] = isl_tab_snap(tab); } else isl_int_add_ui(min->el[level], min->el[level], 1); if (isl_int_gt(min->el[level], max->el[level])) { level--; init = 0; if (level >= 0) if (isl_tab_rollback(tab, snap[level]) < 0) goto error; continue; } isl_int_neg(tab->basis->row[1 + level][0], min->el[level]); if (isl_tab_add_valid_eq(tab, tab->basis->row[1 + level]) < 0) goto error; isl_int_set_si(tab->basis->row[1 + level][0], 0); if (level + tab->n_unbounded < dim - 1) { ++level; init = 1; continue; } break; } if (level >= 0) { sample = isl_tab_get_sample_value(tab); if (!sample) goto error; if (tab->n_unbounded && !isl_int_is_one(sample->el[0])) { sample = isl_mat_vec_product(isl_mat_copy(tab->basis), sample); sample = isl_vec_ceil(sample); sample = isl_mat_vec_inverse_product( isl_mat_copy(tab->basis), sample); } } else sample = isl_vec_alloc(ctx, 0); ctx->opt->gbr = gbr; isl_vec_free(min); isl_vec_free(max); free(snap); return sample; error: ctx->opt->gbr = gbr; isl_vec_free(min); isl_vec_free(max); free(snap); return NULL; } static struct isl_vec *sample_bounded(struct isl_basic_set *bset); /* Compute a sample point of the given basic set, based on the given, * non-trivial factorization. */ static __isl_give isl_vec *factored_sample(__isl_take isl_basic_set *bset, __isl_take isl_factorizer *f) { int i, n; isl_vec *sample = NULL; isl_ctx *ctx; unsigned nparam; unsigned nvar; ctx = isl_basic_set_get_ctx(bset); if (!ctx) goto error; nparam = isl_basic_set_dim(bset, isl_dim_param); nvar = isl_basic_set_dim(bset, isl_dim_set); sample = isl_vec_alloc(ctx, 1 + isl_basic_set_total_dim(bset)); if (!sample) goto error; isl_int_set_si(sample->el[0], 1); bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset); for (i = 0, n = 0; i < f->n_group; ++i) { isl_basic_set *bset_i; isl_vec *sample_i; bset_i = isl_basic_set_copy(bset); bset_i = isl_basic_set_drop_constraints_involving(bset_i, nparam + n + f->len[i], nvar - n - f->len[i]); bset_i = isl_basic_set_drop_constraints_involving(bset_i, nparam, n); bset_i = isl_basic_set_drop(bset_i, isl_dim_set, n + f->len[i], nvar - n - f->len[i]); bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n); sample_i = sample_bounded(bset_i); if (!sample_i) goto error; if (sample_i->size == 0) { isl_basic_set_free(bset); isl_factorizer_free(f); isl_vec_free(sample); return sample_i; } isl_seq_cpy(sample->el + 1 + nparam + n, sample_i->el + 1, f->len[i]); isl_vec_free(sample_i); n += f->len[i]; } f->morph = isl_morph_inverse(f->morph); sample = isl_morph_vec(isl_morph_copy(f->morph), sample); isl_basic_set_free(bset); isl_factorizer_free(f); return sample; error: isl_basic_set_free(bset); isl_factorizer_free(f); isl_vec_free(sample); return NULL; } /* Given a basic set that is known to be bounded, find and return * an integer point in the basic set, if there is any. * * After handling some trivial cases, we construct a tableau * and then use isl_tab_sample to find a sample, passing it * the identity matrix as initial basis. */ static struct isl_vec *sample_bounded(struct isl_basic_set *bset) { unsigned dim; struct isl_ctx *ctx; struct isl_vec *sample; struct isl_tab *tab = NULL; isl_factorizer *f; if (!bset) return NULL; if (isl_basic_set_plain_is_empty(bset)) return empty_sample(bset); dim = isl_basic_set_total_dim(bset); if (dim == 0) return zero_sample(bset); if (dim == 1) return interval_sample(bset); if (bset->n_eq > 0) return sample_eq(bset, sample_bounded); f = isl_basic_set_factorizer(bset); if (!f) goto error; if (f->n_group != 0) return factored_sample(bset, f); isl_factorizer_free(f); ctx = bset->ctx; tab = isl_tab_from_basic_set(bset, 1); if (tab && tab->empty) { isl_tab_free(tab); ISL_F_SET(bset, ISL_BASIC_SET_EMPTY); sample = isl_vec_alloc(bset->ctx, 0); isl_basic_set_free(bset); return sample; } if (!ISL_F_ISSET(bset, ISL_BASIC_SET_NO_IMPLICIT)) if (isl_tab_detect_implicit_equalities(tab) < 0) goto error; sample = isl_tab_sample(tab); if (!sample) goto error; if (sample->size > 0) { isl_vec_free(bset->sample); bset->sample = isl_vec_copy(sample); } isl_basic_set_free(bset); isl_tab_free(tab); return sample; error: isl_basic_set_free(bset); isl_tab_free(tab); return NULL; } /* Given a basic set "bset" and a value "sample" for the first coordinates * of bset, plug in these values and drop the corresponding coordinates. * * We do this by computing the preimage of the transformation * * [ 1 0 ] * x = [ s 0 ] x' * [ 0 I ] * * where [1 s] is the sample value and I is the identity matrix of the * appropriate dimension. */ static struct isl_basic_set *plug_in(struct isl_basic_set *bset, struct isl_vec *sample) { int i; unsigned total; struct isl_mat *T; if (!bset || !sample) goto error; total = isl_basic_set_total_dim(bset); T = isl_mat_alloc(bset->ctx, 1 + total, 1 + total - (sample->size - 1)); if (!T) goto error; for (i = 0; i < sample->size; ++i) { isl_int_set(T->row[i][0], sample->el[i]); isl_seq_clr(T->row[i] + 1, T->n_col - 1); } for (i = 0; i < T->n_col - 1; ++i) { isl_seq_clr(T->row[sample->size + i], T->n_col); isl_int_set_si(T->row[sample->size + i][1 + i], 1); } isl_vec_free(sample); bset = isl_basic_set_preimage(bset, T); return bset; error: isl_basic_set_free(bset); isl_vec_free(sample); return NULL; } /* Given a basic set "bset", return any (possibly non-integer) point * in the basic set. */ static struct isl_vec *rational_sample(struct isl_basic_set *bset) { struct isl_tab *tab; struct isl_vec *sample; if (!bset) return NULL; tab = isl_tab_from_basic_set(bset, 0); sample = isl_tab_get_sample_value(tab); isl_tab_free(tab); isl_basic_set_free(bset); return sample; } /* Given a linear cone "cone" and a rational point "vec", * construct a polyhedron with shifted copies of the constraints in "cone", * i.e., a polyhedron with "cone" as its recession cone, such that each * point x in this polyhedron is such that the unit box positioned at x * lies entirely inside the affine cone 'vec + cone'. * Any rational point in this polyhedron may therefore be rounded up * to yield an integer point that lies inside said affine cone. * * Denote the constraints of cone by " >= 0" and the rational * point "vec" by v/d. * Let b_i = . Then the affine cone 'vec + cone' is given * by - b/d >= 0. * The polyhedron - ceil{b/d} >= 0 is a subset of this affine cone. * We prefer this polyhedron over the actual affine cone because it doesn't * require a scaling of the constraints. * If each of the vertices of the unit cube positioned at x lies inside * this polyhedron, then the whole unit cube at x lies inside the affine cone. * We therefore impose that x' = x + \sum e_i, for any selection of unit * vectors lies inside the polyhedron, i.e., * * - ceil{b/d} = + sum a_i - ceil{b/d} >= 0 * * The most stringent of these constraints is the one that selects * all negative a_i, so the polyhedron we are looking for has constraints * * + sum_{a_i < 0} a_i - ceil{b/d} >= 0 * * Note that if cone were known to have only non-negative rays * (which can be accomplished by a unimodular transformation), * then we would only have to check the points x' = x + e_i * and we only have to add the smallest negative a_i (if any) * instead of the sum of all negative a_i. */ static struct isl_basic_set *shift_cone(struct isl_basic_set *cone, struct isl_vec *vec) { int i, j, k; unsigned total; struct isl_basic_set *shift = NULL; if (!cone || !vec) goto error; isl_assert(cone->ctx, cone->n_eq == 0, goto error); total = isl_basic_set_total_dim(cone); shift = isl_basic_set_alloc_space(isl_basic_set_get_space(cone), 0, 0, cone->n_ineq); for (i = 0; i < cone->n_ineq; ++i) { k = isl_basic_set_alloc_inequality(shift); if (k < 0) goto error; isl_seq_cpy(shift->ineq[k] + 1, cone->ineq[i] + 1, total); isl_seq_inner_product(shift->ineq[k] + 1, vec->el + 1, total, &shift->ineq[k][0]); isl_int_cdiv_q(shift->ineq[k][0], shift->ineq[k][0], vec->el[0]); isl_int_neg(shift->ineq[k][0], shift->ineq[k][0]); for (j = 0; j < total; ++j) { if (isl_int_is_nonneg(shift->ineq[k][1 + j])) continue; isl_int_add(shift->ineq[k][0], shift->ineq[k][0], shift->ineq[k][1 + j]); } } isl_basic_set_free(cone); isl_vec_free(vec); return isl_basic_set_finalize(shift); error: isl_basic_set_free(shift); isl_basic_set_free(cone); isl_vec_free(vec); return NULL; } /* Given a rational point vec in a (transformed) basic set, * such that cone is the recession cone of the original basic set, * "round up" the rational point to an integer point. * * We first check if the rational point just happens to be integer. * If not, we transform the cone in the same way as the basic set, * pick a point x in this cone shifted to the rational point such that * the whole unit cube at x is also inside this affine cone. * Then we simply round up the coordinates of x and return the * resulting integer point. */ static struct isl_vec *round_up_in_cone(struct isl_vec *vec, struct isl_basic_set *cone, struct isl_mat *U) { unsigned total; if (!vec || !cone || !U) goto error; isl_assert(vec->ctx, vec->size != 0, goto error); if (isl_int_is_one(vec->el[0])) { isl_mat_free(U); isl_basic_set_free(cone); return vec; } total = isl_basic_set_total_dim(cone); cone = isl_basic_set_preimage(cone, U); cone = isl_basic_set_remove_dims(cone, isl_dim_set, 0, total - (vec->size - 1)); cone = shift_cone(cone, vec); vec = rational_sample(cone); vec = isl_vec_ceil(vec); return vec; error: isl_mat_free(U); isl_vec_free(vec); isl_basic_set_free(cone); return NULL; } /* Concatenate two integer vectors, i.e., two vectors with denominator * (stored in element 0) equal to 1. */ static struct isl_vec *vec_concat(struct isl_vec *vec1, struct isl_vec *vec2) { struct isl_vec *vec; if (!vec1 || !vec2) goto error; isl_assert(vec1->ctx, vec1->size > 0, goto error); isl_assert(vec2->ctx, vec2->size > 0, goto error); isl_assert(vec1->ctx, isl_int_is_one(vec1->el[0]), goto error); isl_assert(vec2->ctx, isl_int_is_one(vec2->el[0]), goto error); vec = isl_vec_alloc(vec1->ctx, vec1->size + vec2->size - 1); if (!vec) goto error; isl_seq_cpy(vec->el, vec1->el, vec1->size); isl_seq_cpy(vec->el + vec1->size, vec2->el + 1, vec2->size - 1); isl_vec_free(vec1); isl_vec_free(vec2); return vec; error: isl_vec_free(vec1); isl_vec_free(vec2); return NULL; } /* Give a basic set "bset" with recession cone "cone", compute and * return an integer point in bset, if any. * * If the recession cone is full-dimensional, then we know that * bset contains an infinite number of integer points and it is * fairly easy to pick one of them. * If the recession cone is not full-dimensional, then we first * transform bset such that the bounded directions appear as * the first dimensions of the transformed basic set. * We do this by using a unimodular transformation that transforms * the equalities in the recession cone to equalities on the first * dimensions. * * The transformed set is then projected onto its bounded dimensions. * Note that to compute this projection, we can simply drop all constraints * involving any of the unbounded dimensions since these constraints * cannot be combined to produce a constraint on the bounded dimensions. * To see this, assume that there is such a combination of constraints * that produces a constraint on the bounded dimensions. This means * that some combination of the unbounded dimensions has both an upper * bound and a lower bound in terms of the bounded dimensions, but then * this combination would be a bounded direction too and would have been * transformed into a bounded dimensions. * * We then compute a sample value in the bounded dimensions. * If no such value can be found, then the original set did not contain * any integer points and we are done. * Otherwise, we plug in the value we found in the bounded dimensions, * project out these bounded dimensions and end up with a set with * a full-dimensional recession cone. * A sample point in this set is computed by "rounding up" any * rational point in the set. * * The sample points in the bounded and unbounded dimensions are * then combined into a single sample point and transformed back * to the original space. */ __isl_give isl_vec *isl_basic_set_sample_with_cone( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *cone) { unsigned total; unsigned cone_dim; struct isl_mat *M, *U; struct isl_vec *sample; struct isl_vec *cone_sample; struct isl_ctx *ctx; struct isl_basic_set *bounded; if (!bset || !cone) goto error; ctx = bset->ctx; total = isl_basic_set_total_dim(cone); cone_dim = total - cone->n_eq; M = isl_mat_sub_alloc6(bset->ctx, cone->eq, 0, cone->n_eq, 1, total); M = isl_mat_left_hermite(M, 0, &U, NULL); if (!M) goto error; isl_mat_free(M); U = isl_mat_lin_to_aff(U); bset = isl_basic_set_preimage(bset, isl_mat_copy(U)); bounded = isl_basic_set_copy(bset); bounded = isl_basic_set_drop_constraints_involving(bounded, total - cone_dim, cone_dim); bounded = isl_basic_set_drop_dims(bounded, total - cone_dim, cone_dim); sample = sample_bounded(bounded); if (!sample || sample->size == 0) { isl_basic_set_free(bset); isl_basic_set_free(cone); isl_mat_free(U); return sample; } bset = plug_in(bset, isl_vec_copy(sample)); cone_sample = rational_sample(bset); cone_sample = round_up_in_cone(cone_sample, cone, isl_mat_copy(U)); sample = vec_concat(sample, cone_sample); sample = isl_mat_vec_product(U, sample); return sample; error: isl_basic_set_free(cone); isl_basic_set_free(bset); return NULL; } static void vec_sum_of_neg(struct isl_vec *v, isl_int *s) { int i; isl_int_set_si(*s, 0); for (i = 0; i < v->size; ++i) if (isl_int_is_neg(v->el[i])) isl_int_add(*s, *s, v->el[i]); } /* Given a tableau "tab", a tableau "tab_cone" that corresponds * to the recession cone and the inverse of a new basis U = inv(B), * with the unbounded directions in B last, * add constraints to "tab" that ensure any rational value * in the unbounded directions can be rounded up to an integer value. * * The new basis is given by x' = B x, i.e., x = U x'. * For any rational value of the last tab->n_unbounded coordinates * in the update tableau, the value that is obtained by rounding * up this value should be contained in the original tableau. * For any constraint "a x + c >= 0", we therefore need to add * a constraint "a x + c + s >= 0", with s the sum of all negative * entries in the last elements of "a U". * * Since we are not interested in the first entries of any of the "a U", * we first drop the columns of U that correpond to bounded directions. */ static int tab_shift_cone(struct isl_tab *tab, struct isl_tab *tab_cone, struct isl_mat *U) { int i; isl_int v; struct isl_basic_set *bset = NULL; if (tab && tab->n_unbounded == 0) { isl_mat_free(U); return 0; } isl_int_init(v); if (!tab || !tab_cone || !U) goto error; bset = isl_tab_peek_bset(tab_cone); U = isl_mat_drop_cols(U, 0, tab->n_var - tab->n_unbounded); for (i = 0; i < bset->n_ineq; ++i) { int ok; struct isl_vec *row = NULL; if (isl_tab_is_equality(tab_cone, tab_cone->n_eq + i)) continue; row = isl_vec_alloc(bset->ctx, tab_cone->n_var); if (!row) goto error; isl_seq_cpy(row->el, bset->ineq[i] + 1, tab_cone->n_var); row = isl_vec_mat_product(row, isl_mat_copy(U)); if (!row) goto error; vec_sum_of_neg(row, &v); isl_vec_free(row); if (isl_int_is_zero(v)) continue; tab = isl_tab_extend(tab, 1); isl_int_add(bset->ineq[i][0], bset->ineq[i][0], v); ok = isl_tab_add_ineq(tab, bset->ineq[i]) >= 0; isl_int_sub(bset->ineq[i][0], bset->ineq[i][0], v); if (!ok) goto error; } isl_mat_free(U); isl_int_clear(v); return 0; error: isl_mat_free(U); isl_int_clear(v); return -1; } /* Compute and return an initial basis for the possibly * unbounded tableau "tab". "tab_cone" is a tableau * for the corresponding recession cone. * Additionally, add constraints to "tab" that ensure * that any rational value for the unbounded directions * can be rounded up to an integer value. * * If the tableau is bounded, i.e., if the recession cone * is zero-dimensional, then we just use inital_basis. * Otherwise, we construct a basis whose first directions * correspond to equalities, followed by bounded directions, * i.e., equalities in the recession cone. * The remaining directions are then unbounded. */ int isl_tab_set_initial_basis_with_cone(struct isl_tab *tab, struct isl_tab *tab_cone) { struct isl_mat *eq; struct isl_mat *cone_eq; struct isl_mat *U, *Q; if (!tab || !tab_cone) return -1; if (tab_cone->n_col == tab_cone->n_dead) { tab->basis = initial_basis(tab); return tab->basis ? 0 : -1; } eq = tab_equalities(tab); if (!eq) return -1; tab->n_zero = eq->n_row; cone_eq = tab_equalities(tab_cone); eq = isl_mat_concat(eq, cone_eq); if (!eq) return -1; tab->n_unbounded = tab->n_var - (eq->n_row - tab->n_zero); eq = isl_mat_left_hermite(eq, 0, &U, &Q); if (!eq) return -1; isl_mat_free(eq); tab->basis = isl_mat_lin_to_aff(Q); if (tab_shift_cone(tab, tab_cone, U) < 0) return -1; if (!tab->basis) return -1; return 0; } /* Compute and return a sample point in bset using generalized basis * reduction. We first check if the input set has a non-trivial * recession cone. If so, we perform some extra preprocessing in * sample_with_cone. Otherwise, we directly perform generalized basis * reduction. */ static struct isl_vec *gbr_sample(struct isl_basic_set *bset) { unsigned dim; struct isl_basic_set *cone; dim = isl_basic_set_total_dim(bset); cone = isl_basic_set_recession_cone(isl_basic_set_copy(bset)); if (!cone) goto error; if (cone->n_eq < dim) return isl_basic_set_sample_with_cone(bset, cone); isl_basic_set_free(cone); return sample_bounded(bset); error: isl_basic_set_free(bset); return NULL; } static struct isl_vec *pip_sample(struct isl_basic_set *bset) { struct isl_mat *T; struct isl_ctx *ctx; struct isl_vec *sample; bset = isl_basic_set_skew_to_positive_orthant(bset, &T); if (!bset) return NULL; ctx = bset->ctx; sample = isl_pip_basic_set_sample(bset); if (sample && sample->size != 0) sample = isl_mat_vec_product(T, sample); else isl_mat_free(T); return sample; } static struct isl_vec *basic_set_sample(struct isl_basic_set *bset, int bounded) { struct isl_ctx *ctx; unsigned dim; if (!bset) return NULL; ctx = bset->ctx; if (isl_basic_set_plain_is_empty(bset)) return empty_sample(bset); dim = isl_basic_set_n_dim(bset); isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error); isl_assert(ctx, bset->n_div == 0, goto error); if (bset->sample && bset->sample->size == 1 + dim) { int contains = isl_basic_set_contains(bset, bset->sample); if (contains < 0) goto error; if (contains) { struct isl_vec *sample = isl_vec_copy(bset->sample); isl_basic_set_free(bset); return sample; } } isl_vec_free(bset->sample); bset->sample = NULL; if (bset->n_eq > 0) return sample_eq(bset, bounded ? isl_basic_set_sample_bounded : isl_basic_set_sample_vec); if (dim == 0) return zero_sample(bset); if (dim == 1) return interval_sample(bset); switch (bset->ctx->opt->ilp_solver) { case ISL_ILP_PIP: return pip_sample(bset); case ISL_ILP_GBR: return bounded ? sample_bounded(bset) : gbr_sample(bset); } isl_assert(bset->ctx, 0, ); error: isl_basic_set_free(bset); return NULL; } __isl_give isl_vec *isl_basic_set_sample_vec(__isl_take isl_basic_set *bset) { return basic_set_sample(bset, 0); } /* Compute an integer sample in "bset", where the caller guarantees * that "bset" is bounded. */ struct isl_vec *isl_basic_set_sample_bounded(struct isl_basic_set *bset) { return basic_set_sample(bset, 1); } __isl_give isl_basic_set *isl_basic_set_from_vec(__isl_take isl_vec *vec) { int i; int k; struct isl_basic_set *bset = NULL; struct isl_ctx *ctx; unsigned dim; if (!vec) return NULL; ctx = vec->ctx; isl_assert(ctx, vec->size != 0, goto error); bset = isl_basic_set_alloc(ctx, 0, vec->size - 1, 0, vec->size - 1, 0); if (!bset) goto error; dim = isl_basic_set_n_dim(bset); for (i = dim - 1; i >= 0; --i) { k = isl_basic_set_alloc_equality(bset); if (k < 0) goto error; isl_seq_clr(bset->eq[k], 1 + dim); isl_int_neg(bset->eq[k][0], vec->el[1 + i]); isl_int_set(bset->eq[k][1 + i], vec->el[0]); } bset->sample = vec; return bset; error: isl_basic_set_free(bset); isl_vec_free(vec); return NULL; } __isl_give isl_basic_map *isl_basic_map_sample(__isl_take isl_basic_map *bmap) { struct isl_basic_set *bset; struct isl_vec *sample_vec; bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap)); sample_vec = isl_basic_set_sample_vec(bset); if (!sample_vec) goto error; if (sample_vec->size == 0) { struct isl_basic_map *sample; sample = isl_basic_map_empty_like(bmap); isl_vec_free(sample_vec); isl_basic_map_free(bmap); return sample; } bset = isl_basic_set_from_vec(sample_vec); return isl_basic_map_overlying_set(bset, bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_sample(__isl_take isl_basic_set *bset) { return isl_basic_map_sample(bset); } __isl_give isl_basic_map *isl_map_sample(__isl_take isl_map *map) { int i; isl_basic_map *sample = NULL; if (!map) goto error; for (i = 0; i < map->n; ++i) { sample = isl_basic_map_sample(isl_basic_map_copy(map->p[i])); if (!sample) goto error; if (!ISL_F_ISSET(sample, ISL_BASIC_MAP_EMPTY)) break; isl_basic_map_free(sample); } if (i == map->n) sample = isl_basic_map_empty_like_map(map); isl_map_free(map); return sample; error: isl_map_free(map); return NULL; } __isl_give isl_basic_set *isl_set_sample(__isl_take isl_set *set) { return (isl_basic_set *) isl_map_sample((isl_map *)set); } __isl_give isl_point *isl_basic_set_sample_point(__isl_take isl_basic_set *bset) { isl_vec *vec; isl_space *dim; dim = isl_basic_set_get_space(bset); bset = isl_basic_set_underlying_set(bset); vec = isl_basic_set_sample_vec(bset); return isl_point_alloc(dim, vec); } __isl_give isl_point *isl_set_sample_point(__isl_take isl_set *set) { int i; isl_point *pnt; if (!set) return NULL; for (i = 0; i < set->n; ++i) { pnt = isl_basic_set_sample_point(isl_basic_set_copy(set->p[i])); if (!pnt) goto error; if (!isl_point_is_void(pnt)) break; isl_point_free(pnt); } if (i == set->n) pnt = isl_point_void(isl_set_get_space(set)); isl_set_free(set); return pnt; error: isl_set_free(set); return NULL; } cloog-0.18.2/isl/isl_bernstein.c0000664000175000017500000003567512254313240013437 00000000000000/* * Copyright 2006-2007 Universiteit Leiden * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, Leiden Institute of Advanced Computer Science, * Universiteit Leiden, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands * and K.U.Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A, * B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include #include #include #include #include #include #include #include struct bernstein_data { enum isl_fold type; isl_qpolynomial *poly; int check_tight; isl_cell *cell; isl_qpolynomial_fold *fold; isl_qpolynomial_fold *fold_tight; isl_pw_qpolynomial_fold *pwf; isl_pw_qpolynomial_fold *pwf_tight; }; static int vertex_is_integral(__isl_keep isl_basic_set *vertex) { unsigned nvar; unsigned nparam; int i; nvar = isl_basic_set_dim(vertex, isl_dim_set); nparam = isl_basic_set_dim(vertex, isl_dim_param); for (i = 0; i < nvar; ++i) { int r = nvar - 1 - i; if (!isl_int_is_one(vertex->eq[r][1 + nparam + i]) && !isl_int_is_negone(vertex->eq[r][1 + nparam + i])) return 0; } return 1; } static __isl_give isl_qpolynomial *vertex_coordinate( __isl_keep isl_basic_set *vertex, int i, __isl_take isl_space *dim) { unsigned nvar; unsigned nparam; int r; isl_int denom; isl_qpolynomial *v; nvar = isl_basic_set_dim(vertex, isl_dim_set); nparam = isl_basic_set_dim(vertex, isl_dim_param); r = nvar - 1 - i; isl_int_init(denom); isl_int_set(denom, vertex->eq[r][1 + nparam + i]); isl_assert(vertex->ctx, !isl_int_is_zero(denom), goto error); if (isl_int_is_pos(denom)) isl_seq_neg(vertex->eq[r], vertex->eq[r], 1 + isl_basic_set_total_dim(vertex)); else isl_int_neg(denom, denom); v = isl_qpolynomial_from_affine(dim, vertex->eq[r], denom); isl_int_clear(denom); return v; error: isl_space_free(dim); isl_int_clear(denom); return NULL; } /* Check whether the bound associated to the selection "k" is tight, * which is the case if we select exactly one vertex and if that vertex * is integral for all values of the parameters. */ static int is_tight(int *k, int n, int d, isl_cell *cell) { int i; for (i = 0; i < n; ++i) { int v; if (k[i] != d) { if (k[i]) return 0; continue; } v = cell->ids[n - 1 - i]; return vertex_is_integral(cell->vertices->v[v].vertex); } return 0; } static void add_fold(__isl_take isl_qpolynomial *b, __isl_keep isl_set *dom, int *k, int n, int d, struct bernstein_data *data) { isl_qpolynomial_fold *fold; fold = isl_qpolynomial_fold_alloc(data->type, b); if (data->check_tight && is_tight(k, n, d, data->cell)) data->fold_tight = isl_qpolynomial_fold_fold_on_domain(dom, data->fold_tight, fold); else data->fold = isl_qpolynomial_fold_fold_on_domain(dom, data->fold, fold); } /* Extract the coefficients of the Bernstein base polynomials and store * them in data->fold and data->fold_tight. * * In particular, the coefficient of each monomial * of multi-degree (k[0], k[1], ..., k[n-1]) is divided by the corresponding * multinomial coefficient d!/k[0]! k[1]! ... k[n-1]! * * c[i] contains the coefficient of the selected powers of the first i+1 vars. * multinom[i] contains the partial multinomial coefficient. */ static void extract_coefficients(isl_qpolynomial *poly, __isl_keep isl_set *dom, struct bernstein_data *data) { int i; int d; int n; isl_ctx *ctx; isl_qpolynomial **c = NULL; int *k = NULL; int *left = NULL; isl_vec *multinom = NULL; if (!poly) return; ctx = isl_qpolynomial_get_ctx(poly); n = isl_qpolynomial_dim(poly, isl_dim_in); d = isl_qpolynomial_degree(poly); isl_assert(ctx, n >= 2, return); c = isl_calloc_array(ctx, isl_qpolynomial *, n); k = isl_alloc_array(ctx, int, n); left = isl_alloc_array(ctx, int, n); multinom = isl_vec_alloc(ctx, n); if (!c || !k || !left || !multinom) goto error; isl_int_set_si(multinom->el[0], 1); for (k[0] = d; k[0] >= 0; --k[0]) { int i = 1; isl_qpolynomial_free(c[0]); c[0] = isl_qpolynomial_coeff(poly, isl_dim_in, n - 1, k[0]); left[0] = d - k[0]; k[1] = -1; isl_int_set(multinom->el[1], multinom->el[0]); while (i > 0) { if (i == n - 1) { int j; isl_space *dim; isl_qpolynomial *b; isl_qpolynomial *f; for (j = 2; j <= left[i - 1]; ++j) isl_int_divexact_ui(multinom->el[i], multinom->el[i], j); b = isl_qpolynomial_coeff(c[i - 1], isl_dim_in, n - 1 - i, left[i - 1]); b = isl_qpolynomial_project_domain_on_params(b); dim = isl_qpolynomial_get_domain_space(b); f = isl_qpolynomial_rat_cst_on_domain(dim, ctx->one, multinom->el[i]); b = isl_qpolynomial_mul(b, f); k[n - 1] = left[n - 2]; add_fold(b, dom, k, n, d, data); --i; continue; } if (k[i] >= left[i - 1]) { --i; continue; } ++k[i]; if (k[i]) isl_int_divexact_ui(multinom->el[i], multinom->el[i], k[i]); isl_qpolynomial_free(c[i]); c[i] = isl_qpolynomial_coeff(c[i - 1], isl_dim_in, n - 1 - i, k[i]); left[i] = left[i - 1] - k[i]; k[i + 1] = -1; isl_int_set(multinom->el[i + 1], multinom->el[i]); ++i; } isl_int_mul_ui(multinom->el[0], multinom->el[0], k[0]); } for (i = 0; i < n; ++i) isl_qpolynomial_free(c[i]); isl_vec_free(multinom); free(left); free(k); free(c); return; error: isl_vec_free(multinom); free(left); free(k); if (c) for (i = 0; i < n; ++i) isl_qpolynomial_free(c[i]); free(c); return; } /* Perform bernstein expansion on the parametric vertices that are active * on "cell". * * data->poly has been homogenized in the calling function. * * We plug in the barycentric coordinates for the set variables * * \vec x = \sum_i \alpha_i v_i(\vec p) * * and the constant "1 = \sum_i \alpha_i" for the homogeneous dimension. * Next, we extract the coefficients of the Bernstein base polynomials. */ static int bernstein_coefficients_cell(__isl_take isl_cell *cell, void *user) { int i, j; struct bernstein_data *data = (struct bernstein_data *)user; isl_space *dim_param; isl_space *dim_dst; isl_qpolynomial *poly = data->poly; unsigned nvar; int n_vertices; isl_qpolynomial **subs; isl_pw_qpolynomial_fold *pwf; isl_set *dom; isl_ctx *ctx; if (!poly) goto error; nvar = isl_qpolynomial_dim(poly, isl_dim_in) - 1; n_vertices = cell->n_vertices; ctx = isl_qpolynomial_get_ctx(poly); if (n_vertices > nvar + 1 && ctx->opt->bernstein_triangulate) return isl_cell_foreach_simplex(cell, &bernstein_coefficients_cell, user); subs = isl_alloc_array(ctx, isl_qpolynomial *, 1 + nvar); if (!subs) goto error; dim_param = isl_basic_set_get_space(cell->dom); dim_dst = isl_qpolynomial_get_domain_space(poly); dim_dst = isl_space_add_dims(dim_dst, isl_dim_set, n_vertices); for (i = 0; i < 1 + nvar; ++i) subs[i] = isl_qpolynomial_zero_on_domain(isl_space_copy(dim_dst)); for (i = 0; i < n_vertices; ++i) { isl_qpolynomial *c; c = isl_qpolynomial_var_on_domain(isl_space_copy(dim_dst), isl_dim_set, 1 + nvar + i); for (j = 0; j < nvar; ++j) { int k = cell->ids[i]; isl_qpolynomial *v; v = vertex_coordinate(cell->vertices->v[k].vertex, j, isl_space_copy(dim_param)); v = isl_qpolynomial_add_dims(v, isl_dim_in, 1 + nvar + n_vertices); v = isl_qpolynomial_mul(v, isl_qpolynomial_copy(c)); subs[1 + j] = isl_qpolynomial_add(subs[1 + j], v); } subs[0] = isl_qpolynomial_add(subs[0], c); } isl_space_free(dim_dst); poly = isl_qpolynomial_copy(poly); poly = isl_qpolynomial_add_dims(poly, isl_dim_in, n_vertices); poly = isl_qpolynomial_substitute(poly, isl_dim_in, 0, 1 + nvar, subs); poly = isl_qpolynomial_drop_dims(poly, isl_dim_in, 0, 1 + nvar); data->cell = cell; dom = isl_set_from_basic_set(isl_basic_set_copy(cell->dom)); data->fold = isl_qpolynomial_fold_empty(data->type, isl_space_copy(dim_param)); data->fold_tight = isl_qpolynomial_fold_empty(data->type, dim_param); extract_coefficients(poly, dom, data); pwf = isl_pw_qpolynomial_fold_alloc(data->type, isl_set_copy(dom), data->fold); data->pwf = isl_pw_qpolynomial_fold_fold(data->pwf, pwf); pwf = isl_pw_qpolynomial_fold_alloc(data->type, dom, data->fold_tight); data->pwf_tight = isl_pw_qpolynomial_fold_fold(data->pwf_tight, pwf); isl_qpolynomial_free(poly); isl_cell_free(cell); for (i = 0; i < 1 + nvar; ++i) isl_qpolynomial_free(subs[i]); free(subs); return 0; error: isl_cell_free(cell); return -1; } /* Base case of applying bernstein expansion. * * We compute the chamber decomposition of the parametric polytope "bset" * and then perform bernstein expansion on the parametric vertices * that are active on each chamber. */ static __isl_give isl_pw_qpolynomial_fold *bernstein_coefficients_base( __isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct bernstein_data *data, int *tight) { unsigned nvar; isl_space *dim; isl_pw_qpolynomial_fold *pwf; isl_vertices *vertices; int covers; nvar = isl_basic_set_dim(bset, isl_dim_set); if (nvar == 0) { isl_set *dom; isl_qpolynomial_fold *fold; fold = isl_qpolynomial_fold_alloc(data->type, poly); dom = isl_set_from_basic_set(bset); if (tight) *tight = 1; pwf = isl_pw_qpolynomial_fold_alloc(data->type, dom, fold); return isl_pw_qpolynomial_fold_project_domain_on_params(pwf); } if (isl_qpolynomial_is_zero(poly)) { isl_set *dom; isl_qpolynomial_fold *fold; fold = isl_qpolynomial_fold_alloc(data->type, poly); dom = isl_set_from_basic_set(bset); pwf = isl_pw_qpolynomial_fold_alloc(data->type, dom, fold); if (tight) *tight = 1; return isl_pw_qpolynomial_fold_project_domain_on_params(pwf); } dim = isl_basic_set_get_space(bset); dim = isl_space_params(dim); dim = isl_space_from_domain(dim); dim = isl_space_add_dims(dim, isl_dim_set, 1); data->pwf = isl_pw_qpolynomial_fold_zero(isl_space_copy(dim), data->type); data->pwf_tight = isl_pw_qpolynomial_fold_zero(dim, data->type); data->poly = isl_qpolynomial_homogenize(isl_qpolynomial_copy(poly)); vertices = isl_basic_set_compute_vertices(bset); isl_vertices_foreach_disjoint_cell(vertices, &bernstein_coefficients_cell, data); isl_vertices_free(vertices); isl_qpolynomial_free(data->poly); isl_basic_set_free(bset); isl_qpolynomial_free(poly); covers = isl_pw_qpolynomial_fold_covers(data->pwf_tight, data->pwf); if (covers < 0) goto error; if (tight) *tight = covers; if (covers) { isl_pw_qpolynomial_fold_free(data->pwf); return data->pwf_tight; } data->pwf = isl_pw_qpolynomial_fold_fold(data->pwf, data->pwf_tight); return data->pwf; error: isl_pw_qpolynomial_fold_free(data->pwf_tight); isl_pw_qpolynomial_fold_free(data->pwf); return NULL; } /* Apply bernstein expansion recursively by working in on len[i] * set variables at a time, with i ranging from n_group - 1 to 0. */ static __isl_give isl_pw_qpolynomial_fold *bernstein_coefficients_recursive( __isl_take isl_pw_qpolynomial *pwqp, int n_group, int *len, struct bernstein_data *data, int *tight) { int i; unsigned nparam; unsigned nvar; isl_pw_qpolynomial_fold *pwf; if (!pwqp) return NULL; nparam = isl_pw_qpolynomial_dim(pwqp, isl_dim_param); nvar = isl_pw_qpolynomial_dim(pwqp, isl_dim_in); pwqp = isl_pw_qpolynomial_move_dims(pwqp, isl_dim_param, nparam, isl_dim_in, 0, nvar - len[n_group - 1]); pwf = isl_pw_qpolynomial_bound(pwqp, data->type, tight); for (i = n_group - 2; i >= 0; --i) { nparam = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_param); pwf = isl_pw_qpolynomial_fold_move_dims(pwf, isl_dim_in, 0, isl_dim_param, nparam - len[i], len[i]); if (tight && !*tight) tight = NULL; pwf = isl_pw_qpolynomial_fold_bound(pwf, tight); } return pwf; } static __isl_give isl_pw_qpolynomial_fold *bernstein_coefficients_factors( __isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct bernstein_data *data, int *tight) { isl_factorizer *f; isl_set *set; isl_pw_qpolynomial *pwqp; isl_pw_qpolynomial_fold *pwf; f = isl_basic_set_factorizer(bset); if (!f) goto error; if (f->n_group == 0) { isl_factorizer_free(f); return bernstein_coefficients_base(bset, poly, data, tight); } set = isl_set_from_basic_set(bset); pwqp = isl_pw_qpolynomial_alloc(set, poly); pwqp = isl_pw_qpolynomial_morph_domain(pwqp, isl_morph_copy(f->morph)); pwf = bernstein_coefficients_recursive(pwqp, f->n_group, f->len, data, tight); isl_factorizer_free(f); return pwf; error: isl_basic_set_free(bset); isl_qpolynomial_free(poly); return NULL; } static __isl_give isl_pw_qpolynomial_fold *bernstein_coefficients_full_recursive( __isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct bernstein_data *data, int *tight) { int i; int *len; unsigned nvar; isl_pw_qpolynomial_fold *pwf; isl_set *set; isl_pw_qpolynomial *pwqp; if (!bset || !poly) goto error; nvar = isl_basic_set_dim(bset, isl_dim_set); len = isl_alloc_array(bset->ctx, int, nvar); if (nvar && !len) goto error; for (i = 0; i < nvar; ++i) len[i] = 1; set = isl_set_from_basic_set(bset); pwqp = isl_pw_qpolynomial_alloc(set, poly); pwf = bernstein_coefficients_recursive(pwqp, nvar, len, data, tight); free(len); return pwf; error: isl_basic_set_free(bset); isl_qpolynomial_free(poly); return NULL; } /* Compute a bound on the polynomial defined over the parametric polytope * using bernstein expansion and store the result * in bound->pwf and bound->pwf_tight. * * If bernstein_recurse is set to ISL_BERNSTEIN_FACTORS, we check if * the polytope can be factorized and apply bernstein expansion recursively * on the factors. * If bernstein_recurse is set to ISL_BERNSTEIN_INTERVALS, we apply * bernstein expansion recursively on each dimension. * Otherwise, we apply bernstein expansion on the entire polytope. */ int isl_qpolynomial_bound_on_domain_bernstein(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct isl_bound *bound) { struct bernstein_data data; isl_pw_qpolynomial_fold *pwf; unsigned nvar; int tight = 0; int *tp = bound->check_tight ? &tight : NULL; if (!bset || !poly) goto error; data.type = bound->type; data.check_tight = bound->check_tight; nvar = isl_basic_set_dim(bset, isl_dim_set); if (bset->ctx->opt->bernstein_recurse & ISL_BERNSTEIN_FACTORS) pwf = bernstein_coefficients_factors(bset, poly, &data, tp); else if (nvar > 1 && (bset->ctx->opt->bernstein_recurse & ISL_BERNSTEIN_INTERVALS)) pwf = bernstein_coefficients_full_recursive(bset, poly, &data, tp); else pwf = bernstein_coefficients_base(bset, poly, &data, tp); if (tight) bound->pwf_tight = isl_pw_qpolynomial_fold_fold(bound->pwf_tight, pwf); else bound->pwf = isl_pw_qpolynomial_fold_fold(bound->pwf, pwf); return 0; error: isl_basic_set_free(bset); isl_qpolynomial_free(poly); return -1; } cloog-0.18.2/isl/AUTHORS0000664000175000017500000000147212254313240011467 00000000000000isl was written by Sven Verdoolaege 2006-2007 Leiden Institute of Advanced Computer Science Universiteit Leiden Niels Bohrweg 1 2333 CA Leiden The Netherlands 2008-2009 K.U.Leuven Departement Computerwetenschappen Celestijnenlaan 200A B-3001 Leuven Belgium 2010-2011 INRIA Saclay - Ile-de-France Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod 91893 Orsay France 2011-2012 consultant for Leiden Institute of Advanced Computer Science 2012 Ecole Normale Superieure 45 rue d’Ulm, 75230 Paris France Contributions by Mythri Alle Riyadh Baghdadi Serge Belyshev Tobias Grosser Andreas Kloeckner Sebastian Pop Louis-Noel Pouchet Uday Kumar Reddy Sven van Haastregt The merge sort implementation was written by Jeffrey Stedfast. cloog-0.18.2/isl/isl_output.c0000664000175000017500000020465312254313240013000 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include static const char *s_to[2] = { " -> ", " \\to " }; static const char *s_and[2] = { " and ", " \\wedge " }; static const char *s_or[2] = { " or ", " \\vee " }; static const char *s_le[2] = { "<=", "\\le" }; static const char *s_ge[2] = { ">=", "\\ge" }; static const char *s_open_set[2] = { "{ ", "\\{\\, " }; static const char *s_close_set[2] = { " }", " \\,\\}" }; static const char *s_open_list[2] = { "[", "(" }; static const char *s_close_list[2] = { "]", ")" }; static const char *s_such_that[2] = { " : ", " \\mid " }; static const char *s_open_exists[2] = { "exists (", "\\exists \\, " }; static const char *s_close_exists[2] = { ")", "" }; static const char *s_div_prefix[2] = { "e", "\\alpha_" }; static const char *s_param_prefix[2] = { "p", "p_" }; static const char *s_input_prefix[2] = { "i", "i_" }; static const char *s_output_prefix[2] = { "o", "o_" }; static __isl_give isl_printer *print_constraint_polylib( struct isl_basic_map *bmap, int ineq, int n, __isl_take isl_printer *p) { int i; unsigned n_in = isl_basic_map_dim(bmap, isl_dim_in); unsigned n_out = isl_basic_map_dim(bmap, isl_dim_out); unsigned nparam = isl_basic_map_dim(bmap, isl_dim_param); isl_int *c = ineq ? bmap->ineq[n] : bmap->eq[n]; p = isl_printer_start_line(p); p = isl_printer_print_int(p, ineq); for (i = 0; i < n_out; ++i) { p = isl_printer_print_str(p, " "); p = isl_printer_print_isl_int(p, c[1+nparam+n_in+i]); } for (i = 0; i < n_in; ++i) { p = isl_printer_print_str(p, " "); p = isl_printer_print_isl_int(p, c[1+nparam+i]); } for (i = 0; i < bmap->n_div; ++i) { p = isl_printer_print_str(p, " "); p = isl_printer_print_isl_int(p, c[1+nparam+n_in+n_out+i]); } for (i = 0; i < nparam; ++i) { p = isl_printer_print_str(p, " "); p = isl_printer_print_isl_int(p, c[1+i]); } p = isl_printer_print_str(p, " "); p = isl_printer_print_isl_int(p, c[0]); p = isl_printer_end_line(p); return p; } static __isl_give isl_printer *print_constraints_polylib( struct isl_basic_map *bmap, __isl_take isl_printer *p) { int i; p = isl_printer_set_isl_int_width(p, 5); for (i = 0; i < bmap->n_eq; ++i) p = print_constraint_polylib(bmap, 0, i, p); for (i = 0; i < bmap->n_ineq; ++i) p = print_constraint_polylib(bmap, 1, i, p); return p; } static __isl_give isl_printer *bset_print_constraints_polylib( struct isl_basic_set *bset, __isl_take isl_printer *p) { return print_constraints_polylib((struct isl_basic_map *)bset, p); } static __isl_give isl_printer *isl_basic_map_print_polylib( __isl_keep isl_basic_map *bmap, __isl_take isl_printer *p, int ext) { unsigned total = isl_basic_map_total_dim(bmap); p = isl_printer_start_line(p); p = isl_printer_print_int(p, bmap->n_eq + bmap->n_ineq); p = isl_printer_print_str(p, " "); p = isl_printer_print_int(p, 1 + total + 1); if (ext) { p = isl_printer_print_str(p, " "); p = isl_printer_print_int(p, isl_basic_map_dim(bmap, isl_dim_out)); p = isl_printer_print_str(p, " "); p = isl_printer_print_int(p, isl_basic_map_dim(bmap, isl_dim_in)); p = isl_printer_print_str(p, " "); p = isl_printer_print_int(p, isl_basic_map_dim(bmap, isl_dim_div)); p = isl_printer_print_str(p, " "); p = isl_printer_print_int(p, isl_basic_map_dim(bmap, isl_dim_param)); } p = isl_printer_end_line(p); return print_constraints_polylib(bmap, p); } static __isl_give isl_printer *isl_basic_set_print_polylib( __isl_keep isl_basic_set *bset, __isl_take isl_printer *p, int ext) { return isl_basic_map_print_polylib((struct isl_basic_map *)bset, p, ext); } static __isl_give isl_printer *isl_map_print_polylib(__isl_keep isl_map *map, __isl_take isl_printer *p, int ext) { int i; p = isl_printer_start_line(p); p = isl_printer_print_int(p, map->n); p = isl_printer_end_line(p); for (i = 0; i < map->n; ++i) { p = isl_printer_start_line(p); p = isl_printer_end_line(p); p = isl_basic_map_print_polylib(map->p[i], p, ext); } return p; } static __isl_give isl_printer *isl_set_print_polylib(__isl_keep isl_set *set, __isl_take isl_printer *p, int ext) { return isl_map_print_polylib((struct isl_map *)set, p, ext); } static int count_same_name(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos, const char *name) { enum isl_dim_type t; unsigned p, s; int count = 0; for (t = isl_dim_param; t <= type && t <= isl_dim_out; ++t) { s = t == type ? pos : isl_space_dim(dim, t); for (p = 0; p < s; ++p) { const char *n = isl_space_get_dim_name(dim, t, p); if (n && !strcmp(n, name)) count++; } } return count; } static __isl_give isl_printer *print_name(__isl_keep isl_space *dim, __isl_take isl_printer *p, enum isl_dim_type type, unsigned pos, int latex) { const char *name; char buffer[20]; int primes; name = type == isl_dim_div ? NULL : isl_space_get_dim_name(dim, type, pos); if (!name) { const char *prefix; if (type == isl_dim_param) prefix = s_param_prefix[latex]; else if (type == isl_dim_div) prefix = s_div_prefix[latex]; else if (isl_space_is_set(dim) || type == isl_dim_in) prefix = s_input_prefix[latex]; else prefix = s_output_prefix[latex]; snprintf(buffer, sizeof(buffer), "%s%d", prefix, pos); name = buffer; } primes = count_same_name(dim, name == buffer ? isl_dim_div : type, pos, name); p = isl_printer_print_str(p, name); while (primes-- > 0) p = isl_printer_print_str(p, "'"); return p; } static enum isl_dim_type pos2type(__isl_keep isl_space *dim, unsigned *pos) { enum isl_dim_type type; unsigned n_in = isl_space_dim(dim, isl_dim_in); unsigned n_out = isl_space_dim(dim, isl_dim_out); unsigned nparam = isl_space_dim(dim, isl_dim_param); if (*pos < 1 + nparam) { type = isl_dim_param; *pos -= 1; } else if (*pos < 1 + nparam + n_in) { type = isl_dim_in; *pos -= 1 + nparam; } else if (*pos < 1 + nparam + n_in + n_out) { type = isl_dim_out; *pos -= 1 + nparam + n_in; } else { type = isl_dim_div; *pos -= 1 + nparam + n_in + n_out; } return type; } static __isl_give isl_printer *print_div(__isl_keep isl_space *dim, __isl_keep isl_mat *div, int pos, __isl_take isl_printer *p); static __isl_give isl_printer *print_term(__isl_keep isl_space *dim, __isl_keep isl_mat *div, isl_int c, unsigned pos, __isl_take isl_printer *p, int latex) { enum isl_dim_type type; int print_div_def; if (pos == 0) return isl_printer_print_isl_int(p, c); type = pos2type(dim, &pos); print_div_def = type == isl_dim_div && div && !isl_int_is_zero(div->row[pos][0]); if (isl_int_is_one(c)) ; else if (isl_int_is_negone(c)) p = isl_printer_print_str(p, "-"); else { p = isl_printer_print_isl_int(p, c); if (p->output_format == ISL_FORMAT_C || print_div_def) p = isl_printer_print_str(p, "*"); } if (print_div_def) p = print_div(dim, div, pos, p); else p = print_name(dim, p, type, pos, latex); return p; } static __isl_give isl_printer *print_affine_of_len(__isl_keep isl_space *dim, __isl_keep isl_mat *div, __isl_take isl_printer *p, isl_int *c, int len) { int i; int first; for (i = 0, first = 1; i < len; ++i) { int flip = 0; if (isl_int_is_zero(c[i])) continue; if (!first) { if (isl_int_is_neg(c[i])) { flip = 1; isl_int_neg(c[i], c[i]); p = isl_printer_print_str(p, " - "); } else p = isl_printer_print_str(p, " + "); } first = 0; p = print_term(dim, div, c[i], i, p, 0); if (flip) isl_int_neg(c[i], c[i]); } if (first) p = isl_printer_print_str(p, "0"); return p; } static __isl_give isl_printer *print_affine(__isl_keep isl_basic_map *bmap, __isl_keep isl_space *dim, __isl_take isl_printer *p, isl_int *c) { unsigned len = 1 + isl_basic_map_total_dim(bmap); return print_affine_of_len(dim, NULL, p, c, len); } static int defining_equality(__isl_keep isl_basic_map *eq, __isl_keep isl_space *dim, enum isl_dim_type type, int pos) { int i; unsigned total; if (!eq) return -1; pos += isl_space_offset(dim, type); total = isl_basic_map_total_dim(eq); for (i = 0; i < eq->n_eq; ++i) { if (isl_seq_last_non_zero(eq->eq[i] + 1, total) != pos) continue; if (isl_int_is_one(eq->eq[i][1 + pos])) isl_seq_neg(eq->eq[i], eq->eq[i], 1 + total); return i; } return -1; } static __isl_give isl_printer *print_aff_body(__isl_take isl_printer *p, __isl_keep isl_aff *aff); /* offset is the offset of local_dim inside global_type of global_dim. */ static __isl_give isl_printer *print_nested_var_list(__isl_take isl_printer *p, __isl_keep isl_space *global_dim, enum isl_dim_type global_type, __isl_keep isl_space *local_dim, enum isl_dim_type local_type, int latex, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff, int offset) { int i, j; if (global_dim != local_dim && local_type == isl_dim_out) offset += local_dim->n_in; for (i = 0; i < isl_space_dim(local_dim, local_type); ++i) { if (i) p = isl_printer_print_str(p, ", "); if (maff && global_type == isl_dim_out) { p = print_aff_body(p, maff->p[offset + i]); continue; } j = defining_equality(eq, global_dim, global_type, offset + i); if (j >= 0) { int pos = 1 + isl_space_offset(global_dim, global_type) + offset + i; p = print_affine_of_len(eq->dim, NULL, p, eq->eq[j], pos); } else { p = print_name(global_dim, p, global_type, offset + i, latex); } } return p; } static __isl_give isl_printer *print_var_list(__isl_keep isl_space *dim, __isl_take isl_printer *p, enum isl_dim_type type, int latex, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff) { return print_nested_var_list(p, dim, type, dim, type, latex, eq, maff, 0); } static __isl_give isl_printer *print_nested_map_dim(__isl_take isl_printer *p, __isl_keep isl_space *global_dim, enum isl_dim_type global_type, __isl_keep isl_space *local_dim, int latex, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff, int offset); static __isl_give isl_printer *print_nested_tuple(__isl_take isl_printer *p, __isl_keep isl_space *global_dim, enum isl_dim_type global_type, __isl_keep isl_space *local_dim, enum isl_dim_type local_type, int latex, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff, int offset) { const char *name = NULL; unsigned n = isl_space_dim(local_dim, local_type); if ((local_type == isl_dim_in || local_type == isl_dim_out)) { name = isl_space_get_tuple_name(local_dim, local_type); if (name) { if (latex) p = isl_printer_print_str(p, "\\mathrm{"); p = isl_printer_print_str(p, name); if (latex) p = isl_printer_print_str(p, "}"); } } if (!latex || n != 1 || name) p = isl_printer_print_str(p, s_open_list[latex]); if ((local_type == isl_dim_in || local_type == isl_dim_out) && local_dim->nested[local_type - isl_dim_in]) { if (global_dim != local_dim && local_type == isl_dim_out) offset += local_dim->n_in; p = print_nested_map_dim(p, global_dim, global_type, local_dim->nested[local_type - isl_dim_in], latex, eq, maff, offset); } else p = print_nested_var_list(p, global_dim, global_type, local_dim, local_type, latex, eq, maff, offset); if (!latex || n != 1 || name) p = isl_printer_print_str(p, s_close_list[latex]); return p; } static __isl_give isl_printer *print_tuple(__isl_keep isl_space *dim, __isl_take isl_printer *p, enum isl_dim_type type, int latex, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff) { return print_nested_tuple(p, dim, type, dim, type, latex, eq, maff, 0); } static __isl_give isl_printer *print_nested_map_dim(__isl_take isl_printer *p, __isl_keep isl_space *global_dim, enum isl_dim_type global_type, __isl_keep isl_space *local_dim, int latex, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff, int offset) { p = print_nested_tuple(p, global_dim, global_type, local_dim, isl_dim_in, latex, eq, maff, offset); p = isl_printer_print_str(p, s_to[latex]); p = print_nested_tuple(p, global_dim, global_type, local_dim, isl_dim_out, latex, eq, maff, offset); return p; } static __isl_give isl_printer *print_space(__isl_keep isl_space *dim, __isl_take isl_printer *p, int latex, int rational, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff) { if (rational && !latex) p = isl_printer_print_str(p, "rat: "); if (isl_space_is_params(dim)) ; else if (isl_space_is_set(dim)) p = print_tuple(dim, p, isl_dim_set, latex, eq, maff); else { p = print_tuple(dim, p, isl_dim_in, latex, eq, maff); p = isl_printer_print_str(p, s_to[latex]); p = print_tuple(dim, p, isl_dim_out, latex, eq, maff); } return p; } static __isl_give isl_printer *print_omega_parameters(__isl_keep isl_space *dim, __isl_take isl_printer *p) { if (isl_space_dim(dim, isl_dim_param) == 0) return p; p = isl_printer_start_line(p); p = isl_printer_print_str(p, "symbolic "); p = print_var_list(dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, ";"); p = isl_printer_end_line(p); return p; } static __isl_give isl_printer *print_constraint(struct isl_basic_map *bmap, __isl_keep isl_space *dim, __isl_take isl_printer *p, isl_int *c, int last, const char *op, int first_constraint, int latex) { if (!first_constraint) p = isl_printer_print_str(p, s_and[latex]); isl_int_abs(c[last], c[last]); p = print_term(dim, NULL, c[last], last, p, latex); p = isl_printer_print_str(p, " "); p = isl_printer_print_str(p, op); p = isl_printer_print_str(p, " "); isl_int_set_si(c[last], 0); p = print_affine(bmap, dim, p, c); return p; } static __isl_give isl_printer *print_constraints(__isl_keep isl_basic_map *bmap, __isl_keep isl_space *dim, __isl_take isl_printer *p, int latex) { int i; struct isl_vec *c; unsigned total = isl_basic_map_total_dim(bmap); c = isl_vec_alloc(bmap->ctx, 1 + total); if (!c) goto error; for (i = bmap->n_eq - 1; i >= 0; --i) { int l = isl_seq_last_non_zero(bmap->eq[i], 1 + total); if (l < 0) { if (i != bmap->n_eq - 1) p = isl_printer_print_str(p, s_and[latex]); p = isl_printer_print_str(p, "0 = 0"); continue; } if (isl_int_is_neg(bmap->eq[i][l])) isl_seq_cpy(c->el, bmap->eq[i], 1 + total); else isl_seq_neg(c->el, bmap->eq[i], 1 + total); p = print_constraint(bmap, dim, p, c->el, l, "=", i == bmap->n_eq - 1, latex); } for (i = 0; i < bmap->n_ineq; ++i) { int l = isl_seq_last_non_zero(bmap->ineq[i], 1 + total); int s; const char *op; if (l < 0) continue; s = isl_int_sgn(bmap->ineq[i][l]); if (s < 0) isl_seq_cpy(c->el, bmap->ineq[i], 1 + total); else isl_seq_neg(c->el, bmap->ineq[i], 1 + total); op = s < 0 ? s_le[latex] : s_ge[latex]; p = print_constraint(bmap, dim, p, c->el, l, op, !bmap->n_eq && !i, latex); } isl_vec_free(c); return p; error: isl_vec_free(c); isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_omega_constraints( __isl_keep isl_basic_map *bmap, __isl_take isl_printer *p) { if (bmap->n_eq + bmap->n_ineq == 0) return p; p = isl_printer_print_str(p, ": "); if (bmap->n_div > 0) { int i; p = isl_printer_print_str(p, "exists ("); for (i = 0; i < bmap->n_div; ++i) { if (i) p = isl_printer_print_str(p, ", "); p = print_name(bmap->dim, p, isl_dim_div, i, 0); } p = isl_printer_print_str(p, ": "); } p = print_constraints(bmap, bmap->dim, p, 0); if (bmap->n_div > 0) p = isl_printer_print_str(p, ")"); return p; } static __isl_give isl_printer *basic_map_print_omega( __isl_keep isl_basic_map *bmap, __isl_take isl_printer *p) { p = isl_printer_print_str(p, "{ ["); p = print_var_list(bmap->dim, p, isl_dim_in, 0, NULL, NULL); p = isl_printer_print_str(p, "] -> ["); p = print_var_list(bmap->dim, p, isl_dim_out, 0, NULL, NULL); p = isl_printer_print_str(p, "] "); p = print_omega_constraints(bmap, p); p = isl_printer_print_str(p, " }"); return p; } static __isl_give isl_printer *basic_set_print_omega( __isl_keep isl_basic_set *bset, __isl_take isl_printer *p) { p = isl_printer_print_str(p, "{ ["); p = print_var_list(bset->dim, p, isl_dim_set, 0, NULL, NULL); p = isl_printer_print_str(p, "] "); p = print_omega_constraints((isl_basic_map *)bset, p); p = isl_printer_print_str(p, " }"); return p; } static __isl_give isl_printer *isl_map_print_omega(__isl_keep isl_map *map, __isl_take isl_printer *p) { int i; for (i = 0; i < map->n; ++i) { if (i) p = isl_printer_print_str(p, " union "); p = basic_map_print_omega(map->p[i], p); } return p; } static __isl_give isl_printer *isl_set_print_omega(__isl_keep isl_set *set, __isl_take isl_printer *p) { int i; for (i = 0; i < set->n; ++i) { if (i) p = isl_printer_print_str(p, " union "); p = basic_set_print_omega(set->p[i], p); } return p; } static __isl_give isl_printer *print_disjunct(__isl_keep isl_basic_map *bmap, __isl_keep isl_space *dim, __isl_take isl_printer *p, int latex) { if (bmap->n_div > 0) { int i; p = isl_printer_print_str(p, s_open_exists[latex]); for (i = 0; i < bmap->n_div; ++i) { if (i) p = isl_printer_print_str(p, ", "); p = print_name(dim, p, isl_dim_div, i, latex); if (latex || isl_int_is_zero(bmap->div[i][0])) continue; p = isl_printer_print_str(p, " = [("); p = print_affine(bmap, dim, p, bmap->div[i] + 1); p = isl_printer_print_str(p, ")/"); p = isl_printer_print_isl_int(p, bmap->div[i][0]); p = isl_printer_print_str(p, "]"); } p = isl_printer_print_str(p, ": "); } p = print_constraints(bmap, dim, p, latex); if (bmap->n_div > 0) p = isl_printer_print_str(p, s_close_exists[latex]); return p; } static __isl_give isl_printer *isl_basic_map_print_isl( __isl_keep isl_basic_map *bmap, __isl_take isl_printer *p, int latex) { int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); if (isl_basic_map_dim(bmap, isl_dim_param) > 0) { p = print_tuple(bmap->dim, p, isl_dim_param, latex, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_space(bmap->dim, p, latex, rational, NULL, NULL); p = isl_printer_print_str(p, " : "); p = print_disjunct(bmap, bmap->dim, p, latex); p = isl_printer_print_str(p, " }"); return p; } static __isl_give isl_printer *print_disjuncts(__isl_keep isl_map *map, __isl_take isl_printer *p, int latex) { int i; if (isl_map_plain_is_universe(map)) return p; p = isl_printer_print_str(p, s_such_that[latex]); if (map->n == 0) p = isl_printer_print_str(p, "1 = 0"); for (i = 0; i < map->n; ++i) { if (i) p = isl_printer_print_str(p, s_or[latex]); if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1) p = isl_printer_print_str(p, "("); p = print_disjunct(map->p[i], map->dim, p, latex); if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1) p = isl_printer_print_str(p, ")"); } return p; } /* Print the disjuncts of a map (or set). * If the map turns out to be a universal parameter domain, then * we need to print the colon. Otherwise, the output looks identical * to the empty set. */ static __isl_give isl_printer *print_disjuncts_map(__isl_keep isl_map *map, __isl_take isl_printer *p, int latex) { if (isl_map_plain_is_universe(map) && isl_space_is_params(map->dim)) return isl_printer_print_str(p, s_such_that[latex]); else return print_disjuncts(map, p, latex); } struct isl_aff_split { isl_basic_map *aff; isl_map *map; }; static void free_split(__isl_take struct isl_aff_split *split, int n) { int i; if (!split) return; for (i = 0; i < n; ++i) { isl_basic_map_free(split[i].aff); isl_map_free(split[i].map); } free(split); } static __isl_give isl_basic_map *get_aff(__isl_take isl_basic_map *bmap) { int i, j; unsigned nparam, n_in, n_out, total; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; if (isl_basic_map_free_inequality(bmap, bmap->n_ineq) < 0) goto error; nparam = isl_basic_map_dim(bmap, isl_dim_param); n_in = isl_basic_map_dim(bmap, isl_dim_in); n_out = isl_basic_map_dim(bmap, isl_dim_out); total = isl_basic_map_dim(bmap, isl_dim_all); for (i = bmap->n_eq - 1; i >= 0; --i) { j = isl_seq_last_non_zero(bmap->eq[i] + 1, total); if (j >= nparam && j < nparam + n_in + n_out && (isl_int_is_one(bmap->eq[i][1 + j]) || isl_int_is_negone(bmap->eq[i][1 + j]))) continue; if (isl_basic_map_drop_equality(bmap, i) < 0) goto error; } bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } static int aff_split_cmp(const void *p1, const void *p2, void *user) { const struct isl_aff_split *s1, *s2; s1 = (const struct isl_aff_split *) p1; s2 = (const struct isl_aff_split *) p2; return isl_basic_map_plain_cmp(s1->aff, s2->aff); } static __isl_give isl_basic_map *drop_aff(__isl_take isl_basic_map *bmap, __isl_keep isl_basic_map *aff) { int i, j; unsigned total; if (!bmap || !aff) goto error; total = isl_space_dim(bmap->dim, isl_dim_all); for (i = bmap->n_eq - 1; i >= 0; --i) { if (isl_seq_first_non_zero(bmap->eq[i] + 1 + total, bmap->n_div) != -1) continue; for (j = 0; j < aff->n_eq; ++j) { if (!isl_seq_eq(bmap->eq[i], aff->eq[j], 1 + total) && !isl_seq_is_neg(bmap->eq[i], aff->eq[j], 1 + total)) continue; if (isl_basic_map_drop_equality(bmap, i) < 0) goto error; break; } } return bmap; error: isl_basic_map_free(bmap); return NULL; } static __isl_give struct isl_aff_split *split_aff(__isl_keep isl_map *map) { int i, n; struct isl_aff_split *split; isl_ctx *ctx; ctx = isl_map_get_ctx(map); split = isl_calloc_array(ctx, struct isl_aff_split, map->n); if (!split) return NULL; for (i = 0; i < map->n; ++i) { isl_basic_map *bmap; split[i].aff = get_aff(isl_basic_map_copy(map->p[i])); bmap = isl_basic_map_copy(map->p[i]); bmap = isl_basic_map_cow(bmap); bmap = drop_aff(bmap, split[i].aff); split[i].map = isl_map_from_basic_map(bmap); if (!split[i].aff || !split[i].map) goto error; } if (isl_sort(split, map->n, sizeof(struct isl_aff_split), &aff_split_cmp, NULL) < 0) goto error; n = map->n; for (i = n - 1; i >= 1; --i) { if (!isl_basic_map_plain_is_equal(split[i - 1].aff, split[i].aff)) continue; isl_basic_map_free(split[i].aff); split[i - 1].map = isl_map_union(split[i - 1].map, split[i].map); if (i != n - 1) split[i] = split[n - 1]; split[n - 1].aff = NULL; split[n - 1].map = NULL; --n; } return split; error: free_split(split, map->n); return NULL; } static __isl_give isl_printer *print_split_map(__isl_take isl_printer *p, struct isl_aff_split *split, int n) { int i; int rational; for (i = 0; i < n; ++i) { isl_space *dim; if (!split[i].map) break; dim = split[i].map->dim; rational = split[i].map->n > 0 && ISL_F_ISSET(split[i].map->p[0], ISL_BASIC_MAP_RATIONAL); if (i) p = isl_printer_print_str(p, "; "); p = print_space(dim, p, 0, rational, split[i].aff, NULL); p = print_disjuncts_map(split[i].map, p, 0); } return p; } static __isl_give isl_printer *isl_map_print_isl_body(__isl_keep isl_map *map, __isl_take isl_printer *p) { struct isl_aff_split *split = NULL; int rational; if (map->n > 0) split = split_aff(map); if (split) { p = print_split_map(p, split, map->n); } else { rational = map->n > 0 && ISL_F_ISSET(map->p[0], ISL_BASIC_MAP_RATIONAL); p = print_space(map->dim, p, 0, rational, NULL, NULL); p = print_disjuncts_map(map, p, 0); } free_split(split, map->n); return p; } static __isl_give isl_printer *isl_map_print_isl(__isl_keep isl_map *map, __isl_take isl_printer *p) { if (isl_map_dim(map, isl_dim_param) > 0) { p = print_tuple(map->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, s_to[0]); } p = isl_printer_print_str(p, s_open_set[0]); p = isl_map_print_isl_body(map, p); p = isl_printer_print_str(p, s_close_set[0]); return p; } static __isl_give isl_printer *print_latex_map(__isl_keep isl_map *map, __isl_take isl_printer *p, __isl_keep isl_basic_map *aff) { if (isl_map_dim(map, isl_dim_param) > 0) { p = print_tuple(map->dim, p, isl_dim_param, 1, NULL, NULL); p = isl_printer_print_str(p, s_to[1]); } p = isl_printer_print_str(p, s_open_set[1]); p = print_space(map->dim, p, 1, 0, aff, NULL); p = print_disjuncts_map(map, p, 1); p = isl_printer_print_str(p, s_close_set[1]); return p; } static __isl_give isl_printer *isl_map_print_latex(__isl_keep isl_map *map, __isl_take isl_printer *p) { int i; struct isl_aff_split *split = NULL; if (map->n > 0) split = split_aff(map); if (!split) return print_latex_map(map, p, NULL); for (i = 0; i < map->n; ++i) { if (!split[i].map) break; if (i) p = isl_printer_print_str(p, " \\cup "); p = print_latex_map(split[i].map, p, split[i].aff); } free_split(split, map->n); return p; } __isl_give isl_printer *isl_printer_print_basic_map(__isl_take isl_printer *p, __isl_keep isl_basic_map *bmap) { if (!p || !bmap) goto error; if (p->output_format == ISL_FORMAT_ISL) return isl_basic_map_print_isl(bmap, p, 0); else if (p->output_format == ISL_FORMAT_OMEGA) return basic_map_print_omega(bmap, p); isl_assert(bmap->ctx, 0, goto error); error: isl_printer_free(p); return NULL; } void isl_basic_map_print(__isl_keep isl_basic_map *bmap, FILE *out, int indent, const char *prefix, const char *suffix, unsigned output_format) { isl_printer *printer; if (!bmap) return; printer = isl_printer_to_file(bmap->ctx, out); printer = isl_printer_set_indent(printer, indent); printer = isl_printer_set_prefix(printer, prefix); printer = isl_printer_set_suffix(printer, suffix); printer = isl_printer_set_output_format(printer, output_format); isl_printer_print_basic_map(printer, bmap); isl_printer_free(printer); } __isl_give isl_printer *isl_printer_print_basic_set(__isl_take isl_printer *p, __isl_keep isl_basic_set *bset) { if (!p || !bset) goto error; if (p->output_format == ISL_FORMAT_ISL) return isl_basic_map_print_isl(bset, p, 0); else if (p->output_format == ISL_FORMAT_POLYLIB) return isl_basic_set_print_polylib(bset, p, 0); else if (p->output_format == ISL_FORMAT_EXT_POLYLIB) return isl_basic_set_print_polylib(bset, p, 1); else if (p->output_format == ISL_FORMAT_POLYLIB_CONSTRAINTS) return bset_print_constraints_polylib(bset, p); else if (p->output_format == ISL_FORMAT_OMEGA) return basic_set_print_omega(bset, p); isl_assert(p->ctx, 0, goto error); error: isl_printer_free(p); return NULL; } void isl_basic_set_print(struct isl_basic_set *bset, FILE *out, int indent, const char *prefix, const char *suffix, unsigned output_format) { isl_printer *printer; if (!bset) return; printer = isl_printer_to_file(bset->ctx, out); printer = isl_printer_set_indent(printer, indent); printer = isl_printer_set_prefix(printer, prefix); printer = isl_printer_set_suffix(printer, suffix); printer = isl_printer_set_output_format(printer, output_format); isl_printer_print_basic_set(printer, bset); isl_printer_free(printer); } __isl_give isl_printer *isl_printer_print_set(__isl_take isl_printer *p, __isl_keep isl_set *set) { if (!p || !set) goto error; if (p->output_format == ISL_FORMAT_ISL) return isl_map_print_isl((isl_map *)set, p); else if (p->output_format == ISL_FORMAT_POLYLIB) return isl_set_print_polylib(set, p, 0); else if (p->output_format == ISL_FORMAT_EXT_POLYLIB) return isl_set_print_polylib(set, p, 1); else if (p->output_format == ISL_FORMAT_OMEGA) return isl_set_print_omega(set, p); else if (p->output_format == ISL_FORMAT_LATEX) return isl_map_print_latex((isl_map *)set, p); isl_assert(set->ctx, 0, goto error); error: isl_printer_free(p); return NULL; } void isl_set_print(struct isl_set *set, FILE *out, int indent, unsigned output_format) { isl_printer *printer; if (!set) return; printer = isl_printer_to_file(set->ctx, out); printer = isl_printer_set_indent(printer, indent); printer = isl_printer_set_output_format(printer, output_format); printer = isl_printer_print_set(printer, set); isl_printer_free(printer); } __isl_give isl_printer *isl_printer_print_map(__isl_take isl_printer *p, __isl_keep isl_map *map) { if (!p || !map) goto error; if (p->output_format == ISL_FORMAT_ISL) return isl_map_print_isl(map, p); else if (p->output_format == ISL_FORMAT_POLYLIB) return isl_map_print_polylib(map, p, 0); else if (p->output_format == ISL_FORMAT_EXT_POLYLIB) return isl_map_print_polylib(map, p, 1); else if (p->output_format == ISL_FORMAT_OMEGA) return isl_map_print_omega(map, p); else if (p->output_format == ISL_FORMAT_LATEX) return isl_map_print_latex(map, p); isl_assert(map->ctx, 0, goto error); error: isl_printer_free(p); return NULL; } struct isl_union_print_data { isl_printer *p; int first; }; static int print_map_body(__isl_take isl_map *map, void *user) { struct isl_union_print_data *data; data = (struct isl_union_print_data *)user; if (!data->first) data->p = isl_printer_print_str(data->p, "; "); data->first = 0; data->p = isl_map_print_isl_body(map, data->p); isl_map_free(map); return 0; } static __isl_give isl_printer *isl_union_map_print_isl( __isl_keep isl_union_map *umap, __isl_take isl_printer *p) { struct isl_union_print_data data = { p, 1 }; isl_space *dim; dim = isl_union_map_get_space(umap); if (isl_space_dim(dim, isl_dim_param) > 0) { p = print_tuple(dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, s_to[0]); } isl_space_free(dim); p = isl_printer_print_str(p, s_open_set[0]); isl_union_map_foreach_map(umap, &print_map_body, &data); p = data.p; p = isl_printer_print_str(p, s_close_set[0]); return p; } static int print_latex_map_body(__isl_take isl_map *map, void *user) { struct isl_union_print_data *data; data = (struct isl_union_print_data *)user; if (!data->first) data->p = isl_printer_print_str(data->p, " \\cup "); data->first = 0; data->p = isl_map_print_latex(map, data->p); isl_map_free(map); return 0; } static __isl_give isl_printer *isl_union_map_print_latex( __isl_keep isl_union_map *umap, __isl_take isl_printer *p) { struct isl_union_print_data data = { p, 1 }; isl_union_map_foreach_map(umap, &print_latex_map_body, &data); p = data.p; return p; } __isl_give isl_printer *isl_printer_print_union_map(__isl_take isl_printer *p, __isl_keep isl_union_map *umap) { if (!p || !umap) goto error; if (p->output_format == ISL_FORMAT_ISL) return isl_union_map_print_isl(umap, p); if (p->output_format == ISL_FORMAT_LATEX) return isl_union_map_print_latex(umap, p); isl_die(p->ctx, isl_error_invalid, "invalid output format for isl_union_map", goto error); error: isl_printer_free(p); return NULL; } __isl_give isl_printer *isl_printer_print_union_set(__isl_take isl_printer *p, __isl_keep isl_union_set *uset) { if (!p || !uset) goto error; if (p->output_format == ISL_FORMAT_ISL) return isl_union_map_print_isl((isl_union_map *)uset, p); if (p->output_format == ISL_FORMAT_LATEX) return isl_union_map_print_latex((isl_union_map *)uset, p); isl_die(p->ctx, isl_error_invalid, "invalid output format for isl_union_set", goto error); error: isl_printer_free(p); return NULL; } void isl_map_print(__isl_keep isl_map *map, FILE *out, int indent, unsigned output_format) { isl_printer *printer; if (!map) return; printer = isl_printer_to_file(map->ctx, out); printer = isl_printer_set_indent(printer, indent); printer = isl_printer_set_output_format(printer, output_format); printer = isl_printer_print_map(printer, map); isl_printer_free(printer); } static int upoly_rec_n_non_zero(__isl_keep struct isl_upoly_rec *rec) { int i; int n; for (i = 0, n = 0; i < rec->n; ++i) if (!isl_upoly_is_zero(rec->p[i])) ++n; return n; } static __isl_give isl_printer *print_div(__isl_keep isl_space *dim, __isl_keep isl_mat *div, int pos, __isl_take isl_printer *p) { int c = p->output_format == ISL_FORMAT_C; p = isl_printer_print_str(p, c ? "floord(" : "[("); p = print_affine_of_len(dim, div, p, div->row[pos] + 1, div->n_col - 1); p = isl_printer_print_str(p, c ? ", " : ")/"); p = isl_printer_print_isl_int(p, div->row[pos][0]); p = isl_printer_print_str(p, c ? ")" : "]"); return p; } static __isl_give isl_printer *upoly_print_cst(__isl_keep struct isl_upoly *up, __isl_take isl_printer *p, int first) { struct isl_upoly_cst *cst; int neg; cst = isl_upoly_as_cst(up); if (!cst) goto error; neg = !first && isl_int_is_neg(cst->n); if (!first) p = isl_printer_print_str(p, neg ? " - " : " + "); if (neg) isl_int_neg(cst->n, cst->n); if (isl_int_is_zero(cst->d)) { int sgn = isl_int_sgn(cst->n); p = isl_printer_print_str(p, sgn < 0 ? "-infty" : sgn == 0 ? "NaN" : "infty"); } else p = isl_printer_print_isl_int(p, cst->n); if (neg) isl_int_neg(cst->n, cst->n); if (!isl_int_is_zero(cst->d) && !isl_int_is_one(cst->d)) { p = isl_printer_print_str(p, "/"); p = isl_printer_print_isl_int(p, cst->d); } return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_base(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_mat *div, int var) { unsigned total; total = isl_space_dim(dim, isl_dim_all); if (var < total) p = print_term(dim, NULL, dim->ctx->one, 1 + var, p, 0); else p = print_div(dim, div, var - total, p); return p; } static __isl_give isl_printer *print_pow(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_mat *div, int var, int exp) { p = print_base(p, dim, div, var); if (exp == 1) return p; if (p->output_format == ISL_FORMAT_C) { int i; for (i = 1; i < exp; ++i) { p = isl_printer_print_str(p, "*"); p = print_base(p, dim, div, var); } } else { p = isl_printer_print_str(p, "^"); p = isl_printer_print_int(p, exp); } return p; } static __isl_give isl_printer *upoly_print(__isl_keep struct isl_upoly *up, __isl_keep isl_space *dim, __isl_keep isl_mat *div, __isl_take isl_printer *p, int outer) { int i, n, first, print_parens; struct isl_upoly_rec *rec; if (!p || !up || !dim || !div) goto error; if (isl_upoly_is_cst(up)) return upoly_print_cst(up, p, 1); rec = isl_upoly_as_rec(up); if (!rec) goto error; n = upoly_rec_n_non_zero(rec); print_parens = n > 1 || (outer && rec->up.var >= isl_space_dim(dim, isl_dim_all)); if (print_parens) p = isl_printer_print_str(p, "("); for (i = 0, first = 1; i < rec->n; ++i) { if (isl_upoly_is_zero(rec->p[i])) continue; if (isl_upoly_is_negone(rec->p[i])) { if (!i) p = isl_printer_print_str(p, "-1"); else if (first) p = isl_printer_print_str(p, "-"); else p = isl_printer_print_str(p, " - "); } else if (isl_upoly_is_cst(rec->p[i]) && !isl_upoly_is_one(rec->p[i])) p = upoly_print_cst(rec->p[i], p, first); else { if (!first) p = isl_printer_print_str(p, " + "); if (i == 0 || !isl_upoly_is_one(rec->p[i])) p = upoly_print(rec->p[i], dim, div, p, 0); } first = 0; if (i == 0) continue; if (!isl_upoly_is_one(rec->p[i]) && !isl_upoly_is_negone(rec->p[i])) p = isl_printer_print_str(p, " * "); p = print_pow(p, dim, div, rec->up.var, i); } if (print_parens) p = isl_printer_print_str(p, ")"); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_qpolynomial(__isl_take isl_printer *p, __isl_keep isl_qpolynomial *qp) { if (!p || !qp) goto error; p = upoly_print(qp->upoly, qp->dim, qp->div, p, 1); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_qpolynomial_isl(__isl_take isl_printer *p, __isl_keep isl_qpolynomial *qp) { if (!p || !qp) goto error; if (isl_space_dim(qp->dim, isl_dim_param) > 0) { p = print_tuple(qp->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); if (!isl_space_is_params(qp->dim)) { p = print_space(qp->dim, p, 0, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = print_qpolynomial(p, qp); p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_qpolynomial_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_qpolynomial *qp) { isl_int den; isl_int_init(den); isl_qpolynomial_get_den(qp, &den); if (!isl_int_is_one(den)) { isl_qpolynomial *f; p = isl_printer_print_str(p, "("); qp = isl_qpolynomial_copy(qp); f = isl_qpolynomial_rat_cst_on_domain(isl_space_copy(qp->dim), den, qp->dim->ctx->one); qp = isl_qpolynomial_mul(qp, f); } if (qp) p = upoly_print(qp->upoly, dim, qp->div, p, 0); else p = isl_printer_free(p); if (!isl_int_is_one(den)) { p = isl_printer_print_str(p, ")/"); p = isl_printer_print_isl_int(p, den); isl_qpolynomial_free(qp); } isl_int_clear(den); return p; } __isl_give isl_printer *isl_printer_print_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_qpolynomial *qp) { if (!p || !qp) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_qpolynomial_isl(p, qp); else if (p->output_format == ISL_FORMAT_C) return print_qpolynomial_c(p, qp->dim, qp); else isl_die(qp->dim->ctx, isl_error_unsupported, "output format not supported for isl_qpolynomials", goto error); error: isl_printer_free(p); return NULL; } void isl_qpolynomial_print(__isl_keep isl_qpolynomial *qp, FILE *out, unsigned output_format) { isl_printer *p; if (!qp) return; isl_assert(qp->dim->ctx, output_format == ISL_FORMAT_ISL, return); p = isl_printer_to_file(qp->dim->ctx, out); p = isl_printer_print_qpolynomial(p, qp); isl_printer_free(p); } static __isl_give isl_printer *qpolynomial_fold_print( __isl_keep isl_qpolynomial_fold *fold, __isl_take isl_printer *p) { int i; if (fold->type == isl_fold_min) p = isl_printer_print_str(p, "min"); else if (fold->type == isl_fold_max) p = isl_printer_print_str(p, "max"); p = isl_printer_print_str(p, "("); for (i = 0; i < fold->n; ++i) { if (i) p = isl_printer_print_str(p, ", "); p = print_qpolynomial(p, fold->qp[i]); } p = isl_printer_print_str(p, ")"); return p; } void isl_qpolynomial_fold_print(__isl_keep isl_qpolynomial_fold *fold, FILE *out, unsigned output_format) { isl_printer *p; if (!fold) return; isl_assert(fold->dim->ctx, output_format == ISL_FORMAT_ISL, return); p = isl_printer_to_file(fold->dim->ctx, out); p = isl_printer_print_qpolynomial_fold(p, fold); isl_printer_free(p); } static __isl_give isl_printer *isl_pwqp_print_isl_body( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp) { int i = 0; for (i = 0; i < pwqp->n; ++i) { if (i) p = isl_printer_print_str(p, "; "); if (!isl_space_is_params(pwqp->p[i].set->dim)) { p = print_space(pwqp->p[i].set->dim, p, 0, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = print_qpolynomial(p, pwqp->p[i].qp); p = print_disjuncts((isl_map *)pwqp->p[i].set, p, 0); } return p; } static __isl_give isl_printer *print_pw_qpolynomial_isl( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp) { if (!p || !pwqp) goto error; if (isl_space_dim(pwqp->dim, isl_dim_param) > 0) { p = print_tuple(pwqp->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); if (pwqp->n == 0) { if (!isl_space_is_set(pwqp->dim)) { p = print_tuple(pwqp->dim, p, isl_dim_in, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "0"); } p = isl_pwqp_print_isl_body(p, pwqp); p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } void isl_pw_qpolynomial_print(__isl_keep isl_pw_qpolynomial *pwqp, FILE *out, unsigned output_format) { isl_printer *p; if (!pwqp) return; p = isl_printer_to_file(pwqp->dim->ctx, out); p = isl_printer_set_output_format(p, output_format); p = isl_printer_print_pw_qpolynomial(p, pwqp); isl_printer_free(p); } static __isl_give isl_printer *isl_pwf_print_isl_body( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf) { int i = 0; for (i = 0; i < pwf->n; ++i) { if (i) p = isl_printer_print_str(p, "; "); if (!isl_space_is_params(pwf->p[i].set->dim)) { p = print_space(pwf->p[i].set->dim, p, 0, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = qpolynomial_fold_print(pwf->p[i].fold, p); p = print_disjuncts((isl_map *)pwf->p[i].set, p, 0); } return p; } static __isl_give isl_printer *print_pw_qpolynomial_fold_isl( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf) { if (isl_space_dim(pwf->dim, isl_dim_param) > 0) { p = print_tuple(pwf->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); if (pwf->n == 0) { if (!isl_space_is_set(pwf->dim)) { p = print_tuple(pwf->dim, p, isl_dim_in, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "0"); } p = isl_pwf_print_isl_body(p, pwf); p = isl_printer_print_str(p, " }"); return p; } static __isl_give isl_printer *print_affine_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, isl_int *c); static __isl_give isl_printer *print_name_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos) { if (type == isl_dim_div) { p = isl_printer_print_str(p, "floord("); p = print_affine_c(p, dim, bset, bset->div[pos] + 1); p = isl_printer_print_str(p, ", "); p = isl_printer_print_isl_int(p, bset->div[pos][0]); p = isl_printer_print_str(p, ")"); } else { const char *name; name = isl_space_get_dim_name(dim, type, pos); if (!name) name = "UNNAMED"; p = isl_printer_print_str(p, name); } return p; } static __isl_give isl_printer *print_term_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, isl_int c, unsigned pos) { enum isl_dim_type type; if (pos == 0) return isl_printer_print_isl_int(p, c); if (isl_int_is_one(c)) ; else if (isl_int_is_negone(c)) p = isl_printer_print_str(p, "-"); else { p = isl_printer_print_isl_int(p, c); p = isl_printer_print_str(p, "*"); } type = pos2type(dim, &pos); p = print_name_c(p, dim, bset, type, pos); return p; } static __isl_give isl_printer *print_partial_affine_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, isl_int *c, unsigned len) { int i; int first; for (i = 0, first = 1; i < len; ++i) { int flip = 0; if (isl_int_is_zero(c[i])) continue; if (!first) { if (isl_int_is_neg(c[i])) { flip = 1; isl_int_neg(c[i], c[i]); p = isl_printer_print_str(p, " - "); } else p = isl_printer_print_str(p, " + "); } first = 0; p = print_term_c(p, dim, bset, c[i], i); if (flip) isl_int_neg(c[i], c[i]); } if (first) p = isl_printer_print_str(p, "0"); return p; } static __isl_give isl_printer *print_affine_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, isl_int *c) { unsigned len = 1 + isl_basic_set_total_dim(bset); return print_partial_affine_c(p, dim, bset, c, len); } /* We skip the constraint if it is implied by the div expression. */ static __isl_give isl_printer *print_constraint_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset, isl_int *c, const char *op, int first) { unsigned o_div; unsigned n_div; int div; o_div = isl_basic_set_offset(bset, isl_dim_div); n_div = isl_basic_set_dim(bset, isl_dim_div); div = isl_seq_last_non_zero(c + o_div, n_div); if (div >= 0 && isl_basic_set_is_div_constraint(bset, c, div)) return p; if (!first) p = isl_printer_print_str(p, " && "); p = print_affine_c(p, dim, bset, c); p = isl_printer_print_str(p, " "); p = isl_printer_print_str(p, op); p = isl_printer_print_str(p, " 0"); return p; } static __isl_give isl_printer *print_basic_set_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_basic_set *bset) { int i, j; unsigned n_div = isl_basic_set_dim(bset, isl_dim_div); unsigned total = isl_basic_set_total_dim(bset) - n_div; for (i = 0; i < bset->n_eq; ++i) { j = isl_seq_last_non_zero(bset->eq[i] + 1 + total, n_div); if (j < 0) p = print_constraint_c(p, dim, bset, bset->eq[i], "==", !i); else { if (i) p = isl_printer_print_str(p, " && "); p = isl_printer_print_str(p, "("); p = print_partial_affine_c(p, dim, bset, bset->eq[i], 1 + total + j); p = isl_printer_print_str(p, ") % "); p = isl_printer_print_isl_int(p, bset->eq[i][1 + total + j]); p = isl_printer_print_str(p, " == 0"); } } for (i = 0; i < bset->n_ineq; ++i) p = print_constraint_c(p, dim, bset, bset->ineq[i], ">=", !bset->n_eq && !i); return p; } static __isl_give isl_printer *print_set_c(__isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_set *set) { int i; if (!set) return isl_printer_free(p); if (set->n == 0) p = isl_printer_print_str(p, "0"); for (i = 0; i < set->n; ++i) { if (i) p = isl_printer_print_str(p, " || "); if (set->n > 1) p = isl_printer_print_str(p, "("); p = print_basic_set_c(p, dim, set->p[i]); if (set->n > 1) p = isl_printer_print_str(p, ")"); } return p; } static __isl_give isl_printer *print_pw_qpolynomial_c( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp) { int i; if (pwqp->n == 1 && isl_set_plain_is_universe(pwqp->p[0].set)) return print_qpolynomial_c(p, pwqp->dim, pwqp->p[0].qp); for (i = 0; i < pwqp->n; ++i) { p = isl_printer_print_str(p, "("); p = print_set_c(p, pwqp->dim, pwqp->p[i].set); p = isl_printer_print_str(p, ") ? ("); p = print_qpolynomial_c(p, pwqp->dim, pwqp->p[i].qp); p = isl_printer_print_str(p, ") : "); } p = isl_printer_print_str(p, "0"); return p; } __isl_give isl_printer *isl_printer_print_pw_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp) { if (!p || !pwqp) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_pw_qpolynomial_isl(p, pwqp); else if (p->output_format == ISL_FORMAT_C) return print_pw_qpolynomial_c(p, pwqp); isl_assert(p->ctx, 0, goto error); error: isl_printer_free(p); return NULL; } static int print_pwqp_body(__isl_take isl_pw_qpolynomial *pwqp, void *user) { struct isl_union_print_data *data; data = (struct isl_union_print_data *)user; if (!data->first) data->p = isl_printer_print_str(data->p, "; "); data->first = 0; data->p = isl_pwqp_print_isl_body(data->p, pwqp); isl_pw_qpolynomial_free(pwqp); return 0; } static __isl_give isl_printer *print_union_pw_qpolynomial_isl( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial *upwqp) { struct isl_union_print_data data = { p, 1 }; isl_space *dim; dim = isl_union_pw_qpolynomial_get_space(upwqp); if (isl_space_dim(dim, isl_dim_param) > 0) { p = print_tuple(dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } isl_space_free(dim); p = isl_printer_print_str(p, "{ "); isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp, &print_pwqp_body, &data); p = data.p; p = isl_printer_print_str(p, " }"); return p; } __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial *upwqp) { if (!p || !upwqp) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_union_pw_qpolynomial_isl(p, upwqp); isl_die(p->ctx, isl_error_invalid, "invalid output format for isl_union_pw_qpolynomial", goto error); error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_qpolynomial_fold_c( __isl_take isl_printer *p, __isl_keep isl_space *dim, __isl_keep isl_qpolynomial_fold *fold) { int i; for (i = 0; i < fold->n - 1; ++i) if (fold->type == isl_fold_min) p = isl_printer_print_str(p, "min("); else if (fold->type == isl_fold_max) p = isl_printer_print_str(p, "max("); for (i = 0; i < fold->n; ++i) { if (i) p = isl_printer_print_str(p, ", "); p = print_qpolynomial_c(p, dim, fold->qp[i]); if (i) p = isl_printer_print_str(p, ")"); } return p; } __isl_give isl_printer *isl_printer_print_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_qpolynomial_fold *fold) { if (!p || !fold) goto error; if (p->output_format == ISL_FORMAT_ISL) return qpolynomial_fold_print(fold, p); else if (p->output_format == ISL_FORMAT_C) return print_qpolynomial_fold_c(p, fold->dim, fold); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", goto error); error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_pw_qpolynomial_fold_c( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf) { int i; if (pwf->n == 1 && isl_set_plain_is_universe(pwf->p[0].set)) return print_qpolynomial_fold_c(p, pwf->dim, pwf->p[0].fold); for (i = 0; i < pwf->n; ++i) { p = isl_printer_print_str(p, "("); p = print_set_c(p, pwf->dim, pwf->p[i].set); p = isl_printer_print_str(p, ") ? ("); p = print_qpolynomial_fold_c(p, pwf->dim, pwf->p[i].fold); p = isl_printer_print_str(p, ") : "); } p = isl_printer_print_str(p, "0"); return p; } __isl_give isl_printer *isl_printer_print_pw_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf) { if (!p || !pwf) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_pw_qpolynomial_fold_isl(p, pwf); else if (p->output_format == ISL_FORMAT_C) return print_pw_qpolynomial_fold_c(p, pwf); isl_assert(p->ctx, 0, goto error); error: isl_printer_free(p); return NULL; } void isl_pw_qpolynomial_fold_print(__isl_keep isl_pw_qpolynomial_fold *pwf, FILE *out, unsigned output_format) { isl_printer *p; if (!pwf) return; p = isl_printer_to_file(pwf->dim->ctx, out); p = isl_printer_set_output_format(p, output_format); p = isl_printer_print_pw_qpolynomial_fold(p, pwf); isl_printer_free(p); } static int print_pwf_body(__isl_take isl_pw_qpolynomial_fold *pwf, void *user) { struct isl_union_print_data *data; data = (struct isl_union_print_data *)user; if (!data->first) data->p = isl_printer_print_str(data->p, "; "); data->first = 0; data->p = isl_pwf_print_isl_body(data->p, pwf); isl_pw_qpolynomial_fold_free(pwf); return 0; } static __isl_give isl_printer *print_union_pw_qpolynomial_fold_isl( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial_fold *upwf) { struct isl_union_print_data data = { p, 1 }; isl_space *dim; dim = isl_union_pw_qpolynomial_fold_get_space(upwf); if (isl_space_dim(dim, isl_dim_param) > 0) { p = print_tuple(dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } isl_space_free(dim); p = isl_printer_print_str(p, "{ "); isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(upwf, &print_pwf_body, &data); p = data.p; p = isl_printer_print_str(p, " }"); return p; } __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial_fold *upwf) { if (!p || !upwf) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_union_pw_qpolynomial_fold_isl(p, upwf); isl_die(p->ctx, isl_error_invalid, "invalid output format for isl_union_pw_qpolynomial_fold", goto error); error: isl_printer_free(p); return NULL; } __isl_give isl_printer *isl_printer_print_constraint(__isl_take isl_printer *p, __isl_keep isl_constraint *c) { isl_basic_map *bmap; if (!p || !c) goto error; bmap = isl_basic_map_from_constraint(isl_constraint_copy(c)); p = isl_printer_print_basic_map(p, bmap); isl_basic_map_free(bmap); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *isl_printer_print_space_isl( __isl_take isl_printer *p, __isl_keep isl_space *dim) { if (!dim) goto error; if (isl_space_dim(dim, isl_dim_param) > 0) { p = print_tuple(dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); if (isl_space_is_params(dim)) p = isl_printer_print_str(p, s_such_that[0]); else p = print_space(dim, p, 0, 0, NULL, NULL); p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } __isl_give isl_printer *isl_printer_print_space(__isl_take isl_printer *p, __isl_keep isl_space *space) { if (!p || !space) return isl_printer_free(p); if (p->output_format == ISL_FORMAT_ISL) return isl_printer_print_space_isl(p, space); else if (p->output_format == ISL_FORMAT_OMEGA) return print_omega_parameters(space, p); isl_die(isl_space_get_ctx(space), isl_error_unsupported, "output format not supported for space", return isl_printer_free(p)); } __isl_give isl_printer *isl_printer_print_local_space(__isl_take isl_printer *p, __isl_keep isl_local_space *ls) { unsigned total; unsigned n_div; if (!ls) goto error; total = isl_local_space_dim(ls, isl_dim_all); if (isl_local_space_dim(ls, isl_dim_param) > 0) { p = print_tuple(ls->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_space(ls->dim, p, 0, 0, NULL, NULL); n_div = isl_local_space_dim(ls, isl_dim_div); if (n_div > 0) { int i; p = isl_printer_print_str(p, " : "); p = isl_printer_print_str(p, s_open_exists[0]); for (i = 0; i < n_div; ++i) { if (i) p = isl_printer_print_str(p, ", "); p = print_name(ls->dim, p, isl_dim_div, i, 0); if (isl_int_is_zero(ls->div->row[i][0])) continue; p = isl_printer_print_str(p, " = [("); p = print_affine_of_len(ls->dim, ls->div, p, ls->div->row[i] + 1, 1 + total); p = isl_printer_print_str(p, ")/"); p = isl_printer_print_isl_int(p, ls->div->row[i][0]); p = isl_printer_print_str(p, "]"); } } else if (isl_space_is_params(ls->dim)) p = isl_printer_print_str(p, s_such_that[0]); p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_aff_body(__isl_take isl_printer *p, __isl_keep isl_aff *aff) { unsigned total; total = isl_local_space_dim(aff->ls, isl_dim_all); p = isl_printer_print_str(p, "("); p = print_affine_of_len(aff->ls->dim, aff->ls->div, p, aff->v->el + 1, 1 + total); if (isl_int_is_one(aff->v->el[0])) p = isl_printer_print_str(p, ")"); else { p = isl_printer_print_str(p, ")/"); p = isl_printer_print_isl_int(p, aff->v->el[0]); } return p; } static __isl_give isl_printer *print_aff(__isl_take isl_printer *p, __isl_keep isl_aff *aff) { if (isl_space_is_params(aff->ls->dim)) ; else { p = print_tuple(aff->ls->dim, p, isl_dim_set, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "["); p = print_aff_body(p, aff); p = isl_printer_print_str(p, "]"); return p; } static __isl_give isl_printer *print_aff_isl(__isl_take isl_printer *p, __isl_keep isl_aff *aff) { if (!aff) goto error; if (isl_local_space_dim(aff->ls, isl_dim_param) > 0) { p = print_tuple(aff->ls->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_aff(p, aff); p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_pw_aff_isl(__isl_take isl_printer *p, __isl_keep isl_pw_aff *pwaff) { int i; if (!pwaff) goto error; if (isl_space_dim(pwaff->dim, isl_dim_param) > 0) { p = print_tuple(pwaff->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); for (i = 0; i < pwaff->n; ++i) { if (i) p = isl_printer_print_str(p, "; "); p = print_aff(p, pwaff->p[i].aff); p = print_disjuncts((isl_map *)pwaff->p[i].set, p, 0); } p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_ls_affine_c(__isl_take isl_printer *p, __isl_keep isl_local_space *ls, isl_int *c); static __isl_give isl_printer *print_ls_name_c(__isl_take isl_printer *p, __isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos) { if (type == isl_dim_div) { p = isl_printer_print_str(p, "floord("); p = print_ls_affine_c(p, ls, ls->div->row[pos] + 1); p = isl_printer_print_str(p, ", "); p = isl_printer_print_isl_int(p, ls->div->row[pos][0]); p = isl_printer_print_str(p, ")"); } else { const char *name; name = isl_space_get_dim_name(ls->dim, type, pos); if (!name) name = "UNNAMED"; p = isl_printer_print_str(p, name); } return p; } static __isl_give isl_printer *print_ls_term_c(__isl_take isl_printer *p, __isl_keep isl_local_space *ls, isl_int c, unsigned pos) { enum isl_dim_type type; if (pos == 0) return isl_printer_print_isl_int(p, c); if (isl_int_is_one(c)) ; else if (isl_int_is_negone(c)) p = isl_printer_print_str(p, "-"); else { p = isl_printer_print_isl_int(p, c); p = isl_printer_print_str(p, "*"); } type = pos2type(ls->dim, &pos); p = print_ls_name_c(p, ls, type, pos); return p; } static __isl_give isl_printer *print_ls_partial_affine_c( __isl_take isl_printer *p, __isl_keep isl_local_space *ls, isl_int *c, unsigned len) { int i; int first; for (i = 0, first = 1; i < len; ++i) { int flip = 0; if (isl_int_is_zero(c[i])) continue; if (!first) { if (isl_int_is_neg(c[i])) { flip = 1; isl_int_neg(c[i], c[i]); p = isl_printer_print_str(p, " - "); } else p = isl_printer_print_str(p, " + "); } first = 0; p = print_ls_term_c(p, ls, c[i], i); if (flip) isl_int_neg(c[i], c[i]); } if (first) p = isl_printer_print_str(p, "0"); return p; } static __isl_give isl_printer *print_ls_affine_c(__isl_take isl_printer *p, __isl_keep isl_local_space *ls, isl_int *c) { unsigned len = 1 + isl_local_space_dim(ls, isl_dim_all); return print_ls_partial_affine_c(p, ls, c, len); } static __isl_give isl_printer *print_aff_c(__isl_take isl_printer *p, __isl_keep isl_aff *aff) { unsigned total; total = isl_local_space_dim(aff->ls, isl_dim_all); if (!isl_int_is_one(aff->v->el[0])) p = isl_printer_print_str(p, "("); p = print_ls_partial_affine_c(p, aff->ls, aff->v->el + 1, 1 + total); if (!isl_int_is_one(aff->v->el[0])) { p = isl_printer_print_str(p, ")/"); p = isl_printer_print_isl_int(p, aff->v->el[0]); } return p; } /* Print the affine expression "aff" in C format to "p". * The dimension names are taken from "space" * "set" represents the domain of the affine expression. */ static __isl_give isl_printer *print_aff_on_domain_c(__isl_take isl_printer *p, __isl_keep isl_space *space, __isl_keep isl_aff *aff, __isl_keep isl_set *set) { isl_set *u; isl_ast_build *build; isl_ast_expr *expr; u = isl_set_universe(isl_space_copy(space)); build = isl_ast_build_from_context(u); build = isl_ast_build_restrict(build, isl_set_copy(set)); expr = isl_ast_expr_from_aff(isl_aff_copy(aff), build); p = isl_printer_print_ast_expr(p, expr); isl_ast_expr_free(expr); isl_ast_build_free(build); return p; } /* In the C format, we cannot express that "pwaff" may be undefined * on parts of the domain space. We therefore assume that the expression * will only be evaluated on its definition domain and compute the gist * of each cell with respect to this domain. */ static __isl_give isl_printer *print_pw_aff_c(__isl_take isl_printer *p, __isl_keep isl_pw_aff *pwaff) { int i; isl_set *domain; isl_space *space; if (pwaff->n < 1) isl_die(p->ctx, isl_error_unsupported, "cannot print empty isl_pw_aff in C format", goto error); space = isl_pw_aff_get_domain_space(pwaff); if (!space) goto error; domain = isl_pw_aff_domain(isl_pw_aff_copy(pwaff)); for (i = 0; i < pwaff->n - 1; ++i) { isl_set *set_i; p = isl_printer_print_str(p, "("); set_i = isl_set_copy(pwaff->p[i].set); set_i = isl_set_gist(set_i, isl_set_copy(domain)); p = print_set_c(p, space, set_i); isl_set_free(set_i); p = isl_printer_print_str(p, ") ? ("); p = print_aff_on_domain_c(p, space, pwaff->p[i].aff, pwaff->p[i].set); p = isl_printer_print_str(p, ") : "); } isl_set_free(domain); p = print_aff_on_domain_c(p, space, pwaff->p[pwaff->n - 1].aff, pwaff->p[pwaff->n - 1].set); isl_space_free(space); return p; error: isl_printer_free(p); return NULL; } __isl_give isl_printer *isl_printer_print_aff(__isl_take isl_printer *p, __isl_keep isl_aff *aff) { if (!p || !aff) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_aff_isl(p, aff); else if (p->output_format == ISL_FORMAT_C) return print_aff_c(p, aff); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", goto error); error: isl_printer_free(p); return NULL; } __isl_give isl_printer *isl_printer_print_pw_aff(__isl_take isl_printer *p, __isl_keep isl_pw_aff *pwaff) { if (!p || !pwaff) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_pw_aff_isl(p, pwaff); else if (p->output_format == ISL_FORMAT_C) return print_pw_aff_c(p, pwaff); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", goto error); error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_multi_aff(__isl_take isl_printer *p, __isl_keep isl_multi_aff *maff) { return print_space(maff->space, p, 0, 0, NULL, maff); } static __isl_give isl_printer *print_multi_aff_isl(__isl_take isl_printer *p, __isl_keep isl_multi_aff *maff) { if (!maff) goto error; if (isl_space_dim(maff->space, isl_dim_param) > 0) { p = print_tuple(maff->space, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_multi_aff(p, maff); p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } __isl_give isl_printer *isl_printer_print_multi_aff(__isl_take isl_printer *p, __isl_keep isl_multi_aff *maff) { if (!p || !maff) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_multi_aff_isl(p, maff); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", goto error); error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_pw_multi_aff_body( __isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma) { int i; if (!pma) goto error; for (i = 0; i < pma->n; ++i) { if (i) p = isl_printer_print_str(p, "; "); p = print_multi_aff(p, pma->p[i].maff); p = print_disjuncts((isl_map *)pma->p[i].set, p, 0); } return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_pw_multi_aff_isl(__isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma) { if (!pma) goto error; if (isl_space_dim(pma->dim, isl_dim_param) > 0) { p = print_tuple(pma->dim, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "{ "); p = print_pw_multi_aff_body(p, pma); p = isl_printer_print_str(p, " }"); return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_unnamed_pw_multi_aff_c( __isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma) { int i; for (i = 0; i < pma->n - 1; ++i) { p = isl_printer_print_str(p, "("); p = print_set_c(p, pma->dim, pma->p[i].set); p = isl_printer_print_str(p, ") ? ("); p = print_aff_c(p, pma->p[i].maff->p[0]); p = isl_printer_print_str(p, ") : "); } return print_aff_c(p, pma->p[pma->n - 1].maff->p[0]); } static __isl_give isl_printer *print_pw_multi_aff_c(__isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma) { int n; const char *name; if (!pma) goto error; if (pma->n < 1) isl_die(p->ctx, isl_error_unsupported, "cannot print empty isl_pw_multi_aff in C format", goto error); name = isl_pw_multi_aff_get_tuple_name(pma, isl_dim_out); if (!name && isl_pw_multi_aff_dim(pma, isl_dim_out) == 1) return print_unnamed_pw_multi_aff_c(p, pma); if (!name) isl_die(p->ctx, isl_error_unsupported, "cannot print unnamed isl_pw_multi_aff in C format", goto error); p = isl_printer_print_str(p, name); n = isl_pw_multi_aff_dim(pma, isl_dim_out); if (n != 0) isl_die(p->ctx, isl_error_unsupported, "not supported yet", goto error); return p; error: isl_printer_free(p); return NULL; } __isl_give isl_printer *isl_printer_print_pw_multi_aff( __isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma) { if (!p || !pma) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_pw_multi_aff_isl(p, pma); if (p->output_format == ISL_FORMAT_C) return print_pw_multi_aff_c(p, pma); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", goto error); error: isl_printer_free(p); return NULL; } static int print_pw_multi_aff_body_wrap(__isl_take isl_pw_multi_aff *pma, void *user) { struct isl_union_print_data *data; data = (struct isl_union_print_data *) user; if (!data->first) data->p = isl_printer_print_str(data->p, "; "); data->first = 0; data->p = print_pw_multi_aff_body(data->p, pma); isl_pw_multi_aff_free(pma); return 0; } static __isl_give isl_printer *print_union_pw_multi_aff_isl( __isl_take isl_printer *p, __isl_keep isl_union_pw_multi_aff *upma) { struct isl_union_print_data data = { p, 1 }; isl_space *space; space = isl_union_pw_multi_aff_get_space(upma); if (isl_space_dim(space, isl_dim_param) > 0) { p = print_tuple(space, p, isl_dim_param, 0, NULL, NULL); p = isl_printer_print_str(p, s_to[0]); } isl_space_free(space); p = isl_printer_print_str(p, s_open_set[0]); isl_union_pw_multi_aff_foreach_pw_multi_aff(upma, &print_pw_multi_aff_body_wrap, &data); p = data.p; p = isl_printer_print_str(p, s_close_set[0]); return p; } __isl_give isl_printer *isl_printer_print_union_pw_multi_aff( __isl_take isl_printer *p, __isl_keep isl_union_pw_multi_aff *upma) { if (!p || !upma) goto error; if (p->output_format == ISL_FORMAT_ISL) return print_union_pw_multi_aff_isl(p, upma); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", goto error); error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *print_multi_pw_aff_isl(__isl_take isl_printer *p, __isl_keep isl_multi_pw_aff *mpa) { int i; if (!mpa) return isl_printer_free(p); p = isl_printer_print_str(p, "("); for (i = 0; i < mpa->n; ++i) { if (i) p = isl_printer_print_str(p, ","); p = isl_printer_print_pw_aff(p, mpa->p[i]); } p = isl_printer_print_str(p, ")"); return p; } __isl_give isl_printer *isl_printer_print_multi_pw_aff( __isl_take isl_printer *p, __isl_keep isl_multi_pw_aff *mpa) { if (!p || !mpa) return isl_printer_free(p); if (p->output_format == ISL_FORMAT_ISL) return print_multi_pw_aff_isl(p, mpa); isl_die(p->ctx, isl_error_unsupported, "unsupported output format", return isl_printer_free(p)); } cloog-0.18.2/isl/isl_sort.c0000664000175000017500000001147212254313240012422 00000000000000/* * The code of this file was taken from http://jeffreystedfast.blogspot.be, * where it was posted in 2011 by Jeffrey Stedfast under the MIT license. * The MIT license text is as follows: * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to * deal in the Software without restriction, including without limitation the * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or * sell copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS * IN THE SOFTWARE. */ #include #include #include #include #define MID(lo, hi) (lo + ((hi - lo) >> 1)) /* The code here is an optimized merge sort. Starting from a generic merge sort * the following optimizations were applied: * * o Batching of memcpy() calls: Instead of calling memcpy() to copy each and * every element into a temporary buffer, blocks of elements are copied * at a time. * * o To reduce the number of memcpy() calls further, copying leading * and trailing elements into our temporary buffer is avoided, in case it is * not necessary to merge them. * * A further optimization could be to specialize memcpy calls based on the * size of the types we compare. For now, this code does not include the * relevant optimization, as clang e.g. inlines a very efficient memcpy() * implementation. It is not clear, that the specialized version as provided in * the blog post, is really superior to the one that will be inlined by * default. So we decided to keep the code simple until this optimization was * proven to be beneficial. */ static void msort (void *array, void *buf, size_t low, size_t high, size_t size, int (* compare) (const void *, const void *, void *), void *arg) { char *a1, *al, *am, *ah, *ls, *hs, *lo, *hi, *b; size_t copied = 0; size_t mid; mid = MID (low, high); if (mid + 1 < high) msort (array, buf, mid + 1, high, size, compare, arg); if (mid > low) msort (array, buf, low, mid, size, compare, arg); ah = ((char *) array) + ((high + 1) * size); am = ((char *) array) + ((mid + 1) * size); a1 = al = ((char *) array) + (low * size); b = (char *) buf; lo = al; hi = am; do { ls = lo; hs = hi; if (lo > al || hi > am) { /* our last loop already compared lo & hi and found lo <= hi */ lo += size; } while (lo < am && compare (lo, hi, arg) <= 0) lo += size; if (lo < am) { if (copied == 0) { /* avoid copying the leading items */ a1 = lo; ls = lo; } /* our last compare tells us hi < lo */ hi += size; while (hi < ah && compare (hi, lo, arg) < 0) hi += size; if (lo > ls) { memcpy (b, ls, lo - ls); copied += (lo - ls); b += (lo - ls); } memcpy (b, hs, hi - hs); copied += (hi - hs); b += (hi - hs); } else if (copied) { memcpy (b, ls, lo - ls); copied += (lo - ls); b += (lo - ls); /* copy everything we needed to re-order back into array */ memcpy (a1, buf, copied); return; } else { /* everything already in order */ return; } } while (hi < ah); if (lo < am) { memcpy (b, lo, am - lo); copied += (am - lo); } memcpy (a1, buf, copied); } static int MergeSort (void *base, size_t nmemb, size_t size, int (* compare) (const void *, const void *, void *), void *arg) { void *tmp; if (nmemb < 2) return 0; if (!(tmp = malloc (nmemb * size))) { errno = ENOMEM; return -1; } msort (base, tmp, 0, nmemb - 1, size, compare, arg); free (tmp); return 0; } int isl_sort(void *const pbase, size_t total_elems, size_t size, int (*cmp)(const void *, const void *, void *arg), void *arg) { return MergeSort (pbase, total_elems, size, cmp, arg); } cloog-0.18.2/isl/isl_local_space.c0000664000175000017500000006516712254313240013712 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include #include #include #include isl_ctx *isl_local_space_get_ctx(__isl_keep isl_local_space *ls) { return ls ? ls->dim->ctx : NULL; } __isl_give isl_local_space *isl_local_space_alloc_div(__isl_take isl_space *dim, __isl_take isl_mat *div) { isl_ctx *ctx; isl_local_space *ls = NULL; if (!dim || !div) goto error; ctx = isl_space_get_ctx(dim); ls = isl_calloc_type(ctx, struct isl_local_space); if (!ls) goto error; ls->ref = 1; ls->dim = dim; ls->div = div; return ls; error: isl_mat_free(div); isl_space_free(dim); isl_local_space_free(ls); return NULL; } __isl_give isl_local_space *isl_local_space_alloc(__isl_take isl_space *dim, unsigned n_div) { isl_ctx *ctx; isl_mat *div; unsigned total; if (!dim) return NULL; total = isl_space_dim(dim, isl_dim_all); ctx = isl_space_get_ctx(dim); div = isl_mat_alloc(ctx, n_div, 1 + 1 + total + n_div); return isl_local_space_alloc_div(dim, div); } __isl_give isl_local_space *isl_local_space_from_space(__isl_take isl_space *dim) { return isl_local_space_alloc(dim, 0); } __isl_give isl_local_space *isl_local_space_copy(__isl_keep isl_local_space *ls) { if (!ls) return NULL; ls->ref++; return ls; } __isl_give isl_local_space *isl_local_space_dup(__isl_keep isl_local_space *ls) { if (!ls) return NULL; return isl_local_space_alloc_div(isl_space_copy(ls->dim), isl_mat_copy(ls->div)); } __isl_give isl_local_space *isl_local_space_cow(__isl_take isl_local_space *ls) { if (!ls) return NULL; if (ls->ref == 1) return ls; ls->ref--; return isl_local_space_dup(ls); } void *isl_local_space_free(__isl_take isl_local_space *ls) { if (!ls) return NULL; if (--ls->ref > 0) return NULL; isl_space_free(ls->dim); isl_mat_free(ls->div); free(ls); return NULL; } /* Is the local space that of a set? */ int isl_local_space_is_set(__isl_keep isl_local_space *ls) { return ls ? isl_space_is_set(ls->dim) : -1; } /* Return true if the two local spaces are identical, with identical * expressions for the integer divisions. */ int isl_local_space_is_equal(__isl_keep isl_local_space *ls1, __isl_keep isl_local_space *ls2) { int equal; if (!ls1 || !ls2) return -1; equal = isl_space_is_equal(ls1->dim, ls2->dim); if (equal < 0 || !equal) return equal; if (!isl_local_space_divs_known(ls1)) return 0; if (!isl_local_space_divs_known(ls2)) return 0; return isl_mat_is_equal(ls1->div, ls2->div); } int isl_local_space_dim(__isl_keep isl_local_space *ls, enum isl_dim_type type) { if (!ls) return 0; if (type == isl_dim_div) return ls->div->n_row; if (type == isl_dim_all) return isl_space_dim(ls->dim, isl_dim_all) + ls->div->n_row; return isl_space_dim(ls->dim, type); } unsigned isl_local_space_offset(__isl_keep isl_local_space *ls, enum isl_dim_type type) { isl_space *dim; if (!ls) return 0; dim = ls->dim; switch (type) { case isl_dim_cst: return 0; case isl_dim_param: return 1; case isl_dim_in: return 1 + dim->nparam; case isl_dim_out: return 1 + dim->nparam + dim->n_in; case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out; default: return 0; } } /* Does the given dimension have a name? */ int isl_local_space_has_dim_name(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos) { return ls ? isl_space_has_dim_name(ls->dim, type, pos) : -1; } const char *isl_local_space_get_dim_name(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos) { return ls ? isl_space_get_dim_name(ls->dim, type, pos) : NULL; } int isl_local_space_has_dim_id(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos) { return ls ? isl_space_has_dim_id(ls->dim, type, pos) : -1; } __isl_give isl_id *isl_local_space_get_dim_id(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos) { return ls ? isl_space_get_dim_id(ls->dim, type, pos) : NULL; } __isl_give isl_aff *isl_local_space_get_div(__isl_keep isl_local_space *ls, int pos) { isl_aff *aff; if (!ls) return NULL; if (pos < 0 || pos >= ls->div->n_row) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "index out of bounds", return NULL); if (isl_int_is_zero(ls->div->row[pos][0])) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "expression of div unknown", return NULL); if (!isl_local_space_is_set(ls)) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "cannot represent divs of map spaces", return NULL); aff = isl_aff_alloc(isl_local_space_copy(ls)); if (!aff) return NULL; isl_seq_cpy(aff->v->el, ls->div->row[pos], aff->v->size); return aff; } __isl_give isl_space *isl_local_space_get_space(__isl_keep isl_local_space *ls) { if (!ls) return NULL; return isl_space_copy(ls->dim); } __isl_give isl_local_space *isl_local_space_set_dim_name( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, const char *s) { ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_set_dim_name(ls->dim, type, pos, s); if (!ls->dim) return isl_local_space_free(ls); return ls; } __isl_give isl_local_space *isl_local_space_set_dim_id( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { ls = isl_local_space_cow(ls); if (!ls) return isl_id_free(id); ls->dim = isl_space_set_dim_id(ls->dim, type, pos, id); if (!ls->dim) return isl_local_space_free(ls); return ls; } __isl_give isl_local_space *isl_local_space_reset_space( __isl_take isl_local_space *ls, __isl_take isl_space *dim) { ls = isl_local_space_cow(ls); if (!ls || !dim) goto error; isl_space_free(ls->dim); ls->dim = dim; return ls; error: isl_local_space_free(ls); isl_space_free(dim); return NULL; } /* Reorder the columns of the given div definitions according to the * given reordering. * The order of the divs themselves is assumed not to change. */ static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div, __isl_take isl_reordering *r) { int i, j; isl_mat *mat; int extra; if (!div || !r) goto error; extra = isl_space_dim(r->dim, isl_dim_all) + div->n_row - r->len; mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra); if (!mat) goto error; for (i = 0; i < div->n_row; ++i) { isl_seq_cpy(mat->row[i], div->row[i], 2); isl_seq_clr(mat->row[i] + 2, mat->n_col - 2); for (j = 0; j < r->len; ++j) isl_int_set(mat->row[i][2 + r->pos[j]], div->row[i][2 + j]); } isl_reordering_free(r); isl_mat_free(div); return mat; error: isl_reordering_free(r); isl_mat_free(div); return NULL; } /* Reorder the dimensions of "ls" according to the given reordering. * The reordering r is assumed to have been extended with the local * variables, leaving them in the same order. */ __isl_give isl_local_space *isl_local_space_realign( __isl_take isl_local_space *ls, __isl_take isl_reordering *r) { ls = isl_local_space_cow(ls); if (!ls || !r) goto error; ls->div = reorder_divs(ls->div, isl_reordering_copy(r)); if (!ls->div) goto error; ls = isl_local_space_reset_space(ls, isl_space_copy(r->dim)); isl_reordering_free(r); return ls; error: isl_local_space_free(ls); isl_reordering_free(r); return NULL; } __isl_give isl_local_space *isl_local_space_add_div( __isl_take isl_local_space *ls, __isl_take isl_vec *div) { ls = isl_local_space_cow(ls); if (!ls || !div) goto error; if (ls->div->n_col != div->size) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "incompatible dimensions", goto error); ls->div = isl_mat_add_zero_cols(ls->div, 1); ls->div = isl_mat_add_rows(ls->div, 1); if (!ls->div) goto error; isl_seq_cpy(ls->div->row[ls->div->n_row - 1], div->el, div->size); isl_int_set_si(ls->div->row[ls->div->n_row - 1][div->size], 0); isl_vec_free(div); return ls; error: isl_local_space_free(ls); isl_vec_free(div); return NULL; } __isl_give isl_local_space *isl_local_space_replace_divs( __isl_take isl_local_space *ls, __isl_take isl_mat *div) { ls = isl_local_space_cow(ls); if (!ls || !div) goto error; isl_mat_free(ls->div); ls->div = div; return ls; error: isl_mat_free(div); isl_local_space_free(ls); return NULL; } /* Copy row "s" of "src" to row "d" of "dst", applying the expansion * defined by "exp". */ static void expand_row(__isl_keep isl_mat *dst, int d, __isl_keep isl_mat *src, int s, int *exp) { int i; unsigned c = src->n_col - src->n_row; isl_seq_cpy(dst->row[d], src->row[s], c); isl_seq_clr(dst->row[d] + c, dst->n_col - c); for (i = 0; i < s; ++i) isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]); } /* Compare (known) divs. * Return non-zero if at least one of the two divs is unknown. * In particular, if both divs are unknown, we respect their * current order. Otherwise, we sort the known div after the unknown * div only if the known div depends on the unknown div. */ static int cmp_row(isl_int *row_i, isl_int *row_j, int i, int j, unsigned n_row, unsigned n_col) { int li, lj; int unknown_i, unknown_j; unknown_i = isl_int_is_zero(row_i[0]); unknown_j = isl_int_is_zero(row_j[0]); if (unknown_i && unknown_j) return i - j; if (unknown_i) li = n_col - n_row + i; else li = isl_seq_last_non_zero(row_i, n_col); if (unknown_j) lj = n_col - n_row + j; else lj = isl_seq_last_non_zero(row_j, n_col); if (li != lj) return li - lj; return isl_seq_cmp(row_i, row_j, n_col); } /* Call cmp_row for divs in a matrix. */ int isl_mat_cmp_div(__isl_keep isl_mat *div, int i, int j) { return cmp_row(div->row[i], div->row[j], i, j, div->n_row, div->n_col); } /* Call cmp_row for divs in a basic map. */ static int bmap_cmp_row(__isl_keep isl_basic_map *bmap, int i, int j, unsigned total) { return cmp_row(bmap->div[i], bmap->div[j], i, j, bmap->n_div, total); } /* Sort the divs in "bmap". * * We first make sure divs are placed after divs on which they depend. * Then we perform a simple insertion sort based on the same ordering * that is used in isl_merge_divs. */ __isl_give isl_basic_map *isl_basic_map_sort_divs( __isl_take isl_basic_map *bmap) { int i, j; unsigned total; bmap = isl_basic_map_order_divs(bmap); if (!bmap) return NULL; if (bmap->n_div <= 1) return bmap; total = 2 + isl_basic_map_total_dim(bmap); for (i = 1; i < bmap->n_div; ++i) { for (j = i - 1; j >= 0; --j) { if (bmap_cmp_row(bmap, j, j + 1, total) <= 0) break; isl_basic_map_swap_div(bmap, j, j + 1); } } return bmap; } /* Sort the divs in the basic maps of "map". */ __isl_give isl_map *isl_map_sort_divs(__isl_take isl_map *map) { return isl_map_inline_foreach_basic_map(map, &isl_basic_map_sort_divs); } /* Combine the two lists of divs into a single list. * For each row i in div1, exp1[i] is set to the position of the corresponding * row in the result. Similarly for div2 and exp2. * This function guarantees * exp1[i] >= i * exp1[i+1] > exp1[i] * For optimal merging, the two input list should have been sorted. */ __isl_give isl_mat *isl_merge_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2, int *exp1, int *exp2) { int i, j, k; isl_mat *div = NULL; unsigned d; if (!div1 || !div2) return NULL; d = div1->n_col - div1->n_row; div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row, d + div1->n_row + div2->n_row); if (!div) return NULL; for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) { int cmp; expand_row(div, k, div1, i, exp1); expand_row(div, k + 1, div2, j, exp2); cmp = isl_mat_cmp_div(div, k, k + 1); if (cmp == 0) { exp1[i++] = k; exp2[j++] = k; } else if (cmp < 0) { exp1[i++] = k; } else { exp2[j++] = k; isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col); } } for (; i < div1->n_row; ++i, ++k) { expand_row(div, k, div1, i, exp1); exp1[i] = k; } for (; j < div2->n_row; ++j, ++k) { expand_row(div, k, div2, j, exp2); exp2[j] = k; } div->n_row = k; div->n_col = d + k; return div; } /* Swap divs "a" and "b" in "ls". */ __isl_give isl_local_space *isl_local_space_swap_div( __isl_take isl_local_space *ls, int a, int b) { int offset; ls = isl_local_space_cow(ls); if (!ls) return NULL; if (a < 0 || a >= ls->div->n_row || b < 0 || b >= ls->div->n_row) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "index out of bounds", return isl_local_space_free(ls)); offset = ls->div->n_col - ls->div->n_row; ls->div = isl_mat_swap_cols(ls->div, offset + a, offset + b); ls->div = isl_mat_swap_rows(ls->div, a, b); if (!ls->div) return isl_local_space_free(ls); return ls; } /* Construct a local space that contains all the divs in either * "ls1" or "ls2". */ __isl_give isl_local_space *isl_local_space_intersect( __isl_take isl_local_space *ls1, __isl_take isl_local_space *ls2) { isl_ctx *ctx; int *exp1 = NULL; int *exp2 = NULL; isl_mat *div; if (!ls1 || !ls2) goto error; ctx = isl_local_space_get_ctx(ls1); if (!isl_space_is_equal(ls1->dim, ls2->dim)) isl_die(ctx, isl_error_invalid, "spaces should be identical", goto error); if (ls2->div->n_row == 0) { isl_local_space_free(ls2); return ls1; } if (ls1->div->n_row == 0) { isl_local_space_free(ls1); return ls2; } exp1 = isl_alloc_array(ctx, int, ls1->div->n_row); exp2 = isl_alloc_array(ctx, int, ls2->div->n_row); if (!exp1 || !exp2) goto error; div = isl_merge_divs(ls1->div, ls2->div, exp1, exp2); if (!div) goto error; free(exp1); free(exp2); isl_local_space_free(ls2); isl_mat_free(ls1->div); ls1->div = div; return ls1; error: free(exp1); free(exp2); isl_local_space_free(ls1); isl_local_space_free(ls2); return NULL; } int isl_local_space_divs_known(__isl_keep isl_local_space *ls) { int i; if (!ls) return -1; for (i = 0; i < ls->div->n_row; ++i) if (isl_int_is_zero(ls->div->row[i][0])) return 0; return 1; } __isl_give isl_local_space *isl_local_space_domain( __isl_take isl_local_space *ls) { ls = isl_local_space_drop_dims(ls, isl_dim_out, 0, isl_local_space_dim(ls, isl_dim_out)); ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_domain(ls->dim); if (!ls->dim) return isl_local_space_free(ls); return ls; } __isl_give isl_local_space *isl_local_space_range( __isl_take isl_local_space *ls) { ls = isl_local_space_drop_dims(ls, isl_dim_in, 0, isl_local_space_dim(ls, isl_dim_in)); ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_range(ls->dim); if (!ls->dim) return isl_local_space_free(ls); return ls; } /* Construct a local space for a map that has the given local * space as domain and that has a zero-dimensional range. */ __isl_give isl_local_space *isl_local_space_from_domain( __isl_take isl_local_space *ls) { ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_from_domain(ls->dim); if (!ls->dim) return isl_local_space_free(ls); return ls; } __isl_give isl_local_space *isl_local_space_add_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned n) { int pos; if (!ls) return NULL; pos = isl_local_space_dim(ls, type); return isl_local_space_insert_dims(ls, type, pos, n); } /* Remove common factor of non-constant terms and denominator. */ static void normalize_div(__isl_keep isl_local_space *ls, int div) { isl_ctx *ctx = ls->div->ctx; unsigned total = ls->div->n_col - 2; isl_seq_gcd(ls->div->row[div] + 2, total, &ctx->normalize_gcd); isl_int_gcd(ctx->normalize_gcd, ctx->normalize_gcd, ls->div->row[div][0]); if (isl_int_is_one(ctx->normalize_gcd)) return; isl_seq_scale_down(ls->div->row[div] + 2, ls->div->row[div] + 2, ctx->normalize_gcd, total); isl_int_divexact(ls->div->row[div][0], ls->div->row[div][0], ctx->normalize_gcd); isl_int_fdiv_q(ls->div->row[div][1], ls->div->row[div][1], ctx->normalize_gcd); } /* Exploit the equalities in "eq" to simplify the expressions of * the integer divisions in "ls". * The integer divisions in "ls" are assumed to appear as regular * dimensions in "eq". */ __isl_give isl_local_space *isl_local_space_substitute_equalities( __isl_take isl_local_space *ls, __isl_take isl_basic_set *eq) { int i, j, k; unsigned total; unsigned n_div; if (!ls || !eq) goto error; total = isl_space_dim(eq->dim, isl_dim_all); if (isl_local_space_dim(ls, isl_dim_all) != total) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "spaces don't match", goto error); total++; n_div = eq->n_div; for (i = 0; i < eq->n_eq; ++i) { j = isl_seq_last_non_zero(eq->eq[i], total + n_div); if (j < 0 || j == 0 || j >= total) continue; for (k = 0; k < ls->div->n_row; ++k) { if (isl_int_is_zero(ls->div->row[k][1 + j])) continue; ls = isl_local_space_cow(ls); if (!ls) goto error; ls->div = isl_mat_cow(ls->div); if (!ls->div) goto error; isl_seq_elim(ls->div->row[k] + 1, eq->eq[i], j, total, &ls->div->row[k][0]); normalize_div(ls, k); } } isl_basic_set_free(eq); return ls; error: isl_basic_set_free(eq); isl_local_space_free(ls); return NULL; } /* Plug in the affine expressions "subs" of length "subs_len" (including * the denominator and the constant term) into the variable at position "pos" * of the "n" div expressions starting at "first". * * Let i be the dimension to replace and let "subs" be of the form * * f/d * * Any integer division starting at "first" with a non-zero coefficient for i, * * floor((a i + g)/m) * * is replaced by * * floor((a f + d g)/(m d)) */ __isl_give isl_local_space *isl_local_space_substitute_seq( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, isl_int *subs, int subs_len, int first, int n) { int i; isl_int v; if (n == 0) return ls; ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->div = isl_mat_cow(ls->div); if (!ls->div) return isl_local_space_free(ls); if (first + n > ls->div->n_row) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "index out of bounds", return isl_local_space_free(ls)); pos += isl_local_space_offset(ls, type); isl_int_init(v); for (i = first; i < ls->div->n_row; ++i) { if (isl_int_is_zero(ls->div->row[i][1 + pos])) continue; isl_seq_substitute(ls->div->row[i], pos, subs, ls->div->n_col, subs_len, v); normalize_div(ls, i); } isl_int_clear(v); return ls; } /* Plug in "subs" for dimension "type", "pos" in the integer divisions * of "ls". * * Let i be the dimension to replace and let "subs" be of the form * * f/d * * Any integer division with a non-zero coefficient for i, * * floor((a i + g)/m) * * is replaced by * * floor((a f + d g)/(m d)) */ __isl_give isl_local_space *isl_local_space_substitute( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs) { ls = isl_local_space_cow(ls); if (!ls || !subs) return isl_local_space_free(ls); if (!isl_space_is_equal(ls->dim, subs->ls->dim)) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "spaces don't match", return isl_local_space_free(ls)); if (isl_local_space_dim(subs->ls, isl_dim_div) != 0) isl_die(isl_local_space_get_ctx(ls), isl_error_unsupported, "cannot handle divs yet", return isl_local_space_free(ls)); return isl_local_space_substitute_seq(ls, type, pos, subs->v->el, subs->v->size, 0, ls->div->n_row); } int isl_local_space_is_named_or_nested(__isl_keep isl_local_space *ls, enum isl_dim_type type) { if (!ls) return -1; return isl_space_is_named_or_nested(ls->dim, type); } __isl_give isl_local_space *isl_local_space_drop_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned first, unsigned n) { isl_ctx *ctx; if (!ls) return NULL; if (n == 0 && !isl_local_space_is_named_or_nested(ls, type)) return ls; ctx = isl_local_space_get_ctx(ls); if (first + n > isl_local_space_dim(ls, type)) isl_die(ctx, isl_error_invalid, "range out of bounds", return isl_local_space_free(ls)); ls = isl_local_space_cow(ls); if (!ls) return NULL; if (type == isl_dim_div) { ls->div = isl_mat_drop_rows(ls->div, first, n); } else { ls->dim = isl_space_drop_dims(ls->dim, type, first, n); if (!ls->dim) return isl_local_space_free(ls); } first += 1 + isl_local_space_offset(ls, type); ls->div = isl_mat_drop_cols(ls->div, first, n); if (!ls->div) return isl_local_space_free(ls); return ls; } __isl_give isl_local_space *isl_local_space_insert_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned first, unsigned n) { isl_ctx *ctx; if (!ls) return NULL; if (n == 0 && !isl_local_space_is_named_or_nested(ls, type)) return ls; ctx = isl_local_space_get_ctx(ls); if (first > isl_local_space_dim(ls, type)) isl_die(ctx, isl_error_invalid, "position out of bounds", return isl_local_space_free(ls)); ls = isl_local_space_cow(ls); if (!ls) return NULL; if (type == isl_dim_div) { ls->div = isl_mat_insert_zero_rows(ls->div, first, n); } else { ls->dim = isl_space_insert_dims(ls->dim, type, first, n); if (!ls->dim) return isl_local_space_free(ls); } first += 1 + isl_local_space_offset(ls, type); ls->div = isl_mat_insert_zero_cols(ls->div, first, n); if (!ls->div) return isl_local_space_free(ls); return ls; } /* Check if the constraints pointed to by "constraint" is a div * constraint corresponding to div "div" in "ls". * * That is, if div = floor(f/m), then check if the constraint is * * f - m d >= 0 * or * -(f-(m-1)) + m d >= 0 */ int isl_local_space_is_div_constraint(__isl_keep isl_local_space *ls, isl_int *constraint, unsigned div) { unsigned pos; if (!ls) return -1; if (isl_int_is_zero(ls->div->row[div][0])) return 0; pos = isl_local_space_offset(ls, isl_dim_div) + div; if (isl_int_eq(constraint[pos], ls->div->row[div][0])) { int neg; isl_int_sub(ls->div->row[div][1], ls->div->row[div][1], ls->div->row[div][0]); isl_int_add_ui(ls->div->row[div][1], ls->div->row[div][1], 1); neg = isl_seq_is_neg(constraint, ls->div->row[div]+1, pos); isl_int_sub_ui(ls->div->row[div][1], ls->div->row[div][1], 1); isl_int_add(ls->div->row[div][1], ls->div->row[div][1], ls->div->row[div][0]); if (!neg) return 0; if (isl_seq_first_non_zero(constraint+pos+1, ls->div->n_row-div-1) != -1) return 0; } else if (isl_int_abs_eq(constraint[pos], ls->div->row[div][0])) { if (!isl_seq_eq(constraint, ls->div->row[div]+1, pos)) return 0; if (isl_seq_first_non_zero(constraint+pos+1, ls->div->n_row-div-1) != -1) return 0; } else return 0; return 1; } /* * Set active[i] to 1 if the dimension at position i is involved * in the linear expression l. */ int *isl_local_space_get_active(__isl_keep isl_local_space *ls, isl_int *l) { int i, j; isl_ctx *ctx; int *active = NULL; unsigned total; unsigned offset; ctx = isl_local_space_get_ctx(ls); total = isl_local_space_dim(ls, isl_dim_all); active = isl_calloc_array(ctx, int, total); if (total && !active) return NULL; for (i = 0; i < total; ++i) active[i] = !isl_int_is_zero(l[i]); offset = isl_local_space_offset(ls, isl_dim_div) - 1; for (i = ls->div->n_row - 1; i >= 0; --i) { if (!active[offset + i]) continue; for (j = 0; j < total; ++j) active[j] |= !isl_int_is_zero(ls->div->row[i][2 + j]); } return active; } /* Given a local space "ls" of a set, create a local space * for the lift of the set. In particular, the result * is of the form [dim -> local[..]], with ls->div->n_row variables in the * range of the wrapped map. */ __isl_give isl_local_space *isl_local_space_lift( __isl_take isl_local_space *ls) { ls = isl_local_space_cow(ls); if (!ls) return NULL; ls->dim = isl_space_lift(ls->dim, ls->div->n_row); ls->div = isl_mat_drop_rows(ls->div, 0, ls->div->n_row); if (!ls->dim || !ls->div) return isl_local_space_free(ls); return ls; } /* Construct a basic map that maps a set living in local space "ls" * to the corresponding lifted local space. */ __isl_give isl_basic_map *isl_local_space_lifting( __isl_take isl_local_space *ls) { isl_basic_map *lifting; isl_basic_set *bset; if (!ls) return NULL; if (!isl_local_space_is_set(ls)) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "lifting only defined on set spaces", return isl_local_space_free(ls)); bset = isl_basic_set_from_local_space(ls); lifting = isl_basic_set_unwrap(isl_basic_set_lift(bset)); lifting = isl_basic_map_domain_map(lifting); lifting = isl_basic_map_reverse(lifting); return lifting; } /* Compute the preimage of "ls" under the function represented by "ma". * In other words, plug in "ma" in "ls". The result is a local space * that is part of the domain space of "ma". * * If the divs in "ls" are represented as * * floor((a_i(p) + b_i x + c_i(divs))/n_i) * * and ma is represented by * * x = D(p) + F(y) + G(divs') * * then the resulting divs are * * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i) * * We first copy over the divs from "ma" and then * we add the modified divs from "ls". */ __isl_give isl_local_space *isl_local_space_preimage_multi_aff( __isl_take isl_local_space *ls, __isl_take isl_multi_aff *ma) { int i; isl_space *space; isl_local_space *res = NULL; int n_div_ls, n_div_ma; isl_int f, c1, c2, g; ma = isl_multi_aff_align_divs(ma); if (!ls || !ma) goto error; if (!isl_space_is_range_internal(ls->dim, ma->space)) isl_die(isl_local_space_get_ctx(ls), isl_error_invalid, "spaces don't match", goto error); n_div_ls = isl_local_space_dim(ls, isl_dim_div); n_div_ma = ma->n ? isl_aff_dim(ma->p[0], isl_dim_div) : 0; space = isl_space_domain(isl_multi_aff_get_space(ma)); res = isl_local_space_alloc(space, n_div_ma + n_div_ls); if (!res) goto error; if (n_div_ma) { isl_mat_free(res->div); res->div = isl_mat_copy(ma->p[0]->ls->div); res->div = isl_mat_add_zero_cols(res->div, n_div_ls); res->div = isl_mat_add_rows(res->div, n_div_ls); if (!res->div) goto error; } isl_int_init(f); isl_int_init(c1); isl_int_init(c2); isl_int_init(g); for (i = 0; i < ls->div->n_row; ++i) { if (isl_int_is_zero(ls->div->row[i][0])) { isl_int_set_si(res->div->row[n_div_ma + i][0], 0); continue; } isl_seq_preimage(res->div->row[n_div_ma + i], ls->div->row[i], ma, 0, 0, n_div_ma, n_div_ls, f, c1, c2, g, 1); normalize_div(res, n_div_ma + i); } isl_int_clear(f); isl_int_clear(c1); isl_int_clear(c2); isl_int_clear(g); isl_local_space_free(ls); isl_multi_aff_free(ma); return res; error: isl_local_space_free(ls); isl_multi_aff_free(ma); isl_local_space_free(res); return NULL; } cloog-0.18.2/isl/LICENSE0000664000175000017500000000202212254313240011414 00000000000000MIT License (MIT) Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. cloog-0.18.2/isl/isl_config.h.in0000664000175000017500000000712612254313260013315 00000000000000/* isl_config.h.in. Generated from configure.ac by autoheader. */ /* Define if HeaderSearchOptions::AddPath takes 4 arguments */ #undef ADDPATH_TAKES_4_ARGUMENTS /* Clang installation prefix */ #undef CLANG_PREFIX /* Define if CompilerInstance::createDiagnostics takes argc and argv */ #undef CREATEDIAGNOSTICS_TAKES_ARG /* Define if TargetInfo::CreateTargetInfo takes pointer */ #undef CREATETARGETINFO_TAKES_POINTER /* Define to Diagnostic for older versions of clang */ #undef DiagnosticsEngine /* most gcc compilers know a function __attribute__((__warn_unused_result__)) */ #undef GCC_WARN_UNUSED_RESULT /* result of mpz_gcdext needs to be normalized */ #undef GMP_NORMALIZE_GCDEXT /* Define if clang/Basic/DiagnosticOptions.h exists */ #undef HAVE_BASIC_DIAGNOSTICOPTIONS_H /* Define if Driver constructor takes CXXIsProduction argument */ #undef HAVE_CXXISPRODUCTION /* Define to 1 if you have the declaration of `mp_get_memory_functions', and to 0 if you don't. */ #undef HAVE_DECL_MP_GET_MEMORY_FUNCTIONS /* Define to 1 if you have the header file. */ #undef HAVE_DLFCN_H /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define if Driver constructor takes IsProduction argument */ #undef HAVE_ISPRODUCTION /* Define to 1 if you have the `gmp' library (-lgmp). */ #undef HAVE_LIBGMP /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* define if your compiler has __attribute__ */ #undef HAVE___ATTRIBUTE__ /* Return type of HandleTopLevelDeclReturn */ #undef HandleTopLevelDeclContinue /* Return type of HandleTopLevelDeclReturn */ #undef HandleTopLevelDeclReturn /* piplib is available */ #undef ISL_PIPLIB /* Define to the sub-directory where libtool stores uninstalled libraries. */ #undef LT_OBJDIR /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the home page for this package. */ #undef PACKAGE_URL /* Define to the version of this package. */ #undef PACKAGE_VERSION /* The size of `char', as computed by sizeof. */ #undef SIZEOF_CHAR /* The size of `int', as computed by sizeof. */ #undef SIZEOF_INT /* The size of `long', as computed by sizeof. */ #undef SIZEOF_LONG /* The size of `short', as computed by sizeof. */ #undef SIZEOF_SHORT /* The size of `void*', as computed by sizeof. */ #undef SIZEOF_VOIDP /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define if Driver::BuildCompilation takes ArrayRef */ #undef USE_ARRAYREF /* Version number of package */ #undef VERSION /* Define to getHostTriple for older versions of clang */ #undef getDefaultTargetTriple /* Define to getInstantiationLineNumber for older versions of clang */ #undef getExpansionLineNumber #include cloog-0.18.2/isl/isl_equalities.h0000664000175000017500000000152112254313240013577 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_EQUALITIES_H #define ISL_EQUALITIES_H #include #include #if defined(__cplusplus) extern "C" { #endif __isl_give isl_mat *isl_mat_variable_compression(__isl_take isl_mat *B, __isl_give isl_mat **T2); struct isl_mat *isl_mat_parameter_compression( struct isl_mat *B, struct isl_vec *d); __isl_give isl_mat *isl_mat_parameter_compression_ext(__isl_take isl_mat *B, __isl_take isl_mat *A); struct isl_basic_set *isl_basic_set_remove_equalities( struct isl_basic_set *bset, struct isl_mat **T, struct isl_mat **T2); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/isl_morph.c0000664000175000017500000005051112254313240012555 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #include #include #include #include #include __isl_give isl_morph *isl_morph_alloc( __isl_take isl_basic_set *dom, __isl_take isl_basic_set *ran, __isl_take isl_mat *map, __isl_take isl_mat *inv) { isl_morph *morph; if (!dom || !ran || !map || !inv) goto error; morph = isl_alloc_type(dom->ctx, struct isl_morph); if (!morph) goto error; morph->ref = 1; morph->dom = dom; morph->ran = ran; morph->map = map; morph->inv = inv; return morph; error: isl_basic_set_free(dom); isl_basic_set_free(ran); isl_mat_free(map); isl_mat_free(inv); return NULL; } __isl_give isl_morph *isl_morph_copy(__isl_keep isl_morph *morph) { if (!morph) return NULL; morph->ref++; return morph; } __isl_give isl_morph *isl_morph_dup(__isl_keep isl_morph *morph) { if (!morph) return NULL; return isl_morph_alloc(isl_basic_set_copy(morph->dom), isl_basic_set_copy(morph->ran), isl_mat_copy(morph->map), isl_mat_copy(morph->inv)); } __isl_give isl_morph *isl_morph_cow(__isl_take isl_morph *morph) { if (!morph) return NULL; if (morph->ref == 1) return morph; morph->ref--; return isl_morph_dup(morph); } void isl_morph_free(__isl_take isl_morph *morph) { if (!morph) return; if (--morph->ref > 0) return; isl_basic_set_free(morph->dom); isl_basic_set_free(morph->ran); isl_mat_free(morph->map); isl_mat_free(morph->inv); free(morph); } __isl_give isl_space *isl_morph_get_ran_space(__isl_keep isl_morph *morph) { if (!morph) return NULL; return isl_space_copy(morph->ran->dim); } unsigned isl_morph_dom_dim(__isl_keep isl_morph *morph, enum isl_dim_type type) { if (!morph) return 0; return isl_basic_set_dim(morph->dom, type); } unsigned isl_morph_ran_dim(__isl_keep isl_morph *morph, enum isl_dim_type type) { if (!morph) return 0; return isl_basic_set_dim(morph->ran, type); } __isl_give isl_morph *isl_morph_remove_dom_dims(__isl_take isl_morph *morph, enum isl_dim_type type, unsigned first, unsigned n) { unsigned dom_offset; if (n == 0) return morph; morph = isl_morph_cow(morph); if (!morph) return NULL; dom_offset = 1 + isl_space_offset(morph->dom->dim, type); morph->dom = isl_basic_set_remove_dims(morph->dom, type, first, n); morph->map = isl_mat_drop_cols(morph->map, dom_offset + first, n); morph->inv = isl_mat_drop_rows(morph->inv, dom_offset + first, n); if (morph->dom && morph->ran && morph->map && morph->inv) return morph; isl_morph_free(morph); return NULL; } __isl_give isl_morph *isl_morph_remove_ran_dims(__isl_take isl_morph *morph, enum isl_dim_type type, unsigned first, unsigned n) { unsigned ran_offset; if (n == 0) return morph; morph = isl_morph_cow(morph); if (!morph) return NULL; ran_offset = 1 + isl_space_offset(morph->ran->dim, type); morph->ran = isl_basic_set_remove_dims(morph->ran, type, first, n); morph->map = isl_mat_drop_rows(morph->map, ran_offset + first, n); morph->inv = isl_mat_drop_cols(morph->inv, ran_offset + first, n); if (morph->dom && morph->ran && morph->map && morph->inv) return morph; isl_morph_free(morph); return NULL; } /* Project domain of morph onto its parameter domain. */ __isl_give isl_morph *isl_morph_dom_params(__isl_take isl_morph *morph) { unsigned n; morph = isl_morph_cow(morph); if (!morph) return NULL; n = isl_basic_set_dim(morph->dom, isl_dim_set); morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, n); if (!morph) return NULL; morph->dom = isl_basic_set_params(morph->dom); if (morph->dom) return morph; isl_morph_free(morph); return NULL; } /* Project range of morph onto its parameter domain. */ __isl_give isl_morph *isl_morph_ran_params(__isl_take isl_morph *morph) { unsigned n; morph = isl_morph_cow(morph); if (!morph) return NULL; n = isl_basic_set_dim(morph->ran, isl_dim_set); morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, n); if (!morph) return NULL; morph->ran = isl_basic_set_params(morph->ran); if (morph->ran) return morph; isl_morph_free(morph); return NULL; } void isl_morph_print_internal(__isl_take isl_morph *morph, FILE *out) { if (!morph) return; isl_basic_set_print(morph->dom, out, 0, "", "", ISL_FORMAT_ISL); isl_basic_set_print(morph->ran, out, 0, "", "", ISL_FORMAT_ISL); isl_mat_print_internal(morph->map, out, 4); isl_mat_print_internal(morph->inv, out, 4); } void isl_morph_dump(__isl_take isl_morph *morph) { isl_morph_print_internal(morph, stderr); } __isl_give isl_morph *isl_morph_identity(__isl_keep isl_basic_set *bset) { isl_mat *id; isl_basic_set *universe; unsigned total; if (!bset) return NULL; total = isl_basic_set_total_dim(bset); id = isl_mat_identity(bset->ctx, 1 + total); universe = isl_basic_set_universe(isl_space_copy(bset->dim)); return isl_morph_alloc(universe, isl_basic_set_copy(universe), id, isl_mat_copy(id)); } /* Create a(n identity) morphism between empty sets of the same dimension * a "bset". */ __isl_give isl_morph *isl_morph_empty(__isl_keep isl_basic_set *bset) { isl_mat *id; isl_basic_set *empty; unsigned total; if (!bset) return NULL; total = isl_basic_set_total_dim(bset); id = isl_mat_identity(bset->ctx, 1 + total); empty = isl_basic_set_empty(isl_space_copy(bset->dim)); return isl_morph_alloc(empty, isl_basic_set_copy(empty), id, isl_mat_copy(id)); } /* Given a matrix that maps a (possibly) parametric domain to * a parametric domain, add in rows that map the "nparam" parameters onto * themselves. */ static __isl_give isl_mat *insert_parameter_rows(__isl_take isl_mat *mat, unsigned nparam) { int i; if (nparam == 0) return mat; if (!mat) return NULL; mat = isl_mat_insert_rows(mat, 1, nparam); if (!mat) return NULL; for (i = 0; i < nparam; ++i) { isl_seq_clr(mat->row[1 + i], mat->n_col); isl_int_set(mat->row[1 + i][1 + i], mat->row[0][0]); } return mat; } /* Construct a basic set described by the "n" equalities of "bset" starting * at "first". */ static __isl_give isl_basic_set *copy_equalities(__isl_keep isl_basic_set *bset, unsigned first, unsigned n) { int i, k; isl_basic_set *eq; unsigned total; isl_assert(bset->ctx, bset->n_div == 0, return NULL); total = isl_basic_set_total_dim(bset); eq = isl_basic_set_alloc_space(isl_space_copy(bset->dim), 0, n, 0); if (!eq) return NULL; for (i = 0; i < n; ++i) { k = isl_basic_set_alloc_equality(eq); if (k < 0) goto error; isl_seq_cpy(eq->eq[k], bset->eq[first + k], 1 + total); } return eq; error: isl_basic_set_free(eq); return NULL; } /* Given a basic set, exploit the equalties in the basic set to construct * a morphishm that maps the basic set to a lower-dimensional space. * Specifically, the morphism reduces the number of dimensions of type "type". * * This function is a slight generalization of isl_mat_variable_compression * in that it allows the input to be parametric and that it allows for the * compression of either parameters or set variables. * * We first select the equalities of interest, that is those that involve * variables of type "type" and no later variables. * Denote those equalities as * * -C(p) + M x = 0 * * where C(p) depends on the parameters if type == isl_dim_set and * is a constant if type == isl_dim_param. * * First compute the (left) Hermite normal form of M, * * M [U1 U2] = M U = H = [H1 0] * or * M = H Q = [H1 0] [Q1] * [Q2] * * with U, Q unimodular, Q = U^{-1} (and H lower triangular). * Define the transformed variables as * * x = [U1 U2] [ x1' ] = [U1 U2] [Q1] x * [ x2' ] [Q2] * * The equalities then become * * -C(p) + H1 x1' = 0 or x1' = H1^{-1} C(p) = C'(p) * * If the denominator of the constant term does not divide the * the common denominator of the parametric terms, then every * integer point is mapped to a non-integer point and then the original set has no * integer solutions (since the x' are a unimodular transformation * of the x). In this case, an empty morphism is returned. * Otherwise, the transformation is given by * * x = U1 H1^{-1} C(p) + U2 x2' * * The inverse transformation is simply * * x2' = Q2 x * * Both matrices are extended to map the full original space to the full * compressed space. */ __isl_give isl_morph *isl_basic_set_variable_compression( __isl_keep isl_basic_set *bset, enum isl_dim_type type) { unsigned otype; unsigned ntype; unsigned orest; unsigned nrest; int f_eq, n_eq; isl_space *dim; isl_mat *H, *U, *Q, *C = NULL, *H1, *U1, *U2; isl_basic_set *dom, *ran; if (!bset) return NULL; if (isl_basic_set_plain_is_empty(bset)) return isl_morph_empty(bset); isl_assert(bset->ctx, bset->n_div == 0, return NULL); otype = 1 + isl_space_offset(bset->dim, type); ntype = isl_basic_set_dim(bset, type); orest = otype + ntype; nrest = isl_basic_set_total_dim(bset) - (orest - 1); for (f_eq = 0; f_eq < bset->n_eq; ++f_eq) if (isl_seq_first_non_zero(bset->eq[f_eq] + orest, nrest) == -1) break; for (n_eq = 0; f_eq + n_eq < bset->n_eq; ++n_eq) if (isl_seq_first_non_zero(bset->eq[f_eq + n_eq] + otype, ntype) == -1) break; if (n_eq == 0) return isl_morph_identity(bset); H = isl_mat_sub_alloc6(bset->ctx, bset->eq, f_eq, n_eq, otype, ntype); H = isl_mat_left_hermite(H, 0, &U, &Q); if (!H || !U || !Q) goto error; Q = isl_mat_drop_rows(Q, 0, n_eq); Q = isl_mat_diagonal(isl_mat_identity(bset->ctx, otype), Q); Q = isl_mat_diagonal(Q, isl_mat_identity(bset->ctx, nrest)); C = isl_mat_alloc(bset->ctx, 1 + n_eq, otype); if (!C) goto error; isl_int_set_si(C->row[0][0], 1); isl_seq_clr(C->row[0] + 1, otype - 1); isl_mat_sub_neg(C->ctx, C->row + 1, bset->eq + f_eq, n_eq, 0, 0, otype); H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row); H1 = isl_mat_lin_to_aff(H1); C = isl_mat_inverse_product(H1, C); if (!C) goto error; isl_mat_free(H); if (!isl_int_is_one(C->row[0][0])) { int i; isl_int g; isl_int_init(g); for (i = 0; i < n_eq; ++i) { isl_seq_gcd(C->row[1 + i] + 1, otype - 1, &g); isl_int_gcd(g, g, C->row[0][0]); if (!isl_int_is_divisible_by(C->row[1 + i][0], g)) break; } isl_int_clear(g); if (i < n_eq) { isl_mat_free(C); isl_mat_free(U); isl_mat_free(Q); return isl_morph_empty(bset); } C = isl_mat_normalize(C); } U1 = isl_mat_sub_alloc(U, 0, U->n_row, 0, n_eq); U1 = isl_mat_lin_to_aff(U1); U2 = isl_mat_sub_alloc(U, 0, U->n_row, n_eq, U->n_row - n_eq); U2 = isl_mat_lin_to_aff(U2); isl_mat_free(U); C = isl_mat_product(U1, C); C = isl_mat_aff_direct_sum(C, U2); C = insert_parameter_rows(C, otype - 1); C = isl_mat_diagonal(C, isl_mat_identity(bset->ctx, nrest)); dim = isl_space_copy(bset->dim); dim = isl_space_drop_dims(dim, type, 0, ntype); dim = isl_space_add_dims(dim, type, ntype - n_eq); ran = isl_basic_set_universe(dim); dom = copy_equalities(bset, f_eq, n_eq); return isl_morph_alloc(dom, ran, Q, C); error: isl_mat_free(C); isl_mat_free(H); isl_mat_free(U); isl_mat_free(Q); return NULL; } /* Construct a parameter compression for "bset". * We basically just call isl_mat_parameter_compression with the right input * and then extend the resulting matrix to include the variables. * * The implementation assumes that "bset" does not have any equalities * that only involve the parameters and that isl_basic_set_gauss has * been applied to "bset". * * Let the equalities be given as * * B(p) + A x = 0. * * We use isl_mat_parameter_compression_ext to compute the compression * * p = T p'. */ __isl_give isl_morph *isl_basic_set_parameter_compression( __isl_keep isl_basic_set *bset) { unsigned nparam; unsigned nvar; unsigned n_div; int n_eq; isl_mat *H, *B; isl_mat *map, *inv; isl_basic_set *dom, *ran; if (!bset) return NULL; if (isl_basic_set_plain_is_empty(bset)) return isl_morph_empty(bset); if (bset->n_eq == 0) return isl_morph_identity(bset); n_eq = bset->n_eq; nparam = isl_basic_set_dim(bset, isl_dim_param); nvar = isl_basic_set_dim(bset, isl_dim_set); n_div = isl_basic_set_dim(bset, isl_dim_div); if (isl_seq_first_non_zero(bset->eq[bset->n_eq - 1] + 1 + nparam, nvar + n_div) == -1) isl_die(isl_basic_set_get_ctx(bset), isl_error_invalid, "input not allowed to have parameter equalities", return NULL); if (n_eq > nvar + n_div) isl_die(isl_basic_set_get_ctx(bset), isl_error_invalid, "input not gaussed", return NULL); B = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, n_eq, 0, 1 + nparam); H = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, n_eq, 1 + nparam, nvar + n_div); inv = isl_mat_parameter_compression_ext(B, H); inv = isl_mat_diagonal(inv, isl_mat_identity(bset->ctx, nvar)); map = isl_mat_right_inverse(isl_mat_copy(inv)); dom = isl_basic_set_universe(isl_space_copy(bset->dim)); ran = isl_basic_set_universe(isl_space_copy(bset->dim)); return isl_morph_alloc(dom, ran, map, inv); } /* Add stride constraints to "bset" based on the inverse mapping * that was plugged in. In particular, if morph maps x' to x, * the the constraints of the original input * * A x' + b >= 0 * * have been rewritten to * * A inv x + b >= 0 * * However, this substitution may loose information on the integrality of x', * so we need to impose that * * inv x * * is integral. If inv = B/d, this means that we need to impose that * * B x = 0 mod d * * or * * exists alpha in Z^m: B x = d alpha * * This function is similar to add_strides in isl_affine_hull.c */ static __isl_give isl_basic_set *add_strides(__isl_take isl_basic_set *bset, __isl_keep isl_morph *morph) { int i, div, k; isl_int gcd; if (isl_int_is_one(morph->inv->row[0][0])) return bset; isl_int_init(gcd); for (i = 0; 1 + i < morph->inv->n_row; ++i) { isl_seq_gcd(morph->inv->row[1 + i], morph->inv->n_col, &gcd); if (isl_int_is_divisible_by(gcd, morph->inv->row[0][0])) continue; div = isl_basic_set_alloc_div(bset); if (div < 0) goto error; isl_int_set_si(bset->div[div][0], 0); k = isl_basic_set_alloc_equality(bset); if (k < 0) goto error; isl_seq_cpy(bset->eq[k], morph->inv->row[1 + i], morph->inv->n_col); isl_seq_clr(bset->eq[k] + morph->inv->n_col, bset->n_div); isl_int_set(bset->eq[k][morph->inv->n_col + div], morph->inv->row[0][0]); } isl_int_clear(gcd); return bset; error: isl_int_clear(gcd); isl_basic_set_free(bset); return NULL; } /* Apply the morphism to the basic set. * We basically just compute the preimage of "bset" under the inverse mapping * in morph, add in stride constraints and intersect with the range * of the morphism. */ __isl_give isl_basic_set *isl_morph_basic_set(__isl_take isl_morph *morph, __isl_take isl_basic_set *bset) { isl_basic_set *res = NULL; isl_mat *mat = NULL; int i, k; int max_stride; if (!morph || !bset) goto error; isl_assert(bset->ctx, isl_space_is_equal(bset->dim, morph->dom->dim), goto error); max_stride = morph->inv->n_row - 1; if (isl_int_is_one(morph->inv->row[0][0])) max_stride = 0; res = isl_basic_set_alloc_space(isl_space_copy(morph->ran->dim), bset->n_div + max_stride, bset->n_eq + max_stride, bset->n_ineq); for (i = 0; i < bset->n_div; ++i) if (isl_basic_set_alloc_div(res) < 0) goto error; mat = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 0, morph->inv->n_row); mat = isl_mat_product(mat, isl_mat_copy(morph->inv)); if (!mat) goto error; for (i = 0; i < bset->n_eq; ++i) { k = isl_basic_set_alloc_equality(res); if (k < 0) goto error; isl_seq_cpy(res->eq[k], mat->row[i], mat->n_col); isl_seq_scale(res->eq[k] + mat->n_col, bset->eq[i] + mat->n_col, morph->inv->row[0][0], bset->n_div); } isl_mat_free(mat); mat = isl_mat_sub_alloc6(bset->ctx, bset->ineq, 0, bset->n_ineq, 0, morph->inv->n_row); mat = isl_mat_product(mat, isl_mat_copy(morph->inv)); if (!mat) goto error; for (i = 0; i < bset->n_ineq; ++i) { k = isl_basic_set_alloc_inequality(res); if (k < 0) goto error; isl_seq_cpy(res->ineq[k], mat->row[i], mat->n_col); isl_seq_scale(res->ineq[k] + mat->n_col, bset->ineq[i] + mat->n_col, morph->inv->row[0][0], bset->n_div); } isl_mat_free(mat); mat = isl_mat_sub_alloc6(bset->ctx, bset->div, 0, bset->n_div, 1, morph->inv->n_row); mat = isl_mat_product(mat, isl_mat_copy(morph->inv)); if (!mat) goto error; for (i = 0; i < bset->n_div; ++i) { isl_int_mul(res->div[i][0], morph->inv->row[0][0], bset->div[i][0]); isl_seq_cpy(res->div[i] + 1, mat->row[i], mat->n_col); isl_seq_scale(res->div[i] + 1 + mat->n_col, bset->div[i] + 1 + mat->n_col, morph->inv->row[0][0], bset->n_div); } isl_mat_free(mat); res = add_strides(res, morph); if (isl_basic_set_is_rational(bset)) res = isl_basic_set_set_rational(res); res = isl_basic_set_simplify(res); res = isl_basic_set_finalize(res); res = isl_basic_set_intersect(res, isl_basic_set_copy(morph->ran)); isl_morph_free(morph); isl_basic_set_free(bset); return res; error: isl_mat_free(mat); isl_morph_free(morph); isl_basic_set_free(bset); isl_basic_set_free(res); return NULL; } /* Apply the morphism to the set. */ __isl_give isl_set *isl_morph_set(__isl_take isl_morph *morph, __isl_take isl_set *set) { int i; if (!morph || !set) goto error; isl_assert(set->ctx, isl_space_is_equal(set->dim, morph->dom->dim), goto error); set = isl_set_cow(set); if (!set) goto error; isl_space_free(set->dim); set->dim = isl_space_copy(morph->ran->dim); if (!set->dim) goto error; for (i = 0; i < set->n; ++i) { set->p[i] = isl_morph_basic_set(isl_morph_copy(morph), set->p[i]); if (!set->p[i]) goto error; } isl_morph_free(morph); ISL_F_CLR(set, ISL_SET_NORMALIZED); return set; error: isl_set_free(set); isl_morph_free(morph); return NULL; } /* Construct a morphism that first does morph2 and then morph1. */ __isl_give isl_morph *isl_morph_compose(__isl_take isl_morph *morph1, __isl_take isl_morph *morph2) { isl_mat *map, *inv; isl_basic_set *dom, *ran; if (!morph1 || !morph2) goto error; map = isl_mat_product(isl_mat_copy(morph1->map), isl_mat_copy(morph2->map)); inv = isl_mat_product(isl_mat_copy(morph2->inv), isl_mat_copy(morph1->inv)); dom = isl_morph_basic_set(isl_morph_inverse(isl_morph_copy(morph2)), isl_basic_set_copy(morph1->dom)); dom = isl_basic_set_intersect(dom, isl_basic_set_copy(morph2->dom)); ran = isl_morph_basic_set(isl_morph_copy(morph1), isl_basic_set_copy(morph2->ran)); ran = isl_basic_set_intersect(ran, isl_basic_set_copy(morph1->ran)); isl_morph_free(morph1); isl_morph_free(morph2); return isl_morph_alloc(dom, ran, map, inv); error: isl_morph_free(morph1); isl_morph_free(morph2); return NULL; } __isl_give isl_morph *isl_morph_inverse(__isl_take isl_morph *morph) { isl_basic_set *bset; isl_mat *mat; morph = isl_morph_cow(morph); if (!morph) return NULL; bset = morph->dom; morph->dom = morph->ran; morph->ran = bset; mat = morph->map; morph->map = morph->inv; morph->inv = mat; return morph; } /* We detect all the equalities first to avoid implicit equalties * being discovered during the computations. In particular, * the compression on the variables could expose additional stride * constraints on the parameters. This would result in existentially * quantified variables after applying the resulting morph, which * in turn could break invariants of the calling functions. */ __isl_give isl_morph *isl_basic_set_full_compression( __isl_keep isl_basic_set *bset) { isl_morph *morph, *morph2; bset = isl_basic_set_copy(bset); bset = isl_basic_set_detect_equalities(bset); morph = isl_basic_set_variable_compression(bset, isl_dim_param); bset = isl_morph_basic_set(isl_morph_copy(morph), bset); morph2 = isl_basic_set_parameter_compression(bset); bset = isl_morph_basic_set(isl_morph_copy(morph2), bset); morph = isl_morph_compose(morph2, morph); morph2 = isl_basic_set_variable_compression(bset, isl_dim_set); isl_basic_set_free(bset); morph = isl_morph_compose(morph2, morph); return morph; } __isl_give isl_vec *isl_morph_vec(__isl_take isl_morph *morph, __isl_take isl_vec *vec) { if (!morph) goto error; vec = isl_mat_vec_product(isl_mat_copy(morph->map), vec); isl_morph_free(morph); return vec; error: isl_morph_free(morph); isl_vec_free(vec); return NULL; } cloog-0.18.2/isl/isl_ast_codegen.c0000664000175000017500000034632512254313240013716 00000000000000/* * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include #include #include #include #include #include #include #include /* Add the constraint to the list that "user" points to, if it is not * a div constraint. */ static int collect_constraint(__isl_take isl_constraint *constraint, void *user) { isl_constraint_list **list = user; if (isl_constraint_is_div_constraint(constraint)) isl_constraint_free(constraint); else *list = isl_constraint_list_add(*list, constraint); return 0; } /* Extract the constraints of "bset" (except the div constraints) * and collect them in an isl_constraint_list. */ static __isl_give isl_constraint_list *isl_constraint_list_from_basic_set( __isl_take isl_basic_set *bset) { int n; isl_ctx *ctx; isl_constraint_list *list; if (!bset) return NULL; ctx = isl_basic_set_get_ctx(bset); n = isl_basic_set_n_constraint(bset); list = isl_constraint_list_alloc(ctx, n); if (isl_basic_set_foreach_constraint(bset, &collect_constraint, &list) < 0) list = isl_constraint_list_free(list); isl_basic_set_free(bset); return list; } /* Data used in generate_domain. * * "build" is the input build. * "list" collects the results. */ struct isl_generate_domain_data { isl_ast_build *build; isl_ast_graft_list *list; }; static __isl_give isl_ast_graft_list *generate_next_level( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build); static __isl_give isl_ast_graft_list *generate_code( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build, int internal); /* Generate an AST for a single domain based on * the (non single valued) inverse schedule "executed". * * We extend the schedule with the iteration domain * and continue generating through a call to generate_code. * * In particular, if executed has the form * * S -> D * * then we continue generating code on * * [S -> D] -> D * * The extended inverse schedule is clearly single valued * ensuring that the nested generate_code will not reach this function, * but will instead create calls to all elements of D that need * to be executed from the current schedule domain. */ static int generate_non_single_valued(__isl_take isl_map *executed, struct isl_generate_domain_data *data) { isl_map *identity; isl_ast_build *build; isl_ast_graft_list *list; build = isl_ast_build_copy(data->build); identity = isl_set_identity(isl_map_range(isl_map_copy(executed))); executed = isl_map_domain_product(executed, identity); build = isl_ast_build_set_single_valued(build, 1); list = generate_code(isl_union_map_from_map(executed), build, 1); data->list = isl_ast_graft_list_concat(data->list, list); return 0; } /* Call the at_each_domain callback, if requested by the user, * after recording the current inverse schedule in the build. */ static __isl_give isl_ast_graft *at_each_domain(__isl_take isl_ast_graft *graft, __isl_keep isl_map *executed, __isl_keep isl_ast_build *build) { if (!graft || !build) return isl_ast_graft_free(graft); if (!build->at_each_domain) return graft; build = isl_ast_build_copy(build); build = isl_ast_build_set_executed(build, isl_union_map_from_map(isl_map_copy(executed))); if (!build) return isl_ast_graft_free(graft); graft->node = build->at_each_domain(graft->node, build, build->at_each_domain_user); isl_ast_build_free(build); if (!graft->node) graft = isl_ast_graft_free(graft); return graft; } /* Generate an AST for a single domain based on * the inverse schedule "executed". * * If there is more than one domain element associated to the current * schedule "time", then we need to continue the generation process * in generate_non_single_valued. * Note that the inverse schedule being single-valued may depend * on constraints that are only available in the original context * domain specified by the user. We therefore first introduce * the constraints from data->build->domain. * On the other hand, we only perform the test after having taken the gist * of the domain as the resulting map is the one from which the call * expression is constructed. Using this map to construct the call * expression usually yields simpler results. * Because we perform the single-valuedness test on the gisted map, * we may in rare cases fail to recognize that the inverse schedule * is single-valued. This becomes problematic if this happens * from the recursive call through generate_non_single_valued * as we would then end up in an infinite recursion. * We therefore check if we are inside a call to generate_non_single_valued * and revert to the ungisted map if the gisted map turns out not to be * single-valued. * * Otherwise, we generate a call expression for the single executed * domain element and put a guard around it based on the (simplified) * domain of "executed". * * If the user has set an at_each_domain callback, it is called * on the constructed call expression node. */ static int generate_domain(__isl_take isl_map *executed, void *user) { struct isl_generate_domain_data *data = user; isl_ast_graft *graft; isl_ast_graft_list *list; isl_set *guard; isl_map *map; int sv; executed = isl_map_intersect_domain(executed, isl_set_copy(data->build->domain)); executed = isl_map_coalesce(executed); map = isl_map_copy(executed); map = isl_ast_build_compute_gist_map_domain(data->build, map); sv = isl_map_is_single_valued(map); if (sv < 0) goto error; if (!sv) { isl_map_free(map); if (data->build->single_valued) map = isl_map_copy(executed); else return generate_non_single_valued(executed, data); } guard = isl_map_domain(isl_map_copy(map)); guard = isl_set_coalesce(guard); guard = isl_ast_build_compute_gist(data->build, guard); graft = isl_ast_graft_alloc_domain(map, data->build); graft = at_each_domain(graft, executed, data->build); isl_map_free(executed); graft = isl_ast_graft_add_guard(graft, guard, data->build); list = isl_ast_graft_list_from_ast_graft(graft); data->list = isl_ast_graft_list_concat(data->list, list); return 0; error: isl_map_free(map); isl_map_free(executed); return -1; } /* Call build->create_leaf to a create "leaf" node in the AST, * encapsulate the result in an isl_ast_graft and return the result * as a 1-element list. * * Note that the node returned by the user may be an entire tree. * * Before we pass control to the user, we first clear some information * from the build that is (presumbably) only meaningful * for the current code generation. * This includes the create_leaf callback itself, so we make a copy * of the build first. */ static __isl_give isl_ast_graft_list *call_create_leaf( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { isl_ast_node *node; isl_ast_graft *graft; isl_ast_build *user_build; user_build = isl_ast_build_copy(build); user_build = isl_ast_build_set_executed(user_build, executed); user_build = isl_ast_build_clear_local_info(user_build); if (!user_build) node = NULL; else node = build->create_leaf(user_build, build->create_leaf_user); graft = isl_ast_graft_alloc(node, build); isl_ast_build_free(build); return isl_ast_graft_list_from_ast_graft(graft); } /* Generate an AST after having handled the complete schedule * of this call to the code generator. * * If the user has specified a create_leaf callback, control * is passed to the user in call_create_leaf. * * Otherwise, we generate one or more calls for each individual * domain in generate_domain. */ static __isl_give isl_ast_graft_list *generate_inner_level( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { isl_ctx *ctx; struct isl_generate_domain_data data = { build }; if (!build || !executed) goto error; if (build->create_leaf) return call_create_leaf(executed, build); ctx = isl_union_map_get_ctx(executed); data.list = isl_ast_graft_list_alloc(ctx, 0); if (isl_union_map_foreach_map(executed, &generate_domain, &data) < 0) data.list = isl_ast_graft_list_free(data.list); if (0) error: data.list = NULL; isl_ast_build_free(build); isl_union_map_free(executed); return data.list; } /* Call the before_each_for callback, if requested by the user. */ static __isl_give isl_ast_node *before_each_for(__isl_take isl_ast_node *node, __isl_keep isl_ast_build *build) { isl_id *id; if (!node || !build) return isl_ast_node_free(node); if (!build->before_each_for) return node; id = build->before_each_for(build, build->before_each_for_user); node = isl_ast_node_set_annotation(node, id); return node; } /* Call the after_each_for callback, if requested by the user. */ static __isl_give isl_ast_graft *after_each_for(__isl_keep isl_ast_graft *graft, __isl_keep isl_ast_build *build) { if (!graft || !build) return isl_ast_graft_free(graft); if (!build->after_each_for) return graft; graft->node = build->after_each_for(graft->node, build, build->after_each_for_user); if (!graft->node) return isl_ast_graft_free(graft); return graft; } /* Plug in all the know values of the current and outer dimensions * in the domain of "executed". In principle, we only need to plug * in the known value of the current dimension since the values of * outer dimensions have been plugged in already. * However, it turns out to be easier to just plug in all known values. */ static __isl_give isl_union_map *plug_in_values( __isl_take isl_union_map *executed, __isl_keep isl_ast_build *build) { return isl_ast_build_substitute_values_union_map_domain(build, executed); } /* Check if the constraint "c" is a lower bound on dimension "pos", * an upper bound, or independent of dimension "pos". */ static int constraint_type(isl_constraint *c, int pos) { if (isl_constraint_is_lower_bound(c, isl_dim_set, pos)) return 1; if (isl_constraint_is_upper_bound(c, isl_dim_set, pos)) return 2; return 0; } /* Compare the types of the constraints "a" and "b", * resulting in constraints that are independent of "depth" * to be sorted before the lower bounds on "depth", which in * turn are sorted before the upper bounds on "depth". */ static int cmp_constraint(__isl_keep isl_constraint *a, __isl_keep isl_constraint *b, void *user) { int *depth = user; int t1 = constraint_type(a, *depth); int t2 = constraint_type(b, *depth); return t1 - t2; } /* Extract a lower bound on dimension "pos" from constraint "c". * * If the constraint is of the form * * a x + f(...) >= 0 * * then we essentially return * * l = ceil(-f(...)/a) * * However, if the current dimension is strided, then we need to make * sure that the lower bound we construct is of the form * * f + s a * * with f the offset and s the stride. * We therefore compute * * f + s * ceil((l - f)/s) */ static __isl_give isl_aff *lower_bound(__isl_keep isl_constraint *c, int pos, __isl_keep isl_ast_build *build) { isl_aff *aff; aff = isl_constraint_get_bound(c, isl_dim_set, pos); aff = isl_aff_ceil(aff); if (isl_ast_build_has_stride(build, pos)) { isl_aff *offset; isl_val *stride; offset = isl_ast_build_get_offset(build, pos); stride = isl_ast_build_get_stride(build, pos); aff = isl_aff_sub(aff, isl_aff_copy(offset)); aff = isl_aff_scale_down_val(aff, isl_val_copy(stride)); aff = isl_aff_ceil(aff); aff = isl_aff_scale_val(aff, stride); aff = isl_aff_add(aff, offset); } aff = isl_ast_build_compute_gist_aff(build, aff); return aff; } /* Return the exact lower bound (or upper bound if "upper" is set) * of "domain" as a piecewise affine expression. * * If we are computing a lower bound (of a strided dimension), then * we need to make sure it is of the form * * f + s a * * where f is the offset and s is the stride. * We therefore need to include the stride constraint before computing * the minimum. */ static __isl_give isl_pw_aff *exact_bound(__isl_keep isl_set *domain, __isl_keep isl_ast_build *build, int upper) { isl_set *stride; isl_map *it_map; isl_pw_aff *pa; isl_pw_multi_aff *pma; domain = isl_set_copy(domain); if (!upper) { stride = isl_ast_build_get_stride_constraint(build); domain = isl_set_intersect(domain, stride); } it_map = isl_ast_build_map_to_iterator(build, domain); if (upper) pma = isl_map_lexmax_pw_multi_aff(it_map); else pma = isl_map_lexmin_pw_multi_aff(it_map); pa = isl_pw_multi_aff_get_pw_aff(pma, 0); isl_pw_multi_aff_free(pma); pa = isl_ast_build_compute_gist_pw_aff(build, pa); pa = isl_pw_aff_coalesce(pa); return pa; } /* Extract a lower bound on dimension "pos" from each constraint * in "constraints" and return the list of lower bounds. * If "constraints" has zero elements, then we extract a lower bound * from "domain" instead. */ static __isl_give isl_pw_aff_list *lower_bounds( __isl_keep isl_constraint_list *constraints, int pos, __isl_keep isl_set *domain, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_pw_aff_list *list; int i, n; if (!build) return NULL; n = isl_constraint_list_n_constraint(constraints); if (n == 0) { isl_pw_aff *pa; pa = exact_bound(domain, build, 0); return isl_pw_aff_list_from_pw_aff(pa); } ctx = isl_ast_build_get_ctx(build); list = isl_pw_aff_list_alloc(ctx,n); for (i = 0; i < n; ++i) { isl_aff *aff; isl_constraint *c; c = isl_constraint_list_get_constraint(constraints, i); aff = lower_bound(c, pos, build); isl_constraint_free(c); list = isl_pw_aff_list_add(list, isl_pw_aff_from_aff(aff)); } return list; } /* Extract an upper bound on dimension "pos" from each constraint * in "constraints" and return the list of upper bounds. * If "constraints" has zero elements, then we extract an upper bound * from "domain" instead. */ static __isl_give isl_pw_aff_list *upper_bounds( __isl_keep isl_constraint_list *constraints, int pos, __isl_keep isl_set *domain, __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_pw_aff_list *list; int i, n; n = isl_constraint_list_n_constraint(constraints); if (n == 0) { isl_pw_aff *pa; pa = exact_bound(domain, build, 1); return isl_pw_aff_list_from_pw_aff(pa); } ctx = isl_ast_build_get_ctx(build); list = isl_pw_aff_list_alloc(ctx,n); for (i = 0; i < n; ++i) { isl_aff *aff; isl_constraint *c; c = isl_constraint_list_get_constraint(constraints, i); aff = isl_constraint_get_bound(c, isl_dim_set, pos); isl_constraint_free(c); aff = isl_aff_floor(aff); list = isl_pw_aff_list_add(list, isl_pw_aff_from_aff(aff)); } return list; } /* Return an isl_ast_expr that performs the reduction of type "type" * on AST expressions corresponding to the elements in "list". * * The list is assumed to contain at least one element. * If the list contains exactly one element, then the returned isl_ast_expr * simply computes that affine expression. */ static __isl_give isl_ast_expr *reduce_list(enum isl_ast_op_type type, __isl_keep isl_pw_aff_list *list, __isl_keep isl_ast_build *build) { int i, n; isl_ctx *ctx; isl_ast_expr *expr; if (!list) return NULL; n = isl_pw_aff_list_n_pw_aff(list); if (n == 1) return isl_ast_build_expr_from_pw_aff_internal(build, isl_pw_aff_list_get_pw_aff(list, 0)); ctx = isl_pw_aff_list_get_ctx(list); expr = isl_ast_expr_alloc_op(ctx, type, n); if (!expr) return NULL; for (i = 0; i < n; ++i) { isl_ast_expr *expr_i; expr_i = isl_ast_build_expr_from_pw_aff_internal(build, isl_pw_aff_list_get_pw_aff(list, i)); if (!expr_i) return isl_ast_expr_free(expr); expr->u.op.args[i] = expr_i; } return expr; } /* Add a guard to "graft" based on "bound" in the case of a degenerate * level (including the special case of an eliminated level). * * We eliminate the current dimension, simplify the result in the current * build and add the result as guards to the graft. * * Note that we cannot simply drop the constraints on the current dimension * even in the eliminated case, because the single affine expression may * not be explicitly available in "bounds". Moreover, the single affine * expression may only be defined on a subset of the build domain, * so we do in some cases need to insert a guard even in the eliminated case. */ static __isl_give isl_ast_graft *add_degenerate_guard( __isl_take isl_ast_graft *graft, __isl_keep isl_basic_set *bounds, __isl_keep isl_ast_build *build) { int depth; isl_set *dom; depth = isl_ast_build_get_depth(build); dom = isl_set_from_basic_set(isl_basic_set_copy(bounds)); if (isl_ast_build_has_stride(build, depth)) { isl_set *stride; stride = isl_ast_build_get_stride_constraint(build); dom = isl_set_intersect(dom, stride); } dom = isl_set_eliminate(dom, isl_dim_set, depth, 1); dom = isl_ast_build_compute_gist(build, dom); graft = isl_ast_graft_add_guard(graft, dom, build); return graft; } /* Update "graft" based on "bounds" for the eliminated case. * * In the eliminated case, no for node is created, so we only need * to check if "bounds" imply any guards that need to be inserted. */ static __isl_give isl_ast_graft *refine_eliminated( __isl_take isl_ast_graft *graft, __isl_keep isl_basic_set *bounds, __isl_keep isl_ast_build *build) { return add_degenerate_guard(graft, bounds, build); } /* Update "graft" based on "bounds" and "sub_build" for the degenerate case. * * "build" is the build in which graft->node was created * "sub_build" contains information about the current level itself, * including the single value attained. * * We first set the initialization part of the for loop to the single * value attained by the current dimension. * The increment and condition are not strictly needed as the are known * to be "1" and "iterator <= value" respectively. * Then we set the size of the iterator and * check if "bounds" imply any guards that need to be inserted. */ static __isl_give isl_ast_graft *refine_degenerate( __isl_take isl_ast_graft *graft, __isl_keep isl_basic_set *bounds, __isl_keep isl_ast_build *build, __isl_keep isl_ast_build *sub_build) { isl_pw_aff *value; if (!graft || !sub_build) return isl_ast_graft_free(graft); value = isl_pw_aff_copy(sub_build->value); graft->node->u.f.init = isl_ast_build_expr_from_pw_aff_internal(build, value); if (!graft->node->u.f.init) return isl_ast_graft_free(graft); graft = add_degenerate_guard(graft, bounds, build); return graft; } /* Return the intersection of constraints in "list" as a set. */ static __isl_give isl_set *intersect_constraints( __isl_keep isl_constraint_list *list) { int i, n; isl_basic_set *bset; n = isl_constraint_list_n_constraint(list); if (n < 1) isl_die(isl_constraint_list_get_ctx(list), isl_error_internal, "expecting at least one constraint", return NULL); bset = isl_basic_set_from_constraint( isl_constraint_list_get_constraint(list, 0)); for (i = 1; i < n; ++i) { isl_basic_set *bset_i; bset_i = isl_basic_set_from_constraint( isl_constraint_list_get_constraint(list, i)); bset = isl_basic_set_intersect(bset, bset_i); } return isl_set_from_basic_set(bset); } /* Compute the constraints on the outer dimensions enforced by * graft->node and add those constraints to graft->enforced, * in case the upper bound is expressed as a set "upper". * * In particular, if l(...) is a lower bound in "lower", and * * -a i + f(...) >= 0 or a i <= f(...) * * is an upper bound ocnstraint on the current dimension i, * then the for loop enforces the constraint * * -a l(...) + f(...) >= 0 or a l(...) <= f(...) * * We therefore simply take each lower bound in turn, plug it into * the upper bounds and compute the intersection over all lower bounds. * * If a lower bound is a rational expression, then * isl_basic_set_preimage_multi_aff will force this rational * expression to have only integer values. However, the loop * itself does not enforce this integrality constraint. We therefore * use the ceil of the lower bounds instead of the lower bounds themselves. * Other constraints will make sure that the for loop is only executed * when each of the lower bounds attains an integral value. * In particular, potentially rational values only occur in * lower_bound if the offset is a (seemingly) rational expression, * but then outer conditions will make sure that this rational expression * only attains integer values. */ static __isl_give isl_ast_graft *set_enforced_from_set( __isl_take isl_ast_graft *graft, __isl_keep isl_pw_aff_list *lower, int pos, __isl_keep isl_set *upper) { isl_space *space; isl_basic_set *enforced; isl_pw_multi_aff *pma; int i, n; if (!graft || !lower) return isl_ast_graft_free(graft); space = isl_set_get_space(upper); enforced = isl_basic_set_universe(isl_space_copy(space)); space = isl_space_map_from_set(space); pma = isl_pw_multi_aff_identity(space); n = isl_pw_aff_list_n_pw_aff(lower); for (i = 0; i < n; ++i) { isl_pw_aff *pa; isl_set *enforced_i; isl_basic_set *hull; isl_pw_multi_aff *pma_i; pa = isl_pw_aff_list_get_pw_aff(lower, i); pa = isl_pw_aff_ceil(pa); pma_i = isl_pw_multi_aff_copy(pma); pma_i = isl_pw_multi_aff_set_pw_aff(pma_i, pos, pa); enforced_i = isl_set_copy(upper); enforced_i = isl_set_preimage_pw_multi_aff(enforced_i, pma_i); hull = isl_set_simple_hull(enforced_i); enforced = isl_basic_set_intersect(enforced, hull); } isl_pw_multi_aff_free(pma); graft = isl_ast_graft_enforce(graft, enforced); return graft; } /* Compute the constraints on the outer dimensions enforced by * graft->node and add those constraints to graft->enforced, * in case the upper bound is expressed as * a list of affine expressions "upper". * * The enforced condition is that each lower bound expression is less * than or equal to each upper bound expression. */ static __isl_give isl_ast_graft *set_enforced_from_list( __isl_take isl_ast_graft *graft, __isl_keep isl_pw_aff_list *lower, __isl_keep isl_pw_aff_list *upper) { isl_set *cond; isl_basic_set *enforced; lower = isl_pw_aff_list_copy(lower); upper = isl_pw_aff_list_copy(upper); cond = isl_pw_aff_list_le_set(lower, upper); enforced = isl_set_simple_hull(cond); graft = isl_ast_graft_enforce(graft, enforced); return graft; } /* Does "aff" have a negative constant term? */ static int aff_constant_is_negative(__isl_take isl_set *set, __isl_take isl_aff *aff, void *user) { int *neg = user; isl_val *v; v = isl_aff_get_constant_val(aff); *neg = isl_val_is_neg(v); isl_val_free(v); isl_set_free(set); isl_aff_free(aff); return *neg ? 0 : -1; } /* Does "pa" have a negative constant term over its entire domain? */ static int pw_aff_constant_is_negative(__isl_take isl_pw_aff *pa, void *user) { int r; int *neg = user; r = isl_pw_aff_foreach_piece(pa, &aff_constant_is_negative, user); isl_pw_aff_free(pa); return *neg ? 0 : -1; } /* Does each element in "list" have a negative constant term? * * The callback terminates the iteration as soon an element has been * found that does not have a negative constant term. */ static int list_constant_is_negative(__isl_keep isl_pw_aff_list *list) { int neg = 1; if (isl_pw_aff_list_foreach(list, &pw_aff_constant_is_negative, &neg) < 0 && neg) return -1; return neg; } /* Add 1 to each of the elements in "list", where each of these elements * is defined over the internal schedule space of "build". */ static __isl_give isl_pw_aff_list *list_add_one( __isl_take isl_pw_aff_list *list, __isl_keep isl_ast_build *build) { int i, n; isl_space *space; isl_aff *aff; isl_pw_aff *one; space = isl_ast_build_get_space(build, 1); aff = isl_aff_zero_on_domain(isl_local_space_from_space(space)); aff = isl_aff_add_constant_si(aff, 1); one = isl_pw_aff_from_aff(aff); n = isl_pw_aff_list_n_pw_aff(list); for (i = 0; i < n; ++i) { isl_pw_aff *pa; pa = isl_pw_aff_list_get_pw_aff(list, i); pa = isl_pw_aff_add(pa, isl_pw_aff_copy(one)); list = isl_pw_aff_list_set_pw_aff(list, i, pa); } isl_pw_aff_free(one); return list; } /* Set the condition part of the for node graft->node in case * the upper bound is represented as a list of piecewise affine expressions. * * In particular, set the condition to * * iterator <= min(list of upper bounds) * * If each of the upper bounds has a negative constant term, then * set the condition to * * iterator < min(list of (upper bound + 1)s) * */ static __isl_give isl_ast_graft *set_for_cond_from_list( __isl_take isl_ast_graft *graft, __isl_keep isl_pw_aff_list *list, __isl_keep isl_ast_build *build) { int neg; isl_ast_expr *bound, *iterator, *cond; enum isl_ast_op_type type = isl_ast_op_le; if (!graft || !list) return isl_ast_graft_free(graft); neg = list_constant_is_negative(list); if (neg < 0) return isl_ast_graft_free(graft); list = isl_pw_aff_list_copy(list); if (neg) { list = list_add_one(list, build); type = isl_ast_op_lt; } bound = reduce_list(isl_ast_op_min, list, build); iterator = isl_ast_expr_copy(graft->node->u.f.iterator); cond = isl_ast_expr_alloc_binary(type, iterator, bound); graft->node->u.f.cond = cond; isl_pw_aff_list_free(list); if (!graft->node->u.f.cond) return isl_ast_graft_free(graft); return graft; } /* Set the condition part of the for node graft->node in case * the upper bound is represented as a set. */ static __isl_give isl_ast_graft *set_for_cond_from_set( __isl_take isl_ast_graft *graft, __isl_keep isl_set *set, __isl_keep isl_ast_build *build) { isl_ast_expr *cond; if (!graft) return NULL; cond = isl_ast_build_expr_from_set(build, isl_set_copy(set)); graft->node->u.f.cond = cond; if (!graft->node->u.f.cond) return isl_ast_graft_free(graft); return graft; } /* Construct an isl_ast_expr for the increment (i.e., stride) of * the current dimension. */ static __isl_give isl_ast_expr *for_inc(__isl_keep isl_ast_build *build) { int depth; isl_val *v; isl_ctx *ctx; if (!build) return NULL; ctx = isl_ast_build_get_ctx(build); depth = isl_ast_build_get_depth(build); if (!isl_ast_build_has_stride(build, depth)) return isl_ast_expr_alloc_int_si(ctx, 1); v = isl_ast_build_get_stride(build, depth); return isl_ast_expr_from_val(v); } /* Should we express the loop condition as * * iterator <= min(list of upper bounds) * * or as a conjunction of constraints? * * The first is constructed from a list of upper bounds. * The second is constructed from a set. * * If there are no upper bounds in "constraints", then this could mean * that "domain" simply doesn't have an upper bound or that we didn't * pick any upper bound. In the first case, we want to generate the * loop condition as a(n empty) conjunction of constraints * In the second case, we will compute * a single upper bound from "domain" and so we use the list form. * * If there are upper bounds in "constraints", * then we use the list form iff the atomic_upper_bound option is set. */ static int use_upper_bound_list(isl_ctx *ctx, int n_upper, __isl_keep isl_set *domain, int depth) { if (n_upper > 0) return isl_options_get_ast_build_atomic_upper_bound(ctx); else return isl_set_dim_has_upper_bound(domain, isl_dim_set, depth); } /* Fill in the expressions of the for node in graft->node. * * In particular, * - set the initialization part of the loop to the maximum of the lower bounds * - set the size of the iterator based on the values attained by the iterator * - extract the increment from the stride of the current dimension * - construct the for condition either based on a list of upper bounds * or on a set of upper bound constraints. */ static __isl_give isl_ast_graft *set_for_node_expressions( __isl_take isl_ast_graft *graft, __isl_keep isl_pw_aff_list *lower, int use_list, __isl_keep isl_pw_aff_list *upper_list, __isl_keep isl_set *upper_set, __isl_keep isl_ast_build *build) { isl_ast_node *node; if (!graft) return NULL; build = isl_ast_build_copy(build); build = isl_ast_build_set_enforced(build, isl_ast_graft_get_enforced(graft)); node = graft->node; node->u.f.init = reduce_list(isl_ast_op_max, lower, build); node->u.f.inc = for_inc(build); if (use_list) graft = set_for_cond_from_list(graft, upper_list, build); else graft = set_for_cond_from_set(graft, upper_set, build); isl_ast_build_free(build); if (!node->u.f.iterator || !node->u.f.init || !node->u.f.cond || !node->u.f.inc) return isl_ast_graft_free(graft); return graft; } /* Update "graft" based on "bounds" and "domain" for the generic, * non-degenerate, case. * * "c_lower" and "c_upper" contain the lower and upper bounds * that the loop node should express. * "domain" is the subset of the intersection of the constraints * for which some code is executed. * * There may be zero lower bounds or zero upper bounds in "constraints" * in case the list of constraints was created * based on the atomic option or based on separation with explicit bounds. * In that case, we use "domain" to derive lower and/or upper bounds. * * We first compute a list of one or more lower bounds. * * Then we decide if we want to express the condition as * * iterator <= min(list of upper bounds) * * or as a conjunction of constraints. * * The set of enforced constraints is then computed either based on * a list of upper bounds or on a set of upper bound constraints. * We do not compute any enforced constraints if we were forced * to compute a lower or upper bound using exact_bound. The domains * of the resulting expressions may imply some bounds on outer dimensions * that we do not want to appear in the enforced constraints since * they are not actually enforced by the corresponding code. * * Finally, we fill in the expressions of the for node. */ static __isl_give isl_ast_graft *refine_generic_bounds( __isl_take isl_ast_graft *graft, __isl_take isl_constraint_list *c_lower, __isl_take isl_constraint_list *c_upper, __isl_keep isl_set *domain, __isl_keep isl_ast_build *build) { int depth; isl_ctx *ctx; isl_pw_aff_list *lower; int use_list; isl_set *upper_set = NULL; isl_pw_aff_list *upper_list = NULL; int n_lower, n_upper; if (!graft || !c_lower || !c_upper || !build) goto error; depth = isl_ast_build_get_depth(build); ctx = isl_ast_graft_get_ctx(graft); n_lower = isl_constraint_list_n_constraint(c_lower); n_upper = isl_constraint_list_n_constraint(c_upper); use_list = use_upper_bound_list(ctx, n_upper, domain, depth); lower = lower_bounds(c_lower, depth, domain, build); if (use_list) upper_list = upper_bounds(c_upper, depth, domain, build); else if (n_upper > 0) upper_set = intersect_constraints(c_upper); else upper_set = isl_set_universe(isl_set_get_space(domain)); if (n_lower == 0 || n_upper == 0) ; else if (use_list) graft = set_enforced_from_list(graft, lower, upper_list); else graft = set_enforced_from_set(graft, lower, depth, upper_set); graft = set_for_node_expressions(graft, lower, use_list, upper_list, upper_set, build); isl_pw_aff_list_free(lower); isl_pw_aff_list_free(upper_list); isl_set_free(upper_set); isl_constraint_list_free(c_lower); isl_constraint_list_free(c_upper); return graft; error: isl_constraint_list_free(c_lower); isl_constraint_list_free(c_upper); return isl_ast_graft_free(graft); } /* Internal data structure used inside count_constraints to keep * track of the number of constraints that are independent of dimension "pos", * the lower bounds in "pos" and the upper bounds in "pos". */ struct isl_ast_count_constraints_data { int pos; int n_indep; int n_lower; int n_upper; }; /* Increment data->n_indep, data->lower or data->upper depending * on whether "c" is independenct of dimensions data->pos, * a lower bound or an upper bound. */ static int count_constraints(__isl_take isl_constraint *c, void *user) { struct isl_ast_count_constraints_data *data = user; if (isl_constraint_is_lower_bound(c, isl_dim_set, data->pos)) data->n_lower++; else if (isl_constraint_is_upper_bound(c, isl_dim_set, data->pos)) data->n_upper++; else data->n_indep++; isl_constraint_free(c); return 0; } /* Update "graft" based on "bounds" and "domain" for the generic, * non-degenerate, case. * * "list" respresent the list of bounds that need to be encoded by * the for loop (or a guard around the for loop). * "domain" is the subset of the intersection of the constraints * for which some code is executed. * "build" is the build in which graft->node was created. * * We separate lower bounds, upper bounds and constraints that * are independent of the loop iterator. * * The actual for loop bounds are generated in refine_generic_bounds. * If there are any constraints that are independent of the loop iterator, * we need to put a guard around the for loop (which may get hoisted up * to higher levels) and we call refine_generic_bounds in a build * where this guard is enforced. */ static __isl_give isl_ast_graft *refine_generic_split( __isl_take isl_ast_graft *graft, __isl_take isl_constraint_list *list, __isl_keep isl_set *domain, __isl_keep isl_ast_build *build) { isl_ast_build *for_build; isl_set *guard; struct isl_ast_count_constraints_data data; isl_constraint_list *lower; isl_constraint_list *upper; if (!list) return isl_ast_graft_free(graft); data.pos = isl_ast_build_get_depth(build); list = isl_constraint_list_sort(list, &cmp_constraint, &data.pos); if (!list) return isl_ast_graft_free(graft); data.n_indep = data.n_lower = data.n_upper = 0; if (isl_constraint_list_foreach(list, &count_constraints, &data) < 0) { isl_constraint_list_free(list); return isl_ast_graft_free(graft); } lower = isl_constraint_list_copy(list); lower = isl_constraint_list_drop(lower, 0, data.n_indep); upper = isl_constraint_list_copy(lower); lower = isl_constraint_list_drop(lower, data.n_lower, data.n_upper); upper = isl_constraint_list_drop(upper, 0, data.n_lower); if (data.n_indep == 0) { isl_constraint_list_free(list); return refine_generic_bounds(graft, lower, upper, domain, build); } list = isl_constraint_list_drop(list, data.n_indep, data.n_lower + data.n_upper); guard = intersect_constraints(list); isl_constraint_list_free(list); for_build = isl_ast_build_copy(build); for_build = isl_ast_build_restrict_pending(for_build, isl_set_copy(guard)); graft = refine_generic_bounds(graft, lower, upper, domain, for_build); isl_ast_build_free(for_build); graft = isl_ast_graft_add_guard(graft, guard, build); return graft; } /* Add the guard implied by the current stride constraint (if any), * but not (necessarily) enforced by the generated AST to "graft". */ static __isl_give isl_ast_graft *add_stride_guard( __isl_take isl_ast_graft *graft, __isl_keep isl_ast_build *build) { int depth; isl_set *dom; depth = isl_ast_build_get_depth(build); if (!isl_ast_build_has_stride(build, depth)) return graft; dom = isl_ast_build_get_stride_constraint(build); dom = isl_set_eliminate(dom, isl_dim_set, depth, 1); dom = isl_ast_build_compute_gist(build, dom); graft = isl_ast_graft_add_guard(graft, dom, build); return graft; } /* Update "graft" based on "bounds" and "domain" for the generic, * non-degenerate, case. * * "bounds" respresent the bounds that need to be encoded by * the for loop (or a guard around the for loop). * "domain" is the subset of "bounds" for which some code is executed. * "build" is the build in which graft->node was created. * * We break up "bounds" into a list of constraints and continue with * refine_generic_split. */ static __isl_give isl_ast_graft *refine_generic( __isl_take isl_ast_graft *graft, __isl_keep isl_basic_set *bounds, __isl_keep isl_set *domain, __isl_keep isl_ast_build *build) { isl_constraint_list *list; if (!build || !graft) return isl_ast_graft_free(graft); bounds = isl_basic_set_copy(bounds); bounds = isl_ast_build_compute_gist_basic_set(build, bounds); list = isl_constraint_list_from_basic_set(bounds); graft = refine_generic_split(graft, list, domain, build); graft = add_stride_guard(graft, build); return graft; } /* Create a for node for the current level. * * Mark the for node degenerate if "degenerate" is set. */ static __isl_give isl_ast_node *create_for(__isl_keep isl_ast_build *build, int degenerate) { int depth; isl_id *id; isl_ast_node *node; if (!build) return NULL; depth = isl_ast_build_get_depth(build); id = isl_ast_build_get_iterator_id(build, depth); node = isl_ast_node_alloc_for(id); if (degenerate) node = isl_ast_node_for_mark_degenerate(node); return node; } /* Create an AST node for the current dimension based on * the schedule domain "bounds" and return the node encapsulated * in an isl_ast_graft. * * "executed" is the current inverse schedule, taking into account * the bounds in "bounds" * "domain" is the domain of "executed", with inner dimensions projected out. * It may be a strict subset of "bounds" in case "bounds" was created * based on the atomic option or based on separation with explicit bounds. * * "domain" may satisfy additional equalities that result * from intersecting "executed" with "bounds" in add_node. * It may also satisfy some global constraints that were dropped out because * we performed separation with explicit bounds. * The very first step is then to copy these constraints to "bounds". * * Since we may be calling before_each_for and after_each_for * callbacks, we record the current inverse schedule in the build. * * We consider three builds, * "build" is the one in which the current level is created, * "body_build" is the build in which the next level is created, * "sub_build" is essentially the same as "body_build", except that * the depth has not been increased yet. * * "build" already contains information (in strides and offsets) * about the strides at the current level, but this information is not * reflected in the build->domain. * We first add this information and the "bounds" to the sub_build->domain. * isl_ast_build_set_loop_bounds checks whether the current dimension attains * only a single value and whether this single value can be represented using * a single affine expression. * In the first case, the current level is considered "degenerate". * In the second, sub-case, the current level is considered "eliminated". * Eliminated level don't need to be reflected in the AST since we can * simply plug in the affine expression. For degenerate, but non-eliminated, * levels, we do introduce a for node, but mark is as degenerate so that * it can be printed as an assignment of the single value to the loop * "iterator". * * If the current level is eliminated, we explicitly plug in the value * for the current level found by isl_ast_build_set_loop_bounds in the * inverse schedule. This ensures that if we are working on a slice * of the domain based on information available in the inverse schedule * and the build domain, that then this information is also reflected * in the inverse schedule. This operation also eliminates the current * dimension from the inverse schedule making sure no inner dimensions depend * on the current dimension. Otherwise, we create a for node, marking * it degenerate if appropriate. The initial for node is still incomplete * and will be completed in either refine_degenerate or refine_generic. * * We then generate a sequence of grafts for the next level, * create a surrounding graft for the current level and insert * the for node we created (if the current level is not eliminated). * * Finally, we set the bounds of the for loop and insert guards * (either in the AST or in the graft) in one of * refine_eliminated, refine_degenerate or refine_generic. */ static __isl_give isl_ast_graft *create_node_scaled( __isl_take isl_union_map *executed, __isl_take isl_basic_set *bounds, __isl_take isl_set *domain, __isl_take isl_ast_build *build) { int depth; int degenerate, eliminated; isl_basic_set *hull; isl_ast_node *node = NULL; isl_ast_graft *graft; isl_ast_graft_list *children; isl_ast_build *sub_build; isl_ast_build *body_build; domain = isl_ast_build_eliminate_divs(build, domain); domain = isl_set_detect_equalities(domain); hull = isl_set_unshifted_simple_hull(isl_set_copy(domain)); bounds = isl_basic_set_intersect(bounds, hull); build = isl_ast_build_set_executed(build, isl_union_map_copy(executed)); depth = isl_ast_build_get_depth(build); sub_build = isl_ast_build_copy(build); sub_build = isl_ast_build_include_stride(sub_build); sub_build = isl_ast_build_set_loop_bounds(sub_build, isl_basic_set_copy(bounds)); degenerate = isl_ast_build_has_value(sub_build); eliminated = isl_ast_build_has_affine_value(sub_build, depth); if (degenerate < 0 || eliminated < 0) executed = isl_union_map_free(executed); if (eliminated) executed = plug_in_values(executed, sub_build); else node = create_for(build, degenerate); body_build = isl_ast_build_copy(sub_build); body_build = isl_ast_build_increase_depth(body_build); if (!eliminated) node = before_each_for(node, body_build); children = generate_next_level(executed, isl_ast_build_copy(body_build)); graft = isl_ast_graft_alloc_level(children, build, sub_build); if (!eliminated) graft = isl_ast_graft_insert_for(graft, node); if (eliminated) graft = refine_eliminated(graft, bounds, build); else if (degenerate) graft = refine_degenerate(graft, bounds, build, sub_build); else graft = refine_generic(graft, bounds, domain, build); if (!eliminated) graft = after_each_for(graft, body_build); isl_ast_build_free(body_build); isl_ast_build_free(sub_build); isl_ast_build_free(build); isl_basic_set_free(bounds); isl_set_free(domain); return graft; } /* Internal data structure for checking if all constraints involving * the input dimension "depth" are such that the other coefficients * are multiples of "m", reducing "m" if they are not. * If "m" is reduced all the way down to "1", then the check has failed * and we break out of the iteration. */ struct isl_check_scaled_data { int depth; isl_val *m; }; /* If constraint "c" involves the input dimension data->depth, * then make sure that all the other coefficients are multiples of data->m, * reducing data->m if needed. * Break out of the iteration if data->m has become equal to "1". */ static int constraint_check_scaled(__isl_take isl_constraint *c, void *user) { struct isl_check_scaled_data *data = user; int i, j, n; enum isl_dim_type t[] = { isl_dim_param, isl_dim_in, isl_dim_out, isl_dim_div }; if (!isl_constraint_involves_dims(c, isl_dim_in, data->depth, 1)) { isl_constraint_free(c); return 0; } for (i = 0; i < 4; ++i) { n = isl_constraint_dim(c, t[i]); for (j = 0; j < n; ++j) { isl_val *d; if (t[i] == isl_dim_in && j == data->depth) continue; if (!isl_constraint_involves_dims(c, t[i], j, 1)) continue; d = isl_constraint_get_coefficient_val(c, t[i], j); data->m = isl_val_gcd(data->m, d); if (isl_val_is_one(data->m)) break; } if (j < n) break; } isl_constraint_free(c); return i < 4 ? -1 : 0; } /* For each constraint of "bmap" that involves the input dimension data->depth, * make sure that all the other coefficients are multiples of data->m, * reducing data->m if needed. * Break out of the iteration if data->m has become equal to "1". */ static int basic_map_check_scaled(__isl_take isl_basic_map *bmap, void *user) { int r; r = isl_basic_map_foreach_constraint(bmap, &constraint_check_scaled, user); isl_basic_map_free(bmap); return r; } /* For each constraint of "map" that involves the input dimension data->depth, * make sure that all the other coefficients are multiples of data->m, * reducing data->m if needed. * Break out of the iteration if data->m has become equal to "1". */ static int map_check_scaled(__isl_take isl_map *map, void *user) { int r; r = isl_map_foreach_basic_map(map, &basic_map_check_scaled, user); isl_map_free(map); return r; } /* Create an AST node for the current dimension based on * the schedule domain "bounds" and return the node encapsulated * in an isl_ast_graft. * * "executed" is the current inverse schedule, taking into account * the bounds in "bounds" * "domain" is the domain of "executed", with inner dimensions projected out. * * * Before moving on to the actual AST node construction in create_node_scaled, * we first check if the current dimension is strided and if we can scale * down this stride. Note that we only do this if the ast_build_scale_strides * option is set. * * In particular, let the current dimension take on values * * f + s a * * with a an integer. We check if we can find an integer m that (obviouly) * divides both f and s. * * If so, we check if the current dimension only appears in constraints * where the coefficients of the other variables are multiples of m. * We perform this extra check to avoid the risk of introducing * divisions by scaling down the current dimension. * * If so, we scale the current dimension down by a factor of m. * That is, we plug in * * i = m i' (1) * * Note that in principle we could always scale down strided loops * by plugging in * * i = f + s i' * * but this may result in i' taking on larger values than the original i, * due to the shift by "f". * By constrast, the scaling in (1) can only reduce the (absolute) value "i". */ static __isl_give isl_ast_graft *create_node(__isl_take isl_union_map *executed, __isl_take isl_basic_set *bounds, __isl_take isl_set *domain, __isl_take isl_ast_build *build) { struct isl_check_scaled_data data; isl_ctx *ctx; isl_aff *offset; isl_val *d; ctx = isl_ast_build_get_ctx(build); if (!isl_options_get_ast_build_scale_strides(ctx)) return create_node_scaled(executed, bounds, domain, build); data.depth = isl_ast_build_get_depth(build); if (!isl_ast_build_has_stride(build, data.depth)) return create_node_scaled(executed, bounds, domain, build); offset = isl_ast_build_get_offset(build, data.depth); data.m = isl_ast_build_get_stride(build, data.depth); if (!data.m) offset = isl_aff_free(offset); offset = isl_aff_scale_down_val(offset, isl_val_copy(data.m)); d = isl_aff_get_denominator_val(offset); if (!d) executed = isl_union_map_free(executed); if (executed && isl_val_is_divisible_by(data.m, d)) data.m = isl_val_div(data.m, d); else { data.m = isl_val_set_si(data.m, 1); isl_val_free(d); } if (!isl_val_is_one(data.m)) { if (isl_union_map_foreach_map(executed, &map_check_scaled, &data) < 0 && !isl_val_is_one(data.m)) executed = isl_union_map_free(executed); } if (!isl_val_is_one(data.m)) { isl_space *space; isl_multi_aff *ma; isl_aff *aff; isl_map *map; isl_union_map *umap; space = isl_ast_build_get_space(build, 1); space = isl_space_map_from_set(space); ma = isl_multi_aff_identity(space); aff = isl_multi_aff_get_aff(ma, data.depth); aff = isl_aff_scale_val(aff, isl_val_copy(data.m)); ma = isl_multi_aff_set_aff(ma, data.depth, aff); bounds = isl_basic_set_preimage_multi_aff(bounds, isl_multi_aff_copy(ma)); domain = isl_set_preimage_multi_aff(domain, isl_multi_aff_copy(ma)); map = isl_map_reverse(isl_map_from_multi_aff(ma)); umap = isl_union_map_from_map(map); executed = isl_union_map_apply_domain(executed, isl_union_map_copy(umap)); build = isl_ast_build_scale_down(build, isl_val_copy(data.m), umap); } isl_aff_free(offset); isl_val_free(data.m); return create_node_scaled(executed, bounds, domain, build); } /* Add the basic set to the list that "user" points to. */ static int collect_basic_set(__isl_take isl_basic_set *bset, void *user) { isl_basic_set_list **list = user; *list = isl_basic_set_list_add(*list, bset); return 0; } /* Extract the basic sets of "set" and collect them in an isl_basic_set_list. */ static __isl_give isl_basic_set_list *isl_basic_set_list_from_set( __isl_take isl_set *set) { int n; isl_ctx *ctx; isl_basic_set_list *list; if (!set) return NULL; ctx = isl_set_get_ctx(set); n = isl_set_n_basic_set(set); list = isl_basic_set_list_alloc(ctx, n); if (isl_set_foreach_basic_set(set, &collect_basic_set, &list) < 0) list = isl_basic_set_list_free(list); isl_set_free(set); return list; } /* Generate code for the schedule domain "bounds" * and add the result to "list". * * We mainly detect strides and additional equalities here * and then pass over control to create_node. * * "bounds" reflects the bounds on the current dimension and possibly * some extra conditions on outer dimensions. * It does not, however, include any divs involving the current dimension, * so it does not capture any stride constraints. * We therefore need to compute that part of the schedule domain that * intersects with "bounds" and derive the strides from the result. */ static __isl_give isl_ast_graft_list *add_node( __isl_take isl_ast_graft_list *list, __isl_take isl_union_map *executed, __isl_take isl_basic_set *bounds, __isl_take isl_ast_build *build) { isl_ast_graft *graft; isl_set *domain = NULL; isl_union_set *uset; int empty; uset = isl_union_set_from_basic_set(isl_basic_set_copy(bounds)); executed = isl_union_map_intersect_domain(executed, uset); empty = isl_union_map_is_empty(executed); if (empty < 0) goto error; if (empty) goto done; uset = isl_union_map_domain(isl_union_map_copy(executed)); domain = isl_set_from_union_set(uset); domain = isl_ast_build_compute_gist(build, domain); empty = isl_set_is_empty(domain); if (empty < 0) goto error; if (empty) goto done; domain = isl_ast_build_eliminate_inner(build, domain); build = isl_ast_build_detect_strides(build, isl_set_copy(domain)); graft = create_node(executed, bounds, domain, isl_ast_build_copy(build)); list = isl_ast_graft_list_add(list, graft); isl_ast_build_free(build); return list; error: list = isl_ast_graft_list_free(list); done: isl_set_free(domain); isl_basic_set_free(bounds); isl_union_map_free(executed); isl_ast_build_free(build); return list; } /* Does any element of i follow or coincide with any element of j * at the current depth for equal values of the outer dimensions? */ static int domain_follows_at_depth(__isl_keep isl_basic_set *i, __isl_keep isl_basic_set *j, void *user) { int depth = *(int *) user; isl_basic_map *test; int empty; int l; test = isl_basic_map_from_domain_and_range(isl_basic_set_copy(i), isl_basic_set_copy(j)); for (l = 0; l < depth; ++l) test = isl_basic_map_equate(test, isl_dim_in, l, isl_dim_out, l); test = isl_basic_map_order_ge(test, isl_dim_in, depth, isl_dim_out, depth); empty = isl_basic_map_is_empty(test); isl_basic_map_free(test); return empty < 0 ? -1 : !empty; } /* Split up each element of "list" into a part that is related to "bset" * according to "gt" and a part that is not. * Return a list that consist of "bset" and all the pieces. */ static __isl_give isl_basic_set_list *add_split_on( __isl_take isl_basic_set_list *list, __isl_take isl_basic_set *bset, __isl_keep isl_basic_map *gt) { int i, n; isl_basic_set_list *res; gt = isl_basic_map_copy(gt); gt = isl_basic_map_intersect_domain(gt, isl_basic_set_copy(bset)); n = isl_basic_set_list_n_basic_set(list); res = isl_basic_set_list_from_basic_set(bset); for (i = 0; res && i < n; ++i) { isl_basic_set *bset; isl_set *set1, *set2; isl_basic_map *bmap; int empty; bset = isl_basic_set_list_get_basic_set(list, i); bmap = isl_basic_map_copy(gt); bmap = isl_basic_map_intersect_range(bmap, bset); bset = isl_basic_map_range(bmap); empty = isl_basic_set_is_empty(bset); if (empty < 0) res = isl_basic_set_list_free(res); if (empty) { isl_basic_set_free(bset); bset = isl_basic_set_list_get_basic_set(list, i); res = isl_basic_set_list_add(res, bset); continue; } res = isl_basic_set_list_add(res, isl_basic_set_copy(bset)); set1 = isl_set_from_basic_set(bset); bset = isl_basic_set_list_get_basic_set(list, i); set2 = isl_set_from_basic_set(bset); set1 = isl_set_subtract(set2, set1); set1 = isl_set_make_disjoint(set1); res = isl_basic_set_list_concat(res, isl_basic_set_list_from_set(set1)); } isl_basic_map_free(gt); isl_basic_set_list_free(list); return res; } static __isl_give isl_ast_graft_list *generate_sorted_domains( __isl_keep isl_basic_set_list *domain_list, __isl_keep isl_union_map *executed, __isl_keep isl_ast_build *build); /* Internal data structure for add_nodes. * * "executed" and "build" are extra arguments to be passed to add_node. * "list" collects the results. */ struct isl_add_nodes_data { isl_union_map *executed; isl_ast_build *build; isl_ast_graft_list *list; }; /* Generate code for the schedule domains in "scc" * and add the results to "list". * * The domains in "scc" form a strongly connected component in the ordering. * If the number of domains in "scc" is larger than 1, then this means * that we cannot determine a valid ordering for the domains in the component. * This should be fairly rare because the individual domains * have been made disjoint first. * The problem is that the domains may be integrally disjoint but not * rationally disjoint. For example, we may have domains * * { [i,i] : 0 <= i <= 1 } and { [i,1-i] : 0 <= i <= 1 } * * These two domains have an empty intersection, but their rational * relaxations do intersect. It is impossible to order these domains * in the second dimension because the first should be ordered before * the second for outer dimension equal to 0, while it should be ordered * after for outer dimension equal to 1. * * This may happen in particular in case of unrolling since the domain * of each slice is replaced by its simple hull. * * For each basic set i in "scc" and for each of the following basic sets j, * we split off that part of the basic set i that shares the outer dimensions * with j and lies before j in the current dimension. * We collect all the pieces in a new list that replaces "scc". */ static int add_nodes(__isl_take isl_basic_set_list *scc, void *user) { struct isl_add_nodes_data *data = user; int i, n, depth; isl_basic_set *bset; isl_basic_set_list *list; isl_space *space; isl_basic_map *gt; n = isl_basic_set_list_n_basic_set(scc); bset = isl_basic_set_list_get_basic_set(scc, 0); if (n == 1) { isl_basic_set_list_free(scc); data->list = add_node(data->list, isl_union_map_copy(data->executed), bset, isl_ast_build_copy(data->build)); return data->list ? 0 : -1; } depth = isl_ast_build_get_depth(data->build); space = isl_basic_set_get_space(bset); space = isl_space_map_from_set(space); gt = isl_basic_map_universe(space); for (i = 0; i < depth; ++i) gt = isl_basic_map_equate(gt, isl_dim_in, i, isl_dim_out, i); gt = isl_basic_map_order_gt(gt, isl_dim_in, depth, isl_dim_out, depth); list = isl_basic_set_list_from_basic_set(bset); for (i = 1; i < n; ++i) { bset = isl_basic_set_list_get_basic_set(scc, i); list = add_split_on(list, bset, gt); } isl_basic_map_free(gt); isl_basic_set_list_free(scc); scc = list; data->list = isl_ast_graft_list_concat(data->list, generate_sorted_domains(scc, data->executed, data->build)); isl_basic_set_list_free(scc); return data->list ? 0 : -1; } /* Sort the domains in "domain_list" according to the execution order * at the current depth (for equal values of the outer dimensions), * generate code for each of them, collecting the results in a list. * If no code is generated (because the intersection of the inverse schedule * with the domains turns out to be empty), then an empty list is returned. * * The caller is responsible for ensuring that the basic sets in "domain_list" * are pair-wise disjoint. It can, however, in principle happen that * two basic sets should be ordered one way for one value of the outer * dimensions and the other way for some other value of the outer dimensions. * We therefore play safe and look for strongly connected components. * The function add_nodes takes care of handling non-trivial components. */ static __isl_give isl_ast_graft_list *generate_sorted_domains( __isl_keep isl_basic_set_list *domain_list, __isl_keep isl_union_map *executed, __isl_keep isl_ast_build *build) { isl_ctx *ctx; struct isl_add_nodes_data data; int depth; int n; if (!domain_list) return NULL; ctx = isl_basic_set_list_get_ctx(domain_list); n = isl_basic_set_list_n_basic_set(domain_list); data.list = isl_ast_graft_list_alloc(ctx, n); if (n == 0) return data.list; if (n == 1) return add_node(data.list, isl_union_map_copy(executed), isl_basic_set_list_get_basic_set(domain_list, 0), isl_ast_build_copy(build)); depth = isl_ast_build_get_depth(build); data.executed = executed; data.build = build; if (isl_basic_set_list_foreach_scc(domain_list, &domain_follows_at_depth, &depth, &add_nodes, &data) < 0) data.list = isl_ast_graft_list_free(data.list); return data.list; } /* Do i and j share any values for the outer dimensions? */ static int shared_outer(__isl_keep isl_basic_set *i, __isl_keep isl_basic_set *j, void *user) { int depth = *(int *) user; isl_basic_map *test; int empty; int l; test = isl_basic_map_from_domain_and_range(isl_basic_set_copy(i), isl_basic_set_copy(j)); for (l = 0; l < depth; ++l) test = isl_basic_map_equate(test, isl_dim_in, l, isl_dim_out, l); empty = isl_basic_map_is_empty(test); isl_basic_map_free(test); return empty < 0 ? -1 : !empty; } /* Internal data structure for generate_sorted_domains_wrap. * * "n" is the total number of basic sets * "executed" and "build" are extra arguments to be passed * to generate_sorted_domains. * * "single" is set to 1 by generate_sorted_domains_wrap if there * is only a single component. * "list" collects the results. */ struct isl_ast_generate_parallel_domains_data { int n; isl_union_map *executed; isl_ast_build *build; int single; isl_ast_graft_list *list; }; /* Call generate_sorted_domains on "scc", fuse the result into a list * with either zero or one graft and collect the these single element * lists into data->list. * * If there is only one component, i.e., if the number of basic sets * in the current component is equal to the total number of basic sets, * then data->single is set to 1 and the result of generate_sorted_domains * is not fused. */ static int generate_sorted_domains_wrap(__isl_take isl_basic_set_list *scc, void *user) { struct isl_ast_generate_parallel_domains_data *data = user; isl_ast_graft_list *list; list = generate_sorted_domains(scc, data->executed, data->build); data->single = isl_basic_set_list_n_basic_set(scc) == data->n; if (!data->single) list = isl_ast_graft_list_fuse(list, data->build); if (!data->list) data->list = list; else data->list = isl_ast_graft_list_concat(data->list, list); isl_basic_set_list_free(scc); if (!data->list) return -1; return 0; } /* Look for any (weakly connected) components in the "domain_list" * of domains that share some values of the outer dimensions. * That is, domains in different components do not share any values * of the outer dimensions. This means that these components * can be freely reordered. * Within each of the components, we sort the domains according * to the execution order at the current depth. * * If there is more than one component, then generate_sorted_domains_wrap * fuses the result of each call to generate_sorted_domains * into a list with either zero or one graft and collects these (at most) * single element lists into a bigger list. This means that the elements of the * final list can be freely reordered. In particular, we sort them * according to an arbitrary but fixed ordering to ease merging of * graft lists from different components. */ static __isl_give isl_ast_graft_list *generate_parallel_domains( __isl_keep isl_basic_set_list *domain_list, __isl_keep isl_union_map *executed, __isl_keep isl_ast_build *build) { int depth; struct isl_ast_generate_parallel_domains_data data; if (!domain_list) return NULL; data.n = isl_basic_set_list_n_basic_set(domain_list); if (data.n <= 1) return generate_sorted_domains(domain_list, executed, build); depth = isl_ast_build_get_depth(build); data.list = NULL; data.executed = executed; data.build = build; data.single = 0; if (isl_basic_set_list_foreach_scc(domain_list, &shared_outer, &depth, &generate_sorted_domains_wrap, &data) < 0) data.list = isl_ast_graft_list_free(data.list); if (!data.single) data.list = isl_ast_graft_list_sort_guard(data.list); return data.list; } /* Internal data for separate_domain. * * "explicit" is set if we only want to use explicit bounds. * * "domain" collects the separated domains. */ struct isl_separate_domain_data { isl_ast_build *build; int explicit; isl_set *domain; }; /* Extract implicit bounds on the current dimension for the executed "map". * * The domain of "map" may involve inner dimensions, so we * need to eliminate them. */ static __isl_give isl_set *implicit_bounds(__isl_take isl_map *map, __isl_keep isl_ast_build *build) { isl_set *domain; domain = isl_map_domain(map); domain = isl_ast_build_eliminate(build, domain); return domain; } /* Extract explicit bounds on the current dimension for the executed "map". * * Rather than eliminating the inner dimensions as in implicit_bounds, * we simply drop any constraints involving those inner dimensions. * The idea is that most bounds that are implied by constraints on the * inner dimensions will be enforced by for loops and not by explicit guards. * There is then no need to separate along those bounds. */ static __isl_give isl_set *explicit_bounds(__isl_take isl_map *map, __isl_keep isl_ast_build *build) { isl_set *domain; int depth, dim; dim = isl_map_dim(map, isl_dim_out); map = isl_map_drop_constraints_involving_dims(map, isl_dim_out, 0, dim); domain = isl_map_domain(map); depth = isl_ast_build_get_depth(build); dim = isl_set_dim(domain, isl_dim_set); domain = isl_set_detect_equalities(domain); domain = isl_set_drop_constraints_involving_dims(domain, isl_dim_set, depth + 1, dim - (depth + 1)); domain = isl_set_remove_divs_involving_dims(domain, isl_dim_set, depth, 1); domain = isl_set_remove_unknown_divs(domain); return domain; } /* Split data->domain into pieces that intersect with the range of "map" * and pieces that do not intersect with the range of "map" * and then add that part of the range of "map" that does not intersect * with data->domain. */ static int separate_domain(__isl_take isl_map *map, void *user) { struct isl_separate_domain_data *data = user; isl_set *domain; isl_set *d1, *d2; if (data->explicit) domain = explicit_bounds(map, data->build); else domain = implicit_bounds(map, data->build); domain = isl_set_coalesce(domain); domain = isl_set_make_disjoint(domain); d1 = isl_set_subtract(isl_set_copy(domain), isl_set_copy(data->domain)); d2 = isl_set_subtract(isl_set_copy(data->domain), isl_set_copy(domain)); data->domain = isl_set_intersect(data->domain, domain); data->domain = isl_set_union(data->domain, d1); data->domain = isl_set_union(data->domain, d2); return 0; } /* Separate the schedule domains of "executed". * * That is, break up the domain of "executed" into basic sets, * such that for each basic set S, every element in S is associated with * the same domain spaces. * * "space" is the (single) domain space of "executed". */ static __isl_give isl_set *separate_schedule_domains( __isl_take isl_space *space, __isl_take isl_union_map *executed, __isl_keep isl_ast_build *build) { struct isl_separate_domain_data data = { build }; isl_ctx *ctx; ctx = isl_ast_build_get_ctx(build); data.explicit = isl_options_get_ast_build_separation_bounds(ctx) == ISL_AST_BUILD_SEPARATION_BOUNDS_EXPLICIT; data.domain = isl_set_empty(space); if (isl_union_map_foreach_map(executed, &separate_domain, &data) < 0) data.domain = isl_set_free(data.domain); isl_union_map_free(executed); return data.domain; } /* Temporary data used during the search for a lower bound for unrolling. * * "domain" is the original set for which to find a lower bound * "depth" is the dimension for which to find a lower boudn * * "lower" is the best lower bound found so far. It is NULL if we have not * found any yet. * "n" is the corresponding size. If lower is NULL, then the value of n * is undefined. */ struct isl_find_unroll_data { isl_set *domain; int depth; isl_aff *lower; int *n; }; /* Check if we can use "c" as a lower bound and if it is better than * any previously found lower bound. * * If "c" does not involve the dimension at the current depth, * then we cannot use it. * Otherwise, let "c" be of the form * * i >= f(j)/a * * We compute the maximal value of * * -ceil(f(j)/a)) + i + 1 * * over the domain. If there is such a value "n", then we know * * -ceil(f(j)/a)) + i + 1 <= n * * or * * i < ceil(f(j)/a)) + n * * meaning that we can use ceil(f(j)/a)) as a lower bound for unrolling. * We just need to check if we have found any lower bound before and * if the new lower bound is better (smaller n) than the previously found * lower bounds. */ static int update_unrolling_lower_bound(struct isl_find_unroll_data *data, __isl_keep isl_constraint *c) { isl_aff *aff, *lower; isl_val *max; if (!isl_constraint_is_lower_bound(c, isl_dim_set, data->depth)) return 0; lower = isl_constraint_get_bound(c, isl_dim_set, data->depth); lower = isl_aff_ceil(lower); aff = isl_aff_copy(lower); aff = isl_aff_neg(aff); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, data->depth, 1); aff = isl_aff_add_constant_si(aff, 1); max = isl_set_max_val(data->domain, aff); isl_aff_free(aff); if (!max) goto error; if (isl_val_is_infty(max)) { isl_val_free(max); isl_aff_free(lower); return 0; } if (isl_val_cmp_si(max, INT_MAX) <= 0 && (!data->lower || isl_val_cmp_si(max, *data->n) < 0)) { isl_aff_free(data->lower); data->lower = lower; *data->n = isl_val_get_num_si(max); } else isl_aff_free(lower); isl_val_free(max); return 1; error: isl_aff_free(lower); return -1; } /* Check if we can use "c" as a lower bound and if it is better than * any previously found lower bound. */ static int constraint_find_unroll(__isl_take isl_constraint *c, void *user) { struct isl_find_unroll_data *data; int r; data = (struct isl_find_unroll_data *) user; r = update_unrolling_lower_bound(data, c); isl_constraint_free(c); return r; } /* Look for a lower bound l(i) on the dimension at "depth" * and a size n such that "domain" is a subset of * * { [i] : l(i) <= i_d < l(i) + n } * * where d is "depth" and l(i) depends only on earlier dimensions. * Furthermore, try and find a lower bound such that n is as small as possible. * In particular, "n" needs to be finite. * * Inner dimensions have been eliminated from "domain" by the caller. * * We first construct a collection of lower bounds on the input set * by computing its simple hull. We then iterate through them, * discarding those that we cannot use (either because they do not * involve the dimension at "depth" or because they have no corresponding * upper bound, meaning that "n" would be unbounded) and pick out the * best from the remaining ones. * * If we cannot find a suitable lower bound, then we consider that * to be an error. */ static __isl_give isl_aff *find_unroll_lower_bound(__isl_keep isl_set *domain, int depth, int *n) { struct isl_find_unroll_data data = { domain, depth, NULL, n }; isl_basic_set *hull; hull = isl_set_simple_hull(isl_set_copy(domain)); if (isl_basic_set_foreach_constraint(hull, &constraint_find_unroll, &data) < 0) goto error; isl_basic_set_free(hull); if (!data.lower) isl_die(isl_set_get_ctx(domain), isl_error_invalid, "cannot find lower bound for unrolling", return NULL); return data.lower; error: isl_basic_set_free(hull); return isl_aff_free(data.lower); } /* Return the constraint * * i_"depth" = aff + offset */ static __isl_give isl_constraint *at_offset(int depth, __isl_keep isl_aff *aff, int offset) { aff = isl_aff_copy(aff); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, depth, -1); aff = isl_aff_add_constant_si(aff, offset); return isl_equality_from_aff(aff); } /* Return a list of basic sets, one for each value of the current dimension * in "domain". * The divs that involve the current dimension have not been projected out * from this domain. * * Since we are going to be iterating over the individual values, * we first check if there are any strides on the current dimension. * If there is, we rewrite the current dimension i as * * i = stride i' + offset * * and then iterate over individual values of i' instead. * * We then look for a lower bound on i' and a size such that the domain * is a subset of * * { [j,i'] : l(j) <= i' < l(j) + n } * * and then take slices of the domain at values of i' * between l(j) and l(j) + n - 1. * * We compute the unshifted simple hull of each slice to ensure that * we have a single basic set per offset. The slicing constraint * may get simplified away before the unshifted simple hull is taken * and may therefore in some rare cases disappear from the result. * We therefore explicitly add the constraint back after computing * the unshifted simple hull to ensure that the basic sets * remain disjoint. The constraints that are dropped by taking the hull * will be taken into account at the next level, as in the case of the * atomic option. * * Finally, we map i' back to i and add each basic set to the list. */ static __isl_give isl_basic_set_list *do_unroll(__isl_take isl_set *domain, __isl_keep isl_ast_build *build) { int i, n; int depth; isl_ctx *ctx; isl_aff *lower; isl_basic_set_list *list; isl_multi_aff *expansion; isl_basic_map *bmap; if (!domain) return NULL; ctx = isl_set_get_ctx(domain); depth = isl_ast_build_get_depth(build); build = isl_ast_build_copy(build); domain = isl_ast_build_eliminate_inner(build, domain); build = isl_ast_build_detect_strides(build, isl_set_copy(domain)); expansion = isl_ast_build_get_stride_expansion(build); domain = isl_set_preimage_multi_aff(domain, isl_multi_aff_copy(expansion)); domain = isl_ast_build_eliminate_divs(build, domain); isl_ast_build_free(build); list = isl_basic_set_list_alloc(ctx, 0); lower = find_unroll_lower_bound(domain, depth, &n); if (!lower) list = isl_basic_set_list_free(list); bmap = isl_basic_map_from_multi_aff(expansion); for (i = 0; list && i < n; ++i) { isl_set *set; isl_basic_set *bset; isl_constraint *slice; slice = at_offset(depth, lower, i); set = isl_set_copy(domain); set = isl_set_add_constraint(set, isl_constraint_copy(slice)); bset = isl_set_unshifted_simple_hull(set); bset = isl_basic_set_add_constraint(bset, slice); bset = isl_basic_set_apply(bset, isl_basic_map_copy(bmap)); list = isl_basic_set_list_add(list, bset); } isl_aff_free(lower); isl_set_free(domain); isl_basic_map_free(bmap); return list; } /* Data structure for storing the results and the intermediate objects * of compute_domains. * * "list" is the main result of the function and contains a list * of disjoint basic sets for which code should be generated. * * "executed" and "build" are inputs to compute_domains. * "schedule_domain" is the domain of "executed". * * "option" constains the domains at the current depth that should by * atomic, separated or unrolled. These domains are as specified by * the user, except that inner dimensions have been eliminated and * that they have been made pair-wise disjoint. * * "sep_class" contains the user-specified split into separation classes * specialized to the current depth. * "done" contains the union of the separation domains that have already * been handled. * "atomic" contains the domain that has effectively been made atomic. * This domain may be larger than the intersection of option[atomic] * and the schedule domain. */ struct isl_codegen_domains { isl_basic_set_list *list; isl_union_map *executed; isl_ast_build *build; isl_set *schedule_domain; isl_set *option[3]; isl_map *sep_class; isl_set *done; isl_set *atomic; }; /* Add domains to domains->list for each individual value of the current * dimension, for that part of the schedule domain that lies in the * intersection of the option domain and the class domain. * * "domain" is the intersection of the class domain and the schedule domain. * The divs that involve the current dimension have not been projected out * from this domain. * * We first break up the unroll option domain into individual pieces * and then handle each of them separately. The unroll option domain * has been made disjoint in compute_domains_init_options, * * Note that we actively want to combine different pieces of the * schedule domain that have the same value at the current dimension. * We therefore need to break up the unroll option domain before * intersecting with class and schedule domain, hoping that the * unroll option domain specified by the user is relatively simple. */ static int compute_unroll_domains(struct isl_codegen_domains *domains, __isl_keep isl_set *domain) { isl_set *unroll_domain; isl_basic_set_list *unroll_list; int i, n; int empty; empty = isl_set_is_empty(domains->option[unroll]); if (empty < 0) return -1; if (empty) return 0; unroll_domain = isl_set_copy(domains->option[unroll]); unroll_list = isl_basic_set_list_from_set(unroll_domain); n = isl_basic_set_list_n_basic_set(unroll_list); for (i = 0; i < n; ++i) { isl_basic_set *bset; isl_basic_set_list *list; bset = isl_basic_set_list_get_basic_set(unroll_list, i); unroll_domain = isl_set_from_basic_set(bset); unroll_domain = isl_set_intersect(unroll_domain, isl_set_copy(domain)); empty = isl_set_is_empty(unroll_domain); if (empty >= 0 && empty) { isl_set_free(unroll_domain); continue; } list = do_unroll(unroll_domain, domains->build); domains->list = isl_basic_set_list_concat(domains->list, list); } isl_basic_set_list_free(unroll_list); return 0; } /* Try and construct a single basic set that includes the intersection of * the schedule domain, the atomic option domain and the class domain. * Add the resulting basic set(s) to domains->list and save a copy * in domains->atomic for use in compute_partial_domains. * * We construct a single domain rather than trying to combine * the schedule domains of individual domains because we are working * within a single component so that non-overlapping schedule domains * should already have been separated. * We do however need to make sure that this single domains is a subset * of the class domain so that it would not intersect with any other * class domains. This means that we may end up splitting up the atomic * domain in case separation classes are being used. * * "domain" is the intersection of the schedule domain and the class domain, * with inner dimensions projected out. */ static int compute_atomic_domain(struct isl_codegen_domains *domains, __isl_keep isl_set *class_domain) { isl_basic_set *bset; isl_basic_set_list *list; isl_set *domain; int empty; domain = isl_set_copy(domains->option[atomic]); domain = isl_set_intersect(domain, isl_set_copy(class_domain)); domain = isl_set_intersect(domain, isl_set_copy(domains->schedule_domain)); empty = isl_set_is_empty(domain); if (empty < 0 || empty) { domains->atomic = domain; return empty < 0 ? -1 : 0; } domain = isl_ast_build_eliminate(domains->build, domain); domain = isl_set_coalesce(domain); bset = isl_set_unshifted_simple_hull(domain); domain = isl_set_from_basic_set(bset); domains->atomic = isl_set_copy(domain); domain = isl_set_intersect(domain, isl_set_copy(class_domain)); domain = isl_set_make_disjoint(domain); list = isl_basic_set_list_from_set(domain); domains->list = isl_basic_set_list_concat(domains->list, list); return 0; } /* Split up the schedule domain into uniform basic sets, * in the sense that each element in a basic set is associated to * elements of the same domains, and add the result to domains->list. * Do this for that part of the schedule domain that lies in the * intersection of "class_domain" and the separate option domain. * * "class_domain" may or may not include the constraints * of the schedule domain, but this does not make a difference * since we are going to intersect it with the domain of the inverse schedule. * If it includes schedule domain constraints, then they may involve * inner dimensions, but we will eliminate them in separation_domain. */ static int compute_separate_domain(struct isl_codegen_domains *domains, __isl_keep isl_set *class_domain) { isl_space *space; isl_set *domain; isl_union_map *executed; isl_basic_set_list *list; int empty; domain = isl_set_copy(domains->option[separate]); domain = isl_set_intersect(domain, isl_set_copy(class_domain)); executed = isl_union_map_copy(domains->executed); executed = isl_union_map_intersect_domain(executed, isl_union_set_from_set(domain)); empty = isl_union_map_is_empty(executed); if (empty < 0 || empty) { isl_union_map_free(executed); return empty < 0 ? -1 : 0; } space = isl_set_get_space(class_domain); domain = separate_schedule_domains(space, executed, domains->build); list = isl_basic_set_list_from_set(domain); domains->list = isl_basic_set_list_concat(domains->list, list); return 0; } /* Split up the domain at the current depth into disjoint * basic sets for which code should be generated separately * for the given separation class domain. * * If any separation classes have been defined, then "class_domain" * is the domain of the current class and does not refer to inner dimensions. * Otherwise, "class_domain" is the universe domain. * * We first make sure that the class domain is disjoint from * previously considered class domains. * * The separate domains can be computed directly from the "class_domain". * * The unroll, atomic and remainder domains need the constraints * from the schedule domain. * * For unrolling, the actual schedule domain is needed (with divs that * may refer to the current dimension) so that stride detection can be * performed. * * For atomic and remainder domains, inner dimensions and divs involving * the current dimensions should be eliminated. * In case we are working within a separation class, we need to intersect * the result with the current "class_domain" to ensure that the domains * are disjoint from those generated from other class domains. * * The domain that has been made atomic may be larger than specified * by the user since it needs to be representable as a single basic set. * This possibly larger domain is stored in domains->atomic by * compute_atomic_domain. It is computed first so that the extended domain * would not overlap with any domains computed before. * * If anything is left after handling separate, unroll and atomic, * we split it up into basic sets and append the basic sets to domains->list. */ static int compute_partial_domains(struct isl_codegen_domains *domains, __isl_take isl_set *class_domain) { isl_basic_set_list *list; isl_set *domain; class_domain = isl_set_subtract(class_domain, isl_set_copy(domains->done)); domains->done = isl_set_union(domains->done, isl_set_copy(class_domain)); domain = isl_set_copy(class_domain); if (compute_atomic_domain(domains, class_domain) < 0) domain = isl_set_free(domain); domain = isl_set_subtract(domain, domains->atomic); if (compute_separate_domain(domains, domain) < 0) goto error; domain = isl_set_subtract(domain, isl_set_copy(domains->option[separate])); domain = isl_set_intersect(domain, isl_set_copy(domains->schedule_domain)); if (compute_unroll_domains(domains, domain) < 0) goto error; domain = isl_set_subtract(domain, isl_set_copy(domains->option[unroll])); domain = isl_ast_build_eliminate(domains->build, domain); domain = isl_set_intersect(domain, isl_set_copy(class_domain)); domain = isl_set_coalesce(domain); domain = isl_set_make_disjoint(domain); list = isl_basic_set_list_from_set(domain); domains->list = isl_basic_set_list_concat(domains->list, list); isl_set_free(class_domain); return 0; error: isl_set_free(domain); isl_set_free(class_domain); return -1; } /* Split up the domain at the current depth into disjoint * basic sets for which code should be generated separately * for the separation class identified by "pnt". * * We extract the corresponding class domain from domains->sep_class, * eliminate inner dimensions and pass control to compute_partial_domains. */ static int compute_class_domains(__isl_take isl_point *pnt, void *user) { struct isl_codegen_domains *domains = user; isl_set *class_set; isl_set *domain; int disjoint; class_set = isl_set_from_point(pnt); domain = isl_map_domain(isl_map_intersect_range( isl_map_copy(domains->sep_class), class_set)); domain = isl_ast_build_compute_gist(domains->build, domain); domain = isl_ast_build_eliminate(domains->build, domain); disjoint = isl_set_plain_is_disjoint(domain, domains->schedule_domain); if (disjoint < 0) return -1; if (disjoint) { isl_set_free(domain); return 0; } return compute_partial_domains(domains, domain); } /* Extract the domains at the current depth that should be atomic, * separated or unrolled and store them in option. * * The domains specified by the user might overlap, so we make * them disjoint by subtracting earlier domains from later domains. */ static void compute_domains_init_options(isl_set *option[3], __isl_keep isl_ast_build *build) { enum isl_ast_build_domain_type type, type2; for (type = atomic; type <= separate; ++type) { option[type] = isl_ast_build_get_option_domain(build, type); for (type2 = atomic; type2 < type; ++type2) option[type] = isl_set_subtract(option[type], isl_set_copy(option[type2])); } option[unroll] = isl_set_coalesce(option[unroll]); option[unroll] = isl_set_make_disjoint(option[unroll]); } /* Split up the domain at the current depth into disjoint * basic sets for which code should be generated separately, * based on the user-specified options. * Return the list of disjoint basic sets. * * There are three kinds of domains that we need to keep track of. * - the "schedule domain" is the domain of "executed" * - the "class domain" is the domain corresponding to the currrent * separation class * - the "option domain" is the domain corresponding to one of the options * atomic, unroll or separate * * We first consider the individial values of the separation classes * and split up the domain for each of them separately. * Finally, we consider the remainder. If no separation classes were * specified, then we call compute_partial_domains with the universe * "class_domain". Otherwise, we take the "schedule_domain" as "class_domain", * with inner dimensions removed. We do this because we want to * avoid computing the complement of the class domains (i.e., the difference * between the universe and domains->done). */ static __isl_give isl_basic_set_list *compute_domains( __isl_keep isl_union_map *executed, __isl_keep isl_ast_build *build) { struct isl_codegen_domains domains; isl_ctx *ctx; isl_set *domain; isl_union_set *schedule_domain; isl_set *classes; isl_space *space; int n_param; enum isl_ast_build_domain_type type; int empty; if (!executed) return NULL; ctx = isl_union_map_get_ctx(executed); domains.list = isl_basic_set_list_alloc(ctx, 0); schedule_domain = isl_union_map_domain(isl_union_map_copy(executed)); domain = isl_set_from_union_set(schedule_domain); compute_domains_init_options(domains.option, build); domains.sep_class = isl_ast_build_get_separation_class(build); classes = isl_map_range(isl_map_copy(domains.sep_class)); n_param = isl_set_dim(classes, isl_dim_param); classes = isl_set_project_out(classes, isl_dim_param, 0, n_param); space = isl_set_get_space(domain); domains.build = build; domains.schedule_domain = isl_set_copy(domain); domains.executed = executed; domains.done = isl_set_empty(space); if (isl_set_foreach_point(classes, &compute_class_domains, &domains) < 0) domains.list = isl_basic_set_list_free(domains.list); isl_set_free(classes); empty = isl_set_is_empty(domains.done); if (empty < 0) { domains.list = isl_basic_set_list_free(domains.list); domain = isl_set_free(domain); } else if (empty) { isl_set_free(domain); domain = isl_set_universe(isl_set_get_space(domains.done)); } else { domain = isl_ast_build_eliminate(build, domain); } if (compute_partial_domains(&domains, domain) < 0) domains.list = isl_basic_set_list_free(domains.list); isl_set_free(domains.schedule_domain); isl_set_free(domains.done); isl_map_free(domains.sep_class); for (type = atomic; type <= separate; ++type) isl_set_free(domains.option[type]); return domains.list; } /* Generate code for a single component, after shifting (if any) * has been applied. * * We first split up the domain at the current depth into disjoint * basic sets based on the user-specified options. * Then we generated code for each of them and concatenate the results. */ static __isl_give isl_ast_graft_list *generate_shifted_component( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { isl_basic_set_list *domain_list; isl_ast_graft_list *list = NULL; domain_list = compute_domains(executed, build); list = generate_parallel_domains(domain_list, executed, build); isl_basic_set_list_free(domain_list); isl_union_map_free(executed); isl_ast_build_free(build); return list; } struct isl_set_map_pair { isl_set *set; isl_map *map; }; /* Given an array "domain" of isl_set_map_pairs and an array "order" * of indices into the "domain" array, * return the union of the "map" fields of the elements * indexed by the first "n" elements of "order". */ static __isl_give isl_union_map *construct_component_executed( struct isl_set_map_pair *domain, int *order, int n) { int i; isl_map *map; isl_union_map *executed; map = isl_map_copy(domain[order[0]].map); executed = isl_union_map_from_map(map); for (i = 1; i < n; ++i) { map = isl_map_copy(domain[order[i]].map); executed = isl_union_map_add_map(executed, map); } return executed; } /* Generate code for a single component, after shifting (if any) * has been applied. * * The component inverse schedule is specified as the "map" fields * of the elements of "domain" indexed by the first "n" elements of "order". */ static __isl_give isl_ast_graft_list *generate_shifted_component_from_list( struct isl_set_map_pair *domain, int *order, int n, __isl_take isl_ast_build *build) { isl_union_map *executed; executed = construct_component_executed(domain, order, n); return generate_shifted_component(executed, build); } /* Does set dimension "pos" of "set" have an obviously fixed value? */ static int dim_is_fixed(__isl_keep isl_set *set, int pos) { int fixed; isl_val *v; v = isl_set_plain_get_val_if_fixed(set, isl_dim_set, pos); if (!v) return -1; fixed = !isl_val_is_nan(v); isl_val_free(v); return fixed; } /* Given an array "domain" of isl_set_map_pairs and an array "order" * of indices into the "domain" array, * do all (except for at most one) of the "set" field of the elements * indexed by the first "n" elements of "order" have a fixed value * at position "depth"? */ static int at_most_one_non_fixed(struct isl_set_map_pair *domain, int *order, int n, int depth) { int i; int non_fixed = -1; for (i = 0; i < n; ++i) { int f; f = dim_is_fixed(domain[order[i]].set, depth); if (f < 0) return -1; if (f) continue; if (non_fixed >= 0) return 0; non_fixed = i; } return 1; } /* Given an array "domain" of isl_set_map_pairs and an array "order" * of indices into the "domain" array, * eliminate the inner dimensions from the "set" field of the elements * indexed by the first "n" elements of "order", provided the current * dimension does not have a fixed value. * * Return the index of the first element in "order" with a corresponding * "set" field that does not have an (obviously) fixed value. */ static int eliminate_non_fixed(struct isl_set_map_pair *domain, int *order, int n, int depth, __isl_keep isl_ast_build *build) { int i; int base = -1; for (i = n - 1; i >= 0; --i) { int f; f = dim_is_fixed(domain[order[i]].set, depth); if (f < 0) return -1; if (f) continue; domain[order[i]].set = isl_ast_build_eliminate_inner(build, domain[order[i]].set); base = i; } return base; } /* Given an array "domain" of isl_set_map_pairs and an array "order" * of indices into the "domain" array, * find the element of "domain" (amongst those indexed by the first "n" * elements of "order") with the "set" field that has the smallest * value for the current iterator. * * Note that the domain with the smallest value may depend on the parameters * and/or outer loop dimension. Since the result of this function is only * used as heuristic, we only make a reasonable attempt at finding the best * domain, one that should work in case a single domain provides the smallest * value for the current dimension over all values of the parameters * and outer dimensions. * * In particular, we compute the smallest value of the first domain * and replace it by that of any later domain if that later domain * has a smallest value that is smaller for at least some value * of the parameters and outer dimensions. */ static int first_offset(struct isl_set_map_pair *domain, int *order, int n, __isl_keep isl_ast_build *build) { int i; isl_map *min_first; int first = 0; min_first = isl_ast_build_map_to_iterator(build, isl_set_copy(domain[order[0]].set)); min_first = isl_map_lexmin(min_first); for (i = 1; i < n; ++i) { isl_map *min, *test; int empty; min = isl_ast_build_map_to_iterator(build, isl_set_copy(domain[order[i]].set)); min = isl_map_lexmin(min); test = isl_map_copy(min); test = isl_map_apply_domain(isl_map_copy(min_first), test); test = isl_map_order_lt(test, isl_dim_in, 0, isl_dim_out, 0); empty = isl_map_is_empty(test); isl_map_free(test); if (empty >= 0 && !empty) { isl_map_free(min_first); first = i; min_first = min; } else isl_map_free(min); if (empty < 0) break; } isl_map_free(min_first); return i < n ? -1 : first; } /* Construct a shifted inverse schedule based on the original inverse schedule, * the stride and the offset. * * The original inverse schedule is specified as the "map" fields * of the elements of "domain" indexed by the first "n" elements of "order". * * "stride" and "offset" are such that the difference * between the values of the current dimension of domain "i" * and the values of the current dimension for some reference domain are * equal to * * stride * integer + offset[i] * * Moreover, 0 <= offset[i] < stride. * * For each domain, we create a map * * { [..., j, ...] -> [..., j - offset[i], offset[i], ....] } * * where j refers to the current dimension and the other dimensions are * unchanged, and apply this map to the original schedule domain. * * For example, for the original schedule * * { A[i] -> [2i]: 0 <= i < 10; B[i] -> [2i+1] : 0 <= i < 10 } * * and assuming the offset is 0 for the A domain and 1 for the B domain, * we apply the mapping * * { [j] -> [j, 0] } * * to the schedule of the "A" domain and the mapping * * { [j - 1] -> [j, 1] } * * to the schedule of the "B" domain. * * * Note that after the transformation, the differences between pairs * of values of the current dimension over all domains are multiples * of stride and that we have therefore exposed the stride. * * * To see that the mapping preserves the lexicographic order, * first note that each of the individual maps above preserves the order. * If the value of the current iterator is j1 in one domain and j2 in another, * then if j1 = j2, we know that the same map is applied to both domains * and the order is preserved. * Otherwise, let us assume, without loss of generality, that j1 < j2. * If c1 >= c2 (with c1 and c2 the corresponding offsets), then * * j1 - c1 < j2 - c2 * * and the order is preserved. * If c1 < c2, then we know * * 0 <= c2 - c1 < s * * We also have * * j2 - j1 = n * s + r * * with n >= 0 and 0 <= r < s. * In other words, r = c2 - c1. * If n > 0, then * * j1 - c1 < j2 - c2 * * If n = 0, then * * j1 - c1 = j2 - c2 * * and so * * (j1 - c1, c1) << (j2 - c2, c2) * * with "<<" the lexicographic order, proving that the order is preserved * in all cases. */ static __isl_give isl_union_map *contruct_shifted_executed( struct isl_set_map_pair *domain, int *order, int n, __isl_keep isl_val *stride, __isl_keep isl_multi_val *offset, __isl_take isl_ast_build *build) { int i; isl_union_map *executed; isl_space *space; isl_map *map; int depth; isl_constraint *c; depth = isl_ast_build_get_depth(build); space = isl_ast_build_get_space(build, 1); executed = isl_union_map_empty(isl_space_copy(space)); space = isl_space_map_from_set(space); map = isl_map_identity(isl_space_copy(space)); map = isl_map_eliminate(map, isl_dim_out, depth, 1); map = isl_map_insert_dims(map, isl_dim_out, depth + 1, 1); space = isl_space_insert_dims(space, isl_dim_out, depth + 1, 1); c = isl_equality_alloc(isl_local_space_from_space(space)); c = isl_constraint_set_coefficient_si(c, isl_dim_in, depth, 1); c = isl_constraint_set_coefficient_si(c, isl_dim_out, depth, -1); for (i = 0; i < n; ++i) { isl_map *map_i; isl_val *v; v = isl_multi_val_get_val(offset, i); if (!v) break; map_i = isl_map_copy(map); map_i = isl_map_fix_val(map_i, isl_dim_out, depth + 1, isl_val_copy(v)); v = isl_val_neg(v); c = isl_constraint_set_constant_val(c, v); map_i = isl_map_add_constraint(map_i, isl_constraint_copy(c)); map_i = isl_map_apply_domain(isl_map_copy(domain[order[i]].map), map_i); executed = isl_union_map_add_map(executed, map_i); } isl_constraint_free(c); isl_map_free(map); if (i < n) executed = isl_union_map_free(executed); return executed; } /* Generate code for a single component, after exposing the stride, * given that the schedule domain is "shifted strided". * * The component inverse schedule is specified as the "map" fields * of the elements of "domain" indexed by the first "n" elements of "order". * * The schedule domain being "shifted strided" means that the differences * between the values of the current dimension of domain "i" * and the values of the current dimension for some reference domain are * equal to * * stride * integer + offset[i] * * We first look for the domain with the "smallest" value for the current * dimension and adjust the offsets such that the offset of the "smallest" * domain is equal to zero. The other offsets are reduced modulo stride. * * Based on this information, we construct a new inverse schedule in * contruct_shifted_executed that exposes the stride. * Since this involves the introduction of a new schedule dimension, * the build needs to be changed accodingly. * After computing the AST, the newly introduced dimension needs * to be removed again from the list of grafts. We do this by plugging * in a mapping that represents the new schedule domain in terms of the * old schedule domain. */ static __isl_give isl_ast_graft_list *generate_shift_component( struct isl_set_map_pair *domain, int *order, int n, __isl_keep isl_val *stride, __isl_keep isl_multi_val *offset, __isl_take isl_ast_build *build) { isl_ast_graft_list *list; int first; int depth; isl_ctx *ctx; isl_val *val; isl_multi_val *mv; isl_space *space; isl_multi_aff *ma, *zero; isl_union_map *executed; ctx = isl_ast_build_get_ctx(build); depth = isl_ast_build_get_depth(build); first = first_offset(domain, order, n, build); if (first < 0) return isl_ast_build_free(build); mv = isl_multi_val_copy(offset); val = isl_multi_val_get_val(offset, first); val = isl_val_neg(val); mv = isl_multi_val_add_val(mv, val); mv = isl_multi_val_mod_val(mv, isl_val_copy(stride)); executed = contruct_shifted_executed(domain, order, n, stride, mv, build); space = isl_ast_build_get_space(build, 1); space = isl_space_map_from_set(space); ma = isl_multi_aff_identity(isl_space_copy(space)); space = isl_space_from_domain(isl_space_domain(space)); space = isl_space_add_dims(space, isl_dim_out, 1); zero = isl_multi_aff_zero(space); ma = isl_multi_aff_range_splice(ma, depth + 1, zero); build = isl_ast_build_insert_dim(build, depth + 1); list = generate_shifted_component(executed, build); list = isl_ast_graft_list_preimage_multi_aff(list, ma); isl_multi_val_free(mv); return list; } /* Generate code for a single component. * * The component inverse schedule is specified as the "map" fields * of the elements of "domain" indexed by the first "n" elements of "order". * * This function may modify the "set" fields of "domain". * * Before proceeding with the actual code generation for the component, * we first check if there are any "shifted" strides, meaning that * the schedule domains of the individual domains are all strided, * but that they have different offsets, resulting in the union * of schedule domains not being strided anymore. * * The simplest example is the schedule * * { A[i] -> [2i]: 0 <= i < 10; B[i] -> [2i+1] : 0 <= i < 10 } * * Both schedule domains are strided, but their union is not. * This function detects such cases and then rewrites the schedule to * * { A[i] -> [2i, 0]: 0 <= i < 10; B[i] -> [2i, 1] : 0 <= i < 10 } * * In the new schedule, the schedule domains have the same offset (modulo * the stride), ensuring that the union of schedule domains is also strided. * * * If there is only a single domain in the component, then there is * nothing to do. Similarly, if the current schedule dimension has * a fixed value for almost all domains then there is nothing to be done. * In particular, we need at least two domains where the current schedule * dimension does not have a fixed value. * Finally, if any of the options refer to the current schedule dimension, * then we bail out as well. It would be possible to reformulate the options * in terms of the new schedule domain, but that would introduce constraints * that separate the domains in the options and that is something we would * like to avoid. * * * To see if there is any shifted stride, we look at the differences * between the values of the current dimension in pairs of domains * for equal values of outer dimensions. These differences should be * of the form * * m x + r * * with "m" the stride and "r" a constant. Note that we cannot perform * this analysis on individual domains as the lower bound in each domain * may depend on parameters or outer dimensions and so the current dimension * itself may not have a fixed remainder on division by the stride. * * In particular, we compare the first domain that does not have an * obviously fixed value for the current dimension to itself and all * other domains and collect the offsets and the gcd of the strides. * If the gcd becomes one, then we failed to find shifted strides. * If the gcd is zero, then the differences were all fixed, meaning * that some domains had non-obviously fixed values for the current dimension. * If all the offsets are the same (for those domains that do not have * an obviously fixed value for the current dimension), then we do not * apply the transformation. * If none of the domains were skipped, then there is nothing to do. * If some of them were skipped, then if we apply separation, the schedule * domain should get split in pieces with a (non-shifted) stride. * * Otherwise, we apply a shift to expose the stride in * generate_shift_component. */ static __isl_give isl_ast_graft_list *generate_component( struct isl_set_map_pair *domain, int *order, int n, __isl_take isl_ast_build *build) { int i, d; int depth; isl_ctx *ctx; isl_map *map; isl_set *deltas; isl_val *gcd = NULL; isl_multi_val *mv; int fixed, skip; int base; isl_ast_graft_list *list; int res = 0; depth = isl_ast_build_get_depth(build); skip = n == 1; if (skip >= 0 && !skip) skip = at_most_one_non_fixed(domain, order, n, depth); if (skip >= 0 && !skip) skip = isl_ast_build_options_involve_depth(build); if (skip < 0) return isl_ast_build_free(build); if (skip) return generate_shifted_component_from_list(domain, order, n, build); base = eliminate_non_fixed(domain, order, n, depth, build); if (base < 0) return isl_ast_build_free(build); ctx = isl_ast_build_get_ctx(build); mv = isl_multi_val_zero(isl_space_set_alloc(ctx, 0, n)); fixed = 1; for (i = 0; i < n; ++i) { isl_val *r, *m; map = isl_map_from_domain_and_range( isl_set_copy(domain[order[base]].set), isl_set_copy(domain[order[i]].set)); for (d = 0; d < depth; ++d) map = isl_map_equate(map, isl_dim_in, d, isl_dim_out, d); deltas = isl_map_deltas(map); res = isl_set_dim_residue_class_val(deltas, depth, &m, &r); isl_set_free(deltas); if (res < 0) break; if (i == 0) gcd = m; else gcd = isl_val_gcd(gcd, m); if (isl_val_is_one(gcd)) { isl_val_free(r); break; } mv = isl_multi_val_set_val(mv, i, r); res = dim_is_fixed(domain[order[i]].set, depth); if (res < 0) break; if (res) continue; if (fixed && i > base) { isl_val *a, *b; a = isl_multi_val_get_val(mv, i); b = isl_multi_val_get_val(mv, base); if (isl_val_ne(a, b)) fixed = 0; isl_val_free(a); isl_val_free(b); } } if (res < 0 || !gcd) { isl_ast_build_free(build); list = NULL; } else if (i < n || fixed || isl_val_is_zero(gcd)) { list = generate_shifted_component_from_list(domain, order, n, build); } else { list = generate_shift_component(domain, order, n, gcd, mv, build); } isl_val_free(gcd); isl_multi_val_free(mv); return list; } /* Store both "map" itself and its domain in the * structure pointed to by *next and advance to the next array element. */ static int extract_domain(__isl_take isl_map *map, void *user) { struct isl_set_map_pair **next = user; (*next)->map = isl_map_copy(map); (*next)->set = isl_map_domain(map); (*next)++; return 0; } /* Internal data for any_scheduled_after. * * "depth" is the number of loops that have already been generated * "group_coscheduled" is a local copy of options->ast_build_group_coscheduled * "domain" is an array of set-map pairs corresponding to the different * iteration domains. The set is the schedule domain, i.e., the domain * of the inverse schedule, while the map is the inverse schedule itself. */ struct isl_any_scheduled_after_data { int depth; int group_coscheduled; struct isl_set_map_pair *domain; }; /* Is any element of domain "i" scheduled after any element of domain "j" * (for a common iteration of the first data->depth loops)? * * data->domain[i].set contains the domain of the inverse schedule * for domain "i", i.e., elements in the schedule domain. * * If data->group_coscheduled is set, then we also return 1 if there * is any pair of elements in the two domains that are scheduled together. */ static int any_scheduled_after(int i, int j, void *user) { struct isl_any_scheduled_after_data *data = user; int dim = isl_set_dim(data->domain[i].set, isl_dim_set); int pos; for (pos = data->depth; pos < dim; ++pos) { int follows; follows = isl_set_follows_at(data->domain[i].set, data->domain[j].set, pos); if (follows < -1) return -1; if (follows > 0) return 1; if (follows < 0) return 0; } return data->group_coscheduled; } /* Look for independent components at the current depth and generate code * for each component separately. The resulting lists of grafts are * merged in an attempt to combine grafts with identical guards. * * Code for two domains can be generated separately if all the elements * of one domain are scheduled before (or together with) all the elements * of the other domain. We therefore consider the graph with as nodes * the domains and an edge between two nodes if any element of the first * node is scheduled after any element of the second node. * If the ast_build_group_coscheduled is set, then we also add an edge if * there is any pair of elements in the two domains that are scheduled * together. * Code is then generated (by generate_component) * for each of the strongly connected components in this graph * in their topological order. * * Since the test is performed on the domain of the inverse schedules of * the different domains, we precompute these domains and store * them in data.domain. */ static __isl_give isl_ast_graft_list *generate_components( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { int i; isl_ctx *ctx = isl_ast_build_get_ctx(build); int n = isl_union_map_n_map(executed); struct isl_any_scheduled_after_data data; struct isl_set_map_pair *next; struct isl_tarjan_graph *g = NULL; isl_ast_graft_list *list = NULL; int n_domain = 0; data.domain = isl_calloc_array(ctx, struct isl_set_map_pair, n); if (!data.domain) goto error; n_domain = n; next = data.domain; if (isl_union_map_foreach_map(executed, &extract_domain, &next) < 0) goto error; if (!build) goto error; data.depth = isl_ast_build_get_depth(build); data.group_coscheduled = isl_options_get_ast_build_group_coscheduled(ctx); g = isl_tarjan_graph_init(ctx, n, &any_scheduled_after, &data); list = isl_ast_graft_list_alloc(ctx, 0); i = 0; while (list && n) { isl_ast_graft_list *list_c; int first = i; if (g->order[i] == -1) isl_die(ctx, isl_error_internal, "cannot happen", goto error); ++i; --n; while (g->order[i] != -1) { ++i; --n; } list_c = generate_component(data.domain, g->order + first, i - first, isl_ast_build_copy(build)); list = isl_ast_graft_list_merge(list, list_c, build); ++i; } if (0) error: list = isl_ast_graft_list_free(list); isl_tarjan_graph_free(g); for (i = 0; i < n_domain; ++i) { isl_map_free(data.domain[i].map); isl_set_free(data.domain[i].set); } free(data.domain); isl_union_map_free(executed); isl_ast_build_free(build); return list; } /* Generate code for the next level (and all inner levels). * * If "executed" is empty, i.e., no code needs to be generated, * then we return an empty list. * * If we have already generated code for all loop levels, then we pass * control to generate_inner_level. * * If "executed" lives in a single space, i.e., if code needs to be * generated for a single domain, then there can only be a single * component and we go directly to generate_shifted_component. * Otherwise, we call generate_components to detect the components * and to call generate_component on each of them separately. */ static __isl_give isl_ast_graft_list *generate_next_level( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build) { int depth; if (!build || !executed) goto error; if (isl_union_map_is_empty(executed)) { isl_ctx *ctx = isl_ast_build_get_ctx(build); isl_union_map_free(executed); isl_ast_build_free(build); return isl_ast_graft_list_alloc(ctx, 0); } depth = isl_ast_build_get_depth(build); if (depth >= isl_set_dim(build->domain, isl_dim_set)) return generate_inner_level(executed, build); if (isl_union_map_n_map(executed) == 1) return generate_shifted_component(executed, build); return generate_components(executed, build); error: isl_union_map_free(executed); isl_ast_build_free(build); return NULL; } /* Internal data structure used by isl_ast_build_ast_from_schedule. * internal, executed and build are the inputs to generate_code. * list collects the output. */ struct isl_generate_code_data { int internal; isl_union_map *executed; isl_ast_build *build; isl_ast_graft_list *list; }; /* Given an inverse schedule in terms of the external build schedule, i.e., * * [E -> S] -> D * * with E the external build schedule and S the additional schedule "space", * reformulate the inverse schedule in terms of the internal schedule domain, * i.e., return * * [I -> S] -> D * * We first obtain a mapping * * I -> E * * take the inverse and the product with S -> S, resulting in * * [I -> S] -> [E -> S] * * Applying the map to the input produces the desired result. */ static __isl_give isl_union_map *internal_executed( __isl_take isl_union_map *executed, __isl_keep isl_space *space, __isl_keep isl_ast_build *build) { isl_map *id, *proj; proj = isl_ast_build_get_schedule_map(build); proj = isl_map_reverse(proj); space = isl_space_map_from_set(isl_space_copy(space)); id = isl_map_identity(space); proj = isl_map_product(proj, id); executed = isl_union_map_apply_domain(executed, isl_union_map_from_map(proj)); return executed; } /* Generate an AST that visits the elements in the range of data->executed * in the relative order specified by the corresponding image element(s) * for those image elements that belong to "set". * Add the result to data->list. * * The caller ensures that "set" is a universe domain. * "space" is the space of the additional part of the schedule. * It is equal to the space of "set" if build->domain is parametric. * Otherwise, it is equal to the range of the wrapped space of "set". * * If the build space is not parametric and if isl_ast_build_ast_from_schedule * was called from an outside user (data->internal not set), then * the (inverse) schedule refers to the external build domain and needs to * be transformed to refer to the internal build domain. * * The build is extended to include the additional part of the schedule. * If the original build space was not parametric, then the options * in data->build refer only to the additional part of the schedule * and they need to be adjusted to refer to the complete AST build * domain. * * After having adjusted inverse schedule and build, we start generating * code with the outer loop of the current code generation * in generate_next_level. * * If the original build space was not parametric, we undo the embedding * on the resulting isl_ast_node_list so that it can be used within * the outer AST build. */ static int generate_code_in_space(struct isl_generate_code_data *data, __isl_take isl_set *set, __isl_take isl_space *space) { isl_union_map *executed; isl_ast_build *build; isl_ast_graft_list *list; int embed; executed = isl_union_map_copy(data->executed); executed = isl_union_map_intersect_domain(executed, isl_union_set_from_set(set)); embed = !isl_set_is_params(data->build->domain); if (embed && !data->internal) executed = internal_executed(executed, space, data->build); build = isl_ast_build_copy(data->build); build = isl_ast_build_product(build, space); list = generate_next_level(executed, build); list = isl_ast_graft_list_unembed(list, embed); data->list = isl_ast_graft_list_concat(data->list, list); return 0; } /* Generate an AST that visits the elements in the range of data->executed * in the relative order specified by the corresponding domain element(s) * for those domain elements that belong to "set". * Add the result to data->list. * * The caller ensures that "set" is a universe domain. * * If the build space S is not parametric, then the space of "set" * need to be a wrapped relation with S as domain. That is, it needs * to be of the form * * [S -> T] * * Check this property and pass control to generate_code_in_space * passing along T. * If the build space is not parametric, then T is the space of "set". */ static int generate_code_set(__isl_take isl_set *set, void *user) { struct isl_generate_code_data *data = user; isl_space *space, *build_space; int is_domain; space = isl_set_get_space(set); if (isl_set_is_params(data->build->domain)) return generate_code_in_space(data, set, space); build_space = isl_ast_build_get_space(data->build, data->internal); space = isl_space_unwrap(space); is_domain = isl_space_is_domain(build_space, space); isl_space_free(build_space); space = isl_space_range(space); if (is_domain < 0) goto error; if (!is_domain) isl_die(isl_set_get_ctx(set), isl_error_invalid, "invalid nested schedule space", goto error); return generate_code_in_space(data, set, space); error: isl_set_free(set); isl_space_free(space); return -1; } /* Generate an AST that visits the elements in the range of "executed" * in the relative order specified by the corresponding domain element(s). * * "build" is an isl_ast_build that has either been constructed by * isl_ast_build_from_context or passed to a callback set by * isl_ast_build_set_create_leaf. * In the first case, the space of the isl_ast_build is typically * a parametric space, although this is currently not enforced. * In the second case, the space is never a parametric space. * If the space S is not parametric, then the domain space(s) of "executed" * need to be wrapped relations with S as domain. * * If the domain of "executed" consists of several spaces, then an AST * is generated for each of them (in arbitrary order) and the results * are concatenated. * * If "internal" is set, then the domain "S" above refers to the internal * schedule domain representation. Otherwise, it refers to the external * representation, as returned by isl_ast_build_get_schedule_space. * * We essentially run over all the spaces in the domain of "executed" * and call generate_code_set on each of them. */ static __isl_give isl_ast_graft_list *generate_code( __isl_take isl_union_map *executed, __isl_take isl_ast_build *build, int internal) { isl_ctx *ctx; struct isl_generate_code_data data = { 0 }; isl_space *space; isl_union_set *schedule_domain; isl_union_map *universe; if (!build) goto error; space = isl_ast_build_get_space(build, 1); space = isl_space_align_params(space, isl_union_map_get_space(executed)); space = isl_space_align_params(space, isl_union_map_get_space(build->options)); build = isl_ast_build_align_params(build, isl_space_copy(space)); executed = isl_union_map_align_params(executed, space); if (!executed || !build) goto error; ctx = isl_ast_build_get_ctx(build); data.internal = internal; data.executed = executed; data.build = build; data.list = isl_ast_graft_list_alloc(ctx, 0); universe = isl_union_map_universe(isl_union_map_copy(executed)); schedule_domain = isl_union_map_domain(universe); if (isl_union_set_foreach_set(schedule_domain, &generate_code_set, &data) < 0) data.list = isl_ast_graft_list_free(data.list); isl_union_set_free(schedule_domain); isl_union_map_free(executed); isl_ast_build_free(build); return data.list; error: isl_union_map_free(executed); isl_ast_build_free(build); return NULL; } /* Generate an AST that visits the elements in the domain of "schedule" * in the relative order specified by the corresponding image element(s). * * "build" is an isl_ast_build that has either been constructed by * isl_ast_build_from_context or passed to a callback set by * isl_ast_build_set_create_leaf. * In the first case, the space of the isl_ast_build is typically * a parametric space, although this is currently not enforced. * In the second case, the space is never a parametric space. * If the space S is not parametric, then the range space(s) of "schedule" * need to be wrapped relations with S as domain. * * If the range of "schedule" consists of several spaces, then an AST * is generated for each of them (in arbitrary order) and the results * are concatenated. * * We first initialize the local copies of the relevant options. * We do this here rather than when the isl_ast_build is created * because the options may have changed between the construction * of the isl_ast_build and the call to isl_generate_code. * * The main computation is performed on an inverse schedule (with * the schedule domain in the domain and the elements to be executed * in the range) called "executed". */ __isl_give isl_ast_node *isl_ast_build_ast_from_schedule( __isl_keep isl_ast_build *build, __isl_take isl_union_map *schedule) { isl_ast_graft_list *list; isl_ast_node *node; isl_union_map *executed; build = isl_ast_build_copy(build); build = isl_ast_build_set_single_valued(build, 0); executed = isl_union_map_reverse(schedule); list = generate_code(executed, isl_ast_build_copy(build), 0); node = isl_ast_node_from_graft_list(list, build); isl_ast_build_free(build); return node; } cloog-0.18.2/isl/doc/0000775000175000017500000000000012254314447011252 500000000000000cloog-0.18.2/isl/doc/chicago.bst0000664000175000017500000011474212254313240013300 00000000000000%%% ==================================================================== %%% @BibTeX-style-file{ %%% author = "Glenn Paulley", %%% version = "4", %%% date = "28 August 1992", %%% time = "10:23:39 199", %%% filename = "chicago.bst", %%% address = "Data Structuring Group %%% Department of Computer Science %%% University of Waterloo %%% Waterloo, Ontario, Canada %%% N2L 3G1", %%% telephone = "(519) 885-1211", %%% FAX = "(519) 885-1208", %%% checksum = "26323 1654 5143 37417", %%% email = "gnpaulle@bluebox.uwaterloo.ca", %%% codetable = "ISO/ASCII", %%% keywords = "", %%% supported = "yes", %%% abstract = "A BibTeX bibliography style that follows the %%% `B' reference style of the 13th Edition of %%% the Chicago Manual of Style. A detailed %%% feature list is given below.", %%% docstring = "The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== % % "Chicago" BibTeX style, chicago.bst % =================================== % % BibTeX `chicago' style file for BibTeX version 0.99c, LaTeX version 2.09 % Place it in a file called chicago.bst in the BibTeX search path. % You need to include chicago.sty as a \documentstyle option. % (Placing it in the same directory as the LaTeX document should also work.) % This "chicago" style is based on newapa.bst (American Psych. Assoc.) % found at ymir.claremont.edu. % % Citation format: (author-last-name year) % (author-last-name and author-last-name year) % (author-last-name, author-last-name, and author-last-name year) % (author-last-name et al. year) % (author-last-name) % author-last-name (year) % (author-last-name and author-last-name) % (author-last-name et al.) % (year) or (year,year) % year or year,year % % Reference list ordering: alphabetical by author or whatever passes % for author in the absence of one. % % This BibTeX style has support for abbreviated author lists and for % year-only citations. This is done by having the citations % actually look like % % \citeauthoryear{full-author-info}{abbrev-author-info}{year} % % The LaTeX style has to have the following (or similar) % % \let\@internalcite\cite % \def\fullcite{\def\citeauthoryear##1##2##3{##1, ##3}\@internalcite} % \def\fullciteA{\def\citeauthoryear##1##2##3{##1}\@internalcite} % \def\shortcite{\def\citeauthoryear##1##2##3{##2, ##3}\@internalcite} % \def\shortciteA{\def\citeauthoryear##1##2##3{##2}\@internalcite} % \def\citeyear{\def\citeauthoryear##1##2##3{##3}\@internalcite} % % These TeX macro definitions are found in chicago.sty. Additional % commands to manipulate different components of a citation can be defined % so that, for example, you can list author's names without parentheses % if using a citation as a noun or object in a sentence. % % This file was originally copied from newapa.bst at ymir.claremont.edu. % % Features of chicago.bst: % ======================= % % - full names used in citations, but abbreviated citations are available % (see above) % - if an entry has a "month", then the month and year are also printed % as part of that bibitem. % - all conjunctions use "and" instead of "\&" % - major modification from Chicago Manual of Style (13th ed.) is that % only the first author in a reference appears last name first- % additional authors appear as J. Q. Public. % - pages are listed as "pp. xx-xx" in all entry types except % article entries. % - book, inbook, and manual use "location: publisher" (or organization) % for address and publisher. All other types list publishers separately. % - "pp." are used to identify page numbers for all entry types except % articles. % - organization is used as a citation label if neither author nor editor % is present (for manuals). % - "et al." is used for long author and editor lists, or when "others" % is used. % % Modifications and bug fixes from newapa.bst: % =========================================== % % - added month, year to bib entries if month is present % - fixed bug with In proceedings, added necessary comma after title % - all conjunctions changed to "and" from "\&" % - fixed bug with author labels in my.full.label: "et al." now is % generated when "others" is an author name % - major modification from Chicago Manual of Style (13th ed.) is that % only the first author in a reference appears last name first- % additional authors appear as J. Q. Public. % - pages are listed as "pp. xx-xx" in all entry types except % article entries. Unnecessary (IMHO) "()" around page numbers % were removed, and page numbers now don't end with a period. % - created chicago.sty for use with this bibstyle (required). % - fixed bugs in FUNCTION {format.vol.num.pages} for missing volume, % number, and /or pages. Renamed to format.jour.vol. % - fixed bug in formatting booktitles: additional period an error if % book has a volume. % - fixed bug: editors usually given redundant period before next clause % (format.editors.dot) removed. % - added label support for organizations, if both author and editor % are missing (from alpha.bst). If organization is too long, then % the key field is used for abbreviated citations. % - In proceedings or books of several volumes, no comma was written % between the "Volume x" and the page numbers (this was intentional % in newapa.bst). Fixed. % - Some journals may not have volumes/numbers, only month/year (eg. % IEEE Computer). Fixed bug in article style that assumed volume/number % was always present. % % Original documentation for newapa.sty: % ===================================== % % This version was made by modifying the master file made by % Oren Patashnik (PATASHNIK@SCORE.STANFORD.EDU), and the 'named' BibTeX % style of Peter F. Patel-Schneider. % % Copyright (C) 1985, all rights reserved. % Copying of this file is authorized only if either % (1) you make absolutely no changes to your copy, including name, or % (2) if you do make changes, you name it something other than 'newapa.bst'. % There are undoubtably bugs in this style. If you make bug fixes, % improvements, etc. please let me know. My e-mail address is: % spencer@cgrg.ohio.state.edu or 71160.3141@compuserve.com % % This style was made from 'plain.bst', 'named.bst', and 'apalike.bst', % with lots of tweaking to make it look like APA style, along with tips % from Young Ryu and Brian Reiser's modifications of 'apalike.bst'. ENTRY { address author booktitle chapter edition editor fjournal howpublished institution journal key month note number organization pages publisher school series title type volume year } {} { label.year extra.label sort.year sort.label } INTEGERS { output.state before.all mid.sentence after.sentence after.block } FUNCTION {init.state.consts} { #0 'before.all := #1 'mid.sentence := #2 'after.sentence := #3 'after.block := } STRINGS { s t u } FUNCTION {output.nonnull} { 's := output.state mid.sentence = { ", " * write$ } { output.state after.block = { add.period$ write$ newline$ "\newblock " write$ } { output.state before.all = 'write$ { add.period$ " " * write$ } if$ } if$ mid.sentence 'output.state := } if$ s } % Use a colon to separate output. Used only for address/publisher % combination in book/inbook types, address/institution for manuals, % and organization:publisher for proceedings (inproceedings). % FUNCTION {output.nonnull.colon} { 's := output.state mid.sentence = { ": " * write$ } { output.state after.block = { add.period$ write$ newline$ "\newblock " write$ } { output.state before.all = 'write$ { add.period$ " " * write$ } if$ } if$ mid.sentence 'output.state := } if$ s } FUNCTION {output} { duplicate$ empty$ 'pop$ 'output.nonnull if$ } FUNCTION {output.colon} { duplicate$ empty$ 'pop$ 'output.nonnull.colon if$ } FUNCTION {output.check} { 't := duplicate$ empty$ { pop$ "empty " t * " in " * cite$ * warning$ } 'output.nonnull if$ } FUNCTION {output.check.colon} { 't := duplicate$ empty$ { pop$ "empty " t * " in " * cite$ * warning$ } 'output.nonnull.colon if$ } FUNCTION {output.year.check} { year empty$ { "empty year in " cite$ * warning$ } { write$ " (" year * extra.label * month empty$ { ")" * } { ", " * month * ")" * } if$ mid.sentence 'output.state := } if$ } FUNCTION {fin.entry} { add.period$ write$ newline$ } FUNCTION {new.block} { output.state before.all = 'skip$ { after.block 'output.state := } if$ } FUNCTION {new.sentence} { output.state after.block = 'skip$ { output.state before.all = 'skip$ { after.sentence 'output.state := } if$ } if$ } FUNCTION {not} { { #0 } { #1 } if$ } FUNCTION {and} { 'skip$ { pop$ #0 } if$ } FUNCTION {or} { { pop$ #1 } 'skip$ if$ } FUNCTION {new.block.checka} { empty$ 'skip$ 'new.block if$ } FUNCTION {new.block.checkb} { empty$ swap$ empty$ and 'skip$ 'new.block if$ } FUNCTION {new.sentence.checka} { empty$ 'skip$ 'new.sentence if$ } FUNCTION {new.sentence.checkb} { empty$ swap$ empty$ and 'skip$ 'new.sentence if$ } FUNCTION {field.or.null} { duplicate$ empty$ { pop$ "" } 'skip$ if$ } % % Emphasize the top string on the stack. % FUNCTION {emphasize} { duplicate$ empty$ { pop$ "" } { "{\em " swap$ * "}" * } if$ } % % Emphasize the top string on the stack, but add a trailing space. % FUNCTION {emphasize.space} { duplicate$ empty$ { pop$ "" } { "{\em " swap$ * "\/}" * } if$ } INTEGERS { nameptr namesleft numnames } % % Format bibliographical entries with the first author last name first, % and subsequent authors with initials followed by last name. % All names are formatted in this routine. % FUNCTION {format.names} { 's := #1 'nameptr := % nameptr = 1; s num.names$ 'numnames := % numnames = num.name$(s); numnames 'namesleft := { namesleft #0 > } { nameptr #1 = {s nameptr "{vv~}{ll}{, jj}{, f.}" format.name$ 't := } {s nameptr "{f.~}{vv~}{ll}{, jj}" format.name$ 't := } if$ nameptr #1 > { namesleft #1 > { ", " * t * } { numnames #2 > { "," * } 'skip$ if$ t "others" = { " et~al." * } { " and " * t * } % from Chicago Manual of Style if$ } if$ } 't if$ s nameptr "{vv~}{ll}{, jj}{, f.}" format.name$ 't := "\protect \index {" * t * "|hyperemph}" * nameptr #1 + 'nameptr := % nameptr += 1; namesleft #1 - 'namesleft := % namesleft =- 1; } while$ } FUNCTION {my.full.label} { 's := #1 'nameptr := % nameptr = 1; s num.names$ 'numnames := % numnames = num.name$(s); numnames 'namesleft := { namesleft #0 > } { s nameptr "{vv~}{ll}" format.name$ 't := % get the next name nameptr #1 > { namesleft #1 > { ", " * t * } { numnames #2 > { "," * } 'skip$ if$ t "others" = { " et~al." * } { " and " * t * } % from Chicago Manual of Style if$ } if$ } 't if$ s nameptr "{vv~}{ll}{, jj}{, f.}" format.name$ 't := "\protect \index {" * t * "|bold}" * nameptr #1 + 'nameptr := % nameptr += 1; namesleft #1 - 'namesleft := % namesleft =- 1; } while$ } FUNCTION {format.names.fml} % % Format names in "familiar" format, with first initial followed by % last name. Like format.names, ALL names are formatted. % { 's := #1 'nameptr := % nameptr = 1; s num.names$ 'numnames := % numnames = num.name$(s); numnames 'namesleft := { namesleft #0 > } { s nameptr "{f.~}{vv~}{ll}{, jj}" format.name$ 't := nameptr #1 > { namesleft #1 > { ", " * t * } { numnames #2 > { "," * } 'skip$ if$ t "others" = { " et~al." * } { " and " * t * } % { " \& " * t * } if$ } if$ } 't if$ nameptr #1 + 'nameptr := % nameptr += 1; namesleft #1 - 'namesleft := % namesleft =- 1; } while$ } FUNCTION {format.authors} { author empty$ { "" } { author format.names } if$ } FUNCTION {format.key} { empty$ { key field.or.null } { "" } if$ } % % Format editor names for use in the "in" types: inbook, incollection, % inproceedings: first initial, then last names. When editors are the % LABEL for an entry, then format.editor is used which lists editors % by last name first. % FUNCTION {format.editors.fml} { editor empty$ { "" } { editor format.names.fml editor num.names$ #1 > { " (Eds.)" * } { " (Ed.)" * } if$ } if$ } % % Format editor names for use in labels, last names first. % FUNCTION {format.editors} { editor empty$ { "" } { editor format.names editor num.names$ #1 > { " (Eds.)" * } { " (Ed.)" * } if$ } if$ } FUNCTION {format.title} { title empty$ { "" } { title "t" change.case$ } if$ } % Note that the APA style requres case changes % in article titles. The following does not % change cases. If you perfer it, uncomment the % following and comment out the above. %FUNCTION {format.title} %{ title empty$ % { "" } % { title } % if$ %} FUNCTION {n.dashify} { 't := "" { t empty$ not } { t #1 #1 substring$ "-" = { t #1 #2 substring$ "--" = not { "--" * t #2 global.max$ substring$ 't := } { { t #1 #1 substring$ "-" = } { "-" * t #2 global.max$ substring$ 't := } while$ } if$ } { t #1 #1 substring$ * t #2 global.max$ substring$ 't := } if$ } while$ } FUNCTION {format.btitle} { edition empty$ { title emphasize } { title empty$ { title emphasize } { volume empty$ % gnp - check for volume, then don't need period { "{\em " title * "\/} (" * edition * " ed.)" * "." * } { "{\em " title * "\/} (" * edition * " ed.)" * } if$ } if$ } if$ } FUNCTION {format.emphasize.booktitle} { edition empty$ { booktitle emphasize } { booktitle empty$ { booktitle emphasize } { volume empty$ % gnp - extra period an error if book has a volume { "{\em " booktitle * "\/} (" * edition * " ed.)" * "." *} { "{\em " booktitle * "\/} (" * edition * " ed.)" * } if$ } if$ } if$ } FUNCTION {tie.or.space.connect} { duplicate$ text.length$ #3 < { "~" } { " " } if$ swap$ * * } FUNCTION {either.or.check} { empty$ 'pop$ { "can't use both " swap$ * " fields in " * cite$ * warning$ } if$ } FUNCTION {format.bvolume} { volume empty$ { "" } { "Volume" volume tie.or.space.connect % gnp - changed to mixed case series empty$ 'skip$ { " of " * series emphasize * } if$ "volume and number" number either.or.check } if$ } FUNCTION {format.number.series} { volume empty$ { number empty$ { series field.or.null } { output.state mid.sentence = { "Number" } % gnp - changed to mixed case always { "Number" } if$ number tie.or.space.connect series empty$ { "there's a number but no series in " cite$ * warning$ } { " in " * series * } if$ } if$ } { "" } if$ } INTEGERS { multiresult } FUNCTION {multi.page.check} { 't := #0 'multiresult := { multiresult not t empty$ not and } { t #1 #1 substring$ duplicate$ "-" = swap$ duplicate$ "," = swap$ "+" = or or { #1 'multiresult := } { t #2 global.max$ substring$ 't := } if$ } while$ multiresult } FUNCTION {format.pages} { pages empty$ { "" } { pages multi.page.check { "pp.\ " pages n.dashify tie.or.space.connect } % gnp - removed () { "pp.\ " pages tie.or.space.connect } if$ } if$ } % By Young (and Spencer) % GNP - fixed bugs with missing volume, number, and/or pages % % Format journal, volume, number, pages for article types. % FUNCTION {format.jour.vol} { fjournal empty$ { journal empty$ { "no journal in " cite$ * warning$ "" } { journal emphasize.space } if$ } { fjournal emphasize.space } if$ number empty$ { volume empty$ { "no number and no volume in " cite$ * warning$ "" * } { "~{\em " * Volume * "}" * } if$ } { volume empty$ {"no volume for " cite$ * warning$ "~(" * number * ")" * } { "~" * volume emphasize.space "(" * number * ")" * * } if$ } if$ pages empty$ {"page numbers missing in " cite$ * warning$ "" * } % gnp - place a null string on the stack for output { duplicate$ empty$ { pop$ format.pages } { ", " * pages n.dashify * } % gnp - removed pp. for articles if$ } if$ } FUNCTION {format.chapter.pages} { chapter empty$ 'format.pages { type empty$ { "Chapter" } % gnp - changed to mixed case { type "t" change.case$ } if$ chapter tie.or.space.connect pages empty$ {"page numbers missing in " cite$ * warning$} % gnp - added check { ", " * format.pages * } if$ } if$ } FUNCTION {format.in.ed.booktitle} { booktitle empty$ { "" } { editor empty$ { "In " format.emphasize.booktitle * } { "In " format.editors.fml * ", " * format.emphasize.booktitle * } if$ } if$ } FUNCTION {format.thesis.type} { type empty$ 'skip$ { pop$ type "t" change.case$ } if$ } FUNCTION {format.tr.number} { type empty$ { "Technical Report" } 'type if$ number empty$ { "t" change.case$ } { number tie.or.space.connect } if$ } FUNCTION {format.article.crossref} { "See" "\citeN{" * crossref * "}" * } FUNCTION {format.crossref.editor} { editor #1 "{vv~}{ll}" format.name$ editor num.names$ duplicate$ #2 > { pop$ " et~al." * } { #2 < 'skip$ { editor #2 "{ff }{vv }{ll}{ jj}" format.name$ "others" = { " et~al." * } { " and " * editor #2 "{vv~}{ll}" format.name$ * } if$ } if$ } if$ } FUNCTION {format.book.crossref} { volume empty$ { "empty volume in " cite$ * "'s crossref of " * crossref * warning$ "In " } { "Volume" volume tie.or.space.connect % gnp - changed to mixed case " of " * } if$ editor empty$ editor field.or.null author field.or.null = or { key empty$ { series empty$ { "need editor, key, or series for " cite$ * " to crossref " * crossref * warning$ "" * } { "{\em " * series * "\/}" * } if$ } { key * } if$ } { format.crossref.editor * } if$ " \citeN{" * crossref * "}" * } FUNCTION {format.incoll.inproc.crossref} { "See" " \citeN{" * crossref * "}" * } % format.lab.names: % % determines "short" names for the abbreviated author information. % "Long" labels are created in calc.label, using the routine my.full.label % to format author and editor fields. % % There are 4 cases for labels. (n=3 in the example) % a) one author Foo % b) one to n Foo, Bar and Baz % c) use of "and others" Foo, Bar et al. % d) more than n Foo et al. % FUNCTION {format.lab.names} { 's := s num.names$ 'numnames := numnames #2 > % change number to number of others allowed before % forcing "et al". { s #1 "{vv~}{ll}" format.name$ "\protect \index {" * s #1 "{vv~}{ll}{, jj}{, f.}" format.name$ * "}" * "\protect\chicagoetal/" * } { numnames #1 - 'namesleft := #2 'nameptr := s #1 "{vv~}{ll}" format.name$ "\protect \index {" * s #1 "{vv~}{ll}{, jj}{, f.}" format.name$ * "}" * { namesleft #0 > } { nameptr numnames = { s nameptr "{ff }{vv }{ll}{ jj}" format.name$ "others" = { "\protect\chicagoetal/" * } { "\protect\chicagoand/" * s nameptr "{vv~}{ll}" format.name$ * "\protect \index {" * s nameptr "{vv~}{ll}{, jj}{, f.}" format.name$ * "}" * } if$ } { ", " * s nameptr "{vv~}{ll}" format.name$ * } if$ nameptr #1 + 'nameptr := namesleft #1 - 'namesleft := } while$ } if$ } FUNCTION {author.key.label} { author empty$ { key empty$ { "no key, author in " cite$ * warning$ cite$ #1 #3 substring$ } 'key if$ } { author format.lab.names } if$ } FUNCTION {editor.key.label} { editor empty$ { key empty$ { "no key, editor in " cite$ * warning$ cite$ #1 #3 substring$ } 'key if$ } { editor format.lab.names } if$ } FUNCTION {author.key.organization.label} % % added - gnp. Provide label formatting by organization if author is null. % { author empty$ { organization empty$ { key empty$ { "no key, author or organization in " cite$ * warning$ cite$ #1 #3 substring$ } 'key if$ } { organization } if$ } { author format.lab.names } if$ } FUNCTION {editor.key.organization.label} % % added - gnp. Provide label formatting by organization if editor is null. % { editor empty$ { organization empty$ { key empty$ { "no key, editor or organization in " cite$ * warning$ cite$ #1 #3 substring$ } 'key if$ } { organization } if$ } { editor format.lab.names } if$ } FUNCTION {author.editor.key.label} { author empty$ { editor empty$ { key empty$ { "no key, author, or editor in " cite$ * warning$ cite$ #1 #3 substring$ } 'key if$ } { editor format.lab.names } if$ } { author format.lab.names } if$ } FUNCTION {calc.label.orig} % % Changed - GNP. See also author.organization.sort, editor.organization.sort % Form label for BibTeX entry. The classification of which fields are used % for which type of entry (book, inbook, etc.) are taken from alpha.bst. % The change here from newapa is to also include organization as a % citation label if author or editor is missing. % { type$ "book" = type$ "inbook" = or 'author.editor.key.label { type$ "proceedings" = 'editor.key.organization.label { type$ "manual" = 'author.key.organization.label 'author.key.label if$ } if$ } if$ author empty$ % generate the full label citation information. { editor empty$ { organization empty$ { "no author, editor, or organization in " cite$ * warning$ "??" } { organization } if$ } { editor my.full.label } if$ } { author.key.label } if$ % leave label on the stack, to be popped when required. "}{" * swap$ * % year field.or.null purify$ #-1 #4 substring$ * % % save the year for sort processing afterwards (adding a, b, c, etc.) % year field.or.null purify$ #-1 #4 substring$ 'label.year := } FUNCTION {calc.label} % % Changed - GNP. See also author.organization.sort, editor.organization.sort % Form label for BibTeX entry. The classification of which fields are used % for which type of entry (book, inbook, etc.) are taken from alpha.bst. % The change here from newapa is to also include organization as a % citation label if author or editor is missing. % { type$ "book" = type$ "inbook" = or 'author.editor.key.label { type$ "proceedings" = 'editor.key.organization.label { type$ "manual" = 'author.key.organization.label 'author.key.label if$ } if$ } if$ author empty$ % generate the full label citation information. { editor empty$ { organization empty$ { "no author, editor, or organization in " cite$ * warning$ "??" } { organization } if$ } { editor my.full.label } if$ } { author my.full.label } if$ % leave label on the stack, to be popped when required. "}{" * swap$ * "}{" * title * "}{" * % year field.or.null purify$ #-1 #4 substring$ * % % save the year for sort processing afterwards (adding a, b, c, etc.) % year field.or.null purify$ #-1 #4 substring$ 'label.year := } FUNCTION {output.bibitem} { newline$ "\bibitem[\protect\citeauthortitleyear{" write$ calc.label write$ sort.year write$ "}]{" write$ cite$ write$ "}" write$ newline$ "" before.all 'output.state := } FUNCTION {article} { output.bibitem format.authors "author" output.check author format.key output % added output.year.check % added new.block format.title "title" output.check new.block crossref missing$ { format.jour.vol output } { format.article.crossref output.nonnull format.pages output } if$ new.block note output fin.entry } FUNCTION {book} { output.bibitem author empty$ { format.editors "author and editor" output.check } { format.authors output.nonnull crossref missing$ { "author and editor" editor either.or.check } 'skip$ if$ } if$ output.year.check % added new.block format.btitle "title" output.check crossref missing$ { format.bvolume output new.block format.number.series output new.sentence address output publisher "publisher" output.check.colon } { new.block format.book.crossref output.nonnull } if$ new.block note output fin.entry } FUNCTION {booklet} { output.bibitem format.authors output author format.key output % added output.year.check % added new.block format.title "title" output.check new.block howpublished output address output new.block note output fin.entry } FUNCTION {inbook} { output.bibitem author empty$ { format.editors "author and editor" output.check } { format.authors output.nonnull crossref missing$ { "author and editor" editor either.or.check } 'skip$ if$ } if$ output.year.check % added new.block format.btitle "title" output.check crossref missing$ { format.bvolume output format.chapter.pages "chapter and pages" output.check new.block format.number.series output new.sentence address output publisher "publisher" output.check.colon } { format.chapter.pages "chapter and pages" output.check new.block format.book.crossref output.nonnull } if$ new.block note output fin.entry } FUNCTION {incollection} { output.bibitem format.authors "author" output.check author format.key output % added output.year.check % added new.block format.title "title" output.check new.block crossref missing$ { format.in.ed.booktitle "booktitle" output.check format.bvolume output format.number.series output format.chapter.pages output % gnp - was special.output.nonnull % left out comma before page numbers new.sentence address output publisher "publisher" output.check.colon } { format.incoll.inproc.crossref output.nonnull format.chapter.pages output } if$ new.block note output fin.entry } FUNCTION {inproceedings} { output.bibitem format.authors "author" output.check author format.key output % added output.year.check % added new.block format.title "title" output.check new.block crossref missing$ { format.in.ed.booktitle "booktitle" output.check format.bvolume output format.number.series output address output format.pages output new.sentence organization output publisher output.colon } { format.incoll.inproc.crossref output.nonnull format.pages output } if$ new.block note output fin.entry } FUNCTION {conference} { inproceedings } FUNCTION {manual} { output.bibitem author empty$ { editor empty$ { organization "organization" output.check organization format.key output } % if all else fails, use key { format.editors "author and editor" output.check } if$ } { format.authors output.nonnull } if$ output.year.check % added new.block format.btitle "title" output.check organization address new.block.checkb % Reversed the order of "address" and "organization", added the ":". address output organization "organization" output.check.colon % address output % ":" output % organization output new.block note output fin.entry } FUNCTION {mastersthesis} { output.bibitem format.authors "author" output.check author format.key output % added output.year.check % added new.block format.title "title" output.check new.block "Master's thesis" format.thesis.type output.nonnull school "school" output.check address output new.block note output fin.entry } FUNCTION {misc} { output.bibitem format.authors output author format.key output % added output.year.check % added title howpublished new.block.checkb format.title output new.block howpublished output new.block note output fin.entry } FUNCTION {phdthesis} { output.bibitem format.authors "author" output.check author format.key output % added output.year.check % added new.block format.btitle "title" output.check new.block "Ph.\ D. thesis" format.thesis.type output.nonnull school "school" output.check address output new.block note output fin.entry } FUNCTION {proceedings} { output.bibitem editor empty$ { organization output organization format.key output } % gnp - changed from author format.key { format.editors output.nonnull } if$ % author format.key output % gnp - removed (should be either % editor or organization output.year.check % added (newapa) new.block format.btitle "title" output.check format.bvolume output format.number.series output address output new.sentence organization output publisher output.colon new.block note output fin.entry } FUNCTION {techreport} { output.bibitem format.authors "author" output.check author format.key output % added output.year.check % added new.block format.title "title" output.check new.block format.tr.number output.nonnull institution "institution" output.check address output new.block note output fin.entry } FUNCTION {unpublished} { output.bibitem format.authors "author" output.check author format.key output % added output.year.check % added new.block format.title "title" output.check new.block note "note" output.check fin.entry } FUNCTION {default.type} { misc } MACRO {jan} {"January"} MACRO {feb} {"February"} MACRO {mar} {"March"} MACRO {apr} {"April"} MACRO {may} {"May"} MACRO {jun} {"June"} MACRO {jul} {"July"} MACRO {aug} {"August"} MACRO {sep} {"September"} MACRO {oct} {"October"} MACRO {nov} {"November"} MACRO {dec} {"December"} MACRO {acmcs} {"ACM Computing Surveys"} MACRO {acta} {"Acta Informatica"} MACRO {ai} {"Artificial Intelligence"} MACRO {cacm} {"Communications of the ACM"} MACRO {ibmjrd} {"IBM Journal of Research and Development"} MACRO {ibmsj} {"IBM Systems Journal"} MACRO {ieeese} {"IEEE Transactions on Software Engineering"} MACRO {ieeetc} {"IEEE Transactions on Computers"} MACRO {ieeetcad} {"IEEE Transactions on Computer-Aided Design of Integrated Circuits"} MACRO {ipl} {"Information Processing Letters"} MACRO {jacm} {"Journal of the ACM"} MACRO {jcss} {"Journal of Computer and System Sciences"} MACRO {scp} {"Science of Computer Programming"} MACRO {sicomp} {"SIAM Journal on Computing"} MACRO {tocs} {"ACM Transactions on Computer Systems"} MACRO {tods} {"ACM Transactions on Database Systems"} MACRO {tog} {"ACM Transactions on Graphics"} MACRO {toms} {"ACM Transactions on Mathematical Software"} MACRO {toois} {"ACM Transactions on Office Information Systems"} MACRO {toplas} {"ACM Transactions on Programming Languages and Systems"} MACRO {tcs} {"Theoretical Computer Science"} READ FUNCTION {sortify} { purify$ "l" change.case$ } INTEGERS { len } FUNCTION {chop.word} { 's := 'len := s #1 len substring$ = { s len #1 + global.max$ substring$ } 's if$ } FUNCTION {sort.format.names} { 's := #1 'nameptr := "" s num.names$ 'numnames := numnames 'namesleft := { namesleft #0 > } { nameptr #2 = { year field.or.null purify$ #-1 #4 substring$ * } 'skip$ if$ nameptr #1 > { " " * } 'skip$ if$ s nameptr "{vv{ } }{ll{ }}{ f{ }}{ jj{ }}" format.name$ 't := nameptr numnames = t "others" = and { " et~al" * } { t sortify * } if$ nameptr #1 + 'nameptr := namesleft #1 - 'namesleft := } while$ } FUNCTION {sort.format.title} { 't := "A " #2 "An " #3 "The " #4 t chop.word chop.word chop.word sortify #1 global.max$ substring$ } FUNCTION {author.sort} { author empty$ { key empty$ { "to sort, need author or key in " cite$ * warning$ "" } { key sortify } if$ } { author sort.format.names } if$ } FUNCTION {editor.sort} { editor empty$ { key empty$ { "to sort, need editor or key in " cite$ * warning$ "" } { key sortify } if$ } { editor sort.format.names } if$ } FUNCTION {author.editor.sort} { author empty$ { "missing author in " cite$ * warning$ editor empty$ { key empty$ { "to sort, need author, editor, or key in " cite$ * warning$ "" } { key sortify } if$ } { editor sort.format.names } if$ } { author sort.format.names } if$ } FUNCTION {author.organization.sort} % % added - GNP. Stack author or organization for sorting (from alpha.bst). % Unlike alpha.bst, we need entire names, not abbreviations % { author empty$ { organization empty$ { key empty$ { "to sort, need author, organization, or key in " cite$ * warning$ "" } { key sortify } if$ } { organization sortify } if$ } { author sort.format.names } if$ } FUNCTION {editor.organization.sort} % % added - GNP. Stack editor or organization for sorting (from alpha.bst). % Unlike alpha.bst, we need entire names, not abbreviations % { editor empty$ { organization empty$ { key empty$ { "to sort, need editor, organization, or key in " cite$ * warning$ "" } { key sortify } if$ } { organization sortify } if$ } { editor sort.format.names } if$ } FUNCTION {presort} % % Presort creates the bibentry's label via a call to calc.label, and then % sorts the entries based on entry type. Chicago.bst adds support for % including organizations as the sort key; the following is stolen from % alpha.bst. % { %calc.label sortify % recalculate bibitem label %year field.or.null purify$ #-1 #4 substring$ * % add year %duplicate$ warning$ %" " %* type$ "book" = type$ "inbook" = or 'author.editor.sort { type$ "proceedings" = 'editor.organization.sort { type$ "manual" = 'author.organization.sort 'author.sort if$ } if$ } if$ #1 entry.max$ substring$ % added for newapa 'sort.label := % added for newapa sort.label % added for newapa %* " " * title field.or.null sort.format.title * #1 entry.max$ substring$ 'sort.key$ := } ITERATE {presort} SORT % by label, year, author/editor, title STRINGS { last.label next.extra } INTEGERS { last.extra.num } FUNCTION {initialize.extra.label.stuff} { #0 int.to.chr$ 'last.label := "" 'next.extra := #0 'last.extra.num := } FUNCTION {forward.pass} % % Pass through all entries, comparing current entry to last one. % Need to concatenate year to the stack (done by calc.label) to determine % if two entries are the same (see presort) % { last.label calc.label.orig year field.or.null purify$ #-1 #4 substring$ * % add year #1 entry.max$ substring$ = % are they equal? { last.extra.num #1 + 'last.extra.num := last.extra.num int.to.chr$ 'extra.label := } { "a" chr.to.int$ 'last.extra.num := "" 'extra.label := calc.label.orig year field.or.null purify$ #-1 #4 substring$ * % add year #1 entry.max$ substring$ 'last.label := % assign to last.label } if$ } FUNCTION {reverse.pass} { next.extra "b" = { "a" 'extra.label := } 'skip$ if$ label.year extra.label * 'sort.year := extra.label 'next.extra := } EXECUTE {initialize.extra.label.stuff} ITERATE {forward.pass} REVERSE {reverse.pass} FUNCTION {bib.sort.order} { sort.label " " * year field.or.null sortify * " " * title field.or.null sort.format.title * #1 entry.max$ substring$ 'sort.key$ := } ITERATE {bib.sort.order} SORT % by sort.label, year, title --- giving final bib. order. FUNCTION {begin.bib} { preamble$ empty$ 'skip$ { preamble$ write$ newline$ } if$ "\begin{thebibliography}{}" write$ newline$ } EXECUTE {begin.bib} EXECUTE {init.state.consts} ITERATE {call.type$} FUNCTION {end.bib} { newline$ "\end{thebibliography}" write$ newline$ } EXECUTE {end.bib} cloog-0.18.2/isl/doc/mypod2latex0000775000175000017500000000031712254313240013357 00000000000000#!/usr/bin/perl use strict; use Pod::LaTeX; my ($in, $out) = @ARGV; my $parser = new Pod::LaTeX( AddPreamble => 0, AddPostamble => 0, LevelNoNum => 5, ); $parser->parse_from_file($in, $out); cloog-0.18.2/isl/doc/user.pod0000664000175000017500000073566312254313240012666 00000000000000=head1 Introduction C is a thread-safe C library for manipulating sets and relations of integer points bounded by affine constraints. The descriptions of the sets and relations may involve both parameters and existentially quantified variables. All computations are performed in exact integer arithmetic using C. The C library offers functionality that is similar to that offered by the C and C libraries, but the underlying algorithms are in most cases completely different. The library is by no means complete and some fairly basic functionality is still missing. Still, even in its current form, the library has been successfully used as a backend polyhedral library for the polyhedral scanner C and as part of an equivalence checker of static affine programs. For bug reports, feature requests and questions, visit the the discussion group at L. =head2 Backward Incompatible Changes =head3 Changes since isl-0.02 =over =item * The old printing functions have been deprecated and replaced by C functions, see L. =item * Most functions related to dependence analysis have acquired an extra C argument. To obtain the old behavior, this argument should be given the value 1. See L. =back =head3 Changes since isl-0.03 =over =item * The function C has been renamed to C. Similarly, C has been renamed to C. =back =head3 Changes since isl-0.04 =over =item * All header files have been renamed from C to C. =back =head3 Changes since isl-0.05 =over =item * The functions C and C no longer print a newline. =item * The functions C and C now return the accesses for which no source could be found instead of the iterations where those accesses occur. =item * The functions C and C now take a B space as input. An old call C can be rewritten to C. =item * The function C no longer takes a parameter position as input. Instead, the exponent is now expressed as the domain of the resulting relation. =back =head3 Changes since isl-0.06 =over =item * The format of C's C output has changed. Use C to obtain the old output. =item * The C<*_fast_*> functions have been renamed to C<*_plain_*>. Some of the old names have been kept for backward compatibility, but they will be removed in the future. =back =head3 Changes since isl-0.07 =over =item * The function C has been renamed to C. Similarly, the function C has been renamed to C. =item * The C type has been renamed to C along with the associated functions. Some of the old names have been kept for backward compatibility, but they will be removed in the future. =item * Spaces of maps, sets and parameter domains are now treated differently. The distinction between map spaces and set spaces has always been made on a conceptual level, but proper use of such spaces was never checked. Furthermore, up until isl-0.07 there was no way of explicitly creating a parameter space. These can now be created directly using C or from other spaces using C. =item * The space in which C, C, C, C, C and C objects live is now a map space instead of a set space. This means, for example, that the dimensions of the domain of an C are now considered to be of type C instead of C. Extra functions have been added to obtain the domain space. Some of the constructors still take a domain space and have therefore been renamed. =item * The functions C and C now take an C instead of an C. An C can be created from an C using C. =item * The C type has been removed. Functions that used to return an C now return an C. Note that the space of an C is that of relation. When replacing a call to C by a call to C any C argument needs to be replaced by C. A call to C can be replaced by a call to C. A call to C call be replaced by the nested call isl_qpolynomial_from_aff(isl_aff_floor(div)) The function C has also been renamed to C. =item * The C argument has been removed from C and similar functions. When reading input in the original PolyLib format, the result will have no parameters. If parameters are expected, the caller may want to perform dimension manipulation on the result. =back =head3 Changes since isl-0.09 =over =item * The C option has been replaced by the C option. =item * The first argument of C is now an C instead of an C. A call C can be replaced by isl_pw_aff_cond(isl_set_indicator_function(a), b, c) =back =head3 Changes since isl-0.10 =over =item * The functions C and C have been renamed to C and C. The new C and C have slightly different meanings. =back =head1 License C is released under the MIT license. =over Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. =back Note that C currently requires C, which is released under the GNU Lesser General Public License (LGPL). This means that code linked against C is also linked against LGPL code. =head1 Installation The source of C can be obtained either as a tarball or from the git repository. Both are available from L. The installation process depends on how you obtained the source. =head2 Installation from the git repository =over =item 1 Clone or update the repository The first time the source is obtained, you need to clone the repository. git clone git://repo.or.cz/isl.git To obtain updates, you need to pull in the latest changes git pull =item 2 Generate C ./autogen.sh =back After performing the above steps, continue with the L. =head2 Common installation instructions =over =item 1 Obtain C Building C requires C, including its headers files. Your distribution may not provide these header files by default and you may need to install a package called C or something similar. Alternatively, C can be built from source, available from L. =item 2 Configure C uses the standard C C script. To run it, just type ./configure optionally followed by some configure options. A complete list of options can be obtained by running ./configure --help Below we discuss some of the more common options. C can optionally use C, but no C functionality is currently used by default. The C<--with-piplib> option can be used to specify which C library to use, either an installed version (C), an externally built version (C) or no version (C). The option C is mostly useful in C scripts of larger projects that bundle both C and C. =over =item C<--prefix> Installation prefix for C =item C<--with-gmp-prefix> Installation prefix for C (architecture-independent files). =item C<--with-gmp-exec-prefix> Installation prefix for C (architecture-dependent files). =item C<--with-piplib> Which copy of C to use, either C (default), C or C. =item C<--with-piplib-prefix> Installation prefix for C C (architecture-independent files). =item C<--with-piplib-exec-prefix> Installation prefix for C C (architecture-dependent files). =item C<--with-piplib-builddir> Location where C C was built. =back =item 3 Compile make =item 4 Install (optional) make install =back =head1 Integer Set Library =head2 Initialization All manipulations of integer sets and relations occur within the context of an C. A given C can only be used within a single thread. All arguments of a function are required to have been allocated within the same context. There are currently no functions available for moving an object from one C to another C. This means that there is currently no way of safely moving an object from one thread to another, unless the whole C is moved. An C can be allocated using C and freed using C. All objects allocated within an C should be freed before the C itself is freed. isl_ctx *isl_ctx_alloc(); void isl_ctx_free(isl_ctx *ctx); =head2 Values An C represents an integer value, a rational value or one of three special values, infinity, negative infinity and NaN. Some predefined values can be created using the following functions. #include __isl_give isl_val *isl_val_zero(isl_ctx *ctx); __isl_give isl_val *isl_val_one(isl_ctx *ctx); __isl_give isl_val *isl_val_nan(isl_ctx *ctx); __isl_give isl_val *isl_val_infty(isl_ctx *ctx); __isl_give isl_val *isl_val_neginfty(isl_ctx *ctx); Specific integer values can be created using the following functions. #include __isl_give isl_val *isl_val_int_from_si(isl_ctx *ctx, long i); __isl_give isl_val *isl_val_int_from_ui(isl_ctx *ctx, unsigned long u); __isl_give isl_val *isl_val_int_from_chunks(isl_ctx *ctx, size_t n, size_t size, const void *chunks); The function C constructs an C from the C I, each consisting of C bytes, stored at C. The least significant digit is assumed to be stored first. Value objects can be copied and freed using the following functions. #include __isl_give isl_val *isl_val_copy(__isl_keep isl_val *v); void *isl_val_free(__isl_take isl_val *v); They can be inspected using the following functions. #include isl_ctx *isl_val_get_ctx(__isl_keep isl_val *val); long isl_val_get_num_si(__isl_keep isl_val *v); long isl_val_get_den_si(__isl_keep isl_val *v); double isl_val_get_d(__isl_keep isl_val *v); size_t isl_val_n_abs_num_chunks(__isl_keep isl_val *v, size_t size); int isl_val_get_abs_num_chunks(__isl_keep isl_val *v, size_t size, void *chunks); C returns the number of I of C bytes needed to store the absolute value of the numerator of C. C stores these digits at C, which is assumed to have been preallocated by the caller. The least significant digit is stored first. Note that C, C, C, C and C can only be applied to rational values. An C can be modified using the following function. #include __isl_give isl_val *isl_val_set_si(__isl_take isl_val *v, long i); The following unary properties are defined on Cs. #include int isl_val_sgn(__isl_keep isl_val *v); int isl_val_is_zero(__isl_keep isl_val *v); int isl_val_is_one(__isl_keep isl_val *v); int isl_val_is_negone(__isl_keep isl_val *v); int isl_val_is_nonneg(__isl_keep isl_val *v); int isl_val_is_nonpos(__isl_keep isl_val *v); int isl_val_is_pos(__isl_keep isl_val *v); int isl_val_is_neg(__isl_keep isl_val *v); int isl_val_is_int(__isl_keep isl_val *v); int isl_val_is_rat(__isl_keep isl_val *v); int isl_val_is_nan(__isl_keep isl_val *v); int isl_val_is_infty(__isl_keep isl_val *v); int isl_val_is_neginfty(__isl_keep isl_val *v); Note that the sign of NaN is undefined. The following binary properties are defined on pairs of Cs. #include int isl_val_lt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_le(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_gt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_ge(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_ne(__isl_keep isl_val *v1, __isl_keep isl_val *v2); For integer Cs we additionally have the following binary property. #include int isl_val_is_divisible_by(__isl_keep isl_val *v1, __isl_keep isl_val *v2); An C can also be compared to an integer using the following function. The result is undefined for NaN. #include int isl_val_cmp_si(__isl_keep isl_val *v, long i); The following unary operations are available on Cs. #include __isl_give isl_val *isl_val_abs(__isl_take isl_val *v); __isl_give isl_val *isl_val_neg(__isl_take isl_val *v); __isl_give isl_val *isl_val_floor(__isl_take isl_val *v); __isl_give isl_val *isl_val_ceil(__isl_take isl_val *v); __isl_give isl_val *isl_val_trunc(__isl_take isl_val *v); The following binary operations are available on Cs. #include __isl_give isl_val *isl_val_abs(__isl_take isl_val *v); __isl_give isl_val *isl_val_neg(__isl_take isl_val *v); __isl_give isl_val *isl_val_floor(__isl_take isl_val *v); __isl_give isl_val *isl_val_ceil(__isl_take isl_val *v); __isl_give isl_val *isl_val_trunc(__isl_take isl_val *v); __isl_give isl_val *isl_val_2exp(__isl_take isl_val *v); __isl_give isl_val *isl_val_min(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_max(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_add(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_add_ui(__isl_take isl_val *v1, unsigned long v2); __isl_give isl_val *isl_val_sub(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_sub_ui(__isl_take isl_val *v1, unsigned long v2); __isl_give isl_val *isl_val_mul(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_mul_ui(__isl_take isl_val *v1, unsigned long v2); __isl_give isl_val *isl_val_div(__isl_take isl_val *v1, __isl_take isl_val *v2); On integer values, we additionally have the following operations. #include __isl_give isl_val *isl_val_2exp(__isl_take isl_val *v); __isl_give isl_val *isl_val_mod(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_gcd(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_gcdext(__isl_take isl_val *v1, __isl_take isl_val *v2, __isl_give isl_val **x, __isl_give isl_val **y); The function C returns the greatest common divisor g of C and C as well as two integers C<*x> and C<*y> such that C<*x> * C + C<*y> * C = g. A value can be read from input using #include __isl_give isl_val *isl_val_read_from_str(isl_ctx *ctx, const char *str); A value can be printed using #include __isl_give isl_printer *isl_printer_print_val( __isl_take isl_printer *p, __isl_keep isl_val *v); =head3 GMP specific functions These functions are only available if C has been compiled with C support. Specific integer and rational values can be created from C values using the following functions. #include __isl_give isl_val *isl_val_int_from_gmp(isl_ctx *ctx, mpz_t z); __isl_give isl_val *isl_val_from_gmp(isl_ctx *ctx, const mpz_t n, const mpz_t d); The numerator and denominator of a rational value can be extracted as C values using the following functions. #include int isl_val_get_num_gmp(__isl_keep isl_val *v, mpz_t z); int isl_val_get_den_gmp(__isl_keep isl_val *v, mpz_t z); =head3 Conversion from C The following functions are only temporarily available to ease the transition from C to C. They will be removed in the next release. #include __isl_give isl_val *isl_val_int_from_isl_int(isl_ctx *ctx, isl_int n); int isl_val_get_num_isl_int(__isl_keep isl_val *v, isl_int *n); =head2 Integers (obsolescent) In previous versions of C, integers were represented in the external interface using the C type. This type has now been superseded by C. The C type will be removed from the external interface in future releases. New code should not use C. The operations below are currently available on Cs. The meanings of these operations are essentially the same as their C C counterparts. As always with C types, Cs need to be initialized with C before they can be used and they need to be released with C after the last use. The user should not assume that an C is represented as a C, but should instead explicitly convert between Cs and Cs using C and C whenever a C is required. =over =item isl_int_init(i) =item isl_int_clear(i) =item isl_int_set(r,i) =item isl_int_set_si(r,i) =item isl_int_set_gmp(r,g) =item isl_int_get_gmp(i,g) =item isl_int_abs(r,i) =item isl_int_neg(r,i) =item isl_int_swap(i,j) =item isl_int_swap_or_set(i,j) =item isl_int_add_ui(r,i,j) =item isl_int_sub_ui(r,i,j) =item isl_int_add(r,i,j) =item isl_int_sub(r,i,j) =item isl_int_mul(r,i,j) =item isl_int_mul_ui(r,i,j) =item isl_int_addmul(r,i,j) =item isl_int_submul(r,i,j) =item isl_int_gcd(r,i,j) =item isl_int_lcm(r,i,j) =item isl_int_divexact(r,i,j) =item isl_int_cdiv_q(r,i,j) =item isl_int_fdiv_q(r,i,j) =item isl_int_fdiv_r(r,i,j) =item isl_int_fdiv_q_ui(r,i,j) =item isl_int_read(r,s) =item isl_int_print(out,i,width) =item isl_int_sgn(i) =item isl_int_cmp(i,j) =item isl_int_cmp_si(i,si) =item isl_int_eq(i,j) =item isl_int_ne(i,j) =item isl_int_lt(i,j) =item isl_int_le(i,j) =item isl_int_gt(i,j) =item isl_int_ge(i,j) =item isl_int_abs_eq(i,j) =item isl_int_abs_ne(i,j) =item isl_int_abs_lt(i,j) =item isl_int_abs_gt(i,j) =item isl_int_abs_ge(i,j) =item isl_int_is_zero(i) =item isl_int_is_one(i) =item isl_int_is_negone(i) =item isl_int_is_pos(i) =item isl_int_is_neg(i) =item isl_int_is_nonpos(i) =item isl_int_is_nonneg(i) =item isl_int_is_divisible_by(i,j) =back =head2 Sets and Relations C uses six types of objects for representing sets and relations, C, C, C, C, C and C. C and C represent sets and relations that can be described as a conjunction of affine constraints, while C and C represent unions of Cs and Cs, respectively. However, all Cs or Cs in the union need to live in the same space. Cs and Cs represent unions of Cs or Cs in I spaces, where spaces are considered different if they have a different number of dimensions and/or different names (see L<"Spaces">). The difference between sets and relations (maps) is that sets have one set of variables, while relations have two sets of variables, input variables and output variables. =head2 Memory Management Since a high-level operation on sets and/or relations usually involves several substeps and since the user is usually not interested in the intermediate results, most functions that return a new object will also release all the objects passed as arguments. If the user still wants to use one or more of these arguments after the function call, she should pass along a copy of the object rather than the object itself. The user is then responsible for making sure that the original object gets used somewhere else or is explicitly freed. The arguments and return values of all documented functions are annotated to make clear which arguments are released and which arguments are preserved. In particular, the following annotations are used =over =item C<__isl_give> C<__isl_give> means that a new object is returned. The user should make sure that the returned pointer is used exactly once as a value for an C<__isl_take> argument. In between, it can be used as a value for as many C<__isl_keep> arguments as the user likes. There is one exception, and that is the case where the pointer returned is C. Is this case, the user is free to use it as an C<__isl_take> argument or not. =item C<__isl_take> C<__isl_take> means that the object the argument points to is taken over by the function and may no longer be used by the user as an argument to any other function. The pointer value must be one returned by a function returning an C<__isl_give> pointer. If the user passes in a C value, then this will be treated as an error in the sense that the function will not perform its usual operation. However, it will still make sure that all the other C<__isl_take> arguments are released. =item C<__isl_keep> C<__isl_keep> means that the function will only use the object temporarily. After the function has finished, the user can still use it as an argument to other functions. A C value will be treated in the same way as a C value for an C<__isl_take> argument. =back =head2 Error Handling C supports different ways to react in case a runtime error is triggered. Runtime errors arise, e.g., if a function such as C is called with two maps that have incompatible spaces. There are three possible ways to react on error: to warn, to continue or to abort. The default behavior is to warn. In this mode, C prints a warning, stores the last error in the corresponding C and the function in which the error was triggered returns C. An error does not corrupt internal state, such that isl can continue to be used. C also provides functions to read the last error and to reset the memory that stores the last error. The last error is only stored for information purposes. Its presence does not change the behavior of C. Hence, resetting an error is not required to continue to use isl, but only to observe new errors. #include enum isl_error isl_ctx_last_error(isl_ctx *ctx); void isl_ctx_reset_error(isl_ctx *ctx); Another option is to continue on error. This is similar to warn on error mode, except that C does not print any warning. This allows a program to implement its own error reporting. The last option is to directly abort the execution of the program from within the isl library. This makes it obviously impossible to recover from an error, but it allows to directly spot the error location. By aborting on error, debuggers break at the location the error occurred and can provide a stack trace. Other tools that automatically provide stack traces on abort or that do not want to continue execution after an error was triggered may also prefer to abort on error. The on error behavior of isl can be specified by calling C or by setting the command line option C<--isl-on-error>. Valid arguments for the function call are C, C and C. The choices for the command line option are C, C and C. It is also possible to query the current error mode. #include int isl_options_set_on_error(isl_ctx *ctx, int val); int isl_options_get_on_error(isl_ctx *ctx); =head2 Identifiers Identifiers are used to identify both individual dimensions and tuples of dimensions. They consist of an optional name and an optional user pointer. The name and the user pointer cannot both be C, however. Identifiers with the same name but different pointer values are considered to be distinct. Similarly, identifiers with different names but the same pointer value are also considered to be distinct. Equal identifiers are represented using the same object. Pairs of identifiers can therefore be tested for equality using the C<==> operator. Identifiers can be constructed, copied, freed, inspected and printed using the following functions. #include __isl_give isl_id *isl_id_alloc(isl_ctx *ctx, __isl_keep const char *name, void *user); __isl_give isl_id *isl_id_set_free_user( __isl_take isl_id *id, __isl_give void (*free_user)(void *user)); __isl_give isl_id *isl_id_copy(isl_id *id); void *isl_id_free(__isl_take isl_id *id); isl_ctx *isl_id_get_ctx(__isl_keep isl_id *id); void *isl_id_get_user(__isl_keep isl_id *id); __isl_keep const char *isl_id_get_name(__isl_keep isl_id *id); __isl_give isl_printer *isl_printer_print_id( __isl_take isl_printer *p, __isl_keep isl_id *id); The callback set by C is called on the user pointer when the last reference to the C is freed. Note that C returns a pointer to some internal data structure, so the result can only be used while the corresponding C is alive. =head2 Spaces Whenever a new set, relation or similiar object is created from scratch, the space in which it lives needs to be specified using an C. Each space involves zero or more parameters and zero, one or two tuples of set or input/output dimensions. The parameters and dimensions are identified by an C and a position. The type C refers to parameters, the type C refers to set dimensions (for spaces with a single tuple of dimensions) and the types C and C refer to input and output dimensions (for spaces with two tuples of dimensions). Local spaces (see L) also contain dimensions of type C. Note that parameters are only identified by their position within a given object. Across different objects, parameters are (usually) identified by their names or identifiers. Only unnamed parameters are identified by their positions across objects. The use of unnamed parameters is discouraged. #include __isl_give isl_space *isl_space_alloc(isl_ctx *ctx, unsigned nparam, unsigned n_in, unsigned n_out); __isl_give isl_space *isl_space_params_alloc(isl_ctx *ctx, unsigned nparam); __isl_give isl_space *isl_space_set_alloc(isl_ctx *ctx, unsigned nparam, unsigned dim); __isl_give isl_space *isl_space_copy(__isl_keep isl_space *space); void *isl_space_free(__isl_take isl_space *space); unsigned isl_space_dim(__isl_keep isl_space *space, enum isl_dim_type type); The space used for creating a parameter domain needs to be created using C. For other sets, the space needs to be created using C, while for a relation, the space needs to be created using C. C can be used to find out the number of dimensions of each type in a space, where type may be C, C (only for relations), C (only for relations), C (only for sets) or C. To check whether a given space is that of a set or a map or whether it is a parameter space, use these functions: #include int isl_space_is_params(__isl_keep isl_space *space); int isl_space_is_set(__isl_keep isl_space *space); int isl_space_is_map(__isl_keep isl_space *space); Spaces can be compared using the following functions: #include int isl_space_is_equal(__isl_keep isl_space *space1, __isl_keep isl_space *space2); int isl_space_is_domain(__isl_keep isl_space *space1, __isl_keep isl_space *space2); int isl_space_is_range(__isl_keep isl_space *space1, __isl_keep isl_space *space2); C checks whether the first argument is equal to the domain of the second argument. This requires in particular that the first argument is a set space and that the second argument is a map space. It is often useful to create objects that live in the same space as some other object. This can be accomplished by creating the new objects (see L or L) based on the space of the original object. #include __isl_give isl_space *isl_basic_set_get_space( __isl_keep isl_basic_set *bset); __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set); #include __isl_give isl_space *isl_union_set_get_space( __isl_keep isl_union_set *uset); #include __isl_give isl_space *isl_basic_map_get_space( __isl_keep isl_basic_map *bmap); __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map); #include __isl_give isl_space *isl_union_map_get_space( __isl_keep isl_union_map *umap); #include __isl_give isl_space *isl_constraint_get_space( __isl_keep isl_constraint *constraint); #include __isl_give isl_space *isl_qpolynomial_get_domain_space( __isl_keep isl_qpolynomial *qp); __isl_give isl_space *isl_qpolynomial_get_space( __isl_keep isl_qpolynomial *qp); __isl_give isl_space *isl_qpolynomial_fold_get_space( __isl_keep isl_qpolynomial_fold *fold); __isl_give isl_space *isl_pw_qpolynomial_get_domain_space( __isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_space *isl_pw_qpolynomial_get_space( __isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_space *isl_pw_qpolynomial_fold_get_domain_space( __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_space *isl_pw_qpolynomial_fold_get_space( __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_space *isl_union_pw_qpolynomial_get_space( __isl_keep isl_union_pw_qpolynomial *upwqp); __isl_give isl_space *isl_union_pw_qpolynomial_fold_get_space( __isl_keep isl_union_pw_qpolynomial_fold *upwf); #include __isl_give isl_space *isl_multi_val_get_space( __isl_keep isl_multi_val *mv); #include __isl_give isl_space *isl_aff_get_domain_space( __isl_keep isl_aff *aff); __isl_give isl_space *isl_aff_get_space( __isl_keep isl_aff *aff); __isl_give isl_space *isl_pw_aff_get_domain_space( __isl_keep isl_pw_aff *pwaff); __isl_give isl_space *isl_pw_aff_get_space( __isl_keep isl_pw_aff *pwaff); __isl_give isl_space *isl_multi_aff_get_domain_space( __isl_keep isl_multi_aff *maff); __isl_give isl_space *isl_multi_aff_get_space( __isl_keep isl_multi_aff *maff); __isl_give isl_space *isl_pw_multi_aff_get_domain_space( __isl_keep isl_pw_multi_aff *pma); __isl_give isl_space *isl_pw_multi_aff_get_space( __isl_keep isl_pw_multi_aff *pma); __isl_give isl_space *isl_union_pw_multi_aff_get_space( __isl_keep isl_union_pw_multi_aff *upma); __isl_give isl_space *isl_multi_pw_aff_get_domain_space( __isl_keep isl_multi_pw_aff *mpa); __isl_give isl_space *isl_multi_pw_aff_get_space( __isl_keep isl_multi_pw_aff *mpa); #include __isl_give isl_space *isl_point_get_space( __isl_keep isl_point *pnt); The identifiers or names of the individual dimensions may be set or read off using the following functions. #include __isl_give isl_space *isl_space_set_dim_id( __isl_take isl_space *space, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_space_has_dim_id(__isl_keep isl_space *space, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_space_get_dim_id( __isl_keep isl_space *space, enum isl_dim_type type, unsigned pos); __isl_give isl_space *isl_space_set_dim_name( __isl_take isl_space *space, enum isl_dim_type type, unsigned pos, __isl_keep const char *name); int isl_space_has_dim_name(__isl_keep isl_space *space, enum isl_dim_type type, unsigned pos); __isl_keep const char *isl_space_get_dim_name( __isl_keep isl_space *space, enum isl_dim_type type, unsigned pos); Note that C returns a pointer to some internal data structure, so the result can only be used while the corresponding C is alive. Also note that every function that operates on two sets or relations requires that both arguments have the same parameters. This also means that if one of the arguments has named parameters, then the other needs to have named parameters too and the names need to match. Pairs of C, C, C and/or C arguments may have different parameters (as long as they are named), in which case the result will have as parameters the union of the parameters of the arguments. Given the identifier or name of a dimension (typically a parameter), its position can be obtained from the following function. #include int isl_space_find_dim_by_id(__isl_keep isl_space *space, enum isl_dim_type type, __isl_keep isl_id *id); int isl_space_find_dim_by_name(__isl_keep isl_space *space, enum isl_dim_type type, const char *name); The identifiers or names of entire spaces may be set or read off using the following functions. #include __isl_give isl_space *isl_space_set_tuple_id( __isl_take isl_space *space, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_space *isl_space_reset_tuple_id( __isl_take isl_space *space, enum isl_dim_type type); int isl_space_has_tuple_id(__isl_keep isl_space *space, enum isl_dim_type type); __isl_give isl_id *isl_space_get_tuple_id( __isl_keep isl_space *space, enum isl_dim_type type); __isl_give isl_space *isl_space_set_tuple_name( __isl_take isl_space *space, enum isl_dim_type type, const char *s); int isl_space_has_tuple_name(__isl_keep isl_space *space, enum isl_dim_type type); const char *isl_space_get_tuple_name(__isl_keep isl_space *space, enum isl_dim_type type); The C argument needs to be one of C, C or C. As with C, the C function returns a pointer to some internal data structure. Binary operations require the corresponding spaces of their arguments to have the same name. Spaces can be nested. In particular, the domain of a set or the domain or range of a relation can be a nested relation. The following functions can be used to construct and deconstruct such nested spaces. #include int isl_space_is_wrapping(__isl_keep isl_space *space); __isl_give isl_space *isl_space_wrap(__isl_take isl_space *space); __isl_give isl_space *isl_space_unwrap(__isl_take isl_space *space); The input to C and C should be the space of a set, while that of C should be the space of a relation. Conversely, the output of C is the space of a relation, while that of C is the space of a set. Spaces can be created from other spaces using the following functions. __isl_give isl_space *isl_space_domain(__isl_take isl_space *space); __isl_give isl_space *isl_space_from_domain(__isl_take isl_space *space); __isl_give isl_space *isl_space_range(__isl_take isl_space *space); __isl_give isl_space *isl_space_from_range(__isl_take isl_space *space); __isl_give isl_space *isl_space_params( __isl_take isl_space *space); __isl_give isl_space *isl_space_set_from_params( __isl_take isl_space *space); __isl_give isl_space *isl_space_reverse(__isl_take isl_space *space); __isl_give isl_space *isl_space_join(__isl_take isl_space *left, __isl_take isl_space *right); __isl_give isl_space *isl_space_align_params( __isl_take isl_space *space1, __isl_take isl_space *space2) __isl_give isl_space *isl_space_insert_dims(__isl_take isl_space *space, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_space *isl_space_add_dims(__isl_take isl_space *space, enum isl_dim_type type, unsigned n); __isl_give isl_space *isl_space_drop_dims(__isl_take isl_space *space, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_space *isl_space_move_dims(__isl_take isl_space *space, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_space *isl_space_map_from_set( __isl_take isl_space *space); __isl_give isl_space *isl_space_map_from_domain_and_range( __isl_take isl_space *domain, __isl_take isl_space *range); __isl_give isl_space *isl_space_zip(__isl_take isl_space *space); __isl_give isl_space *isl_space_curry( __isl_take isl_space *space); __isl_give isl_space *isl_space_uncurry( __isl_take isl_space *space); Note that if dimensions are added or removed from a space, then the name and the internal structure are lost. =head2 Local Spaces A local space is essentially a space with zero or more existentially quantified variables. The local space of a (constraint of a) basic set or relation can be obtained using the following functions. #include __isl_give isl_local_space *isl_constraint_get_local_space( __isl_keep isl_constraint *constraint); #include __isl_give isl_local_space *isl_basic_set_get_local_space( __isl_keep isl_basic_set *bset); #include __isl_give isl_local_space *isl_basic_map_get_local_space( __isl_keep isl_basic_map *bmap); A new local space can be created from a space using #include __isl_give isl_local_space *isl_local_space_from_space( __isl_take isl_space *space); They can be inspected, modified, copied and freed using the following functions. #include isl_ctx *isl_local_space_get_ctx( __isl_keep isl_local_space *ls); int isl_local_space_is_set(__isl_keep isl_local_space *ls); int isl_local_space_dim(__isl_keep isl_local_space *ls, enum isl_dim_type type); int isl_local_space_has_dim_id( __isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_local_space_get_dim_id( __isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos); int isl_local_space_has_dim_name( __isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos) const char *isl_local_space_get_dim_name( __isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_local_space *isl_local_space_set_dim_name( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_local_space *isl_local_space_set_dim_id( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); __isl_give isl_space *isl_local_space_get_space( __isl_keep isl_local_space *ls); __isl_give isl_aff *isl_local_space_get_div( __isl_keep isl_local_space *ls, int pos); __isl_give isl_local_space *isl_local_space_copy( __isl_keep isl_local_space *ls); void *isl_local_space_free(__isl_take isl_local_space *ls); Note that C can only be used on local spaces of sets. Two local spaces can be compared using int isl_local_space_is_equal(__isl_keep isl_local_space *ls1, __isl_keep isl_local_space *ls2); Local spaces can be created from other local spaces using the following functions. __isl_give isl_local_space *isl_local_space_domain( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_range( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_from_domain( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_intersect( __isl_take isl_local_space *ls1, __isl_take isl_local_space *ls2); __isl_give isl_local_space *isl_local_space_add_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned n); __isl_give isl_local_space *isl_local_space_insert_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_local_space *isl_local_space_drop_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned first, unsigned n); =head2 Input and Output C supports its own input/output format, which is similar to the C format, but also supports the C format in some cases. =head3 C format The C format is similar to that of C, but has a different syntax for describing the parameters and allows for the definition of an existentially quantified variable as the integer division of an affine expression. For example, the set of integers C between C<0> and C such that C can be described as [n] -> { [i] : exists (a = [i/10] : 0 <= i and i <= n and i - 10 a <= 6) } A set or relation can have several disjuncts, separated by the keyword C. Each disjunct is either a conjunction of constraints or a projection (C) of a conjunction of constraints. The constraints are separated by the keyword C. =head3 C format If the represented set is a union, then the first line contains a single number representing the number of disjuncts. Otherwise, a line containing the number C<1> is optional. Each disjunct is represented by a matrix of constraints. The first line contains two numbers representing the number of rows and columns, where the number of rows is equal to the number of constraints and the number of columns is equal to two plus the number of variables. The following lines contain the actual rows of the constraint matrix. In each row, the first column indicates whether the constraint is an equality (C<0>) or inequality (C<1>). The final column corresponds to the constant term. If the set is parametric, then the coefficients of the parameters appear in the last columns before the constant column. The coefficients of any existentially quantified variables appear between those of the set variables and those of the parameters. =head3 Extended C format The extended C format is nearly identical to the C format. The only difference is that the line containing the number of rows and columns of a constraint matrix also contains four additional numbers: the number of output dimensions, the number of input dimensions, the number of local dimensions (i.e., the number of existentially quantified variables) and the number of parameters. For sets, the number of ``output'' dimensions is equal to the number of set dimensions, while the number of ``input'' dimensions is zero. =head3 Input #include __isl_give isl_basic_set *isl_basic_set_read_from_file( isl_ctx *ctx, FILE *input); __isl_give isl_basic_set *isl_basic_set_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_set *isl_set_read_from_file(isl_ctx *ctx, FILE *input); __isl_give isl_set *isl_set_read_from_str(isl_ctx *ctx, const char *str); #include __isl_give isl_basic_map *isl_basic_map_read_from_file( isl_ctx *ctx, FILE *input); __isl_give isl_basic_map *isl_basic_map_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_map *isl_map_read_from_file( isl_ctx *ctx, FILE *input); __isl_give isl_map *isl_map_read_from_str(isl_ctx *ctx, const char *str); #include __isl_give isl_union_set *isl_union_set_read_from_file( isl_ctx *ctx, FILE *input); __isl_give isl_union_set *isl_union_set_read_from_str( isl_ctx *ctx, const char *str); #include __isl_give isl_union_map *isl_union_map_read_from_file( isl_ctx *ctx, FILE *input); __isl_give isl_union_map *isl_union_map_read_from_str( isl_ctx *ctx, const char *str); The input format is autodetected and may be either the C format or the C format. =head3 Output Before anything can be printed, an C needs to be created. __isl_give isl_printer *isl_printer_to_file(isl_ctx *ctx, FILE *file); __isl_give isl_printer *isl_printer_to_str(isl_ctx *ctx); void *isl_printer_free(__isl_take isl_printer *printer); __isl_give char *isl_printer_get_str( __isl_keep isl_printer *printer); The printer can be inspected using the following functions. FILE *isl_printer_get_file( __isl_keep isl_printer *printer); int isl_printer_get_output_format( __isl_keep isl_printer *p); The behavior of the printer can be modified in various ways __isl_give isl_printer *isl_printer_set_output_format( __isl_take isl_printer *p, int output_format); __isl_give isl_printer *isl_printer_set_indent( __isl_take isl_printer *p, int indent); __isl_give isl_printer *isl_printer_indent( __isl_take isl_printer *p, int indent); __isl_give isl_printer *isl_printer_set_prefix( __isl_take isl_printer *p, const char *prefix); __isl_give isl_printer *isl_printer_set_suffix( __isl_take isl_printer *p, const char *suffix); The C may be either C, C, C, C or C and defaults to C. Each line in the output is indented by C (set by C) spaces (default: 0), prefixed by C and suffixed by C. In the C format output, the coefficients of the existentially quantified variables appear between those of the set variables and those of the parameters. The function C increases the indentation by the specified amount (which may be negative). To actually print something, use #include __isl_give isl_printer *isl_printer_print_double( __isl_take isl_printer *p, double d); #include __isl_give isl_printer *isl_printer_print_basic_set( __isl_take isl_printer *printer, __isl_keep isl_basic_set *bset); __isl_give isl_printer *isl_printer_print_set( __isl_take isl_printer *printer, __isl_keep isl_set *set); #include __isl_give isl_printer *isl_printer_print_basic_map( __isl_take isl_printer *printer, __isl_keep isl_basic_map *bmap); __isl_give isl_printer *isl_printer_print_map( __isl_take isl_printer *printer, __isl_keep isl_map *map); #include __isl_give isl_printer *isl_printer_print_union_set( __isl_take isl_printer *p, __isl_keep isl_union_set *uset); #include __isl_give isl_printer *isl_printer_print_union_map( __isl_take isl_printer *p, __isl_keep isl_union_map *umap); When called on a file printer, the following function flushes the file. When called on a string printer, the buffer is cleared. __isl_give isl_printer *isl_printer_flush( __isl_take isl_printer *p); =head2 Creating New Sets and Relations C has functions for creating some standard sets and relations. =over =item * Empty sets and relations __isl_give isl_basic_set *isl_basic_set_empty( __isl_take isl_space *space); __isl_give isl_basic_map *isl_basic_map_empty( __isl_take isl_space *space); __isl_give isl_set *isl_set_empty( __isl_take isl_space *space); __isl_give isl_map *isl_map_empty( __isl_take isl_space *space); __isl_give isl_union_set *isl_union_set_empty( __isl_take isl_space *space); __isl_give isl_union_map *isl_union_map_empty( __isl_take isl_space *space); For Cs and Cs, the space is only used to specify the parameters. =item * Universe sets and relations __isl_give isl_basic_set *isl_basic_set_universe( __isl_take isl_space *space); __isl_give isl_basic_map *isl_basic_map_universe( __isl_take isl_space *space); __isl_give isl_set *isl_set_universe( __isl_take isl_space *space); __isl_give isl_map *isl_map_universe( __isl_take isl_space *space); __isl_give isl_union_set *isl_union_set_universe( __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_universe( __isl_take isl_union_map *umap); The sets and relations constructed by the functions above contain all integer values, while those constructed by the functions below only contain non-negative values. __isl_give isl_basic_set *isl_basic_set_nat_universe( __isl_take isl_space *space); __isl_give isl_basic_map *isl_basic_map_nat_universe( __isl_take isl_space *space); __isl_give isl_set *isl_set_nat_universe( __isl_take isl_space *space); __isl_give isl_map *isl_map_nat_universe( __isl_take isl_space *space); =item * Identity relations __isl_give isl_basic_map *isl_basic_map_identity( __isl_take isl_space *space); __isl_give isl_map *isl_map_identity( __isl_take isl_space *space); The number of input and output dimensions in C needs to be the same. =item * Lexicographic order __isl_give isl_map *isl_map_lex_lt( __isl_take isl_space *set_space); __isl_give isl_map *isl_map_lex_le( __isl_take isl_space *set_space); __isl_give isl_map *isl_map_lex_gt( __isl_take isl_space *set_space); __isl_give isl_map *isl_map_lex_ge( __isl_take isl_space *set_space); __isl_give isl_map *isl_map_lex_lt_first( __isl_take isl_space *space, unsigned n); __isl_give isl_map *isl_map_lex_le_first( __isl_take isl_space *space, unsigned n); __isl_give isl_map *isl_map_lex_gt_first( __isl_take isl_space *space, unsigned n); __isl_give isl_map *isl_map_lex_ge_first( __isl_take isl_space *space, unsigned n); The first four functions take a space for a B and return relations that express that the elements in the domain are lexicographically less (C), less or equal (C), greater (C) or greater or equal (C) than the elements in the range. The last four functions take a space for a map and return relations that express that the first C dimensions in the domain are lexicographically less (C), less or equal (C), greater (C) or greater or equal (C) than the first C dimensions in the range. =back A basic set or relation can be converted to a set or relation using the following functions. __isl_give isl_set *isl_set_from_basic_set( __isl_take isl_basic_set *bset); __isl_give isl_map *isl_map_from_basic_map( __isl_take isl_basic_map *bmap); Sets and relations can be converted to union sets and relations using the following functions. __isl_give isl_union_set *isl_union_set_from_basic_set( __isl_take isl_basic_set *bset); __isl_give isl_union_map *isl_union_map_from_basic_map( __isl_take isl_basic_map *bmap); __isl_give isl_union_set *isl_union_set_from_set( __isl_take isl_set *set); __isl_give isl_union_map *isl_union_map_from_map( __isl_take isl_map *map); The inverse conversions below can only be used if the input union set or relation is known to contain elements in exactly one space. __isl_give isl_set *isl_set_from_union_set( __isl_take isl_union_set *uset); __isl_give isl_map *isl_map_from_union_map( __isl_take isl_union_map *umap); A zero-dimensional (basic) set can be constructed on a given parameter domain using the following function. __isl_give isl_basic_set *isl_basic_set_from_params( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_from_params( __isl_take isl_set *set); Sets and relations can be copied and freed again using the following functions. __isl_give isl_basic_set *isl_basic_set_copy( __isl_keep isl_basic_set *bset); __isl_give isl_set *isl_set_copy(__isl_keep isl_set *set); __isl_give isl_union_set *isl_union_set_copy( __isl_keep isl_union_set *uset); __isl_give isl_basic_map *isl_basic_map_copy( __isl_keep isl_basic_map *bmap); __isl_give isl_map *isl_map_copy(__isl_keep isl_map *map); __isl_give isl_union_map *isl_union_map_copy( __isl_keep isl_union_map *umap); void *isl_basic_set_free(__isl_take isl_basic_set *bset); void *isl_set_free(__isl_take isl_set *set); void *isl_union_set_free(__isl_take isl_union_set *uset); void *isl_basic_map_free(__isl_take isl_basic_map *bmap); void *isl_map_free(__isl_take isl_map *map); void *isl_union_map_free(__isl_take isl_union_map *umap); Other sets and relations can be constructed by starting from a universe set or relation, adding equality and/or inequality constraints and then projecting out the existentially quantified variables, if any. Constraints can be constructed, manipulated and added to (or removed from) (basic) sets and relations using the following functions. #include __isl_give isl_constraint *isl_equality_alloc( __isl_take isl_local_space *ls); __isl_give isl_constraint *isl_inequality_alloc( __isl_take isl_local_space *ls); __isl_give isl_constraint *isl_constraint_set_constant( __isl_take isl_constraint *constraint, isl_int v); __isl_give isl_constraint *isl_constraint_set_constant_si( __isl_take isl_constraint *constraint, int v); __isl_give isl_constraint *isl_constraint_set_constant_val( __isl_take isl_constraint *constraint, __isl_take isl_val *v); __isl_give isl_constraint *isl_constraint_set_coefficient( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_constraint *isl_constraint_set_coefficient_si( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, int v); __isl_give isl_constraint * isl_constraint_set_coefficient_val( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_val *v); __isl_give isl_basic_map *isl_basic_map_add_constraint( __isl_take isl_basic_map *bmap, __isl_take isl_constraint *constraint); __isl_give isl_basic_set *isl_basic_set_add_constraint( __isl_take isl_basic_set *bset, __isl_take isl_constraint *constraint); __isl_give isl_map *isl_map_add_constraint( __isl_take isl_map *map, __isl_take isl_constraint *constraint); __isl_give isl_set *isl_set_add_constraint( __isl_take isl_set *set, __isl_take isl_constraint *constraint); __isl_give isl_basic_set *isl_basic_set_drop_constraint( __isl_take isl_basic_set *bset, __isl_take isl_constraint *constraint); For example, to create a set containing the even integers between 10 and 42, you would use the following code. isl_space *space; isl_local_space *ls; isl_constraint *c; isl_basic_set *bset; space = isl_space_set_alloc(ctx, 0, 2); bset = isl_basic_set_universe(isl_space_copy(space)); ls = isl_local_space_from_space(space); c = isl_equality_alloc(isl_local_space_copy(ls)); c = isl_constraint_set_coefficient_si(c, isl_dim_set, 0, -1); c = isl_constraint_set_coefficient_si(c, isl_dim_set, 1, 2); bset = isl_basic_set_add_constraint(bset, c); c = isl_inequality_alloc(isl_local_space_copy(ls)); c = isl_constraint_set_constant_si(c, -10); c = isl_constraint_set_coefficient_si(c, isl_dim_set, 0, 1); bset = isl_basic_set_add_constraint(bset, c); c = isl_inequality_alloc(ls); c = isl_constraint_set_constant_si(c, 42); c = isl_constraint_set_coefficient_si(c, isl_dim_set, 0, -1); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 1); Or, alternatively, isl_basic_set *bset; bset = isl_basic_set_read_from_str(ctx, "{[i] : exists (a : i = 2a and i >= 10 and i <= 42)}"); A basic set or relation can also be constructed from two matrices describing the equalities and the inequalities. __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices( __isl_take isl_space *space, __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4); __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices( __isl_take isl_space *space, __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5); The C arguments indicate the order in which different kinds of variables appear in the input matrices and should be a permutation of C, C, C and C for sets and of C, C, C, C and C for relations. A (basic or union) set or relation can also be constructed from a (union) (piecewise) (multiple) affine expression or a list of affine expressions (See L<"Piecewise Quasi Affine Expressions"> and L<"Piecewise Multiple Quasi Affine Expressions">). __isl_give isl_basic_map *isl_basic_map_from_aff( __isl_take isl_aff *aff); __isl_give isl_map *isl_map_from_aff( __isl_take isl_aff *aff); __isl_give isl_set *isl_set_from_pw_aff( __isl_take isl_pw_aff *pwaff); __isl_give isl_map *isl_map_from_pw_aff( __isl_take isl_pw_aff *pwaff); __isl_give isl_basic_map *isl_basic_map_from_aff_list( __isl_take isl_space *domain_space, __isl_take isl_aff_list *list); __isl_give isl_basic_map *isl_basic_map_from_multi_aff( __isl_take isl_multi_aff *maff) __isl_give isl_map *isl_map_from_multi_aff( __isl_take isl_multi_aff *maff) __isl_give isl_set *isl_set_from_pw_multi_aff( __isl_take isl_pw_multi_aff *pma); __isl_give isl_map *isl_map_from_pw_multi_aff( __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_map * isl_union_map_from_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma); The C argument describes the domain of the resulting basic relation. It is required because the C may consist of zero affine expressions. =head2 Inspecting Sets and Relations Usually, the user should not have to care about the actual constraints of the sets and maps, but should instead apply the abstract operations explained in the following sections. Occasionally, however, it may be required to inspect the individual coefficients of the constraints. This section explains how to do so. In these cases, it may also be useful to have C compute an explicit representation of the existentially quantified variables. __isl_give isl_set *isl_set_compute_divs( __isl_take isl_set *set); __isl_give isl_map *isl_map_compute_divs( __isl_take isl_map *map); __isl_give isl_union_set *isl_union_set_compute_divs( __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_compute_divs( __isl_take isl_union_map *umap); This explicit representation defines the existentially quantified variables as integer divisions of the other variables, possibly including earlier existentially quantified variables. An explicitly represented existentially quantified variable therefore has a unique value when the values of the other variables are known. If, furthermore, the same existentials, i.e., existentials with the same explicit representations, should appear in the same order in each of the disjuncts of a set or map, then the user should call either of the following functions. __isl_give isl_set *isl_set_align_divs( __isl_take isl_set *set); __isl_give isl_map *isl_map_align_divs( __isl_take isl_map *map); Alternatively, the existentially quantified variables can be removed using the following functions, which compute an overapproximation. __isl_give isl_basic_set *isl_basic_set_remove_divs( __isl_take isl_basic_set *bset); __isl_give isl_basic_map *isl_basic_map_remove_divs( __isl_take isl_basic_map *bmap); __isl_give isl_set *isl_set_remove_divs( __isl_take isl_set *set); __isl_give isl_map *isl_map_remove_divs( __isl_take isl_map *map); It is also possible to only remove those divs that are defined in terms of a given range of dimensions or only those for which no explicit representation is known. __isl_give isl_basic_set * isl_basic_set_remove_divs_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map * isl_basic_map_remove_divs_involving_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_remove_divs_involving_dims( __isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map *isl_map_remove_divs_involving_dims( __isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set * isl_basic_set_remove_unknown_divs( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_remove_unknown_divs( __isl_take isl_set *set); __isl_give isl_map *isl_map_remove_unknown_divs( __isl_take isl_map *map); To iterate over all the sets or maps in a union set or map, use int isl_union_set_foreach_set(__isl_keep isl_union_set *uset, int (*fn)(__isl_take isl_set *set, void *user), void *user); int isl_union_map_foreach_map(__isl_keep isl_union_map *umap, int (*fn)(__isl_take isl_map *map, void *user), void *user); The number of sets or maps in a union set or map can be obtained from int isl_union_set_n_set(__isl_keep isl_union_set *uset); int isl_union_map_n_map(__isl_keep isl_union_map *umap); To extract the set or map in a given space from a union, use __isl_give isl_set *isl_union_set_extract_set( __isl_keep isl_union_set *uset, __isl_take isl_space *space); __isl_give isl_map *isl_union_map_extract_map( __isl_keep isl_union_map *umap, __isl_take isl_space *space); To iterate over all the basic sets or maps in a set or map, use int isl_set_foreach_basic_set(__isl_keep isl_set *set, int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user); int isl_map_foreach_basic_map(__isl_keep isl_map *map, int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user); The callback function C should return 0 if successful and -1 if an error occurs. In the latter case, or if any other error occurs, the above functions will return -1. It should be noted that C does not guarantee that the basic sets or maps passed to C are disjoint. If this is required, then the user should call one of the following functions first. __isl_give isl_set *isl_set_make_disjoint( __isl_take isl_set *set); __isl_give isl_map *isl_map_make_disjoint( __isl_take isl_map *map); The number of basic sets in a set can be obtained from int isl_set_n_basic_set(__isl_keep isl_set *set); To iterate over the constraints of a basic set or map, use #include int isl_basic_set_n_constraint( __isl_keep isl_basic_set *bset); int isl_basic_set_foreach_constraint( __isl_keep isl_basic_set *bset, int (*fn)(__isl_take isl_constraint *c, void *user), void *user); int isl_basic_map_foreach_constraint( __isl_keep isl_basic_map *bmap, int (*fn)(__isl_take isl_constraint *c, void *user), void *user); void *isl_constraint_free(__isl_take isl_constraint *c); Again, the callback function C should return 0 if successful and -1 if an error occurs. In the latter case, or if any other error occurs, the above functions will return -1. The constraint C represents either an equality or an inequality. Use the following function to find out whether a constraint represents an equality. If not, it represents an inequality. int isl_constraint_is_equality( __isl_keep isl_constraint *constraint); The coefficients of the constraints can be inspected using the following functions. int isl_constraint_is_lower_bound( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); int isl_constraint_is_upper_bound( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); void isl_constraint_get_constant( __isl_keep isl_constraint *constraint, isl_int *v); __isl_give isl_val *isl_constraint_get_constant_val( __isl_keep isl_constraint *constraint); void isl_constraint_get_coefficient( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_val *isl_constraint_get_coefficient_val( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos); int isl_constraint_involves_dims( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned first, unsigned n); The explicit representations of the existentially quantified variables can be inspected using the following function. Note that the user is only allowed to use this function if the inspected set or map is the result of a call to C or C. The existentially quantified variable is equal to the floor of the returned affine expression. The affine expression itself can be inspected using the functions in L<"Piecewise Quasi Affine Expressions">. __isl_give isl_aff *isl_constraint_get_div( __isl_keep isl_constraint *constraint, int pos); To obtain the constraints of a basic set or map in matrix form, use the following functions. __isl_give isl_mat *isl_basic_set_equalities_matrix( __isl_keep isl_basic_set *bset, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4); __isl_give isl_mat *isl_basic_set_inequalities_matrix( __isl_keep isl_basic_set *bset, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4); __isl_give isl_mat *isl_basic_map_equalities_matrix( __isl_keep isl_basic_map *bmap, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5); __isl_give isl_mat *isl_basic_map_inequalities_matrix( __isl_keep isl_basic_map *bmap, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5); The C arguments dictate the order in which different kinds of variables appear in the resulting matrix and should be a permutation of C, C, C, C and C. The number of parameters, input, output or set dimensions can be obtained using the following functions. unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset, enum isl_dim_type type); unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap, enum isl_dim_type type); unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type); unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type); To check whether the description of a set or relation depends on one or more given dimensions, it is not necessary to iterate over all constraints. Instead the following functions can be used. int isl_basic_set_involves_dims( __isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); int isl_set_involves_dims(__isl_keep isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); int isl_basic_map_involves_dims( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); int isl_map_involves_dims(__isl_keep isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); Similarly, the following functions can be used to check whether a given dimension is involved in any lower or upper bound. int isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_set_dim_has_any_upper_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); Note that these functions return true even if there is a bound on the dimension on only some of the basic sets of C. To check if they have a bound for all of the basic sets in C, use the following functions instead. int isl_set_dim_has_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_set_dim_has_upper_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); The identifiers or names of the domain and range spaces of a set or relation can be read off or set using the following functions. __isl_give isl_set *isl_set_set_tuple_id( __isl_take isl_set *set, __isl_take isl_id *id); __isl_give isl_set *isl_set_reset_tuple_id( __isl_take isl_set *set); int isl_set_has_tuple_id(__isl_keep isl_set *set); __isl_give isl_id *isl_set_get_tuple_id( __isl_keep isl_set *set); __isl_give isl_map *isl_map_set_tuple_id( __isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_map *isl_map_reset_tuple_id( __isl_take isl_map *map, enum isl_dim_type type); int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type); __isl_give isl_id *isl_map_get_tuple_id( __isl_keep isl_map *map, enum isl_dim_type type); const char *isl_basic_set_get_tuple_name( __isl_keep isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_set_tuple_name( __isl_take isl_basic_set *set, const char *s); int isl_set_has_tuple_name(__isl_keep isl_set *set); const char *isl_set_get_tuple_name( __isl_keep isl_set *set); const char *isl_basic_map_get_tuple_name( __isl_keep isl_basic_map *bmap, enum isl_dim_type type); __isl_give isl_basic_map *isl_basic_map_set_tuple_name( __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s); int isl_map_has_tuple_name(__isl_keep isl_map *map, enum isl_dim_type type); const char *isl_map_get_tuple_name( __isl_keep isl_map *map, enum isl_dim_type type); As with C, the value returned points to an internal data structure. The identifiers, positions or names of individual dimensions can be read off using the following functions. __isl_give isl_id *isl_basic_set_get_dim_id( __isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos); __isl_give isl_set *isl_set_set_dim_id( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_set_has_dim_id(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_set_get_dim_id( __isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_basic_map_has_dim_id( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); __isl_give isl_map *isl_map_set_dim_id( __isl_take isl_map *map, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_map_has_dim_id(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_map_get_dim_id( __isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type, __isl_keep isl_id *id); int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type, __isl_keep isl_id *id); int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type, const char *name); int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type, const char *name); const char *isl_constraint_get_dim_name( __isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); const char *isl_basic_set_get_dim_name( __isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos); int isl_set_has_dim_name(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); const char *isl_set_get_dim_name( __isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); const char *isl_basic_map_get_dim_name( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); int isl_map_has_dim_name(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); const char *isl_map_get_dim_name( __isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); These functions are mostly useful to obtain the identifiers, positions or names of the parameters. Identifiers of individual dimensions are essentially only useful for printing. They are ignored by all other operations and may not be preserved across those operations. =head2 Properties =head3 Unary Properties =over =item * Emptiness The following functions test whether the given set or relation contains any integer points. The ``plain'' variants do not perform any computations, but simply check if the given set or relation is already known to be empty. int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset); int isl_basic_set_is_empty(__isl_keep isl_basic_set *bset); int isl_set_plain_is_empty(__isl_keep isl_set *set); int isl_set_is_empty(__isl_keep isl_set *set); int isl_union_set_is_empty(__isl_keep isl_union_set *uset); int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap); int isl_basic_map_is_empty(__isl_keep isl_basic_map *bmap); int isl_map_plain_is_empty(__isl_keep isl_map *map); int isl_map_is_empty(__isl_keep isl_map *map); int isl_union_map_is_empty(__isl_keep isl_union_map *umap); =item * Universality int isl_basic_set_is_universe(__isl_keep isl_basic_set *bset); int isl_basic_map_is_universe(__isl_keep isl_basic_map *bmap); int isl_set_plain_is_universe(__isl_keep isl_set *set); =item * Single-valuedness int isl_basic_map_is_single_valued( __isl_keep isl_basic_map *bmap); int isl_map_plain_is_single_valued( __isl_keep isl_map *map); int isl_map_is_single_valued(__isl_keep isl_map *map); int isl_union_map_is_single_valued(__isl_keep isl_union_map *umap); =item * Injectivity int isl_map_plain_is_injective(__isl_keep isl_map *map); int isl_map_is_injective(__isl_keep isl_map *map); int isl_union_map_plain_is_injective( __isl_keep isl_union_map *umap); int isl_union_map_is_injective( __isl_keep isl_union_map *umap); =item * Bijectivity int isl_map_is_bijective(__isl_keep isl_map *map); int isl_union_map_is_bijective(__isl_keep isl_union_map *umap); =item * Position int isl_basic_map_plain_is_fixed( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, isl_int *val); int isl_set_plain_is_fixed(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos, isl_int *val); int isl_map_plain_is_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_int *val); Check if the relation obviously lies on a hyperplane where the given dimension has a fixed value and if so, return that value in C<*val>. __isl_give isl_val * isl_basic_map_plain_get_val_if_fixed( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); __isl_give isl_val *isl_set_plain_get_val_if_fixed( __isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); __isl_give isl_val *isl_map_plain_get_val_if_fixed( __isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); If the set or relation obviously lies on a hyperplane where the given dimension has a fixed value, then return that value. Otherwise return NaN. =item * Stride int isl_set_dim_residue_class_val( __isl_keep isl_set *set, int pos, __isl_give isl_val **modulo, __isl_give isl_val **residue); Check if the values of the given set dimension are equal to a fixed value modulo some integer value. If so, assign the modulo to C<*modulo> and the fixed value to C<*residue>. If the given dimension attains only a single value, then assign C<0> to C<*modulo> and the fixed value to C<*residue>. If the dimension does not attain only a single value and if no modulo can be found then assign C<1> to C<*modulo> and C<1> to C<*residue>. =item * Space To check whether a set is a parameter domain, use this function: int isl_set_is_params(__isl_keep isl_set *set); int isl_union_set_is_params( __isl_keep isl_union_set *uset); =item * Wrapping The following functions check whether the domain of the given (basic) set is a wrapped relation. int isl_basic_set_is_wrapping( __isl_keep isl_basic_set *bset); int isl_set_is_wrapping(__isl_keep isl_set *set); =item * Internal Product int isl_basic_map_can_zip( __isl_keep isl_basic_map *bmap); int isl_map_can_zip(__isl_keep isl_map *map); Check whether the product of domain and range of the given relation can be computed, i.e., whether both domain and range are nested relations. =item * Currying int isl_basic_map_can_curry( __isl_keep isl_basic_map *bmap); int isl_map_can_curry(__isl_keep isl_map *map); Check whether the domain of the (basic) relation is a wrapped relation. int isl_basic_map_can_uncurry( __isl_keep isl_basic_map *bmap); int isl_map_can_uncurry(__isl_keep isl_map *map); Check whether the range of the (basic) relation is a wrapped relation. =back =head3 Binary Properties =over =item * Equality int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_union_set_is_equal( __isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); int isl_basic_map_is_equal( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); int isl_union_map_is_equal( __isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); =item * Disjointness int isl_set_plain_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_map_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2); =item * Subset int isl_basic_set_is_subset( __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); int isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_is_strict_subset( __isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_union_set_is_subset( __isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); int isl_union_set_is_strict_subset( __isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); int isl_basic_map_is_subset( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); int isl_basic_map_is_strict_subset( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); int isl_map_is_subset( __isl_keep isl_map *map1, __isl_keep isl_map *map2); int isl_map_is_strict_subset( __isl_keep isl_map *map1, __isl_keep isl_map *map2); int isl_union_map_is_subset( __isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); int isl_union_map_is_strict_subset( __isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); Check whether the first argument is a (strict) subset of the second argument. =item * Order int isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2); This function is useful for sorting Cs. The order depends on the internal representation of the inputs. The order is fixed over different calls to the function (assuming the internal representation of the inputs has not changed), but may change over different versions of C. =back =head2 Unary Operations =over =item * Complement __isl_give isl_set *isl_set_complement( __isl_take isl_set *set); __isl_give isl_map *isl_map_complement( __isl_take isl_map *map); =item * Inverse map __isl_give isl_basic_map *isl_basic_map_reverse( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_reverse( __isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_reverse( __isl_take isl_union_map *umap); =item * Projection __isl_give isl_basic_set *isl_basic_set_project_out( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map *isl_basic_map_project_out( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set *isl_basic_set_params( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_map_domain( __isl_take isl_basic_map *bmap); __isl_give isl_basic_set *isl_basic_map_range( __isl_take isl_basic_map *bmap); __isl_give isl_set *isl_set_params(__isl_take isl_set *set); __isl_give isl_set *isl_map_params(__isl_take isl_map *map); __isl_give isl_set *isl_map_domain( __isl_take isl_map *bmap); __isl_give isl_set *isl_map_range( __isl_take isl_map *map); __isl_give isl_set *isl_union_set_params( __isl_take isl_union_set *uset); __isl_give isl_set *isl_union_map_params( __isl_take isl_union_map *umap); __isl_give isl_union_set *isl_union_map_domain( __isl_take isl_union_map *umap); __isl_give isl_union_set *isl_union_map_range( __isl_take isl_union_map *umap); __isl_give isl_basic_map *isl_basic_map_domain_map( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_range_map( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map); __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_domain_map( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_range_map( __isl_take isl_union_map *umap); The functions above construct a (basic, regular or union) relation that maps (a wrapped version of) the input relation to its domain or range. =item * Elimination __isl_give isl_basic_set *isl_basic_set_eliminate( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_eliminate( __isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map *isl_basic_map_eliminate( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map *isl_map_eliminate( __isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); Eliminate the coefficients for the given dimensions from the constraints, without removing the dimensions. =item * Slicing __isl_give isl_basic_set *isl_basic_set_fix( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_basic_set *isl_basic_set_fix_si( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_basic_set *isl_basic_set_fix_val( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); __isl_give isl_set *isl_set_fix(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_fix_val( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); __isl_give isl_basic_map *isl_basic_map_fix_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_basic_map *isl_basic_map_fix_val( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); __isl_give isl_map *isl_map_fix(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_map *isl_map_fix_si(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_map *isl_map_fix_val( __isl_take isl_map *map, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); Intersect the set or relation with the hyperplane where the given dimension has the fixed given value. __isl_give isl_basic_map *isl_basic_map_lower_bound_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_basic_map *isl_basic_map_upper_bound_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_lower_bound( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_set *isl_set_lower_bound_si( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_lower_bound_val( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *value); __isl_give isl_map *isl_map_lower_bound_si( __isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_upper_bound( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_set *isl_set_upper_bound_si( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_upper_bound_val( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *value); __isl_give isl_map *isl_map_upper_bound_si( __isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value); Intersect the set or relation with the half-space where the given dimension has a value bounded by the fixed given integer value. __isl_give isl_set *isl_set_equate(__isl_take isl_set *set, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_basic_map *isl_basic_map_equate( __isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_map *isl_map_equate(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); Intersect the set or relation with the hyperplane where the given dimensions are equal to each other. __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); Intersect the relation with the hyperplane where the given dimensions have opposite values. __isl_give isl_basic_map *isl_basic_map_order_ge( __isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_basic_map *isl_basic_map_order_gt( __isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); Intersect the relation with the half-space where the given dimensions satisfy the given ordering. =item * Identity __isl_give isl_map *isl_set_identity( __isl_take isl_set *set); __isl_give isl_union_map *isl_union_set_identity( __isl_take isl_union_set *uset); Construct an identity relation on the given (union) set. =item * Deltas __isl_give isl_basic_set *isl_basic_map_deltas( __isl_take isl_basic_map *bmap); __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map); __isl_give isl_union_set *isl_union_map_deltas( __isl_take isl_union_map *umap); These functions return a (basic) set containing the differences between image elements and corresponding domain elements in the input. __isl_give isl_basic_map *isl_basic_map_deltas_map( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_deltas_map( __isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_deltas_map( __isl_take isl_union_map *umap); The functions above construct a (basic, regular or union) relation that maps (a wrapped version of) the input relation to its delta set. =item * Coalescing Simplify the representation of a set or relation by trying to combine pairs of basic sets or relations into a single basic set or relation. __isl_give isl_set *isl_set_coalesce(__isl_take isl_set *set); __isl_give isl_map *isl_map_coalesce(__isl_take isl_map *map); __isl_give isl_union_set *isl_union_set_coalesce( __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_coalesce( __isl_take isl_union_map *umap); One of the methods for combining pairs of basic sets or relations can result in coefficients that are much larger than those that appear in the constraints of the input. By default, the coefficients are not allowed to grow larger, but this can be changed by unsetting the following option. int isl_options_set_coalesce_bounded_wrapping( isl_ctx *ctx, int val); int isl_options_get_coalesce_bounded_wrapping( isl_ctx *ctx); =item * Detecting equalities __isl_give isl_basic_set *isl_basic_set_detect_equalities( __isl_take isl_basic_set *bset); __isl_give isl_basic_map *isl_basic_map_detect_equalities( __isl_take isl_basic_map *bmap); __isl_give isl_set *isl_set_detect_equalities( __isl_take isl_set *set); __isl_give isl_map *isl_map_detect_equalities( __isl_take isl_map *map); __isl_give isl_union_set *isl_union_set_detect_equalities( __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_detect_equalities( __isl_take isl_union_map *umap); Simplify the representation of a set or relation by detecting implicit equalities. =item * Removing redundant constraints __isl_give isl_basic_set *isl_basic_set_remove_redundancies( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_remove_redundancies( __isl_take isl_set *set); __isl_give isl_basic_map *isl_basic_map_remove_redundancies( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_remove_redundancies( __isl_take isl_map *map); =item * Convex hull __isl_give isl_basic_set *isl_set_convex_hull( __isl_take isl_set *set); __isl_give isl_basic_map *isl_map_convex_hull( __isl_take isl_map *map); If the input set or relation has any existentially quantified variables, then the result of these operations is currently undefined. =item * Simple hull __isl_give isl_basic_set * isl_set_unshifted_simple_hull( __isl_take isl_set *set); __isl_give isl_basic_map * isl_map_unshifted_simple_hull( __isl_take isl_map *map); __isl_give isl_basic_set *isl_set_simple_hull( __isl_take isl_set *set); __isl_give isl_basic_map *isl_map_simple_hull( __isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_simple_hull( __isl_take isl_union_map *umap); These functions compute a single basic set or relation that contains the whole input set or relation. In particular, the output is described by translates of the constraints describing the basic sets or relations in the input. In case of C, only the original constraints are used, without any translation. =begin latex (See \autoref{s:simple hull}.) =end latex =item * Affine hull __isl_give isl_basic_set *isl_basic_set_affine_hull( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_set_affine_hull( __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_affine_hull( __isl_take isl_union_set *uset); __isl_give isl_basic_map *isl_basic_map_affine_hull( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_map_affine_hull( __isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_affine_hull( __isl_take isl_union_map *umap); In case of union sets and relations, the affine hull is computed per space. =item * Polyhedral hull __isl_give isl_basic_set *isl_set_polyhedral_hull( __isl_take isl_set *set); __isl_give isl_basic_map *isl_map_polyhedral_hull( __isl_take isl_map *map); __isl_give isl_union_set *isl_union_set_polyhedral_hull( __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_polyhedral_hull( __isl_take isl_union_map *umap); These functions compute a single basic set or relation not involving any existentially quantified variables that contains the whole input set or relation. In case of union sets and relations, the polyhedral hull is computed per space. =item * Other approximations __isl_give isl_basic_set * isl_basic_set_drop_constraints_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map * isl_basic_map_drop_constraints_involving_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set * isl_basic_set_drop_constraints_not_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set * isl_set_drop_constraints_involving_dims( __isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map * isl_map_drop_constraints_involving_dims( __isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); These functions drop any constraints (not) involving the specified dimensions. Note that the result depends on the representation of the input. =item * Feasibility __isl_give isl_basic_set *isl_basic_set_sample( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_set_sample( __isl_take isl_set *set); __isl_give isl_basic_map *isl_basic_map_sample( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_map_sample( __isl_take isl_map *map); If the input (basic) set or relation is non-empty, then return a singleton subset of the input. Otherwise, return an empty set. =item * Optimization #include enum isl_lp_result isl_basic_set_max( __isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj, isl_int *opt) __isl_give isl_val *isl_basic_set_max_val( __isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj); enum isl_lp_result isl_set_min(__isl_keep isl_set *set, __isl_keep isl_aff *obj, isl_int *opt); __isl_give isl_val *isl_set_min_val( __isl_keep isl_set *set, __isl_keep isl_aff *obj); enum isl_lp_result isl_set_max(__isl_keep isl_set *set, __isl_keep isl_aff *obj, isl_int *opt); __isl_give isl_val *isl_set_max_val( __isl_keep isl_set *set, __isl_keep isl_aff *obj); Compute the minimum or maximum of the integer affine expression C over the points in C, returning the result in C. The return value may be one of C, C, C or C, in case of an C. If the result is an C then the result is C in case of an error, the optimal value in case there is one, negative infinity or infinity if the problem is unbounded and NaN if the problem is empty. =item * Parametric optimization __isl_give isl_pw_aff *isl_set_dim_min( __isl_take isl_set *set, int pos); __isl_give isl_pw_aff *isl_set_dim_max( __isl_take isl_set *set, int pos); __isl_give isl_pw_aff *isl_map_dim_max( __isl_take isl_map *map, int pos); Compute the minimum or maximum of the given set or output dimension as a function of the parameters (and input dimensions), but independently of the other set or output dimensions. For lexicographic optimization, see L<"Lexicographic Optimization">. =item * Dual The following functions compute either the set of (rational) coefficient values of valid constraints for the given set or the set of (rational) values satisfying the constraints with coefficients from the given set. Internally, these two sets of functions perform essentially the same operations, except that the set of coefficients is assumed to be a cone, while the set of values may be any polyhedron. The current implementation is based on the Farkas lemma and Fourier-Motzkin elimination, but this may change or be made optional in future. In particular, future implementations may use different dualization algorithms or skip the elimination step. __isl_give isl_basic_set *isl_basic_set_coefficients( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_set_coefficients( __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_coefficients( __isl_take isl_union_set *bset); __isl_give isl_basic_set *isl_basic_set_solutions( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_set_solutions( __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_solutions( __isl_take isl_union_set *bset); =item * Power __isl_give isl_map *isl_map_fixed_power( __isl_take isl_map *map, isl_int exp); __isl_give isl_map *isl_map_fixed_power_val( __isl_take isl_map *map, __isl_take isl_val *exp); __isl_give isl_union_map *isl_union_map_fixed_power( __isl_take isl_union_map *umap, isl_int exp); __isl_give isl_union_map * isl_union_map_fixed_power_val( __isl_take isl_union_map *umap, __isl_take isl_val *exp); Compute the given power of C, where C is assumed to be non-zero. If the exponent C is negative, then the -C th power of the inverse of C is computed. __isl_give isl_map *isl_map_power(__isl_take isl_map *map, int *exact); __isl_give isl_union_map *isl_union_map_power( __isl_take isl_union_map *umap, int *exact); Compute a parametric representation for all positive powers I of C. The result maps I to a nested relation corresponding to the Ith power of C. The result may be an overapproximation. If the result is known to be exact, then C<*exact> is set to C<1>. =item * Transitive closure __isl_give isl_map *isl_map_transitive_closure( __isl_take isl_map *map, int *exact); __isl_give isl_union_map *isl_union_map_transitive_closure( __isl_take isl_union_map *umap, int *exact); Compute the transitive closure of C. The result may be an overapproximation. If the result is known to be exact, then C<*exact> is set to C<1>. =item * Reaching path lengths __isl_give isl_map *isl_map_reaching_path_lengths( __isl_take isl_map *map, int *exact); Compute a relation that maps each element in the range of C to the lengths of all paths composed of edges in C that end up in the given element. The result may be an overapproximation. If the result is known to be exact, then C<*exact> is set to C<1>. To compute the I path length, the resulting relation should be postprocessed by C. In particular, if the input relation is a dependence relation (mapping sources to sinks), then the maximal path length corresponds to the free schedule. Note, however, that C expects the maximum to be finite, so if the path lengths are unbounded (possibly due to the overapproximation), then you will get an error message. =item * Wrapping __isl_give isl_basic_set *isl_basic_map_wrap( __isl_take isl_basic_map *bmap); __isl_give isl_set *isl_map_wrap( __isl_take isl_map *map); __isl_give isl_union_set *isl_union_map_wrap( __isl_take isl_union_map *umap); __isl_give isl_basic_map *isl_basic_set_unwrap( __isl_take isl_basic_set *bset); __isl_give isl_map *isl_set_unwrap( __isl_take isl_set *set); __isl_give isl_union_map *isl_union_set_unwrap( __isl_take isl_union_set *uset); =item * Flattening Remove any internal structure of domain (and range) of the given set or relation. If there is any such internal structure in the input, then the name of the space is also removed. __isl_give isl_basic_set *isl_basic_set_flatten( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_flatten( __isl_take isl_set *set); __isl_give isl_basic_map *isl_basic_map_flatten_domain( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_flatten_range( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_flatten_range( __isl_take isl_map *map); __isl_give isl_map *isl_map_flatten_domain( __isl_take isl_map *map); __isl_give isl_basic_map *isl_basic_map_flatten( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_flatten( __isl_take isl_map *map); __isl_give isl_map *isl_set_flatten_map( __isl_take isl_set *set); The function above constructs a relation that maps the input set to a flattened version of the set. =item * Lifting Lift the input set to a space with extra dimensions corresponding to the existentially quantified variables in the input. In particular, the result lives in a wrapped map where the domain is the original space and the range corresponds to the original existentially quantified variables. __isl_give isl_basic_set *isl_basic_set_lift( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_lift( __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_lift( __isl_take isl_union_set *uset); Given a local space that contains the existentially quantified variables of a set, a basic relation that, when applied to a basic set, has essentially the same effect as C, can be constructed using the following function. #include __isl_give isl_basic_map *isl_local_space_lifting( __isl_take isl_local_space *ls); =item * Internal Product __isl_give isl_basic_map *isl_basic_map_zip( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_zip( __isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_zip( __isl_take isl_union_map *umap); Given a relation with nested relations for domain and range, interchange the range of the domain with the domain of the range. =item * Currying __isl_give isl_basic_map *isl_basic_map_curry( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_uncurry( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_curry( __isl_take isl_map *map); __isl_give isl_map *isl_map_uncurry( __isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_curry( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_uncurry( __isl_take isl_union_map *umap); Given a relation with a nested relation for domain, the C functions move the range of the nested relation out of the domain and use it as the domain of a nested relation in the range, with the original range as range of this nested relation. The C functions perform the inverse operation. =item * Aligning parameters __isl_give isl_basic_set *isl_basic_set_align_params( __isl_take isl_basic_set *bset, __isl_take isl_space *model); __isl_give isl_set *isl_set_align_params( __isl_take isl_set *set, __isl_take isl_space *model); __isl_give isl_basic_map *isl_basic_map_align_params( __isl_take isl_basic_map *bmap, __isl_take isl_space *model); __isl_give isl_map *isl_map_align_params( __isl_take isl_map *map, __isl_take isl_space *model); Change the order of the parameters of the given set or relation such that the first parameters match those of C. This may involve the introduction of extra parameters. All parameters need to be named. =item * Dimension manipulation __isl_give isl_basic_set *isl_basic_set_add_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned n); __isl_give isl_set *isl_set_add_dims( __isl_take isl_set *set, enum isl_dim_type type, unsigned n); __isl_give isl_map *isl_map_add_dims( __isl_take isl_map *map, enum isl_dim_type type, unsigned n); __isl_give isl_basic_set *isl_basic_set_insert_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_basic_map *isl_basic_map_insert_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_set *isl_set_insert_dims( __isl_take isl_set *set, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_map *isl_map_insert_dims( __isl_take isl_map *map, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_basic_set *isl_basic_set_move_dims( __isl_take isl_basic_set *bset, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_basic_map *isl_basic_map_move_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_set *isl_set_move_dims( __isl_take isl_set *set, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_map *isl_map_move_dims( __isl_take isl_map *map, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); It is usually not advisable to directly change the (input or output) space of a set or a relation as this removes the name and the internal structure of the space. However, the above functions can be useful to add new parameters, assuming C and C are not sufficient. =back =head2 Binary Operations The two arguments of a binary operation not only need to live in the same C, they currently also need to have the same (number of) parameters. =head3 Basic Operations =over =item * Intersection __isl_give isl_basic_set *isl_basic_set_intersect_params( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_give isl_basic_set *isl_basic_set_intersect( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_give isl_set *isl_set_intersect_params( __isl_take isl_set *set, __isl_take isl_set *params); __isl_give isl_set *isl_set_intersect( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_union_set *isl_union_set_intersect_params( __isl_take isl_union_set *uset, __isl_take isl_set *set); __isl_give isl_union_map *isl_union_map_intersect_params( __isl_take isl_union_map *umap, __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_intersect( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_basic_map *isl_basic_map_intersect_domain( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *bset); __isl_give isl_basic_map *isl_basic_map_intersect_range( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *bset); __isl_give isl_basic_map *isl_basic_map_intersect( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_intersect_params( __isl_take isl_map *map, __isl_take isl_set *params); __isl_give isl_map *isl_map_intersect_domain( __isl_take isl_map *map, __isl_take isl_set *set); __isl_give isl_map *isl_map_intersect_range( __isl_take isl_map *map, __isl_take isl_set *set); __isl_give isl_map *isl_map_intersect( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_union_map *isl_union_map_intersect_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_intersect_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_intersect( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); The second argument to the C<_params> functions needs to be a parametric (basic) set. For the other functions, a parametric set for either argument is only allowed if the other argument is a parametric set as well. =item * Union __isl_give isl_set *isl_basic_set_union( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_give isl_map *isl_basic_map_union( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_set *isl_set_union( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_map *isl_map_union( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_union_set *isl_union_set_union( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_union_map *isl_union_map_union( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); =item * Set difference __isl_give isl_set *isl_set_subtract( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_map *isl_map_subtract( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_subtract_domain( __isl_take isl_map *map, __isl_take isl_set *dom); __isl_give isl_map *isl_map_subtract_range( __isl_take isl_map *map, __isl_take isl_set *dom); __isl_give isl_union_set *isl_union_set_subtract( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_union_map *isl_union_map_subtract( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_subtract_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom); __isl_give isl_union_map *isl_union_map_subtract_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom); =item * Application __isl_give isl_basic_set *isl_basic_set_apply( __isl_take isl_basic_set *bset, __isl_take isl_basic_map *bmap); __isl_give isl_set *isl_set_apply( __isl_take isl_set *set, __isl_take isl_map *map); __isl_give isl_union_set *isl_union_set_apply( __isl_take isl_union_set *uset, __isl_take isl_union_map *umap); __isl_give isl_basic_map *isl_basic_map_apply_domain( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_basic_map *isl_basic_map_apply_range( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_apply_domain( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_union_map *isl_union_map_apply_domain( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_map *isl_map_apply_range( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_union_map *isl_union_map_apply_range( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); =item * Preimage __isl_give isl_basic_set * isl_basic_set_preimage_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_multi_aff *ma); __isl_give isl_set *isl_set_preimage_multi_aff( __isl_take isl_set *set, __isl_take isl_multi_aff *ma); __isl_give isl_set *isl_set_preimage_pw_multi_aff( __isl_take isl_set *set, __isl_take isl_pw_multi_aff *pma); __isl_give isl_map *isl_map_preimage_domain_multi_aff( __isl_take isl_map *map, __isl_take isl_multi_aff *ma); __isl_give isl_union_map * isl_union_map_preimage_domain_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma); These functions compute the preimage of the given set or map domain under the given function. In other words, the expression is plugged into the set description or into the domain of the map. Objects of types C and C are described in L. =item * Cartesian Product __isl_give isl_set *isl_set_product( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_union_set *isl_union_set_product( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_basic_map *isl_basic_map_domain_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_basic_map *isl_basic_map_range_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_basic_map *isl_basic_map_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_domain_product( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_range_product( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_union_map *isl_union_map_domain_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_map *isl_map_product( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_union_map *isl_union_map_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); The above functions compute the cross product of the given sets or relations. The domains and ranges of the results are wrapped maps between domains and ranges of the inputs. To obtain a ``flat'' product, use the following functions instead. __isl_give isl_basic_set *isl_basic_set_flat_product( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_give isl_set *isl_set_flat_product( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_basic_map *isl_basic_map_flat_range_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_flat_domain_product( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_flat_range_product( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_union_map *isl_union_map_flat_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_basic_map *isl_basic_map_flat_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_flat_product( __isl_take isl_map *map1, __isl_take isl_map *map2); =item * Simplification __isl_give isl_basic_set *isl_basic_set_gist( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *context); __isl_give isl_set *isl_set_gist(__isl_take isl_set *set, __isl_take isl_set *context); __isl_give isl_set *isl_set_gist_params( __isl_take isl_set *set, __isl_take isl_set *context); __isl_give isl_union_set *isl_union_set_gist( __isl_take isl_union_set *uset, __isl_take isl_union_set *context); __isl_give isl_union_set *isl_union_set_gist_params( __isl_take isl_union_set *uset, __isl_take isl_set *set); __isl_give isl_basic_map *isl_basic_map_gist( __isl_take isl_basic_map *bmap, __isl_take isl_basic_map *context); __isl_give isl_map *isl_map_gist(__isl_take isl_map *map, __isl_take isl_map *context); __isl_give isl_map *isl_map_gist_params( __isl_take isl_map *map, __isl_take isl_set *context); __isl_give isl_map *isl_map_gist_domain( __isl_take isl_map *map, __isl_take isl_set *context); __isl_give isl_map *isl_map_gist_range( __isl_take isl_map *map, __isl_take isl_set *context); __isl_give isl_union_map *isl_union_map_gist( __isl_take isl_union_map *umap, __isl_take isl_union_map *context); __isl_give isl_union_map *isl_union_map_gist_params( __isl_take isl_union_map *umap, __isl_take isl_set *set); __isl_give isl_union_map *isl_union_map_gist_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_gist_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); The gist operation returns a set or relation that has the same intersection with the context as the input set or relation. Any implicit equality in the intersection is made explicit in the result, while all inequalities that are redundant with respect to the intersection are removed. In case of union sets and relations, the gist operation is performed per space. =back =head3 Lexicographic Optimization Given a (basic) set C (or C) and a zero-dimensional domain C, the following functions compute a set that contains the lexicographic minimum or maximum of the elements in C (or C) for those values of the parameters that satisfy C. If C is not C, then C<*empty> is assigned a set that contains the parameter values in C for which C (or C) has no elements. In other words, the union of the parameter values for which the result is non-empty and of C<*empty> is equal to C. __isl_give isl_set *isl_basic_set_partial_lexmin( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_set *isl_basic_set_partial_lexmax( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_set *isl_set_partial_lexmin( __isl_take isl_set *set, __isl_take isl_set *dom, __isl_give isl_set **empty); __isl_give isl_set *isl_set_partial_lexmax( __isl_take isl_set *set, __isl_take isl_set *dom, __isl_give isl_set **empty); Given a (basic) set C (or C), the following functions simply return a set containing the lexicographic minimum or maximum of the elements in C (or C). In case of union sets, the optimum is computed per space. __isl_give isl_set *isl_basic_set_lexmin( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_basic_set_lexmax( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_lexmin( __isl_take isl_set *set); __isl_give isl_set *isl_set_lexmax( __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_lexmin( __isl_take isl_union_set *uset); __isl_give isl_union_set *isl_union_set_lexmax( __isl_take isl_union_set *uset); Given a (basic) relation C (or C) and a domain C, the following functions compute a relation that maps each element of C to the single lexicographic minimum or maximum of the elements that are associated to that same element in C (or C). If C is not C, then C<*empty> is assigned a set that contains the elements in C that do not map to any elements in C (or C). In other words, the union of the domain of the result and of C<*empty> is equal to C. __isl_give isl_map *isl_basic_map_partial_lexmax( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_map *isl_basic_map_partial_lexmin( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_map *isl_map_partial_lexmax( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty); __isl_give isl_map *isl_map_partial_lexmin( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty); Given a (basic) map C (or C), the following functions simply return a map mapping each element in the domain of C (or C) to the lexicographic minimum or maximum of all elements associated to that element. In case of union relations, the optimum is computed per space. __isl_give isl_map *isl_basic_map_lexmin( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_basic_map_lexmax( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_lexmin( __isl_take isl_map *map); __isl_give isl_map *isl_map_lexmax( __isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_lexmin( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_lexmax( __isl_take isl_union_map *umap); The following functions return their result in the form of a piecewise multi-affine expression (See L<"Piecewise Multiple Quasi Affine Expressions">), but are otherwise equivalent to the corresponding functions returning a basic set or relation. __isl_give isl_pw_multi_aff * isl_basic_map_lexmin_pw_multi_aff( __isl_take isl_basic_map *bmap); __isl_give isl_pw_multi_aff * isl_basic_set_partial_lexmin_pw_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff * isl_basic_set_partial_lexmax_pw_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff * isl_basic_map_partial_lexmin_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff * isl_basic_map_partial_lexmax_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff *isl_set_lexmin_pw_multi_aff( __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_set_lexmax_pw_multi_aff( __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_map_lexmin_pw_multi_aff( __isl_take isl_map *map); __isl_give isl_pw_multi_aff *isl_map_lexmax_pw_multi_aff( __isl_take isl_map *map); =head2 Lists Lists are defined over several element types, including C, C, C, C, C, C, C, C and C. Here we take lists of Cs as an example. Lists can be created, copied, modified and freed using the following functions. #include __isl_give isl_set_list *isl_set_list_from_set( __isl_take isl_set *el); __isl_give isl_set_list *isl_set_list_alloc( isl_ctx *ctx, int n); __isl_give isl_set_list *isl_set_list_copy( __isl_keep isl_set_list *list); __isl_give isl_set_list *isl_set_list_insert( __isl_take isl_set_list *list, unsigned pos, __isl_take isl_set *el); __isl_give isl_set_list *isl_set_list_add( __isl_take isl_set_list *list, __isl_take isl_set *el); __isl_give isl_set_list *isl_set_list_drop( __isl_take isl_set_list *list, unsigned first, unsigned n); __isl_give isl_set_list *isl_set_list_set_set( __isl_take isl_set_list *list, int index, __isl_take isl_set *set); __isl_give isl_set_list *isl_set_list_concat( __isl_take isl_set_list *list1, __isl_take isl_set_list *list2); __isl_give isl_set_list *isl_set_list_sort( __isl_take isl_set_list *list, int (*cmp)(__isl_keep isl_set *a, __isl_keep isl_set *b, void *user), void *user); void *isl_set_list_free(__isl_take isl_set_list *list); C creates an empty list with a capacity for C elements. C creates a list with a single element. Lists can be inspected using the following functions. #include isl_ctx *isl_set_list_get_ctx(__isl_keep isl_set_list *list); int isl_set_list_n_set(__isl_keep isl_set_list *list); __isl_give isl_set *isl_set_list_get_set( __isl_keep isl_set_list *list, int index); int isl_set_list_foreach(__isl_keep isl_set_list *list, int (*fn)(__isl_take isl_set *el, void *user), void *user); int isl_set_list_foreach_scc(__isl_keep isl_set_list *list, int (*follows)(__isl_keep isl_set *a, __isl_keep isl_set *b, void *user), void *follows_user int (*fn)(__isl_take isl_set *el, void *user), void *fn_user); The function C calls C on each of the strongly connected components of the graph with as vertices the elements of C and a directed edge from vertex C to vertex C iff C returns C<1>. The callbacks C and C should return C<-1> on error. Lists can be printed using #include __isl_give isl_printer *isl_printer_print_set_list( __isl_take isl_printer *p, __isl_keep isl_set_list *list); =head2 Multiple Values An C object represents a sequence of zero or more values, living in a set space. An C can be constructed from an C using the following function #include __isl_give isl_multi_val *isl_multi_val_from_val_list( __isl_take isl_space *space, __isl_take isl_val_list *list); The zero multiple value (with value zero for each set dimension) can be created using the following function. #include __isl_give isl_multi_val *isl_multi_val_zero( __isl_take isl_space *space); Multiple values can be copied and freed using #include __isl_give isl_multi_val *isl_multi_val_copy( __isl_keep isl_multi_val *mv); void *isl_multi_val_free(__isl_take isl_multi_val *mv); They can be inspected using #include isl_ctx *isl_multi_val_get_ctx( __isl_keep isl_multi_val *mv); unsigned isl_multi_val_dim(__isl_keep isl_multi_val *mv, enum isl_dim_type type); __isl_give isl_val *isl_multi_val_get_val( __isl_keep isl_multi_val *mv, int pos); const char *isl_multi_val_get_tuple_name( __isl_keep isl_multi_val *mv, enum isl_dim_type type); They can be modified using #include __isl_give isl_multi_val *isl_multi_val_set_val( __isl_take isl_multi_val *mv, int pos, __isl_take isl_val *val); __isl_give isl_multi_val *isl_multi_val_set_dim_name( __isl_take isl_multi_val *mv, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_multi_val *isl_multi_val_set_tuple_name( __isl_take isl_multi_val *mv, enum isl_dim_type type, const char *s); __isl_give isl_multi_val *isl_multi_val_set_tuple_id( __isl_take isl_multi_val *mv, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_multi_val *isl_multi_val_insert_dims( __isl_take isl_multi_val *mv, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_multi_val *isl_multi_val_add_dims( __isl_take isl_multi_val *mv, enum isl_dim_type type, unsigned n); __isl_give isl_multi_val *isl_multi_val_drop_dims( __isl_take isl_multi_val *mv, enum isl_dim_type type, unsigned first, unsigned n); Operations include #include __isl_give isl_multi_val *isl_multi_val_align_params( __isl_take isl_multi_val *mv, __isl_take isl_space *model); __isl_give isl_multi_val *isl_multi_val_range_splice( __isl_take isl_multi_val *mv1, unsigned pos, __isl_take isl_multi_val *mv2); __isl_give isl_multi_val *isl_multi_val_range_product( __isl_take isl_multi_val *mv1, __isl_take isl_multi_val *mv2); __isl_give isl_multi_val *isl_multi_val_flat_range_product( __isl_take isl_multi_val *mv1, __isl_take isl_multi_aff *mv2); __isl_give isl_multi_val *isl_multi_val_add_val( __isl_take isl_multi_val *mv, __isl_take isl_val *v); __isl_give isl_multi_val *isl_multi_val_mod_val( __isl_take isl_multi_val *mv, __isl_take isl_val *v); __isl_give isl_multi_val *isl_multi_val_scale_val( __isl_take isl_multi_val *mv, __isl_take isl_val *v); __isl_give isl_multi_val *isl_multi_val_scale_multi_val( __isl_take isl_multi_val *mv1, __isl_take isl_multi_val *mv2); =head2 Vectors Vectors can be created, copied and freed using the following functions. #include __isl_give isl_vec *isl_vec_alloc(isl_ctx *ctx, unsigned size); __isl_give isl_vec *isl_vec_copy(__isl_keep isl_vec *vec); void *isl_vec_free(__isl_take isl_vec *vec); Note that the elements of a newly created vector may have arbitrary values. The elements can be changed and inspected using the following functions. isl_ctx *isl_vec_get_ctx(__isl_keep isl_vec *vec); int isl_vec_size(__isl_keep isl_vec *vec); int isl_vec_get_element(__isl_keep isl_vec *vec, int pos, isl_int *v); __isl_give isl_val *isl_vec_get_element_val( __isl_keep isl_vec *vec, int pos); __isl_give isl_vec *isl_vec_set_element( __isl_take isl_vec *vec, int pos, isl_int v); __isl_give isl_vec *isl_vec_set_element_si( __isl_take isl_vec *vec, int pos, int v); __isl_give isl_vec *isl_vec_set_element_val( __isl_take isl_vec *vec, int pos, __isl_take isl_val *v); __isl_give isl_vec *isl_vec_set(__isl_take isl_vec *vec, isl_int v); __isl_give isl_vec *isl_vec_set_si(__isl_take isl_vec *vec, int v); __isl_give isl_vec *isl_vec_set_val( __isl_take isl_vec *vec, __isl_take isl_val *v); int isl_vec_cmp_element(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2, int pos); __isl_give isl_vec *isl_vec_fdiv_r(__isl_take isl_vec *vec, isl_int m); C will return a negative value if anything went wrong. In that case, the value of C<*v> is undefined. The following function can be used to concatenate two vectors. __isl_give isl_vec *isl_vec_concat(__isl_take isl_vec *vec1, __isl_take isl_vec *vec2); =head2 Matrices Matrices can be created, copied and freed using the following functions. #include __isl_give isl_mat *isl_mat_alloc(isl_ctx *ctx, unsigned n_row, unsigned n_col); __isl_give isl_mat *isl_mat_copy(__isl_keep isl_mat *mat); void *isl_mat_free(__isl_take isl_mat *mat); Note that the elements of a newly created matrix may have arbitrary values. The elements can be changed and inspected using the following functions. isl_ctx *isl_mat_get_ctx(__isl_keep isl_mat *mat); int isl_mat_rows(__isl_keep isl_mat *mat); int isl_mat_cols(__isl_keep isl_mat *mat); int isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v); __isl_give isl_val *isl_mat_get_element_val( __isl_keep isl_mat *mat, int row, int col); __isl_give isl_mat *isl_mat_set_element(__isl_take isl_mat *mat, int row, int col, isl_int v); __isl_give isl_mat *isl_mat_set_element_si(__isl_take isl_mat *mat, int row, int col, int v); __isl_give isl_mat *isl_mat_set_element_val( __isl_take isl_mat *mat, int row, int col, __isl_take isl_val *v); C will return a negative value if anything went wrong. In that case, the value of C<*v> is undefined. The following function can be used to compute the (right) inverse of a matrix, i.e., a matrix such that the product of the original and the inverse (in that order) is a multiple of the identity matrix. The input matrix is assumed to be of full row-rank. __isl_give isl_mat *isl_mat_right_inverse(__isl_take isl_mat *mat); The following function can be used to compute the (right) kernel (or null space) of a matrix, i.e., a matrix such that the product of the original and the kernel (in that order) is the zero matrix. __isl_give isl_mat *isl_mat_right_kernel(__isl_take isl_mat *mat); =head2 Piecewise Quasi Affine Expressions The zero quasi affine expression or the quasi affine expression that is equal to a specified dimension on a given domain can be created using __isl_give isl_aff *isl_aff_zero_on_domain( __isl_take isl_local_space *ls); __isl_give isl_pw_aff *isl_pw_aff_zero_on_domain( __isl_take isl_local_space *ls); __isl_give isl_aff *isl_aff_var_on_domain( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_pw_aff *isl_pw_aff_var_on_domain( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos); Note that the space in which the resulting objects live is a map space with the given space as domain and a one-dimensional range. An empty piecewise quasi affine expression (one with no cells) or a piecewise quasi affine expression with a single cell can be created using the following functions. #include __isl_give isl_pw_aff *isl_pw_aff_empty( __isl_take isl_space *space); __isl_give isl_pw_aff *isl_pw_aff_alloc( __isl_take isl_set *set, __isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_pw_aff_from_aff( __isl_take isl_aff *aff); A piecewise quasi affine expression that is equal to 1 on a set and 0 outside the set can be created using the following function. #include __isl_give isl_pw_aff *isl_set_indicator_function( __isl_take isl_set *set); Quasi affine expressions can be copied and freed using #include __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff); void *isl_aff_free(__isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_pw_aff_copy( __isl_keep isl_pw_aff *pwaff); void *isl_pw_aff_free(__isl_take isl_pw_aff *pwaff); A (rational) bound on a dimension can be extracted from an C using the following function. The constraint is required to have a non-zero coefficient for the specified dimension. #include __isl_give isl_aff *isl_constraint_get_bound( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos); The entire affine expression of the constraint can also be extracted using the following function. #include __isl_give isl_aff *isl_constraint_get_aff( __isl_keep isl_constraint *constraint); Conversely, an equality constraint equating the affine expression to zero or an inequality constraint enforcing the affine expression to be non-negative, can be constructed using __isl_give isl_constraint *isl_equality_from_aff( __isl_take isl_aff *aff); __isl_give isl_constraint *isl_inequality_from_aff( __isl_take isl_aff *aff); The expression can be inspected using #include isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff); int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type); __isl_give isl_local_space *isl_aff_get_domain_local_space( __isl_keep isl_aff *aff); __isl_give isl_local_space *isl_aff_get_local_space( __isl_keep isl_aff *aff); const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff, enum isl_dim_type type, unsigned pos); const char *isl_pw_aff_get_dim_name( __isl_keep isl_pw_aff *pa, enum isl_dim_type type, unsigned pos); int isl_pw_aff_has_dim_id(__isl_keep isl_pw_aff *pa, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_pw_aff_get_dim_id( __isl_keep isl_pw_aff *pa, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_pw_aff_get_tuple_id( __isl_keep isl_pw_aff *pa, enum isl_dim_type type); int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v); __isl_give isl_val *isl_aff_get_constant_val( __isl_keep isl_aff *aff); int isl_aff_get_coefficient(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_val *isl_aff_get_coefficient_val( __isl_keep isl_aff *aff, enum isl_dim_type type, int pos); int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v); __isl_give isl_val *isl_aff_get_denominator_val( __isl_keep isl_aff *aff); __isl_give isl_aff *isl_aff_get_div( __isl_keep isl_aff *aff, int pos); int isl_pw_aff_n_piece(__isl_keep isl_pw_aff *pwaff); int isl_pw_aff_foreach_piece(__isl_keep isl_pw_aff *pwaff, int (*fn)(__isl_take isl_set *set, __isl_take isl_aff *aff, void *user), void *user); int isl_aff_is_cst(__isl_keep isl_aff *aff); int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff); int isl_aff_involves_dims(__isl_keep isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n); int isl_pw_aff_involves_dims(__isl_keep isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); isl_ctx *isl_pw_aff_get_ctx(__isl_keep isl_pw_aff *pwaff); unsigned isl_pw_aff_dim(__isl_keep isl_pw_aff *pwaff, enum isl_dim_type type); int isl_pw_aff_is_empty(__isl_keep isl_pw_aff *pwaff); It can be modified using #include __isl_give isl_pw_aff *isl_pw_aff_set_tuple_id( __isl_take isl_pw_aff *pwaff, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_aff *isl_aff_set_dim_name( __isl_take isl_aff *aff, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_aff *isl_aff_set_dim_id( __isl_take isl_aff *aff, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); __isl_give isl_pw_aff *isl_pw_aff_set_dim_id( __isl_take isl_pw_aff *pma, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); __isl_give isl_aff *isl_aff_set_constant( __isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_set_constant_si( __isl_take isl_aff *aff, int v); __isl_give isl_aff *isl_aff_set_constant_val( __isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_set_coefficient( __isl_take isl_aff *aff, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_aff *isl_aff_set_coefficient_si( __isl_take isl_aff *aff, enum isl_dim_type type, int pos, int v); __isl_give isl_aff *isl_aff_set_coefficient_val( __isl_take isl_aff *aff, enum isl_dim_type type, int pos, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_set_denominator( __isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_add_constant( __isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_add_constant_si( __isl_take isl_aff *aff, int v); __isl_give isl_aff *isl_aff_add_constant_val( __isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_add_constant_num( __isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_add_constant_num_si( __isl_take isl_aff *aff, int v); __isl_give isl_aff *isl_aff_add_coefficient( __isl_take isl_aff *aff, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_aff *isl_aff_add_coefficient_si( __isl_take isl_aff *aff, enum isl_dim_type type, int pos, int v); __isl_give isl_aff *isl_aff_add_coefficient_val( __isl_take isl_aff *aff, enum isl_dim_type type, int pos, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_insert_dims( __isl_take isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_aff *isl_pw_aff_insert_dims( __isl_take isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_aff *isl_aff_add_dims( __isl_take isl_aff *aff, enum isl_dim_type type, unsigned n); __isl_give isl_pw_aff *isl_pw_aff_add_dims( __isl_take isl_pw_aff *pwaff, enum isl_dim_type type, unsigned n); __isl_give isl_aff *isl_aff_drop_dims( __isl_take isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_aff *isl_pw_aff_drop_dims( __isl_take isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); Note that C, C, C and C set the I of the constant or coefficient, while C and C set the constant or coefficient as a whole. The C and C functions add an integer or rational value to the possibly rational constant or coefficient. The C functions add an integer value to the numerator. To check whether an affine expressions is obviously zero or obviously equal to some other affine expression, use #include int isl_aff_plain_is_zero(__isl_keep isl_aff *aff); int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2); int isl_pw_aff_plain_is_equal( __isl_keep isl_pw_aff *pwaff1, __isl_keep isl_pw_aff *pwaff2); Operations include #include __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_pw_aff *isl_pw_aff_add( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_min( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_max( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_pw_aff *isl_pw_aff_sub( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_pw_aff_neg( __isl_take isl_pw_aff *pwaff); __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_pw_aff_ceil( __isl_take isl_pw_aff *pwaff); __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_pw_aff_floor( __isl_take isl_pw_aff *pwaff); __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int mod); __isl_give isl_aff *isl_aff_mod_val(__isl_take isl_aff *aff, __isl_take isl_val *mod); __isl_give isl_pw_aff *isl_pw_aff_mod( __isl_take isl_pw_aff *pwaff, isl_int mod); __isl_give isl_pw_aff *isl_pw_aff_mod_val( __isl_take isl_pw_aff *pa, __isl_take isl_val *mod); __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f); __isl_give isl_aff *isl_aff_scale_val(__isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_pw_aff *isl_pw_aff_scale( __isl_take isl_pw_aff *pwaff, isl_int f); __isl_give isl_pw_aff *isl_pw_aff_scale_val( __isl_take isl_pw_aff *pa, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f); __isl_give isl_aff *isl_aff_scale_down_ui( __isl_take isl_aff *aff, unsigned f); __isl_give isl_aff *isl_aff_scale_down_val( __isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_pw_aff *isl_pw_aff_scale_down( __isl_take isl_pw_aff *pwaff, isl_int f); __isl_give isl_pw_aff *isl_pw_aff_scale_down_val( __isl_take isl_pw_aff *pa, __isl_take isl_val *f); __isl_give isl_pw_aff *isl_pw_aff_list_min( __isl_take isl_pw_aff_list *list); __isl_give isl_pw_aff *isl_pw_aff_list_max( __isl_take isl_pw_aff_list *list); __isl_give isl_pw_aff *isl_pw_aff_coalesce( __isl_take isl_pw_aff *pwqp); __isl_give isl_aff *isl_aff_align_params( __isl_take isl_aff *aff, __isl_take isl_space *model); __isl_give isl_pw_aff *isl_pw_aff_align_params( __isl_take isl_pw_aff *pwaff, __isl_take isl_space *model); __isl_give isl_aff *isl_aff_project_domain_on_params( __isl_take isl_aff *aff); __isl_give isl_aff *isl_aff_gist_params( __isl_take isl_aff *aff, __isl_take isl_set *context); __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff, __isl_take isl_set *context); __isl_give isl_pw_aff *isl_pw_aff_gist_params( __isl_take isl_pw_aff *pwaff, __isl_take isl_set *context); __isl_give isl_pw_aff *isl_pw_aff_gist( __isl_take isl_pw_aff *pwaff, __isl_take isl_set *context); __isl_give isl_set *isl_pw_aff_domain( __isl_take isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_intersect_domain( __isl_take isl_pw_aff *pa, __isl_take isl_set *set); __isl_give isl_pw_aff *isl_pw_aff_intersect_params( __isl_take isl_pw_aff *pa, __isl_take isl_set *set); __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_aff *isl_aff_div(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_pw_aff *isl_pw_aff_mul( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_div( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_pw_aff *isl_pw_aff_tdiv_q( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_pw_aff *isl_pw_aff_tdiv_r( __isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); When multiplying two affine expressions, at least one of the two needs to be a constant. Similarly, when dividing an affine expression by another, the second expression needs to be a constant. C computes the quotient of an integer division with rounding towards zero. C computes the corresponding remainder. #include __isl_give isl_aff *isl_aff_pullback_multi_aff( __isl_take isl_aff *aff, __isl_take isl_multi_aff *ma); __isl_give isl_pw_aff *isl_pw_aff_pullback_multi_aff( __isl_take isl_pw_aff *pa, __isl_take isl_multi_aff *ma); __isl_give isl_pw_aff *isl_pw_aff_pullback_pw_multi_aff( __isl_take isl_pw_aff *pa, __isl_take isl_pw_multi_aff *pma); These functions precompose the input expression by the given C or C. In other words, the C or C is plugged into the (piecewise) affine expression. Objects of type C are described in L. #include __isl_give isl_basic_set *isl_aff_zero_basic_set( __isl_take isl_aff *aff); __isl_give isl_basic_set *isl_aff_neg_basic_set( __isl_take isl_aff *aff); __isl_give isl_basic_set *isl_aff_le_basic_set( __isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_basic_set *isl_aff_ge_basic_set( __isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_set *isl_pw_aff_eq_set( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_ne_set( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_le_set( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_lt_set( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_ge_set( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_gt_set( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_list_eq_set( __isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_ne_set( __isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_le_set( __isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_lt_set( __isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_ge_set( __isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_gt_set( __isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); The function C returns a basic set containing those elements in the domain space of C where C is negative. The function C returns a basic set containing those elements in the shared space of C and C where C is greater than or equal to C. The function C returns a set containing those elements in the shared domain of C and C where C is greater than or equal to C. The functions operating on C apply the corresponding C function to each pair of elements in the two lists. #include __isl_give isl_set *isl_pw_aff_nonneg_set( __isl_take isl_pw_aff *pwaff); __isl_give isl_set *isl_pw_aff_zero_set( __isl_take isl_pw_aff *pwaff); __isl_give isl_set *isl_pw_aff_non_zero_set( __isl_take isl_pw_aff *pwaff); The function C returns a set containing those elements in the domain of C where C is non-negative. #include __isl_give isl_pw_aff *isl_pw_aff_cond( __isl_take isl_pw_aff *cond, __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false); The function C performs a conditional operator and returns an expression that is equal to C for elements where C is non-zero and equal to C for elements where C is zero. #include __isl_give isl_pw_aff *isl_pw_aff_union_min( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_union_max( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_union_add( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); The function C computes a piecewise quasi-affine expression with a domain that is the union of those of C and C and such that on each cell, the quasi-affine expression is the maximum of those of C and C. If only one of C or C is defined on a given cell, then the associated expression is the defined one. An expression can be read from input using #include __isl_give isl_aff *isl_aff_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_pw_aff *isl_pw_aff_read_from_str( isl_ctx *ctx, const char *str); An expression can be printed using #include __isl_give isl_printer *isl_printer_print_aff( __isl_take isl_printer *p, __isl_keep isl_aff *aff); __isl_give isl_printer *isl_printer_print_pw_aff( __isl_take isl_printer *p, __isl_keep isl_pw_aff *pwaff); =head2 Piecewise Multiple Quasi Affine Expressions An C object represents a sequence of zero or more affine expressions, all defined on the same domain space. Similarly, an C object represents a sequence of zero or more piecewise affine expressions. An C can be constructed from a single C or an C using the following functions. Similarly for C. #include __isl_give isl_multi_aff *isl_multi_aff_from_aff( __isl_take isl_aff *aff); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_from_pw_aff( __isl_take isl_pw_aff *pa); __isl_give isl_multi_aff *isl_multi_aff_from_aff_list( __isl_take isl_space *space, __isl_take isl_aff_list *list); An empty piecewise multiple quasi affine expression (one with no cells), the zero piecewise multiple quasi affine expression (with value zero for each output dimension), a piecewise multiple quasi affine expression with a single cell (with either a universe or a specified domain) or a zero-dimensional piecewise multiple quasi affine expression on a given domain can be created using the following functions. #include __isl_give isl_pw_multi_aff *isl_pw_multi_aff_empty( __isl_take isl_space *space); __isl_give isl_multi_aff *isl_multi_aff_zero( __isl_take isl_space *space); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_zero( __isl_take isl_space *space); __isl_give isl_multi_aff *isl_multi_aff_identity( __isl_take isl_space *space); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_identity( __isl_take isl_space *space); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_identity( __isl_take isl_space *space); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_from_multi_aff( __isl_take isl_multi_aff *ma); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_alloc( __isl_take isl_set *set, __isl_take isl_multi_aff *maff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain( __isl_take isl_set *set); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_empty( __isl_take isl_space *space); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_add_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_domain( __isl_take isl_union_set *uset); A piecewise multiple quasi affine expression can also be initialized from an C or C, provided the C is a singleton and the C is single-valued. In case of a conversion from an C or an C to an C, these properties need to hold in each space. __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set( __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map( __isl_take isl_map *map); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_union_set( __isl_take isl_union_set *uset); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_from_union_map( __isl_take isl_union_map *umap); Multiple quasi affine expressions can be copied and freed using #include __isl_give isl_multi_aff *isl_multi_aff_copy( __isl_keep isl_multi_aff *maff); void *isl_multi_aff_free(__isl_take isl_multi_aff *maff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_copy( __isl_keep isl_pw_multi_aff *pma); void *isl_pw_multi_aff_free( __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_copy( __isl_keep isl_union_pw_multi_aff *upma); void *isl_union_pw_multi_aff_free( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_copy( __isl_keep isl_multi_pw_aff *mpa); void *isl_multi_pw_aff_free( __isl_take isl_multi_pw_aff *mpa); The expression can be inspected using #include isl_ctx *isl_multi_aff_get_ctx( __isl_keep isl_multi_aff *maff); isl_ctx *isl_pw_multi_aff_get_ctx( __isl_keep isl_pw_multi_aff *pma); isl_ctx *isl_union_pw_multi_aff_get_ctx( __isl_keep isl_union_pw_multi_aff *upma); isl_ctx *isl_multi_pw_aff_get_ctx( __isl_keep isl_multi_pw_aff *mpa); unsigned isl_multi_aff_dim(__isl_keep isl_multi_aff *maff, enum isl_dim_type type); unsigned isl_pw_multi_aff_dim( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); unsigned isl_multi_pw_aff_dim( __isl_keep isl_multi_pw_aff *mpa, enum isl_dim_type type); __isl_give isl_aff *isl_multi_aff_get_aff( __isl_keep isl_multi_aff *multi, int pos); __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff( __isl_keep isl_pw_multi_aff *pma, int pos); __isl_give isl_pw_aff *isl_multi_pw_aff_get_pw_aff( __isl_keep isl_multi_pw_aff *mpa, int pos); const char *isl_pw_multi_aff_get_dim_name( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_pw_multi_aff_get_dim_id( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos); const char *isl_multi_aff_get_tuple_name( __isl_keep isl_multi_aff *multi, enum isl_dim_type type); int isl_pw_multi_aff_has_tuple_name( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); const char *isl_pw_multi_aff_get_tuple_name( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); int isl_pw_multi_aff_has_tuple_id( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); __isl_give isl_id *isl_pw_multi_aff_get_tuple_id( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); int isl_pw_multi_aff_foreach_piece( __isl_keep isl_pw_multi_aff *pma, int (*fn)(__isl_take isl_set *set, __isl_take isl_multi_aff *maff, void *user), void *user); int isl_union_pw_multi_aff_foreach_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma, int (*fn)(__isl_take isl_pw_multi_aff *pma, void *user), void *user); It can be modified using #include __isl_give isl_multi_aff *isl_multi_aff_set_aff( __isl_take isl_multi_aff *multi, int pos, __isl_take isl_aff *aff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_pw_aff( __isl_take isl_pw_multi_aff *pma, unsigned pos, __isl_take isl_pw_aff *pa); __isl_give isl_multi_aff *isl_multi_aff_set_dim_name( __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_multi_aff *isl_multi_aff_set_tuple_name( __isl_take isl_multi_aff *maff, enum isl_dim_type type, const char *s); __isl_give isl_multi_aff *isl_multi_aff_set_tuple_id( __isl_take isl_multi_aff *maff, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_tuple_id( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_set_dim_name( __isl_take isl_multi_pw_aff *mpa, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_set_tuple_name( __isl_take isl_multi_pw_aff *mpa, enum isl_dim_type type, const char *s); __isl_give isl_multi_aff *isl_multi_aff_insert_dims( __isl_take isl_multi_aff *ma, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_multi_aff *isl_multi_aff_add_dims( __isl_take isl_multi_aff *ma, enum isl_dim_type type, unsigned n); __isl_give isl_multi_aff *isl_multi_aff_drop_dims( __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_drop_dims( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_insert_dims( __isl_take isl_multi_pw_aff *mpa, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_add_dims( __isl_take isl_multi_pw_aff *mpa, enum isl_dim_type type, unsigned n); To check whether two multiple affine expressions are obviously equal to each other, use int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1, __isl_keep isl_multi_aff *maff2); int isl_pw_multi_aff_plain_is_equal( __isl_keep isl_pw_multi_aff *pma1, __isl_keep isl_pw_multi_aff *pma2); Operations include #include __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmin( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmax( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_multi_aff *isl_multi_aff_add( __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_add( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_multi_aff *isl_multi_aff_sub( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_sub( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_sub( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); C subtracts the second argument from the first. __isl_give isl_multi_aff *isl_multi_aff_scale( __isl_take isl_multi_aff *maff, isl_int f); __isl_give isl_multi_aff *isl_multi_aff_scale_val( __isl_take isl_multi_aff *ma, __isl_take isl_val *v); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_scale_val( __isl_take isl_pw_multi_aff *pma, __isl_take isl_val *v); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_scale_val( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_val *v); __isl_give isl_multi_aff *isl_multi_aff_scale_multi_val( __isl_take isl_multi_aff *ma, __isl_take isl_multi_val *mv); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_scale_multi_val( __isl_take isl_pw_multi_aff *pma, __isl_take isl_multi_val *mv); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_scale_multi_val( __isl_take isl_multi_pw_aff *mpa, __isl_take isl_multi_val *mv); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_scale_multi_val( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_multi_val *mv); C scales the elements of C by the corresponding elements of C. __isl_give isl_pw_multi_aff *isl_pw_multi_aff_intersect_params( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_intersect_domain( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_intersect_domain( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_union_set *uset); __isl_give isl_multi_aff *isl_multi_aff_lift( __isl_take isl_multi_aff *maff, __isl_give isl_local_space **ls); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_coalesce( __isl_take isl_pw_multi_aff *pma); __isl_give isl_multi_aff *isl_multi_aff_align_params( __isl_take isl_multi_aff *multi, __isl_take isl_space *model); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_align_params( __isl_take isl_pw_multi_aff *pma, __isl_take isl_space *model); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_project_domain_on_params( __isl_take isl_pw_multi_aff *pma); __isl_give isl_multi_aff *isl_multi_aff_gist_params( __isl_take isl_multi_aff *maff, __isl_take isl_set *context); __isl_give isl_multi_aff *isl_multi_aff_gist( __isl_take isl_multi_aff *maff, __isl_take isl_set *context); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_gist_params( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_gist( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_set *isl_pw_multi_aff_domain( __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_set *isl_union_pw_multi_aff_domain( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_multi_aff *isl_multi_aff_range_splice( __isl_take isl_multi_aff *ma1, unsigned pos, __isl_take isl_multi_aff *ma2); __isl_give isl_multi_aff *isl_multi_aff_splice( __isl_take isl_multi_aff *ma1, unsigned in_pos, unsigned out_pos, __isl_take isl_multi_aff *ma2); __isl_give isl_multi_aff *isl_multi_aff_range_product( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_multi_aff *isl_multi_aff_flat_range_product( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_multi_aff *isl_multi_aff_product( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_flat_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_flat_range_product( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_range_splice( __isl_take isl_multi_pw_aff *mpa1, unsigned pos, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_splice( __isl_take isl_multi_pw_aff *mpa1, unsigned in_pos, unsigned out_pos, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_range_product( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); __isl_give isl_multi_pw_aff * isl_multi_pw_aff_flat_range_product( __isl_take isl_multi_pw_aff *mpa1, __isl_take isl_multi_pw_aff *mpa2); If the C argument of C is not C, then it is assigned the local space that lies at the basis of the lifting applied. #include __isl_give isl_multi_aff *isl_multi_aff_pullback_multi_aff( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_pullback_multi_aff( __isl_take isl_pw_multi_aff *pma, __isl_take isl_multi_aff *ma); __isl_give isl_pw_multi_aff * isl_pw_multi_aff_pullback_pw_multi_aff( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); The function C precomposes C by C. In other words, C is plugged into C. __isl_give isl_set *isl_multi_aff_lex_le_set( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_set *isl_multi_aff_lex_ge_set( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); The function C returns a set containing those elements in the shared domain space where C is lexicographically smaller than or equal to C. An expression can be read from input using #include __isl_give isl_multi_aff *isl_multi_aff_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_union_pw_multi_aff * isl_union_pw_multi_aff_read_from_str( isl_ctx *ctx, const char *str); An expression can be printed using #include __isl_give isl_printer *isl_printer_print_multi_aff( __isl_take isl_printer *p, __isl_keep isl_multi_aff *maff); __isl_give isl_printer *isl_printer_print_pw_multi_aff( __isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma); __isl_give isl_printer *isl_printer_print_union_pw_multi_aff( __isl_take isl_printer *p, __isl_keep isl_union_pw_multi_aff *upma); __isl_give isl_printer *isl_printer_print_multi_pw_aff( __isl_take isl_printer *p, __isl_keep isl_multi_pw_aff *mpa); =head2 Points Points are elements of a set. They can be used to construct simple sets (boxes) or they can be used to represent the individual elements of a set. The zero point (the origin) can be created using __isl_give isl_point *isl_point_zero(__isl_take isl_space *space); The coordinates of a point can be inspected, set and changed using int isl_point_get_coordinate(__isl_keep isl_point *pnt, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_val *isl_point_get_coordinate_val( __isl_keep isl_point *pnt, enum isl_dim_type type, int pos); __isl_give isl_point *isl_point_set_coordinate( __isl_take isl_point *pnt, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_point *isl_point_set_coordinate_val( __isl_take isl_point *pnt, enum isl_dim_type type, int pos, __isl_take isl_val *v); __isl_give isl_point *isl_point_add_ui( __isl_take isl_point *pnt, enum isl_dim_type type, int pos, unsigned val); __isl_give isl_point *isl_point_sub_ui( __isl_take isl_point *pnt, enum isl_dim_type type, int pos, unsigned val); Other properties can be obtained using isl_ctx *isl_point_get_ctx(__isl_keep isl_point *pnt); Points can be copied or freed using __isl_give isl_point *isl_point_copy( __isl_keep isl_point *pnt); void isl_point_free(__isl_take isl_point *pnt); A singleton set can be created from a point using __isl_give isl_basic_set *isl_basic_set_from_point( __isl_take isl_point *pnt); __isl_give isl_set *isl_set_from_point( __isl_take isl_point *pnt); and a box can be created from two opposite extremal points using __isl_give isl_basic_set *isl_basic_set_box_from_points( __isl_take isl_point *pnt1, __isl_take isl_point *pnt2); __isl_give isl_set *isl_set_box_from_points( __isl_take isl_point *pnt1, __isl_take isl_point *pnt2); All elements of a B (union) set can be enumerated using the following functions. int isl_set_foreach_point(__isl_keep isl_set *set, int (*fn)(__isl_take isl_point *pnt, void *user), void *user); int isl_union_set_foreach_point(__isl_keep isl_union_set *uset, int (*fn)(__isl_take isl_point *pnt, void *user), void *user); The function C is called for each integer point in C with as second argument the last argument of the C call. The function C should return C<0> on success and C<-1> on failure. In the latter case, C will stop enumerating and return C<-1> as well. If the enumeration is performed successfully and to completion, then C returns C<0>. To obtain a single point of a (basic) set, use __isl_give isl_point *isl_basic_set_sample_point( __isl_take isl_basic_set *bset); __isl_give isl_point *isl_set_sample_point( __isl_take isl_set *set); If C does not contain any (integer) points, then the resulting point will be ``void'', a property that can be tested using int isl_point_is_void(__isl_keep isl_point *pnt); =head2 Piecewise Quasipolynomials A piecewise quasipolynomial is a particular kind of function that maps a parametric point to a rational value. More specifically, a quasipolynomial is a polynomial expression in greatest integer parts of affine expressions of parameters and variables. A piecewise quasipolynomial is a subdivision of a given parametric domain into disjoint cells with a quasipolynomial associated to each cell. The value of the piecewise quasipolynomial at a given point is the value of the quasipolynomial associated to the cell that contains the point. Outside of the union of cells, the value is assumed to be zero. For example, the piecewise quasipolynomial [n] -> { [x] -> ((1 + n) - x) : x <= n and x >= 0 } maps C to C<1 + n - x> for values of C between C<0> and C. A given piecewise quasipolynomial has a fixed domain dimension. Union piecewise quasipolynomials are used to contain piecewise quasipolynomials defined over different domains. Piecewise quasipolynomials are mainly used by the C library for representing the number of elements in a parametric set or map. For example, the piecewise quasipolynomial above represents the number of points in the map [n] -> { [x] -> [y] : x,y >= 0 and 0 <= x + y <= n } =head3 Input and Output Piecewise quasipolynomials can be read from input using __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_read_from_str( isl_ctx *ctx, const char *str); Quasipolynomials and piecewise quasipolynomials can be printed using the following functions. __isl_give isl_printer *isl_printer_print_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_qpolynomial *qp); __isl_give isl_printer *isl_printer_print_pw_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial *upwqp); The output format of the printer needs to be set to either C or C. For C, only C is supported. In case of printing in C, the user may want to set the names of all dimensions __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_set_dim_name( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned pos, const char *s); =head3 Creating New (Piecewise) Quasipolynomials Some simple quasipolynomials can be created using the following functions. More complicated quasipolynomials can be created by applying operations such as addition and multiplication on the resulting quasipolynomials __isl_give isl_qpolynomial *isl_qpolynomial_zero_on_domain( __isl_take isl_space *domain); __isl_give isl_qpolynomial *isl_qpolynomial_one_on_domain( __isl_take isl_space *domain); __isl_give isl_qpolynomial *isl_qpolynomial_infty_on_domain( __isl_take isl_space *domain); __isl_give isl_qpolynomial *isl_qpolynomial_neginfty_on_domain( __isl_take isl_space *domain); __isl_give isl_qpolynomial *isl_qpolynomial_nan_on_domain( __isl_take isl_space *domain); __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst_on_domain( __isl_take isl_space *domain, const isl_int n, const isl_int d); __isl_give isl_qpolynomial *isl_qpolynomial_val_on_domain( __isl_take isl_space *domain, __isl_take isl_val *val); __isl_give isl_qpolynomial *isl_qpolynomial_var_on_domain( __isl_take isl_space *domain, enum isl_dim_type type, unsigned pos); __isl_give isl_qpolynomial *isl_qpolynomial_from_aff( __isl_take isl_aff *aff); Note that the space in which a quasipolynomial lives is a map space with a one-dimensional range. The C argument in some of the functions above corresponds to the domain of this map space. The zero piecewise quasipolynomial or a piecewise quasipolynomial with a single cell can be created using the following functions. Multiple of these single cell piecewise quasipolynomials can be combined to create more complicated piecewise quasipolynomials. __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_zero( __isl_take isl_space *space); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_alloc( __isl_take isl_set *set, __isl_take isl_qpolynomial *qp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_qpolynomial( __isl_take isl_qpolynomial *qp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_pw_aff( __isl_take isl_pw_aff *pwaff); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_zero( __isl_take isl_space *space); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_from_pw_qpolynomial( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_add_pw_qpolynomial( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_pw_qpolynomial *pwqp); Quasipolynomials can be copied and freed again using the following functions. __isl_give isl_qpolynomial *isl_qpolynomial_copy( __isl_keep isl_qpolynomial *qp); void *isl_qpolynomial_free(__isl_take isl_qpolynomial *qp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_copy( __isl_keep isl_pw_qpolynomial *pwqp); void *isl_pw_qpolynomial_free( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_copy( __isl_keep isl_union_pw_qpolynomial *upwqp); void *isl_union_pw_qpolynomial_free( __isl_take isl_union_pw_qpolynomial *upwqp); =head3 Inspecting (Piecewise) Quasipolynomials To iterate over all piecewise quasipolynomials in a union piecewise quasipolynomial, use the following function int isl_union_pw_qpolynomial_foreach_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp, int (*fn)(__isl_take isl_pw_qpolynomial *pwqp, void *user), void *user); To extract the piecewise quasipolynomial in a given space from a union, use __isl_give isl_pw_qpolynomial * isl_union_pw_qpolynomial_extract_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp, __isl_take isl_space *space); To iterate over the cells in a piecewise quasipolynomial, use either of the following two functions int isl_pw_qpolynomial_foreach_piece( __isl_keep isl_pw_qpolynomial *pwqp, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user), void *user); int isl_pw_qpolynomial_foreach_lifted_piece( __isl_keep isl_pw_qpolynomial *pwqp, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user), void *user); As usual, the function C should return C<0> on success and C<-1> on failure. The difference between C and C is that C will first compute unique representations for all existentially quantified variables and then turn these existentially quantified variables into extra set variables, adapting the associated quasipolynomial accordingly. This means that the C passed to C will not have any existentially quantified variables, but that the dimensions of the sets may be different for different invocations of C. The constant term of a quasipolynomial can be extracted using __isl_give isl_val *isl_qpolynomial_get_constant_val( __isl_keep isl_qpolynomial *qp); To iterate over all terms in a quasipolynomial, use int isl_qpolynomial_foreach_term( __isl_keep isl_qpolynomial *qp, int (*fn)(__isl_take isl_term *term, void *user), void *user); The terms themselves can be inspected and freed using these functions unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type); void isl_term_get_num(__isl_keep isl_term *term, isl_int *n); void isl_term_get_den(__isl_keep isl_term *term, isl_int *d); __isl_give isl_val *isl_term_get_coefficient_val( __isl_keep isl_term *term); int isl_term_get_exp(__isl_keep isl_term *term, enum isl_dim_type type, unsigned pos); __isl_give isl_aff *isl_term_get_div( __isl_keep isl_term *term, unsigned pos); void isl_term_free(__isl_take isl_term *term); Each term is a product of parameters, set variables and integer divisions. The function C returns the exponent of a given dimensions in the given term. The Cs in the arguments of C and C need to have been initialized using C before calling these functions. =head3 Properties of (Piecewise) Quasipolynomials To check whether a quasipolynomial is actually a constant, use the following function. int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp, isl_int *n, isl_int *d); If C is a constant and if C and C are not C then the numerator and denominator of the constant are returned in C<*n> and C<*d>, respectively. To check whether two union piecewise quasipolynomials are obviously equal, use int isl_union_pw_qpolynomial_plain_is_equal( __isl_keep isl_union_pw_qpolynomial *upwqp1, __isl_keep isl_union_pw_qpolynomial *upwqp2); =head3 Operations on (Piecewise) Quasipolynomials __isl_give isl_qpolynomial *isl_qpolynomial_scale( __isl_take isl_qpolynomial *qp, isl_int v); __isl_give isl_qpolynomial *isl_qpolynomial_scale_val( __isl_take isl_qpolynomial *qp, __isl_take isl_val *v); __isl_give isl_qpolynomial *isl_qpolynomial_neg( __isl_take isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_add( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_sub( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_mul( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_pow( __isl_take isl_qpolynomial *qp, unsigned exponent); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_fix_val( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned n, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial * isl_pw_qpolynomial_scale_val( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_disjoint( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_pow( __isl_take isl_pw_qpolynomial *pwqp, unsigned exponent); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_scale_val( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_val *v); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_add( __isl_take isl_union_pw_qpolynomial *upwqp1, __isl_take isl_union_pw_qpolynomial *upwqp2); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub( __isl_take isl_union_pw_qpolynomial *upwqp1, __isl_take isl_union_pw_qpolynomial *upwqp2); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul( __isl_take isl_union_pw_qpolynomial *upwqp1, __isl_take isl_union_pw_qpolynomial *upwqp2); __isl_give isl_qpolynomial *isl_pw_qpolynomial_eval( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_point *pnt); __isl_give isl_qpolynomial *isl_union_pw_qpolynomial_eval( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_point *pnt); __isl_give isl_set *isl_pw_qpolynomial_domain( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_intersect_domain( __isl_take isl_pw_qpolynomial *pwpq, __isl_take isl_set *set); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_intersect_params( __isl_take isl_pw_qpolynomial *pwpq, __isl_take isl_set *set); __isl_give isl_union_set *isl_union_pw_qpolynomial_domain( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_intersect_domain( __isl_take isl_union_pw_qpolynomial *upwpq, __isl_take isl_union_set *uset); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_intersect_params( __isl_take isl_union_pw_qpolynomial *upwpq, __isl_take isl_set *set); __isl_give isl_qpolynomial *isl_qpolynomial_align_params( __isl_take isl_qpolynomial *qp, __isl_take isl_space *model); __isl_give isl_qpolynomial *isl_qpolynomial_project_domain_on_params( __isl_take isl_qpolynomial *qp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_project_domain_on_params( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_coalesce( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_qpolynomial *isl_qpolynomial_gist_params( __isl_take isl_qpolynomial *qp, __isl_take isl_set *context); __isl_give isl_qpolynomial *isl_qpolynomial_gist( __isl_take isl_qpolynomial *qp, __isl_take isl_set *context); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_gist_params( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_set *context); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_gist( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_set *context); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_gist_params( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_set *context); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_gist( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_union_set *context); The gist operation applies the gist operation to each of the cells in the domain of the input piecewise quasipolynomial. The context is also exploited to simplify the quasipolynomials associated to each cell. __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial( __isl_take isl_pw_qpolynomial *pwqp, int sign); __isl_give isl_union_pw_qpolynomial * isl_union_pw_qpolynomial_to_polynomial( __isl_take isl_union_pw_qpolynomial *upwqp, int sign); Approximate each quasipolynomial by a polynomial. If C is positive, the polynomial will be an overapproximation. If C is negative, it will be an underapproximation. If C is zero, the approximation will lie somewhere in between. =head2 Bounds on Piecewise Quasipolynomials and Piecewise Quasipolynomial Reductions A piecewise quasipolynomial reduction is a piecewise reduction (or fold) of quasipolynomials. In particular, the reduction can be maximum or a minimum. The objects are mainly used to represent the result of an upper or lower bound on a quasipolynomial over its domain, i.e., as the result of the following function. __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_bound( __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_bound( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_fold type, int *tight); The C argument may be either C or C. If C is not C, then C<*tight> is set to C<1> is the returned bound is known be tight, i.e., for each value of the parameters there is at least one element in the domain that reaches the bound. If the domain of C is not wrapping, then the bound is computed over all elements in that domain and the result has a purely parametric domain. If the domain of C is wrapping, then the bound is computed over the range of the wrapped relation. The domain of the wrapped relation becomes the domain of the result. A (piecewise) quasipolynomial reduction can be copied or freed using the following functions. __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy( __isl_keep isl_qpolynomial_fold *fold); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_copy( __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_copy( __isl_keep isl_union_pw_qpolynomial_fold *upwf); void isl_qpolynomial_fold_free( __isl_take isl_qpolynomial_fold *fold); void *isl_pw_qpolynomial_fold_free( __isl_take isl_pw_qpolynomial_fold *pwf); void *isl_union_pw_qpolynomial_fold_free( __isl_take isl_union_pw_qpolynomial_fold *upwf); =head3 Printing Piecewise Quasipolynomial Reductions Piecewise quasipolynomial reductions can be printed using the following function. __isl_give isl_printer *isl_printer_print_pw_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial_fold *upwf); For C, output format of the printer needs to be set to either C or C. For C, output format of the printer needs to be set to C. In case of printing in C, the user may want to set the names of all dimensions __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_set_dim_name( __isl_take isl_pw_qpolynomial_fold *pwf, enum isl_dim_type type, unsigned pos, const char *s); =head3 Inspecting (Piecewise) Quasipolynomial Reductions To iterate over all piecewise quasipolynomial reductions in a union piecewise quasipolynomial reduction, use the following function int isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold( __isl_keep isl_union_pw_qpolynomial_fold *upwf, int (*fn)(__isl_take isl_pw_qpolynomial_fold *pwf, void *user), void *user); To iterate over the cells in a piecewise quasipolynomial reduction, use either of the following two functions int isl_pw_qpolynomial_fold_foreach_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, void *user), void *user); int isl_pw_qpolynomial_fold_foreach_lifted_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, void *user), void *user); See L for an explanation of the difference between these two functions. To iterate over all quasipolynomials in a reduction, use int isl_qpolynomial_fold_foreach_qpolynomial( __isl_keep isl_qpolynomial_fold *fold, int (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user); =head3 Properties of Piecewise Quasipolynomial Reductions To check whether two union piecewise quasipolynomial reductions are obviously equal, use int isl_union_pw_qpolynomial_fold_plain_is_equal( __isl_keep isl_union_pw_qpolynomial_fold *upwf1, __isl_keep isl_union_pw_qpolynomial_fold *upwf2); =head3 Operations on Piecewise Quasipolynomial Reductions __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale( __isl_take isl_qpolynomial_fold *fold, isl_int v); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_val( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_scale_val( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_val *v); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_scale_val( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_add( __isl_take isl_pw_qpolynomial_fold *pwf1, __isl_take isl_pw_qpolynomial_fold *pwf2); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_fold( __isl_take isl_pw_qpolynomial_fold *pwf1, __isl_take isl_pw_qpolynomial_fold *pwf2); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold( __isl_take isl_union_pw_qpolynomial_fold *upwf1, __isl_take isl_union_pw_qpolynomial_fold *upwf2); __isl_give isl_qpolynomial *isl_pw_qpolynomial_fold_eval( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_point *pnt); __isl_give isl_qpolynomial *isl_union_pw_qpolynomial_fold_eval( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_point *pnt); __isl_give isl_pw_qpolynomial_fold * isl_pw_qpolynomial_fold_intersect_params( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *set); __isl_give isl_union_set *isl_union_pw_qpolynomial_fold_domain( __isl_take isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_intersect_domain( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_set *uset); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_intersect_params( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_set *set); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_project_domain_on_params( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_coalesce( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_coalesce( __isl_take isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist_params( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_gist( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *context); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_gist_params( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *context); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_gist( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_set *context); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_gist_params( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_set *context); The gist operation applies the gist operation to each of the cells in the domain of the input piecewise quasipolynomial reduction. In future, the operation will also exploit the context to simplify the quasipolynomial reductions associated to each cell. __isl_give isl_pw_qpolynomial_fold * isl_set_apply_pw_qpolynomial_fold( __isl_take isl_set *set, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight); __isl_give isl_pw_qpolynomial_fold * isl_map_apply_pw_qpolynomial_fold( __isl_take isl_map *map, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight); __isl_give isl_union_pw_qpolynomial_fold * isl_union_set_apply_union_pw_qpolynomial_fold( __isl_take isl_union_set *uset, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight); __isl_give isl_union_pw_qpolynomial_fold * isl_union_map_apply_union_pw_qpolynomial_fold( __isl_take isl_union_map *umap, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight); The functions taking a map compose the given map with the given piecewise quasipolynomial reduction. That is, compute a bound (of the same type as C or C itself) over all elements in the intersection of the range of the map and the domain of the piecewise quasipolynomial reduction as a function of an element in the domain of the map. The functions taking a set compute a bound over all elements in the intersection of the set and the domain of the piecewise quasipolynomial reduction. =head2 Parametric Vertex Enumeration The parametric vertex enumeration described in this section is mainly intended to be used internally and by the C library. #include __isl_give isl_vertices *isl_basic_set_compute_vertices( __isl_keep isl_basic_set *bset); The function C performs the actual computation of the parametric vertices and the chamber decomposition and store the result in an C object. This information can be queried by either iterating over all the vertices or iterating over all the chambers or cells and then iterating over all vertices that are active on the chamber. int isl_vertices_foreach_vertex( __isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user); int isl_vertices_foreach_cell( __isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user); int isl_cell_foreach_vertex(__isl_keep isl_cell *cell, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user); Other operations that can be performed on an C object are the following. isl_ctx *isl_vertices_get_ctx( __isl_keep isl_vertices *vertices); int isl_vertices_get_n_vertices( __isl_keep isl_vertices *vertices); void isl_vertices_free(__isl_take isl_vertices *vertices); Vertices can be inspected and destroyed using the following functions. isl_ctx *isl_vertex_get_ctx(__isl_keep isl_vertex *vertex); int isl_vertex_get_id(__isl_keep isl_vertex *vertex); __isl_give isl_basic_set *isl_vertex_get_domain( __isl_keep isl_vertex *vertex); __isl_give isl_basic_set *isl_vertex_get_expr( __isl_keep isl_vertex *vertex); void isl_vertex_free(__isl_take isl_vertex *vertex); C returns a singleton parametric set describing the vertex, while C returns the activity domain of the vertex. Note that C and C return B basic sets, so they should mainly be used for inspection and should not be mixed with integer sets. Chambers can be inspected and destroyed using the following functions. isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell); __isl_give isl_basic_set *isl_cell_get_domain( __isl_keep isl_cell *cell); void isl_cell_free(__isl_take isl_cell *cell); =head1 Polyhedral Compilation Library This section collects functionality in C that has been specifically designed for use during polyhedral compilation. =head2 Dependence Analysis C contains specialized functionality for performing array dataflow analysis. That is, given a I access relation and a collection of possible I access relations, C can compute relations that describe for each iteration of the sink access, which iteration of which of the source access relations was the last to access the same data element before the given iteration of the sink access. The resulting dependence relations map source iterations to the corresponding sink iterations. To compute standard flow dependences, the sink should be a read, while the sources should be writes. If any of the source accesses are marked as being I accesses, then there will be a dependence from the last I access B from any I access that follows this last I access. In particular, if I sources are I accesses, then memory based dependence analysis is performed. If, on the other hand, all sources are I accesses, then value based dependence analysis is performed. #include typedef int (*isl_access_level_before)(void *first, void *second); __isl_give isl_access_info *isl_access_info_alloc( __isl_take isl_map *sink, void *sink_user, isl_access_level_before fn, int max_source); __isl_give isl_access_info *isl_access_info_add_source( __isl_take isl_access_info *acc, __isl_take isl_map *source, int must, void *source_user); void *isl_access_info_free(__isl_take isl_access_info *acc); __isl_give isl_flow *isl_access_info_compute_flow( __isl_take isl_access_info *acc); int isl_flow_foreach(__isl_keep isl_flow *deps, int (*fn)(__isl_take isl_map *dep, int must, void *dep_user, void *user), void *user); __isl_give isl_map *isl_flow_get_no_source( __isl_keep isl_flow *deps, int must); void isl_flow_free(__isl_take isl_flow *deps); The function C performs the actual dependence analysis. The other functions are used to construct the input for this function or to read off the output. The input is collected in an C, which can be created through a call to C. The arguments to this functions are the sink access relation C, a token C used to identify the sink access to the user, a callback function for specifying the relative order of source and sink accesses, and the number of source access relations that will be added. The callback function has type C. The function is called with two user supplied tokens identifying either a source or the sink and it should return the shared nesting level and the relative order of the two accesses. In particular, let I be the number of loops shared by the two accesses. If C precedes C textually, then the function should return I<2 * n + 1>; otherwise, it should return I<2 * n>. The sources can be added to the C by performing (at most) C calls to C. C indicates whether the source is a I access or a I access. Note that a multi-valued access relation should only be marked I if every iteration in the domain of the relation accesses I elements in its image. The C token is again used to identify the source access. The range of the source access relation C should have the same dimension as the range of the sink access relation. The C function should usually not be called explicitly, because it is called implicitly by C. The result of the dependence analysis is collected in an C. There may be elements of the sink access for which no preceding source access could be found or for which all preceding sources are I accesses. The relations containing these elements can be obtained through calls to C, the first with C set and the second with C unset. In the case of standard flow dependence analysis, with the sink a read and the sources I writes, the first relation corresponds to the reads from uninitialized array elements and the second relation is empty. The actual flow dependences can be extracted using C. This function will call the user-specified callback function C for each B dependence between a source and the sink. The callback function is called with four arguments, the actual flow dependence relation mapping source iterations to sink iterations, a boolean that indicates whether it is a I or I dependence, a token identifying the source and an additional C with value equal to the third argument of the C call. A dependence is marked I if it originates from a I source and if it is not followed by any I sources. After finishing with an C, the user should call C to free all associated memory. A higher-level interface to dependence analysis is provided by the following function. #include int isl_union_map_compute_flow(__isl_take isl_union_map *sink, __isl_take isl_union_map *must_source, __isl_take isl_union_map *may_source, __isl_take isl_union_map *schedule, __isl_give isl_union_map **must_dep, __isl_give isl_union_map **may_dep, __isl_give isl_union_map **must_no_source, __isl_give isl_union_map **may_no_source); The arrays are identified by the tuple names of the ranges of the accesses. The iteration domains by the tuple names of the domains of the accesses and of the schedule. The relative order of the iteration domains is given by the schedule. The relations returned through C and C are subsets of C. Any of C, C, C or C may be C, but a C value for any of the other arguments is treated as an error. =head3 Interaction with Dependence Analysis During the dependence analysis, we frequently need to perform the following operation. Given a relation between sink iterations and potential source iterations from a particular source domain, what is the last potential source iteration corresponding to each sink iteration. It can sometimes be convenient to adjust the set of potential source iterations before or after each such operation. The prototypical example is fuzzy array dataflow analysis, where we need to analyze if, based on data-dependent constraints, the sink iteration can ever be executed without one or more of the corresponding potential source iterations being executed. If so, we can introduce extra parameters and select an unknown but fixed source iteration from the potential source iterations. To be able to perform such manipulations, C provides the following function. #include typedef __isl_give isl_restriction *(*isl_access_restrict)( __isl_keep isl_map *source_map, __isl_keep isl_set *sink, void *source_user, void *user); __isl_give isl_access_info *isl_access_info_set_restrict( __isl_take isl_access_info *acc, isl_access_restrict fn, void *user); The function C should be called before calling C and registers a callback function that will be called any time C is about to compute the last potential source. The first argument is the (reverse) proto-dependence, mapping sink iterations to potential source iterations. The second argument represents the sink iterations for which we want to compute the last source iteration. The third argument is the token corresponding to the source and the final argument is the token passed to C. The callback is expected to return a restriction on either the input or the output of the operation computing the last potential source. If the input needs to be restricted then restrictions are needed for both the source and the sink iterations. The sink iterations and the potential source iterations will be intersected with these sets. If the output needs to be restricted then only a restriction on the source iterations is required. If any error occurs, the callback should return C. An C object can be created, freed and inspected using the following functions. #include __isl_give isl_restriction *isl_restriction_input( __isl_take isl_set *source_restr, __isl_take isl_set *sink_restr); __isl_give isl_restriction *isl_restriction_output( __isl_take isl_set *source_restr); __isl_give isl_restriction *isl_restriction_none( __isl_take isl_map *source_map); __isl_give isl_restriction *isl_restriction_empty( __isl_take isl_map *source_map); void *isl_restriction_free( __isl_take isl_restriction *restr); isl_ctx *isl_restriction_get_ctx( __isl_keep isl_restriction *restr); C and C are special cases of C. C is essentially equivalent to isl_restriction_input(isl_set_universe( isl_space_range(isl_map_get_space(source_map))), isl_set_universe( isl_space_domain(isl_map_get_space(source_map)))); whereas C is essentially equivalent to isl_restriction_input(isl_set_empty( isl_space_range(isl_map_get_space(source_map))), isl_set_universe( isl_space_domain(isl_map_get_space(source_map)))); =head2 Scheduling B The following function can be used to compute a schedule for a union of domains. By default, the algorithm used to construct the schedule is similar to that of C. Alternatively, Feautrier's multi-dimensional scheduling algorithm can be selected. The generated schedule respects all C dependences. That is, all dependence distances over these dependences in the scheduled space are lexicographically positive. The default algorithm tries to minimize the dependence distances over C dependences. Moreover, it tries to obtain sequences (bands) of schedule dimensions for groups of domains where the dependence distances have only non-negative values. When using Feautrier's algorithm, the C dependence distances are only minimized during the extension to a full-dimensional schedule. #include __isl_give isl_schedule *isl_union_set_compute_schedule( __isl_take isl_union_set *domain, __isl_take isl_union_map *validity, __isl_take isl_union_map *proximity); void *isl_schedule_free(__isl_take isl_schedule *sched); A mapping from the domains to the scheduled space can be obtained from an C using the following function. __isl_give isl_union_map *isl_schedule_get_map( __isl_keep isl_schedule *sched); A representation of the schedule can be printed using __isl_give isl_printer *isl_printer_print_schedule( __isl_take isl_printer *p, __isl_keep isl_schedule *schedule); A representation of the schedule as a forest of bands can be obtained using the following function. __isl_give isl_band_list *isl_schedule_get_band_forest( __isl_keep isl_schedule *schedule); The individual bands can be visited in depth-first post-order using the following function. #include int isl_schedule_foreach_band( __isl_keep isl_schedule *sched, int (*fn)(__isl_keep isl_band *band, void *user), void *user); The list can be manipulated as explained in L<"Lists">. The bands inside the list can be copied and freed using the following functions. #include __isl_give isl_band *isl_band_copy( __isl_keep isl_band *band); void *isl_band_free(__isl_take isl_band *band); Each band contains zero or more scheduling dimensions. These are referred to as the members of the band. The section of the schedule that corresponds to the band is referred to as the partial schedule of the band. For those nodes that participate in a band, the outer scheduling dimensions form the prefix schedule, while the inner scheduling dimensions form the suffix schedule. That is, if we take a cut of the band forest, then the union of the concatenations of the prefix, partial and suffix schedules of each band in the cut is equal to the entire schedule (modulo some possible padding at the end with zero scheduling dimensions). The properties of a band can be inspected using the following functions. #include isl_ctx *isl_band_get_ctx(__isl_keep isl_band *band); int isl_band_has_children(__isl_keep isl_band *band); __isl_give isl_band_list *isl_band_get_children( __isl_keep isl_band *band); __isl_give isl_union_map *isl_band_get_prefix_schedule( __isl_keep isl_band *band); __isl_give isl_union_map *isl_band_get_partial_schedule( __isl_keep isl_band *band); __isl_give isl_union_map *isl_band_get_suffix_schedule( __isl_keep isl_band *band); int isl_band_n_member(__isl_keep isl_band *band); int isl_band_member_is_zero_distance( __isl_keep isl_band *band, int pos); int isl_band_list_foreach_band( __isl_keep isl_band_list *list, int (*fn)(__isl_keep isl_band *band, void *user), void *user); Note that a scheduling dimension is considered to be ``zero distance'' if it does not carry any proximity dependences within its band. That is, if the dependence distances of the proximity dependences are all zero in that direction (for fixed iterations of outer bands). Like C, the function C calls C on the bands in depth-first post-order. A band can be tiled using the following function. #include int isl_band_tile(__isl_keep isl_band *band, __isl_take isl_vec *sizes); int isl_options_set_tile_scale_tile_loops(isl_ctx *ctx, int val); int isl_options_get_tile_scale_tile_loops(isl_ctx *ctx); int isl_options_set_tile_shift_point_loops(isl_ctx *ctx, int val); int isl_options_get_tile_shift_point_loops(isl_ctx *ctx); The C function tiles the band using the given tile sizes inside its schedule. A new child band is created to represent the point loops and it is inserted between the modified band and its children. The C option specifies whether the tile loops iterators should be scaled by the tile sizes. If the C option is set, then the point loops are shifted to start at zero. A band can be split into two nested bands using the following function. int isl_band_split(__isl_keep isl_band *band, int pos); The resulting outer band contains the first C dimensions of C while the inner band contains the remaining dimensions. A representation of the band can be printed using #include __isl_give isl_printer *isl_printer_print_band( __isl_take isl_printer *p, __isl_keep isl_band *band); =head3 Options #include int isl_options_set_schedule_max_coefficient( isl_ctx *ctx, int val); int isl_options_get_schedule_max_coefficient( isl_ctx *ctx); int isl_options_set_schedule_max_constant_term( isl_ctx *ctx, int val); int isl_options_get_schedule_max_constant_term( isl_ctx *ctx); int isl_options_set_schedule_fuse(isl_ctx *ctx, int val); int isl_options_get_schedule_fuse(isl_ctx *ctx); int isl_options_set_schedule_maximize_band_depth( isl_ctx *ctx, int val); int isl_options_get_schedule_maximize_band_depth( isl_ctx *ctx); int isl_options_set_schedule_outer_zero_distance( isl_ctx *ctx, int val); int isl_options_get_schedule_outer_zero_distance( isl_ctx *ctx); int isl_options_set_schedule_split_scaled( isl_ctx *ctx, int val); int isl_options_get_schedule_split_scaled( isl_ctx *ctx); int isl_options_set_schedule_algorithm( isl_ctx *ctx, int val); int isl_options_get_schedule_algorithm( isl_ctx *ctx); int isl_options_set_schedule_separate_components( isl_ctx *ctx, int val); int isl_options_get_schedule_separate_components( isl_ctx *ctx); =over =item * schedule_max_coefficient This option enforces that the coefficients for variable and parameter dimensions in the calculated schedule are not larger than the specified value. This option can significantly increase the speed of the scheduling calculation and may also prevent fusing of unrelated dimensions. A value of -1 means that this option does not introduce bounds on the variable or parameter coefficients. =item * schedule_max_constant_term This option enforces that the constant coefficients in the calculated schedule are not larger than the maximal constant term. This option can significantly increase the speed of the scheduling calculation and may also prevent fusing of unrelated dimensions. A value of -1 means that this option does not introduce bounds on the constant coefficients. =item * schedule_fuse This option controls the level of fusion. If this option is set to C, then loops in the resulting schedule will be distributed as much as possible. If this option is set to C, then C will try to fuse loops in the resulting schedule. =item * schedule_maximize_band_depth If this option is set, we do not split bands at the point where we detect splitting is necessary. Instead, we backtrack and split bands as early as possible. This reduces the number of splits and maximizes the width of the bands. Wider bands give more possibilities for tiling. Note that if the C option is set to C, then bands will be split as early as possible, even if there is no need. The C option therefore has no effect in this case. =item * schedule_outer_zero_distance If this option is set, then we try to construct schedules where the outermost scheduling dimension in each band results in a zero dependence distance over the proximity dependences. =item * schedule_split_scaled If this option is set, then we try to construct schedules in which the constant term is split off from the linear part if the linear parts of the scheduling rows for all nodes in the graphs have a common non-trivial divisor. The constant term is then placed in a separate band and the linear part is reduced. =item * schedule_algorithm Selects the scheduling algorithm to be used. Available scheduling algorithms are C and C. =item * schedule_separate_components If at any point the dependence graph contains any (weakly connected) components, then these components are scheduled separately. If this option is not set, then some iterations of the domains in these components may be scheduled together. If this option is set, then the components are given consecutive schedules. =back =head2 AST Generation This section describes the C functionality for generating ASTs that visit all the elements in a domain in an order specified by a schedule. In particular, given a C, an AST is generated that visits all the elements in the domain of the C according to the lexicographic order of the corresponding image element(s). If the range of the C consists of elements in more than one space, then each of these spaces is handled separately in an arbitrary order. It should be noted that the image elements only specify the I in which the corresponding domain elements should be visited. No direct relation between the image elements and the loop iterators in the generated AST should be assumed. Each AST is generated within a build. The initial build simply specifies the constraints on the parameters (if any) and can be created, inspected, copied and freed using the following functions. #include __isl_give isl_ast_build *isl_ast_build_from_context( __isl_take isl_set *set); isl_ctx *isl_ast_build_get_ctx( __isl_keep isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_copy( __isl_keep isl_ast_build *build); void *isl_ast_build_free( __isl_take isl_ast_build *build); The C argument is usually a parameter set with zero or more parameters. More C functions are described in L and L. Finally, the AST itself can be constructed using the following function. #include __isl_give isl_ast_node *isl_ast_build_ast_from_schedule( __isl_keep isl_ast_build *build, __isl_take isl_union_map *schedule); =head3 Inspecting the AST The basic properties of an AST node can be obtained as follows. #include isl_ctx *isl_ast_node_get_ctx( __isl_keep isl_ast_node *node); enum isl_ast_node_type isl_ast_node_get_type( __isl_keep isl_ast_node *node); The type of an AST node is one of C, C, C or C. An C represents a for node. An C represents an if node. An C represents a compound node. An C represents an expression statement. An expression statement typically corresponds to a domain element, i.e., one of the elements that is visited by the AST. Each type of node has its own additional properties. #include __isl_give isl_ast_expr *isl_ast_node_for_get_iterator( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_for_get_init( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_for_get_cond( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_for_get_inc( __isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_for_get_body( __isl_keep isl_ast_node *node); int isl_ast_node_for_is_degenerate( __isl_keep isl_ast_node *node); An C is considered degenerate if it is known to execute exactly once. #include __isl_give isl_ast_expr *isl_ast_node_if_get_cond( __isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_if_get_then( __isl_keep isl_ast_node *node); int isl_ast_node_if_has_else( __isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_if_get_else( __isl_keep isl_ast_node *node); __isl_give isl_ast_node_list * isl_ast_node_block_get_children( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_user_get_expr( __isl_keep isl_ast_node *node); Each of the returned Cs can in turn be inspected using the following functions. #include isl_ctx *isl_ast_expr_get_ctx( __isl_keep isl_ast_expr *expr); enum isl_ast_expr_type isl_ast_expr_get_type( __isl_keep isl_ast_expr *expr); The type of an AST expression is one of C, C or C. An C represents the result of an operation. An C represents an identifier. An C represents an integer value. Each type of expression has its own additional properties. #include enum isl_ast_op_type isl_ast_expr_get_op_type( __isl_keep isl_ast_expr *expr); int isl_ast_expr_get_op_n_arg(__isl_keep isl_ast_expr *expr); __isl_give isl_ast_expr *isl_ast_expr_get_op_arg( __isl_keep isl_ast_expr *expr, int pos); int isl_ast_node_foreach_ast_op_type( __isl_keep isl_ast_node *node, int (*fn)(enum isl_ast_op_type type, void *user), void *user); C returns the type of the operation performed. C returns the number of arguments. C returns the specified argument. C calls C for each distinct C that appears in C. The operation type is one of the following. =over =item C Logical I of two arguments. Both arguments can be evaluated. =item C Logical I of two arguments. The second argument can only be evaluated if the first evaluates to true. =item C Logical I of two arguments. Both arguments can be evaluated. =item C Logical I of two arguments. The second argument can only be evaluated if the first evaluates to false. =item C Maximum of two or more arguments. =item C Minimum of two or more arguments. =item C Change sign. =item C Sum of two arguments. =item C Difference of two arguments. =item C Product of two arguments. =item C Exact division. That is, the result is known to be an integer. =item C Result of integer division, rounded towards negative infinity. =item C Result of integer division, where dividend is known to be non-negative. =item C Remainder of integer division, where dividend is known to be non-negative. =item C Conditional operator defined on three arguments. If the first argument evaluates to true, then the result is equal to the second argument. Otherwise, the result is equal to the third argument. The second and third argument may only be evaluated if the first argument evaluates to true and false, respectively. Corresponds to C in C. =item C Conditional operator defined on three arguments. If the first argument evaluates to true, then the result is equal to the second argument. Otherwise, the result is equal to the third argument. The second and third argument may be evaluated independently of the value of the first argument. Corresponds to C in C. =item C Equality relation. =item C Less than or equal relation. =item C Less than relation. =item C Greater than or equal relation. =item C Greater than relation. =item C A function call. The number of arguments of the C is one more than the number of arguments in the function call, the first argument representing the function being called. =back #include __isl_give isl_id *isl_ast_expr_get_id( __isl_keep isl_ast_expr *expr); Return the identifier represented by the AST expression. #include int isl_ast_expr_get_int(__isl_keep isl_ast_expr *expr, isl_int *v); __isl_give isl_val *isl_ast_expr_get_val( __isl_keep isl_ast_expr *expr); Return the integer represented by the AST expression. Note that the integer is returned by C through the C argument. The return value of this function itself indicates whether the operation was performed successfully. =head3 Manipulating and printing the AST AST nodes can be copied and freed using the following functions. #include __isl_give isl_ast_node *isl_ast_node_copy( __isl_keep isl_ast_node *node); void *isl_ast_node_free(__isl_take isl_ast_node *node); AST expressions can be copied and freed using the following functions. #include __isl_give isl_ast_expr *isl_ast_expr_copy( __isl_keep isl_ast_expr *expr); void *isl_ast_expr_free(__isl_take isl_ast_expr *expr); New AST expressions can be created either directly or within the context of an C. #include __isl_give isl_ast_expr *isl_ast_expr_from_val( __isl_take isl_val *v); __isl_give isl_ast_expr *isl_ast_expr_from_id( __isl_take isl_id *id); __isl_give isl_ast_expr *isl_ast_expr_neg( __isl_take isl_ast_expr *expr); __isl_give isl_ast_expr *isl_ast_expr_add( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_sub( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_mul( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_div( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_and( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) __isl_give isl_ast_expr *isl_ast_expr_or( __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) #include __isl_give isl_ast_expr *isl_ast_build_expr_from_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa); __isl_give isl_ast_expr * isl_ast_build_call_from_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma); The domains of C and C should correspond to the schedule space of C. The tuple id of C is used as the function being called. User specified data can be attached to an C and obtained from the same C using the following functions. #include __isl_give isl_ast_node *isl_ast_node_set_annotation( __isl_take isl_ast_node *node, __isl_take isl_id *annotation); __isl_give isl_id *isl_ast_node_get_annotation( __isl_keep isl_ast_node *node); Basic printing can be performed using the following functions. #include __isl_give isl_printer *isl_printer_print_ast_expr( __isl_take isl_printer *p, __isl_keep isl_ast_expr *expr); __isl_give isl_printer *isl_printer_print_ast_node( __isl_take isl_printer *p, __isl_keep isl_ast_node *node); More advanced printing can be performed using the following functions. #include __isl_give isl_printer *isl_ast_op_type_print_macro( enum isl_ast_op_type type, __isl_take isl_printer *p); __isl_give isl_printer *isl_ast_node_print_macros( __isl_keep isl_ast_node *node, __isl_take isl_printer *p); __isl_give isl_printer *isl_ast_node_print( __isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options); __isl_give isl_printer *isl_ast_node_for_print( __isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options); __isl_give isl_printer *isl_ast_node_if_print( __isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options); While printing an C in C, C may print out an AST that makes use of macros such as C, C and C. C prints out the macro corresponding to a specific C. C scans the C for expressions where these macros would be used and prints out the required macro definitions. Essentially, C calls C with C as function argument. C, C and C print an C in C, but allow for some extra control through an C object. This object can be created using the following functions. #include __isl_give isl_ast_print_options * isl_ast_print_options_alloc(isl_ctx *ctx); __isl_give isl_ast_print_options * isl_ast_print_options_copy( __isl_keep isl_ast_print_options *options); void *isl_ast_print_options_free( __isl_take isl_ast_print_options *options); __isl_give isl_ast_print_options * isl_ast_print_options_set_print_user( __isl_take isl_ast_print_options *options, __isl_give isl_printer *(*print_user)( __isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user), void *user); __isl_give isl_ast_print_options * isl_ast_print_options_set_print_for( __isl_take isl_ast_print_options *options, __isl_give isl_printer *(*print_for)( __isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user), void *user); The callback set by C is called whenever a node of type C needs to be printed. The callback set by C is called whenever a node of type C needs to be printed. Note that C will I call the callback set by C on the node on which C is called, but only on nested nodes of type C. It is therefore safe to call C from within the callback set by C. The following option determines the type to be used for iterators while printing the AST. int isl_options_set_ast_iterator_type( isl_ctx *ctx, const char *val); const char *isl_options_get_ast_iterator_type( isl_ctx *ctx); =head3 Options #include int isl_options_set_ast_build_atomic_upper_bound( isl_ctx *ctx, int val); int isl_options_get_ast_build_atomic_upper_bound( isl_ctx *ctx); int isl_options_set_ast_build_prefer_pdiv(isl_ctx *ctx, int val); int isl_options_get_ast_build_prefer_pdiv(isl_ctx *ctx); int isl_options_set_ast_build_exploit_nested_bounds( isl_ctx *ctx, int val); int isl_options_get_ast_build_exploit_nested_bounds( isl_ctx *ctx); int isl_options_set_ast_build_group_coscheduled( isl_ctx *ctx, int val); int isl_options_get_ast_build_group_coscheduled( isl_ctx *ctx); int isl_options_set_ast_build_scale_strides( isl_ctx *ctx, int val); int isl_options_get_ast_build_scale_strides( isl_ctx *ctx); int isl_options_set_ast_build_allow_else(isl_ctx *ctx, int val); int isl_options_get_ast_build_allow_else(isl_ctx *ctx); int isl_options_set_ast_build_allow_or(isl_ctx *ctx, int val); int isl_options_get_ast_build_allow_or(isl_ctx *ctx); =over =item * ast_build_atomic_upper_bound Generate loop upper bounds that consist of the current loop iterator, an operator and an expression not involving the iterator. If this option is not set, then the current loop iterator may appear several times in the upper bound. For example, when this option is turned off, AST generation for the schedule [n] -> { A[i] -> [i] : 0 <= i <= 100, n } produces for (int c0 = 0; c0 <= 100 && n >= c0; c0 += 1) A(c0); When the option is turned on, the following AST is generated for (int c0 = 0; c0 <= min(100, n); c0 += 1) A(c0); =item * ast_build_prefer_pdiv If this option is turned off, then the AST generation will produce ASTs that may only contain C operators, but no C or C operators. If this options is turned on, then C will try to convert some of the C operators to (expressions containing) C or C operators. =item * ast_build_exploit_nested_bounds Simplify conditions based on bounds of nested for loops. In particular, remove conditions that are implied by the fact that one or more nested loops have at least one iteration, meaning that the upper bound is at least as large as the lower bound. For example, when this option is turned off, AST generation for the schedule [N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M } produces if (M >= 0) for (int c0 = 0; c0 <= N; c0 += 1) for (int c1 = 0; c1 <= M; c1 += 1) A(c0, c1); When the option is turned on, the following AST is generated for (int c0 = 0; c0 <= N; c0 += 1) for (int c1 = 0; c1 <= M; c1 += 1) A(c0, c1); =item * ast_build_group_coscheduled If two domain elements are assigned the same schedule point, then they may be executed in any order and they may even appear in different loops. If this options is set, then the AST generator will make sure that coscheduled domain elements do not appear in separate parts of the AST. This is useful in case of nested AST generation if the outer AST generation is given only part of a schedule and the inner AST generation should handle the domains that are coscheduled by this initial part of the schedule together. For example if an AST is generated for a schedule { A[i] -> [0]; B[i] -> [0] } then the C callback described below may get called twice, once for each domain. Setting this option ensures that the callback is only called once on both domains together. =item * ast_build_separation_bounds This option specifies which bounds to use during separation. If this option is set to C then all (possibly implicit) bounds on the current dimension will be used during separation. If this option is set to C then only those bounds that are explicitly available will be used during separation. =item * ast_build_scale_strides This option specifies whether the AST generator is allowed to scale down iterators of strided loops. =item * ast_build_allow_else This option specifies whether the AST generator is allowed to construct if statements with else branches. =item * ast_build_allow_or This option specifies whether the AST generator is allowed to construct if conditions with disjunctions. =back =head3 Fine-grained Control over AST Generation Besides specifying the constraints on the parameters, an C object can be used to control various aspects of the AST generation process. The most prominent way of control is through ``options'', which can be set using the following function. #include __isl_give isl_ast_build * isl_ast_build_set_options( __isl_take isl_ast_build *control, __isl_take isl_union_map *options); The options are encoded in an . The domain of this union relation refers to the schedule domain, i.e., the range of the schedule passed to C. In the case of nested AST generation (see L), the domain of C should refer to the extra piece of the schedule. That is, it should be equal to the range of the wrapped relation in the range of the schedule. The range of the options can consist of elements in one or more spaces, the names of which determine the effect of the option. The values of the range typically also refer to the schedule dimension to which the option applies. In case of nested AST generation (see L), these values refer to the position of the schedule dimension within the innermost AST generation. The constraints on the domain elements of the option should only refer to this dimension and earlier dimensions. We consider the following spaces. =over =item C This space is a wrapped relation between two one dimensional spaces. The input space represents the schedule dimension to which the option applies and the output space represents the separation class. While constructing a loop corresponding to the specified schedule dimension(s), the AST generator will try to generate separate loops for domain elements that are assigned different classes. If only some of the elements are assigned a class, then those elements that are not assigned any class will be treated as belonging to a class that is separate from the explicitly assigned classes. The typical use case for this option is to separate full tiles from partial tiles. The other options, described below, are applied after the separation into classes. As an example, consider the separation into full and partial tiles of a tiling of a triangular domain. Take, for example, the domain { A[i,j] : 0 <= i,j and i + j <= 100 } and a tiling into tiles of 10 by 10. The input to the AST generator is then the schedule { A[i,j] -> [([i/10]),[j/10],i,j] : 0 <= i,j and i + j <= 100 } Without any options, the following AST is generated for (int c0 = 0; c0 <= 10; c0 += 1) for (int c1 = 0; c1 <= -c0 + 10; c1 += 1) for (int c2 = 10 * c0; c2 <= min(-10 * c1 + 100, 10 * c0 + 9); c2 += 1) for (int c3 = 10 * c1; c3 <= min(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); Separation into full and partial tiles can be obtained by assigning a class, say C<0>, to the full tiles. The full tiles are represented by those values of the first and second schedule dimensions for which there are values of the third and fourth dimensions to cover an entire tile. That is, we need to specify the following option { [a,b,c,d] -> separation_class[[0]->[0]] : exists b': 0 <= 10a,10b' and 10a+9+10b'+9 <= 100; [a,b,c,d] -> separation_class[[1]->[0]] : 0 <= 10a,10b and 10a+9+10b+9 <= 100 } which simplifies to { [a, b, c, d] -> separation_class[[1] -> [0]] : a >= 0 and b >= 0 and b <= 8 - a; [a, b, c, d] -> separation_class[[0] -> [0]] : a >= 0 and a <= 8 } With this option, the generated AST is as follows { for (int c0 = 0; c0 <= 8; c0 += 1) { for (int c1 = 0; c1 <= -c0 + 8; c1 += 1) for (int c2 = 10 * c0; c2 <= 10 * c0 + 9; c2 += 1) for (int c3 = 10 * c1; c3 <= 10 * c1 + 9; c3 += 1) A(c2, c3); for (int c1 = -c0 + 9; c1 <= -c0 + 10; c1 += 1) for (int c2 = 10 * c0; c2 <= min(-10 * c1 + 100, 10 * c0 + 9); c2 += 1) for (int c3 = 10 * c1; c3 <= min(-c2 + 100, 10 * c1 + 9); c3 += 1) A(c2, c3); } for (int c0 = 9; c0 <= 10; c0 += 1) for (int c1 = 0; c1 <= -c0 + 10; c1 += 1) for (int c2 = 10 * c0; c2 <= min(-10 * c1 + 100, 10 * c0 + 9); c2 += 1) for (int c3 = 10 * c1; c3 <= min(10 * c1 + 9, -c2 + 100); c3 += 1) A(c2, c3); } =item C This is a single-dimensional space representing the schedule dimension(s) to which ``separation'' should be applied. Separation tries to split a loop into several pieces if this can avoid the generation of guards inside the loop. See also the C option. =item C This is a single-dimensional space representing the schedule dimension(s) for which the domains should be considered ``atomic''. That is, the AST generator will make sure that any given domain space will only appear in a single loop at the specified level. Consider the following schedule { a[i] -> [i] : 0 <= i < 10; b[i] -> [i+1] : 0 <= i < 10 } If the following option is specified { [i] -> separate[x] } then the following AST will be generated { a(0); for (int c0 = 1; c0 <= 9; c0 += 1) { a(c0); b(c0 - 1); } b(9); } If, on the other hand, the following option is specified { [i] -> atomic[x] } then the following AST will be generated for (int c0 = 0; c0 <= 10; c0 += 1) { if (c0 <= 9) a(c0); if (c0 >= 1) b(c0 - 1); } If neither C nor C is specified, then the AST generator may produce either of these two results or some intermediate form. =item C This is a single-dimensional space representing the schedule dimension(s) that should be I unrolled. To obtain a partial unrolling, the user should apply an additional strip-mining to the schedule and fully unroll the inner loop. =back Additional control is available through the following functions. #include __isl_give isl_ast_build * isl_ast_build_set_iterators( __isl_take isl_ast_build *control, __isl_take isl_id_list *iterators); The function C allows the user to specify a list of iterator Cs to be used as iterators. If the input schedule is injective, then the number of elements in this list should be as large as the dimension of the schedule space, but no direct correspondence should be assumed between dimensions and elements. If the input schedule is not injective, then an additional number of Cs equal to the largest dimension of the input domains may be required. If the number of provided Cs is insufficient, then additional names are automatically generated. #include __isl_give isl_ast_build * isl_ast_build_set_create_leaf( __isl_take isl_ast_build *control, __isl_give isl_ast_node *(*fn)( __isl_take isl_ast_build *build, void *user), void *user); The C function allows for the specification of a callback that should be called whenever the AST generator arrives at an element of the schedule domain. The callback should return an AST node that should be inserted at the corresponding position of the AST. The default action (when the callback is not set) is to continue generating parts of the AST to scan all the domain elements associated to the schedule domain element and to insert user nodes, ``calling'' the domain element, for each of them. The C argument contains the current state of the C. To ease nested AST generation (see L), all control information that is specific to the current AST generation such as the options and the callbacks has been removed from this C. The callback would typically return the result of a nested AST generation or a user defined node created using the following function. #include __isl_give isl_ast_node *isl_ast_node_alloc_user( __isl_take isl_ast_expr *expr); #include __isl_give isl_ast_build * isl_ast_build_set_at_each_domain( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)( __isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user), void *user); __isl_give isl_ast_build * isl_ast_build_set_before_each_for( __isl_take isl_ast_build *build, __isl_give isl_id *(*fn)( __isl_keep isl_ast_build *build, void *user), void *user); __isl_give isl_ast_build * isl_ast_build_set_after_each_for( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)( __isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user), void *user); The callback set by C will be called for each domain AST node. The callbacks set by C and C will be called for each for AST node. The first will be called in depth-first pre-order, while the second will be called in depth-first post-order. Since C is called before the for node is actually constructed, it is only passed an C. The returned C will be added as an annotation (using C) to the constructed for node. In particular, if the user has also specified an C callback, then the annotation can be retrieved from the node passed to that callback using C. All callbacks should C on failure. The given C can be used to create new C objects using C or C. =head3 Nested AST Generation C allows the user to create an AST within the context of another AST. These nested ASTs are created using the same C function that is used to create the outer AST. The C argument should be an C passed to a callback set by C. The space of the range of the C argument should refer to this build. In particular, the space should be a wrapped relation and the domain of this wrapped relation should be the same as that of the range of the schedule returned by C below. In practice, the new schedule is typically created by calling C on the old schedule and some extra piece of the schedule. The space of the schedule domain is also available from the C. #include __isl_give isl_union_map *isl_ast_build_get_schedule( __isl_keep isl_ast_build *build); __isl_give isl_space *isl_ast_build_get_schedule_space( __isl_keep isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_restrict( __isl_take isl_ast_build *build, __isl_take isl_set *set); The C function returns a (partial) schedule for the domains elements for which part of the AST still needs to be generated in the current build. In particular, the domain elements are mapped to those iterations of the loops enclosing the current point of the AST generation inside which the domain elements are executed. No direct correspondence between the input schedule and this schedule should be assumed. The space obtained from C can be used to create a set for C to intersect with the current build. In particular, the set passed to C can have additional parameters. The ids of the set dimensions in the space returned by C correspond to the iterators of the already generated loops. The user should not rely on the ids of the output dimensions of the relations in the union relation returned by C having any particular value. =head1 Applications Although C is mainly meant to be used as a library, it also contains some basic applications that use some of the functionality of C. The input may be specified in either the L or the L. =head2 C C takes a polyhedron as input and prints an integer element of the polyhedron, if there is any. The first column in the output is the denominator and is always equal to 1. If the polyhedron contains no integer points, then a vector of length zero is printed. =head2 C C takes the same input as the C program from the C distribution, i.e., a set of constraints on the parameters, a line containing only -1 and finally a set of constraints on a parametric polyhedron. The coefficients of the parameters appear in the last columns (but before the final constant column). The output is the lexicographic minimum of the parametric polyhedron. As C currently does not have its own output format, the output is just a dump of the internal state. =head2 C C computes the minimum of some linear or affine objective function over the integer points in a polyhedron. If an affine objective function is given, then the constant should appear in the last column. =head2 C Given a polytope, C prints all integer points in the polytope. =head2 C Given a schedule, a context set and an options relation, C prints out an AST that scans the domain elements of the schedule in the order of their image(s) taking into account the constraints in the context set. cloog-0.18.2/isl/doc/manual.pdf0000664000175000017500000162056512254314447013161 00000000000000%PDF-1.4 %ÐÔÅØ 4 0 obj << /S /GoTo /D [5 0 R /Fit ] >> endobj 7 0 obj << /Length 221 /Filter /FlateDecode >> stream xڅнnÂ0à=OqG[ÂÆ×ÎulƪPõ/00T„D)¥•úöÅ8téÐÉw9ŸÎ±‚=(¸+Ô?ïM(ƳÒVR#•v •“Î{(ÉIKa ¯ì¾=EŽÄö±çB“bóxÊÇÓaÝ7ý÷„ ƒŠ=7ígsäoááÂ:é­½¨D²ª*éÉgtÉ‘ÅþãеC~Q?Ö/Ü[Õ¿â9B:)BKôDi¤36+ó¯T,¶¹ÎÕÜvݱ*' DŠè³Ö «nã&¾¯¯“Ðò¡š”ùó[ÓPüËP« endstream endobj 5 0 obj << /Type /Page /Contents 7 0 R /Resources 6 0 R /MediaBox [0 0 612 792] /Parent 11 0 R >> endobj 8 0 obj << /D [5 0 R /XYZ 132.768 705.06 null] >> endobj 9 0 obj << /D [5 0 R /XYZ 133.768 667.198 null] >> endobj 6 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 14 0 obj << /Length 107 /Filter /FlateDecode >> stream xÚ3PHW0Ppç2€ÒN!\ún¦f F&zææ† !i †ÆÆzæf ¦ææz¦Æ& !) ÑÎùy%©y%Åš±!^pÍún& –z–fFf`f–zÆf¦ º&z@D§!Š×.Zõ endstream endobj 13 0 obj << /Type /Page /Contents 14 0 R /Resources 12 0 R /MediaBox [0 0 612 792] /Parent 11 0 R >> endobj 16 0 obj << /D [13 0 R /XYZ 133.768 537.25 null] >> endobj 12 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 19 0 obj << /Length 2043 /Filter /FlateDecode >> stream xÚµXM“Û¸½Ï¯àQªX4¾Iæ¶ëd]NŵIyrÚ݆ÂH¬P¤Ì;óïó9â í±cå$ht£¯_7Ä’CÂ’·7,þþ|{óúmÁRc„Nnï.eš™<ѹH57Éí>ùmóæhσë¶;¡Ù†oÿ¸ý[ئÒ,Ï8mcÉNiÎUØð¯~’~o›ÑÖó®R©Œˆ[t2lá)ßî8cló®º-Ï7í~,‡ªmÂf£’"-Œ0q¯©0ñ|U-¨üBˆ©Ñ²Qf»“E¾±ô“m†cçì~×Û{&ބ庺ël÷æîÛ.ÌžlSÇÚUsK½&…Í>LuŽÚ&η÷aºj·åzspQÙ¹ÅTONvñŒ;ÎÓBGoîÚ±Ù;RÊø掎ÂŽBX\8¨¦&gܬD!O…,&™Æ­%N9t–ΑnwÊèÍí1.í]_vÕyr¦½#X&‘è;ª‰Ç¼ôó'ûæ«f«ØæÓV°M[¢0¸à¸i¡dt\OŽG F D¶³'Èõ4.‚Zð‘üOÕ®*[×aúãh1þ1ᢠLêí*{W;òQ2¹ù©®ƒº²=Ça:0‰ÛÎEˮퟠ†ŽÉ–„7;Á¦SØr á“¦uØŽ8U†ñØnžÃ˜‹Ñ0ÞW+Á/Àü…ù†àgÁo†4¦`i!ŠåYeò‚Ž1ðž‰À‰7mø=9뉟Óyƒ` 'L÷í)*¼ßr¶±UWGw¶§,õKKÀ’‚*ªí‡ª®cìˆK-ûTõ”áÈMcÌæ ¿ \ï;¤É=‡Hƒ»ðŠrì(a•¸'n t Ç@àhã¶;7iìDzt}?z:¤µ±÷å_A:åã)ÝÙòßçÙUT¦úáèö%žÔÙ;`ÑCú¸{&n6}i›ÆukÄðù þ7oÛ·ëYtQÐìt,Û‡ã * a†J’_i¯û8V!ÒÄú»H' Ì™gKŸk×”t|ôåÑEÿÉ1ž­Xè©4”an­îhbÄ÷–]R|îÚ Õ#Q›_m4Rû;wn»Ág½P›{g‡±sÓÒÇÑõ<#N“TÏ^E˜2ôoúIZ}ªú*æx¼Ä‹}Õ—#pÜ6a|èÚñ>Á¼ÞC”ª"UFé¹xñÙÇã0œÿüúõJ;{r.=´í¡öÅ1Ej>®¾FqÚíÝV²pg®nÏ'Ê‚µ6.O ¦ àÜKzÏ|/¹“"à -‰ˆy>·”sSù3°þÙvûàл†ˆ·Œî Ì Åm®Ÿ•/zMžHs+ìåü&$}÷“?,e‚Ìý5²`á ¨#S u@OödËÂy|É9m<+Š @­É Ø¡÷¼é‰Àú°x´©ØtyÀ´¶wçΕvð50›p„ ¯¶å4 ¦]IfêÝKbl3nþz{óñ†J0Kx¢d† “C6K•Iyºùí–ì±JÁoÉg/zJ ,'Õɇ›†'ɲ+–æ&óªÐ!£Þñ‰jÐb‰ü94¯âÍ9·i¼GD6#í]sö¥6˧ðä›_Ç&Ÿ›ÍXªù£_BÁŽ#60JÍ!ôÿ„÷¾TKf.¯œ†¾ Oã;'úÅ]ƒáïÑØ¢Â=ô¾´¡'[¢Ä¯—`ÓnÒBK¿¡çÅ£a ¹ôÈŽÇ;ýZˆ Í1BÓ»‘ªqTU½¬ª‡ñ仄KÜnsn¿‡jQº¶B™©Ç8äéZuý° 1Âü±úËÅÕ¼~š®æyô ~Ña¦+<µ£§»äÄ&Õ®^à+ùç+ŽM(]ŽFãþجr‰·+•!thűë¸DH†w‚ñª 6rÉ益§ªPW±©”wqaó#õNM{ªìŠÃxAãÑ¥¯a\2ô@L-ßS®<·Š0s!¯baæ\,­Úý~ý9ªó™9|wË}RÒÑzcKÏq?ÚåtúB9¢V\Á7¥rßU¾!¥‹4Sæ*6Qq3©¾BZPѼŠq Þεþi„YfWÉ0K#×­>-,ô‚ nLvŠ3úçbIÉáß<“ŒÞ¼Z{ìC“2_g#Ž—,O¸FV£šý1€Wó¢ðªD&‚ͱ‰<ù”`U\Å,XæK³«¼ë¯a6¹^Úü:€yv ã’Ìžÿ€…¾ŠU0—K«_á@ýãøõ2ª ú¯kx¦’yþm¸U…œÁö£f “‘½Œ[fÒäWÁ­&ɾ·Ú ©ÙuŒg¸Ôâ›p«‹Ðú]Ã*Â,™\·ú2ñÎ!šzôŒb}$‹¾| Éÿ.x}® endstream endobj 18 0 obj << /Type /Page /Contents 19 0 R /Resources 17 0 R /MediaBox [0 0 612 792] /Parent 11 0 R >> endobj 20 0 obj << /D [18 0 R /XYZ 132.768 705.06 null] >> endobj 21 0 obj << /D [18 0 R /XYZ 133.768 667.198 null] >> endobj 22 0 obj << /D [18 0 R /XYZ 133.768 492.418 null] >> endobj 26 0 obj << /D [18 0 R /XYZ 133.768 316.364 null] >> endobj 27 0 obj << /D [18 0 R /XYZ 133.768 277.126 null] >> endobj 29 0 obj << /D [18 0 R /XYZ 133.768 176.13 null] >> endobj 17 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F64 23 0 R /F48 10 0 R /F59 24 0 R /F73 25 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 32 0 obj << /Length 3234 /Filter /FlateDecode >> stream xÚ½[M“㶽ï¯Ð-—ãûã踲)»’J%»9Ù>p$Ί±$Ê"•Éþû¼HŽ¨ÁHZ‹öi@BÝׯ>û4㳿¾ãÝß?|÷Í{cg+íìãÓL(Åœõ3k“ÊÌ>®f?ο[»Oeó°†Ï›j·,S³j6 θ~øùãØ߼ÇÏOÔ,8=[ÏЇû‰ wö}ú´”‹øñ·›M¶.‹UyHíŸ8—›~BëâAòù„™wóz,Ë]jÊ]±-WéáéPoI.f¨Ogh5“èébQqrùøî×w½|&fJ&%Ô¢ µ™}x÷Ϥá‘8¥%“ÂÅ¡Œé4œÇÖiz#mhÍÔ‹:Ú:·Τ–' øæÂxVÂÀÃjYúbä % sÞÏÒ2#osó{:ÁÇ5„‰w˶ªwMF Æ2eÂE3J%˜’jf‚bF‡{Ì(ì"Dªß'ûCµkᣯå:EÊIä:ÍLFlÆg¹€_O!Sqì q*ô±hªen£p0ôREÁ»‘Ô¦l3.-3~péb·Êîr&ÝeïP^3¡Â$s÷Ž éoó-i‹O¢3-ÜÝâÚhÆ›D*‚·öÿÐ^1/Ì$R½ežë‘Ôm±ÏøÍÃ$Xè1wW'ÛÔÀµ.°$]Åf‘þìÊiæÏ›jW²K·H€”b¡‡Ì/Ç8e®`\€ÖäŒ@pà fíç˜&¥]’ù´©Ÿ3B11.ô$B 8W#¡ŸÊ6ªžÉ '‘é•~$rWg$‰&‘ 6êXdSˆª¯ýõØ^—ñÍ1ïÄe|ÑQf#) œÑc#wpڌԜ™ÆL*g¼IívüÊ@‚›B¤‰UœŠ\ÖÛý±-s P³“ø‡›1Æg·Þ9ºI¨Å{Õ¡›ü—p‹@Ì‚·ÇC¤ÄnÞ®ËÔY,—eÓ$FgçOõ!½^WËuêKézÇŒ}Ëú¸Y¥æc™^?ÕÇ]×UíšÔ3=ÔOg+„¿bAKÀÊGXœð.îóº’£#`Û×2D‰d ¢†gQ­æ.:ˆ@†HC¹à/mIl¶äB ²5Ú’§B÷õsª­œ@¿Ô'Ñ-*pÈùm‚\“^éϾ8Û²Má±nª¨ñôM“~Ú,dVóïw‰Ù.✖b Ÿ‘ÝÓÚŽÔ–T³þß¾Þ•}Ñ¡êî {>;îJÙEs6ÔªÞUWôN¼ûä%~yÜ´ÕîSÿ¸)h-ÙÚ¯ÔÀ~÷E¥_û»—~•7” l‹–ÚšVøÚó-’sm®qlubVç‘ ÞㄱßÓPVù«`÷“öœiÐÜׂsñÙ‚vSˆUë•‹ýu_o>ïêmUl®‚ãŸ(_kò$B»¶ÿáoù‚é„ß»$Ë€0ZÇûüëïß~ÌUf̦§ ³©±Ün±çåì :…ÔÇ Ó13*uê1²¬{,XÆ]º"8œý»)3ºvCû‹º†¿`¢@Wp(Äö. †i½ˆCY`ÿE]#‰F®$&‘ ΩuËý.£i$JRœ­%ø|l( 4¥!Ôˆæ¸éȉ†šï‹ô™˜òÃ|¿Ê‘mpEdü”Mãî#ÛpyPÉ”˜ö¨¢Éb‘^)xÌR%<›–8’úUÆr‰a‡¼Tg*œŸ« ºó`z7œSw>¥Q†ØìÛ:Vˆ3IØ«¥Jƒ€ëŒV»ß÷e {^¸IÄŠñöº’‘¹©n»pJÌ?ÔÛN©Ä2H¥q‹Pƒ¶HB)-âNŸ¶@ïd Î Ä}o ¼KTlߦþX”¤îÇbùË3½*«ÔCEX°˜ÇjCU kæ WJªù#}lÓG47HùœF{®è.A®“{(·5}æÒœ´ÿªBÙ#ÁÓ±=Ê©¸“û¸S¸˜/X¦¾zj®ÜT`khq啕†Šh(‹4%y|î@I­™D&2ZâHfñô”+˜bCh5‰P‹Ø¢äXè¶øßáÞ¬ÎÉf9ÐBw´|`ÖØË50P(uŠµ©` úº5ÑÏ0‰>5ÑO/o0¢¦Ýç&‘IìÏ„±Ì7N¹è¼†2‹)ÄÒ‰Bð7¹¾bT~˜ýa*Bƒ>TÛjS6=TJ.¤ÞªÉxVàLˆ+åD1îl¬yoïÛ5餉CYo/Àƒ# &‘ée\âHf€„‹)„ÒÝÎd®VWï¶Dt “%t§è@ytÌ uц”•„il¨‰ôÞbC°Â‘‰M!a…ßdC”DMcC:í•g6| <]“œD(>Gjq‹ç8ÈÛj“JãÁù;ÏJsËåêÞâthîÒ‹@L FÆ‘¸g”¹ª¶ùx+_î ¶Ÿ÷ñÞì"/]äEë%òâáϼºzÁ‡¾¹•±ê óŒV9œœW>A ^.PÅ3­ã¹j×ÝŠÖÝÒ‹¦©—UÑ–=ƒ‡ï¨3?dYÈŒ}& R½‘þ¦áT—,+Ò¯^eeª‡0j~<%Ò/_‘~¼Êþ UR€>ƒO)@¼\Põ׉‡ÚèY ÉùyúBú·ÛÈŽ”(J¸˜Ð¶Ø7­¥ ‰&uñ¶¾:­Q£?Õ€»Šx‰½/¥dô¶‡2Z9>¬ª.‰ #¶ âê†+PÙÌТû¦Ä6i³`éP1TДªfñr¨èÌÙ%•¶êˆ^ãmŸ»›Û>"ÄÞ¦W :ÓÊ©³l_¿í*aÎN^“\çsÓþ2òªL}u×S¤ÇeìlŸ¿Ÿr,Èo¤Ÿoâyiò– ™FɇÃûC½Aû¯¯H—쉎æïÖP«Ÿ8Úi¦ÝÃîDÀ!ýz¹.—iÄêWó÷Ç|ó°­e7‡ã¾¹{ã‚Í&­uÈ;ãSÛ_¶9T‘nþôŸÓC:WðýyĦZVdöØ·$ÇêN:…ŽÏPz[Ñ”&i:Át$™ñËEn»„Ý&1)Q·p®C¹Œ3 §cCâ3-eDß‹68¦ð%Âô]¼ŽÒ‡Ü\>¬•Žqå'«`RéÆb£ö›|‹s7‰\$Ì!m$·Ølêe>‰0ÄÝTÙ±éx7¶jrÆÔì6GeûÈ7Þ²µ ôWGÓ3F¦î¼‰Ï¡G¤ø4”¸ljlL漜D*X³sb$õÅÒçG©šz#B3-ĽÇÓ”…tW{¨YuYJºU˜9  Áå½i$ø,f9ÓRßwa˜Ô*%û“þ.M¸˜Y™9ݲVWP¦ÂÇSÌ> endobj 33 0 obj << /D [31 0 R /XYZ 132.768 705.06 null] >> endobj 34 0 obj << /D [31 0 R /XYZ 133.768 648.458 null] >> endobj 35 0 obj << /D [31 0 R /XYZ 133.768 603.253 null] >> endobj 36 0 obj << /D [31 0 R /XYZ 133.768 426.541 null] >> endobj 37 0 obj << /D [31 0 R /XYZ 133.768 325.545 null] >> endobj 30 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F68 28 0 R /F48 10 0 R /F64 23 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 40 0 obj << /Length 3541 /Filter /FlateDecode >> stream xÚ½\[oëÆ~?¿B2oö~yL‹¤H-b IpÀ#Ñ6Q‰R$9'þ÷ýf—²´ôêr¢mŸHÑä~ÜÙ¹|3³4ŸüðõwV ç%3A+ŽÓmtχo>üöAà*Ÿˆ‰’16"j Ζ~þ•OæøãÎTð“ÏñÖåD²àΓŸ>ü+½|†&-gF^¾y|L/–ÏÓ3gíþÅšM›&ѯ~N³œ­úm7o7í|˜þ*? RxËëº-Ì](Äóg'¯g÷T˜¼V Srùäçݲj8ãu$®b|,ñ®/ \1ux×ßÓ=“{ÅsÊNî…`Á lwm™+ÅIÆï% ÁzmÏk•àÌó0±Ú0íÂMZ…Ww¸Ÿ†’þŒ\%“{W‹ÉÍ0·í®$WÃl{Y°»{cøôÛ?v›& ðñ¥Ÿí:hrúùÜÜI>ýýN˜i›®|jÛ>5óy;ˆT=ŠÿÓ.z¼ö<<1X\¿€)ÃÀóå[7³ob•þ´ZÒSÆGkQ& Ãà™×nó2Û­6Ûô§í®[,†»šÿÜ >nmÒŽۡK$]núyº6š\Û´«M´O){Ï4s ymÚ¾Y¶s×tï±$Ç‚¾Ç©RG9Œð nôL¶8é‘am¢÷ÔòhIÞ«6ìHEÍ8£ÚJ2eÔÄrÁ¬Ö·©™aJË8”ÖäÚß^šE·{- ;«¯ƒìÉñ‰¹Y,V³‚ŽKÏÌÁWcµ ÎÖÂFÍY¹a¢L SãíY8WùÛwýiÉap¦xl!dÐBr‡à%<˜Ô¢¼ï¥ˆ`a°{F¶Âi<¦'ÆfýM®O@ÉÔ›†Ò¸3‚bvMɸfŽË°ˆi›œLQ¬Ž"{?,P™D Œ-KÑÒ\ÒRnáñU))˜tòÊ)Y&Œ<Š#äé¿)MB‚dñ “p’Iá«LÂ!rw•:ižV€ÕЬëúê0kú¤ ‘'Bf›v`;’Ìt/ CÍ.L„¡ÇÍj™ÎÊÚ#A{.ié@{ òÔêÆØÀ£K¥¡ †º${xµ—m×?•4G3~žËj½¿âï¯ó÷?¡8J$º ,¢³AÐ/‹mk` ^Vµ°8ÄÓ 6êÓ{TO|¶ ¨GÔ†º¬"#sŽjI«™ðáF²U` >ú’s(‚B̃ Y’¿)’šrˆCYö™ÃïåtTó·@J8 F»¥¹çª¸´i—+b¸‰æÎÉS;7ýî@óé¦Ýs³K¾l£w¡k«teÓî^6Ã`E?CN$\ȯ´ñÌ×’¶œÒ_#$$‹X¡r÷ùÆj”<ÌÎË>4@é/øP¥Áàø@ò<ˆÈM>“ò:e>[x—ÇI7ýÇjצɤMgÃ¥}$S FÉË)(õçç¬<¦‚|³Âœ•787WÍ9°ckÏt?«M»hH·ÙDµeãŠÁ¿ŸÉv–È<‰ÓW5T[’W,£†Â:[Ea5Öéð%Ëx¯‘s§óÜþ Aëµ™×#³O0#jukd–”(`(‡¡ÎÔô„Œ%å  .žXRz¢¨‡(eü¡:}'üôéeI¢¾×ÜOû¶oé4ĨN—(Ù còóãÕ¢¬©zq>@>Á‹³V`ôÁ]!i-hMª,¯†ü¤–«Òpuö8ê:o¦ß$Ù%gCgEg«#\ØÈùêòà}•ê†"ÚtÚéÀ5A² h ê~ŽYÎ-$õUL LIk§|z‚<#gt.K¿µäÉ"$?¶ºúšŽM: ‹,Ey‘…¤$Ò^àNH”kL™3ëýk›Œª ¨Fš¬-îbµÚ\S$òá7¹$ùIs­é/1< LÖ0 öjð¿­W‹×~µìŠ%EDuî«€KEüvþ…ž¢ c¥ôA›IªTJÕ¤cuŽW_Ó1µfqÒ·Û·zR|ø8c>Ê·³µû÷”nKŃìWæã‘ >’½„2ÒËÓßpú1ªÉÑlNÌè^ƒ:ÓÊÇáÅQ7„˜Ü¾R.xmºTðÒpõÔÓD¬¾µàN—Ú£j`9Ô¤jº¾À°$ìU©:Ø9aŸðvŽÿ¦±@òb»Jg©Tr¡ØÖ:—øäh2}r¯°× ³Ô’*˜úz kgÀmlçc¹+Ã.ç`G¸«JNC\³¬£üÿ\yLYr¢~y,@Ÿí¢u³i–…WUÔ“vevª¼M:I'Ckg£¢Uº¸§ïè©ŒaðbƒDƒöOÀvnn0P´º÷tÙ¬KQW0CÁ¤(È™9Ë@7ÔD*òbnE T2enrÐ2Óš3cCP­ 5Ÿ£ÂâËDÎ(3jôRÙO3-F]“m·ìнXÆ|ë¨Çj¨ÊA©ZÚÌc1ˆ~týúe·?ÝJ‡JëjÓ=u}³H¿þ‰À÷c÷i}µY6»¯è‡?<°i·/‹]i_Áç´‹Á»ñ†\éWém«Ýµze'åôûÇñÒï¸5‰NZåu;CxÿŠˆÖ¾ˆ¿Q o7é|Ù¼¦“ÏÔßm’QºÁý_uÝnhv‰. -kû-…âøsÙôÝú%•ÞÒ•ýñl$°´”ˆ#Çt.Š;*å3#‡ôÿ¯ÏMÿÔnÓ³Û®Ÿ ÃÀÄïiÉ9§'¨sFåçPÏãÑv‹7ÛΞÛùË¢-ç5†Ód–ÂÞšØPG‘†âÂî›&‹®Ä0´GâªÀÁ¤ô9,)4gQ¢¡*îË$³Z'- "ñF9Ž‰Æž“ÆëCÑnW94Ãöž–¹¶’ ä^&¯­aë|Ì5¼|P¦ ,¼|z cmçÅ’R©Cn¡Iòÿ‡IÊ<ÅåfKÃêq`ÇŸ‹›ñ .çÎoÖB™ Ædn·nñDšJjŒ¡„Ú«ñç9GVŽÈU“¦˜b†YÎË9Üž­J½.²‘‚+—4eŒÉ)X­CcŒ³”_ÁƽqŠŽ9SgFÇjÜÅ¥£mžœí혴Åâʽçú¨w°ßÒ3¨}<žØ$ßBËëëŠDe IxñEûC•ˆ%›ãúÀx¡àwÕ…=ˆàèÜÉ S‘ÚDz›M¥hÐÆ2!B H˜à>‡,Ú3R Œìj`"ýT䎎1Éœ©|Ò|Eí^3ý4g' )TA;°•aŸÑ™ÊÐ5¥ŠA»I³â xÖŸcgÿŽt ö±ëçݬ٭6÷¤;΀Þøô,rjHÑÀ ÌÐ\à ÿ_3ìUÜ—k!¥KûrSRÅ "%”7•¢4Sb(FZ“Ù÷Ø*8³U io"îÈ Ë-1Kõv_i¼·.%~Yç°YSg¦þMët±úÜnJ½pÏ|Ð5`x¿÷*‡ý´z)Gt?«¸´åY^ø¼„¶uè`ª¼¾7p>ú •¤ðí\;ˆáÛÊ+”RCºp7U@i›¢ W(%UI”¬b T%KÉA_Öë’RjG,ÓUu*~ t•R‚:À-y‘S¼Æñ¥ho£}Ïhç ¤ŒuQü¶MÞV3¯]JˆsnÕ‹Hk`z`!ÎcU˜’-T LJ4—fQƒh/ÑØ’ʶdÓ—>…PÏ„*šô0Ç<åÈ-íÑvUP€Ìl†z³v-ÉøÖÞ^Sõ>\aÚ‚*&  Tw… góx´¦Sq'ãEÐHK…–U0iï°ºlÔk×¢ÊrÏs86Œ" UÅMêJx¿ï{B;—˜•£ÍoD¼oSå¢øå']úòL6n)£oýðÓ¸4”0gY¸%&çW¦NE™ ´ÌÃuH‹PÔPʯsÐ2‡Õ”äT…ÕBæ 'Ü· ž +kÀ*ÐSaD{Öë›ý·¢MԨ÷댼B)ÁÔðò¢ ¨'J|…NjpäL5058Œâî ¤¶¦ U v(orÐS4\‡¸S§,ìOIuNÞK„«}¾µ6§á±Œ²èžžw‹×}so(Å„£¡ –üPü… UÚ‘·š ÷´›Ø ˆýÁ¶é»þi{hÿQz a¥±'w£*m–ÃÞ'Á$<ç|úc7kûm©=Ä1?‰´ÆeæôþsáåqÁ;Õ¿m³Ý׿ > endobj 41 0 obj << /D [39 0 R /XYZ 132.768 705.06 null] >> endobj 42 0 obj << /D [39 0 R /XYZ 133.768 358.919 null] >> endobj 43 0 obj << /D [39 0 R /XYZ 133.768 245.968 null] >> endobj 44 0 obj << /D [39 0 R /XYZ 133.768 182.341 null] >> endobj 38 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F68 28 0 R /F56 15 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 47 0 obj << /Length 1789 /Filter /FlateDecode >> stream xÚ¥XKs£F¾ï¯ÐªVc†7¹a[$XRIx7[IHB fÙÚüútO’Ùä‹5ÓÓÓÓýõ“ÃĘ<0Ôï}úáîÉö' \Ó¤û ·,æ¹þÄu5-_«ó¦­‹m[ˆê#Pl®Õ¶ìvEu †wY¼m†Ì¸´ö˜+1ÅáØ6´nývM®DnÅIç†öMwM‘ÞÄ®Ø_†ö–×:÷µÜù-ýì™rÎGé|ê6eÑ‘×äÚ®@¥7ºih]›+bƒ,Û¼jzBVíPÔÝ“ q™ $øŽX¨™ÌãAÏ jÆm­ÉË’V`M‘£­ÜÒÄžh,Öbß~Ec³úZbté”×#Ñ`݈ª‘6O¹0Ûõ†¦Ë[Ž¡}=Š7ZÑc°¸~Œ(EC¿û®®¯|§n(;õÛˆjÑm~Ï·íë,/ÊRè¦A ÃH[Qí €æ©3·Y`ÛCS¼Ï°|#tîháI2Ï¡ †¸*Ñ‚ßèXb…Äöˆ¦àJ¢Õ42æåÂ>?fè$o‰Â7ßõ;%—Øxï<‚{Dwén¦i³ª-²’'QK³i'ýþ=W°÷ȸ ™Y¤O-îjëÅSúYçÀáJ‘â5þzÚr¥C:,tú)~ŒéôWÓ´Ãuω;ð eYÚç8-^S:éE®Âyú…H‹'ú ç_¾oõOñü#Â2´èçå*Z¯qõŊˆñË2‰#báZ<H^ãù3Þ£Ù¨næ Ô>%Æ$~‰S´ORLïHØ+<Kz´"Ž¤Ñ²#Ð^¢Õà ôÀÒÂû8‰ÁPnXF,õ§s©>ò>¡þ¸ég©C(„+Ýmâ‡×$TÇË×Õr±ŽÆtç¨~€†ÍãùÓ ¬Ž^"xÞ³5'~pô´>á¹$­ga’•LZ¨;À5[¬ÖD ÇÃb ¦p®ƒ?ÏÐË ûl‘"b‡÷ID4²ˆètIyHÂøå#ÑCáKˆ?Ï‘Óß ÷Í¢‘“xT™àQûϳˆ®!ñ}xŸöò­‡4^¨=:“Lž§+uˆˆ*Y*ä'ÔctQ@ü¯£a·Pi®âµ O 2þ‰òIZî§\º ¨€bPg܃NóHéŠ{L0â ìÒmö’”œÈéɯkµ†8œqû… h¼¦„Ï1.ײïÞ¹h¡Y>6欥ÎæÚWÍ6™áZ}k+šr¤ûñ€9.ïy¶]]çU[~#¹uþgWÔT@od{ó·¿÷ü²“í070{ôøöë±ØI<Ö|z¦Ì³‹82tÕ†eWN´çù+-’¼ià”J›ë3‚`Ês^嵬âЋ—rH uBÓn íWÃ1’çe¿œÑy*[®Þò¬RK ¬¼±»œheQý5Pv[løÝѲ¢jÆ\`z»@ðxÌø…G‰-ñîAi·pæs>´ûJ Ch]ßÃwÔ£`4r1,Û5ñ]ˆ^]Ó& œYÐ4 ¤@ ¥Éï½¾pÏ4™ “Ë¥ÿcÖ6¢«·9e.tÌ÷`8> øÅ£ñhŸã1«Hö¦—»iÁH =Ps˜V1Vð$kˆ–ѶÍê&Ͼ–CP¨“é G3Gã“hŠVÔrL… °aºí‘@÷l4‡ÊOƒwã/y òøâ-xîüMt “Él«¦ÏÜóÓƒ “_¦(ñPŠJ=Ó„Ýi—µùõàY’o|ªóu68Xb ³î³±-ÞòQ´†s|ìÇÀ«üv´ß^SNF𵀆*‰ ˜`€a‘gÜ®ÞÀ%Ð Fñ&j¶ýã’!ãûÐœŽÉLu¬»6òäæ¿í=u¥šÌû«g³K” pÞ³ê@ýê™.Ÿû—Àš:6ä°;¼mŽ†5$ˆ¤‘zh@á?'1|kí‹CWç£ÚO,fAÑ€1j¨Êú»¬kÅ!¯Xss´6™ØWWÂ}+ë¥kâ‡Ö^À·–üÔs¹Ân>ãð¬ió“tĨÙU§Nðÿt ￯u¦5ÿbãƒx{“i.?Ö‰¯( ¼Ûm§ª:¡òè¦Á7r¡¾¡ßÏ2UÞàvÀ,àð¡wqÕ»œO”~ø­¨g— endstream endobj 46 0 obj << /Type /Page /Contents 47 0 R /Resources 45 0 R /MediaBox [0 0 612 792] /Parent 11 0 R >> endobj 48 0 obj << /D [46 0 R /XYZ 132.768 705.06 null] >> endobj 49 0 obj << /D [46 0 R /XYZ 133.768 460.05 null] >> endobj 50 0 obj << /D [46 0 R /XYZ 133.768 381.37 null] >> endobj 51 0 obj << /D [46 0 R /XYZ 133.768 364.387 null] >> endobj 52 0 obj << /D [46 0 R /XYZ 133.768 245.534 null] >> endobj 45 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F59 24 0 R /F64 23 0 R /F56 15 0 R /F73 25 0 R >> /ProcSet [ /PDF /Text ] >> endobj 55 0 obj << /Length 1626 /Filter /FlateDecode >> stream xÚÕXËŽÛ6Ýç+¼”ˆÃ·Äî’  R´hŠ"éB–é±YrõÈŒÿ¾—É’M{f€A7¶H‘¼çžû¤ðâ~^aÿÿvõêî½ B‚.VÛa %2]H‘ ÊÄbµY|Šbˆ.c‚1ŽÞÕû}]-c*pTTm—•eÖÓ™¦ÏÍD»ü{õË(êî=O )I¥C|“0/d¶añ) î÷u—•ys÷^òÉ œ",),µ›?üö‡[3“S…$V F B”[ú¶/ÊMQÝÎd 3aÙE[ÎĘòaM£ÿé‹F·¡Ã8⧅a€€K*2¬y 2æeoºaךít¶ÑMëf?cLKÝ¢eÌ°ˆþZ‚£ºoÜËMV(ÖKŠ£ÞÛf÷ÙÑ=Tug°-X v8‡¦^}+6–cu;ÝÚÇÔCpÓ¬nÁFo—€$ëËνȪ{8Ö½[â`ÀL¥õÆMuµ›ñþäwºw‡,ÿšÝ{(9¼…M—dã¹÷ûC¼ÑßtÈ€ƒ‘GÎkІºm½×ÝÎ’n‡Å¾(³f)D  øMÙé¦W_R Ç0¤ËãR °Ú%ÂÁKyÂø)Ji:¬É³Ê‰^kÿoÍW"ÍpÛÔûjßäúµ3!% ²>Ñ>3;¿œ(±.µ‹M{‚…‘0€Á%–…R)»®;ütw–à@G¨nîïè !5ÆßYìÆ“3bœ¦Ü-¢ÁWWÆ•îûF‡˜4‰‚Í#øj`’tÔ·Ö5Amp_÷¾Um²&ä> ŒöüÞ¬ïê¼®¶°M&‘y*Nèf2‡$” ûÚ¼) IÕ2…ˆt’›~HÝk÷ð¥o;ïxÐ3ZNs(Å0J)ü'>i¢»[ðbNPÊÙ|K}0)éhrGm벬³<˜p43kû&µ1áfò‰ì„;ĤžÒèÍ° ¼Fw~IYÍ9õv¶É/ÎlV?ܵ7Vmó¾M0²éÅYùÔý_!Õ§lÅTŽã.Ïeî­öD90*dÛ¼o½·9άÛ3ÿÛ×Ê'5td2œÔžãöê”i\¡ÉÜÊ45ñò{(xjLA‡Âý¥  À)´À…O|~ꜸªW@%Ÿ>œ#ÉÇ÷}•;äEwtg­S!ï›FW]é§A£/cÊô*Ì;’ôŽd–:­HÆ[U­v!*¤„R<Öþ8~(º]|tBÁ#qŽl'Ïçqæó8u8íŒ)sf¦=è¼ØÝäîÈwÁ½ %OÒÓ4F㬈ÃÚ&kŒF\f‘Û iPÎÔq3kñ¿/¾,#¾Ä5­S ÞƇpI2RÑÛNïÃ>ÄOf†ÃˆÇ2È×Fà£-²ÎkanZa8Å䪆ÆôLõ+8bdD¹6=`$•ˆœ‚É€4F"¾KÀÆÍíxN¼¸"œÊ´¹þ¼!Hæñ‹¡ÏDZ7¥ÖMíÙÞ».O‡=ôI¢\žšZ§Á¾n]$ð‹m_ºù`¯@çjÌ1·*5î` ÿÄ$®0¶ó¼hÚ+’F÷¶Ÿ„1ô_tÞU;óÒù@µÚ˜uÝãE ¤N~N`zÓÐA(Mäór" ÷?Ða©)ŒBŸmº4h»RâøÐèmñxëšD‰Õ)& š¸}/.]pŽ©Î¾Íg½Ô ’Iϯ6W¬ ¿+r(j–Moýã_m¥'v5Á˜5ù®èÀŸÀOã¢Ú胆ŸÊû”¿»¸h»I…Ò’2ODzA„~ÔùÿïÃ…ºR(_BÁŸ¶öù–è`ÊôqÌd 7~•<˜ âwd¨ó-¸«}æÉ×¾@:eШÛÉšN›-Ã줽p5-PyÔÔd× $CŠ±É½4š0J±zV£ÏÌLpƒ‘DýÛ1ü½ÛSëåusK(‚Xü¡ŸH¤°¼EÍŽþïÁÏ÷a'” b럛¢y)5¿Öù„–Ö`¿Î¡ÏHæ±àx¼ÊE‚Œ…ýÁ†m;í1 sE8ûŽ! tá|^¹Ù•ïûCQ>ë./ gÒšb_Ùg_õ-¦âÐ&DòqüŒ&\g:\mCûR|ÉŸ½4_én}ÞÅÔ¥h>UêO³?¯^ý [zµÃ endstream endobj 54 0 obj << /Type /Page /Contents 55 0 R /Resources 53 0 R /MediaBox [0 0 612 792] /Parent 63 0 R >> endobj 56 0 obj << /D [54 0 R /XYZ 132.768 705.06 null] >> endobj 57 0 obj << /D [54 0 R /XYZ 133.768 667.198 null] >> endobj 58 0 obj << /D [54 0 R /XYZ 133.768 653.466 null] >> endobj 59 0 obj << /D [54 0 R /XYZ 133.768 582.324 null] >> endobj 61 0 obj << /D [54 0 R /XYZ 133.768 192.227 null] >> endobj 62 0 obj << /D [54 0 R /XYZ 133.768 154.178 null] >> endobj 53 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R /F73 25 0 R /F79 60 0 R >> /ProcSet [ /PDF /Text ] >> endobj 66 0 obj << /Length 1937 /Filter /FlateDecode >> stream xÚÍYYoÛF~÷¯ Ð)°6{s‰R -Z yI–VŠtxØq~}gv—”(3²])@ -‡³³s|;M£uD£ß/høýåúâõoJGL!5®W‚ÄÚDZÅ„ ]/£÷FätÆ(¥“?ŠÆ®m5qE'W¶ñ‹¿²›*­¦¯ÿôòI”ròh4ã’p•ô’ëeeM–æÙ×´ÉÊÂo–&JH¢¹{™! ŒÛú&Ïá4‘L¶i‘ݶ¹ÛU{R¹ò¿¨7ejâUBm›À’K¿¨ìpëbÑæû¬Ùd…_7ë‹2ÈüÒ ÏJƒÊZî©,¨c9¨îtÎê™.~½¾ø|Á€J#I¥‰ I¤Áí2ÑÑb{ñþ#–ðòψ‘˜èÞ±n#N“À*®.þöá'UB8ð£(¢Ü¡‹æˈ3™":ab9¢™ŒpÎÀÏ.bÁÑÔd²Î¦\MîÐt;jª$4IŽZÊ Dð )'J²S,e&&L*' ´>j©!‹ådUVþý¶ÄcïÀþ…‹ÐË›ì¢ ÌU¹ ÔÂŽ`SA àûØ„ £ˆT 9Cœ‚54‘ÜI’â)¬IÞc Ãæ\R”‚jÄ)cÇ/„‹~O·CŠr¹x–Ùa&Œ„duÈ,<¬‡8ØÚ1 d €K\i„ž³Ú“öAä¢ôäû)ƒ‹ˆxqX§+Û1îß!poÒbž1D¨ã×QP(­ õÌzªØŒšwp(À¡Ïr(×Dò‡:÷Œx•BeŸÎ\Ë„î[Uö)Oj‰-~"± BéYŒ’B‘$QÏð¤TÂ'Ïr¨R>1<]3æHJþ¸ÛⲨk' ¿†´†9“ð‹ïúâξÑw2C?îC9Pà A‰9©㆒X 'I?•“LÜç¤zS¶y0 o*Z°åIÐ4X¿Æ,<–zq}<õJLn:>ƒ™®ƒôøR3³¦¶ùÊÛ±« Ð„Þ™î°ÑOdÝï¡&Œð÷ `ebÙ?Gmf Z¯Wáiî€ó* ìDZêwWfK¿©Ûƒzà–¡DXõ2§ºY¯$P±íxíÞMnmýôX÷²£ø³…hI¤€òÃN+;Š t\R@Y(‡wi>è½YÙÛÊÖ¡ý¾Cá">CuhÁ—avôäÊ ¢iîwõLþeöºÆßûÁS»'ðÔ·v‘ùý{‡Ô—s ‚t8pdÅJ9LÞS­°ýŠM ¯í¶7{Sl„ɵ!lÞÿu/VaŠ;Þ<ºéúZJ=m¢åŒ0¨þ,ƒj{p¦ˆ‰„qð‡JJ¤ÔÃC!˜c“»&±Pg9T%0ýËá¡î‹ÅãS #àrŽS ôa‚OõÀÁ Ìdš÷ µC]Õº113:k(é&ª£C³Áïbg‹H ±„Ér .¿ $¢ºÂ7E°b|–šÐåÁPv€¾¸·ÌÖÐ×z0ùÊ~òºû°’°MÐH2çç¬n|5€ghí+K¢u>憱Ó;+nìþ@¦˜ÔMé¾'£ü´Ùy²ûNþM„0"vŸ•°ã£qÈ* 9·)æ)\bÞõ…4-É9Í/Ý÷(T¥®Û-èå?DApÑÆA–t_Q÷Êko¬Q|U7~ †)!‘r¸ùÝ”1ÖuÑ°¡ŸªÇ+wy›u¢ý?ˆT?‘þ‹ù‹JØæº#ÏýÉÚÛ1î»g̉½ÈnPô"›ô“=.rÏËÊaàâX¨bLãÁH'ÿöC-{ endstream endobj 65 0 obj << /Type /Page /Contents 66 0 R /Resources 64 0 R /MediaBox [0 0 612 792] /Parent 63 0 R >> endobj 67 0 obj << /D [65 0 R /XYZ 132.768 705.06 null] >> endobj 68 0 obj << /D [65 0 R /XYZ 133.768 667.198 null] >> endobj 69 0 obj << /D [65 0 R /XYZ 133.768 643.969 null] >> endobj 70 0 obj << /D [65 0 R /XYZ 133.768 470.089 null] >> endobj 64 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R /F81 71 0 R >> /ProcSet [ /PDF /Text ] >> endobj 74 0 obj << /Length 1670 /Filter /FlateDecode >> stream xÚµYËnÛFÝû+tcÑdÞ´(ÐM.Õ. J¢%"2©Š”Sçë{†CÉ¢<–ek²â¼¼g÷Üi¶ÈhöÇí¯¿¯Þ6sÄi®³ñmƤ%†ñL+C¸PÙxž}º/‹¦®nF\ÑëY^…Á´ײjÖŬ-æávÛ”Õ" Ûe/r[¯Võ W×_÷ïn·Õ¬-ëª!7ŸÇ»¾ÿ åÁ¼¸&Ö¹lÄqÌ„iýPV³ÕvÍ?—Íêý}¾"Ë_¼B(1+„ñv2kÿ ²?ú;ÈNEëŸþCLüÃ/E±2½HÿFb? T÷Û³ªýš¾éÔVÛ»ISž¡ù•zçEu¡Þy½®ŠˆæK”6å·bÒ•V“|Út1[n«/Íúßuº%#VŠáøñãLFñ~>eÕ>]aŠé¨øtÞ…á}]Îû÷ »ijPKòÞ†íÞ,;óÿ}|õïæҌeL+B)Ë3´ÙìîêÓgšÍñûN„³Ù×Nô.ãÄY‡Ñ*ûûê¯Àço˜† ×i2ªÇôë{Ši%áÆ%Á´ðÚA«¤„:ÒiB­Bâ´Ÿ‚rƉ0"(gŠÍÖ¹½‹€ F´Jr \H‚Ì`iöÈ› AŒ•ÐÖ‰mŠv»©¸_Éz׌&<-6a\ß%–(±–°G%órQ¶1,.‰’n'¶Ó4<%F˜Û‹xÖÄô"¸Ø MÚ¢ŸqUó.ÆøÙ×RÜz.±#j¶õÆ/Θ~•F{[¨WÛ¶|ïCQ¾Úö/1ÙCiã÷¤ØäP³YŒ±D»›è}d) !”íHD‡†)îw6ê „€´'0…S~‰åé%@Kªˆ¥â„/ÊÁ˜$ šÃè!(\qû©p„)@aJÊ!hÔgˆ<¨¤”XΆ Qo Á]Æ’`r ꆘÏ{IØ£Áv,iôHí†4šŽrGzŒÅuÞF YY,eoÉÏÏ€aùN !“[zýuYΖAwÙ¼¼iÀÀy¸×»—Ëü†Sð ™h?­iQTa´Þ92ÌY²PHOú¯—½ð ðsJ‰#XH—Õv«·³ÒG¹W‘7ˆîÌQø©E…|‹r$¾ý£n?ÂÐO¹“òÛ9c/¼iZàpÜ}¬½ÛñÏÛetó˜1D:uÚpvðLZŽ¿Œ‚‚Є¬ÆtI7wI0¥#9Ï4î´&Œš$ ÚuùÅ4ÊHaÉ‘>¤E¸ôùÅ´)#d`žsì‘ O •Š“f!™#^8ÁÄ%çD3u†]Ha‰£2 ¨ `/Û…T> IBì:afˆ‰ª*‚鉩’@Zœ¶´IÌb$Pœ3y”õÄ+ …¡°VCáûÍE)¶B¶.aj`•'K H¡’€dë\A£öÁÀ;ÍDP‡lå×tþR~÷6säÚ/ðòisñn^< .4Ì’€"?…À3Â$.1Þÿ'@ô* !㥞–ÈuP_Fû1Xg´Ôëêè4ÚÕÑ|zªÖC­²3¶¼šÇ2 ÝÕø' ÐœÑ$ä ®“g¤ð4·IÈ+ B¹ágx ái®“°@8åê “”ðî^"¦d‚8nÎ0I‰„³$<ÞʨzIîóZß7Õ†à]y¾êjõ0l+çëõªÜ5•»"WTåe]ù¿Û×ñ¡‰œ1uß oøk#ÎKŸÎ¸™Aj…ÊU" æü²€‚üAc¡^åf@„ã貜ƒ-ìÉ]=ïJ‘7öÚÏjµã ,X_ÐkMÕEy_Äšª»†lS´ƒFv›)^Ù„=èïû¬GíºŽOìÕ¶Ê7½%®7õºØ´e×ò¹é?›þªÝ)ÔQCM!é UÒ3Iu×û@fx™³W*U§lLíöyËyÿ_F¾Y+Aæ þÀwä›Euɇ'úÊfò­ØÔ©uÖU‘ZeU,¾‡Öº‚âï u]7oÒªŸ×úV•§75µJnÄe+TíA5"yüàê]Êð±:‡Hìùäá…/ùÞÖ4Øxjj$ ¼O,ì@Gõ?êS( endstream endobj 73 0 obj << /Type /Page /Contents 74 0 R /Resources 72 0 R /MediaBox [0 0 612 792] /Parent 63 0 R >> endobj 75 0 obj << /D [73 0 R /XYZ 132.768 705.06 null] >> endobj 72 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F81 71 0 R >> /ProcSet [ /PDF /Text ] >> endobj 78 0 obj << /Length 790 /Filter /FlateDecode >> stream xÚåW[oÚ0~çWXÚ ™×vâ›6MÚ¤uR*Mã­«P .µjšÚþûÄAJB©ªí)¾œûù¾™ "èg‡´ßï½ÎÉ©ˆ‘ÆZ0zWˆJŽ¥Hp‰YÄQ/E]›UAÈïÚÒõg‰ë;ó‡pÒï×ûc&K·~óqF?—½3S¬â…”bÍ[ƒ[4X§Ÿípú“xFÕ;‹gßúˆãÄcnßW}²·ÂÏÉi¬Ð …eÌPÈÀUÞØi@y7/‚qR‡jêýÈ^‰±ÀŒH ŽO«tµLçG¯sÛ¡pJE âdD!Î$Ö Ç‹K‚R¸;CGZ¡»FrŒÖJÃÊ¡ß_k¨ÈhŒ©–%ɨ÷Ygù4/ ¤ÕtWéS¹3þ›¤©­lž%Î=ø“ë$`¤;«óleªëvq•;—PÅ;›üÑÀfIÑjNŠ|bŠê!¼‹›äÉÊHYI"ä1fR.WüƒÍ†nš߯/PÇÈ _mN¶€Ç–ýÔÎliÎôïIß²5˜.J-6b†J 2àE0•ñ! ¡Ša©Š9œI¾4 G”Í&´XDÝÄ•¹_ Œÿóñ$)LZïânÕÞÎåÓLKXzXÁbVõÑ4Ö°ÄA²z Ú !q´Ò¤Â”SWµmÑ=ÍR"„eM\ r[ Ÿ'ç;As‡×Cæp<é—v@~ò —×ÅhîŸÅXi½eo[§d­©šÔ%nK=lžþ —X—ZùµðÕf|3~#®™H33u~#ã3æ)Æô †Þn㈊#ÆèºoíÈÎ̺ÖΡ ÊGTÉÍZáÙãs/'™ßÉ•Ëóâøn†Æº½¼ˆ—x© ˜:/q³‘Žr;ž¯ÄG x#DÄ™RXA”ñ1Æ„òÆ”˜óåUùöõÎGñ/ñ‘•û¹aæ~r|/c›íàdë³ïYÍmϬ£Lî÷Œ’¿a”ðhy£(FÓÒ8S0Î$Lú(ÂJFÞ¨^R€™û8u¨j endstream endobj 77 0 obj << /Type /Page /Contents 78 0 R /Resources 76 0 R /MediaBox [0 0 612 792] /Parent 63 0 R >> endobj 79 0 obj << /D [77 0 R /XYZ 132.768 705.06 null] >> endobj 76 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 82 0 obj << /Length 1032 /Filter /FlateDecode >> stream xÚÕWÛŽÛ6}÷Wè‹í®¹âE‰^€hÚ"~KC+ie!²¤êb{ÿ¾C‘ÒÚZmleÓ"û$r4œ9Îœ!#½9öûëzvûFp¤°T õ="ž‹!H¸¦ÌEë}˜o6I•nâd-V.uçz¶÷S3YÚÙÆÃM“üí¸ŽÑ¯ýO£ú{r³ø¸þq‚%ghEV®õÔdUgQhTÓ<‹ÍhOÁ.ù¡]·[xĪ¹{¾ +¿Ê/¤ø_¹kÒWH@ù­gd˜ì_vÐWòö —'…¾{œ¢cÄ3ÆþÈ+ê:ó$«£qçqTÁ~Öü´‰ª#8Dæ EŸÔIžùiú`$[AõXnuê­ÜçiškK‡D‡Q‹ò"*}m ÂdÏLÝw@OT`©”- èï’,H›ÐîÿGÀ-oncæ|É©ÐèX\q,àŒÊÅôÌÃWPDqðJPFÇú¿zcFŸ´<ÞLψåä2]·Åøü¾É]> endobj 83 0 obj << /D [81 0 R /XYZ 132.768 705.06 null] >> endobj 84 0 obj << /D [81 0 R /XYZ 133.768 191.557 null] >> endobj 80 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 87 0 obj << /Length 2272 /Filter /FlateDecode >> stream xÚ­Z]oë¸}ϯÐgóòS$Ñ¢@[ô.¶À-š·í"Pl%jË^ÉNöÞ_ß3$åH¶â8ˆ^bJ¢f†gfÎ ©ðì1ãÙW<ýþõöêË×\gžù\æÙíC&…eÚè,7–Ie²ÛeöËl½ý~·»žifßÿËøãõ¯·ÿÈæZ0§U6‚y“¦ÞÝUíêî±z.ã|ºz.Vñâ‡tu÷ÐlÖwë-„qº·Øýžf`t¤ _lê6ÙÑ3©¾‰¿ãO—ƒ¿|Õ®·Òyî˜Õ2›Khâ6j¸}‚Ý2‡ÐýºlŠÝ¦‰—E½ŒƒeYoÖUÝ=ѳÍCšðNµ©iÁtõ| ŠÕ> ]uܧåµ0³ßwM±Ø•Ë(¯h£­C¯8oHø,XùãÏÿYpL©nÊAs}¥ðÔð|ˆç¾­êG¨5|¶ Çàa³Zmèå—ó‡}½ UµŒd‚§û=²µs\€ÕEE¨êÅj¿L1ñ'¸ü …"€=ý9ȇ–Uõn?wåî>é‚&†ÙÿÊr;fÏ7'aЋÛKTÁͨúòÕäýˆ;@“_õÛÔךÃ_‚ÏʦÌ ôæZ¸ÙfåXß“c5㯞†=Á-¿½úíJà.ÏD&%æøÌHËŒòÙb}õ˯<[âÖÏ”wÙK˜¹Î$óÎc´ÊþsõïHe"¸uA”‚¨f#åSè:–»^>i™‡U¸Õ…U¼,š4uS¯¾ÅÑ®\o7MÑTÝâZòÚÕª¸_¥7v›ø[mw§Ó‹ÜªÛj` J›ÒAÐÇĦÂpÆÍ´Ï™çúƒ Ô £×ye!ê ¨S¸Cæc¥§Æ ΤgãAxˬqSØ.9oÚ¡í”#¶–ûƒaì,ÄCH€õ¾Å0©V«8ºOÔ”ë Mx¦?q³ªhªNÔÙ½³"ß_ÄOsÍ™“vÈûo\òA]Vçð~¬ut¬wé­TæÞª¼ù;”ÙÓý.—]dÉõáâDÀu ¹2#Ó>‘€`š©ë¹àœÏ~ªwå#x.úlÚÜ·›UÙ.Ê`¢ #> ”Ÿ ŠëÙ|cž«Í¾¥;*ELàÐ6ÎAq>MÄ-ªáQºœÜŠ\K‡¨‹ö“ü—’H‹FM {Z¬"–Œ©’™!bi¶lBw§àꈿX¤I±" !‡ü@ÒF@³Üæç ×Ì¢h(t=]ÏgÈ+—H Q–yÊ;äå_ÉëÛ¶ $ @UnÆÑS‘nÕ±PÄ‹û² ¹/gí~ àËeä<ù6…E”Û³X(Çx|(ÂÝ?„âb.T Gº=äˆõÜ´ò°}wj-™@Ù¾ÔªïÎÔ\RCcŽšËÈìJÊÀìJªSf§‡¡ ‡QÌ Ž2Ežf &…ü¢÷÷»}“î¥2€>lš„èîuÏ«x Ót¿L©=žG+;ÊxøãM_ ®’½ŽôéX¿©¥·ÞòžrLæç˼tPⱦ…øÔ¶Í Úœ“$)ä9çq Äý:±Ýcƹ¡Ò°iƼçw‡rQ<€b^QƒUAç{øžözs­Mbíx+ÍOõ=ú“ƒÀ¸ú“Šþ\i”³¶Ý ÖÄïEww¬š€¥yÇY èršfeá3ÎR¨0䈒æ<· 4=Ò‹knG°¼"=(FÖf!B£¦€‚QÌ'X›BŠ9¬i°¶±•Ñ‘gf‘°Ôì“Ÿ}œ¦­Y»+‹´ÖØ?nWÕ¢¢Î%‚$òò'çÉéìö[Ü!‰w/´ç8Å)ÏYž«³8IAE!“V2Ã?—¯p¬ÅöD)./ƒ©K Â)äýùÎU¨(SØOh 3´ÿÒòˆ5vÂ'<†Òr¾È+Iû;Å*”hRòÑUœfˆ¶f¥È@(mË1¥ÙšIâ m8³Z •>®·ãíØëiÃx¬! ô;t©%[ê)lרü Ì ¼Dûf#'ŒöÍF6æ%vÈM¢ÍuîÍ) øQ#óòTÖñÐ,2^<„+ f«ÄYª GÊdLŽ"¯óO)cûG¢Gos<‰~­‹‡¿¿í«¦\O¿½X:ÿ~•ß!`sgUs‡>úéd Shd§ ’ÌÑ—“ã/ Žy¯'щñN+­âÑswÀzrFl%èzŽ²ã°ü .Ôñ ¢Ó]ã.h@}¥¡'!áaµÍ'@ˆ$Q‚¼Ð:B¥(?„OsíåìfZ”Ð~rìð&@É":|~ JèìPê+-ÒÔCíÈJ­ íÈPiu™g€·î#ž1¾ÔSx’¸0—xfgúJÏ{f¥gúJÓD×âÌÔFNáH’F]â– tvné+-îÛKxåxo€¾#§ï¿Y÷ýwø&Vñtà ½ endstream endobj 86 0 obj << /Type /Page /Contents 87 0 R /Resources 85 0 R /MediaBox [0 0 612 792] /Parent 63 0 R >> endobj 88 0 obj << /D [86 0 R /XYZ 132.768 705.06 null] >> endobj 89 0 obj << /D [86 0 R /XYZ 133.768 520.44 null] >> endobj 90 0 obj << /D [86 0 R /XYZ 133.768 411.171 null] >> endobj 85 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R /F79 60 0 R >> /ProcSet [ /PDF /Text ] >> endobj 93 0 obj << /Length 1062 /Filter /FlateDecode >> stream xÚµšM9†ïù}œ‘ÀøÛå+¬Ämµ¹‡! Ù¬’|Ì?Ÿ×!–Ü­^¨f«/I¤q×c¿U®*»GwÛNw,ôàûõrñêmˆ]V9ÚØ-?wÆ9•"u1$e]è–ëîýÝÿ¸|·x³\OêÎtÆc$™ëH‘«ÃâýGÝ­ñÇwV.S÷|zè¬Ê”ñkßýµøs ê£JiÀ|¼Œ0©œ½3Œp}èãfûA}ºÏöîÅ?ÍuCÙº—–”5¡{i`вTrI%T‚%g8" «H óüü𵈴{ñ¨@³%/!,9b…‘³*ÔB‹D#TòÊÄ,B¥¤°ˆ>õËi„™10Š¨kµVÆçÁJ7—_ÇBŒxÀLˆ…€YÇ ±YŠ%¡ ¼…BË|X¯G˜‰T”A’QÑæòiפ°ŸúÅ'E±ú%rü’’JNbK–Ž`VÇ´ÐóÓ§1Ïü!%­‚@'ø2…)ù3 Ž‘& ßÀRDÝ`øF€Y}ÓB±k¸:M®3¥ŒÐ –"±bX€Yuj¡ˆáßÒ‰µ×‘æs‰'XJ°ÄÐI€Yuj¡‡§ýlñä3)í¬€NIœœcè$Á¼éÔƒB§±œ˜•!’Uf¸Ò 9‘”GŠ˜àZ£“„oųæÄ°³ú¦…"'ÎƘ>Ü#!2y™=C*f•ª…"-þ®TœÌèž"QK–R 0«T-t»š¯ÒzCÊáÔ( ,¤†N̪S ݯ³é„É!¯EŠ%«9ñ$Á¼éÔƒ®w÷Fßý[>6ßV—Ù6¡Cšõ$\Å’%Î…Š³ŠÖBWUµ‘+œ¹…Èälä#»ôfå§54 AâV°Xrs†—`Vÿ´ÐÏÿíôF½‘½‘.÷8¡5r“Z#‡*%NAÅgÝG «wZ&Ã;ÿ\Ó‚Oó9¥'i‘ÍKA³6³º§…2Ü#@®þiÉDZ|ZêŒÌb³AÙ,––¹½Àà<‹2›$ŽãÅë4.@¼D‹<ݺÛ<4mçY²™²(o$®(‹¥8¯$˜U©úõlÑéËÓáô¼[_þÕªÌßJ\³K‰sä“@V©æyûx} !ÙaZ‡ô¤E" Uƒ4ç¢P‚Yåi¡«Ã¯ì,Fj™œ„$J‰så,Á¬ µP(4Þ~“·"P´ßäLzÞýðÊùg´Òè^øn19+$z;ƒ¼'p%˜7·ô ›ã q[k%âöÚÂXNÜJ0«@-ôq3Q Nê3!£c‰ X2šS$˜U º¿ÌAÈÓ.I\K&qÚ1 f¨…î7s„‘>H\'K6°"H€Yj¡Û_FЫ·žzÿC…&.Bµ¬ˆn*Û{ øZ¼ë endstream endobj 92 0 obj << /Type /Page /Contents 93 0 R /Resources 91 0 R /MediaBox [0 0 612 792] /Parent 95 0 R >> endobj 94 0 obj << /D [92 0 R /XYZ 132.768 705.06 null] >> endobj 91 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 98 0 obj << /Length 2571 /Filter /FlateDecode >> stream xÚµZMs㸽ûWè(U­8øxÚªTe’lÕ’ñmw”LËœP¤V¤Æãüú<|P"eš¢×˜“!Äkôënt&‹Ý‚,þqG®þþíþîÓg©i’*¦÷ Êy¢•Y(©ÆåâþañÛ²hÊÕ÷¿ÜýýþîÏ;Š/É‚.¨ÀLCÝL™ÛýÝoÅY„§fñì¦î,IMŠV¹ør÷ï1P¡­¯0«vSš$MELE1ƒAwùïD’⧯øCüµÆkfFåbM±›¥ ®IÒ ÂJœÎÑOÈN?=ÌlÓŒ`j•¤ZEÁÔ¶-˜ùŸ·)vhªßC …¬FÄ +q3Ëf#`vœôA§I‰Ú‘Ò­òÀŠLu¢d G±+ 5ƒ””>æ$'10'}̲}'%j%Z'šÇp»’ÄJ38‰€ÙqÒ&%hGJt×þGÁ™eˆ‰Á VRÚ3X‰€Ù±Òf%hÇJt÷CÂN-ƒíE`+)3ËW"`v¬ @ÇHQi ‰˜š!‰CÌÿåÇ5ËÚQ3A 7‰@Ð{GÃÉ•Ê(î‚•4VšALÌŽ˜è10;bú˜u8íçr2ÇYDjÂYNÎ@Ãù Nb`N† œÄÀ œ 0«|÷ChÑ&¡DÇ §`Jæ¸J ÌŽ–è-0;Zú˜‡º‰Ï ôDMWÁhÕ4ƒ“˜'Ð)N"`vœô1á*Ñ/˜Œâ'X‰`¥œDÀì8€Nq³ã¤YÕÕqjÎi Z°EÜžAKÌŽ–è-0;Zú˜ å½Þ2‡È•¢"ÐbWbdŽ·ÄÀ ´ A'h‰h`>+J–ߊ¦Ø”ùkxF@¡HcÀ3Ja f¿yy«Zr_ã“TJf?_ã,äÚÝ‘JŽDšˆD¬Ö”²ü’·ÍjÍ$YfÕƒoü'/³¶¨+§ÖOŸ•èIC`cÂÀÄ>}¦¯0Û4˜ê朚‚¥Ë¦øŽ'ËöåÐõÕáïæk¾µ’ØñÇúè{ùá˜7yÕÕ.¬áĵ-'®}ìÄýiD^&U"ádÂ'ò¤Pð{sõäJ¤LÝR¤«l7YSlGP!'iX cÇü,45ÆLTJ;uŒilÍbD;+š &’¸óƒsàKþ‘-PÉžìRDŠIÍÙûª(°†!Š!ì>;¼¥96¥9‘HÂ'-Á5\#‚äŒ!*É+…ýUέäbZrÄpÍÓ(’#†kffëœ~Pç6nRCrNàC¹O"ÏkPÎlÝ““$ Š¿Å³XÊ°ññµ¾¨J˜N'Æ ¢H¦¹ Ñé, JâÀ ÊCÿ‚%# “ 7Ó§‚.ÕQ‚ "¡j^vA£Aa8Êe9ÇÄÖ!ŸÚ|Âꆩi1­;l61îb°Dreá–"©™>@R›ˆ(°)N|äêØ7lÍ8í}œSä\\‡¼Æ¶|†Æ9¯ñ?Û§,ÌÝf•olrû×,òf{,6yø0ëV Óëêë©Ú¶ÁíkãÝcp¾Û< Y¾q‚#‡é'úÉ%düN¨ÙbìykUî×pÓ3ÔHÍÖŒªåóSá³å+-B"aÌÈ&i0¸,;€.IôØ¥PÝ©Z¦7CªÓgGp#*ŠðÁÍšÑ@ø7 n |ßà@Ž ÃÖPˆ¶ä¿Þ–†¹q#q† FÅØ–@}BõÕ¶ÞÌœª\ÖÞJQ>ËGEã]ɆLÃÕЗÞ6z3 …“„p:ú£ÑPØìKQs;2¢¢À"R„û°sÒi Œ´9 ,VL.¿­¨\æåËJIœÌk–Êå?k;ðœ_†+A–áã¬,ÇônFMkž ‘0E\hñ0Có\ãàÕ2 ¬}žUWšŸgÈ|‰Š{Gs¡Ç€ †>€ý¨¡÷² NHgæÔi¿G3 T.æF@f¶ê¥0sLÈ¿±UT7Ê-Åôû"£ÛÂhd´ïb7¶`‹_g Å…¼ÚÂ<æÜŠÊτăìPÑsÚúP„)¬Ÿ"¤½ÄŸ,#QAuSp£ÞÈ«1Ý2ÑõY0Äì¡tUA~´ÁÐÐï¥Î|'±uÄÚ› ½ôJ¯n&›âŸÛÒG«ó6õ‹­/З} ä“8‰Íe#>OÆŠ…-Œ´v‘ñùÅ÷>e+FÎÛŽg€>qQõ„zD€ê´ß@±ÄUieŸWMHൾµaÝÆ`y—óûÓ+‰¦gúêãÄ`ñærGøN%V8½BA—Hc†ö1£É»Êðê-Á&faÉïA05¸LÍy?ÿ<"•k]$—Ù¤dlyïWFß°&Ù{7¼ Knòö9Ï+ÿÃ÷œ…7ÛÕ+îíO«8tãžs\OF|Ù?\eh}v¬®òó$¯gmÝ{¤ÆGrñÍfÙ±È6¥óA&D¨ÌÝpÿÞ?¯L=í³}ûªýpq“ujù¢:œÚ‘aßå¯<ШOí«yÞõÉU‰e?NÎÖÐ{ï"¯Ÿºdxêú5ß×ÇÿÆõkVe»|?«†\_ Ç*3Æ9¹Ñ˧b÷´.{UHé‡ëC~tª ?+?=¨È~?$J«~ÊnŠÅú<åÔœP½ø1D|aIsuée "4ýâ)+ƒ„§MÓæ‡à¢T!©NGŠZ8¯B¼õêH}Lt}§ÆE(´¬ÙÚ¡‹4è¬ê6ŒV-œP~–Msmÿy!7aŸ?Y00ýTº $NÌr_7a©Çp¥ÕŒ™G¸+cÖ˜ÛÓ±òm˳ù·+"}Ÿwôíç¢,Ã̲©ýd(9Ïš¼ëã^ÞóçÿqÈšÆí ße¡/sÿ@¹;YKƒÁºCî_W«8õl£i½D¨mËe•ƒ¢ÔU¶ûäDCÃ;â¬0õnè1|ó”w³R…®ÇÖqè'ú¾NǾ{‹í[w†M5O­yªO僟m·?ØEw;\Ööõ–IÏþlëƒÝŽsÅ7d§ÙãmøÓ““KÚbÈ]|¾5µh›¼|´:¦ÚÇvÛLÓŽ7Ý2yXÆÞ6À‚ܾëx¬GyØgÿ-ü°õ“Ó+ZÁÈ\+tÕÇbWTΫ쯳pd¹;?³Ÿ¼Ø¥ê½7EŸÿØ®¼lÎKù¿EøÌeße±-Ú2±Ç#JÉdðüï¯Ôµ´7õ¨“º(È“§þ¡Xkÿ endstream endobj 97 0 obj << /Type /Page /Contents 98 0 R /Resources 96 0 R /MediaBox [0 0 612 792] /Parent 95 0 R >> endobj 99 0 obj << /D [97 0 R /XYZ 132.768 705.06 null] >> endobj 100 0 obj << /D [97 0 R /XYZ 133.768 381.594 null] >> endobj 102 0 obj << /D [97 0 R /XYZ 133.768 216.782 null] >> endobj 96 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F64 23 0 R /F48 10 0 R /F59 24 0 R /F81 71 0 R /F82 101 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 105 0 obj << /Length 2914 /Filter /FlateDecode >> stream xÚ­ZÝoã¸ß¿Â@_”bÃ?EµE-pííáP mút{8(¶œ¨kK>IÞ\þûÎ)KŽœÄ‰_,jHÎPä|üfètq·Hÿø†çßn>|÷wã¹Èr‹›õB/2©ÎfBi»¸Y-~NnîË«k•š¤h¯¤OîöÛ²î»@ªWÜhË~ßÖÜþv¥lRlöeÔ¬ñ‰¤ VÍ’˜”aòz_/ûª©#Ó6 ¬ë¦/†a}ÃÏmñõJ¦IyõËÍ‹kiDn <¥ÈmXòrSÂb¯•—ÉÃ}µ¼çæñú‰Tr£-aJG’LŸåÕkgïÚ²+ÛoWÒ&åJ\]›T'ŸëÐW´}µÜo`¾I“´ètºÜžvئɺÙlܽ‡ª¾cR؃°;HhÃà=.¸ çùý͇ß>Hh¦ ¹ÚíÜÂI-œq‹åöÃÏ¿¤‹t‚|¡s¿x ¡Û…¹Ï¡µYüçÿ&,2X£>Ÿ)V–O+…S’ÄÊ+úìªÛÐú§ë&Õ»ˆL— %ó©Ì»ê[ù̦Ù\¨L/lî…”úM›æ”ð6?Ÿ}€3“°Âƒ}ÚÎAšç6Í+§u¡Þ ͉иkGîBi¡•f4h[¤£F‚B=· |¨¤.I«™ÖÜþ¯\†þ*Ì`ÿAÆ£S|ÐAÉ[nu÷Í~³âöàˆy·oË‘\ò &YææÌLÛA¾¹d×TàŠZî¢õqϾ(%ZõïŲß<2¡©—%*:¦ü:ø=¦®›À³¨Ÿž˜ö^µ°Þ iý[MçJ¤©;ŸÅÓ3×9øÐÜ+ »•?£höSys ¡7ÙÚXh_|=¡h |YP´±'|Ü*ó»£(ÀØ&·eÿP–õGxËMR¡æy“,‹¡›ŸáÈ¡Eçêù\á1>WÏu4l œ@GgNÙážÀ1gð­é›ü‰vZäà×Îf1sÌÎA;#Viúœ?Ñ6ܺ‹MQÆN…~-ËÝü1g³§ÜM7 ™ÝJ¡õôÔƒÇPY²©ØKtäT:rÐEfϦ&‚ V¾,wiQS´ (FwÃâlÇ?ÿûÓOs[qUÉ8H02ø B_….óc$ðCË­8jÝ–¡  Cú€>" ©çµ"ÐÂZ¼ùµÝ‰þå\sÚž ‰þX¥Àêym7N]D(h»±r*ô´S3€µgÔ·¸ §øO¼Œó¬–°sú=8ïl§qžÕðôæeœw ™çMdÆ=çI+×{pÞ¹,žÁyÀÊXõœw¡ç…žÒTP±\á„Rkó€¦&.5&•0Ô9öåÚa°~dJÝ0aÓÔwÄhÆP€(LáOq.xM$¡+dÖá}ú‘ÐCÆ#аXµsY`\08q—K†À:áSec,‚¯Û}×së6P(¢aãr©û‘™ü:Úœa(¥œø:çÛì —Ù…ÉX{ûV‹QàfÏf1o1ŠHôYƒ‘Âêü"2½Vù©ÐÓ‰QÎ-L<@kª ˜äóšk‹ýæP¹ ëÊP_¨j®B3à@‚Q¦Z¿& ”¡€'û©ãBª ó¡¢* H½ këÛ’j0\m´Pk5Õ\²«Ø¬;m1x!© $¶ teÝ•‘FÞˆ¡WŽõȼ¤C dÒ®lo™ZõAð¾Ûad# 6£û«+”F—BUH \H ü°YÒõCs”sbçœ~‡Ð*âÐp¬þ`ëG€bŸEc²àø3û6 qé\s@ 0då2÷,PJ…Akº€PÄ\hMc¡§RæÕɼ ‹u8td×!10ìÞNŸ+|¯ÀRlËË÷@©s9œFRÈÉIù2’º€È¤&"cªö<2)>ý{€ÔÙ,N)d•fù+€Ô%„ 5z:Áõ2?.˜åCÁ,!!»B•§Ñ%½©©•Ëœç •5$–Û]ÓmÃGÈi?­û€>4©lŠ™ØCª<òéNîÉÁùKšªºêîËxL-ÝaB€E0˜ê*H ¾i´R¤¡‡EBdX GØ z;A»ÐaQ׳õs¬Ž#lòiòi&VjˆØ6)T‚Òù$T"$Ò1e&à,=DE"R”C"c6“tÅ6ÎÄ A˜ÈôÙ@œ èà\e&ß³JªL‘œg ¤¼óîl'rRR¿Á]Bf@p¡g'ç‚GƒÉ° *~A Í)O±”fI‡uu-Ó4M¾o‰EÌé€|dƒ€û© nÃIùÉžßÓ1 «ëö;°tÂB`÷«*,pìÚ $yé`_R©g¸Z‘ƒ+ cÊ–M8üÉ0s¬ØË0€Ôž\ ÃVÆìë¾"K†¨v#iùµŠüÚê0*ýgZ'ÿsÈGe³£¡Kœ¬ðª°¢Â–6:)ÅÍjºñaÇÞ ˆÝ¯ô¨{®ê†á4OM܇y ”·ÐX¹wá ‰a>'VÜ1†b7#Sa˜÷ªÁõƒ°‰PÊQ: 3šüÇ[ÂÛ·ÀK.,û°©=©KÃ/ð%]DdNdNßÈpa5…s¿ É"sXϲÙîÊßnJÓíŠe(榇bn¼•˜Ïph»¦ë3Læ Æ&…YÅ:Úþ‰/ â0žÜÖóW·¡Pºl@kë}9-ÝÅÞâì“’¹ëj¾ír`»åš„í7¸.‡9XؘŠXºpaæØ ñW‡Ûb ßy¸!¡ÛfU~œ7N¤0rÂÑx[1$²-mP@ÁÜ£xðe˜D90¯¾i˸Èøa›¢ spàøpGHUð%#L£`g[à·kêÕ¼¿”`‹þÌÚ«B›† ¢œ>}—í(‡wO¬\Ö¿ìŸß<{(›ñmÂ)„§†9íox„ÑwÆ¿BX‘Aô™(wæ<ÆËsîƒv>ùTó3&úÐ\5eÇ-ÎÕ]N'·ßõL%÷RS–oþ­užEìòXÀÑ]Èhƒáh?cX$ö(Í#„f¸ˆ'N ÁÔ½ ÷9`úakŠM×0Ï]ËÕÈjE_k&ÿ]Á\ËÄÿë@¹ë! Î¸mƆº¤1a"ÞMwe?™ ^´Ü6ícøbÀ³^”Š+Áö&— w¨ËpÊÁgÜQ‡Ò {$qÂb¿bêúPáÁ‚L«62Ùí[ð¾ä¨QÈç¾›sœô—¾IW.h‚@BÚƒ%b…û¢¾+ù=\ªÙcŸ³›õœ_„i¤yᜭpùD»!Ïø×Ew€)GÏÿÆQ\ëÅ5Dƒ®‡…;˜òÛ¾:Ø$àW™Ú£ÏÃG†„ýSM…9ç.¸eÌX;¦ñŸÏÔøÈpdÍϱe!v¸áð;šßUÛjS´Sf1zŽ™ 6ˆ$Þ4Õè†úôÿÞâÿ_ŽM!€_Œô©þËìQoŽ þØÌ÷H!²?úŠøw¶øÎóÁ‹ÞµÅ–i´𬶻Mn?ñµs˜AÍ3ykèûµ¥¿VÅ:L„h%ce_à¨` gX!èµ4Çu­ÿÛc¯ endstream endobj 104 0 obj << /Type /Page /Contents 105 0 R /Resources 103 0 R /MediaBox [0 0 612 792] /Parent 95 0 R >> endobj 106 0 obj << /D [104 0 R /XYZ 132.768 705.06 null] >> endobj 107 0 obj << /D [104 0 R /XYZ 133.768 356.843 null] >> endobj 103 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F79 60 0 R /F64 23 0 R /F56 15 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 110 0 obj << /Length 2480 /Filter /FlateDecode >> stream xÚ­ÛnÛFöÝ_!`_¨"šÌ•b· 4‹d‘"°·ŽÛ}h ƒ"i‹ŠTHÊ®ÿ~Ï™3¤D‰¾4Ö‹8œ9<÷ëˆÏng|öï3îŸï®ÎÞ~Ðv³8”áìêf&´e‘³ÐDL*3»Êf¿W«|¾†eÒv¸A½éŠº¢Ý¢¥gWÓYV4yÚ•´›,ë¦ó„Gù\˜àOüÉÓíQ}s·iêÛ&YÓîMSûÕ}Ñ­ŠŠ@ºž·¢-ç\ý<[Íb­á)Xl¼e±l’æaš€Í: ²­„ÖÉ×¹àAî^OGÏz‰üÝõ¶EQ²Xoê¶-–eN (0>AÜÚ;‰&vñ8©h'ošº™k¼wi‚å\ò`Ûí“AR–õïÛJÅÇòì©8ƒvSw´"mÀ‚h¹eY§ ê×6xç?rv)ª[zs&¾ó<ò(Èrâòö6oZY69hŒp’íiMñì€PnÏ›’@6M·M“gtTm§Ne°@VÈü· ´]’~¥®IÒd3* .€†ÇÜÕuÙzˆò‰›É¶«×À` Z~(,¦¸%’2²=-\:Z-­ÆàÙû7n5ÌÄUVÓ³ªýÆýÜ9„{‹(b`7­+0ÅÖœŠ$tÓåž@â·z+ˆÛ‘(¡W|S ùPË(ë¤Ì²­iµiò‡{ˆâQÜöñIä Æ’™ 4—*DLßàÓ³ˆËe¾JЙ ¦ü<>1vÝž`éÙnò´ø¹DîÝÁCY–è½ÀÈÛ¡ÞKaR(©´à8òyáìýÕÙ·3»|&f*‚4§gÆq=K×g¿ÿÁgœö˜ŠíìÞA®g’Åq•³Ïg¿PÂQSV°HÆ•TŽ&eÇö˜®–Å*>a-AíÒŽ ·y7ATY&Et¢Z0ÉÍ´ÕM#™ O¢am “Fi’[9ãêÄ´`Úš±W’¿iï< ÕD©7;rY Q¸^»„ à\~Û—ºcG†ƒ^{?[,ÀÓuµxŒµH1 +Î0aŠà·¹pI¿ÈˆXÒÌ… n·ë¼êZâä¦ç~`ôf[¥”´R*¦Uxi‹>ú0Jh•4ù„:‚PDøøùÓ±%E 0ü,GÕk,)9gQ9T&ö–¼8?¦)A R‚&d)+õ˜æûËË‹Ë ²àÝ&Ò'!«53¡“ýïO—çŽ!9ò`„7SfbÊê'­$mÈ„‰Nº™ÐáóVR`NÉO¢.Å_‘•”„ï´< Yàÿ#²ÿº8¿úxþëû Ki¬,¦7抉¬2ÅOKóšë“(N ȳR=o, ‰BÚ“hMKñE¶ÒF1~¢&dœÇcª?½»¸¼šŠ( ¹Kµ.U*m0qܯ(¡‚tU)Í’R.îvÃq_ð…jöcîNgXU+\æ>iªïÊPE!›x€¡]œðPèÉŒ}ÆC#¨£5êóž×!LM6øØ‘¬4;)j!I»:}PwwãÒ~gùm›7£I ŽU·ßgR³Zg¹³ß0³öÏ£@`Vƒq¡ü‡Æ»Çߊ*-·ØÇèôÿõù­ïÌØêŸSM ,€^{Ðkh®ëêÚ1õ…Žgi÷'þ«7þ›þ㻤8ñ÷S¸}ŽÂ€îíhê ŸtíÎ ¶e:"Ðÿ°Š>ç<ø˜R©nÚ ##w–…Ö'«ôB)rj·Ø¶nJSš¦^Ø)ôͽ-ënå÷«¬À &¨mRÒ^V@CÓºžØá P‚ƒn»)sO §10›g0da6BºÖ`,´ÞJ@…$ ÖÐÄ OR°cN«d÷çmM”µ¡óM Ëý̳ˆ„ö €zl½0Ö8ož°¹G§wèàEá¬ãÆB\{íÈr2‰ÃÂ!bÏýôé±$"wIÄ!^ÑeBî â¯'HÝç¡Áá¼[!N(÷ÁVK’êAƒÈðpwÛYqãÛQ¡Bf”Ë£%…6¨hоÜ!WI¹u#5šMöFÍüÈjÉåpéÏ3°8Äv‡Y dú\¬‹2iJw¿óëÞ;Ñð+¾÷Áï7­*÷.Ô„–!›CËû)£üõ5ŠqÔ—»5±;…É8êïK"¯Z<ß)¶ÅÐéöýÄÛ±†b“€d<來Œ Þs¡ˆ'ÅaJ8tW ypõ&ß4y Ð.òÆ…šðÌFÝ;¬êåÿrGÐpü}-)œW ˜°s`<¢»BÙäPys]z´]Þz´«Ëç(]ÑaM ãžK\ú€<ˆ&Äl< b?þ8aeí¨Êh½É›¤ë¯>* #‰9Apál€`£®Ù¦À>:e„]Ħð/ L“E…(§s&1®ô8í¹,C—5™_za÷kéMÝß!g81vCFýKµT=ZK‹ì‘2z}춸Ëwµ\WÎèåï9ÓGÊ)¢ìy8Æû5Ï7íì—+˜œ /Éwõ@“ð®*/Gÿ4ÛØ  á®=>~Ìl¸­K¾NbËÞ¼Dq;þ‘Ôû„îLÈwÁKzËìqühO³Ç…Ç€Œ"†gt0`WE鿦ϴnϦ®²é¿û/X¦¼ÿ©áì&b¦Í«¬!ðFS‡•4OÆ 2Gé•Ý,>îÆ!¡(n˜Ó˜µ>× 3¹þU‚ endstream endobj 109 0 obj << /Type /Page /Contents 110 0 R /Resources 108 0 R /MediaBox [0 0 612 792] /Parent 95 0 R >> endobj 111 0 obj << /D [109 0 R /XYZ 132.768 705.06 null] >> endobj 112 0 obj << /D [109 0 R /XYZ 133.768 475.834 null] >> endobj 108 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F56 15 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 115 0 obj << /Length 2422 /Filter /FlateDecode >> stream xÚ½ZYã¸~ï_a /r°ÍáM* ²H€A ˜ò°»h¨m¹­Œ-õú˜ÞɯÏW$e[jÙ㆕<©xU‹Åº(>yžðÉ_îxúþùáîÃGc'B°Ü9yXL„RÌY?±Æ1©Ìäa>ù1L3?½œóìÓK1+·ÓŸþúá£ö“œåVZZÉ'÷Â3, Kþµ,ër*Möe*LVn¦÷JåYæYy}Ûr÷ +³M¹*vUSÇþf'o«uµªŠ„¡yúw9ÛE¸ÚƳMYìÊyì\lšuZ8Û»Ù2 ÙnY¦nÚ@BPÓ>çA‘õ×e5[Nï¥WYµ‹ßUuÜÊ6vÕe9Oஉߧ2~·/å¬ú‰sIA“‚`0PÍËzwÐ+zúÚ®RªÜAaÌe¥Òžqœ°å’yhÍ-jeãZT64±•šÖ1(ó(4æ ß¡¹ûú2¨Êš}8¶$l DûÒl+²<88køÉÁYl*—Ý“;Rè0#9ö¯/Š[€_ÁÅÄä÷]ß²uá8 ˜\k¦Å-|ΔËG¡™K\\ß%ôxHà9­06å"è¹Ìy4–øõŸî4K0ÐaÆ°|¬a/ê³ñLš1ö —ÿw€•sÌH? QÏ™®K”,×[ñÂÕ—_p°xƒrß*4loßµÆÆéì'nø"˜H4¶ÑÕøµÚ-#T¤A¸´Uá`p#ì­S'V (EZnÍ_¶ qÔÛ¡»ä,3þòeÒä¿`pŒó,w7Ù eµ*`rþÂQkmX.òQHÂòæÜuhVõÐAk&¼=5\oÅuOÁœZ:V{ɘ)º°Â\Þf L¶@…ˆ¨.Ø ö Ïcu°A@Ñ!ÚìÏ\Ï}çŠ@ëDŒ×èC€FÕppèBu=1ÚÇË!ÔñrÙ^B}ˆC¨ÑÆ!„wÑâL7ñ5¥˜áj“ð¤(¶HŸ«ñó|’¥‘˜Šcåuö§Ù¦Ù&&æÕâ~(±Â+tÚÅÁ÷+Ù †EÚ¤çûí¾X­¾&?"ú;¢ž‹ÃŽ¬0`K!wÝ&ÄèÜdÿ 9 𺯠¡×ªËžÖ‰= ô8AÏÒäìk„[nC’o‹ I‹†’$ˆŸ<†ž¡{¿-ãÜ`9¨£jbSÞU´«ôWÛY³ßÏ圵ç½:À›üV@F$ßô›ªž­ösðd À¥ýì[þqˆ«ÇGÌx|®¾¤ÔJé"5{h?âh›3uÍv¿¦ €¾ ˆ[fN=ÛÖ湦mÓÜ:ìû»Øè =Võ™zÒ¨ßÇkÖ¡òî=¶ïÛŠ9¿•ÑøB8Sƒb„ÙYóBwœÇŸËòexE€TyW5¾4Õü êŦ,¨wÅçò]¨¥rÄ…pßçe^Öûõq!p>÷z:°Õó÷$2ÛÎm VDä‡b0(󅆀P8 ¥)jñs°"±9oÖÁÑœj^"eô}*OPµb½k ¬÷>¤J=?¢J#ó L\§¸É d ¡²@Õ­uõÈzŤõ£õI¨ë’&â-]ð‡<ÓA×@$’€Ýpý¯(í¥ Œ•<ï*æGòù¤1Òˆ¬OK Œ ¹ocêN}©"°­Òp¿Oiè +Ô8«+œJ/ß(_!L¦](~¹¹­|…< Ù$¡rÜ^ÔJÓl ªÐ:ïòÕ˜ð÷ô“s&H?o'ª¹‚Ô\—èuz’ÎûuY­ÒY.ZÍ(R!7Ìè^¼Úöiyn“ºx, »c9Ý¥rºKåtw¢.hœSá£.ª‹âLƒ'%°î¶sCª µ˜œ¹lY”ÅÉåz ªçe—ê;.x¥´èr†\[È8×ÈrÒ¹k䥵dðucPÕHäz‡”2¿·¥+IØ,ÖÓcYÅûž£jiUò§…µT<ã²N}T’ˆƒË4þý)ØNczêëdÎVúËøÆBËC@kBBKÖôIá`‡ûXnÊî|•­‹ÁÄæi0%L‹Ë—GXÌqf‚ LB½¥„c5Óè!SᵸX»æ895MZŠ’:4Ï–®{6ï­¼43ùå»#akœ—#°.éEÖ‰+Ä%©¶gÇ *{y—äpuRB)ôI¥ˆ§Â—É5ðã»n¨k ‰“Ê©ü•}XQ'ô›#+긺BžŠžeó1ÎPùøæÚ¡y¦jéÀÝÍ…°HÜ;*ÂÒkƽ£",)¬ñ把ðDSE¸Cô죉8V>OdkxÈ„w“ôfA­øhÝ÷œ9<º¸|ÿߣlP†×}…TI½`úG!šÓKšèE¬qE3¸NaÁJÏs>L}¨Ki³Ù²œ}Ž ¼WÊ*Ð(â§_n”î,b4¶è¡?ÖAéUÑYß¾ÒkÿIÿºx‰ÈÚþíj×EŸâ¸3ÍrÝ+Üœ±á±pG·àb_ÏÂ}ýÝÿ©þVQµ[¦¨¶©NuC‘å"vý…çö~ÔýB ý8¯Ýë§öM‡Da_žÒ©Íš5$ÖVWÛŸxLûTŒ¢ïð/Óaì}G=ÄÓ(G]þ²/VWËLœ¯K]µ^~£ 8Ìc,-½“ÉIö"ûJ"hG’$“ö³Æò¿Ö¤ endstream endobj 114 0 obj << /Type /Page /Contents 115 0 R /Resources 113 0 R /MediaBox [0 0 612 792] /Parent 95 0 R >> endobj 116 0 obj << /D [114 0 R /XYZ 132.768 705.06 null] >> endobj 117 0 obj << /D [114 0 R /XYZ 133.768 667.198 null] >> endobj 113 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R /F59 24 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 120 0 obj << /Length 1014 /Filter /FlateDecode >> stream xÚÍWKÛ6¾ûWèEj._¢$¤è!E4‡¢i|KC+Ó6YÒŠvŒüûEêa[ÙõÆ.ÃBÃ!çûf†3/AkDЛ ñßWóÉÝk)P‚É$š¯£¡@2Œ0ã!š/ч`±Ð&_|QªšÎBveª4Snù¢‘ÙGÒ—ÓOó·h&(ŽG3Jqz]ìN¬uQ§ÅZ%¹ˆƒþÚàÁ?ÛGãH04cBcï£ÉíæäÏùäaB!EQDeˆ ¡H$eÛɇO-aó-"˜'1:4G·ˆá$N@ÊÑûÉ»‘ìRá$i‰§sòœ5àßMH“G,>fÕ朒HIÝ‚“DÉcÎe¹Muayï^‹xpš F1À5Dzʾ˜éŒ36j·Qµ[€d|$„Õfç´i=¥q°ÞoUá5Ú«‡}š{ÓÒYz:ðÅ–Ãa,ë©\MgŒsgÁ¸ŒÊÊbé”CN €Dó¥µkàÕµ2î(4ß*­w:Ûç`êqÓ;ïxÖ)…Gòø©[åõ]ABHwCÒr…>~+tÑ€|Bš†Êî¸Ï6­¼•¥Â 8â˜ð/k.g.cÈáNNµ7jµÏÚ^†ÕeµJwʽÿ¬²qÞ_Pçz ÍûuJÃ@yìƒl¼Â¤[áÛÝ*Sï)·^Sº:ê¹°¿ü‘8Ü]rYZ8áÞÖM~–•Û*×f£–~ç›?j£ÑÅÚ­\¡P(ÁÁYwQÚûê¥\?DúAH6Ý#8Noâ9bÁßH@X¼W ZD›Ënj]DÒAü«r€( 3Ò}ö5MXKVÖ#Q‚#9â‹xï]ؘþÑ*s:mìÓNÝÖ»}jtUæߊr«Ó|̇X†´åñ¶rœ›n&dPNåî„öÖíÞªßs¹à1æä´³k½Ö…}lIŠ¡‹í÷äQkÇÎpbü¢‹,ß/ý”ù È4&Þü>ÖnF­õW5>£ìBÕÙ0køkvmRŸ5÷: {âÓù×Îœ¹ëô,µ65Oäq_@Á.®Ëf‡qE6; »<°Ù…eêÕeW—Ió¸»2ñ{e"/wíÌ©1îžuHúý2‰ž(“‘lÊç–ÉuÙì0Ú2y<°KËÆ´ÙÕð[åš6èA®°ñȽâqö“áŠ8z”&P÷+ïã€yŠ‡ê¯è©ÿ¿sòÇœ[•ùò66PžÅŠ7Èbu¸íeãy¢êp“ñõ'åOádwù7Ìê° ªÃêüÑ8ù9sLãÍ8°ù‡ƒFGðïëü²5 endstream endobj 119 0 obj << /Type /Page /Contents 120 0 R /Resources 118 0 R /MediaBox [0 0 612 792] /Parent 95 0 R >> endobj 121 0 obj << /D [119 0 R /XYZ 132.768 705.06 null] >> endobj 118 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F73 25 0 R >> /ProcSet [ /PDF /Text ] >> endobj 124 0 obj << /Length 623 /Filter /FlateDecode >> stream xÚÍ—ËŽ›0†÷y KÝ$Uâ`s ¨U•:•ºf×Tˆ“±O€DyûÚØ&3¹€4+l“óŸï\Œ ¬~Ž,óüŽæOžxØa ÐÂ…BÀsÛ.ð{E´È¢5Ý’ÉÌÅîXÍ ¯Ìô³š‹]ô*òlÏsFã,Jó,‰Ö¤Ô¿[Z®5ùþ‚¾cƒB0p;ê/„ˆƒú5ãKìR©†¾Ôr³ËzoÓVœæüÔËý¸ç䌷Jì^ÅPÄ×dÙ» û8×Õq²Û¦iž‡X0‚. ´ŸO”¯²*1è_¥›ù6Îàó·šÌº=pVe%¶Õ§Õ0ºlÛCXqšž†å]–´®JrS~g\RÄHÊQMÖ@} Ù˜×gÉ{ócr@»ÞáîþÄõO¥½—Þj¥š=3á}MV¤Çü«5Ufñ˜Œ¯=Uú(õÿbíÙÔ ¬–½éKóîžéìl&Á„ï³_< ENyùÀ_Û?ÒËʾib^¶ÍŸÿèr;ó|¸pp÷dŸ% ^Øcš^Ò¥ea²)ÔçýŠÇŒz˜§úUÙšñ„N¤ã-M*uÁPk e„²s‹÷úÅ_¢ R9ãaCâÄøÔànpŽ:¾#S[#/-dŸ χ^Ðþ¦*(_릳1†ãn5¿kå}/ËU;e —*¾*=<Û'®k‘º°´H= µC)‹hrE”ñËÁz<=‡BxÅ6ÊU¹ÆL¦zXÉê®91e‘ÓËqu1hs¹®C8Ùw§µ!ò}™ÙúòYk"¿cñ#ý)¼a endstream endobj 123 0 obj << /Type /Page /Contents 124 0 R /Resources 122 0 R /MediaBox [0 0 612 792] /Parent 126 0 R >> endobj 125 0 obj << /D [123 0 R /XYZ 132.768 705.06 null] >> endobj 122 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 129 0 obj << /Length 1487 /Filter /FlateDecode >> stream xÚÍ]oÛ6ðÝ¿BÀ^ä¢fHŠ¤Dl°k= æ·¦‹Ž…Ê’+É úïwGÒ’ÕØi¼lO:÷}Ç#iôÑèý„†ï¯óÉÍ;%"M´â*š/#–J¢‹”L Od4Ï£qQuÓ™ä2.Úò®Ý˜…½[™ö./ÖwE~K%½»Ã•OÖntþ÷ƒßN?Î#™H¢cDËÀßVÛõa#²í¾nÂ^„Þzp[µÅCesÿ·©[Í~t\gcl½VÅ{`^„Ýo¦<ØîÈ”o*ù é¿kžú¶yÇ ,lƒ…•YÛ lìÌ'{ÖF éÁ®cç¨Ó†î^ÔU²p±2MP(X´wSJh*úŒžHÞ?þgé«žãÓ<¾0ÊÿI&ß¼ÙQ·™©Œ¤‚G3N‰æÌ ù£î€eÂtÜ­Lçwõz” D¥tóñmK¤™ü6Ÿ|ž0ÀÒˆEœBK“HdŒP­¢Åzòá#rX£H¢³èÑ‘®#Nt¦*£¿'tDN3¢V”d:õB½»NÅ&’èž×›dDô…B€GDJApº†Hèù*ÍúB1›F"Ç…“bÐØnÛT­šÁOa‡Ê³Mˆdí¿m½±u‹•)=qn:(ºf»n!gLd„RÕ/ØñŒC‚X(ÐnËÎ#¦ò@]•_ýòýtÆâ@ºm11qýqU”vÀhQ7ÀkSWyQ=Œäç 26{2ù’ŠŽBð”&L°—„$II5ä1Šl|ØÔÕ¼i¦,¦P…_¦LÆ–Lg‚Êø—Ò{Å›s4mu6hž®0ïí™4Ϋi¼ÜV‹®¨+Op ­7¶1mÃ_å©»Ç)£qí‘p"í–¿ÜØÒ ³€nìçmÑìxìx§ñ}Ý­<: $ÎÃvm+à5Ò¬VfÊiPrK„(#Кu€6¦R±×ÈLÅó:—ŒsBkkªvÇ5A¨Xúo]Võr ¥¯¡CÁÉã,«|LëƒBÐLyÊzP¥!I•ŠÁXXˆ«¬ÍÛ°\ûÕ¾ÝŽÈ sàýnSØeª¼'Åïjý"JÙ QzmºÅ ȵˆÿDÁ¦p¨óÊi)N¥ŸîàŒÔ .á/jk ›²tœØîim7RA@©4Ûéõvìì!êiµ%¸EËk¨ 뱧öÚl¾Sm©Ïø[3"Ur Å5H“¼¯ø¶ÂFqÚ*QåWšÀ‰ÄõEANIJåΘ÷Ž:ç I¶ôÍX³%‡zØ©ËèŸ$O™.W±>ƒA  |.°»‚TÁ`F‘e(ú\ì}~ÒºgÎヶ‚' K‡- 0y15ÿ•ÞGö–²dDItšîhlcñz€{þq„6ÎⲆaÀaMXÅ. ÚýLÔr§]lÞ\À”ãñ0j,V\˜Öx8öûé)‹²ô.‘‰s{ƒÏÀ’z…àÛSþ=s|8O¨ÞÚpÓ A/RÄ饡Å`Lx4b ,ž9ì-n)åîÌŒ;òÁ9n´ô˜¥ÿÿ‹……+DXa$àvQ,Léºá^ÿ½Ëa°t“.ÖmÑí™àTÊSýõ}g wqÁ¿eS¯þXÖeY£­…ËD…)Èygÿ²²ûžTŒ¿Žßw~(ªE¹ÍÃ5ê'è7nÂ#«Ÿ{g­úæ}vYT¹»Ý}Õ™1)‡–üÌóÌC^÷r~Áó“wWî¥Í]¢ÑËzÌGÒ^ˆý\%BÞ i] œ³§õxßyØâ‰ÖcÖX“ÌHC<á’ŸéˆÐĽyÛúÌÞ>ëu?ëÃmA‘A·ÞBûZ•ð¼°n»)íe|=€Ñ”L_Àå%s¹Åp¤\Ùf÷sÎÊç—<¾Å«ù½å®. ÃõžŒŸáÛ³Ö\÷ßS W|>ªó~sIË2¨sM2ø:®L÷vÀtúíé~Ÿ endstream endobj 128 0 obj << /Type /Page /Contents 129 0 R /Resources 127 0 R /MediaBox [0 0 612 792] /Parent 126 0 R >> endobj 130 0 obj << /D [128 0 R /XYZ 132.768 705.06 null] >> endobj 127 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 133 0 obj << /Length 1707 /Filter /FlateDecode >> stream xÚÅYIoÛF¾ûWè….¬Éì ZhŠ¦hoE|KljT¸ØÈ¿ï›…2)Ó²3öiFÃáûÞ6o¾'âdàä Ç·×oÞIžd$•ÉõMB‰B\ðD …(Éuž|HmÙí.‚Š´h¶Ë¼Ø-Û¯{VÜì*LWUÙ´qºÉê0û±ù òÓåÇë¿’'Hs–,AFDáEÙÞËnöÙÊ.7Y³l»ýÖ.Ëlgá}¼\º§Ÿ­ÝííAÜüʃLaøÜŽöAкÕ&í )ŽùáCxèvúñø*ÜWVP~(ÊÕ¶Ë#åþjç/m~)%íaŠfyWgû=8äì†à¾ 92:¼½.níôÛ÷°ó¯Í>Ûï‹×•ß†xܸPé«øƒÆZWgö]¦,ôØxÎ~ò¢ƒÀ±Ú¼I°ç1×: / C«|’˜pÄ„Ïë®/ÆÆ°E3)àNv9¦„;]!û¬žˆ"gpØy<ÀÇ´N"ªÌé^¨9׳8 îÄ;+VL*ß5Ì —)%d ŽÊ„Û—ÜÖlªn›‡lÿ@ÛŸ„ƒêîĤˆ"Wõ¡³qµÛ p{8†¨yz·)€œøÅv“µn¦§[s`„JÈÓ‡‰k¤¡!å@ã\òœ P}¡yr¢°y‚å+í í°š ˆËõ‘èPÑQÇÑqŽütphœÄr]; ÄàâÔŠ¤¿Uå"ÞËÐlcnÆå7“º±Û¯—Rx’/âÍÏ wm±¯‡~>B>5O„öH(bÐ2NŸW˜ v;g‚(ׄ!CóY` †þpûøHàAVï\ÚG.xÔYúÈÅ ôçÈ¿œ „V#ÆŽõt× í*á˜!¦Ÿ×5 —OÒ‹rÍΩ`h'”‘³ÀjŠ”+ÙCØÇC|øoÖ1 ¡û,>±mü÷B¸ BŒ=û~ÐD¶‰#Û„…ÚfnxSW»¨õ0†y×D;PëÅÅ÷÷,š9ÅpÎçYí¿$³s^zXß¼¸/Ž a¶sŸFðÃr(ìlU&¿\œ¯®àŠSš‰×Ь¶·î.|Éèü[—ô[{Ó^}³›êb½is“ü¿:gÛb]Î=¿éµ™:#æuQ6¶nݯæìpûW´hbW6à9w9¸_ûª™\/gËç,Ï_ÕÂr¶”Ëëjÿª¦ÜuÓ~çpíª[ûFæM»|ÔP÷ÐgæDY;%´©W u{¡Ö2"k:ð¹5H÷¼ŽâÑÀ)ÿ4\V‡ endstream endobj 132 0 obj << /Type /Page /Contents 133 0 R /Resources 131 0 R /MediaBox [0 0 612 792] /Parent 126 0 R >> endobj 134 0 obj << /D [132 0 R /XYZ 132.768 705.06 null] >> endobj 131 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 137 0 obj << /Length 848 /Filter /FlateDecode >> stream xÚÍV[oÚ0~﯈´—0Aê\ Ú4©“ÖIÓ´—ñ¶N‘I µš8ÌvÚÒ_¿ã[¸{ÁÇ'ç~ù òò¾^!{~ž^]ßf‰7 &Y”yÓ¹…ã I/KÇA§Þ´ò~ùtÁH5¥Qê³;”†¿§ß¼Qy{£0 &©•. *êbA‰‘W7±Ä¥½¾ïïEƒ—Åœ·M!ˆ£HÛ> endobj 138 0 obj << /D [136 0 R /XYZ 132.768 705.06 null] >> endobj 139 0 obj << /D [136 0 R /XYZ 133.768 489.136 null] >> endobj 135 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 142 0 obj << /Length 727 /Filter /FlateDecode >> stream xÚÍV[o›0~çWø1©×0F{›´Nš¦IÓòÖUÈ“ ‚I1iÕ?ƒIRZBÒ”T}²±9·ïœïø °|wP»~;W×Ì a`žì{a ˜çCB=0ÁÍ$UÕtæo’ê,ÌŠHd¡^‰H†K¡Ã8ÍÃ4þ‹<4½ÿ.†Ü¥`†1 ¼V> kÁ;)W½jìáE¦/ ¨+,Õ:߉ÕÖª§U+Sï.ív­tºP2¶_«Bð—Fál¿O‹ôA­ôÅË8²:_œì¬q̹üœÙÛTT(݆-Ey kgŠ}x}¾öéeÈúm!WâN~`RÛóþ죘ûV8Ø{áèÁ¶Ï“]_ŠOižš"Ín~œàœH’Aö>ŒD\{½é…ôc勇¨X=}’ÅÞ§*)e“Ìc+zkéêÚåÏaY ±v•‘$šTKQY©Îø@H55mßÕÿ8ßæνƒÍ)äš\@©uA”;7·ÄæÒÒ€ƒÇæ×ðÀì2ðÇùÝ3¬d†”€6ªÜÍ°ÒÙc–º¹d³F¢¸kÖ¢úÚ,£Ðçx³ŒAŸ]³†%=F9…Èã£åÌÀæwZöT æs²É}$”­”BeOv÷¯­µ®› ½³«ÍY³mpÔíuÒžÉJCËìyÐÃ~—¬ó)G“Ç)6ƒú¶>m<‰Š|%Ê7kªEƒ&z1'¿ÊÄ3jàsVªCy¿ÙŽ”‡é/ßÝAÈ^b3}C„± X)EµÁ+)‹¼MTµ”å ôÛ¶u´Ê’"ËŠ©q÷q{—¬UT¥f>€§æá´Æ¹HUëfoÎ2Æ”B-ÆèÎâ^] ƒ~' Ce©eT’f|ôô6ÌÎ1#q\Ÿú“Mþjì3"wz’y¯0ç†ÈäfmLÒ‘0Ü°í°û endstream endobj 141 0 obj << /Type /Page /Contents 142 0 R /Resources 140 0 R /MediaBox [0 0 612 792] /Parent 126 0 R >> endobj 143 0 obj << /D [141 0 R /XYZ 132.768 705.06 null] >> endobj 140 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 146 0 obj << /Length 2227 /Filter /FlateDecode >> stream xÚµ]oä¶ñý~žØ ²*ë32AkÁk])tuo¿¸~$ãºCëo|}7\×E Ì$S¢\†³³míÉõ® cATùj\øq€øÂàè>sžÕ¾÷MMç^f% ¡¹Û ½ýê»8ö€ð‘À¿],Ìñ°‹Ä¾ %Ûz{SE䶛¨%Š¯û€üÎá­Ë \@ñÅw„ 3øµqnSF2YÌ„oÂ/ ÖÞÚ2ºÙ¹ud»½ÒjûM;ßaOç £ºQp¸Ô¹~Éâì6]Ê"Ë bÌȧO39,߸þÁ¹:G‚Éš1@ó”{JY0Uˆ¥°Ñ&\Väc®ØÀƒ31åŒÅÜl*Çe1}Oî/ô‘Y!øò>FŒ÷þ!1™”#Ê WJÇ!*¬lŒ“71JF—r1MÚ ¤±<¾+Úû"cC]¢Rð§úgâbÿwúþNŸO>ÂÿJ‡^ÓÑËKÇÝo_àôù!îˆâ Þ<›Ëõ´ŒÎ%2 1~â‘ý¨:²Dd°¡á“á^ƒéfÅRÿPœÜ@Ê2¸ ZWÙL'-ààÞbTý‚↓ÁÙ¤µa9úî—K}è;t7#aƶžBL¹½y¤³¾`ðëNÄõø€Ã¦MYyµˆÈFÿVÖÃ!/ÖÁ@çåö{qW .F éÜbŒV1_©­óÀ^Kã5äöÐÔa#Å5€‡ _XèúÖB숇›ùAµ=·Í/nvn¨j×TÓz,`¢á%ª ¡r–¨PísvìÈÕÈ.e\²‚ì¢î ‡°ü˜îÀ(H^Ý»'KÑëÚ¸2SlpÒÇ©f ƒoT,Ü››1zŒ1n©Yh³ÊlÒl¢NÊ ˵ZÖI‹âlQ+­Š³k¥¸w^+}@Áq/Ë ø &!ȯA°BÉ…SÉ‹;,M/5¨Ë¡ðtM‹žA›A“Ê×=h¡t¨:¨-ª¸š›`±yÁÚ#‘´G ‡4MatßhÑ|‡Ù3¨Ÿ>‘52dꜹþ#ö„Ê ôsÙ˜GÅ¥,-¯9£9ÛŠE‹ÖŠ®—w îŽÆ>÷l˜ð]ê Áló,Ü ¦`­ÿJã ’\®½‚ yœšÔû¢LèÄ .˜õdþĵP¬T« D’ÂÝ¥Yj/@bÁ’Oú Õ,°}¬qF-d‰S]NuˆÁ¼€Ì¯}2ß%{g(1ÔN›b¹™ JAE¨YPi›>ÆgÇ—GS´£pÃä\]ºç-¾Ó¥ b¿ó¢¬¸Œ †ÅÛf¨¿IB5w4Œz¦ÉHÄúÀ&Žg‘·NÂI±Mƈ6ÇËí$£ÌÖ‘…«|À½3:ô=*xa0Ù¥l|}ôÚMÁ0b¦Sf:=ã*,ø¸ÛF$A ¾¤ÕgtöPæÊ—Ê\ %½X¤2JÔŠ3Y®|¤i‡ÞyFæÏP׆)õbˆyB|ùBWô¨ù$Ã0nÁCÏM}ž šUè ´ul÷¡«;Ř¥ Ëå*da.‘JQ 2EA ¿±9lý!ÔT:&ŽÙ! 9.ÑX U°¢|UkuðŽ\UQDŽF*‹6æö|vá6ùzuÊvñÑEäXƒ¯]&‡VõÆAcëæ-'1"˜öcY§ ÒíIÞ»€NBÿ÷¤áÞ¡ å ¿¥‹¦Û–Ðï@ µÐò"ÊÄT…G-u‹ÑŽšÎ-ÓòhZTWhžD8< ¾„`R!KÔE|Y@½û ·=ºc¢â‚º­(Ëä3ØÓJK}[¥…­ÚªÒ"EkÅ?ggéð“SA÷ü«Ä!ÖoUˆ?8|kÐIÐ-ÂŽ¨ëCÈ90 9G‹ç*¥drz¨| `ÕFÈé²M ,ĺ¿‹u×’°y¬Åk_°ð¥+„p{È2ô(‡òBQYƒ y©G›ã–1szLAØ”ùJIŸ—3¯Ÿíµ#þy6Ü e`™Ê‰ô`L϶8š .z}¾´qÇñè©h¤y¬´ YWÅÖäT=ã˜|ß,ž³þäj|aêâ“òú9ÌÌ 9¼LŒð¥Çuf+4"˜%†¿4œÒ“žgŽ4æe4ä7ûäëÝ"–Aè^½de¨Û”JEuÎóÏHzLjjöº(§—9Ü‘ŒÞò'XæÏ:að… Ê eA%ÉŦwWoþÈC½ endstream endobj 145 0 obj << /Type /Page /Contents 146 0 R /Resources 144 0 R /MediaBox [0 0 612 792] /Parent 126 0 R >> endobj 147 0 obj << /D [145 0 R /XYZ 132.768 705.06 null] >> endobj 148 0 obj << /D [145 0 R /XYZ 133.768 581.126 null] >> endobj 149 0 obj << /D [145 0 R /XYZ 133.768 504.922 null] >> endobj 151 0 obj << /D [145 0 R /XYZ 133.768 342.615 null] >> endobj 152 0 obj << /D [145 0 R /XYZ 133.768 177.858 null] >> endobj 144 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F56 15 0 R /F48 10 0 R /F59 24 0 R /F79 60 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 155 0 obj << /Length 768 /Filter /FlateDecode >> stream xÚÍWÉnÛ0½û+ôâ1ÍE¤%´è!@\¤Ðõ- Y¢c–”hiš~}G$½È–·fO¤93CjHÐ="èk‡ØöbÔéyØ“L¢ÑQÎñ@ºHŠf\ Q„nºÙä¬Ç¤Ó½eŒgUùP•Ðs ʼnJ‹8K óë–wÕcÌ Tf¶*ÓI«d¬rÓŸsª4†KÂóp»OÓx¦ÌØ6†»Ñ7ØORì «¹Ö§K©‚4¥ÂwlÛ¿*ÏpÍÑ ¹â `d f¯j¶zÚÂ}ó¶?”ΊC±ëpãbð¤¶ý§á¬Š@=Ðu?ÇŬÆÓ/mÒ}Æýûø·^ƒ"}í¤úØÀü\‘?ɳğ€¯n‰ šw!¤&—†¼6 Ë?–zç¦;¼º¾œsk·A?i–^ƒæ4eÞ.Qì–Bä,w8 r;nØŽÕÚTÙîÃÛ$¿‚÷v)²;D ó~_mdñR*":Øš¹Ið°ž¹r_V€ÍFVvPæŠwÊÜýO!s›*ßÙ‡òÿt‘¿âµòwûÍ[¥ðð»6+{\`'’Ňj|»,~iLZn–½ûmæÝ;‘Sq¨Æ·‹ÉZד.8¬‘®«¨Þt]Ñdy”. Te©R…¥ŠÌHFf( ž 2¶T*†j-7ƒuݦ¥4ê$F=(<µñ#›=_ÇãÍÜÃ;oUX¶sá`ÎüàÂ6pæbšÞ6KP~×Õp -i” •©6ƒôŒŠîs9Ó{ƒ„éÎØNyÈã<|¾0ØÜu¦ ¢¹·Îå¨óØ¡€Dó`ŽË… u˜tnîŠ`Îæž‹žôÔ1ìé@ÌЯÎOó,h†Ê㘨¦âÔ3‹™y{À(ásq©R‘-µõS`e§!œØ)>¤¬îQ!±”kwIÛ¡› [9‹øeöÂêÎZ{5ïT´íï¸y­®?Ö˜À„Cî£2{ ÁkgÕ2âû¶Ù0 endstream endobj 154 0 obj << /Type /Page /Contents 155 0 R /Resources 153 0 R /MediaBox [0 0 612 792] /Parent 159 0 R >> endobj 156 0 obj << /D [154 0 R /XYZ 132.768 705.06 null] >> endobj 157 0 obj << /D [154 0 R /XYZ 133.768 609.988 null] >> endobj 158 0 obj << /D [154 0 R /XYZ 133.768 178.232 null] >> endobj 153 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F56 15 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 162 0 obj << /Length 1544 /Filter /FlateDecode >> stream xÚÍX[oÛ6~ϯ°{ˆYÞEnÀHŠ )Ú­~èÐ,Ó±P[r-)‰ÿýEI±YqØ“$’:—ï\xÎÁÞ‡½w'¸|¾ž¼¹ÜÓHK*½éÂ#¾@’O Q&¼éÜû2ºM¢ùx"¨ý¥«ëÍ6Š3³½^lùŠ¾¾¶«YðݸC{gÊ¿Ê/8L~›þÌ'„ -JŽÂMt[R—Á¶ƒáÉ®ÓÌ’ÁN⬋Ôwc6Ç óæ‚«=&R!ŸSoB*QŽêt ’QG5)û±{™•»QœnL˜™¹ûÌÓ(¾q¯YE`‘¬VÉ丫÷yfQ§ÈŠS§z¶,D%RZ7Å»¸¼:?€×"Z™ó&]tàÌ#…Ižmr$Ù®ƒìµ¢¼Ìj3³ Æn£¤4]²h٥߰ëd}ŘV–Êý[kÉ`%yêîÆ‚]úRK¶#á1ûð¦/€·7NOËÊ–mâ}ð|Ñ£xnâÁe®©'lŸ òÿ$¨Eu³5‹è~ TCHKÙ£¤\³Vò4_ülÉkÏË"ÅÑÖE‰˜ÖÅ'EПOO~œØÀñˆVû¾ÇFÜg^¸>ùò {sØ„K1­¼»âèÚ£H+ o+ïÓÉß73Åa) RÔ环 ÌMƒCµxë`7žíò™}š߶C-Á‘æ¼úïòÓÕcH€èÄ°BB²¦Nþy6íàË1œ —3$iò-•mI Ò´ä´2ŽÀúó5dz1ˆäŠ"¥øqˆq‘’ƒXŠƒ¿+Ѳԇ÷çïÎ:0ƒ‹òfý^Æ%Gr˜ÈáÒG²91ÓI.‡à+0E’µlõñÃÕ¿W—o»BVBåÍúP›p=îëfJì„Œ°ø £ Èd¯Pƒ†°EH1¢ûá#J Lå |äN"š|Ï?w0¥ü ó!˜R }Ä{ƒiÍ4òEíÈIWFSqIz}œùzШï#_‰ãŒÅ0ˆ/Å|¡€kò½:›žîÊ0®Q b(ª£¹YÕs¾ÊR»"GYÒ¨wÄO$¸¿Ù þÀ)¸ÕÇáÉ…?Ôƒð#ÕäÛsCÕ†\AÆ x¢”43Åy.X-G«(6öMŒ])!ûR–2n3uk®RµÍýšíºÜ\‚àZ ÷GWÄÀ³¶ž­õ òë¡Ë(¢¬¾¡ÜëpcȯŒ€¹~[M¼êze`AVb²LÙU}ÙáfP‘6cN¡"Á´ÉØ"ó˜©Í9`ï!˜r°™jò> endobj 163 0 obj << /D [161 0 R /XYZ 132.768 705.06 null] >> endobj 160 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 166 0 obj << /Length 899 /Filter /FlateDecode >> stream xÚÅVËnÛ0¼û+ô"ÇH‘hÑC‹¤@Ú¸è! Efb!²ìJr‚þ}W¢d›~Ävâ '®Väîp8Ü%A÷ˆ o=ÒŽ_ú½³ "µdõï£Eˆ¤ˆ0ãõ‡èÊ Ò2TñƒñÁ„WM‹4¯La'íשÓÿ‘J±Îêc¦‹Õ·q™&ƒqܺNnÁ¼&‚~l!Å*ä›Âܧ[A,yì8°QIt{Ìcnl±¥åÍ ïÆŤÊüæI6¶`>A¼³YžNòAi*<ú¼Ãa¬Ìc¾–—¹•yÆvåÌ&ßœh9@ô*9òµäA8{Kfž±#gY9g¡ZºžT8 ™+›?#“ûSÚKâ,3CkOZ_l‡kBXfj[yÒx§àÑÚ«FÆN»›dÙÄOi~ߺfyR¥]8ˆÃgåÈ”ös¾ÐÆÇ~2¹Ž¨¹Õ4Ä: ]Bš°‚4(a(«Âæ{%xl20n}F¼™åGè%~(!˜2´7ѯ åXXGQ7§>±:fZÚ1ÉL\˜!Þ(Í•jÈ3àÇaª»Ë€Í×jmI. }»˜5ÇRI¨°èRbJýÈ"ÞקÊ3q5çý‡y²Æ¥©ZNâ|h_&‹k-”6™CF-uÙl@¹y˜@ë¨ÅmüNbÝç¤=“¤XVNƦ“ Š‹T¹Ž³èpºÇˆÛÄ1#Ê==L´²ÆÙXœw8O«»Aì#¥yÉã€e»lã\TRÇ705žƒÅTNã¤ý> endobj 167 0 obj << /D [165 0 R /XYZ 132.768 705.06 null] >> endobj 168 0 obj << /D [165 0 R /XYZ 133.768 409.868 null] >> endobj 164 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R /F56 15 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 171 0 obj << /Length 631 /Filter /FlateDecode >> stream xÚÍW]o›0}ϯàªábóÐÞ&­Ó¦=ò¶Nˆ€C¬IÛ¿kì 8iÚ…¶K^Âõ½æøøÜË‘âY•åYßfÞ‰ç—tv{V‚’ˆDVº´ˆç¡ÇVÎñC+-­_v–±®Î*¶¥Ž’Ж«EÞ±"ë¨P©#—õ6·½÷BÏùþ°ŒâÀ·\ŒQ°"ÿ³ÛmòB/o†ðçÂ=ñµu¾9¢¹ËR3õz]©ècé˜]\8¼á¹éÔa{'³3%sÓûxÛC8²»½ ⽯Ó}Å‘å%Xa¦+#±áVŒ|;ç¥Jµ´ÎÀë|‘hûBP]_<©‚Øa,{^Œ/;_4í­ü¡#†È×õºVYÆ•›*ÚªÊÖ»äµ;Há™âö´û举ŸØ+V®O0Ph:4eBÒT{ôŽ=šCÖ<ïA-^?HŠ¬\ð†»\±t€›`ò}µgXêY$ËGÞy`œ»v“%ž?Õ7y~ÕÞù:½èûçÅ;öТ´?y†)$` 81GïÞÃóƒ— 'È÷¡0lþ^R.˜fz{¦qÎØKCÂSçŠiWÒÀ óÏF àýz1ø(ÄÍR=ßôB…ÊÝe­c²dkÊ;íÜÃ~uªÑ,Ï‘ uÛÛcr$FQ0§´Ô ¢QÏ…&*vŒ»|MÑ‹3JH„ˆG@BH’hÂþ¬û‘MÕæ›+´m Z;©çLCM³Z¼mÀ¨Þo<Boôßw'T]›B½¶–‰lÉÚnÔéÔÔcø †I“š 8ŽÕ1ÄüP¾¦³¿ ñåÞ endstream endobj 170 0 obj << /Type /Page /Contents 171 0 R /Resources 169 0 R /MediaBox [0 0 612 792] /Parent 159 0 R >> endobj 172 0 obj << /D [170 0 R /XYZ 132.768 705.06 null] >> endobj 169 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 175 0 obj << /Length 1664 /Filter /FlateDecode >> stream xÚÅYKoÛF¾ëWð(ÑfßôÔMÜŠø–-S2‰tH*Iûë;³»¤H™Re‹÷ÅùöñÍÌÇM6 MþœÑøüývöö–‰#NsÜ®.9š%ZÂ…Jnï“óå2¯·Ë&ý’Ý,Ws¬Õé*Vñå7¡²/ê|Sd÷¡V|¢Šýzóùö}²ŒX)’cÄ©åMþ­gy—>F»±¶Üf?à·\çUÝ€Aêí6÷ºÝ4¯3Qýì‰þ¬}ûNÚÅVmu²à‚8`nÀ |þ‰Rs ›¯Ë}š×ûbÕäeQ‡*Ìç†Ñy|' £ã´üð²j»<>lΟA•àºÎš‘I2Ig혴¸öª¬ÙWEÀ«²mÚŸÓCÚ„RvÃÔüÇc•Õu8'f-‘\ w6Ž×JY(dÛl—MjyqÔ}_îÒ¶1­bã6 å«rS¥ù*Ýnÿn»êhª=â'Î.‰¡¢]%œ-šýq;û:õӄ)ÑZ'J:b…MV»ÙÇÏ4¹‡Î÷ %ÂÙ仺K8qÖAi›|˜ý5[$çDÃòÑ”.€"7Ÿ‚ Kœ”“€«CP ÿ¨²„s> ¨fØ3Ä¥%0¶=ô˜72‚†ÓCÊÄe|îù Ïìë>ÝbQœ:cˆãR»³GÌ'·Hb­¸fá2€éÜ›ÒVž9b®1ŒMª€ÆCÈÑæ†zKS@B qæ è…'¼ÜÎ7U–6Y<LJ'aÊœ=<c,Ì`‚E ©‰5â‚Ã&¦ù$ ZÃ/8=a‘¥“œž°ÈR;Ý\æŸCÿbhÑ)½s@àLÝøÄa "˜={ÖÌ@„²à3\Avº*B1 ÊxK†Ÿ ÅÌ¢”›“SJlïtÜS0Q˜I@!Y(@7'=õ訩Â<9—ʘˆ¡©—§¡æS²˜…qUZl2r³FFa½ÛÔ«(EUûª ´ªÆSÇ0¢!>Ä*é:¥Å t¤m»¼ÔÃB,Pè$‹/$ ¼%tô%‹o8t…eÁèVšè:¢K2ÅÈæZÐmî}ÛWûy/h*Ù‘>ÂmåB|HQüÁF/°ñ„üÁ1![rq2º2Œbê¼Ë P" å„2s]xe„aÆ£ ³ÁÓÏ„WLÚ“@j¯9]&Ú &*Æh3‚é(¸¤šÓ Prˆé¿nF¸È1ã§d.tÇáC92§ÊAÓ17q$—°éõ‘\ZˆsZ\É'Àl#ùôl$Ÿ4Fò#Ð1=K½$šS/‰˜gyÅŸðŠT‡ïâSRiøùXÄ@®à\¿.Á)dyk„ÐÄÁ7â À¿€5BÁVNãB9ÂŽÜc3Œà〃ԘÒ?Ƽœ4&e¤Ë€;¡QÂ’„“tS+L OFÍqÉà½$.]ÙÅ¥>èù¸4h—ú ›sqiÌ6.õ1ŸE1E£² ¥,Nk<tЉg ™³‰ç çÇHQ$‡û1XSx#n³÷oxuåæwi¯°hýMoóšWälè^yŽ¯dṂIçßP!fUƒ“8®)CwѪµêæû:/6ñŇhx]n·å øãwì KþÂjà…¼÷Ëì.ÝÛçÓào_û{0v™ëçÛ]æBm¹®ÊÝÒïVŸ}Û½ÍÞ#×߆÷æÕÎë`ö.¿SÖð!ùp÷>dø‰Æ CÜðþ¶{Ê`;RÆ7<¥ 6#epؾð¼À¦:ç­qvl<2‡ÖöºÌñ³?âO×ö3Y¤ÿkŽC.umÿ+£.gúûø’<|™^°u/Ù´ƒÁçúŸ¿ûàRcð?8UíÍ‘«µ©FßeÑEB5ø(¼PþËÞÏ}íúòuhiû&ôµN ­~‹±à…ôb½©>í’_Š0©6•á «hÒ6¹î…ú)/ÜP¤«ÆOÊ"æ@ó3’CÇÎgŸþ1×÷/sëÉ¡£ç çu0».9Q^(;ÿ'«ÊE'Vü)ÊzýìƒE¼T­øP­Ì€‚—ʹnªý* è(ã€4<69'ð<ö<¦UºËÂÅ1TãÍÖIîµ™¤¯Ÿ†™$4Ŭ1dTÂ4^ëKüO äg°Èí` ÈÔÖó· endstream endobj 174 0 obj << /Type /Page /Contents 175 0 R /Resources 173 0 R /MediaBox [0 0 612 792] /Parent 159 0 R >> endobj 176 0 obj << /D [174 0 R /XYZ 132.768 705.06 null] >> endobj 173 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 179 0 obj << /Length 896 /Filter /FlateDecode >> stream xÚÍVK›0¾ï¯@êV…€ÃS­zhÕ­ÔKÍ­[!Ì®»¼Ê#mþ}Ç6á’lvÕflóù›±gtéAÒ¥/7úïÇÕÍâÎ6%OóldK«H2K³ C²-GCKKZ…ÒÙ÷iûtCÕB–ÌþÖ¸¤_’J˜n6?*²ÄÏq“ò^·tåçê«dšk.%Õ04Ï Wøéò†b¼ã(êa˜!Á!µç’êÐúlw¦ÛOµ]Í1‘¤"]óhßIU**²t§¡$ÆÍÒÆàT Ö¤1d9%áhSTÖö X2¦Í®º¤éƒV B”Åq¦Ý?í\T§wª1æ{©0Êdk®ç5'1.M8Èö©ŸÉ/‹¿}Nüwl¦œNÇ”™Í³:QGÞZÛe Œ!ëËn€2Áù^lÀöœØtk^ÀlÈ©ÏfÊi·zàMŸÏ!äÐ[k{Nl:Èz^MFï$!Ý¡Ïyõ£æ°OKöh—ÓÇ §î(d“°ÈÌ s(Ÿa{&ÓŽ 3}4oÆudêõý{¡¨KäÉ%/)līùý’Â켤°+)ÜSUQ ›‰­ØXV¸¨x‘`VV"dñÚ¬ŒlÃ’IQ’–€Ø5Œ ¢Šü7LÍ3Ía˜³·°r¹”q o†-“ß5Žiµì,\ Ëë7$º«™º 1àX‹ ¹æ Ý<'`4‚‹óCÍäÊN£Ì€¬©åEö‹UK/«+±–—UN˜Éð—–»ÃÂ) à0ÈŽŠ¤Åq Ž‘ëÈÀþïuñêíº %Š Š×1)AäÝH¬†°‡­b[²¦¨&Bò§>q¶]t °–w ðí…–£9r‚Sš× »péì¤'2Äb×RT™ø²ôeŠ6%Éü¶ É–·Ýr~!;S9Ûï¼Hò{xûWæ Mƒ¸›[ø®á¢Ëíñée¤ÛÔ»ö»üò!ÖYpvC {0¼Ä9ãm\^PI'©uÉÿ’ëŒMƒ¿pE¦9Ú‡9îw†·ÝªvzóÂüý’ž-ó Gx5ú_—ÿÁöyˆ~›Í› šüÓŽH¢ˆ”J²+ž¤uÒíiâWÛ¼Ác£qXó¬|Ýdm¥¸z¾^W}%zÿ ú»KÍp]xø=Í…/wŒ¼ÁŽÏ«›E¨øN endstream endobj 178 0 obj << /Type /Page /Contents 179 0 R /Resources 177 0 R /MediaBox [0 0 612 792] /Parent 159 0 R >> endobj 180 0 obj << /D [178 0 R /XYZ 132.768 705.06 null] >> endobj 177 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 183 0 obj << /Length 678 /Filter /FlateDecode >> stream xÚÅVËŽ›0Ýç+X’*06¯€¢ÙTj*u][!cœ”–` &™ü}m Ã;Ig2ÉŠë‹}î¹çØ ì |êùy3{Z;–âéžc8Êf«À¥­;*Ž½Ô ÓV6¡ò]õý(ý]t sÍ6lUŒ0Mr–¡(a2÷iþsóƒjêž]-ìNôsÂøl·ŽPüØ \iAݵÌîrY—¡?çê6‰Å’ûfuí}vJ+<-ª—5^JóE3Ÿ3¬Ê8S¸*+hÓ\»(°¿Gi…ÑÉù( [ÝŒ áL Ñx8ªÀªøæ>¹»ƒ>…ã×ôi_ê³xø >»NÞÀÃðqæum»a àãœ:¿#ÃŒ¦ï?z¸%ŸÖ–Ûú(kŽ«/-CÑ  [ž%±×sh«4›k&pT"/hŸÆâƒf@eT¾ÁAŒˆx©"™*‰—ïhÂxÝ(ÙÉ1ûEj8Nì 0I"3œ]YcG²\fÂŽD¾^ªÈ$JBXFÅãD i´tϲºâ稴ˆù"Ãj‘”DD°¥qL™cIR¤0 ‰. _o±úÙ»Êj7Û¢•û3E˜Ô;TÄ«©«+¦uçÇùêò=WûÚê4SÇöÏj´%±ºÍ¿Åå¹uâDV].û³—êÕÓhŽQ}ðÊäydûEÂV–ÛTÃ4=‰L9ÐCøªã8€·„õ·Ýû5JwxMþ(ŽØ©‘¢_°fçã´í)è32yTŠ¾èþi”Ÿ…Ž ÚêÁiÓ«LÞAƒŽßcP”ÜÓ">D½4&uùÛá[ÏÞ}mrßTj˸¯ÒÚÃ¥¾P&Íèo‚™O‹~éS ‡Õ{аu`BÎÄÓ]וLLÐYòe3ûå'© endstream endobj 182 0 obj << /Type /Page /Contents 183 0 R /Resources 181 0 R /MediaBox [0 0 612 792] /Parent 185 0 R >> endobj 184 0 obj << /D [182 0 R /XYZ 132.768 705.06 null] >> endobj 181 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 188 0 obj << /Length 1499 /Filter /FlateDecode >> stream xÚíXKoÛ8¾çW=ÙEÌò-r_EØ.°—Å¢¾¥¡Øt"Ô²UINRûßwøc)²ì$Êîe/æ˜ä<øq83]G8úý ‡ñ×éÙ»\EiIe4]F„+I#ÊD4]D£?‹1Ç£óñ„ •HiM(A‚h/>-W³«¤Lç³ÒT㉹o¯€üÑ !BÁ–«ÝžŸýÐàž&YÌ–Å&›•Uñ <¯îa'HqÖöæûEzéÅüàsŸ–UéiËž4VÓ†f“õ¢±üKX'¸{ý§°Î)h ¿±¿î¬­»˜H¸ N=XÔ[üa£½óƒîâÕTÉ—=5ežÌÃß·Ž>ïòÚ.NPøÌ×sOõo³P5¥Ë€òz›=0,ÒlV}˃ˆ9é4¨—…sz7±§Ëå;O&‡ñíºÆ,É]#ÌýÿÉ5ž"WœÕê<õA¤õÔ‰Bvâ]špñá·éÙ×3³8"°…ÁqÌV"šgg—8ZÀ" 1­¢;·5‹(lÐ@­¢OgùÔ×Ò&‘`ĉŠU¸8Õc¥S¤è:)HaÝÔéP| m1©ÑHŠ1Q£ëmfÖ6_1,!”.ÒyRÿÏEXKlŠ…)ê~¼»Iç7–Œá€^•ÐûPHŽèNÕgLX‡=̉ë=¦;¼ð/`G°h³ôã­­’"ø·O¥DÄVû.—\­l– ²Dž8Ÿ£­ÉvtÇñù¶òäCbr\6·X¢¼ÙlW¾ \‰rSdÛ*¤G;>ö;*’¬ßñ8Üœ„»eš"Ì^â+$c’ Vÿö;N!ÅJ9„N;ä:çeÕqÍΩw¾pÞG¬é ü‰35„á2F`ü)`AdˆÉ `A`ˆq ¬<)’¬ë•‚k ÚׄÅa¥›Á¿;º Œ°€Ó*ã—E7Áæ(W±èŽH”þC()b”7•Ú’¬ÃÍb$ßE7xËù@"ë^O£”"Ë!Œ§T pÜ£PeÄ‚ ¢”s—[Jo"¶Ü„€ ð¶bgƒ/LYúcÃ\wâ‡UZVaayØ‚}I|ÔÞoBh¬Ù³2õGtC†Ì+k!÷ÁÙÕúÁ{Þ¿ïr0(ªDGq¦Ú¯ñ¨Ú«ÇQrRG“S[‚½½¤d¹ìîÉà à =÷S[\MƒŽ›"^Ï”f»t×(Íïžeg ó»AÑé3I¾²I§ùÑÌ‚5"›,I׳§õ#kÍAF0âŽèBí³übÇ„gá:L”OvŒŬg=¡ç[¶Ï\ûn– ú˜·m[¹@ Ìl´…ºW)¯‹‘ TDÿ¬p%Œ endstream endobj 187 0 obj << /Type /Page /Contents 188 0 R /Resources 186 0 R /MediaBox [0 0 612 792] /Parent 185 0 R >> endobj 189 0 obj << /D [187 0 R /XYZ 132.768 705.06 null] >> endobj 186 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F59 24 0 R /F68 28 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 192 0 obj << /Length 1522 /Filter /FlateDecode >> stream xÚÍXKÛ6¾ûWè(k†¤–ÐS $ÅöR´uOI`нf£‡W”v“þúÉÑ3Ú&Ù¤@/k>¿™ùæÁÑRïΣÞÏŠ¿?6/^Ç¡—’4æ±w8{œíI…^í "ï{oüãQéâØŠ÷r»‹xä›ÙõñXvE«Žâ|v«?\Kñ–FìÇí»Ã/Þ.d$ oÇI£Ðz˜u•ª«c)®ˆboÓù½Ù¹ã¹©KœNµÙÔ^~ZòÜ„O!P…njÉ‹×a2!h'droÇ%ýp‘îèŒK–Î#°ÅžÉëR¨ÊÛ¼:lî7 6¨Ç<–&´÷¢4%qļ¬Ü¼yG½6¤‰÷h–'i’¨ðþØü¶æ< :ÑØB…G¹ª\1t “°×M4[–øw])«v»ãûÐÏ¥Îu’ÚL#¿ݺ³ÂŽëób³‘Ú0YݹéIh•õ;…hm²ÝIà߶.F’˜Äœ/} W" Wî;ÕÈÜÍN2–nÒ®Ò$b½E…ÒíŠÙ< !ãý¡R|t€Y]isÁN¬Yðû·lj7)J'HIHâx@zKY¼" Hû3j/·,ò?\, Œh‚à±çXà6Ê8MIÂ!ˆyVa˜1Æ·;F)õo+}•² °È™’ö;²®WT3–‘ÿÔ(ŠÛ8òoÀE!:5౬7n¤/uWäf¼÷«ºu‹±åÔ06á…¶v¿™hpEœê°"kA¤3ô· Ä•±ÀlÌNkÙoãV*Ô šó„û'£PgãxÔÙÄ©)RänC\¯ÅG7Äø@O£F†Wë«l>;G¿ §çº(ê-ÔGÌ£z¶[Ó¸uÎß…<õÍ2a‚a➦þÅAIó×1ÜlCj= Œž)Å(NRÈ·0ɘw˜]åâ­Âv5W^åÖf3«åJÀŒC9K?ñCUÉ”4µ™pJÂ8E bwÀº™ö±ƒI f€½ÃÅÔ³§M°×•™Ì|ÛÈÖî7Ç_]#Üm5HÔ½L¡¥ €¥–Ro)5›¢Ðq’kN„ä8w&Š£À …ßYF|Z¦bFê¼CkÕ9%œ&uyíZéÐEå~{Tf•†•Fšš” ä Ö,ÃF·‹œ^ƒZç” 7»|ß ˜¿¥”ËK3<=,[û`(§Bºº5týïÂØþ)ž>–kMä7¾½8;¢ÑÇ\=è¯~ÙG8=£'»œ}›:#ŒžÝ"Í9Ö¾@µøs=ÐÝ=°e7oؾ‰¼%t7åðËš3ÛR@2Ͼÿ4g\ëcò ’x kûjê˜ýYêØ•Yš¸»Á ²Y˜;¨ä–`’4 ç,ôYãÛÅØ“ìQ³£Æ gâÌË%þµ†æâdU„[ªÊŠ.ÇNŠ§h Õß^³ ®,¬šˆY}Ì°"ØJùÒðD3¶-l|[ÔáÐ\<,/Äs+ÝÀ<× N/–c8)Üâæ¾[-ÚªèìøY¹Î_Å`<¡Ý†¥? ú| 8;zvmãcöÞWîU2}oHÿö|ãžØsׄ´·+l”­E‰B7»õ"$Ì5=¯ˆ$8\Pj#o I{™5+û^Ò¤µéc¿HŒ^ÊØMÙ ÉžöASm±ðŒ&ÕMÞó¦t)²Ë,çJÿÕUY»ð‚pS[´¨[‡Âp3´7K—º6ÖÞë€q!‡¬©Þ¥VÐZÃvÁ~Ùä™%£æÐÍÿw¯¢(Ô]õy¿A™õñKªùË¢•MQ96Å“ï–¾Óá«•%àËrmV lîf¶Ë‚½‚5²¬ žˆ;mýoöQjhbc÷te2lnÜüñ¢l2ØORlúÜ~šŽ:4MýA•ø]ýÃÎ~·/‚oX;*žù–/‘OÏ E3Èaí;(8"Ÿþ¥a‹¿&qW”š¸iÞüóˆÐ€Á75ÿаB>»ñê°ùÂãy{ endstream endobj 191 0 obj << /Type /Page /Contents 192 0 R /Resources 190 0 R /MediaBox [0 0 612 792] /Parent 185 0 R >> endobj 193 0 obj << /D [191 0 R /XYZ 132.768 705.06 null] >> endobj 194 0 obj << /D [191 0 R /XYZ 133.768 570.76 null] >> endobj 190 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 197 0 obj << /Length 767 /Filter /FlateDecode >> stream xÚÅWKs›0¾çWèhgbÂÛ0½u¦é´gßš#°lk‚A2iþ}WHä€;ns±h_ß~Ú•m´E6ú~cëñëêæþ!ôQlÅ¡¢Õ¹ÎÒò…ÁÒr½­Öè×,I(ÏŸÈ|¸ÁL®8jq ³G;p¾Ì¯~¢…ïX‘ï¡…ãXq`Èoi3/p¥åõ*©IQ6$YÓ†ƒ>»U7­Íô¦×³ƒ7÷~4ˆmFÖÒwÑÂmN¤´ý€05f[0áv«@ŽkZÆiɸޯõØ#gÚq9Ýt_Ÿw4Û©)+ÕH¤ñ?UN3*ÔNMªšp _íQmæ ÄÀãgfIo¬ëÆ#êu¹fgŒ9)æ4ð¯EÂ610Î ™•PÖ”yCÙ–ÅùD;6žÂônÌÂöE/¶ñRiErf …JhIÚ¶ŒÇ6´æ ¼›_ØNyÞ_”Ó°]ÈëÀÖOazØ‚+ÁNÃÖ§Z¯® ‹QDµËŸƒÀ¥•ú£…ûÿ"ðªõü³´gPŸÙ‰&žW{.Èç$£ßvî3ÞòêòwÁjAÔý z2]Oí{¾î“8Ï»&ªÏGÌ몛$VÞÚf á‘Ð>Íù-Ô ­(ŽÍ@(=­µ6çÐå Îv‰Ê–­À{"¤9¬!ÜzÝü;RÝí¦½g½æ·ë^SÒuo¨–â£}äÜ ªD/¹ÕE¯Xq"úž@ûCË»¯çD?Vó>ý»(ÝÑêkÚ‘·{"^²j’a}$íîM*0mËpûȬËâlF/O2šËåž:öD2MÒ°sé2™±¨†G=³E3ñº²L~”$óÏ‚’­pFð¿ÊéD±AN~á=ÏŠ–žr×óŒ3ßV7•K endstream endobj 196 0 obj << /Type /Page /Contents 197 0 R /Resources 195 0 R /MediaBox [0 0 612 792] /Parent 185 0 R >> endobj 198 0 obj << /D [196 0 R /XYZ 132.768 705.06 null] >> endobj 195 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 201 0 obj << /Length 960 /Filter /FlateDecode >> stream xÚÍV[oÓ0~߯ˆÄK:­^œ87x@4žû¨rRg Ëìa;þ=¾%i:—®»H¼´ÇÎñ¹~ç×A|>‹üX]~ÊPP‚2‹³`Õ0OAa¥9ˆ“4Xm‚¯ázÝŠn}ÝÞ“Å2ÓPŸ‘öp®O=mÕwkò[r\KM‹Òhñ}õ%@( –‚2ɼ!än’9Jq’{E^ ‘ï±Ä7»ÝáÚÏ ­Ô÷æõò°s§nñݧÔÝ蔢ŸèÔ$¹WäÜ©ì)N]~BÅNÞ–YrËXI„¹•¸ZQÈË8ÂVŽ%±¶€ix¯·7¸ë,!·Ž§Â¢­-©Ò ÜCÇ®|p7-uFÖœ–RÙÔ†?áã eé)¬#-•3ä­Æ ®·kcä€5_ô'0Xò%nT åœ7T‡y9ÏÉ¨Ó ®ŒdCß³v3a—k)^üzø|HÍ<Þk8νw ôy?¡nÝËx? ®l‚_ÂûBÚ!aeà™Ea­[áúFŸ`Øô´–ªÎ¬˜žŠdyªl0ïêÑ¥h`[Öw«…ÙsjuDöªmì¿èëšÑôýŒ©{³„öb`ÄÔþÎMQ¨O¬®{.Àb™ ^Q›zseé^jÆrì°”C±ÖX‹y™e©Q¦ªúû¨^»ïƒr}k”_ì•;®vš‚½‚ê*ýW;ôˆ1*©öó!%Bs㯬’(#šDyX{G™$KÊ-–žÄ• ˜ YQØóeNCdäÙ0"FéVÝu9¦’UŽ"Î Û猦ÏiJÇJ´}NßÜa!”Á6Sqà^ž˜ÇųâôŠ<X0×F¡$Ü´âSe© ’exÕØk¹m…¥†N~ö-'•Î$3^ÑÕ‰Ò%f©1 (6åcouŒ¬Ù{Ù°®c U¦¿Zzm=S¡tÞžö`ò-Šb.$xL¯šÑîÐ:¾lèp«šÒzˆÒ#fòÞXÝ Gºïñ=A·äçÙ3ëÓOè‡*ì´¿­†bgÍ?Fø¡]c÷¡–„Jâ–ê"5Í€³Û“Çw~`|Ó÷Áø–…¶ž±ûÕ ¾jÅS†Šy±/’¯°á¼iiÝõ‡‰w*—“M`ûÞ+WÖƒkÒaíIÔÉë«oÛ9²Y0cØZ^Øï.}ÊF3Ùã¤Ö¯³ÍŽÎîN÷ìèì¯fƒÿÇèd¸çÚ× 'äñFŽjvŠp>xõ(KÔG9(b«> endobj 202 0 obj << /D [200 0 R /XYZ 132.768 705.06 null] >> endobj 199 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 205 0 obj << /Length 1452 /Filter /FlateDecode >> stream xÚÍËŽÛ6ð¾_¡£¶X3|ê‚hŠöP èö”†,S!²äˆ”7û÷r(Ùr´ÛÝÄ-r1‡£yÏœ1î"ýzEÃúóíÕ«72‹r’'<‰n«ˆÉŒ¤ŒG‰J *ºÝFoãŸî®U\ÔíÍõJ2Ûúz%Ò,.‹¦ÙåGÜUC[Úºk¯ßßþþêM"O¥rJR©@§—Wš3Í„ó‰Ä|è†f‹‚{m‡¾E˜âRW¸š¡,µ1ÕÐà¾hÏŠÍ ÏŸÆºï»ÞiVL‚r&`$WÁÕ®,‡ÞpTòø7`â¹D‡y®â¦°V÷ˆ, £! ‚ª¸ (§Ì­ Œ©ø7p‡ï¨±^çOFùÀ¸éçÁýÔUƒÛûºi Qq®Ð¹+æìOE|ëEÁVà·=dÐ.$'MˆPÉør!5á  z½ïµÑ­5([×è ƒ}”! úÓP4µ}@l7û aj§ï‰Šƒ­›`+V©º¦é®¹ŸÛ;LY&IÂÒ¹·SÙ­xÜ[UüŽRîjÁáºÁ"pÿA‡dE¸“Ðøý©{ž,>3Y(ÿV᧶³7‚j³È4â=_ÈÓy€d:™ãz–+ÉH&E´â †e£Ъ NµiÖGwÖµYòßQE½#ÿ©ëµcü¨õ~I â~8"@ûq¡HV Ü’ÏmóÈ…0käQù sØTYï(K–«OäSyÖ!ª ³«pµG%£‘¢ôÙ`(êÖìuiõ·ƒq¥52/;DgðY9Z1A˜bÏNRÓÝë~½é†v{É<Ý,•œn‡Ý‘{[ïÖöa¯ã ‡ÖÔw­‹’Ûí;3%=Z-™ö„wÃ~ÿ´wÉwïÝ¡«·‹îÝi‹Û‹ ¦n¢:~>ü‹•¨ã®>è#÷¡h÷–;ªÿä‚8³3yV4uUÕþ/ga’…ò%f Â¥s3DòÕøÚû =tÍA§Ä|Ÿ—]U÷Æ.~i_þò±œBÍÜç} µˆ™ºƒ"4vé3·Ú9_m,ÖÐh? ^tØ»öÆÙå0÷X}]l„ùwÏ› ìøî…Ö—äò¬ó o¡¤Ú izþºoã[=PšñøÎê‘©°ÈØ3éš-‡ª bºÖùá0Å(Ù¹áù;ü0˜I r¥^çj)ÃØ÷ ú|L÷ˆãKï¶F[|3 ë®ØBsÆ ¹š‘:ˆ-pqO î:i.8tÊS¯Uçû…_n¯>]¹.‡F,'ÈyJI–ɨÜ]½}O£-|÷ˆÈ³èÞ“î"NòÌ k¢¿®þÄYm¦NdŠ¦¼¨$ !qŽ~¡TRF*/¡TRIT.æJËn·¬^PìÎ6Q,%Is>W¼­fáDrID6å¾ó.ME$;¿¸–RÆ%T¥WÉyþ-N0%•‰• Ôé*ñKINÀ‹èL]ÅÉ™ÎGÆiN”—ÐË'Š‹™ÞÇòEAÙ4¸‰P$avÈùÒMèÐó›çbv"Mm‚7!è'D·ŽâA‚èp.çîÀû2ÏI’&g·Íø7ŽÞ¨Õ ’_6JûKæš6ˆ¯ÜA/Y)Õ‰eU0«ìÛU!®¶F7Â8<° §ÃlÇá @|XTBRžÍû‹Ó¿0ü Žã©…2‡IPŽ&~~&§PnS‰¼~½à¥ƒÄ±ˆž3ªq(b¸AñåNï׊ªz¼_ƒ¢¾ìhóx»õdç쿽Π€gŠ'q·± ÒÁáYvÈÙ˜ì©*¤(p»)L]"ˆÏ&|òÏ& ðÙ`”º+l_F\Õõ;÷—–TøŠÏ´.ü3kC΋ååÿ‡<‘¿]aOòç\ƒoã$5´¤èÈ‹9É ò7¾¸-YHú“Düf’ó3.ƒûxåþS =¨P3¸èÿgì¥ endstream endobj 204 0 obj << /Type /Page /Contents 205 0 R /Resources 203 0 R /MediaBox [0 0 612 792] /Parent 185 0 R >> endobj 206 0 obj << /D [204 0 R /XYZ 132.768 705.06 null] >> endobj 203 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F59 24 0 R /F68 28 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 209 0 obj << /Length 1297 /Filter /FlateDecode >> stream xÚíXÉŽã6½û+t´ƒ6‡›(¹ÈÉ-ßf†,±m¢eI£Å“þû/ê–—n«‘KN"Kd-OUEá`àà öÏß“OŸ$’‚Š`ñP!ò@„¢, YðuªŠn;›‡4œê&_fz»lŸ+å$){pƒ‹‹ø7’_gßsNPÌY0'ÉÐ[X.ͦµÞ©£ŠmÒºÉ/f¶J.Õ.u¡~tI®[­³¨Öÿ€vl•Ÿ×ý¤TuÔ}Ðæ-¬`ø`5àþæ‹Q‘[B§o×{¤âmn“j9  k( ßè[·Ð[°bo×ËoÑŽ”ÖæÜœÖâÿ¯pî+|úÌã2›‹Eœ‚=‰½ÅF¹¥=Þ#1’2ßì0bÖL~_L~LHq@` ³kx„‘d> endobj 210 0 obj << /D [208 0 R /XYZ 132.768 705.06 null] >> endobj 207 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 214 0 obj << /Length 864 /Filter /FlateDecode >> stream xÚÕWKo›@¾çWpÄU¼a1OõV©©ÔCO¾5ZÃÚFÁ»ˆG¢üûÎ>À`C ¶[µ‹a˜ùfæ›[ÆΰŒowÖÈõËúîáÑsŒ…žíë­}yžë#{åëÄøi¦¬Z,]Û5Ó2‹JZEIzˆö¤Œ{‹2þJ‹hÃk–Yí²ƒ¨,½‹FסCÜØ pÄ1׋À2¹ ïiü¬DYˆ&°@}4Ö=YØ–®˜ÒeÖT4[^èGY¦ÞñÕÉKÕf ÐûÒɺ0v YÛGžï$×{å­–ìA!a˳Œ ¼¦l§UæHeEI‚DŒ³­ql ü´Ý>OGgîÿÝ7ØÞ_ÜkÕlßLʪôɲlZÈî¦ä*(žìÒ:Ä“†dâWÕyF£T²k”;Ê]Ežé(í¤8d—&MÔdbæ.è4lw&ìN¥˜ÈnäÉq<°¦s=VJ‡Û},ÑY8–ãýí£9¼ê~t’¦ËôJ­Ü-9vžé•»$׉õ¨( Ρ⠎Kßi”´Ge÷**_UϳíyÌ¢»1cضºÄñžøò êdÅ;lÆÆì§Ñ:ÒÎ7Óh¨¶§núËß¡î©óãn.Pyù mð]¾DÇ{6·[7ÚŸSäéOÀEpZG yÚ‘¶þø4ŸÆî'vÆÝ ±™<í|Eõ?ÜVÿ:ø7‰¸Ê+¿wâëúî7G¿Ž endstream endobj 213 0 obj << /Type /Page /Contents 214 0 R /Resources 212 0 R /MediaBox [0 0 612 792] /Parent 211 0 R >> endobj 215 0 obj << /D [213 0 R /XYZ 132.768 705.06 null] >> endobj 212 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 218 0 obj << /Length 837 /Filter /FlateDecode >> stream xÚÍWKoÚ@¾ó+öUØìÃö®ÕS+5•z«Ê-‰,c/°Š1ÔDù÷Ý—c ¦PC¢ã}ÌÌ·ßÌì,K€À÷rÿ_g£Û»À! €Ù`æÃcø êƒY îÇ2¯&SŸøcYfÑ:ÞF«¸Œªz›‰(×âù(ŠôÜ“ÛÎJûñII7“ÇÙàaÈ= ¦ÃÐwÚE^¯ÛM©\GÕëVØ-)õø³Ù=íÛžlòÒ¹—¬âÂYl<]ŠjÏÓ£~œ  ôþöÎã;= 8dS‚`HˆUö¥œL õÆ/²ZÙ=r(…õ”–•2ÓkFßf£ß#¬FÀ‡\­ñÏ9 B’õèþTM*×! 9x1K×€À‡JÊÀ¯ÑÏžP CxF•Rk´ÜƉ84K‡˜yW1K1ÄéšU4öõô||£>‚ÞT6=Vƒ8¼ŠQŽÔ¡…]«:L{ÂÅD n¨¿ÑaÂÆÕJhŽŸ'*Úâ¬6| QÕE.R;¹Ý¨üuUmìXœÛo5#Š<ÎìhW±M40H)é†zYu¢4 8™RŒgÆ<#c™Š¼’Q”Ú7Æ”ÕRVRå¦]²)ì¿†× -Üî<•Úÿg™ÖÆ5¦òHäe»=1+aîL"N{Z~ØIY›)Ó¾l–uP֥̗JµÜù*a±É²öñåmnQç‰ÁMˆ ½ÊºGuSov“ÝÖ›¥|mýéNýšÇ¥L¢RU0]Åti‘é?W°7%Nñ\‰ƒ ÙkEËÒÄ–þR,Ÿ(Ï}([oÜ—ù °ŠŸz•dF2§¬ÏhËSzçîÔ0õÝÙBí£lÑÐ{óŠ„uÂò€¼œ/ÿ_Ç€=LØ´hz™‹r«íæC›„+RÕzÓ´@äÖ^ûó_çÖ!—ïØ“¾Wn5-ëÀ€¼œ¯“¹upÓµHw/·ƒ²·P×¼±>ý°Ò×gá‚è:Âu#l „à þöt».ýO4g0ðô<ßÿ3ÓâøcÕ̱BüV½X[=Ny;ð‘WÓq ‡]í œGûÚ¼Óís 1犎rõoSÞÙ¡ÞyáS¹× endstream endobj 217 0 obj << /Type /Page /Contents 218 0 R /Resources 216 0 R /MediaBox [0 0 612 792] /Parent 211 0 R >> endobj 219 0 obj << /D [217 0 R /XYZ 132.768 705.06 null] >> endobj 216 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 222 0 obj << /Length 964 /Filter /FlateDecode >> stream xÚÅVK“›8¾Ï¯àˆ·Æ„S{Ûª$•=íÁ9e¶\²‘mÕ€DI0)ÿû´ha×0ÉLö@Ijº¿~}z„ÞÉ ½Ïw¡ÿÚÞ}ø”R/ò”¤Þöè‘( hB½4É'Þ¶ð¾ù\¶ÕjĦܢÚ5—š£ÄÎîqÚJ#N’¸ª•y“èÏÕ¿Û¿½5‚ ½uyâ`…l®¨†7»33ºdÛp·³9¯'z¸øf÷øö;…|PÒ8ÿ‡3Ó.’>þ|ãøoF·0±ÐY¥ÿSN{fÄaW±ú×2`ô¦Ó#Ïl6Kxv wˆöwð,}©'¿Ü™ÄÞº >ÑÍèLY§› £Ä[pmÐÉöÌ `Æ`zlå¡1.™vòJ™¦¼à¼5üØ–8oŽjß0!ììŒDÁe#Âpm Ò˜R›9PG[¾^tÄ^D4È)–¡ó_3  à«u–PÿËØêP7 Yˆ?‰¢e6î<ó¡’j†q€& nŒbe—­E‘ýlÈæG|¦]µ‚ y‚ Ò0±…]E‰oíiî|Pè$•¶Í²Òý…à ’Ô(S5׬¯–Eþ¨˜Ã”ªAÉž£ ÖÐKýdÝr§ÌZ3nsV¶ñ$ G®¤ ÐU‰å ’MôŒ‰Dñj…aèÿ£WÆÚnë+é¬×M:Û¯’é :ý¯åpÂ]8æ­%CF'8a”=3™Pfq ?:åU }á£2$À®þICSËRY¦|‡Zï»l¸= ¬î÷3Ç>uâá„Dëª/ñ_w—ØÊ)k^v…F)œ.vç8|&_ì/ RGŸŸçšKÿ8Ê0’ÿ¸.&ÔŠb§ÛÉ‚:* ÇŽ=V:Œ®P:aUÕmƒÌ¸GåýŠ„~ë,¨ê²×=óÃãÜm)ŽØïæìØö¬NVÔÕ©c¢ÆñZ'»GVjÎ ÇŸG‰ír:Âqï¼phúe•&~0áɈbãçVh`FHf®+¼;íã¢+0œç»ÎíkkÐïïZ˜^ïšç%š÷ô6>n=ò–å1y -ØVšÎE»ØÇõ¡õš.O_T¯é²õô6>n=±–å1y‹,XìÝðA³ïòØÇ­«dDA–¥n£Ç?q™|•£ãKV 8f^sÂÄðöziÛCnOÎß~çOx·ÌÍÏÐ{rÀ¼äfþ0¸Õ xv¡Ý{=ëß$q>1ù¸½ûïYf¤ endstream endobj 221 0 obj << /Type /Page /Contents 222 0 R /Resources 220 0 R /MediaBox [0 0 612 792] /Parent 211 0 R >> endobj 223 0 obj << /D [221 0 R /XYZ 132.768 705.06 null] >> endobj 224 0 obj << /D [221 0 R /XYZ 133.768 427.298 null] >> endobj 225 0 obj << /D [221 0 R /XYZ 133.768 388.07 null] >> endobj 220 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 228 0 obj << /Length 659 /Filter /FlateDecode >> stream xÚÍVM›0½çWp «à5£Þ¶êVí©Rsk*DÜ%NCºûïkcÊ—L¢¤ÛŽñ¼ç™yó4Ÿ'°÷|šOŸ}l„ ôߘo Ûà ðÃGp\dÌ×ÆéÚùsþµŽ{|öÚAbåºâEyø;eIF¬£é iœdÍçèÅ÷Z(ž °ç–ã?te¹i!Dy-cNWÑ6ÞG”G¼¤‰Ž%Å"()j Û!òFÉàBö(µõ°Kb(Q¬ Ò\E^bŸÅ”]x4|•æWÜAÇ>‚ž€/ݱQ$uDEU´¹Ú]okÇB6¿j»w…ྰ_d•S©·#ÍßFKÍ;×_ªŽä†Õ­êzè¦qú F©ódO/iGEg®á_yAi…¢½vØu”QÒz¢÷‘–¨Å’Þ³ó—¼Ó¸~Ûqš 曳ù$ÔZßÐ×+\X÷A˜é NX±mÂÖtåo{¢väj¦–ã4ad­~íw\ &!ê|„»Ž-NrMÖºäÄÉŠB¬fƒƒ÷ÿ¤¦oèÙ)™ ¶ü¥ÖÓ½……nqoX>¦dõbZNNéF>ñ4O‰Ú8,.g£ÜÞ-M[Ï®àÙ›:Q«—LíÄêgj¢©Èã ªÆ*°ß)9A¢¼Lâ’ŠEƒˆ´Õ@öSMcI‡`I# ×2z­6ê¿yÕ1Ví—©‰'ßÍÔâ@òâÀÔ:Oã\N™ªbÇlŒÊ†Vþ! ®©µAè8KÜŲ}¯ ÜÀ÷ܶ;$Â8ÁHJÕí!=ô(Ã)¢"º9eHþ;Ò™y<]†®ÿ\–ì ÷ÕÔ­³ú6! ,%Œ±"ó`'âÓ|ò¦­2 endstream endobj 227 0 obj << /Type /Page /Contents 228 0 R /Resources 226 0 R /MediaBox [0 0 612 792] /Parent 211 0 R >> endobj 229 0 obj << /D [227 0 R /XYZ 132.768 705.06 null] >> endobj 226 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F68 28 0 R /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 232 0 obj << /Length 1238 /Filter /FlateDecode >> stream xÚµWKsã6 ¾çWèhgb.I=(µ·ît;Ûö3õLMG#[´­YYRõH6ýõ ,ÙJ²Î¶'$€À‡‡¸³w¸óË §ïOë›wωXÈÀYïÉ9óEè¾bÒõuêüµˆã¬Éã}ö —+_ú \=$¹]Üâê˜Tq•'Yïu‹gq¶‹wÙÞsŸ/ÿ^ÿêx‚…žë¬„`‘?üYëê$D‘` îÌU>½¥‹îxâO³cÜ>UdRw–ìŠ&Û:µ«ªlÀñ# |÷Á Go^…. ÂÀYIŸÉгJ>î–+—óE{Жhtk‰²^®d-j'mV´»Y ñ•]“?Ù­<Ó Sb?‡¥¿;kðXAÒºÖVî qŸ-Áð”«I1´i€àjâc ]Œ~Ä”ˆ¬½÷\¨³;“¸Ø+Ü2ÿÑÖYª'ì#Uc÷@“.s#‚LV´'Ä@$ jjÝdi§ãmž4 ‚öj¬L¬5‹ÕA1àpùr6ÝË´ËËYa¯Ü¤÷¼ó‘cÞôö3†P.²~…Ån áoìºÜÙ/1ˆs€â™ñ'¤šeRÓýO‡9%ÙÏ\ÅI¿=·Ž™~S‘'ôÑÝEìum7ÆöàÓ÷›s òz¨vÓ> Rt€V_N0&"É|åõà¼=Ùvæt7bž?€8)Ò3MÓG &Æ9íAɸTStôñŸ±‚ðLV +BNNõõF]Ö›`EäHÚj|cea ²e-X4Y±ÏIÖ¸Ô¸RP©1ÌÖá—¯’g‘|ÊgÞB}V=ük\p ÷½3×<ŸH7 ø1lŒããªy#BÅ …òëÃârB¨«N&Œ3 —¥ÉG Š²µ„ ‹¥MT0GV"P, é'L®¹C¨ž¤™K>ÂÖÔØõ@o“ºµ+»þ^ßUÜB-#3]ÐËÅŒoS¾|1Ô‚3©ä7¥ p'!ž‘°ˆ«ï³‡ ç¾9+_jŸ¾`JßÓ?«d«‡âé³Ð íÁz µ ´]|Ûw3`·Ÿ TÜ94žÉ~•ÔÉQ·=wZŽ4ctý´Ðú[»®ØâàôÃUÝ|4›]tó¬‰ 8âñWõÐ ŸmÖx¥+ÀÄKéW̓ RÞµ??*AŸ†Û'ûoˆõŸuRUá“p+ w?]îÊÒ¬zDNØC`hj%4ÐxjÑ€lÀjM#îîìpfzEÿm’&Û¢&Sµ0²#òL`ñAýÛÏÝìjøÌ…ÙØÓ‡ù‘wu )èÍf«91s ëÿv¿Z4Þ ¤0NÕ…×øâ÷Jì¶ýOfpë0üm„Vÿ›Uotùéoqä5.?Óýê¯è³cõÜ[i¬v•¥Žê³ˆŠ| ;XãæO@›6ŒD{ºÔó‘y‘cÈ~ú+…•éÓHlô\^mËcÕµ:¥Z1ÍîfÊÿ¦lãÒNÅ¿èÒZhöj" Ý´ç Ûü¿ˆï»º~¢ª7\p„'E0ì³0¤žç‰ ÓÏ뛯ç¢y5 endstream endobj 231 0 obj << /Type /Page /Contents 232 0 R /Resources 230 0 R /MediaBox [0 0 612 792] /Parent 211 0 R >> endobj 233 0 obj << /D [231 0 R /XYZ 132.768 705.06 null] >> endobj 230 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 236 0 obj << /Length 533 /Filter /FlateDecode >> stream xÚÍUßo›0~Ï_áÇdŽm°ê[·fÒž&·µBNâ6nS`üДÿ~G@'¤ÄÝúäÃø¾ûî¾ó™ 'Dз ¹°Þ†“ùRx(À`…ˆ‚9õ‘à Ì\ŽÂ ú5Õq1s8ãSÌõ:z•i´–q´.³lO8™=„ß‘G±ï¹È¡¼qŽ¢ÊëE©´£Þú´@èÍÅéƒ18œEï ÒÂwÑçKÏïä{ŒÅ\Ð:Ô—­Z¿ÌÆÉôÏV[•Õ`ÕÆ&y•:®íäñägEç_²ÞÊÔN:i?q±{‡µì¿–Bi¥}Ÿw›Á¥Ñé.40æ™Õìüªóç*«<·žŸƒtÓ Èú1É5-8Dn„[r]½§É~–«ª ÝãðèKˆD°ÇšgßcÆ¡»pòPFs endstream endobj 235 0 obj << /Type /Page /Contents 236 0 R /Resources 234 0 R /MediaBox [0 0 612 792] /Parent 239 0 R >> endobj 237 0 obj << /D [235 0 R /XYZ 132.768 705.06 null] >> endobj 238 0 obj << /D [235 0 R /XYZ 133.768 498.406 null] >> endobj 234 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 242 0 obj << /Length 808 /Filter /FlateDecode >> stream xÚ½WM›0½çWøHªÅë F½µêVꥪš[w±à$hH1tÛß16lHHÔ$Û=1˜™ñ{of‡ %"èó„y~˜MnïÂÅ8Yˆf ÄÁ‚JŠ3.Ð,C?¼¼¨§¾`ÂËõzþ˜è¥8.x>7QOJmGrØ¥w& ½iSË¢` ïÛ þŠ…ðc»¼ä÷¯ü±G¡…' ÕUžÖ—Ê;¼ê1A›"/‹+{¢Ïá04ga‹>Kø!…«äC&Çt“l¯PÈјçè0ú¬b )\UŒ7d2VŒëÊð²ñY¨ag ÿ*’ÿWÔÇŸë¤îstcwˆ=M}&ˆ÷¼RõJUö,kÜÂ*]Û—¤šRé-›*ÜJ®Ý—Î[«‡a׬0Ö.{éµJË";ÌŽ þþæמ0¹ÑžÌÕùžÐh/f@Þ†ëüµÊ€è®÷ÎN»¬®Š;Š\¶ë$/æéfû†w““•u@g«¶8Qì-š"­¡Qì[· ?U‹fí<Êʺ¬ê¼XÚ=RPa){ \+à§Ùäç„Â*AqÊ€V„(àa”£t3ùñ@P¡1%zn]7ˆáXÆ`­Ñ÷É·‘«-§K¶© ì¦FCöàÆ´¦ñÔçqô•¥T¶ÅnÍLmU‘9þuç•UU‘¬í!@#à"Ø°D•ÚVJC&NOÆmOÃÓæ#/¶MÝ ÔÁ0n†q0XÐÎÖï)žÊœyùÕ®8×,·„E¼{í™CwŒ¡õùˆ,Ç‘ì|TeGR¦Éz­ärzß)­ŒJ’hx š.O´n6¦M|.BmŒ^Àöm_+³f´âB솭¬½JœQ”µ5ÒUR,UfÚþV$ó§Œxû¼IþŒ”6Ê8CEaeTQ!1ôA!£K¯¥î¹Ã cÌ‚½ñ9ÙÉÃ3ùð/†~„ÿzÌaëð ã_¶ëM endstream endobj 241 0 obj << /Type /Page /Contents 242 0 R /Resources 240 0 R /MediaBox [0 0 612 792] /Parent 239 0 R >> endobj 243 0 obj << /D [241 0 R /XYZ 132.768 705.06 null] >> endobj 240 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 246 0 obj << /Length 546 /Filter /FlateDecode >> stream xÚÍWM›0½çWøUðÚ`Po­ºU{iôÔ­“x#ÚÅ >"í¿¯ù¨ƒYBHµ9eìdÞ<¿™±'ŸW¨ýü¬îî© 0†>¥6v¸q=àÒ ´ ‚=øi`H &¦…BÆÁ²gÓ²)2¾¥]°‚ý“–ôÆïkw뼿N&fi‡Œ\-!s“–"s.9–ï@û­^xFz¾“ ãhbjð,çMeT$®—¬-Ë£]O%µfüXž,TuÛÕkIòF ¹S3÷z&¥­Øã£öfËÔG-§—ÕŒªúž%¿ù®º[&×ÑÅBÒ{_í…i3LÊbf1·Ò\×Hw梌Onû(‹ç´ª¬uc–"‚ï›Õc”åÅà7bFŒ·Órô–ÒUpoF…—/@ïäoúõYmnàx/¯¥WO»núx:™e,Î'_ÀCM|UnUöIÌ"ñV¯Õ8·Œ‰Ã›=¤ ©Ò8aêBCy‹T÷Æh¤33šz¦鿲ºó“½tHÑy4ÃÅ‚–Uÿ¦“y-;ÄJ¯‹ÿ23ióõ íÙÀr(ĸý£Dˆæñ)XýÓóæÝ endstream endobj 245 0 obj << /Type /Page /Contents 246 0 R /Resources 244 0 R /MediaBox [0 0 612 792] /Parent 239 0 R >> endobj 247 0 obj << /D [245 0 R /XYZ 132.768 705.06 null] >> endobj 248 0 obj << /D [245 0 R /XYZ 133.768 667.198 null] >> endobj 244 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F68 28 0 R /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 251 0 obj << /Length 714 /Filter /FlateDecode >> stream xÚÍWM›0½çWp$UšPo•v+õÚܺ"Ä!VÁ 0Ùößwü‘'$ÛÐDÚË2˜ñ›ç™ñ› ²r Y_'H?¿,'O/a`ÅNz¡µÜXBv#+Ä Çó±µ\[?ì$¡m‘ätG¦sìa[¼uŒV,i WKŸúµ2­“uU¦”½"Œ¦?—߬Àu¢À·æ®ëÄØåé¯3PР˜â~–(óË0·pkR–“ûR;$tÿì¹z؉‘™ë*miv„k¬é<&*Öm„OWãryŸÌåezáÃé™ÄÎS6ºßcÄDc¢ ¸o°ÓŽºa£:ã®·ì¿ñq•ÞÓKÉÕ<ò0 õ5óèr h>lÝt,ãÖŠ×ÀNWÕÔÅöNüÑ|äM—qí¡VeÙŸ3x|»!bKÞi£üªF9Jª‚›ZnH‘Šxê#ߦ\YpMA §FèD¼5i]“õ‚4æ•Pb¡Ú¨ Âæât ¬î¸2ûÀÒ£Ò¼U†ê Õè-¢>Ž!^0 ŒÜ‚é‹zÁÓÓ}ðŠÜÅÉ£j RÎÏ-)SĆDòdôÓwb÷=A2Åý°–“ŒÔËwæl¨T„ue¿mMË„ÿ©5°fC¼c-Í™(°pÛЦpi›_؈‹hæâÿ²ÐcÉãKóÃøúLzçð7ΤÁÃ}¸Œœ¦ñ-`L¬Q-Ž=ðEuï%a/*BW«!YEŽÂØÁA¸$P¯p LÿéÆ{ŸŒ&u07R,û(ÈÎéÔÛO¦¾A2kÕ”‘›šª<ã&¦ H0ogbųß(ßV Þ²È‹…³ˆ°Y˜†”jXQ–Ÿè~ð±òý½ ™ˆ~«tÖî ýýÕþç+;ЙuÕ‚ ¨¦rÚ¥EGF«Ø•d$-ÝçãRÁ\ø¹æBuç¾ïD ý3#ÀÆ–çåä/‰óÉ endstream endobj 250 0 obj << /Type /Page /Contents 251 0 R /Resources 249 0 R /MediaBox [0 0 612 792] /Parent 239 0 R >> endobj 252 0 obj << /D [250 0 R /XYZ 132.768 705.06 null] >> endobj 249 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 255 0 obj << /Length 525 /Filter /FlateDecode >> stream xÚÕVKs›0¾ûWè™ ˜Þ:ÓdÚ3·¦Ãà M10<ìôßW²d™LHÜ’“V;Ò·úVûB`¸_ ½~7wÔ! )¦ zØÇУ. äb€(?­8æM·Éof;Kî–IÃㆵJuµâµý+ú!€×…!Ñ—YÑ­×R¾ŽÛ?•’Òµ»¢á«‚¥jW•ÖóB[Ø$yÇq¿ì¬8¾ ßÚR]ñÍÈCºø‰?ÇYà¢ìyÔN¿FÏ¿D¼^¿a3Á;C¿hHo˜LØšì| e &!ÞF–qÃÿÑ7„6}+­)ál Œ.ø©Ç*×Iõ"Ë…®÷Û’üº¢1/çQãÆØO¯qcô?Gl ý¢=r.õ‡lMé8¿gd9Rã^#:“öm¦u6œG¥ðâøæÎz˜x8؃i¬ïEËê†= _âZmÆ”°+ÛR(kµÖ,OZ^j·åm6¸A¬Ì&–`RWyRhmÆjv¼â¶ü3Û%Â)J%ÜÁñ=v–4&Ö ë!ü¼»Ÿ*Å)¤Pm¤FÆ”P‡©t¿žŒ¦ûÆ> \:µæå–Õñ²ìŠô2-|†–ÐUÕe½0“ÆørBêýÿܧ¤ ¾æ èeÝ ¹A‘v! ‚@òéàÊ·hñóÕN endstream endobj 254 0 obj << /Type /Page /Contents 255 0 R /Resources 253 0 R /MediaBox [0 0 612 792] /Parent 239 0 R >> endobj 256 0 obj << /D [254 0 R /XYZ 132.768 705.06 null] >> endobj 253 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 259 0 obj << /Length 649 /Filter /FlateDecode >> stream xÚÕVMs›0½ûWp„N HF2Loi:íÙ·¦Ãȶb˜` ìæßw…„ '1Mø¤Õ²Ú§·+\cm¸Æ·‰«×/óÉíõŒÀ (¦ÆüÁÀv¦”Ì<%Æ|eü4Ã0IX²GnÙSî/ÕæH7Ö¯ùðh#äDŸâiµ9دâMX>åÚƒ”n”X¥"^§|¥vy&´>Nu€-K*~ïô¹Žb{Èñ½i7–Êpo3Ô»0Év¼Y•®Bð >ÝÚåi—«¹íŒžNÒÖ)Œ…eÃò,°ëÀ"â³Q98éJ˜PåySò[²€¾% t ÒÅÿE`Ì¥_cû·K>ÙþôýÛŸ\¶ýÿ‘ ïÕþ·wžßz¸lêPŸ6FÁ*ð÷´ä…àK8©g–—1ë‹”š¬PkÁVÆYª>ïâ2êœð̈%¶ÈÙR{ØE¼à=›ulÉ$-D b¥‚Z9TÕ8Ž˜Pz6ÓV—%‚ qÍúB$õæI­*÷®‹ÿÔ¡´E?:¨8.÷k^(Å>‚#ãïÿšµ÷+Ð@Š‚sÿ®X)oÊ}e qí%Ö >=€1hÔ8ÆžðˆÖZ0/{ ¶×µ@9«½úNc»ìx‘Ëâu<Šž'ÎÀ¤ÝˆçTÓOí 5›êöAM(ê 5Ãí Z=¡Ú'"‹˜R‘',ÕªfHÌðј€oû!%ÔžÁ¡!0àn=…2µr¶Œ””A€Â"Ä<{²àsø‘å€ðh~ëæG@õ5¤MPk: è‚ÛÕ6ëÓT:òѲ°«M”E–ÛCh@qqÉ{/èÂ@p#õ¡ÊÀñ}_ôf£¯óÉ_¤Õ£ endstream endobj 258 0 obj << /Type /Page /Contents 259 0 R /Resources 257 0 R /MediaBox [0 0 612 792] /Parent 239 0 R >> endobj 260 0 obj << /D [258 0 R /XYZ 132.768 705.06 null] >> endobj 257 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 263 0 obj << /Length 798 /Filter /FlateDecode >> stream xÚåVK“›0 ¾ï¯àH: Ë;0½õ±öœ[Ûapˆ§‰a°ÙÌþûÊÈ ˜&»Ùl:m§'d#ÉŸäO’=«²<ëÓwâûnqswŸDVæfIX‹•xžû©•Äs7ckQZ_íÇÔk¬Ë™eêUíHlx‰;UHÕ²Î!¦Aˆ5ª¸€µ *ióÇ*ƒ"Hæ0Åd€°Ê˜íZ¾»ˆKáòºw‡¾ÊµD˼Ê–D ({ô5K/±ø[¿[nkïM˜'š¾À3“ˆÖ×CÔ†ï§iÀ(!0 ‡y:©øÈ‹»ëc¿+šrÁYyÒ-Éb9½Š‘F_†V% BÔ…>™„Çþ—ç}"ÐÍðÑê^ Ó{ fç9ø¾æ~ÿpyt¯Æ´ßg\Žé@'râÿP?rùu¾IcryÏëPz/º÷3Ð'ø½ŸÉð«a›}¨Ÿ~B’!©p1cF2Ž3¡bµ9 ÇôÏ Âol›Ï°~‹£` 7Íj ýâ͸±TO,j Äÿ›½Shçà.%žãœ}½ô]ÌÚû y pÓy¨à]è2hê¬Ð‚½:á`ǧÅÍ?Ü« endstream endobj 267 0 obj << /Type /Page /Contents 268 0 R /Resources 266 0 R /MediaBox [0 0 612 792] /Parent 265 0 R >> endobj 269 0 obj << /D [267 0 R /XYZ 132.768 705.06 null] >> endobj 266 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F68 28 0 R /F48 10 0 R /F64 23 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 272 0 obj << /Length 1061 /Filter /FlateDecode >> stream xÚÍWKsÛ6¾ëWð(uLO>&‡LÛi:é­cÝ⌢ S Rø°“ßŃ”H+v,É^„ÅØýv±ø°ÂÑ}„£?'x4þ6Ÿ¼û˜dQŽò„&Ñ|ž¡”Ó()¢LDóUôyz‡I:û2ÿ«ß÷î#?ÞcðÁ-þ}gfOfDL•ýù6‹©ÀÓM[–#c ?2Æ Ê8‹bJQšos±Ðu¹¸×j *¦v¶”µ.µj¼ê«ƒÙ¢Ø™õmaÝÝa­ËÞ&!(ɱÍFþsdó` $ØMÞ»íñ`¿x ÓVî0ÁìeLâǘÖ@ê1N ÎJ²$dzkŸÖ³˜e|Úl”´Ù·]¤VØU~¬T) gçfY{A{„ßýħ®e-Ë2¨¿¶æwSµòš‡à••–ËRÕ73È_fQ˜›< ¾Ru[6¾Xvk?ÂÒZÕ^Uaíç:ŒE[U€Ç‚±ÓÖ¬”…bÔ jvPè±/ژ䈧g”ù­ÞîKõß”ö [¡|»roM½ÑëF­µCt^‘]»ðOow®ƒøôµ!N^Oÿ§,v{ó<=ƒ©5påF˜zÝEÈÆ–Û×òÛÜ“cÙtÝš"pcù´ØméÂ7é‡Z›ûRùï.ÑAíˆG„ð툙e-¾‡7Rw<§‚úq³+OÒY [Š©÷A1s>¬¢ó`šóé'ãÕ{Y5ºhKYÙx“ê=¹ÍmÓ[täãJÕE¥—–wí’åw¯n*ijp¡Â2G§ð=Ø¢6˜øèvjÓÀ6’ãÎ:$ÎÏÝv+„üYb «mpvì‚ jmF›]b\äØEnu…¬ÃW€êŽ@œ4aÐôÜ Õãèöùäë„€G$â,C$O#Æ¡TxTl'Ÿ¿àhß JÄò,zt+·Ey–ƒTF·“¿C4 i¨`Åf-2gøÔ'tI<×ð™`Ä6ôÙ3åSÏC´Œ_Á³€ó'täÙßënaÁìny‚pN‡n»‡ttû)F9%Ýé߃ À2ýÎt}€/uÛ7Tú^Y†n겯q«UX×ÖjuãÅGÝlvmhEúÈY ËÝÝîþ”Úµß*åcPƒHλ>|8¦•úG– Ÿm`8†žßÀü@æG RÀØ/kÉ ”Üļ[c^ÙÑqB†4þ³¯s¯[ÈõZ›3_±åå%OõÓöáh—¶þAbêu!Ÿ˜¼®¿éuW8ÕƒååyÍΰK ½mö"²ä-°@×®oÝë}ü¿Í™ö¢o<“®¼Ðw7#®–'8‰ˆxî'X‰Ÿ$¥áEßð‡2@ÜËB ÿ-B ±DÀ˜£,˼eŸà~<ÿ­Á endstream endobj 271 0 obj << /Type /Page /Contents 272 0 R /Resources 270 0 R /MediaBox [0 0 612 792] /Parent 265 0 R >> endobj 273 0 obj << /D [271 0 R /XYZ 132.768 705.06 null] >> endobj 270 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F68 28 0 R /F48 10 0 R /F64 23 0 R /F56 15 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 276 0 obj << /Length 758 /Filter /FlateDecode >> stream xÚÝWM›0½ï¯àÕ ,¨·Jݪ=´=äÖ­œÄ*1.6ióï;ÆÄî¦Y­úqb<žyžy¶Çr6rÞ]¡É÷Íâêæ.Íœ<ÈÓ(uk'Œ³à6Žœ4¹ "œ8‹ÒùâÞ£ðÖûºøÐûÝÜÅC'0†‰Îøs]¶´lHåùQ‚Üm[U#çH@â0ÈbìøPf Š‚ɪذ=õü$J\=ZÉV…¤Ê¨^iŒ Ñ/[èïQ‚ôª=ly’ qù6À=!‚ÞáëÎÝØ.®ƒ¸`ôì¸Nˆ ]WËYÍ'|õºó¢KŽnŠÞ^Fž“×ëžMá½299Ê~†ƒ4KGÇp±¥à¢8v×-_)@“f¸ªw¢UvŽ˜d|SYUw(¬ZsÅØ­£hhE4”ñZq/FîÞ‹[W{À²àÜ ÷`TË?™T”ûhL‚b¤ª´-ÎÜï-áŠÝ#ÑRkr¸¤adYQiŒÔ–(3¹ª¹"Œ÷zjÔ?¶u—臔Öäº.'Ps <£Ô}Ï-(‘Ö¹^ÏÅÛm©)Dxi„#¨¼6cb®Òt³v, ]D &mT}SÒü0’<¾  ~‚(íjDˆ¦þÉv&‰,…sԎ슲©E[,U›¬dÁøÞœ²¢d;ùÛ7kÁÄë¹0(ow'7X«Pa´t=,$Ûp½{ÚlÍ à<žáUœôürý8wº ½ w§– þEÜ%ž»ô¬såî??{ð÷4s/qWG οAÔÓ×óâ‹™žÙqýI¢ÎoM0ÆÃÖãÈÕ¬˜‰¾uЃOÆNÓ·Q/j,f­î^]í ]õý„žü)dÀÁ\ÞkEw×e Ÿð†Ê¶²Ê’ ÊKûrû¥c ݉ê›è&ÆF]orþÃŽ/xØï(Ô%«˜:Œ|àÏ ’†µü(²Ìî:4z»¸ú­Ø2 endstream endobj 275 0 obj << /Type /Page /Contents 276 0 R /Resources 274 0 R /MediaBox [0 0 612 792] /Parent 265 0 R >> endobj 277 0 obj << /D [275 0 R /XYZ 132.768 705.06 null] >> endobj 274 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F68 28 0 R /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 280 0 obj << /Length 1286 /Filter /FlateDecode >> stream xÚÕXYoã6~÷¯Ð»°"Ea‹>´è-ÙuŸ6 CŽå¬]µä$»¿¾C‘ºúH¬vÑ“¦8×7ñsç`çç >0þ°˜\½ž @Pá,6Åq"Á}DwkçÃt¹ŒËdy?D3—S>UÿVaß.˨ÒKßÖ–e˜Itƒ9ž}\üêxI9.!(à¦Ux„é ¦À„¼©¹¸‡ÙœÖí­:F—¨“†Å3¨`í¨RâTÓLGÒí”VG êõÕ¹zëÉ^Œ¹’!!…ãR†°ÔÌ~ÙÌ\Êýiõ)Ò“8+v•šŠ©Ò¢ÖS1Ô_k—¨I¾Õã6JÂ*Î3C\jÊ,ÏÜ(-ªÏ3Á§sµ( YCSí¶fj‚2Îî’¨jø”»U'iS#‡ }±ÖÍ\Fðô=¬nã2šëo < ͨժ§ )Þí±„39À ¦L 0-÷f€±&Ázóû¢ŠÓø‹¨OÔØO·{þù&În“ÝÚ¸ú;ðõUœèÓ÷PL¼FÙ.íb")–Û¨Ü%•å€BÀ<d÷QTÏs›slÄáfcÈòÕ_ón=ÎvyQò—£‡0±&B°O}ûŠ6J çúª¶"Δ6Yƒä8‘g»âÍ%¾0ú¿Ê ã¾ üúüáå!þ3jÐy 9,aLêÄ®&;qªœÄ˜.7õbøÔ,JU†$€`4#|z™í¡Ö€ý›áˆc¿ÉÑÐ…EO ·° Ù“þ5ó§B¥4}/s •¢e 0X8C5Á¼Û£X>¨йv7ÃyÃ`Õ9-r0±TóŒµ)ÀlX+/ZÄs$Úì™+ø)”Pƒ5ëV^s(Ê |D:,!nI$Í(Õ¬]hA[£•¸‡DO˜ìŒô4ü¬÷¬ÌBž"}'ØÓÅ%’" ³®¼?-&O”Ø!ñ= ò¸^ _øÎm:ùð;kø‘ŽX ÇzkêPH‰óÇäw˽ø>c5+¬j¡Ia‘)Áï„Œ"ü7m·ùÖ‚<ˆðž¯Ÿcækx³ÁŠD˜CoêQD¨w+ aL$E& ü=¼ò{[˜bä‰ ±’>d¬Œ槱RéBˆQ°bLä{Xí²U¾ËÖÑÚ™ Š[ÌšÆ* Ú… 5&¡õ5Ç°ª —þ¨`ª7Š§ä@Áö<¥»Œ'’ô²/¥DeV—oz–‘ž©Ê¦ÆЖs]*8"J^è<Ž$¡£$:`%€ÕéD7‚L•èúòL=zŽ+#ˆIÚ¯1PÕToË ¢èrFyWÎê‹­K‚0>µ¨ÏÆ0“Á]Hˆ=SÕmÎ’¤$ h[áuK}ÌÄç¦ù`šh#ðúÏwïlaêA˜¶bb#Dǧš™žÜ¥¾*Þ0CÓÄëªäaý ›–]¨kBœªËªÚÕ«ùê[lˆÍY€ÕÓGÃ縞™¾ïÍ€E+Nú*Õ> endobj 281 0 obj << /D [279 0 R /XYZ 132.768 705.06 null] >> endobj 278 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 284 0 obj << /Length 1443 /Filter /FlateDecode >> stream xÚÍXIë6 ¾Ï¯ÈÑ)&~–lÉ2zx@—)Z @¹½WJ¢$Âxƒ—Ù~})Qvlg˼C/±LQäÇM¤,Ž‹`ñÇUàž¿¬¯¾ÜDb‘ø §|±>,>Ù‚³Ø§![¬÷‹oÞ¯EV¶Z®B’xÍÉ,hàe:×Y›!µ¨ð™ÉGŽâ0<‹£^RæÝ- óTŽ<µjÆŠ¶e¸ÞëLåµ.¯¬‘,—ÿ®ÿV„ø s m¾k,+ ˆUmžVµY”²’™jTU›÷Àû°@æ{ÜÔ¹Ui–½Ê8È5 ñ¶KÐÞqè|¯J?y“>¢°gÚ XUs(­¹”Ö\ûtæšõY·o ¼ã©Ž3UæíAïŠc%Ë“Þ9e£3ý$í×Hª•2º¿ÜðahiÄ}& ²H…ñKä'‚v _¿"Ç(?ìªãð CŸLu+?æ"uöH<95•†üßZ™öNd~!ymÓ‰qïP¤ia2ê^çGGrY`2…ÅÞ®Ï\ØSÚFÅ®›Næ,l²Â“•õ¦LM àî®p.eÉÐ¥œúQuxÁ8>ã3•”t<; yƒ2ï t™¶ª¶F‚ß‹Ð% G~›ZqØ1k“±1X 3í˜ûÚë{î† Ùr×ÀQ­û;å3Y?FpXsÂÕ¼ccá Â?ìW'ýP®\AògÎlä¡Ìh½?s¸ÀN(gÎ<[óÌ­Ýáæ~ ÅXôÇœ¬z̹†PÄ~FŒwéHõJUAœ2|Qu µUk V¯fnUÀ „Ú Jï€*›îŒl¦§•£X|‚¾”»€5¤á>ÆdM˜ÏluLÕ¦ìBuÝfjo^XÄ­r›ø€œPצ¨wÒ©Ûĺ †bëžÃÔ3ï™|DÎ^nn|óˆ/e‘>žÔ¾*rˆ1c‘½4æ2³­*[”ÄžÎÊTÁÜH×H·&™½­¬A†„[±ó8ì5-«[éxAH&q [ Ðð*o+ 74“ÕßEót«•êl5‚çª_çý½ž Û·…&Bô„ ôIæG…D[áðܺ¬Èä¾Û)±ª‘n!õÐ6m¥ÀYQ   \¾ÊªÑ»6•Õ2 <‡9çœ9ö_½ÑÁ¢µåD(´¹™t$$€.AéΤ#48îxT9èÚÐ)\D‚LE—LV£Në ×·ºÄ•‹±Îw~ÆÔ&„û"“ÆݨrÜï}/öPâ‹.q Xƒo6ºN7G}*¤±yƒ„Ò»MsCúiDÛ@Í Î\ÅY'zˆ E7òöÑ[Xš;üg´ïe1o#ü4¶³¸Ë@µ9Äiª§½ÚTôtÛ9°u‘¶/ÿWQ½Ø»BÊ/ éå¸^ç‹ckúœ$ãúýÐÔúŽ¤8ÿ¿û¶ý„¼ì¢L–çÀÛæ Ô~S çÃŽ9KƒÕõ™®sç*õP^Y¯‚ÜÜÙ9òS@gäÜ©;ÓÛì©ËìÀ¼[ÓÓ>åø©äö‡ú*}¶E¿dËEñ™·çSašTÖJ@9 >*óߢûoA<ÿoA»J´0IâWñ° ¦¬ÿÔ0¶> endobj 285 0 obj << /D [283 0 R /XYZ 132.768 705.06 null] >> endobj 282 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F68 28 0 R /F56 15 0 R /F59 24 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 288 0 obj << /Length 1633 /Filter /FlateDecode >> stream xÚµXKÛ6¾ûWè¨-j†¢Ð[‹¦HÚè! YæÚÂÊ’«G6ûï;CR²äÈNv×9qH‘3g†‡¢Á. Á z¡ýuµxóV‰ !‰ŠT°º"J‰d:P2&—Áj|×ë¼)Ö»ü³¹[ÊH†Ø;¤G×ùÉ÷ÖÇêÑÔ©¤nz›>ÌNéç»O«÷`D ,#‰ô–ò²õÓÌ—4kAûÅN^ÎÍžÃÕ•yUž¡ÆN/"˜®³³{pŸ/~óVè‘[—š¥U°Œ‰)w¦~«Ç®;gaêšcZ§ÓÖyæúµ9Ö¦1e›¶€Ç¢ð¾ªýš¢ð«ª&oó;€ñùŽÉÐô£8n"ÍÆæ Q1ƒ4°Xf@+¢ÙO¨îÝŒI¶€ã 螯u0IT2Ì!wKNE¸Ú›~wMW´.ÀQÌ —ñ4 t¼ ‹¯aI'ý„¶»EcSš¦5[Y ïYü’U5@:Vå6/wn¨_Ûæ¯0Ç$¹D™ðÈÞ)"㺳¾•”ÄR<Ó»¶d½‹j§Þ¥„GâÜ»O!ÂqmZº¶Â,r©T§Çc]}ÉÖM6€:|wïæµ{¿Ð›™Ã‰qc¥Û¥×‰ŽÛ2¨ÏÌÏØ—¨«œqCkÂÅkwÌf\Á9Ñ,ê§åÛ6ga2™n»1ˆTÚØÎEtð)›1%O>‡ïŸ‚ªÉ©çdtº&ÀnÅGÊâ³Eí ñAýêŽË°N˯Ž7 ÏŠªéj3Ñ52ÞSOt%‚=‡Ó[oû³Y{sÏ&Ï3æ¿Êšg4¯^Jó7€}KÎ?y}BùmOƒí\„èûÛIóÌq|¶²#6%4~™lØ°ƒÜŸ¸Õ²„¤~Ÿ’žLlYÚ1K¸#iÛ_2a §kŽ%˜ž•ßE1‘„Õyx2¾ D\ðWÂß&ÍöörBÀÇo” SîÚ}óCÉ ö¶×hví-þP>xÖ‰’ÒQÐœ.uìµû´u’­&¬„;ñRa¦ôòa‰U(zw^÷ìùƒ™$€ñúùÓ l\ŒŒlÈ!t#+',>»¸\½§„{ãÄ ö_5XÎDÊ.·£f»3~B>{^"ÀEßÄ%ÃP»X7¢òrë„îè¬Z·©¾a7¢2ÿÍûÙGrÏ>JLj& ¬j¦FáTZFÀ) Ûk5Šˆ…eœgA¡Ð³Êxô±±[MmÙ‡3}±FÑ1'o^¤Ÿe?qr½Y,pÍ[â\] !I¤þ7hhR *õƒ†òÒéÏú“bmÌ–³± Ý&èÒbŽGc¢Ô°_ÇBhÂ¥2:KÆÞñ¼w¼«¨Áô¨äÆ]ï«®Øö·'‘>K ©ñÓB”3ÓØlç2 7O3ŽÒÙ*9q¼Å¿ø}µøoÞ¡ "E-§rØGÌd>Ñ` ßP'':x´S¿FeEðÏ⯹÷²âö ¡*Éää8Õ-7± 4È’dj³0_ ^s±b„ëÑý´Tàõw¥wjZ·yÖi}'hˆÓ*ÌïÝG@ðs^B⸱Qð gS&¤}ü¤ÍŸIü¶æ„aÊ̾J¦/®$ÄëÜuôï­$lª®Î»°ã_0˜—xÓ0D(wÝŒ½WÛ'«íøŒÉe¤…G§¸No=$ʘ;bŽ{ƒûÚx©ÉöfÛÙ ÔŸUk°‰“pï_r'¾ë=‰_-gÎðSp©«9ʈ\œá{D¼&_x"‡BU)z-G£DÁüF2Ÿ½œ¤pÛÑ¡~s´{4YëŸq‘NψÁÇ)r¡ïØa>Š‘+ ¡ÿ‘Ò¨Ì}¼bH/÷sÜNï•øR †N÷1 §µ×Ó•›ªƒ<ÞºqÌ[`¤&ßOndÛ™ÁLº EðÅ{Ëç÷PåZé©êœð˜Ûˤ]_®¦~Ž©kûGÄ°cº3׫PWP¾¼ý·öövÅæ&mòlmoÀ¡ätcXx>‚Áù:S]®3‡å^åæ`•<÷âÓu4ß[õ¾ø·æÌé½û"Hs/Ü ;÷ó$œ`äÁ;mwâ °MQ} Ï_¼ Èå߯užÝÛ¥“,á1¢¡¢µvÊ¥˜¬€+áTëW endstream endobj 287 0 obj << /Type /Page /Contents 288 0 R /Resources 286 0 R /MediaBox [0 0 612 792] /Parent 290 0 R >> endobj 289 0 obj << /D [287 0 R /XYZ 132.768 705.06 null] >> endobj 286 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F81 71 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 293 0 obj << /Length 1134 /Filter /FlateDecode >> stream xÚÍWKÛ6¾ûWè(1CR%¡·Ý E/m}Ë-Ë^!²äˆR¶ý÷áPÖÃÎfãlÚ^vÉ™ÑÌÇy›{{o|öÿÍzñúN%^ÊR%•·Þ{"LXJOE1“Aä­wÞ{ÿž‹xùaýëù»×wáø#80¬ð]©Û6¯Šê€Ÿu%"–†Äü#?ÖKùŸñO¾\É@ùºÂËßx‰ü¢jó¦Ò%±LÛtYÛ5N²Þ“Ю>ê¢"Ú=¸®vtituÈ"¦òíƒSp(–²7î¾7yKBuãtäð€¢®Ø¾`iä<ñ5&5ZP‰ð C¤áp1]öàØÃ>z\í#@ˆZ©k_á9Abu¶Fr•>:Áz?c™“Îz%æt]šø‡Žƒ°c“Ð!Vá(Ä¡`Ixð=Ky@7›Â”›CñìFàW¼mµ)²u*’~šÐ6{Ê Œ™…Økã$­­þø„Ö-1Ì?[-«/«™‚›Âú* õe@ƒ¦ÛЃŽútá& õ¨6”ç7zkP¾…ãÃØ—Üq î™°žë ï¥ñÜÊïô¬þÐ詼õBnºèi´¯µ±)´Q§Øoƒw½[̆è* ˜JÔÛÛ{¦þ¾«2œJtÓÛÉ ÂÄÏꊆ‹q"ô¯ŸftktKâð ÓÓœ ;{èh[fMâNÛ=çuC¾»6bOc¬=œ4vJEý”‚(f³Mb²~¬h•X ø/oÙ>~+öíõÕ9B%Šû#Ö á‹‘ éÚU <ís|ç_m£‰±+Žy…6ÄÎê¦ÉÍ©®vˆ„LÖ3Ó¤¢0àËÕ5W¶….K\&ÂÀÿÔéª-À÷2Ç='”àhH&Ýz[憄ì*,²` ð8qã±ÿ®"ÚI7m‘u¥n–!÷qÏÃá Ý•-©)G›ÒÌ‚¦ëc£O§Y¸b·ÕD©ÿHkR \ ­_Þˆ»Òˆ „º)…Ý–ìœ »âMDm‡'ÚàpãŒÕƒðçV0'G¡8{È3¯eâõqk*!sÿ?+ÓMh¾w_ê*(¯˜3í HOÌú¹ÊîÙ½Y’Ò·³JPÓà~Yg6¹Ô°–+áš/ò¡W·P¦§;k‰¨.çå¯\§ílgXÝ*•µÉI-Foˆ?Œ$Ö®#B— N‘!ir6áô  rcÆEÕw'¦_2(CþŽÒ‘¿eÊYÈÓ¾©Ã®Db'½Lžµ˜!ÑI!®dªXÄÓLƒ4°UüËzñi!@÷„'â> =!SŠÈËŽ‹÷¸·&ø‘iâ=ZÑ£'Yš ÈÒûsñ»û1=¶*âŒV•ÑØ÷f%Y ©õf%™JÅÔ,&ú¥Q€®±)œÓ©M¬Ë+q“†»è÷Ššk¦Ýΰu«Ây¡éÛoghœŽ÷‰}]–5VÃã™×oJÓíE’ÅŠU²ÄÁ‹¢‰xæöf¦° endstream endobj 292 0 obj << /Type /Page /Contents 293 0 R /Resources 291 0 R /MediaBox [0 0 612 792] /Parent 290 0 R >> endobj 294 0 obj << /D [292 0 R /XYZ 132.768 705.06 null] >> endobj 291 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F68 28 0 R /F48 10 0 R /F64 23 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 297 0 obj << /Length 796 /Filter /FlateDecode >> stream xÚÅWM›0½ï¯@êªÅkl F­*µU[µ§rëVÈKHb•@ÄÇVí¯ïÛAZ6Õž0ã™Ç›±ýÆ`kgaëË ¾ðü°¾¹ûúV„¢„ÖzkŒQà1+ VˆÐÀZo¬ö+‘'Y³I7 ýVTÙ]V$<‹«#OR´çü\@×óPè 8¿x'u˜|{à•Hâ?*Ókië!Å™ØÖ"ßÝã·¾‡˜O§pkþ«‡ÛÃÐÈY Þ‰Òe ©²^ªnDQèE–K|ÄVL¡ßco5 òûA0¢&Zç¯y–9Ï—Øþ^›&©ѽO÷«lò"á`õ´zu¶ø¯8>¹RcÄv•²ÜË0CbCJKÉœP–±hrQä#.m£1bÓ'6Ú .ƒýÃÂá*~Ä=:^`§¹ãÒˆØ\>¨]¦¯]‹z¯ìyZÕéFYO¥^·E©|6Å —o4 Ïwé­ãú„ÙBîÄd/-Ê«Þ§S‡²Tr»[õ”žíÀ|DŽ½‹Óg±-.š?míÉq½Ì_pØ>6eùÄáÉç+\z¾ùÅ—:aóÔš|†\øÇY­ž+çŠ@ˆ´º´E˜ N¢~çµ…ji}–Ÿ9’½JAYŒì‚"JØp‘úâH)¨g ]VÞ +éÚÔÊÜÆ€AÅx=IcÛ¤±©4¢Ða¼š 3<ø€ÅTç8q¢+» §Lc‚Á4#âw+ÖŸ.J±ê¦fS˜hÉ™x5ÛRS½•²tµ‘Žš‚>‡C{=¹¸#îzO,/‡éÔòBS;¦%ì¨Ã¨ÕAê£Zô²2Í|5­¹èGÓðMð}&v¹l‚Š /ù!…Î_]¿)Vi}ÖyÀsÉ n¿\-ì'èÞ^þy÷¯÷‡b“f—´p&·aVÏÎç÷_Y|=¸Â" ïWÈíÒþ"ŒÀ¶Œcú/,ŸÖ7ÿáÇ endstream endobj 296 0 obj << /Type /Page /Contents 297 0 R /Resources 295 0 R /MediaBox [0 0 612 792] /Parent 290 0 R >> endobj 298 0 obj << /D [296 0 R /XYZ 132.768 705.06 null] >> endobj 295 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F68 28 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 301 0 obj << /Length 650 /Filter /FlateDecode >> stream xÚåVKs›0¾ûWèˆ;¶¢<=õ•Îôì[ad£ØLy ’=Í¿¯„À64Øé¡'VýVß·»Blß'¨þ~^Nîî=,àÂ#X>‚d8ó!¡ ,#ðÓ ÃX&á6>ˆéœæ˜QÊ ;øPBžÄÛ,,xÉS¹B M–?€‹aàR0Ç.X Nñ_pÚšU®èe/YðhüòH$:.þh¼ïîÝàŒÖ< Ð <0'.°ü²ãÙV{Ƶ«¼ŒDY›k5¡D){6lã©>ÉaŠ™#23å:R¨Ø~K‘pç™Éýf×€pu·Bˆ”RµÄðìÙÏB©ï¤\ JížKagõ+)ZƇR¬+¤J¶ň1#Í.¨Eö‰³ÜÅÒFIù“gSiÎ9yb©7çÍUæÑ~cY›%#œYfûoUòŠâSºÁE±œ˜ê3PŒœOIbäAé@N&Dd-•ÛïZÔ+z_McåkQZõ¡Mj"ë/©#¯ö/|Z Y—Z ¯q*2Yçiy²¸Ø×™>Ç8‹ž”¦MÎʳ«éÖ\Æ›°ª©cëçBEa¿¡ù.a×Úœu•ÈöéÉMÇ ÕSQkfͽVb›™l˜QvlJ0ï?Q›h›â(r'¨g¬Ø;³ê¸3YycîËwc5\”q&E©nU—c¸¹ì{¥"ÞKŠ´³}œ»‚"'äõU³?R‘¿êç1* ´´7–þÍZ} áuû5 ßi~ÿðßIöª`û*T–›~P³x»v¾`ÆŠ=t½ü‡b?¿»Þ.ð¸ÇÈ«•í{²²’€ýø†Om@Ö~ä~[Nþ¡èû endstream endobj 300 0 obj << /Type /Page /Contents 301 0 R /Resources 299 0 R /MediaBox [0 0 612 792] /Parent 290 0 R >> endobj 302 0 obj << /D [300 0 R /XYZ 132.768 705.06 null] >> endobj 299 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 305 0 obj << /Length 1113 /Filter /FlateDecode >> stream xÚÅWKÛ6¾ûWè(1Ç(‰èm&M/EQß’À %Ù+T¢\QÚíþû~ÈÖn¼^/z±È™á¼ù ƒM€ƒ/3ì¿w‹Ù§ÏI$š‹u@cŠXB‚„§ˆ2,Šà[Xª¡‰æœò°Òõ²¨šeÿ´-Ew¹Ý}tÛAéj£ÊâÀܶúcôcñ;œ‚÷JÇ’ê;æä+7 Êb6–^.éMõPiäÖm>øݲiJãŸmØ*{^W/ÿžÔ«I_JB¡ûç“`˜gIHþ‡Ì~úgG¥žg %YÌ)C‚¸£_ûhNÓ ¼qßA²®ŸÜFµž+‹‡JËU]ºmߺoQueÞï¤ó{©6VB„ý½5u©ÔvðŠÚ·hÆQ·×[™ûíÚÛôœ²Ÿ Ù(b)óéÊZöU«<‚a±ñ„åøM>˜ŸÒ­“f¡dãWR'¼Jõe§dí4ê¾ò~è<Óø:’¶q )‡k#¨Íci~]ãjÍ’Ì+ˆãP®Žüt¤õ r› Š‡¹TŽ¾òüA—ë¡vkS#$‹Â”5øè6[ÙA¤öf¥ÖCS©k–.œô-t«šýº˜ý3#ÀÅ Hƒ|@×!A³ ofß~à &ĘȂG+Ú‰LÀªþšý9C$MÁ³ªR*œQ_û£"FZ71* æmʮҹUjîLv £”&°c«¶2zâÎ2†²”:ç´çy©H2ÉNf²R’†qzÿø/’±ÿMÏŒ2ÂÍø-Œ2ˆ‘¦ñE¥b1CØ—õ­fãaB¯«• jÐÅ¢¨‡ÁââøP†R»þÐwL’ Í´©ØÉäU©zäU%jž  }N3ÄIæä ŠáÑœ`ŒÃ»JÉîÉùóǶì¤C–s“æþg0.œŽ…Å'ÂÂþ1"€{f`ÕE$ 7CiÇ·ˆhXn»òæ,kgÎIØ´XºªŸ<©43ÌšiÝ·®xéd*å%î=Að>¿ CÇ@Z^º1OÃ"ˆSS„·4JÌ¢ o4qægkÞÿ;‘XÂQ"ÈÎ/7Ï ¢”Œ1ׄûjåC×Ažk¿•µn}Ù¬™Uï)÷2¢xŸ5ºP¶í¨3+3™á1²*;·o×~Ãú0(}6j À0¸ÎÍ;©«|ª£ö¯NHÖ(05à.÷ô}zrd”4X±ýÍújF².íP:²7*Ž={¦^—+ÇÒÌœÃsO[V;£Kwÿ_ýàÌ(¼""Ô§Ÿg£ðîùŽÔ4 endstream endobj 304 0 obj << /Type /Page /Contents 305 0 R /Resources 303 0 R /MediaBox [0 0 612 792] /Parent 290 0 R >> endobj 306 0 obj << /D [304 0 R /XYZ 132.768 705.06 null] >> endobj 307 0 obj << /D [304 0 R /XYZ 133.768 509.395 null] >> endobj 308 0 obj << /D [304 0 R /XYZ 133.768 431.283 null] >> endobj 303 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R /F56 15 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 311 0 obj << /Length 671 /Filter /FlateDecode >> stream xÚÍVM›0½ó+|„jñúPo•šJ½UMO»«ˆ’¢ò±Ò¨ÿ¾ƒ Kœn²P©'Æff<ÏoA;DÐ'‹tÏKë~!=âP2‰–[ÄÁ‚H 3.Ð2Föj•ÖÙj—þJW0a·«uT§›U=ë­wÆÞ*-š¤ª“M³ª¢b—<Aœ§ågäQx¹”âPÙ›èÇ…ìk0ïTrmp4}0˜P}¯¸çk˜„plÔ'ÇE³ èL\&gÏQåõh`CÊ1l <½;'–¸Ì£´˜‹¼Ë´–»dÚ ÝÊÉì8nCpýœaSd_¤eq‚äeïö;M¿ÃXÚO£éZˆÓZïm„òA8 6:’>3zhÑû…ý‘Ý€cHä2ŽCJuÖåwHÇ|bCõek;ªØ»}žpmL†vSê7 ¸CfëãÒúiQ(‘ Š˜Ï1°œ1,C´É­‡'‚bx 0tPž9b8 B°2ôÕúòšhð%ˆ¦2yaW¢þš¿ˆ{˜È6rÛî‹M×QëJ‹$‰;S ÖÔH?TÞ¤©Ò^·Ü©Ÿb{º;¨ ¸=Ìè2h 츜ùö¡Â.+R]2J°Ôžjºk×¾:<Œ“a­º³5¶e˜¤}yÊ줵ö*‹ìwç“e¥pHâ×z'ݶn¤¯‘ 5þE6ìèôúžÄÉ= ÒW ï;¿C’eXµE/V£óÀäí0À“u%=êŸÄäêŽÛomŸÞG'7P?vªÅÏOóð90džž§‰:Ì”‰cu˜}»ôå-˜.jKñïµ¥ÉÓ ]+§è4õ26žÆÆ%é"FK—s#'̆\ÎqàsV„F|÷ÿìƒó endstream endobj 310 0 obj << /Type /Page /Contents 311 0 R /Resources 309 0 R /MediaBox [0 0 612 792] /Parent 290 0 R >> endobj 312 0 obj << /D [310 0 R /XYZ 132.768 705.06 null] >> endobj 309 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 315 0 obj << /Length 470 /Filter /FlateDecode >> stream xÚÅWQo‚0~÷WôQ—QÛB Íž¶d.Ùëx› )È ™¢\²¿"S((BÁìÉó¼û®_ïë]D` x¡¿Ï'w41 pÈaÀý!H±µ!1)pà}ìyQ²ò–Ñw81(¡ãìÛ>Ž6±—„iîºS|¹5GM>ÜW`aèX&00†œ*˜©øjÀÜKß ^6‘gÀãò)Î1[‹m™ôõbV`î¥YaƺeÌNÝ”­tJ­4¸ æÀ &ä8GŸ#lWr¬rŽ´LSþp~Ë®’P4^DYÎtFyY)rÛ:ÆJ`3R𨌱1á.ŒƒP)_:zY…˜@‡åäç:¥ª/Ó]²÷ÓÒÎ * êšc-ÓtĦÊ,˜6…ª.®¶iÃR𛵈â~L4z!ËËc'âe8$ z;̓Y[]-f3ûïÙÜ“\ãx¦ºãyhrªãÑÞ­}¤y• Þk»¿vûUgÁ>n·«(©¬Ýf+oâÊVôE•pòyBÖüé|¹UL_š­/7O.:ãKSC=õmßÀ¥íÎÖ[“ƒe½®œ›ª½¦–¯js_Ϋ2±.= ,ÿz`B¥¾9t'/ÉÔ”gwô ÿ;¥O endstream endobj 314 0 obj << /Type /Page /Contents 315 0 R /Resources 313 0 R /MediaBox [0 0 612 792] /Parent 317 0 R >> endobj 316 0 obj << /D [314 0 R /XYZ 132.768 705.06 null] >> endobj 313 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F68 28 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 320 0 obj << /Length 844 /Filter /FlateDecode >> stream xÚÍWKsÓ0¾çWè˜0µÐêáÇpè 0p¡ ¹µ;©!qŒ}ü{Ö–í؉&©K9EZí~Ÿ>íj­0²$Œ|±ê÷ýtôö“)‰C“›dº \r*L ¦²(ŠL}r=vÝ0]¹™÷+˜Š«q1›yi8w×^¬Mof8„‹Éíô+"ÔQ'Fó¦à]‰`H ¶}8ËðþNÇæzq¼zr/ZˆÍJèÃȯ¦Ï<¬¯«l«É߬½0:YÔî$5°sÒ”Gá&ÚÓØž'i:?IY_ôy:¯öþç4§è%³Ôt3lev«•Ž &8Äà‚:þ†µ$ÛA8Jç«$×Þ2è´ØÚ³>‰’ìo + ²JJßtüܸڄ»ÎWYèz‹Å™½lK:Ãa÷ðÍ#UUÓ6µuFem¹«Ù²¶ {zÔëé‰^FÒ‘µ)«ðø,Yûm¬‘¥Ûó3¤uºÓ¿ÍÖnÿè;×n¯Nv_ïBýNß2llv¶Ùé?Ó» E0a²ñ"æn$-¦0žoÖqžUkÙ]5¨EëÙf¡}›åe8Á=ÜO@ƒH›Êr-í\ê, úÜô8ü 铬¡•ÜƒVªÙ1&ã/‘öÜ`L¢=&PûéÎíZ.Î#ªISÐqaªãU¾\¾v £l£ÍM¬V„?0úÊ$'aœiX­·Q!A}\Ð:Âm¡mÕbyN(L:0þ6û̳tÇï)Råîë\˜TbÞYS³å§éãtô{he°0Jà,‡rn“ùzt}ˈ‹¨† Ç&¥ëšpêØŽVäÇè{ÏŸ ’J%ãŽ&-k²‡/(„VJ ²ËZÜýª3Ó|®½Èï93C0TöÞuß×–Ä0d6ñÏ%ž£,«ÜZŪ$z8mT‰¯“!8Þå;*ŽÇf©!9j »Ëz0UBñ&U ^®ð–Åš7²˜â…Ñl‡šŠ*¤­Bµ&²U1¸O¨./{è‹QS(ôè³,lío¹:ãÝøÁK² ½H‹ºJ6~>Ï|Eö=?JŽúóth›ÀÔdAí:a&tB°Vþ.ý]— endstream endobj 319 0 obj << /Type /Page /Contents 320 0 R /Resources 318 0 R /MediaBox [0 0 612 792] /Parent 317 0 R >> endobj 321 0 obj << /D [319 0 R /XYZ 132.768 705.06 null] >> endobj 318 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F68 28 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 324 0 obj << /Length 570 /Filter /FlateDecode >> stream xÚÕWM›0½çWp$Õâ5¼F½UêVê™[S!C ‹š`fó÷ë¯d’ìݯK<3æ=ûyÆÖZ; Z?VЌߢÕí=ö­„a+Ê-ä#àa×ÂÁ@^`E[ë—ÇE³9ý“­¶ôšŒkç‹°Ü›õï觠t\„ÁKah÷«‚:¾ ˆïìŠÇA[¬ìÐôbqU³m›rÁ íeÖþ¶†¬í$Qcè‹Úðem mŠ4>Ъ£í‹·ì@‹r¶Ä!y"Ì—KCÏIßu‰5-wÙgP8;‰Ÿ;{}Uÿ¡(Ÿ'ééÁæ$é_!ËJïUu<ûöÕœcK“3$o'iCÏIÕu‰ËÒö† 'ݪ×(Cüneø³s{ï“NÛã`‚-yBÃ=:±M¶vûQþ˜PÞ–) 4Ò½³Sv¨Znæø —Ö¬i´iÎ@ÍòÁ‡»bNü¥‰Â@Y­Qu¶§jI ü0PÛ9 }éÖßÐr« uOLP./Gµ¼šÌšvÏÕ¬[›è±¦U•¼8<ƒN2~Ìä.¥su±‘Í)å4Ê…Q”âܤ"Ï…v´&Ðfz‚%\0k›êaƒ·Ð£\X¾Ž™s½Ñžh¼ü9Ûï™<ÜcQîL¨“:µƒ†gt ävÏñitǧÊE> î³=@¿I=Çâ\äqa#ðDLêTÇÐså¾´Å¢ÞëÏÄõ^MIú¸-i§H{oY@"Hi!š£â{´ú Ô endstream endobj 323 0 obj << /Type /Page /Contents 324 0 R /Resources 322 0 R /MediaBox [0 0 612 792] /Parent 317 0 R >> endobj 325 0 obj << /D [323 0 R /XYZ 132.768 705.06 null] >> endobj 322 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 328 0 obj << /Length 441 /Filter /FlateDecode >> stream xÚÍ–Ïoƒ Çïý+8¶Ke€b1»-Ù–ì:oëb¨µYý‘ªËþü1í¬P»*µ[Oò}ðá=Þ5@ài„vß{wtûh[ÀŽMlà®ARÌ€Mg˜¸Kð:ö¼0Ûxëð#˜”Ðñw/âiÕ¹Ùõ¼Õ†çÞ2‰x{é6Y~>GMÞÜg`aÈ,C‡JVsþÞjU´ð´Ô¢ž2"VÅw¥Ô8¾n'š-×ÁE`ì Âq˜Ä R=6˜º@ÑËYmjÌÏB_Á¬Ç*L]@Õô¢—ÛÔåuÜ­:‡ˆÂ ÄpLhcÄ‚ ïNiŽðLYM‘h™¦øQN~ £tÎ">ÏE¨HÂƪʹõsÄ„Œ™,ÈbFŒ‰¹™n¬ìM.D³óáªb?‰óà3×™©IÓ¶î~v½Û®¼7k÷ݬ—ò-²ÞhArœÌ´2M=¦NªÉ¢“*Ö÷Ði2]o(¹zðšqÆý—³½v©ÐÅÃbñÛý—’úT³Œ ½Y݈jA“ÇŽpTàkãèïò•øïÇ ”Aˆ¨ùdŒU–mSR<¸£/#ç½P endstream endobj 327 0 obj << /Type /Page /Contents 328 0 R /Resources 326 0 R /MediaBox [0 0 612 792] /Parent 317 0 R >> endobj 329 0 obj << /D [327 0 R /XYZ 132.768 705.06 null] >> endobj 326 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F68 28 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 332 0 obj << /Length 1382 /Filter /FlateDecode >> stream xÚåWKÛ6¾ï¯ÐQ¬‰’( =µ@¤X´—Í©- Ʀ×Dõp%yùõá²äÈÞºm^,z8ü8ïFÁm/"÷ýáæâý‘+ÁÍ&àQIJX"ËO²àfü.—¦+—·æN_.2ž…øo_›¦^VjG¤wðvýoQ]þ~óSÆL¦I°ˆcVdÈ^ýqrË+‹½üðª©{ý€BÄßYŒÅi1^ªÙr§ZUuo  8}¸Ó½;«·QkÝTÊÔÿ†ßÊíßL»VÕ·úŸõÙYåÞHå(ó2aBŠ`ÁVÄ„y³0žÄ!*€«(lvºU=ÀÒF«û}[w´§ˆfï³¼­g*‡#QØoUOô­ê<ÉÝÓ©JÉ@ú´^®º7ýöÀ>ã^›r—q>~Ëᓸ x$˜z·ï‰f…D ‰/$[Æ÷5"=Òž©v¥YwBÿ¹W¥éý^MTwIq$¹½¶›·RkÔUä! í¯àBZPÜ!áÕݾì¯àOÎÃû­)ÝQU–þ„ËèΟUMµŽ»Õë}½Vµ£;‹ÚnωÙ7 „ôF”òX?زø¸huÕ .wø£×`ÊÂî“c[©Îñ5‚²ñI$ðGçÐê5ízt vÊ/AAÑ8“ãØÌ"4»ýuÓ´•^iÑíÔJ3J€¥OYåð ò†À¯õƒY5·­ÚmÍŠ~Ùõ¦2_éÊo3 ¥“Stþ£¹äÞ2(`QØ|Ö„/ª3+LM"atZÀIsÌ%Ke ¸pà™\Š7æÜó 4ø·PqÊD,<Û—y,±‚±œtÖC#¾ê¶Y¬M¥ë,¡ "“( ©šÏÝÉárà›Ó#c¢t½ÂDŠ]ö¦)Ëíyoê[ªÔ\¦,cO‚w³¯mœb$`6L/E4ªVRú|±lu¢wž®‰\RžN¢ö+S›j_-yHT#âæ€4“aºÔ`: ÎE8k²4¯>áøœé3Ÿ0)ó×8dÛXõ`ÑoÌe\Þ¡T¹×N~«¬eq vXÑX3ü†µ3œê sºÍ㜔2(/†‘ÁÃO›ùh—r@ÓÕ®œë€ Ø ÁÄ9Æö,¬›¹Œä B>ˆðóçëëSÖœ†r†æ©ç‹Ä³¾;%i’B]ؼˆªëÌme.‰†7]ŸËœÙqçÞNZ ~"®±_q{6.9ê–gçý´H¸dŸÖj %™c3[mçB>†Ò™?Yì²ìYÅ.-^ó  )°¨úúteØ•¸ínHnÀ^¥Ë‡Ÿ56.^ø.®ßYö }‡½ƒùm9+ ²²£j6Iµ,r6„ÙÐ. 41L;aÝÔ Š)û—ê8,šÙ¤)"&‹ôé`„Š’O‚!í4âDjæÜ›°4Í_–àÀ1<ý÷Z7g‘€`ã`¸XžžØS1þ³ýiø¶ê*—¥~¨^ñ€8FÛ³#LJÁ,gΞ҇<õŠGÌsL¢æM"þ&ùâcòŒ¾¢åy¾·ÐX¼VãSîÿïi|Ü„„dyzTŽgrAoXøÏä@:1“ hOv)~ÛÏu)ΟեÆX1öÁýKñx4&Òh FEð9ûHkz¿OT§0',(vâ4c¼8ò5ÎtEî¯Ï“Ù!öC2ðض…ÄaH†?¶!æ‰Gâã±ÈóãGÎYüôŒFÙs¬Ÿd/6>yŽ3€µSã›L&Hzöº6k¿~ Ȭ±í”0îÜ >+­YF­Û=]N¿a‡ŽÄB@GNAïEê"0ýxsñZÞü endstream endobj 331 0 obj << /Type /Page /Contents 332 0 R /Resources 330 0 R /MediaBox [0 0 612 792] /Parent 317 0 R >> endobj 333 0 obj << /D [331 0 R /XYZ 132.768 705.06 null] >> endobj 334 0 obj << /D [331 0 R /XYZ 133.768 418.695 null] >> endobj 330 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 337 0 obj << /Length 1140 /Filter /FlateDecode >> stream xÚÕWKÛ6¾ï¯ÐÑVŒø‰Þ 4AŠ '÷ÔWÖz…êUKNvÿ}‡¤–—^ÛŠ‹¦' ‡ÔÇáp£`DÁÇ»èÄ÷çÕÝû‚ )AD°z pÌ‘À8kõ_p@ú"€àŸ,Jxær«ôóaÕ9/‰ÓöŒ@·4d†c¾×}™Uå‘9ƒnn ƒîÿ-ÛN9LÌ´íý&r0ÅŒ!‰"Ø~Ì–ðß×%æ‹´\†D’…6º0¶Ø@5xnf—溅 ø$ÁUŒpŒ!û-j¡kX"±~Á¯v(Ìãýª?Tw„ª³P—g½vãMUèÌg¯ ˆÙÀ2Ÿ½P³Ô°É= *¼hŸRýXåyeœ÷-+·j_&Æ?‹ ÂRLMC#©Šzß ̬•˜Ž~µÊöI·N‚³7nEª“'§Kó´HËÖ©«GŸÿd„bAÎœ-F2Výš¶ê·NpgÊ;#á Ññœ%Õv§ë§,qK •²b_¸£b%‘`xzT¸ÝP Çx¶+íL¶_·%ýš^m’Þ¥Ð4U’é6ÝtKªã¥.¦`Ní½x"9Š˜:©1Rê‚H¥HQuu¨"ç3Ja—è(É?ùnT!9$DZÔí‹o‰äЙqgLeÕú|ÀăݿýþùóY»ïܚשàÓ1šÞ²‘2©W6ÂýfÛÒÞnìª(mIs;Ú[†™¤*[Hæf°Ä©âÔÞ;Ç’!:ºÐŸ!FdÂnwJ)üä¾Æ£V0·m…¶›Ñ¥É“7­2#¿UL &å™HT(Šä%5Sq6#CÎÕâSé̬À©;'~[âxÓÀÅSÞU3a;Ž‰Meë˜s/ˆÆGU +Á!á‘K~øºËa—6û¼u²«Ýn•ç„8B‚ðó1F¡°ÑIŒdú÷^çÝÞ•QÄX|M;°IüŠùÁ†X`+Úõ\ršØh:b˜ [×z×f:ÿ>¦9‚›È¸·Ñõ4ÜòÆ¿§(¡»©„é—Ì~¼åñ?qÉ âc´^°âÛÄü‡:ñŒ·Îtâ\œÛ )ÁÇ\ÜÌ %~Rp€Ü0NÎÒp©.¢áòúŽbÚU]» ¯X²U ,Ùž­ÉŠ:qS»´ÝïJ§×“s‚ë9 Ž§7 ³µ£ß±êI²‘Û|bÙ35v$ý½FcuÖL¨‹^3xÖs¬³T7V£é>.G›pq‚â„y¸¸ˆ¸8 l;†¯Îs'p)!§Äf­5æë(Ù¸hØÒ£Mt“n {Ò`Tý[§±Œäá(¹ªºíì„–ÝwñîíÔÑ„Úp#4µNÒ‹úq_$³îšÖ3³æøZÎ â ¹ÁM*ôÌÆ<©Ì73dtÌAPLÙ¼^(ï,àãvÁ'¿ü²ºûJ©^ endstream endobj 336 0 obj << /Type /Page /Contents 337 0 R /Resources 335 0 R /MediaBox [0 0 612 792] /Parent 317 0 R >> endobj 338 0 obj << /D [336 0 R /XYZ 132.768 705.06 null] >> endobj 335 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 341 0 obj << /Length 1080 /Filter /FlateDecode >> stream xÚíXKoÛ8¾ûWð(Ë·HôP ÀvÅ^ŠúÖ†bÓ©°²¤JrâþûE)–ÅyX)Šb/E g¾ùf†š kDÐß3Ò>?,fo?* 6Š)´Ø F#,¤@JF˜q‰kô%X.“*]ÖñvJ&÷¶ ÿòF—DÒwó¯‹P((Ö‚£Rlä`ýurÓ[¿Ë’<ëiÌ-S»ß&¨%Ö‡•A+ݽ¶x?-¶·…îE!TG‚¡Rª½ÒÅ7ÐÆ 6yšæsÐq›d×nŠ›]¶ªAå%J[ïÊ̪¿Ù¤ì¦«]Zûé$ósõAk¹õŸòŸ‰ýk‘Ø•õæªVv j’0öÈ¥é!ç@e²«Á|I¨ñOCn™N&³>:œ ÌI4dÒΩ ö ¯À=gŽúÏÖz½ª¯W)Lìï[|ª'!°Ñ´xÿ~›ñ~I/À*UÁÕœ‘`ײ—ÖcÉ¿²#†öû.qTݸŸ8µY+_çþ{Ë6 VyéTР*òl=G =7XÆÔ¸7 ™$.VîqWÉÊ+[ûA^úgiÓØéÆNåÝÐ=ö.«û 8V*Åí²I†e¼Ù´‰Ý &C¬N´ÁÖ«îÁÚñrR—Ó¶ÖêÕËJýÙøÖe—u§O÷C>æG,ï /Æ {Ï:×^±¯~Þ¹ìÃkš,¿”5ý«æXiíƒÆ²k(ºÁB‚“ª®Fº/WÖú%^*äi;.¬í%!,³kÿš»ñÆýØÒÏTÖw`ÍTœºIØÔn}7õÂVÐÖ ’d«t×4`¾\†|s×.‚ÿMëô×bö}æf ¢ˆG\ \aB%Zmg_¾´†PϘnÑ-bÐ{º®7EŸgŸFî^º<Å#P%±¦m…ÜÄéMTbuv1‚]aE'‘ F01b ä‚qL4"OÖcÀ ê\àRÁEÁL\ÌŒw•óÊCUĽw€ßwJà^B¨™ÀDã•@½€êƒh`¶±YÜŽ˜TP~DNaRE8|hò¥¤ ,‰8nF8–‘š8# K%‡ÀWpÛªË8Íá>~É ÓÄcøùiü‘Á ¬M€_3| ßßøîoKÄ€j3QN­‡VÝ!úÒhŸf‹ u4[\™¦~n­1| ܆bÎÙQyUõÈFH"¬Ø\ Ø—›í™´û¢!‹1Ø)ïJ"ÎÖ#tQ…!ëOoâJbcØØ•nþÔy_Z®)LB°™<ª‰,_Û1¾6Œu\ ÿ|‰@‹g>œX˜öRj >üí¥§Ö endstream endobj 340 0 obj << /Type /Page /Contents 341 0 R /Resources 339 0 R /MediaBox [0 0 612 792] /Parent 344 0 R >> endobj 342 0 obj << /D [340 0 R /XYZ 132.768 705.06 null] >> endobj 343 0 obj << /D [340 0 R /XYZ 133.768 166.78 null] >> endobj 339 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R /F68 28 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 347 0 obj << /Length 985 /Filter /FlateDecode >> stream xÚÅXOÛ(¿çSXÚK2Ê0€ƒºÚÃJÛ­ª^V›[[E®M2V;;ÍôÛ÷ap\;™IÜí‰~¼ÿ<~ëO°ÿ\L^3(¤Áb0D‘à¢!ið~úFïôìžJ<=¸±Ž?ÏžºYžUueÉr5û¸xûðZ°¡R E ±‘–U¹á™üµ˜ü7!°ŠÐP 0d^z“ÍäýG¤ðñm€Q¨dphX7EJ* òàßÉ?ÖO  iè»PéÚæ{Ë‘P¤5̹·caG=#|úo¶¹F³{†ñôÝw“–ë“‹E²Óq­Ó¹™ÉiRn37‰¦›2Í>`LujL î %ˆ2AŠ;Cã"nŽ§«ÖŽÜWY±¶dý¨Ýç2ÏËåÓÃñÛj_$uVjâ‹;É$YÊa‰:å¿eE’ïSPÁAòï©“[ôøGc1öM].a¹Î¾8~3ƒ8/Í»rwº´\íÊ™}À7òŽ&ü êËêäé6“W6~ÞvqM1D19kaOê'·¨¹“\8ÅIW† jæë3BôYëí @CŽlVVTzwU¹î‹*[¦ÆÍl[Vs¯ÈÄmõp¥—qšŽãâàyùß\Iwå¶ßq»/~òVÙn ­cC\ÙBÊðxŽ³"ÕOW$Κ3n(’¸#wä%þt7Ó±sWŽÕ?z|:¦Ñh¸K6¦ô‰¡º¥“Ï_ÚfÝÆO®|¾”™+õ»=4H£u>|=õpŸ ð wç"Õú»kãu¢… $•ò/ý^> endobj 348 0 obj << /D [346 0 R /XYZ 132.768 705.06 null] >> endobj 345 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 351 0 obj << /Length 1440 /Filter /FlateDecode >> stream xÚ½XßoÛ6~÷_!`/v³ü- lÀ:`؆{i C‘iG‹,¹’ì4ýëwGR²åÐɺ¸}}$ïŽÇïî;šFëˆF¿N¨ÿþ|3yóVË(%©æ:ºYEœÅD*i.Tt³ŒÞM÷u±œÍWÓ«U]–õC»Øµ¦™}¸ù ÔÌ#©òK‹ªs+ßSE¯V|‹¢-]voÜ4þj_{eÊk7:²„p÷uÈ̱GÕ¢_ú=.}óV&Gšë„Ä’GsΈètsnÀ¯éjWå]QWnã(J¡c0ìÎÕ–¸fòËÍäã„”F,âœÂš$ÒŒ–Fùfòî–0‘&у]¹‰8I“Feô×äÏPع BiЇL™³‰ñyjS¤DKu ›’-äØfY´!£Z¦Ä%Œê˜0¸Ž‘ÑUݘ,¿{jWP aá°+hL„d'ÎóbXJ(ŒüÅçYY¶xœT:¬ZU!E‚Ä©ê—È,äìIa$§õÊIºm×ÔÕº|t¿òºš[ìÏ9ÁiŸÚ©«LÞÈžjX¹ÙÖ•©ºÇV1Ê­b¬›l{çdEwç„Yë$û¯š®Èßï÷é©)ͦW«Qm Z*XÊ?'¡x'ñŠ¬òŽgÎÞ²hÜiÜiMRªÇ o–kô)æÓUSop$Ç ~?|‹)IÙpG·¿ ®rp««…õŠ˜Äñ 7;£WµÃ-Péq@@C?ÿž2°’f!íSÄÖ],¥™¯•·XòB¶)‰é°±1Ý®©BAI¿,¤H K”qì*'óâ6ËïCš¡Z@™:q=T›1+é€lu@ÇSL‚âçó Š€nïê]‰8SÔáL‘—¢ß2g/jÅ,F¦iêf¦ÄÅ‚6„ÅÉø ¿C.´nyžù}·Æ}· 0¥ñîíÚ¢ZÛêGOúI²‘ÃuÌeßU^î–žW¢zƒIHî~ §ãáu±?âaçKãùôHâ¾ÈÓ T‰à³:%# D- xLðcÅÛëóݳ5Ö ßèm÷ôÐ)àCyh,D2áÑL€¯âÙœQJ§ìʮؖ>ðÏR>ÍÊ }K@ÓòS1L%ží À_GRSB¡L¼‚µ°¥‚º)UjÑonð<³)p%W1›Y296»ÏÊPv$„Ê¡Ö·ÿ@!‡@ 9·mLëÙCĶփ¸5w¦ÊZ¦égÓÔnYeg6Ð8É~ °7v‚8%{Ì»´¨ÜÂÁBçs)šáÖn³Ü¸œ…›Ä"=š>wåâ@õá;SXGRhÂôë‚Ÿp¨Ë¡@öüs $!ô%Ìrl±¸›=sçÀnL$ ?®´Áúhdv¾=gleÁðÂ!¨dÏÆWønü*±­vè 'Fci[íKcÛkŒžï•Ø“7Ø蹶 ŠŒŠ9ðàyªT JOzÄã×ÍKÔÒ×tK-ò,µ@ ¾€Y,lÜ· ²âÂþ¹ØLözíxL/úüÎÞd˜^žy=Êã×£ä¾jáh3p ´‡Šå&ñh®íÆ_'“+,}8ð/Ù2j\Ї·p•¶ç³s6ïppë5åðˆšèPqë¡,è ƒ1”œÈ£†|1lÔ7 Fìõhù¢ÿ Æ-ÄÎ4wy½-úÞνu0¬y]¿÷m’|üÑ7l§*7û!¼Ñ|¤D?ùÿæ´&sîÿ¢g¬œ^b(p˜¶ð {ñ†Næ¾â…ôµªËº2Ë€ŠŸÃ•¼dçú¬Ÿ¦Úm;Aé¢{Üúáhðð(Ò£[Å7Vo,]iâ{tŒvÿ §Næ endstream endobj 350 0 obj << /Type /Page /Contents 351 0 R /Resources 349 0 R /MediaBox [0 0 612 792] /Parent 344 0 R >> endobj 352 0 obj << /D [350 0 R /XYZ 132.768 705.06 null] >> endobj 353 0 obj << /D [350 0 R /XYZ 133.768 490.841 null] >> endobj 349 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 356 0 obj << /Length 543 /Filter /FlateDecode >> stream xÚÕVAo›0¾çWXÚ%™ŠƒØmÚaÒ:i—]¸­ò°!VÁ 0‘úï1Ð’6d´QOÆ!ïóû¾÷=?lüœÙÍúÝ›-oé¸Ð¥˜/hC EP²xE€ÇÁŸ¹ïË"ö#¹ ‹`2¯w;›Íçz—”±–õo~$t½ÞÙÄ^Ü{¿ÀAg½BÐ%=¼!²^‡Ð &»›æ¥Òæ!K‹ }ÙÃZC¸AªŠæÏÁ–å'óÓe _±DL’fo÷C…*“C—‰¯³F½ú©#²¼];Gò[Ô›5F`ƒåmÅ‘ùãÂÂÄžL™‡¿Â¬IÊåmcÁ;,¤Šjè®Êíú¤Ô˜BÇuÍQÈ5g}’*ˆKÞdúµJ~Yq…ÛoC$‡lñTŸ¾øÅÙæÐìAŒ4ÇÍéûh“Ë ¥èÿp¬ ~¦½^'z½uJUÈHÕÆè$2Í1Ø'¯u×eRŒêµqbÐQb¼?iɯ\ÿ¡$o³æõg7ÅA‹ãËa¼R"ß·C1,½N+„2/ôà5¹ç/p¥»`zš> endobj 357 0 obj << /D [355 0 R /XYZ 132.768 705.06 null] >> endobj 354 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 360 0 obj << /Length 683 /Filter /FlateDecode >> stream xÚÝVM›0½ï¯°Ô TÁ± 8 V=TêVꡧ¨—¶B^pk‰‰‚C›þúÚ±!|g“­Ô“=ƒgüfæy&ÏÈ®GýG€ÆÄ'`4xB‚1 áúƒŒ2ðÝI^æÉ„WÌõB?t´4[æ’'ÍêmK—Ð,Óë"÷çè 0Œ‚ð0†qØò*é󯳪·¶G§M7F•º¿[Ûy‡/¾$œYqŸpÈ¿ §LiÎþ§ú˜€ùaá³ µkë7ñõ•¥¹ÜׯˋDx~C§G®‡BÎ7W-Ke±(‡ ÚzžOÉ06¦ê4ÆõiÏ‘“Ra6OÌ*ŒJ–õ¬TÌ9ËÌž »/X­[–\LÌVN­‡q‘ç…«BûÕ|/E*y!J¨16í¤^;=¥®‚¯Qý†‹4_f6ïU"ûKáôÃa:µ ¡NoQAI U0S]z­HåoûYíz»d°]Š’O„Ž^Ÿ-ùv7w¡¨4¯4sú™±ù¾Ój·¹­rUð¬ãT—iã´ó¸ö:íÇó Œâ¸]ˆ¯…T~¾.8•õΪXÎfLÈÒHÅجÔ,‚­I‘¯Œh‰f„Êšᥒqį̀=5¥nóÙz[> endobj 361 0 obj << /D [359 0 R /XYZ 132.768 705.06 null] >> endobj 362 0 obj << /D [359 0 R /XYZ 133.768 509.803 null] >> endobj 358 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F56 15 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 365 0 obj << /Length 1212 /Filter /FlateDecode >> stream xÚíWÝâ6篰Ô²¯'Q«>TêV=©•ªòvwBÞÄ€µ‰Có·ÿ}DZ,·åî©{<žÏŸ'3mA¿Mˆýÿe9y|bŠpÄ\†–käÒ{¾‡˜`wá£e‚>NW+Y¦«!vÎÜwý©ÞíEl6°rgö@Uf±ËËOħ?:Ÿ—ÐÜ£8ôhN)ŽüÌÜ‹1™v·Z'r¿*@1ül˜5ºÆTiÖβ¬g qà¹hî3 ;f}8ùu9ùgB!JQD™ ¡ˆXFŠ³ÉÇÏ%pø¼ˆBthX3äâ(Œ`•¢¿'˜²GQ#É#Ñ©ý8×zØ ¢»è !™,*݈ê\©KØ÷ƒ{(u þç•ŠTdB5ŠŸ¼°Ç¾€\hq ÛA¦©i‰¦…¨êBéu8冤„CýéÆñ§¼’¤t¯÷Âðì5§µ0¼rm¯*ÍóZm¥Ú˜“ƒ6£9;¹Ú`g¾ dú»2§Õ–W#Ì÷Y0DTÌKw}œÂ,úša›¯“ƒ˜ ƒÐÖˇýH(ÄÕïXdi¤Õ*Ÿq•H°Å.\!áЬekË:OÓ\Ûs0þjR­âJæÊìbnÏöF]ŠÄ:”[–\ż ~öààPð«õVÇ<®ò¢l êJJûŠ†C€ýà©ÝVŒ7•z¹¼y×íêÂã“ϹëjÓçá³í!ö[ÛÓ˜FÎœ@ͼ*d,Ê‘t0#„ëæVÇ8ž„¸ídÖ&`'Û¤peëB´´ºì’[ÝøÛòÔÆ®Ÿ§¤ŠÓ:±‘û B÷˜ñ on¢MÞ®ëÀÝK*ìVÌŒuN5!®¾ØcX]Na­J¹QÚ{Í«VE~°ŸÓ“8Oßñõ9·2ðzÞðûwäÎtZmm4˜­ì¹LN„ê ^Bó¸ÐHÍoÉÖ?sýL”šÒ+× B“lÕ- *SCåf åTã%}5T‹As–i¼~15Ä-w\ÒÝFRñ,«‚–¡«„¹¹yM]2ÅÔÑç Sq4nüMl¹Úœ=©ÊTŸïþ†pmS ŸRM}'TÚ.¥íPZ©€ïò¿¡ïL$<ŒòÎVjßm o’|¥MkEvGÃgGùaÿž.“§#ù³>èSíÇ’«M÷æ’ÝìkêS9û+å®±ßߥÄö\X•òûxñí<¸ ÚátPß_{‚Æ=ŒÞaìiæ æ¯.=÷ÐiÇžÒ«cÏ”¶cÏ@éÿcÏ7{XìaçŸ|6{XÛ]0Û]°ãØ™±G³äÙ®®ìqÕJÖ¯º›móa4$©¯mƒŠÒòéÞJÿsógú'2æN%xv¹jÒ̺–K¯Ë:Þš•iêÌJ˜Å®È“:¶ÔFoÿ4k¥â©Ù™¾ ,íÎÏ­bÓ«Sy‘ˆÂú­o–V¦µ·N+¹KÅX³ÐXÕ‹L~²z5;㪆 Ì•Ýì*Ä¿Ï`ɼ,ëìtV}>¢Ï6zÍC‚Uað0/¸zyw×wÛ‡ Á|÷: _×á÷Œ9yP€Pª={¾µ& ƒ+PÈþ*í=ç endstream endobj 364 0 obj << /Type /Page /Contents 365 0 R /Resources 363 0 R /MediaBox [0 0 612 792] /Parent 344 0 R >> endobj 366 0 obj << /D [364 0 R /XYZ 132.768 705.06 null] >> endobj 367 0 obj << /D [364 0 R /XYZ 133.768 537.699 null] >> endobj 363 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 370 0 obj << /Length 1167 /Filter /FlateDecode >> stream xÚÍXKoã6¾çWèÅ.bF¤ÞØ¢@ l ôP´€oM!0m³‘EUdÓ_¿CeK¶‚X]öÄሜù†œù8¶ël×ùõƵã/ë›»?v’„,tÖ‡ú1‰(s "Ì œuîüµXïÄrÅüd±QE¡–,X¼ÊrkU]™µR•8˸žìŽ®9J­²KÔ¾êZû¹í-?º[Ëí®¢êyIÝ…¨KQ—¨å²+¬¶©x&Ž›Ôfù÷ú7gE}’ø>Œ”$ ƒÃ.ö¼­å—[˜0o!‰ FdãÏ(7]¶C©Ýñ¶—4d,ªZå]fµàwø,y3^æ'ßGÑ5,O©:µ‰NGåŽã‘ , \k„ÿD­P ˆÞu¸ì~¼{ýÁû”ľç€;’Ð-§©lŠt+_Àp×­g{IO~´³ÔÜWúl‚ÐðqWËŸ'w¤ù¤1Ý=¡ƒ¡0au“ A‰O˜»\Q×uH‘‰WÙØHÿìx#Q¼GƒÑÈ õ|Óâ5¦]Nù…Sâ~QimþRÕK/DÓ@^7¸oT$]>‰¢„˜„ñ HhÂì-hé_DI’ Ý'3¡Gb/:Ç8òC&CˆÚ°XBÆL„ˆ:]ÚSÛã8xg“Þ©/¼š{ÌY @§¥Y ûQõ8ÌÐT"“®Ë€°ZãΑÓ;—{Q¢}-ýÈqØJÍC/‰°_rµçÒÊHD <Ù[ÍjÁ[ÃE0éÍ_W,¾Ù Šf©Î‚T•)‚ÒåaBí ª›Be¼H ¹YÃEs(Ÿc½œ›ãª^O ¡â;Aw~j/¼þV8ÖísŠ²Û·A¢¥í[e÷héÅÒo[ê¤Ñ³J]ó.ˆ4ø"=¥¾úŸ+âweÞs÷/‹ì£* RëLq‚êu'Í»:\dÒ-¶ WOÿˆ¬mð[1¨ukÉ~á8ÝóêÌÙ«lw=(«sÆ»}BoD“MsN-ø–™H•buà*óàƒ²æåV˜÷×™rqo^zºûª}C±Ò/öVæ••epFßcpc.ƒ¿' ®u¦¿êØÓÏ¥BM& ,rœšN Fþzј›M0Cj9´ØW¢>§—ÍG$úN$K[SëŽ.Aº"êM­ö)šœ|Ð%¼z¹ž×Vxd†pš¢„øñìÖN>«#ÐYR_†võ*líÌG…#Å¡ßÃqƒ¹437¤ ‚k×um#sÑ;ÇåH.#¾°g{Õ:ýß?.«Ó9ùA§²ÌeÆ[U§=ÀÙÍϨ>.K3K=ƒSSÉ乄Ñ·“róÝ*HðüämÝÔbv³®ÈO¢+ß×y“ €ßŽ¿wŸ…¨>dŸþ~Q2?1ª~ïGô´ÑÁ1ŒÿÂaq=ê¬à7°ŸØÈ"6Úòy}óý©Û endstream endobj 369 0 obj << /Type /Page /Contents 370 0 R /Resources 368 0 R /MediaBox [0 0 612 792] /Parent 374 0 R >> endobj 371 0 obj << /D [369 0 R /XYZ 132.768 705.06 null] >> endobj 372 0 obj << /D [369 0 R /XYZ 133.768 595.074 null] >> endobj 368 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F56 15 0 R /F76 373 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 377 0 obj << /Length 1064 /Filter /FlateDecode >> stream xÚÍWKoã6¾ûWèE*"†¤H=Т@[t ì­¨o›… Ë´#¬Lz%9Ùô×wHJ‘éÈÝ=iHæõ}3" Ú"‚~_3Ï_–‹Ûw G9Ζ åÑTà„R”ˆ³X å}Š¢îšb[?È0Lfµ,ÊÍÆ­¿Ÿ6ŠJïŸîˆ áÇå{Ä)ÎxŒ"Jq.p&0MkŠ“Ô9­´ê æZõ³åËjævèjµ #–ÆA/À‚nÏï6U™êb¨@šK§{´ëºsÏV~>Ô­)1Øk·{_†Œ¦¶Ã÷¥SPZEÉVF¥‹_äGñÇ4Á”ˆ±Àw„&3YfÐù¨SÕÒ•E1ã8æÜO~£[ð(È:Ý^Võ!̆ÏDÁÎÓF=Eeh‰c†~W«ª9¬Êÿĸª†ï²ñ‘¹^ôÛïêÉD±•}a™~u{£g-O7saIuØM_CiŠþi?„h¤›áåho¯»³Íœd8åÌ/•¥UÌ2pÔ{œ\Îpç˜N0_B5Z¶½oe7t?ìé{öÎ}î±Ú¼pãÁÄÒtÚI+ÏÞ4(`kh)c¨‚–ŠS†cÆüºzݤ›ºíÿÌ97ªg—¼‰q—1e˜t¿v|%m'›§0𧉙Ïi3¨lêþÉ­Ž]o{[r³²HaŽnŒp,r~-߬—¾Y_Ú=ÝÄ3’™CÖ¹r$a,Åišúõ¬Õ”PÌ™ÏRXKó¬r܃¥ãŸÏˆò‹«²^Nˆ»ùn<­3ΕU܆"€*z;¬¢rªã'ÌÐ TÈ=÷É ‰\‡™þpöÆÞ˜ãù ZšÍ±Ú…ùóŸg»×>þÙfjŸ×ON‡5Ñà[vñˆ6œòÀìYT°”je~¨×ã6wÒ›™iü™af«×9*›9‡š©»ÓQÔNgà:5=¢1Z…ÿàEoÎBôÚõ ÔitU6E·/+9S„µÞ«Ž•®žä_ËíðÕÈÄ·‰Ìv˜Ó®îËv®T€†*wò_†x8:ହUrýòütmüÃÕë4…«0öïfåל ¯MÌë²!—û²³êõ90fþá˜#úÜ…xD¥~>³MBoS¸ç‘˜Â&ÆY;7iì}wÌ¿ð&{ð endstream endobj 376 0 obj << /Type /Page /Contents 377 0 R /Resources 375 0 R /MediaBox [0 0 612 792] /Parent 374 0 R >> endobj 378 0 obj << /D [376 0 R /XYZ 132.768 705.06 null] >> endobj 375 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 381 0 obj << /Length 629 /Filter /FlateDecode >> stream xÚÍWÁŽ›0½ç+zÉF‰c  V=TêVí9·î Q0¬µ`PlØîß×ðÖ¤«ž°cÍÌ›÷Æã 4ßf°ù~ÙÍÖ÷ŽexÀscìb™[`Ù–áØ[€6¶±‹ŒŸsß',õŸ1.îV6²çrW¼øA×ûE,ïw?„Ï•iÏnì0-³Î""™Ï_ \ÿ"WËzYRFŠ£zWäìÚæǃÕe×Ú¨nk8 ©pçœ4Ö‹›Ÿ`îó²H±8.áÁã°ÃÛç7”‡S›Ê;ëp˜SÆÊ%`®”X-S:pÒú_T0ZiÒ·ðäñdNì' ƒã˜„_ÍÏ™¥yD!ªrÙ«¶ÓÌ:Ó™=æv=¹×\Ç~Ηˆašg„<ßÿ§EÜC8Lµs›:Ö¡êìT¤ºVôaýŽ-¿ývh‘ˆaºA›6Jý‚ài©6Ê…8R.÷8ßã |šc¤hÚ ÒÙ"¦Mç—Ï=!n‹K¬j—6hé˜WMO_·*?>J%Ãò.˜Bš“!‘< ˜ÖvD$É!a~ÈÎ눓´÷;"ü߉ÀS)Ð*O+Ìd[bïÓÛÕ±#&{Ƶ'tÊ3Þ2wN:SªúŸåtncQCþ[?d‰ƒta/„Èö=(œòÖug½ ûõ½åöæîr€ëy*éßEDdÃyÐzñ ×ß,È„H’%÷%#4Ѫùv¼×Dù@h˜–QÃÄ'{-€‚§Ï:‘tÏ™’e6mþVûë²—Í4ºÝ_†è&o8;¼á™Oƒ ·éötPä6‘ àÆBxÀu!¶–bòu7û[cåF endstream endobj 380 0 obj << /Type /Page /Contents 381 0 R /Resources 379 0 R /MediaBox [0 0 612 792] /Parent 374 0 R >> endobj 382 0 obj << /D [380 0 R /XYZ 132.768 705.06 null] >> endobj 379 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 385 0 obj << /Length 427 /Filter /FlateDecode >> stream xÚÕWÉnƒ0¼ç+|Lª@ØìõV©©Ô3·¶²¬Ø¤VƒA¤êß×g!‚,Äd9ùÙã™çá=°ÀXà­c©ñ%è ÆÈ#s„‚8öÐô šŽ A@ÁGcžÎpF~XÏ€ì®f$ ‹É“ŒúEÈÄ"Ú® <ÂÙ_¢ö¬¢~ï+x—¶mŽ _ˆ”O£Å²$NØ$i¦Âo2W‡¥Ÿ´ŸsóMßsËhÕ)_VRU3œ²,§Ç©„³r´z°+ë®:”ÓµZ§ÕëO~÷RP<¸$ %È$"• §%+QÖ0-gÛ"·™cä$…rñ²ÁÕæˆS®‡æQŠÓˆ—d¦…cÕ:‰­Öé$ÎÂO8»Ü».Fg½› Ù–…Ó¬t‰\ nj^ª·«Vƒ1u]ð‰å® »S&∠’Åó6+Þæ‹c=ny;òÛ?‡7¡ôe6åx½2S|¤2]".ß·‡ð€äYëtÓv]Ðl¥ëÁ;ìz{r5w=tg]o_­ž®·)ヱçïü=ú®iû>0\‰¬Jú–6¼¢š endstream endobj 384 0 obj << /Type /Page /Contents 385 0 R /Resources 383 0 R /MediaBox [0 0 612 792] /Parent 374 0 R >> endobj 386 0 obj << /D [384 0 R /XYZ 132.768 705.06 null] >> endobj 383 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 389 0 obj << /Length 1493 /Filter /FlateDecode >> stream xÚÍYKoã6¾çWèÅ)".‡/‘hÑCnZõmwahc:âX^KNºýõŠòC2-;1‹íÉ2%ÍÇ™ùæÁMšüzCÛߟÇ7ïÞ+‘bSÉx–0Ȉ"Q2#ŒËdŒìrót›J&GEµ˜L‹§IýueýŠ»ºko.k±*«»ÛOãß# F¶r&÷~?Ú½´ç|áÿ|ÿü‘JøÁ½·Ûßö7I-x’2 Ì¡¸‡âù@\>›µâÚ“bYÙuív]!möµ•vns{ixTéBÓl–Uñ°´SÿoV¬«:xg¹³Á^åNVyõÒÓÚ/\¥xGæêå[k/_ãð|:îmu…¾oÑê”O߬ÛéÐ8n›®ËÕÿÊoqyzÊ£oWû[Çè»÷BTŽTi’ ÖMÑ¿—5B¡£zž×þ­N½ášÍpÏÍã¸Ã&ÿÿ2¾ùr¸JHåøŒN¸1¯“û§›Ÿh2Å›¨,áF'/Í£O #F¼Z$ÝüªnTj²F¥Âƒ:#ƒ2F¸VQ@™$<“]ÐÊÖPt½Âwc€ A”d]ÐûrYÕù²x¯%]뇻€§‘(gÈQœbÏ ³Ûç@ ËÔŽâL©dPfˆ”âGq!sÅšh>ਲ4 ‹‚la zêr 3„‚säàƒä¢p[0ÝÀ'‡À(È DÉôÜJªLL•*uŸv6+î Œã”sN˜é–€|9 ø ;}©†S/àC§iŒlĹBÈ(QÀQT˜§VÄPˆª Á:˜áÌ‹…2“QC@é.hÏi=p´26fºŽhN”ØE´3IÊÁ`‘¶þa ‡b QûÔí„]ß‚åu¹U¬vŒmŸ.g{ÉÍÅ.µ¥œÑJhW[`iDiŒs¶cèG *€§ñœj¶Ï4ömÊÇš&{¨—y±°``˜ …†Lîx™IŒ0~]0d.H$Š’bÁp"3Ó¸B©» á`††Ëb€2p…RuAOW7&Ñ›ZEAV®PÊ.²6‚3;J¦ƒÉRaδ?àø&clžƒ@³‰ Â9à< (0rÏ„Kl J$pɉèÓc W",‘< ´@#Kv1AL'[2ŸÓ0X¡SŸs˜Á”%¡[~Û|ÇŒhònûD¾ qä«óW^tîÿ¾ÌË…%·©t4ž‡Rž¡ØE©í§Ó@<lÚÜyIqÂyvU<:˸ÐFQÀõù vnûîädÃaPža/áœ|½<ÃkÑßÿP/¦0Jä.¯Ì6Ëûº@…Ûꄇêò )ª‹¿Â¸‰ªu¥öÁ®ýBS/ñuîD¹Ñ©[}¾Åƒy¾ØX³.ý²¯¹¸°*«ªø¼øê—ÞÅ{õø@~˜ŸÌ0lmáÕE*ªOÐ-Ž86Äq-ĬC]Yâ†v•/³ue E1¦Ï•%À0:2†ÈzÈnBÈ:hÈ}¶§OÊCUXK÷Û¡Š[8 kIÑüÎÛ…¦kz8)GÄ“Rið.‹û‘%Â0.þ:Ä€×u3 v!ڹέÛ2’©ÎXÂþžjO endstream endobj 388 0 obj << /Type /Page /Contents 389 0 R /Resources 387 0 R /MediaBox [0 0 612 792] /Parent 374 0 R >> endobj 390 0 obj << /D [388 0 R /XYZ 132.768 705.06 null] >> endobj 387 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F81 71 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 393 0 obj << /Length 404 /Filter /FlateDecode >> stream xÚÍW]o‚0}÷WôQ©-ÒÙÛ’¹dϼmKƒBI33D÷ó'Š,` ãzï=çÜCo@ ¼MPy}q&‹5€ mªSàp€M)Æ€êK|LIÈqðgÑÉ4»Û™ËyqÿT=`[}"‚f_Î;00´Œ%Ð0†6©åÚ»ßm¹vÇÓÏó¨O¬~ªŸóx­$÷W=:6›:•ŒG’®3M%«ÍRYªµX•º—xÑE´‹î‘Hé^CýE+‹ M‰ß6¾ïGü\m$æ:ÎÃ8þ¹õK¹Gèú6ö¤˜·2ÙVí‹­E:%°ØÁ ûB»q\Ÿ²–¡ý°¶ŽBÈ=W/jzçYÙX]éñ8Tï†Á¸qC_¥i¹:XCLKdD<¨œØg!;}@r¦åªqª1m¾R¯p›¼ø=ªS3l,ûÿw¾L£D‘Oë›`ÞùÓº´„¡ÀG{­ôås±2¬ëßM@´Ä@ÓmhYVQÎ4k!¯ÎäæÆ<9 endstream endobj 392 0 obj << /Type /Page /Contents 393 0 R /Resources 391 0 R /MediaBox [0 0 612 792] /Parent 374 0 R >> endobj 394 0 obj << /D [392 0 R /XYZ 132.768 705.06 null] >> endobj 391 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 397 0 obj << /Length 404 /Filter /FlateDecode >> stream xÚÍ–]o‚0†ïý½T#H Ìî–Ì%»æn[š éV>&Lýù+£S„ºíª-Éyû¼§çœ`€àqdTë½7š/m ,ô…là…AG·°lìèÈÄÀ Àó˜ž RÐw6Ñ0Âãò”m ÃÝyšÑÙäÕ{’š„úŸ‰[SQ…/†weÜž§^fAݵL !)ݶ\Ä×?a4ˆàyAbžÈ;Œo´Zð_+¾R-·{Ô†ìXè2ºUMvƒ$ú),÷YOÔº86™ ÊCÄ’ %$£+çW36rr×¹|óŒúÕq§ +ã²»sÊÕxRúZÙ*}c~A‚4¦J9»Zì k_ßCR?¤ äÿœ¥ÿáe@“4¢-g»^VàMaqiy•7“f í‘v¹SX>!%m1ÔÒAŠNó ÎúÏ`Ô£¸ŽI¾þ;ÒUSeöàÅæKËmýìC„uÄ@3å]Õ³9îAă7ú¶þx¦ endstream endobj 396 0 obj << /Type /Page /Contents 397 0 R /Resources 395 0 R /MediaBox [0 0 612 792] /Parent 399 0 R >> endobj 398 0 obj << /D [396 0 R /XYZ 132.768 705.06 null] >> endobj 395 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 402 0 obj << /Length 1433 /Filter /FlateDecode >> stream xÚÍYKoÛF¾ëWè…*¬õ¾hÑš¢½Eô-­e6)“”ç×wv—’µ2%Ë6“æ¤år9¯ýfæ'ó'¿pûûëxpùVòÄ #©LÆ× % qÁ)¢L$ãYò>Lòz1i²Ov8T¤îiµ™d××áùÇÕÖäbøqü'È‚ŒxÖ·ôä'ÿýˆ¤9ë’2ÏïŽIyؘÌò;†½°ã²NY”½Ô•ì¨òù~4àÈäöûsE¼Ð•ê;påò-×{hI§Éˆbd( ÿ¹±ÅpD™N—ëE“¯÷y1ÍfHpZ†‡,fO ‘Hj&zI0‘Z5d–Ùž)lf‡D¤ŸW•­ë¼,ê Øå$Íšðva³º]–Û/ÊëÖ¨Ûa]aí¬n÷ý–I¯ìÖpÿ3-‹Q¸^B ÒP¢¸ÖMV4h8bŠ¦ïòe¾ÈªÅýPŠÔ™¦Dº aR$åCˆó]> qR8ÍÚ7]!"œ!"ž#Ç(¨ººoU%¢r¼50Ä^Õ\…ã"‚û‚ Py߆1æÃÇ÷ásÏYø™mˆ¼õQ5iºµéŽ ~nÎoœ„r8¢T CÎdº¼ÿˆ“¼„ƒ9:Ùø£Ë„"£](É»Áß]%Ì×R‚(Š´hA¼Útè” Šò^tJ a±N—r•jŠ(¦½(ÕCb¥®´<ÖÊ°DŠô¡”aƒ¤1±ÒÛNÄvÚ+Ÿ–ËÕº±[ÝØ€ ÛuÙä¶h¶Ë_§"üæEãÑ9ûã³|›Ÿš#e%Bè]Þ&‘é&onÜJ¥U¹.Ú<„}€.d¦/ YåËl~±UÙZÂ!¼B†­ˆ€&ùªÛ„$¡ ¤1ÒF‡­»*I:0ŠXe'j…넚ЇNF :VzµàÊU/Z…D˜ÉXkÕ [òPªpëÑã (€jZVP0We@–‡$exbLn*»Ìòbð"õÛÍíï•["àÛ/ R~È‹éb=k»ùÏÃK¸"tóËñ擘8ú±Z/WÙôÓÄ7t·õl*ò V1‘Ç¿Úék¿]f=’ª¼:àIgó«oã<%×äÉï½[í¹w’@¶ßØÚS•^¯‹iãø\xÞáR¬Ü¾n)Š‚Úy–IŽlIÎÞùy \î¨-:j9Э;YË9Œzšq(Š)üª&ÉÁ}M™%pÛ$};Ôr…„b½¨ è ‘Ú¶ž\ÑHîÊ\Yu„ Z®@œ@«3rôbè” +¸ýWÕiâK¾ô¢?щäˆ`Ñ‹N© ½°Xç‘Û"À \¾õ¡†#Íh¬öÈm à\»†sÇ Ó4ð|¿ 0 ü&—l"§åÉ\`¬_zp“Q ÆZž]iª˜ìE­HQqVtÝ´w:€'1JN— a5½$DŸ‘Ò˜ò^’€S#æyIàJ–ѽ$+YFÑç_S^‡îÊ$/L{Q•Z-Öó¹…— ×KüÄ*ÚvÁ„N]÷\åvjý8×Öõ³p¦sD§®ÖÐçŽèN\ܽ s%£é_WÿÚiS‡~ìqÆݯº’•±Tê 膈4~Qæu-„Hz´%ÌS ¤aÕ‹Z˜µ40üHíQp²‹sVÙ-ˆPDhf¶žVù•CÐx_ž ÞÉûÜ^¿Ü7Œß]þ›76ùÕCy>ƒéRÐìûeúWYO'µmø¾›p^vSGy&×±=fVaçOY%¾½U Û—Qä"¬Ÿ> endobj 403 0 obj << /D [401 0 R /XYZ 132.768 705.06 null] >> endobj 400 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R /F68 28 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 406 0 obj << /Length 1228 /Filter /FlateDecode >> stream xÚÝX]â6}Ÿ_©/P¿?Ôª•º•úV•·ÝJÁQ™„ ™Eí¯ïqÂf©v4O±cç_ß{Ž¯C³eF³ßîh÷üezwÿNȨ̈¹Î¦g†H%3­ áBeÓEö~4›Ûõ¬Éÿöã‰âjz›Ý,xˆýï7;´ÙãÓßawÂqêªoùªØí÷Ɉ•"eeY|>²²õMgâÙælíÃ{X£­±ó¶¾‰7úZoš×ì͵±Y¾©Ø,_WlœÞ?ܽùÕD*¶Í̺ÁÇÖDg84OüÔ×~?œF×Jÿÿ¹¦¾­kkÿf£v“ ¾î¨-ßnÔ–¯3j÷ï¤=*}&Ú#y_/§+ŽžÊySTeü°W3)MµXQû[=þuz÷éŽá-ÍXÆ9×qeaÛeóÇ»÷i¶À \!ÂÙl×N}Ì8qÖ¡µÎþ¼û#U¡qI$æSFDÌp*|‰))1Ö ‚)1F÷0K¿L`jJ¨Vƒ`jA¨=Ì¿òm1O ZG,ƒ :NŒã=ÔØ_¦ ²D9½z훧ºÜÆ\Éã#®¶m¶ÜyU6yQå2ö›Uµí2̯ý$2ŽK4ï'ø£/˜gŽŽŠ2>››¡±¨óýËí&Ÿw¯«‡D²2¦ˆ}^w—9§¾b°õÝœÝÊ×>aŠk\ø5–ŠÎƒÒ™-Çj”7ÅÌüúžŒ'£Ó½_8ç°ûÊ\äœä¸Â`1\j⌼%+¤ pÕ´¦ŒQH'1R3¨„LöA—> Ò)$ë˜ Bêõ0Ï°N:ØflX'ˆèƒ¦I7 ›"xÿ\{&Ÿ´-ù¤9o"ùÐè‘söäÃÈ×1,ô™â„nx»Êk¿èÚ‘aa<É0nuÌ0–ð*.¬‚äØz‹‘t³K`:Et8˜ÀtÁEÞÇLK“ÄZ6¨ hú˜Iâáൃ@ ä1;Á.e+|½P4»1£b'ÄuK’?O¥†QK –Ýݺ+Û¾+ÊùúiÑÝØBàîáYý|þ‚ÿʪÄÕt ³Cýù××ÕÐK:Úì^ X(Ò ‰2ÀFÓ–ö¾@¢þsܯŒ endstream endobj 405 0 obj << /Type /Page /Contents 406 0 R /Resources 404 0 R /MediaBox [0 0 612 792] /Parent 399 0 R >> endobj 407 0 obj << /D [405 0 R /XYZ 132.768 705.06 null] >> endobj 404 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 410 0 obj << /Length 1466 /Filter /FlateDecode >> stream xÚÕXY¯ÚF~çWXê · sgñljU©•šªy«Â[!°6±Mîm}Ï,˜- ª}òx–ïÌÙÏœ,œü6ÀáûËxðüV¤‰FZP‘Œç ‘ BÁ%¢Œ'ãYòa8™äõj²È¿š§§|hÿjÓøŸïíßæe’Íç“¢,&›ª´«1ÇOŸÆï’” •²dDÒö‘Ùþ ƒöÚ,pZ y€´áÑ5þÏkÈÒu¢tª°9PªÃ4Ð'_×Héù‰‘Áà9ò.ã%’A QŠÉ`¼.úô'‘²X¾:ò…¿Sò•YÒ+䛧+Û+ó ÕnÅ¿”g¶8Òd¨dÉ醶™"¾ÁM„&“аИ扤“BÇBBz[“t6Ô×°@Fà¡©l}®cªà‡} ‹vwJ×›mcjo,¶cá|¸ÉÍÔØ*ý%¯ƒA6ªóQæñ¸îâA©†Ó6©ÄDôPU@TïöÔ¶¨EÃPöi»G(8$d‡¼YÚqåŽì´@0Õ,ºÈïfŒŸðâwsÐ(…5×{ÙÕÞÞ‰h N.¢TJzø[ŲݖíòÒAš„=:‚¢WA¹›ÖÛi`zÇ!pD*mÇ+cy™Ì`b85«Õ;TAìœ"ÁÉ>Ç^«G‹¹×cÐã^ Lìskùz»ö³N 0¹SƒŸêHëô² ¶P}A PE1vY 1ÕV(&Ä|èIbAÿÚXýµYf¨>Ñ $ô5¬ÙÒ‡2©·ÌX]æ$Bò ŸÖÓÂÌvWö7Îüï¢Ó~ªµ¢Ô*3LµâaV×å4χ8G>MÀ®EÚïÓPžíÊ´ý³Fç~܉ÔëJx æÁü@Ž æ¦Yü€+“ÌyU®õ¢Ÿnkû0sEhŸB´~p•—¶î°×Ø›Nê¦:[{ØÓæu÷úм¾ñC(“ëðŠ:]fUX÷hªŽ®¸¥¸÷–W¼`Üd›*/š}}›ÚoѺ8#Uw“ª+V?ã¿ÿH}cÕan‚”ýÎÏÆlúl®û~$‡Ž‘ìYÿn¼ÉÜÏÐIáÆìyðïè8În•‚pe®­Ht ¸¼ëTU endstream endobj 409 0 obj << /Type /Page /Contents 410 0 R /Resources 408 0 R /MediaBox [0 0 612 792] /Parent 399 0 R >> endobj 411 0 obj << /D [409 0 R /XYZ 132.768 705.06 null] >> endobj 408 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 414 0 obj << /Length 1456 /Filter /FlateDecode >> stream xÚÅW[oÛ6~÷¯°yˆYÞIaÀ h°¢yk C‘éD›,¹²Ý´ýõ;‡¤É–Ýñ–'Ry.?ž Mîšü1¢qüýfôêÒ c$SŠ'7ó„ AŒ¶‰V†p¡’›Yò!eDÎÆF)Mÿ*]áÊ•O¸¢éŸ›j].«øõn“¯Ê0½ºyûêé‹·Œhi@»ü‘2¶õ­È`–m7ÕQöë¯ËvÌlêV«²©W᜴¸YsÇ&,ñTÃÄp¿®ÃN-;;™$‚Û­†rUážÑë›ÑçƒUš°„iØcU¢…%F©¤XŒ>|¢É ~¾M(™MüÖEÂIfÑÜ*y?zPíkÓ†#½(¥"¨ n@m& ãò"j3C}µù|>€àE™ÜâÑÜþíŠ5 ÎtÚºeëV®^¯ÂwŽƒIWîóÆÕ… ‹Í<Œß]ÛÄ•6Œ‹¦uáD/:ë©eDIyH‡žq˜Øgvc¦Ò¯h›gìr‘æ•¿Éd #Lr`‚gU8;s)åµ›ÁfiÒ¦ÆѦë{VùÂ…¥Y³ÈË:®.ó‘ñDÐ,}_.Ê*o«oc­Ò«°7$X¦àÙI† { ¼5®‰}ÎE i pÌ Ò'Ù,$3Pi ɨêª\> è³ŽÈ èËðEWßQ& ®˜ ÷Øar¤ˆ&Šõ’‡PÓa7|yvÃÙ+m#»a¶Ä¨8æ*}ŒŒƒ„WšP©Î&<ˆÛ#< N0™!ûN‹x\ˆÓÏd°.‹rbá6žz,'ð½(¤$§@#.¡•# šõ´a °—oÁ(r|éÔ¤·5Õiø®ÛM±ö‘~ÌÛffyر*ë;Èy0óŒ0*O¿{£7ÁYàŠOô˜íHå Œî Q…3bº¤:eì.H•†ò`O¥DÁŽK¨„W¨T_gU®ÖC%…àœ˜¬ÿÀ6xýáU†Ü“ySUMÛóM]¬Ã[F;É#žh‡QéiB S&Q%<×çÐÙ*µeÄéÂD(El¦.¢VY¸BÙW;˜>4’â": 쬯óÈSQÀŠÝø@»+™·ãžt(ITP 'ðÎbéùSYÕf Q@Œ_á6_Frÿ›Ý´OªéþOïÊ/q;~ù«˜¢•~éçÞÚ£N>RE½D лÎÿéˆ}N³_B2é×?2kù0hYXÆ…ùÙöõ$/óc>¸)>ú³­óõ`”ëçWǯów¯2ŽÚƒoûqGCùõk—Oט§2‘ºÅrý-L÷뎌‡÷:2Øð9vd0,H°~ÐÙÙ ZÑ+H‚ÙÔчr}–ë&Œ…«ªº|…å´ˆÑ~øÒ*4ðN± ì¹ï%´/¡Øzy¬Ï ÐT™ó½q^‚6ô2:;¾ ayµ‰{ yh‚@F^ÜǶh³^nÖauV.\B Á{Ɖ„ë>(JAÅ>0ë€_[¸dRkÏ$€à­ð ïAg¬‰ü^t˜u°BA0smç˜J7u‰N}A®Ýzr#âü䦓ŗ 3W”ØÑa™† ¡kC8CÂEüq=îÇ›™ìPÏ«°º+.=ŠR"¬AÐ!¬ÜRl#ÎD¥í¡š‹ï~¯ÞðûŽÂwÀâŸ]¿ óPÎÂä6–&EëòPÊÂÇùµËÒß6t^4ùA ãÝå©„ÏàÏ0Hµ4ëtj>nœ~IÌÊôæå ]çSÈö¢>åbO¨ÿw‡^úª¾Û}ží¾ÎEþÝ~1²8Y·­ö`öäBñЩãuú3Ýòðï發î:·³ï Y<ÜÍCC-ÐÔç0éð@?%tV¿ÅãŠPè!&Dhyït¢ÿp[ endstream endobj 413 0 obj << /Type /Page /Contents 414 0 R /Resources 412 0 R /MediaBox [0 0 612 792] /Parent 399 0 R >> endobj 415 0 obj << /D [413 0 R /XYZ 132.768 705.06 null] >> endobj 416 0 obj << /D [413 0 R /XYZ 133.768 667.198 null] >> endobj 412 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F76 373 0 R /F48 10 0 R /F64 23 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 419 0 obj << /Length 1119 /Filter /FlateDecode >> stream xÚ½XKÛ6¾ûWèÅ.".ß"‘¢@ 4E ôPÔ·$0KÞ"KŠe{Ûþú EÚ+yiù™œDÑâÌ|ß<8c‚A¿ˆþ:=¼SlShº@ŒÆXH”Œ1ãMSô~<›åM1['Ÿ³I$™Û·¦NæþõÇvýHúvòqú'ŠÅZpQŠìÉxÌ·›2¯ÊYý<[nŠu>K /°CúÂfIšö6À Ò?nDÈQ#6õ2y²$$%pŽãD}[N«j9K«e’—WÒÑdë °ÜÃxx't'X"¥q,ŠÁ†Q'ô—ID ×yñžó&s[­uáß¾l’&wËÄÉ–¦#›R†…Ò€¸•úP°@CšÝ7¥—œM¨ÿ[¯²¦,nožøER4•[}òŸçe¾Î“"ÿ?K݆¥Ï\:½¡±À†ŠV Í~4úm:ú2¢°KEB¬CR2¬YŒæËÑû¥ð#8s£Ñsûé1l´…P F2R(Ž¥­(Å´Sjýðgæu”U«ðXb ŠbÂ’‚`³[0P%0a¼¥@T«t™Ô Tbeèΰ7“ˆÅt\¯*ëÓmžZ1×OY-#ô *&9PCïŠIêú ÂŽ¡sa^ìr÷hòò±ÈÖ6R™Rsƒµ­Ït" °mî‘k† Õg9.ˆÑ‹¶¶$Å&Kñ$⊌ÿ(]YÄXÓ¯KódW2ªÅ®B¸,’om0d«—ì>•±”cªÔp\@š1¢LCvß”±£¬ƒ¨Vi[Wj HSô.j ûZ„cŒ¥Þ0¨Ç©cwŠ6I1÷hoDÀ¥ÀœÐ³ˆãª“¼ q\Cu}­Gb¼Gܺ" ¬ÎSÁ5ÖRÜ‚ð×û9ÌÁ­ )w‡‰˜!«Ÿ:¡Ž¨û ÕpAØâÖó–í,^k•ÐCðXßC­„{‰«¸¯Ö6g§o°¶ÎqýôA™ƒoë“Ä^pu¶ZçYãÞˬ½è`eƒÌ>ŸªÂïä¥{fÉüÉ­Úþ·øÉA‡Èžï» [¨ ôŸ‡Û®ËtÝa ÅT£Ã¾¹ìö–ç gI|qÿkßÉt§q¯x}±ö•ç5ôêtC¿ïÌïÛÓßq­ƒäïìOît48øÞå¯ý bÇÏ všA ke|éÒæfoñIÝÎ vñÉ5¯`JòYíÚ>i{™}îol÷tNZGBabâ~0þ—ób“zö~úÀøéçPà…üJ²O‚ñÿá¿ÏYV¹tûP$n«< `‰²³xHÏëd&ý ¹¶è\EÉeÿ„I9H1ÇËE‰uŠSõ}Ûªq±ƒì\Æo°]Áòy&Ý@¶“ BYë¶oIÜžàe\“ºÞŠ«ø;aE§<öK4ŒZ{kíÿAѼwúƯÛŒ¤ endstream endobj 418 0 obj << /Type /Page /Contents 419 0 R /Resources 417 0 R /MediaBox [0 0 612 792] /Parent 399 0 R >> endobj 420 0 obj << /D [418 0 R /XYZ 132.768 705.06 null] >> endobj 417 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 423 0 obj << /Length 504 /Filter /FlateDecode >> stream xÚÍWMoã ½çW õ’¬bÇ8†`uµ‡•¶+õì[[Y^›8¨1AÅîÇ¿/Ú9i–4i{2˜™7oüfÆ"5ˆÀßAdŸ¿³Áä"! ScÍLH8ƒ1ÀhÆS² \ ³1Š†tÑðQÜQ)ÙŠ›weaÿ¬ãRв¥•Ùv’ñzt“]¾E}}N.p²:Æ!ISÄ0LáÌD>c¼\v•BF1þdr9)æópñK**c„±:ÍËöÑØþл¦[¶,WyM[}v¡èÅ5!I¦Öߦ™çÚç–Ra ‹Ú¨¥ç/(Á6˜> ñp&› [4…7—Ž+å<áÝŒúP6Nw1¢Ð>.—yULìãÒqÉj®ëµ§z^±F“øßÒïdKy׬}lÞ> [×zåÍÑ‘ÐÒô’o{AÎ:yGìä½…>y½f÷t ²ÚŸ2f@øIÑ+%½ÛsÞš…Xɨ:Ÿhë02GšG'"Ý’ÞU6¾¤Ë—Ö¸\wï}^]p¼hèWö§MÐíÃäaÕ¾dYu´Zú„Tñ>AÝÛN,é;z"ï&?þÄz«ãžD‹B~$ƒOøc`ïþúÞùxHòµ}³GÿQð­’Ú¸s8×2 !! ˜*nÄ`’Äqø“ žªÜ# endstream endobj 422 0 obj << /Type /Page /Contents 423 0 R /Resources 421 0 R /MediaBox [0 0 612 792] /Parent 425 0 R >> endobj 424 0 obj << /D [422 0 R /XYZ 132.768 705.06 null] >> endobj 421 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 428 0 obj << /Length 582 /Filter /FlateDecode >> stream xÚÍVM›0¼çWXê%Ç&±jÕC¥nÕžs뮓X °Uÿ}mL>Hì%$TÝ“çÍžÀ ðm„,ã—ÕhöHÀ‡>u)X%/ ¤J–аŠÁÏ1åƒC\2æÅ6Èiµ-y&Id;F› ç,bOˆ ‡çÕ°ÀÐ[̃1ôIƒjñ c¹JÏNò4œÖ¨½ü@Am2I„° 5l¾°#lÁšo'2ÒhÔ…KJLŒÚKÏé¤24òyÍxÜ|Sl§èLõ³áÍG…p!¾D H‘C⴮τEñ“ÉÞÂ_âî¡ÿ[e5¢¿–³Ç…wbZÏ¥€h©…ľ†ý.»£PèàÓcšÅü !—Åú¹*¸XKtös¸z¾ß*×.¢m7Ù’éÏdÖpóÙ$¢kÍ_ßp\kNYùÊwøX=7¢J™gÅÔN³ x„Òtt€c'ÔNÓà‰‹f¢’•Ö|©žÍruX‰‚¯‹ûg­ÙìÃòî.oÌÓ@„)»¿Æ¶^ÅD•—©ýÊ?y¤"»Lue¢hmÂݾµÚÄ ÷ˆQVù–½9z¦MîO›Çÿ=iÓ‡\óë[ókü›%èq‰Xɾ'}zÙ-Ñj/ÆS÷ìÓ+í2KkÓ4ßAË ÿF¨»›ÉRuIÒa&÷ÖöÂ…¼8Õ¦)è.Ù%Ợ4¾ƒ·Ø0Žàä~غ‡zsˆ=u÷¡'ÇÖ#­_W£¿Oé§ endstream endobj 427 0 obj << /Type /Page /Contents 428 0 R /Resources 426 0 R /MediaBox [0 0 612 792] /Parent 425 0 R >> endobj 429 0 obj << /D [427 0 R /XYZ 132.768 705.06 null] >> endobj 426 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 432 0 obj << /Length 610 /Filter /FlateDecode >> stream xÚÕVM›0½çWXêªÄÁv°ZõP©[©—^¸uWˆ Nb åc“ý÷5˜l†|ÀfÛôd{`ÞÌ?m°À÷U_ÝÁøŽÚ€AF1î`4…6±%Sˆ'¸øepYDæˆ`bˆ,ôyùsµ¥œ õ´™XH蕼·úd>¸?ÀÈFб'`„d¤õ¼l!žø:*Â\xþ|®M6/H㤌ž)d«>Ž›û«¸‘š+«éÜ‹é\¤Y~µ$ëÖ2ì›ÏU‚¯D zù·/òÛŽ»â` bç¢H´iD›=!3žæoJ?Jü*ú¶jøAp›¥ØßÙÎ^ QNm܃k:–›Ê†ŒÙ’ÏVzº^ò|ÉÓr|m¢—Ÿªô“땯ã¶aF™*½…hK6Žjƒlû¬á¸‰ˆ±IRže"–Y#å:ø±üü$â" Ÿk‡ß…êi^'ÈýÙRÏ⊂mº¸#DœNY³ÆEÆ[ÏΫþ½°ö2oé„^úBª}÷ªÜJyh¬8ONwN4<#¤óøLcläÜh}‡iwJ¦½ÿ¡VY_î/Òr½?žúy­b)®³°.Ú]L¡ÃXód|ØúWÙ|VIŽUnpùå8¥îN!U¾^È7‘;I÷š_â{4ÌnTýÍ­Síý”R·ÂUQ¯˜ÑnÞøžG}ØÝÎÎiáyø±Û£1ŠCÒ´'Ì{í®úïñéÓ™W8š×ÞUÒ|×L ru•0許ÂuhÃã›;ø<#Ñ endstream endobj 431 0 obj << /Type /Page /Contents 432 0 R /Resources 430 0 R /MediaBox [0 0 612 792] /Parent 425 0 R >> endobj 433 0 obj << /D [431 0 R /XYZ 132.768 705.06 null] >> endobj 430 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 436 0 obj << /Length 742 /Filter /FlateDecode >> stream xÚ½WMsÚ0½ûW虲‘d}Noi:Ó[§Ü’ŒÇ›zŠÚ†Lÿ}%›2uŒ“B–öí[½•Ÿ1Z Œ¾xÿûeÜÞ †4hAš¦ˆ Œ3$¸r4£ûQeå2ªâßÉxÂ)ÙùvYeQœ¦ÍÔMÓÌÉçñãô;š0Š…hBhîDYd»£(›ç³@§ÓQ¹}2‘q¸=®›'î&ɧ:Ãí*[¯Úxž?lg+Ú³mÅؾ‰ôÅ0ÇÜ…É(šP š’&  `_§ÁŸ€8Œ"‚ÆqÁ@*ŠfypÿˆÑÜ<4A¨z®—戂VÚŒ–ègðÃ#L"$h]Gâ*l0ë<=¨Ú ±A@µI•‹jër†I Lä ¶1.¨‘…½½cê8?Ä€áÚªˆgU9žPŽGÕ¯¤”Él½š7ã¸5ZlódU53i±ÎO6<`L‹²‚š&>¹3N²p \ʽh{#øô$ûY¼LÞÜæç—Pšzång–±]–öhãÙG»x97ÿ ]oàö›vïuóö¦å¿?;ßD×QkM ¾ãj¦¯>1'z¾ù¨Së"Ãæÿ{ˆñ¿[_ÉåiÒWÖöç}¥Záî‘UÛEæòµgÞ[΃po5mðù¦+ëpÑü #Ç6Ѷ‰ ólµ‰cÞÅ6 º·MêEÛ4è‹mr@kUx`Y’‹A`™0Uc*LeLRb*0cX«;I” Âð`mEŒC$š7†Ï’eb á~z6Q@etÄøK”<öQ`øàFŸþž€ÌÖE‘”cE³Õ¢é*0ÍݾzMÆzQo2LÑâÌΗ &ÈË’nVÖTJæ~×ôõNÆm&…qÞU´‰‹8/ßüQwåK©Lön÷ÆŒÞɾrœ¯ó8[}ô‹×ÏñèxE¨Ð|,isº”RMT%¦[ÿvò³Í endstream endobj 435 0 obj << /Type /Page /Contents 436 0 R /Resources 434 0 R /MediaBox [0 0 612 792] /Parent 425 0 R >> endobj 437 0 obj << /D [435 0 R /XYZ 132.768 705.06 null] >> endobj 434 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 440 0 obj << /Length 470 /Filter /FlateDecode >> stream xÚÅW]o‚0}÷WôQ"E©˜½-™KöÌÛ¶4 Ò­Pb˶Ÿ¿*Nå3ˆ0ŸhKîÍ9÷ÜÖ!0ÁóÈ<~ÝÑb‹V`cl…€¸¶ !@öÚ°–6p}ð:ƘIŽCöE'sÛ²Çû]3ãäG)W “ ÈþM'ïî‹v>‡ÐØØG՘Ŋî$õöEDXüfÚæÁ| gµÌûÈ@(òÙDšDdV…¤Þ‹¤êÏX/5øpp0¯“HCî s¨j~¨YÑe¤— ´òx¸ðÇ2!Þñp:岯Šð±'§Ò£W+Xá\K×{ô g¡N²#‘¼cI…ý>/Cƒ†—D§| n¢X-Cë ˆc]+ÉñNvâãÜB°hŽº{*†LªÞ2±¹D:58OèÆû£¡6'4,§6Åu‹h·ÖÖ‰b·±Ô–^Oõòo¼Îö%:o½5€â…¢æú3Ä¥§-êZÓ;‡T7xÎ:L÷rmÃY¶Lc©Çõ³]"dë¼)û´zod}Ò­ •'¯‡ÖE\Dªp)6è¾±ÉBO]?õÔ`!º»€5ÅÓ«k±]9O.gi@Çskc8ú{ðë89‹'wô øø¿ endstream endobj 439 0 obj << /Type /Page /Contents 440 0 R /Resources 438 0 R /MediaBox [0 0 612 792] /Parent 425 0 R >> endobj 441 0 obj << /D [439 0 R /XYZ 132.768 705.06 null] >> endobj 438 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 444 0 obj << /Length 694 /Filter /FlateDecode >> stream xÚÕWßo›0~篰´—d ®€±µi“ÖiS5iZöÔUˆ’Zu€Xÿý8iCiIÓE{â0wßù¾ïll‚ˆ ÏY=?N³sá!…•`MçˆÑ{¾‡„`Æ}4¡ËQê„et›Œ]Ÿù£úmY™R‡Ñ|n‡Þ.#ö‹øôÝøjú¹ÅÒãÈ¥+¿…²Ðö ´ÆÂü.›Uq ¸¤íG}jntÒCb©+¿ßjM@ØÐm×ð.JÉÁuwd͇ÔÞÿõû=õÏMTþ ĉHØ)øÿ—ºJu–|7àٲwÕ ^ö¾ÃàÓÄlº®Ø(r£ãäÀ °•t™×,4v•z‘&3û–gÅÀÍq·—1ˆ– Ž]|G‘m*4(_³ÑÁRV•á+2õ‚{èe¿Ðç‘xÚúûÐ~%Ï"ANÂÙ¹'7Î^®8ðràÒÀâ~HîÓQy“ØöqÍÇ0—Æר”Ã$½µKt7¦r´¨–IZZàlÞës8ý±uÔRû8Ÿ¦Îo‡Â(ARXIŽS˜xÅKçòŠ |r0WÝ7®KÄÀQeÐç{סS¬P„a6iC^GZà€±£¤U”¶ÓÖRí$åD`¥Ô1’r¶”í¤FÏË阇=ê?ª`K³²«æ_û~ûyqÑ<³Y'•ÖéUKØLdë-p£¡==P~kù˜,ŽÌØeUäQœX³¼‰JkÖZÔpqzõ z±ý­&F§‹Ud?„d†}ÈÖUf‹Žõo–’´s|£ÓØT³Õ}]}jã›ý›Ú ÛJeÌuß>ÿâ"N}qé;¸¡øî#餥öV?KŽ)¬6—s,¡ùh©Z°ŽÿÁ=a endstream endobj 443 0 obj << /Type /Page /Contents 444 0 R /Resources 442 0 R /MediaBox [0 0 612 792] /Parent 425 0 R >> endobj 445 0 obj << /D [443 0 R /XYZ 132.768 705.06 null] >> endobj 442 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 448 0 obj << /Length 1003 /Filter /FlateDecode >> stream xÚÍXÛŽÛ6}÷Wè‹7XqIŠ- ´@´oEü–†V–mau‹.ÝÍßw(ÊÓ¦o»Æ&†(Š3‡3š9‡2A+DЇ ¯Î&wï%GkÉ$š-£ sÁ‘ ³P Ù}šÎçY›Ï»ø!½ SsWôy—ÍãåÒN½+âÏDÐ_o¾ÌþA§8â! (ÅZ8NVÙ[NêÇ=?ƒâšî.×}žßÇɃ3 ød°>Œî†àA¯‹˜Þú¶p¾={ÎÃÝ{m¥6Vœ¡€_Y¿³58dLM—}™tYUZCçˆ3‘çd˜5“¿f“¯ ³Qxm¬QHD K-QRL>}!h!ê=K Ä°Ž4Œrôqò¯¯`{ŒÊÁ×Ê‚qz`¹;qXA ÛÜ…5‰Ý•Pšð~¯ªT9sA7ŵR†¥º rH–’ž•å3Ì)½ ,ØŸãb…z¢Llj®nÒ¤*êªM[_}r̔ެ…òùSC/kî¿yÜ@rM ?»a>75M7kðM6ý»´¬2XH´Û¸U·Nh1A¦7”L«fÑÞú‚`˜jq’ÑïhÝÖy¿Z¥ {“•]åñ.)VôTŠvb3u@v{Çm@‰ÀÚpÝ6§ø˜¶M»‘¢òžçéüÌã‹és_ΧÎ}[vH>äË‚Zý\A¯RœÐ­NJVq¾V €n¸‚KxB œ«@ M ̃" #u HЭÜ0¡€<Àšðv®©Av@ë\HñŠAs®€ŽÁ›ƒhºÇËq!‹6Ö¤]ß”­-ËØ\ø`7Ü'UÙÅY™•+{ß­A ìš4O‹´ìZÛÏ4ŠpbçêJ`oa¬R;h×qchÔŒUÛ€WÇɸä¸<õIAÐÂüªÝc”u y§bú”%Õª‰ëu–ÄyþmÜPc#v›ñ¸ŸjœI¿öq>>ôq~@%Xß û<]ÒF€"”kýGieÆnd¹m O sI<îS{mÒxT¥eS}ªûÎûÖ¼¹3T†IAO:\õKV&y¿Ùï7`¢;èS¼þý0YºÜ½K–.ƒ›­ÏÍ®çm×%qc—tO£ÝÚ!g;ªC…5>·Þ.ÕÏAï“äìøHvûÊâ’Ï«}ƒ7‰èY¼¨æëN`›ÃØ­p»•f»`쌽¾æÃÕñ\9 <¤i}ì€2€_Ü'{ÝGù cóŒ¿ä?‰ÑíwÊ›Åx°«û#¡Ê×V(à½}‘ZÐMÖߣÛja‡:¢¾Í"ÀYé±…5q,àlõ?qE endstream endobj 447 0 obj << /Type /Page /Contents 448 0 R /Resources 446 0 R /MediaBox [0 0 612 792] /Parent 450 0 R >> endobj 449 0 obj << /D [447 0 R /XYZ 132.768 705.06 null] >> endobj 446 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 453 0 obj << /Length 797 /Filter /FlateDecode >> stream xÚÕWM›0½ï¯à«„Å“D=µR·R/í!·¶Bœ¬µ‰l'Íö××c;°²›]©=ùkÆž÷Þà1‘·ô"ïËMäÚO³›»{œz…SŒco¶ðÐhŽÓ‰—âq°7+½> “0Žƒ!Š¢ÈÿÄ‘Ï)S2ø5ûzwŸL¼i8MãÜ#oˆ&¡ö7~ß­Ù0N#?:È'+²&õ4_¸eÛH¢Â`8J?{ Âþ“u*rf æĶIJÛSÜ™p&•ØÊíD×ÕŠÔ»Jkô3ÂÑœï`g"õ¹(„Ûk¨Ff°b,ÂÙF¹`B€A*A¤ç¦œ%e% bìoi¹ÉWv±¡F@XævhiH¦–³ò‡n+`ÕNw € KÊ ¨cáÇØ1¨ÛB\1ÐIÙÜêÜØ·w÷iòLà…“dä c½5r2g•«lI·zg¬aÂÈ ÃÛzœˆÙz¨üñ™‡¬ò oM|èÉ1­T8™NÛ1ž ,ÎEI™†&í„É0l3 ×ìÓ.%”ÉŠš”kœ/s<9[žMZ+à± ¸¦§agITÖ„ßðôHHÕÏlÅÔÀˆ½—Å(žÚÛ¬·’®3õT9†¡7p‹ûÝ*.}sȶ¶ÎÁÇåßBšwÄoÀx~kÛ°wýØìÏoy à+ðÚŸÀ‹ðÞVÕí;a>QÖ3pã+p÷ìÓw~“­ -ßtÃÓew_^–Ù†þ;ܘކIºdp¡™¤0Úõ¦EzvZlæÿÜnI'á8‰ÛZÓ¥V¸*"xE„¢û"sPJø\å”]W)ܱ²P»þûTíN¬§UÓqçáÖ­àÝ㎅ o‚õôüÒQ<][?^Iö-§e·FÐc/˜kÿè^š»Qœu /¿Þ‚¯=rÞ\Žy.i‘™ÈjIê¹ B±D\ûé_pµƒz§pN¹)ê÷¢Ó~9ÎÒQýàEï>²Jß`T9ó‡²S‚¬¡jÕjËcr{ëÈ4`ýg‡bxŠZ6Ÿg7ø»èŠ endstream endobj 452 0 obj << /Type /Page /Contents 453 0 R /Resources 451 0 R /MediaBox [0 0 612 792] /Parent 450 0 R >> endobj 454 0 obj << /D [452 0 R /XYZ 132.768 705.06 null] >> endobj 455 0 obj << /D [452 0 R /XYZ 133.768 667.198 null] >> endobj 451 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 458 0 obj << /Length 1866 /Filter /FlateDecode >> stream xÚÅXYÛ6~ß_¡G9]3$ERR-Ð-P´A÷- ²LoÔÈ’£c7Û¢ÿ½3J¶l­smÑC49¿Î7~ºà|¸ºxúܨ e©‘&¸Ú"ÖÌ3éàj¼ ¯¯‹¶¼¾)níb©¥ñß*k‹üºµM=™Ì]¯ê÷×›¦Þ^ïê¢êÚW\óÅë«_%X¢¢`)Kõ„z—½= îŽyÊ»ª—î4ÿäƒ8‹oÜáåü§šMuúïµ1Ÿ¡ÍÓç*9ðÚÒ$,V2XJ (b"ø}Y.`B†¶´[ rã?͈֚°ßÓ1)‹¸ÉUÝWk»žá¥Lòt؇öè«¢®P<"îlˆÜò¬¢™•¥ [õ[ÛdÐuó}[T74ìÞø=›º,ë(}7®mú*_’…Œ˜ÒÉÔì°on8ù§9S%tz´òàñMÝØ,C@ýÈ;o­ÝÍF—"b$Žtžlœ•ö$Ï:ü’†·u±ö“}k$0 ¡™}g°?QÚùïãU·ïÙý¿Ðç-p6^<®~Q¤ÖOtp­Y«ø›j†¶ˆXœŽ±Q´D3ÏÊ!ïè× ÐÎ4íBèðÆú%oZ›D@*)6è‰QRÆå(Ê]Ñyn™ªµy]y¡²f!’ð¦ÇLA˜‘J2mŽãÌŨVa™µâ:šžtk.ÅÀ7ŸŠž¦ãho ÒEíWï.Ìò@Rf¢@©„I‘ùöâåk¬a <΢4 îÜÎm Yš †eðÇÅ‹™ûLªî³Ô‘ârb¬#–F³”ÇÂЕ¤fÂÓGÕ)߈&‡oÄÁß©žð%BC& \ë}€àd)(Ðwg‚ ŽX"“óA€²Ž[Ú7u_®‰nc»¾™£º”)ºG©ƒÏíƬñzIàÂéóܶ-ýɪõ #™Ñãå¶ó±+cqL{³<ÌŠ²o,XIqþìW(`Pf]‡¡‹ã8¥Ç,îò2P¼³.•áÏšrHÃÁ(¢3â‚nXØÙL½µ^*›¾,ï÷S†WPæMj‡®Æøäa^ow¥Eò—4œg“@Êb~ÌRÂ(Ôd@ã¥ÔHÂ…;RHÉãðyd…©–Gõ”éƒp–Iê:¦Ç`œJ&¥š2>—ÉÕ!c;ã°ˆ­xØ7—W5È?z”ù"€ÇL«£X¸Z$<ôx©W]VT4Îèƒ}iiìë·s3Ù… k}×€±ˆt#(Þ>¦–—.ÚtZÆ͵t‡Eå´Qm3„û¾Øý¤¾î¸^Áð3Îcé¾X®IcòI50¤›™<·Ã‡*͆c¥¹®-ÞÄ2 «/H+•Ç ÌBOµî=ýAíÊ_X fE”…%ºsa½±m_R>·ÓŸÔarå÷¾’2º]Ha±†±ºô‚P•zjPÏ]SCFíî‡$˜ySC ƒ•Gxg[jflQœÇhB6àÚkìhêÂŽz¥OCV'¤sõÈ.az`'˜‚x_,‡»á÷Âæö®h½N/z@ö®.ï«z[de;ãql¼\ Io ØDˆp‡d¨qo-M½›’ÂIé»"¶vDz¦+ò¾ÌZ~[PWBø«Q÷¼;·Ùî„T¶µ]Säsíá˜bß%äî8¤å÷¨CVöXï!›_!éÓJ»³yñŠs‰5óýÂèjø@çD]œDuñ›Ëãeý÷;ÀórNèÖé-…ëÝ÷® „þSÓÞ—Ñœ- é±G=é¤F¡ÌÙ?â3[kËhÜSY¢¶e›°Rƒlãç]„2jSd«Ò¶`X™&ˆ'1âfxÞÁ"ºÖ‰ <4Áܧ6š l”30ümûÕº@n·…7žñòM{TxCPëw`Çý_×[JYÆ5è5\íŸF0ŸC©ÖνÅP· ­ 1œC®µmþ5ÌxTÂ<½ à(§Z02Ò÷f07“‘fCf„ÁQN¸ÏBlŒM¨']hq (È Gv•ámb,>ÅPžŠCÑð´‹ßÃõÓt€¬¬àv×CÑ é)ô¤Ð±¬›ÓÂß1® CoæK׸Éð·¾k‹µ_pv;Üé^µhŽÖˆ«»ƒ’Á¾ÉDIÜSxŽ FïêoG´¦Å•?ó—mj'„Ÿ£1ëfNŠ,w÷ïËo!9¦Žù™ÏËê5]"Ëgôý›>/ßÍã=„?A¿¢öuéó~?󵟡Ϸßù#ôq©á`ù™_æôùg¢ÐÉ ƒ†:_ÀݦÜk°Ó$•“#PŸÿ Šyuð endstream endobj 457 0 obj << /Type /Page /Contents 458 0 R /Resources 456 0 R /MediaBox [0 0 612 792] /Parent 450 0 R >> endobj 459 0 obj << /D [457 0 R /XYZ 132.768 705.06 null] >> endobj 460 0 obj << /D [457 0 R /XYZ 133.768 270.391 null] >> endobj 456 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 463 0 obj << /Length 1540 /Filter /FlateDecode >> stream xÚ½]oÛ6ð=¿Bvg³ü”Èm-Ð ËÐaC×Õ{JC¶™T¨-)’Çößw)E’é$]Œ<‘:ïûŽwÂÁu€ƒ_Ï°[š½>ç2PH…4 fWáE„¡ˆe"˜­‚‹Ñ&ÎËñåì·×ç!ïàRŠå@¨Fº³=j"÷Uæ¡¡PÈYƒAÆSAÅè;»¤v™ÚÅGdUaÔܾʊñ”(<º~¼ÞêÒ~gWÆ‚ ª¢' ¿ÐÕNëÔCˆ „¥lððB­Žqºò!!¢‘jpRî O)(öÎêw…oÇDŒ@”'z© t—”Ú‚n¶q™äÙz?5Ôƒ)¥EœSBÎÓi¶Iâ5P—lô%.í&¶ËgŒé]Ídet´Ê6q’ÚÃU²Ñi™d)ˆÆ±ýÂÞ d1 V˯´ôâÂoKË‚¹˜µ{R.³´ª9?¦jKÞ@WÚhÒuTU¬Ñ\ܬkw¡ºAŽ) IkùϘ0¯wTÔ“.tZ9’µ‰Jç¯?Ÿà,‘€pòx¥¶o¬$F†òzoÅøhá Õí‹3 é-[mqq›¤ÙW_nqF¢A\'‹".é:Ñ̦Ðy¡KP6I¯­L†k}”n7 íÐ ÿêU¯µÓ’D qöµ„ª\ÄÙ¨âMäåqotU$Kû]êÊQ., ”‰;‚GçÆ¡ X›»x“¯õÄx€6òy‚’£ÆÅþ¢'½X ­Ô­ Œè;°i- °µ¬y–´ˆµŽÝ  „aÐçf¸$¡dN)A"+ÄEzéŠå[»þc—‹»übïß»ª:ÙÛÍÛ7vÅv1Uªûý㛦 w+ô¾è ö¿.‹ÂŽÐÓVê êL÷>Í·•Õ½æg6¶•Æ£1»D¡´W™dnzj @—±3ó¡:v¬®ŠlÓ¸¢d[šXþV78©æó¤\ϯ“[m-a¾¶¦ÎóÝü¦Zæô•¯´»27rÏÈó²*>cQ?4­CËÊyêì&v U³¬ÜöK\¸sKüà1ù4„bÁi_LJfÆÌùóƒ¼ÂÞbˆÖ1p\;ÆÜ, 7ê*†™sC ·ù°«l½ÎjÒMáH 0{Íxw›.+°#ÔÞzÓ ÙØ®±k×cúÈÒ®â¯Giç_xØ{_µÎïïÖMÞºô@ñN*>S×~€¾˜ºÞTÊw/£³/5_LóJɶg€§äñ̤§t”ÙŠ {b^öM\9ø•]«±Û`¦Z¯J‡Ùu¡íQý:wt4 ßÁCÄî»Ú÷Ÿ~¯Ý÷ËììæÌ@q@À¨ph@AÖåæìâ+8£!¦d°«Q7Œ#ÒôÐëàÓÙG;Û ’œ#FIMŠ2f™žøëw3_#&'áËÌ}¶N×áô¥T­=2ŸÍ¦ Naæ5a0Y íé3T ‚!ÌÚäæ#F"ž„¯”Ñçûó‘ñ¨3™Öºi=]0leÛÛBjê@©B‚¨Sè@E˾M22 àò$Œ#Š"y{Ø*`wšXa01q>ðY]»Ù203Qâ$lÁÌDò¶;OÎ…rx žP$ÌXÞã٭Ξ@`ío3–`¨µfóÕGD©Ž0¦‘ŸBÎ#iþ´ç€DØIlÈ%ølè/SÆ%bâ ß5•Û<Ï h!!ÿ<;ïS _ÆvDpƒ¨p­¦ë¹Ä<%‚A)6>•ª~Oi>¥Ïz"`6E ‡5)FyšÄ…”á)ø2! c~ïcõubíæ×úçCaw›xo7»11C]å03ç!] ®¦0×—®›‡ ÄXÔŸ®›Á9^¯í¦ýÏTþßYÙ×ö6TèDŸï¹Øßð…Ç>_‡îíútºÝÜ_3üª}î™›ä¶`ëúG–ùʳrrä/™oÞk»Äû®ø°ñtÅß2½æÖÇ ÷P§|¬×Ÿø~ż¨õ:!×KÉàR`[  K(Åz7 ™ÿ\ endstream endobj 462 0 obj << /Type /Page /Contents 463 0 R /Resources 461 0 R /MediaBox [0 0 612 792] /Parent 450 0 R >> endobj 464 0 obj << /D [462 0 R /XYZ 132.768 705.06 null] >> endobj 465 0 obj << /D [462 0 R /XYZ 133.768 540.249 null] >> endobj 461 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F59 24 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 468 0 obj << /Length 961 /Filter /FlateDecode >> stream xÚÍVKÛ6¾ï¯ÐQj­Þ–Ñ[‚n€ ZÔ·¶¸m•H­(­áüúÌph[òÊIœìbs9œÇ73çóã;ïo|û}»º¹½KRgé-Ó0uVk'ˆ"o‘fNš,¼0JœUéüã¾kgAærÖ ¹™ÍÃÄw?ñ-þõÿOÁ ¾šÃ& ñ_=Ó¢QÕ^ªZ°JÏþ[}¸½‹³A$ß™™¡Lˆ¿UÍgó( \-ꦲë‡s7 õÝ‚I:¾·jE ØxI›^”¨Øm­ÂZU•š…‰»³g êeÑ %µ7›§qè~T-G”Wà-›{¡Ž(ȸˆ&0…‹0á1bÂï“îI‹5Mµ§"‚T5¼eíu_l­ž•°²¨0ŒÉ’j]÷U'#ªÙák*€‹–kT;ôïa¢?Ç[qøÞÞ¥ñ aqàeqäÌCضå¹ÐU¾&úâîáä—„oΤùgÞª\ɼT5¯Ið`˜%èØÿƒºa…ݾ9º~7>æ—\‹RIþëƒrÝí¿3}u˜’o¾ éëT2ù냄g#/t÷¬}ÿmúõ“º;Y i7 m¾—ÎËIûÑü•Ïכɔ§L`u)µôçRk_>5.ûúdTŠ:ïöµÃ•mj/µØHœ]¸k”~‘f®[Uçl½¾:Y°±.Éš ±‹yšy‹8O«OªCB€ÙnYwXQêÚ¢LHúî¶'2.}Îæ&YV©Åã,H\®­=2«YC‹c¨H7ö ófNEboÇãJ@·8ôEIŒ&Û2¹á@^¢ tW[N5 ìeê-Ã.90÷b¢TÀø²,8¨1Ãõ6=Dë(ôÕ†¢v±&‰e2E[v¯°T2)T ¤Q²Ô6ÇÈ÷2?'Ù©3ÚbA¢â¡Ð–ù`YqaÊêÇ£ÚÙ_rezœ¤.\Á­FÎJŒPÛç½=ÕÒ!»ÎÌ6÷d¤ô+ÍÝ»ÈÜ‚Wèa±°$D†ä¢àHrAx ¹°¤ ç$ÎF$w¹‰*Z,¨õ ­ÝŽ°L¼"OjMñtR É’R@ªï…yXp×)+5‰‘f,ü {âÝ(‡ÀuÂ{NRÛì.> endobj 469 0 obj << /D [467 0 R /XYZ 132.768 705.06 null] >> endobj 470 0 obj << /D [467 0 R /XYZ 133.768 648.458 null] >> endobj 466 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 473 0 obj << /Length 745 /Filter /FlateDecode >> stream xÚ½VË®›0Ýç+XÂUpÀØÔ]¥¦jW­”][!—˜\ë @’Þ¿¯Ê3!uÛãxf|æpÆ–¶Õ,íóÌRãÇõl±r‘æß…®¶Ž4h/ÂHsñ@këöCVÄAIÞ¨abˆu±*2ªåK5ÿiaûƒñkýU3‘ <äh¦m·|lÙ±áã°4 ²S°ÏÒø=IwŒÄÊåØvåé®cã‘­*ðxÜvÓ>ûOw ›Í£W¸ö n2¯¼YÊ‘û‹ò 1],ÔLhŒméùû쟛Â0!¶ô$rò›*Cš1º‘s’¨I”ÓÚ¶5°N˜:u(X²•ÓòUyˆÒ8N žã©Þ‹IXr4 ²­¹}»wçû*{8^×ár6«È/ó>¡no”f—Ü^eÝ1e›‘t"…¡Â^ŒÔCIPå$£$ïÐû.`îý&;èôÔBôdyèÃWçv Ä{ôâ.@¯)Äm¸ŽhñèNÎk±âºÕÐÏ®çr„]€” }IŠŒòÿ,"™oŒ†ôÄŠª!IsOúª&”Òãþ¥ßµáYzÊû¶ÎJš“RȹÍÆúQüÐ\n“8–[™ˆ+•© roßWEá0‘ˆ\VxLuÑ–u…ò¡ ÓUrŠF¶¸¬ž%ååQšS¾Nêlîý¼„ ÎN„{‰Qû1aý¼çrÞ`>G6®cüor¿¬ Æ+Cþ”9 ËN»|তñÜ0‰¶Lœ‘,U;êµ&Ûmºký½|~n¹ô™MtêÁú‘ŠJ`n.=T·={/–vÊî,ºÂ]áI> i\)‡ãÊ:s‘C—ÜÔ“ "K w@w«¤Q'P[4ªÆ`#à#ÔF¥<vÍÝúíu³¬ÀYqÏç=(‚–gÐRzÃ8ºNŸ¡GÙTq—§ö›¤CDÇžÇSƒ>Uóqëħõì/Z¿ endstream endobj 472 0 obj << /Type /Page /Contents 473 0 R /Resources 471 0 R /MediaBox [0 0 612 792] /Parent 450 0 R >> endobj 474 0 obj << /D [472 0 R /XYZ 132.768 705.06 null] >> endobj 475 0 obj << /D [472 0 R /XYZ 133.768 380.375 null] >> endobj 471 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 478 0 obj << /Length 1946 /Filter /FlateDecode >> stream xÚµZKsÛ6¾ûWðHe,oÓS;“t¦·N}k2Z‚N(’æÃŽûë»(Z¤ Ù±˜“@üv±/| G»GÞàþ÷»›Ÿ%4Ò’Êèn%$$’B!ÊDt·‰þ³¢],qÖä«êiõP•ùsQî³4_mËÚ¤ëo«<Û¶f³ª2³6_°À‹¯wEœ „³hIÒ¢[­,Êwcªs˜þý‡ê顺u0xŒ0¨cå|ØðCìÐ#·éwó‚ܘ~íy4AÃ<¤ÔøÓSÎèóXf›~EטڪsëŸ3¿Y„Ÿyrdô%¡a.£%üj’xØߛŒJwM—æ·vLãö›ñ/·]±n³²ðh#jŒ{”mHˆKKšoe—oÙµ«°¢ Dð>áD ÒyîRœ°„#ˆïYÔO ÂOí …‚)çÉ10?(\hÄé,þâ’"NÄ…k$e×S8S'‚ýyy*W0Ž„æ³Èe ‰„½-@—3(àbrÔºÊ-áÜIÛ@ÄR‰DÆ¥ˆ% ÖHPB2¤yÍ~ˆÒHA¶P"Qç#Ê1le‘ ´‹¼\Ù˜Í"œ Žôd»gã•jŠÈ,f†E„Lö|.\U÷ºR.ca c÷ž¯§ õô)Ës¨_0¦uÓÚ¯Ë}ÕµÆÏtEöÐõãÚTý¡N©@˜¢^z¸Ú4¦hS˯O,Àì~ZAŒãØ,ˆˆdM +!òg?ÿÐ¥ðlµk¹7  i¥÷¹éÑlùw s…‡s¬ëð®1~x*#À>§ñ‰Dª-e.ý¤ÇlëÔO8~|òÑ­U ôܤU›;¿ÂqO;H›¦\giëäQ·ç&çÄTÉt½.ë @Á¤ˆ®)ήÙú´ˆ÷&u¦ÖÜ—÷Ò œ’Üò÷NÙ £-ÞÚ 4vÊZÐ2€ P§.SfÁLÇgñŠ²õzK-W|´æ5~*-ìóû‚¸æ]Šå©wˆŽï­¼®õ z«¹‘pà½)š>†a¢ÜŽHkºÆ/ݧÏþÕ}?äÏTJÄ¥zN^´)z½| 9½Ø\ ¦øÏqs í™9µUZN»Äwaãr}Èe*°µC€£kWó.FPÖ!F— Z²É™Ù7!ÊOÑ´iÑú§ÖÔûA÷›úŸiúøoÓÂî{°!o×.ïì«®±¹iK2žôõ§Çt5zÔ]úŽw—=u¼C§;éW;Ó®Û±Ë~ºÃ5ÓgÛa ÅøÊHß»E–óÏÀ–iÛ¦´†ñiW÷vÍó“÷NÏŠK6¿=Լל£+’ÐýˆÕe«]}%âÑ¡ÙaàRDþš{ 5É#÷@MÚ7&÷nlΤ@V4•y wŠÚÁ¶6ã”8@6ý‡‡Ë’æ½Þí Žî ³qöÅÈcÏr»)ºýËg€¸jŸ«Þ[v4Øúñç'>´²¹  Wkfqõ¡8§ˆ¸¨ÈÆ3+²yE‘× Û Üº4Ûm¶ÎÌ;‹Úd¯¸jT"Ìê—ÇPŸµã(®Êæ–L·Û%7ÙãµÖ{§’¸³õàÅïlå UO¶ñZR&g9¾A†ßÔÿTu¹éÖ­pç¼}™ÖéÞÀ7–¹Q–xÒmg&Lݹªf‘‹Öù;w¬1Ç›léÍ¥CžKùZ “¶Äõ- 0UÍ'ŒòÌU1Oœ\¾™$p¡#×uïª!¤×Ë2пS$Á3…^V25ºó-Ãô:Ì]/“Z1– i¢”ö®vh*üÝ{WÞ®²=ñ«ÊÂx&©{þ¨=—ÑñÎÇ…;:û›ñcêo—xös:ýÆÎ+zV«5â@†OXm0€¤”¯‚^ŒXŠhW†"ÔA‘ã²°,ø]wýIú^¤õwX˵Bðì ý¹|ƒ¯âÉ,Û¤ú,5Ùf8SQHƒf3Hµ7ã°|$4˜)Œ)D¥žE&Lj 5j³`ªhúÚºBâr02ðfóØ ¼„‰~‹—¸UŒÍb1^T½ÁMœÁFä,B™F c¡S„Ý”ÈÁM…ñw†¶E‡¢ˆé˜µ}?7¾:ñ”ßÒŸÙû’ì¿“®wê|!„_NR¨EZû$ëU) •HK‡CGehúg.(ð\Ï OÌa,0 > ’Èp¤ÜÛú©<¿Ø¡Q{äˆÆ hCÉá_´-‚ÝþM] ì endstream endobj 477 0 obj << /Type /Page /Contents 478 0 R /Resources 476 0 R /MediaBox [0 0 612 792] /Parent 480 0 R >> endobj 479 0 obj << /D [477 0 R /XYZ 132.768 705.06 null] >> endobj 476 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 483 0 obj << /Length 880 /Filter /FlateDecode >> stream xÚÍW]o›0}ï¯à¢àbƒ ho“ÖiSµ){Ú&Dƒ“Z%†ð‘´ÿ~6g¥M3í ÛØçÞsì{ Ž±4ãã•Ó>ßÏ®®o01BDŒÙ€® |û¹Ø˜%ÆOó[aÁÀÌrZTŒ––°cf õüå`ç£sºe%¨†¿×qÉò,}âÙŠÅiiýž}¾¾ñ‚½PŽaÈXMŒ™P±ØÃæüžÎTs{O«{ZÈ1c5¶b«AVªg<¯ê8MŸÚ^ ˜ñ²Šy5•]߬KªÆ´j,²4Í,$â1¾l‡j>¯XÆL½W¬{^ßo‹Aๆ ¡¯1^Y6F2µ4ZïòXÍËJ EòÝ¥¹v¦œ¬ó©Ì¡E±i*ˆXÑšðég7šÈmy§Ù›À÷Ð0íO 5sÀ/XÐnÞ¯s D @~7¥Ù 7hÔwý^ýv'j˜éù>pü âšP>À!é&H°cH€ÝnNr¤O7.¨Jg• …€¸a7ùËÛ[ r ú¼Å¹â R0Á–×+ZÄUV¨P¹×¼y#7Ù†aBÃmîªMÁ‰Æž¦¢§ˆFA«ºà4Q=ÆuâˆÍö]¯KuÂõÛbø¬Èßk8Ñ© à‘fÚ¥XæTT–¬¶±IE±l‚–¾'O@ØÒÇæ ™·æ š;sÒl-ØOª¹¨\ÕÌ¥9©Ò.[•Ö‡æ41»“imXV—ˆ!*–¤-é#, }°­­@c MŽQ¾xCžÆŒK‡h"J8.ýVyè0[¨óí:‡ÊIœó‘О© n;p…©Aœ1]EøšËÃ/»Ûƒ¿øökÁ{wŠâµdú7{=´çr§t„òUü@Ÿ³íc7Þôº¶ÎÐÏÈ9ÚŒ:1cò>yH†‹7ý¢“´ð9´8]¾ ¡‹$'‰>9ò²äàh¹u«ÑE¸•õÝ›!ngÕʪNÿgngí[žmßÒ¹j^²eó9!{ô1Ï8åUŸù‘%ï¨ìßz:*Ú‹åøE´`¯²5-¾¼·´›FÅ×ÙnmÂVQõ”·h²¥•ƒ¡È¥lRKEÇB#ßëï…— øXk¾Æ…Or_Ò'!Ðqu|‹ï#(~lù§íµ%úƒfWøŠx¶ endstream endobj 482 0 obj << /Type /Page /Contents 483 0 R /Resources 481 0 R /MediaBox [0 0 612 792] /Parent 480 0 R >> endobj 484 0 obj << /D [482 0 R /XYZ 132.768 705.06 null] >> endobj 485 0 obj << /D [482 0 R /XYZ 133.768 648.468 null] >> endobj 486 0 obj << /D [482 0 R /XYZ 133.768 477.734 null] >> endobj 481 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 489 0 obj << /Length 415 /Filter /FlateDecode >> stream xÚÕ—Ms‚0†ïþŠµ£‘ ‰0½u¦v¦gnm'“Jʤ… `ûï‹PµŽ¢ÈG«§˜Ýì³»y à> endobj 490 0 obj << /D [488 0 R /XYZ 132.768 705.06 null] >> endobj 487 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 493 0 obj << /Length 583 /Filter /FlateDecode >> stream xÚÍW]“› }ϯàÑìTVTP§oév¦Ï¾µ‡1$KK„Óìþûb0ZÝ8ÑMûxápϹ!X|™yõø)=>‘$0!>é C‚ 8‚~€Aºßœ,ãZd+þ›Í]ìc§Zí .‹Lí³’âµkN…µ>ô™3^”l«Y^f ¹¦¼øîaoþ#ý Bã0.B0ÁKKúkØ¥;µW›4o(fåñ´™oÐÇ€ÛïÏ`º< Œ¢[ºÖÝÂ;s–äR‘SÂdzD¾Dq¿DÝéqIž ¾*Þ$þ†¿ÃoÔp²Šæõòa-L܇°ÚÊŸç"Èä¤äoÈâÞ"neéd~w^¨öÎÐÿ–Æ”K*˜ÎÙÄ iB×jÅuùo èÔ-riZØKo%céý/¼FÄqh™‰foeMR< Ó÷¢HÞ#ºÑø§¹òýkÝè®IpK¾)!&cÝ~¶¹?>…ñÅSÙ%1ŒB¿Yøé³ ¼Ø©¨T³È‘Šmii ­*%8ÓvQÚíÑi{ÜÞ^J»Ñü¹Þ°lÍ™5/Z6û[}:xˆ a†M=옵«<‰#GqfžGF‰=×µu³£šŸe†s7ò½š´1›#ì¼Ô\[ZÚ/Ö¬„ä%[XcY›4_i–¯õWÚQ8- ¾=‡j-sNÕº‚¬F«Z5«D‚5Þú4´à‡6¹RfçÕ1¹/.oäò1ôÜ €qØÛ“¤qäs:ûå–'( endstream endobj 492 0 obj << /Type /Page /Contents 493 0 R /Resources 491 0 R /MediaBox [0 0 612 792] /Parent 480 0 R >> endobj 494 0 obj << /D [492 0 R /XYZ 132.768 705.06 null] >> endobj 491 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 497 0 obj << /Length 1641 /Filter /FlateDecode >> stream xÚ­XKÛ6¾ûWè(/b†¤¨zJ€¦HM»=¥!Û´W,iõˆ³ýõ!©§éõîvOÉy|œá EƒC_Ô|ßß.Þ~„“8às»w8 ‰ð…ø!ážïÜîœ/îzÖÙºI¾ÉåÊ羋£ò´¾/‹ì!/Ži’iþMyº/ߘ5y£‰:=äSŸý´üzû«³ŒDÂsVŒ‘ØŸÈ?¤ßGòÛ<-r»%ˆNE\Ú²nŠõ0;¨Ú}ÙŠ©—XÑ^uöí ] wVœ’f”ÒweY?ÒcÒ€V.BW&Û;MÝ·IŽÕ"só€ßÈMôp˜&Ë•Gc÷ã^kž*DÄ!`¦t¢‘û¸G¼Ht‹ÒºÓP§Mºß¾/™ïÊ7Zs' VúhyÀIÄý)ª½ñaèžÒÌP©¿I®¿ÊÖ ª¤‡°G·bfw‹ô‰ën›¸ s‰ÊKßMæÞEÂM›k·ù®·Ô¸Ï¢ˆøtæþà£v/€]÷A0>ñÁ§î¿²*ÞhRð4Ë8T–šUuq”èôéNV†•šÕÙœ¤‹•~àho¸Žà€ð#8"¤²†A¸X®¥Ô}_0`‹©‹úñû{*·ò”ÖR?OÃÚ,NòÝã«WÓ¼õ†ê# ¬ÿCîÚ-º^Û°ßAH˜üƒ}œ»%jUˆ(Íœ{–ôƒuU'_ÕIÀ7Ñ[ΤœmÀ ¨¨ôê}‘íð®Ð3Å^ï§S[6ÕO¦U0ún™TMºm³¤Z êªîBfÇ&Àp«CX˜ö!D!^Ú£(ã`21siŽsFß­)ÜbóÜ6µ^“@YL=&iž=à­$ܶ–;¤<·)4§’e%k‰÷&•±š_·Y£×"$ÈCƒ•”²”•&‹J/É wÇÞ`ø™¹^‘èáü4ÇÚàñdr¢1™¶+Гk)‘ÄI=K¿Î|¤Õ‰Ž'áÀ½i~0¬6ßê  êËr÷ß&|Uý/—ÎYÄ835Ë2« {v]|¤ú[BAæ^ÝÞÁžæ¡”ó zÓ¤‡»¦¯¡g˜ Y<.£Oí æ`X×¼ ’ë­Âë"ó”îÖR7¡NÅ}ÙDU¶’#j+Ü,,ríQg,cÞ˜ÛŒ«k2…@¯,êâ˜0>ê+Tò-~¾]Ü/°,S‡9 ÀxÏñ‚˜p(tÛãâËWêì` #^9'µôèpG1P™óçâ³¥…&ˆ„W¢(ˆRJ°çZ=F¸Ï^E«‡EpªîN ®~{… 0ÁÙã€EôÕ‹¼§&¨ÿZ€ –ü°æ“ îÑ€J$bq¡ I â>®1[l ¶ûã6W5ožójÛXÛNâA—küöקO6-…ÃB*{ª¹­=ÈРÞ\²",üqˆ"k‰ùèÇXXÏ%{Яõ’™Ehš½‰L¥Šq€Õ¬i«\•nuÅVtڿ庞嚽1û” èsvÕɽŽvÀXÀå"Äì*T…PƒAf’µRU_mÐî$GÙȪî'*3¥ ƒ›*iô8“ImÈ"7kd&»k,TmïD¸.õ³“S¡u²¶]Ẽ{‘ÆG=ÃŒOàÅÃd'é¼(3êßhX1ìO‚bœ*u'|’@s¡i&Þ¦v˜CDRïŽÝmq,ÛFî¬ N’eæØì­’ü`HÕCŽå*Í À'é»G¨üÚÖÉñÜvÍg‡­3¤ª6½7ì–ó>÷QiúPµQ n­y¦¿Ã§~ M^Lú1„Sgo/dŽÞ18Tï$6Ò0 ¶Ó4¾ð»¯dÇjkÕu#©,UÓ“ŽÜÜMçw]zýü6ý‘þô‘¶t>µßžÐ‘~“²¼ª {w>ó‡Ü³^/7ú²šò´¥ÿˆOz\q!¸ìÂ5•íuO¾éîòA®1¬Ÿý@yy8 Ö\<ëYôÎzfÓå#¼lYð¼ÇÜÅ#]ÓæŠBçAoɈ]³nÂ(lþú?E sh endstream endobj 496 0 obj << /Type /Page /Contents 497 0 R /Resources 495 0 R /MediaBox [0 0 612 792] /Parent 480 0 R >> endobj 498 0 obj << /D [496 0 R /XYZ 132.768 705.06 null] >> endobj 499 0 obj << /D [496 0 R /XYZ 133.768 559.949 null] >> endobj 495 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 502 0 obj << /Length 1514 /Filter /FlateDecode >> stream xÚíYKsÛ6¾ûWð(e,oÓSÛ©;é´ÓÉA ´ë ~d©©PÎi¸ò`°7c"FõÖo „$1¦Ü>wVõÇôêîŠÀ*ÎHF†=,L#,Y6__}üŒ³|iÓ*»w[×EZi˜­²WïüSÑCB ¥‚/´ÓÒ`J1RÀÜÀ”‚H'`F‚‚*@\ªPï’#¡Ô ˜2G"—1fÏŽ‚3*PŽgœ¤Îcpg¸ .WSÒYÞ587LGõ®ÝìÚ1¯õ}ÛuæõÒÎ1ÚÉþiÙ•1‹Æ; ­DüÄÚÚoûÎ6&Pí>˜è¦^¼%ÂEÇã›'®âµFJsD@‹/2R‚ˆ5R*‘Æ:<Ýßÿóë4e¥ ‘|X!:† ²ÝÛR¼ÓGÚ¡`D 9«2†aøÏxg˜A̧Scx䪳·~tU¿'4ˆ¬SòÖvÆÃT‰³Î˜å«DEá±òX†“Θ[æ0˜SŠ”f à,×Hc+\€¼Ç¶âBmÔÌÔÌò#a1€k†8Uƒ@j‰89Â<„€ÄõàÒpðÿ1ø#c€Ïã8»$qBÙš“}`°sìè3會]õÁo¨ýèRo]/Qq”³ nŒÁ´!äñ²¸Ér”çpa„ƒÈì‚“àD>nN!Y”1î ×/Ü¥\™ÕÝ›Êó¢1ýû×àkX-«„Ž¡š‹–:ÖIUHÉ°Ü=Ñ/2OÐÂVd ;µ:¯j¢ÂT‚«ÂDĸ—"ÆõQ9¸kœeÃl]üð“û1Á£¢jÃÎÚÞºûG«bmBêîÆbêÔE¹6UÓ•¾—jÊ d’ñ¸ÂHZ' ˜T!tâÄ D™ƒ3+ÀÓ+°sµc²3Õn}8oÛ›@Ñήýtúº­L ¶©›$±9¨´õ[æ_‹®lzµ[Ôɘ@y$•„—YÞ=Ǫ٘ù¡—au°ïgXJÃô4¦c–á3”hцl¹¶éÊwû§K·Ý¸$<îƒØ¥}»Øïƒ8úU äƒ/Rœ¤4œl·\ï_ËãÛ)O٬årᶦ˜}f[áéí¤9îyµ¯–•µ;}æË‘<¤ˆãô÷ºÜ³ÎÊ"„“ø’ì_FÀyܳꬓr~°N¨!Ž¬Ó~ö— “¹Y­¿Ëœ]*üpdevÇÃþì‹ Š‹`Pð!Œžƒå×å/6–r«%ax­óÜul…Ís›z‘ž5@+û#zwOèÁ½ØÖ\´ò®Ñ´žäê óËþWvšdëéö™M4G„ç'Ä»¤ïU¹lÍ⵿Ø-Pâò¶Èù~0Æï…`©—\¸TK"Iö=Í(~r}ˆŸcŠG½ ŸŽbh“ì€@•–ï4¸e8JÙÈuö)xëŠþÛ¬ŠªpQÅ}t.‚v® eˆþ:êœH”øþ„ K¦‡:Wݳ5Õ<¸iYNŽ²é/¦½7¦Ú‡Á}DL:÷/…,ò_âÈÿŠ^vàrÉØÿö³Ê»cmúÓ™âtÌî»@à.¸¡)®`m‚œý'™»·ì endstream endobj 501 0 obj << /Type /Page /Contents 502 0 R /Resources 500 0 R /MediaBox [0 0 612 792] /Parent 480 0 R >> endobj 503 0 obj << /D [501 0 R /XYZ 132.768 705.06 null] >> endobj 504 0 obj << /D [501 0 R /XYZ 133.768 648.458 null] >> endobj 505 0 obj << /D [501 0 R /XYZ 133.768 400.27 null] >> endobj 500 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R /F73 25 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 508 0 obj << /Length 599 /Filter /FlateDecode >> stream xÚÝVM›0½çWøÑâµ £½UêVê¥ÛŠ[·B”˜ hÿ}mœPp’T‘ö‚¿àÍÌ›7ƒx|™ ÅøÉ›<>;p¡ë˜ð"€ç6t0Ž=‡æÌÞüÔXRê†mÚ+b¥ñ{’þaAìGi¼àœá²{ðŠl¤ÿò¾ CbÍ€1tí-šï ˜¥™TžLÅô¡Bû­GÂÒ4Jø€ÅTb—ÁŠboa×™µM8CÖ>r•²õMAsü ×'OæñÙv: xfC׆)†¹D}ÉuL´4£yÉh¡ó3¤¥‘_ iÍ *—ß7AÁº.‹Ít± K–&…´h‘ŽEÁ ‘¦.§¤{¼d.âæÚóx´›0Õ¿ŒªCï×S³´ýN³¤üq«5AïÞAO’pp ':.á4²½#adî}òÙ›ü8å endstream endobj 507 0 obj << /Type /Page /Contents 508 0 R /Resources 506 0 R /MediaBox [0 0 612 792] /Parent 512 0 R >> endobj 509 0 obj << /D [507 0 R /XYZ 132.768 705.06 null] >> endobj 510 0 obj << /D [507 0 R /XYZ 133.768 586.606 null] >> endobj 511 0 obj << /D [507 0 R /XYZ 133.768 487.083 null] >> endobj 506 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F56 15 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 515 0 obj << /Length 603 /Filter /FlateDecode >> stream xÚÍWKsÚ0¾ó+t4 X~{zëLÓiϾµÆÈD©°K.É¿¯„Ü0ö¤‡W«ïûvµ,>˜|ù=ã§ltÿ€#Âd%@Ób„Ž§0cÍÀw/Ï™âùœý¦ãIÄž]Éeþ,­Ä‚ž—‚ÏÜÇãŸÙ7ã}‚LãÖCωœUšÖŠ:—¤& õÃýÕùÁ$ ·8šü: †\–wû ìó¢¨nO™™Á€>Ú“;rɬFÁ´_¦b¢Úp»ÞÛ§ÂL,«NæÞë°½´1¼‘ÙÀnÝâ÷°÷»=ÌeÑ+²::°Ý84›ñíH—¤/å‘éPâãÉtñü?œ=û‘µxZgMn¹]¡"ün… œª‚þ\Î{ë‡yá U®3è`µCfÎÔà_¡ž{ìtÀ,„)/CêÔ©|¯G!zÓG9ˆÿ¥Ûá¡FømÖ­#^ ”WmQ†§ÄI] >¦K9'e®Ô t幈’ÿ/œÀil§Möh\(ð,7’ÖD„nI¤äŒ*·ÐïškaÇУ¤xl ÊÎÙ‚rÞúcUç›ëqv®¢"˜FQ§—¬dc„ò$£%–LQ·õÜÅÖ"ÛÍÀ«é¬),bh… ½¯•3.ÝÔôÎ,ÂÔ!²Öü¬Ñ’qîf„+áftŒbïErÁô¾¨9r±ï­´²Õnc%–[‘Ë×v÷¯ýz»ù†^¹5QJŒh:ÛöÙÀ^kô†[¥ Á01R)L’ÄáD~¸eõ9ýB¡Ž endstream endobj 514 0 obj << /Type /Page /Contents 515 0 R /Resources 513 0 R /MediaBox [0 0 612 792] /Parent 512 0 R >> endobj 516 0 obj << /D [514 0 R /XYZ 132.768 705.06 null] >> endobj 513 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 519 0 obj << /Length 1402 /Filter /FlateDecode >> stream xÚÍWIoã6¾ûWèÅÄ I‰”„)z(0S §5z™Y¦c6²ähqâßG>J²9 j =‘úÈ·ðí¢Þ½G½_fôÂúójvûU^LbÉ¥·Úz,D2æIî oµñ¾Íïît•ÝÝë£Z,sóuxº{<Ù)/ö:Éî¶E¶ÁÃO‹ï«_û’1 ÇÁPTª¾K‡ì4EûÔŒD?¤Fùuòp&¸9y°»™’9EuYëÃÓv’‹Î[9µ¾ßÕ 'ûlï-šÊkZjŸ®h)àæäÁî¿·Ô+1ÕäºÈßk/ÙÛ éúøºÈçöë8; šÛ[Ïiþ'–cKöñ÷AKÊ·ŒÑÇbó‘`¼º%o¿ÑYÕ[ʈ„÷–œÆ|¤]í@Óù¶ÉÓ¨ðTÓù=î\ì³Ì&-ö‡¢rtuËà^/@…ら¹ÊGOºÞ½}ý Uª ú¤[îMRicŽ%† HCG ¥KŸ²y©6}Y,ÉàyI'ºº ó­öM­MÌBçë¢É7ˆŸ[„­²¬’½rÐéÐ’VhãAgáRÎ$xȪ›p‹H$‚öNQNð÷®í•fšD{IוʶÆùh*ŸSÈh*…±7½„gHpn–áFej¯òºÂ/ãŠ&± 2UVʬ•º+°)“ü^]8³¡`åYCÃîhSì=Ás"ÒGÂCÞGH<< ¼®²p‚Ÿm¨#hDÚKîÛÙAí@«¬ZeÍ)Ù%eáÉļÆÇ$ã2w”Cæñ4é«¡OãùጫO£ÖÒàXŸñŽ:cl/mT•–z­6x®\ït…HŸ>· ±`vrø&ß´ êѵšš  K;wXæàÿÓÈOëSï’‰C xW?ÖIyÔyñ0a¤ ¾ß¬L¯Ë¤<-¤˜[½¸GrÀW!‰¡(Ï:O³fãúßÐo``ªŠì~ºÜ3‡#@KâúŸÖb©“\ u—Þ1=(uè¹w¬û5lß×]ƒóxò£¾ä¼tƒ0^à]¯2kÓ/«ÙãŒJ=æqSʹ« ~î¥ûÙ·ïÔÛÀ!X‰øqä=Ù«{“8Ša—yÌ~ŸøõáÜ'ã–5†®‡wNˆ”0ɯ"Vø„ 6k ûR¨Œ tøkÈ 9X-ÊlËê ¹pDúñ5ûŒ9ÜEêDz Âi—‡Un‹r_aà`—ô¡¼§uc§ñ‰›‰¬)†áÜÖìofuà Õ6ÖÕ6Ì#;Ú´ÃPG“î’ýÚŽ €nN€ºÒQTuQªq©ª&kÇ°Éž“L%X‘û᫉ÑIx ‰AÁCû7Nc¼qËŠïpZ@dØ9­Xÿ µÝ Ì´{SÛyÀk+]‹0@š¸ÍÚtÄH@GT¥¶…Ü€'\ŒË¶­µí1vL€ÏQߦïÛ8%aðÄaØfÌ‚‘“ R”¸ž `/‚ƒl:f.Œ`°VYæ ì@H’TÌ@Õ‰`©íLo]éæ HŽ³ß 7ä£y¤añξÕv‰ó‚Þýj7øI+U’î, ž?ÜfFM¬ý|ý_ÏHù´ÍM;2Û©Ê£›‚:®êù¿Ž…Þô?û¥a2)mâÞçéFIQ"!ç–<&Qäf*Fƒ $ð?Öä]' endstream endobj 518 0 obj << /Type /Page /Contents 519 0 R /Resources 517 0 R /MediaBox [0 0 612 792] /Parent 512 0 R >> endobj 520 0 obj << /D [518 0 R /XYZ 132.768 705.06 null] >> endobj 521 0 obj << /D [518 0 R /XYZ 133.768 332.606 null] >> endobj 517 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 524 0 obj << /Length 1532 /Filter /FlateDecode >> stream xÚÕXK£F¾ûWp´WëÞ~Ó­œ’M6R%e”ËîʸÇ&‹ÁæáüúT?ÀcÏLÆŠ” ÝÔó«¯ p´Žpô㟹~w3y÷AòH#-©Œnn# $ ‰¤ˆe"ºYEŸ¦YÑÌæ‚ŠiVç‹{S5YjêÅmY™$Ý,R“矱À³/7?Eœ ÅY4'i^_,ì{_ÙJñOÞ´·oÜ¿Soµ¼¹-àBìÒËm’¯æ ×dÚå[¿¾/³UxzW›Ê Õ4rîwn>æW/,V[ëŽy<ØØ÷ýÄÆ“ÀÉ—;îU…Ó<^Éùw¸:BÈ\*sÍ)†kìßýµÙ˜j6§”MË©’&+‹Úß7›¤ñ«4)übiüNBĶfÞtÛtšÌædZxÕ}p*Œ´`¸OÛC“n&M<ʼnpFFBrp-ŽÒíäÓ­`[]CºÝet™ÔYº¨M3îתÜ&Y1Hyg­šŸ‡õ‹l3»ê_•ÊË,;-ÐÿT‘œWqZ§ÜM¤@‡ Œ¸¤¯án"chN•ì@Ý`å©Z ïÅ×ÐJ1œµ¸S”Ýs\C)¥0ªÉ¾R‹”z¢)Öv¨Ê4w•mÓL»¦k/–ZrÓØVÌ4tè¤J¶¦©²4l[dÚÐRZeKG6ö #"»q?#ÂR±×G?h¸¢àRe›,7#]ž ÄÅå&o§TAhĘB¿ªÉ“ØŠ NÃê2R(l)r ½BÂ¥îë‡ Õ0~¨«(eÔ•`O©'¼°0{N±ÂÚdÃ"c›Î}Öìý“ Ì­ËÛÁñ>6ð…ÐÓ_ÊÆ´ç’fsÂ’±ôQ\@ `˜ÔPŽ¯#ÁæÒ‰bâ)Q@\T^E¯RÑ×;Ž Ì!‰üJ)†¯=MûJÏã²t‡ ;©Œêà¹XÄ4»ÁÈkØk$Tü¼d1€‘W #DÈg$‹1 }V\E)”ƒb¼¯ô<ß q¯ˆý1°ú8~ˆ“Žrýç[’¥>FL©ö ›V v%·>Þ}(CÛWÚIíN–  ø÷~D­7å]¦Z ¶|ߊá;tÕηUoNÎÊb0(Ë*ʦ/h›=:î ûY³iÅy6Z› ß:âær«9ï³ÎûM²]šêÿ=Ä»_OŒðƒ¯°;—Æë CìY{ž1Àú_3Æ×sÂ]• ˜Ðl'juAr*Èd6'ãéÇÅÓ2ßo̪‚êqù{_nwYžðús¶¬’j?R[Y;ÉÉ·›MæÚm xgLNSÀ܇­I:p<ÍFÿœ°œð €‘ÈÂÿ·±7Iíu/)‚Ióì3Æ4Mò<(gëÂâÛžukC ‡!0 ”ýD­îªê»AèÒCèÐ!îeÚÆËŽ1q—DB&¾7;S¬L‘†Âú´¯³z$2Ï Iu10 ÑŽôÒ²hÁ–$ö€èÿíêZâaFÜ#Ï]ºýßå=†¤ª’pf•4 Ä“ùòÛÁjd©îGldu;W;Ãz]û̱…†)Í»së‘÷¡?}=ã7ï>’45uíEV¦Ã´UàxsûaïF»};Ú뮬ëlÙý={ˆÔˆ`ÝTÞU3OjÆš˜Eä%³||™–Ð.•~¢b¡å÷cÖ…HÃ*w «‘R4‹Þ1hüÿ‡Ù¶ endstream endobj 523 0 obj << /Type /Page /Contents 524 0 R /Resources 522 0 R /MediaBox [0 0 612 792] /Parent 512 0 R >> endobj 525 0 obj << /D [523 0 R /XYZ 132.768 705.06 null] >> endobj 526 0 obj << /D [523 0 R /XYZ 133.768 228.995 null] >> endobj 527 0 obj << /D [523 0 R /XYZ 133.768 161.669 null] >> endobj 522 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R /F81 71 0 R >> /ProcSet [ /PDF /Text ] >> endobj 530 0 obj << /Length 2249 /Filter /FlateDecode >> stream xÚ­YKoã8¾çWØ‹2ˆÙâK"±‹9 °½˜½-6·é!Kt"´,yõH&ÿ~‹,êiæ1Ó9™&‹UÅU¬‡âÝÃ.Þýë&ö¿¿Üß|ù*ÔN°dwÚQÎIš¨]"S¸Üݻߢ¼9_†ÞÜî™”Qkª¬/›ºÃ¿ýcÖÛ‘ˆ Óåmyôd§¦ÅÉòG•½iÝV¤oN#¿¥+ëï8ÊòÜtÝý“DÏ%rkÒrøýþßp’=¥DK¯íHO¿(]3´¹§^Î/ŸoieÝfs•u½Ÿjðwf‘.ddg?*²>Ñ©ÌÙÔ~÷Ñ8&¤:òÐ2z(o™Œžn)àg«×gצå¼Å£”¨¹Ý !¢{€‚FWZÓ U_Ö¸¥0S¦Î=‹% @}Î.ž5¢PxRÊná á#0È›„^šº@©@ã…Åy7(Ëã$º¿UqÔ Ùlt@ÙõY]dmKßâ˜7 g\Ï6ó¬<¡^4Oâ¨{l†ªÀÙ£Á¹ ÿ¶&+Àô¸RÖ”*¿8óp`t¯³yná\öD‰`ѯ'\Ìj{—/HÑøIÏ3œ êx—NœVQÖÚ ZÃÕ´ß­šÂ/t84fàóå«¢K·fÆ)pw\ÏÙ ­|ŸÅDÎ4£d€Bpgg5Ê€ªø”U5 öŠàÏÒ²ìò©mÎîx{*"¹]Àå\ìZ}Έb|Ò~‰Öê3"b¾VÉÌ™"JNTuàD5‰iœîN»ñ¯1T¼ o|¥Ÿã‹o¨šªBËvKÖDÊîMh(•„©ä/`*•Œ~­ñbxLI"’õÅ\²¶/ó¡ÊÚ[GÎ+à?ô6nÐIØEWAb­FšÙ‘$ZvVMhú¾ÕÒD¬Öªê­œÍ¹i_p|Ì:ç8rc¨RÃgÕKWvÞX9DÁ˜nÞû¾àë¢4j Ñ-ÿ–'šÃЙöîJ³%4¸xªïB1i÷œýq@ã Ùí_×ûOãQ3û?Ê5s˜ bó¤NüÝƨ¬û½ ´Ûé ~œÅ¦-§Ö¸³øˆ0Ñäõ+±îöŠ&>s$Ÿso¨º=ú£¦k¨P\Ì}7æ< 3 ©¼~,Nõø.¼mÀóu»ŒðX¬ÝfqÏ°wé„‹•Ñ^Í~ÅçÚ^>`]¡{ž1aù`úCÝ|ÜÝÞú—;Á|½oÿFàÄ|÷,!Jëµ!Ý»°lKÔ¡Î]Aå6®â“”$M§L$:CýçýÍÿnlŽï(Ûhô‚CïòóÍo¿Ç»á] ïžéyLjVFÕî¿7ÿÁ¢{%1,º-«4Ù毱V5¡>E¬T$åÉJ¬óÑk¡*&PŠŠPÅ b%t,õ®ärÀX€‰|‚\‹\gE4J@ú?¥²>±éÐf0§“¶ôÂÉE†„i$º:n*9Ÿ6¥.VÈzLm];¤/¦]µgI—®ÎõµÄê®o‡¼÷Ó#³² =³¦]Ž«“Á»y\מ§ruo(¨5¾ˆÒËü ОÍo1å 8¹oò@í;ô ¢Kw”½yÜÐ96ž„'n˜Ê¡82yïRw;]ãtr`JS¨xäÛ¬˜£aPBÅšÿ˜UK ë‚›Wðû¦ sЧâ3äZ,ÖrG¾.”ô\تŠß,³xæ™0áѶ5jÛ ž4óv§DÒt}ƒ9Ö5ŠYú¾¦áÍyûe¥)Ðh¸—˜ƒ©Á‡Â§P7±(¹~çiÓD|†\WœJ¾–ûÊÛÊ5a)û©‚/×ú´¶ª™CB¨œ^9x•ÒXx÷ƒ»ƒ‚Ÿªèa°]Kë~ŠºwÂ]+¶$`fñ^áã)G.¾ßSY¾KjA±ñzß *ulA†b² \N= ÇúCFžbc*à{f!æܼod¾¹©4vÆD5%TýØ{‘BÄO9°}•÷[›Í…ÑTÓEa,ÀãØ_•yúòô2•ù8{jn5M›&2…B]o¯'±Ò6‹Mg³Ür¥É"˜Ø5mì »˜”qÝ^>vÏíÞìÜÖÆÙ¦-\kÄ7ëߣ·cÛŸs‹þ4SÛÛœ¼mŠb¹Œêá|t¸—Àå,Ï-|;¿ès>~Ú°D¾Ï sÇq[Q`ã'ñ¡Ü..â+€`í1ë‚­é—‹ …/xô½VÊ_i[„šqiJg‹€iåÓ*—¹•Øå¡ÂÐå"0÷\ö8êÝ÷’IF+¶IwJ(Û„‡n¸\ªÒñ°½äÑ%;?Ú²ÿD¡#SúôÆÒLßp`ªñKþ+ÈôqÁR×^FÙû%ß«·s­é‡¶Æy¿W¼`Á¨6ÿj"ET™Ùˆ+ÿ½ÊÉ’bLsDÀÚÝ'/´vÿíj½cqúæ¾"pÆlÖM_µcídeB}a¦‘ÓíÖ°±{2±£Y©ãüÆ¿ØL'$ærú”äèSð[5ͥáÇÆ":¾àœÏ›ù|LûgqÌ„ÙjÈlÁê©oM=ôJj’¤sÒޚܦ ðã 2¦©§Œ.àaJÇ?(Nàÿ°)õr›HYRMÕePbPÞÚ ‘R ÷Ó8Y‘A\ù?õ®»” endstream endobj 529 0 obj << /Type /Page /Contents 530 0 R /Resources 528 0 R /MediaBox [0 0 612 792] /Parent 512 0 R >> endobj 531 0 obj << /D [529 0 R /XYZ 132.768 705.06 null] >> endobj 528 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F81 71 0 R /F56 15 0 R /F64 23 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 534 0 obj << /Length 3375 /Filter /FlateDecode >> stream xÚ­Z[ë¶~?¿Â@_¼éYE¼ŠDŠ)Ð ‚E·OIp µå]áØÒF’Ïfóëû I]—¶7Y?I"G3ÃáÜÉtõ°JWÿú†ç?î>|ý4+›XÍõên·bB$™6+­²„ µºÛ®~ZwÅÍ­|½;V›®¬+úbëö±>î·~¦)ºcSÝür÷ý×ß6E˜šÄ* r÷à_y ý|ò—‰QYÿ×J›hÙÏ3??[ƒL,àÀ7 ”‰u54Ïe[|Ä·âë²û#k`Y’rsv 38K”â=|rs«”ZßõRlëc³)ZúouË p³luËä¾ÉIÄ©]ßþ™o·ÅÖ¿vux£ aŒ” O„8-Û=Á|øç݇_?HÒ[q+WZªDfvµ9|øé—tµÅä÷«Sfõì@+IÒÖíWÿýð¯-3jÐDáPA>Žf¾ÁÚÚY%B‹«ÍùNÉ–Õ®Ží„H¬´ïþÅËî©hvus(«ÿýsªÒ¼óíðÍ"Âe)覃jòß^/S²4±’]c™’yngËôºY¨‰Ô=g›|¿ouy½[Ád¢9›k]T[˜J“ö¨á—ïYS"IÁ$¡\WflN_…®1015§ÛëËBIS›(!¯A•3b±Úí6B”›Ä0~¢‚%:#zZg¬wâ¦^+ Lv´žÃ±íb&&!ݨ¬¶å&ï R?ÆÖÏy^ÿáã^Gî½ yÌñ’ÝÙ)x’ÚA÷G…"57 üÎ\ÍkpóMÂÄÄÀ_"䘅àsr E¹þ±î BαTò'žŒ8÷]yû冫u¾?’3w“žYÑûÜWšé½×ÕþÅÃÜ~ä7ŸoXº.¶‘EPH‘êÒ¶Ý Š´–/|ÀŽØuAŒ~¹aj]4Ž¶AÈ,šA|VÒm* lëCÞÖ;?&ílq&,Û‡À%óðØ°š^ºû}l Ü©êaŠ}q(ª®³U‡ü¡ ý±Ú…àˆ7äBÃêÕ\£Õ,“VIv”Í­Þåà™6I&2‡ ~Ñ‘=¶°–hKÅ t]íwŸÖʸ3!zæ7Ð.'0mý8¥ n 9•»—0êö†ñÁŠ^¹Í|ÆB£M^=„W·³½-Oþvö¦àhÓ>ªè™=BÈ騯7A§—ƒåvY"ÑÙFÜù OƒÊÒHÏ"¦ÚüÞ¶%T¥õzˆ<ð Ù°PŒ¹…NçÚ²ú쇦.ÆʄÙêôË$­KÕ ­C04©8Ÿ©¥€Ñ+• §qï‰ ©NŒ´•Âó|¦&¸½ ]‰xÄÌœî‰Ð«aÕd W ª5¢ŸžSÝ5E7,€÷Û08Hm'ê¥aMG8£?QÕuþ”p9k¤}PÁßžöå¦ìðƒVë^U˜R«œëÊ}±Éa©øU¥®*qÏÖ?´4vPºïû—X†Š¯r^« K8r¥Y’Yñ.A™p&*…’â¬Z ¦få5è Ä`†ºcF7®VB¦I†p} ªÎDz9ÕM}x:v‘8! ”]…°°sº»}ýSgåó”ñMAòsµó®ÝRÖÑ"3¡wá]ží#^¶ÅSQ!hlÂw^åû—Öi'Àý“CÐÒMçŸ.þ8àˆ‚rVR{VA……CpÒ&F¼Ë ÌEjh*-ìeɱIÍ.…‹€MX;%ƒîå¾è+wØ‘ZäO“ddˆ!ÓH´Œ!î}çRRAÙr¹yôcUíŸOM±)¶®RuúX-Ø Åf „÷azW«0äñ{BÄ{:gº'+•K¸ÜË”.>ûž…jŠXîÌ3Äy1yN…'Ï…KŸS”úêèi,®êÖ Ì@œm€äí=¬D˜ƒ_˜% ¾™’yÁäôž°¹~JFñ½©~ª/œi¼ŽúWhÉ.øWÀ@I•ïÙ;ý+ôÖdUT3ý]zWhcª¯A•š̪9Õ‡¢‹ÈÚŒ¼ Qdv(fD«¨C—HÖÙUhÊ ÷œä‹ej#ÚPü¶üœ¦¼i;ÿñ\v±ü¤úr5­Ç´°õR_Qߊ'æv›“} % fZÀVÂà . éØ?=Í…˜Ç |ÀF5ëWžR )a2mx#oç˜èÀXÞ6 QS5ùìg§1…æû˜Ò'I,MÓ EKA5ß“e2xRÊý£)òmp`½X˜šv\—N ‘A™ìr‡‰AfÏ Jáö£oÿ4F å±Ü¥©MÝ Ì>agÚ°Šz\_u†$aÙ£Ñ(kvM} 7TupƒeWæûòwçÁ0™7 Å&zÛp‚à=“ôƒ§SyhÆÃSç’VêZcü®ÿ5ßtÈ€cácºÃó¬Á%Ì{à:Ý€O‘»&³†cKî=âq‘ËÛLžO¨?— Ë ¶ïq H-JùVw¸(mBÙ5ˆ’KãfAµÆþocžñ…‰Y¦"±O}:6©a êçÒEtJÓB3™ üžÈÎÄëˆÛ‰¢¡Rú¶}*6%©µS4$|„á>ß|öpȦÁªÄØŽÞÅÎHdÄ`w."¤ã’¾'KÎ\Lû°PÝz=þ i”äÌÙ8ìž j›Ðrò>;¦b](CS6p÷¥.·äªÕú«ø±’ƒ@ú8š­‡F4}šuñ+é–›ñ±Éô–QºXŽ±©‚úIótÄ•dê¼ó¦S.,_¦ý¾ó2 PÖ¡bYvÎy£¶KLf®BU¦P–lAõ¤óF¡“¹štqà»ß“#G~ô-yk³(½m(¶ÍùÎ?£ãα<9m$vlµºŽ¿ 6BuS>”U0TŒûÔƒfbV‰Eeâ¬Áš` ´¼ýr©Ó¼4j,òÂ]½ß{Ï×wÉîCw Ö…ã%±¦Nèå"Õ˜9¿mè¥d)ôAΣŷ»Îy2ë³Àªl½°:˜MEû!V&ÙùnW È72JŒÙûú¢<Ò&”‹ Dî>í–âR÷6´H±ÔÍpZ3/82wê{6#8+¬QØÔG¹ô<Ì9Ç+P•Lºsã9Õ“çIpqg3¤vbÒ4‘¢\–|m[oʼëõýPê&äëôø°rÑb&¢Åú±|x ™Ý~r¼·÷³eÞ‘gÉqjéYÃÔÌi1íêÐÄó©© ß—ÒÝT¡ÿ-bÆ«sõæ¡}¢tÛÂ׬ûSÚ¹tquéÕÀª!+r5,Ü•øKYmöÇmá£ãß y_“"$b¤„eú{I1ŽþÄŸPvÕÕ'äNŸBÃ÷¡¢{#Ÿ>Ñ|—."Ð!0S åëÛžÏé"ß‚<ë'ï‰>Ʋ«7áÈ_Þ‹¢Ý<Ûã~@O<”_Î ð Faá,ã}ˆ…ª¾,‹702 ¡+CßÄâ=ñJ>W-_5èPºS¾­¬ëªºAŸH…—öQ@ºþ¿îø´/üX•Üe íÛÍnö1̹ãÌS““櫶?¥ŒÛáä쟡¨ôGý­ÿ æèé3:>ðÌÑX`Ž^‰þld1ËÇ+nØå Q,½F&±môr6,”@£Ó£QŽTg뮦—ž^:†OWLã³ôáê9Àðõò¬–1Kå"» ç{ývÆÙ%ÆÕ‡›äàø œsºÙšÉ9ëQ¢P§ ~š¨§gsšç,Dóe?i.}ºë­Ï{ÄþÌèkpïÜÁ¾ê/‡Ñ@hfà´‹;¿ÏÓ5ÅXºåí€Ø=‹¦-*¹±,aZb‘ÑŽêàYšÍ °÷ÿ#>GS endstream endobj 533 0 obj << /Type /Page /Contents 534 0 R /Resources 532 0 R /MediaBox [0 0 612 792] /Parent 512 0 R >> endobj 535 0 obj << /D [533 0 R /XYZ 132.768 705.06 null] >> endobj 532 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F81 71 0 R /F82 101 0 R /F64 23 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 538 0 obj << /Length 2221 /Filter /FlateDecode >> stream xÚµ]ã6î}~…{I­,[¶Œ+ ´h·ØCqÀárOm±peÆÇÎÊöNgý‘"íØÏt{›{²ERüHŠ¤ îüt#ùûýöæí;™È•ÛCF‘H$:*ÒÁvü²z_wÖåEW6õz£´\=–Ý=ýý`O¶ÞÛº°´þ®Î«§¶l׿mÿñö]l&¬e° Þžç½+ë»õ& Õª»·ô³gnëM¸*–3Ç[X*³zdðÁÙ½­»ê‰Öµµ{æÖÐ÷dÝ¡qG\Dg‡¦ªšµÒ`à ¾Ê|ƒ{C‘i6-ëÎÌê§7}Z‡z…úEqºÊñ“¬œ­r:\íl÷h-/Ú²~ ¿O©ZZçõž˜œš¬(óŠw4½ó–/ì9¸æÈ»—”=å®+‹¾ÊEòÌJe«}sÌË0ÎV÷yG$eKh:TyÛhª×³Q/Bs¶=5õžNù5K Ú¼@¯‰%Ÿ‹Š&¼à˜#™®Þw/òšI›£íÊ£m ¾³.@:|ø>JP•àxùH—ïïÛ†Ö!°µ iôéñdä‚êÓ«P:5Àµ¼Ë›Uã–€ˆ@l)Ûžþ yÙ`i¤V[¯œ\Ó5ÝÓ©,¼¸­ú#?ž*&)[BúÏŸŸXšsùÓ’ªû¼Ë•2"'Gç1”€Xg óÈß!|BÞóÙ£ÁQ¼u—·¡¿ø¢À͹ÁàzÚÎËu sªdÂåNFC„ÀßÔ«`é ’1ÆwŽP;ÞKÇä1EßyµŠ¹©é;Z45Ó6Ž¸ýµyȾ£*—~  S³œF§ÉΫ²tî&&Ï Q—Ê‚Ä‹ï<`Iù é)gèš}O"ægKdô9ˆu,óÊ‚Æ­­lÁ¡å÷¯jrìÖJ®z¦R¤î~ðo¦w…(JLø7†ÚrdÍC¾õ1Ÿ¬¶k!9Æ÷‚úù®â÷ÅÇ7|Ç䎋!Èäê˜×婧|Lž÷ö]Oß·8¡T €âº­^*x¦B3Ò@|â9|*÷> é!¡ÀÏÅcâA}]P”ßñ¡¾ÚlB¥D‡ÁFµ!?+ë¢ê÷ Cëo@Ç·‡ªy÷ß.òÄÚn‡Tb÷ö@»?|€íîÊOÌ Wàå+ù9Gà›_¥–o•…mÛ‘à!âüÄ¡0q4¿bÿ`íéÌþ˜óâ Ý:n—nui³OÑ´2Ã-ýjÊýœeßZ·ÈsBŠ4hÀß=Ýæeõç§ÃGPÖ‡†]@QÇé -œN2eß寲Ȣ) ÷A;õós™{áΛĈ4Vs/ñÏO,Ï»,:‰Î.båæÇíÍÇ› 2<“$ˆ²H$iÇ›_~“Áp`ˆ2÷)pB-bðªK_ny¨¥ŽŽ= ³¯±<Ô‘qâYi`õªs…F ©’«È5FH¼¼©ÜœKfBGñ5¤ªP 7“Z4Ç ‚ãL¤QtÁZ‰T©¹`|»œKE ˜Á¹|?„¥…óÎ]ÙrMƒ aЧvyÁض<®ó- Â˪"Øέ„÷Qÿ„±J‡ÕE"Ÿ¸Q„^cÁm£YIðbÙ`¤9ÓÃ|GÕèØ™FãUL;Óhè½ÂhÖ{Á6zó°`„ÈÚ,hnØ=_hVwý‘+ðhì½é1³‹¨ÃÇËMëëÖ₽‘¦¶d¬ë {‹à*¬Ó‰Š á>þf•/¬}†\&u nêÀÙA¥ïöÞ.×®ÐM w˜ìÂN„8{‚ Ë–ÖT›Áëf²¹n°>øŽÍ`#\úÂÑpÙ 5t;ùÀÜ[ßñÂfü…-)K#Ý%ò÷y`Á„Ôç±ÎR& ¼Á½á›Úpª÷ßI~ĘêqBägÓm¬$Âp^ó(j‰ù½ƒõ`¸Ho£Ó Ƨ¥6Û—o†¸û#†Ìè³%w }ñŒ‡Ÿq*t4Ñœai¶cÒyª‡_± ™O;M:ç·4î|ipš>œRM@ÓY­âD» ¶ÐDQ ®e*¢ÖiNÃXÚ0:ù2<~qòIbåìj"—Ô„ij?Ȇ¿œPç»ÂaxMÀ†©Y‹ÉX6Ê.¬æá®ú±/Ÿ8é”-¡1W=@cƒk^xš¢èÎ U2Î=Òi)†NËþs .<v:VGÿüÏÏ?/…Rd*œ¤ äùÝ"?HzÙë/J¤Raà ôP]f—ÃbÏJ«YÊ›ç™)‰¡Miv¿ÓNíù)2œÍÁ'n9jx,ÓtîAg)ž%?æðSÖí qÙ·ãêKTíM¨†±Æ5æSéËC—ç#© èŸûþò´e2N¢Á‘gùÊ4êÅí§hóÿ0Rúsë(›|Á¨íKÌû¿hX7µýËú-Gí&.7 #E¡ IÊOH<óPšÙˆóÿS« endstream endobj 537 0 obj << /Type /Page /Contents 538 0 R /Resources 536 0 R /MediaBox [0 0 612 792] /Parent 541 0 R >> endobj 539 0 obj << /D [537 0 R /XYZ 132.768 705.06 null] >> endobj 540 0 obj << /D [537 0 R /XYZ 133.768 648.468 null] >> endobj 536 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 544 0 obj << /Length 1711 /Filter /FlateDecode >> stream xÚÅXÝoÛ6÷_!`“‡ˆå·$lÐë€64Àº"P$ÚÖ*K®(%íþú?$K¶’&«‹=$"Çãñîw&¶~]aÿ}u½zñZò E©¤2¸Þ$HH#ÊDp]ï››RW7ÛòN­#AEhf­Ò][æ]ÙÔŽøà õFíÝç¿°Àë÷×oNPÂY‚R1“Ûe&r÷ÙÁËÓMßæÊ@ùÑJ‰–ÄÜ5eñ€›V©g«p~5Kù‚fgÞ}z@‘­êÌê².rªË¥ÏÑE&(æ4ˆ(H"ñ¨‹Y\ýr½ú¸"àj€H0&Çœù~õî= X|`ÄÒ$¸·¬û€¢4IaToW,¡DÆ(M­$gÛ3§šžM©D„ÒKœMiŠ!óÃë¦VæÔ¯y2ãE á Ì2euáxNî‚hœ<‹–£ G‰Oè3LǸ‰È‹Îx‚$>9܆é’턹m×B€‡ú ò2«Ü$Ï´ÒnØllC¡äQÛò#pëñ˜!*?ݶ‚p~|‰ÃãˆJ9?¼¬}·d[ˆA» ËEx¤8K1 a-0Âî ŠùUa-ø\ZQ"‰Ÿ× ‰“KN GWæ‡?× qB¸ZGTàPi­êÀY}ö„}¹†œygþe,:z×Ø›à“jxê ¦—‰Ï¬É1ËOóºõ°ÉêfAC’ïk(“­>VŠQ ™ï¬VèCÕ­Íê­öC©³…Â.â¼WVn‹Ï*ȃJD3î3-ŠfŸ•õ3ÕkЉs"£¢~f·ûjU¦ÎT†/ä_Œ-‡<ŒñU(Ã#@)Iñˆ ¨¸ÈÙRKçg?’~%ÿæ'2t|Ö<<ñyc7÷üFøÿ/¾á^N0u‰¢Øäfð‘N@J!Æ8|›ïTÑWe½·mŽAIð­ßv½ƒºÊbnúÚš;«JÀƒ%Jçmy« 7-k÷ív f¤•o í²'n²²­¼„ZÝ»i}ì`Ÿù¥[®îoÿ1^´EUqbÇ|gœˆ@ );å|ÎmoD7MU5–÷ÆŽä/éfyfÂêb½6w5#Pı4{Ÿ_ÎÜG;ë*·wÓ´³U€Æ ZûuÞ×È!eIçWÆ(ÌX|³&8Ìúª»ŠHÀØÊ-eÕ¶iËn·wS§ªUÍ7ojˆ™ÞšÒ‡GuÍÌzÉPË}Yeí\D·ËüîÅnŠhàå˜*¯zç¯/7AÄà‡iÅfaú²êT[gÏ D„ #E—§Œ„¯UÖCPí÷k°´IAÀ·ã”QQîU­-^ y¼¦s5ÙËL¯©÷µáWÀN.Œ©EÍô¶ªVmÖY[“™-AYHRÐŒvÚ­AN\êî!F)ÛØ;¯¢\L¸pm‡g,ÔAÕ…ªs¸‰ŽACëb|hÀÁ¨=ÒjrävE©#6èI)>)ÿ]fäRcvg{‹a£•[œháÖl€®c0nݦ4·b;vCsôOeÞlÛì°+sW= Ï¡ÑåÔûhÉ.E¥lŽ0 ˜¨h?lÜw_Öô¬êµ¶’&ö2óR6éÌ&ç>¥)´Æ,\uh›OpÈ¢S£wv£çrþÖ´jv*Ç&àSXšËÒt¼MÜí€ÔÜv™õÐ4TâÁQ°dÊÊ-d]mªˆã0éÈ,M@ Ô1ô’ímvc‘Û¶éÚ­ )‡¼æˆ¶ÁrCgfyK3Ÿ˜öï²5ÅþÆ^rm‘#h¼£Úg»†Æb ÇàŽh¦µÏ+½µ+£,üs§|ŽïõXÎÓŠG,]¹y·SKá á„cñ×ó~ë&çñìkÂÑöôÖÓ­läRJ¡JŸ<ò x.\—Uô­¿vV·-™ ·ÎyuìÆì7sŸM_U'¨.ÐS:·áýhÚcWÖyÕþ%ë'hu^Œ2w?/ÁkéaïÏñ!ËÖTÛxùz<2=ûmmåÅ; _=¬ÜÒöãáÏÿ³€AÏ{cî?>0.ubI;}ðGTí$Mç}¹]ôl‡ƒ…‡ì»i›½#[À™Á˜̺ÚluR!ìÔUÃjk²¡ÝzV—Ïçô¤¬^z¡Xj¤}¡ Œ"Ì.ñ@A¸ˆwæhæÅšenÈc šëY“ŠÇ&u‡tö(Ž©y™A\úLGp:ã‚{ÿ G”7× endstream endobj 543 0 obj << /Type /Page /Contents 544 0 R /Resources 542 0 R /MediaBox [0 0 612 792] /Parent 541 0 R >> endobj 545 0 obj << /D [543 0 R /XYZ 132.768 705.06 null] >> endobj 546 0 obj << /D [543 0 R /XYZ 133.768 409.768 null] >> endobj 542 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 549 0 obj << /Length 1308 /Filter /FlateDecode >> stream xÚÍWKoã6¾çWèE^XŠ$S´ˆ]´À¦@Ͼm C–蘈-ª’œ¤ýõáPÏÈ©ÝÝCO‡3Ão^Tà<9óÛ]páûëæîþ3Gø‚GÜÙìpû< ¯ýh;›Üùên·ª>nŸÔ‹\xq»¸:JÛSZëòêì óóQnŸdƒ[A,þØüî°ÐOØÊñÂÐñHé³”e¯´U`uš%( D-÷,xêñÄ_³Èñ¢Ð«ô—…Å[ɲ’µ,š´/‰§÷ôm’ˆÞ®²ÔÊí,£¬TÑÈœçZOèÄ;'øEÜO„°NñËð‘öjžåзCâ ›ôù¢âriÿ z²ú+.Þ¡¿Zúø5è£PoÙiMÜ”–{ šÁIØÚ¥E^ËÄÊðìq½kRU`°pEÁ2hðBæ Æ, 6.{}<êÜöÕÈcœ÷ç"C§ýkb݆dÁ\¬ÑóíQá…æKÅпKÉ\7 ÄÆ…%®*r…€¼¨üœ‰×â΄ÅyVþEÕÊÔ¦o.Ëæà=AT™ÂÁRק«óEÚÙ´¶ÇÑx4‹Á7GèUdÇsnû 0¼oAó?Ï• Ô{¼M¼Òì`‚75~[Ô–ÚFŸöÆÉ9¥è‰Uˆä’è­Zî¹–*˜µ4#wuáSKYŽåJ@ý¿§´Påù˜RO‚j6ä"ŒÝ·òØV0° •ŒežŒFXBðÛØ|#@yo_$ÀçÏ3î#µj%ü…Çx@Þ£G;h?¡kÒ—ª¨Un½o>¾¡I×(H1†5Ó¥j§ˆ‰i3•O–ñdú 1Õ·ç=¿˜÷˜%rþR´0ÓµàzÝܳ&‰Ú¥šãÍi$fgìË`</iŸ&òܨþ €'ÔöˆÊtÓ¥¦Õß²ÒD銾'hDÙª¦ Á:W' 9d¢æ±ˆa¦ÕV6mUr/«JZcUÅq±Rž$Â=ÉÓNV&[íû&ý®‰.ÚMl†¯–™}ͼˆ¦cÚ?Óà`]jª <¡[‘-¢T=—Ný%C±6Çñ‹À¬QM(¸[¦U£pð ·÷Wèì@vÝ^/‘û€ÃAº¶"…Îeg/ƒ”±‘©Źe¼éõÎ6Hº¬KgóÀBrqÁ§}'¢ºÓð6ÂÙø6R —ØJ¸ûzP?먢˜17ãàÈxÒOx'Pp¶]S {"óWQÛƒÏTK¢o½¤,3±pÍè„D 9$å VâÒº¿'Æ«´¾¤Ï‹»¾á¦ÄÌÎö˜¶ÒÖcÞeVl…ËÎÂVHùq,Æ3—ŽóÐ5¿)HÚtV·…Aæ™Z_jÃ…vùªÏPÜ#×àÔ,¬ðûä³8¼XÐÛ&ÅÄ'IÍ ( Ͷò¹˜¾ ™âÈÎ, ºH¨š¾òOzÞ¡ ¯\x·«Ê<Òa… ÷¤amÔúdwà}W«]+W¦yNï;X¤ÍÄi]Ÿ$ï«jðrŒ·–Mª vúǦîcÉ´½ vËJ—¢c`ƒµQŠ±.‘€¢_=ØÙÙ“ÐÜKhŒ¦»ÉŒwÿgÿ']Ö¼M#þNûÊ'b7ßù‹æ†/¼ÑØX:¤õ6ƒv•W²¸Õܵ¯é_SÅá›Þÿ À´<(¯ÄñV€Ô²Ñ†ÁèÈ—ÍÝ?Z'Þ endstream endobj 548 0 obj << /Type /Page /Contents 549 0 R /Resources 547 0 R /MediaBox [0 0 612 792] /Parent 541 0 R >> endobj 550 0 obj << /D [548 0 R /XYZ 132.768 705.06 null] >> endobj 547 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R /F56 15 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 553 0 obj << /Length 1690 /Filter /FlateDecode >> stream xÚÍXÛŽÛ6}߯Ð9ˆ^%- ´@S´( õ[Z™^‘%W¢w7ùú /²-[Þõb]´/öˆ—™áðpæ8¹Kpòë >óÿóìæÝûŒ' ©ŒfÉl™\ Œ$9¢L$³Eò!ÏMWÍï̽žL©ûÚÖ¦©çëbšÞ¸¶Û¢^Ìï´oZ½4ó®\éŶÒ±À“O³ßNä,™‚”(ÿ¬õf¯Ü)ŠzóÉ÷^Áô¼†—¸W´ÖÕÿÖ¿n»|>|ÙËÝ;Ùÿ½¿T’<¨4µꚃ§z}«[çɋ⇑8Õô‚ÊùWÝ6ó…élQ—¯^òÛØÓÛÛ4Ýë£PsóeÓê¢\Íã:_î¥W]uâÛ'åL¼YÖÎù ƒ—~ߘ¾uÛù#£–FÆù(½{ÏåA^˜fåœÆÉ0÷ÏƤi–¥vUØ î/O#vM}šf­ë0>Mþ˺Ջ0Í6¡ý6êýH)sÀè•DtPÊ£že˜g¢õE££æº±áDŽçÃE—EÛ~ 3‹zBD?6móhÖÆ~‰ÚôF× »Ðÿ`ìÊÔ½ÉØè‚Ž&S–átýìÍÉÎC»ÒÇJCG¿¨nlw7[Ð8[‡Ð>ôú‹V‡ž¢ªBK 4yϽ2ï%ô-L«Kv:Âß¡ï#ÆôÑÅÆï›nu[¸Á]ø¾‘´ÙBǘó.0þØAt¨Âéæó„àTx ÊŒQJ€‚€þ®òõ—ÙÍ?7ZqBŠ)‚&œeˆÂär}óáNÐ –S2yðC× EJ*ªäFŠÅaN¼*œEoûl;b™çˆËëXñüÈrL)#†eŽ2I®bXa”åC»>qœuŠ‘¢¤ß cH`—Û: fdÊ2õä&2Iàê+b’#Áäø’†V9†!"¿†UŽ@'ZõýÔ*ÃHÀkXe Á/„ Ï1Ê3~Ã9C¹`áfÊ|Hqœj«ª  Ì)Ž`YÖ# x'v@ I ÷©‡ôDû ÚÕÔe®¶³¡ *¿6-Ô˜‰)Š5ŠY6,×?í•©,¢ÒÛhÏšJǾm Û¡;˦ªš Ôч]_VÐ(í8H†¤RCò©Ëj»ˆ¼ñ8Rï|µYý8È·Ù9Æâ\¾˜6Ê•©AŒÞ䨽ï„êdult¼žQ•¶zÓêN;Dúfï>sYÚôm„AÜë´CÝ° Ý:å#YðVÛíc x4 XºnÆÕïtD¡' <z×â—ÕjHÛÓœ“3p¦@à>„‡{|Äv2Øc ȂˆñëØNTP²€TÅ-*FÍ*Ž8W1«€ú2>4;¾XEUAE¿‚Uî² w`5àâôËÂùŽH„ü`ÍÀ#àîG°Þè2 v›ÃqyXi@I><^¼à“"n@M?»U³uøwòmí·¤oûâþù˜R"_‹ô·åÞö)ÎŽªÊx쉈B2¡.6Š½*q ä ÷f©z ¹"1–¯ÁÍ®bVJ„!c̆¬pš°aŒã·W0KIîièÀì9¤Q…¤ÌŽ6e¹y þ¡¼Ã} ®n3c_HA9ßå¸|‡)'ú »ŸëbìÓ“›Ô„9-Ú8§èß3ƒdM†°p—üÀmÇž;žç¶Ý¦2¶çÒþÆQÛw]µîlO˜÷¿Î„å9në]~Ù›ØèsौfJ¹„úÕm+–Ÿáéļ.4–Mm ã_Ix¬ÐNèo%#Ì(“ˆíS87v’ˆìéÓî9-Zi–c÷q…åý”s·}¦ó°òjà·©ëø¼3¥’!šãGžªýºÑÐê5´î°÷üY¼îÈBÑ?Qáøètt <êM >¼²¢LC çîÞ ŠÓ„Á H<ß™d‡8 endstream endobj 552 0 obj << /Type /Page /Contents 553 0 R /Resources 551 0 R /MediaBox [0 0 612 792] /Parent 541 0 R >> endobj 554 0 obj << /D [552 0 R /XYZ 132.768 705.06 null] >> endobj 551 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 557 0 obj << /Length 922 /Filter /FlateDecode >> stream xÚÍWKoÛ8¾ûWèE.*†¤DJ lv^E}k ‘h›¨^Õ#Ûö×ïð!Çvì¶IšMO ‡óÍ|ŽÇmA/È™õÕjqñFÄ(Ù`­Öˆ& J‘à fG«}žé¦¨¦R-CÎxðRÕÅ•lJ¼ýsùqõ<…”âŒ{ë<ƒ|£¯½½ùêzÝŒªwŠç{·æÆÝ%áÄú‹)Nãè”ÓQ~:ë´{q>˜OJu7ç ˜?äqéæìÅ.ö¨Ó‹T  ÌÊøû§uÛ Æü›GTîÒHÁÍY"‡b«Ê©RgÈ„ oox>¨1ŸÏåµü’­Z¯u¡U3~—E㤿øäAzáÏ(ײÚÑ“.N´ùeÝýÍ0J(+¨Žú4¾øß ùaHFÉz”¼[²ä®iž…¹›ÏãÛÔµþ¦ì›ÍKÕÛßâ>.¨G»Ñv2­ó›êÛ¼Ô¦® õhï^ü,-êÁ´ ]¥Í§¬Tùô}ðþÑÜç*ˆÕ¦íõ¸­Ÿž…{†òðZPì娠óÖ]ÛÀÑðôOäÁAí"Ø:Òý¡E¤8¡ †pCýØqIhrt(Þ?RÁ†5žƒµ^¯Ÿ¶¢ˆf1¦ƒ•ã$£¨¨>TÂ&´ve)úךֈá,Í@ªÐûÅ;7f Ò,Á”QëŠgÌ!C_½ ÊhŒÓ$þ Œ&8Ñ!(L*~öËöã‹pÊÒ™àO8£)LÈÙlcgW)Å n0¤g1uÛ«­–0IòÀ†“U³nûBùq+ÇYRN8ÅDD?/>ˆÎä®—PU²×òªòpv06‚)ÓZÙᚉ8(u­ša|!³(ùõ&—a |'t¾bª ÜK·±«,»+{åÔM;:M%û%MƒAuŽä±Ë¡S…¾$„Í>]Õ¤ð2„xžÍŽçùÄØQX·$½i¬7ÐŒÕW£Œ ¢WrPÎÄ!ƒ-&èÚµSù½xNL7·1'nïÙX^PK"«¡=[¬˜f³¤¦: 1‚0Y9ßœý6)‘sh“aÌp,|§”˜A?ú9•F5 endstream endobj 556 0 obj << /Type /Page /Contents 557 0 R /Resources 555 0 R /MediaBox [0 0 612 792] /Parent 541 0 R >> endobj 558 0 obj << /D [556 0 R /XYZ 132.768 705.06 null] >> endobj 559 0 obj << /D [556 0 R /XYZ 133.768 586.077 null] >> endobj 555 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F56 15 0 R /F68 28 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 562 0 obj << /Length 2594 /Filter /FlateDecode >> stream xÚÅZ_sܸ ÷§ØÇõLÍð¿¨Ç´µï|“\§‰3íÌåä]Ú«9­´•´usŸ¾ @j¥µç&ÊÜ‹—I€AàÐ|õ¸â«.øÙï_ï.^ÝX·ÊYn¥]Ý=¬„v,ÓreMƤ2«»íê—õG.²Ë_ï~潺ÑãIÐR :pp·Ùùí±ò8áúîâ?ºøJ¬D®™PÄ[ïÍþâ—_ùj ?­8S¹[=áÐýJ²ÜåЪVï/þIËœHyÆ„Óeî‹ÿ=*…f.ÓK•"cΪ©ÐMSw}Q÷3’`ÖÚE$ͬ1Sɽo÷Aêê*70u%àGSßÝ®ì.¯¤ÕëæЗMMm_?4íÆcZ÷»¢'z¿óÔ6¿ð_ݘ|¬zk™ÓÃqƒmX5Y±ƒuæi̦ôu×SÖç2‹js¬ŠÞoiYƒý`oÑzÚ£È ãNBC°ÜDÔMXªâëªh/…[?ú–¾aoujNJë(÷EEÔÑFÃÐ$»¼R\%ÅÁøAqaxâÖ•uù‘s ”¾úDIJ޴¾èh¡|ºB¯Íº;xÜ¡†#y RìÓiËeýHI%$E§î‹O‘Ru ‘ !iÖÿ½¸§î‡c¹ÄëÖ“žgÖ¹-÷¾î@`ŠÐB¯_Ã$ØÊ ìèéyÁï• ß½/ê /§“9¹°/Ôažtímã#•NÍ[èÛf{ÜDæ÷ͱަ™õd•v¬M39?üš3T ÞÆåÜNÙ™«›øÇ+'™²–4ù}ü£Éø`·„ ¬ŒÎI2E¼LÊ1­íŒÇ9-´AÏpDUìAõ‡F52¹*Îz ß`yM F$áãö!Mœcžhïã°†NÈê±ïS9³N$õݾó\s`°Ìj³2àÿ£š›ˆÓàä­ÒÈÊò¨¹÷ûñúïÞ\ÏH¶œñlÉV1áe"ùæÃû9©N3ãÔ"R]ÆL&§RßÞþÄ_¢)é°÷ÌëÁ+p#UÓ:j–‘„V¤ÀtZß«ýT Ÿøz*«ŠZ÷‘²-»¾-ï/%_1Zb™ï›qM”CÓuå}åÁ —ÁgÝ3º*3rUF¯ 3f 3sŒƒî¿d—Ò€úƒr•b.ÿ¦s‚õ@[ +›¿h—2‡+Α¬¸€ñg’çíRI`&* °È§Bß¾þ÷W˜%ZàŒ3Ñ,ƒ¿/»jŽÄ9œ+Ù!²l? Ö€ô§H‰Vˆ%®+6`ågâ×ÈôÃg2ý/‡ #ß5òpÉ€ã"‘¬Æ 7 ór_þ>#Yª $Š%$KͧRïlš¹“aŠYD¢…FO¥ný¡ßEÌÊ5“Y>‰³·ˆ Ô’ä$©u¢ç †œ‹õ“'ʶ¡<N>TeO}a£Q‹H"K¡)ëH{Úù6RŸâïÖ÷~»‘!Ú䌣 SZ¬kùCWÀU°f\+0¹,æ‹-,Xb¬ÃÈûbó[ßÂúDqÝ4×Ýñ×m€ÕcÒØ‘»ˆÐgVØú€$ƒ¤Û‡F}h±Þßcbß`áWº†F2S¤g'&OåŽt2?öe´Läú_—PÍ6É¢íÍÀØÇòŸÂ)Žnðdò¶JX]‰ë€NHڨї!G`ýÏM§Dä ʇDñsÎs¦mþ²;Ð`ÏÆ™•6œI!¿ ^À0~VXM€èùu‚¨a²´¼áZ„}u´¯ɻڜeÆžó¹(-8›/Eiá 3Ê®4Àbi²oÙ®pŽpÎV/EiÅÑ- YB  ¾h"y>J(¡3µˆT0¢ÜDêסÇè}ô|ƒKЉþÌ×)ô á7:Š1)9 ôœr=N‹£?aãgXïŒA‰wЈˆÿ$øZú®!ug„.ïfoVn¹g/_,™[ÈIAóÒ2€UߤùLDEC¿X kÁ¾pn<ê.N#dž3wžhx&û¦ëçÔ¸©”<Õç <ȾÀ”[þ¤>Êk:"—qBAŸx ÄÐ|½õAM8`Pö6Áe“ßn?_R…[sh›àîúOôyâÚýÙy”RTZâ*«P«#Éçß8œ^B,¾q6˜ŠÝU,_Aö$Î0¥‘:ù39zt±˜"uJidž‚¾¤\gbj-cj-õØ¢¥Tc‹F–iú®Üì’l?šI•á@No$gÓ!‡dDˆu3ãä•yÁÁçø&Ç<´ÍžØÆ—XÃ% BÄCÑFQr|qX—4'§7À…Œó7ƒyB UE‡‘zæÍdKzQémqØÅÎ]*mC’"ñ‡Ñ›f¿§ÃdÔÔW}KéL‰+2\gúî`=³DÅ9"'쟠B¾eœJ7ç÷þP|B…Ð"ÖO‡ìá2ë×—™ŽoHeUÜWѦ å‰a”_ýÎ àÙžÏå2 ã5Äy€ä"ÿ¦\.Ë@˜Và]ÅËWØ«%$ƒËc îíDòë7?üãÝíÝogDg²¯eDƒþ¸>5ý¼N*NÎ/âÿsNPò쉅J¯‚5-°x¸_A~÷•'¦2ŽÃ–œ)|ˆùÚè ™è"¢µ„HmÏDß\¿þp÷îöúÝ̹éŒñlðF/¥à>òüûz;ð?.ÎÞ.¡äˆ 0[vQàFÊ. ×D2DÈCSãÿ< £…;e³gI‰ ˵J„dˆ³ŸˆK¶¡#¿BfèÀHM]á¶(ë.rsúÈ òÅoXR¥¡5øw¿…ACp­Wsñ7€µ”l¨Ó¸ÐÂW— Û VŒ@+¨Âì†sßÆÏxU*k€uT φZ¸ÕÂ]¬…g©âíAÎ'5-³köXµëpþEG=X·ÍSÝÛfOJ '¨·‹ý£3Ä.úÏ è¸Æ :Sb*õúPqˆ0(ŒÃ=ó<íYœžÄC;Ñ"XƒæEÂ0‚O—ߤshŒëÊ5‰ `ËoŽý´â,NONg¹ÒJ¨<Xkø'©h‚Àï0 nÓÿ…ƒN6 endstream endobj 561 0 obj << /Type /Page /Contents 562 0 R /Resources 560 0 R /MediaBox [0 0 612 792] /Parent 541 0 R >> endobj 563 0 obj << /D [561 0 R /XYZ 132.768 705.06 null] >> endobj 560 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F68 28 0 R /F48 10 0 R /F59 24 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 566 0 obj << /Length 2223 /Filter /FlateDecode >> stream xÚÍYÝã¶ß¿B@_´Å-ߤТA ä‚ ÐEö- ²Lï 'K®$ßÝæ¯ï IÉ’WömºBÑó{f4¿ù"M“Ç„&?ÞÐØþýþæý¥ÆH¦Oîw ‚m­ áB%÷Ûä—”EÄí£”¦ßÿ|{ÇMtµkó¾lêÛßîzÿAÚ$#™æÉÐäŽYtüùû§²ƒC–¥+ü ?غ®hË‹ký“ ”´œPbTaPô¤Ê®Z`¼¤Í†=»cí¹äUÙ?Ú»¦ Ç(uýÆð9ž=öyæ>—]»yU„óW¹;”>KbAÖ» ¾À{ï게¦eÚ<4ÛfŸSãRl›vëÚÐí®(¥”»m˜Ø<ÏÈtÅ“Û+G@~ŒyۗűÊÛ[IÓw°HyúXÞr•~¾e*u£0/UÌ3E¤g*¾ùáþæß7 fiÂ)•W1!6)ö7¿üF“-,ý”P"2›|ñ÷ '™G¢J~¾ùW°°3)+c=!ëhDg,"œÛXK83S–ûü°dFŠèŒ zx`šv†2âÆ3:Þ¾¡æ…Øñ,l ¼MÅMÁ¨ Œ :`TÑp<±z8—ÓÁ~³;]€Òd„RyJ{4K4û•òMšœPå)i©®£©, ¸O͈±vÎtÏ;Á-¡ü »¢wóâJÚ7Øê lœ¨úËײhÛüðTa=º(î@üÑpD§@°uÝ¡©OdË}þW#¸¿RE;øaà¹Úêôã„ ‹Ùæµ'ÀäØ.C®8aôºóB, L'*£$oR>§ œÁzRF\Gœ FlfWa+Àl¬™³½àÃ`fÊê(šº+;t¬©"Oî†#ô,l÷MëEçq®©ãTwÈ aU‰8Äe—O10Á˜9†ÞW­wäÎ…xíétaºŒ-pÛV!dÀ¡"Hõ7ÕaÞ‡çí¦ìÛ¼ËÁ,•JÁª$·éÇ>’yjŽÕ6ìÙ¸ÐÖM?p’]öÂüb€ìW¨©¶`ÔÔ(ö|¦ÚÅÁh›–MÁ`.l G„…IQà—¸q(1Ä)Í×ìð¿§ß9÷6˜äLÜ€ Do)³9.£r@¯¡C€v[P£ :ýgf·e KØÙº*Å ¬l\ÿŹ:,…H ³Qm87‰é°϶š´jšC<ÔcÎhÚn)xüç 3M1jRýMÜ›wÝq…„!^fò,‘ý{õҘʰƒV‰í„¿”ý“W1ôóÐln9Me…J“VA™ç"‰ºì˼:Û†]¹?x ÂþXëDžý@üv¨²¤îÀÊ Z†Ú !è í(5nÀÈ[îBÜ~Ÿ1Ç ¨‹R Š<ÒÚDREëPXOqß…ŸÆEs(Ýv ;»Ö sÇ-tÔÌ]SU i_BEŠS±zí´çÙb¬ °#‹åöŸÊº¨Ž[`¡€ò_!%¼Ï»þaã¡zúÛ’@°ëá±üáh<¦þ<›{صÍþ`êÝWŸÚ<ÕAši$ ¤ûüÓ„tçúHzˆÅ_سójÌhEÿuQˆG×ãÚ2ÿÙ§}rîpùÓ|ÿrüqy<ÿODûÜ”—@rîƒs]‚óK[b$h†ûÞâMÎUHŒðh‹Ù[±1 Àe’ìãã(f+S¦Ï:BýyXÝ>ÌzÃyŒ\aêw×6a®‰›BΟî0š1šþ—^~Åpî£ól¹Tu1E¡86‰PŠXøð7Ô?L B¥ö¤4‹L§¦:óyt ¦†Áåœi0Œ…ô ·}ÁÎoàˆ–ÄšÅ…Îpã߆aŸô̠Ĥã]þkØŠžÄ<|dõÝwKfÄ!éóÑŒêí¸Ujõ6>ØKo,Àn>”µ7M­ü5\÷8è„\-!Aö«va2äéË4ïá\Iѳ’ Ù¾=cÞ¹e^\É&ÿɤn2ga {>Ÿ ëDÍw—…›G<yÀûDLJ'1† 73Œ;+\á@Qš(=ãc(^¢‚¨_|!3Ù)d†Ò-ïðʉÝCÛ\Û—þ¾cPñ*0-ý‚b±W kCØlz(•£É»sCY»Ê¸`ËI從ÃõuÈ'…Ýo¤IW÷/Ï?ôχCõráÒe‹—»š=íÄð­.æßwó÷B> endobj 567 0 obj << /D [565 0 R /XYZ 132.768 705.06 null] >> endobj 568 0 obj << /D [565 0 R /XYZ 133.768 667.198 null] >> endobj 569 0 obj << /D [565 0 R /XYZ 133.768 250.575 null] >> endobj 564 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R /F81 71 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 573 0 obj << /Length 979 /Filter /FlateDecode >> stream xÚÍ]oÛ6ðÝ¿‚À^äbfHŠ’HlÐ퀾 õ[WŠDÛDdÊ“è6ù÷;’Rc9²—&nšÝQw¼;ïƒGÐô׌ôðÏåìê}Ê‘Ä2e)Z®cœ¥¥I†Yœ e…>Eº«çŸ—fï–³gvDM&Iæ99p–ÛÙ§ÏU@ü€Ž¥@_=ë1,…¬FgO)MbLx:VZtvBi*q —Pš13>VjšJMh•1<¾ˆV™b³±Ö}§Z§õê=¼,ö&©U»VuÊØn¾`”G…q0‰Ô>·ŽÖéÆZg «¶À‹a-Eôö1¼ÅÞíδ)¦Œ¢¥X&C$”E]ߧ QÙ´ hטÊY$Hd›@(¨šm¡MÀUíUüêV"ÒXámŒ Í*@»Q£-ƒìMaÃÝøEwÚª*¯ïîw;ãÉØì·—óŒGØÓ(Ç’ó1û¢Ü€„„¸ó«€y‹ú˜ðئè¢m4s–D_MXU¥-øµ¨Ãz×6;ÕZ­:¯ø[Ö ð(4D†”nK*‚]¿hSÖ{§?E¿C"^A^àÍS§Ìs çký¥gw+àÎÜxøóføåΔ¯š6_+›ƒÛÂ6í?$!^.§>Ü'„ß(µ Þñ 2èo!~NKy‚‰FÛióÒ×`^ Iðª½WþHëÒóÖH™´îº©î^ÀyÚU¸ãíÞÝå•Z+ã²@]Ô’£‚¾HÎ8§8ÔfÏ9n§i2”þéþ›IàI9f}VS §pF'Šdì\ÿ•ÂÏ (eœÇc¥p~£SAï½Ê+$]§+ÕúëÊw·áûB½ vû½7fT¹}çú£û¨r?È?‹ÒúÆ犾)Õ£*ú‚sœøKº^½†zt*ã{ë I›Ÿ–ð`´ñ\Õú‰ åãi-Ø]ãah¬ö¦tSÀãýSaû]ÂE^ioÂÙ¹'¤Ÿ½}R ¤HŸ çÊœ2ûíÃýy˜¥üö=HOª¿§ ;pð("Á)Û‚Ã?ÌÛ”&£-¹ÿze›˜ endstream endobj 572 0 obj << /Type /Page /Contents 573 0 R /Resources 571 0 R /MediaBox [0 0 612 792] /Parent 570 0 R >> endobj 574 0 obj << /D [572 0 R /XYZ 132.768 705.06 null] >> endobj 571 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 577 0 obj << /Length 2231 /Filter /FlateDecode >> stream xÚÍZMoä6½ûWØK;søý’E&@°{XŒoI`hÜr[Øn©Ó’g&ÿ~«Dª-¶Ù²zÍ95-‘|$ëUñUÉ´Ø´øùŠ†ßo¯Þ¶pÄi®‹Û‡‚IK ã…V†p¡ŠÛuñëêö±º¾F¯ú?÷¡Õ>øß²ñ¿?|¼õêš©Õ×ý¡êºº /ë. jžGÿ~ûËûZN¡"L;XØZw[ìtõÓíÕW žÒ‚BRÂÌ°: «»ß]ýú;-Öðî—‚álñeè¹+8qçÚ¯þã7¡ )S.ÞhÙõ L刄Cʪ9LabÐ N+jqJgAµš8©bÔvïM[Ÿ©G¼KØH¥f $9%\ÊË–\ÀrÅ Iáˆâ< ¨äD1¶ÄBRKBEPme'\¬× ݇¢XqÃÐc´å!åNÐÁÊYc1 #[IE¤qoÙÓŠP¸1³Œf³`ZI5fÚRœ*baPPN-±LE uÓ§|IíØxþäúFk±ú¡IXŠKâÄ|Üãp¾Fd1×á¹xÝTÜ‚Mñ*È€i-¡”-0• èÊ90O¦1%ÓAOÆQíPáÝU5=ÞYÚ®úáîƒ<}ÚöØ6þöƒgÃí¿í¾:”=ÜwççtœX­c/MÚX¢ {ÅKI° ®¯¸|››Z¢ñþ„©W³~ ¤¤: ¨5Ä:ƒžsT¸j™ÌÊÁü’ò5S™ V™¤ý%ó&†ßz Ïêß(åÕáZ)theÏ84«Z;/d”%2Q…fphKŒ*Œ!&Q…¥Þ¬@x£Jäü…QÓá×úlƒ„UGåŽÊ!rT˜pP±°ô Wtõùš«U¹}ª¼{CÀp q¢1?•÷¾³×ÈØÂ(¿§’Ÿ=–oÔ}h´ò%¼.×ëãI¹õïbúºê†%üøû"ƃÇ9ØìÎp¿ÂÔÍýöi kSô°ò=„<~?ì‰ÆÛ©š§ïýî ß]»¿ó;›>DƒßmªãÛߨ¢Ãt’+E<çÝûoUí_NâŸ|ƒM˜ƒ}ë­“š­}v Í]yØà".Æ÷¯§kÝÔŸ«³ãSøý­Gð.¼·ºo»KO¥i×ÕÝC{¨€—Sûý_ËÃÉÂò°ù.Řã ᛇŒÍW˜„­°ÝÏ-„gòÔUƒm’H‰~ádPÙHÓþì•ŠzDjJ¬yã•j¸ΤÍk7*7. &ܨ ãbÐs7*œ‰59P9Á£ñ äžVY@#T‰Ô˸LHܨ՘ Y`Çs ìËk†ƒÐcòùšéŸ tæ¨WŽCc`;¶ðFˆ^…£ÿþŸÝUk’¬À¥'æ³oH ¤ §P\, ¶4pÛä9yüd­…42 ¤¢˜Eº¬VV\W‚ƒ%Êê×Y Æ$ÀdÁ†€nŠ1›¤Dê”Möûª<Œ••TiU­;Šè1ˆœ²Çù¤t/õA‡Bͳfë=õXÉiN @ý8ô¡Ýn}§n6q%çýÈ ';µàL-Éeñ¾@S@ÀÅo‹—™"eJ*õ0³Ÿq0ÜaÈ ñN`˜‚¦8Ç,ä? s`ZM„a'mÖ'‰¹ÇA?;¬éCØ‚±Ã˜µ›¢‘çeÓèkàÇ`æ> FXŽ=’ñÈ–/× ËžÑ±°˜øcÛ?&ÞúG÷eàå§j¬>bm%T0Ë>ä–gyŽ ™~€Ã6 x' 6íp&¶„u é¦sœË€(m20îD8Á «3 âWO-]„‘¨™%9dlÎÈÅ$ƒ,ž'9†w=%9ü3Éó„äJˆð?'ð²«î[˜x5íèßtÇFÛlÿô>…/ˆï_×^g+¬©Ó›$8 ªóCק=(xZ\´?„g} ?ðÒѧôŸ½#t–XŽS1½È«2€Žn5õ« ˜£cE˜‡¿,”ÿl“ÜËç¿U$×ø-õ‚@έ*aH‡S1¶€s90禘s”Ë(A&ê,Ì"¹ËÉ)kÚ²ÚvÕ|0gÄ ßx–sª^c¹‰8®ù„ãZ¼ä¸4A7CÏ1Ÿvôo=Ûá•äøèS˜äرWðX…c’˜“€~IÀ”p¦óE~%)$ô:‹_I¬ ™%Ž•tt¬)è¬geÀ=kŠ¹+¿^Íÿ]~­wøå1Êæñ¸ ÷wí¡JFè¼$Àÿ\È#“q**ÜdI0%AÌ‘SÌ]Ý\N‚ºù[‘€ Jœå šØÙ%WlÐ@‚tŽ90 "L ÁS·œ~Ð?Ëf¬ÛÕ›&·QÖéD£ ‡s^`Ô  £Q§ ³FÍ€95ÚèúòºËÇY¯žña€YŒD!]`LG½`ÿÿM×;ù endstream endobj 576 0 obj << /Type /Page /Contents 577 0 R /Resources 575 0 R /MediaBox [0 0 612 792] /Parent 570 0 R >> endobj 578 0 obj << /D [576 0 R /XYZ 132.768 705.06 null] >> endobj 575 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F79 60 0 R /F81 71 0 R >> /ProcSet [ /PDF /Text ] >> endobj 581 0 obj << /Length 1386 /Filter /FlateDecode >> stream xÚíYMs¤6½Ï¯àIõ$È%UÙìne+UùšÛzØhl* ØÀ¬³ÿ~[HrÄxL1±¶’Jåb„èî‡x7Œ£›Go7øèøývsñFQ AE´ÝE„1$E .e<ÚVÑû¸šäÃöÝæõvs¿!‰#ŽærŠÌ òz¿yÿG\|aÄŠ$ÎÌIÙ'$o{ÕŽ:ºËÙÊÒ £<“p—‚® %(/hÙ@)Q°5² êdãƒ.Ê&¦“¹?4ëecs~é»êp=†aœf¨À–q\¬ œëe1 ]‰p²‚ñ˜–ðæá -ß3Ȫþx6߯ÿ,ÛUP¬‡ºkQ’2 |{[Ú‹õðÕ­µƒ^ ‡æñª9þÑvºÆCkc­d®lJiçëvT áñêÎãõ"ZcŽ9$„”8_#¢ NE>袊`:ù˜;§£*ÅL*(%PBsÐûEårŠ(Îæ?p¿yúsFå 뉦­€ûîÐVªzT¨Ö«¶·²¯¬Š[S#áq9š|}®Ä%Æ´­ÇO‰.]XaüJa!ÖH7¨“®º(ݘNº>æÝ¢t_ú(]ô é²—I÷áú±ùÕJµÕYÜvmúŒÀÊ9“HY1ëRœ®ißB€Z1Ï@—ÄÓŠy†¹(æ NÌ3Ðþoøð¾¬ÁQûÿºž³ ‘<ˆœ3‘kzÓ˜NÍ>梚_éÄìC^wÀë¹Íé+HªGÐKÙÙ"ƒW}9v½9«ÔôS<ý–Ãoqךéñ¶WÊ ¾URÆiüã΄›F‚t‘~Ÿf˜eÊæPŽjÐË€%¤„ ‚Û/ôI•¹ˆÇþ ´¸ ¡ë·vrBÊå_-3LNò†9u˜V§ã:3eãE<¨é±McÿÆ`%ÅñÏØ?ÔƒAäÏ✸_‹Êp6¡NGmu_™á1¨¤ðI`ÃÜÍ1Ì ±¯sÍ̾üd]ÛØÑ•-æ?äôÔ ë'¯Ÿ„cØ™£Y®$3O 4éÉÖ”ÙÔÖ"ì¦~°1Vrý<ïÔµo-íþR:È´×ð4žÓÆ´Ë"2ÿ%ÁˆfÔm³” X+¿KR‚µ·™Óoíéõ‰]¦¯µÍ¯­9¾Z¶¼‚#"ÙzËc€’“ ŸRº” k>¥B€ZÓ›.™^Lëz3ÌA5 ›ÿ}ï_ç{”ߣÄúžž°ÞÃ#Pý2n]Ø£ïA®ñ½çsÍŒñ=¿²%ŽmuêVuOuÝ”ÑnI1½£vÁ0áj(ÿ:qשG1Ì-JÛ®ï\&ó”WQ.à>òª¯ÌÁZÕ×æp vEÌиxjsg++!ŒÌªœr8Æ ;eg:Ï‘Ìוe< apºåkþ3ÔÜ tÉàB`Zƒ›aªûówõ+¨·Oì.bSŽÓ†cÈ^f 7ä_º”$t ¯@¯>è"¯0¯>f£Îþ‡ÓOjܱÛèíì·Ÿ3û/G8†Eˆ"áP Z|Àt|{˜‹t€tt{Í„í/C-‘Ð›Ñ M¨.%èš&4¨åvºDnLKî óFíÑo{mIÿ½Î„qDó áºÎ×ü.‡uœû ‹œÀtœû˜7ç¿ÑÏp~š`@+P&RZ <·J#D΢`ÉŸ™á( endstream endobj 580 0 obj << /Type /Page /Contents 581 0 R /Resources 579 0 R /MediaBox [0 0 612 792] /Parent 570 0 R >> endobj 582 0 obj << /D [580 0 R /XYZ 132.768 705.06 null] >> endobj 579 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F79 60 0 R /F48 10 0 R /F59 24 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 585 0 obj << /Length 1260 /Filter /FlateDecode >> stream xÚÍX[oÛ6~÷¯°¹¨ÞIaÀXX­~k C±hG¨,y²ä$ÿ~‡"e™¾¤Nb`{Eò\ø}‡ç GËGŒðÁó·éèæV%Q‚Ie4]D„1¤¤Ž¤Pˆ2M³èKœoŠñ·éÇÑïÓÑ?#’8"a¡ºvÎW£/ßp”ÁâÇ#–èè¡ÛºŠ(Jt£"ú<úë”QÁæ24šnšFe‚츆QE£<4Z­OØÔ 1M¯bSKÄ mÎÓÂÁÛ³rsËõžÐ„*$Mˆ@J3'ôa<¡˜Ç‹¶œ7yUÚ7ÑiB0Lx<½7n®lWw¦v»«…›Kë1Ññ²]™²Ùì/ñ¸9ðåæVò}¿Š`…Ÿ‰& ‘à ’‚¼¦ÀSq¥:U\Ðgâ JŠ«Õ R‚‡FÍãºvx”PP&ô‡Ç°ô˜¯ªÚôp¦¥•G˜)`‘€¬§¾éXd` Æð©‘âÔŸÆëüÛ4mí1òà8Ï,¾–G1P7™Çóé@æÃ穘1ñ£Ý¾ô/‚™J¤“ä50{®s‡8HËÆbz!tïÏbß×[y·ÝaMÎ3Ò¾M‹s¼ÃÒF<$$G¢À ;ú––w¦UÈ»ÝayD:Þí ä}®¡Ü"-iØa­Ê›)~\fùÜ8N}{«µ©ÓAþaL0„¡{¥EU¯ú¼½içs¸¡‹¶(žÆRÄÈéppH®‘™ö™øÏ´Ì×m‘6» š–^ÛºÎËa:¨ÇxÚœ 7Oû~°¯e•õ§›§»jí'ªuÞ{¾3º¨M?×nŽ/ª¢¨, »µÞÍEÕ¨ÏÀûÙòÍEߦk{Òƒ`§fpʧWåÿ=…vøƒ¢´­Ž:μÅs¨‘MúÝ\få¨ë߯ââ€å°:ü¯ø~s÷qŽï½ò”üWó}®Þ_ÌwgþG|_ÚUœÂí“阀)¹o $;&ß®väÛ%¿›¨Mêú x1¹ËsV<Ëk3oŠ'·RÕîù;r¯ÂµVGåû‰ÇÆÉÚlÜWÍóa“!/øw@)GÏßRÔúVVì‚×0êÿFïÚ¼ÈN},JDÄ®ò]t‡&ð©á³öº_JÏ]¢E]­.lœÃúð³]¼|ƒK}Ã… ×4{ÅwÅs•fùbo^žh^êUší0:÷ ‰@< N ž¤µoÑ \–¡ò6 endstream endobj 584 0 obj << /Type /Page /Contents 585 0 R /Resources 583 0 R /MediaBox [0 0 612 792] /Parent 570 0 R >> endobj 586 0 obj << /D [584 0 R /XYZ 132.768 705.06 null] >> endobj 587 0 obj << /D [584 0 R /XYZ 133.768 402.201 null] >> endobj 583 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F79 60 0 R /F48 10 0 R /F64 23 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 590 0 obj << /Length 881 /Filter /FlateDecode >> stream xÚÝVKo›@¾ûW õâTõ†}»jÕC¤¦RoUÝSYkÀ6 ¯z¡éÏï,»H°e;®õÄ2°ßÌ7o×Y;®óuâÚçÕ|ryí3G áß™¯‚Ä<æø^€õœyäÜL‹D¥‹JÞÇ3xSý&Uµˆÿ”[#y¯øÃÅÝüÏ0FÂ;î2¹u=ü±˜1Œ8£c0ëä÷n˜¾h¡ê% º àn¼WâäŸÆ)«Ó·ËéÄ8EÉïÿ.N2Þ§ó…©Ø¾F]ûjŸ=Ša" ì»$Ó:² ŸõR£.ë$ÐæónKòJc|³ÚÙ¢|XÈÕê'ÝÇq9Do ,|s>ØKF©½ZÊ——æ@±Íþ!ãP¦iÇR•¼ïNuË>{¤yÍxo¦Í|ŽFlvp;ßeÁ4*2™äJ¿ði±2÷3®3…®¹Xʘ"AHû Ôÿ LV΂&Å ½GmŠZ{H›Ûm¬Ê"Œ¥Uaä•áÁ§*ÜÄQZVª”¡=ŽrÂÜE/ZM&Ïí!~ßdr‹B ÁÃ05þ$ž;­ê2µÇ$2Ïq¯ÂeÆ~wp„y§>Q®V±–VRµÊWuVI‘›·eœäksÔiG–€ï!ìûÃ,ÿ©b(Pp]&·®K´°i$+i>…27¢el²ª¤ö»‘61ÑÒ|4ü á?’I›^öe>ù5ÑR×Á¥¢ù‡!œ0›ÜܹN¡.Üyh~Í‚×áK“ï#‹eH6HØf¥ªF4zÜLœE#D”QÞW™Ð~G²Š!Ÿ ª¥q[±¬ [gêcä:ºM܈GÅd8%³xÄÝÌÁ>oã€"ò˜ºQÆ^Â>r ¤ÝþÆ‚4~>‡Ná!ÂùPé.SÄpçñZuuñX9EšÐIºom1)4:uŸ˜3càM0xÐeÇgð‘Ó·á4œ¾Z´Pq«V^TR[yÒ~ÒƒÖǃPÒέþcwÈe@k},­ç“õ ­£ã•TIh Ü&yÕk¡][µŸãíªØfm3þ'Yˆ‹s'UÃ+îotVbžÝR4î{Ï^2.÷¤Óó˜=ÙvOØå¡eÓá¸Jy ­]©Ø ø 'a/ñ¡ Έ@œÛ€c,W £þs.›- endstream endobj 589 0 obj << /Type /Page /Contents 590 0 R /Resources 588 0 R /MediaBox [0 0 612 792] /Parent 570 0 R >> endobj 591 0 obj << /D [589 0 R /XYZ 132.768 705.06 null] >> endobj 588 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 594 0 obj << /Length 2038 /Filter /FlateDecode >> stream xÚÍZÙŽ#·}ï¯( /jcÄá¾ A'ð lö4ÛhhJ¥–2’JÖ2Ëßç,-TSÕòˆFæI‹uÏ%yyx.‹´zªhõ;Úýþíáîõi+Gœæºz˜TLZb¯´2„ U=Œ«Ÿ?´ëæ~ÈŒÆ–u3Ž5«õl¹-Ÿâ¿z´Œ…wÝ «f=i׋}ëÝæÐt;íšLÚù¼õV?žMvËz;k—rÿëÿîî_¿ÑòÄg®‰u®rJgÑå?Í–õ|7„‚å¿Ì6óף͖Lÿê ÂÈ1âT׿ÇG<|š}èšû¡_Í:V|ãkðþc»zÜ~^5ñéãbT¯Û_¨¢Á¨dÄJÑYÖÑr³Ü-Ž6O,ÄJ_zuÙ£íèýEVÀeïäßݧe;N:´É÷(±û¾iVi¿¼•Î°/~E½ê ?¸;W¿ç1ã´«ù…î_ÙaÁŠìõý• ÍlòµL 9ãø¡ÇKÞ&öÿ3Í=!sqJé\‚룉„r <³p1¼ WM÷p÷ÛC-­XÅ…FVIJ‰;׋»Ÿ¥ÕÑ7TÙêchº¨8:”æÕۻ㞔ò»@ÙK –&ºžÁTšpåŠ`*G8F- óû|<¹ LêÃhäÆËwàÐâŸo¿î» –è2¾ Ä>÷ýÍ¿úáÛ‡ ®Ds[Wj¢ÙÙDý=3` Òb?¯2£%!AôYtëCܱÍbôù$tcܶ»m¬ ’¿ß¾}ˆO¶ÓÑ6—P,]i‹Ñû{FÍÆkÉtŠ´“X7ÉXÞìêi|:Úd:Âদ7'ó¶]3½ŒÛ;$ŠP}h°ØÇX:$6Dl×f´ç¢”G;£O9;ŠhÇömHÖcLïê«M%¬%€·D•Ä`𦸔=Ë_XJ¨TE@­ TÈ´]e0$Ôñ"˜ÎjYŠ´â3T‰¹Ö%0%gD¡E‚ÑsP¤B¸"° ÒI`úÊmW«,Òà#!s4®t_)…/DS¡X·ëu³YµËqØÑB³îÑ(þlVM=û…R^çŒ5§«*ìÂAwFiímJ w2˜â¶o¯Øë8£(ö:ex š vC‰.i°ë0—Bîcý|{i]/‰þ’à=N] Ï%sØÜì3$…˜)*°ä н9CÅd:W$¥ö-΂ñ9XGŒ(ÒqbøY8v›nŽ”-È”6õÈ«a.u …ç!#¼Úâ½AÃ@NÆ–D‰›øŽ9(240%DßÆ)„šÛA9ÃÂ1*½,a…9¬1ä‡qìš{¦ŸV ÐML/|åÇiŽƒâØu$ÕQù^?µ»ù8þ}×µ†’êj¼8 …ŽÆƒcÊØt"·CMDnS ÖÍo»ÙÚ[òÕÓûâ¸ñ$¾œuGC-ìà»Í¦A.3šÏ?ßk•UV Û®>Š¯<ÃKƒŒ DɃ‡7q-„wÁ”0½¯!˜- Þ¦¡ hž>"Uq]ÒH1™¢^¢è®‹Œ°äI Ha/Ò‡(ªýä×”œŽ .WéYEž40¿T™°‘k~i(hPä•Þ”„©Ë¡Â´Ã WE@ FË4*̉p4RÕibOQÁBÍéUæhš[òÀÒ vÅ#¤ˆ(ƒ å&ü¾rŠ™“[ t‘Xâ`¡Îbé’ÞâÄbÙvKâãl;Ͳ&Ûr@î´êî Á±ªäÓ$|’R&(…OR΃2+‹¡“À›E0µ ¤•§ól7~ö( ñf­IQ/15¤´E‚ÒKi_L`/e܆Ü~ºÑ¥~þCÑ0ÊÁqôì¤Ök.Ù[ß3;xÚ- r9„FâÅUÿ‘&÷ :|ÑÚÞ¦Íá&X’°ÔC;XDJ¹"˜XD cš€æ©+0¬6EPÖ3Ï)ê!¶Î'YvTåù£AE_ÐjT–ð[PZ¼ÈkRPÔkRÌõuq‘.þKG›Ü¸þcÎÒEÆL R\Râ-É‹€BÒ:Á® i¤¬%@!Rœ-„Ù$w€ÎÁD"핤¬KÙÌ¡?š·ù/X˜?$Æ/â'‘å¯DÜ¢o±WK/ù`J±^™Iy<)¸”S…ÄÖ¤ —óy<óÏ~ÂÂæ'xï',®(Éñ]YP’N}¿ô ‹;¿ÀENcüº9Å}ùV³w÷œvû˜Ûßi‰㉠›vÑÄR<[Ù®GñoÝ.·ëv?+m§ëvÝ2xšÆŠlÔ"‡ O¿?-¥CeŠ¤¥0¥”½&--ºOKOA/(TæwQÖ¯Fªy »ÿÖž9L0=lAí»ÿ65´æPP3x˜ÎÂáíª}™u×¥PˆGdtP#åÝÆS2v¸,%÷—¥Pw~YÊW50£þKDF_w‘j×áô^ÀÍ©.]RȽŸmÿè×Rí/døÇõöSg¥ãÝRŽè>Gêvõù‹.†|ùõ•íl|vO%õi²nš+|ú²‹#ÏæèäiŒü1Ó¾iö5»M³.ÝÇW_vлñMâûÝžå®ûœ,É”R,±°5ä>Cïˆqš¼öûvȆ endstream endobj 593 0 obj << /Type /Page /Contents 594 0 R /Resources 592 0 R /MediaBox [0 0 612 792] /Parent 596 0 R >> endobj 595 0 obj << /D [593 0 R /XYZ 132.768 705.06 null] >> endobj 592 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 599 0 obj << /Length 1825 /Filter /FlateDecode >> stream xÚÕZ[oÛ6}ϯ°§¨YÞ/Ø0`Öa{Ø04o]a8¶ u,Ï–“õßïP”Ñ‘afíI“<äw9ç£hšÝg4ûùŠ6×o®Þ½×2sÄi®³›»Œ+G¸3™V†p¡²›eöq2›ûõ¬šί§Š«‰šï«ÙvWlªY¹­Šr³?½ižÞ^ºùSƈSÑ8Ÿó|³)—ÍÈoüíÛpÿXËæíaŸïþ¤Š…Q§’+E´üu“ï+_Bú_½]›!|™è¯}e¢uÎCOp´Á†Ð—‹ +¿$·8ôNƒG”"n¨ˆI I)1ÜÐÆì©#´ÿÐ#“€ÿ¡GD =‚r؀ʙ2ù¥ ^ Pkó.Gÿ<¼ÞÏïš;AœGé8Œjmïð¹Fú»WäY#„uµ\\(ÏØpUEÅ°<«PÆ%E Ö…\´ç ä™qžÕË3c,Fídα/H)8ÖÆ%$E"4Ž¿Û•*Õª8¯ç*Ð?Õ_qüMwÁqRÃ%€%1³¤X3e#"J¢ƼR`r(¡q=v>WMÿMÑ&E '|ÝÕ†í-ø¼ð¨DÀØÜ*¦cà΂OQC,U)@RÑ89ÊÈJ ö’IrHIJ”àiÛEÖü™¬Ã , Ú÷Ö_C¹0h½.ý眧bsï_ÙÆáçe^廇bSë5ž«c¿Z°Ã]ºÝ6χ}­óõØ»pS`yUîö¡%ÊÌuÓ¸6_ƒF¯çŒ³“gŸîøpsmdXÕé`ùx=æT®}²æýt:êkŸ¤úc¿ã g~]ƒ—¾÷¢ú»9ßÃ]sD¸Àp Àb5?b>Î×}'ÄÍç–î~í9Þ_>ÇÖ$p[åõ×.ìž‘šMïß[ <ÒÎÌïþCïoŠÍb}8¢~‡©¼ó“¿=ë%Y}ßyÈ=䙺ã ë~(³Ãv›ïf·åa³üWN:!½î—ÎIÝ'Ô+ÿa–-Ê.`o—Å£‡îXvïdFXB¶ÄkóxF #¬¯1ÿ{».‹jvÁÎû¯æýñkN0¯Ëà~W¶³E¹_¬òå»±ÿ@Z\8§Ë²Gq˜ÏöÕ®À>óÞ¢°X3}q(™ÿNP¡ÆYÔÚþKpæõ endstream endobj 598 0 obj << /Type /Page /Contents 599 0 R /Resources 597 0 R /MediaBox [0 0 612 792] /Parent 596 0 R >> endobj 600 0 obj << /D [598 0 R /XYZ 132.768 705.06 null] >> endobj 601 0 obj << /D [598 0 R /XYZ 133.768 327.049 null] >> endobj 597 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F81 71 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 604 0 obj << /Length 1980 /Filter /FlateDecode >> stream xÚµYYoäD~ϯðr iú>¸¤EbH ¡ÄòŠ¼3ž¬‘Çžµ +ħúrÜŽ3™°æÉír»¾ê꺺 g7Î~<ÃáùýÕÙ—/%Ï 2’Êìj—Q¢<“B!ÊDvµÍ^çU__o†¿Î/ùç0ºðêüàCQÿùúüÍÕÏÙ%'Hs–]‚Œˆ,âTË«= UÛô×7åp]ôÃõÛÛªÞ^÷›¢.¯û¡«¶eì°ã¶Èl.Ïïð¢®Û»ë²îK‹¼°àGe9AòdaIÉÿÌÿï”d]2‰¹gÄ âá¯SòDl?øì³Dúï¾óg?~´YÊ™l;—$µ©V– 3Ù\‚"†yª‡ß'vXžh†ÍÅì] ™Õ:Ñ ‰uEÁÊÊí³5NWÐø¾jìo{ñZzŽ–å²–­$…"V¥‹X¯^`\ŒP+Ô –“N§Ö k ‡z!†,³[LÜPp eÖÀµ¥‡€]Jq·•O.wK´aiîvYËð˜µÌ$k™µ€}ÄÒC5fP€Bµž„jNML~N‚ÒœYÔiô¶ö_BˆçG1meá–J°ADL‚ˆO‘2YS»‘´ÈP@tÂ&~ª`gîíjê…Ýãq£2ª5¸{æî¥ÇCn×Ò±ÂPÁ=î$vQ)± ¨Ô`<…êâ!¦2HSº ¦¦H’bî¶Õ‡‡¨Э¯Ê°BŒ˜ôý‚…*$Aµ8jÂ×Wý…·?ÿÒ´ 6#a19j3c$5_cUœN*z‚Ípbÿ"«€R˜!ž6Î8ÂجÉ$2ÁÍFÌâÉp¡‘ «x$$G8éˆÓlFŽ6Ó-˜Å%ƒd+°œÝZ,™Qp€´.©$¢,?apŠ0æXa¥å]›ý8]Ôf¿æbDÁ°AÀiH Jµ,Ìeó Œ"e-iTaØì)j·``=”?)p®‚Há²/Õ$”t¬P{OŽÄ±Dš/Qµö™ó¡±8¤Ðû ¬l^¤hÈ6ãŸWP÷1Ôú< Z‚šAÌΣm8»c¥=ÏR8϶{›)wyK §Ù™|š!EÇH ^,A<*!ÐOLqÜ“;V„²cyÕº‹d«€j8¸ ’‚.z¡“U Á…1)ä#i•Hˆ‘z TÈ©×TŠú~Ñ ¸ œ ˜IëÍÆž=Ò;™0!ÔhpþŠ‡—y|%x)$Õùeö‘øjŒR­_‘'Å×@C|b¯Ÿ9Æ×)æñuÔ_§¨ËéwNÓ/$_Íñˆ'Oi“ý ‚ÃÉS~‚YÀþ ­Ù* H´"OÛƒšÑ¬É0TeÄœbŒ‚ÿ3½ *#ˆS•¢vOšÅ}Ú=v«A †úÝ–iÖôê×Î;À¤?ýZÃrZž|­±r¸ÖH C¸®Ûjɼ©€ü"Ö§`@Œð¼)ûxå6« ¯I¹ ®€s£3}ûV†ï†ØB%½PyUíuµ³u”qŽm+:x[ô®3¶³O|ß1¡Ï°67öwÖÆ·@\áÈhþSãi‡¢ªÍm]Ävƒª²+÷­Ý_ -v¦bQ[2TäEWz’[†“¨o?Æy¥'ìΠ΋Í0ÿ½mÂïNh{;ÙF†ãš¨obèw…µß ª£D^uÜi.½!&v@*_c™ïË¢q×´ö£ÊÂüÐÝ°CßÒò\zûô¸öÝãºaÑè—èü¦LÉ#ãpEœ0GK]¨I#§GY­ub/‰˜~æ}ÜÿÙ:!Ô¸CÚ;ùõâ—G»'>蟌¤“:(¿úGZ—D‚3+ššÒŒÃŸéë/G:/CÍIÄ ­—Œ0ƒ¸²×å6á‡8A(MfA ûon9 endstream endobj 603 0 obj << /Type /Page /Contents 604 0 R /Resources 602 0 R /MediaBox [0 0 612 792] /Parent 596 0 R >> endobj 605 0 obj << /D [603 0 R /XYZ 132.768 705.06 null] >> endobj 602 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F68 28 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 608 0 obj << /Length 2079 /Filter /FlateDecode >> stream xÚÅY[ã¶~Ÿ_¡G +¼Š"Ò˜mv‹ v7iÇA ìîƒ,Óc5É‘äLEþ{yHÛÔhÓŽ}1©óñò e’Ü&$ùÛy¤}µ¼øúM.éœåÉr“0B2I‹$—*c\&Ëuò!­7— Édú‘HòÅoÿ‚-½ü´ü>¡$9M”fZú7mwz³n|¨¶ÁÄ7±úÏ^ÿ~¤ÿ“×ÓòYˆt‘ƈïFúGG‹¼²Pù*¼kcGýFg[»P|"É:¿O Kɽz—°L¤]rsñwôèŒíÍZÚŸåê’‘ôPïÖÈZdŒ²Y5ÄBcèÛ®=ìÂ2CæY0c"#£Wm_mÍú°Cþ'‹Ž }A¥cºt aŽå2î/)¸>¬Û»²nP6;sgšÁzT.Ò²3¨.û¾¾E÷´oo½º/ï‚ä±ñiß•­ ç…Üœ^£2ýŒOw¥VÆÍ—xšæ8S7ô?öÇT‡Á!SºiB[6Á<´ÝÚtAïçX F,Œ !¿:«ÁÒ~oÊ.¶¾®1¶I¥8-§ÁøD”™VEc:c=ښܵí¾Ï@ÖtÃÖE.»{<7FE¦ž‘׺‘B§½qû*tØW”PÀˆ‚„6¶ØÇûz·Cé®üÙ¼_¤ý¡3ÁD9 tN#§8²ä#;ÎÌÏpíؤҦP8î,ÈH/@4ûÒ†hÔ‚ŒLSi»ÁÖSK¹µ(‘fø´Ä­²–|{èÍæ°C«h]¥UÙ›Ø\cz䎷81o¿W˜´r•€mq& ´@¿EÜ`¼Ô{}LçËvŸ±Ó.×›ô%6gÎc•ŽÃ~®›Æ· ó±Âù|¸ài¿mú\ß ZÛVv‹²žj´öô­äÞˆh`{VŸÃغŸžU=Ô%¤¿R+Ù•Ú™8[«S··ººK)íQK¦Ó7vó,sm?Fòn^¨½½²As¸¶£ÇöT¸ÇM°TN™ãdþςῘD¯>ÔŸPZ|‹íòÉçæWS}(ü6UAE0>j£«sÂ%FSã0V°uê~7‘| à$O¸¢Püªÿ1ùÄõ3…"O gŠƒ©ÇS q9PáÖQœÖ5ðúpWqñ¤Ó”OÓ´¶«vØ¢tŒ½î†EÀ§Êp,©TgŠ³¹«pÎTV(9Cn-åJ>» ŸÙWá´/5ìY?tV^dJÈ9°lea¼ìöЬ}9WðŒH—ᾜ‘üŒ÷¦ª?ÂŒï¼ßÖÈl,:õТîàªP¬'º8[¶uØ}WmJqô€3è|L“ ¦H%4?¹×7o'·–rB2¢ò—D%ZepfZÃYù¨äk¹Ñ©‘ ¢çeD¹ñè«Ÿ®ß~7E&‘QàÄ°\Á¶©öæõWÿ¸Z^ÿð~[&Ÿ[QÙûÕ?½ÿîf"ë@yBˆš×:ŽÖyŒ{ýîÇ·×½^Nda#ä — ¨ïðŠÃ܇”} ÷Õ•‹ËÐUCùXWõpü*²°%Œ,h\ ]LH Ú"W+™V‡Î_æàa]Ã-¨¯Ã p½rWYׂg®ýÐàš0.vMR k \†]´Óu¶uÔãzÚ5w•Ã“®©¡P‘ –Üø…^5‡°µ\{óü)פhù,˜ŒdÕ1æcž)”«æ€•ÄÕFìSžÉ Ï„Ôs`CÝž 1Â~Ô3!µ ëÆ3àBj4q_ÿëIÏdÅÈ5©¾Bösnër(ÏS$c9€¡#þ+”$þ6ˆÎŠ®ÒV¿Úú²¬wåjç‡zŸ´u—×xŸ´õ×1]’È'¿XñÅ`çÀ//¾¬%–ž[|Í싯º‡ZØL‡EÅ°6(ÂF°CWÃíÃÿd.ŸM^¹>EZûU**¼ ó~‹5yø€‰ZüúšóÏk G“…MAxÑÁ/N 5kßí†S­q„®°³˜.¼ºp¿Øx¦ºµy ûω_Œ±TƒÇ»/g¬µ¤Äó;²gl}<¼)Öê,/ò9 cî–A›]oòõˆ³5®úìÿÝBØ '¶á¿ þÍ-âÿ.´ÿsÔ1[5A¶:b«¿9ª'¹º®ñ¯–[×uÿïCS¹¾˜§ å°p1Û4Üä½Êx4 àwjϽ´ endstream endobj 607 0 obj << /Type /Page /Contents 608 0 R /Resources 606 0 R /MediaBox [0 0 612 792] /Parent 596 0 R >> endobj 609 0 obj << /D [607 0 R /XYZ 132.768 705.06 null] >> endobj 606 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F68 28 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 612 0 obj << /Length 2354 /Filter /FlateDecode >> stream xÚ­Y[oã6~ϯ°/În¬’HI»Ý)¦‹¢}[Ô@ÒA Øt¢T–\Iž4Xìßs£.Žš6h^¬ÃÃË!Ïõ#­‚û@ß^(ù~³¹¸þdl‡¹l°Ù:ŽÃÔf5iÅ&Øì‚›Õ§²vëû¶€ÏîrµúWS÷í¥ÎVMÅŒæR«Õüq-s>þ°aâ[W»¶è˦¾ü¼ùþúS’Mä©`­³’ o\Wî\ób»êŽn[îŸËúÛfÕ?8îØ6u×ãnúŽ{`eêfu,Úâàz×vWÈÈW…ȶÉDv%aœE°^vºø÷æâ— \è N“0‰óÀÆY˜l7ŸU°ƒÎïÆy<ÑÐC…y–U?\ü‡U;§i˜D-eŒ¨¶èú¡9A§ï"4·aªì\èÝ©¬v ƈ²0µEÍÝ£Ûö¢ò¢fÍÞ9œ¬£\ƒ^,XO‡¹_÷Ô¡Äq¼êþnÑOÐG°ñå22«¢-›S‡Œ&î;îmö2ˆ9÷£QûØ6[×uáåÚXµÚøñ‡téÀWkR-¹Ød“Oè¤Å³¸íž¿Ã>±QvüíÚætÿÀŸ¢(nŽ¸‰È䊹OåV°Š€¸süí\ÏÄ©c¦%¥sßTUƒúxúö§z‹ë‡äê,TÏìšè0Kb°œLKôü¥¬·Õi ,üøó5¸×-Y;|ø°¤ŒÛ[u{_~‘IØæ0ë¯Kófãnᤷ^7Ê(šà7øRZ_üüŠ4±ÄÕoïv>ÿTƒØÛCq”ùã>ô?\|m!¤’h®¸ ç ðAžŒ ðÎV¸®Þ6;Ê|À-kfúŒ¢µš¦OX6öôÕ‚|Æ5¯eœ(ƒ1V&ŠCeo þ³xÎCÈá&⣵$â³”££Ð‚^ÞAj¬Mhc=‹ZÒWj3èãÃï) B>V‰·W²Ú5‡Â„BxýÅ/pø¨Äl]5T °½2 3w®Öí¡^\®u®(}Ñ!ÑmÜîTI‹Åb PѪ ](ä0¼-ê{!q[¯,u,:Jš"u¡H¥q寻LF‹M8üÏÔ‹$…'š–RqòJ‘Jð˜÷‘™€Ãè|.s¨QgRÓ¢#±)zAúGŽ ÅÎ&ö]„æ hÍÌ…î¡^½”j´…àHÞCªÑy¨“x.upÄ—A'É{ˆ:Šš$H)“£Ærßw`Q&… ˆmÑ•r@§v]OÙh…@Lk:ƺÑ9Ù‹îE[ Hc@%¿òhMàøÚøúë…!5œkáÂhÜöI€†¿ŒCkÂ4±‘Š—’ge#¦ìšS%g§#Új$A®W&š'"Þ“MVîR›Õ¯€t¹y,ÝVzHµ6‡z[b‚4dÑsGIØf«RÃŽ€¾ó‚~9ˆ},·ÙÊ’Ê¥>µÅñèvK¥zH¸00å¢i=@bXUÜdìKçgÉ%Ù˜ceN:®7nà2³|Q(»~.ÇUîàðê°ka¼P ¦4°nËŒCÓ §;>A©ps¬ ý5\7:™²g–@C$wxADÊ#†Yâî&Ÿæ{H†€aG_Õñ‚—™0Og$”NÛÞŸ `µ€"-„*’½ÎHÑz~tçÕ‰n_YÆêÊ|`á՟ڟ嶨ªgî)ª®‘1ââYÆŽ4?Ö=líJ0BÇ2ŒN<=ȇX2x_U:¼XS*Bçç „ëCi¾UÜžÝ* ã• ”ÃÅMEïŸâ”lå·;5¶E›HÒ} ¿2öØtåZÌ Ð-Nì ™ÞK:‡ý"`×P:l åF‡)`§·ƒ™P · 9— À¢·Ó³­Î/R±‚uÐä¢Äߣzç)ŸI»ò¬‚›¾foR% ëÎõOÎÕÜÕÓ=½áÊÇÈLAõ*·ƒR׉‘§’Y¯— y<ÑÜ Û²uÇ"ß’ŒeÂ1c˜` Ÿ„ Žjø;Üÿ'½ƒ"-Jõnº§žvøÛï0NÔl‡ØÅ‘¨©{PÙ _E2½úñ¡¬œ°)OÛž<'ÜQ5Í‘Û¦mݢʺcSïx"†…“ñÁ˜ðÝOJE”^õTk³`£äê³^¬Ç8ÃDÉ%TpÿTV•ÈjŸáÓ J¢“y¾È°J¤…”r¶o¤. @è1ÓpÁ!Є­•@Ÿå=?zRÍZª×&ÀgÞT¯[|š¢%Éd’ ödföìÑä»=ëÁç7ÐqspÓä8ØÃÌr§ásà¸ñÄæÉíQû¥šna±DÔã—]p•ºÁCEjª5lÕcŸ¹Ái’\.F&ÁPøö­+úaZç;«¦¾ç$ñÍœº_¬'æ‹äý.RSg€–¿do[âV ܆xÝ–=AàMŽbôh-*?Qà7Npå"ûUo~ZÔ“¡WžÇ9EÛ^ØìþDJC¸ ñÝ1I'# &ö%CyÃ#DgDC&…ã¶3ÌŒ÷ƒp€ë¶myGGµ†ÔNåë2„ÃfrVÛIcß/—Í¡Nó½¯Ö|T5w%µDóô–æ²yŠÃ±r¸Ÿ<›–Þ,Í©8h‹8"Ú£E%¦Gafé‹¡‡]pÖµt趜|ª œn7l7?Ó¿$W'ÈÀ³ãM±„¤¬·¼ ƒUÌ;ú/?Œ~¼)¯?3ýwþ(y(þ§¼¦^=2AÊ!þÆŸÇùp­dþÿ–žY—vÂX+Ê)ÁÇ+5Ž¼‘„KHJoðÕŠ¿wÏ> endobj 613 0 obj << /D [611 0 R /XYZ 132.768 705.06 null] >> endobj 614 0 obj << /D [611 0 R /XYZ 133.768 648.458 null] >> endobj 610 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R /F110 150 0 R /F68 28 0 R /F59 24 0 R /F79 60 0 R >> /ProcSet [ /PDF /Text ] >> endobj 617 0 obj << /Length 943 /Filter /FlateDecode >> stream xÚÝWQoÓ0~߯È)k‚íÄYÂ`H€Äë*ñ0&ä¦îb)Kª8eLˆÿŽí³K…6 „/õå|ö}ßù|¾¢à&@Á»dÇ׋“goÓ<(â"#Y°X˜æqvFƒŒžÅ$¡Áb\…f) E_µÛ~ŠBÖÌ0 ïá£Ýô¢mä¾úŠƒ°nëºÞ‰æT¯.  ã oxÇz¾š]/ÞïP¹ñÙÛ,݃–â8O“@-Œ3œ²uÛÍ"ªœ|D‰¦‡Áøtî«_X=Nœº µÖŒâ4ÃA„q\PzÐ'÷‰}ŸÑÎ×>ˆaâAÀÖÓSGòÜlG²SâïçV:”·¢Ñ;GÃ-ð;šÿÄ•gWh*àY¿™ï÷!é«S.¦E>9H ŒÒ>̺˜»“$Ãh<ä9p4‘ç+¢$sÇo·ïà²Fygyæ_‰K¾aêN©+9‹ŠC§¤õ¶®AbÍ eÚ fµ½¨¹Ô" KfW/9Œí²g¢ávÙòÞî#¥¸iÌý6Ÿ0”µÒ+ðÉYJvÀ½«> endobj 618 0 obj << /D [616 0 R /XYZ 132.768 705.06 null] >> endobj 615 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 621 0 obj << /Length 967 /Filter /FlateDecode >> stream xÚ½Vßsœ6~÷_Á#WE  I;“všNûš{sü sº;M9`'Ídü¿G«ÜÛ“N_Nºýñíjõ­Xê<êýyEÝúÛöêÍyÉÞvïñˆ“P0OÄ áaìmwÞ­¿¯šMóØÿDcªËÿä!®¿àÂ(®?9-{»¹ÛþíqAX̽€1’ů÷|ç\Oºä çøÿºG¤7 Ø#»Ì8»ht>ÐuŸ#XZÀÅDdllþ²ÈùM¾3n1’FáØüqR¬ÖŠŽj•½‹ß 5œ(ž&Î(‰Ä8…lr@fãÁjš[M½(¾JºB>O‘u&,3†¾”1üUŒùÏ:C¬vÆ3ü¿é¯òIÿü›ƒF31¼2o>$ÙÅA’Ø 8'Yš C«jÙÈNMü¢tô4‘Œ&6¿(ŽÐo{Ôí&ˆ(÷qe¾Ä¿­.… vú¤ÊVW¥,œ¼–¹BËFÕjUÙSTvGå¬ò£Ú=Îp"´¶Ph^ÍUöËQçÇMRC ÎCw2ðæ<¹ðÛcõPìÐæ^á*ëºÐjG t"üƒj»F«MT+j}ç|q)ªªFÃÄÞJmÌ…}æž*Õ@UxHýZ«ð9Ï|½GYgK »\–¨’NýÏðSé]o¥PwP¥ê3Eå`²ÙõЦŠ;uéh65dCsj&‹¶:›™Ô'_©IÉeWtŽv#Ê„!I“И[³ª†ôÈ*7ã”$©AO z8E=3Ã8óqMí-™¿s̵c&˜Œ™ J[-ë=0Äd0ÂNÐÁÓ4sé=Ý¡î»ê$ÍÝ ôLÎБ“ûyeo®QNÄƲ©³"1'–ªukŠÅçï?nÉÑd’[ß:ºB&™’ÿlõ‰)ÍC£PÞÙ°3œ4¾¢ÁA[–ƒêz<î]iÁò¢*‹¯ª®•lPß»Hçi/ UØ^VÙÍeŒŽ© §rý‰RåA¡Îédð½`Ëï®Àh? í«¢¨À÷‹e‚ï pÉÇ3/GmÒ-—/í7|Âå­¾s__q?»aü%ÒîïyJXîg ¯Ù«Àq}œéèássy¦¿öÏ× ›÷öa›\Ô•óÉ‘ûÚí¿w+‡™C4‡(Ÿ?Žm(Ø8B›Ý½³v-ö#gZºZ oÌòPñ¢Ù—-̾Ùêèk·ßžLÀâ"¯|9±{Ô»+ºÀu3ÌÌPý¸ˆ“MÙúð3ºò,!"úf$MSt`\Œ\þØ^}Š®H endstream endobj 620 0 obj << /Type /Page /Contents 621 0 R /Resources 619 0 R /MediaBox [0 0 612 792] /Parent 623 0 R >> endobj 622 0 obj << /D [620 0 R /XYZ 132.768 705.06 null] >> endobj 619 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F79 60 0 R /F48 10 0 R >> /ProcSet [ /PDF /Text ] >> endobj 626 0 obj << /Length 1600 /Filter /FlateDecode >> stream xÚÍXÝoÛ6Ï_!`/v3ü% Ý tÀ:toCý–†lÑ17}¸úHûßwäQ²ä¨I·tÀžH‘wÇãÝïŽ?›· ~¹ ~üi}qý6TAB’ˆGÁz0©HË ’1áBë,¸Y¼Û_-W\ÒEUâØ´_€YÓCZfWgÛû*Ï«%—‹{SÞzckz3¦Á±9êù@)×Ùòãú×Á½~¼~…#CFT(P% èâçåJÂ97æ#NV¯qLÛª0»›?ýò_ÖþÙ•W{íÁÊç/óæý'÷&Ïq¶õÒ·ºÔuÚþûí«}þ@%5e‹;Šã8ÐWÓåü:;ßø¾ßk §Ÿ­g£$ŒX°bŒ$ÒçÛìO'Ÿ[NœAÓ+F¨˜¢†yådVc¡'¬¿ž¸wnÝ+nÇ«‘‚?‹S’ð³«<ŸpÑcò¦Ä¢ÔÆaÚ©M’$g–ú«:`ÍX!aIÒ‹•Õœ)Æâ^¦ÑÇÔBeÆX’(êå\¹€‹£r±—°­Š{´‚B&ˆMö³HPòXW+Ÿ#p9g˺G²Vï~(ŠÆo·÷KøQë¦Ë[_Ö•WjªÂËŒu]èÌØÛú¢ª 2)‘ë·q2Nçh ÎÁ÷Îue Åx¦6 Ü )j­6‚‚³Ž|‘âgëUf ]6ÐÒ·›cjƒ`Ej}„»é²uµo7]¤öî ³.׸<±`m°Ú¬T{H[n:ss¨º<™XÚÞá  Ø‚„rÀÀ®*Ž¹nuþ0‡–ˆ¨Dõ¢$‘å*RÑb½T.M"ŽÕ¶MM‰‡¦¸l»8¬¡*\ðÒØßÕn4 VÞûí”P"d8½Wz<æ˜ãÔwÒ4ËLëÃëpÑÖæ¸*L9ôÓ¶:빧آ¡Ì£¦Ë{ã S5S–=bóª:ï&ÊV=xÉzùæÌ¥]U¶`oú<¥KNw¶ó§&O·½7í¡®ºÛÃó¯Ä¾+wö†|Í[Àm“©›ß™r—w™ö­Ø4ùuÚ´›mgòŒ^Ïáj³©Í­¹óJökÐÁ¥Ë9½‰Ü¦ÑíÆ´Ø?,˜©SéûçãóÚô'Îóѽú²¿S}“mrÓø—ïrì¶üó¾)‡|ºµKL Y˜iÇ2$29uYl,?¯/>]0X¥ 8t™°@P©™C…"*RßäP›2OÅÔ<>ÂÑø›3›œ ˜š9TÅD©ð› íHÅbzèžÜHJ(òŸöõÛ n°²“¾÷¹¥ G÷ïð#E)¬]€·ÒÓ’˜0~Ö{æx#tüèÏÀ‘)&\5"±Š_-¦€¯0îLIå‹Æd3aBFÖs¸#W ëå‰Q†+©—Ï y–Õtaµå±kq:êö`ËôÊß5T®ÍÉÝ’É…¶¤Gðžô€ä`«ì Ïi"À=‹ùó'‘ÅÀ¨s µ£+I¸°¢]mMçR¯´o=R¯—§õ’)àYãeyÂÍÀƇ‡§ýÑ­í—åÓéÉõÖ>C.T’¯´#ã5×vU åX•™.‘¼ñ“ã0ÇŸ& °¨z÷Ùs;€Î"TˆxŒ2!”C™]Fæ&†2s¢Uì¯Á÷{À l5.Ôà €ÊÒFsW¯vÛŠ‡ÀOß6{w&ÓÙL*SŒ™–f»0¼P\ÄÐÙ‹Zš„B«â¨ûg¹Ñ>Q‡:rüƒDpÂèðZ| ,š1¬ƒÌÎ@éœþù.ÓB÷„³î o¿2ÓÖìÒïÿ+|™ð†ÿ#6¹«5x¿Éuºÿoødô´ÇeÕ_üÒž¹·?ÔØ‹]qóYb{W™^È2{Ú~Ïì¼zê7­¥ƒ`uðŽŸKÆ㉠ÔÔß^U endstream endobj 625 0 obj << /Type /Page /Contents 626 0 R /Resources 624 0 R /MediaBox [0 0 612 792] /Parent 623 0 R >> endobj 627 0 obj << /D [625 0 R /XYZ 132.768 705.06 null] >> endobj 624 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F79 60 0 R /F81 71 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 630 0 obj << /Length 2401 /Filter /FlateDecode >> stream xÚÅZKoãF¾ûWØ‹Œ{úý@$Àf±¹ã[&0h‰#“Z’gþý~ÕÝ”E™RfÆDrb±Yª¯»º^]-¾ø°à‹ÿ\ñüüéöêíÏÚ/ VÚÅíf!´gNÈ…5ŽIe·ëÅoËÛ‡òú÷Û_Þþlõ1«gÚ:ȉÿøî6|[[ôqÒ/Ú¶zþU—x&>Öé½Ü–eã"²hZÏ¿[=”ëý6«bÝ<UÍ®o´1Ñ»ãèÑI]ÃÊ@·%©«ß·YcE~¦éƒ¨›u’U3’j0VÕ]Ùöe[ôSSMÊÁºWMÛ–Ý®©×Uý†ôr×tUÞs0Ä5ãyøÍÇé%KÌ·ÃðºÜ\ èo¿íÓ@±zòžN»”~ó þ¬ ¼U]ú\7Y¼?SóO¼0¼&=WMÝWõ>ÊõÃFç…å®hûüƒ´œÁbA$õâGƒ¨n5/¢¹Ÿ0§=MüÙ2²Ü¢ëšUU$µ§‰OÛ©]qd*ô6ˆ%ú`pôRÔëDÐäè™ö6ÑûŽL(²Œî €¹\¾—R‘^±x:ÿüẨ¢KÏdÑ š±åÑèðÒëçÏCŒÌ ÃïïË2ËnËdžRXÊcë4¸i›ÇéÀåN9Š!q¹Î´Ž Ó†æ_Ug°Q”UႃPEê¹™”j  Ç _ê 7ÚÛ”ë?N⊇åå½”†écÿyWÃçôµ-SJ'º åÆevz÷]Z|w'ùÒPx3 é0iìñÁoÔ•‰Ùýç©ãÈË•½ÔšX$L êxME;Ì6@”ÇÓ]jY×ÏŠÂK7=× Šíf Z3cØÉ™ =¨–I¡N<…)“N΂©85‚ŒÇÞ— Ô œeO5­ƒæÃùKoQ*îD¶ñ§*plêødwIuœË=9 K€‹? ‡V†z (\ ØUÖg_ÄØñ¯ÉAL:£°˜*7Ý‘Ìü Ø4V¼Ö\‚Á1l¢Îû£‚a¢s`*˜¨ôcÌ3î¨,¤9? ¬5 ÝvÚqZ€ÌêqP×úd­±R™hfà)çѱ–<†î´OjdF§f±&<áä‰5å¾ØéŽgÊ·tjé 7J¦¤yQzLs gÜ`sIßüuw8F1®mŹ½t¶¶˜Â Nb¥z zÆ'DŒ;5,ÝBqŠ$Ç°Ów8´a(fEÅ¢N–«Ç©ÂÃ3as "õpŠ$Ç°Ó´ÈL˜Å˜¤3¨ÒNŒéŒGæ„ç(ÍuÌQš«CŽ¢±˜£ˆHÝeÛÏq(æ"ɹȹCŸ™:p‚uÒ¢¤îFÛQ7…î‚"°Ê7Eô€‰¦„§4µDvýÃÍ臻¶¼iÚ5¶ßßPÔ˧‡j›¥¤Ö ˆ®\5õz Æ/€‰ 6UF& §k—>ÏÀj9¹ –ïªz5ÕÐÔ«ÖRõZf¹¹`2¼Î ¨e&£$ìŪI Uï˜Ö3OV| z¶ê5Ìj7 lðКÞ©zQU!ºÏª+ÔÉZϤYE­Ð fÁ5’y²±gJ_§™æ³X“rücÐó1Åýû!9Ê!’>()Ò‡>½DªBûZ 0JרD‘@z«~Ÿ¶ÚѵA×·ûU_®) 8µ¬úôeàoêÄë—»¢ë’»ÇûÚ—~óŽ—ëaXºFpØX¥_§Y¤¦ £$¡/–ÃÞ1ëÕ˜3‹Rh„ùÅmu‹@ŸÚêÚçVy9YKI²Æد©¥ÌÌÏSKA”ðCëujaBÆ"t|B“>Ðð,Öëx@#²ËÏzxÖM?ôñeº6KÍø‰ã”,ÿäžF)òs¬_)²îdýÓö¥[af…Ò-×cÐè´AÉ0!Õ,¨ÎãL/ǨÓq?äH8hH‘p¤Þgsxifˆ×ŠëãKÏd3ñªR]U*D,OšÕG‘.Ëõðÿ3ÔZZ«åë4Dÿ™¨Vûmq(ˆ¸YV›ô1_Çëá– Tº˜Ä·bÛ5ièp¡šðÌ™é¢üaQgJi S”Z—†iõªS´MÇw‚é\:YT sZês¾;º8;i"…Qr£ ó6‡;!ýèG˜íÿ-ãÒ endstream endobj 629 0 obj << /Type /Page /Contents 630 0 R /Resources 628 0 R /MediaBox [0 0 612 792] /Parent 623 0 R >> endobj 631 0 obj << /D [629 0 R /XYZ 132.768 705.06 null] >> endobj 628 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F68 28 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 634 0 obj << /Length 3411 /Filter /FlateDecode >> stream xÚµ[ÛŽë¶}?_a /ž"Ãð.- œMÐ"Zäô) d[3£Æc¹’Éü}Ö&)ÛÔÈšSX}2EQ\¼ìËÚ›4_<.øâÛ<ýþõÓ‡¯¿Ñná™·Ò.>=,„R¬°naMÁ¤2‹O›ÅËu¹Ý®Êõ/_ÝÝKå–‡§jG%K%*˜e¹Û5‡òP7»ø¼.S‹UjÐV‡¶®î¤Yþz'̲ÚÄ×móœºÚ5›*¾Ü—]âuÓ7+ñm?¨Xìîï~þôÌê^æMy½{¤ê¯¿±úr’š¹Â¡mlÓm©Í‡¿}úðßµ|!Âjæ1« Ó…_¬Ÿ?üø3_lð Ly·x MŸ’yçQÚ.~ø𯸤9š-˜—*t%]Ä,»Ã¦ÓL 9 ¦Ãöq‘a†…}*¹cÅ,˜ _pŸa>V#ó” ‚ŽçÀT-Š|mϲ¶>“o#™âªßzáñnùq»EAœeª£G³ìžšãv3"@Î1Yœzùþßß}7%ãÖö‚f Ï‡;Á—e½=¶U@÷ËOAòñê±>ëÇnõ^ZÎœ_Ã7X¨³‘ú&Q2˜‡¶¡+%Í”üZÏéÌ  ö ]d «cÝïF¾ÐÔýBÓ#<¦‡~ÁˆP‰Œý®Ûª<¤·»`”^Ƭç¬PjÒL(Q`^sÌXI´‡Qz™•²ÌÚYöV)ϬìmõÛ¾[eÉœ0'q^ý§Zº~…Çí,$Çx?¹€Za£›c2Z¦tñ+¨`VÙY@fVš+‚:€u[¬g…«PVo\Žj¸aΩ9P |…+DŽ\ø[TE]‹YP ­ð9êþeSk¦Õ,²dtÁ´ÊÒÃÈ^Ük¡ D>·ÊM;jQ BïвðÀ•‚{#íPÌa8Ô•*&igösL§d†yE$÷Q,oGg‚XÊ •<ù¨ÒQ*gU°ü.Ã×i 4°‚s`Z5ËAÇAÂ{zrÙ3@&òà ÈçãöPø%.™ufT›e‹\ŽÆµO ¡g>ZÀ£]è'qaã-Ñ'˜›8[ÕBlaøòãŸbáÛjWµÌ1EÌ´w8ðBw¢|Á& ¢“–§Ç b$mªjbMÏH¨.„N¶^¾Ô‡§z7ècÝìð¨âo‡ø¦yè?oШ­¨Bž‹W`š]ú|çO!Ó}uf¿ðaÉqÙV‘§Æ1nbmtù¡> u]ù\Y=E{¤'ížt†&a—æ·I,È9œ,õ3Å£ d\ú90#.½bølP?,lPaÿ‚¹‚¦pmf5ãj°Àã¦|–£fAw2Zæ¨Ýú©Ú·Õˆ&‚ \°Õ‡ãn’ÞÅB|é%3Ϊ»{¥íòr» ±=‘¦Òo¯©`šQò©²9Hã¨î¬qô‚b»@ZØÓè®Æ5 ççXµlï„[>Ÿ«Ý!vžÂÓ»J#)ÇL—·îNòp€q„–CÓز›x¸Dìz’FOÑpí/úY0Áè•t9èµu½§¨Í Þ)Ù$Šh•ñ[æYXÙU‡XX½ŽR<øK)§AZ£9Ó˜ä-Æä“1AW°Å‹MŽ\’­˜j-ɘ\‚^³v\3ïÍ°Šh¡rØn,Á¤$Œá ²`’ôâ4Ù€+ë±0b\ AÌu[•cHrHœÈRZ§¤Äu_®S10ÑgmQÑ–»Ç*YBíAgÕ ˆy ø>~ðVÔ±Èôß+Vx7nǨûÞŽ !UdIjÓ£×],­î$_’œ…IÊåßwñ£}Ùêõq‹®5_R–š§YÒÛ´9’Mé!X̸Ö1᩵—¶ÜïcZcdÛS‚[ÃΆjÕç­õrÓ<—uzV:¼¤¡SÍDWý èƒUêìÔkàT±ëûŒð€r™òNÌöÄãî†b䆢ÇÏ»[V‡c» £ÃÓ¸]3<(ßd2Œ Œ…Ê#n¾MÕAWÈœsŠèÕ±¡´™(f•ˆõ¹ÍA¯™µ_µ³À†üªÎaGóæ*äWÕ, !¿*sÐi:¥õÉ«­ªØÜY™NÔE’ž}[®ï“Mq†øY(jEª{iTþ”ƒ ¢‰§¨?2^÷5ùá×øxŽEð°ê+ñ~<IÉ79)½0ÞBê…'´ÅÍÆ[ºÒEŠ»W`®8+gõ‚9Qìs¹a^ˆWÄ,SÕØ[MÍ0O~e˜ë-¹Û°:æÉ2Ø}ÛlŽëÃ(ãwà~˜£ƒÈ*žL8Lβ l5g¤ê`ëCuóœªRäÝ–ñž®ÖU,’©¥©Ós_Ð]ð蘩ArK“ߌižüŒáQ;ð[n»&•ÈEþJêTÖÛrÔÕéœÕð+¾\ (5ξ£ÃìhµÐp•ÀÞ£°`"te¬› ÒØ͘0íÌ#rÌ0¯†^–!HËÒJ§Cóþwx:'ƒƒY1/Rÿ¨wëí‘´ ¶äÏXׯ1ÍÏ–=ýel?F«Ïõ¯é#z ¶ã3©r¨ú#Õúù gñ¹—˜Ÿ¸á¡W [ ÕX׿TÕþÜõ©›Ôu(£ñ§hį÷“1‰ó;ËÍÆiÿÿƒö“´­ºC[¯_°†‡ò—êá}u}só¯C@¾Cé4©¡#€ΤëJv!á´«£4½/ \˜ r7eü¡U6ôD‡Äñ'AƘ`÷ˆ\zí˜AÉpA`XEaû`®ã( aÍ, Æ„„F:EÔ xx›÷RÚ'šßŇ2þ¬‡ð©Ü’è¡Ò\FÔä¡ic!¹H´µÌñbÌ/‘CrrYm+ŠïÒSè /Oõú) ”J)8AM¤ƒ(ÄÄ7 Ý¡73PÜUÕ&õ²3ø ±¾ŒY{ ç–›Xüãe—ëcÛR¼9¢’—A¥*Y…õMP©ú¸ŒÞö^˜ÊçÉ*Jµ©ÉsŠø¨²‡”Yzjºôº>¤³†.> Š3ĶiöÝ؈+ø”&æß•0ýæ4I<Ø復cѤž/†¦ÂãùÀ#‡q*/S¥8gQPlV¬Aˆ=оO|¿1‹àSfúêXa@†8ì­ç‘7õ$‹ÉcÅœWs@˜'3Èk±2¼UrP8›cŽÚ_Íe z·#jº<ö——"5žÐž7å³3Ü ƒ_˜ÎŽ0)›s>sLù·gŽ"dº­L¹mz-s:Ríw¿j»hQÓ¹q–÷™¤l"+¸¸îµKî¹C)û€5ŠÄfñ…ÊÖøÙåȧ‰2î'"*²¢7Þ$û‰®”L$ f 3 ¦„ñGÍ%æÕ<"ô\èYPfŠ4ïuZ‚/Ï£ÌPaSƒHt‘ …OvÖ}Ÿ_¤ªÃϱTµ¤Dž}çÚ!÷L’¾/“ç¼)a¥-¤ÛÌ|òÚ¡tÌp5 ¨‚‡ñ2½víÐÐqœÖ :•ÊPÇ=py~LDZj.½îƒ¤»O³ #&g^ ‘¯za/™ÄDgN›. ¤K§‹1hÚ.¾LýüÊ·…“Þ¼ÆÚ>ÐI…ø€‚–þ¸*ãÕ¢áí€]“® ´ÕöuŒ°ÇÀŸƒ ¶Tƒ‡‹7Íñè7U^jî¹±ëûÓIWzßGL§÷1)ž5-ÎzNïFõœÿ÷àé P~Ž{ðÔ•Qþ îÁÏšîÁg Wô\xÏx¡æ€•pÀœ˜ö%ìxªC€ò1 (]öLuúHJoç'¿/¥™p‰.ì5>\p—ðóãÛcu¾/(ЛƌC"ÆÕCßñ#ÜH—I³ð9œóåGúz¿ßÖë$ÚoÇÑ””JÚõq‹¸ÿøø4"Äš®5 \ÕðR!ÖÃ_îšR N§aÊ‹åsU†XßÇäU…û@xŽ´ŸjÊôa¶õª-ÛW:Á™Ó²€-J Ãaµ¡;†1§Cõéôõ«²«×éØ\„ ¿™&–—‹êÓ™µW4žX{£ªÿñ}²}ÖªÜÖ‡×ø®y=ÕC8Âå;«7¸ z¯U‘âzN%„}u«~„ûj]ÿĹŒw©qb@†É“2uºuyyÆmôL[mâñs9ñ„;Å—!Af0†QªÆ™S§›I¸,mN7Ëþy‡†Íöõ»zõ¥`†Švüä3ÿðº×<ü‘!*†ôY#˜‡ß0íd_ endstream endobj 633 0 obj << /Type /Page /Contents 634 0 R /Resources 632 0 R /MediaBox [0 0 612 792] /Parent 623 0 R >> endobj 635 0 obj << /D [633 0 R /XYZ 132.768 705.06 null] >> endobj 636 0 obj << /D [633 0 R /XYZ 133.768 587.945 null] >> endobj 637 0 obj << /D [633 0 R /XYZ 133.768 191.681 null] >> endobj 632 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F56 15 0 R /F73 25 0 R >> /ProcSet [ /PDF /Text ] >> endobj 640 0 obj << /Length 1603 /Filter /FlateDecode >> stream xÚ­XK“Û(¾ûWè(WÍÄ1[µImn[ñ-ÉÈØV" GM&¿~dáQ&S_ ‚¦»éÇ×qrLpòvƒÃø×nóê  !HqN“Ý!!Œ!)òDp‰(ãÉnŸ|H ˆl?íÞ½z#Õ’šq” ¼F²²«ÑæïÝæÛ†À*NHBr…ˆç—¿¢Þ|ø„“=ì½K0b*O¾”uÂÏ%̪äýæ_¯[,( ºÉX·³­NfßÚæ±lÊ¢™º‰pÊÊG$¼Óõ¹2Þ2"KR‚ G}O¨@t½'9s>aŽæp)–#ÉŸÔ‘"•«XÇH(á áLŒ¬8Ž}0G*»‰lŠs¤Ø•ì¥y²|A AÆ•œâ¦×_·§¦ÛÞSJSí¶TÜ/‡í²9}Xjö¶-›~:ÞLt½ÙžMë‰LejÓ„£öàÔ÷€ÞRp˜Œ® P1¹ÐáÎ-¨´<ø  hMÙùä‚´‡­à)ÚÞ3ÌÓÝÄæ#Æ´ízÿQØj¨›pvÅE z»ãyso[—îmëùû{Rw_CWάßÝ~pÌ8IÍ·–aJÓÞú%âÔ%YúÏÁ{y@y6 Ûôºl§ÆzªØΰq¶ÎwAÈÉ„ÓÚÿ9ZSø;ðÑãzešcZ»ÆOÓŽ¢°·Œ£»ÍùÈŠ SA’_ ‹¾ º¸Ì“ä&ÐåxICj–ç5èàIJ=9 ÝPäÈáXeêZ½(uA«LµÔ•y˜@æ‡Ù”®0Õ ªÇ÷&(ð‰³ùñKðPˆåt¢;·öØêÚs>´¶~J†dHàl>Zž«òóšpŸ%ìË®oŽâtèK#rP¶WF±Z"ƒBäk?t¦_:uYüt,·ÑÌ©òNÃ…LoÚ.fU•™y¸L,›ãÄ¢zð³{ŽŒÐyå°§ÑÕ´¿¢ÕJÊE:2HX§£µ‚†mY„ï)Kø}T üÀÕÒ×*‡ê8GÑGLÄŠr(ÞIQš‹2?ö^_,hy>ÝúyÙwa&k@OEZéžaæáy¬%ã88Þï~6Û†3óá`bd4n"nÀfYLCM€éa^quFDýQ.¶Ï'0óÒIÂ+¥ ¬‡:°;DJÉÈEn#r‘Óäu·–„’°+X¼† ]ÃÅ3CÛ‚oÆ9{ë븀®wÒ΄ø½rehì®ý½‰Lâë²r˜%cwíkÝßù"Ò_,¹¨_†.¬h?ì‡úÈWç]-i½ÿà œ×›çVö²Ê’ 0-oRY/H«ç7Å·>5Å‘ð1.ËŸ·i‹³ ú30Õ Š›c5{ï9mñ dOmq$;6P”Zƒéœ~…­!²Ç|",,L.‰OBYÅÎÖaÛ• ‡~nnè×@X€ý=35Ñ4A„ýüZ¸Ò%oHëPw¯Jâah W6ÝÉ žLgZ¿®•]5’°àÉiÓcò[ 4£*÷Í+lè g퀋±?¸p¶ráq9¾[t=.èænrÄåãòÓ\Ñ¢|80:Ù¡Ú EÍCÖÕ±P¿F®â<À²—‡SH€[˜ã…Õ%;{{6+¹ "”¸‰dšÁS>g‘ä®ÐÍJP€Û€áp½]ú9ª6“þwë=(ô"OZ^«ˆ 0)¡_U/ \èóFVù­u$ÜB°„øÊI$øÆ…ÛfdÑÐO­1˜³ª.5zñÈÄlXˆ邫YpOAŒòÇÉÀ_˜ ™‚0ºÍ;‘A½È§‡Xa÷æhVÃrå­x•DI•nè €Ì¡2®Âù´êÞ¾ÝìÝBîßã1÷†ð?Ú³»Î´¦ÒûHºç”@DÈ“–ch@qÆ0„À‹ž°LÀ³Ç êâï,çþ¦’ò:æÆKýòÖyúúý.`¸{¼C,\a¸î}%vÑ=V€é/˜ìm­}é¢ÓÿOÄ×mz!¼ã—ý¡™Ôùvïëbt´ Ke­Æ½V:÷ÖÛú« ºý¦·«…¦j¡Ëu%â +•éÇl›ÿ[†ö"ƒwzfƒ@PL†> endobj 641 0 obj << /D [639 0 R /XYZ 132.768 705.06 null] >> endobj 642 0 obj << /D [639 0 R /XYZ 133.768 667.198 null] >> endobj 643 0 obj << /D [639 0 R /XYZ 133.768 585.953 null] >> endobj 644 0 obj << /D [639 0 R /XYZ 133.768 478.979 null] >> endobj 645 0 obj << /D [639 0 R /XYZ 133.768 407.871 null] >> endobj 646 0 obj << /D [639 0 R /XYZ 133.768 360.673 null] >> endobj 638 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F79 60 0 R /F64 23 0 R /F48 10 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 649 0 obj << /Length 2050 /Filter /FlateDecode >> stream xÚÝZIsÛ6¾çWÐ7iR¡xØáLMÝvÚé¡ãøԦŢculÙc)“¦¿¾%Jb–öD‰zÄÛ·¢Å»‚?=£õõÕÕ³o”ª`”(ÅdquSçD+SHÈU\-Š?&ßßÎ7åÓtÆ$°éŸW¿øÇÑFƒ{Œ3a‰áøùþñ®¼/W›ùfù°òÏ]”›ùònÝ> ‚p¡Xý´Ôx÷O3ÓPJ'¯ËÍÚ?=_-ü‡Ëò®:´:¨Õ¤:Ñ«˜ªdŒ0UËQ¾¡”­–0ÈÂ1qßPI›2:y¸ûx[.žæwþ>òÆŸ ac `ÂŽãO›ï¼nÂ$î4 nìd]nü#Ñ© ˆhÏ|=I¡'˵bî/µ:¥ÿö~Uéå>>ÜøëÛùzyÝ2©l…&F¨Å €X©Þ!6š³V‚—žÀÒˆ¨(1BG§ ŠXÍ#2DXSÌ ± <Õ2£­ ÔêÓ¢ÿ(E„V(7ž(úbh7]DßxO–óë)ÈÉ­ÿæLä®n—áíëyoK}šr=)ýe±\Öø~½\½«£²–‚…A¡Ð:\6æ{CAedÕDÖЬj–×Ö›''Ô|¹j¼F%ÝÇÑTÇ) HIº. :¯ý«""‰–¬¥û=Ë‹¾µ žH…¬Ñ’caè¨Î2aPrݦk¥é˜ b‘ypL'Qõ÷D  ‹¯ƒm‘á¥fD1SD i/{µ_gS]†ê³Œ{c¥Ž÷ÖVH»j•™©ÈÑAœd×Ƥ¯kIÚ;§Ê$í•IÒ¾Õû&#ºƒ™†àïÌ Xå…ÝöuG`ÅÞÈ3a0,²B{…÷&˜6›‘°†ÓVè²Bƒ…“…ŽÒ¥Ì'¶ÃPêóLdIì“*é8‘>žWìƒÈÍNö„ç†ÛäU6A¬1I´mE’ÝÍBÛ–à"àɧ$,7 ;E¶Á|ÝãÕ.!˜ÌáÛ\MC{ A[ÅßyåS­7^d,1ã®V jØž‰ã)?,7®/iÙ¸8bËÐ|j„€äDAÝÀï[6‘$”5ƒ²ÌA TkæE¶¿ƒÆ&°r]ÙÈ&°"Åp& JÐ õa€fòÍVÍ8fÜÒ ]v‘ÓLŽTDFÒ¬õk™›@+/„š¹ñ;S:uh£}IÖ§´9Fé¤&JÇÙµø‘Šé8åòK —À‰ïi~_¶»ÐÅÃ=Njñ\9¾>XLŽ®~üŠÛVÕŒ qÊ«`)ÈYgvYr•õ—uSI@•Ù8‘VìÙXÈì‘-‰E­™Ù@ÔŽrº3“Û…@»ý†à’Díäê6×Vq³Ð û8Ÿù±šsŠ‚ØzªnäÜ…wnF$œ¡mößqSÔT›šûº¹­‡úvÉ‹¤·eˆ#ð9æÖ\”¥JfIטz¶laÅH¦rðè¶wègtë[X2»åºŠN-’ÌRRe°wf6ûff¹=3Ǧ†æoz†fÑM3P:?*à'ÚËóŒq@ûˆ:|ô®Æw£ œ²·V)4—Ô» ƒY!rPc0yªùäVaLPÙ:âÒÓWiÄXUMñkx¸›5àá~¨²o½mòš gpƒ ¡¼^ê o d˜.¡°Á­™|ä²·zïC@$Á½6 ©à T{óñ±Ìd,–@Þ²š†£Ð4‚½iáÚì"€H]×nÝ ‰\ýˆžgØqÊ$óí+ˆx±þYQ ogE×½:lÊùÉûK„Ø”»]aSî~ÕúÚ0N°)÷ƒÇ¦§ Z˜Ó^MÁU?ªlºvÙ>@bD™òFbçdú`Qm§*dSÐU䀨/$Yö¨8ÁÚ𨽈×0±Ù)bg3é±M'ö׌êS±@ „½` Ù rô¢Ã2ÂÁ~ ŒR‹¡l¤2jMÊd[©ƒR#bP‹ìà•ºü+?î"ÇÁࢠRŸ\T#‹_@³=à¢:\ RUƒÐE5]´€3Š‚.ŠcÑÅ¡k;\Q»Úè!Fnš7…eWžò£frø®ú×Eƒƒ`dΞmÑ»ÿ­ppÌîm‘E¥&YU§ÖÐ%0‰i‹3ÉH‰†v %.i îЀÔ!¨ÉnæüIÜVH{LŽm d‡dC+µ :Å*/ýe V‰åU‰áP¥Lö¨/ÃBŠ½P¥ú  J?¯ŠAÿoàÊËìÔ¼¯ùõþP%UÂP¤’V¶P eW G¨|îo8´[ê—+4_ùÜN¡wW>‡õÏ> endobj 650 0 obj << /D [648 0 R /XYZ 132.768 705.06 null] >> endobj 651 0 obj << /D [648 0 R /XYZ 133.768 667.198 null] >> endobj 652 0 obj << /D [648 0 R /XYZ 133.768 487.77 null] >> endobj 653 0 obj << /D [648 0 R /XYZ 133.768 464.357 null] >> endobj 656 0 obj << /D [648 0 R /XYZ 133.768 384.437 null] >> endobj 658 0 obj << /D [648 0 R /XYZ 133.768 327.765 null] >> endobj 659 0 obj << /D [648 0 R /XYZ 133.768 238.721 null] >> endobj 660 0 obj << /D [648 0 R /XYZ 133.768 182.31 null] >> endobj 661 0 obj << /D [648 0 R /XYZ 133.768 126.918 null] >> endobj 647 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F81 71 0 R /F48 10 0 R /F59 24 0 R /F90 654 0 R /F82 101 0 R /F96 655 0 R /F68 28 0 R /F110 150 0 R /F104 657 0 R >> /ProcSet [ /PDF /Text ] >> endobj 664 0 obj << /Length 3143 /Filter /FlateDecode >> stream xÚí[[“Û¶~÷¯PÞ¤IwÀi:S7u6]÷¥uÓ¡$î.;ZR%¥µ_߃ I€‚nëÝ4žöeI Îçòá›Mn'Ùä/²Ñóõ»/ßp1ÑH "&ïn&˜R$…š.¡|òn5ùûôûâ}–‘ªÜ–u5›žM ÂH¸×÷Ï®òê¶p?ë÷ÌÝãªXçæ3…gÿx÷§žôË7 ‡tAŒaè²,¶ð½Ó+óÑË7ÀÑ0–pDU7’¸:B!Íi7àonPHKø”)9¡H`éU 2q­&ó`ÔWnS‘Âþ=nb i L3pd»¨DžÄ)vƒVn×Á ‚ᩯ³P„…î¬ú·qq.!ì¨Eá»G3£rê× ÍæŒÉé»»"!·ˆf¬£ÕXا7§#®ØdŽ1,Š·§ÎF®Ü£lÝs{çmhS¯?Ý«f†ù4_»¶,bŸ !Æb2*«ž—'˜ÑôFáÍ ƒ¡Ù(Þ«÷µ×䑬Ñ&lF Áz"ò+`]ªéMj*‰úq{ÁÆF3Lji™Öˆœäd²?hä 8S§½&yd9ÀPhZ CÇ"œŸÉÀí¨9è”2$ÎÎÓ> zŽä3h§¬rO ¯œL¬L("2¼‹ô€qÌCañm‚HÈñ£L/’ÑÐ!­.Âï-N¦Ø(Ôî%Wí7=è©Fðgy0xhm,ü\@ËTŸV.º¾7·qÀF: D×ɵ–x|Ÿa‘4S,ø—¢øqøà@L<&Eϼˆ=‡Øg"6ö¬1Ä‘Ì°Ã*ª[ú,ÍÔ°®OÈ=Ž"ÕÓ¢H~KÓsVF>ƒÈq©Ä1ŸC˜”§¤'Oèø2bä'ØÃ…ò)p¡:… ù \hTÜ»þOIü.‰~µ<ÕÐ'Yƒëäp.¾8lNÁc¢’A—«—_:’2Zö <4̘4!=XéÀxÑÌ°šÕÒgúk[æúŒªY¦l4âªUi°;6~¢lvVp;]= ö#3>^6; ì“ãe3qªl¦Ž•Í`K¥é~Ù 4»Ç¨lF3Ñ•ÍÌN`¨)R…%°•7(ðÔ]Éak>ØÓˆ•!ÔŽ¬3'%m̾ž¨C'‚”¢OËpÒç3ѹ²hç´& Ï+÷° žµ†Ä»Iì(”Œžà¢Ø~(,f6\Üç3œA@€?žb]ÜÕÖvX9äsY73’Mçnq°Àˆï\ÉvSW«²ºõ຾ÏK:ß$t,5âf'¨[ryŽ¦‘bÿ=<™Ž5щ=À¨..‡1O ’F\k†Í~ªu)sÍz®O'ÖO§¦xd1‹É¢5^Î ›X¸ß%DÑÀ=. ÖaH%÷j’{V…G&0uv&ˆ«‰ÌZ/$\Á]1‘ÙÍéuy¿YûLøv·^'–YG"Â;Ò&ÄHíƒO6mëûb[ÞÛÐÍ»¶¸Ù­Ýû¶vÏ»Üxûƒ9J(ÜG¹ëhÁµ-ux_äm¹ôÍ.ŒAJnöúá=…»Ü]ÖÕ‚ƒçÂÏ[Î÷„mž4„)ÀQbÜQb¬ŸÞ&5}c>u}|ÚØ{¿àS[?€W×Ì, 3þ¡¬w­kXÞÕ¥Í 0õ ëÝz庾Ù*É ­ï7»mÍÈléèvHd,ˆ>c½~áÏG£>½ƒõ4çGÐ2ÈíeµµÃn ÛÀzQ4ëBôXˆï¡(Ê‹¢øðñ…€•·µY“Å°2áÞÇqÁbË å,Û”yb€_ºw×å®i -¬?]A cX»xZÕ[×Ôî6›ºÙºÖ¼r1ÃÐav]õ¦h:‹ƒŸ.™Áˆ"4-7Éë)=¥U¹2Z¬o õ?x"aoÌмl¬$Xø…ÝUØ´ë²OoAȬ¤¶ØÇ7'ÌÚ½ˆðŠýÖ³¡Ùkª°R:]/Þm]gÙ=ýà|Ýz6ÎCcõyý¦øVµ7ç ð#vaÔ+«[…ó§—ÄÊeé|Slš¢+ðžl¸€¨Ùèô¯í._ÃT‚O„”;¡(qBÁÓ Å0å¿wec«zÐl…çÀ( qÆ­NÂ|ÙÍ™u¦eé oLÔÛ! ®­Ó9¯È7›¦þ誃I ü¢)åŸ6\`VÝú*_œ„g»Kd2Egl?Ý’&¡}º[– [ãÍ„y+ƒ¹ßƒ…´]2ñÔ¡ÅÜåžàU`ÛÝòÎèäIiŠk•¡1’ŠÆÊpÕzá–‘ g›æwP”5?óÖuÛ3 &È–Õr½kaþù‡²-ä6ƒÚ{°‘¢Ýº‘>™W+ƒ›&÷½½vÙ” GOLŸ\38â<™„¶ d.‹–)ëRXcÞ¾©É«ò’eÐaµI»` /0s8‰ À£eµÙùiq›Ý8,^é‰ÞyµG¿ÿدk‚uocÄ xº:ø¬uUbÒG‘oÜ«uf<øá\tê´ãî|_µ»_Xï!^vûq(2ñ"‡_õÖH\*LE£®l_ùгÎmuÀùª=ÈÇ'=3AÉ fƤñWVÿèXEÄp¿È‘û>ᡲ‡ÜREŒëb{úÖ…iÛÓ7M`SÂè°Á Hßõ 1š•I” ÷F\µ]Éå:µA΀±‡Ö:ÛƒÖölr\ö7 1ssHFɸä:ŒrUà>öA¸Úß)1½ç§LLö4Ü…:g’‡ô~œŠ ¬;ߺNnÚt‡×ÊÄThÉðZ€?æúPnï|9D+Ø«™M(;“‡k‹6æt´YÒKßg]é¨BçÁ¨ƒõ*rº^LsáÑfÈ5³ÁgþmûI°íO܉Š„:TßåÏTc<Ï,?åx â]ÑVuAUØm·mûm×KáD›÷Çß ßjÊ.û6µ°¡q8h\ŸY‚xtáD%î(íN"{>»nòóR~¢jï`xÒæEì…¯F íÑ0»ðòÏDø›«¤îÀ›kùù˜Ÿ Àú’IÒ8Ë„©ä±ÌßøÝAE&"p´¤{øc²„„uâ&iT©jL¯ÌpX u93íß×Ç™ ^ß'˜1âÐË™ù9ÉŒÂê×'êbËôb–âet¦HL8 ¯Ï~ ”×o²„K¸2\õ©¸HÇ»ï>#.~›¾ÿKÌeí9Hp |{€êïöÂ)„Måâ üD?2`g!ö4È€]~’õdð Èàˆ|ÁÈà9Tž°³ »üô¿ ø9 ÿBÐàfž\ÂÌsCƒ/Q ²rˆRïzNŠm®$H@!ü$ ¡§Pù5¡øn¹¶Æà4T¡ÊF<[˜ðwe‹qlÔ°FâLý©–P¤BØC"“Qí=ન¶AYØÂ¥¾,ìʇռ*Ì)Ëm¾-úšßÖµÙ›¾døP,·ucZ<kwKS(½ë Žqm,¾?¤$Êtp=…¤ŽÀ5¢CéíílÎø%oŒÈ“RÇuǾþ+ŽÔ2v»"‘±/M}•‚’Ì¢yÖ sŒkKç¦õ“{¶õúÁ^1?r÷è ±ö«÷üñ/î¹iêź¸7§šÔœáU~ö›z6ÇSÿQ‘›Cûæ.“¸â…@Äÿ-GuŸ$@$ƪ=^={!Íæ2“Ó> endobj 665 0 obj << /D [663 0 R /XYZ 132.768 705.06 null] >> endobj 666 0 obj << /D [663 0 R /XYZ 133.768 611.631 null] >> endobj 667 0 obj << /D [663 0 R /XYZ 133.768 555.841 null] >> endobj 669 0 obj << /D [663 0 R /XYZ 133.768 482.092 null] >> endobj 670 0 obj << /D [663 0 R /XYZ 355.557 324.384 null] >> endobj 662 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F81 71 0 R /F68 28 0 R /F96 655 0 R /F48 10 0 R /F59 24 0 R /F104 657 0 R /F110 150 0 R /F76 373 0 R /F82 101 0 R /F149 668 0 R /F64 23 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 674 0 obj << /Length 3277 /Filter /FlateDecode >> stream xÚµZKs䶾ûWè–QYB€ÁJ9)§;›rª¶ÊºesàÌPÚ3ä˜äX+ÿút£àC´»qNšx4ýøºÉìêá*»úþ«ŒŸ½ûêß{%s¡s«®î֢°îÊšB(m®îöWÿÞ(¡¯oe–e›÷×2ÛT}uªÇ¾Ù]ß*“mÞµcýP÷Ôyß_K·é`È©i®ÿs÷OÚBŠÒ¿Evu«r¡L’—‡¥hþþ²›®¥é¹»*Ei•åÙÒ àÐO~Ì‚UlàÉÄÎýÄÜæCf²ÈÙ´´Ô¹p¶„-üÚIìž‹ÒÉ0–Æu¦6Í@ _†zO{Ž=‡îø+2SS÷TµØ{ŠŒmõi Þc3š–§jZq×ñi>ŽÈ^—Âxz#Ý=°¡-ÍÂƹ;>ê}_©êöõQ\ßë6ÿ¨ûúÈÆmyxÕsãT5íñ‰Ú(ƾF<õ鹯Ïu»¯Û]˜ÜVǧ%€½D«µ¹ÔŸ'Z^gB—ùòÀU‹L厘ÊKÓé|ý#¹¢Ç¥m~¹ÔÔîë3œ¦nÇÊ+–Ÿußõô’$ÜÀaÛ±©Ž^@þåRAÿC–©š÷ûõZ¡¾5ÜÛµ™ÙÜÔ‘ÕlÉã±GÔ@ ×Ùë>ì ÝC5Pc[×L"ÍÁ1]wiùHÊnjP°’ p8¥á©C=òr@É3ä1Û€ÚñTpÙ¨µ`?ÅôK×'´tŸ|yJ¬`„²òs- } Þ4:–cSÔªFz’@c×õÜBCX¼òJÜ¢`o­<Å3có3 dbKØi†c‚ci`LdYº*ÁAVêúÌKùÊKa饀ðè}í@TÂ~yîé ÚçðÞÆ/–:¸3.œ|ßœh¶‰sh)´SÓ9n¡·ù¶¥•«£àØ æ°'£ƒº œ¥äƒZš Ô­wF^ØðöþÒúXûÿódͶ,ØoåtÃØiÚáÜô5¿Ú>Ñ“‚4>(¥÷ÍÃp ÍœßÖ»Cðî…‹V¼àRIPÑLŸäƒa›!úQè´]{;Sf2€2™[]òRÃÁÉ,5œ>ò“ªþ*ó•Ïxç/O±+Óx:;´ÂG¾:žŸnî†nö‘GnAKÀ_è'Õ×;iôŠWS›ý¥bÒà­Ê@z5)¦Æ¸ºmZREå £9Çlüßw§®Ç˳à’/>&YvàØØ×îo¶5õ†îÄ-F7u;x%\NêÎcsj~ó ìã­.}¼õ/­ðø`)öÐD‚òÏDöÔA|æ‰ô8Up¥©½¯F¦c8ôâÑtnIþ¸)€ÔjX,1bP­.ˆ²¤ôׇÔ2µ¨Âm@€~àÍ–¯Í‡8WVÃÆèm¨ãmÆw-"'ì_(‹<@¯Û‘óžÐÌ1§z—Ší(? —ÝÌÝ(2~‰š9>òå…nk¡Á¢ÅH¨Åº‹TÞÉD‚]¯Æ¸{ ç€ÒŒ<¨iw½G7>kÂïyCöD'pPbðY‚— ĶY8,D¡£àÏ}sªRâS¥˜F-ƒ,Mâ@ƒÌ4«*P#0 Àh‹{f<ºL‰çAÊü<~ö@ÏzpräˆP~šå2ƃÖÇKâ%ì¾»ôÞ»q¾YI¹B&k³y)-Œpê-·ç„œÒ¸}Òå¡ã|¤(EfW(óû™âµd¥„Ì°U%\¼1`]ùÌÃÛ+N(=É…W[¡Å6\34Õ‰›„“àÂTãë· }´€Æ£QL ¹ŽRú:±‚…‹¢æ|Ù.OçÊ™ßP&±H !(J){Ë*Æ2S÷¬´v$Æ ›Ù•$×·œÇ#b‡…1Ij)û¹†…ÏÏ›;ùâ?%n°ròpߤÔ$Å„0¾PK k^Ó`B­”d%œÈÀxž[v{ Ã®Àº‰‚Á >wížë—e':äÀy67L0ŠåU¬YòĈtuéq0La!—ÙÊÉeO¬r59Mʾ£°‹ã.EnDaäJä‹Iä³e`?™œ¥–¸_dŒ‹½!SDk ÆbìÚ¬êâs—óüd¹«ÉSòMtc”j²·ÒVozÊe"Ç×ub’ÏK¬3Ô'Øœei^·93AÛg,íºãåDyrnCž¬cž ,Y •„àkVÁ`ªQ  KŽ>õÇn Wô˜ô :t/;ÈÊü½„a93Ĥv¿X‚åG¹hVÃ^‹u\"~Ïìj°ú=z„ZBÕSµÄéD5f¾;P¢*"†€‡ò«SYM^ÌËHŸóvMÍa¥ÿDm½‹;…’³ù-mf!1lÁ'«Éo½XÐ…$ŒA½ 6në[÷&Â01" R‘wñµŠáêk®$ìë¶;€C â\s#\½5XnÎU2 ‡ù&¾MJq¼p— Ç—묈¹{ŠI+aI¯7JSA TDAZ]Ñ‘™†ªgJ8[£†æl¨¿Õ}Çô–IaÁ¹Zy½¢~¡ú0­¯løøg¹àRùüÉàZˆî%1¸(Z:×™m1IÔ.%j‹9´ð¯+"ó¨fOTH×.ŒOáesŸ:_93ó¹Ø·+à²B;?4P+"¾ p\<‚·^¸"Q‹Ð¼§5G™¹üL®_tÉCL¿*Íòÿ¬Ô…Ws(‹Ÿ¤Â(*´Bã•s¼\óå—ã"¶ 8æõ8\ª”/j‰¥¼POÀ@Nv…í™,‹ÞUù C–àŠ¤7‰â¯   $W6ç•å»ʬò‡d/H ûJô1¹äS6;,•Ÿ!}Æï°T’Ç¡-Oyèkþ „ë|M ÈÓwu ½aµöµM?·BÉŸ·oC4åòË¢ª·~H£ìb 'ÙùA}wy8иE",Cð#î‘š›ÙR'ûò@‚7í¶è]ë½憫aÏBܳ»«ï‰Ë¶ç]0D¤U¬ö¢£Gt\ØYXmî9ü !F¢>‰ ¥–+”n—¥RmgA5ËûX¡uŒ8mrU–+œ¾€NX€9V¸¼ßbÃ6€4±æe€(•d]Hð’‹ Ò>6g§X‰Òº[)ò2})w5´K.•+ZjULÍìb)ÿ†,æE7 /Y§9£„»0«ŒrRôçW§´pSýÊÝ«»[°™¸‹ ÀlIe3¶ßÐÆØ™2”,Èm¹åOéœ Ülý8„:äjg ¨oJCÖ£ŠÔÆRfË¿#”™ïüçä·©braœ—zócƒ?â$8ƒ%õ—ÉdYïYsöÍ[œM…Â%CóJê ¦<ì¯+úœÒ±>¡– qªx®•+`Œût –'³|6Jzu‰%œ¤„§ÏO¯ºóºKQŸäRŠßÇ¥(‘ëÅRág¬µÖ.®ô›$SzªÖ½dîM»|ÆP¨ ç´S&+aÝ_â T®¨ü±A܆ˆýPa´œêU”®ÂãÜ Íº˜¥'h—sùíEY¬þ¾â 隧ŸpŒ*7ïîù(1~äÒ‹´Å×ÃÆÖïÿµèb JhÇ¡Mj½õ÷»¯þ ÁPÇ“ endstream endobj 673 0 obj << /Type /Page /Contents 674 0 R /Resources 672 0 R /MediaBox [0 0 612 792] /Parent 671 0 R >> endobj 675 0 obj << /D [673 0 R /XYZ 132.768 705.06 null] >> endobj 676 0 obj << /D [673 0 R /XYZ 133.768 667.198 null] >> endobj 677 0 obj << /D [673 0 R /XYZ 133.768 643.969 null] >> endobj 678 0 obj << /D [673 0 R /XYZ 133.768 420.264 null] >> endobj 672 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F64 23 0 R /F59 24 0 R /F81 71 0 R /F68 28 0 R /F90 654 0 R /F110 150 0 R /F104 657 0 R >> /ProcSet [ /PDF /Text ] >> endobj 681 0 obj << /Length 3917 /Filter /FlateDecode >> stream xÚÝ]oä¶ñÝ¿beä̈ŸQ4m/H‚+Šø­íƒ¼+ÛBvWi7W÷×w†CR”–k»Nr œO9$g†óMm¹zX•«ï®Jÿ|{õå·ª^Yf0«Ûû—’U¦^]1!õêv³úGqߟö›w×7ÒÔÅñ±ÝCK)lQã0ôwÛvG/ÝèŸûû¶;`×7ÚŠâý 4Ûk^Ÿð¿æÉëbýØ÷c·X,¼î·§]Ü­9RkÛ6¿É±¿þ×í_”ΙÕ]7_hSü³Ô嶽æºøw·î†æðØ­›íö 8Œ;xoÇ#¾i@z=´»v¤ÁnOϸàO×BÍÐ5@Öˆ[ù­6 ÷p¯.- äù7̬˜­Ex‡ËV)Â¥F¿ûÔ»ÞãàÎÀcé¶^ÝY³Êò9ñ§fhöǶ`),²È=ïZÿþè/0GŠºØuûøCð:avŽªd¢ äýéý<àV(ª*>ø…ûaÓ´ýuäz$Š8 4zÁM{l@yZkÏ\h$G]'Gg`UƒnÓœ<ÔHO$·Û¶Ýº;Fñ~âß±ÝoßØó©;>ÎƆ†^‡…çÓ˜“ØM‹'¿w ê pÐè‡î¡ÛãàÛ\ü «"Å@òèçÜ/ jt¶°^q[|ð>yøfO»6,Ò}ïv;CÝê œ$e3´ÔØ÷û›½cÃÃ5;„ý ß[´&•ˆÖ¤r›ãó‡=ñ‰Þ‚ÖWÁ(TÅÚ¡§­´>ö(/ªö¦·¥çÃÐ6G'L´Ò~Z)sQØ….gºvŠ4¯ôèú5`Ö± Óâ€pQšàeÛ÷?Œ~Iÿ¼ï·[/ ±ºúæö Õ£\ñ•,SV¯´.Y­Äj½»úq¶û»•3àW%“¶Ö«O+ìÆVc÷Ôº‘LšJž(Ö®èKUÁZ¢‚[éÕЮ®îWWݼ°³›X¯n 3Z⾜Á€ÿKÛëÝlÌH40eÂ3®šœúi³¸×Ç€M²°Œƒ]½±Lð× ”Ù\ Ø¡fhÅ™WqþÏ–‰y’À˜ ¥µa,™ äÅ0+õ}ú`ÐÏûø+ûüÜ¿œ¾Ç7A7áÙçHdHŽk7àÀøþ® «aꮨ×Ê ×Þg(ŸáÐkáþ¼äZÄ$Ë5âÇ‚g‘m)çgG‘5 ÿ‹ hVÃ<¢,$il‚€e\ R€iÏ×ÊÇäß´ â|¹`$̇|ƒ¾€õ1îä QÓñägî<@ I_––,…šŸJ‚æ}`2tU_&Pð·È+¦™3gM€š¸>#pµ$0¢yF  Á¸@I“ÌðËçøV*Áu;Œ0ÈrÞ$Ke€ @Sø:S®Ôù1^ r.öŸY|Ÿ£; fJwyQ|/ÒýVñ-eõsÄ×TöœÀš/Ä׊zNà‡œøâZ—Œh>+¾Jé_AMQèd~[*V>#¿äa•CN| ×ëè[Å·ª~Žôºì9¢PJô]Nv %ÑUõ&É•Œ›úí’k˜VçÄ-=o5#î4¹Ó}H„dOÜ™)$¦ŽzÉ?€EªdM¥%ÀNóÉÑt.k¦`™Óö±rXô+Õ¬¸€nBÅ ôÌ ÃÐŽ‡~¿¡"Lb¡”qƒ8á9;µ’B†âJ0 $·o&"9# / /Ž¨ªè÷^Ô8ëRäÊ™Ò=Š 5WJH v9A‚gCÈ|Yð§yÝ’vZ6¥Ù‚€ožüËáú‡(¬ìZè…ÆÛíè[]²h¦Zä-˜+u¬€X«ÔœXW„3Y;åÂàKqh†fׇnMý¾ê<" %÷‡ ýc÷°ŸÏŒCë~?¬îâ–̨µkž¨±i-ZFœÕûU%79t=R퀵4£7îtîØa ͵}#ÙßÄýGž¨ÆضÒNÂŒkÀÑ?´Žj«¨jF[ í=Ú‰Œf“I‘†SEžëÇvý5áI¬Ü8aÊaJÜ’GDaž«¡A£9³ð°¹ Ÿv’1¶³2q͸ ŠõeVeªX%ï=vç® {£ñé=q+ƒ¯£‹6¥’ZëÇix[ßp'OØÒÝaø·pÚô:í쪙Uѱ–½#S;­ßïÞZ£ˆ@ãƒ_ ª®°£‡öe\7±Ùç4¨ßo°Šé  ýL¥•æ¸ŠPOå)àÄóèûI{DäSô½C{› óFŒŸïë¦,'‡ÎýXwWš·>†°¡Dou¬bØ5‚v¡ŒÕ‘`F‚3¡Õ3yp³\¨c}TûþHnøÇX °´Œì)Í¥"ñÂÕàmÌd5uÀzïZê8xüD æ»Ý #ªøUîS7:c ЮòÏC‡j‰óˆGšlvø‚óÄ#îÄ°Óï«rÑ[ï.&Àídø½Ä'S_Ög„šqwše‹â#5 UX)‘}“Öûy•fðCÁ›À´°Ž?y„vTe¯Nž•|¬°Ï0N‹ù =< Ð (`UßwyÚ£à^^¹!‹q(a,вa³fš×„?„LB°\–eñ]¿ë¿ßק㘱‹H}ÍŒŸ|KöZ¤—sF†»B¸{¢ç1@nNîB F¼Ð¢ã¡!0m½ŸG. ”ÝÉà’­éüÁBº±¥Þuß `>Æ‹Ê/bŠÂèâÅÐ êtÏ8‘2Ò«»yÛ¯·'܉@‹HM¬26Ž7oêü~ä»`ð.Îö3ûŒ‡-eÚè颒ËÌiXÆëèÆ€ÕÄaÒ§ìœ|ˆ ¶Od3I¿¢KÔ)¬ñ·Šªžä`K4¼,þÎé…ˆS‘áDâ(õ ¬˜0šE¢™ÓQÌùKœNýj”.èzå„zn•fjÆK†Ô/({\â>§ìLŸ~µ²2X¤‚Öek"î_d+^¼{€‡—8îrå‹F”¸/ @^|ä}SB¨ùÙ:¤iZ¤Ñà ¯ÀQ(s=- ‡•‹ZÒÇ 6”Ÿ P¾vL¯ÓGØ©ž3ÁN°X_ÿò±7–E¤-¾åíÜW@a¡L<U.ªÛ‚ï OŽ~C”!kª ¦¤‹ñv‡Ó(Y>³Ûd¨Ç¢åô[Bk¤(·Y f PÞ‘ÛÉÓ;Ýö®;]=[Çe«úP“õÐÈt©‡ ¡€˜­õæp@=ÌÌÔ;Ê'ï9[K€9áçBáÄ`ÆS#ú*…n3g²ˆHªj6ß×B!¾l»­/›Úâþ´_û4¢´Síf†¢ƒVòós:?™gp|Èâ(U•Åñ~hÖ>E ·jK÷ Ȳç*,µ´È•|+½´®/Œ]®—TØEO¡2SzQéÔäáëùI›ý²bõ)®s!Ó 8Ì8SÓ•D™ G*½K<°y†P3> èÅ‚Oö#— ÌñøŒaC80ŸXpðűO²ž¬ÓÐg&·&ãuù+ ®ù¥ î[‚¤3‹[ç´{nÈ SÕMP_]ÈòÔç?CÌ^K]|ï.B­Ošé6CÇÛ 8½ûÞ÷ù»4‰_êÎâif!‡Ô1§YH=0EŠ…Ø/ ŽRõ™îÌ §°ÏYÿŠq›0Mè|™`â|ù.H³aBå²;+ÎìöQ¤Ä_¨xYïi3LÑ`/~»øÕ)LŒŠjí•T½FIÕïDI«ÎY%ÅT¨é¯rÞµäʹ£”1žà.hÖŇÝÁÿ„EÀEp.I¾²À™¶‹«,w7èÊcð|þJAÖɼVŦw釛y¤¤*ÖC» ]-@?¤'°ÌSš•¡'V1VÒXî¶~fçWv›åêó®¦WâU×áG&Ô㣠T K“†n0ºù2qóÈbðC·×uYô4æ¸óýop}?Ù¶D«Û–®Ÿur­÷.‡zão'ÂÍ&Ei¾”Qn9Z¸3Ž½†äT<—c[ß,Ý]6Þ,s¤¢ø;ó”ëlÑAÔ³óSÎóµŠY[ý¿„ {b$Oq7e͆>=²Š>FI¯êæ÷šJ)u»›¶EEAŸ 2ˆ¾S·üÔ¡ó?a9í»O-}Âd¯cè+(ã®4¿o Šå§—¹j( þÀ`òÔŠ~CvA²9~êu¶æ@Xî0ÿÚŠÏã1+kÎ}à mðŸS®é±þ1Çͤ3nä"ÆÊ$‹å‚Ÿ$:ºà­£˜äðw$ŠÇK~r±ãbµÒFF&°ÛEçf%ìh—?°Ú÷;¼rá%¯óup#œŽÏ ŠËʾR/¤[ÂO•”‡—nS2ĺï^¯ƒóGkw1,­/ô¿à xY2=Õ®§O?UÂ]©‘¦“‹ Skü¼3Bå $Ƴ¯ðSaǼ²`“iÈ¢%_œÊ¢#„ú5Ê= “¦vY&è^¸ÄÒØQ½ÒçV ùz©úµÎg%˜-Ì>Èähj9þºp<¶“òø›aüwßÓàG·ÊzÅ–jõÍíÕ±Ao: endstream endobj 680 0 obj << /Type /Page /Contents 681 0 R /Resources 679 0 R /MediaBox [0 0 612 792] /Parent 671 0 R >> endobj 682 0 obj << /D [680 0 R /XYZ 132.768 705.06 null] >> endobj 683 0 obj << /D [680 0 R /XYZ 133.768 321.247 null] >> endobj 679 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F56 15 0 R /F90 654 0 R /F81 71 0 R /F59 24 0 R /F68 28 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 686 0 obj << /Length 3604 /Filter /FlateDecode >> stream xÚµZYoäÆ~ß_1#dE³»yu#pÛH甑Û8CjÄì 9æ±Zù×ç«®j^¢¤u€¯‹›[§ûþ¡¤A²?6åÍOwúâ›ØÎ>ŽÒ ²0»¯~ UÂ@‹2àµæX•uß1òæžqË!é¾.ot¼ô'Ö]ßæUÝófÞ T^ügèú²`°üxlÚ¢ªO秛$Þ7·‰ ÷weWjäÓ˜$\rwÇAjÌîV©ÀÆB¸;4wGF¸XÙ^xä>¦•‡Š.Íï­îŠy]ºëѨ‘¥CÉ¿EIX«š@MÇë•ÀUÿ°¾½6]ÕWtÎÇïÃáÉÝ?ܸy;ûª©Á„(¶û=”D{î»rBÒæg^t4á Áþ­¶'â(áàìe‰>š¼­òùìxɉ…¾Í‹¢,ÞcQG ­UT]®Mëøºqó¾p L7Ú€›U…,$YÃõ\ó¾ì:$Üÿ£<–ÄpÚÒ:ßñ ¨sª˜DseÏ’ Ž•WÆ¿U×?W‡ •…Md©ñ`ù¹“+ÊãÞ7-ºáøðü†l+ÉŽ Õ„ôVë0ˆt„AÄ*cä:0Ats«B°é/å)‡¼•£'$yÚïëuCóGO›3O|—ª.Õ/9 }ƒ bt$rlÂÉ*Õ"´TíûGBÜðêõœI¬´QÕ¼æl“òCC<öŠè°œOM[õ†xœð_ îîd(¸»çÉtADN3ÏèO4¤¸2Jb$ ë† ™#BîÃÆ>–ZFöT;e>Ý@‡çfõ[è“ö—†‡¨jXY‰&çDºž˜rþùQks¨NòIÞæ Xè„ÌBëžø.™šë˜I‚P ðÝf°Î`ÂNVÚæxU›S›_àŽÏþºÕÚ±‚&«…BecìX(‚‰ƒ8U¯¹*Ò5g,i¡ ìʼuq‚¢âH6˜ ˜ ^"[ž‡æs.­cèØ®nMé,>`Ô^$*Yx•…_BØLáPgPÛÎÉÚµê-ÐÏÓ1_üÍŠ,°aü“Gc X M¤­ÕR¦wžŸ£{Æø5÷œ|œ½Å*õ`Õ¶·S¢â”®#Sˆ‚"L!ŠAj!/nËîÚÔE'[Íf0Hc²×‚ÆðåÈ—%1zªÂpã:%yÍ-!6N’÷ÖíŠ;‘u¸ó*ùý­3-)·†œOm‰d¬å <\Íûø…}=ñòµé‘D2+±×5çA2hjÑ!€qAN_É SÉà–]É0ÌyÚ6R/К³òBóÒàe_†"ç=í§>ÂÍÝßv™¦Œuò«ë´Ñó>3È#õš8A˜Q:0©* iPÝv=±9¦j-—³ªNh«î'Ê8Ðhd6ZFãÈEö®³·©ÖĦыÄ&¨´]dL@ÆšˆÁ/eÛa™òö‰Åª0Q.Z’ÉŸãÙ–S§i+Ú“Ú¶FzC¼Ìôþ¯h«®tç…“4P:^jœ GêNŽ²¥býðÄ¿|,Úò‚:—#0•¯[üGN©ìר[]2:Öø+üVÇÙ_”q)2]!²!W †Hîr„@Yrªj‰õ·*΂0N—¤# ƒ×$[5fÿ@U¸6.ù¢ù¡걓æÚW—áBü4‰—Ÿñõ‚ae®ÁdŒ6€˜Ghl=Vg:€ª1*d—­ÜC£‘~5´†SÙk¡e´Ø¹EÒu*W«+:vxjW>£g„›-xî4ÎDÌÐÌ…“Ñ}|+ßrª-+âù¡ÏŽ. àرpQq†vI5bEq.¥Èvúçú\ï?å³nâÊçü‰'ù=6—+¢ˆo\H]rö6\–ý‰U…I¸ö4ÉÊÓ$“_}!ØfAv¦*I˜«]9Xn!)ŸzÐ@Ì&Üà¡Å¡“!+E.¡Iþj‘}¹)ó‰Ø¬|"L8§oGå¡ÉñV ÷Võ=ëUª½•aÁE¾£tž^=©c@–k}x—âË4Eù±hfè¹2IEv~öº–êí¦“N‘ÚÄúí¦"梎Ôi¶¼*'@0ŒÌ¬¨Ÿî+¦œd8<œuþ¨”3JÓ\«š»æRòÈuoÊšxÑ4ɪ¸¡ÂQŒ8ã©øyÓñgÙz]Ž&wõí€ÅùùU¤®ã–º&ÜuÜœ(pOÓº"?¾a@ãã@éF”eÒÆÒè¸i‚˜3œ{þ±&×~²®dBÒ¯ŽÕZ¿ç棻F½ÙèdYZQ;ç™Øh½h›áôÀ“9N‚e³ÜoÜÈã3EüãÖ“CÉ‘4Þc8±3Oy'';`“7¦B¬Ñ¢ÆLWra>QåÏJ ×¼ìÑÒ榹¤T~F‹6š× ‡'ÆØç®9ð<…C…½ÞÁíÓ‘;®Ýr ¦»Ü­¨ºêp.e뉷Ær‚7:öYt6¢”Ÿ'˜w¨¾"c—N—ÕžpnÕÔŽw±ËڱƳò !œ•†¼˜7wdM6i$éjOjs(9µªž&$¦ð° ïä€E¼J…s¸@ã»òC³!10&L^‹„ÔÇJç6Ëq%óã¾Ü’=öÕè“B÷~’íÿ(¯݃w!gnÄxÔÅ{·kc'S&/)i¯!ßÝsúa§€Iá<3Â^7HËÇŠÃ…°A0pQA¨ÎîQ€3Žû‹´^Áo¸Wˆå‰UíGùšÂ-°Þn9ªËpöA-–îë<‘ËrÞ°‹¥õÍ#¦5s Û[öoã IÌçØ¿ SÖ–?W—Ö×H8šÚÊRÃ+ÔV½äµc05Sy7/ ÞÎy.hØǬ¤ª©Î:!@jX„j-[—Âãc寡p;Zœ˜Š%Ϋ-=´ žþÙ7ŽhL:°™-"ÔšÑU¾Ùš&!ÕF<¾ûêíŒ.w>Ý ;+!µ ¥V‚ðˆbïD׃±ó? ˆi½ûúîÝÏïÈ÷‡;µ‹4B="JÒ ³ñîxy÷ÃOá®À&x ZÜ=:ÐËNé!uÞýóÝßùf‹Ó"˜•J¬C•XQÖkuݲç ù…Š0À-gÊòü“¢Yå`³ÐB21*ጎÛÿApL7Xœþ¹Õ1¼ë$(ßÀ`©p¼‚’¹ãï·ŒªYñ˜~ßvÿvhÆÁ,¯|AUs¯šÄ¬‘IÂκ¬Tq²ÿ{ÖÙ»•lbñ¡ü… +ÎÔ±2u. ¬ÞT¼(Б}Ãg1ñâ2‰m|~«OœÑa‹6:ßÛ1:ˆ³Un͙ɟ‘2ï0h†þÊíT×_Ý-†qiÕ†Òkä>S‘÷"9Ñô”y‘ÿ@t«ã»ü"£Y_À[2%£åD Yßlæ©Ö&/6ó\'…\ësvc×9û,ß[Ñ©Îþ‡Ö#R>Ÿ§ùg » °vÑZìg%땽á²ü,Û¶‚*wÕñ?©»”ÛG(.b¤yî ÊÄ ø¦ÿoÑ&) endstream endobj 685 0 obj << /Type /Page /Contents 686 0 R /Resources 684 0 R /MediaBox [0 0 612 792] /Parent 671 0 R >> endobj 687 0 obj << /D [685 0 R /XYZ 132.768 705.06 null] >> endobj 688 0 obj << /D [685 0 R /XYZ 133.768 604.633 null] >> endobj 684 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F59 24 0 R /F64 23 0 R /F56 15 0 R /F81 71 0 R /F68 28 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 691 0 obj << /Length 3653 /Filter /FlateDecode >> stream xÚí[K“Û6¾Ï¯àQSk!x<¤²oìJjöÆ·$JâÌ0‘H…”üØ_¿Ýh€/Q£™ñع¤Ê6I°Ñ@¿¿ežÜ&ô~S´ë¦\…§¶ÞD}hòª½©›]Ž“ÚÈ,?Ð]Þ„uCôë<,Yåûý¶,6ô¶ /óÍûkiyµ.P¿g¯„ Ý ³¦Ø×AoÆ›cU¡ä4ZîÂp}3¡Ëׇc¾¥ûMw×–»ý¶¸fñ‘vÅá®ÞÐý‡òpGw¯ë]Ý|¢ûõñÐöÆ)ZZfdØô+”¨ÈÛrUnËC˜ûò®XÿöS…Uþ]Èãÿð'l²<”E{Ѩ?|ÜMYT^7ºÛ·ŽÒ« ìQÞ–HíyY=tha˜ÔðôÌÞ”ûÿ”«™5ÑïSÉîò––hïj”ôCWô¾Kv:Ó¤3ºÛÔt­ê@[G¢Ñ÷h‰f¡,…Ηc_øPlÑtB,¼ÂDr-†õaœ|†~å†Wuµ¬WÈý}YÛí'DWìö`k"[”¬`þÖMXµÂ]ã½ßû0hëíÑGË9ç]]KˆrØ“â¤Æ+:þÁ;ÝmÑЋŽ»^j›bœÎYJ1íl4AÙngÌÖ´Yg&DÁ:Ö¸.øCS€º ZõWÎeÓ†½u†@ÂœÆn†Œkr`$Aýãú™KfL¤ißÒ:Ç[ÊÔÒ#<¬AÜrÂ@HÓ…÷(Ïé‚&ÛçMÙ”ë™ùµ7'y q w÷¬w«²"ÆvÑîóuxÑ5c£cõG¼÷`mˆN¸ ;(´Œ2)ePxqs-|RAW±%Nöþmmðo¸ñÃ<,h‡i«Èg âà„)ｧEÞù¶­ç¶Ù:àæ/ÜàªåºDÔ'ÿ6ßÕ>eº¸œ1ôIœ´¯a(LX}¢+(vŽ:™l¦“ш”!³aüÈ!ißü• ;ãÀÊj—ªà[Ji¦x:–ûî¸Ý‚ULªïp#J9ÐÑ-¸ÜánGÇï°Þáõ)Û|çt¯0w(•vå/έfò½TŽ©~§ß}7Œ H"Ūؒ“¡Ã¾_öúŒ›óòJ#˜µÙXÞ9j¦¥~¤F—J ¯<ºóš+ytÙ ·â3•Å}QŠÛ¦HÄbõ «!ƒpõÅoV I¥ýîx\U ç–+oè “€q\sà¨c–]’½¨qŽ¹AªgC×rZþ ̺²ð€Zÿ2 #šû³>ví+ÅeX†Û*lWhˆ³b.€,sîQñ³Xàc˜{d¼Ã"j˜öh€²ÜôY¦”‘€.롼ðú.Gw ™îvu˜&˜*=ÕÊ¥6LÈIXÃþÐèF”ŠwƒÉþPÇq»¡{´^›b7( ôÔj8ØU,¯¼_¹hÐ]ÈAaÖ¦Ó­˜ysÐÍ"ÖÌŸe]óøÃ3X‘jU&a‚çäÐ`Æk˜ )ïV“]VPk¡ÙÙÖå¡kùÑ'a–UN Æ[EMŽõUF±cÕσ(jlTŸu°eØû²c"öÔ]ÏÙ@A¦¾lèÎxGyäºï“|)Å]åàZd ç˜Vjìyu°ïÐÎÃz =Ty¨oè `¹“ 7‹áUæzëãݾöé´ f‘÷€]ÅLìK)Áz]h732¦ °P$CÎN™‚™©•OtGð™E3&S ÄX ËèÙsÀe\žhg€ÖÐMæ€!y»¥ç`¡f™}š2£ªê÷ ó0®EÂ*Y‡ƒo 9Χ]ÅD沧ð™s4ΠóŒ´L™ƒò×x3ÂÔ›r‡p{cj•‹-×RhõI©§~'À3ÌhðôºÉŠy¸†í|¢§2DÈUoßcb¤¼€tÝBnë*¬6>¾ß -î#¬Œ ìnM@ïþa ˆ–#r_S´ûºƒšTfb’0z >ѹ€Åz{ÜU4+]d¸õ2âÝÓuÜgÀ ¶×ÿ+oÍsxÓ@äZõh¼‰½ ‰Ð“il9Hq´R îéÔ¯)sJ&*œâ«án¸Là]ä†hëPxlç‰CèZÎÜôìhC;HMe8}*ñT¹}—k(½ŸèªæE<Þ„r± ãÞíÉɆçkSÇÇ—o‰úF#CpJ6gÒžN£m!;m ¯(5º¼«Û"ŒÅt Û96Ehlu8!Á×d†0ŸªÀàmYAÄçÛ0ŠæÉôVÈ©žn8£–ëú¶É÷w25ž$´À¯i sîÂa´ÆntÜæ¡3€AKœŽÝŠ6Ãȇa2œ JE\2­B©aFtém5ãí°ŽœTŒŒ<à9ýM·ÌM•#"n’%À+)BõípjOjSCœªg¦û"ñûŒHšq@ú’ñt|>0â‚¥ÀéÌŒö3aeàõ€èã,+-Õ«qθ2bõílí=¦áñˆõ¹Ää55&÷‹ðób[Æ}[Ùo#h:‘Éfõp³/Îl¶ï^t¸uŠ`Äc·p¼ìÏöáC…n{æûDr~4†œÿRÐ’õ]^Ýá¤#Œnêí6r†½_ýðî ½†'"‘Z@ÅùRÁ$ˆ´Þ]ý™\ñäuâ¿o]q¦2g’ ãæp¸¿[Š& ðgÀp6Í„À’Àe¦t»2àZM‘\Ý$Woý¼¸2MÄ`‚5ƒÁðwx¿Þæàá 04¥ßcÇqøúm?>\èmÜÆ€«Â€N +Ù63·pj™@¿´ØIx-ú¯‚£Ô Ó”)¸Ð i!"¨ iü4FGEq ZL'8&ÿ"ºgXã_'NIêhs`Íe0W´ÖœE½/JñY&…¦ÐÈ‹6 T#›ò›~?£‹‹cò/¢{†5þybÓ¨©Y£{Øô$Ý8ÉœÌ ôúí”IR`h…K´e2ƒîd6ÛøyîQÉFeL)q6Ù _Ýs¸Òœo +¼>Ã75‡5”¼à›šCõ‡üo.囨Ï3 'Z쾌¹]ëÏ2ªÂÉ.5Rýp.%œNSóF Û´3ëŸãzc0^FX«‘@‰g&ÂD`5Ø ÙTQšè×|¨×¼ü‰ ƒ*9eØ•3À¯âAéo®JP–D×tŠ¥¥¢kŽ0p¤ŠD½kŽêÀ„jRúmžÈ'$ËxzN@üå‰y²€Ì¹6§Ž[  ’™ øc× ô…bJ„ÎBÒîH aÅy5 „™Wƒ{NÇ™(v%ÆB]FQ4sç«óº'ègÌ¥–r^vVïÐî©4‰4}«6Rh`5à4ò«n—'âñ+ÔDîù€ ~> Îþà€ºècÏ#ºÿ¤‘^=PD? ¢ ÕsˆÞ»¼o^/åí¯ì. °qú‚»¢ îÒ³znwùJ9ÛBN²§:§k˜àÙX'Rv8æ‘'š£çw_Æ^Zɸ;é<®È’VÌv ÐådtĘŸpš)l@H¸sGT‘èL’PM2mvÙíö ¤²tn‰ß]…z,¢R€ìϾ¢Âï÷2û"!­þ˜¼å4“âLŒT‘h>¤§TiŽ©ô OeSè©fŧ‚Ì?W ø°ø<©qÅy5Ü ^ÊÙœ¾x&MFÈŠ/à–ÌÿÄfPpÄ=ÂSÚ@3‘Õ€ÓçB û#@Èð[£§IŽ•ˆޱ䣟ëDª‘èýoFZ²L);ù|#Ÿ|Uï¾ß|;û•C ~ÌrÿW}Γ-ON£J{d@âOE¹}²¾ƒéî’¾ÕCõÞ§,úÃPYåœU E!Šë©žlwÁ2á&–¨÷I9Âz4úpÄøUê À!ô…úˆ.Ô—žÕÓêËyu>kåÉ3VžŠ>Ψ@å„‹þ°fþÆçt/4tàBžž"ˆÔ#¤ági–r_åüÇ.êT¢¡ ±\ŸÍ`Oøl8“Rt¸*§p SRØn`\¬4‚¼HŠÊðx”ƒøÿFŒ˜é”ì3$sœã/®‰BãO¯$júÈ$Å‘ÔZ×à<¨ÓNól@¥Yªd–8~wZ¨n-ì2x¾7ai¿]è߸Ðc™ ü4ØyÐÔ„I!Uøá0¬1|Þ&W¾óþùçYd9¢"ïä°×Ô‚™~I~óÃ0íOð÷wÙülŠßæ¡Ûy“Úâ§f ª“¹€¸(çŒ Ä—áM7k§uœ—õ:ù9¢ÛÊÿÿ÷bŸn—àåàSðLŸÈ_ÀN$P‘˜ò¿ùéXBdü+ör endstream endobj 690 0 obj << /Type /Page /Contents 691 0 R /Resources 689 0 R /MediaBox [0 0 612 792] /Parent 671 0 R >> endobj 692 0 obj << /D [690 0 R /XYZ 132.768 705.06 null] >> endobj 693 0 obj << /D [690 0 R /XYZ 133.768 640.498 null] >> endobj 694 0 obj << /D [690 0 R /XYZ 133.768 562.79 null] >> endobj 695 0 obj << /D [690 0 R /XYZ 133.768 421.943 null] >> endobj 696 0 obj << /D [690 0 R /XYZ 133.768 328.907 null] >> endobj 689 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F56 15 0 R /F64 23 0 R /F59 24 0 R /F81 71 0 R /F68 28 0 R /F90 654 0 R /F104 657 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 699 0 obj << /Length 3321 /Filter /FlateDecode >> stream xÚÍZK䶾ûWôQ¸i¾ôB`ŽcÄÀî-ÎÝ­Q¢–:’z×óïSÅ*J”F=3Ø@N¢J|‹U_=(¹{ØÉÝ_¾üüÓû/¾úÁ»R”™Îvï?ì”1"ÏŠ]–æB›t÷þ¼ûGòÝ­ï«vlžöYš|¹ÿçû¿~õCf£QÖkLé»×CC}–3¢œº¸fèö£MR5õ¥nÝX üþŸ›kê±ïu»·2ù¸×2éšuû@ä®n|ëêzw©ÆªŸø§Ã‡M˜¾q=Ñ>í•LܼÝ!ÓÂXµ;(%Ê”·{í»½J“õ¹:ïºT‰ñ©“¦rÃH¤®­ˆÖ} ÂøÈ„SWÑöÓ2Þ¾ÎD1Ë該 ! ô2ô9Õ ôf¯šÜ‹‡옶ûƒ56yXp×kSŸÜXw-sËLN¢Ý+“ ™/wê.×¾›J`5•CUÑ˱jº½N“O@UDòBínÍ™^»# Ž”$h´UÅ}>t=5úê²ƃE sØ×'zŸõA°T³H^rw¹¦šyÿ;uÉã.¹ÈÓXìùÆ4 ör{Ý2¿ïž.ÈɽýÄvò}~l• ™Â£`;~–wݧ‘ÕéØT—áKxU&i»ÑQyµ4 ›nànpDÏSF‰vǬ}³±¶eí/U¼Î£C›ùˆÒå­yꚆwöÏS×cïjÐ9žbSñ ÂO¶™²aÉãÔ%enŠÀ“q[òÉÔœk|uBMÛ‚Fåa¹ëÆD©Hg«ñŠùÜþŒ(ôÄóÃâIÀ<­7ÙÈf6uPJÞ;Š?nLa…šuñ× &3Ôp yÒé–Î#EYìÊhŒ„£3¶ÅBÌ2ºœ²LÎõ†\çKe"û0›.ó"ô©zšŽ€—ªj&áÎLt¯Z®eŽ~.`͇ÔYhw:QóSÝ4Ô:VŒÚpšå µÛ®=€å‚º?ìS@ìajRÿ Ïb[ ¹¶°Ÿ'† yÅ™a˧aroLYÉ —ù]ž«_GêáÚsèâA}«ÏÅ=Ñ—•㨎ºù}¤g6U½x )l¦—â©Üé„hÈaà ‘á㩤6ù±¥/ÜE1Æ÷èüü7T¨hiÔåèÄlü욇®¯ÇÇ }ñ»Aúr7~Žº àn‰¹äÜáéë–kû¦B­˜4]œÆ†f@ìcfO|Û`\uEÚnM£„ÔÙoãϳ7úóâ³ü9náû·-Êæ‰d5tÍÔß<àÓÃ4&ûC1O`ñú€ ‹ONA°ÅÁ0x]dK:¯¢3¹³Ò`î²—†ÈaüVrª6DÙ Òôÿ!ÐÐq Qæ¤ÒÐÂCÊ-ƒÖB¿¬nLØÈ‹Ò|ù½ùÙ2“¾Qñì[ÏþöŠg¬N¾ë8 EÏÕÕ"^l)-Dª&É_¶A g3YÛ×\”q6Éñ†\@r©ÜÌ‚+d™Ç‚¹'cõ&ç¿‹Œ#­æ^9ı@y´¯¤i0ï%0zB×n"†ÈåK¾Ïk66tš¼N_A<Å«1&Wí™WsŒ+1¹AÉÒäÇ‘1G•°~¶ÊÀ]Ëi¼‡(l9±¿6·‡ªJhŒ<ø³£ÇsÀKàÍײä]Umå—…:ôÍV‚éC¢ +(u‡ù»h1ŽeqÙÛqë1€&²É_NS‰¶^æÒÛUé¥êa îÐè, º¿ˆÑÒTäöµ e®6aTk *à´Š=v¼Ä¹N}}ŒVôOÚ¶†%á‹?l„¬ 'Àº÷¥Š¯üs°³ Ä93…r^½TÆê…%›zôÓâG •AÄ®nœz±«çOó„ëmÄ Ê—ÎØΩíö¡d¶8ãÅ*ç©øAÌy;‰8ïêÑÍŸ©”AG IÞʦgqyÈW× å®×Êqaè|맒ÐT@:u·~à¶Wãg*ŒAk¨/׆8#÷Kõ#öö?ûú`ˆÕýØï°¶WEÂ%±ç²“‹ºÏ^4'=Z³FA@à BHÁìi æ‘I°uGù$¾}è» ¢ÐzU ³ê¹W™h)õ5è­&!oäVçЗDÛ7äÆÒ×6”Ƙÿ)+°SÉr½Œ3tfŠe>°.a¨É*ªhv½š†«)„æÍÍÛ°QSÅw¹;“‹¼È^Ú^§iâecȼ‹üÍ“[Ã"×eXÏLåúÍÖ‰©PzÍ.^ ­âKJjæ¬øYxYBØxˆzq)êÝß„ˆ{YsººU– ™­¢ÇÉpžs B–æE!Ã)¨ôU!+½ õW|©ó¹NDµ ®M¹b QõÊ.Œ ?èMU‘ªõ)/Œ NùåLD:˜Í"J_Ý"päܬFžúUÈl¨#±©Y2‹;µÅ˜yöFµËî«]*ŠÔÚq/[À%2[¼,êt®´|}GTÙkÂV¿Ã–îj/„ ¯dªy¡ß¼%ý¿nI¿¶¥² ¬µ>ØÒ¥å#&׊NyRÒ êâˆ6]# ¢ F•–Âæë‹áé^TetŸ r¶Y ÜÚ·”µþMÈ·Á[ÜFú^ó3¾0…ñG~ñé&¶0¦ñ÷·Þr€à†ÕRËKÚÅœÑÒêÁRÝ][ãwTõ‹/~ øÄt}êzw}vêá ï{Èh±8"‹äoÀ7]âRy„jÜÐÕBL¾Zx"<‚R6á[Ží"ÊÝØF”ªé Îï­J¤ÎBsxd g Gðl;~ÒE48 b±;Å Ð"/Ý×”s!%¶ ôm ÅíG/$—¡ÂœFävu`@xtCÀÊŠI>m¹@s3ýUDHæ-ù¯Ž¯ 2ôú—³µ OSBî_ÛŽ¿?UÜà5·!#¬–VäÚlbõtm_s!û!äQŸ€].0ÍœˆÑ :dbX‹á4J °öýAIˆö? #åaÝ ÅH̼˜‰Ñß•n¼z4fŠ¹–…Lè ®¯?ÕÇéñ×igÁÓŒŽ ¹¯Ù¾Ö·uå¡„šë¿où¤å} Õ|c¯c_U¡F)mò½¿àGêeßSQÚàÿg_‡XÛà’w)Œ*W9a?{(ÿ' (Èpí|ÙKa.×ÑG¾{Tœí©’áƒÆFWØãè¼6)ÿÇJ4Yèå›;?c…€­JÊyUÈ(‘pqd!ϲZ´]wCÕUSp¥`<–1zú݈HCýàm:×A~9ÿ,“ûä{à~(Äšt7ë§ã‹?|•¡FØ;úÃÈÜIÁñZÒ¬.> endobj 700 0 obj << /D [698 0 R /XYZ 132.768 705.06 null] >> endobj 701 0 obj << /D [698 0 R /XYZ 133.768 598.032 null] >> endobj 702 0 obj << /D [698 0 R /XYZ 133.768 409.365 null] >> endobj 703 0 obj << /D [698 0 R /XYZ 133.768 251.208 null] >> endobj 697 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F59 24 0 R /F56 15 0 R /F76 373 0 R /F81 71 0 R /F68 28 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 706 0 obj << /Length 3323 /Filter /FlateDecode >> stream xÚÅÉŽì¶ñ>_ѹ©7´HQÄ° ÛpàlÈ>Ø>¨%öŒl-m-¿>µIÝêæ{ㇼ8‡²‹Å"«X¬ w»p÷å](í§w}a³]®òÄ$»‡ãNG‘J“l—Ä©2Q¼{¨vßu7¹¡+šý}ê`p§Á®›Š©î;µ¿·Iü»;öÃ4wÅäš—=Þ²¶ÁôäxVÙw{?ïu¸a„™7ÁÔóxU?Ì]9Õ{ týÐòÒ&€5Z!Wtûïþ\Ük­òXvÚ¸¢„8aºq·IþrjzYPú#ñ0Ö¿:ñP² Å·L'& ¾Úcß …²݈¬gÀÙS= 5\[8Âzvþ¼×aÐÏ lߤ&x*ö&\å`RM a{pŒq*êŠ!À" ½…â…GëŽÇÆù0ºŸfØ8Ãû“ˆÜ¥IÓà€ëÌcó,À¾-!®O®¬‹NØàŸ˜ÆºÂmÆ&˜G8m†OOÅÄÀæqboº“_Ä#Œ}³²àS1­›†ºäaÔG~t²âi襭»Çph\K‡ Ïî‘GpšMý#ð$MÆúP9ø×ׂ( H7Kã(Eló4t%¶&x æi˜Ħ¸+^b5OMÑuÄ‚ûn!7 }5—8pÉEÂ\ü4ã„ûI`?·7ƒkà>VËK ¼e^ç¤sävtçk8Ðíà©ÇÄÊ¿.ŒÂ õÑ'î¢C}Cb [P¤—y–c ùºÊÜU0›SQžíž µÝ•g9ôšÝ¿îþÉfq³\ •å)‘Š-zªO¼³­Í”ÎÖ±F'” ]ú}FOÊQSŒÒrC'«H”÷Ú%ÉV¢ŸÍÃ"_ î­”l¤¢ôZH·ûͳà͈Š¯³ êj‡ÎÁO Ú%„uÕe€ 7ªd°#†FÒŽsùÄŒ¦©Òiz¥9(—4à~3 ßDåi”ÑÙ$*Žp†²¹œL½¢]ÈB…p€H- z }¤6"3ÊFRß…qÈxp+Ïx }-’õé (S”/@D3ŸÇ¡o±'îA½Ï/9ÊThÓótz–ÈÀ¯KÔ_Z4¨/¼Jå&WòQÑZG/:LUš­”>þسõ …^ПŒãܺ…r¸D' 48FGÙ+È=«ƒ1¡Êí•Þ_(±Ôrôœw+¯Òï<ÛMU´Žú¹«|d"­ÎgøŠÊÄ¿Eeâ¬2(çb‘# ƒ5ƆW÷ŒùNcî4vŠÓÉO©» ôhNµ2:¹P»ä5µë„ÜÕ–ø€³\Y˜º9àÊåPØ&K„–`¤Ǫ̃¨èAóø¼àXß¡qÅ9àËi|ŽÓP€•"ß›[vF`PƒúÈ(m?¸KwŽÁªà®d<û¿rƼ%"W”vž¾žžÌ ¸Òzê"ZÙ;ŸÀMªÂè}ä]Ö`{1ô‰ò VNI×o>ãîuöá̧ùMæ3ùߘOv—8‰ ³øŒcbo:Tq¾®tô0©L'Æ~ø/ýBú^ŒÉ ‚&v¬@®(ŸXiÈ‚FÉjA¡ 꾘Ok•1z{»–«€®×P&E±nOtƒ pÜ®šOM]RéydÞedÁG­œLuËÙ†Î])kHd`„'ìQªÜ<Ü™gÌ5ó$ø;f'ÏõèÞHls3€(òÈ›všœÓN÷¦ˆ°¤ˆÄi'B1¿8õ>ä©zÅçdùj;×l1Œ–Å-±ñ£ –ô:7†* WÁϳ‘­VãO@g¿Õ³ý‚!:ÝÈb¨n¯R72¨‘1—¦ÝÃc>>Ô¿/“¯ÝlûŠÅJ•Õ—Ëú-–âwñvϤÔb½o$‹§ƒwûv÷’©sà*ûÒ:ܘí,YüóÛ$°Š²ön)O×-¡¿÷IÁðǯ©‡ù]ÕÃçѶ²AYmÈ_•ÍÛ´#û]ý™ýÀÊ‘¾*€ø]ÊaTšä©Jl’àoýD…˜HÜãEd XSXˆoìÑôÔÏh¿ÓPÊCØó:Ÿ$_½"÷ÜÜpqê®\Á9Q^6hGªš•Uܹ?ú ¾ÿ"öñy#ÖnAxÃég@T²BªÍ¤Km÷øÒ®ÑE®Âä*Y_òÊã®gBèÌ…YÇзŒÞA¦ÜlýŒê MôkŒ®…L³hœë[ø«*7÷#ÿtp2ŸppKAî^CZ³MÐ1Õ@ÂUj½2,'ƒ; 1õQ1XUÂ6*Réþüz|Öw“ûEª_{Œ`WÅìá ÓL%`çˆÊWÛ£ -j©¯¯_͆^ÁMÙK1õ—I ò²vΡ¦ÒÌžÇO§ITáÅzÜœÜ(”Îk æX?.»:ÊoåK;­²Æ¾wÒ ‰ñM °M¢L´Ñ×: Ž ñÈí:|!.…ñY2¯™Ù#,Rn {ix—È¿(¨ƒß¤æ8¥o~–ˤJ’h{—øòå‘s­šlËßh€p!ý#Ü%Èœ›zzaÀE)œÅ1\rÒ\s¨¬/")WÇ R—Ï—Âã®Zã)õ.Z–Áµ+_R%q‘2¯+¬`,3l;Èb:ft·ôúe(“>\Ê×Ðy†ÄÀm–J=Ke¢²Y äï½åêË1óÐXÌö34`²ªþê”IVY0OõÌä*Š×püã×LÔ’óQ¥‚^w¸½:zXm=zèo>‹ÏÏ(‚°Øc DŠ  ytÕ’FEVEÑU }~Š)ýô™µ,]ã‘Ô§¯ëƒ‡¿RÅdEÃ\“.šØ&${!c+p¬#—3¸ÍMj£%[lÜPÞ Us!C”ÍòÙóè; }Ù·ýÀOX÷ dö7–{¦ëŸ‚†5ýó¨+Ëx½ÍüS»fçð{Â6q yBí𦠃'é³öZ¥ùêïøÓ›,¹‘Márr3áÇR¤¶øäÔsBs é\Ós@n%°Kh]Ô<øô…!íFûâ è}~`%¾Ã¹ëû£lÜÇ&×êRÃ÷6“Ò©Ín>Êíê·a«yÀ(ydÌjÆ›:ðcÇÂâ,nf ß­¼Ï_â`Ì9¾í¢F±ñ?á$ʼ0Ô®oñ;‹ø;úNcªË¹)Öד4å–x©åÆú6 ‹×4Û`h5Å‹ò=3Áôo^Mp°›Ûƒ–ŒTÙë šK¾Ùbsñ…y¶–ÌóŒõ*»©Ñ<“°—Ýw¾F‹·Á( ò.˜þíŠh8_«ø8I¸TO>$)•5k>f%³Rª‡ßâZ1ݼ3~D8ùPD¹¶¼Â#ê ï½ßð³Ù³`Ê£›åTQê} Y>¹òGù0†*þfù¼Ê¤’z¯–9ËžÒÉâÛóÀYXY>§¡´Ààç\m ºØ¼l?Ë)©Øp^$ù¾Q2/ ’é±Á5ä!–7âeM´ØëÈ{|ñNxl\$Ç…h«FðúzȤžÛ_ÝÐó2³HdÚ¬q¸"z~rÞoç:R¨|]ûW_|Ø\>ì•}Ó¸’¿/‚Ÿ/hÅÜD·>’” ÀtÔ0,± ¯Ìa~6‡ùªG¹hx.žŸ5Ü·ûÊ\W­qÆòÑúEû›õ‹¢íàwah†QFq/Ú¬ŸI‚Á„Ô(ƒÔ’½Ä6:Ê6XŸ?Üý§¬‡ endstream endobj 705 0 obj << /Type /Page /Contents 706 0 R /Resources 704 0 R /MediaBox [0 0 612 792] /Parent 710 0 R >> endobj 707 0 obj << /D [705 0 R /XYZ 132.768 705.06 null] >> endobj 708 0 obj << /D [705 0 R /XYZ 133.768 439.323 null] >> endobj 709 0 obj << /D [705 0 R /XYZ 133.768 251.945 null] >> endobj 704 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F81 71 0 R /F56 15 0 R /F59 24 0 R /F68 28 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 713 0 obj << /Length 2804 /Filter /FlateDecode >> stream xÚË’ã¸í>_᣺2­•H=É&»™¼*•tU™h™Ýf,yE©g;_¼¨‡[Nfs˜ ‚  Orx9$‡?$òýÍÓ‡ï~ȪC×…*Oχ4«â2U‡"/c¥óÃÓéðÏègÛ=<Â42üéìƒÊ£¯>‘öw?Ù&Þ%q™i8‘N:šáÕuýÆÜDÆ,«1f Ðñ‚ñ˜V*Ϋâ2Źæ¿?÷®±[î¿G'3°øôP+ð‰‹àt"ÒÙ5g²Ñ$Ñ߯­wXCuUqQñ³¡H*ñêÈ=ˆEOÁ¡áD†žCOçy*> b@믽Oe“@‡b„f–‡ŽY0R)0­W ,¼?zuä^!T]° Â×u'‹ÔÉäÝK‡‡%d‘‚ǶYkïb@gíÉ jµ.Ùü‘i—Ïk{2óRáÎŒ÷u/x—Ü¢•€ŽP|£¨ªèaä³zJø½ôÙÝPöÚÇŠ Æ2PE–”¢ \û*Ø(¸êùÛœûXÚ‰Áô ÆÒ0Ѭ1|_DSô0H|.Þs±¤Œ‹¢žóWwý“;îX±Öq•ÔmbßÒ†O:Ûip~t C†{Å_1“'æèû¢ŒSFóîß$ù¡ìÄ!³2ßÞeÓ[ñòz-°©ªÀæç$-vd©b•”ÆYx½à²3xŽ>áµÀ]Í¢L­²$"o…Ž’À ˆžqùm8b§Z?òÊËX,ÿ7‹ºÞðȇÁmkȼ’żlº“0É&#o[ÛŒìÂ*)âTßä`òF%+s¢GOîì$xodDÀ!àUiþÈHOæ/)ùýNÄÅx„Ž±‰Ø³=ºéF‹ ¥*NÓ­àŸvßœ$.êÙœow8OsÀIf™âÄ*KgûgDÙZ»~î†ÎÞœRߤüPo¼Ìnvè°Šyù¸ƒôɱ3%ôziÎ=Á‘´¾ÑÂÝ#O¤·;Ë£ Ü$u7~Jƒ5C91äï`†{Zb˜œ`d¼dÞ[óãñ6B:3ÝÍÍöìÈÒZlG«Ð„ÓoMŠ!–{Ïhay¡@—¶$I=bð-]£?s~ˆbâô½–W¸&píºÝ$qû®BŠŒïªG»« ´ VÀœ£¯ró»§2ˆhÌø! §×³{;€­^$ç¬ý*¤:QÈg;¬‹yÛ»³(²8[B1„ ½ãly\—s¸„P†ÑXE³%jæ=]Ž¤hX  °UºЋ5%Ǹ$W¯”\9€îEê´*¾½ê{dSt”eÝÃœð™øûC«,.²úEΩ Òô|Àª`׌ùÌr½½Œ'é…Ú¼Ü0 `Nþ1ÈL…[€](§¡Q?Œó·«…ê{c_³Ã(›%¬r@/T¨UÒ[V¤8€Ññm'Pߘ×ýÌb^µ* sGæÜMå¡p¼— š=M@G¡\MI®F$nD(< åˆÔY ëh¤r±…œK¤~Ϩ…émÆŽ¾WÚ$RÓH´øídZ)Ið)°?ó–r½%¯ãr1í_í­c¥f„{¸ñ7)&Î&nÔüXÔq’ªM±ÃezŠ9;~V­©4äìÒšÂ9ê‚p¹ G|Ôpòüt[2`àIVKsa‰?Ú«ghÉ'Ò.yÒ‘㥠\YÚ^W|TÑ…-ú²­ÃÉM]š?¸ÄåLh’! æ"#ÊjŒÔüm­ñ2”¾Ì›lq‡‰‘^Xᬇ’€tBw÷­ ­Ü ¼,-϶úÕ „ØÆ4Lùgöû:]öoŒP*/Å>,ÒUbr­õ~¶¥²¬¦ü…é2COV-%óÂÞÓ›¾BÅeRíÉ­J±m¬b0Æ¢¶ìrSiZÁ2½²ª\Hmï[IŽƒu“ wôLÔðâ4ç[ýä…•ÃÇ^µÍù¼N¨ÜWõFíæ@²ÓQ£=”8ì÷äYýZH¹ÒÔn$% ÒÔÉüPÖË­"¸³K¤xýbN»Åêu:¶\–㦖 C,ã}Ï ¡ÁÄ3IË%èrA‡òìU×á3r3 W0¹•1ç«ðrL¿ŸBŠ)åá]ÊSîp2l®ŠÔ*&*bqMXžÛŠjC›©Ô½@ÜŽa›Þ¥Úz qƒIÍõpr[ÏÖ‡žVÑñz¤aG>,5j:óŒ@æGgã7xÈ%?g ÁÖÈÖÔ v¡ã0<2uB¬+ À·Ý>’‘¾ò¶QY%³ÖKÉúË!¿¿ÁÃÌ“7°mÁêÜmçM–¡K¸.ëmS]×Uô{N7VÎ}UaàؽJt¨"p`›sç~šdJy©Æì‚|9º^7Kq* U (ì¾ ÍqåÒô+‡?Ú½8Rïú‘ásÞNö~Æ.óѵTíQë‰;%vÏo›XaËBŠ•rî1”¡ uDk…¬8Qa“ƒtS:†¶›=MÝÉà¯({a„ËAÉ@ë!ç7¢Ö1}CƒÀ4Ít™Úàû«>¹ébð4TkLä”óç½_­¨)¨tÈê46Œà‡"ÍóœÅƒÁQîbx™Ô$ M®)r^@$ÜËÍ!‚:8|WpÈ™2ŽÜŠÎÝÝÐ 'jl3ñ„|µR-ÝmZ,š:>ëpS€õq-¡³ZX¤5«+ÊäDƒ‹ OÝ`ñÇÃå¼{ÙŠ.S9ë`ú<ôͨ"%‚XJd·ÔÑ_zÊÐËùy ¾ž¿ìF00üìO“ã<@Îë‡pœÛ kkþRŽáø%{€ïg¥4ÈŸì#«f¼ðßSO^#H?æF_·ï/B²éO4Bÿ˜¼wVQý×ê[’.µ*›²úN YCKµÎâT±Ø)A@¥ÜºýêaĶËZ§Zúð–˜WÜ*5_ÿ¡ËÐÒ!úh‰>eh ë,üNP26€l.%”‡°ëdj{fÜ‹‚¿Iì`Ö ~½ææ6›\œ”ÂÑüŸi‘>Á³1ƒ.5˜êzƒõ»§ÿ³"˜' endstream endobj 712 0 obj << /Type /Page /Contents 713 0 R /Resources 711 0 R /MediaBox [0 0 612 792] /Parent 710 0 R >> endobj 714 0 obj << /D [712 0 R /XYZ 132.768 705.06 null] >> endobj 715 0 obj << /D [712 0 R /XYZ 133.768 550.212 null] >> endobj 716 0 obj << /D [712 0 R /XYZ 133.768 349.589 null] >> endobj 711 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F64 23 0 R /F56 15 0 R /F59 24 0 R /F76 373 0 R >> /ProcSet [ /PDF /Text ] >> endobj 719 0 obj << /Length 3015 /Filter /FlateDecode >> stream xÚ­ZK“㶾ûWÌQ³3‚àÉãØU~%>l%SåTÙ>PGÂ.EÊ$µ»ãTþ{úŠäpoU.F£ÑøúCkôÍáFß|û‰–ò«‡O>ý&Înr•'6¹yx¼1q¦Rco—*¹›‡ýÍO›o|SÔõÓmâ6÷·Û(Š7~€Ò¤›÷·FoŠž?ºêÜvCµç¯ÝÓí/ûô—LÅ­ŒMaqü™i«<3aÀÏÚYòý±¬Ùvo±‹µ —ç¢+NÕÐù’¿}3T·ÆmU'ºöCN¾9  7[i¥…ŠQ¹“}ûÓ¹®NU3ƒÇ¬@ëœÄÓX¥QÐùõëV¶eR•ël²/½bžHrÿË8vak³Íp,¬Y:Ò³çï]ÕT?kmK_ÔÜ3´ÜSì÷ÜP^†žkmÇ‹Â L}¨8Íòà kû³*GÝ;²XX±lÛn>4T¢ñfkS&‰æVŽŒÊr˜&Çö÷”ëÍPìꪸ¨Ûm {þªèñøq$”Ѷ 5öEt­¯}ã´Ãó´à˜±MëûÕ=fÊ¥ñ8fé°ÀxPÝb_œñ:ðVm®4ˆ™mµ(K²Ì/—Zq VRYšòŒoá8»¢ö¿ÑÖF+О¡új)I—窃Ð>ÉXÊ$7›}õH_j218E}h;?OÜaçvÝïµ*Šþ€ÕrÆ ‹‘èÇ 4ßùÚO¼By¬Ê·x!©›6­‡Ù†¡c'†¾7¼• k•²Ì]‰&Í_ºpÖ€nÉGÁx_”'`BÒDOM–f›ksßr‹1EÿãrÅšq¢œqdWtï|Ó¾]S*V‰É×qÔ¯ZªÇ~@”ÂÜ9Ð!‚ëlÃÎà;pGø†[Ôîn­† ÐM‚›ÌŸ¦ £Ž…LïÛSŵ¯í;üSuǪØã•ÍÜæÇÛ 0›g º ¼Af ¬‰ð„ .õÿ´~ÏM%@9ˆÌ—°Av=ßÕx(Z o6àsOÜRzôh+hý^z!l ¾¼ÔEwk u6u›÷UQvle …4žCPuæCW”o¹£}ä¦s ‘§ç:;>t¾?úò(SØ–ŠÃ"¾#ÈŠ7—†jÇ[·y:W]yÙIß¹í=9àÛ2R¢¸Z{B_¨‘1h˜È™-”‰‚wC__Éüа¯ú²ó;Áµ y">‹–11Ú¢ék|L1aIh€%{$æáˆxþPÍž{¼ Å;Mý„w“û›¶ÙV§ó »E‰vctZ±}°˜§q!|@…máÐy¤k'=]{iö’/g™×rùä«ZºÂ¼!Á†ß[vv<¨²PŠã¹Þ_âXØ#íàsâŠPŽÒ¦påg©Ÿ|[¤lòs˜W:¸Ü]7mÐ6tŒè¶B7Ÿ"nŒ®ˆj’€Ë€|ŽøÖˆ¸ã…™Ç ¬’¨H/‚)íÔ¦²S‹|´¬ú^˜[Šf¬Æz𳩪}/=Ä>WK<ñMU§ÅÏö2pU×ãm‰´Ý|)³û6¬Uô ]æ(¬ŸÃ¯M<ù8`žÐ[tßÌ%(¯aX á%yLÉ ˜Ü˜&ˆ´L”Ò½¬pWY"ˆã0»¸ï.Ĩ‘}<¢7È­¿aƒÓ}©kiz\8÷Ìõ&H“íáÕª$~:aVtE˜ÇñjSº…øæ !¢ÇÊðú'…/›Ò±Ó<õ¿sî¹Ü# ÇšÒâkë¢Álátsº"Nºx€à°½¿µ!=Zžî ЙñôÁ¬è1ƒÅ‡R0mÙy”À`¦! D΢޽4ÍŸDÐ7ӈǜŠ'îÛɤê× ZDµÒT`0Ö¯•N\¾šªÍk^Õɤïjð>wì–D-J˜'À¶·ø=†I8Q\B=¶£p6<ç-@óNæCa6² ­…m˜‘ºèuЊ2çÙÇ‚ .ÛÓŸ>ä (ŸÎ:Ø\ÌÉ€ø¥Ñ‚»¾CóÇ7OOaÙm?µì÷ÕÈÄõþBŒC9Ò$è»õ}j­ç>œA3ÕèLWšGrh`Ÿ! âOSuÀ:SY¾pí†\é= ŒÝâ*AÃÔq±E¨ ôÀ ·Ú+f‰ŒfØ8øpƒG‹½ø%X¿`²Ì¨$±m²x4ÙDa Âl‡ &k3(°ìJJE«ìºþͨX—#­ & ¹ìÊX¡1àn*”$ ¦pé¶3¾žØÞî uaÀÓªëžØ¤0|AR~ †—H¬Ü%Fè÷¥øi)Mq….¶Žýa!¨€jݯÁ·øVé+õƱWðgp7¬ ˆl¾Ù_:~çEʱ2êÌêD²íé¾QX£­ƒ¤á~O,?iÿ4Ã˪hDµ¶ƒ/Gµ‘KaÄ į ©a²Ž¥4B–‹§Ð\ "6NQ­’‘Ed̲“zhјb¥)Ïós6ÔÖã 'q†D»·‹ŒÒñHÁ×Ü7V±ÿoÎ;VüY.Å@jš…;nâ3ÔÈÆÎÅáß·|ŽâÇ68¢Å8ïE¶$ )kœVÄ,¿k¦båV°´•·lUû%-¥,†oÓóºæðØ6$ñR€éœ%[© Søú€£GúÞ¯gÿ&i»/¾x!ñzM\bì0¦·ú˜ø ÞG\¬¼„t¥¦ð+CCl™g¤";K4½”ß‹g‰m@¡# ݵ¡6<'+Q¹ czWò8RÔ$rƱ!Ë93w¯½äLN±ÅZ™kVýegý½¤l(Êó€8ES¢æø‰^Gå±íeEÜ •ìÉ<ª­‰‚ÁË°»4Ò/e!å÷°÷š«ÿªBç@Ž5Wÿʘ?ùö»ß”\®LEnq·¾†ÀI~¨“é³E§B;=›tˆXÐ5T9°‰ø"7î=¦$ÃGúé,×Òå±²ztŒ×þüÌ\AšHÅÑèœ6Ñò¼FÛš²½ù üõâË·õS`Ç©Jâef—Us~ŽJJR\ê=rök;pŽâ X¤(¹•†5Nj"ß2¸ú&ÐÓÜñ§+»·”i•@6ÎÑ™RYX;ÀO~Rc|ïðÞ}„? ¹!¦GP.Ó½àh o [‰Uc3ít\QüöÉ'LˆE'×ìlžYÌ~lëº%.>®5Uý³OY€êÙŸk¿Û+½uÛƒˆyÜ竸¦•ÍGóݯȎ•ÓÏÒå[­µÌ6¶‡ÒíÓÐdEzl”µX8 ß ¹™Ý¢"Jm¢WäbZW9»8/9Í%º&ô»Îïÿl˜)sýÅoblŽ<mʪðv‚¯ÅÊL +¡%× Ý®1 !•XÎü° þ\t®xw—2§hŠú©3~x6xÖb~˜ûص§—³cÂæõ¹¤~$ûÆ/ü‚“fÄ7>æù3¥fcz3¤–ÀñO—Æ—Ì5¦iÜK?Ïn}%/ ½ù»¯šãůúÿ6‹”Í2 ]*Î kQWNŇÛ-8Êæß\üôÆÜ¿±¿ðÇö/Òèͽ·÷>º÷ñ½w÷>¹÷é½Ïî}~ï–ÑŸqa¸øóç\ÂÔ7äù7ÜÖ-’¥aTÆÒš—Ÿ´¿/çå£wÀ×1v©Š7[‘„Œ ×1vkîì+mí]üÊÇÛø.{åÝ6»3É+Ÿ¬ñz8ˆ»¦¤@ýÁ«ê–åó-wð¤{ûçÝçÑ«7vÝ% /÷Ÿ?¡Äñß'Bù [€>;8r›«,îfb=›ûõÃ'ÿâv¼© endstream endobj 718 0 obj << /Type /Page /Contents 719 0 R /Resources 717 0 R /MediaBox [0 0 612 792] /Parent 710 0 R >> endobj 720 0 obj << /D [718 0 R /XYZ 132.768 705.06 null] >> endobj 721 0 obj << /D [718 0 R /XYZ 133.768 588.594 null] >> endobj 722 0 obj << /D [718 0 R /XYZ 133.768 297.711 null] >> endobj 723 0 obj << /D [718 0 R /XYZ 133.768 164.907 null] >> endobj 724 0 obj << /D [718 0 R /XYZ 133.768 167.073 null] >> endobj 717 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F56 15 0 R /F64 23 0 R /F81 71 0 R /F59 24 0 R >> /ProcSet [ /PDF /Text ] >> endobj 727 0 obj << /Length 2721 /Filter /FlateDecode >> stream xÚÍÛŽÛÆõ}¿‚²;ž+‡Ó \×؈‹èCœJâZtER%)¯7_ßsæ /ÒŽ²v}Ò™ Ïý:âÉÇ„'?Üðg~ÿº¾yñ&Ó‰c.“Y²¾O¤´Œ d&g¹tÉz—ü’¾¯Žo«ÍêNHÎÓMÑ}®šö_aYõ‡Õ¯ë_¼Ñù†)aˆG°= t霖fBW®àÉ™ÈÅxç㦋 Q’Ù<ï¼ÿïܼ^ßüû¿ä‰H„•LÊ0®u²­o~ù•';8û1áL¹° ôî„`Îd¡š % XÍ_`ä Œö£ õ„Qê‘EÇÄ‚EgÑò8B3³(G„ã „Ù¡~žÃlFÈg„ùBd;#ô ¥ˆ#´B®f%J»`Q/0.XÄû1Œy£Xðè÷cEÜÐ0Úœ§?ýôðe ý:l’-4è<«BëTÊ(sŸwÈœ˜Ä™ãW˜SÏŠ»iO‡r¨0p5GÍ¡C+IòP5eÔÎíl¢Xw…¶q‹¨²Ìš)-~à"‹„Τrs> ¨& JªCoÌ ˆºlá,>(E\ ¦û«ùÁðœY'ÿ˜ü`8(LêÀm3D„@ÕêQ¢‘!³Éñ¼?Õè!ÂR.ÍlžÖÅ—ÉU0C6”}¨e¨´ÀÐ ¤?·Ã§m[åJ˜°(ne ±"="bÅÜâ©î&Z0Ã].I<X¯À¯‹Í=ÅpàKü ]‰§¯€pÑU}ÛÐI{O¿¯¿ 3%×jÓ¼hŸÄÂ3¥ã¤há$p^u;"á…G…hŠ]ž‰ûèøKž‰‡Á3ý×]IÀ¦íºôP|WÌòCZvŠø*wÁðrÁZÚ…à/ÊŒ¡sð—HɲLÛeͲÏÕ, ÀÛ?Öu9x{ò]9PüÑ!è&âˆ<ƒ ùyýŸ+¨ÜÕ°oO[’v3éÛY`J-¤8Shwj(”ÉÓÁge- ÷|Ûˆ€×'j°’)•¾<èzM> ~1¿Aʧ"9 kÓà8/”$/ÝÜ‚4Ï8¹ƒ>GÏ&ÛN» ^AºQ` uYM!+£ª)”»Þ[SáCwUÿéÔ€®—MÛÕÅ`¨45j þÌp‘¯f=%uëûrW¼1…ÿpÌxþ[f‘Ft[ Ãܤ›’~ûö@Ð’Ü—3¿=v’•yhÁ±(XãóADñƲ\LÞð§ÚW0?Šiö½L_Ht_ôD”ª1n¡¸_f^ ´§u5åH(’R+0‰¥òNéÅ…°¾Ë®<¶Ý@„H­°9µ¸ð†]èkhÃÆE[…ì¾~…Éæ6PÝW‡’pRÍ´@®‹•È@‹4fqŒgÈ›$î@X@±g¾þÂF]†âá3²áнM•R^3˜s ¦‘¯‰;ͬ6×L†4w­o:€VÓ!¿ÀWÐižKØŸŽAëB/ÄÅÕ„Aý4ms7„òYyW‡MKŠC5<âR¥ý±Ø–t‚bãiHùAGôºSëvA:bD_Lú³¡ÓXÖh!¨Fû]_Žc –f3ùL2‚¹È] D?w³ËiWWM1øúë{·{Ø¥¥àœ·NC9F4Íî\JÝÊP˜;Å€€'§wïWX^Ò´¼owCÕžJí¡=–» cDb‰Ùî[E¶ûýk*è93Ýâ0’öÅ0‰ÒòC¹Ë¸¾šç3û!Œ¦RUƒh}Žq)d›’öCSW•á# ¾ðe/oÂUêø|‚À¸èi0’£÷ÃÍX¯ YœIù_4»È4Ù$L¬Žéì"×Dû]Áæ'ð«Ý®Zt»™ÊÓ¿£Ûe|ê•ŽË¡½U¹…9‚vàcDtÙû*l¶!`Æq#ÛrܪË-hµêkZ{Â÷ÔÀ7¿³)Ë&È bè‹æcÊâÞË!–«ˆBžýžÆ¡ð8žRWÁ‚°œÇgºp§)aˆCµ¥7 ŸÎ^­/üïmúžS?·W>÷ã&øc_í°¢àê´àÛ²ã±lúq»lºš]KkÒÈ°Û ]PÌå´cvn¿Úå|k8å[O»¼ Ö°Pè¸8/ÁÈXÌO_z•Û±òtl¡zyûÀ„Ò„Mz±š2Ù‹7–¯–ñ‰«ÍtfT«ò9™Ü ¦]x!¬¢¯ZÙdq ›H°(H¢“¢ŽD†™YK>w=Õ7Ü™óÛw¡a9Wõ4\í£LdóÿcEìž³ úç ÍÄüü%†ŠÞ>piâoVM s2:ïÐA:ú`Ѿxü=Kæ0µ¨IµŸâ/´Ù¤ZìQÏéÜŽyO€z.š,Œ˜¢ÃxÅYª§Ç‚–ÛöpªÚúŒ1_t>¥úç íÙŽùøw6 ½Ø]:žöÃÐìS"6…ž³¥ã²ap‘ãP$§y…¦fõ¡ºé.¤\zÅ…9‹ÚÔ‰BãaÍ“úMV(æÎOÉéu¥EüÿG]v~'f¾ÃyÌ ÁÕïÉ•1.ó3¹>]‘+ûße“…\ß]J?õÔe¬k¹¬ïZšñÁÙù®ˆâœÃ7öä$ ]é¡Ö…Ãb»m»ÕI8ñ¯¯K‡êÊCqþ0ƒÇð ‹9 â£äw™÷Ÿ=»ôz}ó_NŸ endstream endobj 726 0 obj << /Type /Page /Contents 727 0 R /Resources 725 0 R /MediaBox [0 0 612 792] /Parent 710 0 R >> endobj 728 0 obj << /D [726 0 R /XYZ 132.768 705.06 null] >> endobj 729 0 obj << /D [726 0 R /XYZ 262.326 478.879 null] >> endobj 730 0 obj << /D [726 0 R /XYZ 133.768 252.752 null] >> endobj 725 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F64 23 0 R /F48 10 0 R /F110 150 0 R /F59 24 0 R /F56 15 0 R /F81 71 0 R /F68 28 0 R >> /ProcSet [ /PDF /Text ] >> endobj 733 0 obj << /Length 3594 /Filter /FlateDecode >> stream xÚí[Ks䶾ûW(7ª¼ã ÐŽã*;±k]IʵVUªâä@(‰ÞŽ<äìZÿ>Ýx…áÌz×ÖrAn´èÅݽøî®__}òÙ·Ò^”¤Ô\_\Ý^0!ˆÑöB+C¸PW7?»ÛËÿ^}ÿÙ·–M{2b„…a\—롇&%>‡šPn.VŒÈRú^?û^É9‘Â\L:ý‡*êû)=é'ˆ`Ãç2)¢D;À ìr%¤*ªöÆ7vm ËqúûÚ7öõ¶jÚ¦½Ë.SS[X§$%ÜO×Ùü¡ë$—+Uªâê>®/ŒZNGUD+1¾ÅLfd [>ŒÜ´A:Ûº¿ßV—œoðÏ®¹éüçúû¦ó¿v›¦÷ÍëÇ(Ú~èbÅ)'–ƒ”)UЫ‡MµF©¯¸EµÙdÄ/A¸Bü±Ò7ï¨e8{\¯[…¿t°¬MíÛ G®Š·›Ð£iûýîæ°®oüýCµ¯@ÄõÞßö÷Uï[ûúa_wuÛwñ—0àtu{Øz¹jF85©\‚[†otuF¨B¡ÍG®Ò†Šâe‹ áÁRaE»vãõÚƒ^ú•úFTAh:­„—»fÛlª=Ê'*\‡÷¯gãÄ] Ú«8Ñr¦½}³Ãéá@·þZùKØp3n¯RZ*<{Ù¿õÍú“»”´x…91ˆ»u+ÃëD•ðÞë¶&ºã¤]Ò‰´)X#)e9`t‹„Ç’0-óUúx¦QvÄC‰6æ,‡ ÎqêC;×GÏû°±¥™ÅY[~ÂXx²¬cÆ¢Çe%[ì) ¥úývœÈ¸PÜe† l¶ëøiÆÕb(¡ÐH¾Ì,¢$Œ°¾­~…‘ê%ÒÈ3IÆÿuêC/‹1zl”/2£€©aáÔ㸃Od•´´)~" re‹»º­÷ÕàkVlê>#.`£– Cï³ZGù (_f†( "òÙìÑçÑßEÉT¡OÉcŸO3 d‰{Ÿ†YJ•Û«d1_d†Höj™„$’šS>M˜–z]ûͬüe¿ Þ‹«Ò¹G|è 6ªëM]üMwXßû~úL{vÍ]Ð’| bÀb(†]usj:¯ÞB0S ê­#¾A d­êq5¢ô¡6šŰfhÕ—L¿VëÞExàâ׸}ÃzSo/ô??]‹VÎt$Y”8ˆ® ƒUþÂÐ%+ÞÞ7›8yà箑DK@%$%FêԶǂd‹j¬Š•E»kW»®éT7¸â9“½8îšîEn«!°Z/A€%Lð%`–,> ÐÎ=¦0ƒ+ªäÌ>¡ˆÔe.ºžù"{’Pô¬?Ñ(9¬ê6¯.å0ã·MŸs×ÀL9e¶G|„/3N÷hœmBo )K ²°2°Í2² Á‹•%%ç ˆ1*'½@iÇÍz‘—ó¨?çBTpm\15*1¶cþ< ¨f4zP­³C!0g†Ò):K yÉÆs•ÙÖTÞÔY£*þuiiQtc É™ï"ŒHµzõ³àͳ䴭$zt×}ÖˆLius£®wmtý)†:©+¥zö™œ„1£ºŒVBÊ£fNï™ü ŠüGFi`¸²<µF›¬1GÈÌ›Žßs '7Õ:è·%±vø>pï°ÞmÛÖ·ß :TûÝ}ŽcŒp&Ä-p{ÔOI0ó™)2 ÏÜ®Zé(…w3ÂI¯xB¾é[Ž3â—œåšO(¹ö¹1¼‚*0 áOõž!IkÆÞ]‚ùN¹šïp]¯«CnªyôßX|Í£ÁæP3Ìd&Ð Z> Àz±Œ„^š”ЯwÛ‡ºí€Í#*QÍâ Ú4KhŒ6¬SÃ=ª2‚òYä+Œôs›mXõ²z°2ÙgÃ…Îròå¨[O±b”hÙÌï°9éî&ù'êÓ”0°¾døÀƒVB)Pn—g…§»v÷²*³¯ø»?ÁÖ¾j»ÛÝ~[…l1<»ÙÕá×v^¨7MŒq¤Á¦ð· Î&|»ÿŠcMe°ýr6épâ5䃡Մkø¶¤áÛà&TŸß†›îá°ov‡ðÊðiD&Ëw“ÝkÃÛSÇïçPÊsìb43)É3䉯ÌåcGyDk€òýG„ rvF,¨(~lÚuö[.ó…zªìyež¬ýYC!IŒ*—CŒ±ïŸ. {Fºâ¦Qt·Y .KþN by,ųçúÔ÷Øß“S³âBx³‚߇ºÇ²u(˜š;+R4Kém•}s¦Þ-ƒhº—iÉÏ|/OêÍóòjÕ;’vgÿÿÜõa £»ø+5ÑÜ~nà=yæí=ã“•Ì üºVœ¥O@'°èÅ™- Hæå >ÿõ;±;~ð ÄW2"ؾ«7—09”3Å]ª¡ªWÁTz–Tã5gVh<ʃ1Í7“øl@Sã³ÉÛC|Æý!#?•I€w¦ñ/Äg†¿Éõ-³…%]£_8ôb\æŒ[ŸAƒ'uÕ=Ƽ8%Æ–3Qa'œg¢Ê³ˆò a8•S¢|®;9+É9ûž®žÊ|OëZòÇ:r4ŸSR´¸Þ¹óEC­Àšîô úâd…¢Y™Þ”ã¹NÊ%Ê.&’ ‘R/…‘Œ+ÄÄ#óqÄ* ª‡G^Ð.LÁƵK,‰â¡Þc"ÌåÐàqÕ¥’ÌÝŸŠôÕWù i<·ÄI›h«ánò w õÞ8·.LÊC ¢ #j/í²D<ñg–Qs¥‹îq»­û=fÊ•)°6dûÂß7½¿n«GßýºŽ×Þ×CÛa)tÌE­ÓÜ„N•¿Ü4{Ô·cèåŠA¤Ðž»ì››Ö „ê,Âù,¯êÏXqˆÎ%±Ìà «B¼'p`n>U''E§ñs2Ø3¼ÒÕ}Ľ뾩ú88+ܼð÷Þ_7€¬½ÿ© ƒUþòË~Ymš1ü}’B<ô²•K7n«ž ZÆ$`„æ¡¢D©8x˜$øÒjSwëá?’íÅòYN¸oýX×9 Æàr0œ¯Î°aWr£hÜ :ÛiW7,`­ÿØE(õ©šMçoÞ6®4q4Bæ«lÆ&È8Ög$°âŒXeƒl”ƒ r¸º4²À6Vì0G.\:þf³ëûKf‹qý~¢l¹$\•Ã˜„…Q_¶½{³ÎNSàõá_RfrĵD›0Ì_kÇ#š¨Ï4ŒMÂ\a·;Ôª÷©K©üåUP»ˆx“/ÏŽúù´žèïuïSЯr¨.‰O­x¨XÑ &ˆñ,óßù:Vè0ñ®mæ;èuêƒÿ”óEœè“ÇÙÌËû'ÃŒ3r?‰p©‘†c1«ët3àá؉OqúÓÌ(‚0=Hæ&ëì8àøJ»·±–P+ŸÆWÅþlØ´ðƒOôëâuNF–Œ©‰s·"¡C~+VÇÒ o‹¸X.'D ³Az ~_³Xäѽ‰äæ°½eŒ/ ÔÆžƒ2¿Æ…›A§g²Aõö—¦‹@á &¢Aå+ E©sKJtàÕQ­Ï‚$^5TI&Ûººð¡Û×™¢-ÆÜa; £ŠHc#xcYMØý¿Äg€±–ežñIâÔ¿[ ùnï~ž#D¡å âX ƒÿdq%ŸáÄ@wå‰ã…I˜šUmˆ–Êä*'[1+ tâ/˜ÎfsØXÄójeL²Ÿ‰þ`ê)E}¢úzi]@*Ji’T×L’iÙŸ"¢|—ü?Yõüy–¦Ã|À±L†ô>ãG´ò ïè±±Kþˆþè\ú>žŠƒ¬5/SOÅxÞS bè xDS|_O¥‰QâO%̇ôT|ÙSéSžÊ.y*E fJÐSÙ‰§bþÀ™‰_ÄL$<±ÙAÌ€ì¡Ð{$Ü^O¢KX{ýÀ1#¶gRj0°ljÓù> endobj 734 0 obj << /D [732 0 R /XYZ 132.768 705.06 null] >> endobj 735 0 obj << /D [732 0 R /XYZ 133.768 352.66 null] >> endobj 736 0 obj << /D [732 0 R /XYZ 133.768 297.374 null] >> endobj 737 0 obj << /D [732 0 R /XYZ 133.768 270.647 null] >> endobj 738 0 obj << /D [732 0 R /XYZ 133.768 250.065 null] >> endobj 739 0 obj << /D [732 0 R /XYZ 367.402 238.271 null] >> endobj 740 0 obj << /D [732 0 R /XYZ 133.768 176.607 null] >> endobj 731 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F81 71 0 R /F56 15 0 R /F59 24 0 R /F90 654 0 R /F68 28 0 R /F110 150 0 R /F104 657 0 R /F96 655 0 R >> /ProcSet [ /PDF /Text ] >> endobj 743 0 obj << /Length 3187 /Filter /FlateDecode >> stream xÚÕ]ã¶ñ=¿Ây³Ñ˜á7¥ ÒâR$EZ  ÒR4i­ÝUΖ¶–»ý÷áP©¥íÝ»¦@ŸDQÔpf8ßC¾¸[ðÅŸ>ááùÕÍ'Ÿ£‹EÉJ+íâæv!”bÎ k“Ê,n¶‹Ÿ–¯wÇúÐVÇf%Íòו0Ëz÷¸²fùÙj- _ïë08TmßÄëh~³ëúÓ!¼ì«G¼ ÛúgÎe[oéµi·§Íl/ÿ¡êWÿ¼ùóçß"AX2Á‹ÅZ Vâáh¡)–•N¸Ð2^¸…fBª~G‹×8Ç‹u´ì«Ü¦‚In€…ñn6æcÁÀ ~¢%O88<³“bZ¸Å:Zxu·Ÿ¹°HŽ ;GùY JÐÖ¬Tz!™“#Ú"ðQÄë ã®Hð~EËRi†^N˜.™„‡‡¹X+^2ëÊp¸ŽVý­i7 9Ê$xÊ”YÁãàáKwKÏŠÝîñ¾ÞªÁ8Ô;ñ®¥¯^JqÐvôÜuí]} ¥oê ¤5á,€EZÃS°ÒXB9l¢d¼‰žàp6fža…ÏóÆÁEtàF|†˜È廚oª6Ì4-mL¬‚Owu[èlª¾ »õÌÿÜíNÇšVTÕêááнoö#ö’ø Ÿ´'Ýr8nHÇž==ž [Á_vùã}}¨ýNx"â¬½Æ 3ašˆ ].Oí¨Žiè‘n§€ea°kÞ®_Ö9$¨…~ꀅg,KV8›r¨C®kfs×Ë›ûê8Ý Ò`–—w?[úVÑc°ŒÕ*8Ó¦œÙ€„ ²aAØ e !¿kv;œ•( ×÷’Y°1ìMfß’q1.èO›{zDÊŸ®`€g’vÞ¦)f…MlZb=ÁæÑD‹~æRf¶-Á‚ÊKTXæ„àáI¾üîÊÁéàuMM,…Éw(pU{¤·ã}ÓÓh¦lþcGOrš!Á= І©‡®ï›7»:ý18iøss<þK®®k¬Tz´¥×ÂÁiˆk¾¥ÈœƒNÏAZ‘DÕnio’Á„a0ëIƒç¶>Ö›aî>,EÓÖ‡¿ÑºÌ>ÏY ßš°¼F¢ß›>#&à„g:Û°š…à‡€?eŠV`ÌL\€)±<éÉd|™8®¯»ì+l%—³•]¦`V&žê¤½7'ÑF{=oÚ;zEWàŸ3Öir­ø$öj—"9äð×S¢¥æLº—Y)€õ.À¼ív»w}—`T,ûj?Xa+˜éF^Q/{Àþè¥àî‘f²®É¬,‹¹éÕÚXIb­À´bÜ{è´Gävup»ú©ÛÕy® Èð9×`INXB õ6«ƒ\K–°ê¤!³F9£t¿ÍƤ¥PíÒäâ?άݪHßÒŽ®â@ÎÌüÈ€1¿Úƒv§ã,y¨pâ¸ä°‡0SMAÅF£îݺý ü¡îO» þ•ÜŸW­1¿š ÌZ@< \Kr•¯ßWû‡]€*™aj"ÁÜB`­FÄ_£ÅrÆû` ;4¿6(Ä8W¯ÀûØ`4QM ÈÄ ¬h¶Çâ¢þ<¬”[Ž¡)~ú!c°0€(œš™,›:r3hNP ÓrÔÝ÷Yol§->Íf|LI9‘à Y‡õ2g1ù’“Ø=E‚e÷.›—I[Ä®¾À8-póíj-ÀÞÂ똚}Ý;(º·ƒh‘ûÇ ù·]XSÞ4ÇZ¤ê²aØDZ‡N wì‹ÉÒfÓàŒˆ²¼·Y¢_ˆ]õNo³'9IªûYSdEB@6ÙѼLLž É wY"¬u3‰H  ·Ï¥å—œ·Çò™ÿŸ1† ?Ÿ+”iÖHå«\ä,g¥œ™ ›©~ãEÌ{î_“Ú·¡>Ó¦Ì3$5%èôZ€qÓòå†ä¤ž`òfFpõ‘fæªH)7®xÌBå$^ºË¬¯a–Ï•w”6‘M1øÇ`Îص`ºÔ›j¦•™‰Ø<ƒ1jz•å­™~Ìž¡(ÅåÀÖrù›ê«eóÌt%Ùa-da½ 6ÿG²vÙüœû_<µ?(3·jÌ5&¯073`Oç”dÁ¸ž® ¦‚Ú@Ü$ÁërΗŒ²t-=_cRÑôJ@âçÖ<Ž¨£$½2™Ú>"Í嘯Ty>’S ‹Õh|åhsCÞN¹ì»}˜êê ErfÊd±`0ü%‡Ht¨0E¥‚|Z%%Ó\-B ë‘Ы«Þ·06åò»v ‘Š;¬)_`Lšb÷!¨¥ê„¤ç2mÎB]ÊAPäHù¶«ä¶ €‘ƒTEÙwÍñž¦›c_ïnCàL.¥Äå^€.®Wç•ÎTçcíTSÇá\ä=†_d3'F#áK v ‰M&ºå +öMS¹S(e{”‘ª6ŸFªBý¶t'I¸ÕÕòÛ!±”dݓȈSy<ìWêN¶A—¸N’íac*Æã¨íÚu½8>NAÆ"óøsæ’'—ýå™àSE‰øTÙ¢˜ï˜Æ~õ¿Od8á2æ.×pÀW¸ÑÒ“¦±Á_ŠY¾ô-Ú6©†: *¥, -˜õhásÕ>e(Jå³Þãá´ Ë«0K¥S±ÜÒ;ðvO£3Bf!>úÔ +•KN½ê#¼tÒ˜Â餶°Àb–gnŸW÷­îB¡GG4îgyŸð¼â¨ÉÓxÆÄL¦jm÷V§ªÃ±ÙœvÕa¥})RiAüƒ0š,ŠÔ±ÍVÞ6c%X[ëR‰Út»]½9Ó}Ԩѵ}Æ IËÇÇûA%éì¹½ŸzµÃ·Cwº v«TøXíFK–1Ol[\®>›),úo*  N¸cïéjÚc}è}1?= o^ÏÊYél–½«ö®>WÆŒŽ…â Š¬ýšÐ´<Ç! 9µ{v Èç|è“û0%µH2ëf5Ò¿dcÎÒ^._(3—¨ ÷qÎEÇN‚6‚žËéö‹ç9d‹¢X¬£Où(]N_ŽÒ‹)6þ4×€Áʃø€=w )Ù[AÚKdLÙٮקÓ[A*º$5ˆ¤JÏÑ W¶YP”³¥ßgŽ<áÔ—™f_RíÏ7Ô™r÷ì2 ““Î׋œ.gÇ–‚HŽíñˆ—V'“˜V3íoL5Á&³Ÿñ©L´èXÈäùJvß#HAÒ„Nͨ0ùÔ|Ú ;nâƒ0ó®â™=3þ¼t‹„K‘3Ù‰Y|Z¢nx9ƒ–½•Ff)Õ€¨š3i·ÅîUöVh°¼\CŽøœBªKåJ¬yÚY¹rvü(€(ƒ[û{öô½÷û¡‹2ab*I%Öxñ^èÄÅ&0p‰ðþëÜ ÒGæÑfظp>Q„çöSý ¿¿Ö-ãÏì–¥n(2õ2:ãeg0>ÚEî&!^9Æ¥ÈÆØYµ4çÕRƒã"µîe wk†l†Õù 7üÀhªfúé0Ȧxy:*É¿$ϻ笓H¯BžÍ3ì‹<^.ÿÚë9µ#íiÿÆ—`LA%–JÄö³RÉÈ>CìËPÀã¢ãÇžb"•`poª>kK7úôp±ª|. Ÿ|a(þ4iÂ+ÓGð5[‘(×V½Œ÷Åòõ®ïh¿6œ‚¯gŽ—UÑ8íüÍ¢—Ðé–¯o>ù ¤·‘ endstream endobj 742 0 obj << /Type /Page /Contents 743 0 R /Resources 741 0 R /MediaBox [0 0 612 792] /Parent 710 0 R >> endobj 744 0 obj << /D [742 0 R /XYZ 132.768 705.06 null] >> endobj 745 0 obj << /D [742 0 R /XYZ 396.453 669.191 null] >> endobj 746 0 obj << /D [742 0 R /XYZ 133.768 503.736 null] >> endobj 747 0 obj << /D [742 0 R /XYZ 133.768 375.811 null] >> endobj 748 0 obj << /D [742 0 R /XYZ 343.283 238.818 null] >> endobj 749 0 obj << /D [742 0 R /XYZ 153.973 195.083 null] >> endobj 741 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F81 71 0 R /F59 24 0 R /F104 657 0 R /F68 28 0 R /F90 654 0 R /F110 150 0 R /F56 15 0 R /F96 655 0 R /F149 668 0 R >> /ProcSet [ /PDF /Text ] >> endobj 752 0 obj << /Length 3434 /Filter /FlateDecode >> stream xÚÕ[[oëÆ~ϯPÞdäˆÙû%A4@S¤(Š<HÑ“ %Úâ9’¨T}Ü_ß™½P\je[¶O‘>‘Z—³3³3ß̬ÈìnFfþ‚„ë×_|ý£03[XÅÔìúvF9/´23%uÁ¸œ]¯fïç]½[VW &ؼ\­ê¾nvø‹ÏëÎ.›íöЗ}}ÅäüßWTΫwøDÌëÞS®š*Ðîš0´-û¾jý`½ó×ûu½\ûÇM»ŠOï+?÷ý:Œ4Wÿ¼þË×?J;Z'²°ÆÂó¿Ê=U²P Ñ:ÒtU¸+w+$ž-8¥@«f ¼Ê(ˆ¨$ñ ÁµlãÍfÓàÚï«•èå]Ûöah]mu—N³ªÃ[N pý•HV¦ÆÊ1Àµâ‘ëï¿Ï¬ËŽ)`ZøõPC@*,]ÏO·û9‰ªtyœ”POdèL¹A"U‚â*„ž°Î°Ç ÁõlDÔM$ ¶v·©ú&HÂiæ”#­ ˜ö… %3É‚1fè;O¤R¡R2õÖP1žF–MNe’á4ÇPò-Q›Hè.k½Z뿯ûuŽ'F`mòM˜:‘óDvlž¤4l©d5BŒžñBQå‰V™¥‰‚jûïHõn°ÍÇ·Ó…ò²Ýn»ßÔ`G¬ê†ýù?¾½`”–°`¼àÌÏòsƨLaä°_Δ˜T²´§AÁŸ23èB‹Áà¾Ì9 VpM#ÅÃSS|€uk3·™eâ˜ù˜Q¬(ãogDfbD&F4þÖ¯„ÉA× S|°’1›ˆùù&#FYH®'RL]ÑXŠßefHtý);µ£_™D&à°A 42ú÷ìFVŒ¢‰‚g´‰eÚ‚ÁšiÁ¬|>§NX3K4ñ*ǧäx²e%¡ùïCÏ "“ïì |‹R’W‘àYï5šdD¨ %†-Ÿ‹¬ÕŽ§$¬ÎzÐÃ@ ¸^"æÁý"$‚p¸ó7å~ß6Ÿj€rrb î}Þ©Ãç&¨õ ]¶›¸óתëª]_‚yðßxëÊm䲋l—½¿kr>— ðîlØìßgƒb¨]-„Q¤‚u°ˆ²TD[n~®ü Ì\ýŒ0KD˜Å ‡‘oñˆ„‘×ÖÔgľt¾ ï7YDX }1äxÆx\‚˜ïË4Ü·õòˆA` «¬<!ž£S`!~Œ`p[uMÛ§ÀýöÐÂ|m@§c3ï<¢¦` Š“‰®¯ ™ã ³ìœù‘ùMÓ¯ýX°M2¯0Gú´oº˜LÁðÏHÈn`QIµóvß…Ur’!xx_#hGú[§ªñômµ-ëÏŸl´v`5Ãr¿vIœBÕ/3ðãþŠÂJÚáWíVwžñ¾‚ÉW~$—‚Q~„^œe&Ò…TòtKLn‰`$£#³ÄûI<˜8qËR1Á‰ƒ0Ù¹Hƒ3–E5-¼Ëa $ÇYÄ}“ü»zX0}‘/˜\<ø'.ìüÚy>TWÝánQìs¹>¯AϪ 5¿1¿ù `jÞ´8EûÇ«‰ïµ¥^6M»ªwe_ùßÁ‰¡ 0â¾ìÞüíPnUã¯Í®Hª@•§Ú—ýº‹sﺾ=,}¸‚g7aÊÃv ŽÑ±M&5€Ê36Ù œ‘¤Â/¯FàÖå#¡ â¿à·8<ÚT»;'9¬vË&ðÀ|°c,Ròù*gìTŠ‚ó ¶šª­\'Ç@Ø©[?„v½sâ‡q¯´EP;§WUQ¡Z'ø§ô³¨š rR¼°|°ùŸÏ&èôy¼Š Ög–jYåM¬ÉTdš®J312xûɤI–GõSlš ›O{ªIh´Ô8OÅ’ Œ=¯&.·É3®>pLÕßi¼Ë&ÎÜ–²”Û¸øóŠ¥"‘ÐÄS+#g‹Õw™\Á£eU>d'„dý¥Ž ¡$™U€kVúi+d” xNM>uR0 *\ ìH!@OK>ç‹WyhH‹S\™3Jž*â\…ã †Õ¥ §8h¨¶Éß]$ýD ¿Í:¡YZDQ™"Š‹ufZ£OÖ+-¨‘¦óu‘å‰GžCiùx½rpÝ úK_8ÎzPÖÿ¿¸¬.>‰äGc}m±[>¿ØMóVmï¿oó%]*éi,œâk'ËšøœQ#ècÖ0ÉŸ•Õ¿Ää3Xydòg*‘¼€üobõ˜h´œ´ŽÀ0r= «ìEƘ٭˜{~»žÛeìéoQÎ’o}•3׉xÜ:°xý&#jH($(.€±< œ¿5½+}±P`–Žò›4a¤…dêy™˜zuIHlÙ¸f´lv}Yï:Ïh(5 §®ôky;ŽùUàXÙ…ùzìåù/XK É7$u•' eM|Ðø‘¾üˆ»#¹Er>9ÃpØ…"ŸÊz*”•œ×+¬¦÷~¸­6e$÷I2ÜùÔ $œ(9ŸÌŸ—¶«·É‡ù±TŒ«jüu8áÙõÙ1ŒGõ8ø™œ¯ÂKX!÷å ˆã\›´|ô Ø ¬\Q ûÜýÈÕ€$$sÔ\^ÂùnÛffÆôp¸+ÍãÀ-"Ó}†dEðgMõ›Š¾ðéJ:È«+é8n½ˆñËnuˆ;Ã/oóàß9!ŽG#ìB[ŠÂ¨I‹Å•ÅÂwƒºð%3¬ˆ)æ‹zð°Œùú˜b¡Êìs1\ gü)ÄŸ¶_ŒøÕcˆ_„¥ÍÖ,à· ûàoÃïãˆÃLlô^-R9˜=óQBøFJùqª,½ê-TŽÃÓ°U!¶ž:¼‘K³tìÒ,™o«rô1¨Œï*Ow´A7~q(úu˜óÜéX__~<%F97wØ9ã\úfM¦ܤ"¸)»z‰µ{\Iá»î³>Äà­q¶ÚXGî¶YöÅÑôVu÷á°[ºv"ó`œÜ‹Ô 콋 RtÝ?HzMkSp2I#€<Úf]ßÔã™®A.b_f_%b“ÄèùO½ÝO“JÏy¶‡eíjüÂc¤A<„çM¹©º¥ß¶‚Ý ¡ˆº¸íç3oÝ™Q·Žr„߈Õå4B?ß°ý«kZi5? ™j Q?­ünó]Tøµ?rÐèÃi?èº p… vrB߉½ó-FÐê%=Ž×6ÐlzO¦0ä$Ðb*6r´ °ÜñÛj`î® =}¤q<Íî6‘¦ 38w¥ÎŸ[Qà ÙÅ'q!ZÙ˜Ç CtÚØ…ÇwQÖ¤0T¦²þpèB“Õ™Áfß×Ûú?¥7sØ&tÓ”óËjuð²àóì̶¾‰}û›jŠYhø6á)¼»:,ÃDÞ †¶n?´’ƒ”æ1™FiÌjŒôRÅëry¯ëR*æ?âq`žù3˜K Ô€Â1ØpÃ×\l³uwÅÈÈ ÜíÁ9÷»ÎÙ &˜BÚÏv°àä°®cd`I`[vV³ñ~" (dÁ­q’m,Uï½O=ë˜ÿv(á·;Áê–§‡ùÚº¼Ù„Fë(§”,œÁ»¶êíο囜셟ñDsP£PÌÝWnãàÁøa$AAóø J Âjãp¾™a Þš0eeÊFN"f“¡ç‹70¤ú6L1äĈÖ'Ç&ýT!ìÿ&ãÂ.vâ¿ã¿ n›˜æ:2üÉc¶8ºm˜………ùÿ‰Þ/$!°‰v‹ã¹*?ïX¹®7®}b¤Ìä §¥Lš-ÃMª”Ï=0+Õ™2Õ2Ÿ»Lš4ù>Û¤cq¬½ž?àK²9Ž-Ô¸ ‹;#EqÊ :´ÉCë€e5µ¿îw%™_ª1@KvÒŸø!#%üIb0{Tc")žN ¾äøœWjL<Öžœè~±Æ)¨©ÆÌ£i‘àßy~o9÷uwži ˽ʶõ§X²x†9]¥‡)ž·åøª—l¹IÍß?aMO0“ìÿÏmM)/Ÿiÿ¶UКlÆš¨"ãÖ¿fÁ˜¨ ÕŸ®¿ø/fŠfq endstream endobj 751 0 obj << /Type /Page /Contents 752 0 R /Resources 750 0 R /MediaBox [0 0 612 792] /Parent 762 0 R >> endobj 753 0 obj << /D [751 0 R /XYZ 132.768 705.06 null] >> endobj 754 0 obj << /D [751 0 R /XYZ 455.818 645.28 null] >> endobj 755 0 obj << /D [751 0 R /XYZ 430.649 508.138 null] >> endobj 756 0 obj << /D [751 0 R /XYZ 133.768 235.921 null] >> endobj 757 0 obj << /D [751 0 R /XYZ 267.686 235.161 null] >> endobj 758 0 obj << /D [751 0 R /XYZ 133.768 203.505 null] >> endobj 759 0 obj << /D [751 0 R /XYZ 277.37 201.288 null] >> endobj 760 0 obj << /D [751 0 R /XYZ 133.768 155.684 null] >> endobj 761 0 obj << /D [751 0 R /XYZ 267.228 153.468 null] >> endobj 750 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F59 24 0 R /F56 15 0 R /F81 71 0 R /F68 28 0 R /F149 668 0 R /F96 655 0 R /F90 654 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 765 0 obj << /Length 4095 /Filter /FlateDecode >> stream xÚÝ\[o#·~ϯPÚ‡Ê؈áý’4 Z ÛnŠ0P I ŒåñZYYr%9ëý÷=¼Ìð"Ž4²•]o_ì¹P$Ïá¹~<.! gN KBŒ8Ägƒ°:1›¢Ÿ4›bµ¹ì1d;Æ$¬AŽm>TkF‰t.wF2B G·°à„ŠoLj*†ãË%é­ªX€ÕÎYÒ ˜À”ò$1Aj$åÞ[‚‡"‡‚OƒhÄÆ’2}ò£Ñ§(¢Ož[`ž‹¯Ûñ°t‚éÑ5èá‡bÓÚÚ>2!ø]ÕRÁbÄÓÁJÅúZX阾îaçCÛ¬²X®Ý6÷†È¾ñêaß 9uDÜž:’c¡#ÛŸõ¬ÐøJÛ­Ÿ¢œÉ¥L®”¹‚¦˜öŒQÆÎÿ¢ 2ÓKÀ÷ßWq¸J'†.fÁNßÔ\5Å°ê|¼<ˆ1ò Î/–3C«õjÖÞÝï>\Hál g–É«šoˆÒƒc©Ôß=X¨×ŽáVñ惿qðŽ½8u±U°£«ÅòÕòšÁo×L¤å€3 î`ÙÞµ+;[`¬P„?¾ÔŒ‰­£ ”?ÁhU°ðÄÝ<¶bã³Ó!)…ÃÂ9)†5küíöáÎ_T#1\\ÂwÕ<šF·„bë{˜8·0’*Ä"c’Ei¦îUPwOß¿­ÊG"@$aêfŒ€©LŒXgqžu6#×ù4kæVB¬×骰Këh;²í|²è² Ú-Ëå³ÀqæH2”93CnÏjåÿ™!.f'š¡°3¶@- @ºÁùîˆ&äDS ,¼­ˆ0ó>ÏæîrTòɇ1%Ï0îq»¤B@H1*»™¤,t§IˆÜS• ›ÌÀ@“ÃZD²iÔ6#!>VÌZyŒ¸$ÃÓ…ØtÍ -ƒ²ý¶š;2Í …;ªNÀríöXò,sF±%Ñî¸K¤E ñÒùJ¢ƒaƒ 'ýÄéw;wnóbäî‡Yåؽ¹ë®Ú]ÞùbÕþ÷¡Y.v‹vkC&RÉÍBž£?]#úÀ!!‰{¬A!ÎÏ3p™Ÿ‚ëØHĉ†ëؤšï•½t½°y «éëŪY.»ÀŒò;QN £œÑ‚ÐmÈh?T„ÙÇ-ßs³ c†½vº„žù„Ú¶ZÙŒ¢–†AœŽÛ|ˆGâ–'„FRï› Hê®Ýø±¯×wwwvwt…š|µ×5ɱ;/‚îûÂbË´–10™§MûrÀ I!x\ Á÷ŒØT…ÀÊ>w¤TßÚÕ¢À ó ’ !øHT‘Al½ $49Œ*âãÓV6R[ù³µ5HÊ…¤‘˜>³ì 9læn²Øƒ) ÆX­!å#öÙe.™¼>Õƪ4ö´L¦ÓÞ6Ëíº²Š "‹_o ‡wL_ÖÊʦÿ¶ÞÙxóPÂ5ÜtO\E˜½lü…˜®ÖþAR–hosTÚyàÞ$ù7Q7KÿxÓ.›ÇZÛûª€iIæ Eh¾òáXbQdåBÐ…ÉùSrlËÞt>†|“j¥ún@*I ¯«˜„•z]«³÷‰›jäéŦŠ«C.Çjyþ~®F„‘;Y6c‰.el±q!FÉNV@òn‡­&®@;AÍÞÚ8ŠEà|·˜û¿ƒýÜˀщ¢ÞÊ÷Ð:×Ýc3ß¹_óAÿɘ@¸jŸ^“¤  •š¤2z!fäÖÔyñ- W`3}c™åPÇ.n¦ófÛº-›Ž»ð,]ß¾¼Z$‡¿@Äîô} ¸jÁpxVØähË=&S‹² H›mcñʪ›}6ûÿ†“I«í0þ$Û«›ÖƒÊ¯¿¹WVnc°W¬kŽ119 5Ã)eΈ1‰Q“x‚)˜Hnò/ 9Áì!9¸¼mëwþ†“¸•‚H)jq+ÏŠÒ}eÿ´¶{j¦ÖŸÚG÷këQ¯ýÍúaç/®>TcðYñÅ÷ÇòÉ/fØ…¼~m'I¹ª‚êÇbñfsÁTOGÓƒ«q]§§‚à6 ¿Å>*³|´ ÍÙØ\e.`llÑ˼½~؄ۻ惿X­wþb¾¾»Ø…×Á+B»õ6¼oæó‡ÎWÀ]m\£fÿLÃÞ¶NßfÕuW„6ð¨ºk¤ÁÒEäì³-ð‰Lj™¢ªåýbWs°ÆLšÃÅÊV™p¥Ð#ËbųÝÌa»èˆJi¡=ˆ}– ¸;V¾PÁ¾\¯–VD¥r2¹¸vÊè÷}üã•h/ J-»A«T¬C/•}M¼ºAh y-ç…`Ûš"F¤•—¶±Á3Q~§šÈLWÓëv;ß,îƒ(9ȳ ç«#³ÏÓ »CüÙôýíbÙzbÞ*··ë‡åµ¶†¶ÍµѯPí„DA±f°?¦œÛ'ðsÑÔÿb³Y.ÂHwö˃)’”äû|ÉÒÚà›‰éWÎb|¦"´‡tÜ“íCIçô2_øjè|ºŽBêžÞ®ÝöLx xwÕΛ‡îmo‹í›ØÔÓK°vÈh.] %ð?åÜÖOªHð1qÇã3®eJ [g» µ "[-G*ÎJèS@û2óÕñ,1Ø*=4y{æŸp™@¹¢¾¶ywAÜq¯ »“v{éǬþó¢ø}âTn·“;s3´KŠ:áC-ÕÌ é¡~r G‹òªê;•ì{8JÆUý ˆé(µÚÕLêÆ’‘Ãâ)óJzr4FÈ€{u& M©Ž6-›‡¼ë®ÉÈK÷¥Ï|hê>ZüT(„è5Ð’›æLŒ„ÓnîÅÚ?YÜݯ·Õý2FÑüÅû=`:;X×iÒ“çóꘌû‚±ª+™ì×L’gt²ä˜h)÷¤÷~A ×7Õó ä (ª~$ÇC’¾„Ò#‡ÕÏÙ3•F¾øÝ€® Xì b,­Èëø(\âVÀl2 ¬µ#«¥ÒOÌ«<±"è ‘ÉÎõ÷Àb±¹Tñôhµ­ê¼­VŠ˜èÖ>Ž 9 ú¼Ø|DÁ0ñSó%ÛF¿ OÖ÷.Ôw‡_ü*¸Çá½EžkÕ„Øý“ñmóÆ÷ÝøÛ(áÌuûe¨úùM»kêÒ!ƒâ…ÛH›2åpPY~¸*#.÷tib>˜ÞèóOa²[¸½ > endobj 766 0 obj << /D [764 0 R /XYZ 132.768 705.06 null] >> endobj 767 0 obj << /D [764 0 R /XYZ 133.768 623.292 null] >> endobj 768 0 obj << /D [764 0 R /XYZ 340.907 532.491 null] >> endobj 763 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F81 71 0 R /F56 15 0 R /F59 24 0 R /F68 28 0 R /F149 668 0 R /F110 150 0 R /F104 657 0 R /F96 655 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 771 0 obj << /Length 1680 /Filter /FlateDecode >> stream xÚíY[oÛ6~ï¯Ðžf¯1KR¤H¥`K›b+PäÁ{J³B•åT­,’Ò¤úßw(R©ÐqÒY‡íÁEžËw.¤qpààålž¿,<:æq£8¢Q°\$ ‘ˆdqhȃå*8½Á˜ÌÏ–¿=:–$ˆP,B©h#Äp,b1Ó„¹¦bÒâH E`½Ák:Yt! ‰©:šÆÃ(DRðž˜4_„Ï–ï³ù‚R:k²´*WjLfÕ»6ÉËFh5™¥Ufvvt&ñ(Y“ȳ½{Ä=MšgeÛ˜­ÖzؼikصÿðiNù,)r#Òºª'âlëêC–¶yUêÀÉ#dˆ1JwO¾û|Ù¾P4Á"d…À{AŠ¹AOU¶è'…QÛ¤N6Y›Õ øæËþKµÝVMÞöoëÉÂÁÅݸU9Ë›ªÔ£´Úl/ÚÌ&ý p l ‡/J^ì z™·ïR¡Ôû…¡PÖ¦uÓêYØÄ别¦ê¬¹(ZM«Äpwª¥†šØ?åà¯BŸËÛBŸú`¡O}WèëacíM)’dˆªñ"Dyxïè»k&Ðð Šqèzõgð}L:O–I¡_’í¶ÈÓÄD^lbžÇsF«?&Íz¢È6›D ±†L•Y¶ê ãÙqŸnÌ\V½K]]åwŸëNmÁ§ømœÀï/äm“ëÎKCí™ì±H 1Õ+^\%›m¡ ÉñŒ"ŽØd±cÁˆ#ÂA(䫬֋µ;`PÏ! ²B{CÉJ!î¸t÷-µ¦‘­©@‚ xü˜ 9[{,B²|Ô[Õu5DÛ ç•& [ ±ÑÓ=,"œôŸ=bN3Q)BXòQ%.…‚ÚÚ_êÂPšª‡ic„Y|g…'úX ¯Hl¥ì3¼W÷$¥G‡ÇÃ= vYÝÅê¼¾Cj/ß`Ê=‚ÄKA¨WŠˆ >;÷¹$D4bÿÐ#'ÄA&vˆ¦\ö‘¶2‰GR;ñpD¤]æBcŽè€–Ll™®ºÞàKÖ]dw)yÚÝLÞxœ,Cpq¾K¦]H?õÕG¨»û]Er >ÃÃn±üæXˆî “MbIþ;P¦EsQñ{“—çàLMùE­ªœÏŸUIªº„÷j:ž]fúóeuQ¬Ì’²ø¬GéXŠHßÀô&¿ÊV#E[wmônzî³GUPQÆ®»–MÜϦøpB€#!ÅMyÎá°ð78n@;ö¢Ã‚˜1d‘%+ÕCíIh%0ða‘ÛJt—]Ö×UQT—Ú]ð:xÉj¼œœa–›ƒ{Úü“™K‹ª¹Ð¹¤ƒJÀ$’Lüß!Ü®Cðjcu‘ÕÀelZ5ì“ö‡q ÒXT»ô¦wÛŒxÛÉ^ßu t—?¼Ù^Œ5u—U¨Ï*m×± eûþžºµiáå7[Í ÜkV 'VÛ›0É×hìk´'¢î­•òæZ« gnÛ÷ëzNp—ÄUßÕ ò¸y»Ì†¤ÜUDÏÅpÂfÐÔéÙþ˜­så;hp –gÞ°­¢:[UE „2•èÑs~Ï‘Pù- œ$Á¿ #IMÅy>_pÊg‡Oõó´<ÓƒÅ3ýüÓÌ“= æ³~ôÔ‡æU?žfT?¾<öÝGMvN«l½ÎûË5ó|Ç:_vÄ®V½kÌÍÅ-ŒÓ30H6j×I{x]¼ÓÓômÚ´Æ"éÛ©ÍNsj¾åá™k¡<ÔÏ'O‡Åz ®ñ”¶pèd™\0\[”ª[;5|h,=ð1yo{Ї=,…‡ãÍÖô‹m¢›ˆMÖÖyjz§Ÿ3ðþdn»v¥öá;’ˆ‘ønø¾ ë|îøþÄÅUàäàÝÔMæý‹*ïÏUôîdPOv¬»Pmì{Gè–|úÐÅ#*'ë) ¿Ü ¨÷u¦â94­}/ ÍjÓ·¦ýÕ±s¦P#®_O:z6’†?.TV.W}ÒnáˆBÔ;wï®Ãuaο%Q>@’”çجÃçNH¥˜#.b×ù¯üXÝåS„Ï:è ¨n]Xøëi\‹ä`ñnºH8:Caác|ôÊ•ú²N¶j¡ú]”êMÏu1¥Ç?é‡"YU›ñŦ­wîþ zõdÿQÆBv x²7¦ŸìŠiË^îñˆÃ9NYÐ3!)¥éìXä¬y±|ðH§ýµ endstream endobj 770 0 obj << /Type /Page /Contents 771 0 R /Resources 769 0 R /MediaBox [0 0 612 792] /Parent 762 0 R >> endobj 772 0 obj << /D [770 0 R /XYZ 132.768 705.06 null] >> endobj 773 0 obj << /D [770 0 R /XYZ 133.768 609.31 null] >> endobj 769 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F59 24 0 R /F81 71 0 R /F48 10 0 R /F56 15 0 R /F68 28 0 R /F110 150 0 R /F82 101 0 R /F64 23 0 R >> /ProcSet [ /PDF /Text ] >> endobj 776 0 obj << /Length 2285 /Filter /FlateDecode >> stream xÚíÛnÛÈõÝ_Á- ÕÑdîC:Í.ÐE²@óÒMõædZ¢b®%R!)_¶È¿÷ gHq¨‘D9v]ôÁ&98øù Ûë?§g/߆$ˆP$© ¦‹€0†” )¢LÓyp9š^'ã x¯×Ř‹Q~Ÿ®â*Í3³¼È ss3þ8ý×Ë·"ê`ŒB$HÇÕ¨>`L s¬D‹æ…hil®/ßJÞÙ1!˜£ˆ2¸Ej)}7ž*F¯ÍµÌ—Mfiz÷J£tBP$šM¯<aqZ«ë$B^³]ší—ÙGCÂäsý¯¹quaî.SüÂÜ¥ÄÂ^4ÏæúËÔ$Åæ&ÎæÂ.ü`!Hÿ}µˆÌ%sž\_ŽËä­6…4‹—ˇ± ¶FBæf–¯Ö›*™3÷­éH)ÖÆ(#$’Ä òÜCØãÁ¤5ЂG‡.SSׂ6Ù]¯?`­Æ.ç÷/æ=m^^Þ¿ØY»?Їs¶o¾h4ïàÑ^S|ïž¾ÏlüÇ8L2×z2×4¬ê¿¸§K/ïöñï梉×ó|eÞk.\"ôû"Î:ï÷r:æt'¸š8ìj 3s³#¹¼ñ¼¼çyyÏoîÍåÜâqü&ï8¥f—+„Átžs¿Ÿž;Ø[¯Í‡xíùi”2 £v]„QD ÄR`bxÍÄ›û´¬’¬Jk¿ŸP>obx†ÐNkogáèv¬,Òøj™”h¦íBß\%æz -› WÕl—eºxH³OfÂÉÊ€¤Y•›5»–ö„@à=qW×q5ž0¬as³ÉÒÏ›DÓ­ŸæI•«4ÓD0Ìk"ôzÂôÍ:.â•*ÁBéŸl{§p tž¬ø—Ù7ùb‹ØãwÛc€?¢Œ¦( G9l(JQd³0¼Ö‚.ÊÊ<”Ie`|aåÊ‚UE›ð«Q–jÏQʆm€(“Yž9»TËöÄçɵ,–ý¹¶*bP•Í—i6æXïÇ£|yk´ÚM5‡æ60d׸`¹g\ï—Î.…ÅW$«\ã¹Õÿ’9r¤é×°ãÕziñP$èmv+0“MÉ¢ùNç '-wŘ©Q²4ù®¶S.i=J5A·j Q(xƒýµ'TF   3²ë» )Þ–]zT8ZxŒZÀ{/&JÉ“ELµ^$j~3ÄDŽ좢²S-Ö†¥m] PT§mÄ#kƒØ‡‹¡(AêÕxB¤Ú‡•`„A]´Ä%R‚v±^v”— Åo4€åcDZ}.ëžûÚ#gm¬Skc/Œ©†zNÒÊj‹q_Á½8lz¿zH‘¢­T„OpÎCz²=r£CäÆÈ­uxrŒí-’žÛbÞw¶¹Rª¡Â÷¹ `aOø=áuÖ˜ 0C“{ŒHâÃ'‰#„´:ùäwpº•Õ…ç ¨_¢Ýœ@߶³óÔî¡="t(wMÏA,ÐV„‰‰òÙÌb5Yç¶E“šîÑÉ&?–Ùͺ–éÒ\÷Íuœym.{i VÊ[Å<_f‰†f58³ŸiƒÄ (gˆÁ =ä½Ùêìò#æð¤[Ãஆ\T!,µ.ƒÿœýbÆ×­TpÄ)…«§²ªRAn‚f7 ¤`Ùÿ›/B¢‡€3©…i­ÕÄŽíƒ@eô¬±é¹µ|4ŒXйjf"õÊjf‡ÔÌd„¸ê©YìQ35š]å Ä„tÕ|av TS©;vV›Â£úÒþ·á´¥frÃÃQ= Ñ¢žŠë«Y¾²×Ê,Ú¡,Ôã]±yìE0Bê‘2ÄíIoŒ½0`\@qÄléÄ”xTæH›ØòéPÈPHd¯´ì» -Ÿ¯¼ßçˆh‹Ïß=„ÀJîJªW|j÷w‡.7Îr/7­=ìá†òÁÜÜy}Urq 7¸Æ÷(Ú#R»ñ ^DÍHtåºð >Šè¡îC ±¢7^ÏéfÃã]Ò¾) > endobj 777 0 obj << /D [775 0 R /XYZ 132.768 705.06 null] >> endobj 778 0 obj << /D [775 0 R /XYZ 133.768 398.032 null] >> endobj 774 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F81 71 0 R /F59 24 0 R /F64 23 0 R /F48 10 0 R /F56 15 0 R /F68 28 0 R /F110 150 0 R /F82 101 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 781 0 obj << /Length 2279 /Filter /FlateDecode >> stream xÚí[Yo#7~Ÿ_¡¼I˜ˆá}$lÉC°;0 ; -µÇÈÝN·4ï¯_^Ý")JÝ’5#›õ¡YU¬ë+Rpòn'?½‚þú«W_ýHåDÅ1Ÿ\ÝL•@ <áLLØäj9ù÷ô궜Í1QÓ›‚Ób±qO›ÛÂß=˜ï)œ®ÞUuãiÛúÎß­îî·ÝÛE]µ›¦XU›Ö¿X—E³~tú~Ùº¡6µ{UøoêÖÿ ¾ñ_,Û¦XÌ›>Î8›‚Ù®~™ÌŠR}E@1ÏÿÏ•“u,é»EÑ–í—æžoíÐúº¹]µîÎOká¹öÄM¹¨ÍäÌGÙ”Kÿõ£»VõÆÿPK¼Z–ͪz×îG¸/šâ®Ü”ŸbUY`̼QƒÓö¾\¬Šµ{x°ëàÅžýpåÖB·²r™­i­O÷`EÓטýÂqc&(7fú¯~d*°ƒh2Çš#$Go!Dú7BN¿µ # °“9’¨€ÄŽ&Q0š‹I@÷&3¥’Q­Kð­'àö­#à¡sÀ)îÄŽ×Gˆh8€t„o!â™ÁJv4Ø(ñ‹`Oð{/5JéØRL(@È/é2˳ÒV½wl«Œ|7åÇ<ÓZNOðEn ˆ@ÅãÐ8»˜ŠŽÀ/dKÌB²Žàëœú`Dìë?¶ÀPÿƒæ—)¶›ÂÌ ìXý8dRï2ÂÎ1—z Iì*eìv£|ŽbmÝ@"u(ÍVhZrkZÔÑÁÌx pÉœmÑ@^qÆmé ×òÉŽìM–‘ÎÆOg$Qu´žY¯Õ!Ën«†ÜVŒs[ÏlÕ‹´#"€Ê~”×™Q( ¤·¬CŽ"¥Äž§çÈóßB–³e’I|DFRôL}“BsÃPâ#z $ ø@YÉ dIŠ¥1AF JÃGKóx iÆÆÃQ>±b|„GæpÑÈIzÚ êOõ¢N®°Ç Æø=+ÀV i„Lò@* æ"ÉzI¦PÊ– Q¦°56Ì0›v“10"ÜM^e3.Äý‚.êºY®ªbS¶ndSȧå ÷eë£ûª\—weµq«*cLˆ@@Y¸Ò‡óñc&®ñ< */û˦Ö-|úϦ~_.6¶N5L×[ÏNžméÞr÷rQÏ}ù/…N".¡C=p4½i껌„œhÿ¤—¦7”på§.ÿÜ®œöõG±v*×ï Ú1×ûPjýì¤6Ö< EÌsv±0„@…ñ¡“%aÓÈâi´Ú9%Þ õ¸MÙn×~òU딋¥Ž´S®­¾¶(hUo[ ãtYÓA–í½f³´8Èâ¶}F•NBžÂ§7×3 §[yŠµÇE+‹*i 3 ISÆ@hóxïß|ˆH@Q?ïwße¨â$Šn²j¹+ô,>uLYé^7åAÊN­Té˜AØ×ÉtíÙܶå²vIé¤Ýj»©«^ÊýøÖ¡pÿÊT+ôCàÊgŸUFl¬k1 ˆ,öî» ‰"5$7?Àq¼ûácqw¿ö` Ó^2FÄ:g’~-¾ÏWÓÍŒÉ « Lu–*.¤Ç"Îhú(QVÀ’Ü•:!àŒ+žovvGy Qš¦â £}fÇî7™!FÔ;“‹ToaÕÔ9oœ7 †d¿B• ©wÑ`™#“2'bTbVxìö¿Ížz½->”9‹Ñ&cðÝ™pÅΦ{Þ͆¼›ŒVéqïÆJe<"V ©Î6g~º9? ó°F>:.>ÅÓÞKbjXé(£MM¯€"ÄgP›…¥œ¶µ)”t½Yýbã2Eáê,ûÆæ}£Ë+“±]‰eº¬­{os®¾~Ⱦ«ŠÇc¶2Qµ|ôÛúzSt¿ê‡¿©×ëú¡Ÿ¶¸¿of¦ñüq5Ïõ~ïŠ]J×õ‚»y“iC0hcqPq¾Î®–"q]úµ«@:¡GŽúD?ø g¹ÒðýöaÔb$ýc‘±UˆýÇÊN¦óÌ@Ÿa®—‘¢ìûG6Þ ¬ÎQ —G[”ša:ÄðK*9ÒйƒdsÆòËåÇ›VG–™$Z;MbS-ªãz´«7Ï-]¤œ%ˆågó=ýn·ÍÄS‰ÁIçPCP†CMsv¼iN’¦yšî± cA¯¯Êå hÈ'>ÖÉ ëø"úÀ§–r§¼G!èÑ""‡ÃS裭ÇTrúàú¹ª#a¿,@w»¦™†ˆ¨‹‚, ?EÞ ÿ§p€<+øô8JX‡êZñÂêZ~jšOCŸ% sˆ†ãý´á'ƒ—UÉ8pâ:SÀDlýç…´ S€Ãu½¹ÍŒ6)sšhÜ¡º¤&èw¡2[ƒÚѹã:Ó°¿d‚‹ŠúN_ö©¨Ê&*·—‹@g¢gÊDl\&biL±Q™ˆ jˆ>G&z¶¾–Ùß}©#†{(³Ïß—º\þ>ÓP^hþ\çA¡ƒüÍž”¿ 6c${–¿Ö›ÒlÙ :½­ì©Žfƒ!÷štÿ†ýßô]wuÝÙ}sW·þ•ýƒÝsÚøï ÏŽNô EæÐkÄ¿Ðp²_ÓªnæyV:~ݹéÿÚ ¯õµ?M…¡æàF¸'eòs¹ÜûÛÁC½]/û+æׄbδIß<;ÁÿBíÇý=²Q¾ñÉ’7¹hò>£Ñ2ÌÎpü§çÎ1Y=)mæ¢á‹ÆTGuL訓Þç+ÒFµ Î˽ld‘ötKÙÛ£'TNßÅ'–í >ƒFÑëåÏW *£ýpõê3Ùó endstream endobj 780 0 obj << /Type /Page /Contents 781 0 R /Resources 779 0 R /MediaBox [0 0 612 792] /Parent 762 0 R >> endobj 782 0 obj << /D [780 0 R /XYZ 132.768 705.06 null] >> endobj 783 0 obj << /D [780 0 R /XYZ 133.768 508.025 null] >> endobj 779 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F59 24 0 R /F81 71 0 R /F56 15 0 R /F68 28 0 R /F149 668 0 R /F96 655 0 R /F110 150 0 R /F82 101 0 R >> /ProcSet [ /PDF /Text ] >> endobj 786 0 obj << /Length 3540 /Filter /FlateDecode >> stream xÚí]ã¶ñ=¿Â}ó¢g†ß”‚~$ŵ@Q´ ô!×Z[»«Ä+md¹›í¯ïCJ¤–²½w‹¦yMQœáp¾gLWw+ºúãÔ?wýÅ—ß*½bŒ”JñÕõíŠ AŒ.VZÂ…Z]ïVß­9QD\m¥týûûzûCÓÞ]m¸¢ëo~ª¶C[Wÿ¼þÓ—ßÊbU’Rsm·¢« +ìåö¸¾¯áfÖÕãcßýÔàpW?ÖíÎëíríˆÏ€çKÊq¥×sÊÍnPk1oFIàç°bû¼Ý7ÛÌ>Üòå¸,ÐÊÊh6úZ´àæ¨g˜N¨½«?RÊQ†5~oí Òn¾ÉqXQ]Šs Vœc0`S^& öP=‹"Qï뇺RŒ›áPïo-åŒ^7¤&9‰dŒÈ¤m_ƒªNQåeŠêG&ä‚%üÃW0*cœ‘ROWÿhÈB†_åEs‚b¥Òðõ‡¬.PDqušsL!ml©?±Á;ÏKT€ñT)/µè¡¸Ã iwÇíÌiÏuW]0c™ßjÁH2ˆsÖLŠ™™´(ðYÿxôx8‹ dqíüºÁ/ÜvûÚ¢öοYà&¸EAž8#…ÑçÔ«$ŒÉ„¥`QÌR†‚9‹V½ÏjË<éýéôþÀ‡ßá‚’¦Ì-r…R”æ” ˜e³ÚD Ï‚ûH™Îy³„i}Þü¼¤O‚·5?bÅûm–a‚ §Š¸Kƒ²ã#0Ÿ3ðÌècÝÏWZ¡ðˆEo†•Fž²éÖQsú¡E׬uµlåçÍ»WkO~}×îŸqäm!î‰~2ØTQ”©d³ ̼lîØ¥eúåõ‚>ŠüQÎߊQçšÜGÆçþóŒQ­ÿ¼‰~£žô×4°”š¡ä™±³š§ßäy,Ä(†±-×]¬ÃbKÐVMµ··n' ìúú(|ß/U›p¥“ì}½`:’Ø$@k‰±ªÛ· PwMFmi z+ q˜È±B3ênði¬p%'î«!ŒjoéS࣋‡Ž#-‰à³`pc³íî@zî›-Ì2=„ÈÎ)¬úNôõÞ ÖÁ«ø ‡Çz töv\ÇÉ8¹U‰;oC^ ¨)gôÁú$B0ço æ]a;èÐ=L®ï«v÷.ïY©Òœ²×‰{éÈ ;ÇæÚÁFËl_=Õ⧣Mvxuø½ë‡xN¢þp Óí<ûpT<̦Mf§?BkXËO†Ð L'tn‚ò©ÎþóºyGxŽ±ƒegÁ×éÿcµ¼ò£åI͘p3ꇇêAÝøGƒÑçi=n ¾³U °íï‰qxoÙ½‡N¢PkOâá=²Þ Ø!îXÀš£eB·þÆ2Çqð ZïÕŽ˜r øf@]2ÌMáu¹ë’tí=!Ñ”s À´$LÐÊ Ž–Óΰ°Ù‚ÇX BÃçS<ä2œêî œÅfuùÄ0 7'&ÇÝѶŒ|øD7b‹ÏS¾€E ˜颯„xÞAPt –'?÷2_€Bˆ‡±¾­Ðã3ÚÔèè»Íà‘ïF3Æ—» +öm¿Ïd^w"KŒçq•‹pš{ZÚ–Pé™}7š¥i‡XrÕ)ØŒ·az;–9à ^T&ñ“§u6É3ÞñOŸ…°~-‰ýá÷ã.1¶rJ,³ÌU‹×ÝÁëü»N}ÎwÛhкÜ^z ÒZüÂfÿ—lva®Îqÿ98M§.(<áÅ @²¹Vÿ…_ÍŠæçAø<+fã5;©˜¿Ê†kB‘¢%g©_¹”¤åšhaÎóm”C¤™øJ ˜Å™Æ÷Ùˆ<’‘\ TåÅìÎtJ#›B|‰ÌLˆt¡d~•ÍÕaFŸþùí€}Ÿ=˜Ñ/Ï•¤ÕäxðElùKl¶Èi¨¨oNå: QS¹ö_Ùè”4zÎÊœä5…œ‹Ô´ he2"õ ó¯ˆô‚p:;X!2:à‚pšpÁQæ}ÖÑjy¯GË‘î²?>é"›3j1-lÓÁ¼8dSaæ¡nwÎS‡hý©î툮+±õ¾nï†ûP7ƒ`UÌ’ïõǸž>[ÎJüÖÖ…Ð!ó"lÜÿΧÿtщPÉǽ …Ü‹{ bÒU!*sûÖ8˜rÍðŒË²eJ.m-ðÕP_NU¥Mˆë“ƒŒ éP0Öx›¥qò¬rѶøÄ⠢܂ýÙøu@f±“Ë'=û¹<óbù»/ç;§‰¤sMþsWû…©§: åb¹bŒå Ã… 3¡ó¶êëÛ£ei<] –à aÆe¿w8®ö~Y‚,vuSWà-Èx×Z9Ö‡·ÙT3 FFŸf|¥X’O@‡ÝKIRÈ ëŒæTñŽJ“ô0,ïlAò\ñŽê3Å»H÷|u.ë)`óu~xX(E( 6ƒÊWYsVðuT×kð<ÕR`_goÚf6ا\Ä‹Ž‚´™Ä¾}DFEb¦:s¾2A§êîrI–¿U^”§oUpóª’¬Ô>³o©ê‚ëáØ{:?ÔUë_NÊÄÒ1J!¨˜ÒU¡ü5·Ë“#±½D$§Ù|½JïeÛµƒ3˜r„ëw…Ï$ÓkÙÕö 5®° çûÎ%Ð¥t*§?äò®`©Q€vù¶€©â¶íº~×´Õàš:v‹Àà?uß!° •[„€@çì#ü˜6ÁšCÀ=mšsê¯Xhñõ˜é.l³Æ¼ó蛼èØ–(—j‡çöØ÷ðÆ%3áçcÝßvýþ°ØcGõaÀQ6QÎ)#Z¼ý×WÄóR 3‰W ×:ÔÕÎþÍwÒÃ.㪠}Lœ6IoÄ9*O„¬…QøŽv'“™ôŽ¾ E&5Ö¢p –¡’%;]¦EZ†ÍÚÎõ7IÚ'„O—;H3…,Šñ»í¾®zçà&8ˆŠSë-.íè TåF§ŽQ¨x'{ 9Øe~ºÇOO)ßèf“ÓïÁ¸ñPbôíÏÆ¥§•­Ë‡È-jÔÝhNÇZ¿bSŸ®ô}º¨mᄺ½±Žû|mŽ[¿`§´˜>™PmÞµ> ý•mSmïB¢Td[o‡mw[û\[0BB¥’îà–ä:\[¯ñÑuÁê©Î˜Óø4檅f0£¶ÓXð„DZõ–Þ9áyˆü×CŠr}S÷G¸º•G[}µ¿Mm£—>T­€~W÷õÎëÐw–í уT[О^1êrh&Kæ2¢±6gßø5 žûÈÑÙá¬k>¶! ÜÕÑ÷ ßlo¼É9ÙZé1‚g]mïqÜ8~Åœá~Žœ‹kÛÅ<ÔûЀ"¥Zkñt}Ýe¾*kblñ‡ê¼vä%'BfÔã‚æû‹J!_2Ó\ÁÆ)Ë|<­À?Œ}—…E5{,žwsKb¬a ™À¼Š©cæÄâ‚ÓI0Iæz!•, ñIœu†ñÒÄàò@-/wH}¨éΔc°Š“8ëe» qÿe²Å(ünn¶ïŽw÷¹ (AìKóù—®Á#‰Iº  ê)„ì«Ð/ŸŒ^› g Q!âžË3¬"V™åÊ4Ÿv¦¥ÐÌzÆšætËœº¨¥Pn)¼ ¨~ +!u­‚¥Y–=àPp% ¾¬|Ó×›"Ã_ÌB«¤:Û*Y`«ä'\Ùçb~I3ÛÛ^k¦/³Œ’)cdšÖX¡&¥R®'®TD'M”†¡ÏÎÆžVÓ1ß2çAþÃ6¤¸B¡bÖu¬!ÒªÑd¢‘÷‹ì¾‰ßpÀùîû†Ý÷™?Q9ø'ªñ‹œ%6`ÛDùIvtþ*žÔ¥íšäúu†_Îú&›Ðgĉžµ•&n‹0ÒEr¾WÕ'ˆcgÒ÷üØ·ÁppïÇÙ¿tí®Ypr™–„ó7qL„ºÐtsö¦›IqÞtÛ×'L·›éÉŽÞ·vÝ¿’]OßÆœý@ ðLù6¤T’’)Ç¿h¾žŒr~® ûgˆ¡,“¾¹þâ¿]`åN endstream endobj 785 0 obj << /Type /Page /Contents 786 0 R /Resources 784 0 R /MediaBox [0 0 612 792] /Parent 762 0 R >> endobj 787 0 obj << /D [785 0 R /XYZ 132.768 705.06 null] >> endobj 788 0 obj << /D [785 0 R /XYZ 133.768 667.198 null] >> endobj 789 0 obj << /D [785 0 R /XYZ 133.768 239.352 null] >> endobj 790 0 obj << /D [785 0 R /XYZ 199.462 173.026 null] >> endobj 784 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F81 71 0 R /F59 24 0 R /F68 28 0 R /F104 657 0 R /F90 654 0 R /F110 150 0 R >> /ProcSet [ /PDF /Text ] >> endobj 793 0 obj << /Length 3037 /Filter /FlateDecode >> stream xÚíZßã¶~Ï_á>ÕÛœñ—(]h—-.Ї´´¶ÖVbK†$goû×w†3’(-}ëu.×^q/6ERœáp曤âÅv/þôYÌÿ¼ýì‹ïtºÈ¢,‘Éâö~!”Šl’.c#©Ìâv³øqY¶7+©Í2§¿ötוëû›Þ~ÿÅw©ð1:Š• îí¨ˆI¢Ìª{$QœÚÅJD:ÓÔKR¯ÄWzÅÙÂëôX$y8nò2qbè壥öÅu»¢¢i>ô¿Î¹¢)êfS4ø ±[¦¸f¹=UÇ&+¹?¼-ôpÌ»•º]Ά<ÔØáü)Ú~ئ>mw¨éb•š(æ ¢ÌðºÜÕÝ.`G26ïÅÖøöÈ«M@œH¢ÔÚ«Vû‰¸dbþì`bXõX6mG¾¨Æ3ÓL³ëg5K¯3ËvòN-l nœþzû¨(K'ZDäRp 5uÛ­ÒɲÜ9–,9/VÝT±-ª¢É÷å¿‹ 5 Å±¡)öyWÖA^Š ySPÕ©›\ã¡î[ᅊ꺇/k–›·åš”:Ê´žêìI•V.ïé 5]sZweµ¥Š7+–P_WÛýر*ÖN†ǺâP„gŠãÛr¹mòãŽz(]DBeνÉÚ/WNåxªlW®‹v¦ÍÏÕMæ"ØapxV¢Ølû—Šî¡(zÝzs.îIéxîæÐ%è`=¤ÌDB«…×éL¼Û(ÎÄ»ÄÙH(=÷ÓqÒW†rIÙL½Ÿ¹M„UE±iÉ•Q Ýh}“)øÜ×û}}#!”S) ˜ArPLÒ>÷qsÇê»./«bãÅPrTèó¾óȱw<î)_ÁÓíM UÍOyõû,‘ûì·uyçг³ûË«$i=óëp ¤Â›¾ˆúyë©œæ­7˜˜ÎŽM¾Æö S³v«Ñ§ŽÜ A§›£¶ooVbÙÕ¦Ø8ûºÖ#ácÑ„²“È´‹PVïσWM| ^¿e쳊#³^%.TÏB4ƒ£«HXE9õŠ|½§èœÛâ˜7yW‹`:˜áœÓËCþfÂg ÓCõaÊJîvfYH1r€¦¯CëŠ%5]ו²vù—ºÃe“6]îØôøÛ3/]«íw ÅÈ}JÖo“îjäCýŽÆãJ»rÍ¡ ³©39¯ÁI£»S‘,%G@ñìÔt¹³·c@H6An»«Oû U®ë¦)ZX~vD;÷Çz_oËu¾§ §ª‹/÷t?ÈQµ‘%ji}–H}øƒuS-—}û¾cãÓÓ0Ö2õÃ;=”û=•ŽM½9­ƒyóqvË4dúÆé¤2å)Œ-žÂôè)lµ $Ãׇ°S]Q­Ÿ«z¢}@/’ÀÈWÈ %Ñêd¨h95X¹‚XÁnM=Þ$f‰Þš dÅ ‡~™Ø@M\Ö Ì~hçZ¬wÅúç º@:ÍH~ “Ÿ„ÉÈñx6¾1ðl3há½£S–öûø:i ?ùþ”w\{&¦%$"™ÉgcZÎcZ&}:B‰³€ÍUѶTå àOÐÛß™¸ 4z Y÷us ¤%;à? 4ÂAlð@WN$Ë7÷Ô— ó¦~[ÜV„ªºSãö8(äăuœ@L†IQ¨ô¾áŒ’ Æ´ìsVŒ~k¤†½·Ôch-'H<¡iOûŽêÙàÿ7?ãÂ;»H3Ó :ÎC>]ÔÄ­GÈ9³·?—ÇcOêjFæ„£Ø|Û9ðÀ"nO¸¹žÒØZoöņr|hýÆ%¶tÄW(»?üW5áyS/³sQ*Ô˼™†vÈÿuå0 JB%ËFpÏüN§&¯Ú²+Gl ×ûº=Á‚‚c +oîyüñ( ƒAHY1KTžß:øÊè$ Ìx6ôD‰/ëÁ([6åv×QqÇ, [¶åÆeà4ÿJïyP¦tàÞé†âwÌùMgæÁf¡I{gÍ–ûâ¾£ëŠnÀº*µ¼ÃÁO܃©ô#%ƒy¤x µÞñØO×fÏ]quÐ!W*–Pù0M| Jä¨K8ø4;«AMl¨ÉMVõ4E!ñª6¥3Bˆm™LÕU[ÙÙNçÒ£g#ÕU“mªq'¶^§¯:á&nõås·æƒ’6wÉf®júϺÛ‡WœN4ìÐå U×âú’Û`i\xTìéØÀžŽÅ]í(¦eÄn´§ˆ¥wø4ñnàhÿJp¨} ™3´ÉÀ/q§#ä;(3¶ºÄŸaü`¬ŒBb†ªã¾. ,²³À)Œ²ã&ˆØœˆÓâØÓG±'»Š>ÎH “g°ið }f2éû€¦ñÛ˱éÅ”0S~ñŽ´ŠÇ¾Ù9x³œžgMðEã÷°éÿÑš‰›áXW^ø©Þ­ƒ¬uv6ûxøD¾­.´2î“z\Û4NžÁ3%RüüKù¡ Gðë>×G‹$ÞüÆ<7Ž†ó³î¾QMàp‚—ÛB+ÀU1=þÈâ'™D©>ÏŒÃ&ÕÂ}J7tü! MÓùyÀ±&³çL[ü7•/vÄ'ú¤/ÓGŒÉK)Dõþ Œò)JLŒtáiõ¯5¢¸ÄˆHy&ýƒ=e^Ïîl¦¡nud@Ï•Ñ‘‹òAB> endobj 794 0 obj << /D [792 0 R /XYZ 132.768 705.06 null] >> endobj 795 0 obj << /D [792 0 R /XYZ 408.227 609.415 null] >> endobj 796 0 obj << /D [792 0 R /XYZ 133.768 312.354 null] >> endobj 797 0 obj << /D [792 0 R /XYZ 133.768 130.851 null] >> endobj 791 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F81 71 0 R /F68 28 0 R /F59 24 0 R /F96 655 0 R /F110 150 0 R /F56 15 0 R /F64 23 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 801 0 obj << /Length 4442 /Filter /FlateDecode >> stream xÚÍK춅÷ó+´´C‹’¨G6ز3rwAc;|mÄH࿪{ºŠÕU‰Núè°gúÖö9ÔƒŸfZ¤úîÇ®ï¾yé¾çúµïr—§--yë¦qªß×î»/ÿìªê›î"}éÓ¸­¥û½ÛËß^¾æ)åe·N^|lŠCIcY¶­û¹{ùóEߧjTÿÝ¿\þá´ß}Ü•9mÛP†‹æã.Ï[)5b*ÛÔçú†ýÛü¬?|ÕŸþÐ}{‰¨o¿¦qš›oÜRóå-'ß4¤2ôÙæ+cZúiò‰–“¯ÌiÞÆbóÍKZ—5/H>Ñrò-}Zçy[L¾uH}ÉÊ'ZN¾µ¤~êG›o›Ó0LÛŠä-'߶¥!Ëjòå|9åG( Š9 sÓ¸îã’‰8L©,y™¡ˆ"&E–Tæ¾Ì6⸦e*‹(bRÄ)§ýÅ]Ä2¤-¯‹(â§F”ºE‰”x-'_‹y  Äk9ùZ”H@‰×ròµ(‘"€¯åäkQ"E%^ËÉ×¢DŠJ¼–“¯E‰žÔJ1i„iQ¢U%˜±E‰V”bÖ8Ý D«JñS#ÊØ¢DŠJ¼–“¯E‰”x-'_‹y  Äk9ùZ”H@‰×ròµ(‘"€¯åäkQ"E%^ËÉ×¢DOj%˜4´(Ñ*€’@LŠØ¢D«J1kœnP¢U%ø©e„iQ"E%^ËÉ×¢DŠJ¼–“¯E‰”x-'_‹y  Äk9ùZ”H@‰×ròµ(‘"€¯åäkQ¢'5€’@LaZ”h@I &ElQ¢U%˜5N7(Ñ*€’@üÔˆr·(‘"€¯åäkQ"E%^ËÉ×¢DŠJ¼–“¯E‰”x-'_‹y  Äk9ùZ”H@‰×ròµ(Ñ“@I &0-J´  $“"¶(Ñ*€’@̧”h@I ~jD9CZ”H@‰×ròµ(‘"€¯åäkQ"E%^ËÉ×¢DŠJ¼–“¯E‰”x-'_‹y  Äk9ùZ”èI  $“F˜%ZPˆI[”h@I fÓ J´  $?5¢-J¤ Äk9ùZ”H@‰×ròµ(‘"€¯åäkQ"E%^ËÉ×¢DŠJ¼–“¯E‰”x-'_‹=©”bÒÓ¢D«J1)b‹­( ĬqºA‰V”âçÞd&û×Ü ,Uäv`/&E47K¹#Ø‹IÍ=ÁREn öbRDs[°T‘û‚½˜ÑÜ,UäÖ`/&E47K¹;Ø‹IÍýÁzž#7jÖ°cnÖ2rp f¥4w k¹M8PÓ†ðöFa-#w ê禔-h@#U4^LŠh@#U4^LŠh@#U4^LŠh@#U4^LŠh@#U4^LŠh@#U4^LŠh@£ç9š@Ív h´Œ€&P³RÐhM ¦ á-h´Œ€&P?yÚÌ-›ßx«B˜ÑNq¼U¡9ŽNLŠhg9ÞªÐ4G'&E´oUh¦£“"Ú¹Ž·*4ÙщIítÇ[šïèĤˆvÆ£œçДG¯f ;vÒ£”¡Y^ÍJiç=JšøèÕ´!ÜL}”24÷Ñ«ùó˜R”„·`·¤^ÊŸÆ,žR<Ž'Rþ,fñ”âq<‘ž0…YLµzPµ'Ì`VW© E{Âfu•*P´¤„¥¤­_Æ»„RŠ–”°ŽýÚ/w ¥ $-)á:¥¡L¹Ø„RŠ–”p[Ó4,å.¡T„¢%-y’‡4÷ýfjõ8¡jù3­åWcØy)¢µxÃÎKùó¬Åóv^zÂ$k1`hO˜c­®Ç° ´'L±V×cØZRÂvêz »@KJØÂN]ahI [Ø©ë1ì-)a ;u=†] %-ÊÒÂN\ØZþ\pù#Ö1ì¼”?\cý™I0ÐkÏX>A\zí«'ˆ+@A¯=eé±E0ˆOY9A}âSNP_„˜ÒP}bVHƒBõPˆY! Õ`a f…40T_†˜µ"“¡¡ø"4 Äg,ò 3zík<ˆ+@C¯=c‰qh赧¬ï ¶ ñ)Ë;¨/@Ã@|Êêê Ð0³Bª/@Ã@Ì ih¨¾ 1+¤¡¡ú4 Ĭ††ê Ð0³–24_„†øŒ•(df<@C¯=c! qhèµg¬C!® ½ö”E(Ä¡a >e õhˆOY‚B}bVHCCõhˆY! Õ a f…44T_€†˜ÒÐP}bÖÚV††â‹Ð0?7¤ꆆó’ú-o ½–”ÐÐP\z-)¡¡¡¸4ôZRBKC±EhˆY! Õ a f…44T_€†˜ÒÐP}bVHCCõhˆY! Õ a f…44T_€†˜ÒÒP|â熔£ÈÐpÍi˜ËXz-)¡¡¡¸4ôZRBCCqh赤„–†b‹Ð0³Bª/@Ã@Ì ih¨¾ 1+¤¡¡ú4 Ĭ††ê Ð0³Bª/@Ã@Ì ih¨¾ 1)¤¥¡ø"4 ÄÏ );ÈÐp+iªDC¯%%44W€†^KJhh(® ½–”ÐÒPlbVHCCõhˆY! Õ a f…44T_€†˜ÒÐP}bVHCCõhˆY! Õ a &…´4_„†ø¹!¥ïf•ë~Ks2BÃ@KJhºW`¥k¯%%4k]‹+°Øµ×’Úå®ÅYï:³Bš¯ÕXò:³BšE¯ÕXõ:³Bšu¯ÕXø:³Bš¥¯ÕXû:³BšÕ¯ÕXþ:³Bš°ÕX;“BÚ5°ÅY;?wéRy[CÃaLËZ DC¯%%44W€†^KJhh(® ½–”ÐÒPlbVHCCõhˆY! Õ a f…44T_€†˜ÒÐP}bVHCCõhˆY! Õ a &…´4_„†ø¹!‡9-Ë4ÞÑp\ÒVÖ ¢¡×’Š+@C¯%%44W€†^KJhi(¶ 1+¤¡¡ú4 Ĭ††ê Ð0³Bª/@Ã@Ì ih¨¾ 1+¤¡¡ú4 Ĭ††ê Ð0“BZŠ/BÃ@üÜSŸ¶iYîhX†”Çaœ :-)¡}$àÍy& Ó’Ú§Þ\‘Ç:-)á݃o¶Ð“½˜Ò>P|‘‡z1+¤}< ø"ÏôbVHû„@ñEèŬö!â‹<%ЋY!ísÅyP ³BÚGŠ/ò¬@/&…¼{ZàÍz\ ?7d=Ôóódi8ÏiìËÑÐkI Å ¡×’Š+@C¯%%´4[„†˜ÒÐP}bVHCCõhˆY! Õ a f…44T_€†˜ÒÐP}bVHCCõhˆI!- Å¡a ~nȹ¿ÛTîh¸öiZ¶ ÑÐkI Å ¡×’Š+@C¯%%´4[„†˜ÒÐP}bVHCCõhˆY! Õ a f…44T_€†˜ÒÐP}bVHCCõhˆI!- Å¡a ~ò€Ç´?øŽ†Û”æ2ˆ†^KJhh(® ½–”ÐÐP\z-)¡¥¡Ø"4 Ĭ††ê Ð0³Bª/@Ã@Ì ih¨¾ 1+¤¡¡ú4 Ĭ††ê Ð0³Bª/@Ã@L ii(¾ ñSCÖÿ~¹|í»»¾ûæ%ׯջj§--yë^§qJסïå^¾øzZ»-mó0w~èö?¯5Æ”ç´æÜ}ø{÷—ϾþéÇÿöýç¯Cé?RþÃç¯cî?ûð·Òoßÿü·ýôë/×ýðÛ¯?ÿë‡?}ñõ¾0™¼qÎ[*ëžæò–_~¹k$åÑ÷¯>HGò2×M¸?e§¢pÜ7ß¾¡«èÚç—˲è¥ûý²ý¿½|Ýž–m©[ê÷}?¦qš×îö}‚ò”rYJ÷ö½Ùµ]¿ä}·ìß»×·ï·²kxÝ™CÝ/}í·ìÌr™“úeî÷åõg¯òÃfWÚà×bÎÕõöâúˆ°ÒOc÷öîžýzý2]£/õPÛÛ\i<öûs…×4¬S_÷n_Ïá­kmÜêá¾lµmåá2O[÷Ý}mߤ‹QÓÓ;ù¶™÷õú×’óòðÒ–Ìð’¹=¸r†¾î›n^ëÉ6û.º•ò¸ŸjyäZÝWuxÙ?{íkæ²,º‹^÷—úu«‘Æi˜–½›òâú“¨ùù=½näáñ)hzJüö(Ó gQÛS:ðv>LöPÛ×ò^†mBvÝAã~„ä±ÒhÜéµ/_S¦éòùN½¨Æ1ãÃAÔötT6÷Ûðô®]%mÏéÁå2¿¾¼ÛUe¬ï1/í®šKªW‰íÆžê5c}Ãwí(mû º)û-Ïúž%m™=Ð#ÌŒ uë•ÒÏcCX)å²Ö¾®ù:¤/sÞïS¨Ã|½ú+ëCãwØþüÎ ìß1mÏétçȸLi[–ÙŒ[Ië–Ë»ÆÀ¨íÿGOµT¯ÖúuÚÌ‘µ-umãöÞ#SÛ‚Þêáõø´=© f0lÆÛ˜¯‡æmÌ׃ëñ1?jû ú©›ûñA?h{R®;Zç»]µæ4 cýu¾ÙWÛ˜J%µÙâËæ\¯…ß³·´í'èªnñ·@Û{ö–´=© ׿OÍw{kŸo¼,ýØî­aÈi­¯Ú->ôux›Çå={«iË쪜QÐõHY·e*ÍÕˆ”š«‘©&ýºÿ…ç}W#Qûó;Ûü®ñðÕHÐöœXjéÎÑ«))£u{¿ÑQûOÐ[Ýè3:h{R »4Æãì ÚžÔ3 kŒÇô -µ ÜHCŸÓ0MCsÚ4%=m–1M¥Œï>m¢öç÷¶¹xü´ ÚžÔsÚhŒÇO› íI]0§Æxü´ ÚR» W?ö´¶j—û¹9m´$§Í~*­ýpù-ø=§MØþ©½ýŸÀ½}rõÚ|tõß?ÛÑÜÑ'pà ŸÀÝ¥z«mmüZö3g½¾E.Ù¼ÇW^þs5$à endstream endobj 800 0 obj << /Type /Page /Contents 801 0 R /Resources 799 0 R /MediaBox [0 0 612 792] /Parent 798 0 R >> endobj 802 0 obj << /D [800 0 R /XYZ 132.768 705.06 null] >> endobj 803 0 obj << /D [800 0 R /XYZ 287.666 428.766 null] >> endobj 804 0 obj << /D [800 0 R /XYZ 287.666 153.058 null] >> endobj 799 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F56 15 0 R >> /ProcSet [ /PDF /Text ] >> endobj 807 0 obj << /Length 3375 /Filter /FlateDecode >> stream xÚík“Û¶ñ{~…új,o’NÓLÝÆm:6ãz¦œd†'ñN¼èHE¤|ñtúß»‹Ÿ‚gûì$“OÁ%ûÀîb±ä³›Ÿýõ>iŸ½üä³çÆÎR–Zig/¯gB)ÛdfM̤2³—«Ù«è«Ÿ²»í&Ÿ/¤á‘d†%óï^þ½›å³ç‰La ãÊÂ÷ퟫ².Vùn¾P2‰šuŽ4ÚÍU囬)ª’^µmRܬÿîN—j$ãFµˆ¾$ÑR4KáÙ<¹t=Ÿk7{ZÍ/¿åFø÷4¾Ý!XµÚ/óÁeh Ž$fYlältVfe€C1‹uÇèøw°æ8‰®»E ¶zÚAÂVàA&(ÑéPABð„ÃÑÍòy` ìîìÂm`!£pKåÎAæw!j$S±x jF"@ËѩΧ4 3¦Ã¢BüŸcü0gø?„·AÛ ¡£ 3j€DêÀ:PÕ:fÈËt<•ìˈßrÎÏqTZ¤­ßŸ3- ö¡ûj°Œ´L”ãa¤þAŸbé{ÊEžâØ¥‚kAÄbíYbÕ[û0ÁYØo±72·'` n­bÇåovügbǨ‰j„<>ç º½~„Z󸵿B;-~!vú×dcõ%öÃ;ÇGµÓê7;ývZ^@M|.Þ¾ØÊŠ÷n¿Ã>º¥×ç,½9géõ{ì~¹ø¸ÎBŸs✳Ð?[b§[p!g16 ŠIÛYÒ§!w¢”fLÁB &À²qZàÂdŸ.Ä‘z]ÝcÂMó¨Y5 N’v0r]í¨SÉÊ)'Y¹ãÊŸS6_(GϪfMXCþPI–ÊxM¤›˜d˜ñú– ´2‰|/yÃÖÿvè¤|¼4å#R§‚Ó(ЩPV®ŽKH*¦ÕÇü°’_@üî I?ÎÑ߯‹å\˜hM)àfœ²ÏÜEÇ(aÿ:ß×o¨¿¯‹ò¦ÿ×£+ 0¼IÔËe`½¨"¢³Ël³ÜƒÙ©vOG·2ýíÌÅBÄŠÙcç”Å­±{!æ #Môô j_•ßQgñGjÿëÇ‹'·“7¯ŠOU7ø”š‚š?øÙ$5·þCj45n3¾)GÀªFш8f‰šˆæ6ˆ´Í#&HoƒHÿ÷¹Oë‡Ð¼ïÀª'·Ÿª‡³J\Ī0sìåÌÑ1g,‘Ó¬Rï¢U˜%‹Y‡ÀŽuIG3õXz5îXBŠç¨vS2j^Pri8“ƒRc(w0¡©y`Nù6sÊnΉ)âÞŒèwµÁ1³Jm°3 ÊZ´”d\1œòW¶0|åÚ8º«æ­ìŠ†è>sp~ ðÓdåú`›5k Ëš4zŸš£4ˆ:•CIc÷}u•Õ`øÝØ0Ы½« N:“ëÜ{œÎØh½ö½+›a/È( ‡äô_Œé¤óÎ1f©NÞ*XJíøÇG¾ø÷¡ózßGøh¤Éà4FɃÀì˜x¤fÆ¥œÎÓ •†ñ¤ ùaIO]“"%ºdrõ.²¿H¡ÀÝѬ™)œìÄÖ× ›”7 ­Ž–UYæËÆUw¸Ç»mUæeƒg<£¢goúñ}C1%<À›ÂK«/Ø'Š«óõ‰:àŸ—Ëu¾'a|ÖäÀs — $5M§N¾ã#ù Ó:ƒz¿ij¬JTÿÊK»(Ò-šÌù6㘟}ïÄOù\òè§lÙ :àŠ'Ló@îuT£4Ê$·J“DôóÀÇóÑè?eý©ö¬“fÌ6¢`»ÉŠ’s]½ ,Í&ûÜñ—ç.OÚ*­4Ž²ívó†ÄaÛš1èÔÙïáÖƒc‘_Qû‚šUAbs6ÆU†¥‰«ç©ö Áø/W¹— “  ‰ö±DÏÌ‚s}ƒØ²]ã?©Ž¬º!Õí [²ò&¯»µ´b`” "6°òÃ[.³É «¦b |sSí€áhc®ðƒ“*æN©.^ýÈêz‡ G Í:khò¦EZ”['_èîÚT]À]Jè«“´¥,‘q/iN·ß.Ïh7#¡~9½Û—Tñ#D3ðIÆLºÈop`k@µ21 ×x‡¹F%ã¨mqN F(ÏêªÌ®6¹F6lÛÒJ¿Q™Z&OÓ¨úÌê]¶õ8óM~®¨&Ôβµ+‰£›bç…רڹGž]cæiå šzrN$%œ£w¤­*Œ— ø- =Cfð8ú[…˜ ÆîðÁFân++y„☳¸O8‡i–ª¿«­ oF+j%'<ÕÂvJT·kv/€]Թʛû—µA\àÐëj³BÅÓÜF_{¸-ÚL6µ¬–©ˆî=IZXI±Ë£dBq¾ÍËU^.Q®<‰nvÙvM]ÇržÂËjåvOèÇÉ$CƒÎÐi:Àµ@±KE{­›¬7DMÔ÷cÉÐXÎnØ“€½‘‰` Ÿú#óG~ºƒ#!ÕD– rS¤î‰u§ãý$%uT4Ô®*g´ WVnÈ€ý€–;§á:/kßuÚMUý@½¬%¤IÂZg\ÎëR2Ô¥e» Výzó]§ðRûÝoŽ`3 롘;–,Ú¸,v9Ñ †£vý“,A+_ð‘ÛZíÁ"vbG/ˆ ›DwÕªÀ;]ÃóóóÈoV‹ÿÌô•õ:ÛlèÝÀKác½ön>M©A )Ú¹P8®¥ôn—±‡š/µ%ÍÇ}¤c*ᆱlõ£§jI._c'¡%KåYe“à çs…ËÅØAw1BoN t¹©êýÎU[/~ÿXºóŠF+çT¬È€ãŸœpz©”x¤’¡ñÄáë]uG/2˜ø|Ó:Šá4ESç›kwûeOx¼oÁ톟:;ˆˆ6uE#áÕ…óŸ8ÞøÑUÞäÞqñ©Ñ®o«¢l. ¢ºA75`üJÝ£úçbGØq%<:=¦Ÿ|ÍËh=ÿÈq)ÜGÂÒMê`÷D¨“hˆÐÒS1aÂv:tå'Ϩñ»UÈá sQwak;Ÿc.¹Íš@t6\âT~¡V¿h5:2Ü»Öñ2pé"×Ýmö_gQ¼ÍVG΢ƒü„éÓJ˜É¦5b”ei™Þ‰¶W·cŒ_H=ñ»gXeN­)õkœ‹Cý&gxdÆ#p-=¥ÒÃJ@ƒlí¤l@ÓÚ_1öNDÒo[Õê$M.Ô?s‰þ™Á ~Ú¤®ð`W7´¬ºÉ·Ô+üâœ)Ñ>U{ÿªB“çíÞLL—6‹ ŽÝB艜F$§# n/Q‹=D~ZJF‹Ü¶GÏ6’LñI¶À„.ïªq Ç}}MÃ$èìÜ¡šÎ°R ¦vo—ø£YÝÔô²ògôØÆŒ8„ß¡C¶ Žà>ïf ûÜ’£”ü˜CÆêÈjF@x>£F…6úÞBÜuî×½wN­çP'"E¿Ó9_¶ößù(»ž,œÌ;_¯3Ýçuÿe;„;‹Œ$†,¬)ÒqŒN[<ЊÂ$ò|©Gm¾¢íÕGIê‰zõ ¼ašó–M“-סX–ºÝîªí®€À«%¥ØMÈ2Êÿˇ6œ’ÆúÚgrL0¸É›. ³Ë»ûBuX¶Ë´øMk¨tŸA#¹œ—ÃÜYÔo.âèA«)ùè–®Ímõ‰ªVúŒbn§˜þîÐf·_6Á+ŠÄ”(ÚtŒf³ÂŽ\Ç拓 ŠÔ©PdÇ]¨<ƒ€ú”ÆY1²‡Û}­דÂ9=´ˆÏüͨRU³ô`Åaò»G¹P@H «Òl*¦z>t—¶¯¯Þè8Æ0!0«4ŒÍ„ã®">K¢•k;­CºàÄU5u@£’ ¡Ôúðñ› 6¼øbÛ°ÁQ'I‡Ø¾*ˆéq¬xÎmòA©çéiò¥•#t?³àV§Xim´z‹°cZ7>‰;>ŸüÍ=ÎâZ›<¶J]TF•‘£o¾zùÉÿ=ÅH endstream endobj 806 0 obj << /Type /Page /Contents 807 0 R /Resources 805 0 R /MediaBox [0 0 612 792] /Parent 798 0 R >> endobj 808 0 obj << /D [806 0 R /XYZ 132.768 705.06 null] >> endobj 809 0 obj << /D [806 0 R /XYZ 133.768 361.902 null] >> endobj 810 0 obj << /D [806 0 R /XYZ 133.768 221.558 null] >> endobj 805 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F81 71 0 R /F59 24 0 R /F48 10 0 R /F68 28 0 R /F110 150 0 R /F64 23 0 R /F96 655 0 R /F104 657 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 813 0 obj << /Length 3020 /Filter /FlateDecode >> stream xÚå]Û¸ñ}…môÌã·¨¶À¡W$×;-rÙ¢›<(¶v-@¶¼’|Iþ}‡Ÿ¢$Ú»›Û¢’=Î ç‹3¤pöáì§<{>ÞxâŒd„1”K•IÉ"$Ûnî>âl/É0Ê‹<ûlPã€JôÄ&{ó.ûñöæû·Bf*$•Ùí}F8A”gRp$”ÈnwÙÝê/ÍCÛÕÃþ°ÞPWdýñö—ïßrMå\M3áë #xu»¯ìŒC»«?`L«ýý¶i×ðþënóïµÂ«²ë÷eÓØwå”Y{o¹M…ÌsTæÙýˆ£Bð #tX÷›Û”F˜æߢÇkúT0ƒf’c¤Xnåùùx: ¡©5dÐb,rvgtúkÕ”CÝ{;Ö­YÀ¢•ŸþkÀ¨È™ÒI’mâ·H§Ç„9â9Í"¬ï¬-°Å•1.¡(g£ž)OÈU ð$‡r²ï Á3cQñ§ÔÊA/)9ø_á1þœ‚à èq¢Ú™É6„QÄÁ›7„ B¸ øçyH„1¿j´våà¿»bÁ\¡b¤uÝ‚âŠõˆeVÞî-ûa_vT•æEJ©€ñäëHDc‰¶íq(kЂ‹zþõqWwÕÖ(¨ ažO-q*‡½›vßµ‡”»HD §.—pq‡0´ C¤3Ÿ»L£>zõV~!Ú]Ìð¡+OûDÛ¬É $⬰”î×T¬Ú.%ĉ ÞÑ%¢Q"5ŠD2?s‡S‘¤-Šgã1!EŽH!Çœ€qRrù˜ÊñyUc—2ÑF0H\븼æ¢XåíÀ2Ì«@ÈÅžŠÉÄSL™vI< Q,x2'Ø‚álxyžj¦­œ‰ ²„Zl—©;ÁÖ­ÝÞ‹|Ò›„ÛÊâ ™Ù1Ê©ÿSo¯áM3g÷Hb5M.ϾÇÿG}q¤L®ôUߧ7|Åæ;þ$È&ªúî©íZFδYL>}LQ¤`Ì‚¾€ärщQsÈrQZ ùŒý¢Jk*µÙeâRëb²ßT×Éé,•Œ™ÝY¤ÏR ü¤\†š'dbHè )B¼”xÕD0›ãÒÒáiÕù™ª‘‘/TF—X'l•B?ì(IˆYR“‹zAk´x¦Úòg©-ÿ/¨í‰:.Í4Ug(ĵò^ƒéï´Õ¬ R h(¨ “¢³ÈÕqçªIÈà\— €$ȵ—ôù3¯÷”\Ac A7ë)Y¡žÝSΟž…¶_'–ˆCÅ,3Àú)3¨7†‹6üÎü…þ6ÓÿÙ ¤ð‚êM`ú*hfdôÑüx›Ýlæï7s›x¦0FuqY ,h̘ì'K¼Ïn¨BŒƒü  ô &Ó0P%õj,ÐøÑ\Ç1ã–DLp*"Jâèyæ Œƒ9zèy ¢#ã¥(#¿}R % ½ÂÐæD˜D5\å3Z䀰uÊ&MÇE&”ÞVHžÄ<X+(ÑYíÀˆÆtK§bJâÚ‰(`[f„g#)Žr¬+©‘£‡è‰^®€D”+´JJªãÞ:U¤8ïu)·÷Ð`M#öÍc³ ²™sŠ)X

{g¶Ç™¯&dŠE!±8!v^S¬¤)˜'ŠØ/J·D}UñÒH0·g~Ù KÜW•XÞeT‹CCêŸÍÄÝ%å›’y`Ëžc}”oŸÙÆ==x>ïU×á—âŠ:Ÿ®ÃJ¢H¢Ð¥S}šhöŸ»‚åÌ×^ü;š¿¾ˆÝø*v•±æer^áËiÆ!û¶ûmýpîôik®V1}é$¥»tP8Ô6¿>`û¶©wögÙu­>éùÜ›»!ó¨C P?ì÷îÞ>cž$¼Zv"T ÄÇ6õy7TVðUyt"ÖCïäéÊc_µ–÷·5«Ê6%4ÇËkŠmÓöZÂÉ-ÄÔ…oˆÊÓ©ùšbq<·ù!%´n€p¸b²²t=œ;­¾B8õð|´Ú‡¡Q¼³ÇüfBn†úø=×µC@ë u«7úÒŘÝÖ²ÙqÚPuÎkH£õxFÞ¥&täìDkæcd<8Ú4m{²tëcÂü Ì?vëió³˜àÙ\kõ–¤1­–õÚý–Xþ*–•drn6´~eÛ漫¬(î¦HÃíµ—>8Ì wG„‚9ÔÕË£ cæ”lb¹ô%|Ížm¡ïl 8µ}_‚5 ­J7/Ð. ÕÆê^Ÿ…jXiÞ×Me¦ •hŽ0 –Y³¼¸f vU<¿&§>°Í¯_˜MÖúøTƃx"_ý£*/­±Íæ6Û u–í>Pʬ~¨âÁ«§'n°4ÅŸ2A@ŠÜSsž¤ØÄùCw“j€}€uíùaoTe×ÔUgØìÒ õ¶r¸=pH…5eDVÏ<«OÝéBßgÁÆR5÷V†}é„ùTÙãnP4ú˜Íî\Ïá» «r»m»$oí¢´Àöò^œÀ=u"­ÛsïÞø|Ö[ »økR 8FCÓéIgIFW?-èÔŽê“umL€œõY>Òž›EûdwD<½úêÏáZ.>¹T"w]j9»¡,\Nlëê¨ý|Õä¡Vç¾r€tZ†¼Nè7z.·¯É)kiç—£‚ÓÑî㳸nÛÃélŒ¯×¬m­•`,¨S£”h¶vº¬-’¤rõâ]ÌŠâvRH=3‡ý{}¬R%A”^Ýâì‡ Ñ¦-Èêo¶V¬Æ*¡[slÒ5V6©‚æ`û¬à²ð_€ìTuý©ÚÆ¥†™_8§†Y½}Veo³†.TZG¹i¬ ¥Ö{ÛËJ­DjáS;˜O<\+ m„¾² C@ûrMñXýÀ“ ÌhŒ{@¬Ð}ãP¬úòàfD&ŸqK%8¡9 /39˜‚1å½QÐ>˜´/”«%ý.Á¡“›íFnXâî|jêm©7ýÓ¤rýi•«OZæ{ ŠƒŽ`¸-ÝÜs|µ?>¹·]uhµÚ¬îvî¥CÚ¶eSõ[]ãšßºIv ú£âIŸdÓVÁÉéå00c£z÷Òµ À€ÏÃ×æÄ´~^ˆ!Ð ƨ“ërÄ|[dû½ËÓ06zƒç®=š‘ ÌA͠¯öǶì+¤»pÝÀ’…: õ§—^ƒò1Õ\jp É´î]l±ÜÔÆÓïªÊ°ƒ±»$à!ÖÔ0,í£«¶ç®ŸŠ à-8’öfμ7_ǵ#WŽ8tkzœJ()tàæýP´$^Ø-UD˜ùèÙŸŸk[øQ(e ÀÒ>ôÊ›jh:_ÒÜY-·cã˜JÅœ—K°[²gËî²%!+MáK¹,Ø|*`¾ð{ ÓÚß®ýRL¾Ò†ÀþSU¥˜ËÆÎZƹüí*¼3Æ´±×UàUJú²é[÷^$³þÔÕ}ÞPºOÉ®È|åëEÝë7Ø ·7_J½YŠ TÌ&OKhYðþ¿BÙV¥ïëaЭì@áp vûŒQÜɉ´-¬~¾]sèÎÎv¶…7=ùoÁÍ×9Ó”Ù§0³ãö…j*àØîÎ[¡º^H¿’-=fŽDéw®üigHt²ÕµƒgánŠ‰`ó›âÿEûÛ endstream endobj 812 0 obj << /Type /Page /Contents 813 0 R /Resources 811 0 R /MediaBox [0 0 612 792] /Parent 798 0 R >> endobj 814 0 obj << /D [812 0 R /XYZ 132.768 705.06 null] >> endobj 815 0 obj << /D [812 0 R /XYZ 181.42 357.494 null] >> endobj 816 0 obj << /D [812 0 R /XYZ 133.768 146.007 null] >> endobj 811 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F48 10 0 R /F81 71 0 R /F68 28 0 R /F110 150 0 R /F104 657 0 R /F59 24 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 819 0 obj << /Length 3261 /Filter /FlateDecode >> stream xÚí[K“ܸ ¾ï¯˜Üzj=\ñ)2.—“µãÄ9lmm¹*o’Òtkfd·[“–Ú³þ÷øH5û5—SÙ“Ø ~ÙÅÙõYqö×ï ÿüñÝw?¼ÑôÌ£˜:{wuF9'¥ÒgJ–„qyönqö~öî¦éÎ/˜,fës^ÎêeÕ7íÊõÌ+߸¬ÝsQwóusY/ÜϪ;ÿ绿ÿðhF³¥èÙ5DˆÒÍq冉x˜ †i`Ôøµ…“0̉¦*ŒùÍ  ´H¨ÉÈç‚PIÀ/Y>ã4#’"…–aÌ2D(#¼dGH#'ÒELÉu`E€æˆ0Âb9™91ÀM4ê¹ÓÉxn²D°­¹ŽÑЇ¬šKë‡gxÖ„3áYšh@I¨„z‘™ÅZ ‹É2SH"ôd &r(U†ÿÊ0„±ò^‹˜H¢H)Y¬×Ù¹TÁNå6ч&%4ʳfb4»—™l‰Ã3âì^¾cy#ú>+Ž”O¾º{)@àŒÜœÉbŠ0¦ÈÒˆÄ| .Ä!.ø¯¥‘t ôï ™ V@$)$X˜Š'‡ë{;Ƙùè‘Æ4ÑrqØZô¾uJ¼ëñgÂmä<_òÜr}jäÚ²*z„qóCÆ­’è>I“]à'dOkJó ó9yAÄ‘;ÞÁh3]þ¨ëq8}­õ˜=)=µÖì:¾Ø¸…ü1ÃÇ%lCB'%\¹?µ="h­gýMÕ‡–ïZ´ŸªfåÚíÕäåæö®²À!·6SŽŸœÓbö¹^/«ÛÎõÜ5ýÍ„ÌúœÊYµºÆ±õŽ©ÖÍõM?Ì’˜”#}ªÎÍ‹(.°¡fŸ›yíº€œ¤«žÁoFg—笘mz÷ÒIØY±+Hmd Ÿ«$:väö¬©ÄØã$ÆÑMï»Ú»U^†D܈Y»vOÇ4–ð%²døø²õœA3挜_”‚A6•ÐèÜÇNMö‹höÎõÙ$ËÏï(^µî™ã31®ŠÙmµîœs1.ͬYõ­{Õßµ® Çt° ‚²ÙÏ™í‰rJ °w»AÉ$¦'&] 6 ròh™¥ÊÑŠ%Di,„ÌÂB{Ñ嬻Á•³üWÈ*:înšÞËïX€Æ岚£‰}tCmï¿jV>̨ñ(L‡ êåËl\6jˆˆÏì"€SSŒ3þÐÝÖó¾ù\/¿œK9;à°¸oW°8ÕÒõ=sÙòO¢oªÏni©†=›»@Qzš¿d4ŠÉU™Àˆ¢È„P@sylãµs¿È%ŽÀ"<Å{G2Ew0ÅÍ1\ ±ù[¯ˆG©Ð{H3Q2shǤyuD;û“ªCœR8ROƒ]¿.T’G"º-¨¤žº–_5Cý¶‘ëëôÁЕߺN».Aaô>¡¿‡ö­Xö{!øÿ½¬Ÿ®Øõø…à“Cå·]¦ßÖ÷?^ †–4{w^@^Çõ½vGJ ž±Ù‚ŒÀJ¯°iVÉ|šõSLÒzhüZÌ.z×™¦ËÖ1ÉÆÜTЬ¸†5Í¡sAäU&Îw]öª1/]õiàJfí¦$\˜‰Z@»±»â¹'ŠªÄ’%@½ÀJE£^ä „Ü¿³F+€ö9°d&«- &¯dª-zŒ¶\¾*ù%_r` ¤äpÔT¾Ðô?©¿ØîjÙµ®ÀJHþËPð*Û¬*?‹grN2(…òl”+áõ¼¯¶PÀÆ’“y› E!³>6­dÀfrGýt¶¹]T½;Åg3¬ag³š/7‹Úuî0ucñãvÎ?qZeTŠ¨ÊÖ•èˆN¢:¢LöP¯Ç†ÔèÁ䙓Ï:¡Qu7Nx °>rÖÞùOVÉXjãÂõÆÛs¦@!%-Óz¿JQˆÙÊŽ½s?²+È £æ˜”…ÜZA Ú^~nÚM·üâ~ö¾²Ø5¾e{ç˶sVE!ª´®³AÃ*ä@iÕö~4’¸ ÕÉ…½òX…@£«çí*¼Œc¤SŒddEª_«ãvj|.Z[üT~rì²E1Û²åPxÖ9·*áúD¿räZO6·¼µàYÃNã%E²e ’íˆJJÞÃz!|*YÌþÖÞY+²uJm}ÔäãTäç*„ûùo:Çþð‡«#‹!¸Ø'KbU­ë—DâíM%©)#öm(£–ãr3c×C©YbÙ)DŠ8FàO{4CüX‘‰Š  §Îé>F×Ü ÛŒô RŒ´ëæºYUK_€Ö ~³ï<KËá*ñ=õ6@Âu¶î™Ý— NeY3íZÅz|Ÿ?ç÷[³{Í5zû,òñ&KÁ =ÊÉpVá˜YäJµ Ü0,ÝIµÏwˆ$êü‚3ÌÁ¶4ÀÈzÕ‡u~Õ~ºÝôCLž¤xž¤AÖ @½­…œïüu68CÓ†kᬠŸ·m×5—K?ÐÅ>hlºúj³tm;¸™Í-~¤3il¬œ3kèaNë þ‡u$»r~®+wVuÍÜ_]ô^àÍ"×Ú«¶Bʸ÷öðl¾Yüêþx¦¹ÊEL ð¾È,y’ŒŽ…·à€•{x°ÙæÈÃn ©cøøS6{Sã~Iü©ºížå²Z0B9Ú 'ðˆÙNÀ¿&z¬{ÜoŠ­Ô 5 »ÅèÑÖC4Þ‚ÜJh“T}&ŽÃ¥FÛf&Ý<b9O¼çC.åcDðdïxž»¹D® p(XyàÍ£õ10†Ó¸áŽëm3ÿèZÖ2XŒ“±@˜cÛù›õÎíÓTËJpÂ}#ã4vtpšÖE!ó•êxã ×y'Fªê¢¹œZÔ4Ð B©Üs–¤,©D£Þv:e®d= ^(R³lòPÈW¦&ž8‚ úT]š¨–ãÈî¿ü1ô1€‹ãúØÃÇýÉöùò,ŽBH449lQ€·Êp•œL÷x0éa@©ù—<:óXé«Œìc÷çŒ{›Õ£1~Ÿ‹öŠH#lÙ±2)ó¥‘LÈjã“ÜC¹£l¥‚¦ÛÁŒ§xÿâÞ§ïÕoo×m5¿ñý­{Ú?AÀ³ÛÌçu×æ±™õ4£l¿ÞÌ‹Ælâ\ù×õ@Ñ^½*dHª!Ûhº›Õ¼÷\Ò½¯,Ê»Þ ¦ÉA!K°,ý¥³tìÌm Ð?n ðÃN ŽÇôÞ ÞÕîÍL  ´’4KùÒÏ°®o×u‡ ÌBHœ /øà«Ê=ºfu^¨c?\†",Ó36âoå@Ò 6©Âà]°Ö^8£)ãÃâ0,KR5{{åúÜrc UÕøëe æ›v¹ÀkSœ+pÐåO ¹tͺb,IŽÓÕ8Ÿ£½Ú|º´÷Ì m106Z‰KÉ!'Tfr'É]¥£á~MMÇö¸[vÑ,,‡þ–ãÊS¾ôëz±™Û;¿xÚ«Ô,›ýÔ"¹;Dß9œÊ4øµ>"6FÕéSbãt„hÉwCº…‡1ÇvMýdÌ!¹y¿ãÐfاÞ.Â-4Î<²I4\°TÔ-?<}>§èÏáK;ˆùªó9øåÊ>ÔºÛo¾ë&Ô ¬¤YõþÓ,Þd$”,ŸF‡SØÊi¬ÃÀüPöòAš7°;äËYŠ°R¦¥üf>ÒôÖ”MvÜ¡Œí×®X˜pK4cI°JãÅî×öñÜo€·è/ZÍþq®ÝÔ/ð.—nÈ­]Ã;«ÆŠi”ÚOŠj†p1Ìü*3³²)Ñ¡ë œ–‡òœ´,ßìOÓö^OGkj<»œ˜n‡kÓ­P³Ã,˺¶¶VÉöz¶¢£ggæ@T¦·?^g]@‰vû6 ÃjR) {/f‹: i¼³cÈ_¸W.þ¯;_·Ð;2K^1žLŸ¢Òi.Œh;E2ª$:ÚNódÒHÜL¥s'oíÄM'…êÌâЃµ½ˆ×—»ŒD‹=±‹[<Ë Õ’Ígô¨Þ‡8²þfÙ®Œ¯¾ÿcj ‹pâ ®+&±†­±-—c Ë0„ŧYž¢Û\¡:^õ½û7F\ƒùŒóTËÿY„2£{îÀF®ÕÉYcE(ˆê@g¶8C` ÌèM¨ÿœ1'Mœ óP.vÿ1 RQvÀªðßÑÀ×ù %jrQ. «7v÷XL ÿÃ?Üm.GñZö8Õ¥½R$£þòî»ÿJDÎÛ endstream endobj 818 0 obj << /Type /Page /Contents 819 0 R /Resources 817 0 R /MediaBox [0 0 612 792] /Parent 798 0 R >> endobj 820 0 obj << /D [818 0 R /XYZ 132.768 705.06 null] >> endobj 821 0 obj << /D [818 0 R /XYZ 133.768 389.303 null] >> endobj 822 0 obj << /D [818 0 R /XYZ 406.96 303.952 null] >> endobj 817 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F81 71 0 R /F68 28 0 R /F48 10 0 R /F110 150 0 R /F59 24 0 R /F56 15 0 R /F82 101 0 R /F90 654 0 R /F104 657 0 R >> /ProcSet [ /PDF /Text ] >> endobj 825 0 obj << /Length 3206 /Filter /FlateDecode >> stream xÚí\Ks㸾ϯБ®XX¼™ššìÎfSÎ!‡”«rØÉ#Ó#feÑåõúßo7>=lËc{Ê›A¢Ñh|ýuƒ|ÐÉ?ÞÑøÿ§ów?ü"íħ¹žœ_N˜Äh;ÑÊ.ÔäübòkV.ëu‘_œLçYu ÿ Ë>SEOþ{þÏ~Qº÷©‰7ÒðäÇ¡Ê  ¼M x #'SÅUv~bivw]ÎòÅâîD«ì4P­çáꢺJˆÂ¤#†³¦¥·U4qFX¬¢ µv2eD:u™X-Ù¤W)_Fe¯òe¢aÁ°Ç·Ë‰ºßnˆÿà@øÀ¥ N9x4ª¢A¬çŪ¸¬V¨QdzeQ ¼Ndë*”ÌæÅì·X4Ïס´˜—ËPzè|¿¡ÌëŠàíñnÖåº<™~?a*‹g‹ª¾iÏW±ô:_ņàE¾³ºßY:진>4‘`ËaÒ”î‰`vŸêMJõŒÑ‘îM_÷ïI"wYº!Ì &Ò)ôŸº¬$ñ—6è’;µƒWa@ðjUÔ7‹u?tv¹#ÚgÖó:\âØø¢j< Xº(–_q®à{¶èKE¨V´¿%FÈÎe×®¶`‡iê°^Ÿ½`ûÅÿoòE°]îaÒŒlL”+{©hk–XèÍ £YâecMùOQÎhj÷ v Ú9(ËÎ.ƒDËj}Ú ¼ EÑólU\Ë5ôØßɯ¯WU>›‡Û³| ‡;_Š¶Æ¢„éêĘ%Œ‹¡‚`^š¡Ù×Þ€GfóªœíRã„[ùxýHâ¸íë‡(10¸>x²¦ÿœh#cÿu¸w†]”G«‹b.½ÍÈàBðwþeQôï˜J׋|V¤$cš(6¶t±#´D3Ó?I|â”$w¿Ü%ætJXÞ4ø 3/è‚ÒË8R[¨s}@9ŒŠ¤(‡ÙwIç`u`þ1í,‚p*«ó»± ¢¿u'š® O&ÚMÄmM˜a£y?D4¸h¹à‡$2ÛÂË– ÂõMê^8;2`£y˜M‚l»”&ûÎ㈱â„vÙ—N³ð®‘^7½ ¿ÛÁò¿®Š|Ù”çëÍzëÈa ºèܾ¡ãº£•gxÌ€ˆƒ‘92!8¿‘¡ÿ«BwBk nÔY"ÁW"ójý¤.«e(K;$j·?4¬xV;-—±•<ü»YBQ„º eå:üŒUd媘­½ià#5’®X0íë|À¡pÁ ë¨É¨„Æ/(¹åyTâTÚ3Gü•£mÿŽªò¢©€ Æ+ßg ÷Ú°ìÇkÇ€¶7iŽ©¤Ô³™øÎr.Ë«ëEà÷ë 0¬7jÓ‡¿øþº\~í¤BñG!/ ʼn¤Mà†=ÅYd³ù ¦HðÊGyzá0À§4ßcïBí±÷Žo=ÔÞ-1ª…]ïÌ@äBѼŽ—=lŠþ(¯¼ûuýCÉ.å`H¦e“ñÅyPÁ`î” Cˆ6rªý†ë¨f¸ÚÂW5DÈB߯¶Xʦ¸ìÞ3n‚²Ýãf¸{ œÂ|£â£ýlà=Œ¢âA®®+€§|Á¯uÕ¹¸0^àwŒè2 ÛÇý4xYÙbzãwð•ER­%Š¶¶ˆ8’ÈG*¢ºiÓðþFÐTŠ“Ñ!ì–y¶×­Ø£‚5 KÏ{ëÞ†Yåo³¨³E˜W¨b¡º‚ñŒ…·%D;‰X–Š¾ý.³vAW>êA£X€ãëå\‚›ð‰!ÒP zåìf‘¯·NCa ©|?T¤£0T† T2Ìø˜:JhO!ÅÎl\˜Ý1>@w%Á;Ê_”˜awÇÌ–9"5áìA±‘5JGQ&çIé…{r]¶«Ú):„Ú–ËÇË.‰VƒÀî3ºGÄîÃæÇ€Vo¨óCBî%¼OŒ‰ ªú3š&ýL h.Wl8_^œ¶>·„YÑ[Bšh@TÛ½¹‡ÑËǽØgô,eõéqBR¿ÇzÙuˆÙ«½fÏïmöiÙ¹&VˆÍ^böêp³?Bì­v›½ê‹´ÍìÅ.³—¼Ï¢٫=fß- 4?ËcÁªøL)_;9§£÷sN¾é¯À‹ojtjá}ÜNÀ 3b XPÙX±’0Uö—„ö!~H&‡sIü>rt@´ÂÁ¼däç´ ´Þ—ýÔ”áÂK”ñgª÷eù›/U+Ä$Öp¾7½C¯ŒƒÑ‹ —¥G$¿›S@8g<hÇ6q®«É ÆÒ ¶äÓ"" ERÈ•f ½½÷k1ÇØV¸®@4Ûô=É9òq=™:ŸjÞ &½ÃbÁa’ëÝ’‹I¯ÒvÉé8<G^À„Aå-p}8ä|ÛòV¨§ {ØžoùSò`Ä5ðã>æ±ÄÜü”°ÁO ûýæõ^ ,?&F£^‡ìmp«ÿ LäÍÿ'9&»'™%?r€YkšqÚ”|ÜØÀMŸ£öᦇËE@écˆ¾He‚pmˆô!!·ìçoߧt)dˆ¤¹íã‘Û¹Ù.àµòÀ-øñ€;¹°ìèÆ:.ªÊ7~vo0ü40lŽMWEast<’®è)\òv îy@ïÿñPe>±ÿæ„ÁDóqù'~Ãâ7,þÆXì)1?˜³§ˆÀ·CÚ cÄz'#– ˜% ÎÁ¾FçÀžQ•Ûœƒâpns¥öwë9ß7½ŇæSвp„r6X~ ‰‚)0å€,¶ú×ÄÎT(0«2Ð.‹ct?¨–á;š]¯ªëbµ¾Ûý‘’%Öñ‡,Í«ÅE}ºe±*ý%§÷OÐÚTp¢Œzòå$ã· íYNòÔ(寃¹ôkè³ÉÛ|¦4ý©Œd;c›Î<ƒÂÇ+¹büÍýhD¸CáZ‰¡k,¹ì­t­Kþ ^biõZÇ7l6äïuÈí¼8¦Ü¨±ß<ƒð4ÉÇÁœÒ °Ÿ|Ò™ç‰z{¶üÒöö RÂp|wÀC¶½Æ?Ùì[Èöè8¦£bò8qsÝ»^ÅüJøŠW‚ ¢Ì)î'ëÓÁ5 1ñºz:$ûxH„êC`ê²)·ÀÉð¸`ÌÂÄYr;/›MåÃX¿;é6ÃÝgkÂCX¿”~3÷A¬ßz*CBÕ¾Eüûx—gN:>˜¾Éý*Ëüž½Þܪ¼/—vÿŠ’yA@!•ÕØMîŽÿ”:ÈÏšxzæäÑcxìk„šø9ÎaDV ‰ì2æ÷Zþ6Ë©æ&k»œ*ïÃd¿¿ö&û2á &›`*SÄT«È` SbÛ²}öÙ¾'!Z÷ÏöÙT¶/vf³úUY¦ŸLêsmˆÄƒTéKÖíœV´§ÐϽ³~—{‹â™lPˆñ–ÜÆJ·'ŒfùrÝÔ‹ÅᤰPèi³¢¹É‡§Páî*_¯jå[~+¥ʵqÒ›O¬òg½~k—“Ín(ö¡Þö¡„ÕM@ExÂU¼ôg àÿËxËïÀ† ¿aÚê¸Q RGÍ5Íû£æüS(ùMäõ`{}“°ˆÈqûÿ"¼ÜaÍÙdp6–ç³5îå¤4;»ÄŽñppI<•«(Ô¯‹YµŒ/IJå„ð߈ÿ·„qxÎ¥÷ßbŽÍtç8´‘âÏpJA}OMÆzóÌ@<àÀ:†£zV…~ƒµ/õ§1`Ѳ˜u¯JN¼e½%l#.Ãæ~¼ã Ty­‹PÔ“ï4ò¦NIð‘CdNz(VõŽsÎ4šãœ—b†g1B¥ö¤Î‰Ä*@¤qL©A¥¿Ÿ¿ûÏÁf¶ endstream endobj 824 0 obj << /Type /Page /Contents 825 0 R /Resources 823 0 R /MediaBox [0 0 612 792] /Parent 798 0 R >> endobj 826 0 obj << /D [824 0 R /XYZ 132.768 705.06 null] >> endobj 827 0 obj << /D [824 0 R /XYZ 440.172 513.773 null] >> endobj 828 0 obj << /D [824 0 R /XYZ 192.897 469.938 null] >> endobj 823 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F48 10 0 R /F56 15 0 R /F81 71 0 R /F68 28 0 R /F110 150 0 R /F59 24 0 R /F104 657 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 831 0 obj << /Length 2769 /Filter /FlateDecode >> stream xÚíZÝܶ÷_±}Ó¡· ?DŠti›4-Ò8WôÁI­Vw+ŸVZKÚ\®}‡êsy·ëÖ.\#O¢Hj83Îüf(ºº[ÑÕ^PÿüíÍ‹/¾‘jÅ1RòÕÍíŠ A¥WJ&„ ¹ºÙ®ÞDœH’\­¥4úªºúñæO_|£âég2&ð%uóÿºÏïRœ6§.z˜¶.‹û+F£üjÍ%Šý¡Ì÷yÕ¥]QûUb½2Ä(®ì×k-‰djµfš‹ŽÆ?vE ß‹ØDÝÎ7öiQa+-ïê¦èv{x…êÛ©‘*ã”h÷L½ ,£Y?á*ÙÕZÑ$*Z$»ÍÛâ®Ê·žŸY½?;ÏRZùÑcµÍ›ôphꟋ= êú‘5K¢•„†Ó.‰’ÁŠ]“VmÑW\F?]1¹~eeÝ›üÞ8ë§ë(=v»ºiñ[«Y\ÎÚ¥α“Ð#ögõ±Üb3-ÛÚS$îÚÎƵ{9ÖŽu:ç…k‰OG„u¹°šUWИ›”ú÷É^ãJVB;WÑ&ma¬"Åت¢èÜæ©ã]²è/u—÷¦pZëÁÄ”XL¸1c03'®I’$ý¬²Ø4ióˆ+xU{ŽO¥Åi`ƒ4dÊŠäRSvÊO¢ïq+ÐaÉJÄ\CŠÄÖ쉛Bš8žO¸ÙyáÙsʪë[…çúëwÇaÿPŽ‡É¾†Ï&8 ­Ø9øôlº]ã#GEÅf“—ßzÉhšè¼,›Æ†M+† ¼i=ùÀÑ€]ó6·æ1øH罬ÞÒÙ<¢ïKññçb»¾­›=´bì›3­¦,);Á"ðæ(†Ô:âz`=@üªdûUÐI‘ ûð6Ä ¡ZŽÖ<Ñ‘Áy,6SR`£T;ÆD@Ù†ÐxpÉ/ Í8þ.À!1›Øhó”ˆ!ŒŠç„²«LˆÐСÓDÊ‹uû #ƒ¸KC‡sýÏ°uŠÉ) ‚ˆÑ€uà ("Í°È!°HB’X/veF!!tÔ×Ûa‚"&yà†Ã ±‘³u¶ÄÀ‹N&ªŸÚSÕŸ¬&B«I3[-t2™ôe`)F;HöçÀZšh”Œ1:ÛÇd&ZfäÀã "ëç©?=U(8€dظ»0_\ 3~_<DTÐÛxøõ°Ë›< .qF°çlÉêk06€5w6è ­f^{Ï@c[h1 Úw‹ªBA#&rŒ ßWDÅrŒ‚§4`B²<3 àÄ©ö# 4[Íœ ¨}à#m¼˜Ø¥U‡oEÕ9„v׫u“u€ìˆ- nˆâ4$ÛH˜#tr`U„ã¬2$¥ ÊKI2úÊ}úˆ´7yÈÑÐÿ 7 n~lô…û<­Šêéz|*Òj¼ ˆ·yTÕø<N'0kS†ެnš¼=ÔÕÖRó 2>¼¦ó'ږדe'f±Cw[ì‹2mÊG|…à´¹LJ]lsR$7Ñ÷Çl‡d-ŠµÏ0†@ÜÃY?ÏBd7ÓâÊ=¯'PàØQ67Ä–¨b!£¶kå¶V\©¢²¶9ŃÓ' ¢ôÐèu M§ãÛŽxâфƶxVÎáLœ‰õœÓ—`³«ÌÓló.@4†U¨IPfÁÈ@Uòš³p%™î†’þÄX©NÓ,ðÌ9¢Î<þQÞ<à€e$jpf[hYNä>ˆFF‘B`d¼îM 0“A:f,Hƒ¹f KLÆ­¹†.ãdãsH–}$»ÀIFžWœƒºÉ¨;jô¬«Ïa]yëšsX—ú}ÆÏc]½šLzë²s`—‡–;»bºÜS`—]vã‹Àn|)Ø/»ñ‡»/CšÌÔÄ8aª_nµ 4ó¹_ÆèAY´­}’ö(ábÓ ûÄZ˜kËzlŒ-Ž6¨¹žº…†-¤å~•‡¢ÛõÄëöd½Æ}þáhõõT;åèÄæt2¼™ 7W÷¸ì´t–.t{Ü´]~ð­ÝíÛc•uí Ñùøb¿êãyµ½»°îëVMrnúçŠÇÔjö€÷Z¶ûl$V^ê1¢íò8Ü6ÍÀ³Éß‹&·ëÚúqÑaw†_K‡d-•,-³céêeø½OqxŸVU¿Š‡äø@~jÕ=¼ÇRíÄ*{ý–—^h9mâÛ›¶È~\ªÑ—îN•ð7H2Žûty@G«T{=k9±HØlfƒÝž+RÁãÚ¬vûí4'ƒ–=}yw]ú¥úó«¥c;XŒ÷ cQ»ó~°—C@Xò &6<úÖƒÑ5W1u)Zì—i–›4ë/€&&¢Å¤Ã{7ž^.0ëû1%ÞÎ÷ÊÇ Ž©`•5x!Pú;<ÛUÅ»£¿mê=¶†OÚtŸãÜCzÅ‚ÇîÀ4̧˜0ÅŸå[qgö¹¯Og›CîU£§¾mÁý%¾ ’þ¶„OnK¬“½A2åjÊþóßXªS´4‹÷³Êàë`€¦ÎÕŽ…¦"W9ÄñdZŽ ãúþ>ˆ»˜ó»6T€× Þ ±IâëzýePé9:vå÷ß6~²ýiyôßÿ+ótCF?c¸ ‰áÏ' |„I…çï©«AԘ+¹»žNrrí§šïƈÀàVþ¿»)ø€‰drI"™ü%’ô£%’â\")>á+‘“DR\œ7â‰ä/—&Ÿÿ¥I(Äj’y¦èÂ;Àü½šÓß`Ðýc]:ü#cqS UÂZé³QÕ>Vä}Âb±°]×ÙË{Ÿˆ`JÀf%ïÁ¼œ·¸$Æ!ð!!·V ô±°lM‡sú&ˆG¹tHGñôÏ£K*Â6鸹ÒÀ>Jh/oö9úZ°r5æÂ{Øåö¾Âf:Üe:îÙâ³Mo}Fîp.ôØ2à· °ª?¦ÓŸ*¦³À›¹<Ãé!ÛåÙýX¤p}·õ ʹiöNÇýã¿O½f!Ó8Ô-A¸¿YXïšq8‰Y òK~(yŒ-,‘Ÿõ]^C~2º¼âÆR$á~Sr“~ò&ˆ/ÚÌd^°C".`Ää‡ÁUÝÍÒýc5Ü°¸Zœm` ÈVCRÈû¾‚Bà]¿É¿=a®Ï‹àµ×xÿ=ÔgÇ ™0í%ö"{-tR.^à–p>¨Q‹ø+ýϬÔþ¯¿§•Îv \‰°F#©YÞV.XV·L6 Ž BE¦äs{D<Û‹·Ad£–pJØO\`žqõ_Úšü m:¶&¶¶î Ðït³¾<—}½—¡-~²*kÛœ‚Çö¾zW—[üue¬33eP41Ñý“j6ëë›ÿØ›B~ endstream endobj 830 0 obj << /Type /Page /Contents 831 0 R /Resources 829 0 R /MediaBox [0 0 612 792] /Parent 835 0 R >> endobj 832 0 obj << /D [830 0 R /XYZ 132.768 705.06 null] >> endobj 833 0 obj << /D [830 0 R /XYZ 133.768 667.198 null] >> endobj 834 0 obj << /D [830 0 R /XYZ 284.553 487.123 null] >> endobj 829 0 obj << /ColorSpace 3 0 R /Pattern 2 0 R /ExtGState 1 0 R /Font << /F56 15 0 R /F64 23 0 R /F48 10 0 R /F81 71 0 R /F68 28 0 R /F149 668 0 R /F59 24 0 R /F110 150 0 R /F104 657 0 R /F90 654 0 R >> /ProcSet [ /PDF /Text ] >> endobj 1 0 obj <<>> endobj 2 0 obj <<>> endobj 3 0 obj << /pgfprgb [/Pattern /DeviceRGB] >> endobj 836 0 obj [630 569 589 505] endobj 837 0 obj [636 636 636 636 636 636 636 918 918 636 636 636 636 636 636 636 536 536 636 636 636 636 847] endobj 838 0 obj [636 636 610 416 374 527 466 588 466 588 636 636 636 636 964 964 964 964 964 964 636 697 587 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611] endobj 839 0 obj [343 343 333 333 371 371 371 371 328 328 402 402 232 436 365 365 356 356 369 369 353 353 371 371 371 371 446 446 433 433 401 401 382 382 363 363 371 371 371 371 562 562 448 448 419 419 383 383 400 400 363 363 363 363 363 363 552 552 552 552 552 552 552 533 400 400 400 400 418 418 853 1255 390 640 1255 1691 1255 1691 1255 1691 808 945 390 853 853 853 853 853 1323 1355 640 1255 1255 1255 1255 1255 945 1355 700 1050 1400 666 1000 1333 343 343] endobj 840 0 obj [610 0 0 833 833 0 333 0 0 0 0 0 500 465 0 0 0 0 0 0 0 278 0 0 0 0 0 833 0 0 0 0 676] endobj 841 0 obj [593 508 518 465 390 421 495 439 284 434 530 535 460 437 524 508 679 474 525 550 555 617 691 481 587 822 499 473 569 964 964 964 964 319 319 418 418 500 500 500 500 500 500 500 500 500 500 250 250 636 441 636] endobj 842 0 obj [531 0 0 747 747 0 278 0 0 0 0 0 500 365 0 0 0 0 0 0 0 278 0 0 0 0 0 732 0 0 0 0 636] endobj 844 0 obj [500 500 167 333 556 278 333 333 0 333 675 0 556 389 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 214 250 333 420 500 500 833 778 333 333 333 500 675 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 675 675 675 500 920 611 611 667 722 611 611 722 722 333 444 667 556 833 667 722 611 722 611 500 556 722 611 833 611 556 556 389 278 389 422 500 333 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444 389] endobj 845 0 obj [525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525] endobj 846 0 obj [636 250 636 471 636 512 636 636 636 636 636 636 636 862 497 497 636 636 636 636 636 636 636 636 636 636 636 636 918 918 636 636 964 964 499 499 964 964 964 636 964 964 550 550 964 964 964 636 347 853 536 536 634 634 0 0 587 587 640 500 908 703 712 712 639 870 718 648 860 622 669 704 876 650 775 796 749 1080 822 703 709 703 680 679 678 897 892 1202 738 797 865 654 654 654 654 654 466 466 371 371 371 371 328 328 363 363 200 400 499 550 441 264 703 727 664 305 654 654 636 636 500] endobj 847 0 obj [333 333 389 584 278 333 278 278 556 556 556 556 556 556 556 556 556 556 278 278 584 584 584 556 1015 667 667 722 722 667 611 778 722 278 500 667 556 833 722 778 667 778 722 667 611 722 667 944 667 667 611 278 278 278 469 556 222 556 556 500 556 556 278 556 556 222 222 500 222 833 556 556 556 556 333 500 278 556 500 722 500 500] endobj 848 0 obj [643 722 722 643 722 582 696 731 738 743 600 0 0 827 827 0 278 0 0 0 0 0 500 384 0 0 0 0 0 0 0 278 0 0 0 0 0 778 0 0 0 0 636 0 0 0 273 0 0 0 0 0 0 0 0 0 0 0 0 636 636] endobj 849 0 obj [525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525 525] endobj 850 0 obj [556 556 167 333 667 278 333 333 0 333 570 0 667 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 278 250 333 555 500 500 1000 833 333 333 333 500 570 250 333 250 278 500 500 500 500 500 500 500 500 500 500 333 333 570 570 570 500 930 722 667 722 722 667 611 778 778 389 500 778 667 944 722 778 611 778 722 556 667 722 722 1000 722 722 667 333 278 333 581 500 333 500 556 444 556 444 333 500 556 278 333 556 278 833 556 500 556 556 444 389 333 556 500 722 500 500 444] endobj 851 0 obj [556 556 167 333 611 278 333 333 0 333 564 0 611 444 333 278 0 0 0 0 0 0 0 0 0 0 0 0 333 180 250 333 408 500 500 833 778 333 333 333 500 564 250 333 250 278 500 500 500 500 500 500 500 500 500 500 278 278 564 564 564 444 921 722 667 667 722 611 556 722 722 333 389 722 611 889 722 722 556 722 667 556 611 722 722 944 722 722 611 333 278 333 469 500 333 444 500 444 500 444 333 500 500 278 278 500 278 778 500 500 500 500 333 389 278 500 500 722 500 500 444 480 200 480 541 0 0 0 333 500 444 1000 500 500 333 1000 556 333 889 0 0 0 0 0 0 444 444] endobj 852 0 obj << /Length1 788 /Length2 1500 /Length3 0 /Length 2055 /Filter /FlateDecode >> stream xÚuR{<”Ù¦•¤U´®©¼’v˜›‘Û \ #÷‘2f^¼ï0ó#dRr‹PäRÚ]J”™.$JI+ ±Q"“{¤$Iø j»íg?çŸó<Ï÷œïó}ÎÑT§8¡É –¸“#hœ.Ö`#<€ ‹•ÖÔ´`ƒ4bÁ–44px NƒÇb± !Cцb'*sµãrh~ X¼žHÀpÒx,À€èàúA°4fázØ—àHK<ƒôM ÙQ%jºµd°`fÀ}Eç¸L¦=-P ¶þ¥Ò!fØën äç(;q¿Wm¢“a?&`—(ˆ³â „Ðý_“.ñ.0d3!¤°8ÐB"‡Å~§9ûCô0Èáį’= è"o®_' ¨XQvï E÷í>‡Â°íf€Kþ+ÂŒïc…»ÆÖÉÂÃÑZ{ñ ¥0Å€`?O$46›&p"DÂq$²Î@žhXŒ.ÌBDG€ . ø²ØÒ /„ÃßEn ê-@èÿ˜¸€™a=€ br9‹Ä?=RhŒ8‡ýõ‚éEŒ[ÂN›utƒˆÿßKìhâybu±Xœˆ­o;¯‡`nÎâ…£‰ú%Ûp€d ù::—Í¥¹øEI~þè€ ¤Kw´³èÛc®ÆÜúTFV E÷5Jv¿º},Åã~<Ùòg~¸ÿîg¬Z‚ͽ%Ê ™”gEqÍíªZcŸóöÞɉ~™a‡ˆí¸/4G<œž¸ãnd°Öù5égʽMuÜ°ÆÛSÂóç4·ö/±úw —û gos¨#@ ðëGYõ U$‘œ{{dY‚‡úæWÈ{e“Ö²=³¸Î6.M³Ëbô5fmä‡Ó›öÆ‘ 祥ªä7§zlp\Þ 0L(â^­ ‘ º26“\ÔUTÙÝ=ôHÜð°a@£‰S„é–\‡ù …R5/ påo¤êÞ·$²f·Vv¦nLÂØŽ+ˆº·kòµü."»Î±Ï%Š&u.›ª£ µnZeèyÜ êÃ0Ó ú#f›Àú±†”Sæ_†+1æ“Ý£Ñ(=pÝhOu@pÎìç`¾+UBÉáD #ÐóÓñ<’RÕƒþAN§ÖR‡Öηµ$ŽAG3+·ï}š×ì)Ù(âyŸ«DÞ¡’FÝ)»²}µ¹Z­'“/E[S”'º_Sa·L|Êãß\9›ü˜X @éü Q1Ÿo ­Ww\özÄP ²´ <#gsåvF5ùeÜ»©ôÚŽ³rsJsw纖–*·þø)ª·ó Y³2*Çç»âÄúTs®—Ö^;ò£½¹ab¬÷é¹b5–_Yu¤sêþÆ—Â~±~ÉPžtù™UkmÃ×ÅW±¤§äÓÜuÖ‹s8±|¾þÏqÊŠY‡š7„`ÊDÒDµJt@éPu³ÎU‹3Jç9àÞ[~$¶‰õfß8ër…ê5 ËÓßÆSÍùUâ7"'Я>·Û<î] 3P-&µbc‚]¯FYÊhf"2ZøîäcxÇìôuVCª»)Ó²~W(èšÔ®àp5húÊT$«7ÄCØË%EÖR±©/4^ËÛ*Ÿ!Ú,ü´I\êœxmjØ>‡I15[ªÇo¿SÕe+l·òðÚÐ~Ö¼P²7þfuOMßûóF«·+KnŸ2õˆÚ¤FºR'U†ÙÜÿ”ªAà]Œ-ÍH:t¹y[™ÅS·å/žÅ '|\³?È®98Q·'I éùÀázݾÜà?J©Jmº>½•Á=ùŸ/|.~Í w…¡µ3¶Î9^ •²ËNñUDá3G4ì*—ñVèÅX@Ö¤Àd»é¨ç¡‘`N®Íx]Zb±ÌTú#_¾þ“Àü»»úA¯$›r­öm©F.´å|AþÃë‹ endstream endobj 853 0 obj << /Type /FontDescriptor /FontName /JSCYQH+rtxb /Flags 4 /FontBBox [-57 -203 813 694] /Ascent 0 /CapHeight 0 /Descent 0 /ItalicAngle 0 /StemV 141 /XHeight 461 /CharSet (/ff/ffi/ffl/plus) /FontFile 852 0 R >> endobj 854 0 obj << /Length1 769 /Length2 1030 /Length3 0 /Length 1575 /Filter /FlateDecode >> stream xÚ}R}TLi&䔯TBùx£¨˜™{§¦¦MMjLL¦o•®¹·é2Ý›™;™9’RæDq*«lµ2T¢²»±%1•¯ä«–|´SÂb#Š½I{çì¹ÿ¼ÏóüÞ÷÷üžßµµ3¼Qr5æGfBn@F)WÇáÀ‘ ÛÚúÈ0„ÂIb!Banf³`‹ A@(¹Ñ‘. *äˆd b;˜Ëå8³!€âb ¬Æ$8aÌh bH;ò¨"~HKÀdrº °£›Úº%JR@±úžB* @â0`7hì‰Ã¥ªÿ«ÇpI,ì„Š+â¾V"ÅÅÞ„DŠhÂå~¸CE8%Ž1ˆTŽ ò¡ŠÉ¤8‰H9> `Àô•‹‹×˜\8Ÿ¥’ÂÅ´»°ÏSÒCÎ|Ñ’¯`qt|Cï!r1FP€;„Ql`&0ý::àO1°Âø‚È°yŸùIô%Ä$ŠÀæ8D&CTÆ€iÄ`€Óæ•SÒ㲘IÑW@¼‚ÚbH™ñÀž`°i|,2@2N€ö$¥™/ˆœ BTñÿ:`í†q0%#×bá8JÅþ·DˆP2\1!¦yú:­øvTTn`À\WÀ`³9ÀbW§_Š2Ú§ßlÇàô®1L‰‰[n‘b÷´5•i5o˽­Ö3ô— ï?¬Ýš¡KçPsnlˆ]2:Ÿ}/-›Ò˜'ºS¬nº•håðìíåò3?¦´å.ÚO óÕµó^0 ë{_‘`3PÒRrÕ%okûÄçÙÓ'DGŒš»3üVß—³ŽG;Šúkå‘®O@Ðô˜XçZQÛ½÷Õ>1Ȉ°¶yH5D,7Ùa*‹Ú­„^í7Hs™Ý/0üýÕåjg·+yÍ"·¬f*ƒ%Û£3ÌOèÈÙúé«Ë°ß›ÐÒfœ@úFäÔ±3k’ô»¢ˆ§ÉÏt²–UÍ™»ÏSlú³Z¹X…§^žo}âà‹°OP]~·Q¡1™Fž2Œ9¾6ßbW½jFÛý~Ó^ËFFS§ý´»ÞæűÇs—~:[×[{+H×¥.NÜü(}âîé*«´¼M;ìÇ$³×YÔœÈú¹iŽ¬`sG©nŠÌóWCœå{ïµàé"Ôr\ˆë͇5Þû‚#=„þMÜÚ]Ágª†)nÆÝîÏßø>£ÒÇ8ïúºzÔØy糨;š|׌“³Æç›;¡íÕóû½»U:Ÿ0Þ‚9Uת!­.ÓÛù»æàÑÚæäwº°ŒYvÄçns_;6I`›BpK’ƒ¶ðs´G†_ÐÔ4TWYsn÷"½…’è”·×¹+K³_7>¿›råÃŒ$Š_~eÂ+àtÙÚp½»¯ê±]ÓË®ÜЙx¡—fu±¦Å$(»´ÚeŸ}‚CHý6+Ô=à\äèNŸÞKÊ_ªÝ˜nÛóõ!z›ªm­EêÓû·¢ÍËJÚNf>³Ïå͵ÙÜ£?4i¦´ÍqåoáfúæŠ7uýÝi]+Ž'm‹L=\d£Éó,–…½þ`mrÛWÛ 5ˆ¶vVð4}õÁì]†þ—5k/¦–_.šÓ>ÄD««Ð¼œ*6/H§à•ôqœ˜üée¼ÚCýÚÓ_4š-:pslOú$+‘(—O~0}Fwjôªï/ÞH©ºpí\ÙöTO­¹óHéèÒ¤ñ7‘Jw£ÉívöÕ»FÍ2uÂ%þÇ?–Iò<¥º³é³”GÇÄ™[·C~S•Î>“Ç:\m¬¬²±Z9×ä»^"öò-}•EV¹h¬»JØ“,Õl^hž~½=ñ¾>!Ïú£zâ½ÖŽ9ð_©ïž&ÚÙŠ ýÉ%%+fzy–´ o»¿ñ ²Èi`tå.Xšm¼èp}÷{sáã“N¡Ykâ?žä¿–#ÌкÊ5Ž¦ fïî> endobj 856 0 obj << /Length1 773 /Length2 1437 /Length3 0 /Length 1988 /Filter /FlateDecode >> stream xÚuR{ïÚ†¥Ä[±ø~ -Fð$c¢ @Ä`bLÄlÛ¶O2ˆ[3Ð ‘ $ L$‚" ô@sBËèN"!ƒ³XA$SPÁÔœ„!ÄD?ÁÂâóö0›L—y–(ð› „hÀmº@[²ø0/`lôžˆÇsf€€Á¢­?©ŒˆòÿuâpÀÀ dA¢€ïU{„Áƒ˜V0‡Äe ÚBbEƒ&`3xBp™w‡Y €Á /„ð$"ñ;Í 1ýaP(v|•œùÄD½Ñ¿NˆhØÑ¿w Ñ}{!d‚0˜Ã,p™ %@˜õ} h¸K!èÖNû¨¸¥.I60“Ï‚`@Þa 0F†P´%j] €btX‚1ÌGÐ+@  Ø|fqC$@`/q˲¡ß1Å òDÂ%âžh FÜBvÑä&-ト€ïz@,„û¿%N D‰½‰ÆD" åÑïÛé🇦RùâP<‰Bðd¢™9`jNÿC!S$ ñ-ýthtß0B·‚b‰éêä3-£ŽUDÝ™+³ÒÆ?TMôjŒÙè=Ë å:®L·û÷qêQÖUÍÖTÚóâèÇaÚ†ãsmbŸºÌˆ¾”ý9ˆœMã uŸ'›Ÿ®ã€:,¾ç‘YjìàÚ‰_\7ýxÔ{…·þEÎÏgÍêMFJþS°P-9´s.ϪaS´‘¿YeW*Äyau/5‰ºÀ;MäfïþhA!Êl낽ÆÛ¤G>ѦµN³I×’q–/Á *®MÞù[°›õ¿”ìÞøX]—"ƒÙÖk•íáQÿcý ã FOc•ð#ïëzžkM8¼ïØCŸ)ñVÙÓRþaïÏQC‡i…—ŸªVH7'ö½L=‘qØìÞiz_‘ð`"?8_.e¾ðeüV7gáA~ئ.Ëd“ýH8æE¼“:þÁe±#ÇTN§.%|msÉÝø•ù¶ºª~Ž†Q<ðMÍ7¡Ì¥ú£l¯2•B¿þ!'ÛŠÆó«dÓyçòWŽÎT=¹8í¨$€u¯OV°ª_àÛ²äF°øß${Ú» UèSó·­]òÊ;?d“{èÊvš ¡Vnñœ æÙH3Î<ýå]0 \»«ëë> º-‚±MùEíêA%‘‘æ3oŠÆpÖåIÑž2m¯Æ8×ò©f‡Ê‘÷}ßù9ÆÛ¹FyÝ”ur&j³£!%ªªYDÄm{ÍZNeƒÁ£êØÖCŽ›6´Ùq÷ïÃœXõI.tÜ¥$ÝìC)š“xaZw3úîv+z{ä¹*Ýk¹Yz\ÇÒª!qÅônoéük=wö|C.wÚ;[rë>Ç\-ýi|õs¿ÔÍü{3ÿ¬w+—Þ9ZéŸ0­6fPÔðbª#ŽN¾5ä4f‡˜K9z¶Ò¥<=îÜOÝþ •Ag&É·n)($}ŠýùRB@§Ï‰¢ô7Ï<5åºOáJèÚyÅò]O‡1ž[|û3³ cIí¥»Xr³3ra›(×xȦ‡û‘Ã!ƒm?ê+ oØ:$ƒ³6·yûoœ_\W}R>½ s]íuâh/±ú¶÷„{Lv°i=°±ïâ{\ÍNmªÝÈxÍÅž6ÑžÍ !ñÒ,:rsoSÚ<Ø7o˜£Ú³'m58 y;\qg¢æ:újjH÷xoB²DR&}ãÞÿá± ŸÑ•Ñ™•ó9ª dìöŒ3\{×kkïdÖ@ItÎig­Úi¥Âž xE‡šgUÚø+ãýÛðÞ”ÆÒ8åìnBiÒ=yj¶À»z«ü¡ |^s“Wêó]×¹§Å4®ØCÓÒŒO§¶‹m¶Ëjzܪ‚8–’æ1­7–Sk’\üC.p”ßHu0èô7ÿ5êã…ÀÜû’}k_ZïL¦œgbö?ï¼»ÇYwù¿NWÊ endstream endobj 857 0 obj << /Type /FontDescriptor /FontName /VDMKCB+rtxi /Flags 4 /FontBBox [-141 -207 808 682] /Ascent 0 /CapHeight 0 /Descent 0 /ItalicAngle 0 /StemV 70 /XHeight 441 /CharSet (/ff/ffi/plus) /FontFile 856 0 R >> endobj 858 0 obj << /Length1 839 /Length2 1158 /Length3 0 /Length 1750 /Filter /FlateDecode >> stream xÚ}R}<Ôy÷TÌD$Ų®¯J„1¿ßdŒ‡Òzn.cGy*ªý™ù¿ÌÌonæ7Y‡NyÈìzZ•l]²öpbÅéÁz¨e»8„J(+›y)®œÎY{?d»m_¯{}ÿù¾ßŸç÷çcmÅÝOóäãQ¨.&h°#䤄B„Ž0ÕÚÚ[Š"†‹}u0ƒ3é ‚BÈüp9¤[(G.C‹à À.,ˆEe@€ñ… 01•¾˜Ÿ-ŽÆì¼Ìóå’Û1T*#‹[²èv@–äãba<à£Ñdœ\( DD(°]êë7fD„ ãÿCŠ b`ËAù˜\ô¾•M BŒç)Q-S˜ÌS |.Fðb@4"”¡Ë|ˆ˜J…˜åâ2lQ@ƒ!è=[p Æ‹£2`¾5âÆ#› };#9¢ðç¼ß *"Å[ɇÈx¨˜.+˜.Œ·*濯)ï’ ô}¾û‚|í—·¸dóóp>&Ó R)O…L"&H€Fö®¨‚œ–î(Æ 2HäD"ˆÆ¥ÔÅ%Á0 #BI ²H/1LW@çá"Ñ;Æ™è‚Å[A¥ï8Ð…‹RüæèTŠáüw>dn™‘Å,1¿‰‹`b"8^òËfg\Âð2ÞOHñX4 ã1ÿëÂA)¦ˆ€!&yò­üýV3//\‘@ƒÉ«¥1`'à 1Ë™‘ø+Gž\*%Õ_ºZRù‘Gƒ¢ ”G}ô繧­Im˜­ö´ˆ£=ûÇêá‘ÆŒì­éLbÛÃ?'Äèú÷üÁë~¥YûnÙ©{>µ°ûçl§"²¥(åIÁž‹„†oë¨×+Ú¥¿ÿ4Ý"@ÇÇÍ]¬3£ë^æY~¡a“öàÍIÖ­ª+c%êF™ê ë ¥3FV„ÒóBã ­Ó¬¶ŽwD}f,8+f‡t©µRY[Ôl“çù]‘§œÝÚck53˵-ý“?¾½­Œûd»=ñ¸®1´Om&Õ©‹´™„­áVÉOÓœòÉœ#ú,nR®Z§@tªûnªå—ÿX÷Õ·cI¤ uå:âÎU çD®¾3yörâ.¥$ÈÜêgzŸÒX·Á4¶¸XóI{èÞ–ï•Æ''gðìš¼/Ì;`u¾®Fóazi¥IiyMó%ÔÕÝžYØùl“šäXÿô ¿vsNÑBúéX½Tï]îëö4*IQù.ˆ2ZÖìÒºP?tÖigQOß‘ŠþÄ-§ÿ„÷7)õŽ|ÜÓæ¿Áª•zg£²m@˽Šþû!µÍÐHd³ etLó€ï`øÖÛ÷_”á³ò€UÌî‚:“ýŒNçõ—¿LlùWál§>ï5óØñfÊ™Òk»¡ÇM&›ºÆË6j»gÿ`ÐÁ-_( ¯¾.+õŒ6-}P5¬QšÆl”ÄÄUSzȻڽÖ@5;?ßk|©¥·Ë§½/£ØÝ6¥7T= Ô[³áæ=—”jï‹YagW xLÞhÆù §—[“{í ë®õÈH>ËËYZ»P·&ËH7/Á.3µpëˆ$®àÕÚ†»-zúÛ(*IÇ”N4ï ¥]p«Õþ+×7¢ãV9Ïê²*öô¶„@5ró—¬0ês—ôÙ¸õªŸž¸tuKbnÎám)EõèÜd†ûÖÀúêAW':“ƒ¡ò(_Ñî…ø Ó®UsÁ×k™3_­7Û½`˜<õh4Jä¹V›j°ÿVÂI›2Z ž¹&Tcšs²y¸¦ÖÝ@å訧٪mæáz¦ûQqc®Óømù•Ê ë¦è } y&&‰ÌšMUÉZõíç×÷y¾ÉöŽ$ˆ¥<çW£]yúƹ®k–ìÆŠ‹õ††×2;4X§K!¬†+·º™> endobj 860 0 obj << /Length1 841 /Length2 1659 /Length3 0 /Length 2243 /Filter /FlateDecode >> stream xÚu’y<”kÇm•¤BNZ^õeŸÅd"Ù"ëÔX mÌ<3ódÌ0óŒf’#¢×r’-ûi(K*K)[ŒP*%Ù—NNšHQ¡„ã Õé=Ïûyþ¹ßßõÜ÷uýî[]ï¬kNfú‚˜ X¥‡4X0—èë!eÔÕ÷³@" 1–D4Ph ƒ@#‘H€‹”‘hljʎà8l"u©‰Æˆ ´>ZÈ |A*ÄA,moË 0”ÁNæ|ó‚@[t !:TIf2è<€ RDÿqèôƒDÐXjë_.Ñ¢óþ¿ï BT hà@2Äñÿѵ…‰tˆdΠÒAùAì$ã!˜D(D:üÂ3È ‹1@<“ -%è¢È<Dòc€l6°û«u C$QoG¾N(P°Æ;üØ è/ŠîÛ~D6 dÀÀžoš ~è¯dŒAîr7œ“­££öò.[V “ 1¨z·@d±ˆ<$€©Ý@0 €D­s+¡Ç`¢_€P˜,™¥BK—è200C¤ÿMP"B¡|—˜% }×»—ô÷rŒ>€ sØß@°éD6m™üs0<bÀ.¼€¿ïgiÒeú¢aÓt…È0íKpD˜q H=$%â¢ïÛÊóßÉYX0¹ÁºX$ ‹Fí°†hÀ`~È?êHKtËWÿ7MD/¹ I¦¯›IÚqìFDͧRó­Çu‡ZVþ>(ˆŽw¿µÞÙ“LsX•aÝháC.Úô(ß[x¦­ûäV­·Ÿžp=ê³ÂRlø°˜Õ=¡Å¤nÎÃÙõTp™¹…ÚŠMÊO$8*¯÷!Hv%¹vÏGbô_ç.دŽþ@þŒœJÊVø¬ùÁ˜D¬»ŠÚ Üìî!§À"¤q\l·.HD`UlG“[=Î=6 ãÃm)ɾÇtú­n'^\é*.wÑŸ_{RšP/€ OÑòuö` ooFg\DDy%Ö7ÇhIÝ'ù©mœýÔßc¸²f‰¸ËêÏ&з£Õ{ßöNº­I}`žj4±ÊÞÆ@Žß—¤qÊ\j¼ÔyXJõ Á;êéõB~™B‘ +É¿È+&cÇ ¶",âÇpîhÈf kTmHÈ÷‘ÓþZ­'°´Ç÷Þ'Œ QL/¦À*‘ž˜¼Ñ~aèÚ±ŠV‡ºQ—Í$Y/1ÉØ-3?%Ø$±ê¼7]lCMÞ[ß„ åàÚDa@€C;Ôehµñô`ïÈÕmÏ`½AœZÛP]Ca~¸¿É:±½s]W;ú7´ûmî ”V|skõµ°ü4, 4ÝuÜ.%¡&bñÉÈÓ̃ª ¨,úO^¬Œ»ÆǃIï,Ë…Û×ûPøìÙµ¥åÝJ*(‡8ßOJçðºÎN[O)Ú'ï‹î6¤Ì§õ5£«xúÅ<êO2?×çelCäŠbòâöb¢¬•’ÁäHíÌæÔ½fDS3¸­ ¦ÕY :†ÇmÅBZ#œ_¯{p\aÇ—<²|¡¿,Ýïw…3ó+4Õ ˆ7õÍ­½Ð~ë“élë9ó VS3öM¦”Ø€ç³Ú‹vZÙâÙS&‹}=¸?ú÷IuòU™;ÅzeºvîçõÙZi+¯x%YèqÚwˆÙN)îº}vsãåŽÌãÉÑäJ¸îkoK”’憞J¬¢äѨœ•bI+zL.–L{tF”ulÉ×›z¥„I¬J1mï+%æÏø1 çšR¦S¯V‡Îo{ýïGܹïCÞq«` M¾…5îû!©`*Ëã^zÿ†p¹+çVð*Ó*Ãl|Q¨ÌUì”óÉ2?g~wrvQ6Oi"úlxzÑ¡;‚ý§lOê´¿ë,!nM¯,j0Ñ ðä`•W sfF·z=]8Y XW1\µ¹Bœ›‹i\£JûŒXœ”{ì×G±(”W|Å SsÜrØÒ‰W‹´2.ö•ÉíÛ 1ž¯³¹[Òzù)ó½Û‘ˆœÒA«LÏo]´âž\6ì{Þ_ù‹êQï‚ ÛLü8fµ½ßÐÛDПœˆIÄNììQÚ¤ÒÁÍk‘âsÎK¶zµ…våëž9{iÍÔùqÉkNžÌž½Ù÷”à㈉râŸ05ÝLéZÔŠjr–ЬŽ,c_>{:ÍŠ=¥ùô¨ƒ,9¤Hñ»Ú0f؇é¼Ì\[Yrß7ˆgóÈJbäÝæèåÀÆW«õNô[‚ähiV°{‹þ..÷²Ò%¬|ó.U„'Š Dù]*T¢CäýÞîιðóâ‘ܸïíânfñÚâº'ó¦œ &ëv 4µi²ö¶ ‹ÒÿMÎÀUja°V çp9T*ñ}¯,zŽòئ›Ê²‰7*—oÉ*µ™DW<ÆGRopyφ87Þ­þS?ÌM&8·îÙœëÂQ…¹r…Šo{'vøÄí_S¯ Úil0­¾›U|“þéBªñ^àWs‹Rþ‚„öÃeÉÙ¡Ÿ½îd< ±%Û_Ê™7ÖYÕÚœ+x•AŽHG÷°BŠ:VÌLP¼wªªõÈ6m{·V’ÑÞ]×ùßORõ:ûsÍ”4·Ü0ìqÇ¥Õ©> endobj 862 0 obj << /Length1 1146 /Length2 3737 /Length3 0 /Length 4443 /Filter /FlateDecode >> stream xÚ}“w<•ýûÀ­ÈŽpÛRœãØ{ï½CÆáÛ9GÈQÙT'’‰QY)de¯lÙ{$ÛïTßçy|Ÿïëõ{ÝÿÜïëºîÏçý¹îëÃÃah"¨G9 ÔQHŒ °DÀø;`0€ˆ„Œ‡G€a\QHU! CÁ¢`(`Iã^ õpeæz¾>0ç_¨(…BÅÄÈ îêˆήH2ð¯õµN(@XüOîëõWîíƒÛàÇmzÀm G!=8 ÷¯‡‡>ÌðÿöúŸ4ÌÓÕ#àÿ)°@¸:»`~=ÜÕ×óßY- ÌÃÕQ éì B®>ê®þ¸¡+ÆÑÀ }ÂfH8íáŠD¢|\µ†@þ•3uqutG"||±ÿ¤ôQWGœ›ùŽˆ;áu@ÃP÷ß"O\ïþZæãˆ@bÉ¿Žø€þ'€@ÂÿÝ\w7lib¬m¢~íÏOüSC:¢à®Hg*&ÀÐhXÆ‘( ¸âÜý„?î°`!$ ƒûðòÅN(4Ù¯$!€u…~“$þMRöI`‡H ;þM¿z†ŸCaŒ8‡PìtE°ó9À.£¨Ž¼\Ès¸˜ë9Äy¹ŸCœ˜Ç9Ä™yþƒÂ8³sK ãÌPçgæuqfÞçg†>‡8 Ÿsˆkæâ¬|Ï!ÎêÖ9ÄYùýƒ¸ëö?‡8«€sˆ³ºýÿ{ a®HŒi€×ßÓük0~³ð6Á Qî W8Æå|‰ ƒvõ·†Ap?òëùëÍæMYå(•ÄÝI@LHH‰ÿW£/›Øß7­±“+îž!þG²¯C(G™(·ò¨÷ûeJ,~‚s]Ä“Óî%Y6ßÃðgºè’¤kô{+ÛÃ_1u` G £û†‚XÖ÷»ýo6d„O<ÒÌÂà©5Ï*o æ|>ØipF°ÁQ ç ì½YÚd#Vj{k"k¾T‹¡ã;" %óy'|¬¤VO †ã &^)óà A¬%÷4¦Ýò&MÚú±¯©–YÏ A”׉ýòƒž›ÑâÒí6wÞ£ëC˜/Màe†yÈ/îœ~žnÈétˆ|¿dZï÷ó&òuÜG4i—rÆf¶·†®ŽBY¿}8¶J6ø]¡Àû÷€‡ÚM©ñz†¯q½ïTæ{þM¶Ä¹sPñ¨k=6CQºo­îÝX°_ó/l QÈåfν«ÞjðužôÂ^ñ*$ƒÜ âPxþõ½ô»æ•(÷„Ï"S°Nm}þ²òÚx­[÷âŸ6ä41ÈÃv”k ‚"ŽãÛgnÛn­!‚œ½5Fª)‘“4 ‚Úe]a÷ö€ÇÒá3˜K·fP™A§ÔOCéÄ2;Hí¨½žôÓKi‚ rèuñ^SSE…‘ZZ^yï]æžä§ \o7»aQ ßa•Æ2‹†.4:D cÂÚSgŠé¯e NÍãS’#ˆI‘¨kÓ"Yü§EÚ†”õrå%3qSÂýÜnc¹)56¡ùØé$”.S\šÒ”;ôk_öµ[¹}»üË ÔJcuùUY….#­ÑîOýtLçÚ:ìÒB÷hWëÖØ6ýòÑâDŒuL ©~d@{¼Aô™©IÅHˆun¤k¸ÂâÄT¢¨Í1‡ÙtB›ì-êœa>%Glù'¢ú€QÛþ¬«½©Vq‘AÌß„²­oŸ’˜Ûzhf’k;3Xú-ü¦©vKÛ3Ý5CFá‘¥"in5Ï ¬¯QqÍm|Æ[­ÏÑý¨3#òû•¥¦ *±I•&ò®ö]ùˆ4Œ€1š ÌFhs5Gθ!ýUvg½@ºhI'/–¹ïvl»éÙòQÌÏ g©ü}·Ÿ'g›ðöÒ_IØŠ$ yÜ'&×Á 72_t¸P$ØMfDO8aoDŠ* aV«}‚¶2kjvO£bùJ?È:Ukíˆæ·o§‹±!V#égüŠÌý-íÒ˜UPï—/FZgË<+Ì:1Â$ïʼ¥.固ôY™sÔ“%©&p&ºKð½ŽE0Æ=·,ɶêb>éªxiñý(”/“Óå§f’å´9¥¦#»Ö¦ðNyßÛAm³Œ*À6À`ÄÇ93ù0Ÿæ4N·kÈ7𕔧ú~bAµ»¤Pb-C³É½Šâ.öåô­ËOÝ¥åö/Óš²fÜÔDgù ’òX;ƒñëó…x‚É/¤¬Æ±­V­ïªè¦ ¼¥ÅWV„ò†Ç4¬×–ÁCgKruM»³ß‰œÏä£,¡foü2äöYeË1ì-!æ_TÅfËy¬ïÖZåmŠ™Ñ¼©dZ¤…,†©ÕÍ»…o¯»7’:Ü´ Ò›|J‡½1Ù'íí"Í-±Y‘Í2–•p¥ÈÒêµjOÉ‘ï맿׽5òO*÷­þÉ­ýñ}U¶ßœb›Vuüâæ¢ÝkýKð<‚P=¯xóÅôççá;g ÚÐ-}|ßñ šmiÞü^ J¤*ÙM]°Û˜,ä™iæU±ƒ@u,ãb=†mŒ›@ÃÃ×!x¥âXn}™­¶£¯Õ¶ùiÎWpüÁÊ#ŽÏ&‚œÑ3A6BŸ}™>J}£3³£yÐÌûA¹ÚÕÏQ$ƒÐ”KNñ˜¸…µ ×ÒhY|YTT Ì3 UÍõsñIF:ݳQ‘üÎSqdoù¡cú²Ø@éçTP?Þx´eUŸ*rY¯NÇ"©ªL™Û¦½~$t[,„«×éAsöœUSÿËc%øJ'kÒã·ÍtYuŠ ßýŸÜ烻úÅæ[çB7Þ |q)­\Ù'“ä,ñJ÷††“Ÿ¹Þ@ä‘¨é¶ êú‘‘s #€Ô<Ù‰#KwŠ·ÐK°å;^ߥXÑdó­´ ã[M› a¿`©Ñ4µHwyUqǾa³÷$Õrª­íkæÑ·åTÎ"ÆsbñhÕ·Ó¨#«Ax½Ö-÷Ûå{*5RK#P"´“F#Dt) #¢Ÿ¯ ‡6ÀˆïÞœ¬] Tå‹LT6²÷îàsê_7:­ãš‘à[.'WÀêmìºe’ Ë=`Èo\ü|2zx—Ðົ×O!C(“ÔWµ«ésydD÷œ—kH’ïpË„ Ç=¯”ïŽßÕ>ˆH‹¡fëÏ ¸ëáÌv™&é—R²y*•Ñ‰É5œ‘~²|,~&·¬{xñú çý³~‘"á”kFJÏï–Ó‡:Ò=µÚ³Ë%fØû¬Á¨ê}Œw#Š79Û£áÂûºªô¤Âfk ÍÔÓCUZTÙ+$6Ý£Ù"¥‚=âË)â»YëQVrtël9ôW›k˜æóç/ÃQGô–üF¡¾sµø5±/Æcý“Êk1<ñ°)ï¬(ÌTaCãõuª`‰Ý˜[EΫڵjÝλ/OkÚé%¸%Œ<{‹"¶ OÜ°{Ò÷aÜ­!¨•X{†ç‘©ù,ôl aQ¸á˜ë^îl·ÖjZquｶN¥e »GGµ,Ó¯$äÄwMjs:)Á«^Ó’7ªƒ·†E„|Ì'ÞäØ{µ‰WšØ–}ú!IÅjÚSWrĬӤ*"Û™êÒ‹0/ˆ.ØŽ·Q¡’Æʸjfî§Äái"OÛŸZ:fŨo_È“c볂FZ6‘2ߘї÷î)‹OðRZôtôIv+*±Û7 ²--e¡Ór›3ˆ:»^1ËaÅ6›tª™]OŤ9쯬?Oµ9aøÑ®b?õÊò•¹éõpF~¯õ躑ÑŒíÎOŽ§]0÷…ÝÞÇ¥%z‚ZßU/®STÔR:» Ñ©†rz 8ŸªR‡Å)ÖÙ^ÃWeù²KëDòÜëâk£ÊyÄ;»‰'[Fð¸Ëæb²Kc;lí-ÌÔ‡ïÖkSÕÉkSÊÉÓ+ $^jP’óX^ù8‹n•ª¹:؃Jýî>¥Î#Ý-´Ã¶bVbÔÙÒó&Jtø•ÍqXÀšé±f×ÂCcÑYï–»Q¢“Ž?‚G±L”"›î‹ |¬gÇE²£¹—®¤"FËx'ty%6ÙÈ1Uví‘£ êA’{'ú¥h¦Æýu§+‰à»ÜÜ„¼µ‹ï-ëò1øÒnÞã¿r]1TCLñ¤Z™²×ÝîI¢»O¢"/¦\´{_ÄC­MÜTŽM`¸ÝqsŽë#¯»pmcªó°ƒ§"Óä§x™Þ#boçSî=ÔÛ•¼©w)ïCÖìÝŽ¢¬2•š’‰n›Ãq],ãcÏ'UhZAìôBméIþ”9…±fñ'öŽ§aûM$c™eÀ¶v8Í'åbî“„¹–FÅãŽmZ!ïÖP~fk¦zí¦);úPÜŧ.d_o¡-¸nQë]ø£g¯ÑýÑ—[Z F¾äQÁí¤íK¡=»»Z5ØÐ-f.÷ñн¥o'&Ç¢)å+Í8Âw×À V˲{å± ã¦5sRÚÏ˜Ý ng²[Zê"±ÛÙ×.,}¥I¡ÛÁªƒ·¸·Ûµö% ™Ž˜|æñ—ð&h­“3ë—׶²j¯É=óÇÖÌÕÊ‹V/¤‹L¸³ª  C?-®^’Ü"ªî‰%\DÝ¿3ÓŠ$2df$® dK·ÌõÉÑÃëI åí&9»öš7éufáÏÁ^µÜ-ÖÓËÈÓ¸?zvYɧ2<â/íŒ(¬/7(‡зBg^“=\·ê‹¨7ÝÂrãg°â_ˆMJ–¢ëŽÞÁFV%©¤Äˆ’^ d.Ì}T³¯]®7–1ZÝ|ýMJçBÊqþÆ |*f˜Æ¢K6W’€füáíQê! G·ö’¯„s9N¿ó³©¤ô—3O²²ñãe¥ì}Í/¢`ƒÀAÞñ6M ÉÖNÈ bÄ"18[z-½ iµ¨w›‹ ¼)×ó… öP […ÅUÐdΛ_â–,õÕÒæ ÙÞt,Pz ª ¢³2ËÔ¯V Éz؃i“îDÇ°À[ëØ+¼‘‹¦T‚N¿¢•e¹¶ê _·JÚÉŽ·íFŸË|ÒW®¤êæz•3_ÊjÉC¬èÏýVщb¼`MB>¥\Óª¸¡‘@øFMëÿ’#¤¾ endstream endobj 863 0 obj << /Type /FontDescriptor /FontName /YSRJSF+txbtt /Flags 4 /FontBBox [-28 -183 560 796] /Ascent 702 /CapHeight 654 /Descent -167 /ItalicAngle 0 /StemV 85 /XHeight 491 /CharSet (/L/P/a/b/c/d/e/f/g/h/hyphen/i/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z) /FontFile 862 0 R >> endobj 864 0 obj << /Length1 1495 /Length2 3201 /Length3 0 /Length 3994 /Filter /FlateDecode >> stream xÚu”w<ÕïûÇ&²5P½­JÎ!ŽC…pÌl©ÎÁÉqgˆ(£*##’ÑpÌlB*2ÊÈ̱9Ù!#3|Oósªßïqþy_¯çµîë>×-!bl Ò@âìQÚ8,‘+DO”' /f“8…G!ˆhVAD)9YÈ1Y90 ˆtK™þal@w³0 Nß<ÀrÇ9È1%y690€D;{”Ë&û-½.Ö@èH’Û/æÂèE€#ô¢’½$‡ÅxH”#=Ž„Á"\QÀ‘omýC®hŒ×ÿÏ-Qh'g"pÄ…D“\ÿ¦ºDí u ð MÐF{¢Æh¢ƒ3àˆÀP?ts,…Ç ±(cým"ÿÅÌœÑ.X(üD†8"ÚÞ›ÅÏÒ( œ6Öÿ»”+}t¿ò!(,Púe#Q?¹Ÿ ‹ü{ ôá~‚¬®¶¶‰•‰Ô÷+üŽ´°8$ëÈ)(<áÅ tKð†hzëžÊ“~XY,ŽHÜHÄ+€#Ïöí†åY{<ÂEw£ƒïš‚ÒO ƒr$ÚëŠ`Ýü/@‘ÝþÓa?uü·[bÌa¤‚2†\ð±ÄEüVæ$Úé7“ÿ91Ä)ü†ßsþø/c€ôS9bp8ü?9å¡?É¿A0z+œÚA`‘H4Á ƒðú*ü¦8üß¾8²n< û÷ñÀ º=ƒ®xŒ0L—1ýSbÐG ý©ÿ3#ø£´Â„¡ö¹‹ÃCu%zW’«ë÷wèï™( =Ý…`ôÞHØÿ+Dþ'øÃBÿŸ{ÐúnÐß„oäÏ-3F ±D3/·ßÅ·µûnC~ئD<Îe‰F] ôçY°  ¡ëô߯¯sÿ®ñÉ“8Oo’ƒÑ÷ ¢†P¹+8:ðôA¿?£ô†ÙŽhzÛôEE9°õtâTÈ ÈÏ—ó4„.†›¶ |(¿qÛúU°ñP×ogýí÷N¿u?i‡ÌÞû&Ö¸;#°­ÓGèèôr³§me‚ÿûûD&­W´“ŸAëWæ+P8A§hì ÏL„É~.»³[ÎŽ²ìüzZ%?š3BY/'ŒÚÀ&W u‘[$Fˆª‘T>ÉrËZDü±ÁÚ–;Œö.ÉL×¼e… [×埈n± TTeu´` á´‡G‡erèåCÇýIµµÏØêõÃûÊ›QÊU¼TDÀL^N†Ýf´ËÎÜÇ¢Oö؈å,KÃ=Ó8p6Ãe‡ÜËÖý’ïŒMÅ@9‹(ûsË×%”__çÐÐä îoYΰ›Œå‹Þ÷xóÖ–3ÞOm¶wój ± âÃuá[s<˜s,NëpƦx-è™-8ZlVOlËYJ/Þœ ÓYYþN‚ .SÎ[ú%Y\û©CÎð×r¤›ñÓV÷⚶)ÐŽ—`'kƒPÑ¥(¨8åõ§‚_‚Ð)oK;; —…]ª\PK¦‰…†ú&a!R Õ ¤Ñ7z1 ØêÆ…¯°ÁÕœ…;¥íL¤Á2Ë9¼@×hðÞS­¡|6äæ—Ê´âôlÅõ?²O*Cöç›"ªú FÎHTÈAj)[äùÅËšñ™ª‹ø>%hè-$*YÈ Å^kÙ+ÛÔeÄJ ®"礧¦Õ9KH~]]Cî¯lÅ71%fºåŠ­§Ês¯Á­F­DT#õs!ˆš…‡>úrżWs¨&5„˜Fűë¬C‚ŸžŸ‚ V\5ÐfŽ=;}¾æPß߬eŸ¿¶À'ïä—?yË‹ìͧ¼ó§֜èwwÉ7aaÂÂï³_€Ò Žë¥‘m<Ïy yÂ/[b\`a’'/´UC“EjÄž3.¬sþñ³s8ßæ|_ÄäñûíZU”V’tQÀ¸¿Øe\ÄU/ ,r¬¯µŠ¤Æ•u¾af[u"Ì63w;ƒº*'øØ=éöÄ;*`ãk6"­ÔÀû,¼7ñ"vèÏÏÇÈzÕÖ,k¯ œþlf Ü¢õØ8¯ÞßBP’¥Œ2Ã$Þ›?ÞÛÏ»3Ô‘ß—p¥ª¦îƒH­Zdd0+h-‹¯²¢ŸimŸpõðªhÃv¤¿óû¯Ì »¥ Ò<”²jÆ}n—ÙbÛj[†Ÿ¹rÅ©\ô ¿K±Õ¿ £9¬ZœÃöüþ›ÁòÿC`´¡¹]Щœyøl~˜Ê]¦ÄŒÖ#3)u7çwLíŽß2KÙq4;:bŸ¼vÑÅç—-}È%Ɇuž5fyµª ÌÞiÁ˜7eÞÓ|jœ'بo7S6‰[Ç¢ÙÛk[_Ý¿fÃušÎãïv_¥Y©È,¬ë’âB–t®’Þùж—•»~q_—;L™/´ó~˜õ²zwnÿñ;,”@fncøa"k_~‘dû°b5Ascc$¯Œ†?×µçãw‘…‚¥sñÂ)¾\1ð;¢g"ùdT¶:NíøPe¼t ›së\¦sœ²zô¡¯Lê‚–#ð×îï©ï7æO6ÊÞÁÞ©˜·^ ]35é–†ÃmÚæü¢|ü¿õÌ©Çè5kÚ„EMµmÛ¬UfÒƒdtmZüä0õâZ$­%²$›½âãâL彪>MŽ´L\G{z؈]R÷6UjW Ë ‡n Zѧ`;x· "õH¿Ï ‰äT¯ §™ÎQŠX Ë3ô4±¯¦Q°$jè¹ ç—<s&Pä©r¹YCRÞªGBéÍö›gæuÅF_eJp4 ô¬‘,Øxºc{‚G‹_<⃺!.—%p6ÝmÒRl Nª5۱®5¯ž¨ß§¥ÂÓõÅi¦ÍùöÞ|ÿD»Ý½7:ªRÔ+£‹P©9P/×¢¬±@^‡ïd©ÅÛ ÃñE©×c•]C§ vW‡róTÜßJiUb%v\ºOîì~vƒwÂ6Zª£ÔMzÔ7cï-c±íL9м¢P©WŠ’Ô4N…­‚µÏÅž_Ò‘)N" )çF‚ün‰9Û#Y˜]·'bø…ý&{È=!4(FGmýR]îü)ä£æú©¡{Wáâלñù1sù¶QÁ2DÊ6nû/ã×s•â@‡ÏTZ5#VáøÑ€•Eíø‡WÒÒolm^Ô";u m§ŠËbUUb¨Fî.´e67þ>6 wb óœMÊÜÆÏù pÑzñÅZßÞ4Í™KmÉØ õ†‰5IKIÛ¤Æ`•ØÕÆÞ/p/|ÞT–ÐNÃnI—þ`´sç>s£™sú\j>|£åÎw3.M*µ!â†ßÌ££óÆÂB(÷hû%Õªµ*›ì»É_ÿ‚ep»¿œZGÌö".Aëñ- 1ýà ⮿dåžã¬I°”¯¶>çÌ¥û#&t.FWDéêÄ}2èUyü6ÁH’ïjŽ:R¢Ü;ÊÆó&Yæ~ â#)e>ƒÎ•zÝP!WþŽ]–J0XýÿaR\Ç endstream endobj 865 0 obj << /Type /FontDescriptor /FontName /IFFQXQ+txex /Flags 4 /FontBBox [-5 -2960 1609 752] /Ascent 56 /CapHeight 0 /Descent -438 /ItalicAngle 0 /StemV 1000 /XHeight 441 /CharSet (/braceex/braceleftbt/braceleftmid/bracelefttp/bracerightbt/bracerightmid/bracerighttp/bracketleftBig/bracketleftBigg/bracketrightBig/bracketrightBigg/floorleftBigg/floorrightBigg/logicalanddisplay/logicalordisplay/parenleftBig/parenleftbig/parenleftbt/parenleftex/parenlefttp/parenrightBig/parenrightbig/parenrightbt/parenrightex/parenrighttp/summationdisplay/summationtext/uniondisplay/uniontext/vextendsingle) /FontFile 864 0 R >> endobj 866 0 obj << /Length1 1434 /Length2 3596 /Length3 0 /Length 4472 /Filter /FlateDecode >> stream xÚuTy<(äÀ…@dÞžÊQ¦½ }·äáJ ‰Ç8‘(7Œ]È¿ù”÷¿ ÿÓ©¨ùˆD‚÷_0„’È KrsG’]ãR`ÎHâo€@Ìà_9ÀòÊC¥8C‹þ `( Í ó‡ü/ÇŸ,ÐaP>÷míaªæîAö%ýÆ­ ‰ú`¡Nðd,÷ W=À\pñ„ªª?Ð?³)@e`¶Ï $‚ž”ßX” x,Þ‹Ç’}ÿ#QØ¡Xˆú¾Ž¿h ¢qÐ þÉ¡ Í GÀ`QHÚž_°ò/˜ðŸØÐjÀÜ‘$2ᑺcñÒi €‚#c=pÿÕ$%!x€ø¿•`Ð|èí%†šû/½¤ íí¯X!‚.8ЇDqþ]bùí¾þîU¢¦àG ßF¶(?ºÿóPÌhV¾¿î}ûr¾ÛòÿÚ–d"Á <‹ECÛø[ˆ Zh\m |ûùùæø¿—¨¥Eðñ“UPdU•” ÊŽÇTTþDQˆDHŽïBèžÚ.XèW‚> Šy¨Ÿ€:~ùBéåêÕšÞ²S»ßŒÕDÆÛ5E(“%nû¹ïIÕûÇSë<ºð@[²Ù`^XO¿¿€4mµÓÇáYZð(Uÿy‡nÓ„ÖGÙÌ–µÅgPMàÇtMŽœà\H0?È~Á€L<Û¿qåh½â»¢é;›5¤wöªs€;ó…C„*@ŽǪ̃™£‹¶#·Ú9pÄq7(VÖ]›t—ŠnìŸMêrSQW}¤owã™Y¬Fgk2wGö»|öÛ9š¦×]¯jr'ËsŸxýlؼ äµý((3îb‹—ò“ç+Ïê×n|á´¡qp3oÜÀÅFÉÓš-œ_mv’¤Œy¦„½vQ ¨Ëùó™CA{LS¬IoeüœžlN\º]:ÀÄûvˆN#_·eM]G¸VªZ¦{Uq`pä½wð4©ºûuM‚eDPf‚Õ;Æ–«aŒÊJЃ<„àˆjZ-ËÅùw4Ù®$ë87§ý×¥$˸ì oñ_ª¿}_ƒ³Zw2…þ³2›UõC _|Ÿi¶×VÄ! Ä'%Ź¦Ù±zì}ïˆ9on{.~¨=¼ïð#Š¾×ó˜c½ú†þÛ2ç‘%©Å.ŒÍ¥…Cû9ˆ¤ ±€°ÁçöYöºƒXÒ \QM÷­¬Ú (ƒ*Íl‚õŒCI ¹óú¡ºûb8Þ6æÍ¥“ùKÏ1mÍ;%¸ k"…šóDc÷,ÉUµ^ȯ‰¸>š"í¼/6u-fFËt›ƒOÈêÞ1¼¯2¸Ì«·¼u­=ÑþRj–Ï»ã /{‰=[÷[—$«C7ß×áÎ?¼¹_‘oÓñ¹Îµô>rT,›ÚÞ"³ož^«;¢Kî¦Où$}¶þÆdÎË–~èé4Ù09Ò¼ÈÔËÞ¹ÓðD–Å nlé=oYÕp6D>ûÜc¿½¡Éo¯:$ËUiD1Ëv¡„»l:ò*Z©JôòÎÒ‚+|åB÷2¾¡|»udï«ìabEÏõ^}/̹[mU€W$¢Û(Ê 4W.FñQ™u¨rã¦Ô;'º\C¢íå3ˆ(pï‘o°?À&ÊõÄbX?Ç*4'¡¦0Fæ„Ä•¹Y¬}ƒÚî>é`[;87ÝÓ-»›º(}—…ƒÌÙ‘NÜl|ôè‰s k8nZø"¿e­€we`Vš ËWªdÀ{§rÕ¢W¦×ÚãZ)³¾ŒÍQªŽFÇ‘«cÆ†Ê ƒ"Ö.¨SÄv)–¥…UjäÊW¬øèPOŸ„9™ž'¶s¹ñ -šVûP_÷Ž†Å« ޴݇\¯‡ól‹lŒ¯oÞ?Zo v~lõ½áɘ Œý£°G›æìIí%c«pz§øÜ#³´¸d É{uv•þ,jÅî»×¼ò&]ç%SŠ1/Måá¾,¬3vv¬ˆZBÇø¸"°6a·¿IŠzŸ˜GŒ/ïÖäÔÕüÙÌ.½$j±³¡HÚ;}oÀ—ô§hÏSÒ¿Š“á7%î3‰*yÈS·L•zê‚Tcç…­šØ„ù÷I[=ÕF>U’É Ã #ô”32Snl0¥Çû ³¢ ZÇt³Â¦—{´âl¶rS“ýصÚó“yž˜º°â8$ì ‹D>Q€Žø‰àõËDÔ怽BßfJZWܽ~´‰Ã.ʵй¸HmØþ~pÏ«‰šùzà(}VvnÑÂ3‘Î/#_êàŽü½.‘Úï_­o˜^ û@gŽÈ/›® °˜©PÍâ}Òû×YzÏ©´šðÚö†Þ=Pòœàóm=A›¿*Îý@½Ìar­qKçÖ£ÆWÉoé*¹ûÍoà °Lk!)iü§QåÇdžiY)ÕYgWr£zqON 8qJÇö˘ITUts—%&ËŒ£$#t†ñTbÕ¾ª‹w¦j8îpÍ|R÷ãÍc˜óFòûw±«ògp½Ú"k¸çkFí{îÄÑöª—[:}±Qôã#®¯Û‰2‚¡ÍØ[´SMÞ—\–ÍÔ!Ã΄Ùþ²§’MØêwéÉ™3x \ë_õPºwºMmm¼òRGŒZd@Ð`on»~©Î ‹eŠ’¡ö@FNµT[¯-,'ÏøÜê@Œ8a< ïÛ­þA½ùædÓ¬3ë]‹¥ú¦>_o0¦üsŠ?»Q”pãÒ“6SFeŽÉŠO+UNr{´×ËhoðµU¸m’Ö†ÎæЫîmϹÈ}.`ñêžÒÍvM–¹‚]„»èá”T÷9FÏ=;BBïÇ+].Tç™â§ çD¬õvµ9žgIøÈÄ4˜Œ+Ï lƒˆ¿¸'£µÙü\µµ¯ôý †ô3Ó\ŒNÅ‚«uï&ÚKŽ@ÒÆ‹­Vff[XÙŒOûclݧ•ëŽôX™>{Ψ&Ü«·içe œjùrâ‘–ÒØé¯ c«æSxCÞq‘|²Å%É}ÞùnæÔ’Ážjü3¼ c•õÓæs|à “Ó%NI­‹7ñìeQcjtWˆl±4Jõjüªã4ßµþaaçUŽ¨Í‡ôïŒo”…”ï7¥ôg– k¦ mäÜe9Ô1åôäšÐÐIi)"éJXõÛW3­ ›ÌÖ#37åS–9ï1¶7 ~¾|l麇C‰HœÚIÁEÏ´Î Ù*:àõ|­&óÖAV÷¯‘žiƒæÔ…šŒËTp覱x¼¶1´¼åmb~J>Ñ‰Í R˜÷Š~fò]€ÍŠŠÅ¹0lTN:´têJ¢ Õo9FÂiRà‰Üž=ÕßJg´k(Uy¼“þÂN¶îMän3µŽ51¼h£æk0Ñà›u×j†«ýõ,eŒì-’ïIš~U2b¢Œ\|±(îªç®vW[ú3° eyy/>þ|aôàTíFt,[å—Ž?¦Š‘®9{ …KÙ»uƒ}–Jš÷=½>p_A©%±p<@D´ªXåÙ\áÇ`¥bÀ}ÉyEl*6éñ™Ï‘ÒŠR/Em\5¾ðÙ˜¬ŒÔÓ’M~XÆk˜ö¥ˆR¦û–ûÁ›ÈÉ@½ýÌ -ò³l;ÆŽïð¿óbA»t„”¥™·Éx~™±J?áW±˜6ç¨À¡çè³vD}eêx‡ª‚Gu„ÁÒ8Ö¦Ñèô+Þ"µ‘=ô=Ë™™³Ñ9ìÍô79|è«ö¿9Ý&“ÝA¿ÑyÅo“º^ËôùÊÏ>‡è;>‚QžÚÓ†y¿£µ–bOËoÄßœipŽyù$ÔPq“Õº, f̦{ëx8™Wg•8þ¥ä" endstream endobj 867 0 obj << /Type /FontDescriptor /FontName /EEHFYP+txsy /Flags 4 /FontBBox [-22 -944 1227 866] /Ascent 685 /CapHeight 721 /Descent -150 /ItalicAngle 0 /StemV 52 /XHeight 441 /CharSet (/C/angbracketleft/angbracketright/arrowright/asteriskmath/bar/braceleft/braceright/bullet/ceilingleft/ceilingright/element/emptyset/existential/floorleft/floorright/greaterequal/infinity/intersection/lessequal/logicaland/logicalor/mapsto/minus/multiply/openbullet/periodcentered/prime/reflexsubset/section/union/universal) /FontFile 866 0 R >> endobj 868 0 obj << /Length1 782 /Length2 1263 /Length3 0 /Length 1825 /Filter /FlateDecode >> stream xÚ}R{8Tùî†M[‰’’œ ÑdÌÕmêÇJ¹$å’L1fŽqçèÌfrÜÂ&+r‰"K)6lmÖ5Ê5—-­è¶’[å.Ú_‘=È>¿mŸç÷œ¾ïû~¾ßÏûy?GƒÀ:J2á!n c$ª… `b¡Ä  ëPd54LQƒA¼ŸƒL€J#Sd…B8Ž˜øe—9X‹„þ|…Æht:M–FxÜ@>Ë’çß·„Ý€ª·ÈóD>Kš/ˆ ñ&€Þt€·ä!°@ð@wüžH °áxƒ€Ö‚¯ÉoH ù?Ž Ä÷À-k‰¼¿V-1ŽâšÀ|P)Hh‰A ¸€;G y{˜¢YˆšÏ Q)”¯4;ˆëƒB! ûE²A0ˆ‹›sø2#>¢6`Î:ôµÐoé=Ž Â`°„yà"AûB€0ïëðxR ››;?rl÷â´0áA0 éêåHd)Gº€?€pïbãÓ’u`ï>",pGPÙù%P²í<µ€ )ùø߈AÈø¡ÈMbà)Á‚ðOg,cvŸ¿ž·º€©‹ø(†"^ #ÄÃ<þ·Äšƒ¡Ø™¢C¡Pqÿ–N'þ=ú¾}ˆØŸÄÐÅwb Ðht@ßøB®Eñ~><À%ìá»A1È•íê@¸{Â=‹ÃËÿ,4Qö#õµHÿñª2:Þ©öŒ.¶óI¦¿Ç!™4óG§ö¹ò ”$³:ó"v(Gþl³«ÓC_^°¸Œ-;Pûzß)«ñ¿“Õ|p;ÙÊoÓOŽ~½aô[•õ®Î«œ5Ï;vÌDè×Ð~êÿq¶R8pÜðà äNË.(cgM.U¾[ëDP…59±åâäQç‘¥}ÛìŠp}µYËoÛØ‘zÌÖäv3>A'ŒDF/ÖJ§ùö'D¿âÌÜÝ•áÛõRö‚ rÀ)¡2_ËÒúûò ¾$gx(d¤íriÿ>¥ë ,[Ýs†ÂZ´ %9cqTÓrëÈÂçw©+‹rå6; Ò>ë*Ó“%ƹweÏ&è6wök“FŒÜ×LÅ[%ú¬ž2ã¹o»Uiƒlw^v=S­IÝò'uðžÉ°ì å‡jße„¾ý0Ð×:ºæ°æ‡BB¨O‘œvÌ‹ðéy~FQã7焬œx¥ç|ÿ ™±ÛŠAÄ‘‹R qõE®åûo¬Îñ©›ºÙdnu:™Â¼4}îðû®0I‘‹© J")“ߊîØÓ¿s¾ÏvLð1ó`ð–LDÝôõŽo¾¼ÎÏ0 É°päÌG6\Øɾ^_¸±§mü0#Wuo…ÎÄÕ‡õ ?0¤žív91žsnu@õÞ¼rÈEL|Ö'£’d¥ššnüþdÜϾ‘/ÏšôL‡¬ÜryˆÔ0Ú$Ÿ(šYÝ9ý:Q=U᧿1km»Zò.Ê­ÛñÝAò2HtJÁ,:U*•ày *ˆhpÛÿ©?çÔ„j±Oøà2ïäUëéîo´V1Bž É×V0„Ò¦“×¥|ìàÇOŽä«Ýk4OuvÅ75~¼ùœiSu«ñˆ`wk(}B/¶ÈÚìü±b×J>qùÐryÖù˜ÆìÄߥ-˜×ÒȪí™-¶­àþR1 ¹žPUŒTõ+ö¬çåœ1:vÈ÷xÙßf˜7øNQ•#Î| H7rUë#ì”ú4ªyy½þéów>XiåAé;*ó?w)9æt¡3¯¦ûÝï’Ûñ(Z<»ù™ß¦É+aYµ sŸ*ÏÍX¥ Ž»%¯n¬W5žÎí½ÿ-¡lHr·÷tñÙ'%¡*FwªÊ’¾ý89·rNµY©V{ntL17yŽ!'¶®Z1®BŸò9®,#+ÿHJ{éÞ—z̃–Ám\BÎEö°Ä¿ØŸì~s‡¦²S7Ü“‹]Û|µ³¨P b6 ;ŽÚc\ûÕéëzS"cÊ !ÆÖ]‘œÎýO¯œtÕMøñÕ‡¿oi¶]wã„Vc׬§–§’˜M c›JOg—­o!lÙ8À ÅT·ñ]N‘ÛgdN¾­·Î(÷ЬÛÊ8%ò7Mp´ÉìBé!¬é²VŠ†æcWLb’·Y¼Žò|Jý|ð¤ö532gfv½Ó ɬRvЈzIF|¯ÿyúPÔÌ°äªÔTAuKóÃI… ŸwÓÞ TÍ”A•Ìµmgˆ:Ý®k›ò;F+v ¥–1Í%QngÈ(†'®Ûæ1Þþ4§JÆÑ>µ}$÷hùÅ…‰Iþ,A6¯©w¾ u«þÆ€áÅö|eÊËpz°{¼6kȽp6?Úæ²¹øZÕûÖÎÛŽÚžígvQŽzôÛ÷ê/|Ä endstream endobj 869 0 obj << /Type /FontDescriptor /FontName /GGWZRX+txsyb /Flags 4 /FontBBox [-45 -187 2238 794] /Ascent 441 /CapHeight 660 /Descent 0 /ItalicAngle 0 /StemV 74 /XHeight 441 /CharSet (/Q/Z/notsubseteql) /FontFile 868 0 R >> endobj 870 0 obj << /Length1 772 /Length2 898 /Length3 0 /Length 1441 /Filter /FlateDecode >> stream xÚ}R}TLivjEÃ9¾ïl"£iî|TŠ•’èô5”:³}Þ™{gºÛtofîL3úPJ„’(}Ø>ÖŠXªmcZIY¡%Ù’TèK©äëØ[i9gÏýç}žç÷¾¿ç÷ü®1ïδE!ê@à$“mYR%W‹× ¢o”¡0‰¸=L¢Ö€Ía±y,A&)dMø.T™§‹BKF+ pÙˆCã@ÁD$¢ §±FßwÄÅ`[Œóˆ"dBS¢29Õ˜PMWª%BàR5@P1uO!•ºÂÁ(0óõ• cRõÿx¡˜$&.(‚)‚'«Ž$,ÅD¶¸DŠhœÂä˜ Eø) bX*GÇùí8‚ʤŽò 96š `²!h’戉‚pT.æŸ$W‚ÄD”9ÏO3R#š‚Í|çÉNÐ`*¼‰÷`¹ÅI°f#è8ÁùD 829*Þ±X®žÛìÜVoqLÛ„‹Ã%€cn`™ VÓ À¦9cŒò®¨Šš–e†$u„(È &d´Ñ%YX–ˆ8ºCKGµ1šÇ¬Ï¨/íða '=Ô!ÿ¥:êo ³Ç±;)#‚P/ !?/qI¦ò†Ì ˆMñÔ7qòýz^;;BÆd[B€ÉåRq¹` ñE¥H!“QÑýrTlXŒQGQ*¢5Ö¢µ±?þ«)´5e¶ßÒii-‹OTî3'W4ä„:OËØ|w‡]rnácüùqwêà ½#5*ŸòãÑÍ©[²É)›*Ûì^2s¯¿yU.A—"ÄbI­å±ø¶9}‡·ÎðþÆ{å¯ú÷{,¯p;Ïwüò¡LÞùƒUyÃzôT2Á6«¬K뀀¾¼•¬øè%Εy§)<·×~Њµ4úà8ïÅÑZŸ8 ëšcu|ë¤d³&K–Y©“¡ìHŽo…ß_>°ê'ec3-Õ•Ø$H.ûÕÄÑå &²=ÅïŽê­”5ú×L«"Ÿîzö§Ê©Â‹¹eJÿãäËDöFK\á£Ëlí¢<½žD©NÈÀ¬²Œù)×Õ6y—i Éæ7÷u˜²Š‰õâCI6N»^ Ñr@ÄK~/s%–zO9“cT½Üñ"œn¿kí«˜©ç+<ã ¹ç¢_¼îl¯é›á¶òu!=:¤HÏtÿ?±g燮ßÑ_ðQ_>ÇI€\:¤laÚ2È’ù‘ŒÞÌsSõ¯m ÐØŸÑs2¤j¨ ä,ø¥Yg rlŒQ'3D¤!±P1ÕövÑÅíÜ ÞW}¼Ò÷„õ:ò)kö(ƒ“nfÏ {žbÕN߶ï­^øÀç̵ÂyOjûÝxyËÖ•š œºsíïÃ<ΦÕþ¾ý'醗¯Ë×`þ*FSû4è'ƒèôã6ƒ~‰ÅʸæÛ'ÃQÚ‹²»–"3N?èÊ ªªØo“PÿÄc¾ë¼çƒ©Pqi´4µ¡ÊJoU×uµå»ææùµ›33jºÓ⇭Îwt[ÜìSËÓŒb$ýú Ñ „¾lú©¬û^qŽt}$~½ÄqÝ[?ƒP†½Ð9ݳ§±êQZ’(J*ªðMìûÐ.(ï¸U{æ1<çàw4¸!W¡t‡¢Ój}ï.èö®~UŸ­ 2tožÉXzW¾¿©gnEIÏk»½ KÛX-+Îœþùöò‡å¾ž;3µj#ûe‘q²ÛF',JºÀ`þ»0aò>sAâ»oæ_òÓ*îW·:0Šï…;¯ä/Ðæ=½—U=´ÛÍCܧ;ü¸´þÞã¦ïé½îÊEK¬Ê¥å\®Cr[ºwG4”)×\êÙªG7+žî&$e£XŒ¶Ta‹õú\Ã7KìJî’ÚFñ³K3C\Fž?ü+ÀDfõ‚ôÃë endstream endobj 871 0 obj << /Type /FontDescriptor /FontName /NVRBFO+txsyc /Flags 4 /FontBBox [-170 -330 1336 843] /Ascent 464 /CapHeight 490 /Descent 0 /ItalicAngle 0 /StemV 74 /XHeight 441 /CharSet (/colonequal/nequal) /FontFile 870 0 R >> endobj 872 0 obj << /Length1 2088 /Length2 9137 /Length3 0 /Length 10274 /Filter /FlateDecode >> stream xÚuuuXÔ[×6„4‚äÒCw§¤4 50 ÝH#¨€tHHJ§HKKHwKˆt~ã9Ïsð<ïõ]óÏÜ«î{­µ{3ÒiérÊXC-ÁŠPg8'/(î‡ø¹x°å``u–ÁÁ¢^>n^n>Ž@¢ˆ?Zˆ0} w7íï>¯ˆ6ÀbX‚m!ÎØÜ¿Ë«8Û@¼‚Û­Ý]þëóÃÜ$)+Ai uvôXƒmyOAN`ËoYÿÇ r‚8zÿÿý`ˆ­À¢¶†¸;ý¯Wr„XÉ8Û:‚<› nŠ/°µne€ÃÜÁ›Ÿ9[ƒaŽg°Ô ò{ N^žÿñéÙA¬œÁnnà\O¡pˆBšþDôÇPÒRÿ_!`'Ääþ[äfv†„ÿ‹­Áøþc;[ÿï³ýkÜÊššºÊìmð/—‚³Ôâl à @0È›À‹@@€//‚î{!zåær†Â)w¸?À Ãþ½ A €[æ·éo$à–½GBn¹{$ à–¿G"n…€[ññ¸•îBõ=âp«Ü#»Ú=B°«ß#»Æ=B°?½GvÍ0‚]ë!øtî‚O÷ ¸õî‚ýÙ=BðÜ#Ÿá=BðýƒD‘ ?"ää‚8 ÄÞþk@¨¹ÁÁ0ˆ›Ã}""ÔòġÐf YÁ6ð?ÌÀÿ˜aí’yÿ6;€áÿŠáÿÇþ? ÑVÿ ‚Û êˆ8£ÿHømqrºoå÷‰ç¶þ"(Á÷ëÿ‹Að·ßÕäøG ¢o›û„6ˆÇ5~»¡î°?!¶÷~ÛßWøÏ„P»{ÙˆñØy»Øÿˆ@Ø @„Rû? b_@Ä$î "ZvüýIßûssº‡¼ˆ€{* ¢–3â*¸_?‚ÚÙÝÉò÷`û‡$^Äl ÷¢5¡dñò"u¹w#8\@0°ó¿6+Àûë¿÷Ê€8n]ÿ„ þeƒ@ÿ8ˆÁº8ºÿÑ/Ââzßøoävûë²û§¶Ào#¶¶¼¿ÈŒÿÖÁË‹þcM¼ˆIܳIn`'È¿Ïðw ØãÝEÜ ^÷²ݹ9‚Üìþ(Œh˜ ÜþãP!¦÷„þ‘€¨á~ÿ 8Ý_ánVPØŸ+@œ? B°ç_!¢¨×ÁêýD¬Ïç^3¢’ö·‚ßÜZ ˆ3\ÏÛåŸ÷ç÷UþæýëÂaP°Än÷gˆñ5{™ðpñ >Bžß¿ÿþ3û¿Oƒ¬,ÔË—ˆx²×qõ úÿ+Ìʆ8Gð¿ÞeÄóò_lA<Œ`°Ø {zj%j_ÚrþQ†Ò“s}cq¹5êµQW$Î4õÎ×N3MiÌUÖºŒük²Ö÷ᣓ~”lûçC^¦íÁ IÊÙp$…®UÙCÎœ¾‹_í¶`k(…í°PrÔ*áÁmj| 4æƒÉë0¡þÍòü›V·Mc‘]€ à”€.‰+“Õº‹cD÷dÞodJG3Iq×Sy6|ƒ*Äp£B²“8l.(ÚoÖål xL¼€”ä(¹õë¶o¹=ÐA¤†q²F¬×æyfê\ù’Ê †5(›qøÎUI]Mêã˜E'wLƒ¸Ý¶–€£Â6 A…Î~ œ¹c¿éVänhÑ+ Ú¦ÿuQ48›[Á­87Q ví(:oJGJÅÞ`°×r¬Ø£9½…~Zº ÈÀÑ ¹äݨŒJ‹Ô¯‡:Äõñ?ˆO¶éåyÊò±ª9VÅ#*6³=§ó±·¸¿ŽõÕ/Ù&N~«ù£;û#\ûžNú‘&mùø‹qœªƒ¢N)¢Á+pbh–ß-~f 0ë«–9þµKú‰ˆ27ðb²²ô´³³ºZýPCêJ!5¿j$òñð›L)†ÚÃ!P(Åɨ^Gl«ZËŽ@ BµùÖwyú£%©MWJlü› ,g(û26Ëm‰ªÖÃ6‰ªò•—K¼cOìçòâ›Ì, ’—_CÕÉ_¦Ê,9ðM¦&âÛ7 è[ôKû%Ôë(Jþp£ÀÀU'#Ô>ždl[Ž8!ü”¼½Ù[$¢þ©Á%µôîå «Ÿ¥c0jX,­µ©tK#ïEY#×Ã,kYá·ÕW¶I£•|‚á)êÞSCzk²…èøo$[ºlX5swB']%1#È¥êßn×½`IÔ"2Æ n-J/– j±*ŠôPq‹Þ›Œ;šk•¦³0̨±Š)î¨Bs&°žŽå]çüƒO_!™hîì¿fŠÄÙLG0¦¸¶2'ÞG.+ö vWÎ=%T±¬òor _‘{hÍäG*Óê9Jó. ïbÑ9iÈŒøêúU²ÛúŒ ­BÅKÞÛWV¥4žÍ¶?ZY#!ß'(•,Zw,9chœ°?a¶2(ªÞtÓ œy6KW¾ XE^¦B×c7©µp?w?aE•.%gZo7[Ðm?ct?s40`èÍÏõdì$UÂN5«‰$5ãõ™6ôÐáñ“HRÑŽ¡˜nësi aÛki‰8O3RNj-›Ý­O~Á'jÏ®4æ6™'"_¹‚ׯ_˜*ï~Pñ¹¤Ã׺˵€¿DÊèëwaêDAb3³w%®Þ Íù° O›w3JÁõò¢¿¨öFÄÑÍ$Õ NN_cÉQÖIì[s·‘23.˜ô[°Òg‰«†‹ÖÊŇ£=lª†©öœ°‘Rß_E¥)!Í8ð­ Ò«>.7¦W”ÞÖŒ6´AðÉ„˜3UÉ^¢î“@t+‡ •¹}HÒ kO'þmŸ0R'eÖ6šó[,þaº²TúÏ^†Ÿ¶œò'lHMÁPܦeC-JY„ÂÛÈ3‰;¾‚7¾Ùøm¿œ¡yW/cÒµÞ.²×Íð¶7þÇ—  “Ô6Io˜ëiË“–(Õí`÷ž“¸ðTõ8 ,óa«Ìë‚ŸT¬ºâ#PϦÊ”´"Z´úòªÚ–~ꕼ½Ðø\pŒ/6W‡Ï5Õóùr¾baH2Š*TžO­8jDAÝ¥,Ç»ã¯7þmä­[Þ×ÍÕZºAs^’Ù uÎQ¿;mÂy½‘lc Ay—„ÛW0UÌ<5 Æņ/„sr¾c\%‹ãî>ßn;] .è_fÔ–§òŒÉ› fTaåU Èz1¼‰Ç6Ö¡sr¡ÚoÌkð›ÁåZR™«~ñù›9Ýñ•;݇²á©ÂMü¬zñê»ßS}‹nW+* ­öR`çjë…Û'šžHÉG®ž^Y2_P‘—KÓ zg‡7t¹ò̺҅KüMĵì ê°„®ÉG '°ª‹d§µLݨÐFe ‰†­ô¯^?q# M =æðH“Ü埌™:Ild¾p/ÿVÔlóÞ£qÄx\²¥ŸÈQCïÌjrœËK}Ø6§ãK²úr‰¤P8žšq£uéëKÎ öÌOÀ-EIÖÔ…õ¯Fé’0/*‡Óñf‹ºGîÛ¿TßÆìÀ²Lõ²Ûø'tŸ†ÙÈëÊ]¹?†’ÓƒhU!Pmí‹!J·X 棫3Ç*qÒQ™HºWÀë Or¨—fYɨMÐGQšM(»ç¼8ÔÔZÐ…2ÉU¼Ð G 4ôXvPÞˆ*þÅÈQ8c'¥RV(ý®¿fdDú¡£¤RÐÕvô~XL×ßðM“¹¹«>ªSót¤8ä$ùcYÅtŠÕ“ åeà×Ç[=4¦%¤w›uBº$f’Ž~¦‡‡Ë„l¼¸´i4%eéžé§F«‰2«NØ¡šÒäÓûg×dFÜNŽÿ %ûÕ;|þð'JÖO4²Ê•*ö¹#Jk¯;pjÉÙÙ06Œó‡ãU+ª3\8P[Ü­¤OXñ¨7»Öçc¯Oµhñž¥!s’ßøÀLZtmõzÈÑÙï@ Ó[Ðfq ÕÆ;Žžíg7ÆL’,ß>´Rf¬«÷j6}ºüu'ämBÛ§Æú®èI©u]ô¢?’×—²±ÄÍ6ÒøÀ~bXc²¯îE?aƒ6 È‡ªÚßX¦ÀñCy§êÄ0ĹHp¸ŠšÀ$W¹åÇždì^yáÎ|Ê“OmrçfåDfsÎy˜ ß,]§£Ó‹ç/ƒ¨xŠåˆÕNŠ[RôºSþ:sUa"Tà6íÍÙ> {Õ;Ï_ èZò°Uêx´·Z¸I2zÿIlKíׇ{×õâ—s' äI 3'ÝM,0^ÆâÕ´‰ËUGää{ëiÙ¤ÕM…–Ð;€šÞÉÖ+Š@±+ó$öøÖz.¶Äç’»™Ÿ§NS­4C_Q*Ä} A[[ÞöÃç“kÐò¾Òa7G^Í;9®ÿ*aÅGu +~ñ0møXC•˜n9\=eŠ—ÛæÒyŠºÊ@¦ñŒ¤ YvØétkàO²òc”":Ã`³4?dû¡Ï$½Xž<ž¸tÄ‘d:"úÙ˜³¢à)ðkø‰6j$¼Ÿì1ýBÚŦ•KšmK‘­¸]bÀìˆ2ÄÜ)Q­¹5Á[ &hþÜË·"¤®oK^[ç€ó'ïJìÜ¨æ š{Kr¹…óÝÐLÓ+=>zO ›]jŸ¨Ü?üqŽÁ‡tžx%äjÆhÐâ_p ¾Îç̪B9O$^ žø¹ œ"Ž³Ú«ZÞêõ‰Ê“©pž¯JÐ]uï^F£ÊÂjéô+ÕÐv[µL6ˆÂíô§‡°¤Às#›Àmwq‡~ó6rÇ5aÎô±úSr]hÔæÂTœ?_‡l§¹€CÓ=æV/÷¦Èí¼>ÉrnÖdÂŽÐƳt|®ÐQî<•±kb¬~Ž‚K/AÌ@wªm„'{“¤uù O]ãM ­Ã@ÔòGC±úý#çŠeà¢AÕœøÅèQJØm6-³*ŠòZl!¬˜šéi¸ ^¢“˜R‘:yãë±:,§ä B¿C1ΟâjØ»ÊÏq}Q4?PÁ‹²¼u?Á®ÒÇÛcrQ´´Í4ç¯þ(ü5ÅÜõO‡aÀÓNXFùœ4r†Ék‚U®]¸4ó=Fp2¶4_g±!{nÙÊ;Õ7=òá£(©¥ÌS”Ø—ÿZTß×p¤_äØEô=5gv› ³ m¸–Œÿe{€ø¬Ž©-)óT«¤£5·ê·†& ¼È›Sl™Ç|ƒÛËûÒÐËøâWÙ­Q …bÛ¨>åœÚQOôûÎ&1Ëi›…Å.@{Kb(’1aѸlrÒ¤¸Ô°gÕ½°Èôú¡võ#ÝÎ2/¾í-/ïv<ËÍ%q .m77©Áu,ÑÙ!ÌuÝ.bˆÛ韑N« üYô……»Éαæ°ÕG®†ŸÄkØîÞIù±¯E:õGöm푼öAù0¦ªÍ%<- ¨ž&UL®ZwU|“Œ7w’úã¨;FyÞ–ÍCõˆ«†¹u“µ²+Öî½ZuÆmÞf±Œ—âeqÉËbV¦ØÉár<}8ÈÅ™täë»ñŒl -C¯Ÿ‚Ùý®¦kîkFÂd‰l"aw¢¡öãtïñÈW>k>_E k ô¡'BºDé§''{•«óýÎM|´s²õ³k§Xëc¿×Œ ïµeaì»õX'=|fÈB|ÔÁZîf6óÅ’B°£E×üN!‹È$+†úºûìÄIK‘S}Ñ~Îη`ç•¢­çí d‚$w­i14›÷t=½®››VžŸH9#I`Ô·ê×ÊPMìÈàá»@¿•Ú¦«†¸ä‰Dó±r–™”N…+Ž£Žw½®ƒ}Ó~j]Aѽ¤[ëp>dLù„†Çºo%Üy™x'-b¾*|À—ÙHïýnÉS$·‚÷­çX¯þoBðåÔ;/ìü˜»æsž|©L2mI"qêC­Z%šçWØí,{žk°×À·~«E:ûìJ/)ûèØŽÌ0Y†Ù[ÊúrÄ“öš¬]ºŒ{ªI™kãòxœ ¢›¾Ì­¼?:¦n³NÔ fº¾}Î1^áê¹Ôq£kDoÀ^¼òcU=˜äY…¶³ðƼô ê·)€ô+ Û>Ý£òÚG>e.êF#Û¢o _µŘ|´]óyïB‚*> Óï(>Ö¬Kªí\Ë Å0w5œ”AŠÈªh–~D° ]ëìÊ°Ý:/…d)½„ÏJÈ—{"õ‰eOeÞ_€€q™Mþ”Ÿòt˃¯@Ù«ü9I=ºY9—o+œðmLv¡5r÷ÏË?dh{®òXê~Jèb[ £¹zïP¢`èwi+Z«ÖäÒì*fÓ5U¬Þz¹z`ò”Xdæ~2^ YúAkЊWÆëŠ×ÕÌ‚èíš¿ ¸i´*ÄÃâasÞÁ')yTUà[Än•¢ö@‘ÍktÂ>Óc” ä$‰G*¯*?¨p3.¿ a¬«ªXþêvwIªñþýáãÜóö¯t¦èƒ@_ø/K’] vÓR®ðÞ:…G•)Þ\xo<¾ø‡¡ËiA¬£Il’À‘)—4Ÿ(y¸! ›^£y™Å^¡U¦Á¦_¼$‚üLíÏÜVOöû ïå 1£kæ5ðI\Dä¢;Ý<$Á ¼ðÏ¥v10mŠ2Ï RŽæ,‡ªÕl=µ¢a|옶î½=J9dŽü4˜Â£7üçØr¸_0WF‹«‰^´á7'LU´ jZp ¶ÇÈå9ñm…Ÿ'®÷JzaMÙqBNÖ"²úxì^ztÑqŒªµ¿ÕJk.*Øc±þc¬äi¬*ÃyÙ:È©úâ,ì–4ïpa1ƒÖVž¥ó›Š :%%¡j…zk~qìµt]T(i ´·Ÿ³QkáC¤ÓõbkxחŽ·F&ó]ÔÅm豂0Àþ‹7¯¹ÈÆ-\†P,î°L×¥’ DÓ\­ÎžÓTj‚;;àì—RÐç–×èî{!iTÖ*×}7Q*·ZˆÊQËvIôÈÄwÙÚ6¡ ¶ñ¶ŠÅ>êÅÀ(ºÝÑãÿ@MñpÈ›ôcÓÛœnµ!%0QˆòerºFÍ<*ªïÛâ•.†³=¯õè¼`w‡P–ÊŽw•Ü9d'Þ_So¢…f¢óWBÍZ/T–u>= DÑRŸ|%.Ö>.¿¦²Ê@¢ŠGÖK#]Š‚¢ /Õ†Ì]q|i4ä·‰Q=ÈUËc³Õ*+8O4 ¹-¿xd©dºfUÈ‹7ék[œÔHï;¥™Âö8¡ï*–R&y™„›37»PÔÅãûWê?Lý…Ô£œqœ.QÚC'³b;Q«¬úp]佟lhr¦ôЗ=ÂLä¢î<ñÜøœ ûÑVF"àhúKæÄí¯ƒ@Ng3›B"2훩)>ƒè)›KKŠA¡ÕÑHrÐ Ñg»¯¥9 “Ñc{8IA¥Ñ᢫ØѦ4TŽÃU ñLúZží5$Ø“ŸíÄ"ßwx/O °Pn–‹„rž¡?Ïšè a'Š'‰<[/ZÛÃWµ×¸ ,lÜ5ÞAŒ(ÏÇ]Šú‹í†ªÀb»æhHã²/×oÕ¼Æg„p¹³‘Ò u5¾[¡€¦ntp3áçV_â€L¶p,ëãŒ/q#ñmóí¥ªôàÑí>’xŸ%㸰Ž€ÃÈ©{3²%·¹i@ä:î¡úDpÕƇïbwF“öFZúÌ÷`.Ê \Ø[¼ß«#d„{–T +™ªõ¢|¨’;?™ÈT¤J¶L½}J*Tg¬öÕƇœÞNí^7æhØ„ø¼eÔ°aƒÚ¼΋9¯S7Ô·¼Ù`,j嘓ÿäëÙ]ôÄð™¾Ö§P‡èªš'ÑèÅ'.þJ¦«[³kYÌH>éÃ3N]+wJ –%á$^ìg.™—z+Kù¯\H#&ë ú(Øl”…½µãÛäX2¢ÑTvLJ´.9Hú)ºŒ*ÞòSé<3Ï™snw)=X5ÐèÆâÒ½`~ëx_w¸äºø…"l|–l®»JOPÄþYõ´É½cí´ó×…à÷gêÃ>ò‘Öí"‹·–ïõ%1Š»ÖÅÓ„ÿH¹Ñ8ðÎÚÔ*-Þ{^ Û4IÃó]Ö³Ø9#×_¬ÑàŠö› 垌ŒÜYØ3uÕúz‡Îš ‚\A¤*bçmÊûZNf'<.#ÔKn˜ ¶j½‰’$-¹Fa¬Á_|’qheg xòáÿÐåË—öhk³ |×lœÈj¾¦ðC˪£7º‘ªeÍð«óŒå®•y_ÒW‘l¹äºÃªå´¦…"¸Si&206 ]òÀ¶U”¯”QyQFµ{m|3¹6yïü¤_:uÃWò¤nØñbfOý—NßkeÀ ?qd´ø&4žå5NX8f²î–„­!iɼO• EÍã:¶e3–L˜6~%[h‰Ppï >(o±2Úr”BfÛ±óô ü°ìÆžÂzª~üÕôöýÓ‰oh[+øGjsQ×aæe—ÌtÜÞ©î~Â+‡) ËåëšØë‘ÞÏ«·H˜Í%xa-ðƒ‘¤Øx­jÖ=Ø"`Qp;ÅæòÖ|ÉgQ À)Šo‘@õ³•÷×3YšŽ)øqIZo&Tº1ì_Ø¥ZųS$CÉw¢èî‹Ou~û¬´ˆ¤Jîc\'Ý=÷þ>á~²du›ßãCh7ÇÙá—éæ%„gÇ®^—ªä2…ú¾«¨e`I9S”¾½ª|Ю7-œ¹¿bºÞm2Äþâ<_°T~áÙ‡$œÉ^ZÕs‰ÏWdhžu>Ê}GŸ1™!R*m2Ó¸jAVœ¥–v±.±Éºˆ2Aï®îUG^¿i³32úA¢Ó|ºâ9Ý£…3Sý¾Õoù.é¡Vºñ¶D(Æ Î¸ÀW*Í ¦¹ôHÏ ÝÖ@;ÓMrZ" :HjÒd¢—ôÀÙKpýòéÜ D»A­ l;eøjl Jz{™·¤X™¥õ¶¯Ÿv¾²Þ–j¤¦XÊ DïzÎMÏYè’Bn}`DUxèTöRžÎÂôZ]RbVµn®ZfX´€òv>… ¥Ú~“¿‹±WÔ§5ñ{QˆG£„nŽ«G€‡¥h¢;Þ\ô—ŒL“™6 i ú›Ïgª¿®Ó;$•ÝZÁCÍÙaóµÕ_Ã=Ǫ ³Äú…Î'’"?‹[–XúúÀ€Jò ßKãÙó m%áýW®ÛjM£â¢g(g‹«Œ9GÂí!ÇÇþ®ØñéÔ3·•RìBzŽÒŒá˜WtRYïÉ)EUÖÛ•fÓŒ•¹‘Dvð«l·–*m©ÂE-=xööµG…ŽÞñNL°2c ÄŸ(2¥’_,ÈÃãvµJåê‘}*%4Â$" µ4”Ô,ŬìerL¹êÙÊi\¹³vp} Œ†¾ÊAº‘,'Ó{>9Úø̉n¤ŽO7øò¾¶DëWÑ'|5aäcV j“é¡N5!,è"ˆÂøÁŠþØdd€öœ®’™P7«™½b­h7ÿë@Pئò(. §Qôq‡Ü¬+Õ`®DQîe.àl~ÀþWò•§â^¨ÆåĨGæû ÑÊŽnJƒç|}¢ƒš»Ó'­|hºÚ£¼Yùñ!y^ÞoGP÷O½D)b6Ñƺ)Å\ŠäšÛfmدîλ³BÐÔÏh^h»8š‘~]›wX–_«™ßa´ h懤ÉÕ‘ŒôI d͇©æN}ü¨Wk÷œ¤J²± Snka±‹!3sfàCŽ¾âgsøOªå‚½Å6‡G?‚Óyš}×ð6·V‡¦ÀÊ<Õ¢3Ï¥½Qôéz’“«V­;‹#iOs€›Ÿ”T•Ï°N«#BÊwemhóžÅâk1Yówã0T8¸¿¢ròå—°=K­ÌÖ1hs`*©C×BG®_Ïãd¿Å®Y¢»¤*õgeÕ‘šÏ.)x΢¥ÌÍâÞ^Û.¤Ì_,g…4R#†4Û?öÒê_k, ãÅ·ïT-ÑPîbTÈÙÆÄjQ%ZP=­Sé_#2öd÷xÒ¸kt,ªÊ‚e—µ3’A4Òªõ„›øôb*cüc%Û§ÖD̳þi*“píÖSãƒÔÉj4³×XOëÓA£ßâõ5þðüàx‡¢ôˆûq¤:§xŠþBÉWc@Tz· Á?dPš¨› Ü,)â³L9–øµënøM$JÁå[Åümû¢ŒFä]B4Û­¸RÞõ0c쌆Âinm—êÀª¾t 3÷ñ|nú8Fæ#ã—6êÒïUåPÒ%‚@Ùõ‹`ÂNF…‹9p¢E¥¦€ìBvB;ÕV¯ÐÏ^yöèF®pCZÍÝ “‘¸OÛm>Ź`lƒòV}2ÙKä«#NÑ­ö»¶¾ó«M.%£ú4ÞNåîÅh+¶:®«­Õ`i¥É±Ýݤ"›Þ´”c¢²b’ùÞÊQ/ãœÜ™7ø?µœ½Õ+‹™ m”¢Ô]¡(eQ ”ÿ1VÊ)É{ "K’ûÉn§L4?yüsÌðQ’šXéÛÃÉÈY_äYS†³î(ê…ëÄpÎ ¾$d¡¾e\¨T†ûÃÇ¢ÚðÉíÚµ8Wc®Š‡Ÿ´Ý®Ÿý’׌5_d}#å:„RBÒ£«Tû`$š¼XVz ³±Ä@%?,a²^ZÍFÂ1]˜<Ü°;Buã—3ÛajAÎr™Š j²aŽ?îlÖ~õ$0¹63ИŸoûÀß7]W"yùSQ/ZGñãùž=Â@oýSÌIvVq¢Èšƒ÷ÉËýõÖ&FEÅ#aà}ZêS½R6¢]öš÷ôòoÄùuŒ´«ÛÄ éZd„ܹU]ŽR8ëÞ?Œ‡´½YË­¼™Lññ†h3„½Z¹¶O;+ R4VdÃx”¿f×5QKµ^ë³›?Ãήi'ˆ*¤¸ûc³V‡4'9tµ»Á`"jÂFUP7‘*ÞG%­]F %ÿRï î0‰ý>™·*âÝJŒ×Âò«¿À§½ÒäüiñdÎLļŠ}¬N~Ó #)ÿ˜[#´Ne{›ÿþÙ„úŒ­·W«øgS삪RÊ›jŽæèçn »½F›Ï|ë#6%§¾âüêÛëv¥°Ucâj<ýô¶sGú`Yg*…ÇÐê*ßzõ%ÁYû‰j¥Òp§9Ÿv2“WÑö R;®X Ýò>|¯Ð¹ç8Í)z§ÇÃ**J’öU‚Et (NâΩõMJh ÇâYÕè9°Àcö>¾ ‹ûzs+œeá'7q[?¬fF""X)iªh·bVqqã â"I±•Ó”qSÍš®€¾+’·¿xÝhêŸ*;ÎÈPÀ Ù‹øl^ZÀlÒqÜXuL¥cJÅ«ž®ä÷ó¡M–llF½h¹Åò t%sºvuÓá’bEÅŠQº|@Š1@¬WX%Žü«<±.ÉO޵ǫZ ›‹“ÕGBŸ&M¸D–þ®ýúÕ͇ÿ7s: endstream endobj 873 0 obj << /Type /FontDescriptor /FontName /HOOWSH+txtt /Flags 4 /FontBBox [-5 -183 542 746] /Ascent 669 /CapHeight 622 /Descent -167 /ItalicAngle 0 /StemV 85 /XHeight 461 /CharSet (/A/B/C/D/E/F/G/H/I/K/L/M/N/O/P/R/S/T/U/W/X/Y/a/ampersand/asterisk/b/braceleft/braceright/bracketleft/bracketright/c/colon/comma/d/e/eight/equal/f/five/four/g/greater/h/hyphen/i/j/k/l/less/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/question/quotedbl/quoteright/r/s/semicolon/seven/six/slash/t/three/two/u/underscore/v/w/x/y/z/zero) /FontFile 872 0 R >> endobj 874 0 obj << /Length1 1166 /Length2 5969 /Length3 0 /Length 6736 /Filter /FlateDecode >> stream xÚuUu\”ëºE@I¥a躻¤¤;‡a`˜!†–¥¤»CéD”T ¥CB¤/î}÷Ù÷ìsîoþøÞw­ç{b=ëû ;³ž¿‚#Ò¢ŠD ø I€ÌÍÞÛËÀñÿê ¸EìØÙ a(8ä?è[BÉb‡‚!Êv¨[ÞÐÙ mç A’ qIÁÛ3Hø¯@¤§$@Ïæ† èAPO8 qK)#¼Ý ”·»;q|ñBz{:@¼$N·ýgU€ÒÝßuF¸Œ™póòòýJHHìýÿbÊ/à¸=ø@àH÷ß•nS¨AÏÛ¦Çê9Ù©8ÂP¿Çp9£Pî’îNv[ èåD@PÜ·ª •n¿xüÖLæ q¸Ê_àŸº¹"¾ˆÀÿ€`Ç?Frôv0BÀ<¼!Êÿ| üA!(€H$@<?gß% ýÝ!‚¿a;„cP ;Òàd÷‚Áœ ·‚@/;åé ü¿Ä¿ßŽ0À½]ÃßÙoaˆÓŸwm;”'Ì`‚@‚Ðïß¿NV· uD"àþ‡ëعAÚŠŠ&ª ¼ÿœý_QŠŠÈÛ”ü‚b`¿¸È­Sn3Jˆÿ3ã¿´øK‡?P=;Øÿö ú;¥ øsœ[ÿÉâéuëM×6æü{~$ æpýmKèÖ5·Áÿj©ãÿ«±þYCÕÿC®?åÜêáxø­ÜÎó?ÂíÜ`pÿÿòÂ?M ºÿÿÉ£²ƒÃPø¿d‚y©Âü Žz0”ƒóŸvùKeÇ?¾CˆÒ öûKð Šþƒ3t†9¸" ^^·»øƒ‚ ÿQRá€t„! Ô­+í<ÿü¦¼==oåùcA·ïþuw‚Ý6øAf‘R‘./#;Ïè|ù7Ç…ûE~üòf$Àï¬1ût¨]+éÀŧâéùÊz#βuXÚXw¢“èTÄ|]%»€¸äQä˜ê1´_MÒ:’DÇx\“ß@ý´ÉñÔ™…»JþƒêGÌÕ?ÌØe•ÆÈ ¢‘÷CÎÍ·wp½#ŸçW@ØîÛ×û²Ä®T±R{?ÄUû¼öé¼uThd®k鄆ZÅGQv¶\äϺQ-´ÙòQêëÖú²>ŠÑhɈ¡O‚¬O ÷‘A¶ì=Ö0°ySš-ª–Øv‘P(“>j¶¥€…t×%å§à1í0lOY·æ¸Ë§Wýc pŽvýg­¨òaYç Wñ/uµ9ÄlsÍCXÌb¯"?“v£Ü~´À[pÛàâ¨Kœ3ìå¨>Ä z6ïþ ŽÃKÏ*i‹w*"9yYfÆèWðeu‚¢‘äÀ9McÊ°>©«íάÅ_Ŭ<}bX>³ „Å?Å"*áÔÁ(«O¥oßÔÉö…ˆÂ«MÒØŸF„ÒÉðÄÄ É5æÜ×:õ!o¶Õ< ¨°Ï’ÑÕÁ2ælL¹^íön:s“}âηL4`†/çþÀ{ù—Á¹J.ÇñƒúáˆM3ÉGœå‰Œ¨lÊä6*ÛP¨Ì½Ø¹}òaº{÷žáú›[‡‘Ö?Q u)Ši®˜¼~ÜÛ@DðâζÂ$^ÌZŒìɶИ‚w¯¢™¤"T¬~ö_;ËþwªYJÁ×Ù#­râD¸æ)¾ÀvjHþý¦¶Æ,ÿ€f߉Ãý#xÛk™í8`Á“W™Û‘;7:K "þØaS.êž’ÄmÌ¿:x¡‰”µŸ+ýÏŽ8/T×å¥3éaî öhô ¢Ü5gþCî}¸ÎE6J÷K¶°ËÍÂB‡Ì —¤O[ê9¶ói‰õ諳7-ç烰çÇï²:]9*èMkºPZ¬3ŒíŸ=ÔµQ”*ıp&Ýe.)Šþ¼¶gõÇâá+ÙüY®‹©1¹`W?ÝÆÔ\ÇÕGkxYÀOnÞ1é$âØíridUg}[ÖÁæ…JQe®ïç?§c² Îf_§³ÍÀŒr§›MÜ¥N6²£Y‡”^«NîYyxPY”³S ^rkmSÁ‚ÛD´â‹¹y£(õɧœÕ3e=¦ã›2½§c>¯Ð(:xL—x¬=%‹à«øÉ€ä–ØHXÑÜ«ÙçòY3§³õ·ŽºÊ?v6†jÆÙfñª¼É’ 7}åÀ¼º ;¨-³OÊõeéQSwú:¦žöÑñ”ÛÞÿŠ#ÈØ>¢$«—p5¿;×ÿhžàx•ËwIÜeíº¦x¥Zª›¬Êñ·Øûî•JR¡Nc½>ç©5¡âã âi¦þÇÉï2QcÝ…b[Ù$»ú¬Q£9ánÊKXR¬)Äì…y ß5eÉÌ‹ÕóK¾Hc}¯MxÚ—ZîÉ$äIÐÏ.¡6ßÇËPÞئ±¥HQÞ|4Ÿ}”¼9[QÒõŽ}¬{ÿ†?–¿ºÇàì ïB3ùÁزYú‹ÎðÇh¼ÔõdgúO]ó Éå…ÖdELZ¹>˜U{½Š?É>EŽHXsU™#7 Ð&½›³FwXúeGrD¨³qÒ–]* ?zvÒí²vÃw¼§Ø-†þ†F}¡ððl ô8ŽÈnT‘¹:Ôœ•N”ZŸœuÃo,g²zBG®F©]“€ÎäÌ®3íxagê8‹uRQrnB/0žÑ´S‰»%¯*?9|¹.+ n?ìÀ)£—±Ö²¤‹wÞév‹@  ýÜÅ.ùè†êÓ#šR©„£ <÷ÖbŸ}ú¨ñ u ì±wS›ˆ›¾"vÿ¨C+1b1i¡Só­*ùÙÖ$^=ÃJeæ„Ç»É>K+“g¹»‹eUi§G’¾y¹œ b9UŸñ¡ø]Mïõ&ÏÜIÐw8ŠN)%÷föÄâˆätÒÏÀ¯2Y“˺ãæéï;Õ©ÿP>ISõO¶vët2y&aOXläš½"úz&>®[(/Ô×ùå1ÜH0÷õôW ]¸;çâ¼0À@<GEƒ¹³®7!%Z Eg>*x(ÇȾã©yŠÇùŠ{œÎ‡æ®UT\\ Õ£ïÖLÜ…äcà]šÔζÉ= :5Ž-8¾‘ÝÉ$Ø`]sb&#€Xýl—·ÏPÖ~yÍœ‹KYKëTù(@¿\­6X‚?0sÅê¯ Œu†ûÞ¼ÐÚ,ÕÚxR,Ð))Y(*ôÓB(ªá<&½?}½3ÀÒé+ -¾ÉØ^|eq?ÉÚT¯iÎRqnÏ“‘Sæmc¶|ÕŒ¢7G»ûS9hÄbs‚«;y#‚ç6¬z2eð6âXõ½±mµ]™’ƒï³óîan¥5O•~R—$:ÂRcFºAÓkE§€c8ÒMÓ^w—âU†&½| «Õsjr5%$ðî}Ë0·•Üç(÷ø!Ä)iw{Fx·Ã';s†¹(– !ëoÐÔ"‹4x“¿‡PÉJ[ƒˆa7f>6¤?.“dF~<ùB¯ùuïkFƪ Ï%jã\æWÞÇ5\^ô4D¢ö?¹²šŒÃk›%¬*÷GÉ\?Ôuˆ…ÀÔÆH*Ž<=§(=ykY$vò3àT¦Â¾^G†ìïÍÊ趃높êx}M…ST üLQú"?â® t‹×{ +£®˜ø¿„H:$fSI™ðö7á#ìíï¯C°ào?é%ÉL¾j¨Þ6¥×Ç“ÏîVÍ9Ó»Ž††FÕ‘ö¢íF¤œ’^·Átp˜±ƒƒŸŸŽ¤™5Ž5RûóWb×NE3kðhn„ j6¤É>wâ¶<ž¡x8÷<þ ;°HܧÌïX¬ÞW6Ø67«¿GTŒÛâdA…M3oί4‘ù+X2ä(íI,ÝÀ©%Åi'¾)²ñ mô£Q¬£?Nw¤2dVJ\h—TÞc|YÉü€‡ã©Tó%©<<‘C¡}¢¤•öÖèYéAñ› åÚ…á°¾zÁ<ø›©Øø—da^çö¦Ÿ?æ;dxgG¨s}ãµpÉÐqc³4‰‡{>g2¶Ðk€Ú¯CÕhU% ‹ÐX7L~Wæ\k2¶[žg¤ýμœùbµ5áûI”Gy-Ë£²ëˆC”Üû}†±’vÇ%Óïý6aÎ×Sr®Ée¥¨J4’DJ[^hôÑÝÙ°xž}Es€ÔE1z!Ên‚M(Ý3yî$•ß‰gEë²»¦–”äÛÙ eCòYɲßp+a؆k‹TÄšrgîíž‘ÍÊ,†{i˜†ÜùÙΉ¯”©ás˜õÁï‹„N<íO Ó3ÁŒ×µ–”ÿVKq¸y 8(~…»P ²·`Xá2ª¹¾ŒëÀû\!*°«64j݃Çðdv#1|yHÇö)Wuê=ê–Ðòqz½=+…¯3¸sìpŠ'nG­?éú€;® ”€•+Þâ©!̓K±_²5ÓãÌ£l|Z¾d®{.+Sº‹µžZ~Kyßðò½í¾7Í,7Ymˆ”óø=HË•²ð°‚Þaª÷¯ú}hA–¥ÆX]~pêÁµÖ2ñÙ¡VÒ¢i$S¶½¹@ŠF¸çæÞg©X”\I¿çºghõi'ñp‘ð´VEõö¾WnÆÜzÁTÒÝjT8ÇИŒ¬3)cœáqΛ*=wÎe•¬aeΕÖTSØÇIð@WÈ—n¤èGx.IJÚ³£!š« *tÄfU¶áVÎM}‘—+7í•éZZ7€oï›åÌÀTÖ`ÝMTFeG6—w°YåĉHǯڳ *¶þ®#ÌMVK€aº)¦üÂù‰•HDÒ#U-Ç°;œ†›Ç™ÎùÃæù£"ëÞyä¶ù‹ÆUK,{©Õ;ÿD«\W¤BÝeè­¢fF»7AGÞ$qÆW®Ú6¬$|¡ÚÓäh]¿»?ª©kÆk¦K¼‹y¦ÙX•m¨Ìš>…%ÛâŠM€ ¸cð´"“S9/û:Qfx¶ôN­å ÇD¸e‚ô«žWèî×c•ÁFÏmTÞ‘0¬-wÆb7MÔCâïŸá]I'ã[GÓBˆ‹™ñ[ݸ «d«Vîâü ~Ê·Ó90®<÷Ìt^%ûýOJá UÖé²MáæR“mvÇdÒ•;*?¡…ìþAñ:Xé^¤ M}ÚÁàéµh‹dÁsㆭªÄ\k<ÖÕOX ´yœzp cœ—8Î,ÃElÆ{«ôšö+Г‰—=M¶¯Á³&œt¯÷_U订o뎘>¦8c>ÍW%¾l>³ýŠ!ÀBjHn÷Óì«ÊÖIΊ‘ȼmOýN¯\@D›àPÎÜ韱1PiçÓašeí,"BÆV/é›<-½>¤fþµË,J²ÛÙbã»sM\‘nÑÖd6»kY—’¨ôõpSý§tÁ•ÆlӀʼô¼ÿ–åcó!6b‹j“°c½oâ\¯,äL¬ #ˆhýBü,ʨÒQ„1üòÓÅß“47iA\³ÓýQs룂KòPU©Ü„Ï$67eg.\àÆ Ÿ€ðcÞNiíö䘜#íÞqlÀÂo-¨tŒÀäGզů žM=®> wŽÚ+örÿ€*,òIQ8ÀkÉèX‰BUªRáÁM©¬9#®Mý!É)Íé¢{A«Cký ³]]²Á˜b€WìVÊ^'ã_<ÑâòÑJI½$®ý®Ô ~*ŠË\âÂ&G/0Nf½³«DJ,m¶ÛÇ-_äBôoLú'ç—~7ɧÈîl÷žsI?#(°?qz¼Á9Æ?\n¥ÕÆ¿J·ö04H½XáÅ­û ND<½ Më¦#xe¦ÊaàϘ1g†_Ïßÿœ»ð,~‚‚ä›#ßÕæwm͇iëA¹m›Ô$ô†¨‘Ÿ)­–vR!kG#З.Ì ß×è6ùD¸Ð/ydì§M¼ˆ)R 8lGa×õÊ; äâ‡ÝK#ËQ˜/iÀî?•ˆÖm¿~½4ã–1†*´arÐgímZptŸµ”î&Ï*¶æ>u¬ìÛ&Üã~ä¸àÖ{G¸Õ9vØŸÎ&ÛˆŽ ɨ½¶JŒÌ¡Q ;…s3["ÕHN'øúí¿—|m<.7v1Åóé#ò÷{ó1RªÔ©V‚zÔ.!i¼¯ ]1ã(ËÄ?¾p±½ˆý°O F endstream endobj 875 0 obj << /Type /FontDescriptor /FontName /MBBWFA+NimbusSanL-Regu /Flags 4 /FontBBox [-174 -285 1001 953] /Ascent 712 /CapHeight 712 /Descent -214 /ItalicAngle 0 /StemV 85 /XHeight 523 /CharSet (/A/C/D/I/L/N/O/P/Q/R/S/a/b/c/colon/d/e/f/g/h/hyphen/i/j/l/m/n/o/p/parenleft/parenright/period/r/s/slash/t/u/v/w/y) /FontFile 874 0 R >> endobj 876 0 obj << /Length1 1626 /Length2 15681 /Length3 0 /Length 16526 /Filter /FlateDecode >> stream xÚ­¸ctem·&Tl;Ù±mW¬ *¶wìÛ¶mÛ¶U±+6*£Â®ç}»Ïéq¾þþtŸkŒuO^s^óžcïEIª¤Â(bjo ”´·sfdebá(XÚ»€”ímìy¿1ÊM-åœð””bN@#gK{;q#g @h šØج¼¼¼ð”1{'Ks gš²-==ÃJþ1{ü/Í_O¥¹€êï‹+ÐÆÞÁhçü7Äÿµ£ p¶Ì,m€1E%-)”‚@ ht2²(¹ÛXš¾Yší@@Z€™½Àæ߀‰½©å?¥˜þÆŒ  ‰å_7 » ÐáÀèdk ý}X‚æNFvÎ{àl°´3±q1ýÀ_¹™ý¿98Ùÿµ°ý«ûLÉä 2q²tpüͪ$.ùoœÎFÎÿäYþUìÍþZšÚ›¸üSÒ¿tÃüÕ:YÚÎ@wçr¦– #¿¹ÿsp²ü ¥ù"`8ÍœLm€ Ðß0cÿÓÿ¬ð¿Uoäà`ãñ/oûYýKgÐÆŒ ž•íoN翹Í-íà™ÿ™;3{+Ë¿å¦.ÿKç túWƒhþ™Ú¿ ŒLííl<¦@3xf{ç¿)4ÿw,3ý÷‘üß@ñ Áÿ-ôþ¿‘û_9úß.ñÿë}þ¯¡%]llŒlÿÀ¿w àï’1²üÝ3€o€‹íÿÇÅÈÖÒÆãÿÏé¿ZkÿVÔÞÆô¿êdœþ¶DÄÎü/-,L,ÿZ‚$-ݦJ–Î&3#›¿ýú—\ÍÎèdciüËë¿Z `deaù/:U Kk»àü· hgú_áÿ¥ê_à™å”•5¾)Óÿ–ë¿ •þ³ª‡Ã_lÿ³y{Óÿ8üFTÔÞàÅÈÊÅ`dç`ý{÷þâåbñù?¤üW Öÿ<Ë9;YºtþÖÍÂú¯êÿçóŸ'½ÿFÂÎÄÞôŸ±Qq6²3ý;iÿ!øGmââäô—à]þ¿Uÿ¯ó¿ftšÀ¯¯Ø›ð[¥ge8×ãäN‹ë ö³BŽ†8”5©ú×Ú÷ù¥‡ïòV¾Õ…05Ïð}tx,Ÿ;¼ÊÒ÷cÛP÷¥úÓ¢mQuqÓ2ë—!e\hD{]-}Ûù¢ÍÅ¢~´7ý]Y¿ô šh¦‹Ý öê‰ÖŸÜµÐ“âÑÙ×$­1«µ ½¾èü‚*éôé‘zxblt¤ïjà€>7Ž’ßÇ7åœ4ÙÙÃÐé¾ÉäêÅ•ÛLmÂÅA[v]Œ)Á´¥3SÞ¬f‹Î/‹yˆ¾F“io¹®öñÎV>E=P/ZÔö±Tü»KÝéBƒ”ã—¶ááe"°¦øLÒ ¨µøþ§˜ç/aÇðsÜ,œÌõP²ìÕõí4æýg`Œ$_ÊåÜ9â'<Ù8Sf‹Œ}9Þ„Œ3¢€=÷gà|¢¡¼—_´2=×®ÆQŒ¡7J4+`oHb$š»V]pPû…¥çò}ËçÝð¤¹Þ7K‡ÌG‡þzÏŸH;¡[³k̇3^òHVô¶ÇÇX;wºaç3c¹±‚™q´ªyo^͸õ)Hð¹„Ç4õœp©dþý%ɇ$Š°Š-ÐàåUB¨Òé»Ã¯ùON€,z’¾£\ôoËÎÐv.øž%UÑXZzþeZúñÓ–T#ó«<‡¢å zJþÉOÕ@Á¬ÂÅHg‚2ǹ…ífE'X¢ìÈ_ÇÖLÝü_Û½¹ü¾RÞ7W[ø»`ôÀöeG¨^2jÎÏH`'Ð]Pþêe)Í® §¿Ÿn3÷9¯'íÑ6\Äoµø(i*ŽÏÃT¥.c`¨»à¨–òýò8ô“‰§Æ9>tÞe†7h×7-´¾dwúºó¦÷¡{ŸÐâ_·cÆ-…à?µ[Å,^<"ܘuveAbðaÖ7ÎìV=i›Yzßôð½åfë7£ þÓd'•ý+‡I7Áb0é†!´qª½¯Fþ ÎV§;JBîÚPˆQ<­!Qêe9»[¢ 0]½ÓÓ>Å×ö>Q• æ3P®C™_/郯‡û#˜ ¬ÿ.\¸½ÝVv –teˆû»ÎK#äJÒûçÁ nŸ>öN±©O£áÝŒ€žz ägš…³ìLÙ‘=B…P?Ìšÿµ;ToÔúCX¹ñ:¡ÒaCKW»Ô XG´<¹¹y+=ÀESGü°(Àoä\ÿ>Ûà–€¼¢Ã¥É“ îºÿüuä'®š5HN¹éY+ñÍåcm•‹,òÍ);ªBÔ´³!º^~¶Ki–X§  ó <¦oë1tÊc_PÇÃ*ƒƒ7'[ê»c¾ m3¦ÿ¢¦åMÿ#AAÒM¡žÚúA¢_ÛŽQ|w‰:„µA±1iìÛMÝUš¯ÕMÉÓ©ßÜNÏ&Q)Ño!IɧgYVú´ÉøÂH"ŸŽi=œ©ë½TÝXÞ‚™¥žotŸ©2˜ú¸;Ñ¿årµf(ß9þ®ž‚W{aJäúE¯gñ¯•c¡üÐÏDÓ‰[}àæfÿ˜zí¢æ*`WØT¦âZn{µójs ¼¢”üsÊ ž/Áô^­$÷~IȾ9HxySY3y¬º‡¢¿Ó!ä(„õùžP•¼»>GãFáÍæö ú‡#Þ~^RÈéqáç;Vf¹ŒÅp³ï(ÜãåÒ6{UÁe¦¬:óF'œ}AuŒÕuqáéìºÆºÐÏ#ÌËÏ ý0Ì€'¾ï8V©|=Ûô­.…’:…+à«ø}­Oe·X!Ë{5ëjf› º& Qå¡®•ÉœVS%ÀLUýM¿ùAP¤’*•Â­¹wªœwAŒ›GÙ{5©ÆɨþÙ±-;äe8¬T#œgãiÂcŸÆ\?ÜØCŒù ?$ó?ô^Ýü& Ñ½ì Ž[ÉûÃÃÒh@uÚ2kä¯ÓŠ6Á` ¾Ž½Dô“­HŸ%|Z•;®[‘ Þ`têsòè«éԥ݄:‚àÃoƒ÷Àß0MWrz25-b®WÏb—¸9pÅJuå¦@‰J¸˜®@Ôt;*æ|Mœþ±àS¡H»w8`44tÝ–T²[Ãqc\­Ô;­¼J:.rA@%‰KÙ¿ŒðÜõ]îÂ&¸‰p{†QM×rŽCR_,Εܩٌç¿xø’<¹v©Â>-Æö%w5A=¯t¨¾ôÖJõj~€1ØöÊR["ýÏâD\:i4­C´‡`©Õà@+S×ÜÈ̳R#úíZÙ‚/µ–A+ œÈ‘ŠI qz(×—®_B]×X*´Ù!8ë3—„“êF Fäú8>š«/#Ò™#§M’ÖמV<VÇ#;ÇŒ:'oh“€úQ`Ô>Î|Þø]·(t·è me‹Ê F+”p€5yðáŽç}b­³üe¤ù$“Öl2ï2e•Ë’Ä4(·ªHèÎr¤ÉÉÌŽ«S¡ñÆ·8˜‚ŠW¸)›ê3ŽuaûΫ£=ˆ]QIh4Q¨òuKœÄ‘·v6Go?4½cÒ0Îv<¥«gæªËÿDpáò½*kšì$°E¼¹.àøþÈ“ÂR泃ٗ&§Þµ<ÅÈÊþí9‘? ñù³Ö{B]^Hº˜(yãºIàk±(”Î îÏÔW+ök'qž(n²Ÿ0àøÒý…9Ú#E×/LÑGŒ§W‡F™‚æq2¤N»Zü¶‡¹X£¯‰Äz:ƒð½¬bZè矇VN·»„²:¢¶rD·&‹ 0.#+fz_%([Ÿù-Š)6 j¦ÕÎHSc*Éc&ÚWdéßOçTÑÀvnDã&‹'wúdaÏN„«º ÛPa€Ãåt húNùCtßxl¶Íâ)‚“I5Ò#S ‡·íÅUL~¯°4µàM«yŸ5Ã߆ÑBdE‘€Ïž.i°Pñº9ÃJ‡Å™8Eíä29¢-‹?Ž@&Uso cßD‹š¸C½ »&IŸµ œþÂÏ .ÊgýntÓQù,ÌûdÞ£S:EQvgÄÍ v´û*ýÃë´‘†¦¢cÅÓ?V}õmßâôI£‹Ò¯ËsÙ¢öApûðÃAu¯ vzDœ¨É½Å>÷×]ÌöÎ:¶ìÍD¿ ñ ŽÎ—íGüæÖ–‘o8wM¯Y ÿ‰ôð‰%ÇŠg‘yŠÁ’¯ÅÍÑDSìÃ2ÅY.ãÒèT^ ‰¿šÍ×q>6Mÿ¨xÉ0½|ÍÓ©î#RkpJuRª{›`UVÙÖ†ZÝTŽ³Õ|.<+5Å%ø—ò´¥Ã¥6Ñ)s‚]b;Ÿ1oùµ—dýqQ3âKíÂÄ7—YZ®Œ`ŽÙVË? ÞÕ£’a+¨Õ!á¼z ¾!X¾M~H 0ö¶ÕŽ&ô™¯bq¬?hþÜ BOY•ÕDp‡^—6Ÿ®q€‰†±æ G¢(¿íCLæÈ#N¹–y™e¬oðyAÆ`‹ž+-ròl…˜ , õcâz—*4%MŸï îzËqÄ!í•)«t ƒ–-»ØO Ìݶiùj]a§M ±ûý)ŠãåÍÜ&?´IH×Юké?¶DÈíÒ®×°×u6Ös‡“˜ëÓÅ"Gf„Q‰C)%RGèD4Vo;ìô8}‘5Èè›3©GÐüÈu8^g1\*¨‰-ÐØ‹Òؤ¾…ÿ,1n(j6z¼çÜL‚$¦äk"ã2 YCÿƒ3KAn‘b´bͶÜH¤úm8~¹í6v‹ØEWöċ] ¶?Œôò¬M9ÙÖœ{B9öÇk¡)é°z¨>‹§Î$eB±“1$L‘Ì"­xb\>ûc)i¯ÇxƸt>ÿ:ˆÁc•Õ«s_V¶êõïN™“¹ô ò¬<¹œäÀ‡týíပîÍ­A€Ø×?=$‡¬¹ò¤~ójx0⬊´ªKWY•ÏÆæy¾ðÌëèÕùT¼®u—ýì~—E"÷¦Ä–qæ÷é4¿ä9&g³üArreª/ø6ñ…MîL©q7Y|2.”õæÙTx¡³ÈÁ¼qsáâÃPçÅ óìxySKïež¼×Ý>Æ6å¥h#U)O–å- 悼pS{Ëñ7à–Ê(–F¨`*z†D^2º^°:tššDÙÃPÐw[£lDðs˜•Æ%,äÇAEaÉâõ~úÌÂGG¥ í§²‚@ðÕE5I'}ÜëI=i¿õéQþéß>¡‚veõug\ ˆ—7^×ÏLj½Ui`oŒ¯ÅÅ«B»ÓÈáPr†R#&òENæUF‡Ò*èŠ4riÝ-´ìË¥€Šê øçòLƒ;ØÆt€S€Mü—#]A»Ç¼Q$v'ŸZeüØ÷01<âof Ù¡áñÍŒiw5çÜÚ%8ÚÇ. SªHRʬ›Þîk­-v¶™Šbåk¼­êÔ–'®š•4­ÖÓoîj’Nͳª`÷mÝ×K%yˆŽUƒšmÛBNÏ$¨wlqçSÕhÊÊKÓO »åû@ixKDãcb!i­@T)ó7Pàœ6lÃoð‘ HHËy·3ýʬnÈX(–ÆÞÈ,ñüÖƒŠ‡¯A >êñ áb¿–®¼à2Q¡_úâéðÐóͪj+‹,@—ZØÇÚmâ­ï”ÙãK1!–ÌpAöŽÁ“]õöÒXÙ÷W¡ñ…-È tÕ ÏlÕÏ F2¯Û˜;R¼8`ÉÁùJq\?ØøCŸúQœônS6ò'¤ZV¿SqäìÚ¡ÚR›ªÇªÚúšI‹O1Æ$Y<´ªÄRhJ 'Æ£Ù ©R¸õmÃ'åëÁç)…{eó­ *Eè NÅP3JL'À]ø­M)+­¾GÎ  šŒ½˜çBm¯ÌîaúÁ к2¿Ï’–DeL­ˆý :òAö·i›ç˜Áð" õ­®´`0>ÊôE'ãø"ÅzKcdiÒAÛî6Ä:णV µu®¨QKòÛ<:°·g7;R Ó>"š±uP»=ÛÜàH¨%o#‹¥àu+½Á¯{ä 2Ò0QnöPVÝftût?€¿ªND›‡~<þ˜ÌãlÎJã«v˜06e‰—Ck¿’]Èc¥(ÔÉ´ÖG F …à6!ÿ¡}[:ÕÀY KXh%,q»oŒ§u˜HH¿o¾f×o.ì¿®ºîŽ”…¹û[,X4qËmž6È×Îçˆ1'8Š1ËŸâ=ÈÕ©dãñvuý5lñr’˜7"Yü”xcÅrW†&lÎÅÅ⢊|XÜ¡Sçãl0M¾»O CPöJÊÞhð¡ÓŽª„w˜°?–Iä¡Ã›Ù:X§ØýÜx·’O —Œ‡ãyç¢Ë×úŽ‹gSÑaÌòX ¬£AÎÕG¤`>›Ì %ÿfݱ®”=¯É‘ªÎtJ&.Zv:ÎÚàL¥ôÓ)ªùÑ>FG9Ádlj~Ý·4ŠØTð•‚ÕJû‹tg‡©ßÖØSO§ ]Mè%ù‹®!Ö.“ý[/¤wP¨‡Ðí/4/¯4D,YÖQ‰çÇìâ$ŽtïU¯#nÈ@ ªÛr´r¥¸cYÁ•%\D‘ Dù:¥–d̉’½?ÔÛï+!oŠBf¯ëtœ4äC'1ÅÃf)Væî¬sX~5tÌ’Ú uÇ«~Ý­¹VVtköÕf¤ý¬X'xØøØúýÄ”Ž0÷b]œ-§ùãÌŽQJ˜Í¿ÎnE°ÅZµÊ£dâüøHBÄU;¦OL“2Åðø(uv[û}öy§‹Fgÿ ‚ÐÅ1SKС՟<ÛìãÖ«‡ôðn=wr õä—(  Ú7GÒu>#^­nÅgƒÄe÷»§ºù³ß™Á½È=á ï(b0þÆù°òo0J×Àä‘qÚô·®<£j>ÿLâÑ XAu¥^. ó9ô Ckª•Äc,êEkdaÍÇÆ‹¯ã\_B¶ …±é9Ï810ÉCþqèÃ1Ï}Îa…u÷êxuwÎièÃy=³ªHä}ඓĞÀS,UF P-n ±(ü -úkJEö5<Q1øJ‹ÂDÆ6öÐa¡k)neE/÷ÎC†N¼í^H/,ƒµ·°C×õœ5ç¸àp¼O&GØšÓŽSº©* ¡îeø»îøŽ“5îò2زj™VÏ`©ìÌNytŠ­>\ußGUÐJ^(nŠSÄ÷P’õÊ”]“éQÎÉâ õo‚ŸÃï‹ÕÍ«ËvÄu0?G§°Ë¹'òìö{§I;>ä Öå²a¯§NB˜"]‹yœòûÁùH7È×°=J !Ù"(j;EÀ´A!@( Šúþi(@y[{êRÕ/Íœ0Çûý|At0€3kä;…Ê¥Ë÷ë4Ãöov#Å#ãìFá¿¿CeC«êio Q¶\NZ“Ž.Àך!áÐLJÕ'à˜°ØXi; 'VtGÂt2vÆj†t¦á}ÑÇá²—ÙËži PЈþ¹ë¬g,a=–ÖÆéu³MŒm'ÀgM%EFÄ0©·Cü֜ɭH‡ˆ-dß2¢ HgÑÈeQÅè !f‹ b>•c%Ú°‰8ñ¿5>…ÙV ®}nå¨*s³oÝÆCg7…æG–á~™"©qým‘ß"‚™)åú&§_@u“Ê»¿3P¢­V3T÷ÓÒ@EÈ° Þá–›/¹FKØfn »%7é>ÈÄ…`øEZZrK IÎy’wÍ’ßàÎq‚%&ƃM¬l¸XÐmŽ¶¡x»Vøsþ4kµÍDãX¶O•ô]´¯\C[-ø{'ªqõ»h³ðèOÿð€©Õ×›9}êvkí:°aðÚúQ²ßö‡ÉÇ5Ž¾évLôm!Æ_)wU7^¿ö{³,Ù÷ƒáÝvoŸXÈ´¶Ç’ ŠQæ4©÷ðŠ<€ZWñ0V€p!ΦC‹«áŠ1KôµÍ|šÎr E‰0ð¢Å¬*_ÆDü‹ÄÈ‘2Þ5 ð¼`Ü=~ ¾¶èÍ«©Èvg[­ÈTµŒ·ªpàU¾â€ÿ¾ñ­&ôŒÇL}¶æ½ê/.êÔÁÓh¬æ¬zòŦAŒ‘­ÅÛÝ ðô-Ðg倖’"áÔ¯ƒK `—k}ÜÏïóg¾n¿~› ³mY[èDAùâ°Õj d9Òß4!‰B ìÈoz*&_‘ÇNêÉ»á·ÊÜƹw&€KDRÂ4¿…̃bPKJºá¯íéÐ /hF 6†;%É3i WªŸðNðׯ8ï+W*Ân@p¤Öíú–èðûÇïåÖFBùø«wj4Îö•=ÿùôM’jj¹0XAͺXttïÅ,Ûþ à÷Ïý=BÛE\©ŒÓ:ñà[˜)„¡ÂÑrqqT¶çNàæé ú~“©äÞ~Æê^’jõü/w5÷·Û˜{ñHÔn)Ì' 6–sXg¯i@ÓåãÎo‹jÒZÔSé˜ L”Í$ß=–wP+­ ¯­‚{’{ÕpL§á¤óùœäYo2x·ÒBé»Ë¹Füp Ñ×s­²bÑØPep?3“€ë• :aÆŠ›¦…®—®§ TMЩèb¥´Æ·Bp˜fûv›Gè¡·ÕÌ„R¿ó!k†šð½› ÓãdèíÙZýii®ë¯Ý/qƒvùðÕpÑ °…¦ø\s:¹ƒi•Ør‰þD<+ÖiÓÙK^x4.†0'¦áΊ…ÄTúÓ£1Ò­çw° m ]Ïfp–.¶–ôþÐ=B—þÌC(y[±6eWêzœ7Ú…a=U嶙eÖ á^˜goca»F–#c Z Wï«ùp,qÙŠs$IÈF›¾õwü¨Ø˜õYúéÿYÀ¯eÃN‚½ ŒŠ7^ü6.Ä¢æE S‚èy.ÓïÚRyššlPA¼YËÂÓ¤0®ÎÆò«çÖ¸då}Fšu@ÚÖZ²®÷‡a)ö= 4ãvhgiZÐ4ѸF#^”ùi€uŒŒÄ¡dv3ø°o}* ãrèü5âwÜÜî#lÐ «ò*R´ënšbp(“u “UË•î:´às¬á¯¼j<¾ØŸžšÐw;â{¸:¤4†|r‡ßJ)?e]ŽØ/bѲsÐÀ’ÀÝSuM Â<÷}G—§±û2rXgJçµÆ"ß=£yF¤þÆÐ,ü&sì굺3[€x ! áDçW­ÜI`¾A ¯í_B#F#·MS^·°†Mâ€úÙ 3‹ÿåèFÿÞågo#Ô/«ˆ8{_!¤´C;‡“ò+µŒ<^´ûX‚£5{çÙ³CAÃWUZœ§Dö¸`árŽ<3DjFU-æbEøߢχÏK\èX ~Š•3\ðž–ß²Še›cUaïˆàÐw–D,€hV6'\þ÷{\rIò¸„âØÐ6m•y1Èò¸0çqʺÓz ²¼ mpñf)®AL‘í¶×Yþ¹ AÓr|úƒú+ºyàzd-Ï7PÌ…o6;Bcr.®(W2ʳÒOï Þâ{“m‚¢6®3ª³0·Z“A€NªsàB$僥'¹@U°wýÃD[øçISüÕf‚T¼Óaòùzþf¤“ç××Rš-\tÚ¨¯hšÄ\·ËÈIjWs—ëÏ*Ówh&&9Y˜\݇Š‰ïÆß³’ÅîËž¨º`«„ýÕˆàŽžøˆñk;Ñxn3§ŸÖÝd*(w[R<0_SppÛûmMb!^LJ”b‡WÞ}³<³lmÂ1‘v›PUÓ`µà.gJ#*ò€mÜžàRÓ4‹´´~d°·¯ˆï‡Ú.2¿kov‰‡®STãn=˜]ž…¿nìÚÿô¡¦Q=}Þ„†gÕo3!AKM!«ÓôÙÄh¥ûŸ†!_æv%0I˜=A0‹0Ô ä‰ Îj%ùîaݺ!aèR”bî«h…ûˆ¶üÓÒt^éX4Œ&äf0óŸÎω%PÃ+æY±ßÑ"iKìéÐ ~öÌ…Ãú° c!ÜŽ‘ EîeY©¸­}igùÞ- c¾¿NPèW—ÙVÔv»£KÿúºW­g?1hýç3MÊ/š”ìVî¡ö7æËTÔ!ÜxG£½ÏŸâÝ trM‚nÃ~Òݲ –´|þ<ñ{U5æ÷ŽåÛƒ29Âæ0L±-åƒZ—tj´õÞfJFó1\Ñ=[Õ8)ß ¼‚ŽÌ¯ÉGG1Ô_m°®¦²–ÀùÏç ŽFÂÖL]äž{œ øÿ48gRfêðí®¨/6W,ÁRxËUqê Ìks©,>Y¿þÝ@G7{ÿQd¯i6êpd¢2Si6+©·¼œñbòbhî/ÇÏ‘p™“:3b2bi.ýw„³²'Ja¿H™éÅæ?pÖ®JT†W‡©®ûx]7ä¼rÍE»û ÉšæÑÇŽQý”Û– 05¿`p?p|Úб 3¨”Ï´@ÿ^› ‹t=õ<˜Ã®äÃÉ»kÇ­ê¼éCn™e>¿œ?öXÇÅÌc£ý`në{jyí;±¿Ø$ËÍfò†¹%æ3Pqa΋ŠÙ ÜÅQYŽ˜ß”†N€ÑùÄñw÷à™fZö”ŒùRÌOþ›¾/58˜Z‰Y°O…Y jFï¡—.T-É9G~,ßÓýêðW#_ü¯¡²#1JH¢NÑŽ(b;xÄŸ#Κ1¿ˆq!E6Sòbì–¥(l»Þu–eh±’ß<~&KEÉäÈ8°Kÿ¨^8êÂQ ß¿­>ns^k†òô ÅHv5-$x¹ä#(ÈÄcèäÍ&!¤ÈÌVJ3… (­áyxÑñU»DÀ«u#.†µU•3Xœ FÃéÛGÝèÈi?(x]sÌ·½¼Jãž4u™4 ™îõ|Ì™)‘·è¯š%µ™žÏ©•»0ïBÖµ@Oæu|jˆRçíAql#ƒßXu]á 5Ú¥Pò㦺\CÝ”ø¥¾œõ4w>»fDßÔ-7ûFv‘5eR„6em‡…«g`œqí ^YóçÒ5Ô”õ6ËJ˜Ü`Ù_ˆÂ¬¬îž½z…r´³N‘ø\ÅÔÌKv<–5ÝA[^¿ :‰Â,¼ @mŒX‡„®ŒÏÇk7–GB9üŠmî"0vÚ†“©.ð|K}Åp?.çI:‘›[ìð…ñ9â—«Öbóñª—BNj£Œ}`˜æ¨ÈM)ç  ”ÏÔøñ¹š¤)ª•ØP<¬[K¨LЖïq«Ú×ÑƇ†Ã«’ÝŽ¢:u©h¸Š8ß:§‰Ã Lì«Õ‹T÷øR¬¥¨Jæ#0„’Yí@ÆPÐõ‰ÍÂ¥Åzù|™¨ê-`ok¯(CŸŸX×<¡ª‚ÐòÔ½øà¿ë2Ü÷"‡MceÛï¢*Á_äÜy¦lÖ¶u¢Q[Ñ'@Ò 0Ô]ñ§ðo]_GÒÑjÝNϬ:›ÐMÛ#)#Iž‚¿þÆ\ÅÓìá :Çx¦N±äNlA RVsUWú´ÖÕPçmæh8N_œ™êñžð(åTçµô!Ê¡òÐඎ#zj‚;bx… µ®¨ÒLƒ{¬,é¶aÔÇ!òNÄ%†åsx>3¶Ö EIbTó¼hÃÚ½€6k¥ûj–üµ‘`XžÛû-Ï÷Q€Gí´ìÌXK!¿úµtëkÛ  ÇÜÄ0ÒTš$`5²å1Êâ,¨["!òÓtukv VØzÝ?( e$šYy_VÈ´¦÷p×ÀîËZüRá¸%—.óϸ÷#Jš”FÞÂ%ËWê×Ýb0£Å•¬¤,­#B½éP5BɃü¶É·­ÞâpÛLº%$†ètÀ<½ø,O"¼kÞ _V*`jmo^»½ºÑš‰2ÿâ ×MRz6¹áRgVóôhR`»È†¯4çyûÆäÉ'ž4o‰˜Ž¶”e?O®ç‰Ýúc»?N˶A6j²X&œÕ_™,Žàà^Žça)KÆ:ýaÈ¥pe–;½iFÞýþ•Ý ñeÃýÊOÑìäTË`¬qßNLARäÍÏò£!y¥åõ׃i²Y邛„¸ðÛ'Ì»ÑBñ8}Éû?’¬ÆR…]Úvdêz9Ù˜I·Ð ³ g˜hÏ/Ž‡’é_ž'¨ˆ™RÔéb  ¿s*éÆx‰Ž˜Í2ìˆu¡øŸLwHsq~ÑUoZ¡J…aþfd®Ü•çY˜’8píóMâM¸Ú-‹”ö ŒGë.ÐÿdJ„Êíàù×'Ê[%ëŸäeŨ¥ªxüKu8O]\%‡„X>–"·‚¬(…âHãIï”VƒÐÎ.ùwª•Ùñ»GOtÔ¥q7ñ‡ÒpŒzrY¬‰"O|_O(²£fˆx×Ä3½¿r¶>× ›¿Õ׸¥ÞJ…èË^ðåõNÕmRïœ/Õ7@"œ³rض9 HÉ¿=]PITÈÅP¬•ÅO,ûŠdýþ›UKÌ ?SÒa³”jI“¤{>´¨¼ “]`éâ›z™¨À<ò érçGN$TO†¥ûða°“=+êÈ'©ˆ2׆s¦Göf‚[ÿÎCO­•hì…INe~kXD=‘›*–ùAö+¤L#ØŒÊîäü±Bôbïçù_j©z(ý®=¾Îînî¡ ¸®žÍFž¬5²N²¤G&F8Œ0% àøs _ýV\ž_ø’™ñUSvçÄtt°e–P“Ä'ÞÜ>B N“Á ç…rOy8gÍñH4*Š÷1¦Úe ùèÈÄèuE2nÚ2±j®àÛņʰ¨á›öÕ×¼ã+üiñÐá='0Ó->3FÓÁŒ‚qIí£œìÐ>epêu²ay©l{òó€^XxE€HP žÛ¸ÓtÜŸ°È¶¢ÂÆŸxh$âž]uÐf. yM§¸sVà©Î©nŒ^üSž˜¾x¸Œ£e†jäs1EÖ\Yx°ÅëbÖ‰íúÀ‡©f…Ìf O÷5ÑsĈžÞº²à»ÒyqÎþ^w£rdÔkT?R©^´¨½/h/lÐîÞ• úž’[Ö®XÐ\F<-é\.N_¬§™+_Ãù§ü¸”Sí÷±9Ð6ZºbÎx"ûÊ¥Î6™øÊ÷V;©5ö‚ê€ o²³T1'¥aA62iŸ”…È.ê%38É ÛS‚`C…’œiÉXpA«*ÞÜŠ*|×­{³m«ýEe2¢qÉÆæ§8f.¤FÄŒa£6^-2dîqžã¬×“ÏÝ ôobe°Õ§Ü’¬CÎ,˜ûɽ¹ûxc$3'l„¬ˆ›¢bÉ×6‹Ãß=¥òg¿Á›ªˆbø=¹*2+3ÔÛÐÊñrø_J¤FÔÙ”bƒxÐ$æPìÝ«i,¯6½ÓShô…ZLäVGˆLÈ“c}ÓMyJÐK.y`EîßIˆº—üºçEZÖnŠ¦6REÚŒð!/ŒQEØxÕ'C¦2g9/ãüoU£o[œÞµrY”õ]PKÚög8& åBÕMUΨ™‰ÛBѯŠïM’º>LqLëPF{ìôþI7²W;qŠ×íÙê×l´À¼Ø)™z3èHÑ߬(}f¾­(ŸÀç‡Ââ´ÅúŠ—D™Ô¥)„|é%Z„c‹‰ÝÃ1W<%!_8%ŠÓ§Tü. A,Ýø€kFµülé2=øE âvhfæn¾Ô̧µ ¨.›Ÿæ­ð$V¸ ¶À샖’rÂnÊ•!—kg–"ÅA ž2Ñ]~‡zÛN¡‘+í|ü“ÇÑBöÔ¶BÒ•¢é·6ão¥y‚jK`ƒˆŽ¿ü—ÙšjóS!ÔëŠçUa×°AWÅ(ô|vÁ“¦íNºQîȲýH,ú`ðû(:æöô”Eì†D]Uë:™°õ~ßíÍ—ÞZ‡×Sx-ó´Bt&xg «¥Ö®È¨’±l²ùñŒ{̪IÉ_RÈNîøÞ#½ŸDžvïü›_´Öîõ'ÖBîì¬cüp™bWs×W,Ü>Ä "ºJç‚ZEp×ø•`€J¾,³“gÆHÿù uúÜ雯NÆø©‘õé|W“:´5%Ã, {Zn <ïÏ‘ña7ÚùÅÏØÃØkÉ»|g“ähçÜr94‚²ÞºJ–žÅ<Øû æ§}W‰ÕH0»&¶#ˆ FNKìGRxãVåÛÌYJ¬AŠtÓÀO³ÐÖÅäߢ³jÒ Ø;–Í >þdÎz »úÁŽÚXrjSj‹°áœ9!PÀŸ¡óx~A”ǧ¾y˜þØi[ÞŸÃÕNSRW9Æ­¹wõ]“æC àP·–Áßný³»Ì6ÙÐ7Ó<Û›]W¿¬ò¥fF\¼ªW„ºY=}ÌÛ„õ©¨€`v×4Pg ÎIre7Zß夦iý"Û4´M‰e)Î8Þâ…'På¹yI|pËÅúòä£ü´@e¾p'/Ϊ[lvš”1È1Ï*+b>Zü3-JÜûXjì¦#â{´Q´Néôâ[è=›¸G¹ÀM×_óÃñ6öñÙ dìÐm²,Óu­z+Öõdè…;&Ë$Q2.¯Y}¢¹ 3¬èòvVÏàe»PötÇÈQ„7˜‰îµdáp–Ô¯¢–Jb:ºêæ)ÃÃ*éêvRÜý[‡é²*Ƶ0ËÒÅz ¶/äåzbðtæÏÛeÊÜ»$SÖggùÜ€»¯P+ʤÜjEðq[àyMHcš¶óÎAgˆ<ËqŒÁëgšäºpax8œ1õÍîô¥K‘´E­Ô›(ísÃwÐÕUÜVc|fL‚d{æáÛ_Áž&u§ißFñL݈•?æX`" gü9¼n-Ô¬U÷ïÇ—€Dm™ñÆX1ˆC2o âýš˜À3ŽÜ]æz 8«ËD!?®6Ðf³yÇ,ˆ¹<Ùl-0Á•q×JXZ ÓZhó$ç·K²uhÍlø Ž e±rb›$ª;Ná¸èÛ¡lx˘•íö£ÿ{/áéiL¥úë}ßeZV Ú/Ê^\Á^ˆ‘¹Tù‹NÈzi8#i+þ¯z§0‰úLÙ`–aã,¨Áµ8f_P7MŠZù4W-©ž› ÛC ¹nƒL ¡/ŠN9S>ÍŒÄñp+øh_Òž1 ç÷Oò7ëröWÖ\¨ïŸóýÁíÞ9ŠÀ²Ô瘟ýx™ÀÐ)Õ{Ýè$ ¬\ß"=Òƒ0>æ菱z¬µ%]¿>u6SfSå2`€·÷I-]¾Ýâ£×6«RÁ´5SÈ"ÄËŒ0悈\O,LF0…uÊA¿WÓÛÑ’S•3Nvrâb7¥ö£ù…Rå‹œ6Ùe=ÝuÂéZØWïB‡²Àórßöø¾’£«òé¿ìfõ$FÀ•­JÌ–œºšRSŸ¸ÿV»v‹Ežuú&3 °-¿/ø!K5â Û‡”É*ÐÿÝn?3¿"•€u1B!w·ÉJr‡¥oât ÉvÛMƒAÉ<¿±©ÃòâXLN¦®ð^§[pa^´þªQ…HÐóÖoL²Aˆ߬÷ç»´Û³UƒÒàá·zøÚÅ <ƒÓ©Z­vtÉZgÓ ÇW™| j +ÕƒÊ&ÝÃL¥·ÂAÓ÷‚Oš|ÙçbÑqú‘KˆÉÄúâX± 6÷‹ßx" hñ¯…Ô=z[:,yySÌÝ|©Ó"3 ÆÄIûz€B¬¢OÝHb/×ÃæL"ô)ËÃëÍ ¥›zq¨ˆý»—•EËA¥ç ô¯xÃ#ÏÑ¥ ¨çÂ{á;nZ¼Õk`lß½[ë¡#˜<Ĥ?C¸&óöòõ-êÒgÅCùÑò à¢NøXîàȇch•‘DÉUO5õD™gÚDìd1/ÐÚý9àëý’çuB`ˆ‰Z9W¹@_='iMÓéŽKˆS ^¡W±¾úõ[†Hí%(Y·ûýØìiÎ7Ñèæ§é›ð“5çÉZ^# ²ÓªõCÆP³]8öµ®†8ßð8ex£[ÅŠàÑ'£Ãmֻ̽jÏêñ.p_äTàS©–y|ܸ.pW‚iw…rfU¨@&ì±ÞŒÿuP`¯Ž\c/mW»‚Cµçè„E…9á›/DN+…_¼ÿ5o©¦ry6½àsº\n æs[åN—BÌðÖiûÖ*‹£K2¹Ô·ûþ-Y‰X'锵ÆàÎ6nÌ$½Ö£ôá(ÊJì=ceÚðq‹)>Ÿ÷f^Ú¹¾)8Ìnž®oß9˜û C½dq$~%"^óç,ÅY\Ÿh•ƒ8 ¼oòËä-†ÆáðŸR§Ë`˜ÚÈõ°ó]?Ã{´'µ†UêDï_ñ{Ï*ßf¾é‰Á¦»0åÏ¿‘YÎz÷–&7Úo"&s*Þ!ï'q„ £Ø׶gûÁ™ÐÎözã‘ê°é•(½+F¨#̱(Tó‹€BÔ_™°ë] SÃ’)&¡š»S„ÆGβçIÜÓ~´¼êMÞåÛ¬ZýéÍ=ˆöyþdŽ)Ö,øÿTßån/ ›wýÉRÚ;?‹ö´ìï?¨×v¹Ø8‰]Å!B•¸4}fá£+¾ñ¸ô¥ÿÖ8Ð÷‡-BãÃåžJw¥²*SWÁ~é`ÜH¼à‚úæùJ»/’Nêe˜ Æ«¡ÒWè*õe¶b~"h£·Q‡’…¤ÛÏ$HYoçCâ´Ôøëißå¼u¹ £_’¼‡÷Ì×îÓ‚ÀTÃi ÒGoG9 úG÷Tý•²‰b¬Î­Ê ë°.·\ÙùJiÛ²¯]òÀí‘š{Á‹ÃdC4 .é~^œ/I|šì·Œ÷ñ:ƒ}mæ𜮫zÅúŠø×äºC ™‚ XF,­{N'`}¬ÌNƒ4±º4é"ËC—Ý®Ô〤K‰ä²oë[rGé~æFQÉHgo†œOÒ¤a ×à/IÁÃe+Cdâz±sÌ+H|ˆ{ Äö• î( Èü\ä†^ endstream endobj 877 0 obj << /Type /FontDescriptor /FontName /KRRWLR+NimbusRomNo9L-Medi /Flags 4 /FontBBox [-168 -341 1000 960] /Ascent 679 /CapHeight 679 /Descent -205 /ItalicAngle 0 /StemV 140 /XHeight 461 /CharSet (/A/B/C/D/E/F/G/H/I/K/L/M/N/O/P/Q/R/S/T/U/V/W/a/b/c/comma/d/e/eight/f/fi/five/four/g/h/hyphen/i/j/k/l/m/n/nine/o/one/p/parenleft/parenright/period/q/question/r/s/seven/six/t/three/two/u/v/w/x/y/z/zero) /FontFile 876 0 R >> endobj 878 0 obj << /Length1 1630 /Length2 18644 /Length3 0 /Length 19483 /Filter /FlateDecode >> stream xÚ¬¸cx¤m·&tÐQÇF¥cÛ¶m³’TlÛ¶m³c[³c¤cý¼ïžÙsìoæÏÌþQÇq_ ç¹®uW±¢ ©1PÜÎÖ™Ž‰ž‘ ²1vqR¶³‘·ã’¥Sš»þÊÙàÈÈDFÎ ;[Q#g 7@h š˜™L\\\pd;{G¹…3€RMYƒŠ††ö?%ÿ˜Œ=þ‡æ¯§ÈÜ@þ÷Áhmgo´uþ ñí¨œ-€35 ¢ ¨%%/ ”WHmŽFÖEck @d´uRÌìÖÿ>LìlMAÿ”æDÿKÈ `p²š€þºÝM€öÿ¨hö@G“ÓßgÈ `îhdëü·Îv­‰µ‹é? ü•›Ùý+!{G»¿6uÁ휜LAö΀¿QEÅÿ§³…‘ó?±@Õ;³¿–¦v&.ÿ”ô/Ý_˜¿Zg#­ÀèîüO,c Àädomäñ7ö_0{GпÒpqÙšÿg´G ¹‘£©5ÐÉé/Ì_ìºóŸuþ—êìí­=þåm÷/«ÿ™ÈÙ hmFÇÄü7¦‰óßØæ [8†fEÊÖÌÀÄøo¹©‹ýÿйÿÕ Êf†êoF¦v¶ÖS ƒ¼óßÊÿ;–éÿûHþo ø¿…àÿzÿßÈý¯ý/—øÿõ>ÿWhqkky#›¿ðïø»dŒl÷ @ðÏ¢±6rüÿùÙ€¬=þO^ÿÕZøïtÿ`RÎFÛ"dkþ—FzÆ ANâ w ©"ÈÙÄ`fdý·gÿ’«Ùš­A¶À¿Üþ«­:&FÆÿ¢Sµ™XÙþCÛ¿U@[ÓÿZÁ_ºþ•?ƒ¤¼„š¼&ÍÿfÁþËPñï 8«zØÿÍí?ª‘³3ýŸ‡`„…íÜ^tLìœ:fN¦¿÷ïoB\̬>ÿ›ÿbúϳœ‘³#È ó·nF¦UÿŸÿ<éý1[;ÓFGÅÙÈÖôï´ýOÁ?jGÇ¿$ÿkü­úœÿ5÷@ ;ÐnuÙ΄'Ø2=+ù+odRTg  r$ľ¬Qµ¸Ð¿Ö®×/=|‡«Êð­.„¾išû£ÝcéÌþý@šúp¬Óš¢7ø»ß‡„ª¿e“¼“ƒæ0A¿ 1ã\#ÚëjQvû‹6;£úá²~é4Át'‹#ìÕ#•?‰k¡?:éƒ=’¯IÚ8Œ.ä&0Ôú¢³sò¤“ÇŠ¡ñÑ‘áÞ¨þ<šÜ¸¯dGZ4®nj¢Õ‰:ÑÝ©ÂËîNÍêdßKæ!È<\±bî‘» ¨¤þD u´BZˆ®G•¿7`0g´>•®ÕüúÀÓ©…­cöã© RÌ"Îxe×OömjFäBÝ"¹Êm#¿Ý>ŠœÌ~ÿ«·«kÖR|~^ É~7áÒ{°K_³W 8–Ö\‰®}c†ýÆŒ+tözj¼E±±Õ˜I-Fêp4Õ)þn¥fi¼ ÷›C9+v4ž¼ûÒÅ)â1ËÃÛK*B&c*}]¼ÞÆ}Vï{ÐÝÑ«·kz¼®éÒ‡_КI0ƒ}Ɉ;wüätÌÕ×9Q&‹>Tz2hþ>ÿ+xÔ»àMÝV­½/w¥˜åͳ¢i& 8q,º Ù.µŸ€)¼EPàøuãQ¦å·”0b¥æ N7Œ™šA ?d¼==ý#ƒa{FüöΚ6lÄ-) &65¾«ÈnL˜#81¡ÔŸ)<¨DtT`…þüO%uH“haSŠ½:v–³›[ì~êm—òž×wš9Á•8úçÊô“à»›øœñ<î·QcñT¸ŠX qý¢¨TâåùîÁÇÚä È‘÷2š!ïºfŽŸ£Êò‡*I๶QózÅÎüzWaO–ÊÅ[l–¿!ƒ:0̵˜ášn÷Ëåevìy¨cMÿ»œ·ºBüºLç«FR@z{íÈyÇ… v+øË4s5í¡Ð%¬P ZM–”×…_Ì]îÍÁXEEÔJ½ªrµ2c”ý¹(%òÊñ›hIÞ@…Jt´/‰á¼Ëg<‰!ðü>(º­!Ñ(oâÐíùu&‹zþ·ýÉï_A8ø¾ôÏ2Y¸4/üaôud¨ynÞÏ!TŠ¹'Ær‰¢A`•Öìò­š 4¸aû„¨Í͈ô$Lß›)ܤ«˜\F1­ˆ‰/͸ž±ƒgìëPòžÕ¸Þí5'(ûxâ ¼Öl-Ø“H=oÊ']?‡úV³Q$'q-2 &,r<Ís`SÍB-¬É¸0" ‰fÞ%éwÛ+ä¾Ô Ä\™7kaO±˜Ô2ÊEí|6—ôCïò Vfy7¡à S3eÆ+ùÕjÈïï÷Úø™ãì°ï;}óuªGÄã>cÞÚym%™m`B>z¤!úݦ)g9þþ±%TÊUº–pº€áÒÖsIe·Æø5i›Z¾'mÝx…'îmAJp&º)j™Ã§ÀèUû—’5 tâ6³1DX‹ ^¹åûêöá$ÐÅ2YÍ-¯S¢â÷,ív*È•¬ëž|Xú’Â9 Æ´ÓÏ’^„f¥Ê5À~W“J¿° lªÔ”`d?ÿÕ…  ùš7õ0û·ã¢ÄsÕÖÂf2Š9ŽfE¾3áî¬müã#ˆrÆ(¬1?ü)úü;'&ÇŸÆÆÕ_àuxý6ó5&“{è‘mü¦" wª ~ΉLáænÌ9'áÜád°xj”:ALyðñd¯lQ™—P±ýW¶W~RzÒ|Apxä'h‡®?ÿS+ÎêtÖ1D|Û­t(S:3•-FLïòúp“ª3Æ\Ì$jsÅŽªÂ[hÙ¿ ñM·˜á´3;¤—1ù®*£N᎚"±)&pV`n,¼Çt¨Ý„’&k,'÷ÓGEeßFt*˜ƒª(⮑Õ_6›XN v­8#ðx™®¾¯<~Ù=ZòÐ/9½à&»Q䤗âÞþ,,ÅÎ3Gª¤œ™Eœ½ÃùnÆKÿAtJcþ²‘\æ@º—0AÑ‹|p5„õÞ€Mç#ªòq‡¢÷,e?_ž{·Û¢—àÖ¼ã‡s{ïq;N¼xÈÖŠù{@ø-R€• «5쬑 þ÷2íNf‹V$œ™µX³ @q ½z‚ö ÂgEq¡`ïõ)Ö ;²ó˃ãlxö¥X·Ì×K¾fÑŠ°Ž¬u¯B{D"³å ;5»`jn|Ç‘r1†Ü¾WqC£ÆüÏ‘õ°‚öîeÌ—¡C(½»‹]L_ÞÛR†õ­\r_¾²õ‡µþ±FpÎ]’áêÓÛ]Ë 5RF?jðÅÁ@·i_ºM_C2¦§d[-Þ¼òbBÍœ…æ#’ù[?x»üT¨pBqLƒ1GP?P™‘}£"SPd‡ýâ÷$™µ¥²’™Ÿ ÿFŸ8êïíLTj4ŽNä`ÁV¤‚ôÃV,4ÔÐü•·ºÉÚ±ßLï®f“n&‡‹©\›í’ì°Ð4+ Ói¸¿Ç¶`ƒÏžo ÁGiÿn¶¤r<ÜÞoÁ¦ÑWòi½ Æ9?Â#l¸Ó†æ‹k¬ ˜§f2ZÌD$µoëÙNú†Û0Ý@„TÅ\ÏD´VÅ«™YY Zi?‘z‹5<{Ød„å¶g‡‘wâÉ}áøÙM³¤‹nXè!©Þ2…qܲ»ö‚gf`u鯩zýÒêvl]ãb¸œÒêòï>àM< æ²¼¹ëâ¨R›K<¥#¤—bˆ–Dz%ú¶LÑEëçËÓßëþ„Ñ54¤gDîÏxp$„®ç@Ã+Ø}ͨa.¸î{-§*ZºõaAŽ?¢²3Z2Ü”Œ‹ƒƒá³Bñ 9--t‘DÆòÔ™6ã BŠiìå±1Õv—¶ÝL?8ÁŽ6ÉÁðvßeþà.Á¬ø2 UáÁnfØ>uƒQÊ|¦6 +Kd98>—7©X¾y¿˜ƒk/<\žTÚ=ßv MÏ0îÍnÝhøPAA‡Óy]#ØP™äB‰¯ÃJ]9 4¡‰?3¸þú™šcí܂ݤñ y ­Ò’Se‚PNµç‡ŒÐ—.…Ÿ& ø?,7†|lèäÒê`3$ˆ™d¸’gBõßOEû!èecjC<)8 Ôåm`IóLxØ£|‘&/_㺰³Àïmêl¸ímAðؾm'þ˜ka}Ù~ÂÓj‚„@‹¾>!ׇÊÈðöœ`¾Ÿ5Ý~¹’ ¦øÁº%ç¡6ÕÞÌ´Åëë¤è}‡t/XÕËzÊ;ÜñHh…,?~Ý”=4_6™Ò”s¹ƒùœ*Iñ-å´ŽV8…BÊkS“ß<E‘¯üSÀ:2~š–oÄœùY»*†wà»)$ÈÞŠ¸×SþÄüýʯá-Ù¬y›:tÇÍDaÉ%¾ª*:sÇ~…Äáå.–½°V1²¯Ž·ý”ÀιÒaù"?»Ç¶éî=ç ­Ž)®æú%;óâÖy…؈4B2K¢íT|xsh!©3¹o¤å±CÊEÁ_,k²R-q’†?6¡Ê)",º±‘U¡}tØ^0x‚|s%µÖ‘lÞ=fäAŽ³itT¹j¡…Yz.%þ OÀÿ¤–Ýë‹ GFšÎû3QsˆœwýÜï–Q(“J=Ëý¥OÆB*ÿÏÓþ×h+=-u“˜xÄ'™Ø€¤u¢ˆÆÉzôìSüžÑÖÁ²¬»ÇQ¿Á\W¸çB-Áv ,ïv-*曼J˜ô«<]lÂJ  Óïoð=µýlHZ1I/³Ú_ZZ(LN›îÙêpVÍ”/Áî¶ñ4oœ›Ò\jhKv3°ö­·Sšû7‹žâ,û}W›ãød¿¯m ¨TuÊtBÙHy¸¢ÝÑCfïÃ@ß7{hn%˜o·0ê-¨ÍÏþ¿Ð„ÐÛá%]ñº<8hNˆ[UÓׄ@kc6 ¬vœé. § àÏ#µQH ùao„ k1pˆØÝ$}Þ¯¦W†€ã19Ckè35†vøh`rMáiÏÛZbºôÿ¨< §IPÚkt $§Ô1ƒ2¾,~ÏóðõàzMñûŽ°}Ó¡ý©ž€ Õ®…øA:6Gåyü.½²tíµÚ™WØmE"V´ò¦­´Ð¯(_\ó€bœp Ší{…¼%t¦²ï›ô•¥QQ#U÷3.—) ¼Dß3Àû·mùIóB·}.¿"[(DA u#|³ëŸ&±ö”Br¼'JDm‘mxº&¶Á~f QÿvQ/š¢ÃFv°4"%õÙ©Š ‰÷¢Ä6ùïÞÅM·3^EPµ`”b´Ç@œbNáé¡(é}lüÆ2î³$ÖÞÔÛD©Ë… šD xô-]Ã#y$­îQŠF œ/e›­Æ¾ZÆËl[u¨×5æŒi ï–«¬:qím6' ï<Õî5Öªú]NÊã ±ëe D¨çG«|<´Cåûu?c šl8 ïïêTÔQ¯ø“=†½—ää<\±Õe1 .ÎÓÝ6$óÛß±Œ2ÀŸBu·“è%úªCcmÂSÓ/²¥8VINÕûõéÄF’ª<‘xh6í?st …¨o[­ç/3,„U>YèWŸu"wåž)ôD­¼1jùÃMr6œtŽúR²Ñt\*:·¥nN”Ñó®úÌŽE*þÚÑwLY%–/HgD;Æ’›6º:Að>˜HmÝ&“X‘¬³ÐUÌÒ•~ÌL„óàÐÁû ìd(¢IÁ ”¬µ…)J>¾ìôhÔ’ìµMðÿN¸ 7Y➎±€Sçé’'~¹Êcd+c t…À6”+3Gæ_´3Ád#·ø©ßît-œ‹)ÍË•#Â-þÙÍ"c0,toË0ÉvšyM¯1R*°úY¤ RÉ¥§“œŽÆMþª„¼dŒ£,8.Ûö“?š7üm\‹ý8ʶNZ¥êö~È“DMi¼2¯­ žŒHËmž'¬üUĘs(ÖNÇ-ðÌí½Þ÷\Ëpùî†ll?zçªE$Ñ%hB>•ëqüÐí÷Ý Ss.$ú®:kl 3’~YzP«ˆ4Kãu.h ÿ}ÒjÑB}ˆVp—¿¤¬=˜ôØ<É/ûƒ÷nß-Uñ×ÀG0™¼ ,j㇯ÕBàmÙùªÚ/5X/í(‘mv´ÊEÝŸîú‡ÄÍKÜ.U†¤9¾ïc›NrYoÒ|¼3hKë‘Žm(|»ÁGAóµˆB=ÅGûÇ~mbŸ¿‘½á'2(¯%Fz,T{ú‡,_É#S’ï˜vz–à„^–6:3èt[0ª,ˆ "ñVÜ“ó‹BH1¡èú«»I÷v§äIÐLyâ•\á †ÙY¦Œ8C‡„×UM+¯gá< :?[Åðx&Ž£ÚžÔôq{k?­Î¿°‘Jãþîu¶«)逸-ÿxÙq"ú58C¨7Úg€îÖBj®xèÅ9Ü–Ú>V-†Êµ/BFýP¿¼PÌLîLe:Wʊ˘™]Q ÷nf¡µU½ä¾œ=d}«£¬/Ö†Ð+ŒˆÄ­F¾æ™r^2~íy¹¨)T:xZOOwÆð-‹õœçä¹ ìàRV+¥n¯£Ã·˜«žê‡u×vÊ¿ô]dª^“YÕY㯧õqݾ†ðB4iiâ™å c_›ò7Ô†ƒûΆÑ)¹;Î[ ÄHÜ%uÿþVÞéšy(àئmÙ¹o¾ìßþ>ë=þb[Âõ´0Ë\Èz>Jy29¿@•œGÌÏ|OϦ¾-CmÊ ¬0?XkÑ;"( ²Í1îSÄÙ«úå|È‘·X“µcýLÌíL¯pâ—¾Lˬ =ÛØyÃÚÙ¨¶b n[ÝVdHˆ´ƒ‚azÌÏPS€äŸN¹™ëÝ^ñŠ­}:©Cý¸¦ßð¸*ÌDÑý}À ÖCÒ­€eËi1»ºža,*dNÉÖ›Òp‹³k(¸F9RÒ÷¨áŒ‡:ph¯`^ÃÙÃ>·±›f·qÛê¯Ãé0„½êù¨ž9Y0®sñÎ@¶Šc zN«É¸jßü˜©gF²ººb@Š¸(Ø;lQþiï¤ÀÀ’~ˆé<¡ÆJuÏ@Õ¯_ØÝRÏœ\ÇÖ6Ž^QSCJ(—9’bßö*Ix×¹Ãä_ˆsA>åšËw…÷ âAÕT߉Â)ׇ‡"ÇÀÕ¼@“c)¶³ÖRCè÷?¾å3 Ÿ*K–Ý®ž]¿-À¨Á¸(s†ýO•ÑjVír/ôTÐ*Á¿o;¿zÝòú'!ÁW~ euGväß1haÅ==C9±g­-£YS–·¤ÅW?¹7bd)RÜ¢¯ÅðË®²/dMLÿ&šR2YâBQ•MÝùyo?7oºã±ÕmåõpK\?íÅ™v$uIKm‡Bз{¹º®1~HåıÑëíh»6fòÅm´ûQç'äùÞÍïÃL>[`í¼pü)x¯­ãG%ñ°Vû0êÝ&z¨^°`É‹…¡ì™þ-ÚÝ=š™³zÎ}|¼³[~%l^½kžOFÃ6æ0ê Á¢ÄìY‡¾JÛÊÏùZÜñ5ì}ݕʤåï!ŽD¦~έ¥TDd†M£©´ŒïËea •Jc Ô«Ò“‹²‘-gï¾ì™#¤;{—Å› æ*ÌÖSÛq‚…OþãOœã5R½ýß.:pÇ^éuànÑ6¢p ŽÈŠŒPjã Ö¢+ä– F Ó ’c¿õ±§öWÑz¾¾ƒÎ[TÉÕ¹aŸ ~}I£^±”È‘Ôîû‘RÁþd2H)(¯R)ÚÈd '“ÞÌ‘ÜQ7'ï·Ü©h_é*±Éõ‹uð—Ža kög©À~¯¯Ä§¡QMÂjú[Ϻæ絜}y½­ šÄ–=Mo5òWìø<]ä±T8:³Øx·§„·§¨à}¡â{m` ›FÐJéè»ãІSé,BüÈji¶ ‘fuôm­‚ßÄHš-è^×xÁÕhŸoX?OÄ›Œúí+Å aq±œ®ÝWkÏdª"#Û£`jù”­&¢ Ý7IÉôh†D)Ò¡ºS„­‚°T0ö.Z»â‰ÍÞur3‰ƒÚ_¼?í"¢šmuæçù2^ö!ÍVŒà5¢÷lÙpL»®)C½²o <ácÔ­: ‹å³ í7¸Í/á|*¾¯SÇè¤J¡ãõ K¤,­Â«öŸæµV¯úgÏ4ø?{wX½á•$#ýdtˆƒxQ)–? ¨eOè£xïÙÊs ¶ï:S®ò¯”ö³½´ç¥¨ÞøŒYH‚ë©xRRÜr ï3·ýCŠrÎÇèµçÁõbúkú1Fi‘T••¦t^•Æßþ+” n ùáCÈ¢.\3nÍß8µóYX8ê[’'hb5"“ fMÒ(RXW?I—×Niº_X6\:";(CéA4nñ*p͉Á´HšÐU¹bF2’þÖÃÂÆaʱjgé^kŸ2¸ Ë{çDÅ)°–Yt[Ò‚Æ&bï8S£Üö1“Q^‹~¥0!BøU±™üœ?6癦 ¦>ÑÁħAb3FâX'aè¦{?9”À%TH~jãîñ4_]êrÌÂ1w“%½Ÿ”Õw‹ø‹Œ€ãf0(—¢qÐÆ© L£yM§vác¸TÕ Fì«æÄà»ï@iàÂê÷·˜°s¢é~3…oja§í¯ñJé„1¯Üc`ˆ9‚á³ßŠee}µ9h"ò¤­ßO ‹§»Z=ÈÄL¤H÷!K#žñë7c eàËÐmüÈ öÎþ°X°Í•žZaÄ»ö¥¤S éý #\„ZóÅ/[[÷ò—¿)mØ_ nd XQH|oÒí§û©Õ8¢ÐxŠP½Ýu¸+5RkçÛÞ!+Kõ0±º*Ü· žÌÑ ½NS|W: I½ÇWpõU2×jk-9ȽñógÛ3Ö¼ßÍeàQÐäUÕ{áÞë +Û.}¹¾Æ;ïé8½ãæªv¨Æ>±ÿ8>ŠŸo‘f6;R'1 „Ã)`É6ú/Û³šýNQWìé4^6é0`ÚC[šëóÛol*òXÁñcûöm¬KP'/ÊDDÅÎ7Í™¼ò¦‚“¿M\Ô>ýh5KŠ#B‡e¼ù©‡O]–¿þÐT©úFöF»YrýSÛ#_eYC£Õå)¢}:;ѾwæR¢7¿m'Ý0†D™)Wc_,kÛÍÔŠ‘¢b.œ:#jðŽç)m¯®uøB,?é7x§nßZÛ™6y'UõwàbQXÈK¥ŸéB/–vÏ ƒ:õKå—œþ€üj9>O}i …Ì&ï’ZÃŒÍ/‘;”‘p eGØ=L§p‚^–ô‡J”µI³7õéæ:·_¨ùÕÇD²THÃI_4úº‹Hˆ×çeÙoj'¶&îÑR ç8i€|ôäÆŸc W BVòº\–M§oá=kàØ©°är)h™”SÒo¦¥ü›¶;;l‚Øé+ü g†ßoNÜe³Ø-½Î6”‚Fá%=,aû­4™d[‹²Yd¹•§¼üC —"_ajýDýìB|Ò±ÏÅçp!f#Â9*çMíÖ¤>j¼xƒr!Úo¡¼{£wñ¨8Oß®½®Ù`§Ø)Á£D?!ú 9±hftœ°ôø¦rû^4ãYßcoèS;ð5†'^jGU…†<÷ѹ.a1ÆVFÿ5!¬7Ç’úÎZ©S EÁªå\`Yº‘0ÂŸï  ÊDz’þSÈN‡3KÉUûw*8ÕýZ#46³÷9tÈ]ô#š×I"pD†1/ð Žø®qýé`Þ´ay“SÈ€ýò6=TYø0.¢w!ÉòiHuÚ ªß¢ÏľÿøªÞGº–£¸’úrœÄ»N®Í|–“|ÍQØ~‚9 ®? Š*·Êm‰Íô.RÇøQãZbžÂE<^Ì£•ï9ü`;Ýmú†êÿýŠû”³ãzXdöñn Ð[¶nñ’t5ÛI£ž Sà%ïÒÌš‘$•y¡0}^-¯lzÀFK nü"ÂãöŸV@ÔøáÛ–ÁUÈäyÖ•8Å!º5ÁV§Qco¶ÔΊÚÏ¿×÷Säb*(ȅ߀8C-ÆYû$E™¯ 4JÙ3dûµGäT_Vþ)ŠÝ6AÃÊ–"m½Õó`5¹†P¨<õÎ}m¬Uâá‹«¡©CðÏÎz;IŒì»«ÐøÂf$§tÕ‡4'9•ËÍ~*Kmz‚/òZhÊQµñˆKdõ;‡ïl—m'7þ „ÞÀ ÈyÉ'F*@›BY™dÑxÇ!¼Ä7C.íe-RF¿g­dí¾FâqîáhJ+e;¥@&ÁØÚ{øv¤{Àݳ*€5µr9ªˆ5Ij¸ ¡­‚½ƒ£¿§îí¬µÂ”ñ®EþœBX†üg´] ê—]‹pzÏœ Dzãü"™Ë‚»ìý6¶Ê=³âvÄ‚Ÿ8÷…ƒª¦Øòp®¹)ÏfTkûˆè7¹7P†™_;V6±Ò°d#wªX=*›´×Ý…G¬Ú¯ºåC‹­Ö\çž) |óË}Üè¤Xa= Ð[š`¦Ž¥©Ä™ÛXÁYå¼b ü¢bXMÀ%ä°düõð„ã ÓÍéÝ’»Í4΃¼¬­ÊÌl9o;m¿ºÆäcÍóÜú³]dÌ0ØW\xì¾™ÔÕrJŸ ‰ «AX2é®ÍÚŠw§çw^M.ˆä‹/×£wý9|®jsn›?’Î ¾úêe[)ÅT'­M÷çÙËÅ[‰6mû;hc¼]âšæ¢'ßùbé!ŬJ$ØÓ§³Éþp•K@VãÍZÓHÏvwÜ?Ò$Ã)”õ.¡aû{ üÒ˜¹ù×AJftO1ÿ­†®ÍÌd,V8WStù6#ø ÕE~– bëØË’MÏÅìÔñi,õôfêPš&Ôo6§s®âV܇îëGÏEƒÓËÁ´lšZ²&—”\ÎÃÎô zo/Hƒœ"k¥“ÒYwqxY*ÒƒÉn/‚n±¹M²?O×mˆù£FÆmq3¡*iÙÈ_rsÄÏïqõöÐnžsxl¦Ëé#;é FW>m1Åõì/nBDæ`îNh‹ùyþºÜlYo5—?¾‚ .GFEåÅâ M<”,<ÈCÝžˆ±Í‰r·YŨÁ–_¼ûq!í7 Þ㱡ªåæ -vl*v¸C Ö³çÊ»’«‘ÑË—@zg†’mpåK®8¬‘é]a‘v%1Þ!pqØÄwX”зþB†¤úÇÓdiÃâ†wŒìàÜ9Ó ;dkH»;P• LÃ`ÅbU¤`C}íå~%vljØ-pÉ38r‡È§´<6³áðµ½Çºaé}»˜ºücô|—T‰}èçXxõà ­sK%v‘ðÒÆâ.>ФSª9ÿýšÏ&ZE1Ò£Ëíd€I3f/ïj2A·aDHèK"ÎD <™p¦Ä9ÌXÖ.÷nÙ+ÿ/á¹®s 9°2}Ñw?«2# LOb”ÊN"4€Pç…\«Çã2\ËfŸg1m²’q6K¹ Mëm\±Nø×&:¬ß_I¾ü¹Ï(¨ô¨ãN ^¹’™™ô¿pxŒ€í.$N%bgëLܶv¦o¹Îѧ—]. %ø  =P~ª·ò–PGîØ!4/½]©ru\æ,Ë w·@Gõ0Ë&¬*ªqd4€®Ã|ùFQtíwfóU˜¤l›ù„‰\¹°˜ac8[í‚-º?ÆtbÚÏöçüæLæ¿á°Ômw¤_­2ÈÈ]XÝ2\z”ð⼫%c¥ÓcåæLTÂ+ @^Nn×+Ì6/'€ìS3­¾ÎñŠ¢ îT¶³xf®°D¤£Þ­;(s0x —"Áê|GÌ«ñ^\:%Ì£JŠ+°c)SKc\™Py(KšðYFTD­~îý F%…eo›€ª6{…TµnCEùø,Rì[äMžZ>_»Òº›ïG~ÜLu O4ÕÉk7ÊùïŸÎTæae>Ðîcàt¨½ƒó#Üaªðéå+a> R§âši4½?Û2›«6}Æî[Ùõ0Px×;nàU*kM¿ ¥å€#É&õÅMåß–ˆCê„W>ÄÇ„ƒ`b5ÏÇ,E£‹Òõ,f~Õ¸I³B1Ðt3ò*H%ΖŽw}›Žæ~¿?͹9„µŽŽU?¼wÅ…m1~bw ©|3¬¸Så|¾ôxÐ7q»—o=G `ª‹b¸™+ûœ×º -ùdÞ#u=bôúóÊêX9ÕƤ¦­†Ê_-Òøö’ñ¿L8¨=¡¡ãÁ먟ã¾Í\+:#‰ âÚÔýSøà}pW6?ÕÀ÷j,{õ+– Ë>ûfé$×Æ)âßI–=ý\àï~ MÜHäIh6[7¦{,Zf;b€ ×¼Åræ¼]<Ð&É,[¶¡KÙ¯9Ú¨Z²“j?…†©YéïTCÌvZ6›ÌŽŠ$Q©p7&:.K¸ý…öoXM ÛØž]$’£¯5ƒYé×Uí‹Œ))g½ J¦Ïb‡ ¬ ¸úåØ›v #}_÷Åj›·Íû„J^á-ni ˆP¤Fš¥=¾jä×Oõ:nfÓ¸©Î±•+·ØëoCâÆF!³c£†:adT‰{¨VÖÛ0^xdü…ÕVâ]Ýì)Ÿg\=tƒ¦©¿QK¢Žr7“‘©³¼z:|…€ÉraɨÎ@ž=O}bâB0G¦\`þ1\hP¥jZÙ/äð1 ]@ûÖ%â¡þ–ÿ§rê6ù9Ü3  %ý¼ºøºÁ’}sBàLÁ‡5TÝL¢Ë0ÖAÖÿ»hl·¿„oÔ”ÒÞÄaÃÕ¡Yõ"íyád‹­ÚoëœâZ1¹v¨Vˆd²sšnלsŠ¶êUMÖ{êÚÏc —* {lºšbãúlÂè"ÞevßÃìw¯vío©ï–ýжZ”íNDêžÂ!ÇJ¤Dë¹1´äZçB¢—ªž°o@‡ü˜ŸŸ}rÝ5㊃m™Aç*jÙ8IïÅËiH?/Jìø'ç¬x™ÑÚr%KR¦4Œ’`öPf%û¾bê“TÍÝvv:Y3ÂXX°ØÌr؇ÉM°¬¨q–32üeŸˆä’{Ʀ®’ñQ6×Ýjš£à¶+¾ñý­ ñü*1è=.P;D¡QKUÛ;UyIׂw ”úOûZ6bïÃV•®ÉÖ Ê«xçŒÅ/‰øðó‚XW[Ë øx?npO®Z²#`QªW?QI‚éw’Z}‹5:%ç‚8ãyŽ-5FOG÷ŠV›ìG‹³ã¥Lä´£a,ûÆÒfvõÛ…kF‡ÎV~ªD$â1ú×T"ÿiŸRSOCÑF.×ô» dQóÒ!Ýÿzl1Ù™€{‚ !w·Ý£?,ºÅdcyÊd7œ*+"U•|Ü‹©Ü£8•é/`Yê´(Ã6¾ G¿* ˆØÊ;˜« §|ò‘h#|³ÂãâR~Ç^“ð­°ŒçÙÑ¡õ#Jbøòü>ºh½)š”ã€àÕ' lÄ¢Çä~Oߦ;į¯IŠvÎaÆñ)n= áÙƒ.G9§š“€a»6)Ô äi Ü‘µ’Q›ó…y„¹-Yã÷Qh‰/R˜5²ít‡ê0T¢Ü0êêN ùaÄ%»YpiÄÿK‹±‹Òhy+¤¦;êÌeZŠõU>)#‘iž”ø¸‚fÜ•ø¬2Z¸b¼¨oS— {Ë@Òñð\ÈÑïÈ•Ô‚.º\ói ¾¡‡(ÈÞÏ0cò½„¦d*ÉÊh„¿™Þ«!éЫ¬jö—³ àöò ™h0Úm¹‹׫Àwh{fùŒ¬ÈâsLÄ&Ï­ÖŠº0,—ì†î/ží>Ö„œå_5ßâÇ£ž¨Éz«ð¿Œ@[ ®4€ìö »Î¡½jÅ_Zu)ÁÎRB÷ñ?ßvºvæ*úbHÄx% 7‰~&‹ä2­a:eàV\Pï àîÿ†mE~«ªj>Sˆgzš–`eAAð¯ŸrHUÆøH@)–æ‹‚ãý²{’Ì0…«ØRÃ}þYLJ@—‡` ¯r&¿=2ÆcÏÝW®ñ:®¶Þ×x­³ûãq‘Æk]Ø·¨aU,ÍU„µ)<µ •>Þ?ùc/$,è_¾# ¼ø{”í $¥8|”ß~"ÍÖÝêðŠ<‰œñã0ýéö üðSNÜœ Ã’$É}åìè$5Œ|Ä^¦Î;zÏ}×dá:ѫЫÿ;¾ª_‹‘Ò .Ÿ8_Ø“Ó1®j“8YñlÁîa´ö:~Ñ7)CðqïÌz1mÔEQ¢‰‚D9fåØOtl_èaB0ž¼Aõ¼öøÎ÷–k±:\1}·¥b´°XšåD½"%_ÂènÚý¼âmdÓ¯»ç„…ÃÁÃô…LÜÎÅä)tj¦zažFÑÇäe(‡3±:‹a”ÁÞ,¦"DÚg}6ˆcMÙσÖx 阢¼|ïé dN¸›É—Ö5|•ÏÆ=aƒ•ã•VûÃÖrP$nFÁ|÷rP±>œf£Î|Ý%¤q–=Zjêu…áDãÄŽ.I¦›_áÛ¥âP³í2¾0Åw¨¨í˜•ž=ò¨§lÄb¿Ëã½Ëií‹Úl²uMHЖËãYŽT»\ Ž¯ñ:… ¦Ó:ä¼u?®=ù2þDLÁ‡ hK¿@ÊQŽƒáÉÉ];­1ÉŸÀcWNQõPĤi%t1e=A.˜Å"b1ª!èÓ"mÀ£™\Ÿóœ]7d™Þrf{• Ï?GÀkÁzX}/«… ‰¦ ms"‡›E›ô“ñ¾R ¶2èÝ|#\âÐXïØ"’®žáçUóÿÒš5 ªsM é/2¹Ó+O,Þ@µiš{Žñr;^Q)]È/DØ<DmH~{åhÈüÓ>?¦ˆ«J%ÕÞë\îÜLkê¶d;'©|ÝîÓ|ªUCЦT2¨g«ÉØâxÌÅÔÉÝ:yÉîzLöcÑu¦{z !‚òþ ãïTrâ#RÀD•VÐNò±'@ñ¿«5m;p T¥B'è‡õU¶˜,øÞo›t9”ê™[©Ø³V­hûjH¹ ÚWx¸O§–°­ ›ËeMÆ“Á«´v°ÿ¡ƒÇavK#øìÊ»ÈØp»z¯ìÀ阳…¾Öo/·Ø#VÆoi’Ä i¤Ö³ïüÖ­)ÍVß’þÊþ–t€7y´ÚÙgœ^IÚèW]zÙ“>’q|·…`ê[š¢0P!&’ÉŒœ}Öð¤ÌtÁ-º©ZøpLÅ‘íßBøy7þ2f·X¶°o3÷Ò “{Áûµö°“¬\ÙW;QÊK¿Ëáø2SÛœþ£-žÙÑd4:[²:YvÎ$²f^„gièMþOõù|¤úÓ1!¿wš°(qûÑ00½!ÈIúÄlnk ¦'ÑIF<©m}YÓX!¦üMGÈ«‰Â\ïZŸ_§`d²ÎÚ öÂvÿuG‰§/õοTø§#>™ÕOQ?{vûÆ:°ãHØþ`¨O´*ØöAqÇä[Ÿãë+½ÔqUóÌpG²5s_&cRVìܧ0g¸ªËg"–£‚‡9Š&~öìP)O='ŽìQî‰yǵº»Î¯Z?öÌ\x‹t©È‰s Àƒ$¶‘Uù Š Ö¿EÒüÛ„×ÉK¬–-ûÈ 6¦áqøÞ÷íÄ1 ”„Óš…î‚èdñîŠÊ§mIl£79ÚØOG+hä¦Õà+ 5Q»ê¢qq‡víâÑB£CG Ó ®›ÉTSj Þè;+r|g2þ஘ˤƒŒ.Õ]YˆOËiã¼áýÓ¢2gžÒ)•ßUœ<ÇΆúÓîb Oªì$‘Û`óñyfô«Ø k{7)áؖ穲UY Àe^â)€~Ì*s¹ì ¢â EÙÜ|oTÙ+òT­PCuÃiNW;+0+¹Ê×5å U-Ö€s¯|}i›­ rã¯~r‰ü2оðˆ4&'À`·òõXz“6Wáx/JÌð®S¨¸Qî¢c²™¢VµD$Sæý´¿n´4‡˜ì=Âÿ—#k]P¬ÏFW®84[/DçI-0-LÂåzKÉ(‚ÇyzÏŸ 6RFqªúYÄò Œ8 ïB ³ì+Ü×9œ’£Ü—EéÑêeXàÌ~¥ÑR4–;wѨ‚ÛýzÓæͬÝ)ÍÈ”~bóKtEƒ±ÞÉ'…üZôÁYQÐkñ§Øc/z]Ñ`%VŽy8"å3+¾áhˆuÒO6Í~Å¢¨Ô±[ H=ⶶð=~’,0aÀ°¹Gqå ª¡öØgâ÷°¥ -ð™—d¦N¡«IûUÆÂÄn<ð^©Øåge.*¨ú&“ÉóèôRùª²¸è1„8q¶ÕÊÌ)×߶Y*:ÇxñíõXÒE€ÿø=;ŠùèPêëePàh­M£ô“,B,5wóŒðå{§y¸OùŸ¯¬$aGXC¹t-Ñûhi*`Ú¸ø¦(šûP¹>lµF1ÒLnz_GÐI”|3Ž‚ó©„aŸZ_gEê‹HijÆ ÚìËAÆÙ9f6Ø÷ÒÒ¥çþ"ýxl°ûó™&lÖQ[wýЀ!ù!Ëq‹œ=†®¯kú­z‘Þ×·Ñ9`ÃD˜2LLËY`iEVÝDÎd/7?s?3E°–ÕƒÈoWnù± Ìÿ›ÀF÷Ú'²¼yèW^œÊ”Þ‡hH ?¾ê³¥L‚iØm‘Ôêg÷0¾ û*ËIó>·ž?tšóö_Rö¶k²7Nb61üsš6 >KGLLË@ê-‰ó¢“C¼Y…,63WL¿@ûCôEr7R"èdMd~¶´$°s™ØÏ@ïӪܑ9StÉC)ŠãÈÆ0ÞÀ¥ŸÚ¿úM·H>¼T=Š0×xìwj‘ôa°4VcÝÒ#å‚È¡Ĩi3R§©y»Šwƒ@j?¨&›æ$»°óžg½g¦¹Åh¶|`/ÄnÍpgx¬À4;¦<¥k/)IM³ÆzÞ’ê4Ð ÂÑrWŽHgÇ]¯¹²4\/ì¿CqA`a”ï‘E4öÌ(}ç›÷~¨“_¹ ã#¤Áå„F—W>‚ñÂÊL4%Ñ·½/ÚÔœŒâ$J,G µ¨üa艶!SŸº¥eLM¯†„ŒµãöB…9iÆkiJt•eâ9±Š J+ WEÒ-ÞIJ2H·ÓŸ¸ÉæU'ÜþfMËœí=û)½÷\"OÈüF§“PÞ?KâcY#^DåRöÅa¨ñ †ÍÏ;c§¬ÃCZ¦†7¾B[nNÜzñ–lºÓ_‹4Û®1ÑÝÐ1ƒçAËÁB&ŽÔ¯©2KÍzKÛ \//N 7°„}ävÐ#’¾…éXÞÕ?ž1$ñãjħ¿öTÑ2UÂØ°Cqü Fú8–ÜYÄjQý$:ÆW;æ}÷œÓÕ`a:á@°ïôûÒ@ÅÁüÅa¼PæµÃãÍyÀËb}»üË Yo-ŠÈXPJZ[®.zÍ7RÅåݾ]dè;›ÕŸ+S8ÒꞪʖñžÑ,^•P{“(Ôݘäþ>iß.äŽa†ß¡<<ÎâïlVðáþ¿ õô°Bû”u°}_qò×v³mÙ_¥'^Žx ±ý'ÂN…鎕wÞ’uƒhÀõ„…†µ1ì(`6µäX/LÀ©‚°Ÿ= ©«,ÆRrævÕú<–›úà Ï#’‘hœd™× ѳq<Älú½ÙŸ@`¾ÞÞò'R£G” ï“(ÛŠ“Ãì6¡9–6K´Æ‘øãì?WúoÙ©ßø¢Ú;Ž·¥ybs\V墾>­0ñ AÕš(º£U¾B ï$ Ìú—þp²Ù˜ÏPÅéý ì•€ËXgB‹ ë#ÏÞP\3å$§)òÈ}÷¶cÚL9lbjº!Ö4Y.½Õ™‚òJžW }`P±è‹œÀ!g¤±ZëÁ©ðÃu…qHâ‚J.'~2ÍhAz»'yLð¬ýSÖ M‡¿^Ô:¸RáÓÁîÁס½}:KÈ ê>tóÊõйÔoáFë‡LïÆ㪎ö¿ ÆK7…ÝÛ%ÚÏüÛ¯â8êbQÓ~  Ôôgr6ÓÆQU»ûÕÅ $œ?_Èqü,¹Õ.ÙëÙkÞTô¤»î³ZÜ_$ÈTg\Ðꔦ8y¹à ;\ÞG™(¯f“(Ý\+̆÷a&þ ºWTÅÞ—xuëej§úäá•~Añ§°x †P„ŒZ?£Þº„‡\Ð¥»Å,§À¾z ‹Ó•¥Åë4_QìàL½rÆ@ŽËÓÆ;îCiƒÇ>J á~ zãêD›-/Í$i¬˜‰ûòiÄ0ò”öI*®úÎ_K</¥dLžXaäQ/ˆ^±æ嚟 ¬°|¸áÑ–$e9aÄþãÂè}­Tž¤z¼–bbR:ϼ6* Á¦\ߥ¼_HL€ ý*è¸ßÊŽíÀÛßí©¿ÏC{rW%öQ!Ðï!<„R›â×(™P¤@UÓN$(¾‡×ÕîÊ™EÇÓæFbÛ¥’jä.ÈÌ„òI¡U„e„à×>žJü¤"ƒð–‚$ûÂüß²2BAjIm vÊo&¥ÿtL%dRÚ°ŽÝÄ~ÐصʯžÝ¦€ÚÓæ³0C‹í3„?¨4Wá?ëüªîšÌ{d ²¬±ÿý DPçIþ¤,BBóe¯‡ »jŽ0ö¸MíAK_¾4ÕA‡Â–yÔ`·Û˜H‹?nü–«{i(¼Í¦YÛ‹ÅS‡ÚS ä"µë†8.¸~tñè£iÚ«3ÕÄÌÌõŸò°@uéRÕ¬f·ÙÄê$­ÿiº ¡Oðz!е7r‰&“egçewî=Ü'½QUa~ÖT¢}Ø©ÎøJ^ÒÊHײ5ÈZK³Z9‚L£ÂL(qÖ‡ ¾œÏò>ëuï8ºf¡Dè¹ò÷Eʾì@æóåb…cU61!Ž`šŽhv)´ÒýUêd²eftÆTðº)hkÿ"Ò#¡ÕEš‘x qû“ 5Æ$¬Gå8êÖeç9g)I4‚„pR36U!yx*Öû/±{§‚AO¿Â0ºŒŽ¾»Ué{8U¾a×úŠj¥’÷Ty]0—+­À‘Åîµ<3a€µ&D‚Ê3æ4ŸLä?¯9Lì üÔ³Ùž.€oVî_)뀴ühfpãdÂî#ß}ZŸ«¾XäßCÆàÇáZQܨùˆ"[Ë^™ÈîØ)úîêî– .Â)s¢ä(_‡üij˵mßÅÕ‹õö>ó‡wpt¯ƒÒTfb]Q ±|<ÐJvDëYœ]QéI¸¼·“@¯ŠÝE <ö•ﻎÖUÕÙ’|0¡ÞÂWKwÓ¶shH‘3UošœSkVŽØÝjÞ€ß!Rm@àãÑÏ"Ç”¥ 8Hž”trȻǥZ¶4ÈEs_”@w¥¾÷™ŽîÍŽQi.ÕÕ`ì‹÷‹Ó†ž áºeŸ¦$¡, áÓ6,¾RŽri/!>+ãáyùRW²hFˆ‰„bÌyk`²?±dñ\¦«äP©µãkª ­£d¦åUo‡ç$wxæ6pKKjkŠ,Òoæ|Z÷ÛDÄø}a½=˜ãËà‹E ^HZ¦KöÑg’†¿‚R«B¬6À^ßÌ«öŽ“ÓZ©>Š5Û…{prôFwzeiùŒ®·cX¿B x5±ôÍÇ}¢(Bbl‹áÓ–êR¡¹X§Yó3cÊ*F*Õ=Þ6ÁéØï'Wµ÷Š~y7{'`¬÷0ôØþe­iO?YŸX„p )ž…4@Åç(Žõh€ö^w]³øòÞ §i_«5‘½qÆ$fþöŽG¬f®0/:ävÄ.ÿT eU6äÛ H¡û‚“ÆîKá‚\CÙ |«2ÅÛëw± ç´?8¡˜Æˆ½»¾ÀR§jý+kyï·¸·ÎYÊ4Ö؃Zx„$QaÄÕ˜H*×±`îûkí& si#´C ;ÿÅ*|'Ã,« øq“×m‰äut³¼ÔDéŽ*Rµ‚î{‰Cƒè¯óïm‚´Z™îLÕ Úó±ü°Ó 4µ¢#Pô ­gs5Aòª¥§–’|Ñ2ýÁ>Íx ãŒuu†OTmZ‘Û4õ=úÆ8'/R×cëW Ž©í0/¶Ú:ŒN¤¹…Lì‹‚ qe(„þ®¾BÖÿ§(uIlþ¸F>À2늬_½ÂötëDÆf¸> endobj 880 0 obj << /Length1 1647 /Length2 14379 /Length3 0 /Length 15234 /Filter /FlateDecode >> stream xÚ­·sx¥_³&³“ŽÛ¶mÛÙ±mÛfǶíŽm«Ã;vÒ™üÞwÎœ¹Î÷Í?3罯gսꮪuתëyȈUè„Líâöv.tLôŒÜyK[cWge{[y{.Y:e ¹«”‹‘ à cƒ##q¹XÚÛ‰¹¹@S€(ÐÀÌ `âââ‚#ˆØ;x:Yš[¸(Õ”5¨hhhÿÓòÏ€±ç _žÎ–ævò¯7 ½ƒ-ÐÎå‹âÿÚQ¸Xf–6@€ˆ‚¢–”¼€RB^ ´:}¡èjlciµ4Ú9©föN›/&öv¦–ÿ”æLÿÅ%ä 08;M,¿Ü€&@‡ Z€ÐÉÖÒÙùë`é 0w2²sù:{€¥‰«é? |ÙÍìÿ•ƒ“ý×Û/ì‹LÑÞÙÅÙÄÉÒÁðUQTüßyºX¹üÛÙò Ø›}í4µ7qý§¤a_4_¨‹‘¥3ÀèáòO,c ÀÔÒÙÁÆÈó+ö™ƒ“å¿Òpu¶´3ÿÏ hN@s#'S ³óÍ÷?§óŸuþ·êl<ÿåmÿ¯]ÿ+Kg =óWL—¯Øæ–vp ÿô‹”™=€‰ñßvSW‡ÿÀÜ€Nÿ: Êz†ê+ #S{;O€)Ð ŽAÞÞå+$€òÿNeúÿ>‘ÿ$þoø¿EÞÿ7qÿ«FÿÛ%þ½Ïÿ•ZÜÕÆFÞÈö«þ=g_ƒÆÈð5k²€†‘àŸciòÿq5²µ´ñü?9ÿ×ÝÀgý?9ÿ+üïBvæ_ Ñ1±Ñ³ýÛlé,né4U´t1±˜Ù|Þ¿ìjv¦@'K;à—Èÿ:ß/'FÆÿ‚©ZXšXÛý£Û¿! é­áK·UÀ ¥*© ­Nó˜¶ÿÚ¬øÕ.ªž@ÀÿŒ¤!goú¿ÿP Û{¼é˜Ø¹tÌŒ_—ñë:r1³úþÿ„ýÓ®åŒ\œ,=:ŒôŒŒL€¯ÿÿøýçJï¿ÐˆÙ™Ø›þÓG*.Fv¦_­÷¿ ÿÀ&®NN_Šÿk|Uþë] Ðh·¾boÂb•‘éR™72%ªó³Ÿ |$Ô¡¬Iµ¸0 Ö¾Ï?#âW•á{](}ó ÷ßÏå3‡Ci꣱~ Š¾4àŸ<_ªBämò.š£ ý2„Ìsï«%Ù]mvFõ£½)%eýÒw(ü™.'˜«'ª·Â4ÒGD?“ôÆxôn¤f”ú¢³sò䓧GŠ¡ñÑ‘á¾ÈC\šÜxX2#L¿Ô3¢OC§û&“¿¯n®ðîÞ¨™®$vÄö" ^ /Ì”]ewÁ3ºÂéÎMëÍŒ^W#÷"|$€p¼Ð÷,Ÿ@ñz’8“°Ûk¤ÃŸ<ßñRwh¤Õ²zÜ4šÖÒ|Ä(Y².¤Œ¸­ ØÐŽÃ~®»A#©ïyʨ?<Ð6üüœ`°„Ú’ã²]„À_mûÃÜ›4XdYs´›JÑfÊᚼ̣Ñ8D¸|rO“­Â°÷Ÿ™Wìµ (ÞØûßZ(¯ªéã:“ÉîçÏkl„ò€ÁjÇøôÛͲñ§LL;¡qµrw}@žúÓCË/B{Ä+¢-ñÃJ–KÈÓø׎y3ÌÄCiHB7³†¢PWÓ¦ŸÅݘöòsÈ:6ݲT®‘ =>ˆ°]Æ¢£ á¼5ĪϸßðÑïñŲ<'o¯„)éØQdc”§c|ºG«Gó^T½hpŸy­³“6²‹%1 ‘9>Ú‡Õ l¡†ÈPÜþ¶ÂçÊ[??d=ÇA.4S0>(vzïâ[”ôˤ¬~ºÚþ#ΟË ƒ¨æMC.w'Keü’ìnE»UŠ¼háxoL{³³ûóP)û„ŠøC-‘‹˜ çÔ|™ ^[=ub&aI;¡p¨¾WXõÈžáa?›„ÙÜoÐg»ÌÃ?Ó€=.hbˆ=/|p«d5 ‰ö}ÖÒͶ#‹C3±;?âæ[ÅË:Ê9wá …·:›ß{¼JêQº?™ù L­½pNÌ­Õ‰_Ô¼;Óg¿åW“³ DZ{7ŽÓþ½|¬‹÷ŠôÆ{ÈaßÄÊøUêíñ–d©émR©ÚÀ^í‡P[zß] )ïäkÓÐ(ïe‚ÎLø 1üÇ &÷A„%Ù–]RqñèÃ&4cÕךùqQñ2Çï¥\B >èCœŠ7)ýò¤z¡î^X~¼5]t™±K¡(BµêMõŠH2TŠ×Ol‡bÂfBªl ý€išZÍR²•ú³{_^«YÇÌqƒÜoc½Å1²Ø¼wç³uïðWìUoí0ß5o3tÚG—UÙÞHó…>!êŸÁ¨‡ŽËæÅw”#Àf6âŸ}Ü~õ æaÍHªh, Që‘Oú~ Q| ú<ª,¤’ š‹5§måþ©zçì¥FñHË ±ËˆG¤eL¥–['ÆOšÝ½÷Y,ÀŽVAK®p>a°éÿëf@ý¶W«jªE`%bÉlΈ~ò‹)µpøùºœ¥AAÌzccNÝÓd¸ÇÈ‚à–œ^ŽYùŒôXÔ¿¢Y<ü²/»¦æñÀ«‰Õ‹Þ‡£t¥àƳ“æá㊼۫lGí„ àóÅ)Êt/'èI@Óˆ&TZÎŽ(üHÜ¡%Â{ü:Õ ,ÈÆ›Aõ£Z!¿|œïC ÅÌ·.òÙ#ùvâpäL‹5 1ÆÕÎÒÿâxï*jÑ8Ä5ð?’ª[¸SMZ¨[îPÁÕŸe°¹ù¼p]q6{ßçáôŽO-n“XZdòéû/+Ý_ã-׃s×=ŸBÂ"e°ñ¥Ÿa¡wãÁÞ„P¢¶©h§®~¼ààŸ†#xÚýºùÕ¦¶Œ=@:‚¹pÉd‡CÄY¢ômGjØcóŠÞ#FÚ))è†6ç¾5ª>«Æü,T¡_ÈV¼?C‡†ê·€äÓ÷ûPÓ*[g™yŸí[QÅ OÌ‹v—ðÿ]-Í{ ï|·gÃzWBKßÍZJ§0¸BPC›¼—ñÚ-Š›ÝµmFÜÜâ{é ©! áŠ<£âIæk:…²cÖÇŠ‘Dþ a¤G½L,‹ÈœþHX‡Þ!Ì=8«Ó‰ 4ŸÁ…CÚdãýæ¿WóÙÛ¯ú•Ïât­-Ä<`PãX­R¬K ¯g£s7¸ìÌŸÈîõÅ?ä`Ä@*]Ü{“×Æ#¹càb•²R¢ôUÃsÄ¡UTZéZ|ÒãLƒñ3: êª4-ø$Æ’Í3Þëpšgç=³0Ü<ð9ýƒ½u 13"MÌÃ`"nué® ξŸÐèò!"z—…„X»UYVóÞ\µ;ZQyÃè‰ö]Á7Ü´r{™mhuË榦ðÛ¶ˆlIÛ……¸I~움*Wwrû/¦ ðXkó}â·¡‹iØBµ“áWøÃýrѯ3jzÁlZÛBG¹éïhÉÑ2Ü okÐR± Œ¾â4¨>žçM]úv,D¨"¬ÕVm£­0IgÃêÚúïÐ)Â׃®…Âaç(ßúfÕa¨‹´ ÷&Téò7}t4Aí9¸y‚{Šx2<§\Þ$°Ë äà”«·›dÈè7V±ïýA®¤]%oç1wµR)½ÜLúNïŒÆ7€-þ$†(VaVå¸"$‰‰É·BnAe!Ídn“gE–3«‚-§×‚-¿$ÜK&.RŠ®ÎÛ¡kOÃÙ²ÃÆß¹B+ÒÀуy{¨Q¾â¤öª¡fm…» é”ŠÔ kÇ+.š¸°ñ”»R%®ôË~T;K§)´‹ÕÅ®J=Ïj!÷¡j—â— á5WÉ|«3õëš^5ÅuH! 8Ë­•J4<|ÚFË«·pÑ+ø:ØÂŽ_.»žÙ8X_.û gsíó¦…Ê(ÏK+C£Œ;YAõéBq4f3½¯1¼l ©^7ø‰[ÞYy6»/‹h¬Óm÷é|˜·­È…Æä·ëÌ“7v¹Pö¿-)Hj¡|bŠ ŠG5 wyñÔ#½äo“·ƒ¡;E{’¤z¡Ïã`ª0X5ÏJúÿLuÎëwØšˆXèö8,0žÅnÈÛÐÚ#Íhë¬.–$Ì͵§Åï:y ¤.šŽq6‹ã¢Ý1 ¯áÈnàQ]âÎY&y7šuàCúUŸ.~ŸÃIúNé ˆ‘ñk¬¿†o8|WZ€ÁàÏa§CÙÌE‚÷J:éú·”Zøɺï¶yÿ6.HùTûÌr^ê5Ò#{H%Ïüïî¶!• ãzê‚-˜V«'Ë(0ƒï”¥ô†4Rù‡&ó°îÔãÚØ>•»ÃšÅ”–³—2ë)AÅ0uØ]q4"Ž° …ôÞ&îçꢅ‰Ý¹E^[ó¯EÀQ[Ž5ç[ò‰¹%Έ™6vŠæÈ€™!X`” ¶Ôßø¼ªv, óó™‡v“°à­}¿cÊXG‰¶^—û#T@å »z¤ã]±uHĬë¤Î¾éYwYù-ˆEâ¢õ·ÓI£_Tmên<c7g }à ¶õèµ™øæÈÍaWð° gcKr$O¿ŒòÁà‘#BDø*–D¦++ª6èK¯‘oPi3àÔ õÒKjøÁÊôßIæ)òk% 3$oâ}³Äœ thüáà‡â?I-À³ƒe l˵C,âÍÀçƒJ„ôÁªoj&³C 5Š27Nó ž`lãó._\ é礱&ïu€z”òÕ¥Önàjwk©8…7 ì9Vâ&4â2·?Óü†Ÿ Ht¶nodiCDʗήÓtàAÎþvkêÓÚ¤œì¤FÒz¼el-\í;VÆÏŒIù÷Œó|Ô³tf°íÏÈ¡éóõ ŒbA ü+@‘â§FHW±‘„¤2ËX½oE8sý¯0­ö’+žYu¦ãÌ»i ©íå €Üºfð•‰ûõŒgì°xÉw2Ë—‡4‡{Ë6:`^éƒÀh*Xº?´‚»h—@òꋹÃ(kf5Ü;ÛÛdT3LÍŒ« ö‡(yˆ\ÊÛQ6Ø#K+n¤´6lVÇ4Ùbo•ýj¢N©(I2`… ƒ›a¥¨rÄz’¤èiŵ|nʯuñ¼† ôf}+hxùy‰za\>H«ÄÓŒC Ó»O=˜5bbŒ­§+Ñè‚üŒ¸Š­|œ©€cQIMÎ#k/¢§,SõßÓ¬·PA„–ÀeÛ« 'Ô ¼™j8Õʆ٧)Éú­:{åóüø÷$ù¾Üs‰MÚVÜ}ó²'Õù—¤ò®nൠgÔ1džFåÈÅêz0§îv1Í»€I © |HÍi®!:fGjÅþU©Æ2g3F¬ z¸P˜ B™YmTÙ«aOEÿ‰L¶­ŽH'Û—N ‘s²)Òˆö †î÷»luÂñ|?Éøg–â CO]°ªCöŽ®hÊãs€,­«¾´„¦·,¬Ìí<ÝdG^MéåÙç M8V¸âný#ÿ'»Ïf6±AB¥âòh•·ùñH"4NfB¢ƒÂÂß2Ö×|®)1Ï > 9¢Ejtx| ¯}¿žÁŠÝÝ3hͼ„ÿÝCAÁ2¦½4·Ã+¶ƒèÁãÑ­2OLõn¿Pµš÷# £-º'øä;èãJÌ_0M÷ÑÒŽ w%fRù”_h ‚à ? üÊøм‰*·n""ý¨2Ãü]…XöþÐ]G=U— µ×^BÒ«”ý25ÔB4:ar0µlZý:–¼jä×ÿ(%›­ªÊwkCLÃîhB­”Ö¸aUð •ë ºUh‰^ºD §Ü.£l²jEÇÔ.·n–ŽaŒJ¨GÌ9‚>V€(­ü^û!Œ eE\J¬&Ïä4ÖÊôD°¯5ÑÅÞW4#…¤îßvE{ YÆÅ"8{¦È¡†ó¡ˆY7Ò ˜¾8½ÌÒ½Œ¯¶Xªšš€ºmz»äÊ™6ÐñÎa½˜dªÜ¨¬ÿ V³4ËPFé$l¬ZíLf¼} /š6i—«Â À0*ÓzSl=»s]q+Àߤ°uÿàû> „ópB˜ë/ðW±Yˆµk'VõC˜f—{å©ŒµºôÖcf¾=|Ÿ,:j˜õO%"%•c>¾6ùÆZéS>*å¬Åfÿùæ4ù¡;þèPÉP!…qŽŽ£dˆ'Ùm–²º\átTq!Å#…Xº.õ‘jæn1ló*|Üùgô]Ø ()È”ÓynEš¯%»=–JñAø ¡Ô™k¼÷–ç§cs—F­S…ðÞð–\„î,n` ‰¡nš£ýle9N’ï,˜õl?ɶÙùü¹g5há×CPrJjAs~˜ù+*F+¢ë²xE‚ –!h7¶~[±F”†E«ïkΚ‘¥EžGi‹eW)Ô“} o÷‹fæ”ßv½cHˆW¥Ãé¾:¤ÐÓÑÁ1ÎÀE yÂÌŽB „K(éÝØËé{òe—ëú6V.D¬Órá HサT hú¼™¯'ŸÅžu¦Óúg .<3dÓXÝ6¥!ÊxV>ÄÄRB ™žLGIúŸÕ'®õlµémcÓv6ÇÁ2œ+§(ÜÚ".0_ÁÜ °˜¨zVsÄÏ*OÐõ`'m‚@+èÕXV¶Ž5*M–¼ÊöÙ5‚ƶ5»[4Ÿ_p+=RBZ·íj€2x2†äsß¿K©‘á“ ¡-¶Ý=8’îÍ”Rúæ1¾ÞÕÞ¹w°¶Á>.óI‚.h lYofô¡$éÉôOas<¶¶(=‡uƒUøáÞ‰$b“æóÙ8;ÕóSu#YƒíÔ)TkÈü[»RB°n³`%®g!É&£„…„*Øm#WV¦ÙÌèO+å6~ÎýI¬Ç³¿ÁÑ’šúV¹ µ„2É•ç‡ÛôÒ¬:hKÇÝ8I$™TëˆûðÕÓŽ´­Ûò¡ëtÙ5˜Æ·!0j²Pm#/4y }ãt>ŽÉ…i «ÌÖ >›³…÷®~h=ÑAŠ<ç+ˆsúðªÎ8Z:f7¸¦5”íØÇÑB>'’¨“qù~ÛvS%+¹ò}¹ªÛlî¶y˜‰ kdF" pñþ^ŽlèX8õ”ÒòôãgÁ­”jmB÷À¯ õjYåþOáX—£•©ÎùqÒùý©²];[+ç¾ÓO¬ ¡¸ø ø2¹´ÈÖ!S`À™Nƒ¬¿B[ê…ŒF¥ž`\‘hWèÑôýµ0¦¶×G ¾»8?-mé1Ün/Ú0cRÄ…}"$¢€k'e²Òάk‰‡*°Jt7RW?% ÄàuV=9h¯Hû\˜¬";†˜N_ö#Èk ˆyR7â²r´4fËo?X²NŠ³W¸Þþ¦Ñ ŸF¼†|wIxY^µé@èzÓh\bá ™ün^v’iÛ¶»ìtgÑI¼Aœ™½¥3¸±a¼ŒP)å¬uõBH¥¥ê‘?§.´}«@€ã®ÿy¬ybf¹«Y–€Õ×;¬?ô‘EèŠd]nÊÊs¦q<’ÔìhÓµaïIpÆ4‚þGG"Úo¾mq8øjU­5¦L¸³žÂ…÷Ù´âÍOÈ`zGŽïÎɶ{嘌³H õ? í hmƒ8¸òFa¿Ç÷XËP e{6úFºRçt´‡ÍÿÂ1Ëß@È£ öP˜n’¹¬ “ý+jãÎý¦Qk¡ X±o‰D«d9ÓÆ¿0–]YGw1ÌèÕ@±˜i)êA)†ú€°Iéä4/Ý‹#ÎÏ—EiËüj$1IÀÖPô• ‰ú–¡KÛîB[’d(Á·KRõ›.MÚšäMNŸS©ºG9’=ôSh"ù¶Q­‚4N†ÔZ:žyñù­8-¼‰6~?Œ1†:ÇÜEËY”¾ÐSɹâØ/ñªeò¯NcªVœˆ¯ì¶Ùe1DmÌJ}½„)ûfZôµÓÛíô‰Fm˜´²¼ÈËÉ=G}'šT"€TÀZXˆFöíwþÛbK “ª¦ckÛ§c…£Þïœ%sŬ OrË£Û]ù¿QßKáS9^`üìGT¹£ bj)É|RÍÂ+RX;Eš¿ù HÓ8J„.>‡ùö>a ,¤_¦~MciÐÄÿ|óRc‡™ž» =OÒûË”ÞÌ3ʃ¿ÜñÃve77d˦¼ÐC„«X·Ó×ý©Šizéäëû*åª4\-ÞÒS \Zo~¥SFo–Ãù%« 8-Äj·pW‰¥¶î?[¿ÓÍ×GŒ^¨€ñ¬ªZnn¯ OhcæÍŽ$˜éÌÝûSOëÅðWs¹È€Ì=–8N8ºo]÷B¨…L‡ºG¤wþ—Ⱥ¦&æy7’@å/äTZ–/o#\-¹ ˆ÷§|¶Ç«¶gsÙ]ãÏrÏþQ-;£Loë˜Ýtß #cÇw<¯.ŸKó‡h¶2C×uO¸ï:Ø"¯Ùúky¼¢›J*Bþƒªgð‹T–ñïvÒ7#e å7/îîA 0¿Î ˆŽ¹¬b&sÌeÒˆ¨ƒ¨B>/ÍJ)¯RNaˆÇ8=P∠Aù |5c׳ŽÙx> 5ñ‹Ÿ5‚§òæeeð*µjŽ ôºzbì ^œeaþ‡ 儉øÂÚþÔ°£[Š™Ð4ÝÛoŠ £Ñ„ömµÄíÛ Lô‚ecäâ$ë£gÐ%ïn¼B×(¯û‹o]Ç»áE Aþ~©Å‰È"õL3SïÞ^¤l ‹Â©’Šäº£çS2,*VºõÝÏ[lº"«Å°¨Ü-è×@€)A alF¡sÕ ”Ó<œí"»js¼UÕ¤ãv"t‘¹}k–¸DŠ·¡Uµ/1¼:·î¤zä]k6#êXT§ŒXï‰pÓtkõKÚéùHbörç¬òA­­-™Cl%Ìn'âzxûö§Ì1óªƒ=“FÄuʧô½½mÈcìŽ~÷Bß>òç@¹C>Å®!²6—¦{Ã!CTí9ª’ÐXN˜hÕL vÃ,7!ìºù!•ª6°+×j·©M¾×±ÚÖ¬ÖÑȨÚ3\H2¬kóïu±;}]hÍÃY8óW=& ×öMà%CcÞ[–öL'\…\áTžÌÀ˜ñ, ý¡•›÷I:´m'R/7~$• ¼NõePz°G‹è5u åºð”T)¢f®°þ¼=Ó#F‘•¹K6žDë¡U×çì¶0¨¹ˆ¢•Q×!ey,FÅþ„Âsî‰s™Óè7#l¼¡]À¡U[m-Ræ#º®‰ÃåÛñåæBÍ A}ÄeÔ*þì,¶¾,Ägÿ¨œŽ5O¢;,Ú6:+áÝÍy¦Yz8vÆ4˜úŒ“M§o…ßcxþ>®Ï4¦ÈƉ…9ëò’©#x4lиåìö\²M‘¤Ýk GÊ8e®½‹<à|~Èå³fT¬¿6êc¸újo.ä¿ÍÄj$æœÉ€nÒ¡¥ýÆ|BA: U‰'ûâäÒðc; ›}¹F› :˜ÿ÷k™YÑ…¹…@VrD íî›o¶†bœÜß*½"®ÀÂó&jžù if†Êâ\úQ˜”Ó„ArBÁAÈò6Yo–;¤lýO¨X£È ò|_7ä\¸³—¸/”ˆ*§z¿o [ñúÇ­8v庨†¤¶ãŽòDþò»•\T¸Ù·yDkgþ5\*Ù‘¦Ñ‰¹MƘÖÁTqûkÍ[&øîíÆ7ÈÇ&¿U⓼Âß;œ2Æ)R?„_F +†ÉuMÎ'Âjúî³bhëkzãîÃp¼‚MÈ2‘:M»îVRj|ƒM?@DjÀ£_‚Þ¼?@ßšHÒx·jföJþ\Ùâ”E×öÈÞõ_ãRˆ_Ž\€×£8 Øw¹ðõí‰{Ðœ»\ñgûöCòÙ|¿RipBñ$¼dz MSôÒ›:G|Ò2ë,“'úŠ`qx8{?~B–4ï"Â7ëLퟌqSÐl¥ià/¢É5w^ºG^.QÞâÄËPüÃï:‘Sñ oƒ¿}¬î^oÎÝE|ÈŽ )ˆïÊÞ˜Cl>uŸ×ä ¨öoˆ±ÌmPîÕÆÛp½32ímð;Àƒ(Ñ÷rûì¸gýôàc¯ë3Ï“÷Ð$ U“q61ùþ¤Ï÷ «/As˜­S>7t¨®‰ý[—Ó<§+×™Wb6w±F—·¢Ne ó8èºÓÞíËÓMؼ3j ð·'ÇPV1›Ì€EÿÙ“ŸbÖ,0ÃÛá½|Î!ņ~˜f”ûèÂs¡=mÒØ1¢‹B÷Z7'ëØÏͥʨ—êKÛÒzjeKXà'×Π—á”L /ãœRK—Ž:KòA÷•¼i¹Â›:–ŠŒ\MTlpn†?ô\ú¦Åà[îÜ ž+`>¸ãóÆ]­Kq<\cà{O—jÐEŠçnlIR͈¸Ó”›0¸±p Ÿ’'OâHâê(HL_¿R—ÿñâT›û£y¡^|ˆúg¿†=é-säT…î›%ÌЩ /–þ7úï… þ#¡¶+& Ī4ßvó£húâ'šÕ=Å.Á0’fù[¨›´:ÙçúßúSÁy)µ2ÒEµÞ6×ñ€Ü¯‹òV36›Ã!·y*¯‘5²ÁTÙÂOU§ÁF6]j@Ç>/<Çk‡^(e‚ždpñ®•Ç-h@ô‡: ŸK ´ùB–Kâág1ÄãO½˜„Î8£l[,’kÚë7Ð9Ÿ{hñbÛœÓñ>é¢ 6`¥œúLˈ=H˜BÐËþpç^žó tWÜéˆåÙâ@†J¿E‰m°±ÐL=[©Æäñ}s¸oßÈYÛ½ze,~kê«v C˜VÜZŽ9 ªUER#ù,G)¯¼iŽ»Í+í‹uˆtsÑÊøSÈ@hâ91Ðx+Çzr‘¯ô\jÊb`΄-LÉe)fé- ‘UñÉ`ÒÀ‡rã_\ø í{UNÙ““†9]~ýž½÷í|Ó¶ƒcª–wÑ |.gÿMxç­ÚB¦8ù?ÃÁ/§¿›7YöfìøA`ï 5›š¤ö’Ä)ú[ÕfñÆ£…©S ÓSĽBg 5LIþêvV ¤7p3£³¥¥“,ĸñõ,ã…'X Þñe$¯²<íf y3 V¥u#ºè!p Æš{Â<-±˜ø3S÷´Söoxø.) Ü#c-¶)Uêx®pBìj¾¡žvµÃûV˜r—„Nœ˜‡ÛŸÒêßC96ÁHÍ©ÎÁá~4§³¶ãB€t½LF‘a!£êNŽ¥ŒAªJŒ\K¿ue3ôEEê·õ˜ ¡‘NDã׷ᦖYŒƒˆ?é‚®-ßñùÑ„êÈÏg éz6R“Æ4L–ˆ% v¬–bÀª¨hT|AE.Ul~T„‚''W1r  râAË\ ÷2ˆ„Ø–­DÁûKaÍéã-ù,m¦[ãžš?Ï/àPAáL{Ó±l_–rɽµeÊÇÁ_5.ÎëÕrOªgg„Åóu·JÒdû\¹ Z† ás°pL6!ò¨‡/ß6ôgd– ëºaëæ3g®¬ÊÉuÎTÃ~°ßHØ{pX]Ý8±ìÊ@Q»×ª£Î ¸Q¯ÓúçRpþØV&9Ê¡JÖ!Ìl%š&à»ÑDÙÛpAù»†Ëa~Jj £F|P‘Låd ‰ÇYÞ?×Ñ ~UÈÎ/üE²[ƒ1ÁèÛ:¡µuê\°£dÎdì½Ø&‡:>Y8n>–?|b_Á9Z:~D¬4ÿ@m<èëFi9gšbßÁu©"'’»¿œNj§Ö#ø¾ž ÿèú²]éÌë(’ÿ yú§d'ÜHxêñhÜÅ lÅŒOýË–Ï^Ms$Èi…ç -ý”þÚd•Þ³l®+\¶Ö¦•®¶v·P´`âÕ6e÷7yì;-Smu‰iÎë±Ý|ËaÓ뀄£SêJY‡jZ>Óe-Î\wêÿ÷FÇíXø‹ßïf;üï%®³Mûoˆêª/?á±»_×â¤<€[/ÄÔ›‹áØÇé3ßaÔgPŽ¿Éjk áZäóÒ6\m¨Â¾E‚š B¬†ênsÚÜÒ+H盩™KÖ…[|¤¸Ášâ°uîÛ<ï®å‰?¯ BVn®É €Ͳ„­Y¶'Îö#²œ¤uý® ‚µ€×¼k ¡iòØRÈÐÜ7úÑK!py¤adsì·¼®UOÓv¿ÞErŠWʾÕ!2G& êqšôÃFy´!lÃà_ˆøêo³·Sú³óƒåœxÄXœ…•È……D®“>Õ/BrÆîÏÑ2Û‘nñ´eB¸îé4s}Ñ/Ô‰îöÝgO“&ö<²…c•åÅŸàÍOšCWBo6k(Š.ôWôÂÞ '}ïöˆ£Ë;óp³HZÓÉ}1°{ñÊŽ£,KàŽ7k²kJ9ð{%Ú©†u㤾ßF6kV`øͨŸU1,Û½Z¡ÒŸô®vêÔý•?V¤Z— æ\øÕŸ¸œšÃVÕ±g‘ÐÓ½‚ÓÚ¡&8XÍ0á:±Î5ÂIÚׯ‹B:ÄRÊ° цVŠÇA´ËߺР“Ÿp0n畺{9$¿ÙÓ9¼¥{ò Áô é3{ž§/ï< %õb=&%£•GºM*˜x•H4uÞOãiÙzÓÓå@ø»zi=WÀœÖu݉+sBÎÆ•±(B¨¹áò“Ø©2l¬Rê×¥±œÎRE ÎS"{!¤ÂÁ‚iÂûòóÓ’>M³)oŽë(Bÿ&_ýßjÏ‚¿ýà'c2¦²»˜ËXîÖÿºÜ½‰‡šä#ÆÛb_=o‰¦Cm½[ÒÃ-F ŠzØW·‰†îܯu¦»Oh2ã-à &Á‹;Ú‚§$n®à+Ú:ŸeܺfxW¯äw6ºˆÉÆ’‡¨…ì_¤ LIߧ¡IÓNÃ’YžRƒ^º²BDÖ,_fTœ 1:D¹è[:KÏ­Ÿ§dB2æâ9öK6¶èº! £l+;H³£ŒÎÈÅ·T%±»3v›³Ÿfy]λí¢kçϸ^B ’ÀÌgÂ!]ØÐì¶ÎÞu|?\œ95o¿‰}‚ UŠ ~J§”o' OåE;cï¾XùôM׈°†²R¥™çeVYXåh¶”¯Û¥U÷Q(†LªØå-=fQåsÍE« —Gë’ }éër&ï‹@Gû+M‘|åÙY…> „:ïKlØåR*I½šÕ´4~³YŽS+3ò‡¼ÅMØ­âÕ“žÑ»q …+ 2¨ Æ}c=m_Gsz0“ù›#ØD&N€g­˜«nO,ÛôÝ[²`u¹ÇK¡›¿rv1Xy\…ÿ£„Âû¶ý;"[ßåã·Ëç$ön}94F{ó1%áùŽ‘˜ÊIt j(÷[ÛTâiÊUn¤_ÞÁ¹-ÂF£ð¸ŽDÉm0ŽÎí€å‘UIOù%Ån'ÎÛ,™-­ˆ‹ZpsýK0ÓDÃ6 å%>Ÿ,[óißÙåÓqA‰µŸ£ õë;ÞpÓ üÕ± ˜}Ä {­‚A©çîH”5Ó¨!r¾…ú•çÎS¼Æ&’Dq+Úm‚@èÿ"4·§êVÅ e«hœ#=»K’6GwqšQÏAtE3^B7gŽçëWDI.y ç Ôæ¸D"U.¯,¿H‘yuáOjJÞ´ Z/ÅžðšHï-¡È·BòmªP$>—}íwWSÞWn°È{¡á+©Hº+¶>h_Ñ­b¬})–ÐÄ6R¡è!ˤI"¨IX… ÞHÎütÍòY´ µïâ=ª,ÆK Æ«ñLf@ØP˜±¥p¶„~ ή˶Zzš¥..»ó¥ù,\ôaœé#³UO1’q›Ó$¼ã½²šzxÝs¢Ûo=8Kþ<ÿ·IØ eÄ2xéò;4èŠMe¹ËXZ¹æ÷r»%/oá²€W]îé­æt ›pôÄ2Œ>ˆª:¿…—U$7ÿN.YÂq…a&'nÜ®î÷ÚÙE„1ÇùÒËN_B0éÁ¡(f„ Sqz¾&™%“Ç6õØ-QðqÈÄñ¥Ø‘Rº7M8J–ꎬï H²\Æ8ñ þ¼aåÏÉÇcÉhh£¬7> û¡á¥.¥ÆÍ‚q’ <¤¨Ü Ë9Ô_aõ¥ïËøO°yM× ñ †à"î9z\ª+~ùÛ+¡‘Hûµ1ù©  E<‡L RùYÈß”)ÚÄxFôYd!w¤D‘+Ÿ·æJ6Or¡Å;F’¡M™¿ÁTÈ}Z:€sÞ7ÅšóØ¿z¦]›è§6÷ÜÃò9âY z[#Ù¶]èhî„F»È¾•¼Ï`23 rDþ­ZE}ZuÕ¤εšŠE Ý­2X«-)íÖK|Ø(ßÏU¢[û€±v½»=ê°¼s4 L÷³“v·Î9nóÁ 0Ë%ƒÐ ëϱ3NNGÈœ¶çsF[Aiê”ÖU¦éÿo&m‡!šHsËnÈ.Ÿ.’î‰SIú7pð,ž.DÉ7ÔCRÆ ±DTž1©¼$ûºKÄ÷¼ZÒ+IG³™­0,áÒßTºM­ÓZ–qAƒb2-Û¾»»+o ”Z²ØGž$gô5%ÎÚ˜ÜQÆáÿô‹†L'* åº*e'<ÑÚ’§·3R …g(Â׿bŸ”ëÃàÕGÕÃj¶lXéÒæp¬E lš]å¦!ù]›¢Âþp÷õY5¯U áV·g5hì Buí1…Àd8³ˆ`êBíPöÃíaŸ^[HfÚ†ªõxY\i“h2hyÅØV v–zèÄZ”ô16¾àV®îÁì­mïQ¤êþÚ‡9ÝÅÜ1­"´ÒÇô[5ÀÿXÿ U£“wÚv–ûGÆ)ƒåx¡ÎŸmÑr¨îÔ÷‡Þ€DÔ{”Š§µÙ ·ª=‚–¶W¯éÓe»Þ<¢•YUQˆdìæž%/=Œè ¸Q󛔘2j¹8–¢çž”M?UæÝC‹ Î Éo†ªué[1ˆñªÑþ,Œì–ÿ|,Éü{õQd§òøO°7]Œ9'2ÒÄ`ÝípÔà^°I=Ù”IÜÁƺšãtvá?/Ÿ|!VÐms\þŠV71¥™Ÿ(5ò¯éw°È½•¨,™úÂÐ}…ÜÞ„§´6Ä¥ìf ËHmÄšhAAºüÏa°žµ0ª‚ž‘ZÈ:ú ž¦p§V$…´}e'MúVH`ŽÉæÕ/ß7vwò[{)¢KŒ¤%ćâç:ÆY1Ç?.ÄÈš&JݸÈ'D ¤›%³/]ÒX¶Òþs˜Shuc&˜¿£I-þÒòe»\S NzIYF†ˆà˜˜À¥¥ÉŽe¾t=èéýuöífÂe"à:L„yS“ÌÓ•…pòËÝï‘–ø”°PmSÝNˆ`T‰%ÌQ½Îú‡ª0¥4w…iTù騉;èb—(;c…Äs®OZ—•«Ô0Ÿ“¨úÇ'‘äS›…?Fà<¸WµìJVPzéÅtÓS²sàÇ/_X#€ÌKñ;¤Ž'•§ÑÊR ÉK†à7d˜ü ‘/¢Êɾ˜ÏøR¦.âwɽypÐ’{ @â´‚¯]L9á<Ã÷¬¢Â£k1¦G® ÅŸVå{άX”؆2ˆ> ÜXÂ9♈ë•yÆÞO8‚\S$wo]ë)ÞÃå1=—©ó+zGæ8¸WÃ×AFI½»Øá¸0¾ü؈¸™ëwÓßàÈÜï„#.O•V9Ôí³ïoîÛ5­‚Á ŸZ™0¯Ȩ÷|”JMRÏ%>¶ûr?°o(¿)PtŠ$°óvuXBûzÄÕ ÆÝx[û/ò^’Ãœ¹g^‹šûBÅr™CyK'¦G×&lÍÑ|« t1¢‰êQw~N"†'Fû“m÷ã,óÔ[µs‘šÿåj÷Cí€å7°Ø+Ð2Õ]Ü“mJɪcÓ\å ŠùÖ%ÃY·µ™L.¡J»6žŒ›nxzä}žý“+z8~F£¹Iýº¨±Œ à ŸÛ‰«š°uÂe·ÛTå{³Y lj“V™ÍO¸< ·Ë¿·ê¦g^bq­Æß'ëµ.†7Û ¥q]Ô Säà*¹×·Ó—͆¶\û—‰iOà<õ°'@i& eÿ~úëSFgº÷w‡Úéf¯ÑØ7xw•f}ý÷›Pp½ÌÉ~ !øu–’ãòÑg~ü]?…qxk™üTg#®ù™¡R¡=põ"@ªT'}ù x«KôdPc{Ø>Æ£1ˆîy(J~Üs¼¨¹…cšÛyP¿ŠÜJüÊêÚµ U_m]-Ú[ù¹·~vÄ»x&sWDYWgŠ ÿåãt[­¶ÿË;\n+ •E‘&Ù’ë½íó&"5ÔŒ^ˆÄìâ¼Kü•dÀ>`‡ÛüD‰jOßsB¸êB_å¦Æ5|¬õÜs‹C3¸ÈàÀä-œŸ4â­XXÃêU_CBÐ œ œ'$0ùX÷hb.‡ëg4ì‚Ÿy9ö0å‹ŸE òÏz´"ôòêwB‰×©ïs¤K”R}r€Á 0A¨Cq#ÊõòGnËXöÞw£¢òìX_,Vyƒv4uªI.8ÞùQjÛå‚byÏO}È:†6bŠì¶5Tùb+nû£ì_«u Ûù}6ÊÒ;ög…Q2è¸nǛ춓ÞB)Ÿ-,'F„:¨¨ØZéŠÿá÷j endstream endobj 881 0 obj << /Type /FontDescriptor /FontName /ITHOJV+NimbusRomNo9L-ReguItal /Flags 4 /FontBBox [-169 -270 1010 924] /Ascent 668 /CapHeight 668 /Descent -206 /ItalicAngle -15 /StemV 78 /XHeight 441 /CharSet (/A/B/C/D/F/H/I/K/L/M/N/O/P/Q/R/S/T/U/W/a/asterisk/b/c/colon/comma/d/e/f/fi/g/h/hyphen/i/j/k/l/m/n/o/one/p/parenleft/parenright/period/q/quoteright/r/s/t/two/u/v/w/x/y/z) /FontFile 880 0 R >> endobj 843 0 obj << /Type /Encoding /Differences [2/fi/fl 33/exclam 39/quoteright/parenleft/parenright/asterisk 44/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon 63/question/at/A/B/C/D/E/F/G/H/I 75/K/L/M/N/O/P/Q/R/S/T/U/V/W/X/Y 91/bracketleft 93/bracketright 97/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z 147/quotedblleft/quotedblright] >> endobj 373 0 obj << /Type /Font /Subtype /Type1 /BaseFont /JSCYQH+rtxb /FontDescriptor 853 0 R /FirstChar 11 /LastChar 43 /Widths 840 0 R >> endobj 668 0 obj << /Type /Font /Subtype /Type1 /BaseFont /VGQIZV+rtxbmi /FontDescriptor 855 0 R /FirstChar 11 /LastChar 14 /Widths 836 0 R >> endobj 101 0 obj << /Type /Font /Subtype /Type1 /BaseFont /VDMKCB+rtxi /FontDescriptor 857 0 R /FirstChar 11 /LastChar 43 /Widths 842 0 R >> endobj 150 0 obj << /Type /Font /Subtype /Type1 /BaseFont /RERQLE+rtxmi /FontDescriptor 859 0 R /FirstChar 11 /LastChar 62 /Widths 841 0 R >> endobj 25 0 obj << /Type /Font /Subtype /Type1 /BaseFont /MBBWFA+NimbusSanL-Regu /FontDescriptor 875 0 R /FirstChar 40 /LastChar 121 /Widths 847 0 R /Encoding 843 0 R >> endobj 15 0 obj << /Type /Font /Subtype /Type1 /BaseFont /KRRWLR+NimbusRomNo9L-Medi /FontDescriptor 877 0 R /FirstChar 2 /LastChar 122 /Widths 850 0 R /Encoding 843 0 R >> endobj 10 0 obj << /Type /Font /Subtype /Type1 /BaseFont /HNGUNX+NimbusRomNo9L-Regu /FontDescriptor 879 0 R /FirstChar 2 /LastChar 148 /Widths 851 0 R /Encoding 843 0 R >> endobj 71 0 obj << /Type /Font /Subtype /Type1 /BaseFont /ITHOJV+NimbusRomNo9L-ReguItal /FontDescriptor 881 0 R /FirstChar 2 /LastChar 122 /Widths 844 0 R /Encoding 843 0 R >> endobj 24 0 obj << /Type /Font /Subtype /Type1 /BaseFont /XMRIQQ+rtxr /FontDescriptor 861 0 R /FirstChar 1 /LastChar 61 /Widths 848 0 R >> endobj 60 0 obj << /Type /Font /Subtype /Type1 /BaseFont /YSRJSF+txbtt /FontDescriptor 863 0 R /FirstChar 45 /LastChar 122 /Widths 845 0 R >> endobj 654 0 obj << /Type /Font /Subtype /Type1 /BaseFont /IFFQXQ+txex /FontDescriptor 865 0 R /FirstChar 0 /LastChar 105 /Widths 839 0 R >> endobj 28 0 obj << /Type /Font /Subtype /Type1 /BaseFont /EEHFYP+txsy /FontDescriptor 867 0 R /FirstChar 0 /LastChar 120 /Widths 846 0 R >> endobj 655 0 obj << /Type /Font /Subtype /Type1 /BaseFont /GGWZRX+txsyb /FontDescriptor 869 0 R /FirstChar 42 /LastChar 90 /Widths 838 0 R >> endobj 657 0 obj << /Type /Font /Subtype /Type1 /BaseFont /NVRBFO+txsyc /FontDescriptor 871 0 R /FirstChar 44 /LastChar 66 /Widths 837 0 R >> endobj 23 0 obj << /Type /Font /Subtype /Type1 /BaseFont /HOOWSH+txtt /FontDescriptor 873 0 R /FirstChar 34 /LastChar 125 /Widths 849 0 R >> endobj 11 0 obj << /Type /Pages /Count 6 /Parent 882 0 R /Kids [5 0 R 13 0 R 18 0 R 31 0 R 39 0 R 46 0 R] >> endobj 63 0 obj << /Type /Pages /Count 6 /Parent 882 0 R /Kids [54 0 R 65 0 R 73 0 R 77 0 R 81 0 R 86 0 R] >> endobj 95 0 obj << /Type /Pages /Count 6 /Parent 882 0 R /Kids [92 0 R 97 0 R 104 0 R 109 0 R 114 0 R 119 0 R] >> endobj 126 0 obj << /Type /Pages /Count 6 /Parent 882 0 R /Kids [123 0 R 128 0 R 132 0 R 136 0 R 141 0 R 145 0 R] >> endobj 159 0 obj << /Type /Pages /Count 6 /Parent 882 0 R /Kids [154 0 R 161 0 R 165 0 R 170 0 R 174 0 R 178 0 R] >> endobj 185 0 obj << /Type /Pages /Count 6 /Parent 882 0 R /Kids [182 0 R 187 0 R 191 0 R 196 0 R 200 0 R 204 0 R] >> endobj 211 0 obj << /Type /Pages /Count 6 /Parent 883 0 R /Kids [208 0 R 213 0 R 217 0 R 221 0 R 227 0 R 231 0 R] >> endobj 239 0 obj << /Type /Pages /Count 6 /Parent 883 0 R /Kids [235 0 R 241 0 R 245 0 R 250 0 R 254 0 R 258 0 R] >> endobj 265 0 obj << /Type /Pages /Count 6 /Parent 883 0 R /Kids [262 0 R 267 0 R 271 0 R 275 0 R 279 0 R 283 0 R] >> endobj 290 0 obj << /Type /Pages /Count 6 /Parent 883 0 R /Kids [287 0 R 292 0 R 296 0 R 300 0 R 304 0 R 310 0 R] >> endobj 317 0 obj << /Type /Pages /Count 6 /Parent 883 0 R /Kids [314 0 R 319 0 R 323 0 R 327 0 R 331 0 R 336 0 R] >> endobj 344 0 obj << /Type /Pages /Count 6 /Parent 883 0 R /Kids [340 0 R 346 0 R 350 0 R 355 0 R 359 0 R 364 0 R] >> endobj 374 0 obj << /Type /Pages /Count 6 /Parent 884 0 R /Kids [369 0 R 376 0 R 380 0 R 384 0 R 388 0 R 392 0 R] >> endobj 399 0 obj << /Type /Pages /Count 6 /Parent 884 0 R /Kids [396 0 R 401 0 R 405 0 R 409 0 R 413 0 R 418 0 R] >> endobj 425 0 obj << /Type /Pages /Count 6 /Parent 884 0 R /Kids [422 0 R 427 0 R 431 0 R 435 0 R 439 0 R 443 0 R] >> endobj 450 0 obj << /Type /Pages /Count 6 /Parent 884 0 R /Kids [447 0 R 452 0 R 457 0 R 462 0 R 467 0 R 472 0 R] >> endobj 480 0 obj << /Type /Pages /Count 6 /Parent 884 0 R /Kids [477 0 R 482 0 R 488 0 R 492 0 R 496 0 R 501 0 R] >> endobj 512 0 obj << /Type /Pages /Count 6 /Parent 884 0 R /Kids [507 0 R 514 0 R 518 0 R 523 0 R 529 0 R 533 0 R] >> endobj 541 0 obj << /Type /Pages /Count 6 /Parent 885 0 R /Kids [537 0 R 543 0 R 548 0 R 552 0 R 556 0 R 561 0 R] >> endobj 570 0 obj << /Type /Pages /Count 6 /Parent 885 0 R /Kids [565 0 R 572 0 R 576 0 R 580 0 R 584 0 R 589 0 R] >> endobj 596 0 obj << /Type /Pages /Count 6 /Parent 885 0 R /Kids [593 0 R 598 0 R 603 0 R 607 0 R 611 0 R 616 0 R] >> endobj 623 0 obj << /Type /Pages /Count 6 /Parent 885 0 R /Kids [620 0 R 625 0 R 629 0 R 633 0 R 639 0 R 648 0 R] >> endobj 671 0 obj << /Type /Pages /Count 6 /Parent 885 0 R /Kids [663 0 R 673 0 R 680 0 R 685 0 R 690 0 R 698 0 R] >> endobj 710 0 obj << /Type /Pages /Count 6 /Parent 885 0 R /Kids [705 0 R 712 0 R 718 0 R 726 0 R 732 0 R 742 0 R] >> endobj 762 0 obj << /Type /Pages /Count 6 /Parent 886 0 R /Kids [751 0 R 764 0 R 770 0 R 775 0 R 780 0 R 785 0 R] >> endobj 798 0 obj << /Type /Pages /Count 6 /Parent 886 0 R /Kids [792 0 R 800 0 R 806 0 R 812 0 R 818 0 R 824 0 R] >> endobj 835 0 obj << /Type /Pages /Count 1 /Parent 886 0 R /Kids [830 0 R] >> endobj 882 0 obj << /Type /Pages /Count 36 /Parent 887 0 R /Kids [11 0 R 63 0 R 95 0 R 126 0 R 159 0 R 185 0 R] >> endobj 883 0 obj << /Type /Pages /Count 36 /Parent 887 0 R /Kids [211 0 R 239 0 R 265 0 R 290 0 R 317 0 R 344 0 R] >> endobj 884 0 obj << /Type /Pages /Count 36 /Parent 887 0 R /Kids [374 0 R 399 0 R 425 0 R 450 0 R 480 0 R 512 0 R] >> endobj 885 0 obj << /Type /Pages /Count 36 /Parent 887 0 R /Kids [541 0 R 570 0 R 596 0 R 623 0 R 671 0 R 710 0 R] >> endobj 886 0 obj << /Type /Pages /Count 13 /Parent 887 0 R /Kids [762 0 R 798 0 R 835 0 R] >> endobj 887 0 obj << /Type /Pages /Count 157 /Kids [882 0 R 883 0 R 884 0 R 885 0 R 886 0 R] >> endobj 888 0 obj << /Names [(Doc-Start) 9 0 R (Item.1) 51 0 R (Item.10) 767 0 R (Item.2) 52 0 R (Item.3) 58 0 R (Item.4) 59 0 R] /Limits [(Doc-Start) (Item.4)] >> endobj 889 0 obj << /Names [(Item.5) 61 0 R (Item.6) 62 0 R (Item.7) 756 0 R (Item.8) 758 0 R (Item.9) 760 0 R (algocfline.1) 810 0 R] /Limits [(Item.5) (algocfline.1)] >> endobj 890 0 obj << /Names [(chapter*.1) 16 0 R (chapter.1) 21 0 R (chapter.2) 651 0 R (def.2.1.1) 653 0 R (def.2.1.2) 656 0 R (def.2.1.3) 658 0 R] /Limits [(chapter*.1) (def.2.1.3)] >> endobj 891 0 obj << /Names [(def.2.1.4) 659 0 R (def.2.1.5) 660 0 R (def.2.1.6) 661 0 R (def.2.1.7) 666 0 R (def.2.1.8) 667 0 R (def.2.2.1) 670 0 R] /Limits [(def.2.1.4) (def.2.2.1)] >> endobj 892 0 obj << /Names [(def.2.5.1) 738 0 R (def.2.5.2) 740 0 R (equation.2.5.1) 739 0 R (equation.2.5.10) 768 0 R (equation.2.5.11) 790 0 R (equation.2.5.12) 795 0 R] /Limits [(def.2.5.1) (equation.2.5.12)] >> endobj 893 0 obj << /Names [(equation.2.5.13) 822 0 R (equation.2.5.14) 827 0 R (equation.2.5.15) 828 0 R (equation.2.5.16) 834 0 R (equation.2.5.2) 745 0 R (equation.2.5.3) 748 0 R] /Limits [(equation.2.5.13) (equation.2.5.3)] >> endobj 894 0 obj << /Names [(equation.2.5.4) 749 0 R (equation.2.5.5) 754 0 R (equation.2.5.6) 755 0 R (equation.2.5.7) 757 0 R (equation.2.5.8) 759 0 R (equation.2.5.9) 761 0 R] /Limits [(equation.2.5.4) (equation.2.5.9)] >> endobj 895 0 obj << /Names [(example.2.5.3) 746 0 R (example.2.5.4) 773 0 R (example.2.5.5) 778 0 R (example.2.5.6) 783 0 R (example.2.5.7) 796 0 R (example.2.5.8) 797 0 R] /Limits [(example.2.5.3) (example.2.5.8)] >> endobj 896 0 obj << /Names [(example.2.5.9) 816 0 R (figure.2.1) 803 0 R (figure.2.2) 804 0 R (figure.2.3) 815 0 R (lstlisting.2.-1) 723 0 R (lstnumber.-1.1) 724 0 R] /Limits [(example.2.5.9) (lstnumber.-1.1)] >> endobj 897 0 obj << /Names [(page.1) 8 0 R (page.10) 83 0 R (page.100) 498 0 R (page.101) 503 0 R (page.102) 509 0 R (page.103) 516 0 R] /Limits [(page.1) (page.103)] >> endobj 898 0 obj << /Names [(page.104) 520 0 R (page.105) 525 0 R (page.106) 531 0 R (page.107) 535 0 R (page.108) 539 0 R (page.109) 545 0 R] /Limits [(page.104) (page.109)] >> endobj 899 0 obj << /Names [(page.11) 88 0 R (page.110) 550 0 R (page.111) 554 0 R (page.112) 558 0 R (page.113) 563 0 R (page.114) 567 0 R] /Limits [(page.11) (page.114)] >> endobj 900 0 obj << /Names [(page.115) 574 0 R (page.116) 578 0 R (page.117) 582 0 R (page.118) 586 0 R (page.119) 591 0 R (page.12) 94 0 R] /Limits [(page.115) (page.12)] >> endobj 901 0 obj << /Names [(page.120) 595 0 R (page.121) 600 0 R (page.122) 605 0 R (page.123) 609 0 R (page.124) 613 0 R (page.125) 618 0 R] /Limits [(page.120) (page.125)] >> endobj 902 0 obj << /Names [(page.126) 622 0 R (page.127) 627 0 R (page.128) 631 0 R (page.129) 635 0 R (page.13) 99 0 R (page.130) 641 0 R] /Limits [(page.126) (page.130)] >> endobj 903 0 obj << /Names [(page.131) 650 0 R (page.132) 665 0 R (page.133) 675 0 R (page.134) 682 0 R (page.135) 687 0 R (page.136) 692 0 R] /Limits [(page.131) (page.136)] >> endobj 904 0 obj << /Names [(page.137) 700 0 R (page.138) 707 0 R (page.139) 714 0 R (page.14) 106 0 R (page.140) 720 0 R (page.141) 728 0 R] /Limits [(page.137) (page.141)] >> endobj 905 0 obj << /Names [(page.142) 734 0 R (page.143) 744 0 R (page.144) 753 0 R (page.145) 766 0 R (page.146) 772 0 R (page.147) 777 0 R] /Limits [(page.142) (page.147)] >> endobj 906 0 obj << /Names [(page.148) 782 0 R (page.149) 787 0 R (page.15) 111 0 R (page.150) 794 0 R (page.151) 802 0 R (page.152) 808 0 R] /Limits [(page.148) (page.152)] >> endobj 907 0 obj << /Names [(page.153) 814 0 R (page.154) 820 0 R (page.155) 826 0 R (page.156) 832 0 R (page.16) 116 0 R (page.17) 121 0 R] /Limits [(page.153) (page.17)] >> endobj 908 0 obj << /Names [(page.18) 125 0 R (page.19) 130 0 R (page.2) 20 0 R (page.20) 134 0 R (page.21) 138 0 R (page.22) 143 0 R] /Limits [(page.18) (page.22)] >> endobj 909 0 obj << /Names [(page.23) 147 0 R (page.24) 156 0 R (page.25) 163 0 R (page.26) 167 0 R (page.27) 172 0 R (page.28) 176 0 R] /Limits [(page.23) (page.28)] >> endobj 910 0 obj << /Names [(page.29) 180 0 R (page.3) 33 0 R (page.30) 184 0 R (page.31) 189 0 R (page.32) 193 0 R (page.33) 198 0 R] /Limits [(page.29) (page.33)] >> endobj 911 0 obj << /Names [(page.34) 202 0 R (page.35) 206 0 R (page.36) 210 0 R (page.37) 215 0 R (page.38) 219 0 R (page.39) 223 0 R] /Limits [(page.34) (page.39)] >> endobj 912 0 obj << /Names [(page.4) 41 0 R (page.40) 229 0 R (page.41) 233 0 R (page.42) 237 0 R (page.43) 243 0 R (page.44) 247 0 R] /Limits [(page.4) (page.44)] >> endobj 913 0 obj << /Names [(page.45) 252 0 R (page.46) 256 0 R (page.47) 260 0 R (page.48) 264 0 R (page.49) 269 0 R (page.5) 48 0 R] /Limits [(page.45) (page.5)] >> endobj 914 0 obj << /Names [(page.50) 273 0 R (page.51) 277 0 R (page.52) 281 0 R (page.53) 285 0 R (page.54) 289 0 R (page.55) 294 0 R] /Limits [(page.50) (page.55)] >> endobj 915 0 obj << /Names [(page.56) 298 0 R (page.57) 302 0 R (page.58) 306 0 R (page.59) 312 0 R (page.6) 56 0 R (page.60) 316 0 R] /Limits [(page.56) (page.60)] >> endobj 916 0 obj << /Names [(page.61) 321 0 R (page.62) 325 0 R (page.63) 329 0 R (page.64) 333 0 R (page.65) 338 0 R (page.66) 342 0 R] /Limits [(page.61) (page.66)] >> endobj 917 0 obj << /Names [(page.67) 348 0 R (page.68) 352 0 R (page.69) 357 0 R (page.7) 67 0 R (page.70) 361 0 R (page.71) 366 0 R] /Limits [(page.67) (page.71)] >> endobj 918 0 obj << /Names [(page.72) 371 0 R (page.73) 378 0 R (page.74) 382 0 R (page.75) 386 0 R (page.76) 390 0 R (page.77) 394 0 R] /Limits [(page.72) (page.77)] >> endobj 919 0 obj << /Names [(page.78) 398 0 R (page.79) 403 0 R (page.8) 75 0 R (page.80) 407 0 R (page.81) 411 0 R (page.82) 415 0 R] /Limits [(page.78) (page.82)] >> endobj 920 0 obj << /Names [(page.83) 420 0 R (page.84) 424 0 R (page.85) 429 0 R (page.86) 433 0 R (page.87) 437 0 R (page.88) 441 0 R] /Limits [(page.83) (page.88)] >> endobj 921 0 obj << /Names [(page.89) 445 0 R (page.9) 79 0 R (page.90) 449 0 R (page.91) 454 0 R (page.92) 459 0 R (page.93) 464 0 R] /Limits [(page.89) (page.93)] >> endobj 922 0 obj << /Names [(page.94) 469 0 R (page.95) 474 0 R (page.96) 479 0 R (page.97) 484 0 R (page.98) 490 0 R (page.99) 494 0 R] /Limits [(page.94) (page.99)] >> endobj 923 0 obj << /Names [(section*.10) 84 0 R (section*.11) 89 0 R (section*.12) 149 0 R (section*.13) 151 0 R (section*.14) 152 0 R (section*.15) 157 0 R] /Limits [(section*.10) (section*.15)] >> endobj 924 0 obj << /Names [(section*.16) 158 0 R (section*.17) 225 0 R (section*.18) 238 0 R (section*.19) 308 0 R (section*.2) 27 0 R (section*.20) 334 0 R] /Limits [(section*.16) (section*.20)] >> endobj 925 0 obj << /Names [(section*.21) 465 0 R (section*.22) 470 0 R (section*.23) 475 0 R (section*.24) 485 0 R (section*.25) 486 0 R (section*.26) 504 0 R] /Limits [(section*.21) (section*.26)] >> endobj 926 0 obj << /Names [(section*.27) 505 0 R (section*.28) 510 0 R (section*.29) 511 0 R (section*.3) 29 0 R (section*.30) 540 0 R (section*.31) 559 0 R] /Limits [(section*.27) (section*.31)] >> endobj 927 0 obj << /Names [(section*.32) 569 0 R (section*.33) 587 0 R (section*.34) 601 0 R (section*.35) 614 0 R (section*.36) 636 0 R (section*.37) 694 0 R] /Limits [(section*.32) (section*.37)] >> endobj 928 0 obj << /Names [(section*.38) 695 0 R (section*.39) 696 0 R (section*.4) 34 0 R (section*.40) 701 0 R (section*.41) 702 0 R (section*.42) 709 0 R] /Limits [(section*.38) (section*.42)] >> endobj 929 0 obj << /Names [(section*.43) 715 0 R (section*.44) 716 0 R (section*.45) 721 0 R (section*.5) 35 0 R (section*.6) 36 0 R (section*.7) 37 0 R] /Limits [(section*.43) (section*.7)] >> endobj 930 0 obj << /Names [(section*.8) 42 0 R (section*.9) 43 0 R (section.1.1) 22 0 R (section.1.2) 44 0 R (section.1.3) 49 0 R (section.1.4) 68 0 R] /Limits [(section*.8) (section.1.4)] >> endobj 931 0 obj << /Names [(section.1.5) 526 0 R (section.1.6) 637 0 R (section.2.1) 652 0 R (section.2.2) 669 0 R (section.2.3) 676 0 R (section.2.4) 735 0 R] /Limits [(section.1.5) (section.2.4)] >> endobj 932 0 obj << /Names [(section.2.5) 736 0 R (subsection.1.1.1) 26 0 R (subsection.1.3.1) 50 0 R (subsection.1.3.2) 57 0 R (subsection.1.4.1) 69 0 R (subsection.1.4.10) 148 0 R] /Limits [(section.2.5) (subsection.1.4.10)] >> endobj 933 0 obj << /Names [(subsection.1.4.11) 168 0 R (subsection.1.4.12) 194 0 R (subsection.1.4.13) 224 0 R (subsection.1.4.14) 248 0 R (subsection.1.4.15) 307 0 R (subsection.1.4.16) 343 0 R] /Limits [(subsection.1.4.11) (subsection.1.4.16)] >> endobj 934 0 obj << /Names [(subsection.1.4.17) 353 0 R (subsection.1.4.18) 362 0 R (subsection.1.4.19) 367 0 R (subsection.1.4.2) 70 0 R (subsection.1.4.20) 372 0 R (subsection.1.4.21) 416 0 R] /Limits [(subsection.1.4.17) (subsection.1.4.21)] >> endobj 935 0 obj << /Names [(subsection.1.4.22) 455 0 R (subsection.1.4.23) 460 0 R (subsection.1.4.24) 499 0 R (subsection.1.4.25) 521 0 R (subsection.1.4.3) 90 0 R (subsection.1.4.4) 100 0 R] /Limits [(subsection.1.4.22) (subsection.1.4.4)] >> endobj 936 0 obj << /Names [(subsection.1.4.5) 102 0 R (subsection.1.4.6) 107 0 R (subsection.1.4.7) 112 0 R (subsection.1.4.8) 117 0 R (subsection.1.4.9) 139 0 R (subsection.1.5.1) 527 0 R] /Limits [(subsection.1.4.5) (subsection.1.5.1)] >> endobj 937 0 obj << /Names [(subsection.1.5.2) 546 0 R (subsection.1.5.3) 568 0 R (subsection.1.6.1) 642 0 R (subsection.1.6.2) 643 0 R (subsection.1.6.3) 644 0 R (subsection.1.6.4) 645 0 R] /Limits [(subsection.1.5.2) (subsection.1.6.4)] >> endobj 938 0 obj << /Names [(subsection.1.6.5) 646 0 R (subsection.2.3.1) 677 0 R (subsection.2.3.2) 678 0 R (subsection.2.3.3) 683 0 R (subsection.2.3.4) 688 0 R (subsection.2.3.5) 693 0 R] /Limits [(subsection.1.6.5) (subsection.2.3.5)] >> endobj 939 0 obj << /Names [(subsection.2.3.6) 703 0 R (subsection.2.3.7) 708 0 R (subsection.2.3.8) 722 0 R (subsection.2.3.9) 730 0 R (subsection.2.5.1) 737 0 R (subsection.2.5.2) 747 0 R] /Limits [(subsection.2.3.6) (subsection.2.5.2)] >> endobj 940 0 obj << /Names [(subsection.2.5.3) 788 0 R (subsection.2.5.4) 789 0 R (subsection.2.5.5) 809 0 R (subsection.2.5.6) 821 0 R (subsection.2.5.7) 833 0 R (table.2.1) 729 0 R] /Limits [(subsection.2.5.3) (table.2.1)] >> endobj 941 0 obj << /Kids [888 0 R 889 0 R 890 0 R 891 0 R 892 0 R 893 0 R] /Limits [(Doc-Start) (equation.2.5.3)] >> endobj 942 0 obj << /Kids [894 0 R 895 0 R 896 0 R 897 0 R 898 0 R 899 0 R] /Limits [(equation.2.5.4) (page.114)] >> endobj 943 0 obj << /Kids [900 0 R 901 0 R 902 0 R 903 0 R 904 0 R 905 0 R] /Limits [(page.115) (page.147)] >> endobj 944 0 obj << /Kids [906 0 R 907 0 R 908 0 R 909 0 R 910 0 R 911 0 R] /Limits [(page.148) (page.39)] >> endobj 945 0 obj << /Kids [912 0 R 913 0 R 914 0 R 915 0 R 916 0 R 917 0 R] /Limits [(page.4) (page.71)] >> endobj 946 0 obj << /Kids [918 0 R 919 0 R 920 0 R 921 0 R 922 0 R 923 0 R] /Limits [(page.72) (section*.15)] >> endobj 947 0 obj << /Kids [924 0 R 925 0 R 926 0 R 927 0 R 928 0 R 929 0 R] /Limits [(section*.16) (section*.7)] >> endobj 948 0 obj << /Kids [930 0 R 931 0 R 932 0 R 933 0 R 934 0 R 935 0 R] /Limits [(section*.8) (subsection.1.4.4)] >> endobj 949 0 obj << /Kids [936 0 R 937 0 R 938 0 R 939 0 R 940 0 R] /Limits [(subsection.1.4.5) (table.2.1)] >> endobj 950 0 obj << /Kids [941 0 R 942 0 R 943 0 R 944 0 R 945 0 R 946 0 R] /Limits [(Doc-Start) (section*.15)] >> endobj 951 0 obj << /Kids [947 0 R 948 0 R 949 0 R] /Limits [(section*.16) (table.2.1)] >> endobj 952 0 obj << /Kids [950 0 R 951 0 R] /Limits [(Doc-Start) (table.2.1)] >> endobj 953 0 obj << /Dests 952 0 R >> endobj 954 0 obj << /Type /Catalog /Pages 887 0 R /Names 953 0 R /PageMode/UseOutlines/PageLabels<>1<>]>> /OpenAction 4 0 R >> endobj 955 0 obj << /Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.10)/Keywords() /CreationDate (D:20131218043818-08'00') /ModDate (D:20131218043818-08'00') /Trapped /False /PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.10-2.2 (TeX Live 2009/Debian) kpathsea version 5.0.0) >> endobj xref 0 956 0000000000 65535 f 0000323769 00000 n 0000323789 00000 n 0000323809 00000 n 0000000015 00000 n 0000000363 00000 n 0000000583 00000 n 0000000063 00000 n 0000000468 00000 n 0000000525 00000 n 0000430873 00000 n 0000432208 00000 n 0000001058 00000 n 0000000891 00000 n 0000000704 00000 n 0000430701 00000 n 0000000999 00000 n 0000003781 00000 n 0000003315 00000 n 0000001192 00000 n 0000003423 00000 n 0000003482 00000 n 0000003542 00000 n 0000432067 00000 n 0000431221 00000 n 0000430531 00000 n 0000003602 00000 n 0000003662 00000 n 0000431643 00000 n 0000003722 00000 n 0000007684 00000 n 0000007277 00000 n 0000003963 00000 n 0000007385 00000 n 0000007444 00000 n 0000007504 00000 n 0000007564 00000 n 0000007624 00000 n 0000011822 00000 n 0000011475 00000 n 0000007854 00000 n 0000011583 00000 n 0000011642 00000 n 0000011702 00000 n 0000011762 00000 n 0000014266 00000 n 0000013861 00000 n 0000011992 00000 n 0000013969 00000 n 0000014028 00000 n 0000014087 00000 n 0000014146 00000 n 0000014206 00000 n 0000016609 00000 n 0000016142 00000 n 0000014436 00000 n 0000016250 00000 n 0000016309 00000 n 0000016369 00000 n 0000016429 00000 n 0000431360 00000 n 0000016489 00000 n 0000016549 00000 n 0000432317 00000 n 0000019143 00000 n 0000018796 00000 n 0000016779 00000 n 0000018904 00000 n 0000018963 00000 n 0000019023 00000 n 0000019083 00000 n 0000431045 00000 n 0000021218 00000 n 0000021051 00000 n 0000019301 00000 n 0000021159 00000 n 0000022401 00000 n 0000022234 00000 n 0000021364 00000 n 0000022342 00000 n 0000023874 00000 n 0000023647 00000 n 0000022535 00000 n 0000023755 00000 n 0000023814 00000 n 0000026670 00000 n 0000026384 00000 n 0000024032 00000 n 0000026492 00000 n 0000026551 00000 n 0000026610 00000 n 0000028137 00000 n 0000027970 00000 n 0000026828 00000 n 0000028078 00000 n 0000432427 00000 n 0000031211 00000 n 0000030922 00000 n 0000028271 00000 n 0000031030 00000 n 0000031089 00000 n 0000430248 00000 n 0000031150 00000 n 0000034635 00000 n 0000034401 00000 n 0000031406 00000 n 0000034512 00000 n 0000034573 00000 n 0000037601 00000 n 0000037367 00000 n 0000034806 00000 n 0000037478 00000 n 0000037539 00000 n 0000040497 00000 n 0000040263 00000 n 0000037760 00000 n 0000040374 00000 n 0000040435 00000 n 0000041935 00000 n 0000041763 00000 n 0000040668 00000 n 0000041874 00000 n 0000042959 00000 n 0000042786 00000 n 0000042082 00000 n 0000042898 00000 n 0000432541 00000 n 0000044847 00000 n 0000044674 00000 n 0000043106 00000 n 0000044786 00000 n 0000046955 00000 n 0000046782 00000 n 0000044994 00000 n 0000046894 00000 n 0000048254 00000 n 0000048019 00000 n 0000047090 00000 n 0000048131 00000 n 0000048192 00000 n 0000049382 00000 n 0000049209 00000 n 0000048401 00000 n 0000049321 00000 n 0000052246 00000 n 0000051825 00000 n 0000049517 00000 n 0000051937 00000 n 0000051998 00000 n 0000052060 00000 n 0000430389 00000 n 0000052122 00000 n 0000052184 00000 n 0000053577 00000 n 0000053280 00000 n 0000052431 00000 n 0000053392 00000 n 0000053453 00000 n 0000053515 00000 n 0000432658 00000 n 0000055522 00000 n 0000055349 00000 n 0000053724 00000 n 0000055461 00000 n 0000056884 00000 n 0000056649 00000 n 0000055669 00000 n 0000056761 00000 n 0000056822 00000 n 0000057940 00000 n 0000057767 00000 n 0000057055 00000 n 0000057879 00000 n 0000060005 00000 n 0000059832 00000 n 0000058087 00000 n 0000059944 00000 n 0000061302 00000 n 0000061129 00000 n 0000060152 00000 n 0000061241 00000 n 0000062381 00000 n 0000062208 00000 n 0000061449 00000 n 0000062320 00000 n 0000432775 00000 n 0000064269 00000 n 0000064096 00000 n 0000062516 00000 n 0000064208 00000 n 0000066277 00000 n 0000066043 00000 n 0000064440 00000 n 0000066155 00000 n 0000066216 00000 n 0000067457 00000 n 0000067284 00000 n 0000066436 00000 n 0000067396 00000 n 0000068806 00000 n 0000068633 00000 n 0000067592 00000 n 0000068745 00000 n 0000070647 00000 n 0000070474 00000 n 0000068941 00000 n 0000070586 00000 n 0000072369 00000 n 0000072196 00000 n 0000070818 00000 n 0000072308 00000 n 0000432892 00000 n 0000073634 00000 n 0000073461 00000 n 0000072516 00000 n 0000073573 00000 n 0000074872 00000 n 0000074699 00000 n 0000073781 00000 n 0000074811 00000 n 0000076360 00000 n 0000076064 00000 n 0000075019 00000 n 0000076176 00000 n 0000076237 00000 n 0000076299 00000 n 0000077432 00000 n 0000077259 00000 n 0000076519 00000 n 0000077371 00000 n 0000079071 00000 n 0000078898 00000 n 0000077579 00000 n 0000079010 00000 n 0000080067 00000 n 0000079832 00000 n 0000079218 00000 n 0000079944 00000 n 0000080005 00000 n 0000433009 00000 n 0000081288 00000 n 0000081115 00000 n 0000080226 00000 n 0000081227 00000 n 0000082309 00000 n 0000082074 00000 n 0000081447 00000 n 0000082186 00000 n 0000082247 00000 n 0000083436 00000 n 0000083263 00000 n 0000082468 00000 n 0000083375 00000 n 0000084374 00000 n 0000084201 00000 n 0000083595 00000 n 0000084313 00000 n 0000085412 00000 n 0000085239 00000 n 0000084509 00000 n 0000085351 00000 n 0000086599 00000 n 0000086426 00000 n 0000085547 00000 n 0000086538 00000 n 0000433126 00000 n 0000087939 00000 n 0000087766 00000 n 0000086758 00000 n 0000087878 00000 n 0000089413 00000 n 0000089240 00000 n 0000088098 00000 n 0000089352 00000 n 0000090596 00000 n 0000090423 00000 n 0000089584 00000 n 0000090535 00000 n 0000092283 00000 n 0000092110 00000 n 0000090743 00000 n 0000092222 00000 n 0000094139 00000 n 0000093966 00000 n 0000092442 00000 n 0000094078 00000 n 0000096197 00000 n 0000096024 00000 n 0000094310 00000 n 0000096136 00000 n 0000433243 00000 n 0000097744 00000 n 0000097571 00000 n 0000096356 00000 n 0000097683 00000 n 0000098953 00000 n 0000098780 00000 n 0000097903 00000 n 0000098892 00000 n 0000100004 00000 n 0000099831 00000 n 0000099100 00000 n 0000099943 00000 n 0000101642 00000 n 0000101345 00000 n 0000100151 00000 n 0000101457 00000 n 0000101518 00000 n 0000101580 00000 n 0000102738 00000 n 0000102565 00000 n 0000101813 00000 n 0000102677 00000 n 0000103609 00000 n 0000103436 00000 n 0000102885 00000 n 0000103548 00000 n 0000433360 00000 n 0000104866 00000 n 0000104693 00000 n 0000103768 00000 n 0000104805 00000 n 0000105849 00000 n 0000105676 00000 n 0000105025 00000 n 0000105788 00000 n 0000106679 00000 n 0000106506 00000 n 0000105984 00000 n 0000106618 00000 n 0000108524 00000 n 0000108289 00000 n 0000106826 00000 n 0000108401 00000 n 0000108462 00000 n 0000110065 00000 n 0000109892 00000 n 0000108671 00000 n 0000110004 00000 n 0000111595 00000 n 0000111361 00000 n 0000110200 00000 n 0000111473 00000 n 0000111534 00000 n 0000433477 00000 n 0000113005 00000 n 0000112832 00000 n 0000111766 00000 n 0000112944 00000 n 0000114896 00000 n 0000114661 00000 n 0000113140 00000 n 0000114773 00000 n 0000114834 00000 n 0000115852 00000 n 0000115679 00000 n 0000115055 00000 n 0000115791 00000 n 0000116986 00000 n 0000116751 00000 n 0000115987 00000 n 0000116863 00000 n 0000116924 00000 n 0000118661 00000 n 0000118426 00000 n 0000117133 00000 n 0000118538 00000 n 0000118599 00000 n 0000120291 00000 n 0000120056 00000 n 0000118808 00000 n 0000120168 00000 n 0000120229 00000 n 0000429964 00000 n 0000433594 00000 n 0000121781 00000 n 0000121608 00000 n 0000120463 00000 n 0000121720 00000 n 0000122811 00000 n 0000122638 00000 n 0000121928 00000 n 0000122750 00000 n 0000123627 00000 n 0000123454 00000 n 0000122946 00000 n 0000123566 00000 n 0000125509 00000 n 0000125336 00000 n 0000123762 00000 n 0000125448 00000 n 0000126326 00000 n 0000126153 00000 n 0000125668 00000 n 0000126265 00000 n 0000127119 00000 n 0000126946 00000 n 0000126461 00000 n 0000127058 00000 n 0000433711 00000 n 0000128941 00000 n 0000128768 00000 n 0000127254 00000 n 0000128880 00000 n 0000130594 00000 n 0000130421 00000 n 0000129112 00000 n 0000130533 00000 n 0000132449 00000 n 0000132276 00000 n 0000130729 00000 n 0000132388 00000 n 0000134368 00000 n 0000134133 00000 n 0000132596 00000 n 0000134245 00000 n 0000134306 00000 n 0000135913 00000 n 0000135740 00000 n 0000134540 00000 n 0000135852 00000 n 0000136818 00000 n 0000136645 00000 n 0000136060 00000 n 0000136757 00000 n 0000433828 00000 n 0000137789 00000 n 0000137616 00000 n 0000136953 00000 n 0000137728 00000 n 0000138788 00000 n 0000138615 00000 n 0000137924 00000 n 0000138727 00000 n 0000139931 00000 n 0000139758 00000 n 0000138935 00000 n 0000139870 00000 n 0000140790 00000 n 0000140617 00000 n 0000140066 00000 n 0000140729 00000 n 0000141873 00000 n 0000141700 00000 n 0000140925 00000 n 0000141812 00000 n 0000143265 00000 n 0000143092 00000 n 0000142008 00000 n 0000143204 00000 n 0000433945 00000 n 0000144513 00000 n 0000144278 00000 n 0000143400 00000 n 0000144390 00000 n 0000144451 00000 n 0000146842 00000 n 0000146607 00000 n 0000144660 00000 n 0000146719 00000 n 0000146780 00000 n 0000148857 00000 n 0000148622 00000 n 0000147001 00000 n 0000148734 00000 n 0000148795 00000 n 0000150293 00000 n 0000150058 00000 n 0000149016 00000 n 0000150170 00000 n 0000150231 00000 n 0000151501 00000 n 0000151266 00000 n 0000150440 00000 n 0000151378 00000 n 0000151439 00000 n 0000153848 00000 n 0000153675 00000 n 0000151648 00000 n 0000153787 00000 n 0000434062 00000 n 0000155253 00000 n 0000154956 00000 n 0000153995 00000 n 0000155068 00000 n 0000155129 00000 n 0000155191 00000 n 0000156069 00000 n 0000155896 00000 n 0000155400 00000 n 0000156008 00000 n 0000157041 00000 n 0000156868 00000 n 0000156204 00000 n 0000156980 00000 n 0000159133 00000 n 0000158898 00000 n 0000157176 00000 n 0000159010 00000 n 0000159071 00000 n 0000161171 00000 n 0000160875 00000 n 0000159280 00000 n 0000160987 00000 n 0000161048 00000 n 0000161110 00000 n 0000162319 00000 n 0000162022 00000 n 0000161342 00000 n 0000162134 00000 n 0000162195 00000 n 0000162257 00000 n 0000434179 00000 n 0000163323 00000 n 0000163150 00000 n 0000162466 00000 n 0000163262 00000 n 0000165176 00000 n 0000164941 00000 n 0000163458 00000 n 0000165053 00000 n 0000165114 00000 n 0000167233 00000 n 0000166936 00000 n 0000165323 00000 n 0000167048 00000 n 0000167109 00000 n 0000167171 00000 n 0000169895 00000 n 0000169722 00000 n 0000167392 00000 n 0000169834 00000 n 0000173695 00000 n 0000173522 00000 n 0000170066 00000 n 0000173634 00000 n 0000176404 00000 n 0000176169 00000 n 0000173867 00000 n 0000176281 00000 n 0000176342 00000 n 0000434296 00000 n 0000178578 00000 n 0000178343 00000 n 0000176551 00000 n 0000178455 00000 n 0000178516 00000 n 0000180287 00000 n 0000180114 00000 n 0000178725 00000 n 0000180226 00000 n 0000182402 00000 n 0000182229 00000 n 0000180458 00000 n 0000182341 00000 n 0000183775 00000 n 0000183540 00000 n 0000182537 00000 n 0000183652 00000 n 0000183713 00000 n 0000186794 00000 n 0000186621 00000 n 0000183946 00000 n 0000186733 00000 n 0000189554 00000 n 0000189257 00000 n 0000186953 00000 n 0000189369 00000 n 0000189430 00000 n 0000189492 00000 n 0000434413 00000 n 0000190958 00000 n 0000190785 00000 n 0000189725 00000 n 0000190897 00000 n 0000193578 00000 n 0000193405 00000 n 0000191093 00000 n 0000193517 00000 n 0000195377 00000 n 0000195204 00000 n 0000193737 00000 n 0000195316 00000 n 0000197112 00000 n 0000196877 00000 n 0000195536 00000 n 0000196989 00000 n 0000197050 00000 n 0000198406 00000 n 0000198233 00000 n 0000197271 00000 n 0000198345 00000 n 0000200833 00000 n 0000200660 00000 n 0000198541 00000 n 0000200772 00000 n 0000434530 00000 n 0000203109 00000 n 0000202874 00000 n 0000200968 00000 n 0000202986 00000 n 0000203047 00000 n 0000205502 00000 n 0000205329 00000 n 0000203268 00000 n 0000205441 00000 n 0000207994 00000 n 0000207821 00000 n 0000205661 00000 n 0000207933 00000 n 0000210823 00000 n 0000210588 00000 n 0000208153 00000 n 0000210700 00000 n 0000210761 00000 n 0000212217 00000 n 0000212044 00000 n 0000211020 00000 n 0000212156 00000 n 0000213573 00000 n 0000213400 00000 n 0000212352 00000 n 0000213512 00000 n 0000434647 00000 n 0000215574 00000 n 0000215401 00000 n 0000213720 00000 n 0000215513 00000 n 0000218400 00000 n 0000218227 00000 n 0000215745 00000 n 0000218339 00000 n 0000222348 00000 n 0000222051 00000 n 0000218559 00000 n 0000222163 00000 n 0000222224 00000 n 0000222286 00000 n 0000224674 00000 n 0000224191 00000 n 0000222507 00000 n 0000224303 00000 n 0000224364 00000 n 0000224426 00000 n 0000224488 00000 n 0000224550 00000 n 0000224612 00000 n 0000227643 00000 n 0000226976 00000 n 0000224845 00000 n 0000227088 00000 n 0000227149 00000 n 0000227211 00000 n 0000227272 00000 n 0000431502 00000 n 0000431783 00000 n 0000227334 00000 n 0000431925 00000 n 0000227396 00000 n 0000227458 00000 n 0000227520 00000 n 0000227581 00000 n 0000231526 00000 n 0000231105 00000 n 0000227881 00000 n 0000231217 00000 n 0000231278 00000 n 0000231340 00000 n 0000430105 00000 n 0000231402 00000 n 0000231464 00000 n 0000434764 00000 n 0000235520 00000 n 0000235161 00000 n 0000231803 00000 n 0000235273 00000 n 0000235334 00000 n 0000235396 00000 n 0000235458 00000 n 0000239977 00000 n 0000239742 00000 n 0000235744 00000 n 0000239854 00000 n 0000239915 00000 n 0000244095 00000 n 0000243860 00000 n 0000240175 00000 n 0000243972 00000 n 0000244033 00000 n 0000248446 00000 n 0000248026 00000 n 0000244292 00000 n 0000248138 00000 n 0000248199 00000 n 0000248261 00000 n 0000248322 00000 n 0000248384 00000 n 0000252431 00000 n 0000252072 00000 n 0000248670 00000 n 0000252184 00000 n 0000252245 00000 n 0000252307 00000 n 0000252369 00000 n 0000256342 00000 n 0000256045 00000 n 0000252641 00000 n 0000256157 00000 n 0000256218 00000 n 0000256280 00000 n 0000434881 00000 n 0000259721 00000 n 0000259424 00000 n 0000256539 00000 n 0000259536 00000 n 0000259597 00000 n 0000259659 00000 n 0000263410 00000 n 0000262989 00000 n 0000259893 00000 n 0000263101 00000 n 0000263162 00000 n 0000263224 00000 n 0000263286 00000 n 0000263348 00000 n 0000266680 00000 n 0000266383 00000 n 0000263581 00000 n 0000266495 00000 n 0000266556 00000 n 0000266618 00000 n 0000271096 00000 n 0000270552 00000 n 0000266877 00000 n 0000270664 00000 n 0000270725 00000 n 0000270786 00000 n 0000270848 00000 n 0000270910 00000 n 0000270972 00000 n 0000271034 00000 n 0000275072 00000 n 0000274589 00000 n 0000271321 00000 n 0000274701 00000 n 0000274762 00000 n 0000274824 00000 n 0000274886 00000 n 0000274948 00000 n 0000275010 00000 n 0000279493 00000 n 0000278826 00000 n 0000275311 00000 n 0000278938 00000 n 0000278999 00000 n 0000279060 00000 n 0000279122 00000 n 0000279184 00000 n 0000279246 00000 n 0000279308 00000 n 0000279369 00000 n 0000279431 00000 n 0000434998 00000 n 0000284191 00000 n 0000283894 00000 n 0000279718 00000 n 0000284006 00000 n 0000284067 00000 n 0000284129 00000 n 0000286425 00000 n 0000286191 00000 n 0000284430 00000 n 0000286303 00000 n 0000286364 00000 n 0000289236 00000 n 0000289001 00000 n 0000286635 00000 n 0000289113 00000 n 0000289174 00000 n 0000292054 00000 n 0000291819 00000 n 0000289459 00000 n 0000291931 00000 n 0000291992 00000 n 0000296259 00000 n 0000295900 00000 n 0000292279 00000 n 0000296012 00000 n 0000296073 00000 n 0000296135 00000 n 0000296197 00000 n 0000299948 00000 n 0000299589 00000 n 0000296471 00000 n 0000299701 00000 n 0000299762 00000 n 0000299824 00000 n 0000299886 00000 n 0000435115 00000 n 0000304991 00000 n 0000304694 00000 n 0000300171 00000 n 0000304806 00000 n 0000304867 00000 n 0000304929 00000 n 0000308879 00000 n 0000308582 00000 n 0000305126 00000 n 0000308694 00000 n 0000308755 00000 n 0000308817 00000 n 0000312513 00000 n 0000312217 00000 n 0000309116 00000 n 0000312329 00000 n 0000312390 00000 n 0000312451 00000 n 0000316363 00000 n 0000316067 00000 n 0000312725 00000 n 0000316179 00000 n 0000316240 00000 n 0000316302 00000 n 0000320172 00000 n 0000319875 00000 n 0000316588 00000 n 0000319987 00000 n 0000320048 00000 n 0000320110 00000 n 0000323531 00000 n 0000323234 00000 n 0000320384 00000 n 0000323346 00000 n 0000323407 00000 n 0000323469 00000 n 0000435232 00000 n 0000323862 00000 n 0000323897 00000 n 0000324008 00000 n 0000324223 00000 n 0000324685 00000 n 0000324788 00000 n 0000325015 00000 n 0000429570 00000 n 0000325118 00000 n 0000325593 00000 n 0000325924 00000 n 0000326425 00000 n 0000326773 00000 n 0000326958 00000 n 0000327345 00000 n 0000327822 00000 n 0000328385 00000 n 0000330559 00000 n 0000330784 00000 n 0000332478 00000 n 0000332704 00000 n 0000334811 00000 n 0000335032 00000 n 0000336901 00000 n 0000337152 00000 n 0000339514 00000 n 0000339756 00000 n 0000344319 00000 n 0000344596 00000 n 0000348710 00000 n 0000349335 00000 n 0000353927 00000 n 0000354464 00000 n 0000356408 00000 n 0000356639 00000 n 0000358198 00000 n 0000358431 00000 n 0000368825 00000 n 0000369396 00000 n 0000376252 00000 n 0000376593 00000 n 0000393240 00000 n 0000393671 00000 n 0000413275 00000 n 0000413810 00000 n 0000429165 00000 n 0000435309 00000 n 0000435424 00000 n 0000435542 00000 n 0000435660 00000 n 0000435778 00000 n 0000435872 00000 n 0000435967 00000 n 0000436130 00000 n 0000436302 00000 n 0000436488 00000 n 0000436674 00000 n 0000436889 00000 n 0000437120 00000 n 0000437346 00000 n 0000437564 00000 n 0000437777 00000 n 0000437947 00000 n 0000438125 00000 n 0000438300 00000 n 0000438475 00000 n 0000438653 00000 n 0000438829 00000 n 0000439007 00000 n 0000439184 00000 n 0000439362 00000 n 0000439539 00000 n 0000439714 00000 n 0000439882 00000 n 0000440052 00000 n 0000440220 00000 n 0000440390 00000 n 0000440557 00000 n 0000440724 00000 n 0000440894 00000 n 0000441062 00000 n 0000441232 00000 n 0000441400 00000 n 0000441570 00000 n 0000441738 00000 n 0000441908 00000 n 0000442076 00000 n 0000442246 00000 n 0000442446 00000 n 0000442646 00000 n 0000442848 00000 n 0000443048 00000 n 0000443250 00000 n 0000443450 00000 n 0000443645 00000 n 0000443838 00000 n 0000444040 00000 n 0000444270 00000 n 0000444520 00000 n 0000444768 00000 n 0000445014 00000 n 0000445256 00000 n 0000445498 00000 n 0000445740 00000 n 0000445982 00000 n 0000446210 00000 n 0000446328 00000 n 0000446445 00000 n 0000446556 00000 n 0000446666 00000 n 0000446774 00000 n 0000446887 00000 n 0000447003 00000 n 0000447124 00000 n 0000447236 00000 n 0000447351 00000 n 0000447442 00000 n 0000447523 00000 n 0000447561 00000 n 0000447709 00000 n trailer << /Size 956 /Root 954 0 R /Info 955 0 R /ID [<16D0DD13C6BCEB365B4C8C5C6D50B8DC> <16D0DD13C6BCEB365B4C8C5C6D50B8DC>] >> startxref 448035 %%EOF cloog-0.18.2/isl/doc/Makefile.am0000664000175000017500000000104412254313240013213 00000000000000if GENERATE_DOC export TEXINPUTS := $(srcdir):$(TEXINPUTS) export BIBINPUTS := $(srcdir):$(BIBINPUTS) export BSTINPUTS := $(srcdir):$(BSTINPUTS) user.tex: user.pod $(PERL) $(srcdir)/mypod2latex $< $@ manual.pdf: manual.tex user.tex $(srcdir)/implementation.tex (cd ..; echo "@GIT_HEAD_VERSION@") > version.tex $(PDFLATEX) $< bibtex manual $(PDFLATEX) $< $(PDFLATEX) $< user.html: user.pod (cd ..; echo "@GIT_HEAD_VERSION@") > version $(POD2HTML) --infile=$< --outfile=$@ --title="Integer Set Library: Manual [version `cat version`]" endif cloog-0.18.2/isl/doc/manual.tex0000664000175000017500000000365212254313240013165 00000000000000\documentclass{report} \usepackage[plainpages=false,pdfpagelabels,breaklinks,pagebackref]{hyperref} \usepackage{amsmath} \usepackage{amssymb} \usepackage{txfonts} \usepackage{chicago} \usepackage{aliascnt} \usepackage{tikz} \usepackage{calc} \usepackage[ruled]{algorithm2e} \usetikzlibrary{matrix,fit,backgrounds,decorations.pathmorphing,positioning} \usepackage{listings} \lstset{basicstyle=\tt,flexiblecolumns=false} \def\vec#1{\mathchoice{\mbox{\boldmath$\displaystyle\bf#1$}} {\mbox{\boldmath$\textstyle\bf#1$}} {\mbox{\boldmath$\scriptstyle\bf#1$}} {\mbox{\boldmath$\scriptscriptstyle\bf#1$}}} \providecommand{\fract}[1]{\left\{#1\right\}} \providecommand{\floor}[1]{\left\lfloor#1\right\rfloor} \providecommand{\ceil}[1]{\left\lceil#1\right\rceil} \def\sp#1#2{\langle #1, #2 \rangle} \def\spv#1#2{\langle\vec #1,\vec #2\rangle} \newtheorem{theorem}{Theorem} \newaliascnt{example}{theorem} \newtheorem{example}[example]{Example} \newaliascnt{def}{theorem} \newtheorem{definition}[def]{Definition} \aliascntresetthe{example} \aliascntresetthe{def} \numberwithin{theorem}{section} \numberwithin{def}{section} \numberwithin{example}{section} \newcommand{\algocflineautorefname}{Algorithm} \newcommand{\exampleautorefname}{Example} \newcommand{\lstnumberautorefname}{Line} \renewcommand{\sectionautorefname}{Section} \renewcommand{\subsectionautorefname}{Section} \def\Z{\mathbb{Z}} \def\Q{\mathbb{Q}} \def\pdom{\mathop{\rm pdom}\nolimits} \def\domain{\mathop{\rm dom}\nolimits} \def\range{\mathop{\rm ran}\nolimits} \def\identity{\mathop{\rm Id}\nolimits} \def\diff{\mathop{\Delta}\nolimits} \providecommand{\floor}[1]{\left\lfloor#1\right\rfloor} \begin{document} \title{Integer Set Library: Manual\\ \small Version: \input{version} } \author{Sven Verdoolaege} \maketitle \tableofcontents \chapter{User Manual} \input{user} \chapter{Implementation Details} \input{implementation} \bibliography{isl} \bibliographystyle{chicago} \end{document} cloog-0.18.2/isl/doc/isl.bib0000664000175000017500000002417312254313240012434 00000000000000@inproceedings{Kelly1996closure, author = {Wayne Kelly and William Pugh and Evan Rosser and Tatiana Shpeisman}, title = {Transitive Closure of Infinite Graphs and Its Applications}, pages = {126-140}, editor = {Chua-Huang Huang and P. Sadayappan and Utpal Banerjee and David Gelernter and Alexandru Nicolau and David A. Padua}, booktitle = {Languages and Compilers for Parallel Computing, 8th International Workshop, LCPC'95, Columbus, Ohio, USA, August 10-12, 1995, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {1033}, year = {1996}, isbn = {3-540-60765-X}, } @inproceedings{Beletska2009, author = {Beletska, Anna and Barthou, Denis and Bielecki, Wlodzimierz and Cohen, Albert}, title = {Computing the Transitive Closure of a Union of Affine Integer Tuple Relations}, booktitle = {COCOA '09: Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications}, year = {2009}, isbn = {978-3-642-02025-4}, pages = {98--109}, location = {Huangshan, China}, doi = {10.1007/978-3-642-02026-1_9}, publisher = {Springer-Verlag}, address = {Berlin, Heidelberg}, } @book{Schrijver1986, author = "Schrijver, Alexander", title = "Theory of Linear and Integer Programming", publisher = "John Wiley \& Sons", year = 1986 } @article{Tarjan1972, author = {Tarjan, Robert}, journal = {SIAM Journal on Computing}, number = {2}, pages = {146--160}, publisher = {SIAM}, title = {Depth-First Search and Linear Graph Algorithms}, volume = {1}, year = {1972} } @TechReport{ Omega_calc, author = "Wayne Kelly and Vadim Maslov and William Pugh and Evan Rosser and Tatiana Shpeisman and Dave Wonnacott", title = "The {Omega} Calculator and Library", month = nov, institution = "University of Maryland", year = 1996 } @TechReport{ Omega_lib, author = "Wayne Kelly and Vadim Maslov and William Pugh and Evan Rosser and Tatiana Shpeisman and Dave Wonnacott", title = "The {Omega} Library", month = nov, institution = "University of Maryland", year = 1996 } @unpublished{Verdoolaege2009isl, author = "Verdoolaege, Sven", title = "An integer set library for program analysis", note = "Advances in the Theory of Integer Linear Optimization and its Extensions,AMS 2009 Spring Western Section Meeting, San Francisco, California, 25-26 April 2009", month = Apr, year = "2009", url = "https://lirias.kuleuven.be/handle/123456789/228373", } @article{Barthou2000MSE, author = {Barthou, Denis and Cohen, Albert and Collard, Jean-Fran\c{c}ois}, title = {Maximal Static Expansion}, journal = {Int. J. Parallel Program.}, volume = {28}, number = {3}, year = {2000}, issn = {0885-7458}, pages = {213--243}, doi = {10.1023/A:1007500431910}, publisher = {Kluwer Academic Publishers}, address = {Norwell, MA, USA}, } @article{ Feautrier88parametric, author = "P. Feautrier", title = "Parametric Integer Programming", journal = "RAIRO Recherche Op\'erationnelle", volume = "22", number = "3", pages = "243--268", year = "1988", } @Article{ Fea91, author = {Feautrier, P.}, title = {Dataflow analysis of array and scalar references}, journal = {International Journal of Parallel Programming}, year = {1991}, OPTkey = {}, volume = {20}, number = {1}, OPTmonth = {}, pages = {23--53}, OPTnote = {}, OPTannote = {}, } @INPROCEEDINGS{BouletRe98, AUTHOR = {Pierre Boulet and Xavier Redon}, TITLE = {Communication Pre-evaluation in {HPF}}, BOOKTITLE = {EUROPAR'98}, PAGES = {263--272}, YEAR = 1998, VOLUME = 1470, series = {Lecture Notes in Computer Science}, PUBLISHER = {Springer-Verlag, Berlin}, ABSTRACT = { Parallel computers are difficult to program efficiently. We believe that a good way to help programmers write efficient programs is to provide them with tools that show them how their programs behave on a parallel computer. Data distribution is the major performance factor of data-parallel programs and so automatic data layout for HPF programs has been studied by many researchers recently. The communication volume induced by a data distribution is a good estimator of the efficiency of this data distribution. We present here a symbolic method to compute the communication volume generated by a given data distribution during the program writing phase (before compilation). We stay machine-independent to assure portability. Our goal is to help the programmer understand the data movements its program generates and thus find a good data distribution. Our method is based on parametric polyhedral computations. It can be applied to a large class of regular codes.}, } @INPROCEEDINGS {Verdoolaege2005experiences, AUTHOR = "Verdoolaege, Sven and Beyls, Kristof and Bruynooghe, Maurice and Catthoor, Francky", TITLE = {{E}xperiences with enumeration of integer projections of parametric polytopes}, BOOKTITLE = {{P}roceedings of 14th {I}nternational {C}onference on {C}ompiler {C}onstruction, {E}dinburgh, {S}cotland}, YEAR = {2005}, EDITOR = {Bodik, R.}, VOLUME = 3443, pages = "91-105", series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag", address = "Berlin", doi = "10.1007/b107108", } @article{Detlefs2005simplify, author = {David Detlefs and Greg Nelson and James B. Saxe}, title = {Simplify: a theorem prover for program checking}, journal = {J. ACM}, volume = {52}, number = {3}, year = {2005}, issn = {0004-5411}, pages = {365--473}, doi = {10.1145/1066100.1066102}, publisher = {ACM}, address = {New York, NY, USA}, } @phdthesis{Nelson1980phd, author = {Charles Gregory Nelson}, title = {Techniques for program verification}, year = {1980}, order_no = {AAI8011683}, school = {Stanford University}, address = {Stanford, CA, USA}, } @article{Woods2003short, year = 2003, Journal = "J. Amer. Math. Soc.", volume = 16, pages = "957--979", month = apr, title = {{Short rational generating functions for lattice point problems}}, author = {Alexander Barvinok and Kevin Woods}, } @misc{barvinok-0.22, author = {Sven Verdoolaege}, title = {{\texttt{barvinok}}, version 0.22}, howpublished = {Available from \url{http://freshmeat.net/projects/barvinok/}}, year = 2006 } @inproceedings{DeLoera2004Three, title = "Three Kinds of Integer Programming Algorithms based on Barvinok's Rational Functions", author = "De Loera, J. A. and D. Haws and R. Hemmecke and P. Huggins and R. Yoshida", booktitle = "Integer Programming and Combinatorial Optimization: 10th International IPCO Conference", year = "2004", month = jan, series = "Lecture Notes in Computer Science", Volume = 3064, Pages = "244-255", } @TechReport{Feautrier02, author = {P. Feautrier and J. Collard and C. Bastoul}, title = {Solving systems of affine (in)equalities}, institution = {PRiSM, Versailles University}, year = 2002 } @article{ Feautrier92multi, author = "Paul Feautrier", title = "Some Efficient Solutions to the Affine Scheduling Problem. {P}art {II}. Multidimensional Time", journal = "International Journal of Parallel Programming", volume = "21", number = "6", pages = "389--420", year = "1992", month = dec, url = "citeseer.nj.nec.com/article/feautrier92some.html", } @misc{Bygde2010licentiate, author = {Stefan Bygde}, title = {Static {WCET} Analysis based on Abstract Interpretation and Counting of Elements}, month = {March}, year = {2010}, howpublished = {Licentiate thesis}, publisher = {M{\"{a}}lardalen University Press}, url = {http://www.mrtc.mdh.se/index.php?choice=publications&id=2144}, } @phdthesis{Meister2004PhD, title = {Stating and Manipulating Periodicity in the Polytope Model. Applications to Program Analysis and Optimization}, author= {Beno\^it Meister}, school = {Universit\'e Louis Pasteur}, month = Dec, year = {2004}, } @inproceedings{Meister2008, author = {Beno\^it Meister and Sven Verdoolaege}, title = {Polynomial Approximations in the Polytope Model: Bringing the Power of Quasi-Polynomials to the Masses}, year = {2008}, booktitle = {Digest of the 6th Workshop on Optimization for DSP and Embedded Systems, ODES-6}, editor = "Jagadeesh Sankaran and Vander Aa, Tom", month = apr, } @misc{Galea2009personal, author = "Fran\c{c}ois Galea", title = "personal communication", year = 2009, month = nov, } @misc{PPL, author = "R. Bagnara and P. M. Hill and E. Zaffanella", title = "The {Parma Polyhedra Library}", howpublished = {\url{http://www.cs.unipr.it/ppl/}}, } @TECHREPORT{Cook1991implementation, AUTHOR={William Cook and Thomas Rutherford and Herbert E. Scarf and David F. Shallcross}, TITLE={An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming}, YEAR=1991, MONTH=Aug, INSTITUTION={Cowles Foundation, Yale University}, TYPE={Cowles Foundation Discussion Papers}, NOTE={available at \url{http://ideas.repec.org/p/cwl/cwldpp/990.html}}, NUMBER={990}, } @article{Karr1976affine, author={ Michael Karr}, title={ Affine Relationships Among Variables of a Program }, journal={Acta Informatica}, Volume={6}, pages={133-151}, year={1976}, publisher={Springer-Verlag}, ignore={ }, } @PhdThesis{Verhaegh1995PhD, title = "Multidimensional Periodic Scheduling", author = "Wim F. J. Verhaegh", school = "Technische Universiteit Eindhoven", year = 1995, } @INPROCEEDINGS{Seghir2006minimizing, AUTHOR = "Rachid Seghir and Vincent Loechner", TITLE = {Memory Optimization by Counting Points in Integer Transformations of Parametric Polytopes}, BOOKTITLE = {{P}roceedings of the {I}nternational {C}onference on {C}ompilers, {A}rchitectures, and {S}ynthesis for {E}mbedded Systems, CASES 2006, {S}eoul, {K}orea}, month = oct, YEAR = {2006} } @misc{DeSmet2010personal, author = "De Smet, Sven", title = "personal communication", year = 2010, month = apr, } cloog-0.18.2/isl/doc/Makefile.in0000664000175000017500000002732612254313260013241 00000000000000# Makefile.in generated by automake 1.11.3 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = doc DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_c___attribute__.m4 \ $(top_srcdir)/m4/ax_cc_maxopt.m4 \ $(top_srcdir)/m4/ax_check_compiler_flags.m4 \ $(top_srcdir)/m4/ax_compiler_vendor.m4 \ $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/ax_create_stdint_h.m4 \ $(top_srcdir)/m4/ax_detect_git_head.m4 \ $(top_srcdir)/m4/ax_gcc_archflag.m4 \ $(top_srcdir)/m4/ax_gcc_warn_unused_result.m4 \ $(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \ $(top_srcdir)/m4/ax_set_warning_flags.m4 \ $(top_srcdir)/m4/ax_submodule.m4 $(top_srcdir)/m4/libtool.m4 \ $(top_srcdir)/m4/ltoptions.m4 $(top_srcdir)/m4/ltsugar.m4 \ $(top_srcdir)/m4/ltversion.m4 $(top_srcdir)/m4/lt~obsolete.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/isl_config.h \ $(top_builddir)/include/isl/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ SOURCES = DIST_SOURCES = DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CLANG_CXXFLAGS = @CLANG_CXXFLAGS@ CLANG_LDFLAGS = @CLANG_LDFLAGS@ CLANG_LIBS = @CLANG_LIBS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GIT_HEAD = @GIT_HEAD@ GIT_HEAD_ID = @GIT_HEAD_ID@ GIT_HEAD_VERSION = @GIT_HEAD_VERSION@ GMP_CPPFLAGS = @GMP_CPPFLAGS@ GMP_LDFLAGS = @GMP_LDFLAGS@ GMP_LIBS = @GMP_LIBS@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIB_CLANG_EDIT = @LIB_CLANG_EDIT@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PDFLATEX = @PDFLATEX@ PERL = @PERL@ PIPLIB_CPPFLAGS = @PIPLIB_CPPFLAGS@ PIPLIB_LDFLAGS = @PIPLIB_LDFLAGS@ PIPLIB_LIBS = @PIPLIB_LIBS@ POD2HTML = @POD2HTML@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ WARNING_FLAGS = @WARNING_FLAGS@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ llvm_config_found = @llvm_config_found@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ all: all-am .SUFFIXES: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign doc/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign doc/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs tags: TAGS TAGS: ctags: CTAGS CTAGS: distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile installdirs: install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-generic dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: .MAKE: install-am install-strip .PHONY: all all-am check check-am clean clean-generic clean-libtool \ distclean distclean-generic distclean-libtool distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-generic \ mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am @GENERATE_DOC_TRUE@export TEXINPUTS := $(srcdir):$(TEXINPUTS) @GENERATE_DOC_TRUE@export BIBINPUTS := $(srcdir):$(BIBINPUTS) @GENERATE_DOC_TRUE@export BSTINPUTS := $(srcdir):$(BSTINPUTS) @GENERATE_DOC_TRUE@user.tex: user.pod @GENERATE_DOC_TRUE@ $(PERL) $(srcdir)/mypod2latex $< $@ @GENERATE_DOC_TRUE@manual.pdf: manual.tex user.tex $(srcdir)/implementation.tex @GENERATE_DOC_TRUE@ (cd ..; echo "@GIT_HEAD_VERSION@") > version.tex @GENERATE_DOC_TRUE@ $(PDFLATEX) $< @GENERATE_DOC_TRUE@ bibtex manual @GENERATE_DOC_TRUE@ $(PDFLATEX) $< @GENERATE_DOC_TRUE@ $(PDFLATEX) $< @GENERATE_DOC_TRUE@user.html: user.pod @GENERATE_DOC_TRUE@ (cd ..; echo "@GIT_HEAD_VERSION@") > version @GENERATE_DOC_TRUE@ $(POD2HTML) --infile=$< --outfile=$@ --title="Integer Set Library: Manual [version `cat version`]" # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: cloog-0.18.2/isl/doc/chicago.sty0000664000175000017500000002714012254313240013322 00000000000000% -*- LaTeX -*- %%% ==================================================================== %%% @LaTeX-style-file{ %%% author = "Glenn Paulley", %%% version = "4", %%% date = "31 August 1992", %%% time = "09:42:44 199", %%% filename = "chicago.sty", %%% address = "Data Structuring Group %%% Department of Computer Science %%% University of Waterloo %%% Waterloo, Ontario, Canada %%% N2L 3G1", %%% telephone = "(519) 885-1211", %%% FAX = "(519) 885-1208", %%% checksum = "44674 264 1050 10394", %%% email = "gnpaulle@bluebox.uwaterloo.ca", %%% codetable = "ISO/ASCII", %%% keywords = "", %%% supported = "yes", %%% abstract = "Contains the LaTeX style command definitions %%% for the Chicago BibTeX styles chicago.bst and %%% chicagoa.bst. For details, see below.", %%% docstring = "The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== % % chicago.sty: Style file for use with bibtex style chicago.bst, for % bibliographies formatted according to the 13th Edition of the Chicago % Manual of Style. % % 'newapa.bst' was made from 'plain.bst', 'named.bst', and 'apalike.bst', % with lots of tweaking to make it look like APA style, along with tips % from Young Ryu and Brian Reiser's modifications of 'apalike.bst'. % newapa.sty formed the basis of this style, chicago.sty. Author-date % references in newapa.bst formed the basis for chicago.bst. Chicagoa.bst % supports annotations. % % Version 4 (August, 1992): % - fixed chicago.bst and chicagoa.bst to handle long author lists in % sorting % - fixed chicago.bst and chicagoa.bst so that missing page numbers in % ``article'' entries are handled correctly % - modified chicago.sty to format entries with 2nd and subsequent lines % indented. % % Citation format: (author-last-name year) % (author-last-name and author-last-name year) % (author-last-name et al. year) % (author-last-name) % author-last-name % author-last-name (year) % (author-last-name and author-last-name) % (author-last-name et al.) % (year) or (year,year) % year or year,year % % Reference list ordering: alphabetical by author or whatever passes % for author in the absence of one. % % This BibTeX style has support for abbreviated author lists and for % year-only citations. This is done by having the citations % actually look like % % \citeauthoryear{full-author-info}{abbrev-author-info}{year} % % The LaTeX style has to have the following (or similar) % % \let\@internalcite\cite % \def\fullcite{\def\citeauthoryear##1##2##3{##1, ##3}\@internalcite} % \def\fullciteA{\def\citeauthoryear##1##2##3{##1}\@internalcite} % \def\shortcite{\def\citeauthoryear##1##2##3{##2, ##3}\@internalcite} % \def\shortciteA{\def\citeauthoryear##1##2##3{##2}\@internalcite} % \def\citeyear{\def\citeauthoryear##1##2##3{##3}\@internalcite} % % ------------------------------------------------------------------------- % This file implements citations for the ``chicago'' bibliography style. % Place it in a file called chicago.sty in the TeX search path. %(Placing it in the same directory as the LaTeX document should also work.) % % This file is a modification of the ``newapa'' LaTeX style, % originally adapted by Steven Spencer from the ``apalike'' LaTeX style. % It was originally modified by Stephen N. Spencer, with further % modifications by Young U. Ryu. % % The ``chicago'' BibTeX bibliography style creates citations with labels: % \citeauthoryear{author-info}{abbrev. author-info}{year} % % These labels are processed by the following LaTeX commands: % % \cite{key} % which produces citations with full author list and year. % eg. (Brown 1978; Jarke, Turner, Stohl, et al. 1985) % \citeNP{key} % which produces citations with full author list and year, but without % enclosing parentheses: % eg. Brown 1978; Jarke, Turner and Stohl 1985 % \citeA{key} % which produces citations with only the full author list. % eg. (Brown; Jarke, Turner and Stohl) % \citeANP{key} % which produces citations with only the full author list, without % parentheses eg. Brown; Jarke, Turner and Stohl % \citeN{key} % which produces citations with the full author list and year, but % can be used as nouns in a sentence; no parentheses appear around % the author names, but only around the year. % eg. Shneiderman (1978) states that...... % \citeN should only be used for a single citation. % \shortcite{key} % which produces citations with abbreviated author list and year. % \shortciteNP{key} % which produces citations with abbreviated author list and year. % \shortciteA{key} % which produces only the abbreviated author list. % \shortciteANP{key} % which produces only the abbreviated author list. % \shortciteN{key} % which produces the abbreviated author list and year, with only the % year in parentheses. Use with only one citation. % \citeyear{key} % which produces the year information only, within parentheses. % \citeyearNP{key} % which produces the year information only. % % Abbreviated author lists use the ``et al.'' construct. % % `NP' means `no parentheses'. % % This LaTeX style file must be used with the ``chicago'' or ``chicagoa'' % (annotated chicago style) BibTeX styles. % \typeout{Using Chicago Manual of Style bibliography: 31 August 1992} % % ------------------------------------------------------------------------- % % Citation macros. % \def\chicagoand/{ and } \def\chicagoetal/{ et~al.} % \let\@internalcite\cite % \def\cite{\def\@citeseppen{-1000}% \def\@cite##1##2{(##1\if@tempswa , ##2\fi)}% \def\citeauthortitleyear##1##2##3##4{##1\ ##4}\@internalcite} \def\citeNP{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2\fi}% \def\citeauthortitleyear##1##2##3##4{##1\ ##4}\@internalcite} \def\citetitleN{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2)\else{)}\fi}% \def\citeauthortitleyear##1##2##3##4{##3\ (##1; ##4}\@citedata} \def\citeN{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2)\else{)}\fi}% \def\citeauthortitleyear##1##2##3##4{##1\ (##4}\@citedata} \def\citeA{\def\@citeseppen{-1000}% \def\@cite##1##2{(##1\if@tempswa , ##2\fi)}% \def\citeauthortitleyear##1##2##3##4{##1}\@internalcite} \def\citeANP{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2\fi}% \def\citeauthortitleyear##1##2##3##4{##1}\@internalcite} % \def\shortcite{\def\@citeseppen{-1000}% \def\@cite##1##2{(##1\if@tempswa , ##2\fi)}% \def\citeauthortitleyear##1##2##3##4{##2\ ##4}\@internalcite} \def\shortciteNP{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2\fi}% \def\citeauthortitleyear##1##2##3##4{##2\ ##4}\@internalcite} \def\shortciteN{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2)\else{)}\fi}% \def\citeauthortitleyear##1##2##3##4{##2\ (##4}\@citedata} \def\shortciteA{\def\@citeseppen{-1000}% \def\@cite##1##2{(##1\if@tempswa , ##2\fi)}% \def\citeauthortitleyear##1##2##3##4{##2}\@internalcite} \def\shortciteANP{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2\fi}% \def\citeauthortitleyear##1##2##3##4{##2}\@internalcite} % \def\citeyear{\def\@citeseppen{-1000}% \def\@cite##1##2{(##1\if@tempswa , ##2\fi)}% \def\citeauthortitleyear##1##2##3##4{##4}\@citedata} \def\citeyearNP{\def\@citeseppen{-1000}% \def\@cite##1##2{##1\if@tempswa , ##2\fi}% \def\citeauthortitleyear##1##2##3##4{##4}\@citedata} % % \@citedata and \@citedatax: % % Place commas in-between citations in the same \citeyear, \citeyearNP, % \citeN, or \shortciteN command. % Use something like \citeN{ref1,ref2,ref3} and \citeN{ref4} for a list. % \def\@citedata{% \@ifnextchar [{\@tempswatrue\@citedatax}% {\@tempswafalse\@citedatax[]}% } \def\@citedatax[#1]#2{% \if@filesw\immediate\write\@auxout{\string\citation{#2}}\fi% \def\@citea{}\@cite{\@for\@citeb:=#2\do% {\@citea\def\@citea{), }\@ifundefined% by Young {b@\@citeb}{{\bf ?}% \@warning{Citation `\@citeb' on page \thepage \space undefined}}% {\csname b@\@citeb\endcsname}}}{#1}}% \@ifpackageloaded{hyperref}{% \let\BRorg@citedatax\@citedatax \def\@citedatax[#1]#2{% \BRorg@citedatax[#1]{#2}% \Hy@backout{#2}% }% }{} \@ifpackageloaded{hyperref}{% \def\hyperemph#1{{\em\hyperpage{#1}}}% \def\bold#1{{\bf\hyperpage{#1}}}% }{% \def\hyperemph#1{{\em #1}}% \def\bold#1{{\bf #1}}% } \def\BR@@lbibitem[#1]#2#3\par{% \BRorg@bibitem[#1]{#2}#3\hfill\penalty100\hbox{} \newblock \backref\hfill[{\csname br@#2\endcsname}% ]\parskip=-10pt\penalty-10000\hbox{}\nobreak\par }% \def\BR@@bibitem#1#2\par{% \BRorg@bibitem{#1}#2 \newblock \backref\penalty-100\hbox{}\nobreak\hfill[\hbox{\csname br@#2\endcsname}% ]\par } \def\thepageorcolor{\thepage} \def\Hy@backout#1{% \@bsphack \ifx\@empty\@currentlabel \protected@write\@auxout{}{% \string\@writefile{brf}{% \string\backcite{#1}{{\thepageorcolor}{(document)}{Doc-Start}}% }% }% \else \protected@write\@auxout{}{% \string\@writefile{brf}{% \string\backcite{#1}{{\thepageorcolor}{\@currentlabel}{\@currentHref}}% }% }% \fi \@esphack } % don't box citations, separate with ; and a space % also, make the penalty between citations negative: a good place to break. % \def\@citex[#1]#2{% \if@filesw\immediate\write\@auxout{\string\citation{#2}}\fi% \def\@citea{}\@cite{\@for\@citeb:=#2\do% {\@citea\def\@citea{; }\@ifundefined% by Young {b@\@citeb}{{\bf ?}% \@warning{Citation `\@citeb' on page \thepage \space undefined}}% {\csname b@\@citeb\endcsname}}}{#1}}% % (from apalike.sty) % No labels in the bibliography. % \def\@biblabel#1{} % (from apalike.sty) % Set length of hanging indentation for bibliography entries. % \newlength{\bibhang} \setlength{\bibhang}{2em} % Indent second and subsequent lines of bibliographic entries. Stolen % from openbib.sty: \newblock is set to {}. \newdimen\bibindent \bibindent=1.5em \@ifundefined{refname}% {\@ifundefined{chapter}% {\newcommand{\refname}{References}}% {\newcommand{\refname}{Bibliography}}% }% {}% \@ifundefined{chapter}% {\def\thebibliography#1{\section*{\refname\@mkboth {\uppercase{\refname}}{\uppercase{\refname}}} \addcontentsline{toc}{section}{References} \list {[\arabic{enumi}]}{\settowidth\labelwidth{[#1]} \leftmargin\labelwidth \advance\leftmargin\labelsep \advance\leftmargin\bibindent \itemindent -\bibindent \listparindent \itemindent \parsep \z@ \usecounter{enumi}} \def\newblock{} \sloppy \sfcode`\.=1000\relax}} {\def\thebibliography#1{\chapter*{\refname\@mkboth {\refname}{\refname}} \addcontentsline{toc}{chapter}{References} \list {[\arabic{enumi}]}{\settowidth\labelwidth{[#1]} \leftmargin\labelwidth \advance\leftmargin\labelsep \advance\leftmargin\bibindent \itemindent -\bibindent \listparindent \itemindent \parsep \z@ \usecounter{enumi}} \def\newblock{} \sloppy \sfcode`\.=1000\relax}} cloog-0.18.2/isl/doc/implementation.tex0000664000175000017500000023521612254313240014740 00000000000000\section{Sets and Relations} \begin{definition}[Polyhedral Set] A {\em polyhedral set}\index{polyhedral set} $S$ is a finite union of basic sets $S = \bigcup_i S_i$, each of which can be represented using affine constraints $$ S_i : \Z^n \to 2^{\Z^d} : \vec s \mapsto S_i(\vec s) = \{\, \vec x \in \Z^d \mid \exists \vec z \in \Z^e : A \vec x + B \vec s + D \vec z + \vec c \geq \vec 0 \,\} , $$ with $A \in \Z^{m \times d}$, $B \in \Z^{m \times n}$, $D \in \Z^{m \times e}$ and $\vec c \in \Z^m$. \end{definition} \begin{definition}[Parameter Domain of a Set] Let $S \in \Z^n \to 2^{\Z^d}$ be a set. The {\em parameter domain} of $S$ is the set $$\pdom S \coloneqq \{\, \vec s \in \Z^n \mid S(\vec s) \ne \emptyset \,\}.$$ \end{definition} \begin{definition}[Polyhedral Relation] A {\em polyhedral relation}\index{polyhedral relation} $R$ is a finite union of basic relations $R = \bigcup_i R_i$ of type $\Z^n \to 2^{\Z^{d_1+d_2}}$, each of which can be represented using affine constraints $$ R_i = \vec s \mapsto R_i(\vec s) = \{\, \vec x_1 \to \vec x_2 \in \Z^{d_1} \times \Z^{d_2} \mid \exists \vec z \in \Z^e : A_1 \vec x_1 + A_2 \vec x_2 + B \vec s + D \vec z + \vec c \geq \vec 0 \,\} , $$ with $A_i \in \Z^{m \times d_i}$, $B \in \Z^{m \times n}$, $D \in \Z^{m \times e}$ and $\vec c \in \Z^m$. \end{definition} \begin{definition}[Parameter Domain of a Relation] Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation. The {\em parameter domain} of $R$ is the set $$\pdom R \coloneqq \{\, \vec s \in \Z^n \mid R(\vec s) \ne \emptyset \,\}.$$ \end{definition} \begin{definition}[Domain of a Relation] Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation. The {\em domain} of $R$ is the polyhedral set $$\domain R \coloneqq \vec s \mapsto \{\, \vec x_1 \in \Z^{d_1} \mid \exists \vec x_2 \in \Z^{d_2} : (\vec x_1, \vec x_2) \in R(\vec s) \,\} . $$ \end{definition} \begin{definition}[Range of a Relation] Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation. The {\em range} of $R$ is the polyhedral set $$ \range R \coloneqq \vec s \mapsto \{\, \vec x_2 \in \Z^{d_2} \mid \exists \vec x_1 \in \Z^{d_1} : (\vec x_1, \vec x_2) \in R(\vec s) \,\} . $$ \end{definition} \begin{definition}[Composition of Relations] Let $R \in \Z^n \to 2^{\Z^{d_1+d_2}}$ and $S \in \Z^n \to 2^{\Z^{d_2+d_3}}$ be two relations, then the composition of $R$ and $S$ is defined as $$ S \circ R \coloneqq \vec s \mapsto \{\, \vec x_1 \to \vec x_3 \in \Z^{d_1} \times \Z^{d_3} \mid \exists \vec x_2 \in \Z^{d_2} : \vec x_1 \to \vec x_2 \in R(\vec s) \wedge \vec x_2 \to \vec x_3 \in S(\vec s) \,\} . $$ \end{definition} \begin{definition}[Difference Set of a Relation] Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation. The difference set ($\Delta \, R$) of $R$ is the set of differences between image elements and the corresponding domain elements, $$ \diff R \coloneqq \vec s \mapsto \{\, \vec \delta \in \Z^{d} \mid \exists \vec x \to \vec y \in R : \vec \delta = \vec y - \vec x \,\} $$ \end{definition} \section{Simple Hull}\label{s:simple hull} It is sometimes useful to have a single basic set or basic relation that contains a given set or relation. For rational sets, the obvious choice would be to compute the (rational) convex hull. For integer sets, the obvious choice would be the integer hull. However, {\tt isl} currently does not support an integer hull operation and even if it did, it would be fairly expensive to compute. The convex hull operation is supported, but it is also fairly expensive to compute given only an implicit representation. Usually, it is not required to compute the exact integer hull, and an overapproximation of this hull is sufficient. The ``simple hull'' of a set is such an overapproximation and it is defined as the (inclusion-wise) smallest basic set that is described by constraints that are translates of the constraints in the input set. This means that the simple hull is relatively cheap to compute and that the number of constraints in the simple hull is no larger than the number of constraints in the input. \begin{definition}[Simple Hull of a Set] The {\em simple hull} of a set $S = \bigcup_{1 \le i \le v} S_i$, with $$ S : \Z^n \to 2^{\Z^d} : \vec s \mapsto S(\vec s) = \left\{\, \vec x \in \Z^d \mid \exists \vec z \in \Z^e : \bigvee_{1 \le i \le v} A_i \vec x + B_i \vec s + D_i \vec z + \vec c_i \geq \vec 0 \,\right\} $$ is the set $$ H : \Z^n \to 2^{\Z^d} : \vec s \mapsto S(\vec s) = \left\{\, \vec x \in \Z^d \mid \exists \vec z \in \Z^e : \bigwedge_{1 \le i \le v} A_i \vec x + B_i \vec s + D_i \vec z + \vec c_i + \vec K_i \geq \vec 0 \,\right\} , $$ with $\vec K_i$ the (component-wise) smallest non-negative integer vectors such that $S \subseteq H$. \end{definition} The $\vec K_i$ can be obtained by solving a number of LP problems, one for each element of each $\vec K_i$. If any LP problem is unbounded, then the corresponding constraint is dropped. \section{Parametric Integer Programming} \subsection{Introduction}\label{s:intro} Parametric integer programming \shortcite{Feautrier88parametric} is used to solve many problems within the context of the polyhedral model. Here, we are mainly interested in dependence analysis \shortcite{Fea91} and in computing a unique representation for existentially quantified variables. The latter operation has been used for counting elements in sets involving such variables \shortcite{BouletRe98,Verdoolaege2005experiences} and lies at the core of the internal representation of {\tt isl}. Parametric integer programming was first implemented in \texttt{PipLib}. An alternative method for parametric integer programming was later implemented in {\tt barvinok} \cite{barvinok-0.22}. This method is not based on Feautrier's algorithm, but on rational generating functions \cite{Woods2003short} and was inspired by the ``digging'' technique of \shortciteN{DeLoera2004Three} for solving non-parametric integer programming problems. In the following sections, we briefly recall the dual simplex method combined with Gomory cuts and describe some extensions and optimizations. The main algorithm is applied to a matrix data structure known as a tableau. In case of parametric problems, there are two tableaus, one for the main problem and one for the constraints on the parameters, known as the context tableau. The handling of the context tableau is described in \autoref{s:context}. \subsection{The Dual Simplex Method} Tableaus can be represented in several slightly different ways. In {\tt isl}, the dual simplex method uses the same representation as that used by its incremental LP solver based on the \emph{primal} simplex method. The implementation of this LP solver is based on that of {\tt Simplify} \shortcite{Detlefs2005simplify}, which, in turn, was derived from the work of \shortciteN{Nelson1980phd}. In the original \shortcite{Nelson1980phd}, the tableau was implemented as a sparse matrix, but neither {\tt Simplify} nor the current implementation of {\tt isl} does so. Given some affine constraints on the variables, $A \vec x + \vec b \ge \vec 0$, the tableau represents the relationship between the variables $\vec x$ and non-negative variables $\vec y = A \vec x + \vec b$ corresponding to the constraints. The initial tableau contains $\begin{pmatrix} \vec b & A \end{pmatrix}$ and expresses the constraints $\vec y$ in the rows in terms of the variables $\vec x$ in the columns. The main operation defined on a tableau exchanges a column and a row variable and is called a pivot. During this process, some coefficients may become rational. As in the \texttt{PipLib} implementation, {\tt isl} maintains a shared denominator per row. The sample value of a tableau is one where each column variable is assigned zero and each row variable is assigned the constant term of the row. This sample value represents a valid solution if each constraint variable is assigned a non-negative value, i.e., if the constant terms of rows corresponding to constraints are all non-negative. The dual simplex method starts from an initial sample value that may be invalid, but that is known to be (lexicographically) no greater than any solution, and gradually increments this sample value through pivoting until a valid solution is obtained. In particular, each pivot exchanges a row variable $r = -n + \sum_i a_i \, c_i$ with negative sample value $-n$ with a column variable $c_j$ such that $a_j > 0$. Since $c_j = (n + r - \sum_{i\ne j} a_i \, c_i)/a_j$, the new row variable will have a positive sample value $n$. If no such column can be found, then the problem is infeasible. By always choosing the column that leads to the (lexicographically) smallest increment in the variables $\vec x$, the first solution found is guaranteed to be the (lexicographically) minimal solution \cite{Feautrier88parametric}. In order to be able to determine the smallest increment, the tableau is (implicitly) extended with extra rows defining the original variables in terms of the column variables. If we assume that all variables are non-negative, then we know that the zero vector is no greater than the minimal solution and then the initial extended tableau looks as follows. $$ \begin{tikzpicture} \matrix (m) [matrix of math nodes] { & {} & 1 & \vec c \\ \vec x && |(top)| \vec 0 & I \\ \vec r && \vec b & |(bottom)|A \\ }; \begin{pgfonlayer}{background} \node (core) [inner sep=0pt,fill=black!20,right delimiter=),left delimiter=(,fit=(top)(bottom)] {}; \end{pgfonlayer} \end{tikzpicture} $$ Each column in this extended tableau is lexicographically positive and will remain so because of the column choice explained above. It is then clear that the value of $\vec x$ will increase in each step. Note that there is no need to store the extra rows explicitly. If a given $x_i$ is a column variable, then the corresponding row is the unit vector $e_i$. If, on the other hand, it is a row variable, then the row already appears somewhere else in the tableau. In case of parametric problems, the sign of the constant term may depend on the parameters. Each time the constant term of a constraint row changes, we therefore need to check whether the new term can attain negative and/or positive values over the current set of possible parameter values, i.e., the context. If all these terms can only attain non-negative values, the current state of the tableau represents a solution. If one of the terms can only attain non-positive values and is not identically zero, the corresponding row can be pivoted. Otherwise, we pick one of the terms that can attain both positive and negative values and split the context into a part where it only attains non-negative values and a part where it only attains negative values. \subsection{Gomory Cuts} The solution found by the dual simplex method may have non-integral coordinates. If so, some rational solutions (including the current sample value), can be cut off by applying a (parametric) Gomory cut. Let $r = b(\vec p) + \sp {\vec a} {\vec c}$ be the row corresponding to the first non-integral coordinate of $\vec x$, with $b(\vec p)$ the constant term, an affine expression in the parameters $\vec p$, i.e., $b(\vec p) = \sp {\vec f} {\vec p} + g$. Note that only row variables can attain non-integral values as the sample value of the column variables is zero. Consider the expression $b(\vec p) - \ceil{b(\vec p)} + \sp {\fract{\vec a}} {\vec c}$, with $\ceil\cdot$ the ceiling function and $\fract\cdot$ the fractional part. This expression is negative at the sample value since $\vec c = \vec 0$ and $r = b(\vec p)$ is fractional, i.e., $\ceil{b(\vec p)} > b(\vec p)$. On the other hand, for each integral value of $r$ and $\vec c \ge 0$, the expression is non-negative because $b(\vec p) - \ceil{b(\vec p)} > -1$. Imposing this expression to be non-negative therefore does not invalidate any integral solutions, while it does cut away the current fractional sample value. To be able to formulate this constraint, a new variable $q = \floor{-b(\vec p)} = - \ceil{b(\vec p)}$ is added to the context. This integral variable is uniquely defined by the constraints $0 \le -d \, b(\vec p) - d \, q \le d - 1$, with $d$ the common denominator of $\vec f$ and $g$. In practice, the variable $q' = \floor{\sp {\fract{-f}} {\vec p} + \fract{-g}}$ is used instead and the coefficients of the new constraint are adjusted accordingly. The sign of the constant term of this new constraint need not be determined as it is non-positive by construction. When several of these extra context variables are added, it is important to avoid adding duplicates. Recent versions of {\tt PipLib} also check for such duplicates. \subsection{Negative Unknowns and Maximization} There are two places in the above algorithm where the unknowns $\vec x$ are assumed to be non-negative: the initial tableau starts from sample value $\vec x = \vec 0$ and $\vec c$ is assumed to be non-negative during the construction of Gomory cuts. To deal with negative unknowns, \shortciteN[Appendix A.2]{Fea91} proposed to use a ``big parameter'', say $M$, that is taken to be an arbitrarily large positive number. Instead of looking for the lexicographically minimal value of $\vec x$, we search instead for the lexicographically minimal value of $\vec x' = \vec M + \vec x$. The sample value $\vec x' = \vec 0$ of the initial tableau then corresponds to $\vec x = -\vec M$, which is clearly not greater than any potential solution. The sign of the constant term of a row is determined lexicographically, with the coefficient of $M$ considered first. That is, if the coefficient of $M$ is not zero, then its sign is the sign of the entire term. Otherwise, the sign is determined by the remaining affine expression in the parameters. If the original problem has a bounded optimum, then the final sample value will be of the form $\vec M + \vec v$ and the optimal value of the original problem is then $\vec v$. Maximization problems can be handled in a similar way by computing the minimum of $\vec M - \vec x$. When the optimum is unbounded, the optimal value computed for the original problem will involve the big parameter. In the original implementation of {\tt PipLib}, the big parameter could even appear in some of the extra variables $\vec q$ created during the application of a Gomory cut. The final result could then contain implicit conditions on the big parameter through conditions on such $\vec q$ variables. This problem was resolved in later versions of {\tt PipLib} by taking $M$ to be divisible by any positive number. The big parameter can then never appear in any $\vec q$ because $\fract {\alpha M } = 0$. It should be noted, though, that an unbounded problem usually (but not always) indicates an incorrect formulation of the problem. The original version of {\tt PipLib} required the user to ``manually'' add a big parameter, perform the reformulation and interpret the result \shortcite{Feautrier02}. Recent versions allow the user to simply specify that the unknowns may be negative or that the maximum should be computed and then these transformations are performed internally. Although there are some application, e.g., that of \shortciteN{Feautrier92multi}, where it is useful to have explicit control over the big parameter, negative unknowns and maximization are by far the most common applications of the big parameter and we believe that the user should not be bothered with such implementation issues. The current version of {\tt isl} therefore does not provide any interface for specifying big parameters. Instead, the user can specify whether a maximum needs to be computed and no assumptions are made on the sign of the unknowns. Instead, the sign of the unknowns is checked internally and a big parameter is automatically introduced when needed. For compatibility with {\tt PipLib}, the {\tt isl\_pip} tool does explicitly add non-negativity constraints on the unknowns unless the \verb+Urs_unknowns+ option is specified. Currently, there is also no way in {\tt isl} of expressing a big parameter in the output. Even though {\tt isl} makes the same divisibility assumption on the big parameter as recent versions of {\tt PipLib}, it will therefore eventually produce an error if the problem turns out to be unbounded. \subsection{Preprocessing} In this section, we describe some transformations that are or can be applied in advance to reduce the running time of the actual dual simplex method with Gomory cuts. \subsubsection{Feasibility Check and Detection of Equalities} Experience with the original {\tt PipLib} has shown that Gomory cuts do not perform very well on problems that are (non-obviously) empty, i.e., problems with rational solutions, but no integer solutions. In {\tt isl}, we therefore first perform a feasibility check on the original problem considered as a non-parametric problem over the combined space of unknowns and parameters. In fact, we do not simply check the feasibility, but we also check for implicit equalities among the integer points by computing the integer affine hull. The algorithm used is the same as that described in \autoref{s:GBR} below. Computing the affine hull is fairly expensive, but it can bring huge benefits if any equalities can be found or if the problem turns out to be empty. \subsubsection{Constraint Simplification} If the coefficients of the unknown and parameters in a constraint have a common factor, then this factor should be removed, possibly rounding down the constant term. For example, the constraint $2 x - 5 \ge 0$ should be simplified to $x - 3 \ge 0$. {\tt isl} performs such simplifications on all sets and relations. Recent versions of {\tt PipLib} also perform this simplification on the input. \subsubsection{Exploiting Equalities}\label{s:equalities} If there are any (explicit) equalities in the input description, {\tt PipLib} converts each into a pair of inequalities. It is also possible to write $r$ equalities as $r+1$ inequalities \shortcite{Feautrier02}, but it is even better to \emph{exploit} the equalities to reduce the dimensionality of the problem. Given an equality involving at least one unknown, we pivot the row corresponding to the equality with the column corresponding to the last unknown with non-zero coefficient. The new column variable can then be removed completely because it is identically zero, thereby reducing the dimensionality of the problem by one. The last unknown is chosen to ensure that the columns of the initial tableau remain lexicographically positive. In particular, if the equality is of the form $b + \sum_{i \le j} a_i \, x_i = 0$ with $a_j \ne 0$, then the (implicit) top rows of the initial tableau are changed as follows $$ \begin{tikzpicture} \matrix [matrix of math nodes] { & {} & |(top)| 0 & I_1 & |(j)| & \\ j && 0 & & 1 & \\ && 0 & & & |(bottom)|I_2 \\ }; \node[overlay,above=2mm of j,anchor=south]{j}; \begin{pgfonlayer}{background} \node (m) [inner sep=0pt,fill=black!20,right delimiter=),left delimiter=(,fit=(top)(bottom)] {}; \end{pgfonlayer} \begin{scope}[xshift=4cm] \matrix [matrix of math nodes] { & {} & |(top)| 0 & I_1 & \\ j && |(left)| -b/a_j & -a_i/a_j & \\ && 0 & & |(bottom)|I_2 \\ }; \begin{pgfonlayer}{background} \node (m2) [inner sep=0pt,fill=black!20,right delimiter=),left delimiter=(,fit=(top)(bottom)(left)] {}; \end{pgfonlayer} \end{scope} \draw [shorten >=7mm,-to,thick,decorate, decoration={snake,amplitude=.4mm,segment length=2mm, pre=moveto,pre length=5mm,post length=8mm}] (m) -- (m2); \end{tikzpicture} $$ Currently, {\tt isl} also eliminates equalities involving only parameters in a similar way, provided at least one of the coefficients is equal to one. The application of parameter compression (see below) would obviate the need for removing parametric equalities. \subsubsection{Offline Symmetry Detection}\label{s:offline} Some problems, notably those of \shortciteN{Bygde2010licentiate}, have a collection of constraints, say $b_i(\vec p) + \sp {\vec a} {\vec x} \ge 0$, that only differ in their (parametric) constant terms. These constant terms will be non-negative on different parts of the context and this context may have to be split for each of the constraints. In the worst case, the basic algorithm may have to consider all possible orderings of the constant terms. Instead, {\tt isl} introduces a new parameter, say $u$, and replaces the collection of constraints by the single constraint $u + \sp {\vec a} {\vec x} \ge 0$ along with context constraints $u \le b_i(\vec p)$. Any solution to the new system is also a solution to the original system since $\sp {\vec a} {\vec x} \ge -u \ge -b_i(\vec p)$. Conversely, $m = \min_i b_i(\vec p)$ satisfies the constraints on $u$ and therefore extends a solution to the new system. It can also be plugged into a new solution. See \autoref{s:post} for how this substitution is currently performed in {\tt isl}. The method described in this section can only detect symmetries that are explicitly available in the input. See \autoref{s:online} for the detection and exploitation of symmetries that appear during the course of the dual simplex method. \subsubsection{Parameter Compression}\label{s:compression} It may in some cases be apparent from the equalities in the problem description that there can only be a solution for a sublattice of the parameters. In such cases ``parameter compression'' \shortcite{Meister2004PhD,Meister2008} can be used to replace the parameters by alternative ``dense'' parameters. For example, if there is a constraint $2x = n$, then the system will only have solutions for even values of $n$ and $n$ can be replaced by $2n'$. Similarly, the parameters $n$ and $m$ in a system with the constraint $2n = 3m$ can be replaced by a single parameter $n'$ with $n=3n'$ and $m=2n'$. It is also possible to perform a similar compression on the unknowns, but it would be more complicated as the compression would have to preserve the lexicographical order. Moreover, due to our handling of equalities described above there should be no need for such variable compression. Although parameter compression has been implemented in {\tt isl}, it is currently not yet used during parametric integer programming. \subsection{Postprocessing}\label{s:post} The output of {\tt PipLib} is a quast (quasi-affine selection tree). Each internal node in this tree corresponds to a split of the context based on a parametric constant term in the main tableau with indeterminate sign. Each of these nodes may introduce extra variables in the context corresponding to integer divisions. Each leaf of the tree prescribes the solution in that part of the context that satisfies all the conditions on the path leading to the leaf. Such a quast is a very economical way of representing the solution, but it would not be suitable as the (only) internal representation of sets and relations in {\tt isl}. Instead, {\tt isl} represents the constraints of a set or relation in disjunctive normal form. The result of a parametric integer programming problem is then also converted to this internal representation. Unfortunately, the conversion to disjunctive normal form can lead to an explosion of the size of the representation. In some cases, this overhead would have to be paid anyway in subsequent operations, but in other cases, especially for outside users that just want to solve parametric integer programming problems, we would like to avoid this overhead in future. That is, we are planning on introducing quasts or a related representation as one of several possible internal representations and on allowing the output of {\tt isl\_pip} to optionally be printed as a quast. Currently, {\tt isl} also does not have an internal representation for expressions such as $\min_i b_i(\vec p)$ from the offline symmetry detection of \autoref{s:offline}. Assume that one of these expressions has $n$ bounds $b_i(\vec p)$. If the expression does not appear in the affine expression describing the solution, but only in the constraints, and if moreover, the expression only appears with a positive coefficient, i.e., $\min_i b_i(\vec p) \ge f_j(\vec p)$, then each of these constraints can simply be reduplicated $n$ times, once for each of the bounds. Otherwise, a conversion to disjunctive normal form leads to $n$ cases, each described as $u = b_i(\vec p)$ with constraints $b_i(\vec p) \le b_j(\vec p)$ for $j > i$ and $b_i(\vec p) < b_j(\vec p)$ for $j < i$. Note that even though this conversion leads to a size increase by a factor of $n$, not detecting the symmetry could lead to an increase by a factor of $n!$ if all possible orderings end up being considered. \subsection{Context Tableau}\label{s:context} The main operation that a context tableau needs to provide is a test on the sign of an affine expression over the elements of the context. This sign can be determined by solving two integer linear feasibility problems, one with a constraint added to the context that enforces the expression to be non-negative and one where the expression is negative. As already mentioned by \shortciteN{Feautrier88parametric}, any integer linear feasibility solver could be used, but the {\tt PipLib} implementation uses a recursive call to the dual simplex with Gomory cuts algorithm to determine the feasibility of a context. In {\tt isl}, two ways of handling the context have been implemented, one that performs the recursive call and one, used by default, that uses generalized basis reduction. We start with some optimizations that are shared between the two implementations and then discuss additional details of each of them. \subsubsection{Maintaining Witnesses}\label{s:witness} A common feature of both integer linear feasibility solvers is that they will not only say whether a set is empty or not, but if the set is non-empty, they will also provide a \emph{witness} for this result, i.e., a point that belongs to the set. By maintaining a list of such witnesses, we can avoid many feasibility tests during the determination of the signs of affine expressions. In particular, if the expression evaluates to a positive number on some of these points and to a negative number on some others, then no feasibility test needs to be performed. If all the evaluations are non-negative, we only need to check for the possibility of a negative value and similarly in case of all non-positive evaluations. Finally, in the rare case that all points evaluate to zero or at the start, when no points have been collected yet, one or two feasibility tests need to be performed depending on the result of the first test. When a new constraint is added to the context, the points that violate the constraint are temporarily removed. They are reconsidered when we backtrack over the addition of the constraint, as they will satisfy the negation of the constraint. It is only when we backtrack over the addition of the points that they are finally removed completely. When an extra integer division is added to the context, the new coordinates of the witnesses can easily be computed by evaluating the integer division. The idea of keeping track of witnesses was first used in {\tt barvinok}. \subsubsection{Choice of Constant Term on which to Split} Recall that if there are no rows with a non-positive constant term, but there are rows with an indeterminate sign, then the context needs to be split along the constant term of one of these rows. If there is more than one such row, then we need to choose which row to split on first. {\tt PipLib} uses a heuristic based on the (absolute) sizes of the coefficients. In particular, it takes the largest coefficient of each row and then selects the row where this largest coefficient is smaller than those of the other rows. In {\tt isl}, we take that row for which non-negativity of its constant term implies non-negativity of as many of the constant terms of the other rows as possible. The intuition behind this heuristic is that on the positive side, we will have fewer negative and indeterminate signs, while on the negative side, we need to perform a pivot, which may affect any number of rows meaning that the effect on the signs is difficult to predict. This heuristic is of course much more expensive to evaluate than the heuristic used by {\tt PipLib}. More extensive tests are needed to evaluate whether the heuristic is worthwhile. \subsubsection{Dual Simplex + Gomory Cuts} When a new constraint is added to the context, the first steps of the dual simplex method applied to this new context will be the same or at least very similar to those taken on the original context, i.e., before the constraint was added. In {\tt isl}, we therefore apply the dual simplex method incrementally on the context and backtrack to a previous state when a constraint is removed again. An initial implementation that was never made public would also keep the Gomory cuts, but the current implementation backtracks to before the point where Gomory cuts are added before adding an extra constraint to the context. Keeping the Gomory cuts has the advantage that the sample value is always an integer point and that this point may also satisfy the new constraint. However, due to the technique of maintaining witnesses explained above, we would not perform a feasibility test in such cases and then the previously added cuts may be redundant, possibly resulting in an accumulation of a large number of cuts. If the parameters may be negative, then the same big parameter trick used in the main tableau is applied to the context. This big parameter is of course unrelated to the big parameter from the main tableau. Note that it is not a requirement for this parameter to be ``big'', but it does allow for some code reuse in {\tt isl}. In {\tt PipLib}, the extra parameter is not ``big'', but this may be because the big parameter of the main tableau also appears in the context tableau. Finally, it was reported by \shortciteN{Galea2009personal}, who worked on a parametric integer programming implementation in {\tt PPL} \shortcite{PPL}, that it is beneficial to add cuts for \emph{all} rational coordinates in the context tableau. Based on this report, the initial {\tt isl} implementation was adapted accordingly. \subsubsection{Generalized Basis Reduction}\label{s:GBR} The default algorithm used in {\tt isl} for feasibility checking is generalized basis reduction \shortcite{Cook1991implementation}. This algorithm is also used in the {\tt barvinok} implementation. The algorithm is fairly robust, but it has some overhead. We therefore try to avoid calling the algorithm in easy cases. In particular, we incrementally keep track of points for which the entire unit hypercube positioned at that point lies in the context. This set is described by translates of the constraints of the context and if (rationally) non-empty, any rational point in the set can be rounded up to yield an integer point in the context. A restriction of the algorithm is that it only works on bounded sets. The affine hull of the recession cone therefore needs to be projected out first. As soon as the algorithm is invoked, we then also incrementally keep track of this recession cone. The reduced basis found by one call of the algorithm is also reused as initial basis for the next call. Some problems lead to the introduction of many integer divisions. Within a given context, some of these integer divisions may be equal to each other, even if the expressions are not identical, or they may be equal to some affine combination of other variables. To detect such cases, we compute the affine hull of the context each time a new integer division is added. The algorithm used for computing this affine hull is that of \shortciteN{Karr1976affine}, while the points used in this algorithm are obtained by performing integer feasibility checks on that part of the context outside the current approximation of the affine hull. The list of witnesses is used to construct an initial approximation of the hull, while any extra points found during the construction of the hull is added to this list. Any equality found in this way that expresses an integer division as an \emph{integer} affine combination of other variables is propagated to the main tableau, where it is used to eliminate that integer division. \subsection{Experiments} \autoref{t:comparison} compares the execution times of {\tt isl} (with both types of context tableau) on some more difficult instances to those of other tools, run on an Intel Xeon W3520 @ 2.66GHz. Easier problems such as the test cases distributed with {\tt Pip\-Lib} can be solved so quickly that we would only be measuring overhead such as input/output and conversions and not the running time of the actual algorithm. We compare the following versions: {\tt piplib-1.4.0-5-g0132fd9}, {\tt barvinok-0.32.1-73-gc5d7751}, {\tt isl-0.05.1-82-g3a37260} and {\tt PPL} version 0.11.2. The first test case is the following dependence analysis problem originating from the Phideo project \shortcite{Verhaegh1995PhD} that was communicated to us by Bart Kienhuis: \begin{lstlisting}[flexiblecolumns=true,breaklines=true]{} lexmax { [j1,j2] -> [i1,i2,i3,i4,i5,i6,i7,i8,i9,i10] : 1 <= i1,j1 <= 8 and 1 <= i2,i3,i4,i5,i6,i7,i8,i9,i10 <= 2 and 1 <= j2 <= 128 and i1-1 = j1-1 and i2-1+2*i3-2+4*i4-4+8*i5-8+16*i6-16+32*i7-32+64*i8-64+128*i9-128+256*i10-256=3*j2-3+66 }; \end{lstlisting} This problem was the main inspiration for some of the optimizations in \autoref{s:GBR}. The second group of test cases are projections used during counting. The first nine of these come from \shortciteN{Seghir2006minimizing}. The remaining two come from \shortciteN{Verdoolaege2005experiences} and were used to drive the first, Gomory cuts based, implementation in {\tt isl}. The third and final group of test cases are borrowed from \shortciteN{Bygde2010licentiate} and inspired the offline symmetry detection of \autoref{s:offline}. Without symmetry detection, the running times are 11s and 5.9s. All running times of {\tt barvinok} and {\tt isl} include a conversion to disjunctive normal form. Without this conversion, the final two cases can be solved in 0.07s and 0.21s. The {\tt PipLib} implementation has some fixed limits and will sometimes report the problem to be too complex (TC), while on some other problems it will run out of memory (OOM). The {\tt barvinok} implementation does not support problems with a non-trivial lineality space (line) nor maximization problems (max). The Gomory cuts based {\tt isl} implementation was terminated after 1000 minutes on the first problem. The gbr version introduces some overhead on some of the easier problems, but is overall the clear winner. \begin{table} \begin{center} \begin{tabular}{lrrrrr} & {\tt PipLib} & {\tt barvinok} & {\tt isl} cut & {\tt isl} gbr & {\tt PPL} \\ \hline \hline % bart.pip Phideo & TC & 793m & $>$999m & 2.7s & 372m \\ \hline e1 & 0.33s & 3.5s & 0.08s & 0.11s & 0.18s \\ e3 & 0.14s & 0.13s & 0.10s & 0.10s & 0.17s \\ e4 & 0.24s & 9.1s & 0.09s & 0.11s & 0.70s \\ e5 & 0.12s & 6.0s & 0.06s & 0.14s & 0.17s \\ e6 & 0.10s & 6.8s & 0.17s & 0.08s & 0.21s \\ e7 & 0.03s & 0.27s & 0.04s & 0.04s & 0.03s \\ e8 & 0.03s & 0.18s & 0.03s & 0.04s & 0.01s \\ e9 & OOM & 70m & 2.6s & 0.94s & 22s \\ vd & 0.04s & 0.10s & 0.03s & 0.03s & 0.03s \\ bouleti & 0.25s & line & 0.06s & 0.06s & 0.15s \\ difficult & OOM & 1.3s & 1.7s & 0.33s & 1.4s \\ \hline cnt/sum & TC & max & 2.2s & 2.2s & OOM \\ jcomplex & TC & max & 3.7s & 3.9s & OOM \\ \end{tabular} \caption{Comparison of Execution Times} \label{t:comparison} \end{center} \end{table} \subsection{Online Symmetry Detection}\label{s:online} Manual experiments on small instances of the problems of \shortciteN{Bygde2010licentiate} and an analysis of the results by the approximate MPA method developed by \shortciteN{Bygde2010licentiate} have revealed that these problems contain many more symmetries than can be detected using the offline method of \autoref{s:offline}. In this section, we present an online detection mechanism that has not been implemented yet, but that has shown promising results in manual applications. Let us first consider what happens when we do not perform offline symmetry detection. At some point, one of the $b_i(\vec p) + \sp {\vec a} {\vec x} \ge 0$ constraints, say the $j$th constraint, appears as a column variable, say $c_1$, while the other constraints are represented as rows of the form $b_i(\vec p) - b_j(\vec p) + c$. The context is then split according to the relative order of $b_j(\vec p)$ and one of the remaining $b_i(\vec p)$. The offline method avoids this split by replacing all $b_i(\vec p)$ by a single newly introduced parameter that represents the minimum of these $b_i(\vec p)$. In the online method the split is similarly avoided by the introduction of a new parameter. In particular, a new parameter is introduced that represents $\left| b_j(\vec p) - b_i(\vec p) \right|_+ = \max(b_j(\vec p) - b_i(\vec p), 0)$. In general, let $r = b(\vec p) + \sp {\vec a} {\vec c}$ be a row of the tableau such that the sign of $b(\vec p)$ is indeterminate and such that exactly one of the elements of $\vec a$ is a $1$, while all remaining elements are non-positive. That is, $r = b(\vec p) + c_j - f$ with $f = -\sum_{i\ne j} a_i c_i \ge 0$. We introduce a new parameter $t$ with context constraints $t \ge -b(\vec p)$ and $t \ge 0$ and replace the column variable $c_j$ by $c' + t$. The row $r$ is now equal to $b(\vec p) + t + c' - f$. The constant term of this row is always non-negative because any negative value of $b(\vec p)$ is compensated by $t \ge -b(\vec p)$ while and non-negative value remains non-negative because $t \ge 0$. We need to show that this transformation does not eliminate any valid solutions and that it does not introduce any spurious solutions. Given a valid solution for the original problem, we need to find a non-negative value of $c'$ satisfying the constraints. If $b(\vec p) \ge 0$, we can take $t = 0$ so that $c' = c_j - t = c_j \ge 0$. If $b(\vec p) < 0$, we can take $t = -b(\vec p)$. Since $r = b(\vec p) + c_j - f \ge 0$ and $f \ge 0$, we have $c' = c_j + b(\vec p) \ge 0$. Note that these choices amount to plugging in $t = \left|-b(\vec p)\right|_+ = \max(-b(\vec p), 0)$. Conversely, given a solution to the new problem, we need to find a non-negative value of $c_j$, but this is easy since $c_j = c' + t$ and both of these are non-negative. Plugging in $t = \max(-b(\vec p), 0)$ can be performed as in \autoref{s:post}, but, as in the case of offline symmetry detection, it may be better to provide a direct representation for such expressions in the internal representation of sets and relations or at least in a quast-like output format. \section{Coalescing}\label{s:coalescing} See \shortciteN{Verdoolaege2009isl}, for now. More details will be added later. \section{Transitive Closure} \subsection{Introduction} \begin{definition}[Power of a Relation] Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation and $k \in \Z_{\ge 1}$ a positive number, then power $k$ of relation $R$ is defined as \begin{equation} \label{eq:transitive:power} R^k \coloneqq \begin{cases} R & \text{if $k = 1$} \\ R \circ R^{k-1} & \text{if $k \ge 2$} . \end{cases} \end{equation} \end{definition} \begin{definition}[Transitive Closure of a Relation] Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation, then the transitive closure $R^+$ of $R$ is the union of all positive powers of $R$, $$ R^+ \coloneqq \bigcup_{k \ge 1} R^k . $$ \end{definition} Alternatively, the transitive closure may be defined inductively as \begin{equation} \label{eq:transitive:inductive} R^+ \coloneqq R \cup \left(R \circ R^+\right) . \end{equation} Since the transitive closure of a polyhedral relation may no longer be a polyhedral relation \shortcite{Kelly1996closure}, we can, in the general case, only compute an approximation of the transitive closure. Whereas \shortciteN{Kelly1996closure} compute underapproximations, we, like \shortciteN{Beletska2009}, compute overapproximations. That is, given a relation $R$, we will compute a relation $T$ such that $R^+ \subseteq T$. Of course, we want this approximation to be as close as possible to the actual transitive closure $R^+$ and we want to detect the cases where the approximation is exact, i.e., where $T = R^+$. For computing an approximation of the transitive closure of $R$, we follow the same general strategy as \shortciteN{Beletska2009} and first compute an approximation of $R^k$ for $k \ge 1$ and then project out the parameter $k$ from the resulting relation. \begin{example} As a trivial example, consider the relation $R = \{\, x \to x + 1 \,\}$. The $k$th power of this map for arbitrary $k$ is $$ R^k = k \mapsto \{\, x \to x + k \mid k \ge 1 \,\} . $$ The transitive closure is then $$ \begin{aligned} R^+ & = \{\, x \to y \mid \exists k \in \Z_{\ge 1} : y = x + k \,\} \\ & = \{\, x \to y \mid y \ge x + 1 \,\} . \end{aligned} $$ \end{example} \subsection{Computing an Approximation of $R^k$} \label{s:power} There are some special cases where the computation of $R^k$ is very easy. One such case is that where $R$ does not compose with itself, i.e., $R \circ R = \emptyset$ or $\domain R \cap \range R = \emptyset$. In this case, $R^k$ is only non-empty for $k=1$ where it is equal to $R$ itself. In general, it is impossible to construct a closed form of $R^k$ as a polyhedral relation. We will therefore need to make some approximations. As a first approximations, we will consider each of the basic relations in $R$ as simply adding one or more offsets to a domain element to arrive at an image element and ignore the fact that some of these offsets may only be applied to some of the domain elements. That is, we will only consider the difference set $\Delta\,R$ of the relation. In particular, we will first construct a collection $P$ of paths that move through a total of $k$ offsets and then intersect domain and range of this collection with those of $R$. That is, \begin{equation} \label{eq:transitive:approx} K = P \cap \left(\domain R \to \range R\right) , \end{equation} with \begin{equation} \label{eq:transitive:path} P = \vec s \mapsto \{\, \vec x \to \vec y \mid \exists k_i \in \Z_{\ge 0}, \vec\delta_i \in k_i \, \Delta_i(\vec s) : \vec y = \vec x + \sum_i \vec\delta_i \wedge \sum_i k_i = k > 0 \,\} \end{equation} and with $\Delta_i$ the basic sets that compose the difference set $\Delta\,R$. Note that the number of basic sets $\Delta_i$ need not be the same as the number of basic relations in $R$. Also note that since addition is commutative, it does not matter in which order we add the offsets and so we are allowed to group them as we did in \eqref{eq:transitive:path}. If all the $\Delta_i$s are singleton sets $\Delta_i = \{\, \vec \delta_i \,\}$ with $\vec \delta_i \in \Z^d$, then \eqref{eq:transitive:path} simplifies to \begin{equation} \label{eq:transitive:singleton} P = \{\, \vec x \to \vec y \mid \exists k_i \in \Z_{\ge 0} : \vec y = \vec x + \sum_i k_i \, \vec \delta_i \wedge \sum_i k_i = k > 0 \,\} \end{equation} and then the approximation computed in \eqref{eq:transitive:approx} is essentially the same as that of \shortciteN{Beletska2009}. If some of the $\Delta_i$s are not singleton sets or if some of $\vec \delta_i$s are parametric, then we need to resort to further approximations. To ease both the exposition and the implementation, we will for the remainder of this section work with extended offsets $\Delta_i' = \Delta_i \times \{\, 1 \,\}$. That is, each offset is extended with an extra coordinate that is set equal to one. The paths constructed by summing such extended offsets have the length encoded as the difference of their final coordinates. The path $P'$ can then be decomposed into paths $P_i'$, one for each $\Delta_i$, \begin{equation} \label{eq:transitive:decompose} P' = \left( (P_m' \cup \identity) \circ \cdots \circ (P_2' \cup \identity) \circ (P_1' \cup \identity) \right) \cap \{\, \vec x' \to \vec y' \mid y_{d+1} - x_{d+1} = k > 0 \,\} , \end{equation} with $$ P_i' = \vec s \mapsto \{\, \vec x' \to \vec y' \mid \exists k \in \Z_{\ge 1}, \vec \delta \in k \, \Delta_i'(\vec s) : \vec y' = \vec x' + \vec \delta \,\} . $$ Note that each $P_i'$ contains paths of length at least one. We therefore need to take the union with the identity relation when composing the $P_i'$s to allow for paths that do not contain any offsets from one or more $\Delta_i'$. The path that consists of only identity relations is removed by imposing the constraint $y_{d+1} - x_{d+1} > 0$. Taking the union with the identity relation means that that the relations we compose in \eqref{eq:transitive:decompose} each consist of two basic relations. If there are $m$ disjuncts in the input relation, then a direct application of the composition operation may therefore result in a relation with $2^m$ disjuncts, which is prohibitively expensive. It is therefore crucial to apply coalescing (\autoref{s:coalescing}) after each composition. Let us now consider how to compute an overapproximation of $P_i'$. Those that correspond to singleton $\Delta_i$s are grouped together and handled as in \eqref{eq:transitive:singleton}. Note that this is just an optimization. The procedure described below would produce results that are at least as accurate. For simplicity, we first assume that no constraint in $\Delta_i'$ involves any existentially quantified variables. We will return to existentially quantified variables at the end of this section. Without existentially quantified variables, we can classify the constraints of $\Delta_i'$ as follows \begin{enumerate} \item non-parametric constraints \begin{equation} \label{eq:transitive:non-parametric} A_1 \vec x + \vec c_1 \geq \vec 0 \end{equation} \item purely parametric constraints \begin{equation} \label{eq:transitive:parametric} B_2 \vec s + \vec c_2 \geq \vec 0 \end{equation} \item negative mixed constraints \begin{equation} \label{eq:transitive:mixed} A_3 \vec x + B_3 \vec s + \vec c_3 \geq \vec 0 \end{equation} such that for each row $j$ and for all $\vec s$, $$ \Delta_i'(\vec s) \cap \{\, \vec \delta' \mid B_{3,j} \vec s + c_{3,j} > 0 \,\} = \emptyset $$ \item positive mixed constraints $$ A_4 \vec x + B_4 \vec s + \vec c_4 \geq \vec 0 $$ such that for each row $j$, there is at least one $\vec s$ such that $$ \Delta_i'(\vec s) \cap \{\, \vec \delta' \mid B_{4,j} \vec s + c_{4,j} > 0 \,\} \ne \emptyset $$ \end{enumerate} We will use the following approximation $Q_i$ for $P_i'$: \begin{equation} \label{eq:transitive:Q} \begin{aligned} Q_i = \vec s \mapsto \{\, \vec x' \to \vec y' \mid {} & \exists k \in \Z_{\ge 1}, \vec f \in \Z^d : \vec y' = \vec x' + (\vec f, k) \wedge {} \\ & A_1 \vec f + k \vec c_1 \geq \vec 0 \wedge B_2 \vec s + \vec c_2 \geq \vec 0 \wedge A_3 \vec f + B_3 \vec s + \vec c_3 \geq \vec 0 \,\} . \end{aligned} \end{equation} To prove that $Q_i$ is indeed an overapproximation of $P_i'$, we need to show that for every $\vec s \in \Z^n$, for every $k \in \Z_{\ge 1}$ and for every $\vec f \in k \, \Delta_i(\vec s)$ we have that $(\vec f, k)$ satisfies the constraints in \eqref{eq:transitive:Q}. If $\Delta_i(\vec s)$ is non-empty, then $\vec s$ must satisfy the constraints in \eqref{eq:transitive:parametric}. Each element $(\vec f, k) \in k \, \Delta_i'(\vec s)$ is a sum of $k$ elements $(\vec f_j, 1)$ in $\Delta_i'(\vec s)$. Each of these elements satisfies the constraints in \eqref{eq:transitive:non-parametric}, i.e., $$ \left[ \begin{matrix} A_1 & \vec c_1 \end{matrix} \right] \left[ \begin{matrix} \vec f_j \\ 1 \end{matrix} \right] \ge \vec 0 . $$ The sum of these elements therefore satisfies the same set of inequalities, i.e., $A_1 \vec f + k \vec c_1 \geq \vec 0$. Finally, the constraints in \eqref{eq:transitive:mixed} are such that for any $\vec s$ in the parameter domain of $\Delta$, we have $-\vec r(\vec s) \coloneqq B_3 \vec s + \vec c_3 \le \vec 0$, i.e., $A_3 \vec f_j \ge \vec r(\vec s) \ge \vec 0$ and therefore also $A_3 \vec f \ge \vec r(\vec s)$. Note that if there are no mixed constraints and if the rational relaxation of $\Delta_i(\vec s)$, i.e., $\{\, \vec x \in \Q^d \mid A_1 \vec x + \vec c_1 \ge \vec 0\,\}$, has integer vertices, then the approximation is exact, i.e., $Q_i = P_i'$. In this case, the vertices of $\Delta'_i(\vec s)$ generate the rational cone $\{\, \vec x' \in \Q^{d+1} \mid \left[ \begin{matrix} A_1 & \vec c_1 \end{matrix} \right] \vec x' \,\}$ and therefore $\Delta'_i(\vec s)$ is a Hilbert basis of this cone \shortcite[Theorem~16.4]{Schrijver1986}. Note however that, as pointed out by \shortciteN{DeSmet2010personal}, if there \emph{are} any mixed constraints, then the above procedure may not compute the most accurate affine approximation of $k \, \Delta_i(\vec s)$ with $k \ge 1$. In particular, we only consider the negative mixed constraints that happen to appear in the description of $\Delta_i(\vec s)$, while we should instead consider \emph{all} valid such constraints. It is also sufficient to consider those constraints because any constraint that is valid for $k \, \Delta_i(\vec s)$ is also valid for $1 \, \Delta_i(\vec s) = \Delta_i(\vec s)$. Take therefore any constraint $\spv a x + \spv b s + c \ge 0$ valid for $\Delta_i(\vec s)$. This constraint is also valid for $k \, \Delta_i(\vec s)$ iff $k \, \spv a x + \spv b s + c \ge 0$. If $\spv b s + c$ can attain any positive value, then $\spv a x$ may be negative for some elements of $\Delta_i(\vec s)$. We then have $k \, \spv a x < \spv a x$ for $k > 1$ and so the constraint is not valid for $k \, \Delta_i(\vec s)$. We therefore need to impose $\spv b s + c \le 0$ for all values of $\vec s$ such that $\Delta_i(\vec s)$ is non-empty, i.e., $\vec b$ and $c$ need to be such that $- \spv b s - c \ge 0$ is a valid constraint of $\Delta_i(\vec s)$. That is, $(\vec b, c)$ are the opposites of the coefficients of a valid constraint of $\Delta_i(\vec s)$. The approximation of $k \, \Delta_i(\vec s)$ can therefore be obtained using three applications of Farkas' lemma. The first obtains the coefficients of constraints valid for $\Delta_i(\vec s)$. The second obtains the coefficients of constraints valid for the projection of $\Delta_i(\vec s)$ onto the parameters. The opposite of the second set is then computed and intersected with the first set. The result is the set of coefficients of constraints valid for $k \, \Delta_i(\vec s)$. A final application of Farkas' lemma is needed to obtain the approximation of $k \, \Delta_i(\vec s)$ itself. \begin{example} Consider the relation $$ n \to \{\, (x, y) \to (1 + x, 1 - n + y) \mid n \ge 2 \,\} . $$ The difference set of this relation is $$ \Delta = n \to \{\, (1, 1 - n) \mid n \ge 2 \,\} . $$ Using our approach, we would only consider the mixed constraint $y - 1 + n \ge 0$, leading to the following approximation of the transitive closure: $$ n \to \{\, (x, y) \to (o_0, o_1) \mid n \ge 2 \wedge o_1 \le 1 - n + y \wedge o_0 \ge 1 + x \,\} . $$ If, instead, we apply Farkas's lemma to $\Delta$, i.e., \begin{verbatim} D := [n] -> { [1, 1 - n] : n >= 2 }; CD := coefficients D; CD; \end{verbatim} we obtain \begin{verbatim} { rat: coefficients[[c_cst, c_n] -> [i2, i3]] : i3 <= c_n and i3 <= c_cst + 2c_n + i2 } \end{verbatim} The pure-parametric constraints valid for $\Delta$, \begin{verbatim} P := { [a,b] -> [] }(D); CP := coefficients P; CP; \end{verbatim} are \begin{verbatim} { rat: coefficients[[c_cst, c_n] -> []] : c_n >= 0 and 2c_n >= -c_cst } \end{verbatim} Negating these coefficients and intersecting with \verb+CD+, \begin{verbatim} NCP := { rat: coefficients[[a,b] -> []] -> coefficients[[-a,-b] -> []] }(CP); CK := wrap((unwrap CD) * (dom (unwrap NCP))); CK; \end{verbatim} we obtain \begin{verbatim} { rat: [[c_cst, c_n] -> [i2, i3]] : i3 <= c_n and i3 <= c_cst + 2c_n + i2 and c_n <= 0 and 2c_n <= -c_cst } \end{verbatim} The approximation for $k\,\Delta$, \begin{verbatim} K := solutions CK; K; \end{verbatim} is then \begin{verbatim} [n] -> { rat: [i0, i1] : i1 <= -i0 and i0 >= 1 and i1 <= 2 - n - i0 } \end{verbatim} Finally, the computed approximation for $R^+$, \begin{verbatim} T := unwrap({ [dx,dy] -> [[x,y] -> [x+dx,y+dy]] }(K)); R := [n] -> { [x,y] -> [x+1,y+1-n] : n >= 2 }; T := T * ((dom R) -> (ran R)); T; \end{verbatim} is \begin{verbatim} [n] -> { [x, y] -> [o0, o1] : o1 <= x + y - o0 and o0 >= 1 + x and o1 <= 2 - n + x + y - o0 and n >= 2 } \end{verbatim} \end{example} Existentially quantified variables can be handled by classifying them into variables that are uniquely determined by the parameters, variables that are independent of the parameters and others. The first set can be treated as parameters and the second as variables. Constraints involving the other existentially quantified variables are removed. \begin{example} Consider the relation $$ R = n \to \{\, x \to y \mid \exists \, \alpha_0, \alpha_1: 7\alpha_0 = -2 + n \wedge 5\alpha_1 = -1 - x + y \wedge y \ge 6 + x \,\} . $$ The difference set of this relation is $$ \Delta = \Delta \, R = n \to \{\, x \mid \exists \, \alpha_0, \alpha_1: 7\alpha_0 = -2 + n \wedge 5\alpha_1 = -1 + x \wedge x \ge 6 \,\} . $$ The existentially quantified variables can be defined in terms of the parameters and variables as $$ \alpha_0 = \floor{\frac{-2 + n}7} \qquad \text{and} \qquad \alpha_1 = \floor{\frac{-1 + x}5} . $$ $\alpha_0$ can therefore be treated as a parameter, while $\alpha_1$ can be treated as a variable. This in turn means that $7\alpha_0 = -2 + n$ can be treated as a purely parametric constraint, while the other two constraints are non-parametric. The corresponding $Q$~\eqref{eq:transitive:Q} is therefore $$ \begin{aligned} n \to \{\, (x,z) \to (y,w) \mid \exists\, \alpha_0, \alpha_1, k, f : {} & k \ge 1 \wedge y = x + f \wedge w = z + k \wedge {} \\ & 7\alpha_0 = -2 + n \wedge 5\alpha_1 = -k + x \wedge x \ge 6 k \,\} . \end{aligned} $$ Projecting out the final coordinates encoding the length of the paths, results in the exact transitive closure $$ R^+ = n \to \{\, x \to y \mid \exists \, \alpha_0, \alpha_1: 7\alpha_1 = -2 + n \wedge 6\alpha_0 \ge -x + y \wedge 5\alpha_0 \le -1 - x + y \,\} . $$ \end{example} The fact that we ignore some impure constraints clearly leads to a loss of accuracy. In some cases, some of this loss can be recovered by not considering the parameters in a special way. That is, instead of considering the set $$ \Delta = \diff R = \vec s \mapsto \{\, \vec \delta \in \Z^{d} \mid \exists \vec x \to \vec y \in R : \vec \delta = \vec y - \vec x \,\} $$ we consider the set $$ \Delta' = \diff R' = \{\, \vec \delta \in \Z^{n+d} \mid \exists (\vec s, \vec x) \to (\vec s, \vec y) \in R' : \vec \delta = (\vec s - \vec s, \vec y - \vec x) \,\} . $$ The first $n$ coordinates of every element in $\Delta'$ are zero. Projecting out these zero coordinates from $\Delta'$ is equivalent to projecting out the parameters in $\Delta$. The result is obviously a superset of $\Delta$, but all its constraints are of type \eqref{eq:transitive:non-parametric} and they can therefore all be used in the construction of $Q_i$. \begin{example} Consider the relation $$ % [n] -> { [x, y] -> [1 + x, 1 - n + y] | n >= 2 } R = n \to \{\, (x, y) \to (1 + x, 1 - n + y) \mid n \ge 2 \,\} . $$ We have $$ \diff R = n \to \{\, (1, 1 - n) \mid n \ge 2 \,\} $$ and so, by treating the parameters in a special way, we obtain the following approximation for $R^+$: $$ n \to \{\, (x, y) \to (x', y') \mid n \ge 2 \wedge y' \le 1 - n + y \wedge x' \ge 1 + x \,\} . $$ If we consider instead $$ R' = \{\, (n, x, y) \to (n, 1 + x, 1 - n + y) \mid n \ge 2 \,\} $$ then $$ \diff R' = \{\, (0, 1, y) \mid y \le -1 \,\} $$ and we obtain the approximation $$ n \to \{\, (x, y) \to (x', y') \mid n \ge 2 \wedge x' \ge 1 + x \wedge y' \le x + y - x' \,\} . $$ If we consider both $\diff R$ and $\diff R'$, then we obtain $$ n \to \{\, (x, y) \to (x', y') \mid n \ge 2 \wedge y' \le 1 - n + y \wedge x' \ge 1 + x \wedge y' \le x + y - x' \,\} . $$ Note, however, that this is not the most accurate affine approximation that can be obtained. That would be $$ n \to \{\, (x, y) \to (x', y') \mid y' \le 2 - n + x + y - x' \wedge n \ge 2 \wedge x' \ge 1 + x \,\} . $$ \end{example} \subsection{Checking Exactness} The approximation $T$ for the transitive closure $R^+$ can be obtained by projecting out the parameter $k$ from the approximation $K$ \eqref{eq:transitive:approx} of the power $R^k$. Since $K$ is an overapproximation of $R^k$, $T$ will also be an overapproximation of $R^+$. To check whether the results are exact, we need to consider two cases depending on whether $R$ is {\em cyclic}, where $R$ is defined to be cyclic if $R^+$ maps any element to itself, i.e., $R^+ \cap \identity \ne \emptyset$. If $R$ is acyclic, then the inductive definition of \eqref{eq:transitive:inductive} is equivalent to its completion, i.e., $$ R^+ = R \cup \left(R \circ R^+\right) $$ is a defining property. Since $T$ is known to be an overapproximation, we only need to check whether $$ T \subseteq R \cup \left(R \circ T\right) . $$ This is essentially Theorem~5 of \shortciteN{Kelly1996closure}. The only difference is that they only consider lexicographically forward relations, a special case of acyclic relations. If, on the other hand, $R$ is cyclic, then we have to resort to checking whether the approximation $K$ of the power is exact. Note that $T$ may be exact even if $K$ is not exact, so the check is sound, but incomplete. To check exactness of the power, we simply need to check \eqref{eq:transitive:power}. Since again $K$ is known to be an overapproximation, we only need to check whether $$ \begin{aligned} K'|_{y_{d+1} - x_{d+1} = 1} & \subseteq R' \\ K'|_{y_{d+1} - x_{d+1} \ge 2} & \subseteq R' \circ K'|_{y_{d+1} - x_{d+1} \ge 1} , \end{aligned} $$ where $R' = \{\, \vec x' \to \vec y' \mid \vec x \to \vec y \in R \wedge y_{d+1} - x_{d+1} = 1\,\}$, i.e., $R$ extended with path lengths equal to 1. All that remains is to explain how to check the cyclicity of $R$. Note that the exactness on the power is always sound, even in the acyclic case, so we only need to be careful that we find all cyclic cases. Now, if $R$ is cyclic, i.e., $R^+ \cap \identity \ne \emptyset$, then, since $T$ is an overapproximation of $R^+$, also $T \cap \identity \ne \emptyset$. This in turn means that $\Delta \, K'$ contains a point whose first $d$ coordinates are zero and whose final coordinate is positive. In the implementation we currently perform this test on $P'$ instead of $K'$. Note that if $R^+$ is acyclic and $T$ is not, then the approximation is clearly not exact and the approximation of the power $K$ will not be exact either. \subsection{Decomposing $R$ into strongly connected components} If the input relation $R$ is a union of several basic relations that can be partially ordered then the accuracy of the approximation may be improved by computing an approximation of each strongly connected components separately. For example, if $R = R_1 \cup R_2$ and $R_1 \circ R_2 = \emptyset$, then we know that any path that passes through $R_2$ cannot later pass through $R_1$, i.e., \begin{equation} \label{eq:transitive:components} R^+ = R_1^+ \cup R_2^+ \cup \left(R_2^+ \circ R_1^+\right) . \end{equation} We can therefore compute (approximations of) transitive closures of $R_1$ and $R_2$ separately. Note, however, that the condition $R_1 \circ R_2 = \emptyset$ is actually too strong. If $R_1 \circ R_2$ is a subset of $R_2 \circ R_1$ then we can reorder the segments in any path that moves through both $R_1$ and $R_2$ to first move through $R_1$ and then through $R_2$. This idea can be generalized to relations that are unions of more than two basic relations by constructing the strongly connected components in the graph with as vertices the basic relations and an edge between two basic relations $R_i$ and $R_j$ if $R_i$ needs to follow $R_j$ in some paths. That is, there is an edge from $R_i$ to $R_j$ iff \begin{equation} \label{eq:transitive:edge} R_i \circ R_j \not\subseteq R_j \circ R_i . \end{equation} The components can be obtained from the graph by applying Tarjan's algorithm \shortcite{Tarjan1972}. In practice, we compute the (extended) powers $K_i'$ of each component separately and then compose them as in \eqref{eq:transitive:decompose}. Note, however, that in this case the order in which we apply them is important and should correspond to a topological ordering of the strongly connected components. Simply applying Tarjan's algorithm will produce topologically sorted strongly connected components. The graph on which Tarjan's algorithm is applied is constructed on-the-fly. That is, whenever the algorithm checks if there is an edge between two vertices, we evaluate \eqref{eq:transitive:edge}. The exactness check is performed on each component separately. If the approximation turns out to be inexact for any of the components, then the entire result is marked inexact and the exactness check is skipped on the components that still need to be handled. It should be noted that \eqref{eq:transitive:components} is only valid for exact transitive closures. If overapproximations are computed in the right hand side, then the result will still be an overapproximation of the left hand side, but this result may not be transitively closed. If we only separate components based on the condition $R_i \circ R_j = \emptyset$, then there is no problem, as this condition will still hold on the computed approximations of the transitive closures. If, however, we have exploited \eqref{eq:transitive:edge} during the decomposition and if the result turns out not to be exact, then we check whether the result is transitively closed. If not, we recompute the transitive closure, skipping the decomposition. Note that testing for transitive closedness on the result may be fairly expensive, so we may want to make this check configurable. \begin{figure} \begin{center} \begin{tikzpicture}[x=0.5cm,y=0.5cm,>=stealth,shorten >=1pt] \foreach \x in {1,...,10}{ \foreach \y in {1,...,10}{ \draw[->] (\x,\y) -- (\x,\y+1); } } \foreach \x in {1,...,20}{ \foreach \y in {5,...,15}{ \draw[->] (\x,\y) -- (\x+1,\y); } } \end{tikzpicture} \end{center} \caption{The relation from \autoref{ex:closure4}} \label{f:closure4} \end{figure} \begin{example} \label{ex:closure4} Consider the relation in example {\tt closure4} that comes with the Omega calculator~\shortcite{Omega_calc}, $R = R_1 \cup R_2$, with $$ \begin{aligned} R_1 & = \{\, (x,y) \to (x,y+1) \mid 1 \le x,y \le 10 \,\} \\ R_2 & = \{\, (x,y) \to (x+1,y) \mid 1 \le x \le 20 \wedge 5 \le y \le 15 \,\} . \end{aligned} $$ This relation is shown graphically in \autoref{f:closure4}. We have $$ \begin{aligned} R_1 \circ R_2 &= \{\, (x,y) \to (x+1,y+1) \mid 1 \le x \le 9 \wedge 5 \le y \le 10 \,\} \\ R_2 \circ R_1 &= \{\, (x,y) \to (x+1,y+1) \mid 1 \le x \le 10 \wedge 4 \le y \le 10 \,\} . \end{aligned} $$ Clearly, $R_1 \circ R_2 \subseteq R_2 \circ R_1$ and so $$ \left( R_1 \cup R_2 \right)^+ = \left(R_2^+ \circ R_1^+\right) \cup R_1^+ \cup R_2^+ . $$ \end{example} \begin{figure} \newcounter{n} \newcounter{t1} \newcounter{t2} \newcounter{t3} \newcounter{t4} \begin{center} \begin{tikzpicture}[>=stealth,shorten >=1pt] \setcounter{n}{7} \foreach \i in {1,...,\value{n}}{ \foreach \j in {1,...,\value{n}}{ \setcounter{t1}{2 * \j - 4 - \i + 1} \setcounter{t2}{\value{n} - 3 - \i + 1} \setcounter{t3}{2 * \i - 1 - \j + 1} \setcounter{t4}{\value{n} - \j + 1} \ifnum\value{t1}>0\ifnum\value{t2}>0 \ifnum\value{t3}>0\ifnum\value{t4}>0 \draw[thick,->] (\i,\j) to[out=20] (\i+3,\j); \fi\fi\fi\fi \setcounter{t1}{2 * \j - 1 - \i + 1} \setcounter{t2}{\value{n} - \i + 1} \setcounter{t3}{2 * \i - 4 - \j + 1} \setcounter{t4}{\value{n} - 3 - \j + 1} \ifnum\value{t1}>0\ifnum\value{t2}>0 \ifnum\value{t3}>0\ifnum\value{t4}>0 \draw[thick,->] (\i,\j) to[in=-20,out=20] (\i,\j+3); \fi\fi\fi\fi \setcounter{t1}{2 * \j - 1 - \i + 1} \setcounter{t2}{\value{n} - 1 - \i + 1} \setcounter{t3}{2 * \i - 1 - \j + 1} \setcounter{t4}{\value{n} - 1 - \j + 1} \ifnum\value{t1}>0\ifnum\value{t2}>0 \ifnum\value{t3}>0\ifnum\value{t4}>0 \draw[thick,->] (\i,\j) to (\i+1,\j+1); \fi\fi\fi\fi } } \end{tikzpicture} \end{center} \caption{The relation from \autoref{ex:decomposition}} \label{f:decomposition} \end{figure} \begin{example} \label{ex:decomposition} Consider the relation on the right of \shortciteN[Figure~2]{Beletska2009}, reproduced in \autoref{f:decomposition}. The relation can be described as $R = R_1 \cup R_2 \cup R_3$, with $$ \begin{aligned} R_1 &= n \mapsto \{\, (i,j) \to (i+3,j) \mid i \le 2 j - 4 \wedge i \le n - 3 \wedge j \le 2 i - 1 \wedge j \le n \,\} \\ R_2 &= n \mapsto \{\, (i,j) \to (i,j+3) \mid i \le 2 j - 1 \wedge i \le n \wedge j \le 2 i - 4 \wedge j \le n - 3 \,\} \\ R_3 &= n \mapsto \{\, (i,j) \to (i+1,j+1) \mid i \le 2 j - 1 \wedge i \le n - 1 \wedge j \le 2 i - 1 \wedge j \le n - 1\,\} . \end{aligned} $$ The figure shows this relation for $n = 7$. Both $R_3 \circ R_1 \subseteq R_1 \circ R_3$ and $R_3 \circ R_2 \subseteq R_2 \circ R_3$, which the reader can verify using the {\tt iscc} calculator: \begin{verbatim} R1 := [n] -> { [i,j] -> [i+3,j] : i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and j <= n }; R2 := [n] -> { [i,j] -> [i,j+3] : i <= 2 j - 1 and i <= n and j <= 2 i - 4 and j <= n - 3 }; R3 := [n] -> { [i,j] -> [i+1,j+1] : i <= 2 j - 1 and i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }; (R1 . R3) - (R3 . R1); (R2 . R3) - (R3 . R2); \end{verbatim} $R_3$ can therefore be moved forward in any path. For the other two basic relations, we have both $R_2 \circ R_1 \not\subseteq R_1 \circ R_2$ and $R_1 \circ R_2 \not\subseteq R_2 \circ R_1$ and so $R_1$ and $R_2$ form a strongly connected component. By computing the power of $R_3$ and $R_1 \cup R_2$ separately and composing the results, the power of $R$ can be computed exactly using \eqref{eq:transitive:singleton}. As explained by \shortciteN{Beletska2009}, applying the same formula to $R$ directly, without a decomposition, would result in an overapproximation of the power. \end{example} \subsection{Partitioning the domains and ranges of $R$} The algorithm of \autoref{s:power} assumes that the input relation $R$ can be treated as a union of translations. This is a reasonable assumption if $R$ maps elements of a given abstract domain to the same domain. However, if $R$ is a union of relations that map between different domains, then this assumption no longer holds. In particular, when an entire dependence graph is encoded in a single relation, as is done by, e.g., \shortciteN[Section~6.1]{Barthou2000MSE}, then it does not make sense to look at differences between iterations of different domains. Now, arguably, a modified Floyd-Warshall algorithm should be applied to the dependence graph, as advocated by \shortciteN{Kelly1996closure}, with the transitive closure operation only being applied to relations from a given domain to itself. However, it is also possible to detect disjoint domains and ranges and to apply Floyd-Warshall internally. \LinesNumbered \begin{algorithm} \caption{The modified Floyd-Warshall algorithm of \protect\shortciteN{Kelly1996closure}} \label{a:Floyd} \SetKwInput{Input}{Input} \SetKwInput{Output}{Output} \Input{Relations $R_{pq}$, $0 \le p, q < n$} \Output{Updated relations $R_{pq}$ such that each relation $R_{pq}$ contains all indirect paths from $p$ to $q$ in the input graph} % \BlankLine \SetAlgoVlined \DontPrintSemicolon % \For{$r \in [0, n-1]$}{ $R_{rr} \coloneqq R_{rr}^+$ \nllabel{l:Floyd:closure}\; \For{$p \in [0, n-1]$}{ \For{$q \in [0, n-1]$}{ \If{$p \ne r$ or $q \ne r$}{ $R_{pq} \coloneqq R_{pq} \cup \left(R_{rq} \circ R_{pr}\right) \cup \left(R_{rq} \circ R_{rr} \circ R_{pr}\right)$ \nllabel{l:Floyd:update} } } } } \end{algorithm} Let the input relation $R$ be a union of $m$ basic relations $R_i$. Let $D_{2i}$ be the domains of $R_i$ and $D_{2i+1}$ the ranges of $R_i$. The first step is to group overlapping $D_j$ until a partition is obtained. If the resulting partition consists of a single part, then we continue with the algorithm of \autoref{s:power}. Otherwise, we apply Floyd-Warshall on the graph with as vertices the parts of the partition and as edges the $R_i$ attached to the appropriate pairs of vertices. In particular, let there be $n$ parts $P_k$ in the partition. We construct $n^2$ relations $$ R_{pq} \coloneqq \bigcup_{i \text{ s.t. } \domain R_i \subseteq P_p \wedge \range R_i \subseteq P_q} R_i , $$ apply \autoref{a:Floyd} and return the union of all resulting $R_{pq}$ as the transitive closure of $R$. Each iteration of the $r$-loop in \autoref{a:Floyd} updates all relations $R_{pq}$ to include paths that go from $p$ to $r$, possibly stay there for a while, and then go from $r$ to $q$. Note that paths that ``stay in $r$'' include all paths that pass through earlier vertices since $R_{rr}$ itself has been updated accordingly in previous iterations of the outer loop. In principle, it would be sufficient to use the $R_{pr}$ and $R_{rq}$ computed in the previous iteration of the $r$-loop in Line~\ref{l:Floyd:update}. However, from an implementation perspective, it is easier to allow either or both of these to have been updated in the same iteration of the $r$-loop. This may result in duplicate paths, but these can usually be removed by coalescing (\autoref{s:coalescing}) the result of the union in Line~\ref{l:Floyd:update}, which should be done in any case. The transitive closure in Line~\ref{l:Floyd:closure} is performed using a recursive call. This recursive call includes the partitioning step, but the resulting partition will usually be a singleton. The result of the recursive call will either be exact or an overapproximation. The final result of Floyd-Warshall is therefore also exact or an overapproximation. \begin{figure} \begin{center} \begin{tikzpicture}[x=1cm,y=1cm,>=stealth,shorten >=3pt] \foreach \x/\y in {0/0,1/1,3/2} { \fill (\x,\y) circle (2pt); } \foreach \x/\y in {0/1,2/2,3/3} { \draw (\x,\y) circle (2pt); } \draw[->] (0,0) -- (0,1); \draw[->] (0,1) -- (1,1); \draw[->] (2,2) -- (3,2); \draw[->] (3,2) -- (3,3); \draw[->,dashed] (2,2) -- (3,3); \draw[->,dotted] (0,0) -- (1,1); \end{tikzpicture} \end{center} \caption{The relation (solid arrows) on the right of Figure~1 of \protect\shortciteN{Beletska2009} and its transitive closure} \label{f:COCOA:1} \end{figure} \begin{example} Consider the relation on the right of Figure~1 of \shortciteN{Beletska2009}, reproduced in \autoref{f:COCOA:1}. This relation can be described as $$ \begin{aligned} \{\, (x, y) \to (x_2, y_2) \mid {} & (3y = 2x \wedge x_2 = x \wedge 3y_2 = 3 + 2x \wedge x \ge 0 \wedge x \le 3) \vee {} \\ & (x_2 = 1 + x \wedge y_2 = y \wedge x \ge 0 \wedge 3y \ge 2 + 2x \wedge x \le 2 \wedge 3y \le 3 + 2x) \,\} . \end{aligned} $$ Note that the domain of the upward relation overlaps with the range of the rightward relation and vice versa, but that the domain of neither relation overlaps with its own range or the domain of the other relation. The domains and ranges can therefore be partitioned into two parts, $P_0$ and $P_1$, shown as the white and black dots in \autoref{f:COCOA:1}, respectively. Initially, we have $$ \begin{aligned} R_{00} & = \emptyset \\ R_{01} & = \{\, (x, y) \to (x+1, y) \mid (x \ge 0 \wedge 3y \ge 2 + 2x \wedge x \le 2 \wedge 3y \le 3 + 2x) \,\} \\ R_{10} & = \{\, (x, y) \to (x_2, y_2) \mid (3y = 2x \wedge x_2 = x \wedge 3y_2 = 3 + 2x \wedge x \ge 0 \wedge x \le 3) \,\} \\ R_{11} & = \emptyset . \end{aligned} $$ In the first iteration, $R_{00}$ remains the same ($\emptyset^+ = \emptyset$). $R_{01}$ and $R_{10}$ are therefore also unaffected, but $R_{11}$ is updated to include $R_{01} \circ R_{10}$, i.e., the dashed arrow in the figure. This new $R_{11}$ is obviously transitively closed, so it is not changed in the second iteration and it does not have an effect on $R_{01}$ and $R_{10}$. However, $R_{00}$ is updated to include $R_{10} \circ R_{01}$, i.e., the dotted arrow in the figure. The transitive closure of the original relation is then equal to $R_{00} \cup R_{01} \cup R_{10} \cup R_{11}$. \end{example} \subsection{Incremental Computation} \label{s:incremental} In some cases it is possible and useful to compute the transitive closure of union of basic relations incrementally. In particular, if $R$ is a union of $m$ basic maps, $$ R = \bigcup_j R_j , $$ then we can pick some $R_i$ and compute the transitive closure of $R$ as \begin{equation} \label{eq:transitive:incremental} R^+ = R_i^+ \cup \left( \bigcup_{j \ne i} R_i^* \circ R_j \circ R_i^* \right)^+ . \end{equation} For this approach to be successful, it is crucial that each of the disjuncts in the argument of the second transitive closure in \eqref{eq:transitive:incremental} be representable as a single basic relation, i.e., without a union. If this condition holds, then by using \eqref{eq:transitive:incremental}, the number of disjuncts in the argument of the transitive closure can be reduced by one. Now, $R_i^* = R_i^+ \cup \identity$, but in some cases it is possible to relax the constraints of $R_i^+$ to include part of the identity relation, say on domain $D$. We will use the notation ${\cal C}(R_i,D) = R_i^+ \cup \identity_D$ to represent this relaxed version of $R^+$. \shortciteN{Kelly1996closure} use the notation $R_i^?$. ${\cal C}(R_i,D)$ can be computed by allowing $k$ to attain the value $0$ in \eqref{eq:transitive:Q} and by using $$ P \cap \left(D \to D\right) $$ instead of \eqref{eq:transitive:approx}. Typically, $D$ will be a strict superset of both $\domain R_i$ and $\range R_i$. We therefore need to check that domain and range of the transitive closure are part of ${\cal C}(R_i,D)$, i.e., the part that results from the paths of positive length ($k \ge 1$), are equal to the domain and range of $R_i$. If not, then the incremental approach cannot be applied for the given choice of $R_i$ and $D$. In order to be able to replace $R^*$ by ${\cal C}(R_i,D)$ in \eqref{eq:transitive:incremental}, $D$ should be chosen to include both $\domain R$ and $\range R$, i.e., such that $\identity_D \circ R_j \circ \identity_D = R_j$ for all $j\ne i$. \shortciteN{Kelly1996closure} say that they use $D = \domain R_i \cup \range R_i$, but presumably they mean that they use $D = \domain R \cup \range R$. Now, this expression of $D$ contains a union, so it not directly usable. \shortciteN{Kelly1996closure} do not explain how they avoid this union. Apparently, in their implementation, they are using the convex hull of $\domain R \cup \range R$ or at least an approximation of this convex hull. We use the simple hull (\autoref{s:simple hull}) of $\domain R \cup \range R$. It is also possible to use a domain $D$ that does {\em not\/} include $\domain R \cup \range R$, but then we have to compose with ${\cal C}(R_i,D)$ more selectively. In particular, if we have \begin{equation} \label{eq:transitive:right} \text{for each $j \ne i$ either } \domain R_j \subseteq D \text{ or } \domain R_j \cap \range R_i = \emptyset \end{equation} and, similarly, \begin{equation} \label{eq:transitive:left} \text{for each $j \ne i$ either } \range R_j \subseteq D \text{ or } \range R_j \cap \domain R_i = \emptyset \end{equation} then we can refine \eqref{eq:transitive:incremental} to $$ R_i^+ \cup \left( \left( \bigcup_{\shortstack{$\scriptstyle\domain R_j \subseteq D $\\ $\scriptstyle\range R_j \subseteq D$}} {\cal C} \circ R_j \circ {\cal C} \right) \cup \left( \bigcup_{\shortstack{$\scriptstyle\domain R_j \cap \range R_i = \emptyset$\\ $\scriptstyle\range R_j \subseteq D$}} \!\!\!\!\! {\cal C} \circ R_j \right) \cup \left( \bigcup_{\shortstack{$\scriptstyle\domain R_j \subseteq D $\\ $\scriptstyle\range R_j \cap \domain R_i = \emptyset$}} \!\!\!\!\! R_j \circ {\cal C} \right) \cup \left( \bigcup_{\shortstack{$\scriptstyle\domain R_j \cap \range R_i = \emptyset$\\ $\scriptstyle\range R_j \cap \domain R_i = \emptyset$}} \!\!\!\!\! R_j \right) \right)^+ . $$ If only property~\eqref{eq:transitive:right} holds, we can use $$ R_i^+ \cup \left( \left( R_i^+ \cup \identity \right) \circ \left( \left( \bigcup_{\shortstack{$\scriptstyle\domain R_j \subseteq D $}} R_j \circ {\cal C} \right) \cup \left( \bigcup_{\shortstack{$\scriptstyle\domain R_j \cap \range R_i = \emptyset$}} \!\!\!\!\! R_j \right) \right)^+ \right) , $$ while if only property~\eqref{eq:transitive:left} holds, we can use $$ R_i^+ \cup \left( \left( \left( \bigcup_{\shortstack{$\scriptstyle\range R_j \subseteq D $}} {\cal C} \circ R_j \right) \cup \left( \bigcup_{\shortstack{$\scriptstyle\range R_j \cap \domain R_i = \emptyset$}} \!\!\!\!\! R_j \right) \right)^+ \circ \left( R_i^+ \cup \identity \right) \right) . $$ It should be noted that if we want the result of the incremental approach to be transitively closed, then we can only apply it if all of the transitive closure operations involved are exact. If, say, the second transitive closure in \eqref{eq:transitive:incremental} contains extra elements, then the result does not necessarily contain the composition of these extra elements with powers of $R_i$. \subsection{An {\tt Omega}-like implementation} While the main algorithm of \shortciteN{Kelly1996closure} is designed to compute and underapproximation of the transitive closure, the authors mention that they could also compute overapproximations. In this section, we describe our implementation of an algorithm that is based on their ideas. Note that the {\tt Omega} library computes underapproximations \shortcite[Section 6.4]{Omega_lib}. The main tool is Equation~(2) of \shortciteN{Kelly1996closure}. The input relation $R$ is first overapproximated by a ``d-form'' relation $$ \{\, \vec i \to \vec j \mid \exists \vec \alpha : \vec L \le \vec j - \vec i \le \vec U \wedge (\forall p : j_p - i_p = M_p \alpha_p) \,\} , $$ where $p$ ranges over the dimensions and $\vec L$, $\vec U$ and $\vec M$ are constant integer vectors. The elements of $\vec U$ may be $\infty$, meaning that there is no upper bound corresponding to that element, and similarly for $\vec L$. Such an overapproximation can be obtained by computing strides, lower and upper bounds on the difference set $\Delta \, R$. The transitive closure of such a ``d-form'' relation is \begin{equation} \label{eq:omega} \{\, \vec i \to \vec j \mid \exists \vec \alpha, k : k \ge 1 \wedge k \, \vec L \le \vec j - \vec i \le k \, \vec U \wedge (\forall p : j_p - i_p = M_p \alpha_p) \,\} . \end{equation} The domain and range of this transitive closure are then intersected with those of the input relation. This is a special case of the algorithm in \autoref{s:power}. In their algorithm for computing lower bounds, the authors use the above algorithm as a substep on the disjuncts in the relation. At the end, they say \begin{quote} If an upper bound is required, it can be calculated in a manner similar to that of a single conjunct [sic] relation. \end{quote} Presumably, the authors mean that a ``d-form'' approximation of the whole input relation should be used. However, the accuracy can be improved by also trying to apply the incremental technique from the same paper, which is explained in more detail in \autoref{s:incremental}. In this case, ${\cal C}(R_i,D)$ can be obtained by allowing the value zero for $k$ in \eqref{eq:omega}, i.e., by computing $$ \{\, \vec i \to \vec j \mid \exists \vec \alpha, k : k \ge 0 \wedge k \, \vec L \le \vec j - \vec i \le k \, \vec U \wedge (\forall p : j_p - i_p = M_p \alpha_p) \,\} . $$ In our implementation we take as $D$ the simple hull (\autoref{s:simple hull}) of $\domain R \cup \range R$. To determine whether it is safe to use ${\cal C}(R_i,D)$, we check the following conditions, as proposed by \shortciteN{Kelly1996closure}: ${\cal C}(R_i,D) - R_i^+$ is not a union and for each $j \ne i$ the condition $$ \left({\cal C}(R_i,D) - R_i^+\right) \circ R_j \circ \left({\cal C}(R_i,D) - R_i^+\right) = R_j $$ holds. cloog-0.18.2/isl/doc/SubmittingPatches0000664000175000017500000000330312254313240014537 00000000000000[Mostly copied from git's SubmittingPatches] Commits: - make commits of logical units - check for unnecessary whitespace with "git diff --check" before committing - do not check in commented out code or unneeded files - the first line of the commit message should be a short description and should skip the full stop - the body should provide a meaningful commit message, which includes motivation for the change, and contrasts its implementation with previous behaviour - if you want your work included in isl.git, add a "Signed-off-by: Your Name " line to the commit message (or just use the option "-s" when committing) to confirm that you agree to the Developer's Certificate of Origin - make sure that you have tests for the bug you are fixing - make sure that the test suite passes after your commit Patch: - use "git format-patch -M" to create the patch - do not PGP sign your patch - do not attach your patch, but read in the mail body, unless you cannot teach your mailer to leave the formatting of the patch alone. - be careful doing cut & paste into your mailer, not to corrupt whitespaces. - provide additional information (which is unsuitable for the commit message) between the "---" and the diffstat - if you change, add, or remove a command line option or make some other user interface change, the associated documentation should be updated as well. - if your name is not writable in ASCII, make sure that you send off a message in the correct encoding. - send the patch to the development mailing list (isl-development@googlegroups.com). If you use git-send-email(1), please test it first by sending email to yourself. cloog-0.18.2/isl/polytope_scan.c0000664000175000017500000000445512254313240013446 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include "isl_equalities.h" #include #include "isl_scan.h" #include /* The input of this program is the same as that of the "polytope_scan" * program from the barvinok distribution. * * Constraints of set is PolyLib format. * * The input set is assumed to be bounded. */ struct scan_samples { struct isl_scan_callback callback; struct isl_mat *samples; }; static int scan_samples_add_sample(struct isl_scan_callback *cb, __isl_take isl_vec *sample) { struct scan_samples *ss = (struct scan_samples *)cb; ss->samples = isl_mat_extend(ss->samples, ss->samples->n_row + 1, ss->samples->n_col); if (!ss->samples) goto error; isl_seq_cpy(ss->samples->row[ss->samples->n_row - 1], sample->el, sample->size); isl_vec_free(sample); return 0; error: isl_vec_free(sample); return -1; } static struct isl_mat *isl_basic_set_scan_samples(struct isl_basic_set *bset) { isl_ctx *ctx; unsigned dim; struct scan_samples ss; ctx = isl_basic_set_get_ctx(bset); dim = isl_basic_set_total_dim(bset); ss.callback.add = scan_samples_add_sample; ss.samples = isl_mat_alloc(ctx, 0, 1 + dim); if (!ss.samples) goto error; if (isl_basic_set_scan(bset, &ss.callback) < 0) { isl_mat_free(ss.samples); return NULL; } return ss.samples; error: isl_basic_set_free(bset); return NULL; } static struct isl_mat *isl_basic_set_samples(struct isl_basic_set *bset) { struct isl_mat *T; struct isl_mat *samples; if (!bset) return NULL; if (bset->n_eq == 0) return isl_basic_set_scan_samples(bset); bset = isl_basic_set_remove_equalities(bset, &T, NULL); samples = isl_basic_set_scan_samples(bset); return isl_mat_product(samples, isl_mat_transpose(T)); } int main(int argc, char **argv) { struct isl_ctx *ctx = isl_ctx_alloc(); struct isl_basic_set *bset; struct isl_mat *samples; bset = isl_basic_set_read_from_file(ctx, stdin); samples = isl_basic_set_samples(bset); isl_mat_print_internal(samples, stdout, 0); isl_mat_free(samples); isl_ctx_free(ctx); return 0; } cloog-0.18.2/isl/config.sub0000755000175000017500000010541212254313255012405 00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2013 Free Software Foundation, Inc. timestamp='2013-10-01' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # Please send patches with a ChangeLog entry to config-patches@gnu.org. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright 1992-2013 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \ linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \ knetbsd*-gnu* | netbsd*-gnu* | \ kopensolaris*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; android-linux) os=-linux-android basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray | -microblaze*) os= basic_machine=$1 ;; -bluegene*) os=-cnk ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*178) os=-lynxos178 ;; -lynx*5) os=-lynxos5 ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | aarch64 | aarch64_be \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arceb \ | arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \ | avr | avr32 \ | be32 | be64 \ | bfin \ | c4x | c8051 | clipper \ | d10v | d30v | dlx | dsp16xx \ | epiphany \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | hexagon \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | k1om \ | le32 | le64 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | microblazeel | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipsr5900 | mipsr5900el \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nds32 | nds32le | nds32be \ | nios | nios2 | nios2eb | nios2el \ | ns16k | ns32k \ | open8 \ | or1k | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle \ | pyramid \ | rl78 | rx \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu \ | tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \ | ubicom32 \ | v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \ | we32k \ | x86 | xc16x | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; c54x) basic_machine=tic54x-unknown ;; c55x) basic_machine=tic55x-unknown ;; c6x) basic_machine=tic6x-unknown ;; m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip) basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; strongarm | thumb | xscale) basic_machine=arm-unknown ;; xgate) basic_machine=$basic_machine-unknown os=-none ;; xscaleeb) basic_machine=armeb-unknown ;; xscaleel) basic_machine=armel-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | aarch64-* | aarch64_be-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | be32-* | be64-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* \ | c8051-* | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | hexagon-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | k1om-* \ | le32-* | le64-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | microblaze-* | microblazeel-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipsr5900-* | mipsr5900el-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nds32-* | nds32le-* | nds32be-* \ | nios-* | nios2-* | nios2eb-* | nios2el-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | open8-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \ | pyramid-* \ | rl78-* | romp-* | rs6000-* | rx-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx?-* \ | tahoe-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tile*-* \ | tron-* \ | ubicom32-* \ | v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \ | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; bluegene*) basic_machine=powerpc-ibm os=-cnk ;; c54x-*) basic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c55x-*) basic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c6x-*) basic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16 | cr16-*) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; microblaze*) basic_machine=microblaze-xilinx ;; mingw64) basic_machine=x86_64-pc os=-mingw64 ;; mingw32) basic_machine=i686-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; msys) basic_machine=i686-pc os=-msys ;; mvs) basic_machine=i370-ibm os=-mvs ;; nacl) basic_machine=le32-unknown os=-nacl ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; neo-tandem) basic_machine=neo-tandem ;; nse-tandem) basic_machine=nse-tandem ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc | ppcbe) basic_machine=powerpc-unknown ;; ppc-* | ppcbe-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos | rdos64) basic_machine=x86_64-pc os=-rdos ;; rdos32) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; strongarm-* | thumb-*) basic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'` ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tile*) basic_machine=$basic_machine-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; xscale-* | xscalee[bl]-*) basic_machine=`echo $basic_machine | sed 's/^xscale/arm/'` ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -auroraux) os=-auroraux ;; -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \ | -sym* | -kopensolaris* | -plan9* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -bitrig* | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* \ | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \ | -linux-newlib* | -linux-musl* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -nacl*) ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; c8051-*) os=-elf ;; hexagon-*) os=-elf ;; tic54x-*) os=-coff ;; tic55x-*) os=-coff ;; tic6x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or1k-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -cnk*|-aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: cloog-0.18.2/isl/isl_lp_no_piplib.c0000664000175000017500000000075712254313240014105 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include "isl_lp_piplib.h" enum isl_lp_result isl_pip_solve_lp(struct isl_basic_map *bmap, int maximize, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) { return isl_lp_error; } cloog-0.18.2/isl/pip_test.sh.in0000775000175000017500000000114712254313240013211 00000000000000#!/bin/sh EXEEXT=@EXEEXT@ PIP_TESTS="\ boulet.pip \ brisebarre.pip \ cg1.pip \ esced.pip \ ex2.pip \ ex.pip \ fimmel.pip \ max.pip \ negative.pip \ seghir-vd.pip \ small.pip \ sor1d.pip \ square.pip \ sven.pip \ tobi.pip" for i in $PIP_TESTS; do echo $i; ./isl_pip$EXEEXT --format=set --context=gbr -T < $srcdir/test_inputs/$i || exit ./isl_pip$EXEEXT --format=set --context=lexmin -T < $srcdir/test_inputs/$i || exit ./isl_pip$EXEEXT --format=affine --context=gbr -T < $srcdir/test_inputs/$i || exit ./isl_pip$EXEEXT --format=affine --context=lexmin -T < $srcdir/test_inputs/$i || exit done cloog-0.18.2/isl/polyhedron_detect_equalities.c0000664000175000017500000000113112254313240016513 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include int main(int argc, char **argv) { struct isl_ctx *ctx = isl_ctx_alloc(); struct isl_basic_set *bset; bset = isl_basic_set_read_from_file(ctx, stdin); bset = isl_basic_set_detect_equalities(bset); isl_basic_set_print(bset, stdout, 0, "", "", ISL_FORMAT_POLYLIB); isl_basic_set_free(bset); isl_ctx_free(ctx); return 0; } cloog-0.18.2/isl/ltmain.sh0000644000175000017500000115505212254313255012250 00000000000000#! /bin/sh # libtool (GNU libtool) 2.4.2.418 # Provide generalized library-building support services. # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996-2013 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # GNU Libtool is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program. If not, see . PROGRAM=libtool PACKAGE=libtool VERSION=2.4.2.418 package_revision=2.4.2.418 ## ------ ## ## Usage. ## ## ------ ## # Run './libtool --help' for help with using this script from the # command line. ## ------------------------------- ## ## User overridable command paths. ## ## ------------------------------- ## # After configure completes, it has a better idea of some of the # shell tools we need than the defaults used by the functions shared # with bootstrap, so set those here where they can still be over- # ridden by the user, but otherwise take precedence. : ${AUTOCONF="autoconf"} : ${AUTOMAKE="automake"} ## -------------------------- ## ## Source external libraries. ## ## -------------------------- ## # Much of our low-level functionality needs to be sourced from external # libraries, which are installed to $pkgauxdir. # Set a version string for this script. scriptversion=2013-08-23.20; # UTC # General shell script boiler plate, and helper functions. # Written by Gary V. Vaughan, 2004 # Copyright (C) 2004-2013 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # As a special exception to the GNU General Public License, if you distribute # this file as part of a program or library that is built using GNU Libtool, # you may include this file under the same distribution terms that you use # for the rest of that program. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNES FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # Please report bugs or propose patches to gary@gnu.org. ## ------ ## ## Usage. ## ## ------ ## # Evaluate this file near the top of your script to gain access to # the functions and variables defined here: # # . `echo "$0" | ${SED-sed} 's|[^/]*$||'`/build-aux/funclib.sh # # If you need to override any of the default environment variable # settings, do that before evaluating this file. ## -------------------- ## ## Shell normalisation. ## ## -------------------- ## # Some shells need a little help to be as Bourne compatible as possible. # Before doing anything else, make sure all that help has been provided! DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix ;; esac fi # NLS nuisances: We save the old values in case they are required later. _G_user_locale= _G_safe_locale= for _G_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test set = \"\${$_G_var+set}\"; then save_$_G_var=\$$_G_var $_G_var=C export $_G_var _G_user_locale=\"$_G_var=\\\$save_\$_G_var; \$_G_user_locale\" _G_safe_locale=\"$_G_var=C; \$_G_safe_locale\" fi" done # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Make sure IFS has a sensible default sp=' ' nl=' ' IFS="$sp $nl" # There are still modern systems that have problems with 'echo' mis- # handling backslashes, among others, so make sure $bs_echo is set to a # command that correctly interprets backslashes. # (this code from Autoconf 2.68) # Printing a long string crashes Solaris 7 /usr/bin/printf. bs_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' bs_echo=$bs_echo$bs_echo$bs_echo$bs_echo$bs_echo bs_echo=$bs_echo$bs_echo$bs_echo$bs_echo$bs_echo$bs_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $bs_echo`" = "X$bs_echo") 2>/dev/null; then bs_echo='print -r --' bs_echo_n='print -rn --' elif (test "X`printf %s $bs_echo`" = "X$bs_echo") 2>/dev/null; then bs_echo='printf %s\n' bs_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $bs_echo) 2>/dev/null`" = "X-n $bs_echo"; then bs_echo_body='eval /usr/ucb/echo -n "$1$nl"' bs_echo_n='/usr/ucb/echo -n' else bs_echo_body='eval expr "X$1" : "X\\(.*\\)"' bs_echo_n_body='eval arg=$1; case $arg in #( *"$nl"*) expr "X$arg" : "X\\(.*\\)$nl"; arg=`expr "X$arg" : ".*$nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$nl" ' export bs_echo_n_body bs_echo_n='sh -c $bs_echo_n_body bs_echo' fi export bs_echo_body bs_echo='sh -c $bs_echo_body bs_echo' fi ## ------------------------------- ## ## User overridable command paths. ## ## ------------------------------- ## # All uppercase variable names are used for environment variables. These # variables can be overridden by the user before calling a script that # uses them if a suitable command of that name is not already available # in the command search PATH. : ${CP="cp -f"} : ${ECHO="$bs_echo"} : ${EGREP="grep -E"} : ${FGREP="grep -F"} : ${GREP="grep"} : ${LN_S="ln -s"} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SED="sed"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} ## -------------------- ## ## Useful sed snippets. ## ## -------------------- ## sed_dirname='s|/[^/]*$||' sed_basename='s|^.*/||' # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='s|\([`"$\\]\)|\\\1|g' # Same as above, but do not quote variable references. sed_double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution that turns a string into a regex matching for the # string literally. sed_make_literal_regex='s|[].[^$\\*\/]|\\&|g' # Sed substitution that converts a w32 file name or path # that contains forward slashes, into one that contains # (escaped) backslashes. A very naive implementation. sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Re-'\' parameter expansions in output of sed_double_quote_subst that # were '\'-ed in input to the same. If an odd number of '\' preceded a # '$' in input to sed_double_quote_subst, that '$' was protected from # expansion. Since each input '\' is now two '\'s, look for any number # of runs of four '\'s followed by two '\'s and then a '$'. '\' that '$'. _G_bs='\\' _G_bs2='\\\\' _G_bs4='\\\\\\\\' _G_dollar='\$' sed_double_backslash="\ s/$_G_bs4/&\\ /g s/^$_G_bs2$_G_dollar/$_G_bs&/ s/\\([^$_G_bs]\\)$_G_bs2$_G_dollar/\\1$_G_bs2$_G_bs$_G_dollar/g s/\n//g" ## ----------------- ## ## Global variables. ## ## ----------------- ## # Except for the global variables explicitly listed below, the following # functions in the '^func_' namespace, and the '^require_' namespace # variables initialised in the 'Resource management' section, sourcing # this file will not pollute your global namespace with anything # else. There's no portable way to scope variables in Bourne shell # though, so actually running these functions will sometimes place # results into a variable named after the function, and often use # temporary variables in the '^_G_' namespace. If you are careful to # avoid using those namespaces casually in your sourcing script, things # should continue to work as you expect. And, of course, you can freely # overwrite any of the functions or variables defined here before # calling anything to customize them. EXIT_SUCCESS=0 EXIT_FAILURE=1 EXIT_MISMATCH=63 # $? = 63 is used to indicate version mismatch to missing. EXIT_SKIP=77 # $? = 77 is used to indicate a skipped test to automake. # Allow overriding, eg assuming that you follow the convention of # putting '$debug_cmd' at the start of all your functions, you can get # bash to show function call trace with: # # debug_cmd='eval echo "${FUNCNAME[0]} $*" >&2' bash your-script-name debug_cmd=${debug_cmd-":"} exit_cmd=: # By convention, finish your script with: # # exit $exit_status # # so that you can set exit_status to non-zero if you want to indicate # something went wrong during execution without actually bailing out at # the point of failure. exit_status=$EXIT_SUCCESS # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath=$0 # The name of this program. progname=`$bs_echo "$progpath" |$SED "$sed_basename"` # Make sure we have an absolute progpath for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=`$bs_echo "$progpath" |$SED "$sed_dirname"` progdir=`cd "$progdir" && pwd` progpath=$progdir/$progname ;; *) _G_IFS=$IFS IFS=${PATH_SEPARATOR-:} for progdir in $PATH; do IFS=$_G_IFS test -x "$progdir/$progname" && break done IFS=$_G_IFS test -n "$progdir" || progdir=`pwd` progpath=$progdir/$progname ;; esac ## ----------------- ## ## Standard options. ## ## ----------------- ## # The following options affect the operation of the functions defined # below, and should be set appropriately depending on run-time para- # meters passed on the command line. opt_dry_run=false opt_quiet=false opt_verbose=false # Categories 'all' and 'none' are always available. Append any others # you will pass as the first argument to func_warning from your own # code. warning_categories= # By default, display warnings according to 'opt_warning_types'. Set # 'warning_func' to ':' to elide all warnings, or func_fatal_error to # treat the next displayed warning as a fatal error. warning_func=func_warn_and_continue # Set to 'all' to display all warnings, 'none' to suppress all # warnings, or a space delimited list of some subset of # 'warning_categories' to display only the listed warnings. opt_warning_types=all ## -------------------- ## ## Resource management. ## ## -------------------- ## # This section contains definitions for functions that each ensure a # particular resource (a file, or a non-empty configuration variable for # example) is available, and if appropriate to extract default values # from pertinent package files. Call them using their associated # 'require_*' variable to ensure that they are executed, at most, once. # # It's entirely deliberate that calling these functions can set # variables that don't obey the namespace limitations obeyed by the rest # of this file, in order that that they be as useful as possible to # callers. # require_term_colors # ------------------- # Allow display of bold text on terminals that support it. require_term_colors=func_require_term_colors func_require_term_colors () { $debug_cmd test -t 1 && { # COLORTERM and USE_ANSI_COLORS environment variables take # precedence, because most terminfo databases neglect to describe # whether color sequences are supported. test -n "${COLORTERM+set}" && : ${USE_ANSI_COLORS="1"} if test 1 = "$USE_ANSI_COLORS"; then # Standard ANSI escape sequences tc_reset='' tc_bold=''; tc_standout='' tc_red=''; tc_green='' tc_blue=''; tc_cyan='' else # Otherwise trust the terminfo database after all. test -n "`tput sgr0 2>/dev/null`" && { tc_reset=`tput sgr0` test -n "`tput bold 2>/dev/null`" && tc_bold=`tput bold` tc_standout=$tc_bold test -n "`tput smso 2>/dev/null`" && tc_standout=`tput smso` test -n "`tput setaf 1 2>/dev/null`" && tc_red=`tput setaf 1` test -n "`tput setaf 2 2>/dev/null`" && tc_green=`tput setaf 2` test -n "`tput setaf 4 2>/dev/null`" && tc_blue=`tput setaf 4` test -n "`tput setaf 5 2>/dev/null`" && tc_cyan=`tput setaf 5` } fi } require_term_colors=: } ## ----------------- ## ## Function library. ## ## ----------------- ## # This section contains a variety of useful functions to call in your # scripts. Take note of the portable wrappers for features provided by # some modern shells, which will fall back to slower equivalents on # less featureful shells. # func_append VAR VALUE # --------------------- # Append VALUE onto the existing contents of VAR. # We should try to minimise forks, especially on Windows where they are # unreasonably slow, so skip the feature probes when bash or zsh are # being used: if test set = "${BASH_VERSION+set}${ZSH_VERSION+set}"; then : ${_G_HAVE_ARITH_OP="yes"} : ${_G_HAVE_XSI_OPS="yes"} # The += operator was introduced in bash 3.1 case $BASH_VERSION in [12].* | 3.0 | 3.0*) ;; *) : ${_G_HAVE_PLUSEQ_OP="yes"} ;; esac fi # _G_HAVE_PLUSEQ_OP # Can be empty, in which case the shell is probed, "yes" if += is # useable or anything else if it does not work. test -z "$_G_HAVE_PLUSEQ_OP" \ && (eval 'x=a; x+=" b"; test "a b" = "$x"') 2>/dev/null \ && _G_HAVE_PLUSEQ_OP=yes if test yes = "$_G_HAVE_PLUSEQ_OP" then # This is an XSI compatible shell, allowing a faster implementation... eval 'func_append () { $debug_cmd eval "$1+=\$2" }' else # ...otherwise fall back to using expr, which is often a shell builtin. func_append () { $debug_cmd eval "$1=\$$1\$2" } fi # func_append_quoted VAR VALUE # ---------------------------- # Quote VALUE and append to the end of shell variable VAR, separated # by a space. if test yes = "$_G_HAVE_PLUSEQ_OP"; then eval 'func_append_quoted () { $debug_cmd func_quote_for_eval "$2" eval "$1+=\\ \$func_quote_for_eval_result" }' else func_append_quoted () { $debug_cmd func_quote_for_eval "$2" eval "$1=\$$1\\ \$func_quote_for_eval_result" } fi # func_append_uniq VAR VALUE # -------------------------- # Append unique VALUE onto the existing contents of VAR, assuming # entries are delimited by the first character of VALUE. For example: # # func_append_uniq options " --another-option option-argument" # # will only append to $options if " --another-option option-argument " # is not already present somewhere in $options already (note spaces at # each end implied by leading space in second argument). func_append_uniq () { $debug_cmd eval _G_current_value='`$bs_echo $'$1'`' _G_delim=`expr "$2" : '\(.\)'` case $_G_delim$_G_current_value$_G_delim in *"$2$_G_delim"*) ;; *) func_append "$@" ;; esac } # func_arith TERM... # ------------------ # Set func_arith_result to the result of evaluating TERMs. test -z "$_G_HAVE_ARITH_OP" \ && (eval 'test 2 = $(( 1 + 1 ))') 2>/dev/null \ && _G_HAVE_ARITH_OP=yes if test yes = "$_G_HAVE_ARITH_OP"; then eval 'func_arith () { $debug_cmd func_arith_result=$(( $* )) }' else func_arith () { $debug_cmd func_arith_result=`expr "$@"` } fi # func_basename FILE # ------------------ # Set func_basename_result to FILE with everything up to and including # the last / stripped. if test yes = "$_G_HAVE_XSI_OPS"; then # If this shell supports suffix pattern removal, then use it to avoid # forking. Hide the definitions single quotes in case the shell chokes # on unsupported syntax... _b='func_basename_result=${1##*/}' _d='case $1 in */*) func_dirname_result=${1%/*}$2 ;; * ) func_dirname_result=$3 ;; esac' else # ...otherwise fall back to using sed. _b='func_basename_result=`$ECHO "$1" |$SED "$sed_basename"`' _d='func_dirname_result=`$ECHO "$1" |$SED "$sed_dirname"` if test "X$func_dirname_result" = "X$1"; then func_dirname_result=$3 else func_append func_dirname_result "$2" fi' fi eval 'func_basename () { $debug_cmd '"$_b"' }' # func_dirname FILE APPEND NONDIR_REPLACEMENT # ------------------------------------------- # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. eval 'func_dirname () { $debug_cmd '"$_d"' }' # func_dirname_and_basename FILE APPEND NONDIR_REPLACEMENT # -------------------------------------------------------- # Perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # For efficiency, we do not delegate to the functions above but instead # duplicate the functionality here. eval 'func_dirname_and_basename () { $debug_cmd '"$_b"' '"$_d"' }' # func_echo ARG... # ---------------- # Echo program name prefixed message. func_echo () { $debug_cmd _G_message=$* func_echo_IFS=$IFS IFS=$nl for _G_line in $_G_message; do IFS=$func_echo_IFS $bs_echo "$progname: $_G_line" done IFS=$func_echo_IFS } # func_echo_all ARG... # -------------------- # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } # func_echo_infix_1 INFIX ARG... # ------------------------------ # Echo program name, followed by INFIX on the first line, with any # additional lines not showing INFIX. func_echo_infix_1 () { $debug_cmd $require_term_colors _G_infix=$1; shift _G_indent=$_G_infix _G_prefix="$progname: $_G_infix: " _G_message=$* # Strip color escape sequences before counting printable length for _G_tc in "$tc_reset" "$tc_bold" "$tc_standout" "$tc_red" "$tc_green" "$tc_blue" "$tc_cyan" do test -n "$_G_tc" && { _G_esc_tc=`$bs_echo "$_G_tc" | sed "$sed_make_literal_regex"` _G_indent=`$bs_echo "$_G_indent" | sed "s|$_G_esc_tc||g"` } done _G_indent="$progname: "`echo "$_G_indent" | sed 's|.| |g'`" " ## exclude from sc_prohibit_nested_quotes func_echo_infix_1_IFS=$IFS IFS=$nl for _G_line in $_G_message; do IFS=$func_echo_infix_1_IFS $bs_echo "$_G_prefix$tc_bold$_G_line$tc_reset" >&2 _G_prefix=$_G_indent done IFS=$func_echo_infix_1_IFS } # func_error ARG... # ----------------- # Echo program name prefixed message to standard error. func_error () { $debug_cmd $require_term_colors func_echo_infix_1 " $tc_standout${tc_red}error$tc_reset" "$*" >&2 } # func_fatal_error ARG... # ----------------------- # Echo program name prefixed message to standard error, and exit. func_fatal_error () { $debug_cmd func_error "$*" exit $EXIT_FAILURE } # func_grep EXPRESSION FILENAME # ----------------------------- # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $debug_cmd $GREP "$1" "$2" >/dev/null 2>&1 } # func_len STRING # --------------- # Set func_len_result to the length of STRING. STRING may not # start with a hyphen. test -z "$_G_HAVE_XSI_OPS" \ && (eval 'x=a/b/c; test 5aa/bb/cc = "${#x}${x%%/*}${x%/*}${x#*/}${x##*/}"') 2>/dev/null \ && _G_HAVE_XSI_OPS=yes if test yes = "$_G_HAVE_XSI_OPS"; then eval 'func_len () { $debug_cmd func_len_result=${#1} }' else func_len () { $debug_cmd func_len_result=`expr "$1" : ".*" 2>/dev/null || echo $max_cmd_len` } fi # func_mkdir_p DIRECTORY-PATH # --------------------------- # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { $debug_cmd _G_directory_path=$1 _G_dir_list= if test -n "$_G_directory_path" && test : != "$opt_dry_run"; then # Protect directory names starting with '-' case $_G_directory_path in -*) _G_directory_path=./$_G_directory_path ;; esac # While some portion of DIR does not yet exist... while test ! -d "$_G_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. _G_dir_list=$_G_directory_path:$_G_dir_list # If the last portion added has no slash in it, the list is done case $_G_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop _G_directory_path=`$ECHO "$_G_directory_path" | $SED -e "$sed_dirname"` done _G_dir_list=`$ECHO "$_G_dir_list" | $SED 's|:*$||'` func_mkdir_p_IFS=$IFS; IFS=: for _G_dir in $_G_dir_list; do IFS=$func_mkdir_p_IFS # mkdir can fail with a 'File exist' error if two processes # try to create one of the directories concurrently. Don't # stop in that case! $MKDIR "$_G_dir" 2>/dev/null || : done IFS=$func_mkdir_p_IFS # Bail out if we (or some other process) failed to create a directory. test -d "$_G_directory_path" || \ func_fatal_error "Failed to create '$1'" fi } # func_mktempdir [BASENAME] # ------------------------- # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, BASENAME is the basename for that directory. func_mktempdir () { $debug_cmd _G_template=${TMPDIR-/tmp}/${1-$progname} if test : = "$opt_dry_run"; then # Return a directory name, but don't create it in dry-run mode _G_tmpdir=$_G_template-$$ else # If mktemp works, use that first and foremost _G_tmpdir=`mktemp -d "$_G_template-XXXXXXXX" 2>/dev/null` if test ! -d "$_G_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race _G_tmpdir=$_G_template-${RANDOM-0}$$ func_mktempdir_umask=`umask` umask 0077 $MKDIR "$_G_tmpdir" umask $func_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$_G_tmpdir" || \ func_fatal_error "cannot create temporary directory '$_G_tmpdir'" fi $ECHO "$_G_tmpdir" } # func_normal_abspath PATH # ------------------------ # Remove doubled-up and trailing slashes, "." path components, # and cancel out any ".." path components in PATH after making # it an absolute path. func_normal_abspath () { $debug_cmd # These SED scripts presuppose an absolute path with a trailing slash. _G_pathcar='s|^/\([^/]*\).*$|\1|' _G_pathcdr='s|^/[^/]*||' _G_removedotparts=':dotsl s|/\./|/|g t dotsl s|/\.$|/|' _G_collapseslashes='s|/\{1,\}|/|g' _G_finalslash='s|/*$|/|' # Start from root dir and reassemble the path. func_normal_abspath_result= func_normal_abspath_tpath=$1 func_normal_abspath_altnamespace= case $func_normal_abspath_tpath in "") # Empty path, that just means $cwd. func_stripname '' '/' "`pwd`" func_normal_abspath_result=$func_stripname_result return ;; # The next three entries are used to spot a run of precisely # two leading slashes without using negated character classes; # we take advantage of case's first-match behaviour. ///*) # Unusual form of absolute path, do nothing. ;; //*) # Not necessarily an ordinary path; POSIX reserves leading '//' # and for example Cygwin uses it to access remote file shares # over CIFS/SMB, so we conserve a leading double slash if found. func_normal_abspath_altnamespace=/ ;; /*) # Absolute path, do nothing. ;; *) # Relative path, prepend $cwd. func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath ;; esac # Cancel out all the simple stuff to save iterations. We also want # the path to end with a slash for ease of parsing, so make sure # there is one (and only one) here. func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$_G_removedotparts" -e "$_G_collapseslashes" -e "$_G_finalslash"` while :; do # Processed it all yet? if test / = "$func_normal_abspath_tpath"; then # If we ascended to the root using ".." the result may be empty now. if test -z "$func_normal_abspath_result"; then func_normal_abspath_result=/ fi break fi func_normal_abspath_tcomponent=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$_G_pathcar"` func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$_G_pathcdr"` # Figure out what to do with it case $func_normal_abspath_tcomponent in "") # Trailing empty path component, ignore it. ;; ..) # Parent dir; strip last assembled component from result. func_dirname "$func_normal_abspath_result" func_normal_abspath_result=$func_dirname_result ;; *) # Actual path component, append it. func_append func_normal_abspath_result "/$func_normal_abspath_tcomponent" ;; esac done # Restore leading double-slash if one was found on entry. func_normal_abspath_result=$func_normal_abspath_altnamespace$func_normal_abspath_result } # func_notquiet ARG... # -------------------- # Echo program name prefixed message only when not in quiet mode. func_notquiet () { $debug_cmd $opt_quiet || func_echo ${1+"$@"} # A bug in bash halts the script if the last line of a function # fails when set -e is in force, so we need another command to # work around that: : } # func_relative_path SRCDIR DSTDIR # -------------------------------- # Set func_relative_path_result to the relative path from SRCDIR to DSTDIR. func_relative_path () { $debug_cmd func_relative_path_result= func_normal_abspath "$1" func_relative_path_tlibdir=$func_normal_abspath_result func_normal_abspath "$2" func_relative_path_tbindir=$func_normal_abspath_result # Ascend the tree starting from libdir while :; do # check if we have found a prefix of bindir case $func_relative_path_tbindir in $func_relative_path_tlibdir) # found an exact match func_relative_path_tcancelled= break ;; $func_relative_path_tlibdir*) # found a matching prefix func_stripname "$func_relative_path_tlibdir" '' "$func_relative_path_tbindir" func_relative_path_tcancelled=$func_stripname_result if test -z "$func_relative_path_result"; then func_relative_path_result=. fi break ;; *) func_dirname $func_relative_path_tlibdir func_relative_path_tlibdir=$func_dirname_result if test -z "$func_relative_path_tlibdir"; then # Have to descend all the way to the root! func_relative_path_result=../$func_relative_path_result func_relative_path_tcancelled=$func_relative_path_tbindir break fi func_relative_path_result=../$func_relative_path_result ;; esac done # Now calculate path; take care to avoid doubling-up slashes. func_stripname '' '/' "$func_relative_path_result" func_relative_path_result=$func_stripname_result func_stripname '/' '/' "$func_relative_path_tcancelled" if test -n "$func_stripname_result"; then func_append func_relative_path_result "/$func_stripname_result" fi # Normalisation. If bindir is libdir, return '.' else relative path. if test -n "$func_relative_path_result"; then func_stripname './' '' "$func_relative_path_result" func_relative_path_result=$func_stripname_result fi test -n "$func_relative_path_result" || func_relative_path_result=. : } # func_quote_for_eval ARG... # -------------------------- # Aesthetically quote ARGs to be evaled later. # This function returns two values: # i) func_quote_for_eval_result # double-quoted, suitable for a subsequent eval # ii) func_quote_for_eval_unquoted_result # has all characters that are still active within double # quotes backslashified. func_quote_for_eval () { $debug_cmd func_quote_for_eval_unquoted_result= func_quote_for_eval_result= while test 0 -lt $#; do case $1 in *[\\\`\"\$]*) _G_unquoted_arg=`printf '%s\n' "$1" |$SED "$sed_quote_subst"` ;; *) _G_unquoted_arg=$1 ;; esac if test -n "$func_quote_for_eval_unquoted_result"; then func_append func_quote_for_eval_unquoted_result " $_G_unquoted_arg" else func_append func_quote_for_eval_unquoted_result "$_G_unquoted_arg" fi case $_G_unquoted_arg in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and variable expansion # for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") _G_quoted_arg=\"$_G_unquoted_arg\" ;; *) _G_quoted_arg=$_G_unquoted_arg ;; esac if test -n "$func_quote_for_eval_result"; then func_append func_quote_for_eval_result " $_G_quoted_arg" else func_append func_quote_for_eval_result "$_G_quoted_arg" fi shift done } # func_quote_for_expand ARG # ------------------------- # Aesthetically quote ARG to be evaled later; same as above, # but do not quote variable references. func_quote_for_expand () { $debug_cmd case $1 in *[\\\`\"]*) _G_arg=`$ECHO "$1" | $SED \ -e "$sed_double_quote_subst" -e "$sed_double_backslash"` ;; *) _G_arg=$1 ;; esac case $_G_arg in # Double-quote args containing shell metacharacters to delay # word splitting and command substitution for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") _G_arg=\"$_G_arg\" ;; esac func_quote_for_expand_result=$_G_arg } # func_stripname PREFIX SUFFIX NAME # --------------------------------- # strip PREFIX and SUFFIX from NAME, and store in func_stripname_result. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). if test yes = "$_G_HAVE_XSI_OPS"; then eval 'func_stripname () { $debug_cmd # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary variable first. func_stripname_result=$3 func_stripname_result=${func_stripname_result#"$1"} func_stripname_result=${func_stripname_result%"$2"} }' else func_stripname () { $debug_cmd case $2 in .*) func_stripname_result=`$ECHO "$3" | $SED -e "s%^$1%%" -e "s%\\\\$2\$%%"`;; *) func_stripname_result=`$ECHO "$3" | $SED -e "s%^$1%%" -e "s%$2\$%%"`;; esac } fi # func_show_eval CMD [FAIL_EXP] # ----------------------------- # Unless opt_quiet is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. func_show_eval () { $debug_cmd _G_cmd=$1 _G_fail_exp=${2-':'} func_quote_for_expand "$_G_cmd" eval "func_notquiet $func_quote_for_expand_result" $opt_dry_run || { eval "$_G_cmd" _G_status=$? if test 0 -ne "$_G_status"; then eval "(exit $_G_status); $_G_fail_exp" fi } } # func_show_eval_locale CMD [FAIL_EXP] # ------------------------------------ # Unless opt_quiet is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. Use the saved locale for evaluation. func_show_eval_locale () { $debug_cmd _G_cmd=$1 _G_fail_exp=${2-':'} $opt_quiet || { func_quote_for_expand "$_G_cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || { eval "$_G_user_locale $_G_cmd" _G_status=$? eval "$_G_safe_locale" if test 0 -ne "$_G_status"; then eval "(exit $_G_status); $_G_fail_exp" fi } } # func_tr_sh # ---------- # Turn $1 into a string suitable for a shell variable name. # Result is stored in $func_tr_sh_result. All characters # not in the set a-zA-Z0-9_ are replaced with '_'. Further, # if $1 begins with a digit, a '_' is prepended as well. func_tr_sh () { $debug_cmd case $1 in [0-9]* | *[!a-zA-Z0-9_]*) func_tr_sh_result=`$ECHO "$1" | $SED -e 's/^\([0-9]\)/_\1/' -e 's/[^a-zA-Z0-9_]/_/g'` ;; * ) func_tr_sh_result=$1 ;; esac } # func_verbose ARG... # ------------------- # Echo program name prefixed message in verbose mode only. func_verbose () { $debug_cmd $opt_verbose && func_echo "$*" : } # func_warn_and_continue ARG... # ----------------------------- # Echo program name prefixed warning message to standard error. func_warn_and_continue () { $debug_cmd $require_term_colors func_echo_infix_1 "${tc_red}warning$tc_reset" "$*" >&2 } # func_warning CATEGORY ARG... # ---------------------------- # Echo program name prefixed warning message to standard error. Warning # messages can be filtered according to CATEGORY, where this function # elides messages where CATEGORY is not listed in the global variable # 'opt_warning_types'. func_warning () { $debug_cmd # CATEGORY must be in the warning_categories list! case " $warning_categories " in *" $1 "*) ;; *) func_internal_error "invalid warning category '$1'" ;; esac _G_category=$1 shift case " $opt_warning_types " in *" $_G_category "*) $warning_func ${1+"$@"} ;; esac } # func_sort_ver VER1 VER2 # ----------------------- # 'sort -V' is not generally available. # Note this deviates from the version comparison in automake # in that it treats 1.5 < 1.5.0, and treats 1.4.4a < 1.4-p3a # but this should suffice as we won't be specifying old # version formats or redundant trailing .0 in bootstrap.conf. # If we did want full compatibility then we should probably # use m4_version_compare from autoconf. func_sort_ver () { $debug_cmd ver1=$1 ver2=$2 # Split on '.' and compare each component. i=1 while :; do p1=`echo "$ver1" |cut -d. -f$i` p2=`echo "$ver2" |cut -d. -f$i` if test ! "$p1"; then echo "$1 $2" break elif test ! "$p2"; then echo "$2 $1" break elif test ! "$p1" = "$p2"; then if test "$p1" -gt "$p2" 2>/dev/null; then # numeric comparison echo "$2 $1" elif test "$p2" -gt "$p1" 2>/dev/null; then # numeric comparison echo "$1 $2" else # numeric, then lexicographic comparison lp=`printf "$p1\n$p2\n" |sort -n |tail -n1` if test "$lp" = "$p2"; then echo "$1 $2" else echo "$2 $1" fi fi break fi i=`expr $i + 1` done } # Local variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-pattern: "10/scriptversion=%:y-%02m-%02d.%02H; # UTC" # time-stamp-time-zone: "UTC" # End: #! /bin/sh # Set a version string for this script. scriptversion=2012-10-21.11; # UTC # A portable, pluggable option parser for Bourne shell. # Written by Gary V. Vaughan, 2010 # Copyright (C) 2010-2013 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # This program is free software: you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation, either version 3 of the License, or # (at your option) any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # Please report bugs or propose patches to gary@gnu.org. ## ------ ## ## Usage. ## ## ------ ## # This file is a library for parsing options in your shell scripts along # with assorted other useful supporting features that you can make use # of too. # # For the simplest scripts you might need only: # # #!/bin/sh # . relative/path/to/funclib.sh # . relative/path/to/options-parser # scriptversion=1.0 # func_options ${1+"$@"} # eval set dummy "$func_options_result"; shift # ...rest of your script... # # In order for the '--version' option to work, you will need to have a # suitably formatted comment like the one at the top of this file # starting with '# Written by ' and ending with '# warranty; '. # # For '-h' and '--help' to work, you will also need a one line # description of your script's purpose in a comment directly above the # '# Written by ' line, like the one at the top of this file. # # The default options also support '--debug', which will turn on shell # execution tracing (see the comment above debug_cmd below for another # use), and '--verbose' and the func_verbose function to allow your script # to display verbose messages only when your user has specified # '--verbose'. # # After sourcing this file, you can plug processing for additional # options by amending the variables from the 'Configuration' section # below, and following the instructions in the 'Option parsing' # section further down. ## -------------- ## ## Configuration. ## ## -------------- ## # You should override these variables in your script after sourcing this # file so that they reflect the customisations you have added to the # option parser. # The usage line for option parsing errors and the start of '-h' and # '--help' output messages. You can embed shell variables for delayed # expansion at the time the message is displayed, but you will need to # quote other shell meta-characters carefully to prevent them being # expanded when the contents are evaled. usage='$progpath [OPTION]...' # Short help message in response to '-h' and '--help'. Add to this or # override it after sourcing this library to reflect the full set of # options your script accepts. usage_message="\ --debug enable verbose shell tracing -W, --warnings=CATEGORY report the warnings falling in CATEGORY [all] -v, --verbose verbosely report processing --version print version information and exit -h, --help print short or long help message and exit " # Additional text appended to 'usage_message' in response to '--help'. long_help_message=" Warning categories include: 'all' show all warnings 'none' turn off all the warnings 'error' warnings are treated as fatal errors" # Help message printed before fatal option parsing errors. fatal_help="Try '\$progname --help' for more information." ## ------------------------- ## ## Hook function management. ## ## ------------------------- ## # This section contains functions for adding, removing, and running hooks # to the main code. A hook is just a named list of of function, that can # be run in order later on. # func_hookable FUNC_NAME # ----------------------- # Declare that FUNC_NAME will run hooks added with # 'func_add_hook FUNC_NAME ...'. func_hookable () { $debug_cmd func_append hookable_fns " $1" } # func_add_hook FUNC_NAME HOOK_FUNC # --------------------------------- # Request that FUNC_NAME call HOOK_FUNC before it returns. FUNC_NAME must # first have been declared "hookable" by a call to 'func_hookable'. func_add_hook () { $debug_cmd case " $hookable_fns " in *" $1 "*) ;; *) func_fatal_error "'$1' does not accept hook functions." ;; esac eval func_append ${1}_hooks '" $2"' } # func_remove_hook FUNC_NAME HOOK_FUNC # ------------------------------------ # Remove HOOK_FUNC from the list of functions called by FUNC_NAME. func_remove_hook () { $debug_cmd eval ${1}_hooks='`$bs_echo "\$'$1'_hooks" |$SED "s| '$2'||"`' } # func_run_hooks FUNC_NAME [ARG]... # --------------------------------- # Run all hook functions registered to FUNC_NAME. # It is assumed that the list of hook functions contains nothing more # than a whitespace-delimited list of legal shell function names, and # no effort is wasted trying to catch shell meta-characters or preserve # whitespace. func_run_hooks () { $debug_cmd case " $hookable_fns " in *" $1 "*) ;; *) func_fatal_error "'$1' does not support hook funcions.n" ;; esac eval _G_hook_fns=\$$1_hooks; shift for _G_hook in $_G_hook_fns; do eval $_G_hook '"$@"' # store returned options list back into positional # parameters for next 'cmd' execution. eval _G_hook_result=\$${_G_hook}_result eval set dummy "$_G_hook_result"; shift done func_quote_for_eval ${1+"$@"} func_run_hooks_result=$func_quote_for_eval_result } ## --------------- ## ## Option parsing. ## ## --------------- ## # In order to add your own option parsing hooks, you must accept the # full positional parameter list in your hook function, remove any # options that you action, and then pass back the remaining unprocessed # options in '_result', escaped suitably for # 'eval'. Like this: # # my_options_prep () # { # $debug_cmd # # # Extend the existing usage message. # usage_message=$usage_message' # -s, --silent don'\''t print informational messages # ' # # func_quote_for_eval ${1+"$@"} # my_options_prep_result=$func_quote_for_eval_result # } # func_add_hook func_options_prep my_options_prep # # # my_silent_option () # { # $debug_cmd # # # Note that for efficiency, we parse as many options as we can # # recognise in a loop before passing the remainder back to the # # caller on the first unrecognised argument we encounter. # while test $# -gt 0; do # opt=$1; shift # case $opt in # --silent|-s) opt_silent=: ;; # # Separate non-argument short options: # -s*) func_split_short_opt "$_G_opt" # set dummy "$func_split_short_opt_name" \ # "-$func_split_short_opt_arg" ${1+"$@"} # shift # ;; # *) set dummy "$_G_opt" "$*"; shift; break ;; # esac # done # # func_quote_for_eval ${1+"$@"} # my_silent_option_result=$func_quote_for_eval_result # } # func_add_hook func_parse_options my_silent_option # # # my_option_validation () # { # $debug_cmd # # $opt_silent && $opt_verbose && func_fatal_help "\ # '--silent' and '--verbose' options are mutually exclusive." # # func_quote_for_eval ${1+"$@"} # my_option_validation_result=$func_quote_for_eval_result # } # func_add_hook func_validate_options my_option_validation # # You'll alse need to manually amend $usage_message to reflect the extra # options you parse. It's preferable to append if you can, so that # multiple option parsing hooks can be added safely. # func_options [ARG]... # --------------------- # All the functions called inside func_options are hookable. See the # individual implementations for details. func_hookable func_options func_options () { $debug_cmd func_options_prep ${1+"$@"} eval func_parse_options \ ${func_options_prep_result+"$func_options_prep_result"} eval func_validate_options \ ${func_parse_options_result+"$func_parse_options_result"} eval func_run_hooks func_options \ ${func_validate_options_result+"$func_validate_options_result"} # save modified positional parameters for caller func_options_result=$func_run_hooks_result } # func_options_prep [ARG]... # -------------------------- # All initialisations required before starting the option parse loop. # Note that when calling hook functions, we pass through the list of # positional parameters. If a hook function modifies that list, and # needs to propogate that back to rest of this script, then the complete # modified list must be put in 'func_run_hooks_result' before # returning. func_hookable func_options_prep func_options_prep () { $debug_cmd # Option defaults: opt_verbose=false opt_warning_types= func_run_hooks func_options_prep ${1+"$@"} # save modified positional parameters for caller func_options_prep_result=$func_run_hooks_result } # func_parse_options [ARG]... # --------------------------- # The main option parsing loop. func_hookable func_parse_options func_parse_options () { $debug_cmd func_parse_options_result= # this just eases exit handling while test $# -gt 0; do # Defer to hook functions for initial option parsing, so they # get priority in the event of reusing an option name. func_run_hooks func_parse_options ${1+"$@"} # Adjust func_parse_options positional parameters to match eval set dummy "$func_run_hooks_result"; shift # Break out of the loop if we already parsed every option. test $# -gt 0 || break _G_opt=$1 shift case $_G_opt in --debug|-x) debug_cmd='set -x' func_echo "enabling shell trace mode" $debug_cmd ;; --no-warnings|--no-warning|--no-warn) set dummy --warnings none ${1+"$@"} shift ;; --warnings|--warning|-W) test $# = 0 && func_missing_arg $_G_opt && break case " $warning_categories $1" in *" $1 "*) # trailing space prevents matching last $1 above func_append_uniq opt_warning_types " $1" ;; *all) opt_warning_types=$warning_categories ;; *none) opt_warning_types=none warning_func=: ;; *error) opt_warning_types=$warning_categories warning_func=func_fatal_error ;; *) func_fatal_error \ "unsupported warning category: '$1'" ;; esac shift ;; --verbose|-v) opt_verbose=: ;; --version) func_version ;; -\?|-h) func_usage ;; --help) func_help ;; # Separate optargs to long options (plugins may need this): --*=*) func_split_equals "$_G_opt" set dummy "$func_split_equals_lhs" \ "$func_split_equals_rhs" ${1+"$@"} shift ;; # Separate optargs to short options: -W*) func_split_short_opt "$_G_opt" set dummy "$func_split_short_opt_name" \ "$func_split_short_opt_arg" ${1+"$@"} shift ;; # Separate non-argument short options: -\?*|-h*|-v*|-x*) func_split_short_opt "$_G_opt" set dummy "$func_split_short_opt_name" \ "-$func_split_short_opt_arg" ${1+"$@"} shift ;; --) break ;; -*) func_fatal_help "unrecognised option: '$_G_opt'" ;; *) set dummy "$_G_opt" ${1+"$@"}; shift; break ;; esac done # save modified positional parameters for caller func_quote_for_eval ${1+"$@"} func_parse_options_result=$func_quote_for_eval_result } # func_validate_options [ARG]... # ------------------------------ # Perform any sanity checks on option settings and/or unconsumed # arguments. func_hookable func_validate_options func_validate_options () { $debug_cmd # Display all warnings if -W was not given. test -n "$opt_warning_types" || opt_warning_types=" $warning_categories" func_run_hooks func_validate_options ${1+"$@"} # Bail if the options were screwed! $exit_cmd $EXIT_FAILURE # save modified positional parameters for caller func_validate_options_result=$func_run_hooks_result } ## ------------------## ## Helper functions. ## ## ------------------## # This section contains the helper functions used by the rest of the # hookable option parser framework in ascii-betical order. # func_fatal_help ARG... # ---------------------- # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { $debug_cmd eval \$bs_echo \""Usage: $usage"\" eval \$bs_echo \""$fatal_help"\" func_error ${1+"$@"} exit $EXIT_FAILURE } # func_help # --------- # Echo long help message to standard output and exit. func_help () { $debug_cmd func_usage_message $bs_echo "$long_help_message" exit 0 } # func_missing_arg ARGNAME # ------------------------ # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { $debug_cmd func_error "Missing argument for '$1'." exit_cmd=exit } # func_split_equals STRING # ------------------------ # Set func_split_equals_lhs and func_split_equals_rhs shell variables after # splitting STRING at the '=' sign. test -z "$_G_HAVE_XSI_OPS" \ && (eval 'x=a/b/c; test 5aa/bb/cc = "${#x}${x%%/*}${x%/*}${x#*/}${x##*/}"') 2>/dev/null \ && _G_HAVE_XSI_OPS=yes if test yes = "$_G_HAVE_XSI_OPS" then # This is an XSI compatible shell, allowing a faster implementation... eval 'func_split_equals () { $debug_cmd func_split_equals_lhs=${1%%=*} func_split_equals_rhs=${1#*=} test "x$func_split_equals_lhs" = "x$1" \ && func_split_equals_rhs= }' else # ...otherwise fall back to using expr, which is often a shell builtin. func_split_equals () { $debug_cmd func_split_equals_lhs=`expr "x$1" : 'x\([^=]*\)'` func_split_equals_rhs= test "x$func_split_equals_lhs" = "x$1" \ || func_split_equals_rhs=`expr "x$1" : 'x[^=]*=\(.*\)$'` } fi #func_split_equals # func_split_short_opt SHORTOPT # ----------------------------- # Set func_split_short_opt_name and func_split_short_opt_arg shell # variables after splitting SHORTOPT after the 2nd character. if test yes = "$_G_HAVE_XSI_OPS" then # This is an XSI compatible shell, allowing a faster implementation... eval 'func_split_short_opt () { $debug_cmd func_split_short_opt_arg=${1#??} func_split_short_opt_name=${1%"$func_split_short_opt_arg"} }' else # ...otherwise fall back to using expr, which is often a shell builtin. func_split_short_opt () { $debug_cmd func_split_short_opt_name=`expr "x$1" : 'x-\(.\)'` func_split_short_opt_arg=`expr "x$1" : 'x-.\(.*\)$'` } fi #func_split_short_opt # func_usage # ---------- # Echo short help message to standard output and exit. func_usage () { $debug_cmd func_usage_message $bs_echo "Run '$progname --help |${PAGER-more}' for full usage" exit 0 } # func_usage_message # ------------------ # Echo short help message to standard output. func_usage_message () { $debug_cmd eval \$bs_echo \""Usage: $usage"\" echo $SED -n 's|^# || /^Written by/{ x;p;x } h /^Written by/q' < "$progpath" echo eval \$bs_echo \""$usage_message"\" } # func_version # ------------ # Echo version message to standard output and exit. func_version () { $debug_cmd printf '%s\n' "$progname $scriptversion" $SED -n '/^##/q /(C)/!b go :more /\./!{ N s|\n# | | b more } :go /^# Written by /,/# warranty; / { s|^# || s|^# *$|| s|\((C)\)[ 0-9,-]*[ ,-]\([1-9][0-9]* \)|\1 \2| p } /^# Written by / { s|^# || p } /^warranty; /q' < "$progpath" exit $? } # Local variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-pattern: "10/scriptversion=%:y-%02m-%02d.%02H; # UTC" # time-stamp-time-zone: "UTC" # End: # Set a version string. scriptversion='(GNU libtool) 2.4.2.418' # func_echo ARG... # ---------------- # Libtool also displays the current mode in messages, so override # funclib.sh func_echo with this custom definition. func_echo () { $debug_cmd _G_message=$* func_echo_IFS=$IFS IFS=$nl for _G_line in $_G_message; do IFS=$func_echo_IFS $bs_echo "$progname${opt_mode+: $opt_mode}: $_G_line" done IFS=$func_echo_IFS } # func_warning ARG... # ------------------- # Libtool warnings are not categorized, so override funclib.sh # func_warning with this simpler definition. func_warning () { $debug_cmd $warning_func ${1+"$@"} } ## ---------------- ## ## Options parsing. ## ## ---------------- ## # Hook in the functions to make sure our own options are parsed during # the option parsing loop. usage='$progpath [OPTION]... [MODE-ARG]...' # Short help message in response to '-h'. usage_message="Options: --config show all configuration variables --debug enable verbose shell tracing -n, --dry-run display commands without modifying any files --features display basic configuration information and exit --mode=MODE use operation mode MODE --no-warnings equivalent to '-Wnone' --preserve-dup-deps don't remove duplicate dependency libraries --quiet, --silent don't print informational messages --tag=TAG use configuration variables from tag TAG -v, --verbose print more informational messages than default --version print version information -W, --warnings=CATEGORY report the warnings falling in CATEGORY [all] -h, --help, --help-all print short, long, or detailed help message " # Additional text appended to 'usage_message' in response to '--help'. long_help_message=$long_help_message" MODE must be one of the following: clean remove files from the build directory compile compile a source file into a libtool object execute automatically set library path, then run a program finish complete the installation of libtool libraries install install libraries or executables link create a library or an executable uninstall remove libraries from an installed directory MODE-ARGS vary depending on the MODE. When passed as first option, '--mode=MODE' may be abbreviated as 'MODE' or a unique abbreviation of that. Try '$progname --help --mode=MODE' for a more detailed description of MODE. When reporting a bug, please describe a test case to reproduce it and include the following information: host-triplet: $host shell: $SHELL compiler: $LTCC compiler flags: $LTCFLAGS linker: $LD (gnu? $with_gnu_ld) version: $progname (GNU libtool) 2.4.2.418 automake: `($AUTOMAKE --version) 2>/dev/null |$SED 1q` autoconf: `($AUTOCONF --version) 2>/dev/null |$SED 1q` Report bugs to . GNU libtool home page: . General help using GNU software: ." # func_lo2o OBJECT-NAME # --------------------- # Transform OBJECT-NAME from a '.lo' suffix to the platform specific # object suffix. lo2o=s/\\.lo\$/.$objext/ o2lo=s/\\.$objext\$/.lo/ if test yes = "$_G_HAVE_XSI_OPS"; then eval 'func_lo2o () { case $1 in *.lo) func_lo2o_result=${1%.lo}.$objext ;; * ) func_lo2o_result=$1 ;; esac }' # func_xform LIBOBJ-OR-SOURCE # --------------------------- # Transform LIBOBJ-OR-SOURCE from a '.o' or '.c' (or otherwise) # suffix to a '.lo' libtool-object suffix. eval 'func_xform () { func_xform_result=${1%.*}.lo }' else # ...otherwise fall back to using sed. func_lo2o () { func_lo2o_result=`$ECHO "$1" | $SED "$lo2o"` } func_xform () { func_xform_result=`$ECHO "$1" | $SED 's|\.[^.]*$|.lo|'` } fi # func_fatal_configuration ARG... # ------------------------------- # Echo program name prefixed message to standard error, followed by # a configuration failure hint, and exit. func_fatal_configuration () { func__fatal_error ${1+"$@"} \ "See the $PACKAGE documentation for more information." \ "Fatal configuration error." } # func_config # ----------- # Display the configuration for all the tags in this script. func_config () { re_begincf='^# ### BEGIN LIBTOOL' re_endcf='^# ### END LIBTOOL' # Default configuration. $SED "1,/$re_begincf CONFIG/d;/$re_endcf CONFIG/,\$d" < "$progpath" # Now print the configurations for the tags. for tagname in $taglist; do $SED -n "/$re_begincf TAG CONFIG: $tagname\$/,/$re_endcf TAG CONFIG: $tagname\$/p" < "$progpath" done exit $? } # func_features # ------------- # Display the features supported by this script. func_features () { echo "host: $host" if test yes = "$build_libtool_libs"; then echo "enable shared libraries" else echo "disable shared libraries" fi if test yes = "$build_old_libs"; then echo "enable static libraries" else echo "disable static libraries" fi exit $? } # func_enable_tag TAGNAME # ----------------------- # Verify that TAGNAME is valid, and either flag an error and exit, or # enable the TAGNAME tag. We also add TAGNAME to the global $taglist # variable here. func_enable_tag () { # Global variable: tagname=$1 re_begincf="^# ### BEGIN LIBTOOL TAG CONFIG: $tagname\$" re_endcf="^# ### END LIBTOOL TAG CONFIG: $tagname\$" sed_extractcf=/$re_begincf/,/$re_endcf/p # Validate tagname. case $tagname in *[!-_A-Za-z0-9,/]*) func_fatal_error "invalid tag name: $tagname" ;; esac # Don't test for the "default" C tag, as we know it's # there but not specially marked. case $tagname in CC) ;; *) if $GREP "$re_begincf" "$progpath" >/dev/null 2>&1; then taglist="$taglist $tagname" # Evaluate the configuration. Be careful to quote the path # and the sed script, to avoid splitting on whitespace, but # also don't use non-portable quotes within backquotes within # quotes we have to do it in 2 steps: extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"` eval "$extractedcf" else func_error "ignoring unknown tag $tagname" fi ;; esac } # func_check_version_match # ------------------------ # Ensure that we are using m4 macros, and libtool script from the same # release of libtool. func_check_version_match () { if test "$package_revision" != "$macro_revision"; then if test "$VERSION" != "$macro_version"; then if test -z "$macro_version"; then cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from an older release. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from $PACKAGE $macro_version. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF fi else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, revision $package_revision, $progname: but the definition of this LT_INIT comes from revision $macro_revision. $progname: You should recreate aclocal.m4 with macros from revision $package_revision $progname: of $PACKAGE $VERSION and run autoconf again. _LT_EOF fi exit $EXIT_MISMATCH fi } # libtool_options_prep [ARG]... # ----------------------------- # Preparation for options parsed by libtool. libtool_options_prep () { $debug_mode # Option defaults: opt_config=false opt_dlopen= opt_dry_run=false opt_help=false opt_mode= opt_preserve_dup_deps=false opt_quiet=false nonopt= preserve_args= # Shorthand for --mode=foo, only valid as the first argument case $1 in clean|clea|cle|cl) shift; set dummy --mode clean ${1+"$@"}; shift ;; compile|compil|compi|comp|com|co|c) shift; set dummy --mode compile ${1+"$@"}; shift ;; execute|execut|execu|exec|exe|ex|e) shift; set dummy --mode execute ${1+"$@"}; shift ;; finish|finis|fini|fin|fi|f) shift; set dummy --mode finish ${1+"$@"}; shift ;; install|instal|insta|inst|ins|in|i) shift; set dummy --mode install ${1+"$@"}; shift ;; link|lin|li|l) shift; set dummy --mode link ${1+"$@"}; shift ;; uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u) shift; set dummy --mode uninstall ${1+"$@"}; shift ;; esac # Pass back the list of options. func_quote_for_eval ${1+"$@"} libtool_options_prep_result=$func_quote_for_eval_result } func_add_hook func_options_prep libtool_options_prep # libtool_parse_options [ARG]... # --------------------------------- # Provide handling for libtool specific options. libtool_parse_options () { $debug_cmd # Perform our own loop to consume as many options as possible in # each iteration. while test $# -gt 0; do _G_opt=$1 shift case $_G_opt in --dry-run|--dryrun|-n) opt_dry_run=: ;; --config) func_config ;; --dlopen|-dlopen) opt_dlopen="${opt_dlopen+$opt_dlopen }$1" shift ;; --preserve-dup-deps) opt_preserve_dup_deps=: ;; --features) func_features ;; --finish) set dummy --mode finish ${1+"$@"}; shift ;; --help) opt_help=: ;; --help-all) opt_help=': help-all' ;; --mode) test $# = 0 && func_missing_arg $_G_opt && break opt_mode=$1 case $1 in # Valid mode arguments: clean|compile|execute|finish|install|link|relink|uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $_G_opt" exit_cmd=exit break ;; esac shift ;; --no-silent|--no-quiet) opt_quiet=false func_append preserve_args " $_G_opt" ;; --no-warnings|--no-warning|--no-warn) opt_warning=false func_append preserve_args " $_G_opt" ;; --no-verbose) opt_verbose=false func_append preserve_args " $_G_opt" ;; --silent|--quiet) opt_quiet=: opt_verbose=false func_append preserve_args " $_G_opt" ;; --tag) test $# = 0 && func_missing_arg $_G_opt && break opt_tag=$1 func_append preserve_args " $_G_opt $1" func_enable_tag "$1" shift ;; --verbose|-v) opt_quiet=false opt_verbose=: func_append preserve_args " $_G_opt" ;; # An option not handled by this hook function: *) set dummy "$_G_opt" ${1+"$@"}; shift; break ;; esac done # save modified positional parameters for caller func_quote_for_eval ${1+"$@"} libtool_parse_options_result=$func_quote_for_eval_result } func_add_hook func_parse_options libtool_parse_options # libtool_validate_options [ARG]... # --------------------------------- # Perform any sanity checks on option settings and/or unconsumed # arguments. libtool_validate_options () { # save first non-option argument if test 0 -lt $#; then nonopt=$1 shift fi # preserve --debug test : = "$debug_cmd" || func_append preserve_args " --debug" case $host in *cygwin* | *mingw* | *pw32* | *cegcc*) # don't eliminate duplications in $postdeps and $predeps opt_duplicate_compiler_generated_deps=: ;; *) opt_duplicate_compiler_generated_deps=$opt_preserve_dup_deps ;; esac $opt_help || { # Sanity checks first: func_check_version_match test yes != "$build_libtool_libs" \ && test yes != "$build_old_libs" \ && func_fatal_configuration "not configured to build any kind of library" # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$opt_dlopen" && test execute != "$opt_mode"; then func_error "unrecognized option '-dlopen'" $ECHO "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help=$help help="Try '$progname --help --mode=$opt_mode' for more information." } # Pass back the unparsed argument list func_quote_for_eval ${1+"$@"} libtool_validate_options_result=$func_quote_for_eval_result } func_add_hook func_validate_options libtool_validate_options # Process options as early as possible so that --help and --version # can return quickly. func_options ${1+"$@"} eval set dummy "$func_options_result"; shift ## ----------- ## ## Main. ## ## ----------- ## magic='%%%MAGIC variable%%%' magic_exe='%%%MAGIC EXE variable%%%' # Global variables. extracted_archives= extracted_serial=0 # If this variable is set in any of the actions, the command in it # will be execed at the end. This prevents here-documents from being # left over by shells. exec_cmd= # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } # func_lalib_p file # True iff FILE is a libtool '.la' library or '.lo' object file. # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_lalib_p () { test -f "$1" && $SED -e 4q "$1" 2>/dev/null \ | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1 } # func_lalib_unsafe_p file # True iff FILE is a libtool '.la' library or '.lo' object file. # This function implements the same check as func_lalib_p without # resorting to external programs. To this end, it redirects stdin and # closes it afterwards, without saving the original file descriptor. # As a safety measure, use it only where a negative result would be # fatal anyway. Works if 'file' does not exist. func_lalib_unsafe_p () { lalib_p=no if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then for lalib_p_l in 1 2 3 4 do read lalib_p_line case $lalib_p_line in \#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;; esac done exec 0<&5 5<&- fi test yes = "$lalib_p" } # func_ltwrapper_script_p file # True iff FILE is a libtool wrapper script # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_script_p () { func_lalib_p "$1" } # func_ltwrapper_executable_p file # True iff FILE is a libtool wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_executable_p () { func_ltwrapper_exec_suffix= case $1 in *.exe) ;; *) func_ltwrapper_exec_suffix=.exe ;; esac $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1 } # func_ltwrapper_scriptname file # Assumes file is an ltwrapper_executable # uses $file to determine the appropriate filename for a # temporary ltwrapper_script. func_ltwrapper_scriptname () { func_dirname_and_basename "$1" "" "." func_stripname '' '.exe' "$func_basename_result" func_ltwrapper_scriptname_result=$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper } # func_ltwrapper_p file # True iff FILE is a libtool wrapper script or wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_p () { func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1" } # func_execute_cmds commands fail_cmd # Execute tilde-delimited COMMANDS. # If FAIL_CMD is given, eval that upon failure. # FAIL_CMD may read-access the current command in variable CMD! func_execute_cmds () { $debug_cmd save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$sp$nl eval cmd=\"$cmd\" IFS=$save_ifs func_show_eval "$cmd" "${2-:}" done IFS=$save_ifs } # func_source file # Source FILE, adding directory component if necessary. # Note that it is not necessary on cygwin/mingw to append a dot to # FILE even if both FILE and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # 'FILE.' does not work on cygwin managed mounts. func_source () { $debug_cmd case $1 in */* | *\\*) . "$1" ;; *) . "./$1" ;; esac } # func_resolve_sysroot PATH # Replace a leading = in PATH with a sysroot. Store the result into # func_resolve_sysroot_result func_resolve_sysroot () { func_resolve_sysroot_result=$1 case $func_resolve_sysroot_result in =*) func_stripname '=' '' "$func_resolve_sysroot_result" func_resolve_sysroot_result=$lt_sysroot$func_stripname_result ;; esac } # func_replace_sysroot PATH # If PATH begins with the sysroot, replace it with = and # store the result into func_replace_sysroot_result. func_replace_sysroot () { case $lt_sysroot:$1 in ?*:"$lt_sysroot"*) func_stripname "$lt_sysroot" '' "$1" func_replace_sysroot_result='='$func_stripname_result ;; *) # Including no sysroot. func_replace_sysroot_result=$1 ;; esac } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { $debug_cmd if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`$SED -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case "$@ " in " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then func_echo "unable to infer tagged configuration" func_fatal_error "specify a tag with '--tag'" # else # func_verbose "using $tagname tagged configuration" fi ;; esac fi } # func_write_libtool_object output_name pic_name nonpic_name # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. func_write_libtool_object () { write_libobj=$1 if test yes = "$build_libtool_libs"; then write_lobj=\'$2\' else write_lobj=none fi if test yes = "$build_old_libs"; then write_oldobj=\'$3\' else write_oldobj=none fi $opt_dry_run || { cat >${write_libobj}T </dev/null` if test "$?" -eq 0 && test -n "$func_convert_core_file_wine_to_w32_tmp"; then func_convert_core_file_wine_to_w32_result=`$ECHO "$func_convert_core_file_wine_to_w32_tmp" | $SED -e "$sed_naive_backslashify"` else func_convert_core_file_wine_to_w32_result= fi fi } # end: func_convert_core_file_wine_to_w32 # func_convert_core_path_wine_to_w32 ARG # Helper function used by path conversion functions when $build is *nix, and # $host is mingw, cygwin, or some other w32 environment. Relies on a correctly # configured wine environment available, with the winepath program in $build's # $PATH. Assumes ARG has no leading or trailing path separator characters. # # ARG is path to be converted from $build format to win32. # Result is available in $func_convert_core_path_wine_to_w32_result. # Unconvertible file (directory) names in ARG are skipped; if no directory names # are convertible, then the result may be empty. func_convert_core_path_wine_to_w32 () { $debug_cmd # unfortunately, winepath doesn't convert paths, only file names func_convert_core_path_wine_to_w32_result= if test -n "$1"; then oldIFS=$IFS IFS=: for func_convert_core_path_wine_to_w32_f in $1; do IFS=$oldIFS func_convert_core_file_wine_to_w32 "$func_convert_core_path_wine_to_w32_f" if test -n "$func_convert_core_file_wine_to_w32_result"; then if test -z "$func_convert_core_path_wine_to_w32_result"; then func_convert_core_path_wine_to_w32_result=$func_convert_core_file_wine_to_w32_result else func_append func_convert_core_path_wine_to_w32_result ";$func_convert_core_file_wine_to_w32_result" fi fi done IFS=$oldIFS fi } # end: func_convert_core_path_wine_to_w32 # func_cygpath ARGS... # Wrapper around calling the cygpath program via LT_CYGPATH. This is used when # when (1) $build is *nix and Cygwin is hosted via a wine environment; or (2) # $build is MSYS and $host is Cygwin, or (3) $build is Cygwin. In case (1) or # (2), returns the Cygwin file name or path in func_cygpath_result (input # file name or path is assumed to be in w32 format, as previously converted # from $build's *nix or MSYS format). In case (3), returns the w32 file name # or path in func_cygpath_result (input file name or path is assumed to be in # Cygwin format). Returns an empty string on error. # # ARGS are passed to cygpath, with the last one being the file name or path to # be converted. # # Specify the absolute *nix (or w32) name to cygpath in the LT_CYGPATH # environment variable; do not put it in $PATH. func_cygpath () { $debug_cmd if test -n "$LT_CYGPATH" && test -f "$LT_CYGPATH"; then func_cygpath_result=`$LT_CYGPATH "$@" 2>/dev/null` if test "$?" -ne 0; then # on failure, ensure result is empty func_cygpath_result= fi else func_cygpath_result= func_error "LT_CYGPATH is empty or specifies non-existent file: '$LT_CYGPATH'" fi } #end: func_cygpath # func_convert_core_msys_to_w32 ARG # Convert file name or path ARG from MSYS format to w32 format. Return # result in func_convert_core_msys_to_w32_result. func_convert_core_msys_to_w32 () { $debug_cmd # awkward: cmd appends spaces to result func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null | $SED -e 's/[ ]*$//' -e "$sed_naive_backslashify"` } #end: func_convert_core_msys_to_w32 # func_convert_file_check ARG1 ARG2 # Verify that ARG1 (a file name in $build format) was converted to $host # format in ARG2. Otherwise, emit an error message, but continue (resetting # func_to_host_file_result to ARG1). func_convert_file_check () { $debug_cmd if test -z "$2" && test -n "$1"; then func_error "Could not determine host file name corresponding to" func_error " '$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback: func_to_host_file_result=$1 fi } # end func_convert_file_check # func_convert_path_check FROM_PATHSEP TO_PATHSEP FROM_PATH TO_PATH # Verify that FROM_PATH (a path in $build format) was converted to $host # format in TO_PATH. Otherwise, emit an error message, but continue, resetting # func_to_host_file_result to a simplistic fallback value (see below). func_convert_path_check () { $debug_cmd if test -z "$4" && test -n "$3"; then func_error "Could not determine the host path corresponding to" func_error " '$3'" func_error "Continuing, but uninstalled executables may not work." # Fallback. This is a deliberately simplistic "conversion" and # should not be "improved". See libtool.info. if test "x$1" != "x$2"; then lt_replace_pathsep_chars="s|$1|$2|g" func_to_host_path_result=`echo "$3" | $SED -e "$lt_replace_pathsep_chars"` else func_to_host_path_result=$3 fi fi } # end func_convert_path_check # func_convert_path_front_back_pathsep FRONTPAT BACKPAT REPL ORIG # Modifies func_to_host_path_result by prepending REPL if ORIG matches FRONTPAT # and appending REPL if ORIG matches BACKPAT. func_convert_path_front_back_pathsep () { $debug_cmd case $4 in $1 ) func_to_host_path_result=$3$func_to_host_path_result ;; esac case $4 in $2 ) func_append func_to_host_path_result "$3" ;; esac } # end func_convert_path_front_back_pathsep ################################################## # $build to $host FILE NAME CONVERSION FUNCTIONS # ################################################## # invoked via '$to_host_file_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # Result will be available in $func_to_host_file_result. # func_to_host_file ARG # Converts the file name ARG from $build format to $host format. Return result # in func_to_host_file_result. func_to_host_file () { $debug_cmd $to_host_file_cmd "$1" } # end func_to_host_file # func_to_tool_file ARG LAZY # converts the file name ARG from $build format to toolchain format. Return # result in func_to_tool_file_result. If the conversion in use is listed # in (the comma separated) LAZY, no conversion takes place. func_to_tool_file () { $debug_cmd case ,$2, in *,"$to_tool_file_cmd",*) func_to_tool_file_result=$1 ;; *) $to_tool_file_cmd "$1" func_to_tool_file_result=$func_to_host_file_result ;; esac } # end func_to_tool_file # func_convert_file_noop ARG # Copy ARG to func_to_host_file_result. func_convert_file_noop () { func_to_host_file_result=$1 } # end func_convert_file_noop # func_convert_file_msys_to_w32 ARG # Convert file name ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_file_result. func_convert_file_msys_to_w32 () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_to_host_file_result=$func_convert_core_msys_to_w32_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_w32 # func_convert_file_cygwin_to_w32 ARG # Convert file name ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_file_cygwin_to_w32 () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then # because $build is cygwin, we call "the" cygpath in $PATH; no need to use # LT_CYGPATH in this case. func_to_host_file_result=`cygpath -m "$1"` fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_cygwin_to_w32 # func_convert_file_nix_to_w32 ARG # Convert file name ARG from *nix to w32 format. Requires a wine environment # and a working winepath. Returns result in func_to_host_file_result. func_convert_file_nix_to_w32 () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then func_convert_core_file_wine_to_w32 "$1" func_to_host_file_result=$func_convert_core_file_wine_to_w32_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_w32 # func_convert_file_msys_to_cygwin ARG # Convert file name ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_file_msys_to_cygwin () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_cygpath -u "$func_convert_core_msys_to_w32_result" func_to_host_file_result=$func_cygpath_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_cygwin # func_convert_file_nix_to_cygwin ARG # Convert file name ARG from *nix to Cygwin format. Requires Cygwin installed # in a wine environment, working winepath, and LT_CYGPATH set. Returns result # in func_to_host_file_result. func_convert_file_nix_to_cygwin () { $debug_cmd func_to_host_file_result=$1 if test -n "$1"; then # convert from *nix to w32, then use cygpath to convert from w32 to cygwin. func_convert_core_file_wine_to_w32 "$1" func_cygpath -u "$func_convert_core_file_wine_to_w32_result" func_to_host_file_result=$func_cygpath_result fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_cygwin ############################################# # $build to $host PATH CONVERSION FUNCTIONS # ############################################# # invoked via '$to_host_path_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # The result will be available in $func_to_host_path_result. # # Path separators are also converted from $build format to $host format. If # ARG begins or ends with a path separator character, it is preserved (but # converted to $host format) on output. # # All path conversion functions are named using the following convention: # file name conversion function : func_convert_file_X_to_Y () # path conversion function : func_convert_path_X_to_Y () # where, for any given $build/$host combination the 'X_to_Y' value is the # same. If conversion functions are added for new $build/$host combinations, # the two new functions must follow this pattern, or func_init_to_host_path_cmd # will break. # func_init_to_host_path_cmd # Ensures that function "pointer" variable $to_host_path_cmd is set to the # appropriate value, based on the value of $to_host_file_cmd. to_host_path_cmd= func_init_to_host_path_cmd () { $debug_cmd if test -z "$to_host_path_cmd"; then func_stripname 'func_convert_file_' '' "$to_host_file_cmd" to_host_path_cmd=func_convert_path_$func_stripname_result fi } # func_to_host_path ARG # Converts the path ARG from $build format to $host format. Return result # in func_to_host_path_result. func_to_host_path () { $debug_cmd func_init_to_host_path_cmd $to_host_path_cmd "$1" } # end func_to_host_path # func_convert_path_noop ARG # Copy ARG to func_to_host_path_result. func_convert_path_noop () { func_to_host_path_result=$1 } # end func_convert_path_noop # func_convert_path_msys_to_w32 ARG # Convert path ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_path_result. func_convert_path_msys_to_w32 () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # Remove leading and trailing path separator characters from ARG. MSYS # behavior is inconsistent here; cygpath turns them into '.;' and ';.'; # and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result=$func_convert_core_msys_to_w32_result func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_msys_to_w32 # func_convert_path_cygwin_to_w32 ARG # Convert path ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_path_cygwin_to_w32 () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_to_host_path_result=`cygpath -m -p "$func_to_host_path_tmp1"` func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_cygwin_to_w32 # func_convert_path_nix_to_w32 ARG # Convert path ARG from *nix to w32 format. Requires a wine environment and # a working winepath. Returns result in func_to_host_file_result. func_convert_path_nix_to_w32 () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result=$func_convert_core_path_wine_to_w32_result func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_nix_to_w32 # func_convert_path_msys_to_cygwin ARG # Convert path ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_path_msys_to_cygwin () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_msys_to_w32_result" func_to_host_path_result=$func_cygpath_result func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_msys_to_cygwin # func_convert_path_nix_to_cygwin ARG # Convert path ARG from *nix to Cygwin format. Requires Cygwin installed in a # a wine environment, working winepath, and LT_CYGPATH set. Returns result in # func_to_host_file_result. func_convert_path_nix_to_cygwin () { $debug_cmd func_to_host_path_result=$1 if test -n "$1"; then # Remove leading and trailing path separator characters from # ARG. msys behavior is inconsistent here, cygpath turns them # into '.;' and ';.', and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_path_wine_to_w32_result" func_to_host_path_result=$func_cygpath_result func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_nix_to_cygwin # func_dll_def_p FILE # True iff FILE is a Windows DLL '.def' file. # Keep in sync with _LT_DLL_DEF_P in libtool.m4 func_dll_def_p () { $debug_cmd func_dll_def_p_tmp=`$SED -n \ -e 's/^[ ]*//' \ -e '/^\(;.*\)*$/d' \ -e 's/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p' \ -e q \ "$1"` test DEF = "$func_dll_def_p_tmp" } # func_mode_compile arg... func_mode_compile () { $debug_cmd # Get the compilation command and the source file. base_compile= srcfile=$nonopt # always keep a non-empty value in "srcfile" suppress_opt=yes suppress_output= arg_mode=normal libobj= later= pie_flag= for arg do case $arg_mode in arg ) # do not "continue". Instead, add this to base_compile lastarg=$arg arg_mode=normal ;; target ) libobj=$arg arg_mode=normal continue ;; normal ) # Accept any command-line options. case $arg in -o) test -n "$libobj" && \ func_fatal_error "you cannot specify '-o' more than once" arg_mode=target continue ;; -pie | -fpie | -fPIE) func_append pie_flag " $arg" continue ;; -shared | -static | -prefer-pic | -prefer-non-pic) func_append later " $arg" continue ;; -no-suppress) suppress_opt=no continue ;; -Xcompiler) arg_mode=arg # the next one goes into the "base_compile" arg list continue # The current "srcfile" will either be retained or ;; # replaced later. I would guess that would be a bug. -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result lastarg= save_ifs=$IFS; IFS=, for arg in $args; do IFS=$save_ifs func_append_quoted lastarg "$arg" done IFS=$save_ifs func_stripname ' ' '' "$lastarg" lastarg=$func_stripname_result # Add the arguments to base_compile. func_append base_compile " $lastarg" continue ;; *) # Accept the current argument as the source file. # The previous "srcfile" becomes the current argument. # lastarg=$srcfile srcfile=$arg ;; esac # case $arg ;; esac # case $arg_mode # Aesthetically quote the previous argument. func_append_quoted base_compile "$lastarg" done # for arg case $arg_mode in arg) func_fatal_error "you must specify an argument for -Xcompile" ;; target) func_fatal_error "you must specify a target with '-o'" ;; *) # Get the name of the library object. test -z "$libobj" && { func_basename "$srcfile" libobj=$func_basename_result } ;; esac # Recognize several different file suffixes. # If the user specifies -o file.o, it is replaced with file.lo case $libobj in *.[cCFSifmso] | \ *.ada | *.adb | *.ads | *.asm | \ *.c++ | *.cc | *.ii | *.class | *.cpp | *.cxx | \ *.[fF][09]? | *.for | *.java | *.go | *.obj | *.sx | *.cu | *.cup) func_xform "$libobj" libobj=$func_xform_result ;; esac case $libobj in *.lo) func_lo2o "$libobj"; obj=$func_lo2o_result ;; *) func_fatal_error "cannot determine name of library object from '$libobj'" ;; esac func_infer_tag $base_compile for arg in $later; do case $arg in -shared) test yes = "$build_libtool_libs" \ || func_fatal_configuration "cannot build a shared library" build_old_libs=no continue ;; -static) build_libtool_libs=no build_old_libs=yes continue ;; -prefer-pic) pic_mode=yes continue ;; -prefer-non-pic) pic_mode=no continue ;; esac done func_quote_for_eval "$libobj" test "X$libobj" != "X$func_quote_for_eval_result" \ && $ECHO "X$libobj" | $GREP '[]~#^*{};<>?"'"'"' &()|`$[]' \ && func_warning "libobj name '$libobj' may not contain shell special characters." func_dirname_and_basename "$obj" "/" "" objname=$func_basename_result xdir=$func_dirname_result lobj=$xdir$objdir/$objname test -z "$base_compile" && \ func_fatal_help "you must specify a compilation command" # Delete any leftover library objects. if test yes = "$build_old_libs"; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2* | cegcc*) pic_mode=default ;; esac if test no = "$pic_mode" && test pass_all != "$deplibs_check_method"; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test no = "$compiler_c_o"; then output_obj=`$ECHO "$srcfile" | $SED 's%^.*/%%; s%\.[^.]*$%%'`.$objext lockfile=$output_obj.lock else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test yes = "$need_locks"; then until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done elif test warn = "$need_locks"; then if test -f "$lockfile"; then $ECHO "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support '-c' and '-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi func_append removelist " $output_obj" $ECHO "$srcfile" > "$lockfile" fi $opt_dry_run || $RM $removelist func_append removelist " $lockfile" trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15 func_to_tool_file "$srcfile" func_convert_file_msys_to_w32 srcfile=$func_to_tool_file_result func_quote_for_eval "$srcfile" qsrcfile=$func_quote_for_eval_result # Only build a PIC object if we are building libtool libraries. if test yes = "$build_libtool_libs"; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test no != "$pic_mode"; then command="$base_compile $qsrcfile $pic_flag" else # Don't build PIC code command="$base_compile $qsrcfile" fi func_mkdir_p "$xdir$objdir" if test -z "$output_obj"; then # Place PIC objects in $objdir func_append command " -o $lobj" fi func_show_eval_locale "$command" \ 'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE' if test warn = "$need_locks" && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support '-c' and '-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then func_show_eval '$MV "$output_obj" "$lobj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi # Allow error messages only from the first compilation. if test yes = "$suppress_opt"; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test yes = "$build_old_libs"; then if test yes != "$pic_mode"; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test yes = "$compiler_c_o"; then func_append command " -o $obj" fi # Suppress compiler output if we already did a PIC compilation. func_append command "$suppress_output" func_show_eval_locale "$command" \ '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' if test warn = "$need_locks" && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support '-c' and '-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then func_show_eval '$MV "$output_obj" "$obj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi fi $opt_dry_run || { func_write_libtool_object "$libobj" "$objdir/$objname" "$objname" # Unlock the critical section if it was locked if test no != "$need_locks"; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test compile = "$opt_mode" && func_mode_compile ${1+"$@"} } func_mode_help () { # We need to display help for each of the modes. case $opt_mode in "") # Generic help is extracted from the usage comments # at the start of this file. func_help ;; clean) $ECHO \ "Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically '/bin/rm'). RM-OPTIONS are options (such as '-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $ECHO \ "Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -no-suppress do not suppress compiler output for multiple passes -prefer-pic try to build PIC objects only -prefer-non-pic try to build non-PIC objects only -shared do not build a '.o' file suitable for static linking -static only build a '.o' file suitable for static linking -Wc,FLAG pass FLAG directly to the compiler COMPILE-COMMAND is a command to be used in creating a 'standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix '.c' with the library object suffix, '.lo'." ;; execute) $ECHO \ "Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to '-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $ECHO \ "Usage: $progname [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the '--dry-run' option if you just want to see what would be executed." ;; install) $ECHO \ "Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the 'install' or 'cp' program. The following components of INSTALL-COMMAND are treated specially: -inst-prefix-dir PREFIX-DIR Use PREFIX-DIR as a staging area for installation The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $ECHO \ "Usage: $progname [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -bindir BINDIR specify path to binaries directory (for systems where libraries must be found in the PATH setting at runtime) -dlopen FILE '-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -shared only do dynamic linking of libtool libraries -shrext SUFFIX override the standard shared library file extension -static do not do any dynamic linking of uninstalled libtool libraries -static-libtool-libs do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] -weak LIBNAME declare that the target provides the LIBNAME interface -Wc,FLAG -Xcompiler FLAG pass linker-specific FLAG directly to the compiler -Wl,FLAG -Xlinker FLAG pass linker-specific FLAG directly to the linker -XCClinker FLAG pass link-specific FLAG to the compiler driver (CC) All other options (arguments beginning with '-') are ignored. Every other argument is treated as a filename. Files ending in '.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in '.la', then a libtool library is created, only library objects ('.lo' files) may be specified, and '-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in '.a' or '.lib', then a standard library is created using 'ar' and 'ranlib', or on Windows using 'lib'. If OUTPUT-FILE ends in '.lo' or '.$objext', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $ECHO \ "Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically '/bin/rm'). RM-OPTIONS are options (such as '-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) func_fatal_help "invalid operation mode '$opt_mode'" ;; esac echo $ECHO "Try '$progname --help' for more information about other modes." } # Now that we've collected a possible --mode arg, show help if necessary if $opt_help; then if test : = "$opt_help"; then func_mode_help else { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do func_mode_help done } | sed -n '1p; 2,$s/^Usage:/ or: /p' { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do echo func_mode_help done } | sed '1d /^When reporting/,/^Report/{ H d } $x /information about other modes/d /more detailed .*MODE/d s/^Usage:.*--mode=\([^ ]*\) .*/Description of \1 mode:/' fi exit $? fi # func_mode_execute arg... func_mode_execute () { $debug_cmd # The first argument is the command name. cmd=$nonopt test -z "$cmd" && \ func_fatal_help "you must specify a COMMAND" # Handle -dlopen flags immediately. for file in $opt_dlopen; do test -f "$file" \ || func_fatal_help "'$file' is not a file" dir= case $file in *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "'$lib' is not a valid libtool archive" # Read the libtool library. dlname= library_names= func_source "$file" # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && \ func_warning "'$file' was not linked with '-export-dynamic'" continue fi func_dirname "$file" "" "." dir=$func_dirname_result if test -f "$dir/$objdir/$dlname"; then func_append dir "/$objdir" else if test ! -f "$dir/$dlname"; then func_fatal_error "cannot find '$dlname' in '$dir' or '$dir/$objdir'" fi fi ;; *.lo) # Just add the directory containing the .lo file. func_dirname "$file" "" "." dir=$func_dirname_result ;; *) func_warning "'-dlopen' is ignored for non-libtool libraries and objects" continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir=$absdir # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic=$magic # Check if any of the arguments is a wrapper script. args= for file do case $file in -* | *.la | *.lo ) ;; *) # Do a test to see if this is really a libtool program. if func_ltwrapper_script_p "$file"; then func_source "$file" # Transform arg to wrapped name. file=$progdir/$program elif func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" func_source "$func_ltwrapper_scriptname_result" # Transform arg to wrapped name. file=$progdir/$program fi ;; esac # Quote arguments (to preserve shell metacharacters). func_append_quoted args "$file" done if $opt_dry_run; then # Display what would be done. if test -n "$shlibpath_var"; then eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\"" echo "export $shlibpath_var" fi $ECHO "$cmd$args" exit $EXIT_SUCCESS else if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${save_$lt_var+set}\" = set; then $lt_var=\$save_$lt_var; export $lt_var else $lt_unset $lt_var fi" done # Now prepare to actually exec the command. exec_cmd=\$cmd$args fi } test execute = "$opt_mode" && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $debug_cmd libs= libdirs= admincmds= for opt in "$nonopt" ${1+"$@"} do if test -d "$opt"; then func_append libdirs " $opt" elif test -f "$opt"; then if func_lalib_unsafe_p "$opt"; then func_append libs " $opt" else func_warning "'$opt' is not a valid libtool archive" fi else func_fatal_error "invalid argument '$opt'" fi done if test -n "$libs"; then if test -n "$lt_sysroot"; then sysroot_regex=`$ECHO "$lt_sysroot" | $SED "$sed_make_literal_regex"` sysroot_cmd="s/\([ ']\)$sysroot_regex/\1/g;" else sysroot_cmd= fi # Remove sysroot references if $opt_dry_run; then for lib in $libs; do echo "removing references to $lt_sysroot and '=' prefixes from $lib" done else tmpdir=`func_mktempdir` for lib in $libs; do sed -e "$sysroot_cmd s/\([ ']-[LR]\)=/\1/g; s/\([ ']\)=/\1/g" $lib \ > $tmpdir/tmp-la mv -f $tmpdir/tmp-la $lib done ${RM}r "$tmpdir" fi fi if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. func_execute_cmds "$finish_cmds" 'admincmds="$admincmds '"$cmd"'"' fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $opt_dry_run || eval "$cmds" || func_append admincmds " $cmds" fi done fi # Exit here if they wanted silent mode. $opt_quiet && exit $EXIT_SUCCESS if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then echo "----------------------------------------------------------------------" echo "Libraries have been installed in:" for libdir in $libdirs; do $ECHO " $libdir" done echo echo "If you ever happen to want to link against installed libraries" echo "in a given directory, LIBDIR, you must either use libtool, and" echo "specify the full pathname of the library, or use the '-LLIBDIR'" echo "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then echo " - add LIBDIR to the '$shlibpath_var' environment variable" echo " during execution" fi if test -n "$runpath_var"; then echo " - add LIBDIR to the '$runpath_var' environment variable" echo " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $ECHO " - use the '$flag' linker flag" fi if test -n "$admincmds"; then $ECHO " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then echo " - have your system administrator add LIBDIR to '/etc/ld.so.conf'" fi echo echo "See any operating system documentation about shared libraries for" case $host in solaris2.[6789]|solaris2.1[0-9]) echo "more information, such as the ld(1), crle(1) and ld.so(8) manual" echo "pages." ;; *) echo "more information, such as the ld(1) and ld.so(8) manual pages." ;; esac echo "----------------------------------------------------------------------" fi exit $EXIT_SUCCESS } test finish = "$opt_mode" && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $debug_cmd # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$SHELL" = "$nonopt" || test /bin/sh = "$nonopt" || # Allow the use of GNU shtool's install command. case $nonopt in *shtool*) :;; *) false;; esac then # Aesthetically quote it. func_quote_for_eval "$nonopt" install_prog="$func_quote_for_eval_result " arg=$1 shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. func_quote_for_eval "$arg" func_append install_prog "$func_quote_for_eval_result" install_shared_prog=$install_prog case " $install_prog " in *[\\\ /]cp\ *) install_cp=: ;; *) install_cp=false ;; esac # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=false stripme= no_mode=: for arg do arg2= if test -n "$dest"; then func_append files " $dest" dest=$arg continue fi case $arg in -d) isdir=: ;; -f) if $install_cp; then :; else prev=$arg fi ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then if test X-m = "X$prev" && test -n "$install_override_mode"; then arg2=$install_override_mode no_mode=false fi prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. func_quote_for_eval "$arg" func_append install_prog " $func_quote_for_eval_result" if test -n "$arg2"; then func_quote_for_eval "$arg2" fi func_append install_shared_prog " $func_quote_for_eval_result" done test -z "$install_prog" && \ func_fatal_help "you must specify an install program" test -n "$prev" && \ func_fatal_help "the '$prev' option requires an argument" if test -n "$install_override_mode" && $no_mode; then if $install_cp; then :; else func_quote_for_eval "$install_override_mode" func_append install_shared_prog " -m $func_quote_for_eval_result" fi fi if test -z "$files"; then if test -z "$dest"; then func_fatal_help "no file or destination specified" else func_fatal_help "you must specify a destination" fi fi # Strip any trailing slash from the destination. func_stripname '' '/' "$dest" dest=$func_stripname_result # Check to see that the destination is a directory. test -d "$dest" && isdir=: if $isdir; then destdir=$dest destname= else func_dirname_and_basename "$dest" "" "." destdir=$func_dirname_result destname=$func_basename_result # Not a directory, so check to see that there is only one file specified. set dummy $files; shift test "$#" -gt 1 && \ func_fatal_help "'$dest' is not a directory" fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) func_fatal_help "'$destdir' must be an absolute directory name" ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic=$magic staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. func_append staticlibs " $file" ;; *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "'$file' is not a valid libtool archive" library_names= old_library= relink_command= func_source "$file" # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) func_append current_libdirs " $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) func_append future_libdirs " $libdir" ;; esac fi func_dirname "$file" "/" "" dir=$func_dirname_result func_append dir "$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$ECHO "$destdir" | $SED -e "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. test "$inst_prefix_dir" = "$destdir" && \ func_fatal_error "error: cannot install '$file' to a directory not ending in $libdir" if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%%"` fi func_warning "relinking '$file'" func_show_eval "$relink_command" \ 'func_fatal_error "error: relink '\''$file'\'' with the above command before installing it"' fi # See the names of the shared library. set dummy $library_names; shift if test -n "$1"; then realname=$1 shift srcname=$realname test -n "$relink_command" && srcname=${realname}T # Install the shared library and build the symlinks. func_show_eval "$install_shared_prog $dir/$srcname $destdir/$realname" \ 'exit $?' tstripme=$stripme case $host_os in cygwin* | mingw* | pw32* | cegcc*) case $realname in *.dll.a) tstripme= ;; esac ;; esac if test -n "$tstripme" && test -n "$striplib"; then func_show_eval "$striplib $destdir/$realname" 'exit $?' fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try 'ln -sf' first, because the 'ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do test "$linkname" != "$realname" \ && func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })" done fi # Do each command in the postinstall commands. lib=$destdir/$realname func_execute_cmds "$postinstall_cmds" 'exit $?' fi # Install the pseudo-library for information purposes. func_basename "$file" name=$func_basename_result instname=$dir/${name}i func_show_eval "$install_prog $instname $destdir/$name" 'exit $?' # Maybe install the static library, too. test -n "$old_library" && func_append staticlibs " $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile=$destdir/$destname else func_basename "$file" destfile=$func_basename_result destfile=$destdir/$destfile fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) func_lo2o "$destfile" staticdest=$func_lo2o_result ;; *.$objext) staticdest=$destfile destfile= ;; *) func_fatal_help "cannot copy a libtool object to '$destfile'" ;; esac # Install the libtool object if requested. test -n "$destfile" && \ func_show_eval "$install_prog $file $destfile" 'exit $?' # Install the old object if enabled. if test yes = "$build_old_libs"; then # Deduce the name of the old-style object file. func_lo2o "$file" staticobj=$func_lo2o_result func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?' fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile=$destdir/$destname else func_basename "$file" destfile=$func_basename_result destfile=$destdir/$destfile fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext= case $file in *.exe) if test ! -f "$file"; then func_stripname '' '.exe' "$file" file=$func_stripname_result stripped_ext=.exe fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin* | *mingw*) if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" wrapper=$func_ltwrapper_scriptname_result else func_stripname '' '.exe' "$file" wrapper=$func_stripname_result fi ;; *) wrapper=$file ;; esac if func_ltwrapper_script_p "$wrapper"; then notinst_deplibs= relink_command= func_source "$wrapper" # Check the variables that should have been set. test -z "$generated_by_libtool_version" && \ func_fatal_error "invalid libtool wrapper script '$wrapper'" finalize=: for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then func_source "$lib" fi libfile=$libdir/`$ECHO "$lib" | $SED 's%^.*/%%g'` if test -n "$libdir" && test ! -f "$libfile"; then func_warning "'$lib' has not been installed in '$libdir'" finalize=false fi done relink_command= func_source "$wrapper" outputname= if test no = "$fast_install" && test -n "$relink_command"; then $opt_dry_run || { if $finalize; then tmpdir=`func_mktempdir` func_basename "$file$stripped_ext" file=$func_basename_result outputname=$tmpdir/$file # Replace the output file specification. relink_command=`$ECHO "$relink_command" | $SED 's%@OUTPUT@%'"$outputname"'%g'` $opt_quiet || { func_quote_for_expand "$relink_command" eval "func_echo $func_quote_for_expand_result" } if eval "$relink_command"; then : else func_error "error: relink '$file' with the above command before installing it" $opt_dry_run || ${RM}r "$tmpdir" continue fi file=$outputname else func_warning "cannot relink '$file'" fi } else # Install the binary that we compiled earlier. file=`$ECHO "$file$stripped_ext" | $SED "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) func_stripname '' '.exe' "$destfile" destfile=$func_stripname_result ;; esac ;; esac func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?' $opt_dry_run || if test -n "$outputname"; then ${RM}r "$tmpdir" fi ;; esac done for file in $staticlibs; do func_basename "$file" name=$func_basename_result # Set up the ranlib parameters. oldlib=$destdir/$name func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result func_show_eval "$install_prog \$file \$oldlib" 'exit $?' if test -n "$stripme" && test -n "$old_striplib"; then func_show_eval "$old_striplib $tool_oldlib" 'exit $?' fi # Do each command in the postinstall commands. func_execute_cmds "$old_postinstall_cmds" 'exit $?' done test -n "$future_libdirs" && \ func_warning "remember to run '$progname --finish$future_libdirs'" if test -n "$current_libdirs"; then # Maybe just do a dry run. $opt_dry_run && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL "$progpath" $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi } test install = "$opt_mode" && func_mode_install ${1+"$@"} # func_generate_dlsyms outputname originator pic_p # Extract symbols from dlprefiles and create ${outputname}S.o with # a dlpreopen symbol table. func_generate_dlsyms () { $debug_cmd my_outputname=$1 my_originator=$2 my_pic_p=${3-false} my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test no != "$dlself"; then if test -n "$NM" && test -n "$global_symbol_pipe"; then my_dlsyms=${my_outputname}S.c else func_error "not configured to extract global symbols from dlpreopened files" fi fi if test -n "$my_dlsyms"; then case $my_dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist=$output_objdir/$my_outputname.nm func_show_eval "$RM $nlist ${nlist}S ${nlist}T" # Parse the name list into a source file. func_verbose "creating $output_objdir/$my_dlsyms" $opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\ /* $my_dlsyms - symbol resolution table for '$my_outputname' dlsym emulation. */ /* Generated by $PROGRAM (GNU $PACKAGE) $VERSION */ #ifdef __cplusplus extern \"C\" { #endif #if defined __GNUC__ && (((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4)) || (__GNUC__ > 4)) #pragma GCC diagnostic ignored \"-Wstrict-prototypes\" #endif /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE /* DATA imports from DLLs on WIN32 can't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined __osf__ /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif #define STREQ(s1, s2) (strcmp ((s1), (s2)) == 0) /* External symbol declarations for the compiler. */\ " if test yes = "$dlself"; then func_verbose "generating symbol list for '$output'" $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$ECHO "$objs$old_deplibs" | $SP2NL | $SED "$lo2o" | $NL2SP` for progfile in $progfiles; do func_to_tool_file "$progfile" func_convert_file_msys_to_w32 func_verbose "extracting global C symbols from '$func_to_tool_file_result'" $opt_dry_run || eval "$NM $func_to_tool_file_result | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $opt_dry_run || { eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi if test -n "$export_symbols_regex"; then $opt_dry_run || { eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols=$output_objdir/$outputname.exp $opt_dry_run || { $RM $export_symbols eval "$SED -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac } else $opt_dry_run || { eval "$SED -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac } fi fi for dlprefile in $dlprefiles; do func_verbose "extracting global C symbols from '$dlprefile'" func_basename "$dlprefile" name=$func_basename_result case $host in *cygwin* | *mingw* | *cegcc* ) # if an import library, we need to obtain dlname if func_win32_import_lib_p "$dlprefile"; then func_tr_sh "$dlprefile" eval "curr_lafile=\$libfile_$func_tr_sh_result" dlprefile_dlbasename= if test -n "$curr_lafile" && func_lalib_p "$curr_lafile"; then # Use subshell, to avoid clobbering current variable values dlprefile_dlname=`source "$curr_lafile" && echo "$dlname"` if test -n "$dlprefile_dlname"; then func_basename "$dlprefile_dlname" dlprefile_dlbasename=$func_basename_result else # no lafile. user explicitly requested -dlpreopen . $sharedlib_from_linklib_cmd "$dlprefile" dlprefile_dlbasename=$sharedlib_from_linklib_result fi fi $opt_dry_run || { if test -n "$dlprefile_dlbasename"; then eval '$ECHO ": $dlprefile_dlbasename" >> "$nlist"' else func_warning "Could not compute DLL name from $name" eval '$ECHO ": $name " >> "$nlist"' fi func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe | $SED -e '/I __imp/d' -e 's/I __nm_/D /;s/_nm__//' >> '$nlist'" } else # not an import lib $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } fi ;; *) $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } ;; esac done $opt_dry_run || { # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $MV "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if $GREP -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else $GREP -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"' else echo '/* NONE */' >> "$output_objdir/$my_dlsyms" fi func_show_eval '$RM "${nlist}I"' if test -n "$global_symbol_to_import"; then eval "$global_symbol_to_import"' < "$nlist"S > "$nlist"I' fi echo >> "$output_objdir/$my_dlsyms" "\ /* The mapping between symbol names and symbols. */ typedef struct { const char *name; void *address; } lt_dlsymlist; extern LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[];\ " if test -s "$nlist"I; then echo >> "$output_objdir/$my_dlsyms" "\ static void lt_syminit(void) { LT_DLSYM_CONST lt_dlsymlist *symbol = lt_${my_prefix}_LTX_preloaded_symbols; for (; symbol->name; ++symbol) {" $SED 's/.*/ if (STREQ (symbol->name, \"&\")) symbol->address = (void *) \&&;/' < "$nlist"I >> "$output_objdir/$my_dlsyms" echo >> "$output_objdir/$my_dlsyms" "\ } }" fi echo >> "$output_objdir/$my_dlsyms" "\ LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = { {\"$my_originator\", (void *) 0}," if test -s "$nlist"I; then echo >> "$output_objdir/$my_dlsyms" "\ {\"@INIT@\", (void *) <_syminit}," fi case $need_lib_prefix in no) eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; *) eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; esac echo >> "$output_objdir/$my_dlsyms" "\ {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_${my_prefix}_LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " } # !$opt_dry_run pic_flag_for_symtable= case "$compile_command " in *" -static "*) ;; *) case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2.*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;; *-*-hpux*) pic_flag_for_symtable=" $pic_flag" ;; *) $my_pic_p && pic_flag_for_symtable=" $pic_flag" ;; esac ;; esac symtab_cflags= for arg in $LTCFLAGS; do case $arg in -pie | -fpie | -fPIE) ;; *) func_append symtab_cflags " $arg" ;; esac done # Now compile the dynamic symbol file. func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?' # Clean up the generated files. func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T" "${nlist}I"' # Transform the symbol file into the correct name. symfileobj=$output_objdir/${my_outputname}S.$objext case $host in *cygwin* | *mingw* | *cegcc* ) if test -f "$output_objdir/$my_outputname.def"; then compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` else compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` fi ;; *) compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` ;; esac ;; *) func_fatal_error "unknown suffix for '$my_dlsyms'" ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$ECHO "$compile_command" | $SED "s% @SYMFILE@%%"` finalize_command=`$ECHO "$finalize_command" | $SED "s% @SYMFILE@%%"` fi } # func_cygming_gnu_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is a GNU/binutils-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_gnu_implib_p () { $debug_cmd func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_gnu_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $EGREP ' (_head_[A-Za-z0-9_]+_[ad]l*|[A-Za-z0-9_]+_[ad]l*_iname)$'` test -n "$func_cygming_gnu_implib_tmp" } # func_cygming_ms_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is an MS-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_ms_implib_p () { $debug_cmd func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_ms_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $GREP '_NULL_IMPORT_DESCRIPTOR'` test -n "$func_cygming_ms_implib_tmp" } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. # Despite the name, also deal with 64 bit binaries. func_win32_libid () { $debug_cmd win32_libid_type=unknown win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static # Keep the egrep pattern in sync with the one in _LT_CHECK_MAGIC_METHOD. if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | $EGREP 'file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' >/dev/null; then case $nm_interface in "MS dumpbin") if func_cygming_ms_implib_p "$1" || func_cygming_gnu_implib_p "$1" then win32_nmres=import else win32_nmres= fi ;; *) func_to_tool_file "$1" func_convert_file_msys_to_w32 win32_nmres=`eval $NM -f posix -A \"$func_to_tool_file_result\" | $SED -n -e ' 1,100{ / I /{ s|.*|import| p q } }'` ;; esac case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $ECHO "$win32_libid_type" } # func_cygming_dll_for_implib ARG # # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib () { $debug_cmd sharedlib_from_linklib_result=`$DLLTOOL --identify-strict --identify "$1"` } # func_cygming_dll_for_implib_fallback_core SECTION_NAME LIBNAMEs # # The is the core of a fallback implementation of a # platform-specific function to extract the name of the # DLL associated with the specified import library LIBNAME. # # SECTION_NAME is either .idata$6 or .idata$7, depending # on the platform and compiler that created the implib. # # Echos the name of the DLL associated with the # specified import library. func_cygming_dll_for_implib_fallback_core () { $debug_cmd match_literal=`$ECHO "$1" | $SED "$sed_make_literal_regex"` $OBJDUMP -s --section "$1" "$2" 2>/dev/null | $SED '/^Contents of section '"$match_literal"':/{ # Place marker at beginning of archive member dllname section s/.*/====MARK====/ p d } # These lines can sometimes be longer than 43 characters, but # are always uninteresting /:[ ]*file format pe[i]\{,1\}-/d /^In archive [^:]*:/d # Ensure marker is printed /^====MARK====/p # Remove all lines with less than 43 characters /^.\{43\}/!d # From remaining lines, remove first 43 characters s/^.\{43\}//' | $SED -n ' # Join marker and all lines until next marker into a single line /^====MARK====/ b para H $ b para b :para x s/\n//g # Remove the marker s/^====MARK====// # Remove trailing dots and whitespace s/[\. \t]*$// # Print /./p' | # we now have a list, one entry per line, of the stringified # contents of the appropriate section of all members of the # archive that possess that section. Heuristic: eliminate # all those that have a first or second character that is # a '.' (that is, objdump's representation of an unprintable # character.) This should work for all archives with less than # 0x302f exports -- but will fail for DLLs whose name actually # begins with a literal '.' or a single character followed by # a '.'. # # Of those that remain, print the first one. $SED -e '/^\./d;/^.\./d;q' } # func_cygming_dll_for_implib_fallback ARG # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # # This fallback implementation is for use when $DLLTOOL # does not support the --identify-strict option. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib_fallback () { $debug_cmd if func_cygming_gnu_implib_p "$1"; then # binutils import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$7' "$1"` elif func_cygming_ms_implib_p "$1"; then # ms-generated import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$6' "$1"` else # unknown sharedlib_from_linklib_result= fi } # func_extract_an_archive dir oldlib func_extract_an_archive () { $debug_cmd f_ex_an_ar_dir=$1; shift f_ex_an_ar_oldlib=$1 if test yes = "$lock_old_archive_extraction"; then lockfile=$f_ex_an_ar_oldlib.lock until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done fi func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" \ 'stat=$?; rm -f "$lockfile"; exit $stat' if test yes = "$lock_old_archive_extraction"; then $opt_dry_run || rm -f "$lockfile" fi if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" fi } # func_extract_archives gentop oldlib ... func_extract_archives () { $debug_cmd my_gentop=$1; shift my_oldlibs=${1+"$@"} my_oldobjs= my_xlib= my_xabs= my_xdir= for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs=$my_xlib ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac func_basename "$my_xlib" my_xlib=$func_basename_result my_xlib_u=$my_xlib while :; do case " $extracted_archives " in *" $my_xlib_u "*) func_arith $extracted_serial + 1 extracted_serial=$func_arith_result my_xlib_u=lt$extracted_serial-$my_xlib ;; *) break ;; esac done extracted_archives="$extracted_archives $my_xlib_u" my_xdir=$my_gentop/$my_xlib_u func_mkdir_p "$my_xdir" case $host in *-darwin*) func_verbose "Extracting $my_xabs" # Do not bother doing anything if just a dry run $opt_dry_run || { darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` func_basename "$darwin_archive" darwin_base_archive=$func_basename_result darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true` if test -n "$darwin_arches"; then darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= func_verbose "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches; do func_mkdir_p "unfat-$$/$darwin_base_archive-$darwin_arch" $LIPO -thin $darwin_arch -output "unfat-$$/$darwin_base_archive-$darwin_arch/$darwin_base_archive" "$darwin_archive" cd "unfat-$$/$darwin_base_archive-$darwin_arch" func_extract_an_archive "`pwd`" "$darwin_base_archive" cd "$darwin_curdir" $RM "unfat-$$/$darwin_base_archive-$darwin_arch/$darwin_base_archive" done # $darwin_arches ## Okay now we've a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP` $LIPO -create -output "$darwin_file" $darwin_files done # $darwin_filelist $RM -rf unfat-$$ cd "$darwin_orig_dir" else cd $darwin_orig_dir func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches } # !$opt_dry_run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | sort | $NL2SP` done func_extract_archives_result=$my_oldobjs } # func_emit_wrapper [arg=no] # # Emit a libtool wrapper script on stdout. # Don't directly open a file because we may want to # incorporate the script contents within a cygwin/mingw # wrapper executable. Must ONLY be called from within # func_mode_link because it depends on a number of variables # set therein. # # ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR # variable will take. If 'yes', then the emitted script # will assume that the directory where it is stored is # the $objdir directory. This is a cygwin/mingw-specific # behavior. func_emit_wrapper () { func_emit_wrapper_arg1=${1-no} $ECHO "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM (GNU $PACKAGE) $VERSION # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='$sed_quote_subst' # Be Bourne compatible if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variables: generated_by_libtool_version='$macro_version' notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$ECHO are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then file=\"\$0\"" qECHO=`$ECHO "$ECHO" | $SED "$sed_quote_subst"` $ECHO "\ # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } ECHO=\"$qECHO\" fi # Very basic option parsing. These options are (a) specific to # the libtool wrapper, (b) are identical between the wrapper # /script/ and the wrapper /executable/ that is used only on # windows platforms, and (c) all begin with the string "--lt-" # (application programs are unlikely to have options that match # this pattern). # # There are only two supported options: --lt-debug and # --lt-dump-script. There is, deliberately, no --lt-help. # # The first argument to this parsing function should be the # script's $0 value, followed by "$@". lt_option_debug= func_parse_lt_options () { lt_script_arg0=\$0 shift for lt_opt do case \"\$lt_opt\" in --lt-debug) lt_option_debug=1 ;; --lt-dump-script) lt_dump_D=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%/[^/]*$%%'\` test \"X\$lt_dump_D\" = \"X\$lt_script_arg0\" && lt_dump_D=. lt_dump_F=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%^.*/%%'\` cat \"\$lt_dump_D/\$lt_dump_F\" exit 0 ;; --lt-*) \$ECHO \"Unrecognized --lt- option: '\$lt_opt'\" 1>&2 exit 1 ;; esac done # Print the debug banner immediately: if test -n \"\$lt_option_debug\"; then echo \"$outputname:$output:\$LINENO: libtool wrapper (GNU $PACKAGE) $VERSION\" 1>&2 fi } # Used when --lt-debug. Prints its arguments to stdout # (redirection is the responsibility of the caller) func_lt_dump_args () { lt_dump_args_N=1; for lt_arg do \$ECHO \"$outputname:$output:\$LINENO: newargv[\$lt_dump_args_N]: \$lt_arg\" lt_dump_args_N=\`expr \$lt_dump_args_N + 1\` done } # Core function for launching the target application func_exec_program_core () { " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2* | *-cegcc*) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"$outputname:$output:\$LINENO: newargv[0]: \$progdir\\\\\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"$outputname:$output:\$LINENO: newargv[0]: \$progdir/\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $ECHO "\ \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2 exit 1 } # A function to encapsulate launching the target application # Strips options in the --lt-* namespace from \$@ and # launches target application with the remaining arguments. func_exec_program () { case \" \$* \" in *\\ --lt-*) for lt_wr_arg do case \$lt_wr_arg in --lt-*) ;; *) set x \"\$@\" \"\$lt_wr_arg\"; shift;; esac shift done ;; esac func_exec_program_core \${1+\"\$@\"} } # Parse options func_parse_lt_options \"\$0\" \${1+\"\$@\"} # Find the directory that this script lives in. thisdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | $SED -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$ECHO \"\$file\" | $SED 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | $SED -n 's/.*-> //p'\` done # Usually 'no', except on cygwin/mingw when embedded into # the cwrapper. WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1 if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then # special case for '.' if test \"\$thisdir\" = \".\"; then thisdir=\`pwd\` fi # remove .libs from thisdir case \"\$thisdir\" in *[\\\\/]$objdir ) thisdir=\`\$ECHO \"\$thisdir\" | $SED 's%[\\\\/][^\\\\/]*$%%'\` ;; $objdir ) thisdir=. ;; esac fi # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test yes = "$fast_install"; then $ECHO "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | $SED 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $MKDIR \"\$progdir\" else $RM \"\$progdir/\$file\" fi" $ECHO "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $ECHO \"\$relink_command_output\" >&2 $RM \"\$progdir/\$file\" exit 1 fi fi $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $RM \"\$progdir/\$program\"; $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; } $RM \"\$progdir/\$file\" fi" else $ECHO "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $ECHO "\ if test -f \"\$progdir/\$program\"; then" # fixup the dll searchpath if we need to. # # Fix the DLL searchpath if we need to. Do this before prepending # to shlibpath, because on Windows, both are PATH and uninstalled # libraries must come first. if test -n "$dllsearchpath"; then $ECHO "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi # Export our shlibpath_var if we have one. if test yes = "$shlibpath_overrides_runpath" && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $ECHO "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$ECHO \"\$$shlibpath_var\" | $SED 's/::*\$//'\` export $shlibpath_var " fi $ECHO "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. func_exec_program \${1+\"\$@\"} fi else # The program doesn't exist. \$ECHO \"\$0: error: '\$progdir/\$program' does not exist\" 1>&2 \$ECHO \"This script is just a wrapper for \$program.\" 1>&2 \$ECHO \"See the $PACKAGE documentation for more information.\" 1>&2 exit 1 fi fi\ " } # func_emit_cwrapperexe_src # emit the source code for a wrapper executable on stdout # Must ONLY be called from within func_mode_link because # it depends on a number of variable set therein. func_emit_cwrapperexe_src () { cat < #include #ifdef _MSC_VER # include # include # include #else # include # include # ifdef __CYGWIN__ # include # endif #endif #include #include #include #include #include #include #include #include #define STREQ(s1, s2) (strcmp ((s1), (s2)) == 0) /* declarations of non-ANSI functions */ #if defined __MINGW32__ # ifdef __STRICT_ANSI__ int _putenv (const char *); # endif #elif defined __CYGWIN__ # ifdef __STRICT_ANSI__ char *realpath (const char *, char *); int putenv (char *); int setenv (const char *, const char *, int); # endif /* #elif defined other_platform || defined ... */ #endif /* portability defines, excluding path handling macros */ #if defined _MSC_VER # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv # define S_IXUSR _S_IEXEC #elif defined __MINGW32__ # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv #elif defined __CYGWIN__ # define HAVE_SETENV # define FOPEN_WB "wb" /* #elif defined other platforms ... */ #endif #if defined PATH_MAX # define LT_PATHMAX PATH_MAX #elif defined MAXPATHLEN # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef S_IXOTH # define S_IXOTH 0 #endif #ifndef S_IXGRP # define S_IXGRP 0 #endif /* path handling portability macros */ #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined _WIN32 || defined __MSDOS__ || defined __DJGPP__ || \ defined __OS2__ # define HAVE_DOS_BASED_FILE_SYSTEM # define FOPEN_WB "wb" # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #ifndef FOPEN_WB # define FOPEN_WB "w" #endif #ifndef _O_BINARY # define _O_BINARY 0 #endif #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free (stale); stale = 0; } \ } while (0) #if defined LT_DEBUGWRAPPER static int lt_debug = 1; #else static int lt_debug = 0; #endif const char *program_name = "libtool-wrapper"; /* in case xstrdup fails */ void *xmalloc (size_t num); char *xstrdup (const char *string); const char *base_name (const char *name); char *find_executable (const char *wrapper); char *chase_symlinks (const char *pathspec); int make_executable (const char *path); int check_executable (const char *path); char *strendzap (char *str, const char *pat); void lt_debugprintf (const char *file, int line, const char *fmt, ...); void lt_fatal (const char *file, int line, const char *message, ...); static const char *nonnull (const char *s); static const char *nonempty (const char *s); void lt_setenv (const char *name, const char *value); char *lt_extend_str (const char *orig_value, const char *add, int to_end); void lt_update_exe_path (const char *name, const char *value); void lt_update_lib_path (const char *name, const char *value); char **prepare_spawn (char **argv); void lt_dump_script (FILE *f); EOF cat <= 0) && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return 1; else return 0; } int make_executable (const char *path) { int rval = 0; struct stat st; lt_debugprintf (__FILE__, __LINE__, "(make_executable): %s\n", nonempty (path)); if ((!path) || (!*path)) return 0; if (stat (path, &st) >= 0) { rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR); } return rval; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise Does not chase symlinks, even on platforms that support them. */ char * find_executable (const char *wrapper) { int has_slash = 0; const char *p; const char *p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; size_t tmp_len; char *concat_name; lt_debugprintf (__FILE__, __LINE__, "(find_executable): %s\n", nonempty (wrapper)); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined HAVE_DOS_BASED_FILE_SYSTEM if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } #if defined HAVE_DOS_BASED_FILE_SYSTEM } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char *path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char *q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR (*q)) break; p_len = (size_t) (q - p); p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC (char, p_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); return NULL; } char * chase_symlinks (const char *pathspec) { #ifndef S_ISLNK return xstrdup (pathspec); #else char buf[LT_PATHMAX]; struct stat s; char *tmp_pathspec = xstrdup (pathspec); char *p; int has_symlinks = 0; while (strlen (tmp_pathspec) && !has_symlinks) { lt_debugprintf (__FILE__, __LINE__, "checking path component for symlinks: %s\n", tmp_pathspec); if (lstat (tmp_pathspec, &s) == 0) { if (S_ISLNK (s.st_mode) != 0) { has_symlinks = 1; break; } /* search backwards for last DIR_SEPARATOR */ p = tmp_pathspec + strlen (tmp_pathspec) - 1; while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) p--; if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) { /* no more DIR_SEPARATORS left */ break; } *p = '\0'; } else { lt_fatal (__FILE__, __LINE__, "error accessing file \"%s\": %s", tmp_pathspec, nonnull (strerror (errno))); } } XFREE (tmp_pathspec); if (!has_symlinks) { return xstrdup (pathspec); } tmp_pathspec = realpath (pathspec, buf); if (tmp_pathspec == 0) { lt_fatal (__FILE__, __LINE__, "could not follow symlinks for %s", pathspec); } return xstrdup (tmp_pathspec); #endif } char * strendzap (char *str, const char *pat) { size_t len, patlen; assert (str != NULL); assert (pat != NULL); len = strlen (str); patlen = strlen (pat); if (patlen <= len) { str += len - patlen; if (STREQ (str, pat)) *str = '\0'; } return str; } void lt_debugprintf (const char *file, int line, const char *fmt, ...) { va_list args; if (lt_debug) { (void) fprintf (stderr, "%s:%s:%d: ", program_name, file, line); va_start (args, fmt); (void) vfprintf (stderr, fmt, args); va_end (args); } } static void lt_error_core (int exit_status, const char *file, int line, const char *mode, const char *message, va_list ap) { fprintf (stderr, "%s:%s:%d: %s: ", program_name, file, line, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *file, int line, const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, file, line, "FATAL", message, ap); va_end (ap); } static const char * nonnull (const char *s) { return s ? s : "(null)"; } static const char * nonempty (const char *s) { return (s && !*s) ? "(empty)" : nonnull (s); } void lt_setenv (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_setenv) setting '%s' to '%s'\n", nonnull (name), nonnull (value)); { #ifdef HAVE_SETENV /* always make a copy, for consistency with !HAVE_SETENV */ char *str = xstrdup (value); setenv (name, str, 1); #else size_t len = strlen (name) + 1 + strlen (value) + 1; char *str = XMALLOC (char, len); sprintf (str, "%s=%s", name, value); if (putenv (str) != EXIT_SUCCESS) { XFREE (str); } #endif } } char * lt_extend_str (const char *orig_value, const char *add, int to_end) { char *new_value; if (orig_value && *orig_value) { size_t orig_value_len = strlen (orig_value); size_t add_len = strlen (add); new_value = XMALLOC (char, add_len + orig_value_len + 1); if (to_end) { strcpy (new_value, orig_value); strcpy (new_value + orig_value_len, add); } else { strcpy (new_value, add); strcpy (new_value + add_len, orig_value); } } else { new_value = xstrdup (add); } return new_value; } void lt_update_exe_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_exe_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); /* some systems can't cope with a ':'-terminated path #' */ size_t len = strlen (new_value); while ((len > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[--len] = '\0'; } lt_setenv (name, new_value); XFREE (new_value); } } void lt_update_lib_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_lib_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); } } EOF case $host_os in mingw*) cat <<"EOF" /* Prepares an argument vector before calling spawn(). Note that spawn() does not by itself call the command interpreter (getenv ("COMSPEC") != NULL ? getenv ("COMSPEC") : ({ OSVERSIONINFO v; v.dwOSVersionInfoSize = sizeof(OSVERSIONINFO); GetVersionEx(&v); v.dwPlatformId == VER_PLATFORM_WIN32_NT; }) ? "cmd.exe" : "command.com"). Instead it simply concatenates the arguments, separated by ' ', and calls CreateProcess(). We must quote the arguments since Win32 CreateProcess() interprets characters like ' ', '\t', '\\', '"' (but not '<' and '>') in a special way: - Space and tab are interpreted as delimiters. They are not treated as delimiters if they are surrounded by double quotes: "...". - Unescaped double quotes are removed from the input. Their only effect is that within double quotes, space and tab are treated like normal characters. - Backslashes not followed by double quotes are not special. - But 2*n+1 backslashes followed by a double quote become n backslashes followed by a double quote (n >= 0): \" -> " \\\" -> \" \\\\\" -> \\" */ #define SHELL_SPECIAL_CHARS "\"\\ \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" #define SHELL_SPACE_CHARS " \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" char ** prepare_spawn (char **argv) { size_t argc; char **new_argv; size_t i; /* Count number of arguments. */ for (argc = 0; argv[argc] != NULL; argc++) ; /* Allocate new argument vector. */ new_argv = XMALLOC (char *, argc + 1); /* Put quoted arguments into the new argument vector. */ for (i = 0; i < argc; i++) { const char *string = argv[i]; if (string[0] == '\0') new_argv[i] = xstrdup ("\"\""); else if (strpbrk (string, SHELL_SPECIAL_CHARS) != NULL) { int quote_around = (strpbrk (string, SHELL_SPACE_CHARS) != NULL); size_t length; unsigned int backslashes; const char *s; char *quoted_string; char *p; length = 0; backslashes = 0; if (quote_around) length++; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') length += backslashes + 1; length++; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) length += backslashes + 1; quoted_string = XMALLOC (char, length + 1); p = quoted_string; backslashes = 0; if (quote_around) *p++ = '"'; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') { unsigned int j; for (j = backslashes + 1; j > 0; j--) *p++ = '\\'; } *p++ = c; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) { unsigned int j; for (j = backslashes; j > 0; j--) *p++ = '\\'; *p++ = '"'; } *p = '\0'; new_argv[i] = quoted_string; } else new_argv[i] = (char *) string; } new_argv[argc] = NULL; return new_argv; } EOF ;; esac cat <<"EOF" void lt_dump_script (FILE* f) { EOF func_emit_wrapper yes | $SED -n -e ' s/^\(.\{79\}\)\(..*\)/\1\ \2/ h s/\([\\"]\)/\\\1/g s/$/\\n/ s/\([^\n]*\).*/ fputs ("\1", f);/p g D' cat <<"EOF" } EOF } # end: func_emit_cwrapperexe_src # func_win32_import_lib_p ARG # True if ARG is an import lib, as indicated by $file_magic_cmd func_win32_import_lib_p () { $debug_cmd case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in *import*) : ;; *) false ;; esac } # func_mode_link arg... func_mode_link () { $debug_cmd case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) # It is impossible to link a dll without this setting, and # we shouldn't force the makefile maintainer to figure out # what system we are compiling for in order to pass an extra # flag for every libtool invocation. # allow_undefined=no # FIXME: Unfortunately, there are problems with the above when trying # to make a dll that has undefined symbols, in which case not # even a static library is built. For now, we need to specify # -no-undefined on the libtool link line when we can be certain # that all symbols are satisfied, otherwise we get a static library. allow_undefined=yes ;; *) allow_undefined=yes ;; esac libtool_args=$nonopt base_compile="$nonopt $@" compile_command=$nonopt finalize_command=$nonopt compile_rpath= finalize_rpath= compile_shlibpath= finalize_shlibpath= convenience= old_convenience= deplibs= old_deplibs= compiler_flags= linker_flags= dllsearchpath= lib_search_path=`pwd` inst_prefix_dir= new_inherited_linker_flags= avoid_version=no bindir= dlfiles= dlprefiles= dlself=no export_dynamic=no export_symbols= export_symbols_regex= generated= libobjs= ltlibs= module=no no_install=no objs= non_pic_objects= precious_files_regex= prefer_static_libs=no preload=false prev= prevarg= release= rpath= xrpath= perm_rpath= temp_rpath= thread_safe=no vinfo= vinfo_number=no weak_libs= single_module=$wl-single_module func_infer_tag $base_compile # We need to know -static, to get the right output filenames. for arg do case $arg in -shared) test yes != "$build_libtool_libs" \ && func_fatal_configuration "cannot build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test yes = "$build_libtool_libs" && test -z "$link_static_flag"; then func_warning "complete static linking is impossible in this configuration" fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; -static) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built ;; -static-libtool-libs) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; esac build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg=$1 shift func_quote_for_eval "$arg" qarg=$func_quote_for_eval_unquoted_result func_append libtool_args " $func_quote_for_eval_result" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) func_append compile_command " @OUTPUT@" func_append finalize_command " @OUTPUT@" ;; esac case $prev in bindir) bindir=$arg prev= continue ;; dlfiles|dlprefiles) $preload || { # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=: } case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test no = "$dlself"; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test dlprefiles = "$prev"; then dlself=yes elif test dlfiles = "$prev" && test yes != "$dlopen_self"; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test dlfiles = "$prev"; then func_append dlfiles " $arg" else func_append dlprefiles " $arg" fi prev= continue ;; esac ;; expsyms) export_symbols=$arg test -f "$arg" \ || func_fatal_error "symbol file '$arg' does not exist" prev= continue ;; expsyms_regex) export_symbols_regex=$arg prev= continue ;; framework) case $host in *-*-darwin*) case "$deplibs " in *" $qarg.ltframework "*) ;; *) func_append deplibs " $qarg.ltframework" # this is fixed later ;; esac ;; esac prev= continue ;; inst_prefix) inst_prefix_dir=$arg prev= continue ;; mllvm) # Clang does not use LLVM to link, so we can simply discard any # '-mllvm $arg' options when doing the link step. prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat "$save_arg"` do # func_append moreargs " $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test none = "$pic_object" && test none = "$non_pic_object"; then func_fatal_error "cannot find name of object for '$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result if test none != "$pic_object"; then # Prepend the subdirectory the object is found in. pic_object=$xdir$pic_object if test dlfiles = "$prev"; then if test yes = "$build_libtool_libs" && test yes = "$dlopen_support"; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test dlprefiles = "$prev"; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg=$pic_object fi # Non-PIC object. if test none != "$non_pic_object"; then # Prepend the subdirectory the object is found in. non_pic_object=$xdir$non_pic_object # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test none = "$pic_object"; then arg=$non_pic_object fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object=$pic_object func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "'$arg' is not a valid libtool object" fi fi done else func_fatal_error "link input file '$arg' does not exist" fi arg=$save_arg prev= continue ;; precious_regex) precious_files_regex=$arg prev= continue ;; release) release=-$arg prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac if test rpath = "$prev"; then case "$rpath " in *" $arg "*) ;; *) func_append rpath " $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) func_append xrpath " $arg" ;; esac fi prev= continue ;; shrext) shrext_cmds=$arg prev= continue ;; weak) func_append weak_libs " $arg" prev= continue ;; xcclinker) func_append linker_flags " $qarg" func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xcompiler) func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xlinker) func_append linker_flags " $qarg" func_append compiler_flags " $wl$qarg" prev= func_append compile_command " $wl$qarg" func_append finalize_command " $wl$qarg" continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg=$arg case $arg in -all-static) if test -n "$link_static_flag"; then # See comment for -static flag below, for more details. func_append compile_command " $link_static_flag" func_append finalize_command " $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. func_fatal_error "'-allow-undefined' must not be used because it is the default" ;; -avoid-version) avoid_version=yes continue ;; -bindir) prev=bindir continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then func_fatal_error "more than one -exported-symbols argument is not allowed" fi if test X-export-symbols = "X$arg"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework) prev=framework continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) func_append compile_command " $arg" func_append finalize_command " $arg" ;; esac continue ;; -L*) func_stripname "-L" '' "$arg" if test -z "$func_stripname_result"; then if test "$#" -gt 0; then func_fatal_error "require no space between '-L' and '$1'" else func_fatal_error "need path for '-L' option" fi fi func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` test -z "$absdir" && \ func_fatal_error "cannot determine absolute directory name of '$dir'" dir=$absdir ;; esac case "$deplibs " in *" -L$dir "* | *" $arg "*) # Will only happen for absolute or sysroot arguments ;; *) # Preserve sysroot, but never include relative directories case $dir in [\\/]* | [A-Za-z]:[\\/]* | =*) func_append deplibs " $arg" ;; *) func_append deplibs " -L$dir" ;; esac func_append lib_search_path " $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "$dir" | $SED 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; ::) dllsearchpath=$dir;; *) func_append dllsearchpath ":$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac continue ;; -l*) if test X-lc = "X$arg" || test X-lm = "X$arg"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc* | *-*-haiku*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test X-lc = "X$arg" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly* | *-*-bitrig*) # Do not include libc due to us having libc/libc_r. test X-lc = "X$arg" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework func_append deplibs " System.ltframework" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test X-lc = "X$arg" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test X-lc = "X$arg" && continue ;; esac elif test X-lc_r = "X$arg"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly* | *-*-bitrig*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi func_append deplibs " $arg" continue ;; -mllvm) prev=mllvm continue ;; -module) module=yes continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. # Darwin uses the -arch flag to determine output architecture. -model|-arch|-isysroot|--sysroot) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" case "$new_inherited_linker_flags " in *" $arg "*) ;; * ) func_append new_inherited_linker_flags " $arg" ;; esac continue ;; -multi_module) single_module=$wl-multi_module continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*) # The PATH hackery in wrapper scripts is required on Windows # and Darwin in order for the loader to find any dlls it needs. func_warning "'-no-install' is ignored for $host" func_warning "assuming '-no-fast-install' instead" fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) func_stripname '-R' '' "$arg" dir=$func_stripname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; =*) func_stripname '=' '' "$dir" dir=$lt_sysroot$func_stripname_result ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac continue ;; -shared) # The effects of -shared are defined in a previous loop. continue ;; -shrext) prev=shrext continue ;; -static | -static-libtool-libs) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -weak) prev=weak continue ;; -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result arg= save_ifs=$IFS; IFS=, for flag in $args; do IFS=$save_ifs func_quote_for_eval "$flag" func_append arg " $func_quote_for_eval_result" func_append compiler_flags " $func_quote_for_eval_result" done IFS=$save_ifs func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Wl,*) func_stripname '-Wl,' '' "$arg" args=$func_stripname_result arg= save_ifs=$IFS; IFS=, for flag in $args; do IFS=$save_ifs func_quote_for_eval "$flag" func_append arg " $wl$func_quote_for_eval_result" func_append compiler_flags " $wl$func_quote_for_eval_result" func_append linker_flags " $func_quote_for_eval_result" done IFS=$save_ifs func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # -msg_* for osf cc -msg_*) func_quote_for_eval "$arg" arg=$func_quote_for_eval_result ;; # Flags to be passed through unchanged, with rationale: # -64, -mips[0-9] enable 64-bit mode for the SGI compiler # -r[0-9][0-9]* specify processor for the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode for the Sun compiler # +DA*, +DD* enable 64-bit mode for the HP compiler # -q* compiler args for the IBM compiler # -m*, -t[45]*, -txscale* architecture-specific flags for GCC # -F/path path to uninstalled frameworks, gcc on darwin # -p, -pg, --coverage, -fprofile-* profiling flags for GCC # @file GCC response files # -tp=* Portland pgcc target processor selection # --sysroot=* for sysroot support # -O*, -g*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization # -stdlib=* select c++ std lib with clang -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \ -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*|-tp=*|--sysroot=*| \ -O*|-g*|-flto*|-fwhopr*|-fuse-linker-plugin|-stdlib=*) func_quote_for_eval "$arg" arg=$func_quote_for_eval_result func_append compile_command " $arg" func_append finalize_command " $arg" func_append compiler_flags " $arg" continue ;; # Some other compiler flag. -* | +*) func_quote_for_eval "$arg" arg=$func_quote_for_eval_result ;; *.$objext) # A standard object. func_append objs " $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test none = "$pic_object" && test none = "$non_pic_object"; then func_fatal_error "cannot find name of object for '$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result test none = "$pic_object" || { # Prepend the subdirectory the object is found in. pic_object=$xdir$pic_object if test dlfiles = "$prev"; then if test yes = "$build_libtool_libs" && test yes = "$dlopen_support"; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test dlprefiles = "$prev"; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg=$pic_object } # Non-PIC object. if test none != "$non_pic_object"; then # Prepend the subdirectory the object is found in. non_pic_object=$xdir$non_pic_object # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test none = "$pic_object"; then arg=$non_pic_object fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object=$pic_object func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir=$func_dirname_result func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "'$arg' is not a valid libtool object" fi fi ;; *.$libext) # An archive. func_append deplibs " $arg" func_append old_deplibs " $arg" continue ;; *.la) # A libtool-controlled library. func_resolve_sysroot "$arg" if test dlfiles = "$prev"; then # This library was specified with -dlopen. func_append dlfiles " $func_resolve_sysroot_result" prev= elif test dlprefiles = "$prev"; then # The library was specified with -dlpreopen. func_append dlprefiles " $func_resolve_sysroot_result" prev= else func_append deplibs " $func_resolve_sysroot_result" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. func_quote_for_eval "$arg" arg=$func_quote_for_eval_result ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then func_append compile_command " $arg" func_append finalize_command " $arg" fi done # argument parsing loop test -n "$prev" && \ func_fatal_help "the '$prevarg' option requires an argument" if test yes = "$export_dynamic" && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" func_append compile_command " $arg" func_append finalize_command " $arg" fi oldlibs= # calculate the name of the file, without its directory func_basename "$output" outputname=$func_basename_result libobjs_save=$libobjs if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$ECHO \"\$$shlibpath_var\" \| \$SED \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" func_dirname "$output" "/" "" output_objdir=$func_dirname_result$objdir func_to_tool_file "$output_objdir/" tool_output_objdir=$func_to_tool_file_result # Create the object directory. func_mkdir_p "$output_objdir" # Determine the type of output case $output in "") func_fatal_help "you must specify an output file" ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if $opt_preserve_dup_deps; then case "$libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append libs " $deplib" done if test lib = "$linkmode"; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if $opt_duplicate_compiler_generated_deps; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) func_append specialdeplibs " $pre_post_deps" ;; esac func_append pre_post_deps " $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries notinst_path= # paths that contain not-installed libtool libraries case $linkmode in lib) passes="conv dlpreopen link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) func_fatal_help "libraries can '-dlopen' only libtool libraries: $file" ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=false newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do # The preopen pass in lib mode reverses $deplibs; put it back here # so that -L comes before libs that need it for instance... if test lib,link = "$linkmode,$pass"; then ## FIXME: Find the place where the list is rebuilt in the wrong ## order, and fix it there properly tmp_deplibs= for deplib in $deplibs; do tmp_deplibs="$deplib $tmp_deplibs" done deplibs=$tmp_deplibs fi if test lib,link = "$linkmode,$pass" || test prog,scan = "$linkmode,$pass"; then libs=$deplibs deplibs= fi if test prog = "$linkmode"; then case $pass in dlopen) libs=$dlfiles ;; dlpreopen) libs=$dlprefiles ;; link) libs="$deplibs %DEPLIBS% $dependency_libs" ;; esac fi if test lib,dlpreopen = "$linkmode,$pass"; then # Collect and forward deplibs of preopened libtool libs for lib in $dlprefiles; do # Ignore non-libtool-libs dependency_libs= func_resolve_sysroot "$lib" case $lib in *.la) func_source "$func_resolve_sysroot_result" ;; esac # Collect preopened libtool deplibs, except any this library # has declared as weak libs for deplib in $dependency_libs; do func_basename "$deplib" deplib_base=$func_basename_result case " $weak_libs " in *" $deplib_base "*) ;; *) func_append deplibs " $deplib" ;; esac done done libs=$dlprefiles fi if test dlopen = "$pass"; then # Collect dlpreopened libraries save_deplibs=$deplibs deplibs= fi for deplib in $libs; do lib= found=false case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append compiler_flags " $deplib" if test lib = "$linkmode"; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -l*) if test lib != "$linkmode" && test prog != "$linkmode"; then func_warning "'-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test lib = "$linkmode"; then searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path" else searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path" fi for searchdir in $searchdirs; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib=$searchdir/lib$name$search_ext if test -f "$lib"; then if test .la = "$search_ext"; then found=: else found=false fi break 2 fi done done if $found; then # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test yes = "$allow_libtool_libs_with_static_runtimes"; then case " $predeps $postdeps " in *" $deplib "*) if func_lalib_p "$lib"; then library_names= old_library= func_source "$lib" for l in $old_library $library_names; do ll=$l done if test "X$ll" = "X$old_library"; then # only static version available found=false func_dirname "$lib" "" "." ladir=$func_dirname_result lib=$ladir/$old_library if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test lib = "$linkmode" && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi else # deplib doesn't seem to be a libtool library if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test lib = "$linkmode" && newdependency_libs="$deplib $newdependency_libs" fi continue fi ;; # -l *.ltframework) if test prog,link = "$linkmode,$pass"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test lib = "$linkmode"; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test conv = "$pass" && continue newdependency_libs="$deplib $newdependency_libs" func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; prog) if test conv = "$pass"; then deplibs="$deplib $deplibs" continue fi if test scan = "$pass"; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; *) func_warning "'-L' is ignored for archives/objects" ;; esac # linkmode continue ;; # -L -R*) if test link = "$pass"; then func_stripname '-R' '' "$deplib" func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) func_resolve_sysroot "$deplib" lib=$func_resolve_sysroot_result ;; *.$libext) if test conv = "$pass"; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) # Linking convenience modules into shared libraries is allowed, # but linking other static libraries is non-portable. case " $dlpreconveniencelibs " in *" $deplib "*) ;; *) valid_a_lib=false case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` if eval "\$ECHO \"$deplib\"" 2>/dev/null | $SED 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=: fi ;; pass_all) valid_a_lib=: ;; esac if $valid_a_lib; then echo $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" else echo $ECHO "*** Warning: Trying to link with static lib archive $deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because the file extensions .$libext of this argument makes me believe" echo "*** that it is just a static archive that I should not use here." fi ;; esac continue ;; prog) if test link != "$pass"; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test conv = "$pass"; then deplibs="$deplib $deplibs" elif test prog = "$linkmode"; then if test dlpreopen = "$pass" || test yes != "$dlopen_support" || test no = "$build_libtool_libs"; then # If there is no dlopen support or we're linking statically, # we need to preload. func_append newdlprefiles " $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append newdlfiles " $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=: continue ;; esac # case $deplib $found || test -f "$lib" \ || func_fatal_error "cannot find the library '$lib' or unhandled argument '$deplib'" # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$lib" \ || func_fatal_error "'$lib' is not a valid libtool archive" func_dirname "$lib" "" "." ladir=$func_dirname_result dlname= dlopen= dlpreopen= libdir= library_names= old_library= inherited_linker_flags= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file func_source "$lib" # Convert "-framework foo" to "foo.ltframework" if test -n "$inherited_linker_flags"; then tmp_inherited_linker_flags=`$ECHO "$inherited_linker_flags" | $SED 's/-framework \([^ $]*\)/\1.ltframework/g'` for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do case " $new_inherited_linker_flags " in *" $tmp_inherited_linker_flag "*) ;; *) func_append new_inherited_linker_flags " $tmp_inherited_linker_flag";; esac done fi dependency_libs=`$ECHO " $dependency_libs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` if test lib,link = "$linkmode,$pass" || test prog,scan = "$linkmode,$pass" || { test prog != "$linkmode" && test lib != "$linkmode"; }; then test -n "$dlopen" && func_append dlfiles " $dlopen" test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen" fi if test conv = "$pass"; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then func_fatal_error "cannot find name of link library for '$lib'" fi # It is a libtool convenience library, so add in its objects. func_append convenience " $ladir/$objdir/$old_library" func_append old_convenience " $ladir/$objdir/$old_library" elif test prog != "$linkmode" && test lib != "$linkmode"; then func_fatal_error "'$lib' is not a convenience library" fi tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if $opt_preserve_dup_deps; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done continue fi # $pass = conv # Get the name of the library we link against. linklib= if test -n "$old_library" && { test yes = "$prefer_static_libs" || test built,no = "$prefer_static_libs,$installed"; }; then linklib=$old_library else for l in $old_library $library_names; do linklib=$l done fi if test -z "$linklib"; then func_fatal_error "cannot find name of link library for '$lib'" fi # This library was specified with -dlopen. if test dlopen = "$pass"; then test -z "$libdir" \ && func_fatal_error "cannot -dlopen a convenience library: '$lib'" if test -z "$dlname" || test yes != "$dlopen_support" || test no = "$build_libtool_libs" then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. func_append dlprefiles " $lib $dependency_libs" else func_append newdlfiles " $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir=$ladir ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then func_warning "cannot determine absolute directory name of '$ladir'" func_warning "passing it literally to the linker, although it might fail" abs_ladir=$ladir fi ;; esac func_basename "$lib" laname=$func_basename_result # Find the relevant object directory and library name. if test yes = "$installed"; then if test ! -f "$lt_sysroot$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then func_warning "library '$lib' was moved." dir=$ladir absdir=$abs_ladir libdir=$abs_ladir else dir=$lt_sysroot$libdir absdir=$lt_sysroot$libdir fi test yes = "$hardcode_automatic" && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir=$ladir absdir=$abs_ladir # Remove this search path later func_append notinst_path " $abs_ladir" else dir=$ladir/$objdir absdir=$abs_ladir/$objdir # Remove this search path later func_append notinst_path " $abs_ladir" fi fi # $installed = yes func_stripname 'lib' '.la' "$laname" name=$func_stripname_result # This library was specified with -dlpreopen. if test dlpreopen = "$pass"; then if test -z "$libdir" && test prog = "$linkmode"; then func_fatal_error "only libraries may -dlpreopen a convenience library: '$lib'" fi case $host in # special handling for platforms with PE-DLLs. *cygwin* | *mingw* | *cegcc* ) # Linker will automatically link against shared library if both # static and shared are present. Therefore, ensure we extract # symbols from the import library if a shared library is present # (otherwise, the dlopen module name will be incorrect). We do # this by putting the import library name into $newdlprefiles. # We recover the dlopen module name by 'saving' the la file # name in a special purpose variable, and (later) extracting the # dlname from the la file. if test -n "$dlname"; then func_tr_sh "$dir/$linklib" eval "libfile_$func_tr_sh_result=\$abs_ladir/\$laname" func_append newdlprefiles " $dir/$linklib" else func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" fi ;; * ) # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then func_append newdlprefiles " $dir/$dlname" else func_append newdlprefiles " $dir/$linklib" fi ;; esac fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test lib = "$linkmode"; then deplibs="$dir/$old_library $deplibs" elif test prog,link = "$linkmode,$pass"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test prog = "$linkmode" && test link != "$pass"; then func_append newlib_search_path " $ladir" deplibs="$lib $deplibs" linkalldeplibs=false if test no != "$link_all_deplibs" || test -z "$library_names" || test no = "$build_libtool_libs"; then linkalldeplibs=: fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; esac # Need to link against all dependency_libs? if $linkalldeplibs; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if $opt_preserve_dup_deps; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done # for deplib continue fi # $linkmode = prog... if test prog,link = "$linkmode,$pass"; then if test -n "$library_names" && { { test no = "$prefer_static_libs" || test built,yes = "$prefer_static_libs,$installed"; } || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath"; then # Make sure the rpath contains only unique directories. case $temp_rpath: in *"$absdir:"*) ;; *) func_append temp_rpath "$absdir:" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi # $linkmode,$pass = prog,link... if $alldeplibs && { test pass_all = "$deplibs_check_method" || { test yes = "$build_libtool_libs" && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test built = "$use_static_libs" && test yes = "$installed"; then use_static_libs=no fi if test -n "$library_names" && { test no = "$use_static_libs" || test -z "$old_library"; }; then case $host in *cygwin* | *mingw* | *cegcc*) # No point in relinking DLLs because paths are not encoded func_append notinst_deplibs " $lib" need_relink=no ;; *) if test no = "$installed"; then func_append notinst_deplibs " $lib" need_relink=yes fi ;; esac # This is a shared library # Warn about portability, can't link against -module's on some # systems (darwin). Don't bleat about dlopened modules though! dlopenmodule= for dlpremoduletest in $dlprefiles; do if test "X$dlpremoduletest" = "X$lib"; then dlopenmodule=$dlpremoduletest break fi done if test -z "$dlopenmodule" && test yes = "$shouldnotlink" && test link = "$pass"; then echo if test prog = "$linkmode"; then $ECHO "*** Warning: Linking the executable $output against the loadable module" else $ECHO "*** Warning: Linking the shared library $output against the loadable module" fi $ECHO "*** $linklib is not portable!" fi if test lib = "$linkmode" && test yes = "$hardcode_into_libs"; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names shift realname=$1 shift libname=`eval "\\$ECHO \"$libname_spec\""` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname=$dlname elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw* | *cegcc*) func_arith $current - $age major=$func_arith_result versuffix=-$major ;; esac eval soname=\"$soname_spec\" else soname=$realname fi # Make a new name for the extract_expsyms_cmds to use soroot=$soname func_basename "$soroot" soname=$func_basename_result func_stripname 'lib' '.dll' "$soname" newlib=libimp-$func_stripname_result.a # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else func_verbose "extracting exported symbol list from '$soname'" func_execute_cmds "$extract_expsyms_cmds" 'exit $?' fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else func_verbose "generating import library for '$soname'" func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?' fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test prog = "$linkmode" || test relink != "$opt_mode"; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test no = "$hardcode_direct"; then add=$dir/$linklib case $host in *-*-sco3.2v5.0.[024]*) add_dir=-L$dir ;; *-*-sysv4*uw2*) add_dir=-L$dir ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir=-L$dir ;; *-*-darwin* ) # if the lib is a (non-dlopened) module then we cannot # link against it, someone is ignoring the earlier warnings if /usr/bin/file -L $add 2> /dev/null | $GREP ": [^:]* bundle" >/dev/null; then if test "X$dlopenmodule" != "X$lib"; then $ECHO "*** Warning: lib $linklib is a module, not a shared library" if test -z "$old_library"; then echo echo "*** And there doesn't seem to be a static archive available" echo "*** The link will probably fail, sorry" else add=$dir/$old_library fi elif test -n "$old_library"; then add=$dir/$old_library fi fi esac elif test no = "$hardcode_minus_L"; then case $host in *-*-sunos*) add_shlibpath=$dir ;; esac add_dir=-L$dir add=-l$name elif test no = "$hardcode_shlibpath_var"; then add_shlibpath=$dir add=-l$name else lib_linked=no fi ;; relink) if test yes = "$hardcode_direct" && test no = "$hardcode_direct_absolute"; then add=$dir/$linklib elif test yes = "$hardcode_minus_L"; then add_dir=-L$absdir # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add=-l$name elif test yes = "$hardcode_shlibpath_var"; then add_shlibpath=$dir add=-l$name else lib_linked=no fi ;; *) lib_linked=no ;; esac if test yes != "$lib_linked"; then func_fatal_configuration "unsupported hardcode properties" fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) func_append compile_shlibpath "$add_shlibpath:" ;; esac fi if test prog = "$linkmode"; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test yes != "$hardcode_direct" && test yes != "$hardcode_minus_L" && test yes = "$hardcode_shlibpath_var"; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac fi fi fi if test prog = "$linkmode" || test relink = "$opt_mode"; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test yes = "$hardcode_direct" && test no = "$hardcode_direct_absolute"; then add=$libdir/$linklib elif test yes = "$hardcode_minus_L"; then add_dir=-L$libdir add=-l$name elif test yes = "$hardcode_shlibpath_var"; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac add=-l$name elif test yes = "$hardcode_automatic"; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib"; then add=$inst_prefix_dir$libdir/$linklib else add=$libdir/$linklib fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir=-L$libdir # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add=-l$name fi if test prog = "$linkmode"; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test prog = "$linkmode"; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test unsupported != "$hardcode_direct"; then test -n "$old_library" && linklib=$old_library compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test yes = "$build_libtool_libs"; then # Not a shared library if test pass_all != "$deplibs_check_method"; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. echo $ECHO "*** Warning: This system cannot link to static lib archive $lib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have." if test yes = "$module"; then echo "*** But as you try to build a module library, libtool will still create " echo "*** a static module, that should work as long as the dlopening application" echo "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using 'nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** 'nm' from GNU binutils and a full rebuild may help." fi if test no = "$build_old_libs"; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test lib = "$linkmode"; then if test -n "$dependency_libs" && { test yes != "$hardcode_into_libs" || test yes = "$build_old_libs" || test yes = "$link_static"; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) func_stripname '-R' '' "$libdir" temp_xrpath=$func_stripname_result case " $xrpath " in *" $temp_xrpath "*) ;; *) func_append xrpath " $temp_xrpath";; esac;; *) func_append temp_deplibs " $libdir";; esac done dependency_libs=$temp_deplibs fi func_append newlib_search_path " $absdir" # Link against this library test no = "$link_static" && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result";; *) func_resolve_sysroot "$deplib" ;; esac if $opt_preserve_dup_deps; then case "$tmp_libs " in *" $func_resolve_sysroot_result "*) func_append specialdeplibs " $func_resolve_sysroot_result" ;; esac fi func_append tmp_libs " $func_resolve_sysroot_result" done if test no != "$link_all_deplibs"; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do path= case $deplib in -L*) path=$deplib ;; *.la) func_resolve_sysroot "$deplib" deplib=$func_resolve_sysroot_result func_dirname "$deplib" "" "." dir=$func_dirname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir=$dir ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then func_warning "cannot determine absolute directory name of '$dir'" absdir=$dir fi ;; esac if $GREP "^installed=no" $deplib > /dev/null; then case $host in *-*-darwin*) depdepl= eval deplibrary_names=`$SED -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names"; then for tmp in $deplibrary_names; do depdepl=$tmp done if test -f "$absdir/$objdir/$depdepl"; then depdepl=$absdir/$objdir/$depdepl darwin_install_name=`$OTOOL -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` if test -z "$darwin_install_name"; then darwin_install_name=`$OTOOL64 -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` fi func_append compiler_flags " $wl-dylib_file $wl$darwin_install_name:$depdepl" func_append linker_flags " -dylib_file $darwin_install_name:$depdepl" path= fi fi ;; *) path=-L$absdir/$objdir ;; esac else eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "'$deplib' is not a valid libtool archive" test "$absdir" != "$libdir" && \ func_warning "'$deplib' seems to be moved" path=-L$absdir fi ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs if test link = "$pass"; then if test prog = "$linkmode"; then compile_deplibs="$new_inherited_linker_flags $compile_deplibs" finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs" else compiler_flags="$compiler_flags "`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` fi fi dependency_libs=$newdependency_libs if test dlpreopen = "$pass"; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test dlopen != "$pass"; then test conv = "$pass" || { # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) func_append lib_search_path " $dir" ;; esac done newlib_search_path= } if test prog,link = "$linkmode,$pass"; then vars="compile_deplibs finalize_deplibs" else vars=deplibs fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) func_append tmp_libs " $deplib" ;; esac ;; *) func_append tmp_libs " $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i= ;; esac if test -n "$i"; then func_append tmp_libs " $i" fi done dependency_libs=$tmp_libs done # for pass if test prog = "$linkmode"; then dlfiles=$newdlfiles fi if test prog = "$linkmode" || test lib = "$linkmode"; then dlprefiles=$newdlprefiles fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test no != "$dlself"; then func_warning "'-dlopen' is ignored for archives" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "'-l' and '-L' are ignored for archives" ;; esac test -n "$rpath" && \ func_warning "'-rpath' is ignored for archives" test -n "$xrpath" && \ func_warning "'-R' is ignored for archives" test -n "$vinfo" && \ func_warning "'-version-info/-version-number' is ignored for archives" test -n "$release" && \ func_warning "'-release' is ignored for archives" test -n "$export_symbols$export_symbols_regex" && \ func_warning "'-export-symbols' is ignored for archives" # Now set the variables for building old libraries. build_libtool_libs=no oldlibs=$output func_append objs "$old_deplibs" ;; lib) # Make sure we only generate libraries of the form 'libNAME.la'. case $outputname in lib*) func_stripname 'lib' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) test no = "$module" \ && func_fatal_help "libtool library '$output' must begin with 'lib'" if test no != "$need_lib_prefix"; then # Add the "lib" prefix for modules if required func_stripname '' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else func_stripname '' '.la' "$outputname" libname=$func_stripname_result fi ;; esac if test -n "$objs"; then if test pass_all != "$deplibs_check_method"; then func_fatal_error "cannot build libtool library '$output' from non-libtool objects on this host:$objs" else echo $ECHO "*** Warning: Linking the shared library $output against the non-libtool" $ECHO "*** objects $objs is not portable!" func_append libobjs " $objs" fi fi test no = "$dlself" \ || func_warning "'-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test 1 -lt "$#" \ && func_warning "ignoring multiple '-rpath's for a libtool library" install_libdir=$1 oldlibs= if test -z "$rpath"; then if test yes = "$build_libtool_libs"; then # Building a libtool convenience library. # Some compilers have problems with a '.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi test -n "$vinfo" && \ func_warning "'-version-info/-version-number' is ignored for convenience libraries" test -n "$release" && \ func_warning "'-release' is ignored for convenience libraries" else # Parse the version information argument. save_ifs=$IFS; IFS=: set dummy $vinfo 0 0 0 shift IFS=$save_ifs test -n "$7" && \ func_fatal_help "too many parameters to '-version-info'" # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major=$1 number_minor=$2 number_revision=$3 # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # that has an extra 1 added just for fun # case $version_type in # correct linux to gnu/linux during the next big refactor darwin|linux|osf|windows|none) func_arith $number_major + $number_minor current=$func_arith_result age=$number_minor revision=$number_revision ;; freebsd-aout|freebsd-elf|qnx|sunos) current=$number_major revision=$number_minor age=0 ;; irix|nonstopux) func_arith $number_major + $number_minor current=$func_arith_result age=$number_minor revision=$number_minor lt_irix_increment=no ;; esac ;; no) current=$1 revision=$2 age=$3 ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "CURRENT '$current' must be a nonnegative integer" func_fatal_error "'$vinfo' is not valid version information" ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "REVISION '$revision' must be a nonnegative integer" func_fatal_error "'$vinfo' is not valid version information" ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "AGE '$age' must be a nonnegative integer" func_fatal_error "'$vinfo' is not valid version information" ;; esac if test "$age" -gt "$current"; then func_error "AGE '$age' is greater than the current interface number '$current'" func_fatal_error "'$vinfo' is not valid version information" fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header func_arith $current - $age major=.$func_arith_result versuffix=$major.$age.$revision # Darwin ld doesn't like 0 for these options... func_arith $current + 1 minor_current=$func_arith_result xlcverstring="$wl-compatibility_version $wl$minor_current $wl-current_version $wl$minor_current.$revision" verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" # On Darwin other compilers case $CC in nagfor*) verstring="$wl-compatibility_version $wl$minor_current $wl-current_version $wl$minor_current.$revision" ;; *) verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" ;; esac ;; freebsd-aout) major=.$current versuffix=.$current.$revision ;; freebsd-elf) major=.$current versuffix=.$current ;; irix | nonstopux) if test no = "$lt_irix_increment"; then func_arith $current - $age else func_arith $current - $age + 1 fi major=$func_arith_result case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring=$verstring_prefix$major.$revision # Add in all the interfaces that we are compatible with. loop=$revision while test 0 -ne "$loop"; do func_arith $revision - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring=$verstring_prefix$major.$iface:$verstring done # Before this point, $major must not contain '.'. major=.$major versuffix=$major.$revision ;; linux) # correct to gnu/linux during the next big refactor func_arith $current - $age major=.$func_arith_result versuffix=$major.$age.$revision ;; osf) func_arith $current - $age major=.$func_arith_result versuffix=.$current.$age.$revision verstring=$current.$age.$revision # Add in all the interfaces that we are compatible with. loop=$age while test 0 -ne "$loop"; do func_arith $current - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring=$verstring:$iface.0 done # Make executables depend on our current version. func_append verstring ":$current.0" ;; qnx) major=.$current versuffix=.$current ;; sunos) major=.$current versuffix=.$current.$revision ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 file systems. func_arith $current - $age major=$func_arith_result versuffix=-$major ;; *) func_fatal_configuration "unknown library version type '$version_type'" ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring=0.0 ;; esac if test no = "$need_version"; then versuffix= else versuffix=.0.0 fi fi # Remove version info from name if versioning should be avoided if test yes,no = "$avoid_version,$need_version"; then major= versuffix= verstring= fi # Check to see if the archive will have undefined symbols. if test yes = "$allow_undefined"; then if test unsupported = "$allow_undefined_flag"; then if test yes = "$build_old_libs"; then func_warning "undefined symbols not allowed in $host shared libraries; building static only" build_libtool_libs=no else func_fatal_error "can't build $host shared library unless -no-undefined is specified" fi fi else # Don't allow undefined symbols. allow_undefined_flag=$no_undefined_flag fi fi func_generate_dlsyms "$libname" "$libname" : func_append libobjs " $symfileobj" test " " = "$libobjs" && libobjs= if test relink != "$opt_mode"; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$ECHO "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext | *.gcno) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/$libname$release.*) if test -n "$precious_files_regex"; then if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi func_append removelist " $p" ;; *) ;; esac done test -n "$removelist" && \ func_show_eval "${RM}r \$removelist" fi # Now set the variables for building old libraries. if test yes = "$build_old_libs" && test convenience != "$build_libtool_libs"; then func_append oldlibs " $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.$libext$/d; $lo2o" | $NL2SP` fi # Eliminate all temporary directories. #for path in $notinst_path; do # lib_search_path=`$ECHO "$lib_search_path " | $SED "s% $path % %g"` # deplibs=`$ECHO "$deplibs " | $SED "s% -L$path % %g"` # dependency_libs=`$ECHO "$dependency_libs " | $SED "s% -L$path % %g"` #done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do func_replace_sysroot "$libdir" func_append temp_xrpath " -R$func_replace_sysroot_result" case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done if test yes != "$hardcode_into_libs" || test yes = "$build_old_libs"; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles=$dlfiles dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) func_append dlfiles " $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles=$dlprefiles dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) func_append dlprefiles " $lib" ;; esac done if test yes = "$build_libtool_libs"; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc* | *-*-haiku*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework func_append deplibs " System.ltframework" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test yes = "$build_libtool_need_lc"; then func_append deplibs " -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release= versuffix= major= newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $opt_dry_run || $RM conftest.c cat > conftest.c </dev/null` $nocaseglob else potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null` fi for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null | $GREP " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib=$potent_lib while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | $SED 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib=$potliblink;; *) potlib=`$ECHO "$potlib" | $SED 's|[^/]*$||'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null | $SED -e 10q | $EGREP "$file_magic_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib= break 2 fi done done fi if test -n "$a_deplib"; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib"; then $ECHO "*** with $libname but no candidates were found. (...for file magic test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a file magic. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` for a_deplib in $deplibs; do case $a_deplib in -l*) func_stripname -l '' "$a_deplib" name=$func_stripname_result if test yes = "$allow_libtool_libs_with_static_runtimes"; then case " $predeps $postdeps " in *" $a_deplib "*) func_append newdeplibs " $a_deplib" a_deplib= ;; esac fi if test -n "$a_deplib"; then libname=`eval "\\$ECHO \"$libname_spec\""` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib=$potent_lib # see symlink-check above in file_magic test if eval "\$ECHO \"$potent_lib\"" 2>/dev/null | $SED 10q | \ $EGREP "$match_pattern_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib= break 2 fi done done fi if test -n "$a_deplib"; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib"; then $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a regex pattern. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; none | unknown | *) newdeplibs= tmp_deplibs=`$ECHO " $deplibs" | $SED 's/ -lc$//; s/ -[LR][^ ]*//g'` if test yes = "$allow_libtool_libs_with_static_runtimes"; then for i in $predeps $postdeps; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$ECHO " $tmp_deplibs" | $SED "s|$i||"` done fi case $tmp_deplibs in *[!\ \ ]*) echo if test none = "$deplibs_check_method"; then echo "*** Warning: inter-library dependencies are not supported in this platform." else echo "*** Warning: inter-library dependencies are not known to be supported." fi echo "*** All declared inter-library dependencies are being dropped." droppeddeps=yes ;; esac ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library with the System framework newdeplibs=`$ECHO " $newdeplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac if test yes = "$droppeddeps"; then if test yes = "$module"; then echo echo "*** Warning: libtool could not satisfy all declared inter-library" $ECHO "*** dependencies of module $libname. Therefore, libtool will create" echo "*** a static module, that should work as long as the dlopening" echo "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using 'nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** 'nm' from GNU binutils and a full rebuild may help." fi if test no = "$build_old_libs"; then oldlibs=$output_objdir/$libname.$libext build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else echo "*** The inter-library dependencies that have been dropped here will be" echo "*** automatically added whenever a program is linked with this library" echo "*** or is declared to -dlopen it." if test no = "$allow_undefined"; then echo echo "*** Since this library must not contain undefined symbols," echo "*** because either the platform does not support them or" echo "*** it was explicitly requested with -no-undefined," echo "*** libtool will only create a static version of it." if test no = "$build_old_libs"; then oldlibs=$output_objdir/$libname.$libext build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" case $host in *-*-darwin*) newdeplibs=`$ECHO " $newdeplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` new_inherited_linker_flags=`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` deplibs=`$ECHO " $deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done deplibs=$new_libs # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test yes = "$build_libtool_libs"; then # Remove $wl instances when linking with ld. # FIXME: should test the right _cmds variable. case $archive_cmds in *\$LD\ *) wl= ;; esac if test yes = "$hardcode_into_libs"; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath=$finalize_rpath test relink = "$opt_mode" || rpath=$compile_rpath$rpath for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then func_replace_sysroot "$libdir" libdir=$func_replace_sysroot_result if test -z "$hardcode_libdirs"; then hardcode_libdirs=$libdir else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append dep_rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir=$hardcode_libdirs eval "dep_rpath=\"$hardcode_libdir_flag_spec\"" fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath=$finalize_shlibpath test relink = "$opt_mode" || shlibpath=$compile_shlibpath$shlibpath if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names shift realname=$1 shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname=$realname fi if test -z "$dlname"; then dlname=$soname fi lib=$output_objdir/$realname linknames= for link do func_append linknames " $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$ECHO "$libobjs" | $SP2NL | $SED "$lo2o" | $NL2SP` test "X$libobjs" = "X " && libobjs= delfiles= if test -n "$export_symbols" && test -n "$include_expsyms"; then $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp" export_symbols=$output_objdir/$libname.uexp func_append delfiles " $export_symbols" fi orig_export_symbols= case $host_os in cygwin* | mingw* | cegcc*) if test -n "$export_symbols" && test -z "$export_symbols_regex"; then # exporting using user supplied symfile func_dll_def_p "$export_symbols" || { # and it's NOT already a .def file. Must figure out # which of the given symbols are data symbols and tag # them as such. So, trigger use of export_symbols_cmds. # export_symbols gets reassigned inside the "prepare # the list of exported symbols" if statement, so the # include_expsyms logic still works. orig_export_symbols=$export_symbols export_symbols= always_export_symbols=yes } fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test yes = "$always_export_symbols" || test -n "$export_symbols_regex"; then func_verbose "generating symbol list for '$libname.la'" export_symbols=$output_objdir/$libname.exp $opt_dry_run || $RM $export_symbols cmds=$export_symbols_cmds save_ifs=$IFS; IFS='~' for cmd1 in $cmds; do IFS=$save_ifs # Take the normal branch if the nm_file_list_spec branch # doesn't work or if tool conversion is not needed. case $nm_file_list_spec~$to_tool_file_cmd in *~func_convert_file_noop | *~func_convert_file_msys_to_w32 | ~*) try_normal_branch=yes eval cmd=\"$cmd1\" func_len " $cmd" len=$func_len_result ;; *) try_normal_branch=no ;; esac if test yes = "$try_normal_branch" \ && { test "$len" -lt "$max_cmd_len" \ || test "$max_cmd_len" -le -1; } then func_show_eval "$cmd" 'exit $?' skipped_export=false elif test -n "$nm_file_list_spec"; then func_basename "$output" output_la=$func_basename_result save_libobjs=$libobjs save_output=$output output=$output_objdir/$output_la.nm func_to_tool_file "$output" libobjs=$nm_file_list_spec$func_to_tool_file_result func_append delfiles " $output" func_verbose "creating $NM input file list: $output" for obj in $save_libobjs; do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > "$output" eval cmd=\"$cmd1\" func_show_eval "$cmd" 'exit $?' output=$save_output libobjs=$save_libobjs skipped_export=false else # The command line is too long to execute in one step. func_verbose "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS=$save_ifs if test -n "$export_symbols_regex" && test : != "$skipped_export"; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols=$export_symbols test -n "$orig_export_symbols" && tmp_export_symbols=$orig_export_symbols $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test : != "$skipped_export" && test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for '$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands, which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) func_append tmp_deplibs " $test_deplib" ;; esac done deplibs=$tmp_deplibs if test -n "$convenience"; then if test -n "$whole_archive_flag_spec" && test yes = "$compiler_needs_object" && test -z "$libobjs"; then # extract the archives, so we have objects to list. # TODO: could optimize this to just extract one archive. whole_archive_flag_spec= fi if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= else gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $convenience func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi fi if test yes = "$thread_safe" && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" func_append linker_flags " $flag" fi # Make a backup of the uninstalled library when relinking if test relink = "$opt_mode"; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test yes = "$module" && test -n "$module_cmds"; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test : != "$skipped_export" && func_len " $test_cmds" && len=$func_len_result && test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise # or, if using GNU ld and skipped_export is not :, use a linker # script. # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output func_basename "$output" output_la=$func_basename_result # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= last_robj= k=1 if test -n "$save_libobjs" && test : != "$skipped_export" && test yes = "$with_gnu_ld"; then output=$output_objdir/$output_la.lnkscript func_verbose "creating GNU ld script: $output" echo 'INPUT (' > $output for obj in $save_libobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done echo ')' >> $output func_append delfiles " $output" func_to_tool_file "$output" output=$func_to_tool_file_result elif test -n "$save_libobjs" && test : != "$skipped_export" && test -n "$file_list_spec"; then output=$output_objdir/$output_la.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test yes = "$compiler_needs_object"; then firstobj="$1 " shift fi for obj do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done func_append delfiles " $output" func_to_tool_file "$output" output=$firstobj\"$file_list_spec$func_to_tool_file_result\" else if test -n "$save_libobjs"; then func_verbose "creating reloadable object files..." output=$output_objdir/$output_la-$k.$objext eval test_cmds=\"$reload_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 # Loop over the list of objects to be linked. for obj in $save_libobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result if test -z "$objlist" || test "$len" -lt "$max_cmd_len"; then func_append objlist " $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test 1 -eq "$k"; then # The first file doesn't have a previous command to add. reload_objs=$objlist eval concat_cmds=\"$reload_cmds\" else # All subsequent reloadable object files will link in # the last one created. reload_objs="$objlist $last_robj" eval concat_cmds=\"\$concat_cmds~$reload_cmds~\$RM $last_robj\" fi last_robj=$output_objdir/$output_la-$k.$objext func_arith $k + 1 k=$func_arith_result output=$output_objdir/$output_la-$k.$objext objlist=" $obj" func_len " $last_robj" func_arith $len0 + $func_len_result len=$func_arith_result fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ reload_objs="$objlist $last_robj" eval concat_cmds=\"\$concat_cmds$reload_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi func_append delfiles " $output" else output= fi ${skipped_export-false} && { func_verbose "generating symbol list for '$libname.la'" export_symbols=$output_objdir/$libname.exp $opt_dry_run || $RM $export_symbols libobjs=$output # Append the command to create the export file. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi } test -n "$save_libobjs" && func_verbose "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs=$IFS; IFS='~' for cmd in $concat_cmds; do IFS=$save_ifs $opt_quiet || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test relink = "$opt_mode"; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS=$save_ifs if test -n "$export_symbols_regex" && ${skipped_export-false}; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi ${skipped_export-false} && { if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols=$export_symbols test -n "$orig_export_symbols" && tmp_export_symbols=$orig_export_symbols $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for '$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands, which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi } libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test yes = "$module" && test -n "$module_cmds"; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi fi if test -n "$delfiles"; then # Append the command to remove temporary files to $cmds. eval cmds=\"\$cmds~\$RM $delfiles\" fi # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi save_ifs=$IFS; IFS='~' for cmd in $cmds; do IFS=$sp$nl eval cmd=\"$cmd\" IFS=$save_ifs $opt_quiet || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test relink = "$opt_mode"; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS=$save_ifs # Restore the uninstalled library and exit if test relink = "$opt_mode"; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then func_show_eval '${RM}r "$gentop"' fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?' fi done # If -module or -export-dynamic was specified, set the dlname. if test yes = "$module" || test yes = "$export_dynamic"; then # On all known operating systems, these are identical. dlname=$soname fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test no != "$dlself"; then func_warning "'-dlopen' is ignored for objects" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "'-l' and '-L' are ignored for objects" ;; esac test -n "$rpath" && \ func_warning "'-rpath' is ignored for objects" test -n "$xrpath" && \ func_warning "'-R' is ignored for objects" test -n "$vinfo" && \ func_warning "'-version-info' is ignored for objects" test -n "$release" && \ func_warning "'-release' is ignored for objects" case $output in *.lo) test -n "$objs$old_deplibs" && \ func_fatal_error "cannot build library object '$output' from non-libtool objects" libobj=$output func_lo2o "$libobj" obj=$func_lo2o_result ;; *) libobj= obj=$output ;; esac # Delete the old objects. $opt_dry_run || $RM $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec and hope we can get by with # turning comma into space.. wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\" reload_conv_objs=$reload_objs\ `$ECHO "$tmp_whole_archive_flags" | $SED 's|,| |g'` else gentop=$output_objdir/${obj}x func_append generated " $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # If we're not building shared, we need to use non_pic_objs test yes = "$build_libtool_libs" || libobjs=$non_pic_objects # Create the old-style object. reload_objs=$objs$old_deplibs' '`$ECHO "$libobjs" | $SP2NL | $SED "/\.$libext$/d; /\.lib$/d; $lo2o" | $NL2SP`' '$reload_conv_objs output=$obj func_execute_cmds "$reload_cmds" 'exit $?' # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS fi test yes = "$build_libtool_libs" || { if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $opt_dry_run || eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS } if test -n "$pic_flag" || test default != "$pic_mode"; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output=$libobj func_execute_cmds "$reload_cmds" 'exit $?' fi if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) func_stripname '' '.exe' "$output" output=$func_stripname_result.exe;; esac test -n "$vinfo" && \ func_warning "'-version-info' is ignored for programs" test -n "$release" && \ func_warning "'-release' is ignored for programs" $preload \ && test unknown,unknown,unknown = "$dlopen_support,$dlopen_self,$dlopen_self_static" \ && func_warning "'LT_INIT([dlopen])' not used. Assuming no dlopen support." case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's/ -lc / System.ltframework /'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac case $host in *-*-darwin*) # Don't allow lazy linking, it breaks C++ global constructors # But is supposedly fixed on 10.4 or later (yay!). if test CXX = "$tagname"; then case ${MACOSX_DEPLOYMENT_TARGET-10.0} in 10.[0123]) func_append compile_command " $wl-bind_at_load" func_append finalize_command " $wl-bind_at_load" ;; esac fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done compile_deplibs=$new_libs func_append compile_command " $compile_deplibs" func_append finalize_command " $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs=$libdir else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "$libdir" | $SED -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; ::) dllsearchpath=$libdir;; *) func_append dllsearchpath ":$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir=$hardcode_libdirs eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath=$rpath rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs=$libdir else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) func_append finalize_perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir=$hardcode_libdirs eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath=$rpath if test -n "$libobjs" && test yes = "$build_old_libs"; then # Transform all the library objects into standard objects. compile_command=`$ECHO "$compile_command" | $SP2NL | $SED "$lo2o" | $NL2SP` finalize_command=`$ECHO "$finalize_command" | $SP2NL | $SED "$lo2o" | $NL2SP` fi func_generate_dlsyms "$outputname" "@PROGRAM@" false # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=: case $host in *cegcc* | *mingw32ce*) # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway. wrappers_required=false ;; *cygwin* | *mingw* ) test yes = "$build_libtool_libs" || wrappers_required=false ;; *) if test no = "$need_relink" || test yes != "$build_libtool_libs"; then wrappers_required=false fi ;; esac $wrappers_required || { # Replace the output file specification. compile_command=`$ECHO "$compile_command" | $SED 's%@OUTPUT@%'"$output"'%g'` link_command=$compile_command$compile_rpath # We have no uninstalled library dependencies, so finalize right now. exit_status=0 func_show_eval "$link_command" 'exit_status=$?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Delete the generated files. if test -f "$output_objdir/${outputname}S.$objext"; then func_show_eval '$RM "$output_objdir/${outputname}S.$objext"' fi exit $exit_status } if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do func_append rpath "$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test yes = "$no_install"; then # We don't need to create a wrapper script. link_command=$compile_var$compile_command$compile_rpath # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $opt_dry_run || $RM $output # Link the executable and exit func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi exit $EXIT_SUCCESS fi case $hardcode_action,$fast_install in relink,*) # Fast installation is not supported link_command=$compile_var$compile_command$compile_rpath relink_command=$finalize_var$finalize_command$finalize_rpath func_warning "this platform does not like uninstalled shared libraries" func_warning "'$output' will be relinked during installation" ;; *,yes) link_command=$finalize_var$compile_command$finalize_rpath relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'` ;; *,no) link_command=$compile_var$compile_command$compile_rpath relink_command=$finalize_var$finalize_command$finalize_rpath ;; *,needless) link_command=$finalize_var$compile_command$finalize_rpath relink_command= ;; esac # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output_objdir/$outputname" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Now create the wrapper script. func_verbose "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` fi # Only actually do things if not in dry run mode. $opt_dry_run || { # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) func_stripname '' '.exe' "$output" output=$func_stripname_result ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe func_stripname '' '.exe' "$outputname" outputname=$func_stripname_result ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) func_dirname_and_basename "$output" "" "." output_name=$func_basename_result output_path=$func_dirname_result cwrappersource=$output_path/$objdir/lt-$output_name.c cwrapper=$output_path/$output_name.exe $RM $cwrappersource $cwrapper trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 func_emit_cwrapperexe_src > $cwrappersource # The wrapper executable is built using the $host compiler, # because it contains $host paths and files. If cross- # compiling, it, like the target executable, must be # executed on the $host or under an emulation environment. $opt_dry_run || { $LTCC $LTCFLAGS -o $cwrapper $cwrappersource $STRIP $cwrapper } # Now, create the wrapper script for func_source use: func_ltwrapper_scriptname $cwrapper $RM $func_ltwrapper_scriptname_result trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15 $opt_dry_run || { # note: this script will not be executed, so do not chmod. if test "x$build" = "x$host"; then $cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result else func_emit_wrapper no > $func_ltwrapper_scriptname_result fi } ;; * ) $RM $output trap "$RM $output; exit $EXIT_FAILURE" 1 2 15 func_emit_wrapper no > $output chmod +x $output ;; esac } exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do case $build_libtool_libs in convenience) oldobjs="$libobjs_save $symfileobj" addlibs=$convenience build_libtool_libs=no ;; module) oldobjs=$libobjs_save addlibs=$old_convenience build_libtool_libs=no ;; *) oldobjs="$old_deplibs $non_pic_objects" $preload && test -f "$symfileobj" \ && func_append oldobjs " $symfileobj" addlibs=$old_convenience ;; esac if test -n "$addlibs"; then gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $addlibs func_append oldobjs " $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test yes = "$build_libtool_libs"; then cmds=$old_archive_from_new_cmds else # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append oldobjs " $func_extract_archives_result" fi # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do func_basename "$obj" $ECHO "$func_basename_result" done | sort | sort -uc >/dev/null 2>&1); then : else echo "copying selected object files to avoid basename conflicts..." gentop=$output_objdir/${outputname}x func_append generated " $gentop" func_mkdir_p "$gentop" save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do func_basename "$obj" objbase=$func_basename_result case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase func_arith $counter + 1 counter=$func_arith_result case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" func_append oldobjs " $gentop/$newobj" ;; *) func_append oldobjs " $obj" ;; esac done fi func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result eval cmds=\"$old_archive_cmds\" func_len " $cmds" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds elif test -n "$archiver_list_spec"; then func_verbose "using command file archive linking..." for obj in $oldobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > $output_objdir/$libname.libcmd func_to_tool_file "$output_objdir/$libname.libcmd" oldobjs=" $archiver_list_spec$func_to_tool_file_result" cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts func_verbose "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs oldobjs= # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done eval test_cmds=\"$old_archive_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 for obj in $save_oldobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result func_append objlist " $obj" if test "$len" -lt "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj"; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$old_archive_cmds\" objlist= len=$len0 fi done RANLIB=$save_RANLIB oldobjs=$objlist if test -z "$oldobjs"; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi func_execute_cmds "$cmds" 'exit $?' done test -n "$generated" && \ func_show_eval "${RM}r$generated" # Now create the libtool archive. case $output in *.la) old_library= test yes = "$build_old_libs" && old_library=$libname.$libext func_verbose "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL \"$progpath\" $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` if test yes = "$hardcode_automatic"; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test yes = "$installed"; then if test -z "$install_libdir"; then break fi output=$output_objdir/${outputname}i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) func_basename "$deplib" name=$func_basename_result func_resolve_sysroot "$deplib" eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $func_resolve_sysroot_result` test -z "$libdir" && \ func_fatal_error "'$deplib' is not a valid libtool archive" func_append newdependency_libs " ${lt_sysroot:+=}$libdir/$name" ;; -L*) func_stripname -L '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -L$func_replace_sysroot_result" ;; -R*) func_stripname -R '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -R$func_replace_sysroot_result" ;; *) func_append newdependency_libs " $deplib" ;; esac done dependency_libs=$newdependency_libs newdlfiles= for lib in $dlfiles; do case $lib in *.la) func_basename "$lib" name=$func_basename_result eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "'$lib' is not a valid libtool archive" func_append newdlfiles " ${lt_sysroot:+=}$libdir/$name" ;; *) func_append newdlfiles " $lib" ;; esac done dlfiles=$newdlfiles newdlprefiles= for lib in $dlprefiles; do case $lib in *.la) # Only pass preopened files to the pseudo-archive (for # eventual linking with the app. that links it) if we # didn't already link the preopened objects directly into # the library: func_basename "$lib" name=$func_basename_result eval libdir=`$SED -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "'$lib' is not a valid libtool archive" func_append newdlprefiles " ${lt_sysroot:+=}$libdir/$name" ;; esac done dlprefiles=$newdlprefiles else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs=$lib ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlfiles " $abs" done dlfiles=$newdlfiles newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs=$lib ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlprefiles " $abs" done dlprefiles=$newdlprefiles fi $RM $output # place dlname in correct position for cygwin # In fact, it would be nice if we could use this code for all target # systems that can't hard-code library paths into their executables # and that have no shared library path variable independent of PATH, # but it turns out we can't easily determine that from inspecting # libtool variables, so we have to hard-code the OSs to which it # applies here; at the moment, that means platforms that use the PE # object format with DLL files. See the long comment at the top of # tests/bindir.at for full details. tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll) # If a -bindir argument was supplied, place the dll there. if test -n "$bindir"; then func_relative_path "$install_libdir" "$bindir" tdlname=$func_relative_path_result/$dlname else # Otherwise fall back on heuristic. tdlname=../bin/$dlname fi ;; esac $ECHO > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM (GNU $PACKAGE) $VERSION # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Linker flags that cannot go in dependency_libs. inherited_linker_flags='$new_inherited_linker_flags' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Names of additional weak libraries provided by this library weak_library_names='$weak_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test no,yes = "$installed,$need_relink"; then $ECHO >> $output "\ relink_command=\"$relink_command\"" fi done } # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?' ;; esac exit $EXIT_SUCCESS } if test link = "$opt_mode" || test relink = "$opt_mode"; then func_mode_link ${1+"$@"} fi # func_mode_uninstall arg... func_mode_uninstall () { $debug_cmd RM=$nonopt files= rmforce=false exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic=$magic for arg do case $arg in -f) func_append RM " $arg"; rmforce=: ;; -*) func_append RM " $arg" ;; *) func_append files " $arg" ;; esac done test -z "$RM" && \ func_fatal_help "you must specify an RM program" rmdirs= for file in $files; do func_dirname "$file" "" "." dir=$func_dirname_result if test . = "$dir"; then odir=$objdir else odir=$dir/$objdir fi func_basename "$file" name=$func_basename_result test uninstall = "$opt_mode" && odir=$dir # Remember odir for removal later, being careful to avoid duplicates if test clean = "$opt_mode"; then case " $rmdirs " in *" $odir "*) ;; *) func_append rmdirs " $odir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if { test -L "$file"; } >/dev/null 2>&1 || { test -h "$file"; } >/dev/null 2>&1 || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif $rmforce; then continue fi rmfiles=$file case $name in *.la) # Possibly a libtool archive, so verify it. if func_lalib_p "$file"; then func_source $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do func_append rmfiles " $odir/$n" done test -n "$old_library" && func_append rmfiles " $odir/$old_library" case $opt_mode in clean) case " $library_names " in *" $dlname "*) ;; *) test -n "$dlname" && func_append rmfiles " $odir/$dlname" ;; esac test -n "$libdir" && func_append rmfiles " $odir/$name $odir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. func_execute_cmds "$postuninstall_cmds" '$rmforce || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" '$rmforce || exit_status=1' fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if func_lalib_p "$file"; then # Read the .lo file func_source $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" && test none != "$pic_object"; then func_append rmfiles " $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" && test none != "$non_pic_object"; then func_append rmfiles " $dir/$non_pic_object" fi fi ;; *) if test clean = "$opt_mode"; then noexename=$name case $file in *.exe) func_stripname '' '.exe' "$file" file=$func_stripname_result func_stripname '' '.exe' "$name" noexename=$func_stripname_result # $file with .exe has already been added to rmfiles, # add $file without .exe func_append rmfiles " $file" ;; esac # Do a test to see if this is a libtool program. if func_ltwrapper_p "$file"; then if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" relink_command= func_source $func_ltwrapper_scriptname_result func_append rmfiles " $func_ltwrapper_scriptname_result" else relink_command= func_source $dir/$noexename fi # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles func_append rmfiles " $odir/$name $odir/${name}S.$objext" if test yes = "$fast_install" && test -n "$relink_command"; then func_append rmfiles " $odir/lt-$name" fi if test "X$noexename" != "X$name"; then func_append rmfiles " $odir/lt-$noexename.c" fi fi fi ;; esac func_show_eval "$RM $rmfiles" 'exit_status=1' done # Try to remove the $objdir's in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then func_show_eval "rmdir $dir >/dev/null 2>&1" fi done exit $exit_status } if test uninstall = "$opt_mode" || test clean = "$opt_mode"; then func_mode_uninstall ${1+"$@"} fi test -z "$opt_mode" && { help=$generic_help func_fatal_help "you must specify a MODE" } test -z "$exec_cmd" && \ func_fatal_help "invalid operation mode '$opt_mode'" if test -n "$exec_cmd"; then eval exec "$exec_cmd" exit $EXIT_FAILURE fi exit $exit_status # The TAGs below are defined such that we never get into a situation # where we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared build_libtool_libs=no build_old_libs=yes # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: cloog-0.18.2/isl/isl_obj.c0000664000175000017500000002204612254313240012204 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #include #include #include struct isl_int_obj { int ref; isl_ctx *ctx; isl_int v; }; __isl_give isl_int_obj *isl_int_obj_alloc(isl_ctx *ctx, isl_int v) { isl_int_obj *i; i = isl_alloc_type(ctx, isl_int_obj); if (!i) return NULL; i->ctx = ctx; isl_ctx_ref(ctx); i->ref = 1; isl_int_init(i->v); isl_int_set(i->v, v); return i; } __isl_give isl_int_obj *isl_int_obj_copy(__isl_keep isl_int_obj *i) { if (!i) return NULL; i->ref++; return i; } __isl_give isl_int_obj *isl_int_obj_dup(__isl_keep isl_int_obj *i) { if (!i) return NULL; return isl_int_obj_alloc(i->ctx, i->v); } __isl_give isl_int_obj *isl_int_obj_cow(__isl_take isl_int_obj *i) { if (!i) return NULL; if (i->ref == 1) return i; i->ref--; return isl_int_obj_dup(i); } void isl_int_obj_free(__isl_take isl_int_obj *i) { if (!i) return; if (--i->ref > 0) return; isl_ctx_deref(i->ctx); isl_int_clear(i->v); free(i); } __isl_give isl_int_obj *isl_int_obj_add(__isl_take isl_int_obj *i1, __isl_take isl_int_obj *i2) { i1 = isl_int_obj_cow(i1); if (!i1 || !i2) goto error; isl_int_add(i1->v, i1->v, i2->v); isl_int_obj_free(i2); return i1; error: isl_int_obj_free(i1); isl_int_obj_free(i2); return NULL; } __isl_give isl_int_obj *isl_int_obj_sub(__isl_take isl_int_obj *i1, __isl_take isl_int_obj *i2) { i1 = isl_int_obj_cow(i1); if (!i1 || !i2) goto error; isl_int_sub(i1->v, i1->v, i2->v); isl_int_obj_free(i2); return i1; error: isl_int_obj_free(i1); isl_int_obj_free(i2); return NULL; } __isl_give isl_int_obj *isl_int_obj_mul(__isl_take isl_int_obj *i1, __isl_take isl_int_obj *i2) { i1 = isl_int_obj_cow(i1); if (!i1 || !i2) goto error; isl_int_mul(i1->v, i1->v, i2->v); isl_int_obj_free(i2); return i1; error: isl_int_obj_free(i1); isl_int_obj_free(i2); return NULL; } void isl_int_obj_get_int(__isl_keep isl_int_obj *i, isl_int *v) { if (!i) return; isl_int_set(*v, i->v); } static void *isl_obj_int_copy(void *v) { return isl_int_obj_copy((isl_int_obj *)v); } static void isl_obj_int_free(void *v) { isl_int_obj_free((isl_int_obj *)v); } static __isl_give isl_printer *isl_obj_int_print(__isl_take isl_printer *p, void *v) { isl_int_obj *i = v; return isl_printer_print_isl_int(p, i->v); } static void *isl_obj_int_add(void *v1, void *v2) { return isl_int_obj_add((isl_int_obj *)v1, (isl_int_obj *)v2); } struct isl_obj_vtable isl_obj_int_vtable = { isl_obj_int_copy, isl_obj_int_add, isl_obj_int_print, isl_obj_int_free }; static void *isl_obj_val_copy(void *v) { return isl_val_copy((isl_val *)v); } static void isl_obj_val_free(void *v) { isl_val_free((isl_val *)v); } static __isl_give isl_printer *isl_obj_val_print(__isl_take isl_printer *p, void *v) { return isl_printer_print_val(p, (isl_val *)v); } static void *isl_obj_val_add(void *v1, void *v2) { return isl_val_add((isl_val *) v1, (isl_val *) v2); } struct isl_obj_vtable isl_obj_val_vtable = { isl_obj_val_copy, isl_obj_val_add, isl_obj_val_print, isl_obj_val_free }; static void *isl_obj_map_copy(void *v) { return isl_map_copy((struct isl_map *)v); } static void isl_obj_map_free(void *v) { isl_map_free((struct isl_map *)v); } static __isl_give isl_printer *isl_obj_map_print(__isl_take isl_printer *p, void *v) { return isl_printer_print_map(p, (struct isl_map *)v); } static void *isl_obj_map_add(void *v1, void *v2) { return isl_map_union((struct isl_map *)v1, (struct isl_map *)v2); } struct isl_obj_vtable isl_obj_map_vtable = { isl_obj_map_copy, isl_obj_map_add, isl_obj_map_print, isl_obj_map_free }; static void *isl_obj_union_map_copy(void *v) { return isl_union_map_copy((isl_union_map *)v); } static void isl_obj_union_map_free(void *v) { isl_union_map_free((isl_union_map *)v); } static __isl_give isl_printer *isl_obj_union_map_print(__isl_take isl_printer *p, void *v) { return isl_printer_print_union_map(p, (isl_union_map *)v); } static void *isl_obj_union_map_add(void *v1, void *v2) { return isl_union_map_union((isl_union_map *)v1, (isl_union_map *)v2); } struct isl_obj_vtable isl_obj_union_map_vtable = { isl_obj_union_map_copy, isl_obj_union_map_add, isl_obj_union_map_print, isl_obj_union_map_free }; static void *isl_obj_set_copy(void *v) { return isl_set_copy((struct isl_set *)v); } static void isl_obj_set_free(void *v) { isl_set_free((struct isl_set *)v); } static __isl_give isl_printer *isl_obj_set_print(__isl_take isl_printer *p, void *v) { return isl_printer_print_set(p, (struct isl_set *)v); } static void *isl_obj_set_add(void *v1, void *v2) { return isl_set_union((struct isl_set *)v1, (struct isl_set *)v2); } struct isl_obj_vtable isl_obj_set_vtable = { isl_obj_set_copy, isl_obj_set_add, isl_obj_set_print, isl_obj_set_free }; static void *isl_obj_union_set_copy(void *v) { return isl_union_set_copy((isl_union_set *)v); } static void isl_obj_union_set_free(void *v) { isl_union_set_free((isl_union_set *)v); } static __isl_give isl_printer *isl_obj_union_set_print(__isl_take isl_printer *p, void *v) { return isl_printer_print_union_set(p, (isl_union_set *)v); } static void *isl_obj_union_set_add(void *v1, void *v2) { return isl_union_set_union((isl_union_set *)v1, (isl_union_set *)v2); } struct isl_obj_vtable isl_obj_union_set_vtable = { isl_obj_union_set_copy, isl_obj_union_set_add, isl_obj_union_set_print, isl_obj_union_set_free }; static void *isl_obj_none_copy(void *v) { return v; } static void isl_obj_none_free(void *v) { } static __isl_give isl_printer *isl_obj_none_print(__isl_take isl_printer *p, void *v) { return p; } static void *isl_obj_none_add(void *v1, void *v2) { return NULL; } struct isl_obj_vtable isl_obj_none_vtable = { isl_obj_none_copy, isl_obj_none_add, isl_obj_none_print, isl_obj_none_free }; static void *isl_obj_pw_qp_copy(void *v) { return isl_pw_qpolynomial_copy((struct isl_pw_qpolynomial *)v); } static void isl_obj_pw_qp_free(void *v) { isl_pw_qpolynomial_free((struct isl_pw_qpolynomial *)v); } static __isl_give isl_printer *isl_obj_pw_qp_print(__isl_take isl_printer *p, void *v) { return isl_printer_print_pw_qpolynomial(p, (struct isl_pw_qpolynomial *)v); } static void *isl_obj_pw_qp_add(void *v1, void *v2) { return isl_pw_qpolynomial_add((struct isl_pw_qpolynomial *)v1, (struct isl_pw_qpolynomial *)v2); } struct isl_obj_vtable isl_obj_pw_qpolynomial_vtable = { isl_obj_pw_qp_copy, isl_obj_pw_qp_add, isl_obj_pw_qp_print, isl_obj_pw_qp_free }; static void *isl_obj_union_pw_qp_copy(void *v) { return isl_union_pw_qpolynomial_copy((struct isl_union_pw_qpolynomial *)v); } static void isl_obj_union_pw_qp_free(void *v) { isl_union_pw_qpolynomial_free((struct isl_union_pw_qpolynomial *)v); } static __isl_give isl_printer *isl_obj_union_pw_qp_print( __isl_take isl_printer *p, void *v) { return isl_printer_print_union_pw_qpolynomial(p, (struct isl_union_pw_qpolynomial *)v); } static void *isl_obj_union_pw_qp_add(void *v1, void *v2) { return isl_union_pw_qpolynomial_add( (struct isl_union_pw_qpolynomial *)v1, (struct isl_union_pw_qpolynomial *)v2); } struct isl_obj_vtable isl_obj_union_pw_qpolynomial_vtable = { isl_obj_union_pw_qp_copy, isl_obj_union_pw_qp_add, isl_obj_union_pw_qp_print, isl_obj_union_pw_qp_free }; static void *isl_obj_pw_qpf_copy(void *v) { return isl_pw_qpolynomial_fold_copy((struct isl_pw_qpolynomial_fold *)v); } static void isl_obj_pw_qpf_free(void *v) { isl_pw_qpolynomial_fold_free((struct isl_pw_qpolynomial_fold *)v); } static __isl_give isl_printer *isl_obj_pw_qpf_print(__isl_take isl_printer *p, void *v) { return isl_printer_print_pw_qpolynomial_fold(p, (struct isl_pw_qpolynomial_fold *)v); } static void *isl_obj_pw_qpf_add(void *v1, void *v2) { return isl_pw_qpolynomial_fold_fold((struct isl_pw_qpolynomial_fold *)v1, (struct isl_pw_qpolynomial_fold *)v2); } struct isl_obj_vtable isl_obj_pw_qpolynomial_fold_vtable = { isl_obj_pw_qpf_copy, isl_obj_pw_qpf_add, isl_obj_pw_qpf_print, isl_obj_pw_qpf_free }; static void *isl_obj_union_pw_qpf_copy(void *v) { return isl_union_pw_qpolynomial_fold_copy((struct isl_union_pw_qpolynomial_fold *)v); } static void isl_obj_union_pw_qpf_free(void *v) { isl_union_pw_qpolynomial_fold_free((struct isl_union_pw_qpolynomial_fold *)v); } static __isl_give isl_printer *isl_obj_union_pw_qpf_print( __isl_take isl_printer *p, void *v) { return isl_printer_print_union_pw_qpolynomial_fold(p, (struct isl_union_pw_qpolynomial_fold *)v); } static void *isl_obj_union_pw_qpf_add(void *v1, void *v2) { return isl_union_pw_qpolynomial_fold_fold( (struct isl_union_pw_qpolynomial_fold *)v1, (struct isl_union_pw_qpolynomial_fold *)v2); } struct isl_obj_vtable isl_obj_union_pw_qpolynomial_fold_vtable = { isl_obj_union_pw_qpf_copy, isl_obj_union_pw_qpf_add, isl_obj_union_pw_qpf_print, isl_obj_union_pw_qpf_free }; cloog-0.18.2/isl/isl_vertices_private.h0000664000175000017500000000255412254313240015017 00000000000000#include #include #if defined(__cplusplus) extern "C" { #endif struct isl_morph; /* A parametric vertex. "vertex" contains the actual description * of the vertex as a singleton parametric set. "dom" is the projection * of "vertex" onto the parameter space, i.e., the activity domain * of the vertex. */ struct isl_vertex { isl_basic_set *dom; isl_basic_set *vertex; }; /* A chamber in the chamber decomposition. The indices of the "n_vertices" * active vertices are stored in "vertices". */ struct isl_chamber { int n_vertices; int *vertices; isl_basic_set *dom; }; struct isl_vertices { int ref; /* The rational basic set spanned by the vertices. */ isl_basic_set *bset; int n_vertices; struct isl_vertex *v; int n_chambers; struct isl_chamber *c; }; struct isl_cell { int n_vertices; int *ids; isl_vertices *vertices; isl_basic_set *dom; }; struct isl_external_vertex { isl_vertices *vertices; int id; }; int isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user); int isl_cell_foreach_simplex(__isl_take isl_cell *cell, int (*fn)(__isl_take isl_cell *simplex, void *user), void *user); __isl_give isl_vertices *isl_morph_vertices(__isl_take struct isl_morph *morph, __isl_take isl_vertices *vertices); #if defined(__cplusplus) } #endif cloog-0.18.2/isl/print.c0000664000175000017500000000371412254313240011720 00000000000000#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #undef BASE #define BASE id #include #undef BASE #define BASE val #include #undef BASE #define BASE space #include #undef BASE #define BASE local_space #include #undef BASE #define BASE basic_set #include #undef BASE #define BASE basic_map #include #undef BASE #define BASE set #include #undef BASE #define BASE map #include #undef BASE #define BASE union_set #include #undef BASE #define BASE union_map #include #undef BASE #define BASE qpolynomial #include #undef BASE #define BASE qpolynomial_fold #include #undef BASE #define BASE pw_qpolynomial #include #undef BASE #define BASE pw_qpolynomial_fold #include #undef BASE #define BASE union_pw_qpolynomial #include #undef BASE #define BASE union_pw_qpolynomial_fold #include #undef BASE #define BASE band #include #undef BASE #define BASE constraint #include #undef BASE #define BASE aff #include #undef BASE #define BASE pw_aff #include #undef BASE #define BASE multi_aff #include #undef BASE #define BASE pw_multi_aff #include #undef BASE #define BASE union_pw_multi_aff #include #undef BASE #define BASE multi_pw_aff #include #undef BASE #define BASE point #include #undef BASE #define BASE ast_expr #include #undef BASE #define BASE ast_node #include cloog-0.18.2/isl/GIT_HEAD_ID0000664000175000017500000000001012254314447012117 00000000000000UNKNOWN cloog-0.18.2/isl/m4/0000775000175000017500000000000012254314446011024 500000000000000cloog-0.18.2/isl/m4/ltversion.m40000644000175000017500000000131312254313255013224 00000000000000# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004, 2011-2013 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # @configure_input@ # serial 4038 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.4.2.418]) m4_define([LT_PACKAGE_REVISION], [2.4.2.418]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.4.2.418' macro_revision='2.4.2.418' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) cloog-0.18.2/isl/m4/ax_set_warning_flags.m40000664000175000017500000000127212254313240015363 00000000000000dnl Add a set of flags to WARNING_FLAGS, that enable compiler warnings for dnl isl. The warnings that are enabled vary with the compiler and only include dnl warnings that did not trigger at the time of adding these flags. AC_DEFUN([AX_SET_WARNING_FLAGS],[dnl AX_COMPILER_VENDOR WARNING_FLAGS="" if test "${ax_cv_c_compiler_vendor}" = "clang"; then dnl isl is at the moment clean of -Wall warnings. If clang adds dnl new warnings to -Wall which cause false positives, the dnl specific warning types will be disabled explicitally (by dnl adding for example -Wno-return-type). To temporarily disable dnl all warnings run configure with CFLAGS=-Wno-all. WARNING_FLAGS="-Wall" fi ]) cloog-0.18.2/isl/m4/ax_compiler_vendor.m40000664000175000017500000000604612254313240015062 00000000000000# =========================================================================== # http://www.gnu.org/software/autoconf-archive/ax_compiler_vendor.html # =========================================================================== # # SYNOPSIS # # AX_COMPILER_VENDOR # # DESCRIPTION # # Determine the vendor of the C/C++ compiler, e.g., gnu, intel, ibm, sun, # hp, borland, comeau, dec, cray, kai, lcc, metrowerks, sgi, microsoft, # watcom, etc. The vendor is returned in the cache variable # $ax_cv_c_compiler_vendor for C and $ax_cv_cxx_compiler_vendor for C++. # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. #serial 9 AC_DEFUN([AX_COMPILER_VENDOR], [ AC_CACHE_CHECK([for _AC_LANG compiler vendor], ax_cv_[]_AC_LANG_ABBREV[]_compiler_vendor, [ax_cv_[]_AC_LANG_ABBREV[]_compiler_vendor=unknown # note: don't check for gcc first since some other compilers define __GNUC__ for ventest in intel:__ICC,__ECC,__INTEL_COMPILER ibm:__xlc__,__xlC__,__IBMC__,__IBMCPP__ pathscale:__PATHCC__,__PATHSCALE__ clang:__clang__ gnu:__GNUC__ sun:__SUNPRO_C,__SUNPRO_CC hp:__HP_cc,__HP_aCC dec:__DECC,__DECCXX,__DECC_VER,__DECCXX_VER borland:__BORLANDC__,__TURBOC__ comeau:__COMO__ cray:_CRAYC kai:__KCC lcc:__LCC__ metrowerks:__MWERKS__ sgi:__sgi,sgi microsoft:_MSC_VER watcom:__WATCOMC__ portland:__PGI; do vencpp="defined("`echo $ventest | cut -d: -f2 | sed 's/,/) || defined(/g'`")" AC_COMPILE_IFELSE([AC_LANG_PROGRAM(,[ #if !($vencpp) thisisanerror; #endif ])], [ax_cv_]_AC_LANG_ABBREV[_compiler_vendor=`echo $ventest | cut -d: -f1`; break]) done ]) ]) cloog-0.18.2/isl/m4/ax_detect_git_head.m40000664000175000017500000000142612254313240014764 00000000000000AC_DEFUN([AX_DETECT_GIT_HEAD], [ AC_SUBST(GIT_HEAD_ID) AC_SUBST(GIT_HEAD) AC_SUBST(GIT_HEAD_VERSION) if test -f $srcdir/.git/HEAD; then GIT_HEAD="$srcdir/.git/index" GIT_REPO="$srcdir/.git" GIT_HEAD_ID=`GIT_DIR=$GIT_REPO git describe` elif test -f $srcdir/GIT_HEAD_ID; then GIT_HEAD_ID=`cat $srcdir/GIT_HEAD_ID` else mysrcdir=`(cd $srcdir; pwd)` head=`basename $mysrcdir | sed -e 's/.*-//'` head2=`echo $head | sed -e 's/[^0-9a-f]//'` head3=`echo $head2 | sed -e 's/........................................//'` if test "x$head3" = "x" -a "x$head" = "x$head2"; then GIT_HEAD_ID="$head" else GIT_HEAD_ID="UNKNOWN" fi fi if test -z "$GIT_REPO" ; then GIT_HEAD_VERSION="$GIT_HEAD_ID" else GIT_HEAD_VERSION="\`GIT_DIR=$GIT_REPO git describe\`" fi ]) cloog-0.18.2/isl/m4/libtool.m40000644000175000017500000105432112254313255012653 00000000000000# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # Copyright (C) 1996-2001, 2003-2013 Free Software Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. m4_define([_LT_COPYING], [dnl # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; either version 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. ]) # serial 58 LT_INIT # LT_PREREQ(VERSION) # ------------------ # Complain and exit if this libtool version is less that VERSION. m4_defun([LT_PREREQ], [m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1, [m4_default([$3], [m4_fatal([Libtool version $1 or higher is required], 63)])], [$2])]) # _LT_CHECK_BUILDDIR # ------------------ # Complain if the absolute build directory name contains unusual characters m4_defun([_LT_CHECK_BUILDDIR], [case `pwd` in *\ * | *\ *) AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;; esac ]) # LT_INIT([OPTIONS]) # ------------------ AC_DEFUN([LT_INIT], [AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl AC_BEFORE([$0], [LT_LANG])dnl AC_BEFORE([$0], [LT_OUTPUT])dnl AC_BEFORE([$0], [LTDL_INIT])dnl m4_require([_LT_CHECK_BUILDDIR])dnl dnl Autoconf doesn't catch unexpanded LT_ macros by default: m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4 dnl unless we require an AC_DEFUNed macro: AC_REQUIRE([LTOPTIONS_VERSION])dnl AC_REQUIRE([LTSUGAR_VERSION])dnl AC_REQUIRE([LTVERSION_VERSION])dnl AC_REQUIRE([LTOBSOLETE_VERSION])dnl m4_require([_LT_PROG_LTMAIN])dnl _LT_SHELL_INIT([SHELL=${CONFIG_SHELL-/bin/sh}]) dnl Parse OPTIONS _LT_SET_OPTIONS([$0], [$1]) # This can be used to rebuild libtool when needed LIBTOOL_DEPS=$ltmain # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' AC_SUBST(LIBTOOL)dnl _LT_SETUP # Only expand once: m4_define([LT_INIT]) ])# LT_INIT # Old names: AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT]) AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PROG_LIBTOOL], []) dnl AC_DEFUN([AM_PROG_LIBTOOL], []) # _LT_CC_BASENAME(CC) # ------------------- # Calculate cc_basename. Skip known compiler wrappers and cross-prefix. m4_defun([_LT_CC_BASENAME], [for cc_temp in $1""; do case $cc_temp in compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;; distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` ]) # _LT_FILEUTILS_DEFAULTS # ---------------------- # It is okay to use these file commands and assume they have been set # sensibly after 'm4_require([_LT_FILEUTILS_DEFAULTS])'. m4_defun([_LT_FILEUTILS_DEFAULTS], [: ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} ])# _LT_FILEUTILS_DEFAULTS # _LT_SETUP # --------- m4_defun([_LT_SETUP], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_REQUIRE([_LT_PREPARE_SED_QUOTE_VARS])dnl AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl _LT_DECL([], [PATH_SEPARATOR], [1], [The PATH separator for the build system])dnl dnl _LT_DECL([], [host_alias], [0], [The host system])dnl _LT_DECL([], [host], [0])dnl _LT_DECL([], [host_os], [0])dnl dnl _LT_DECL([], [build_alias], [0], [The build system])dnl _LT_DECL([], [build], [0])dnl _LT_DECL([], [build_os], [0])dnl dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl dnl AC_REQUIRE([AC_PROG_LN_S])dnl test -z "$LN_S" && LN_S="ln -s" _LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl dnl AC_REQUIRE([LT_CMD_MAX_LEN])dnl _LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl _LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl m4_require([_LT_PATH_CONVERSION_FUNCTIONS])dnl m4_require([_LT_CMD_RELOAD])dnl m4_require([_LT_CHECK_MAGIC_METHOD])dnl m4_require([_LT_CHECK_SHAREDLIB_FROM_LINKLIB])dnl m4_require([_LT_CMD_OLD_ARCHIVE])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_WITH_SYSROOT])dnl _LT_CONFIG_LIBTOOL_INIT([ # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi ]) if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi _LT_CHECK_OBJDIR m4_require([_LT_TAG_COMPILER])dnl case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a '.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld=$lt_cv_prog_gnu_ld old_CC=$CC old_CFLAGS=$CFLAGS # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o _LT_CC_BASENAME([$compiler]) # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then _LT_PATH_MAGIC fi ;; esac # Use C for the default configuration in the libtool script LT_SUPPORTED_TAG([CC]) _LT_LANG_C_CONFIG _LT_LANG_DEFAULT_CONFIG _LT_CONFIG_COMMANDS ])# _LT_SETUP # _LT_PREPARE_SED_QUOTE_VARS # -------------------------- # Define a few sed substitution that help us do robust quoting. m4_defun([_LT_PREPARE_SED_QUOTE_VARS], [# Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\([["`$\\]]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([["`\\]]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ]) # _LT_PROG_LTMAIN # --------------- # Note that this code is called both from 'configure', and 'config.status' # now that we use AC_CONFIG_COMMANDS to generate libtool. Notably, # 'config.status' has no value for ac_aux_dir unless we are using Automake, # so we pass a copy along to make sure it has a sensible value anyway. m4_defun([_LT_PROG_LTMAIN], [m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl _LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir']) ltmain=$ac_aux_dir/ltmain.sh ])# _LT_PROG_LTMAIN ## ------------------------------------- ## ## Accumulate code for creating libtool. ## ## ------------------------------------- ## # So that we can recreate a full libtool script including additional # tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS # in macros and then make a single call at the end using the 'libtool' # label. # _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS]) # ---------------------------------------- # Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL_INIT], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_INIT], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_INIT]) # _LT_CONFIG_LIBTOOL([COMMANDS]) # ------------------------------ # Register COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS]) # _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS]) # ----------------------------------------------------- m4_defun([_LT_CONFIG_SAVE_COMMANDS], [_LT_CONFIG_LIBTOOL([$1]) _LT_CONFIG_LIBTOOL_INIT([$2]) ]) # _LT_FORMAT_COMMENT([COMMENT]) # ----------------------------- # Add leading comment marks to the start of each line, and a trailing # full-stop to the whole comment if one is not present already. m4_define([_LT_FORMAT_COMMENT], [m4_ifval([$1], [ m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])], [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.]) )]) ## ------------------------ ## ## FIXME: Eliminate VARNAME ## ## ------------------------ ## # _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?]) # ------------------------------------------------------------------- # CONFIGNAME is the name given to the value in the libtool script. # VARNAME is the (base) name used in the configure script. # VALUE may be 0, 1 or 2 for a computed quote escaped value based on # VARNAME. Any other value will be used directly. m4_define([_LT_DECL], [lt_if_append_uniq([lt_decl_varnames], [$2], [, ], [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name], [m4_ifval([$1], [$1], [$2])]) lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3]) m4_ifval([$4], [lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])]) lt_dict_add_subkey([lt_decl_dict], [$2], [tagged?], [m4_ifval([$5], [yes], [no])])]) ]) # _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION]) # -------------------------------------------------------- m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])]) # lt_decl_tag_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_tag_varnames], [_lt_decl_filter([tagged?], [yes], $@)]) # _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..]) # --------------------------------------------------------- m4_define([_lt_decl_filter], [m4_case([$#], [0], [m4_fatal([$0: too few arguments: $#])], [1], [m4_fatal([$0: too few arguments: $#: $1])], [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)], [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)], [lt_dict_filter([lt_decl_dict], $@)])[]dnl ]) # lt_decl_quote_varnames([SEPARATOR], [VARNAME1...]) # -------------------------------------------------- m4_define([lt_decl_quote_varnames], [_lt_decl_filter([value], [1], $@)]) # lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_dquote_varnames], [_lt_decl_filter([value], [2], $@)]) # lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_varnames_tagged], [m4_assert([$# <= 2])dnl _$0(m4_quote(m4_default([$1], [[, ]])), m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]), m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))]) m4_define([_lt_decl_varnames_tagged], [m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])]) # lt_decl_all_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_all_varnames], [_$0(m4_quote(m4_default([$1], [[, ]])), m4_if([$2], [], m4_quote(lt_decl_varnames), m4_quote(m4_shift($@))))[]dnl ]) m4_define([_lt_decl_all_varnames], [lt_join($@, lt_decl_varnames_tagged([$1], lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl ]) # _LT_CONFIG_STATUS_DECLARE([VARNAME]) # ------------------------------------ # Quote a variable value, and forward it to 'config.status' so that its # declaration there will have the same value as in 'configure'. VARNAME # must have a single quote delimited value for this to work. m4_define([_LT_CONFIG_STATUS_DECLARE], [$1='`$ECHO "$][$1" | $SED "$delay_single_quote_subst"`']) # _LT_CONFIG_STATUS_DECLARATIONS # ------------------------------ # We delimit libtool config variables with single quotes, so when # we write them to config.status, we have to be sure to quote all # embedded single quotes properly. In configure, this macro expands # each variable declared with _LT_DECL (and _LT_TAGDECL) into: # # ='`$ECHO "$" | $SED "$delay_single_quote_subst"`' m4_defun([_LT_CONFIG_STATUS_DECLARATIONS], [m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames), [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAGS # ---------------- # Output comment and list of tags supported by the script m4_defun([_LT_LIBTOOL_TAGS], [_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl available_tags='_LT_TAGS'dnl ]) # _LT_LIBTOOL_DECLARE(VARNAME, [TAG]) # ----------------------------------- # Extract the dictionary values for VARNAME (optionally with TAG) and # expand to a commented shell variable setting: # # # Some comment about what VAR is for. # visible_name=$lt_internal_name m4_define([_LT_LIBTOOL_DECLARE], [_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [description])))[]dnl m4_pushdef([_libtool_name], m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])), [0], [_libtool_name=[$]$1], [1], [_libtool_name=$lt_[]$1], [2], [_libtool_name=$lt_[]$1], [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl ]) # _LT_LIBTOOL_CONFIG_VARS # ----------------------- # Produce commented declarations of non-tagged libtool config variables # suitable for insertion in the LIBTOOL CONFIG section of the 'libtool' # script. Tagged libtool config variables (even for the LIBTOOL CONFIG # section) are produced by _LT_LIBTOOL_TAG_VARS. m4_defun([_LT_LIBTOOL_CONFIG_VARS], [m4_foreach([_lt_var], m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAG_VARS(TAG) # ------------------------- m4_define([_LT_LIBTOOL_TAG_VARS], [m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])]) # _LT_TAGVAR(VARNAME, [TAGNAME]) # ------------------------------ m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])]) # _LT_CONFIG_COMMANDS # ------------------- # Send accumulated output to $CONFIG_STATUS. Thanks to the lists of # variables for single and double quote escaping we saved from calls # to _LT_DECL, we can put quote escaped variables declarations # into 'config.status', and then the shell code to quote escape them in # for loops in 'config.status'. Finally, any additional code accumulated # from calls to _LT_CONFIG_LIBTOOL_INIT is expanded. m4_defun([_LT_CONFIG_COMMANDS], [AC_PROVIDE_IFELSE([LT_OUTPUT], dnl If the libtool generation code has been placed in $CONFIG_LT, dnl instead of duplicating it all over again into config.status, dnl then we will have config.status run $CONFIG_LT later, so it dnl needs to know what name is stored there: [AC_CONFIG_COMMANDS([libtool], [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])], dnl If the libtool generation code is destined for config.status, dnl expand the accumulated commands and init code now: [AC_CONFIG_COMMANDS([libtool], [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])]) ])#_LT_CONFIG_COMMANDS # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT], [ # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' _LT_CONFIG_STATUS_DECLARATIONS LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$[]1 _LTECHO_EOF' } # Quote evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_quote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_dquote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done _LT_OUTPUT_LIBTOOL_INIT ]) # _LT_GENERATED_FILE_INIT(FILE, [COMMENT]) # ------------------------------------ # Generate a child script FILE with all initialization necessary to # reuse the environment learned by the parent script, and make the # file executable. If COMMENT is supplied, it is inserted after the # '#!' sequence but before initialization text begins. After this # macro, additional text can be appended to FILE to form the body of # the child script. The macro ends with non-zero status if the # file could not be fully written (such as if the disk is full). m4_ifdef([AS_INIT_GENERATED], [m4_defun([_LT_GENERATED_FILE_INIT],[AS_INIT_GENERATED($@)])], [m4_defun([_LT_GENERATED_FILE_INIT], [m4_require([AS_PREPARE])]dnl [m4_pushdef([AS_MESSAGE_LOG_FD])]dnl [lt_write_fail=0 cat >$1 <<_ASEOF || lt_write_fail=1 #! $SHELL # Generated by $as_me. $2 SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$1 <<\_ASEOF || lt_write_fail=1 AS_SHELL_SANITIZE _AS_PREPARE exec AS_MESSAGE_FD>&1 _ASEOF test 0 = "$lt_write_fail" && chmod +x $1[]dnl m4_popdef([AS_MESSAGE_LOG_FD])])])# _LT_GENERATED_FILE_INIT # LT_OUTPUT # --------- # This macro allows early generation of the libtool script (before # AC_OUTPUT is called), incase it is used in configure for compilation # tests. AC_DEFUN([LT_OUTPUT], [: ${CONFIG_LT=./config.lt} AC_MSG_NOTICE([creating $CONFIG_LT]) _LT_GENERATED_FILE_INIT(["$CONFIG_LT"], [# Run this file to recreate a libtool stub with the current configuration.]) cat >>"$CONFIG_LT" <<\_LTEOF lt_cl_silent=false exec AS_MESSAGE_LOG_FD>>config.log { echo AS_BOX([Running $as_me.]) } >&AS_MESSAGE_LOG_FD lt_cl_help="\ '$as_me' creates a local libtool stub from the current configuration, for use in further configure time tests before the real libtool is generated. Usage: $[0] [[OPTIONS]] -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files Report bugs to ." lt_cl_version="\ m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION]) configured by $[0], generated by m4_PACKAGE_STRING. Copyright (C) 2011 Free Software Foundation, Inc. This config.lt script is free software; the Free Software Foundation gives unlimited permision to copy, distribute and modify it." while test 0 != $[#] do case $[1] in --version | --v* | -V ) echo "$lt_cl_version"; exit 0 ;; --help | --h* | -h ) echo "$lt_cl_help"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --quiet | --q* | --silent | --s* | -q ) lt_cl_silent=: ;; -*) AC_MSG_ERROR([unrecognized option: $[1] Try '$[0] --help' for more information.]) ;; *) AC_MSG_ERROR([unrecognized argument: $[1] Try '$[0] --help' for more information.]) ;; esac shift done if $lt_cl_silent; then exec AS_MESSAGE_FD>/dev/null fi _LTEOF cat >>"$CONFIG_LT" <<_LTEOF _LT_OUTPUT_LIBTOOL_COMMANDS_INIT _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AC_MSG_NOTICE([creating $ofile]) _LT_OUTPUT_LIBTOOL_COMMANDS AS_EXIT(0) _LTEOF chmod +x "$CONFIG_LT" # configure is writing to config.log, but config.lt does its own redirection, # appending to config.log, which fails on DOS, as config.log is still kept # open by configure. Here we exec the FD to /dev/null, effectively closing # config.log, so it can be properly (re)opened and appended to by config.lt. lt_cl_success=: test yes = "$silent" && lt_config_lt_args="$lt_config_lt_args --quiet" exec AS_MESSAGE_LOG_FD>/dev/null $SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false exec AS_MESSAGE_LOG_FD>>config.log $lt_cl_success || AS_EXIT(1) ])# LT_OUTPUT # _LT_CONFIG(TAG) # --------------- # If TAG is the built-in tag, create an initial libtool script with a # default configuration from the untagged config vars. Otherwise add code # to config.status for appending the configuration named by TAG from the # matching tagged config vars. m4_defun([_LT_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_CONFIG_SAVE_COMMANDS([ m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl m4_if(_LT_TAG, [C], [ # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi cfgfile=${ofile}T trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # _LT_COPYING _LT_LIBTOOL_TAGS # ### BEGIN LIBTOOL CONFIG _LT_LIBTOOL_CONFIG_VARS _LT_LIBTOOL_TAG_VARS # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac _LT_PROG_LTMAIN # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ], [cat <<_LT_EOF >> "$ofile" dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded dnl in a comment (ie after a #). # ### BEGIN LIBTOOL TAG CONFIG: $1 _LT_LIBTOOL_TAG_VARS(_LT_TAG) # ### END LIBTOOL TAG CONFIG: $1 _LT_EOF ])dnl /m4_if ], [m4_if([$1], [], [ PACKAGE='$PACKAGE' VERSION='$VERSION' RM='$RM' ofile='$ofile'], []) ])dnl /_LT_CONFIG_SAVE_COMMANDS ])# _LT_CONFIG # LT_SUPPORTED_TAG(TAG) # --------------------- # Trace this macro to discover what tags are supported by the libtool # --tag option, using: # autoconf --trace 'LT_SUPPORTED_TAG:$1' AC_DEFUN([LT_SUPPORTED_TAG], []) # C support is built-in for now m4_define([_LT_LANG_C_enabled], []) m4_define([_LT_TAGS], []) # LT_LANG(LANG) # ------------- # Enable libtool support for the given language if not already enabled. AC_DEFUN([LT_LANG], [AC_BEFORE([$0], [LT_OUTPUT])dnl m4_case([$1], [C], [_LT_LANG(C)], [C++], [_LT_LANG(CXX)], [Go], [_LT_LANG(GO)], [Java], [_LT_LANG(GCJ)], [Fortran 77], [_LT_LANG(F77)], [Fortran], [_LT_LANG(FC)], [Windows Resource], [_LT_LANG(RC)], [m4_ifdef([_LT_LANG_]$1[_CONFIG], [_LT_LANG($1)], [m4_fatal([$0: unsupported language: "$1"])])])dnl ])# LT_LANG # _LT_LANG(LANGNAME) # ------------------ m4_defun([_LT_LANG], [m4_ifdef([_LT_LANG_]$1[_enabled], [], [LT_SUPPORTED_TAG([$1])dnl m4_append([_LT_TAGS], [$1 ])dnl m4_define([_LT_LANG_]$1[_enabled], [])dnl _LT_LANG_$1_CONFIG($1)])dnl ])# _LT_LANG m4_ifndef([AC_PROG_GO], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_GO. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_GO], [AC_LANG_PUSH(Go)dnl AC_ARG_VAR([GOC], [Go compiler command])dnl AC_ARG_VAR([GOFLAGS], [Go compiler flags])dnl _AC_ARG_VAR_LDFLAGS()dnl AC_CHECK_TOOL(GOC, gccgo) if test -z "$GOC"; then if test -n "$ac_tool_prefix"; then AC_CHECK_PROG(GOC, [${ac_tool_prefix}gccgo], [${ac_tool_prefix}gccgo]) fi fi if test -z "$GOC"; then AC_CHECK_PROG(GOC, gccgo, gccgo, false) fi ])#m4_defun ])#m4_ifndef # _LT_LANG_DEFAULT_CONFIG # ----------------------- m4_defun([_LT_LANG_DEFAULT_CONFIG], [AC_PROVIDE_IFELSE([AC_PROG_CXX], [LT_LANG(CXX)], [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])]) AC_PROVIDE_IFELSE([AC_PROG_F77], [LT_LANG(F77)], [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])]) AC_PROVIDE_IFELSE([AC_PROG_FC], [LT_LANG(FC)], [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])]) dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal dnl pulling things in needlessly. AC_PROVIDE_IFELSE([AC_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([A][M_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([LT_PROG_GCJ], [LT_LANG(GCJ)], [m4_ifdef([AC_PROG_GCJ], [m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([A][M_PROG_GCJ], [m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([LT_PROG_GCJ], [m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])]) AC_PROVIDE_IFELSE([AC_PROG_GO], [LT_LANG(GO)], [m4_define([AC_PROG_GO], defn([AC_PROG_GO])[LT_LANG(GO)])]) AC_PROVIDE_IFELSE([LT_PROG_RC], [LT_LANG(RC)], [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])]) ])# _LT_LANG_DEFAULT_CONFIG # Obsolete macros: AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)]) AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)]) AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)]) AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)]) AU_DEFUN([AC_LIBTOOL_RC], [LT_LANG(Windows Resource)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_CXX], []) dnl AC_DEFUN([AC_LIBTOOL_F77], []) dnl AC_DEFUN([AC_LIBTOOL_FC], []) dnl AC_DEFUN([AC_LIBTOOL_GCJ], []) dnl AC_DEFUN([AC_LIBTOOL_RC], []) # _LT_TAG_COMPILER # ---------------- m4_defun([_LT_TAG_COMPILER], [AC_REQUIRE([AC_PROG_CC])dnl _LT_DECL([LTCC], [CC], [1], [A C compiler])dnl _LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl _LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl _LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC ])# _LT_TAG_COMPILER # _LT_COMPILER_BOILERPLATE # ------------------------ # Check for compiler boilerplate output or warnings with # the simple compiler test code. m4_defun([_LT_COMPILER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ])# _LT_COMPILER_BOILERPLATE # _LT_LINKER_BOILERPLATE # ---------------------- # Check for linker boilerplate output or warnings with # the simple link test code. m4_defun([_LT_LINKER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ])# _LT_LINKER_BOILERPLATE # _LT_REQUIRED_DARWIN_CHECKS # ------------------------- m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[ case $host_os in rhapsody* | darwin*) AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:]) AC_CHECK_TOOL([NMEDIT], [nmedit], [:]) AC_CHECK_TOOL([LIPO], [lipo], [:]) AC_CHECK_TOOL([OTOOL], [otool], [:]) AC_CHECK_TOOL([OTOOL64], [otool64], [:]) _LT_DECL([], [DSYMUTIL], [1], [Tool to manipulate archived DWARF debug symbol files on Mac OS X]) _LT_DECL([], [NMEDIT], [1], [Tool to change global to local symbols on Mac OS X]) _LT_DECL([], [LIPO], [1], [Tool to manipulate fat objects and archives on Mac OS X]) _LT_DECL([], [OTOOL], [1], [ldd/readelf like tool for Mach-O binaries on Mac OS X]) _LT_DECL([], [OTOOL64], [1], [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4]) AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod], [lt_cv_apple_cc_single_mod=no if test -z "$LT_MULTI_MODULE"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test 0 = "$_lt_result"; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -rf libconftest.dylib* rm -f conftest.* fi]) AC_CACHE_CHECK([for -exported_symbols_list linker flag], [lt_cv_ld_exported_symbols_list], [lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [lt_cv_ld_exported_symbols_list=yes], [lt_cv_ld_exported_symbols_list=no]) LDFLAGS=$save_LDFLAGS ]) AC_CACHE_CHECK([for -force_load linker flag],[lt_cv_ld_force_load], [lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&AS_MESSAGE_LOG_FD echo "$AR cru libconftest.a conftest.o" >&AS_MESSAGE_LOG_FD $AR cru libconftest.a conftest.o 2>&AS_MESSAGE_LOG_FD echo "$RANLIB libconftest.a" >&AS_MESSAGE_LOG_FD $RANLIB libconftest.a 2>&AS_MESSAGE_LOG_FD cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD elif test -f conftest && test 0 = "$_lt_result" && $GREP forced_load conftest >/dev/null 2>&1; then lt_cv_ld_force_load=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM ]) case $host_os in rhapsody* | darwin1.[[012]]) _lt_dar_allow_undefined='$wl-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[[91]]*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; 10.[[012]]*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test yes = "$lt_cv_apple_cc_single_mod"; then _lt_dar_single_mod='$single_module' fi if test yes = "$lt_cv_ld_exported_symbols_list"; then _lt_dar_export_syms=' $wl-exported_symbols_list,$output_objdir/$libname-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/$libname-symbols.expsym $lib' fi if test : != "$DSYMUTIL" && test no = "$lt_cv_ld_force_load"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ]) # _LT_DARWIN_LINKER_FEATURES([TAG]) # --------------------------------- # Checks for linker and compiler features on darwin m4_defun([_LT_DARWIN_LINKER_FEATURES], [ m4_require([_LT_REQUIRED_DARWIN_CHECKS]) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported if test yes = "$lt_cv_ld_force_load"; then _LT_TAGVAR(whole_archive_flag_spec, $1)='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience $wl-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' m4_case([$1], [F77], [_LT_TAGVAR(compiler_needs_object, $1)=yes], [FC], [_LT_TAGVAR(compiler_needs_object, $1)=yes]) else _LT_TAGVAR(whole_archive_flag_spec, $1)='' fi _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=$_lt_dar_allow_undefined case $cc_basename in ifort*|nagfor*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test yes = "$_lt_dar_can_shared"; then output_verbose_link_cmd=func_echo_all _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dsymutil" _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dsymutil" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil" _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dar_export_syms$_lt_dsymutil" m4_if([$1], [CXX], [ if test yes != "$lt_cv_apple_cc_single_mod"; then _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \$lib-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$lib-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring$_lt_dsymutil" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \$lib-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$lib-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring$_lt_dar_export_syms$_lt_dsymutil" fi ],[]) else _LT_TAGVAR(ld_shlibs, $1)=no fi ]) # _LT_SYS_MODULE_PATH_AIX([TAGNAME]) # ---------------------------------- # Links a minimal program and checks the executable # for the system default hardcoded library path. In most cases, # this is /usr/lib:/lib, but when the MPI compilers are used # the location of the communication and MPI libs are included too. # If we don't find anything, use the default library path according # to the aix ld manual. # Store the results from the different compilers for each TAGNAME. # Allow to override them for all tags through lt_cv_aix_libpath. m4_defun([_LT_SYS_MODULE_PATH_AIX], [m4_require([_LT_DECL_SED])dnl if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else AC_CACHE_VAL([_LT_TAGVAR([lt_cv_aix_libpath_], [$1])], [AC_LINK_IFELSE([AC_LANG_PROGRAM],[ lt_aix_libpath_sed='[ /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }]' _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi],[]) if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=/usr/lib:/lib fi ]) aix_libpath=$_LT_TAGVAR([lt_cv_aix_libpath_], [$1]) fi ])# _LT_SYS_MODULE_PATH_AIX # _LT_SHELL_INIT(ARG) # ------------------- m4_define([_LT_SHELL_INIT], [m4_divert_text([M4SH-INIT], [$1 ])])# _LT_SHELL_INIT # _LT_PROG_ECHO_BACKSLASH # ----------------------- # Find how we can fake an echo command that does not interpret backslash. # In particular, with Autoconf 2.60 or later we add some code to the start # of the generated configure script that will find a shell with a builtin # printf (that we can use as an echo command). m4_defun([_LT_PROG_ECHO_BACKSLASH], [ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO AC_MSG_CHECKING([how to print strings]) # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $[]1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } case $ECHO in printf*) AC_MSG_RESULT([printf]) ;; print*) AC_MSG_RESULT([print -r]) ;; *) AC_MSG_RESULT([cat]) ;; esac m4_ifdef([_AS_DETECT_SUGGESTED], [_AS_DETECT_SUGGESTED([ test -n "${ZSH_VERSION+set}${BASH_VERSION+set}" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test "X`printf %s $ECHO`" = "X$ECHO" \ || test "X`print -r -- $ECHO`" = "X$ECHO" )])]) _LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts]) _LT_DECL([], [ECHO], [1], [An echo program that protects backslashes]) ])# _LT_PROG_ECHO_BACKSLASH # _LT_WITH_SYSROOT # ---------------- AC_DEFUN([_LT_WITH_SYSROOT], [AC_MSG_CHECKING([for sysroot]) AC_ARG_WITH([sysroot], [AS_HELP_STRING([--with-sysroot@<:@=DIR@:>@], [Search for dependent libraries within DIR (or the compiler's sysroot if not specified).])], [], [with_sysroot=no]) dnl lt_sysroot will always be passed unquoted. We quote it here dnl in case the user passed a directory name. lt_sysroot= case $with_sysroot in #( yes) if test yes = "$GCC"; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) AC_MSG_RESULT([$with_sysroot]) AC_MSG_ERROR([The sysroot must be an absolute path.]) ;; esac AC_MSG_RESULT([${lt_sysroot:-no}]) _LT_DECL([], [lt_sysroot], [0], [The root where to search for ]dnl [dependent libraries, and where our libraries should be installed.])]) # _LT_ENABLE_LOCK # --------------- m4_defun([_LT_ENABLE_LOCK], [AC_ARG_ENABLE([libtool-lock], [AS_HELP_STRING([--disable-libtool-lock], [avoid locking (might break parallel builds)])]) test no = "$enable_libtool_lock" || enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out what ABI is being produced by ac_compile, and set mode # options accordingly. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE=32 ;; *ELF-64*) HPUX_IA64_MODE=64 ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test yes = "$lt_cv_prog_gnu_ld"; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; mips64*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then emul=elf case `/usr/bin/file conftest.$ac_objext` in *32-bit*) emul="${emul}32" ;; *64-bit*) emul="${emul}64" ;; esac case `/usr/bin/file conftest.$ac_objext` in *MSB*) emul="${emul}btsmip" ;; *LSB*) emul="${emul}ltsmip" ;; esac case `/usr/bin/file conftest.$ac_objext` in *N32*) emul="${emul}n32" ;; esac LD="${LD-ld} -m $emul" fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. Note that the listed cases only cover the # situations where additional linker options are needed (such as when # doing 32-bit compilation for a host where ld defaults to 64-bit, or # vice versa); the common cases where no linker options are needed do # not appear in the list. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*linux*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*linux*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS=$CFLAGS CFLAGS="$CFLAGS -belf" AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf, [AC_LANG_PUSH(C) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no]) AC_LANG_POP]) if test yes != "$lt_cv_cc_needs_belf"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS=$SAVE_CFLAGS fi ;; *-*solaris*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*|x86_64-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD=${LD-ld}_sol2 fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks=$enable_libtool_lock ])# _LT_ENABLE_LOCK # _LT_PROG_AR # ----------- m4_defun([_LT_PROG_AR], [AC_CHECK_TOOLS(AR, [ar], false) : ${AR=ar} : ${AR_FLAGS=cru} _LT_DECL([], [AR], [1], [The archiver]) _LT_DECL([], [AR_FLAGS], [1], [Flags to create an archive]) AC_CACHE_CHECK([for archiver @FILE support], [lt_cv_ar_at_file], [lt_cv_ar_at_file=no AC_COMPILE_IFELSE([AC_LANG_PROGRAM], [echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&AS_MESSAGE_LOG_FD' AC_TRY_EVAL([lt_ar_try]) if test 0 -eq "$ac_status"; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a AC_TRY_EVAL([lt_ar_try]) if test 0 -ne "$ac_status"; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a ]) ]) if test no = "$lt_cv_ar_at_file"; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi _LT_DECL([], [archiver_list_spec], [1], [How to feed a file listing to the archiver]) ])# _LT_PROG_AR # _LT_CMD_OLD_ARCHIVE # ------------------- m4_defun([_LT_CMD_OLD_ARCHIVE], [_LT_PROG_AR AC_CHECK_TOOL(STRIP, strip, :) test -z "$STRIP" && STRIP=: _LT_DECL([], [STRIP], [1], [A symbol stripping program]) AC_CHECK_TOOL(RANLIB, ranlib, :) test -z "$RANLIB" && RANLIB=: _LT_DECL([], [RANLIB], [1], [Commands used to install an old-style archive]) # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in bitrig* | openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac _LT_DECL([], [old_postinstall_cmds], [2]) _LT_DECL([], [old_postuninstall_cmds], [2]) _LT_TAGDECL([], [old_archive_cmds], [2], [Commands used to build an old-style archive]) _LT_DECL([], [lock_old_archive_extraction], [0], [Whether to use a lock for old archive extraction]) ])# _LT_CMD_OLD_ARCHIVE # _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------------------- # Check whether the given compiler option works AC_DEFUN([_LT_COMPILER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4]) echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$3" ## exclude from sc_useless_quotes_in_assignment # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi fi $RM conftest* ]) if test yes = "[$]$2"; then m4_if([$5], , :, [$5]) else m4_if([$6], , :, [$6]) fi ])# _LT_COMPILER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], []) # _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------- # Check whether the given linker option works AC_DEFUN([_LT_LINKER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS $3" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&AS_MESSAGE_LOG_FD $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi else $2=yes fi fi $RM -r conftest* LDFLAGS=$save_LDFLAGS ]) if test yes = "[$]$2"; then m4_if([$4], , :, [$4]) else m4_if([$5], , :, [$5]) fi ])# _LT_LINKER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], []) # LT_CMD_MAX_LEN #--------------- AC_DEFUN([LT_CMD_MAX_LEN], [AC_REQUIRE([AC_CANONICAL_HOST])dnl # find the maximum length of command line arguments AC_MSG_CHECKING([the maximum length of command line arguments]) AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl i=0 teststring=ABCD case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; bitrig* | darwin* | dragonfly* | freebsd* | netbsd* | openbsd*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[ ]]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test X`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test 17 != "$i" # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac ]) if test -n "$lt_cv_sys_max_cmd_len"; then AC_MSG_RESULT($lt_cv_sys_max_cmd_len) else AC_MSG_RESULT(none) fi max_cmd_len=$lt_cv_sys_max_cmd_len _LT_DECL([], [max_cmd_len], [0], [What is the maximum length of a command?]) ])# LT_CMD_MAX_LEN # Old name: AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], []) # _LT_HEADER_DLFCN # ---------------- m4_defun([_LT_HEADER_DLFCN], [AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl ])# _LT_HEADER_DLFCN # _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE, # ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING) # ---------------------------------------------------------------- m4_defun([_LT_TRY_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test yes = "$cross_compiling"; then : [$4] else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF [#line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; }] _LT_EOF if AC_TRY_EVAL(ac_link) && test -s "conftest$ac_exeext" 2>/dev/null; then (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) $1 ;; x$lt_dlneed_uscore) $2 ;; x$lt_dlunknown|x*) $3 ;; esac else : # compilation failed $3 fi fi rm -fr conftest* ])# _LT_TRY_DLOPEN_SELF # LT_SYS_DLOPEN_SELF # ------------------ AC_DEFUN([LT_SYS_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test yes != "$enable_dlopen"; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen=load_add_on lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen=LoadLibrary lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen=dlopen lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl],[ lt_cv_dlopen=dyld lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ]) ;; tpf*) # Don't try to run any link tests for TPF. We know it's impossible # because TPF is a cross-compiler, and we know how we open DSOs. lt_cv_dlopen=dlopen lt_cv_dlopen_libs= lt_cv_dlopen_self=no ;; *) AC_CHECK_FUNC([shl_load], [lt_cv_dlopen=shl_load], [AC_CHECK_LIB([dld], [shl_load], [lt_cv_dlopen=shl_load lt_cv_dlopen_libs=-ldld], [AC_CHECK_FUNC([dlopen], [lt_cv_dlopen=dlopen], [AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl], [AC_CHECK_LIB([svld], [dlopen], [lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-lsvld], [AC_CHECK_LIB([dld], [dld_link], [lt_cv_dlopen=dld_link lt_cv_dlopen_libs=-ldld]) ]) ]) ]) ]) ]) ;; esac if test no = "$lt_cv_dlopen"; then enable_dlopen=no else enable_dlopen=yes fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS=$CPPFLAGS test yes = "$ac_cv_header_dlfcn_h" && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS=$LDFLAGS wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS=$LIBS LIBS="$lt_cv_dlopen_libs $LIBS" AC_CACHE_CHECK([whether a program can dlopen itself], lt_cv_dlopen_self, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes, lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross) ]) if test yes = "$lt_cv_dlopen_self"; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" AC_CACHE_CHECK([whether a statically linked program can dlopen itself], lt_cv_dlopen_self_static, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross) ]) fi CPPFLAGS=$save_CPPFLAGS LDFLAGS=$save_LDFLAGS LIBS=$save_LIBS ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi _LT_DECL([dlopen_support], [enable_dlopen], [0], [Whether dlopen is supported]) _LT_DECL([dlopen_self], [enable_dlopen_self], [0], [Whether dlopen of programs is supported]) _LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0], [Whether dlopen of statically linked programs is supported]) ])# LT_SYS_DLOPEN_SELF # Old name: AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], []) # _LT_COMPILER_C_O([TAGNAME]) # --------------------------- # Check to see if options -c and -o are simultaneously supported by compiler. # This macro does not hard code the compiler like AC_PROG_CC_C_O. m4_defun([_LT_COMPILER_C_O], [m4_require([_LT_DECL_SED])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes fi fi chmod u+w . 2>&AS_MESSAGE_LOG_FD $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* ]) _LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1], [Does compiler simultaneously support -c and -o options?]) ])# _LT_COMPILER_C_O # _LT_COMPILER_FILE_LOCKS([TAGNAME]) # ---------------------------------- # Check to see if we can do hard links to lock some files if needed m4_defun([_LT_COMPILER_FILE_LOCKS], [m4_require([_LT_ENABLE_LOCK])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_COMPILER_C_O([$1]) hard_links=nottested if test no = "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" && test no != "$need_locks"; then # do not overwrite the value of need_locks provided by the user AC_MSG_CHECKING([if we can lock with hard links]) hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no AC_MSG_RESULT([$hard_links]) if test no = "$hard_links"; then AC_MSG_WARN(['$CC' does not support '-c -o', so 'make -j' may be unsafe]) need_locks=warn fi else need_locks=no fi _LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?]) ])# _LT_COMPILER_FILE_LOCKS # _LT_CHECK_OBJDIR # ---------------- m4_defun([_LT_CHECK_OBJDIR], [AC_CACHE_CHECK([for objdir], [lt_cv_objdir], [rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null]) objdir=$lt_cv_objdir _LT_DECL([], [objdir], [0], [The name of the directory that contains temporary libtool files])dnl m4_pattern_allow([LT_OBJDIR])dnl AC_DEFINE_UNQUOTED([LT_OBJDIR], "$lt_cv_objdir/", [Define to the sub-directory where libtool stores uninstalled libraries.]) ])# _LT_CHECK_OBJDIR # _LT_LINKER_HARDCODE_LIBPATH([TAGNAME]) # -------------------------------------- # Check hardcoding attributes. m4_defun([_LT_LINKER_HARDCODE_LIBPATH], [AC_MSG_CHECKING([how to hardcode library paths into programs]) _LT_TAGVAR(hardcode_action, $1)= if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" || test -n "$_LT_TAGVAR(runpath_var, $1)" || test yes = "$_LT_TAGVAR(hardcode_automatic, $1)"; then # We can hardcode non-existent directories. if test no != "$_LT_TAGVAR(hardcode_direct, $1)" && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test no != "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" && test no != "$_LT_TAGVAR(hardcode_minus_L, $1)"; then # Linking always hardcodes the temporary library directory. _LT_TAGVAR(hardcode_action, $1)=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. _LT_TAGVAR(hardcode_action, $1)=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. _LT_TAGVAR(hardcode_action, $1)=unsupported fi AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)]) if test relink = "$_LT_TAGVAR(hardcode_action, $1)" || test yes = "$_LT_TAGVAR(inherit_rpath, $1)"; then # Fast installation is not supported enable_fast_install=no elif test yes = "$shlibpath_overrides_runpath" || test no = "$enable_shared"; then # Fast installation is not necessary enable_fast_install=needless fi _LT_TAGDECL([], [hardcode_action], [0], [How to hardcode a shared library path into an executable]) ])# _LT_LINKER_HARDCODE_LIBPATH # _LT_CMD_STRIPLIB # ---------------- m4_defun([_LT_CMD_STRIPLIB], [m4_require([_LT_DECL_EGREP]) striplib= old_striplib= AC_MSG_CHECKING([whether stripping libraries is possible]) if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" AC_MSG_RESULT([yes]) else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP"; then striplib="$STRIP -x" old_striplib="$STRIP -S" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi ;; *) AC_MSG_RESULT([no]) ;; esac fi _LT_DECL([], [old_striplib], [1], [Commands to strip libraries]) _LT_DECL([], [striplib], [1]) ])# _LT_CMD_STRIPLIB # _LT_SYS_DYNAMIC_LINKER([TAG]) # ----------------------------- # PORTME Fill in your ld.so characteristics m4_defun([_LT_SYS_DYNAMIC_LINKER], [AC_REQUIRE([AC_CANONICAL_HOST])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_OBJDUMP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl AC_MSG_CHECKING([dynamic linker characteristics]) m4_if([$1], [], [ if test yes = "$GCC"; then case $host_os in darwin*) lt_awk_arg='/^libraries:/,/LR/' ;; *) lt_awk_arg='/^libraries:/' ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq='s|=\([[A-Za-z]]:\)|\1|g' ;; *) lt_sed_strip_eq='s|=/|/|g' ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary... lt_tmp_lt_search_path_spec= lt_multi_os_dir=/`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` # ...but if some path component already ends with the multilib dir we assume # that all is fine and trust -print-search-dirs as is (GCC 4.2? or newer). case "$lt_multi_os_dir; $lt_search_path_spec " in "/; "* | "/.; "* | "/./; "* | *"$lt_multi_os_dir "* | *"$lt_multi_os_dir/ "*) lt_multi_os_dir= ;; esac for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path$lt_multi_os_dir" elif test -n "$lt_multi_os_dir"; then test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS = " "; FS = "/|\n";} { lt_foo = ""; lt_count = 0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo = "/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[[lt_foo]]++; } if (lt_freq[[lt_foo]] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's|/\([[A-Za-z]]:\)|\1|g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi]) library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=.so postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='$libname$release$shared_ext$major' ;; aix[[4-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test ia64 = "$host_cpu"; then # AIX 5 supports IA64 library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line '#! .'. This would cause the generated library to # depend on '.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[[01]] | aix4.[[01]].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test yes = "$aix_use_runtimelinking"; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='$libname$release.a $libname.a' soname_spec='$libname$release$shared_ext$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='$libname$shared_ext' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[[45]]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=.dll need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api"]) ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext' library_names_spec='$libname.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([[a-zA-Z]]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec=$LIB if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='$libname`echo $release | $SED -e 's/[[.]]/-/g'`$versuffix$shared_ext $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='$libname$release$major$shared_ext $libname$shared_ext' soname_spec='$libname$release$major$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"]) sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[[23]].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[[01]]* | freebsdelf3.[[01]]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \ freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=no sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' if test 32 = "$HPUX_IA64_MODE"; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[[3-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test yes = "$lt_cv_prog_gnu_ld"; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff" sys_lib_dlsearch_path_spec="/usr/lib$libsuff /lib$libsuff" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; linux*android*) version_type=none # Android doesn't support versioned libraries. need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext' soname_spec='$libname$release$shared_ext' finish_cmds= shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes dynamic_linker='Android linker' # Don't embed -rpath directories since the linker doesn't support them. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH AC_CACHE_VAL([lt_cv_shlibpath_overrides_runpath], [lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \ LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\"" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null], [lt_cv_shlibpath_overrides_runpath=yes])]) LDFLAGS=$save_LDFLAGS libdir=$save_libdir ]) shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd* | bitrig*) version_type=sunos sys_lib_dlsearch_path_spec=/usr/lib need_lib_prefix=no if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then need_version=no else need_version=yes fi library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; os2*) libname_spec='$name' shrext_cmds=.dll need_lib_prefix=no library_names_spec='$libname$shared_ext $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test yes = "$with_gnu_ld"; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec; then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext' soname_spec='$libname$shared_ext.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test yes = "$with_gnu_ld"; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac AC_MSG_RESULT([$dynamic_linker]) test no = "$dynamic_linker" && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test yes = "$GCC"; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test set = "${lt_cv_sys_lib_search_path_spec+set}"; then sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec fi if test set = "${lt_cv_sys_lib_dlsearch_path_spec+set}"; then sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec fi _LT_DECL([], [variables_saved_for_relink], [1], [Variables whose values should be saved in libtool wrapper scripts and restored at link time]) _LT_DECL([], [need_lib_prefix], [0], [Do we need the "lib" prefix for modules?]) _LT_DECL([], [need_version], [0], [Do we need a version for libraries?]) _LT_DECL([], [version_type], [0], [Library versioning type]) _LT_DECL([], [runpath_var], [0], [Shared library runtime path variable]) _LT_DECL([], [shlibpath_var], [0],[Shared library path variable]) _LT_DECL([], [shlibpath_overrides_runpath], [0], [Is shlibpath searched before the hard-coded library search path?]) _LT_DECL([], [libname_spec], [1], [Format of library name prefix]) _LT_DECL([], [library_names_spec], [1], [[List of archive names. First name is the real one, the rest are links. The last name is the one that the linker finds with -lNAME]]) _LT_DECL([], [soname_spec], [1], [[The coded name of the library, if different from the real name]]) _LT_DECL([], [install_override_mode], [1], [Permission mode override for installation of shared libraries]) _LT_DECL([], [postinstall_cmds], [2], [Command to use after installation of a shared archive]) _LT_DECL([], [postuninstall_cmds], [2], [Command to use after uninstallation of a shared archive]) _LT_DECL([], [finish_cmds], [2], [Commands used to finish a libtool library installation in a directory]) _LT_DECL([], [finish_eval], [1], [[As "finish_cmds", except a single script fragment to be evaled but not shown]]) _LT_DECL([], [hardcode_into_libs], [0], [Whether we should hardcode library paths into libraries]) _LT_DECL([], [sys_lib_search_path_spec], [2], [Compile-time system search path for libraries]) _LT_DECL([], [sys_lib_dlsearch_path_spec], [2], [Run-time system search path for libraries]) ])# _LT_SYS_DYNAMIC_LINKER # _LT_PATH_TOOL_PREFIX(TOOL) # -------------------------- # find a file program that can recognize shared library AC_DEFUN([_LT_PATH_TOOL_PREFIX], [m4_require([_LT_DECL_EGREP])dnl AC_MSG_CHECKING([for $1]) AC_CACHE_VAL(lt_cv_path_MAGIC_CMD, [case $MAGIC_CMD in [[\\/*] | ?:[\\/]*]) lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD=$MAGIC_CMD lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR dnl $ac_dummy forces splitting on constant user-supplied paths. dnl POSIX.2 word splitting is done only on the output of word expansions, dnl not every word. This closes a longstanding sh security hole. ac_dummy="m4_if([$2], , $PATH, [$2])" for ac_dir in $ac_dummy; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$1"; then lt_cv_path_MAGIC_CMD=$ac_dir/"$1" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD=$lt_cv_path_MAGIC_CMD if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS=$lt_save_ifs MAGIC_CMD=$lt_save_MAGIC_CMD ;; esac]) MAGIC_CMD=$lt_cv_path_MAGIC_CMD if test -n "$MAGIC_CMD"; then AC_MSG_RESULT($MAGIC_CMD) else AC_MSG_RESULT(no) fi _LT_DECL([], [MAGIC_CMD], [0], [Used to examine libraries when file_magic_cmd begins with "file"])dnl ])# _LT_PATH_TOOL_PREFIX # Old name: AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], []) # _LT_PATH_MAGIC # -------------- # find a file program that can recognize a shared library m4_defun([_LT_PATH_MAGIC], [_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH) if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH) else MAGIC_CMD=: fi fi ])# _LT_PATH_MAGIC # LT_PATH_LD # ---------- # find the pathname to the GNU or non-GNU linker AC_DEFUN([LT_PATH_LD], [AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PROG_ECHO_BACKSLASH])dnl AC_ARG_WITH([gnu-ld], [AS_HELP_STRING([--with-gnu-ld], [assume the C compiler uses GNU ld @<:@default=no@:>@])], [test no = "$withval" || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test yes = "$GCC"; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by $CC]) case $host in *-*-mingw*) # gcc leaves a trailing carriage return, which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [[\\/]]* | ?:[[\\/]]*) re_direlt='/[[^/]][[^/]]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD=$ac_prog ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test yes = "$with_gnu_ld"; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(lt_cv_path_LD, [if test -z "$LD"; then lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD=$ac_dir/$ac_prog # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &1 /dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]'] lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]]\.[[0-9]]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[[3-9]]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd* | bitrig*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac ]) file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[[\1]]\/[[\1]]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown _LT_DECL([], [deplibs_check_method], [1], [Method to check whether dependent libraries are shared objects]) _LT_DECL([], [file_magic_cmd], [1], [Command to use when deplibs_check_method = "file_magic"]) _LT_DECL([], [file_magic_glob], [1], [How to find potential files when deplibs_check_method = "file_magic"]) _LT_DECL([], [want_nocaseglob], [1], [Find potential files using nocaseglob when deplibs_check_method = "file_magic"]) ])# _LT_CHECK_MAGIC_METHOD # LT_PATH_NM # ---------- # find the pathname to a BSD- or MS-compatible name lister AC_DEFUN([LT_PATH_NM], [AC_REQUIRE([AC_PROG_CC])dnl AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM, [if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM=$NM else lt_nm_to_check=${ac_tool_prefix}nm if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. tmp_nm=$ac_dir/$lt_tmp_nm if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext"; then # Check to see if the nm accepts a BSD-compat flag. # Adding the 'sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break 2 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break 2 ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS=$lt_save_ifs done : ${lt_cv_path_NM=no} fi]) if test no != "$lt_cv_path_NM"; then NM=$lt_cv_path_NM else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else AC_CHECK_TOOLS(DUMPBIN, [dumpbin "link -dump"], :) case `$DUMPBIN -symbols -headers /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols -headers" ;; *) DUMPBIN=: ;; esac fi AC_SUBST([DUMPBIN]) if test : != "$DUMPBIN"; then NM=$DUMPBIN fi fi test -z "$NM" && NM=nm AC_SUBST([NM]) _LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface], [lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: output\"" >&AS_MESSAGE_LOG_FD) cat conftest.out >&AS_MESSAGE_LOG_FD if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest*]) ])# LT_PATH_NM # Old names: AU_ALIAS([AM_PROG_NM], [LT_PATH_NM]) AU_ALIAS([AC_PROG_NM], [LT_PATH_NM]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_PROG_NM], []) dnl AC_DEFUN([AC_PROG_NM], []) # _LT_CHECK_SHAREDLIB_FROM_LINKLIB # -------------------------------- # how to determine the name of the shared library # associated with a specific link library. # -- PORTME fill in with the dynamic library characteristics m4_defun([_LT_CHECK_SHAREDLIB_FROM_LINKLIB], [m4_require([_LT_DECL_EGREP]) m4_require([_LT_DECL_OBJDUMP]) m4_require([_LT_DECL_DLLTOOL]) AC_CACHE_CHECK([how to associate runtime and link libraries], lt_cv_sharedlib_from_linklib_cmd, [lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh; # decide which one to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd=$ECHO ;; esac ]) sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO _LT_DECL([], [sharedlib_from_linklib_cmd], [1], [Command to associate shared and link libraries]) ])# _LT_CHECK_SHAREDLIB_FROM_LINKLIB # _LT_PATH_MANIFEST_TOOL # ---------------------- # locate the manifest tool m4_defun([_LT_PATH_MANIFEST_TOOL], [AC_CHECK_TOOL(MANIFEST_TOOL, mt, :) test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt AC_CACHE_CHECK([if $MANIFEST_TOOL is a manifest tool], [lt_cv_path_mainfest_tool], [lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&AS_MESSAGE_LOG_FD $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&AS_MESSAGE_LOG_FD if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest*]) if test yes != "$lt_cv_path_mainfest_tool"; then MANIFEST_TOOL=: fi _LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl ])# _LT_PATH_MANIFEST_TOOL # _LT_DLL_DEF_P([FILE]) # --------------------- # True iff FILE is a Windows DLL '.def' file. # Keep in sync with func_dll_def_p in the libtool script AC_DEFUN([_LT_DLL_DEF_P], [dnl test DEF = "`$SED -n dnl -e '\''s/^[[ ]]*//'\'' dnl Strip leading whitespace -e '\''/^\(;.*\)*$/d'\'' dnl Delete empty lines and comments -e '\''s/^\(EXPORTS\|LIBRARY\)\([[ ]].*\)*$/DEF/p'\'' dnl -e q dnl Only consider the first "real" line $1`" dnl ])# _LT_DLL_DEF_P # LT_LIB_M # -------- # check for math library AC_DEFUN([LT_LIB_M], [AC_REQUIRE([AC_CANONICAL_HOST])dnl LIBM= case $host in *-*-beos* | *-*-cegcc* | *-*-cygwin* | *-*-haiku* | *-*-pw32* | *-*-darwin*) # These system don't have libm, or don't need it ;; *-ncr-sysv4.3*) AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM=-lmw) AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm") ;; *) AC_CHECK_LIB(m, cos, LIBM=-lm) ;; esac AC_SUBST([LIBM]) ])# LT_LIB_M # Old name: AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_CHECK_LIBM], []) # _LT_COMPILER_NO_RTTI([TAGNAME]) # ------------------------------- m4_defun([_LT_COMPILER_NO_RTTI], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= if test yes = "$GCC"; then case $cc_basename in nvcc*) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -Xcompiler -fno-builtin' ;; *) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' ;; esac _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions], lt_cv_prog_compiler_rtti_exceptions, [-fno-rtti -fno-exceptions], [], [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"]) fi _LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1], [Compiler flag to turn off builtin functions]) ])# _LT_COMPILER_NO_RTTI # _LT_CMD_GLOBAL_SYMBOLS # ---------------------- m4_defun([_LT_CMD_GLOBAL_SYMBOLS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([LT_PATH_NM])dnl AC_REQUIRE([LT_PATH_LD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_TAG_COMPILER])dnl # Check for command to grab the raw symbol name followed by C symbol from nm. AC_MSG_CHECKING([command to parse $NM output from $compiler object]) AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe], [ # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[[BCDEGRST]]' # Regexp to match symbols that can be accessed directly from C. sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[[BCDT]]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[[ABCDGISTW]]' ;; hpux*) if test ia64 = "$host_cpu"; then symcode='[[ABCDEGRST]]' fi ;; irix* | nonstopux*) symcode='[[BCDEGRST]]' ;; osf*) symcode='[[BCDEGQRST]]' ;; solaris*) symcode='[[BDRT]]' ;; sco3.2v5*) symcode='[[DT]]' ;; sysv4.2uw2*) symcode='[[DT]]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[[ABDT]]' ;; sysv4) symcode='[[DFNSTU]]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[[ABCDGIRSTW]]' ;; esac if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Gets list of data symbols to import. lt_cv_sys_global_symbol_to_import="sed -n -e 's/^I .* \(.*\)$/\1/p'" # Adjust the below global symbol transforms to fixup imported variables. lt_cdecl_hook=" -e 's/^I .* \(.*\)$/extern __declspec(dllimport) char \1;/p'" lt_c_name_hook=" -e 's/^I .* \(.*\)$/ {\"\1\", (void *) 0},/p'" lt_c_name_lib_hook="\ -e 's/^I .* \(lib.*\)$/ {\"\1\", (void *) 0},/p'\ -e 's/^I .* \(.*\)$/ {\"lib\1\", (void *) 0},/p'" else # Disable hooks by default. lt_cv_sys_global_symbol_to_import= lt_cdecl_hook= lt_c_name_hook= lt_c_name_lib_hook= fi # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n"\ $lt_cdecl_hook\ " -e 's/^T .* \(.*\)$/extern int \1();/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n"\ $lt_c_name_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/p'" # Transform an extracted symbol line into symbol name with lib prefix and # symbol address. lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n"\ $lt_c_name_lib_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(lib.*\)$/ {\"\1\", (void *) \&\1},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"lib\1\", (void *) \&\1},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function, # D for any global variable and I for any imported variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK ['"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " /^ *Symbol name *: /{split(\$ 0,sn,\":\"); si=substr(sn[2],2)};"\ " /^ *Type *: code/{print \"T\",si,substr(si,length(prfx))};"\ " /^ *Type *: data/{print \"I\",si,substr(si,length(prfx))};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=\"D\"}; \$ 0~/\(\).*\|/{f=\"T\"};"\ " {split(\$ 0,a,/\||\r/); split(a[2],s)};"\ " s[1]~/^[@?]/{print f,s[1],s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print f,t[1],substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx]" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if AC_TRY_EVAL(ac_compile); then # Now try to grab the symbols. nlist=conftest.nm if AC_TRY_EVAL(NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE /* DATA imports from DLLs on WIN32 can't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT@&t@_DLSYM_CONST #elif defined __osf__ /* This system does not cope well with relocations in const data. */ # define LT@&t@_DLSYM_CONST #else # define LT@&t@_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT@&t@_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[[]] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS=conftstm.$ac_objext CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)" if AC_TRY_EVAL(ac_link) && test -s conftest$ac_exeext; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD fi else echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test yes = "$pipe_works"; then break else lt_cv_sys_global_symbol_pipe= fi done ]) if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then AC_MSG_RESULT(failed) else AC_MSG_RESULT(ok) fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[[@]]FILE' >/dev/null; then nm_file_list_spec='@' fi _LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1], [Take the output of nm and produce a listing of raw symbols and C names]) _LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1], [Transform the output of nm in a proper C declaration]) _LT_DECL([global_symbol_to_import], [lt_cv_sys_global_symbol_to_import], [1], [Transform the output of nm into a list of symbols to manually relocate]) _LT_DECL([global_symbol_to_c_name_address], [lt_cv_sys_global_symbol_to_c_name_address], [1], [Transform the output of nm in a C name address pair]) _LT_DECL([global_symbol_to_c_name_address_lib_prefix], [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1], [Transform the output of nm in a C name address pair when lib prefix is needed]) _LT_DECL([nm_interface], [lt_cv_nm_interface], [1], [The name lister interface]) _LT_DECL([], [nm_file_list_spec], [1], [Specify filename containing input files for $NM]) ]) # _LT_CMD_GLOBAL_SYMBOLS # _LT_COMPILER_PIC([TAGNAME]) # --------------------------- m4_defun([_LT_COMPILER_PIC], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_wl, $1)= _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)= m4_if([$1], [CXX], [ # C++ specific cases for pic, static, wl, etc. if test yes = "$GXX"; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the '-m68020' flag to GCC prevents building anything better, # like '-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else case $host_os in aix[[4-9]]*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; dgux*) case $cc_basename in ec++*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; ghcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive' if test ia64 != "$host_cpu"; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' fi ;; aCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # KAI C++ Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64, which still supported -KPIC. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xlc* | xlC* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL 8.0, 9.0 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall' ;; *) ;; esac ;; netbsd*) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; cxx*) # Digital/Compaq C++ _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; lcc*) # Lucid _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ], [ if test yes = "$GCC"; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the '-m68020' flag to GCC prevents building anything better, # like '-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Xlinker ' if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_TAGVAR(lt_prog_compiler_pic, $1)="-Xcompiler $_LT_TAGVAR(lt_prog_compiler_pic, $1)" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' case $cc_basename in nagfor*) # NAG Fortran compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; hpux9* | hpux10* | hpux11*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? _LT_TAGVAR(lt_prog_compiler_static, $1)='$wl-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC (with -KPIC) is the default. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64, which still supported -KPIC. ecc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # Lahey Fortran 8.1. lf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared' _LT_TAGVAR(lt_prog_compiler_static, $1)='--static' ;; nagfor*) # NAG Fortran compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; tcc*) # Fabrice Bellard et al's Tiny C Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; ccc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All Alpha code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [[1-7]].* | *Sun*Fortran*\ 8.[[0-3]]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='' ;; *Sun\ F* | *Sun*Fortran*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' ;; *Intel*\ [[CF]]*Compiler*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; *Portland\ Group*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; esac ;; newsos6) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All OSF/1 code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; rdos*) _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; solaris*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';; *) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';; esac ;; sunos4*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; unicos*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; uts4*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ]) case $host_os in # For platforms that do not support PIC, -DPIC is meaningless: *djgpp*) _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])" ;; esac AC_CACHE_CHECK([for $compiler option to produce PIC], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_prog_compiler_pic, $1)]) _LT_TAGVAR(lt_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_cv_prog_compiler_pic, $1) # # Check to make sure the PIC flag actually works. # if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works], [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)], [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [], [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in "" | " "*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;; esac], [_LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no]) fi _LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1], [Additional compiler flags for building library objects]) _LT_TAGDECL([wl], [lt_prog_compiler_wl], [1], [How to pass a linker flag through the compiler]) # # Check to make sure the static flag actually works. # wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\" _LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works], _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1), $lt_tmp_static_flag, [], [_LT_TAGVAR(lt_prog_compiler_static, $1)=]) _LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1], [Compiler flag to prevent dynamic linking]) ])# _LT_COMPILER_PIC # _LT_LINKER_SHLIBS([TAGNAME]) # ---------------------------- # See if the linker supports building shared libraries. m4_defun([_LT_LINKER_SHLIBS], [AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) m4_if([$1], [CXX], [ _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] case $host_os in aix[[4-9]]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global defined # symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) _LT_TAGVAR(export_symbols_cmds, $1)=$ltdll_cmds ;; cygwin* | mingw* | cegcc*) case $cc_basename in cl*) _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] ;; esac ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac ], [ runpath_var= _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_cmds, $1)= _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(old_archive_from_new_cmds, $1)= _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)= _LT_TAGVAR(thread_safe_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list _LT_TAGVAR(include_expsyms, $1)= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ' (' and ')$', so one must not match beginning or # end of line. Example: 'a|bc|.*d.*' will exclude the symbols 'a' and 'bc', # as well as any symbol that contains 'd'. _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. dnl Note also adjust exclude_expsyms for C++ above. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test yes != "$GCC"; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd* | bitrig*) with_gnu_ld=no ;; esac _LT_TAGVAR(ld_shlibs, $1)=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test yes = "$with_gnu_ld"; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[[2-9]]*) ;; *\ \(GNU\ Binutils\)\ [[3-9]]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test yes = "$lt_use_gnu_ld_interface"; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='$wl' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi supports_anon_versioning=no case `$LD -v | $SED -e 's/([^)]\+)\s\+//' 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[[3-9]]*) # On AIX/PPC, the GNU linker is very broken if test ia64 != "$host_cpu"; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file, use it as # is; otherwise, prepend EXPORTS... _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s|^|_|" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test linux-dietlibc = "$host_os"; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test no = "$tmp_diet" then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 _LT_TAGVAR(whole_archive_flag_spec, $1)= tmp_sharedflag='--shared' ;; nagfor*) # NAGFOR 5.3 tmp_sharedflag='-Wl,-shared' ;; xl[[cC]]* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac _LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' if test yes = "$supports_anon_versioning"; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test yes = "$supports_anon_versioning"; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*) _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 cannot *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; sunos4*) _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac if test no = "$_LT_TAGVAR(ld_shlibs, $1)"; then runpath_var= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. _LT_TAGVAR(hardcode_minus_L, $1)=yes if test yes = "$GCC" && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. _LT_TAGVAR(hardcode_direct, $1)=unsupported fi ;; aix[[4-9]]*) if test ia64 = "$host_cpu"; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag= else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do if (test x-brtl = "x$ld_flag" || test x-Wl,-brtl = "x$ld_flag"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='$wl-f,' if test yes = "$GCC"; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`$CC -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi ;; esac shared_flag='-shared' if test yes = "$aix_use_runtimelinking"; then shared_flag="$shared_flag "'$wl-G' fi else # not using gcc if test ia64 = "$host_cpu"; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test yes = "$aix_use_runtimelinking"; then shared_flag='$wl-G' else shared_flag='$wl-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. _LT_TAGVAR(always_export_symbols, $1)=yes if test yes = "$aix_use_runtimelinking"; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n "$allow_undefined_flag"; then func_echo_all "$wl$allow_undefined_flag"; else :; fi` $wl'$exp_sym_flag:\$export_symbols' '$shared_flag else if test ia64 = "$host_cpu"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\$wl$no_entry_flag"' $compiler_flags $wl$allow_undefined_flag '"\$wl$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' $wl-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-berok' if test yes = "$with_gnu_ld"; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $wl-bnoentry $compiler_flags $wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; bsdi[[45]]*) _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp "$export_symbols" "$output_objdir/$soname.def"; echo "$tool_output_objdir$soname.def" > "$output_objdir/$soname.exp"; else $SED -e '\''s/^/-link -EXPORT:/'\'' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1,DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile=$lt_outputfile.exe lt_tool_outputfile=$lt_tool_outputfile.exe ;; esac~ if test : != "$MANIFEST_TOOL" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' # FIXME: Should let the user specify the lib program. _LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; hpux9*) if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' else _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' ;; hpux10*) if test yes,no = "$GCC,$with_gnu_ld"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test no = "$with_gnu_ld"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes fi ;; hpux11*) if test yes,no = "$GCC,$with_gnu_ld"; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) m4_if($1, [], [ # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) _LT_LINKER_OPTION([if $CC understands -b], _LT_TAGVAR(lt_cv_prog_compiler__b, $1), [-b], [_LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags'], [_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'])], [_LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags']) ;; esac fi if test no = "$with_gnu_ld"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. AC_CACHE_CHECK([whether the $host_os linker accepts -exported_symbol], [lt_cv_irix_exported_symbol], [save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS -shared $wl-exported_symbol ${wl}foo $wl-update_registry $wl/dev/null" AC_LINK_IFELSE( [AC_LANG_SOURCE( [AC_LANG_CASE([C], [[int foo (void) { return 0; }]], [C++], [[int foo (void) { return 0; }]], [Fortran 77], [[ subroutine foo end]], [Fortran], [[ subroutine foo end]])])], [lt_cv_irix_exported_symbol=yes], [lt_cv_irix_exported_symbol=no]) LDFLAGS=$save_LDFLAGS]) if test yes = "$lt_cv_irix_exported_symbol"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations $wl-exports_file $wl$export_symbols -o $lib' fi else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -exports_file $export_symbols -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes _LT_TAGVAR(link_all_deplibs, $1)=yes ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else _LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; newsos6) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *nto* | *qnx*) ;; openbsd* | bitrig*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags $wl-retain-symbols-file,$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' fi else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; os2*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test yes = "$GCC"; then _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test yes = "$GCC"; then _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $pic_flag $libobjs $deplibs $compiler_flags $wl-msym $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $wl-input $wl$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; solaris*) _LT_TAGVAR(no_undefined_flag, $1)=' -z defs' if test yes = "$GCC"; then wlarc='$wl' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $wl-z ${wl}text $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag $wl-z ${wl}text $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' _LT_TAGVAR(archive_cmds, $1)='$LD -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='$wl' _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands '-z linker_flag'. GCC discards it without '$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test yes = "$GCC"; then _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract' else _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' fi ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes ;; sunos4*) if test sequent = "$host_vendor"; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h $soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4) case $host_vendor in sni) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs' _LT_TAGVAR(hardcode_direct, $1)=no ;; motorola) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4.3*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes _LT_TAGVAR(ld_shlibs, $1)=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We CANNOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='$wl-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Bexport' runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(ld_shlibs, $1)=no ;; esac if test sni = "$host_vendor"; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Blargedynsym' ;; esac fi fi ]) AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test no = "$_LT_TAGVAR(ld_shlibs, $1)" && can_build_shared=no _LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld _LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl _LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl _LT_DECL([], [extract_expsyms_cmds], [2], [The commands to extract the exported symbol list from a shared archive]) # # Do we need to explicitly link libc? # case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in x|xyes) # Assume -lc should be added _LT_TAGVAR(archive_cmds_need_lc, $1)=yes if test yes,yes = "$GCC,$enable_shared"; then case $_LT_TAGVAR(archive_cmds, $1) in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. AC_CACHE_CHECK([whether -lc should be explicitly linked in], [lt_cv_]_LT_TAGVAR(archive_cmds_need_lc, $1), [$RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if AC_TRY_EVAL(ac_compile) 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1) compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1) _LT_TAGVAR(allow_undefined_flag, $1)= if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) then lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=no else lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=yes fi _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* ]) _LT_TAGVAR(archive_cmds_need_lc, $1)=$lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1) ;; esac fi ;; esac _LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0], [Whether or not to add -lc for building shared libraries]) _LT_TAGDECL([allow_libtool_libs_with_static_runtimes], [enable_shared_with_static_runtimes], [0], [Whether or not to disallow shared libs when runtime libs are static]) _LT_TAGDECL([], [export_dynamic_flag_spec], [1], [Compiler flag to allow reflexive dlopens]) _LT_TAGDECL([], [whole_archive_flag_spec], [1], [Compiler flag to generate shared objects directly from archives]) _LT_TAGDECL([], [compiler_needs_object], [1], [Whether the compiler copes with passing no objects directly]) _LT_TAGDECL([], [old_archive_from_new_cmds], [2], [Create an old-style archive from a shared archive]) _LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2], [Create a temporary old-style archive to link instead of a shared archive]) _LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive]) _LT_TAGDECL([], [archive_expsym_cmds], [2]) _LT_TAGDECL([], [module_cmds], [2], [Commands used to build a loadable module if different from building a shared archive.]) _LT_TAGDECL([], [module_expsym_cmds], [2]) _LT_TAGDECL([], [with_gnu_ld], [1], [Whether we are building with GNU ld or not]) _LT_TAGDECL([], [allow_undefined_flag], [1], [Flag that allows shared libraries with undefined symbols to be built]) _LT_TAGDECL([], [no_undefined_flag], [1], [Flag that enforces no undefined symbols]) _LT_TAGDECL([], [hardcode_libdir_flag_spec], [1], [Flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]) _LT_TAGDECL([], [hardcode_libdir_separator], [1], [Whether we need a single "-rpath" flag with a separated argument]) _LT_TAGDECL([], [hardcode_direct], [0], [Set to "yes" if using DIR/libNAME$shared_ext during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_direct_absolute], [0], [Set to "yes" if using DIR/libNAME$shared_ext during linking hardcodes DIR into the resulting binary and the resulting library dependency is "absolute", i.e impossible to change by setting $shlibpath_var if the library is relocated]) _LT_TAGDECL([], [hardcode_minus_L], [0], [Set to "yes" if using the -LDIR flag during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_shlibpath_var], [0], [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_automatic], [0], [Set to "yes" if building a shared library automatically hardcodes DIR into the library and all subsequent libraries and executables linked against it]) _LT_TAGDECL([], [inherit_rpath], [0], [Set to yes if linker adds runtime paths of dependent libraries to runtime path list]) _LT_TAGDECL([], [link_all_deplibs], [0], [Whether libtool must link a program against all its dependency libraries]) _LT_TAGDECL([], [always_export_symbols], [0], [Set to "yes" if exported symbols are required]) _LT_TAGDECL([], [export_symbols_cmds], [2], [The commands to list exported symbols]) _LT_TAGDECL([], [exclude_expsyms], [1], [Symbols that should not be listed in the preloaded symbols]) _LT_TAGDECL([], [include_expsyms], [1], [Symbols that must always be exported]) _LT_TAGDECL([], [prelink_cmds], [2], [Commands necessary for linking programs (against libraries) with templates]) _LT_TAGDECL([], [postlink_cmds], [2], [Commands necessary for finishing linking programs]) _LT_TAGDECL([], [file_list_spec], [1], [Specify filename containing input files]) dnl FIXME: Not yet implemented dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1], dnl [Compiler flag to generate thread safe objects]) ])# _LT_LINKER_SHLIBS # _LT_LANG_C_CONFIG([TAG]) # ------------------------ # Ensure that the configuration variables for a C compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to 'libtool'. m4_defun([_LT_LANG_C_CONFIG], [m4_require([_LT_DECL_EGREP])dnl lt_save_CC=$CC AC_LANG_PUSH(C) # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' _LT_TAG_COMPILER # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) LT_SYS_DLOPEN_SELF _LT_CMD_STRIPLIB # Report what library types will actually be built AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_CONFIG($1) fi AC_LANG_POP CC=$lt_save_CC ])# _LT_LANG_C_CONFIG # _LT_LANG_CXX_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a C++ compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to 'libtool'. m4_defun([_LT_LANG_CXX_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl if test -n "$CXX" && ( test no != "$CXX" && ( (test g++ = "$CXX" && `g++ -v >/dev/null 2>&1` ) || (test g++ != "$CXX"))); then AC_PROG_CXXCPP else _lt_caught_CXX_error=yes fi AC_LANG_PUSH(C++) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test yes != "$_lt_caught_CXX_error"; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} CFLAGS=$CXXFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test yes = "$GXX"; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' else _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= fi if test yes = "$GXX"; then # Set up default GNU C++ configuration LT_PATH_LD # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test yes = "$with_gnu_ld"; then _LT_TAGVAR(archive_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='$wl' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) _LT_TAGVAR(ld_shlibs, $1)=yes case $host_os in aix3*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aix[[4-9]]*) if test ia64 = "$host_cpu"; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag= else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='$wl-f,' if test yes = "$GXX"; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`$CC -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi esac shared_flag='-shared' if test yes = "$aix_use_runtimelinking"; then shared_flag=$shared_flag' $wl-G' fi else # not using gcc if test ia64 = "$host_cpu"; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test yes = "$aix_use_runtimelinking"; then shared_flag='$wl-G' else shared_flag='$wl-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. _LT_TAGVAR(always_export_symbols, $1)=yes if test yes = "$aix_use_runtimelinking"; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an empty # executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n "$allow_undefined_flag"; then func_echo_all "$wl$allow_undefined_flag"; else :; fi` $wl'$exp_sym_flag:\$export_symbols' '$shared_flag else if test ia64 = "$host_cpu"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\$wl$no_entry_flag"' $compiler_flags $wl$allow_undefined_flag '"\$wl$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' $wl-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-berok' if test yes = "$with_gnu_ld"; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared # libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $wl-bnoentry $compiler_flags $wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) case $GXX,$cc_basename in ,cl* | no,cl*) # Native MSVC # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp "$export_symbols" "$output_objdir/$soname.def"; echo "$tool_output_objdir$soname.def" > "$output_objdir/$soname.exp"; else $SED -e '\''s/^/-link -EXPORT:/'\'' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile=$lt_outputfile.exe lt_tool_outputfile=$lt_tool_outputfile.exe ;; esac~ func_to_tool_file "$lt_outputfile"~ if test : != "$MANIFEST_TOOL" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # g++ # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file, use it as # is; otherwise, prepend EXPORTS... _LT_TAGVAR(archive_expsym_cmds, $1)='if _LT_DLL_DEF_P([$export_symbols]); then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; freebsd2.*) # C++ shared libraries reported to be fairly broken before # switch to ELF _LT_TAGVAR(ld_shlibs, $1)=no ;; freebsd-elf*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions _LT_TAGVAR(ld_shlibs, $1)=yes ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; hpux9*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes = "$GXX"; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; hpux10*|hpux11*) if test no = "$with_gnu_ld"; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl+b $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) ;; *) _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes = "$GXX"; then if test no = "$with_gnu_ld"; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s|^|_|" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test yes = "$GXX"; then if test no = "$with_gnu_ld"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` -o $lib' fi fi _LT_TAGVAR(link_all_deplibs, $1)=yes ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib $wl-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive$convenience $wl--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [[1-5]].* | *pgcpp\ [[1-5]].*) _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"' _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~ $RANLIB $oldlib' _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 6 and above use weak symbols _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl--rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' ;; cxx*) # Compaq C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib $wl-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed' ;; xl* | mpixl* | bgxl*) # IBM XL 8.0 on PPC, with GNU ld _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl--export-dynamic' _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' if test yes = "$supports_anon_versioning"; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file $wl$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; m88k*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) _LT_TAGVAR(ld_shlibs, $1)=yes ;; openbsd* | bitrig*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file,$export_symbols -o $lib' _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-E' _LT_TAGVAR(whole_archive_flag_spec, $1)=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' fi output_verbose_link_cmd=func_echo_all else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; cxx*) case $host in osf3*) _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $soname `test -n "$verstring" && func_echo_all "$wl-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' ;; *) _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname $wl-input $wl$lib.exp `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib~ $RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' ;; esac _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes,no = "$GXX,$with_gnu_ld"; then _LT_TAGVAR(allow_undefined_flag, $1)=' $wl-expect_unresolved $wl\*' case $host in osf3*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-msym $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-rpath $wl$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(archive_cmds_need_lc,$1)=yes _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G$allow_undefined_flag $wl-M $wl$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands '-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test yes,no = "$GXX,$with_gnu_ld"; then _LT_TAGVAR(no_undefined_flag, $1)=' $wl-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # g++ 2.7 appears to require '-G' NOT '-shared' on this # platform. _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R $wl$libdir' case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) _LT_TAGVAR(whole_archive_flag_spec, $1)='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We CANNOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='$wl-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='$wl-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='$wl-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='$wl-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(old_archive_cmds, $1)='$CC -Tprelink_objects $oldobjs~ '"$_LT_TAGVAR(old_archive_cmds, $1)" _LT_TAGVAR(reload_cmds, $1)='$CC -Tprelink_objects $reload_objs~ '"$_LT_TAGVAR(reload_cmds, $1)" ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test no = "$_LT_TAGVAR(ld_shlibs, $1)" && can_build_shared=no _LT_TAGVAR(GCC, $1)=$GXX _LT_TAGVAR(LD, $1)=$LD ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test yes != "$_lt_caught_CXX_error" AC_LANG_POP ])# _LT_LANG_CXX_CONFIG # _LT_FUNC_STRIPNAME_CNF # ---------------------- # func_stripname_cnf prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # # This function is identical to the (non-XSI) version of func_stripname, # except this one can be used by m4 code that may be executed by configure, # rather than the libtool script. m4_defun([_LT_FUNC_STRIPNAME_CNF],[dnl AC_REQUIRE([_LT_DECL_SED]) AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH]) func_stripname_cnf () { case @S|@2 in .*) func_stripname_result=`$ECHO "@S|@3" | $SED "s%^@S|@1%%; s%\\\\@S|@2\$%%"`;; *) func_stripname_result=`$ECHO "@S|@3" | $SED "s%^@S|@1%%; s%@S|@2\$%%"`;; esac } # func_stripname_cnf ])# _LT_FUNC_STRIPNAME_CNF # _LT_SYS_HIDDEN_LIBDEPS([TAGNAME]) # --------------------------------- # Figure out "hidden" library dependencies from verbose # compiler output when linking a shared library. # Parse the compiler output and extract the necessary # objects, libraries and library flags. m4_defun([_LT_SYS_HIDDEN_LIBDEPS], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl AC_REQUIRE([_LT_FUNC_STRIPNAME_CNF])dnl # Dependencies to place before and after the object being linked: _LT_TAGVAR(predep_objects, $1)= _LT_TAGVAR(postdep_objects, $1)= _LT_TAGVAR(predeps, $1)= _LT_TAGVAR(postdeps, $1)= _LT_TAGVAR(compiler_lib_search_path, $1)= dnl we can't use the lt_simple_compile_test_code here, dnl because it contains code intended for an executable, dnl not a library. It's possible we should let each dnl tag define a new lt_????_link_test_code variable, dnl but it's only used here... m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF int a; void foo (void) { a = 0; } _LT_EOF ], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF ], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer*4 a a=0 return end _LT_EOF ], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer a a=0 return end _LT_EOF ], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF public class foo { private int a; public void bar (void) { a = 0; } }; _LT_EOF ], [$1], [GO], [cat > conftest.$ac_ext <<_LT_EOF package foo func foo() { } _LT_EOF ]) _lt_libdeps_save_CFLAGS=$CFLAGS case "$CC $CFLAGS " in #( *\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;; *\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;; *\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;; esac dnl Parse the compiler output and extract the necessary dnl objects, libraries and library flags. if AC_TRY_EVAL(ac_compile); then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $prev$p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test x-L = "$p" || test x-R = "$p"; then prev=$p continue fi # Expand the sysroot to ease extracting the directories later. if test -z "$prev"; then case $p in -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;; -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;; -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;; esac fi case $p in =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;; esac if test no = "$pre_test_object_deps_done"; then case $prev in -L | -R) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then _LT_TAGVAR(compiler_lib_search_path, $1)=$prev$p else _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} $prev$p" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$_LT_TAGVAR(postdeps, $1)"; then _LT_TAGVAR(postdeps, $1)=$prev$p else _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} $prev$p" fi fi prev= ;; *.lto.$objext) ;; # Ignore GCC LTO objects *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test no = "$pre_test_object_deps_done"; then if test -z "$_LT_TAGVAR(predep_objects, $1)"; then _LT_TAGVAR(predep_objects, $1)=$p else _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p" fi else if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then _LT_TAGVAR(postdep_objects, $1)=$p else _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling $1 test program" fi $RM -f confest.$objext CFLAGS=$_lt_libdeps_save_CFLAGS # PORTME: override above test on systems where it is broken m4_if([$1], [CXX], [case $host_os in interix[[3-9]]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. _LT_TAGVAR(predep_objects,$1)= _LT_TAGVAR(postdep_objects,$1)= _LT_TAGVAR(postdeps,$1)= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test yes != "$solaris_use_stlport4"; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test yes != "$solaris_use_stlport4"; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; esac ]) case " $_LT_TAGVAR(postdeps, $1) " in *" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; esac _LT_TAGVAR(compiler_lib_search_dirs, $1)= if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | $SED -e 's! -L! !g' -e 's!^ !!'` fi _LT_TAGDECL([], [compiler_lib_search_dirs], [1], [The directories searched by this compiler when creating a shared library]) _LT_TAGDECL([], [predep_objects], [1], [Dependencies to place before and after the objects being linked to create a shared library]) _LT_TAGDECL([], [postdep_objects], [1]) _LT_TAGDECL([], [predeps], [1]) _LT_TAGDECL([], [postdeps], [1]) _LT_TAGDECL([], [compiler_lib_search_path], [1], [The library search path used internally by the compiler when linking a shared library]) ])# _LT_SYS_HIDDEN_LIBDEPS # _LT_LANG_F77_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a Fortran 77 compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_F77_CONFIG], [AC_LANG_PUSH(Fortran 77) if test -z "$F77" || test no = "$F77"; then _lt_disable_F77=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the F77 compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test yes != "$_lt_disable_F77"; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${F77-"f77"} CFLAGS=$FFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) GCC=$G77 if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)=$G77 _LT_TAGVAR(LD, $1)=$LD ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS fi # test yes != "$_lt_disable_F77" AC_LANG_POP ])# _LT_LANG_F77_CONFIG # _LT_LANG_FC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for a Fortran compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_FC_CONFIG], [AC_LANG_PUSH(Fortran) if test -z "$FC" || test no = "$FC"; then _lt_disable_FC=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for fc test sources. ac_ext=${ac_fc_srcext-f} # Object file extension for compiled fc test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the FC compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test yes != "$_lt_disable_FC"; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${FC-"f95"} CFLAGS=$FCFLAGS compiler=$CC GCC=$ac_cv_fc_compiler_gnu _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)=$ac_cv_fc_compiler_gnu _LT_TAGVAR(LD, $1)=$LD ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS fi # test yes != "$_lt_disable_FC" AC_LANG_POP ])# _LT_LANG_FC_CONFIG # _LT_LANG_GCJ_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Java Compiler compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_GCJ_CONFIG], [AC_REQUIRE([LT_PROG_GCJ])dnl AC_LANG_SAVE # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GCJ-"gcj"} CFLAGS=$GCJFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)=$LD _LT_CC_BASENAME([$compiler]) # GCJ did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GCJ_CONFIG # _LT_LANG_GO_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Go compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_GO_CONFIG], [AC_REQUIRE([LT_PROG_GO])dnl AC_LANG_SAVE # Source file extension for Go test sources. ac_ext=go # Object file extension for compiled Go test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="package main; func main() { }" # Code to be used in simple link tests lt_simple_link_test_code='package main; func main() { }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GOC-"gccgo"} CFLAGS=$GOFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)=$LD _LT_CC_BASENAME([$compiler]) # Go did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GO_CONFIG # _LT_LANG_RC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for the Windows resource compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to 'libtool'. m4_defun([_LT_LANG_RC_CONFIG], [AC_REQUIRE([LT_PROG_RC])dnl AC_LANG_SAVE # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }' # Code to be used in simple link tests lt_simple_link_test_code=$lt_simple_compile_test_code # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC= CC=${RC-"windres"} CFLAGS= compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes if test -n "$compiler"; then : _LT_CONFIG($1) fi GCC=$lt_save_GCC AC_LANG_RESTORE CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_RC_CONFIG # LT_PROG_GCJ # ----------- AC_DEFUN([LT_PROG_GCJ], [m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ], [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ], [AC_CHECK_TOOL(GCJ, gcj,) test set = "${GCJFLAGS+set}" || GCJFLAGS="-g -O2" AC_SUBST(GCJFLAGS)])])[]dnl ]) # Old name: AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_GCJ], []) # LT_PROG_GO # ---------- AC_DEFUN([LT_PROG_GO], [AC_CHECK_TOOL(GOC, gccgo,) ]) # LT_PROG_RC # ---------- AC_DEFUN([LT_PROG_RC], [AC_CHECK_TOOL(RC, windres,) ]) # Old name: AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_RC], []) # _LT_DECL_EGREP # -------------- # If we don't have a new enough Autoconf to choose the best grep # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_EGREP], [AC_REQUIRE([AC_PROG_EGREP])dnl AC_REQUIRE([AC_PROG_FGREP])dnl test -z "$GREP" && GREP=grep _LT_DECL([], [GREP], [1], [A grep program that handles long lines]) _LT_DECL([], [EGREP], [1], [An ERE matcher]) _LT_DECL([], [FGREP], [1], [A literal string matcher]) dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too AC_SUBST([GREP]) ]) # _LT_DECL_OBJDUMP # -------------- # If we don't have a new enough Autoconf to choose the best objdump # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_OBJDUMP], [AC_CHECK_TOOL(OBJDUMP, objdump, false) test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [An object symbol dumper]) AC_SUBST([OBJDUMP]) ]) # _LT_DECL_DLLTOOL # ---------------- # Ensure DLLTOOL variable is set. m4_defun([_LT_DECL_DLLTOOL], [AC_CHECK_TOOL(DLLTOOL, dlltool, false) test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program]) AC_SUBST([DLLTOOL]) ]) # _LT_DECL_SED # ------------ # Check for a fully-functional sed program, that truncates # as few characters as possible. Prefer GNU sed if found. m4_defun([_LT_DECL_SED], [AC_PROG_SED test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" _LT_DECL([], [SED], [1], [A sed program that does not truncate output]) _LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"], [Sed that helps us avoid accidentally triggering echo(1) options like -n]) ])# _LT_DECL_SED m4_ifndef([AC_PROG_SED], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_SED. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_SED], [AC_MSG_CHECKING([for a sed that does not truncate output]) AC_CACHE_VAL(lt_cv_path_SED, [# Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done IFS=$as_save_IFS lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f "$lt_ac_sed" && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test 10 -lt "$lt_ac_count" && break lt_ac_count=`expr $lt_ac_count + 1` if test "$lt_ac_count" -gt "$lt_ac_max"; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done ]) SED=$lt_cv_path_SED AC_SUBST([SED]) AC_MSG_RESULT([$SED]) ])#AC_PROG_SED ])#m4_ifndef # Old name: AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_SED], []) # _LT_CHECK_SHELL_FEATURES # ------------------------ # Find out whether the shell is Bourne or XSI compatible, # or has some other useful features. m4_defun([_LT_CHECK_SHELL_FEATURES], [if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi _LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac _LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl _LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl ])# _LT_CHECK_SHELL_FEATURES # _LT_PATH_CONVERSION_FUNCTIONS # ----------------------------- # Determine what file name conversion functions should be used by # func_to_host_file (and, implicitly, by func_to_host_path). These are needed # for certain cross-compile configurations and native mingw. m4_defun([_LT_PATH_CONVERSION_FUNCTIONS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_MSG_CHECKING([how to convert $build file names to $host format]) AC_CACHE_VAL(lt_cv_to_host_file_cmd, [case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac ]) to_host_file_cmd=$lt_cv_to_host_file_cmd AC_MSG_RESULT([$lt_cv_to_host_file_cmd]) _LT_DECL([to_host_file_cmd], [lt_cv_to_host_file_cmd], [0], [convert $build file names to $host format])dnl AC_MSG_CHECKING([how to convert $build file names to toolchain format]) AC_CACHE_VAL(lt_cv_to_tool_file_cmd, [#assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac ]) to_tool_file_cmd=$lt_cv_to_tool_file_cmd AC_MSG_RESULT([$lt_cv_to_tool_file_cmd]) _LT_DECL([to_tool_file_cmd], [lt_cv_to_tool_file_cmd], [0], [convert $build files to toolchain format])dnl ])# _LT_PATH_CONVERSION_FUNCTIONS cloog-0.18.2/isl/m4/ax_submodule.m40000664000175000017500000000365612254313240013676 00000000000000AC_DEFUN([AX_SUBMODULE], [ m4_if(m4_bregexp($2,|,choice),choice, [AC_ARG_WITH($1, [AS_HELP_STRING([--with-$1=$2], [Which $1 to use [default=$3]])])]) case "system" in $2) AC_ARG_WITH($1_prefix, [AS_HELP_STRING([--with-$1-prefix=DIR], [Prefix of $1 installation])]) AC_ARG_WITH($1_exec_prefix, [AS_HELP_STRING([--with-$1-exec-prefix=DIR], [Exec prefix of $1 installation])]) esac m4_if(m4_bregexp($2,build,build),build, [AC_ARG_WITH($1_builddir, [AS_HELP_STRING([--with-$1-builddir=DIR], [Location of $1 builddir])])]) if test "x$with_$1_prefix" != "x" -a "x$with_$1_exec_prefix" = "x"; then with_$1_exec_prefix=$with_$1_prefix fi if test "x$with_$1_prefix" != "x" -o "x$with_$1_exec_prefix" != "x"; then if test "x$with_$1" != "x" -a "x$with_$1" != "xyes" -a "x$with_$1" != "xsystem"; then AC_MSG_ERROR([Setting $with_$1_prefix implies use of system $1]) fi with_$1="system" fi if test "x$with_$1_builddir" != "x"; then if test "x$with_$1" != "x" -a "x$with_$1" != "xyes" -a "x$with_$1" != "xbuild"; then AC_MSG_ERROR([Setting $with_$1_builddir implies use of build $1]) fi with_$1="build" $1_srcdir=`echo @abs_srcdir@ | $with_$1_builddir/config.status --file=-` AC_MSG_NOTICE($1 sources in $$1_srcdir) fi if test "x$with_$1_exec_prefix" != "x"; then export PKG_CONFIG_PATH="$with_$1_exec_prefix/lib/pkgconfig${PKG_CONFIG_PATH+:$PKG_CONFIG_PATH}" fi case "$with_$1" in $2) ;; *) case "$3" in bundled) if test -d $srcdir/.git -a \ -d $srcdir/$1 -a \ ! -d $srcdir/$1/.git; then AC_MSG_WARN([git repo detected, but submodule $1 not initialized]) AC_MSG_WARN([You may want to run]) AC_MSG_WARN([ git submodule init]) AC_MSG_WARN([ git submodule update]) AC_MSG_WARN([ sh autogen.sh]) fi if test -f $srcdir/$1/configure; then with_$1="bundled" else with_$1="no" fi ;; *) with_$1="$3" ;; esac ;; esac AC_MSG_CHECKING([which $1 to use]) AC_MSG_RESULT($with_$1) ]) cloog-0.18.2/isl/m4/ltoptions.m40000644000175000017500000002775312254313255013252 00000000000000# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004-2005, 2007-2009, 2011-2013 Free Software # Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 8 ltoptions.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) # _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) # ------------------------------------------ m4_define([_LT_MANGLE_OPTION], [[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) # _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) # --------------------------------------- # Set option OPTION-NAME for macro MACRO-NAME, and if there is a # matching handler defined, dispatch to it. Other OPTION-NAMEs are # saved as a flag. m4_define([_LT_SET_OPTION], [m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), _LT_MANGLE_DEFUN([$1], [$2]), [m4_warning([Unknown $1 option '$2'])])[]dnl ]) # _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) # ------------------------------------------------------------ # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. m4_define([_LT_IF_OPTION], [m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) # _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) # ------------------------------------------------------- # Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME # are set. m4_define([_LT_UNLESS_OPTIONS], [m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), [m4_define([$0_found])])])[]dnl m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 ])[]dnl ]) # _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) # ---------------------------------------- # OPTION-LIST is a space-separated list of Libtool options associated # with MACRO-NAME. If any OPTION has a matching handler declared with # LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about # the unknown option and exit. m4_defun([_LT_SET_OPTIONS], [# Set options m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [_LT_SET_OPTION([$1], _LT_Option)]) m4_if([$1],[LT_INIT],[ dnl dnl Simply set some default values (i.e off) if boolean options were not dnl specified: _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no ]) _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no ]) dnl dnl If no reference was made to various pairs of opposing options, then dnl we run the default mode handler for the pair. For example, if neither dnl 'shared' nor 'disable-shared' was passed, we enable building of shared dnl archives by default: _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], [_LT_ENABLE_FAST_INSTALL]) ]) ])# _LT_SET_OPTIONS ## --------------------------------- ## ## Macros to handle LT_INIT options. ## ## --------------------------------- ## # _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) # ----------------------------------------- m4_define([_LT_MANGLE_DEFUN], [[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) # LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) # ----------------------------------------------- m4_define([LT_OPTION_DEFINE], [m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl ])# LT_OPTION_DEFINE # dlopen # ------ LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes ]) AU_DEFUN([AC_LIBTOOL_DLOPEN], [_LT_SET_OPTION([LT_INIT], [dlopen]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'dlopen' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) # win32-dll # --------- # Declare package support for building win32 dll's. LT_OPTION_DEFINE([LT_INIT], [win32-dll], [enable_win32_dll=yes case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*) AC_CHECK_TOOL(AS, as, false) AC_CHECK_TOOL(DLLTOOL, dlltool, false) AC_CHECK_TOOL(OBJDUMP, objdump, false) ;; esac test -z "$AS" && AS=as _LT_DECL([], [AS], [1], [Assembler program])dnl test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl ])# win32-dll AU_DEFUN([AC_LIBTOOL_WIN32_DLL], [AC_REQUIRE([AC_CANONICAL_HOST])dnl _LT_SET_OPTION([LT_INIT], [win32-dll]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'win32-dll' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) # _LT_ENABLE_SHARED([DEFAULT]) # ---------------------------- # implement the --enable-shared flag, and supports the 'shared' and # 'disable-shared' LT_INIT options. # DEFAULT is either 'yes' or 'no'. If omitted, it defaults to 'yes'. m4_define([_LT_ENABLE_SHARED], [m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([shared], [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], [build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS=$lt_save_ifs ;; esac], [enable_shared=]_LT_ENABLE_SHARED_DEFAULT) _LT_DECL([build_libtool_libs], [enable_shared], [0], [Whether or not to build shared libraries]) ])# _LT_ENABLE_SHARED LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) # Old names: AC_DEFUN([AC_ENABLE_SHARED], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) ]) AC_DEFUN([AC_DISABLE_SHARED], [_LT_SET_OPTION([LT_INIT], [disable-shared]) ]) AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_SHARED], []) dnl AC_DEFUN([AM_DISABLE_SHARED], []) # _LT_ENABLE_STATIC([DEFAULT]) # ---------------------------- # implement the --enable-static flag, and support the 'static' and # 'disable-static' LT_INIT options. # DEFAULT is either 'yes' or 'no'. If omitted, it defaults to 'yes'. m4_define([_LT_ENABLE_STATIC], [m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([static], [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], [build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS=$lt_save_ifs ;; esac], [enable_static=]_LT_ENABLE_STATIC_DEFAULT) _LT_DECL([build_old_libs], [enable_static], [0], [Whether or not to build static libraries]) ])# _LT_ENABLE_STATIC LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) # Old names: AC_DEFUN([AC_ENABLE_STATIC], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) ]) AC_DEFUN([AC_DISABLE_STATIC], [_LT_SET_OPTION([LT_INIT], [disable-static]) ]) AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_STATIC], []) dnl AC_DEFUN([AM_DISABLE_STATIC], []) # _LT_ENABLE_FAST_INSTALL([DEFAULT]) # ---------------------------------- # implement the --enable-fast-install flag, and support the 'fast-install' # and 'disable-fast-install' LT_INIT options. # DEFAULT is either 'yes' or 'no'. If omitted, it defaults to 'yes'. m4_define([_LT_ENABLE_FAST_INSTALL], [m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([fast-install], [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS=$lt_save_ifs ;; esac], [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) _LT_DECL([fast_install], [enable_fast_install], [0], [Whether or not to optimize for fast installation])dnl ])# _LT_ENABLE_FAST_INSTALL LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) # Old names: AU_DEFUN([AC_ENABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'fast-install' option into LT_INIT's first parameter.]) ]) AU_DEFUN([AC_DISABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], [disable-fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'disable-fast-install' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) # _LT_WITH_PIC([MODE]) # -------------------- # implement the --with-pic flag, and support the 'pic-only' and 'no-pic' # LT_INIT options. # MODE is either 'yes' or 'no'. If omitted, it defaults to 'both'. m4_define([_LT_WITH_PIC], [AC_ARG_WITH([pic], [AS_HELP_STRING([--with-pic@<:@=PKGS@:>@], [try to use only PIC/non-PIC objects @<:@default=use both@:>@])], [lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for lt_pkg in $withval; do IFS=$lt_save_ifs if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS=$lt_save_ifs ;; esac], [pic_mode=m4_default([$1], [default])]) _LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl ])# _LT_WITH_PIC LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) # Old name: AU_DEFUN([AC_LIBTOOL_PICMODE], [_LT_SET_OPTION([LT_INIT], [pic-only]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the 'pic-only' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) ## ----------------- ## ## LTDL_INIT Options ## ## ----------------- ## m4_define([_LTDL_MODE], []) LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], [m4_define([_LTDL_MODE], [nonrecursive])]) LT_OPTION_DEFINE([LTDL_INIT], [recursive], [m4_define([_LTDL_MODE], [recursive])]) LT_OPTION_DEFINE([LTDL_INIT], [subproject], [m4_define([_LTDL_MODE], [subproject])]) m4_define([_LTDL_TYPE], []) LT_OPTION_DEFINE([LTDL_INIT], [installable], [m4_define([_LTDL_TYPE], [installable])]) LT_OPTION_DEFINE([LTDL_INIT], [convenience], [m4_define([_LTDL_TYPE], [convenience])]) cloog-0.18.2/isl/m4/ax_gcc_x86_cpuid.m40000664000175000017500000000634312254313240014320 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_gcc_x86_cpuid.html # =========================================================================== # # SYNOPSIS # # AX_GCC_X86_CPUID(OP) # # DESCRIPTION # # On Pentium and later x86 processors, with gcc or a compiler that has a # compatible syntax for inline assembly instructions, run a small program # that executes the cpuid instruction with input OP. This can be used to # detect the CPU type. # # On output, the values of the eax, ebx, ecx, and edx registers are stored # as hexadecimal strings as "eax:ebx:ecx:edx" in the cache variable # ax_cv_gcc_x86_cpuid_OP. # # If the cpuid instruction fails (because you are running a # cross-compiler, or because you are not using gcc, or because you are on # a processor that doesn't have this instruction), ax_cv_gcc_x86_cpuid_OP # is set to the string "unknown". # # This macro mainly exists to be used in AX_GCC_ARCHFLAG. # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_GCC_X86_CPUID], [AC_REQUIRE([AC_PROG_CC]) AC_LANG_PUSH([C]) AC_CACHE_CHECK(for x86 cpuid $1 output, ax_cv_gcc_x86_cpuid_$1, [AC_RUN_IFELSE([AC_LANG_PROGRAM([#include ], [ int op = $1, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ])], [ax_cv_gcc_x86_cpuid_$1=`cat conftest_cpuid`; rm -f conftest_cpuid], [ax_cv_gcc_x86_cpuid_$1=unknown; rm -f conftest_cpuid], [ax_cv_gcc_x86_cpuid_$1=unknown])]) AC_LANG_POP([C]) ]) cloog-0.18.2/isl/m4/ax_create_stdint_h.m40000664000175000017500000006202012254313240015024 00000000000000# =========================================================================== # http://autoconf-archive.cryp.to/ax_create_stdint_h.html # =========================================================================== # # SYNOPSIS # # AX_CREATE_STDINT_H [( HEADER-TO-GENERATE [, HEDERS-TO-CHECK])] # # DESCRIPTION # # the "ISO C9X: 7.18 Integer types " section requires the # existence of an include file that defines a set of typedefs, # especially uint8_t,int32_t,uintptr_t. Many older installations will not # provide this file, but some will have the very same definitions in # . In other enviroments we can use the inet-types in # which would define the typedefs int8_t and u_int8_t # respectivly. # # This macros will create a local "_stdint.h" or the headerfile given as # an argument. In many cases that file will just "#include " or # "#include ", while in other environments it will provide the # set of basic 'stdint's definitions/typedefs: # # int8_t,uint8_t,int16_t,uint16_t,int32_t,uint32_t,intptr_t,uintptr_t # int_least32_t.. int_fast32_t.. intmax_t # # which may or may not rely on the definitions of other files, or using # the AC_CHECK_SIZEOF macro to determine the actual sizeof each type. # # if your header files require the stdint-types you will want to create an # installable file mylib-int.h that all your other installable header may # include. So if you have a library package named "mylib", just use # # AX_CREATE_STDINT_H(mylib-int.h) # # in configure.ac and go to install that very header file in Makefile.am # along with the other headers (mylib.h) - and the mylib-specific headers # can simply use "#include " to obtain the stdint-types. # # Remember, if the system already had a valid , the generated # file will include it directly. No need for fuzzy HAVE_STDINT_H things... # (oops, GCC 4.2.x has deliberatly disabled its stdint.h for non-c99 # compilation and the c99-mode is not the default. Therefore this macro # will not use the compiler's stdint.h - please complain to the GCC # developers). # # LAST MODIFICATION # # 2008-04-12 # # COPYLEFT # # Copyright (c) 2008 Guido U. Draheim # # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation; either version 2 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Macro Archive. When you make and # distribute a modified version of the Autoconf Macro, you may extend this # special exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_CHECK_DATA_MODEL],[ AC_CHECK_SIZEOF(char) AC_CHECK_SIZEOF(short) AC_CHECK_SIZEOF(int) AC_CHECK_SIZEOF(long) AC_CHECK_SIZEOF(void*) ac_cv_char_data_model="" ac_cv_char_data_model="$ac_cv_char_data_model$ac_cv_sizeof_char" ac_cv_char_data_model="$ac_cv_char_data_model$ac_cv_sizeof_short" ac_cv_char_data_model="$ac_cv_char_data_model$ac_cv_sizeof_int" ac_cv_long_data_model="" ac_cv_long_data_model="$ac_cv_long_data_model$ac_cv_sizeof_int" ac_cv_long_data_model="$ac_cv_long_data_model$ac_cv_sizeof_long" ac_cv_long_data_model="$ac_cv_long_data_model$ac_cv_sizeof_voidp" AC_MSG_CHECKING([data model]) case "$ac_cv_char_data_model/$ac_cv_long_data_model" in 122/242) ac_cv_data_model="IP16" ; n="standard 16bit machine" ;; 122/244) ac_cv_data_model="LP32" ; n="standard 32bit machine" ;; 122/*) ac_cv_data_model="i16" ; n="unusual int16 model" ;; 124/444) ac_cv_data_model="ILP32" ; n="standard 32bit unixish" ;; 124/488) ac_cv_data_model="LP64" ; n="standard 64bit unixish" ;; 124/448) ac_cv_data_model="LLP64" ; n="unusual 64bit unixish" ;; 124/*) ac_cv_data_model="i32" ; n="unusual int32 model" ;; 128/888) ac_cv_data_model="ILP64" ; n="unusual 64bit numeric" ;; 128/*) ac_cv_data_model="i64" ; n="unusual int64 model" ;; 222/*2) ac_cv_data_model="DSP16" ; n="strict 16bit dsptype" ;; 333/*3) ac_cv_data_model="DSP24" ; n="strict 24bit dsptype" ;; 444/*4) ac_cv_data_model="DSP32" ; n="strict 32bit dsptype" ;; 666/*6) ac_cv_data_model="DSP48" ; n="strict 48bit dsptype" ;; 888/*8) ac_cv_data_model="DSP64" ; n="strict 64bit dsptype" ;; 222/*|333/*|444/*|666/*|888/*) : ac_cv_data_model="iDSP" ; n="unusual dsptype" ;; *) ac_cv_data_model="none" ; n="very unusual model" ;; esac AC_MSG_RESULT([$ac_cv_data_model ($ac_cv_long_data_model, $n)]) ]) dnl AX_CHECK_HEADER_STDINT_X([HEADERLIST][,ACTION-IF]) AC_DEFUN([AX_CHECK_HEADER_STDINT_X],[ AC_CACHE_CHECK([for stdint uintptr_t], [ac_cv_header_stdint_x],[ ac_cv_header_stdint_x="" # the 1997 typedefs (inttypes.h) AC_MSG_RESULT([(..)]) for i in m4_ifval([$1],[$1],[stdint.h inttypes.h sys/inttypes.h sys/types.h]) do unset ac_cv_type_uintptr_t unset ac_cv_type_uint64_t AC_CHECK_TYPE(uintptr_t,[ac_cv_header_stdint_x=$i],continue,[#include <$i>]) AC_CHECK_TYPE(uint64_t,[and64="/uint64_t"],[and64=""],[#include<$i>]) m4_ifvaln([$2],[$2]) break done AC_MSG_CHECKING([for stdint uintptr_t]) ]) ]) AC_DEFUN([AX_CHECK_HEADER_STDINT_O],[ AC_CACHE_CHECK([for stdint uint32_t], [ac_cv_header_stdint_o],[ ac_cv_header_stdint_o="" # the 1995 typedefs (sys/inttypes.h) AC_MSG_RESULT([(..)]) for i in m4_ifval([$1],[$1],[inttypes.h sys/inttypes.h sys/types.h stdint.h]) do unset ac_cv_type_uint32_t unset ac_cv_type_uint64_t AC_CHECK_TYPE(uint32_t,[ac_cv_header_stdint_o=$i],continue,[#include <$i>]) AC_CHECK_TYPE(uint64_t,[and64="/uint64_t"],[and64=""],[#include<$i>]) m4_ifvaln([$2],[$2]) break break; done AC_MSG_CHECKING([for stdint uint32_t]) ]) ]) AC_DEFUN([AX_CHECK_HEADER_STDINT_U],[ AC_CACHE_CHECK([for stdint u_int32_t], [ac_cv_header_stdint_u],[ ac_cv_header_stdint_u="" # the BSD typedefs (sys/types.h) AC_MSG_RESULT([(..)]) for i in m4_ifval([$1],[$1],[sys/types.h inttypes.h sys/inttypes.h]) ; do unset ac_cv_type_u_int32_t unset ac_cv_type_u_int64_t AC_CHECK_TYPE(u_int32_t,[ac_cv_header_stdint_u=$i],continue,[#include <$i>]) AC_CHECK_TYPE(u_int64_t,[and64="/u_int64_t"],[and64=""],[#include<$i>]) m4_ifvaln([$2],[$2]) break break; done AC_MSG_CHECKING([for stdint u_int32_t]) ]) ]) AC_DEFUN([AX_CREATE_STDINT_H], [# ------ AX CREATE STDINT H ------------------------------------- AC_MSG_CHECKING([for stdint types]) ac_stdint_h=`echo ifelse($1, , _stdint.h, $1)` # try to shortcircuit - if the default include path of the compiler # can find a "stdint.h" header then we assume that all compilers can. AC_CACHE_VAL([ac_cv_header_stdint_t],[ old_CXXFLAGS="$CXXFLAGS" ; CXXFLAGS="" old_CPPFLAGS="$CPPFLAGS" ; CPPFLAGS="" old_CFLAGS="$CFLAGS" ; CFLAGS="" AC_TRY_COMPILE([#include ],[int_least32_t v = 0;], [ac_cv_stdint_result="(assuming C99 compatible system)" ac_cv_header_stdint_t="stdint.h"; ], [ac_cv_header_stdint_t=""]) if test "$GCC" = "yes" && test ".$ac_cv_header_stdint_t" = "."; then CFLAGS="-std=c99" AC_TRY_COMPILE([#include ],[int_least32_t v = 0;], [AC_MSG_WARN(your GCC compiler has a defunct stdint.h for its default-mode)]) fi CXXFLAGS="$old_CXXFLAGS" CPPFLAGS="$old_CPPFLAGS" CFLAGS="$old_CFLAGS" ]) v="... $ac_cv_header_stdint_h" if test "$ac_stdint_h" = "stdint.h" ; then AC_MSG_RESULT([(are you sure you want them in ./stdint.h?)]) elif test "$ac_stdint_h" = "inttypes.h" ; then AC_MSG_RESULT([(are you sure you want them in ./inttypes.h?)]) elif test "_$ac_cv_header_stdint_t" = "_" ; then AC_MSG_RESULT([(putting them into $ac_stdint_h)$v]) else ac_cv_header_stdint="$ac_cv_header_stdint_t" AC_MSG_RESULT([$ac_cv_header_stdint (shortcircuit)]) fi if test "_$ac_cv_header_stdint_t" = "_" ; then # can not shortcircuit.. dnl .....intro message done, now do a few system checks..... dnl btw, all old CHECK_TYPE macros do automatically "DEFINE" a type, dnl therefore we use the autoconf implementation detail CHECK_TYPE_NEW dnl instead that is triggered with 3 or more arguments (see types.m4) inttype_headers=`echo $2 | sed -e 's/,/ /g'` ac_cv_stdint_result="(no helpful system typedefs seen)" AX_CHECK_HEADER_STDINT_X(dnl stdint.h inttypes.h sys/inttypes.h $inttype_headers, ac_cv_stdint_result="(seen uintptr_t$and64 in $i)") if test "_$ac_cv_header_stdint_x" = "_" ; then AX_CHECK_HEADER_STDINT_O(dnl, inttypes.h sys/inttypes.h stdint.h $inttype_headers, ac_cv_stdint_result="(seen uint32_t$and64 in $i)") fi if test "_$ac_cv_header_stdint_x" = "_" ; then if test "_$ac_cv_header_stdint_o" = "_" ; then AX_CHECK_HEADER_STDINT_U(dnl, sys/types.h inttypes.h sys/inttypes.h $inttype_headers, ac_cv_stdint_result="(seen u_int32_t$and64 in $i)") fi fi dnl if there was no good C99 header file, do some typedef checks... if test "_$ac_cv_header_stdint_x" = "_" ; then AC_MSG_CHECKING([for stdint datatype model]) AC_MSG_RESULT([(..)]) AX_CHECK_DATA_MODEL fi if test "_$ac_cv_header_stdint_x" != "_" ; then ac_cv_header_stdint="$ac_cv_header_stdint_x" elif test "_$ac_cv_header_stdint_o" != "_" ; then ac_cv_header_stdint="$ac_cv_header_stdint_o" elif test "_$ac_cv_header_stdint_u" != "_" ; then ac_cv_header_stdint="$ac_cv_header_stdint_u" else ac_cv_header_stdint="stddef.h" fi AC_MSG_CHECKING([for extra inttypes in chosen header]) AC_MSG_RESULT([($ac_cv_header_stdint)]) dnl see if int_least and int_fast types are present in _this_ header. unset ac_cv_type_int_least32_t unset ac_cv_type_int_fast32_t AC_CHECK_TYPE(int_least32_t,,,[#include <$ac_cv_header_stdint>]) AC_CHECK_TYPE(int_fast32_t,,,[#include<$ac_cv_header_stdint>]) AC_CHECK_TYPE(intmax_t,,,[#include <$ac_cv_header_stdint>]) fi # shortcircut to system "stdint.h" # ------------------ PREPARE VARIABLES ------------------------------ if test "$GCC" = "yes" ; then ac_cv_stdint_message="using gnu compiler "`$CC --version | head -1` else ac_cv_stdint_message="using $CC" fi AC_MSG_RESULT([make use of $ac_cv_header_stdint in $ac_stdint_h dnl $ac_cv_stdint_result]) dnl ----------------------------------------------------------------- # ----------------- DONE inttypes.h checks START header ------------- AC_CONFIG_COMMANDS([$ac_stdint_h],[ AC_MSG_NOTICE(creating $ac_stdint_h : $_ac_stdint_h) ac_stdint=$tmp/_stdint.h echo "#ifndef" $_ac_stdint_h >$ac_stdint echo "#define" $_ac_stdint_h "1" >>$ac_stdint echo "#ifndef" _GENERATED_STDINT_H >>$ac_stdint echo "#define" _GENERATED_STDINT_H '"'$PACKAGE $VERSION'"' >>$ac_stdint echo "/* generated $ac_cv_stdint_message */" >>$ac_stdint if test "_$ac_cv_header_stdint_t" != "_" ; then echo "#define _STDINT_HAVE_STDINT_H" "1" >>$ac_stdint echo "#include " >>$ac_stdint echo "#endif" >>$ac_stdint echo "#endif" >>$ac_stdint else cat >>$ac_stdint < #else #include /* .................... configured part ............................ */ STDINT_EOF echo "/* whether we have a C99 compatible stdint header file */" >>$ac_stdint if test "_$ac_cv_header_stdint_x" != "_" ; then ac_header="$ac_cv_header_stdint_x" echo "#define _STDINT_HEADER_INTPTR" '"'"$ac_header"'"' >>$ac_stdint else echo "/* #undef _STDINT_HEADER_INTPTR */" >>$ac_stdint fi echo "/* whether we have a C96 compatible inttypes header file */" >>$ac_stdint if test "_$ac_cv_header_stdint_o" != "_" ; then ac_header="$ac_cv_header_stdint_o" echo "#define _STDINT_HEADER_UINT32" '"'"$ac_header"'"' >>$ac_stdint else echo "/* #undef _STDINT_HEADER_UINT32 */" >>$ac_stdint fi echo "/* whether we have a BSD compatible inet types header */" >>$ac_stdint if test "_$ac_cv_header_stdint_u" != "_" ; then ac_header="$ac_cv_header_stdint_u" echo "#define _STDINT_HEADER_U_INT32" '"'"$ac_header"'"' >>$ac_stdint else echo "/* #undef _STDINT_HEADER_U_INT32 */" >>$ac_stdint fi echo "" >>$ac_stdint if test "_$ac_header" != "_" ; then if test "$ac_header" != "stddef.h" ; then echo "#include <$ac_header>" >>$ac_stdint echo "" >>$ac_stdint fi fi echo "/* which 64bit typedef has been found */" >>$ac_stdint if test "$ac_cv_type_uint64_t" = "yes" ; then echo "#define _STDINT_HAVE_UINT64_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_UINT64_T */" >>$ac_stdint fi if test "$ac_cv_type_u_int64_t" = "yes" ; then echo "#define _STDINT_HAVE_U_INT64_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_U_INT64_T */" >>$ac_stdint fi echo "" >>$ac_stdint echo "/* which type model has been detected */" >>$ac_stdint if test "_$ac_cv_char_data_model" != "_" ; then echo "#define _STDINT_CHAR_MODEL" "$ac_cv_char_data_model" >>$ac_stdint echo "#define _STDINT_LONG_MODEL" "$ac_cv_long_data_model" >>$ac_stdint else echo "/* #undef _STDINT_CHAR_MODEL // skipped */" >>$ac_stdint echo "/* #undef _STDINT_LONG_MODEL // skipped */" >>$ac_stdint fi echo "" >>$ac_stdint echo "/* whether int_least types were detected */" >>$ac_stdint if test "$ac_cv_type_int_least32_t" = "yes"; then echo "#define _STDINT_HAVE_INT_LEAST32_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_INT_LEAST32_T */" >>$ac_stdint fi echo "/* whether int_fast types were detected */" >>$ac_stdint if test "$ac_cv_type_int_fast32_t" = "yes"; then echo "#define _STDINT_HAVE_INT_FAST32_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_INT_FAST32_T */" >>$ac_stdint fi echo "/* whether intmax_t type was detected */" >>$ac_stdint if test "$ac_cv_type_intmax_t" = "yes"; then echo "#define _STDINT_HAVE_INTMAX_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_INTMAX_T */" >>$ac_stdint fi echo "" >>$ac_stdint cat >>$ac_stdint <= 199901L #define _HAVE_UINT64_T #define _HAVE_LONGLONG_UINT64_T typedef long long int64_t; typedef unsigned long long uint64_t; #elif !defined __STRICT_ANSI__ #if defined _MSC_VER || defined __WATCOMC__ || defined __BORLANDC__ #define _HAVE_UINT64_T typedef __int64 int64_t; typedef unsigned __int64 uint64_t; #elif defined __GNUC__ || defined __MWERKS__ || defined __ELF__ /* note: all ELF-systems seem to have loff-support which needs 64-bit */ #if !defined _NO_LONGLONG #define _HAVE_UINT64_T #define _HAVE_LONGLONG_UINT64_T typedef long long int64_t; typedef unsigned long long uint64_t; #endif #elif defined __alpha || (defined __mips && defined _ABIN32) #if !defined _NO_LONGLONG typedef long int64_t; typedef unsigned long uint64_t; #endif /* compiler/cpu type to define int64_t */ #endif #endif #endif #if defined _STDINT_HAVE_U_INT_TYPES /* int8_t int16_t int32_t defined by inet code, redeclare the u_intXX types */ typedef u_int8_t uint8_t; typedef u_int16_t uint16_t; typedef u_int32_t uint32_t; /* glibc compatibility */ #ifndef __int8_t_defined #define __int8_t_defined #endif #endif #ifdef _STDINT_NEED_INT_MODEL_T /* we must guess all the basic types. Apart from byte-adressable system, */ /* there a few 32-bit-only dsp-systems that we guard with BYTE_MODEL 8-} */ /* (btw, those nibble-addressable systems are way off, or so we assume) */ dnl /* have a look at "64bit and data size neutrality" at */ dnl /* http://unix.org/version2/whatsnew/login_64bit.html */ dnl /* (the shorthand "ILP" types always have a "P" part) */ #if defined _STDINT_BYTE_MODEL #if _STDINT_LONG_MODEL+0 == 242 /* 2:4:2 = IP16 = a normal 16-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned long uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef long int32_t; #endif #elif _STDINT_LONG_MODEL+0 == 244 || _STDINT_LONG_MODEL == 444 /* 2:4:4 = LP32 = a 32-bit system derived from a 16-bit */ /* 4:4:4 = ILP32 = a normal 32-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef int int32_t; #endif #elif _STDINT_LONG_MODEL+0 == 484 || _STDINT_LONG_MODEL+0 == 488 /* 4:8:4 = IP32 = a 32-bit system prepared for 64-bit */ /* 4:8:8 = LP64 = a normal 64-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef int int32_t; #endif /* this system has a "long" of 64bit */ #ifndef _HAVE_UINT64_T #define _HAVE_UINT64_T typedef unsigned long uint64_t; typedef long int64_t; #endif #elif _STDINT_LONG_MODEL+0 == 448 /* LLP64 a 64-bit system derived from a 32-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef int int32_t; #endif /* assuming the system has a "long long" */ #ifndef _HAVE_UINT64_T #define _HAVE_UINT64_T #define _HAVE_LONGLONG_UINT64_T typedef unsigned long long uint64_t; typedef long long int64_t; #endif #else #define _STDINT_NO_INT32_T #endif #else #define _STDINT_NO_INT8_T #define _STDINT_NO_INT32_T #endif #endif /* * quote from SunOS-5.8 sys/inttypes.h: * Use at your own risk. As of February 1996, the committee is squarely * behind the fixed sized types; the "least" and "fast" types are still being * discussed. The probability that the "fast" types may be removed before * the standard is finalized is high enough that they are not currently * implemented. */ #if defined _STDINT_NEED_INT_LEAST_T typedef int8_t int_least8_t; typedef int16_t int_least16_t; typedef int32_t int_least32_t; #ifdef _HAVE_UINT64_T typedef int64_t int_least64_t; #endif typedef uint8_t uint_least8_t; typedef uint16_t uint_least16_t; typedef uint32_t uint_least32_t; #ifdef _HAVE_UINT64_T typedef uint64_t uint_least64_t; #endif /* least types */ #endif #if defined _STDINT_NEED_INT_FAST_T typedef int8_t int_fast8_t; typedef int int_fast16_t; typedef int32_t int_fast32_t; #ifdef _HAVE_UINT64_T typedef int64_t int_fast64_t; #endif typedef uint8_t uint_fast8_t; typedef unsigned uint_fast16_t; typedef uint32_t uint_fast32_t; #ifdef _HAVE_UINT64_T typedef uint64_t uint_fast64_t; #endif /* fast types */ #endif #ifdef _STDINT_NEED_INTMAX_T #ifdef _HAVE_UINT64_T typedef int64_t intmax_t; typedef uint64_t uintmax_t; #else typedef long intmax_t; typedef unsigned long uintmax_t; #endif #endif #ifdef _STDINT_NEED_INTPTR_T #ifndef __intptr_t_defined #define __intptr_t_defined /* we encourage using "long" to store pointer values, never use "int" ! */ #if _STDINT_LONG_MODEL+0 == 242 || _STDINT_LONG_MODEL+0 == 484 typedef unsigned int uintptr_t; typedef int intptr_t; #elif _STDINT_LONG_MODEL+0 == 244 || _STDINT_LONG_MODEL+0 == 444 typedef unsigned long uintptr_t; typedef long intptr_t; #elif _STDINT_LONG_MODEL+0 == 448 && defined _HAVE_UINT64_T typedef uint64_t uintptr_t; typedef int64_t intptr_t; #else /* matches typical system types ILP32 and LP64 - but not IP16 or LLP64 */ typedef unsigned long uintptr_t; typedef long intptr_t; #endif #endif #endif /* The ISO C99 standard specifies that in C++ implementations these should only be defined if explicitly requested. */ #if !defined __cplusplus || defined __STDC_CONSTANT_MACROS #ifndef UINT32_C /* Signed. */ # define INT8_C(c) c # define INT16_C(c) c # define INT32_C(c) c # ifdef _HAVE_LONGLONG_UINT64_T # define INT64_C(c) c ## L # else # define INT64_C(c) c ## LL # endif /* Unsigned. */ # define UINT8_C(c) c ## U # define UINT16_C(c) c ## U # define UINT32_C(c) c ## U # ifdef _HAVE_LONGLONG_UINT64_T # define UINT64_C(c) c ## UL # else # define UINT64_C(c) c ## ULL # endif /* Maximal type. */ # ifdef _HAVE_LONGLONG_UINT64_T # define INTMAX_C(c) c ## L # define UINTMAX_C(c) c ## UL # else # define INTMAX_C(c) c ## LL # define UINTMAX_C(c) c ## ULL # endif /* literalnumbers */ #endif #endif /* These limits are merily those of a two complement byte-oriented system */ /* Minimum of signed integral types. */ # define INT8_MIN (-128) # define INT16_MIN (-32767-1) # define INT32_MIN (-2147483647-1) #ifndef INT64_MIN # define INT64_MIN (-__INT64_C(9223372036854775807)-1) #endif /* Maximum of signed integral types. */ # define INT8_MAX (127) # define INT16_MAX (32767) # define INT32_MAX (2147483647) #ifndef INT64_MAX # define INT64_MAX (__INT64_C(9223372036854775807)) #endif /* Maximum of unsigned integral types. */ #ifndef UINT8_MAX # define UINT8_MAX (255) #endif #ifndef UINT16_MAX # define UINT16_MAX (65535) #endif # define UINT32_MAX (4294967295U) #ifndef UINT64_MAX # define UINT64_MAX (__UINT64_C(18446744073709551615)) #endif /* Minimum of signed integral types having a minimum size. */ # define INT_LEAST8_MIN INT8_MIN # define INT_LEAST16_MIN INT16_MIN # define INT_LEAST32_MIN INT32_MIN # define INT_LEAST64_MIN INT64_MIN /* Maximum of signed integral types having a minimum size. */ # define INT_LEAST8_MAX INT8_MAX # define INT_LEAST16_MAX INT16_MAX # define INT_LEAST32_MAX INT32_MAX # define INT_LEAST64_MAX INT64_MAX /* Maximum of unsigned integral types having a minimum size. */ # define UINT_LEAST8_MAX UINT8_MAX # define UINT_LEAST16_MAX UINT16_MAX # define UINT_LEAST32_MAX UINT32_MAX # define UINT_LEAST64_MAX UINT64_MAX /* shortcircuit*/ #endif /* once */ #endif #endif STDINT_EOF fi if cmp -s $ac_stdint_h $ac_stdint 2>/dev/null; then AC_MSG_NOTICE([$ac_stdint_h is unchanged]) else ac_dir=`AS_DIRNAME(["$ac_stdint_h"])` AS_MKDIR_P(["$ac_dir"]) rm -f $ac_stdint_h mv $ac_stdint $ac_stdint_h fi ],[# variables for create stdint.h replacement PACKAGE="$PACKAGE" VERSION="$VERSION" ac_stdint_h="$ac_stdint_h" _ac_stdint_h=AS_TR_CPP(_$PACKAGE-$ac_stdint_h) ac_cv_stdint_message="$ac_cv_stdint_message" ac_cv_header_stdint_t="$ac_cv_header_stdint_t" ac_cv_header_stdint_x="$ac_cv_header_stdint_x" ac_cv_header_stdint_o="$ac_cv_header_stdint_o" ac_cv_header_stdint_u="$ac_cv_header_stdint_u" ac_cv_type_uint64_t="$ac_cv_type_uint64_t" ac_cv_type_u_int64_t="$ac_cv_type_u_int64_t" ac_cv_char_data_model="$ac_cv_char_data_model" ac_cv_long_data_model="$ac_cv_long_data_model" ac_cv_type_int_least32_t="$ac_cv_type_int_least32_t" ac_cv_type_int_fast32_t="$ac_cv_type_int_fast32_t" ac_cv_type_intmax_t="$ac_cv_type_intmax_t" ]) ]) cloog-0.18.2/isl/m4/ax_create_pkgconfig_info.m40000664000175000017500000003415512254313240016202 00000000000000# ============================================================================ # http://www.gnu.org/software/autoconf-archive/ax_create_pkgconfig_info.html # ============================================================================ # # SYNOPSIS # # AX_CREATE_PKGCONFIG_INFO [(outputfile, [requires [,libs [,summary [,cflags [, ldflags]]]]])] # # DESCRIPTION # # Defaults: # # $1 = $PACKAGE_NAME.pc # $2 = (empty) # $3 = $PACKAGE_LIBS $LIBS (as set at that point in configure.ac) # $4 = $PACKAGE_SUMMARY (or $1 Library) # $5 = $PACKAGE_CFLAGS (as set at the point in configure.ac) # $6 = $PACKAGE_LDFLAGS (as set at the point in configure.ac) # # PACKAGE_NAME defaults to $PACKAGE if not set. # PACKAGE_LIBS defaults to -l$PACKAGE_NAME if not set. # # The resulting file is called $PACKAGE.pc.in / $PACKAGE.pc # # You will find this macro most useful in conjunction with # ax_spec_defaults that can read good initializers from the .spec file. In # consequencd, most of the generatable installable stuff can be made from # information being updated in a single place for the whole project. # # LICENSE # # Copyright (c) 2008 Guido U. Draheim # Copyright (c) 2008 Sven Verdoolaege # # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation; either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. #serial 12 AC_DEFUN([AX_CREATE_PKGCONFIG_INFO],[dnl AS_VAR_PUSHDEF([PKGCONFIG_suffix],[ax_create_pkgconfig_suffix])dnl AS_VAR_PUSHDEF([PKGCONFIG_libdir],[ax_create_pkgconfig_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_libfile],[ax_create_pkgconfig_libfile])dnl AS_VAR_PUSHDEF([PKGCONFIG_libname],[ax_create_pkgconfig_libname])dnl AS_VAR_PUSHDEF([PKGCONFIG_version],[ax_create_pkgconfig_version])dnl AS_VAR_PUSHDEF([PKGCONFIG_description],[ax_create_pkgconfig_description])dnl AS_VAR_PUSHDEF([PKGCONFIG_requires],[ax_create_pkgconfig_requires])dnl AS_VAR_PUSHDEF([PKGCONFIG_pkglibs],[ax_create_pkgconfig_pkglibs])dnl AS_VAR_PUSHDEF([PKGCONFIG_libs],[ax_create_pkgconfig_libs])dnl AS_VAR_PUSHDEF([PKGCONFIG_ldflags],[ax_create_pkgconfig_ldflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_cppflags],[ax_create_pkgconfig_cppflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_generate],[ax_create_pkgconfig_generate])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_libdir],[ax_create_pkgconfig_src_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_headers],[ax_create_pkgconfig_src_headers])dnl # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' AC_MSG_CHECKING(our pkgconfig libname) test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="ifelse($1,,${PACKAGE_NAME},`basename $1 .pc`)" test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="$PACKAGE" PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` AC_MSG_RESULT($PKGCONFIG_libname) AC_MSG_CHECKING(our pkgconfig version) test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="${PACKAGE_VERSION}" test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="$VERSION" PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` AC_MSG_RESULT($PKGCONFIG_version) AC_MSG_CHECKING(our pkgconfig_libdir) test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' PKGCONFIG_libdir=`eval echo "$pkgconfig_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` AC_MSG_RESULT($pkgconfig_libdir) test "$pkgconfig_libdir" != "$PKGCONFIG_libdir" && ( AC_MSG_RESULT(expanded our pkgconfig_libdir... $PKGCONFIG_libdir)) AC_SUBST([pkgconfig_libdir]) AC_MSG_CHECKING(our pkgconfig_libfile) test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="ifelse($1,,$PKGCONFIG_libname.pc,`basename $1`)" PKGCONFIG_libfile=`eval echo "$pkgconfig_libfile"` PKGCONFIG_libfile=`eval echo "$PKGCONFIG_libfile"` AC_MSG_RESULT($pkgconfig_libfile) test "$pkgconfig_libfile" != "$PKGCONFIG_libfile" && ( AC_MSG_RESULT(expanded our pkgconfig_libfile... $PKGCONFIG_libfile)) AC_SUBST([pkgconfig_libfile]) AC_MSG_CHECKING(our package / suffix) PKGCONFIG_suffix="$program_suffix" test ".$PKGCONFIG_suffix" != .NONE || PKGCONFIG_suffix="" AC_MSG_RESULT(${PACKAGE_NAME} / ${PKGCONFIG_suffix}) AC_MSG_CHECKING(our pkgconfig description) PKGCONFIG_description="ifelse($4,,$PACKAGE_SUMMARY,$4)" test ".$PKGCONFIG_description" != "." || \ PKGCONFIG_description="$PKGCONFIG_libname Library" PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` AC_MSG_RESULT($PKGCONFIG_description) AC_MSG_CHECKING(our pkgconfig requires) PKGCONFIG_requires="ifelse($2,,$PACKAGE_REQUIRES,$2)" PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` AC_MSG_RESULT($PKGCONFIG_requires) AC_MSG_CHECKING(our pkgconfig ext libs) PKGCONFIG_pkglibs="$PACKAGE_LIBS" test ".$PKGCONFIG_pkglibs" != "." || PKGCONFIG_pkglibs="-l$PKGCONFIG_libname" PKGCONFIG_libs="ifelse($3,,$PKGCONFIG_pkglibs $LIBS,$3)" PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` AC_MSG_RESULT($PKGCONFIG_libs) AC_MSG_CHECKING(our pkgconfig cppflags) PKGCONFIG_cppflags="ifelse($5,,$PACKAGE_CFLAGS,$5)" PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` AC_MSG_RESULT($PKGCONFIG_cppflags) AC_MSG_CHECKING(our pkgconfig ldflags) PKGCONFIG_ldflags="ifelse($6,,$PACKAGE_LDFLAGS,$5)" PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` AC_MSG_RESULT($PKGCONFIG_ldflags) test ".$PKGCONFIG_generate" != "." || \ PKGCONFIG_generate="ifelse($1,,$PKGCONFIG_libname.pc,$1)" PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` test "$pkgconfig_libfile" != "$PKGCONFIG_generate" && ( AC_MSG_RESULT(generate the pkgconfig later... $PKGCONFIG_generate)) if test ".$PKGCONFIG_src_libdir" = "." ; then PKGCONFIG_src_libdir=`pwd` PKGCONFIG_src_libdir=`AS_DIRNAME("$PKGCONFIG_src_libdir/$PKGCONFIG_generate")` test ! -d $PKGCONFIG_src_libdir/src || \ PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/src" case ".$objdir" in *libs) PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/$objdir" ;; esac AC_MSG_RESULT(noninstalled pkgconfig -L $PKGCONFIG_src_libdir) fi if test ".$PKGCONFIG_src_headers" = "." ; then PKGCONFIG_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) PKGCONFIG_src_headers="" ;; esac PKGCONFIG_src_headers=`AS_DIRNAME("$PKGCONFIG_src_headers/$v/x")` test ! -d $PKGCONFIG_src_headers/incl[]ude || \ PKGCONFIG_src_headers="$PKGCONFIG_src_headers/incl[]ude" AC_MSG_RESULT(noninstalled pkgconfig -I $PKGCONFIG_src_headers) fi dnl AC_CONFIG_COMMANDS crap disallows to use $PKGCONFIG_libfile here... AC_CONFIG_COMMANDS([$ax_create_pkgconfig_generate],[ pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then AC_MSG_NOTICE(creating $pkgconfig_generate.in) cat > $pkgconfig_generate.in <conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then AC_MSG_ERROR([$pkgconfig_generate is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ],[ dnl AC_CONFIG_COMMANDS crap, the AS_PUSHVAR defines are invalid here... ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' ])dnl AS_VAR_POPDEF([PKGCONFIG_suffix])dnl AS_VAR_POPDEF([PKGCONFIG_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_libfile])dnl AS_VAR_POPDEF([PKGCONFIG_libname])dnl AS_VAR_POPDEF([PKGCONFIG_version])dnl AS_VAR_POPDEF([PKGCONFIG_description])dnl AS_VAR_POPDEF([PKGCONFIG_requires])dnl AS_VAR_POPDEF([PKGCONFIG_pkglibs])dnl AS_VAR_POPDEF([PKGCONFIG_libs])dnl AS_VAR_POPDEF([PKGCONFIG_ldflags])dnl AS_VAR_POPDEF([PKGCONFIG_cppflags])dnl AS_VAR_POPDEF([PKGCONFIG_generate])dnl AS_VAR_POPDEF([PKGCONFIG_src_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_src_headers])dnl ]) cloog-0.18.2/isl/m4/ax_gcc_archflag.m40000664000175000017500000002141412254313240014252 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_gcc_archflag.html # =========================================================================== # # SYNOPSIS # # AX_GCC_ARCHFLAG([PORTABLE?], [ACTION-SUCCESS], [ACTION-FAILURE]) # # DESCRIPTION # # This macro tries to guess the "native" arch corresponding to the target # architecture for use with gcc's -march=arch or -mtune=arch flags. If # found, the cache variable $ax_cv_gcc_archflag is set to this flag and # ACTION-SUCCESS is executed; otherwise $ax_cv_gcc_archflag is is set to # "unknown" and ACTION-FAILURE is executed. The default ACTION-SUCCESS is # to add $ax_cv_gcc_archflag to the end of $CFLAGS. # # PORTABLE? should be either [yes] (default) or [no]. In the former case, # the flag is set to -mtune (or equivalent) so that the architecture is # only used for tuning, but the instruction set used is still portable. In # the latter case, the flag is set to -march (or equivalent) so that # architecture-specific instructions are enabled. # # The user can specify --with-gcc-arch= in order to override the # macro's choice of architecture, or --without-gcc-arch to disable this. # # When cross-compiling, or if $CC is not gcc, then ACTION-FAILURE is # called unless the user specified --with-gcc-arch manually. # # Requires macros: AX_CHECK_COMPILER_FLAGS, AX_GCC_X86_CPUID # # (The main emphasis here is on recent CPUs, on the principle that doing # high-performance computing on old hardware is uncommon.) # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_GCC_ARCHFLAG], [AC_REQUIRE([AC_PROG_CC]) AC_REQUIRE([AC_CANONICAL_HOST]) AC_ARG_WITH(gcc-arch, [AC_HELP_STRING([--with-gcc-arch=], [use architecture for gcc -march/-mtune, instead of guessing])], ax_gcc_arch=$withval, ax_gcc_arch=yes) AC_MSG_CHECKING([for gcc architecture flag]) AC_MSG_RESULT([]) AC_CACHE_VAL(ax_cv_gcc_archflag, [ ax_cv_gcc_archflag="unknown" if test "$GCC" = yes; then if test "x$ax_gcc_arch" = xyes; then ax_gcc_arch="" if test "$cross_compiling" = no; then case $host_cpu in i[[3456]]86*|x86_64*) # use cpuid codes, in part from x86info-1.7 by D. Jones AX_GCC_X86_CPUID(0) AX_GCC_X86_CPUID(1) case $ax_cv_gcc_x86_cpuid_0 in *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *5[[48]]?:*:*:*) ax_gcc_arch="pentium-mmx pentium" ;; *5??:*:*:*) ax_gcc_arch=pentium ;; *6[[3456]]?:*:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[[01]]:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[[234]]:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6[[9d]]?:*:*:*) ax_gcc_arch="pentium-m pentium3 pentiumpro" ;; *6[[78b]]?:*:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6??:*:*:*) ax_gcc_arch=pentiumpro ;; *f3[[347]]:*:*:*|*f4[1347]:*:*:*) case $host_cpu in x86_64*) ax_gcc_arch="nocona pentium4 pentiumpro" ;; *) ax_gcc_arch="prescott pentium4 pentiumpro" ;; esac ;; *f??:*:*:*) ax_gcc_arch="pentium4 pentiumpro";; esac ;; *:68747541:*:*) # AMD case $ax_cv_gcc_x86_cpuid_1 in *5[[67]]?:*:*:*) ax_gcc_arch=k6 ;; *5[[8d]]?:*:*:*) ax_gcc_arch="k6-2 k6" ;; *5[[9]]?:*:*:*) ax_gcc_arch="k6-3 k6" ;; *60?:*:*:*) ax_gcc_arch=k7 ;; *6[[12]]?:*:*:*) ax_gcc_arch="athlon k7" ;; *6[[34]]?:*:*:*) ax_gcc_arch="athlon-tbird k7" ;; *67?:*:*:*) ax_gcc_arch="athlon-4 athlon k7" ;; *6[[68a]]?:*:*:*) AX_GCC_X86_CPUID(0x80000006) # L2 cache size case $ax_cv_gcc_x86_cpuid_0x80000006 in *:*:*[[1-9a-f]]??????:*) # (L2 = ecx >> 16) >= 256 ax_gcc_arch="athlon-xp athlon-4 athlon k7" ;; *) ax_gcc_arch="athlon-4 athlon k7" ;; esac ;; *f[[4cef8b]]?:*:*:*) ax_gcc_arch="athlon64 k8" ;; *f5?:*:*:*) ax_gcc_arch="opteron k8" ;; *f7?:*:*:*) ax_gcc_arch="athlon-fx opteron k8" ;; *f??:*:*:*) ax_gcc_arch="k8" ;; esac ;; *:746e6543:*:*) # IDT case $ax_cv_gcc_x86_cpuid_1 in *54?:*:*:*) ax_gcc_arch=winchip-c6 ;; *58?:*:*:*) ax_gcc_arch=winchip2 ;; *6[[78]]?:*:*:*) ax_gcc_arch=c3 ;; *69?:*:*:*) ax_gcc_arch="c3-2 c3" ;; esac ;; esac if test x"$ax_gcc_arch" = x; then # fallback case $host_cpu in i586*) ax_gcc_arch=pentium ;; i686*) ax_gcc_arch=pentiumpro ;; esac fi ;; sparc*) AC_PATH_PROG([PRTDIAG], [prtdiag], [prtdiag], [$PATH:/usr/platform/`uname -i`/sbin/:/usr/platform/`uname -m`/sbin/]) cputype=`(((grep cpu /proc/cpuinfo | cut -d: -f2) ; ($PRTDIAG -v |grep -i sparc) ; grep -i cpu /var/run/dmesg.boot ) | head -n 1) 2> /dev/null` cputype=`echo "$cputype" | tr -d ' -' |tr $as_cr_LETTERS $as_cr_letters` case $cputype in *ultrasparciv*) ax_gcc_arch="ultrasparc4 ultrasparc3 ultrasparc v9" ;; *ultrasparciii*) ax_gcc_arch="ultrasparc3 ultrasparc v9" ;; *ultrasparc*) ax_gcc_arch="ultrasparc v9" ;; *supersparc*|*tms390z5[[05]]*) ax_gcc_arch="supersparc v8" ;; *hypersparc*|*rt62[[056]]*) ax_gcc_arch="hypersparc v8" ;; *cypress*) ax_gcc_arch=cypress ;; esac ;; alphaev5) ax_gcc_arch=ev5 ;; alphaev56) ax_gcc_arch=ev56 ;; alphapca56) ax_gcc_arch="pca56 ev56" ;; alphapca57) ax_gcc_arch="pca57 pca56 ev56" ;; alphaev6) ax_gcc_arch=ev6 ;; alphaev67) ax_gcc_arch=ev67 ;; alphaev68) ax_gcc_arch="ev68 ev67" ;; alphaev69) ax_gcc_arch="ev69 ev68 ev67" ;; alphaev7) ax_gcc_arch="ev7 ev69 ev68 ev67" ;; alphaev79) ax_gcc_arch="ev79 ev7 ev69 ev68 ev67" ;; powerpc*) cputype=`((grep cpu /proc/cpuinfo | head -n 1 | cut -d: -f2 | cut -d, -f1 | sed 's/ //g') ; /usr/bin/machine ; /bin/machine; grep CPU /var/run/dmesg.boot | head -n 1 | cut -d" " -f2) 2> /dev/null` cputype=`echo $cputype | sed -e 's/ppc//g;s/ *//g'` case $cputype in *750*) ax_gcc_arch="750 G3" ;; *740[[0-9]]*) ax_gcc_arch="$cputype 7400 G4" ;; *74[[4-5]][[0-9]]*) ax_gcc_arch="$cputype 7450 G4" ;; *74[[0-9]][[0-9]]*) ax_gcc_arch="$cputype G4" ;; *970*) ax_gcc_arch="970 G5 power4";; *POWER4*|*power4*|*gq*) ax_gcc_arch="power4 970";; *POWER5*|*power5*|*gr*|*gs*) ax_gcc_arch="power5 power4 970";; 603ev|8240) ax_gcc_arch="$cputype 603e 603";; *) ax_gcc_arch=$cputype ;; esac ax_gcc_arch="$ax_gcc_arch powerpc" ;; esac fi # not cross-compiling fi # guess arch if test "x$ax_gcc_arch" != x -a "x$ax_gcc_arch" != xno; then for arch in $ax_gcc_arch; do if test "x[]m4_default([$1],yes)" = xyes; then # if we require portable code flags="-mtune=$arch" # -mcpu=$arch and m$arch generate nonportable code on every arch except # x86. And some other arches (e.g. Alpha) don't accept -mtune. Grrr. case $host_cpu in i*86|x86_64*) flags="$flags -mcpu=$arch -m$arch";; esac else flags="-march=$arch -mcpu=$arch -m$arch" fi for flag in $flags; do AX_CHECK_COMPILER_FLAGS($flag, [ax_cv_gcc_archflag=$flag; break]) done test "x$ax_cv_gcc_archflag" = xunknown || break done fi fi # $GCC=yes ]) AC_MSG_CHECKING([for gcc architecture flag]) AC_MSG_RESULT($ax_cv_gcc_archflag) if test "x$ax_cv_gcc_archflag" = xunknown; then m4_default([$3],:) else m4_default([$2], [CFLAGS="$CFLAGS $ax_cv_gcc_archflag"]) fi ]) cloog-0.18.2/isl/m4/ax_gcc_warn_unused_result.m40000664000175000017500000000472312254313240016437 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_gcc_warn_unused_result.html # =========================================================================== # # SYNOPSIS # # AX_GCC_WARN_UNUSED_RESULT # # DESCRIPTION # # The macro will compile a test program to see whether the compiler does # understand the per-function postfix pragma. # # LICENSE # # Copyright (c) 2008 Guido U. Draheim # # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation; either version 2 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_GCC_WARN_UNUSED_RESULT],[dnl AC_CACHE_CHECK( [whether the compiler supports function __attribute__((__warn_unused_result__))], ax_cv_gcc_warn_unused_result,[ AC_TRY_COMPILE([__attribute__((__warn_unused_result__)) int f(int i) { return i; }], [], ax_cv_gcc_warn_unused_result=yes, ax_cv_gcc_warn_unused_result=no)]) if test "$ax_cv_gcc_warn_unused_result" = yes; then AC_DEFINE([GCC_WARN_UNUSED_RESULT],[__attribute__((__warn_unused_result__))], [most gcc compilers know a function __attribute__((__warn_unused_result__))]) fi ]) cloog-0.18.2/isl/m4/ax_check_compiler_flags.m40000664000175000017500000000632312254313240016014 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_check_compiler_flags.html # =========================================================================== # # SYNOPSIS # # AX_CHECK_COMPILER_FLAGS(FLAGS, [ACTION-SUCCESS], [ACTION-FAILURE]) # # DESCRIPTION # # Check whether the given compiler FLAGS work with the current language's # compiler, or whether they give an error. (Warnings, however, are # ignored.) # # ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on # success/failure. # # LICENSE # # Copyright (c) 2009 Steven G. Johnson # Copyright (c) 2009 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_CHECK_COMPILER_FLAGS], [AC_PREREQ(2.59) dnl for _AC_LANG_PREFIX AC_MSG_CHECKING([whether _AC_LANG compiler accepts $1]) dnl Some hackery here since AC_CACHE_VAL can't handle a non-literal varname: AS_LITERAL_IF([$1], [AC_CACHE_VAL(AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1]), [ ax_save_FLAGS=$[]_AC_LANG_PREFIX[]FLAGS _AC_LANG_PREFIX[]FLAGS="$1" AC_COMPILE_IFELSE([AC_LANG_PROGRAM()], AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=yes, AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=no) _AC_LANG_PREFIX[]FLAGS=$ax_save_FLAGS])], [ax_save_FLAGS=$[]_AC_LANG_PREFIX[]FLAGS _AC_LANG_PREFIX[]FLAGS="$1" AC_COMPILE_IFELSE([AC_LANG_PROGRAM()], eval AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=yes, eval AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1])=no) _AC_LANG_PREFIX[]FLAGS=$ax_save_FLAGS]) eval ax_check_compiler_flags=$AS_TR_SH(ax_cv_[]_AC_LANG_ABBREV[]_flags_[$1]) AC_MSG_RESULT($ax_check_compiler_flags) if test "x$ax_check_compiler_flags" = xyes; then m4_default([$2], :) else m4_default([$3], :) fi ])dnl AX_CHECK_COMPILER_FLAGS cloog-0.18.2/isl/m4/ltsugar.m40000644000175000017500000001044012254313255012661 00000000000000# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004-2005, 2007-2008, 2011-2013 Free Software # Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltsugar.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) # lt_join(SEP, ARG1, [ARG2...]) # ----------------------------- # Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their # associated separator. # Needed until we can rely on m4_join from Autoconf 2.62, since all earlier # versions in m4sugar had bugs. m4_define([lt_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) m4_define([_lt_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) # lt_car(LIST) # lt_cdr(LIST) # ------------ # Manipulate m4 lists. # These macros are necessary as long as will still need to support # Autoconf-2.59, which quotes differently. m4_define([lt_car], [[$1]]) m4_define([lt_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) m4_define([lt_unquote], $1) # lt_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus 'SEPARATOR''STRING'. # Note that neither SEPARATOR nor STRING are expanded; they are appended # to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). # No SEPARATOR is output if MACRO-NAME was previously undefined (different # than defined and empty). # # This macro is needed until we can rely on Autoconf 2.62, since earlier # versions of m4sugar mistakenly expanded SEPARATOR but not STRING. m4_define([lt_append], [m4_define([$1], m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) # lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) # ---------------------------------------------------------- # Produce a SEP delimited list of all paired combinations of elements of # PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list # has the form PREFIXmINFIXSUFFIXn. # Needed until we can rely on m4_combine added in Autoconf 2.62. m4_define([lt_combine], [m4_if(m4_eval([$# > 3]), [1], [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl [[m4_foreach([_Lt_prefix], [$2], [m4_foreach([_Lt_suffix], ]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[, [_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])]) # lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) # ----------------------------------------------------------------------- # Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited # by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. m4_define([lt_if_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], [lt_append([$1], [$2], [$3])$4], [$5])], [lt_append([$1], [$2], [$3])$4])]) # lt_dict_add(DICT, KEY, VALUE) # ----------------------------- m4_define([lt_dict_add], [m4_define([$1($2)], [$3])]) # lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) # -------------------------------------------- m4_define([lt_dict_add_subkey], [m4_define([$1($2:$3)], [$4])]) # lt_dict_fetch(DICT, KEY, [SUBKEY]) # ---------------------------------- m4_define([lt_dict_fetch], [m4_ifval([$3], m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) # lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------------------- m4_define([lt_if_dict_fetch], [m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], [$5], [$6])]) # lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) # -------------------------------------------------------------- m4_define([lt_dict_filter], [m4_if([$5], [], [], [lt_join(m4_quote(m4_default([$4], [[, ]])), lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl ]) cloog-0.18.2/isl/m4/ax_cc_maxopt.m40000664000175000017500000001644312254313240013652 00000000000000# =========================================================================== # http://www.nongnu.org/autoconf-archive/ax_cc_maxopt.html # =========================================================================== # # SYNOPSIS # # AX_CC_MAXOPT # # DESCRIPTION # # Try to turn on "good" C optimization flags for various compilers and # architectures, for some definition of "good". (In our case, good for # FFTW and hopefully for other scientific codes. Modify as needed.) # # The user can override the flags by setting the CFLAGS environment # variable. The user can also specify --enable-portable-binary in order to # disable any optimization flags that might result in a binary that only # runs on the host architecture. # # Note also that the flags assume that ANSI C aliasing rules are followed # by the code (e.g. for gcc's -fstrict-aliasing), and that floating-point # computations can be re-ordered as needed. # # Requires macros: AX_CHECK_COMPILER_FLAGS, AX_COMPILER_VENDOR, # AX_GCC_ARCHFLAG, AX_GCC_X86_CPUID. # # LICENSE # # Copyright (c) 2008 Steven G. Johnson # Copyright (c) 2008 Matteo Frigo # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation, either version 3 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. AC_DEFUN([AX_CC_MAXOPT], [ AC_REQUIRE([AC_PROG_CC]) AC_REQUIRE([AX_COMPILER_VENDOR]) AC_REQUIRE([AC_CANONICAL_HOST]) AC_ARG_ENABLE(portable-binary, [AC_HELP_STRING([--enable-portable-binary], [disable compiler optimizations that would produce unportable binaries])], acx_maxopt_portable=$withval, acx_maxopt_portable=no) # Try to determine "good" native compiler flags if none specified via CFLAGS if test "$ac_test_CFLAGS" != "set"; then CFLAGS="" case $ax_cv_c_compiler_vendor in dec) CFLAGS="-newc -w0 -O5 -ansi_alias -ansi_args -fp_reorder -tune host" if test "x$acx_maxopt_portable" = xno; then CFLAGS="$CFLAGS -arch host" fi;; sun) CFLAGS="-native -fast -xO5 -dalign" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS -xarch=generic" fi;; hp) CFLAGS="+Oall +Optrs_ansi +DSnative" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS +DAportable" fi;; ibm) if test "x$acx_maxopt_portable" = xno; then xlc_opt="-qarch=auto -qtune=auto" else xlc_opt="-qtune=auto" fi AX_CHECK_COMPILER_FLAGS($xlc_opt, CFLAGS="-O3 -qansialias -w $xlc_opt", [CFLAGS="-O3 -qansialias -w" echo "******************************************************" echo "* You seem to have the IBM C compiler. It is *" echo "* recommended for best performance that you use: *" echo "* *" echo "* CFLAGS=-O3 -qarch=xxx -qtune=xxx -qansialias -w *" echo "* ^^^ ^^^ *" echo "* where xxx is pwr2, pwr3, 604, or whatever kind of *" echo "* CPU you have. (Set the CFLAGS environment var. *" echo "* and re-run configure.) For more info, man cc. *" echo "******************************************************"]) ;; intel) CFLAGS="-O3 -ansi_alias" if test "x$acx_maxopt_portable" = xno; then icc_archflag=unknown icc_flags="" case $host_cpu in i686*|x86_64*) # icc accepts gcc assembly syntax, so these should work: AX_GCC_X86_CPUID(0) AX_GCC_X86_CPUID(1) case $ax_cv_gcc_x86_cpuid_0 in # see AX_GCC_ARCHFLAG *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *6a?:*[[234]]:*:*|*6[[789b]]?:*:*:*) icc_flags="-xK";; *f3[[347]]:*:*:*|*f4[1347]:*:*:*) icc_flags="-xP -xN -xW -xK";; *f??:*:*:*) icc_flags="-xN -xW -xK";; esac ;; esac ;; esac if test "x$icc_flags" != x; then for flag in $icc_flags; do AX_CHECK_COMPILER_FLAGS($flag, [icc_archflag=$flag; break]) done fi AC_MSG_CHECKING([for icc architecture flag]) AC_MSG_RESULT($icc_archflag) if test "x$icc_archflag" != xunknown; then CFLAGS="$CFLAGS $icc_archflag" fi fi ;; gnu) # default optimization flags for gcc on all systems CFLAGS="-O3 -fomit-frame-pointer" # -malign-double for x86 systems AX_CHECK_COMPILER_FLAGS(-malign-double, CFLAGS="$CFLAGS -malign-double") # -fstrict-aliasing for gcc-2.95+ AX_CHECK_COMPILER_FLAGS(-fstrict-aliasing, CFLAGS="$CFLAGS -fstrict-aliasing") # note that we enable "unsafe" fp optimization with other compilers, too AX_CHECK_COMPILER_FLAGS(-ffast-math, CFLAGS="$CFLAGS -ffast-math") AX_GCC_ARCHFLAG($acx_maxopt_portable) # drop to -O1 for gcc 4.2 $CC --version | sed -e 's/.* \(@<:@0-9@:>@@<:@0-9@:>@*\)\.\(@<:@0-9@:>@@<:@0-9@:>@*\).*/\1 \2/' | (read major minor if test $major -eq 4 -a $minor -eq 2; then exit 0 fi exit 1 ) && CFLAGS="-O1" ;; esac if test -z "$CFLAGS"; then echo "" echo "********************************************************" echo "* WARNING: Don't know the best CFLAGS for this system *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "* (otherwise, a default of CFLAGS=-O3 will be used) *" echo "********************************************************" echo "" CFLAGS="-O3" fi AX_CHECK_COMPILER_FLAGS($CFLAGS, [], [ echo "" echo "********************************************************" echo "* WARNING: The guessed CFLAGS don't seem to work with *" echo "* your compiler. *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "********************************************************" echo "" CFLAGS="" ]) fi ]) cloog-0.18.2/isl/m4/lt~obsolete.m40000644000175000017500000001377412254313255013567 00000000000000# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004-2005, 2007, 2009, 2011-2013 Free Software # Foundation, Inc. # Written by Scott James Remnant, 2004. # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 5 lt~obsolete.m4 # These exist entirely to fool aclocal when bootstrapping libtool. # # In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN), # which have later been changed to m4_define as they aren't part of the # exported API, or moved to Autoconf or Automake where they belong. # # The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN # in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us # using a macro with the same name in our local m4/libtool.m4 it'll # pull the old libtool.m4 in (it doesn't see our shiny new m4_define # and doesn't know about Autoconf macros at all.) # # So we provide this file, which has a silly filename so it's always # included after everything else. This provides aclocal with the # AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything # because those macros already exist, or will be overwritten later. # We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. # # Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. # Yes, that means every name once taken will need to remain here until # we give up compatibility with versions before 1.7, at which point # we need to keep only those names which we still refer to. # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) m4_ifndef([_LT_REQUIRED_DARWIN_CHECKS], [AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])]) m4_ifndef([_LT_AC_PROG_CXXCPP], [AC_DEFUN([_LT_AC_PROG_CXXCPP])]) m4_ifndef([_LT_PREPARE_SED_QUOTE_VARS], [AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])]) m4_ifndef([_LT_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_PROG_F77], [AC_DEFUN([_LT_PROG_F77])]) m4_ifndef([_LT_PROG_FC], [AC_DEFUN([_LT_PROG_FC])]) m4_ifndef([_LT_PROG_CXX], [AC_DEFUN([_LT_PROG_CXX])]) cloog-0.18.2/isl/m4/ax_c___attribute__.m40000664000175000017500000000476712254313240015004 00000000000000# =========================================================================== # http://www.gnu.org/software/autoconf-archive/ax_c___attribute__.html # =========================================================================== # # SYNOPSIS # # AX_C___ATTRIBUTE__ # # DESCRIPTION # # Provides a test for the compiler support of __attribute__ extensions. # Defines HAVE___ATTRIBUTE__ if it is found. # # LICENSE # # Copyright (c) 2008 Stepan Kasal # Copyright (c) 2008 Christian Haggstrom # Copyright (c) 2008 Ryan McCabe # # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation; either version 2 of the License, or (at your # option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General # Public License for more details. # # You should have received a copy of the GNU General Public License along # with this program. If not, see . # # As a special exception, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. #serial 8 AC_DEFUN([AX_C___ATTRIBUTE__], [ AC_CACHE_CHECK([for __attribute__], [ax_cv___attribute__], [AC_COMPILE_IFELSE( [AC_LANG_PROGRAM( [[#include static void foo(void) __attribute__ ((unused)); static void foo(void) { exit(1); } ]], [])], [ax_cv___attribute__=yes], [ax_cv___attribute__=no] ) ]) if test "$ax_cv___attribute__" = "yes"; then AC_DEFINE([HAVE___ATTRIBUTE__], 1, [define if your compiler has __attribute__]) fi ]) cloog-0.18.2/isl/isl_schedule.c0000664000175000017500000031174212254313240013232 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2012-2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* * The scheduling algorithm implemented in this file was inspired by * Bondhugula et al., "Automatic Transformations for Communication-Minimized * Parallelization and Locality Optimization in the Polyhedral Model". */ /* Internal information about a node that is used during the construction * of a schedule. * dim represents the space in which the domain lives * sched is a matrix representation of the schedule being constructed * for this node * sched_map is an isl_map representation of the same (partial) schedule * sched_map may be NULL * rank is the number of linearly independent rows in the linear part * of sched * the columns of cmap represent a change of basis for the schedule * coefficients; the first rank columns span the linear part of * the schedule rows * start is the first variable in the LP problem in the sequences that * represents the schedule coefficients of this node * nvar is the dimension of the domain * nparam is the number of parameters or 0 if we are not constructing * a parametric schedule * * scc is the index of SCC (or WCC) this node belongs to * * band contains the band index for each of the rows of the schedule. * band_id is used to differentiate between separate bands at the same * level within the same parent band, i.e., bands that are separated * by the parent band or bands that are independent of each other. * zero contains a boolean for each of the rows of the schedule, * indicating whether the corresponding scheduling dimension results * in zero dependence distances within its band and with respect * to the proximity edges. */ struct isl_sched_node { isl_space *dim; isl_mat *sched; isl_map *sched_map; int rank; isl_mat *cmap; int start; int nvar; int nparam; int scc; int *band; int *band_id; int *zero; }; static int node_has_dim(const void *entry, const void *val) { struct isl_sched_node *node = (struct isl_sched_node *)entry; isl_space *dim = (isl_space *)val; return isl_space_is_equal(node->dim, dim); } /* An edge in the dependence graph. An edge may be used to * ensure validity of the generated schedule, to minimize the dependence * distance or both * * map is the dependence relation * src is the source node * dst is the sink node * validity is set if the edge is used to ensure correctness * proximity is set if the edge is used to minimize dependence distances * * For validity edges, start and end mark the sequence of inequality * constraints in the LP problem that encode the validity constraint * corresponding to this edge. */ struct isl_sched_edge { isl_map *map; struct isl_sched_node *src; struct isl_sched_node *dst; int validity; int proximity; int start; int end; }; enum isl_edge_type { isl_edge_validity = 0, isl_edge_first = isl_edge_validity, isl_edge_proximity, isl_edge_last = isl_edge_proximity }; /* Internal information about the dependence graph used during * the construction of the schedule. * * intra_hmap is a cache, mapping dependence relations to their dual, * for dependences from a node to itself * inter_hmap is a cache, mapping dependence relations to their dual, * for dependences between distinct nodes * * n is the number of nodes * node is the list of nodes * maxvar is the maximal number of variables over all nodes * max_row is the allocated number of rows in the schedule * n_row is the current (maximal) number of linearly independent * rows in the node schedules * n_total_row is the current number of rows in the node schedules * n_band is the current number of completed bands * band_start is the starting row in the node schedules of the current band * root is set if this graph is the original dependence graph, * without any splitting * * sorted contains a list of node indices sorted according to the * SCC to which a node belongs * * n_edge is the number of edges * edge is the list of edges * max_edge contains the maximal number of edges of each type; * in particular, it contains the number of edges in the inital graph. * edge_table contains pointers into the edge array, hashed on the source * and sink spaces; there is one such table for each type; * a given edge may be referenced from more than one table * if the corresponding relation appears in more than of the * sets of dependences * * node_table contains pointers into the node array, hashed on the space * * region contains a list of variable sequences that should be non-trivial * * lp contains the (I)LP problem used to obtain new schedule rows * * src_scc and dst_scc are the source and sink SCCs of an edge with * conflicting constraints * * scc represents the number of components */ struct isl_sched_graph { isl_hmap_map_basic_set *intra_hmap; isl_hmap_map_basic_set *inter_hmap; struct isl_sched_node *node; int n; int maxvar; int max_row; int n_row; int *sorted; int n_band; int n_total_row; int band_start; int root; struct isl_sched_edge *edge; int n_edge; int max_edge[isl_edge_last + 1]; struct isl_hash_table *edge_table[isl_edge_last + 1]; struct isl_hash_table *node_table; struct isl_region *region; isl_basic_set *lp; int src_scc; int dst_scc; int scc; }; /* Initialize node_table based on the list of nodes. */ static int graph_init_table(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; graph->node_table = isl_hash_table_alloc(ctx, graph->n); if (!graph->node_table) return -1; for (i = 0; i < graph->n; ++i) { struct isl_hash_table_entry *entry; uint32_t hash; hash = isl_space_get_hash(graph->node[i].dim); entry = isl_hash_table_find(ctx, graph->node_table, hash, &node_has_dim, graph->node[i].dim, 1); if (!entry) return -1; entry->data = &graph->node[i]; } return 0; } /* Return a pointer to the node that lives within the given space, * or NULL if there is no such node. */ static struct isl_sched_node *graph_find_node(isl_ctx *ctx, struct isl_sched_graph *graph, __isl_keep isl_space *dim) { struct isl_hash_table_entry *entry; uint32_t hash; hash = isl_space_get_hash(dim); entry = isl_hash_table_find(ctx, graph->node_table, hash, &node_has_dim, dim, 0); return entry ? entry->data : NULL; } static int edge_has_src_and_dst(const void *entry, const void *val) { const struct isl_sched_edge *edge = entry; const struct isl_sched_edge *temp = val; return edge->src == temp->src && edge->dst == temp->dst; } /* Add the given edge to graph->edge_table[type]. */ static int graph_edge_table_add(isl_ctx *ctx, struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_edge *edge) { struct isl_hash_table_entry *entry; uint32_t hash; hash = isl_hash_init(); hash = isl_hash_builtin(hash, edge->src); hash = isl_hash_builtin(hash, edge->dst); entry = isl_hash_table_find(ctx, graph->edge_table[type], hash, &edge_has_src_and_dst, edge, 1); if (!entry) return -1; entry->data = edge; return 0; } /* Allocate the edge_tables based on the maximal number of edges of * each type. */ static int graph_init_edge_tables(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; for (i = 0; i <= isl_edge_last; ++i) { graph->edge_table[i] = isl_hash_table_alloc(ctx, graph->max_edge[i]); if (!graph->edge_table[i]) return -1; } return 0; } /* If graph->edge_table[type] contains an edge from the given source * to the given destination, then return the hash table entry of this edge. * Otherwise, return NULL. */ static struct isl_hash_table_entry *graph_find_edge_entry( struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) { isl_ctx *ctx = isl_space_get_ctx(src->dim); uint32_t hash; struct isl_sched_edge temp = { .src = src, .dst = dst }; hash = isl_hash_init(); hash = isl_hash_builtin(hash, temp.src); hash = isl_hash_builtin(hash, temp.dst); return isl_hash_table_find(ctx, graph->edge_table[type], hash, &edge_has_src_and_dst, &temp, 0); } /* If graph->edge_table[type] contains an edge from the given source * to the given destination, then return this edge. * Otherwise, return NULL. */ static struct isl_sched_edge *graph_find_edge(struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) { struct isl_hash_table_entry *entry; entry = graph_find_edge_entry(graph, type, src, dst); if (!entry) return NULL; return entry->data; } /* Check whether the dependence graph has an edge of the given type * between the given two nodes. */ static int graph_has_edge(struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) { struct isl_sched_edge *edge; int empty; edge = graph_find_edge(graph, type, src, dst); if (!edge) return 0; empty = isl_map_plain_is_empty(edge->map); if (empty < 0) return -1; return !empty; } /* If there is an edge from the given source to the given destination * of any type then return this edge. * Otherwise, return NULL. */ static struct isl_sched_edge *graph_find_any_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) { enum isl_edge_type i; struct isl_sched_edge *edge; for (i = isl_edge_first; i <= isl_edge_last; ++i) { edge = graph_find_edge(graph, i, src, dst); if (edge) return edge; } return NULL; } /* Remove the given edge from all the edge_tables that refer to it. */ static void graph_remove_edge(struct isl_sched_graph *graph, struct isl_sched_edge *edge) { isl_ctx *ctx = isl_map_get_ctx(edge->map); enum isl_edge_type i; for (i = isl_edge_first; i <= isl_edge_last; ++i) { struct isl_hash_table_entry *entry; entry = graph_find_edge_entry(graph, i, edge->src, edge->dst); if (!entry) continue; if (entry->data != edge) continue; isl_hash_table_remove(ctx, graph->edge_table[i], entry); } } /* Check whether the dependence graph has any edge * between the given two nodes. */ static int graph_has_any_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) { enum isl_edge_type i; int r; for (i = isl_edge_first; i <= isl_edge_last; ++i) { r = graph_has_edge(graph, i, src, dst); if (r < 0 || r) return r; } return r; } /* Check whether the dependence graph has a validity edge * between the given two nodes. */ static int graph_has_validity_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) { return graph_has_edge(graph, isl_edge_validity, src, dst); } static int graph_alloc(isl_ctx *ctx, struct isl_sched_graph *graph, int n_node, int n_edge) { int i; graph->n = n_node; graph->n_edge = n_edge; graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n); graph->sorted = isl_calloc_array(ctx, int, graph->n); graph->region = isl_alloc_array(ctx, struct isl_region, graph->n); graph->edge = isl_calloc_array(ctx, struct isl_sched_edge, graph->n_edge); graph->intra_hmap = isl_hmap_map_basic_set_alloc(ctx, 2 * n_edge); graph->inter_hmap = isl_hmap_map_basic_set_alloc(ctx, 2 * n_edge); if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || !graph->sorted) return -1; for(i = 0; i < graph->n; ++i) graph->sorted[i] = i; return 0; } static void graph_free(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; isl_hmap_map_basic_set_free(ctx, graph->intra_hmap); isl_hmap_map_basic_set_free(ctx, graph->inter_hmap); for (i = 0; i < graph->n; ++i) { isl_space_free(graph->node[i].dim); isl_mat_free(graph->node[i].sched); isl_map_free(graph->node[i].sched_map); isl_mat_free(graph->node[i].cmap); if (graph->root) { free(graph->node[i].band); free(graph->node[i].band_id); free(graph->node[i].zero); } } free(graph->node); free(graph->sorted); for (i = 0; i < graph->n_edge; ++i) isl_map_free(graph->edge[i].map); free(graph->edge); free(graph->region); for (i = 0; i <= isl_edge_last; ++i) isl_hash_table_free(ctx, graph->edge_table[i]); isl_hash_table_free(ctx, graph->node_table); isl_basic_set_free(graph->lp); } /* For each "set" on which this function is called, increment * graph->n by one and update graph->maxvar. */ static int init_n_maxvar(__isl_take isl_set *set, void *user) { struct isl_sched_graph *graph = user; int nvar = isl_set_dim(set, isl_dim_set); graph->n++; if (nvar > graph->maxvar) graph->maxvar = nvar; isl_set_free(set); return 0; } /* Compute the number of rows that should be allocated for the schedule. * The graph can be split at most "n - 1" times, there can be at most * two rows for each dimension in the iteration domains (in particular, * we usually have one row, but it may be split by split_scaled), * and there can be one extra row for ordering the statements. * Note that if we have actually split "n - 1" times, then no ordering * is needed, so in principle we could use "graph->n + 2 * graph->maxvar - 1". */ static int compute_max_row(struct isl_sched_graph *graph, __isl_keep isl_union_set *domain) { graph->n = 0; graph->maxvar = 0; if (isl_union_set_foreach_set(domain, &init_n_maxvar, graph) < 0) return -1; graph->max_row = graph->n + 2 * graph->maxvar; return 0; } /* Add a new node to the graph representing the given set. */ static int extract_node(__isl_take isl_set *set, void *user) { int nvar, nparam; isl_ctx *ctx; isl_space *dim; isl_mat *sched; struct isl_sched_graph *graph = user; int *band, *band_id, *zero; ctx = isl_set_get_ctx(set); dim = isl_set_get_space(set); isl_set_free(set); nvar = isl_space_dim(dim, isl_dim_set); nparam = isl_space_dim(dim, isl_dim_param); if (!ctx->opt->schedule_parametric) nparam = 0; sched = isl_mat_alloc(ctx, 0, 1 + nparam + nvar); graph->node[graph->n].dim = dim; graph->node[graph->n].nvar = nvar; graph->node[graph->n].nparam = nparam; graph->node[graph->n].sched = sched; graph->node[graph->n].sched_map = NULL; band = isl_alloc_array(ctx, int, graph->max_row); graph->node[graph->n].band = band; band_id = isl_calloc_array(ctx, int, graph->max_row); graph->node[graph->n].band_id = band_id; zero = isl_calloc_array(ctx, int, graph->max_row); graph->node[graph->n].zero = zero; graph->n++; if (!sched || (graph->max_row && (!band || !band_id || !zero))) return -1; return 0; } struct isl_extract_edge_data { enum isl_edge_type type; struct isl_sched_graph *graph; }; /* Add a new edge to the graph based on the given map * and add it to data->graph->edge_table[data->type]. * If a dependence relation of a given type happens to be identical * to one of the dependence relations of a type that was added before, * then we don't create a new edge, but instead mark the original edge * as also representing a dependence of the current type. */ static int extract_edge(__isl_take isl_map *map, void *user) { isl_ctx *ctx = isl_map_get_ctx(map); struct isl_extract_edge_data *data = user; struct isl_sched_graph *graph = data->graph; struct isl_sched_node *src, *dst; isl_space *dim; struct isl_sched_edge *edge; int is_equal; dim = isl_space_domain(isl_map_get_space(map)); src = graph_find_node(ctx, graph, dim); isl_space_free(dim); dim = isl_space_range(isl_map_get_space(map)); dst = graph_find_node(ctx, graph, dim); isl_space_free(dim); if (!src || !dst) { isl_map_free(map); return 0; } graph->edge[graph->n_edge].src = src; graph->edge[graph->n_edge].dst = dst; graph->edge[graph->n_edge].map = map; if (data->type == isl_edge_validity) { graph->edge[graph->n_edge].validity = 1; graph->edge[graph->n_edge].proximity = 0; } if (data->type == isl_edge_proximity) { graph->edge[graph->n_edge].validity = 0; graph->edge[graph->n_edge].proximity = 1; } graph->n_edge++; edge = graph_find_any_edge(graph, src, dst); if (!edge) return graph_edge_table_add(ctx, graph, data->type, &graph->edge[graph->n_edge - 1]); is_equal = isl_map_plain_is_equal(map, edge->map); if (is_equal < 0) return -1; if (!is_equal) return graph_edge_table_add(ctx, graph, data->type, &graph->edge[graph->n_edge - 1]); graph->n_edge--; edge->validity |= graph->edge[graph->n_edge].validity; edge->proximity |= graph->edge[graph->n_edge].proximity; isl_map_free(map); return graph_edge_table_add(ctx, graph, data->type, edge); } /* Check whether there is any dependence from node[j] to node[i] * or from node[i] to node[j]. */ static int node_follows_weak(int i, int j, void *user) { int f; struct isl_sched_graph *graph = user; f = graph_has_any_edge(graph, &graph->node[j], &graph->node[i]); if (f < 0 || f) return f; return graph_has_any_edge(graph, &graph->node[i], &graph->node[j]); } /* Check whether there is a validity dependence from node[j] to node[i], * forcing node[i] to follow node[j]. */ static int node_follows_strong(int i, int j, void *user) { struct isl_sched_graph *graph = user; return graph_has_validity_edge(graph, &graph->node[j], &graph->node[i]); } /* Use Tarjan's algorithm for computing the strongly connected components * in the dependence graph (only validity edges). * If weak is set, we consider the graph to be undirected and * we effectively compute the (weakly) connected components. * Additionally, we also consider other edges when weak is set. */ static int detect_ccs(isl_ctx *ctx, struct isl_sched_graph *graph, int weak) { int i, n; struct isl_tarjan_graph *g = NULL; g = isl_tarjan_graph_init(ctx, graph->n, weak ? &node_follows_weak : &node_follows_strong, graph); if (!g) return -1; graph->scc = 0; i = 0; n = graph->n; while (n) { while (g->order[i] != -1) { graph->node[g->order[i]].scc = graph->scc; --n; ++i; } ++i; graph->scc++; } isl_tarjan_graph_free(g); return 0; } /* Apply Tarjan's algorithm to detect the strongly connected components * in the dependence graph. */ static int detect_sccs(isl_ctx *ctx, struct isl_sched_graph *graph) { return detect_ccs(ctx, graph, 0); } /* Apply Tarjan's algorithm to detect the (weakly) connected components * in the dependence graph. */ static int detect_wccs(isl_ctx *ctx, struct isl_sched_graph *graph) { return detect_ccs(ctx, graph, 1); } static int cmp_scc(const void *a, const void *b, void *data) { struct isl_sched_graph *graph = data; const int *i1 = a; const int *i2 = b; return graph->node[*i1].scc - graph->node[*i2].scc; } /* Sort the elements of graph->sorted according to the corresponding SCCs. */ static int sort_sccs(struct isl_sched_graph *graph) { return isl_sort(graph->sorted, graph->n, sizeof(int), &cmp_scc, graph); } /* Given a dependence relation R from a node to itself, * construct the set of coefficients of valid constraints for elements * in that dependence relation. * In particular, the result contains tuples of coefficients * c_0, c_n, c_x such that * * c_0 + c_n n + c_x y - c_x x >= 0 for each (x,y) in R * * or, equivalently, * * c_0 + c_n n + c_x d >= 0 for each d in delta R = { y - x | (x,y) in R } * * We choose here to compute the dual of delta R. * Alternatively, we could have computed the dual of R, resulting * in a set of tuples c_0, c_n, c_x, c_y, and then * plugged in (c_0, c_n, c_x, -c_x). */ static __isl_give isl_basic_set *intra_coefficients( struct isl_sched_graph *graph, __isl_take isl_map *map) { isl_ctx *ctx = isl_map_get_ctx(map); isl_set *delta; isl_basic_set *coef; if (isl_hmap_map_basic_set_has(ctx, graph->intra_hmap, map)) return isl_hmap_map_basic_set_get(ctx, graph->intra_hmap, map); delta = isl_set_remove_divs(isl_map_deltas(isl_map_copy(map))); coef = isl_set_coefficients(delta); isl_hmap_map_basic_set_set(ctx, graph->intra_hmap, map, isl_basic_set_copy(coef)); return coef; } /* Given a dependence relation R, * construct the set of coefficients * of valid constraints for elements in that dependence relation. * In particular, the result contains tuples of coefficients * c_0, c_n, c_x, c_y such that * * c_0 + c_n n + c_x x + c_y y >= 0 for each (x,y) in R * */ static __isl_give isl_basic_set *inter_coefficients( struct isl_sched_graph *graph, __isl_take isl_map *map) { isl_ctx *ctx = isl_map_get_ctx(map); isl_set *set; isl_basic_set *coef; if (isl_hmap_map_basic_set_has(ctx, graph->inter_hmap, map)) return isl_hmap_map_basic_set_get(ctx, graph->inter_hmap, map); set = isl_map_wrap(isl_map_remove_divs(isl_map_copy(map))); coef = isl_set_coefficients(set); isl_hmap_map_basic_set_set(ctx, graph->inter_hmap, map, isl_basic_set_copy(coef)); return coef; } /* Add constraints to graph->lp that force validity for the given * dependence from a node i to itself. * That is, add constraints that enforce * * (c_i_0 + c_i_n n + c_i_x y) - (c_i_0 + c_i_n n + c_i_x x) * = c_i_x (y - x) >= 0 * * for each (x,y) in R. * We obtain general constraints on coefficients (c_0, c_n, c_x) * of valid constraints for (y - x) and then plug in (0, 0, c_i_x^+ - c_i_x^-), * where c_i_x = c_i_x^+ - c_i_x^-, with c_i_x^+ and c_i_x^- non-negative. * In graph->lp, the c_i_x^- appear before their c_i_x^+ counterpart. * * Actually, we do not construct constraints for the c_i_x themselves, * but for the coefficients of c_i_x written as a linear combination * of the columns in node->cmap. */ static int add_intra_validity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge) { unsigned total; isl_map *map = isl_map_copy(edge->map); isl_ctx *ctx = isl_map_get_ctx(map); isl_space *dim; isl_dim_map *dim_map; isl_basic_set *coef; struct isl_sched_node *node = edge->src; coef = intra_coefficients(graph, map); dim = isl_space_domain(isl_space_unwrap(isl_basic_set_get_space(coef))); coef = isl_basic_set_transform_dims(coef, isl_dim_set, isl_space_dim(dim, isl_dim_set), isl_mat_copy(node->cmap)); if (!coef) goto error; total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); isl_dim_map_range(dim_map, node->start + 2 * node->nparam + 1, 2, isl_space_dim(dim, isl_dim_set), 1, node->nvar, -1); isl_dim_map_range(dim_map, node->start + 2 * node->nparam + 2, 2, isl_space_dim(dim, isl_dim_set), 1, node->nvar, 1); graph->lp = isl_basic_set_extend_constraints(graph->lp, coef->n_eq, coef->n_ineq); graph->lp = isl_basic_set_add_constraints_dim_map(graph->lp, coef, dim_map); isl_space_free(dim); return 0; error: isl_space_free(dim); return -1; } /* Add constraints to graph->lp that force validity for the given * dependence from node i to node j. * That is, add constraints that enforce * * (c_j_0 + c_j_n n + c_j_x y) - (c_i_0 + c_i_n n + c_i_x x) >= 0 * * for each (x,y) in R. * We obtain general constraints on coefficients (c_0, c_n, c_x, c_y) * of valid constraints for R and then plug in * (c_j_0 - c_i_0, c_j_n^+ - c_j_n^- - (c_i_n^+ - c_i_n^-), * c_j_x^+ - c_j_x^- - (c_i_x^+ - c_i_x^-)), * where c_* = c_*^+ - c_*^-, with c_*^+ and c_*^- non-negative. * In graph->lp, the c_*^- appear before their c_*^+ counterpart. * * Actually, we do not construct constraints for the c_*_x themselves, * but for the coefficients of c_*_x written as a linear combination * of the columns in node->cmap. */ static int add_inter_validity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge) { unsigned total; isl_map *map = isl_map_copy(edge->map); isl_ctx *ctx = isl_map_get_ctx(map); isl_space *dim; isl_dim_map *dim_map; isl_basic_set *coef; struct isl_sched_node *src = edge->src; struct isl_sched_node *dst = edge->dst; coef = inter_coefficients(graph, map); dim = isl_space_domain(isl_space_unwrap(isl_basic_set_get_space(coef))); coef = isl_basic_set_transform_dims(coef, isl_dim_set, isl_space_dim(dim, isl_dim_set), isl_mat_copy(src->cmap)); coef = isl_basic_set_transform_dims(coef, isl_dim_set, isl_space_dim(dim, isl_dim_set) + src->nvar, isl_mat_copy(dst->cmap)); if (!coef) goto error; total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); isl_dim_map_range(dim_map, dst->start, 0, 0, 0, 1, 1); isl_dim_map_range(dim_map, dst->start + 1, 2, 1, 1, dst->nparam, -1); isl_dim_map_range(dim_map, dst->start + 2, 2, 1, 1, dst->nparam, 1); isl_dim_map_range(dim_map, dst->start + 2 * dst->nparam + 1, 2, isl_space_dim(dim, isl_dim_set) + src->nvar, 1, dst->nvar, -1); isl_dim_map_range(dim_map, dst->start + 2 * dst->nparam + 2, 2, isl_space_dim(dim, isl_dim_set) + src->nvar, 1, dst->nvar, 1); isl_dim_map_range(dim_map, src->start, 0, 0, 0, 1, -1); isl_dim_map_range(dim_map, src->start + 1, 2, 1, 1, src->nparam, 1); isl_dim_map_range(dim_map, src->start + 2, 2, 1, 1, src->nparam, -1); isl_dim_map_range(dim_map, src->start + 2 * src->nparam + 1, 2, isl_space_dim(dim, isl_dim_set), 1, src->nvar, 1); isl_dim_map_range(dim_map, src->start + 2 * src->nparam + 2, 2, isl_space_dim(dim, isl_dim_set), 1, src->nvar, -1); edge->start = graph->lp->n_ineq; graph->lp = isl_basic_set_extend_constraints(graph->lp, coef->n_eq, coef->n_ineq); graph->lp = isl_basic_set_add_constraints_dim_map(graph->lp, coef, dim_map); if (!graph->lp) goto error; isl_space_free(dim); edge->end = graph->lp->n_ineq; return 0; error: isl_space_free(dim); return -1; } /* Add constraints to graph->lp that bound the dependence distance for the given * dependence from a node i to itself. * If s = 1, we add the constraint * * c_i_x (y - x) <= m_0 + m_n n * * or * * -c_i_x (y - x) + m_0 + m_n n >= 0 * * for each (x,y) in R. * If s = -1, we add the constraint * * -c_i_x (y - x) <= m_0 + m_n n * * or * * c_i_x (y - x) + m_0 + m_n n >= 0 * * for each (x,y) in R. * We obtain general constraints on coefficients (c_0, c_n, c_x) * of valid constraints for (y - x) and then plug in (m_0, m_n, -s * c_i_x), * with each coefficient (except m_0) represented as a pair of non-negative * coefficients. * * Actually, we do not construct constraints for the c_i_x themselves, * but for the coefficients of c_i_x written as a linear combination * of the columns in node->cmap. */ static int add_intra_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s) { unsigned total; unsigned nparam; isl_map *map = isl_map_copy(edge->map); isl_ctx *ctx = isl_map_get_ctx(map); isl_space *dim; isl_dim_map *dim_map; isl_basic_set *coef; struct isl_sched_node *node = edge->src; coef = intra_coefficients(graph, map); dim = isl_space_domain(isl_space_unwrap(isl_basic_set_get_space(coef))); coef = isl_basic_set_transform_dims(coef, isl_dim_set, isl_space_dim(dim, isl_dim_set), isl_mat_copy(node->cmap)); if (!coef) goto error; nparam = isl_space_dim(node->dim, isl_dim_param); total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); isl_dim_map_range(dim_map, 1, 0, 0, 0, 1, 1); isl_dim_map_range(dim_map, 4, 2, 1, 1, nparam, -1); isl_dim_map_range(dim_map, 5, 2, 1, 1, nparam, 1); isl_dim_map_range(dim_map, node->start + 2 * node->nparam + 1, 2, isl_space_dim(dim, isl_dim_set), 1, node->nvar, s); isl_dim_map_range(dim_map, node->start + 2 * node->nparam + 2, 2, isl_space_dim(dim, isl_dim_set), 1, node->nvar, -s); graph->lp = isl_basic_set_extend_constraints(graph->lp, coef->n_eq, coef->n_ineq); graph->lp = isl_basic_set_add_constraints_dim_map(graph->lp, coef, dim_map); isl_space_free(dim); return 0; error: isl_space_free(dim); return -1; } /* Add constraints to graph->lp that bound the dependence distance for the given * dependence from node i to node j. * If s = 1, we add the constraint * * (c_j_0 + c_j_n n + c_j_x y) - (c_i_0 + c_i_n n + c_i_x x) * <= m_0 + m_n n * * or * * -(c_j_0 + c_j_n n + c_j_x y) + (c_i_0 + c_i_n n + c_i_x x) + * m_0 + m_n n >= 0 * * for each (x,y) in R. * If s = -1, we add the constraint * * -((c_j_0 + c_j_n n + c_j_x y) - (c_i_0 + c_i_n n + c_i_x x)) * <= m_0 + m_n n * * or * * (c_j_0 + c_j_n n + c_j_x y) - (c_i_0 + c_i_n n + c_i_x x) + * m_0 + m_n n >= 0 * * for each (x,y) in R. * We obtain general constraints on coefficients (c_0, c_n, c_x, c_y) * of valid constraints for R and then plug in * (m_0 - s*c_j_0 + s*c_i_0, m_n - s*c_j_n + s*c_i_n, * -s*c_j_x+s*c_i_x) * with each coefficient (except m_0, c_j_0 and c_i_0) * represented as a pair of non-negative coefficients. * * Actually, we do not construct constraints for the c_*_x themselves, * but for the coefficients of c_*_x written as a linear combination * of the columns in node->cmap. */ static int add_inter_proximity_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, int s) { unsigned total; unsigned nparam; isl_map *map = isl_map_copy(edge->map); isl_ctx *ctx = isl_map_get_ctx(map); isl_space *dim; isl_dim_map *dim_map; isl_basic_set *coef; struct isl_sched_node *src = edge->src; struct isl_sched_node *dst = edge->dst; coef = inter_coefficients(graph, map); dim = isl_space_domain(isl_space_unwrap(isl_basic_set_get_space(coef))); coef = isl_basic_set_transform_dims(coef, isl_dim_set, isl_space_dim(dim, isl_dim_set), isl_mat_copy(src->cmap)); coef = isl_basic_set_transform_dims(coef, isl_dim_set, isl_space_dim(dim, isl_dim_set) + src->nvar, isl_mat_copy(dst->cmap)); if (!coef) goto error; nparam = isl_space_dim(src->dim, isl_dim_param); total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); isl_dim_map_range(dim_map, 1, 0, 0, 0, 1, 1); isl_dim_map_range(dim_map, 4, 2, 1, 1, nparam, -1); isl_dim_map_range(dim_map, 5, 2, 1, 1, nparam, 1); isl_dim_map_range(dim_map, dst->start, 0, 0, 0, 1, -s); isl_dim_map_range(dim_map, dst->start + 1, 2, 1, 1, dst->nparam, s); isl_dim_map_range(dim_map, dst->start + 2, 2, 1, 1, dst->nparam, -s); isl_dim_map_range(dim_map, dst->start + 2 * dst->nparam + 1, 2, isl_space_dim(dim, isl_dim_set) + src->nvar, 1, dst->nvar, s); isl_dim_map_range(dim_map, dst->start + 2 * dst->nparam + 2, 2, isl_space_dim(dim, isl_dim_set) + src->nvar, 1, dst->nvar, -s); isl_dim_map_range(dim_map, src->start, 0, 0, 0, 1, s); isl_dim_map_range(dim_map, src->start + 1, 2, 1, 1, src->nparam, -s); isl_dim_map_range(dim_map, src->start + 2, 2, 1, 1, src->nparam, s); isl_dim_map_range(dim_map, src->start + 2 * src->nparam + 1, 2, isl_space_dim(dim, isl_dim_set), 1, src->nvar, -s); isl_dim_map_range(dim_map, src->start + 2 * src->nparam + 2, 2, isl_space_dim(dim, isl_dim_set), 1, src->nvar, s); graph->lp = isl_basic_set_extend_constraints(graph->lp, coef->n_eq, coef->n_ineq); graph->lp = isl_basic_set_add_constraints_dim_map(graph->lp, coef, dim_map); isl_space_free(dim); return 0; error: isl_space_free(dim); return -1; } static int add_all_validity_constraints(struct isl_sched_graph *graph) { int i; for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge= &graph->edge[i]; if (!edge->validity) continue; if (edge->src != edge->dst) continue; if (add_intra_validity_constraints(graph, edge) < 0) return -1; } for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge = &graph->edge[i]; if (!edge->validity) continue; if (edge->src == edge->dst) continue; if (add_inter_validity_constraints(graph, edge) < 0) return -1; } return 0; } /* Add constraints to graph->lp that bound the dependence distance * for all dependence relations. * If a given proximity dependence is identical to a validity * dependence, then the dependence distance is already bounded * from below (by zero), so we only need to bound the distance * from above. * Otherwise, we need to bound the distance both from above and from below. */ static int add_all_proximity_constraints(struct isl_sched_graph *graph) { int i; for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge= &graph->edge[i]; if (!edge->proximity) continue; if (edge->src == edge->dst && add_intra_proximity_constraints(graph, edge, 1) < 0) return -1; if (edge->src != edge->dst && add_inter_proximity_constraints(graph, edge, 1) < 0) return -1; if (edge->validity) continue; if (edge->src == edge->dst && add_intra_proximity_constraints(graph, edge, -1) < 0) return -1; if (edge->src != edge->dst && add_inter_proximity_constraints(graph, edge, -1) < 0) return -1; } return 0; } /* Compute a basis for the rows in the linear part of the schedule * and extend this basis to a full basis. The remaining rows * can then be used to force linear independence from the rows * in the schedule. * * In particular, given the schedule rows S, we compute * * S = H Q * * with H the Hermite normal form of S. That is, all but the * first rank columns of Q are zero and so each row in S is * a linear combination of the first rank rows of Q. * The matrix Q is then transposed because we will write the * coefficients of the next schedule row as a column vector s * and express this s as a linear combination s = Q c of the * computed basis. */ static int node_update_cmap(struct isl_sched_node *node) { isl_mat *H, *Q; int n_row = isl_mat_rows(node->sched); H = isl_mat_sub_alloc(node->sched, 0, n_row, 1 + node->nparam, node->nvar); H = isl_mat_left_hermite(H, 0, NULL, &Q); isl_mat_free(node->cmap); node->cmap = isl_mat_transpose(Q); node->rank = isl_mat_initial_non_zero_cols(H); isl_mat_free(H); if (!node->cmap || node->rank < 0) return -1; return 0; } /* Count the number of equality and inequality constraints * that will be added for the given map. * If carry is set, then we are counting the number of (validity) * constraints that will be added in setup_carry_lp and we count * each edge exactly once. Otherwise, we count as follows * validity -> 1 (>= 0) * validity+proximity -> 2 (>= 0 and upper bound) * proximity -> 2 (lower and upper bound) */ static int count_map_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int *n_eq, int *n_ineq, int carry) { isl_basic_set *coef; int f = carry ? 1 : edge->proximity ? 2 : 1; if (carry && !edge->validity) { isl_map_free(map); return 0; } if (edge->src == edge->dst) coef = intra_coefficients(graph, map); else coef = inter_coefficients(graph, map); if (!coef) return -1; *n_eq += f * coef->n_eq; *n_ineq += f * coef->n_ineq; isl_basic_set_free(coef); return 0; } /* Count the number of equality and inequality constraints * that will be added to the main lp problem. * We count as follows * validity -> 1 (>= 0) * validity+proximity -> 2 (>= 0 and upper bound) * proximity -> 2 (lower and upper bound) */ static int count_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) { int i; *n_eq = *n_ineq = 0; for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge= &graph->edge[i]; isl_map *map = isl_map_copy(edge->map); if (count_map_constraints(graph, edge, map, n_eq, n_ineq, 0) < 0) return -1; } return 0; } /* Add constraints that bound the values of the variable and parameter * coefficients of the schedule. * * The maximal value of the coefficients is defined by the option * 'schedule_max_coefficient'. */ static int add_bound_coefficient_constraints(isl_ctx *ctx, struct isl_sched_graph *graph) { int i, j, k; int max_coefficient; int total; max_coefficient = ctx->opt->schedule_max_coefficient; if (max_coefficient == -1) return 0; total = isl_basic_set_total_dim(graph->lp); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; for (j = 0; j < 2 * node->nparam + 2 * node->nvar; ++j) { int dim; k = isl_basic_set_alloc_inequality(graph->lp); if (k < 0) return -1; dim = 1 + node->start + 1 + j; isl_seq_clr(graph->lp->ineq[k], 1 + total); isl_int_set_si(graph->lp->ineq[k][dim], -1); isl_int_set_si(graph->lp->ineq[k][0], max_coefficient); } } return 0; } /* Construct an ILP problem for finding schedule coefficients * that result in non-negative, but small dependence distances * over all dependences. * In particular, the dependence distances over proximity edges * are bounded by m_0 + m_n n and we compute schedule coefficients * with small values (preferably zero) of m_n and m_0. * * All variables of the ILP are non-negative. The actual coefficients * may be negative, so each coefficient is represented as the difference * of two non-negative variables. The negative part always appears * immediately before the positive part. * Other than that, the variables have the following order * * - sum of positive and negative parts of m_n coefficients * - m_0 * - sum of positive and negative parts of all c_n coefficients * (unconstrained when computing non-parametric schedules) * - sum of positive and negative parts of all c_x coefficients * - positive and negative parts of m_n coefficients * - for each node * - c_i_0 * - positive and negative parts of c_i_n (if parametric) * - positive and negative parts of c_i_x * * The c_i_x are not represented directly, but through the columns of * node->cmap. That is, the computed values are for variable t_i_x * such that c_i_x = Q t_i_x with Q equal to node->cmap. * * The constraints are those from the edges plus two or three equalities * to express the sums. * * If force_zero is set, then we add equalities to ensure that * the sum of the m_n coefficients and m_0 are both zero. */ static int setup_lp(isl_ctx *ctx, struct isl_sched_graph *graph, int force_zero) { int i, j; int k; unsigned nparam; unsigned total; isl_space *dim; int parametric; int param_pos; int n_eq, n_ineq; int max_constant_term; int max_coefficient; max_constant_term = ctx->opt->schedule_max_constant_term; max_coefficient = ctx->opt->schedule_max_coefficient; parametric = ctx->opt->schedule_parametric; nparam = isl_space_dim(graph->node[0].dim, isl_dim_param); param_pos = 4; total = param_pos + 2 * nparam; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[graph->sorted[i]]; if (node_update_cmap(node) < 0) return -1; node->start = total; total += 1 + 2 * (node->nparam + node->nvar); } if (count_constraints(graph, &n_eq, &n_ineq) < 0) return -1; dim = isl_space_set_alloc(ctx, 0, total); isl_basic_set_free(graph->lp); n_eq += 2 + parametric + force_zero; if (max_constant_term != -1) n_ineq += graph->n; if (max_coefficient != -1) for (i = 0; i < graph->n; ++i) n_ineq += 2 * graph->node[i].nparam + 2 * graph->node[i].nvar; graph->lp = isl_basic_set_alloc_space(dim, 0, n_eq, n_ineq); k = isl_basic_set_alloc_equality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->eq[k], 1 + total); if (!force_zero) isl_int_set_si(graph->lp->eq[k][1], -1); for (i = 0; i < 2 * nparam; ++i) isl_int_set_si(graph->lp->eq[k][1 + param_pos + i], 1); if (force_zero) { k = isl_basic_set_alloc_equality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->eq[k], 1 + total); isl_int_set_si(graph->lp->eq[k][2], -1); } if (parametric) { k = isl_basic_set_alloc_equality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->eq[k], 1 + total); isl_int_set_si(graph->lp->eq[k][3], -1); for (i = 0; i < graph->n; ++i) { int pos = 1 + graph->node[i].start + 1; for (j = 0; j < 2 * graph->node[i].nparam; ++j) isl_int_set_si(graph->lp->eq[k][pos + j], 1); } } k = isl_basic_set_alloc_equality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->eq[k], 1 + total); isl_int_set_si(graph->lp->eq[k][4], -1); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int pos = 1 + node->start + 1 + 2 * node->nparam; for (j = 0; j < 2 * node->nvar; ++j) isl_int_set_si(graph->lp->eq[k][pos + j], 1); } if (max_constant_term != -1) for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; k = isl_basic_set_alloc_inequality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->ineq[k], 1 + total); isl_int_set_si(graph->lp->ineq[k][1 + node->start], -1); isl_int_set_si(graph->lp->ineq[k][0], max_constant_term); } if (add_bound_coefficient_constraints(ctx, graph) < 0) return -1; if (add_all_validity_constraints(graph) < 0) return -1; if (add_all_proximity_constraints(graph) < 0) return -1; return 0; } /* Analyze the conflicting constraint found by * isl_tab_basic_set_non_trivial_lexmin. If it corresponds to the validity * constraint of one of the edges between distinct nodes, living, moreover * in distinct SCCs, then record the source and sink SCC as this may * be a good place to cut between SCCs. */ static int check_conflict(int con, void *user) { int i; struct isl_sched_graph *graph = user; if (graph->src_scc >= 0) return 0; con -= graph->lp->n_eq; if (con >= graph->lp->n_ineq) return 0; for (i = 0; i < graph->n_edge; ++i) { if (!graph->edge[i].validity) continue; if (graph->edge[i].src == graph->edge[i].dst) continue; if (graph->edge[i].src->scc == graph->edge[i].dst->scc) continue; if (graph->edge[i].start > con) continue; if (graph->edge[i].end <= con) continue; graph->src_scc = graph->edge[i].src->scc; graph->dst_scc = graph->edge[i].dst->scc; } return 0; } /* Check whether the next schedule row of the given node needs to be * non-trivial. Lower-dimensional domains may have some trivial rows, * but as soon as the number of remaining required non-trivial rows * is as large as the number or remaining rows to be computed, * all remaining rows need to be non-trivial. */ static int needs_row(struct isl_sched_graph *graph, struct isl_sched_node *node) { return node->nvar - node->rank >= graph->maxvar - graph->n_row; } /* Solve the ILP problem constructed in setup_lp. * For each node such that all the remaining rows of its schedule * need to be non-trivial, we construct a non-triviality region. * This region imposes that the next row is independent of previous rows. * In particular the coefficients c_i_x are represented by t_i_x * variables with c_i_x = Q t_i_x and Q a unimodular matrix such that * its first columns span the rows of the previously computed part * of the schedule. The non-triviality region enforces that at least * one of the remaining components of t_i_x is non-zero, i.e., * that the new schedule row depends on at least one of the remaining * columns of Q. */ static __isl_give isl_vec *solve_lp(struct isl_sched_graph *graph) { int i; isl_vec *sol; isl_basic_set *lp; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int skip = node->rank; graph->region[i].pos = node->start + 1 + 2*(node->nparam+skip); if (needs_row(graph, node)) graph->region[i].len = 2 * (node->nvar - skip); else graph->region[i].len = 0; } lp = isl_basic_set_copy(graph->lp); sol = isl_tab_basic_set_non_trivial_lexmin(lp, 2, graph->n, graph->region, &check_conflict, graph); return sol; } /* Update the schedules of all nodes based on the given solution * of the LP problem. * The new row is added to the current band. * All possibly negative coefficients are encoded as a difference * of two non-negative variables, so we need to perform the subtraction * here. Moreover, if use_cmap is set, then the solution does * not refer to the actual coefficients c_i_x, but instead to variables * t_i_x such that c_i_x = Q t_i_x and Q is equal to node->cmap. * In this case, we then also need to perform this multiplication * to obtain the values of c_i_x. * * If check_zero is set, then the first two coordinates of sol are * assumed to correspond to the dependence distance. If these two * coordinates are zero, then the corresponding scheduling dimension * is marked as being zero distance. */ static int update_schedule(struct isl_sched_graph *graph, __isl_take isl_vec *sol, int use_cmap, int check_zero) { int i, j; int zero = 0; isl_vec *csol = NULL; if (!sol) goto error; if (sol->size == 0) isl_die(sol->ctx, isl_error_internal, "no solution found", goto error); if (graph->n_total_row >= graph->max_row) isl_die(sol->ctx, isl_error_internal, "too many schedule rows", goto error); if (check_zero) zero = isl_int_is_zero(sol->el[1]) && isl_int_is_zero(sol->el[2]); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int pos = node->start; int row = isl_mat_rows(node->sched); isl_vec_free(csol); csol = isl_vec_alloc(sol->ctx, node->nvar); if (!csol) goto error; isl_map_free(node->sched_map); node->sched_map = NULL; node->sched = isl_mat_add_rows(node->sched, 1); if (!node->sched) goto error; node->sched = isl_mat_set_element(node->sched, row, 0, sol->el[1 + pos]); for (j = 0; j < node->nparam + node->nvar; ++j) isl_int_sub(sol->el[1 + pos + 1 + 2 * j + 1], sol->el[1 + pos + 1 + 2 * j + 1], sol->el[1 + pos + 1 + 2 * j]); for (j = 0; j < node->nparam; ++j) node->sched = isl_mat_set_element(node->sched, row, 1 + j, sol->el[1+pos+1+2*j+1]); for (j = 0; j < node->nvar; ++j) isl_int_set(csol->el[j], sol->el[1+pos+1+2*(node->nparam+j)+1]); if (use_cmap) csol = isl_mat_vec_product(isl_mat_copy(node->cmap), csol); if (!csol) goto error; for (j = 0; j < node->nvar; ++j) node->sched = isl_mat_set_element(node->sched, row, 1 + node->nparam + j, csol->el[j]); node->band[graph->n_total_row] = graph->n_band; node->zero[graph->n_total_row] = zero; } isl_vec_free(sol); isl_vec_free(csol); graph->n_row++; graph->n_total_row++; return 0; error: isl_vec_free(sol); isl_vec_free(csol); return -1; } /* Convert node->sched into a multi_aff and return this multi_aff. */ static __isl_give isl_multi_aff *node_extract_schedule_multi_aff( struct isl_sched_node *node) { int i, j; isl_space *space; isl_local_space *ls; isl_aff *aff; isl_multi_aff *ma; int nrow, ncol; isl_int v; nrow = isl_mat_rows(node->sched); ncol = isl_mat_cols(node->sched) - 1; space = isl_space_from_domain(isl_space_copy(node->dim)); space = isl_space_add_dims(space, isl_dim_out, nrow); ma = isl_multi_aff_zero(space); ls = isl_local_space_from_space(isl_space_copy(node->dim)); isl_int_init(v); for (i = 0; i < nrow; ++i) { aff = isl_aff_zero_on_domain(isl_local_space_copy(ls)); isl_mat_get_element(node->sched, i, 0, &v); aff = isl_aff_set_constant(aff, v); for (j = 0; j < node->nparam; ++j) { isl_mat_get_element(node->sched, i, 1 + j, &v); aff = isl_aff_set_coefficient(aff, isl_dim_param, j, v); } for (j = 0; j < node->nvar; ++j) { isl_mat_get_element(node->sched, i, 1 + node->nparam + j, &v); aff = isl_aff_set_coefficient(aff, isl_dim_in, j, v); } ma = isl_multi_aff_set_aff(ma, i, aff); } isl_int_clear(v); isl_local_space_free(ls); return ma; } /* Convert node->sched into a map and return this map. * * The result is cached in node->sched_map, which needs to be released * whenever node->sched is updated. */ static __isl_give isl_map *node_extract_schedule(struct isl_sched_node *node) { if (!node->sched_map) { isl_multi_aff *ma; ma = node_extract_schedule_multi_aff(node); node->sched_map = isl_map_from_multi_aff(ma); } return isl_map_copy(node->sched_map); } /* Update the given dependence relation based on the current schedule. * That is, intersect the dependence relation with a map expressing * that source and sink are executed within the same iteration of * the current schedule. * This is not the most efficient way, but this shouldn't be a critical * operation. */ static __isl_give isl_map *specialize(__isl_take isl_map *map, struct isl_sched_node *src, struct isl_sched_node *dst) { isl_map *src_sched, *dst_sched, *id; src_sched = node_extract_schedule(src); dst_sched = node_extract_schedule(dst); id = isl_map_apply_range(src_sched, isl_map_reverse(dst_sched)); return isl_map_intersect(map, id); } /* Update the dependence relations of all edges based on the current schedule. * If a dependence is carried completely by the current schedule, then * it is removed from the edge_tables. It is kept in the list of edges * as otherwise all edge_tables would have to be recomputed. */ static int update_edges(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; for (i = graph->n_edge - 1; i >= 0; --i) { struct isl_sched_edge *edge = &graph->edge[i]; edge->map = specialize(edge->map, edge->src, edge->dst); if (!edge->map) return -1; if (isl_map_plain_is_empty(edge->map)) graph_remove_edge(graph, edge); } return 0; } static void next_band(struct isl_sched_graph *graph) { graph->band_start = graph->n_total_row; graph->n_band++; } /* Topologically sort statements mapped to the same schedule iteration * and add a row to the schedule corresponding to this order. */ static int sort_statements(isl_ctx *ctx, struct isl_sched_graph *graph) { int i, j; if (graph->n <= 1) return 0; if (update_edges(ctx, graph) < 0) return -1; if (graph->n_edge == 0) return 0; if (detect_sccs(ctx, graph) < 0) return -1; if (graph->n_total_row >= graph->max_row) isl_die(ctx, isl_error_internal, "too many schedule rows", return -1); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int row = isl_mat_rows(node->sched); int cols = isl_mat_cols(node->sched); isl_map_free(node->sched_map); node->sched_map = NULL; node->sched = isl_mat_add_rows(node->sched, 1); if (!node->sched) return -1; node->sched = isl_mat_set_element_si(node->sched, row, 0, node->scc); for (j = 1; j < cols; ++j) node->sched = isl_mat_set_element_si(node->sched, row, j, 0); node->band[graph->n_total_row] = graph->n_band; } graph->n_total_row++; next_band(graph); return 0; } /* Construct an isl_schedule based on the computed schedule stored * in graph and with parameters specified by dim. */ static __isl_give isl_schedule *extract_schedule(struct isl_sched_graph *graph, __isl_take isl_space *dim) { int i; isl_ctx *ctx; isl_schedule *sched = NULL; if (!dim) return NULL; ctx = isl_space_get_ctx(dim); sched = isl_calloc(ctx, struct isl_schedule, sizeof(struct isl_schedule) + (graph->n - 1) * sizeof(struct isl_schedule_node)); if (!sched) goto error; sched->ref = 1; sched->n = graph->n; sched->n_band = graph->n_band; sched->n_total_row = graph->n_total_row; for (i = 0; i < sched->n; ++i) { int r, b; int *band_end, *band_id, *zero; sched->node[i].sched = node_extract_schedule_multi_aff(&graph->node[i]); if (!sched->node[i].sched) goto error; sched->node[i].n_band = graph->n_band; if (graph->n_band == 0) continue; band_end = isl_alloc_array(ctx, int, graph->n_band); band_id = isl_alloc_array(ctx, int, graph->n_band); zero = isl_alloc_array(ctx, int, graph->n_total_row); sched->node[i].band_end = band_end; sched->node[i].band_id = band_id; sched->node[i].zero = zero; if (!band_end || !band_id || !zero) goto error; for (r = 0; r < graph->n_total_row; ++r) zero[r] = graph->node[i].zero[r]; for (r = b = 0; r < graph->n_total_row; ++r) { if (graph->node[i].band[r] == b) continue; band_end[b++] = r; if (graph->node[i].band[r] == -1) break; } if (r == graph->n_total_row) band_end[b++] = r; sched->node[i].n_band = b; for (--b; b >= 0; --b) band_id[b] = graph->node[i].band_id[b]; } sched->dim = dim; return sched; error: isl_space_free(dim); isl_schedule_free(sched); return NULL; } /* Copy nodes that satisfy node_pred from the src dependence graph * to the dst dependence graph. */ static int copy_nodes(struct isl_sched_graph *dst, struct isl_sched_graph *src, int (*node_pred)(struct isl_sched_node *node, int data), int data) { int i; dst->n = 0; for (i = 0; i < src->n; ++i) { if (!node_pred(&src->node[i], data)) continue; dst->node[dst->n].dim = isl_space_copy(src->node[i].dim); dst->node[dst->n].nvar = src->node[i].nvar; dst->node[dst->n].nparam = src->node[i].nparam; dst->node[dst->n].sched = isl_mat_copy(src->node[i].sched); dst->node[dst->n].sched_map = isl_map_copy(src->node[i].sched_map); dst->node[dst->n].band = src->node[i].band; dst->node[dst->n].band_id = src->node[i].band_id; dst->node[dst->n].zero = src->node[i].zero; dst->n++; } return 0; } /* Copy non-empty edges that satisfy edge_pred from the src dependence graph * to the dst dependence graph. * If the source or destination node of the edge is not in the destination * graph, then it must be a backward proximity edge and it should simply * be ignored. */ static int copy_edges(isl_ctx *ctx, struct isl_sched_graph *dst, struct isl_sched_graph *src, int (*edge_pred)(struct isl_sched_edge *edge, int data), int data) { int i; enum isl_edge_type t; dst->n_edge = 0; for (i = 0; i < src->n_edge; ++i) { struct isl_sched_edge *edge = &src->edge[i]; isl_map *map; struct isl_sched_node *dst_src, *dst_dst; if (!edge_pred(edge, data)) continue; if (isl_map_plain_is_empty(edge->map)) continue; dst_src = graph_find_node(ctx, dst, edge->src->dim); dst_dst = graph_find_node(ctx, dst, edge->dst->dim); if (!dst_src || !dst_dst) { if (edge->validity) isl_die(ctx, isl_error_internal, "backward validity edge", return -1); continue; } map = isl_map_copy(edge->map); dst->edge[dst->n_edge].src = dst_src; dst->edge[dst->n_edge].dst = dst_dst; dst->edge[dst->n_edge].map = map; dst->edge[dst->n_edge].validity = edge->validity; dst->edge[dst->n_edge].proximity = edge->proximity; dst->n_edge++; for (t = isl_edge_first; t <= isl_edge_last; ++t) { if (edge != graph_find_edge(src, t, edge->src, edge->dst)) continue; if (graph_edge_table_add(ctx, dst, t, &dst->edge[dst->n_edge - 1]) < 0) return -1; } } return 0; } /* Given a "src" dependence graph that contains the nodes from "dst" * that satisfy node_pred, copy the schedule computed in "src" * for those nodes back to "dst". */ static int copy_schedule(struct isl_sched_graph *dst, struct isl_sched_graph *src, int (*node_pred)(struct isl_sched_node *node, int data), int data) { int i; src->n = 0; for (i = 0; i < dst->n; ++i) { if (!node_pred(&dst->node[i], data)) continue; isl_mat_free(dst->node[i].sched); isl_map_free(dst->node[i].sched_map); dst->node[i].sched = isl_mat_copy(src->node[src->n].sched); dst->node[i].sched_map = isl_map_copy(src->node[src->n].sched_map); src->n++; } dst->max_row = src->max_row; dst->n_total_row = src->n_total_row; dst->n_band = src->n_band; return 0; } /* Compute the maximal number of variables over all nodes. * This is the maximal number of linearly independent schedule * rows that we need to compute. * Just in case we end up in a part of the dependence graph * with only lower-dimensional domains, we make sure we will * compute the required amount of extra linearly independent rows. */ static int compute_maxvar(struct isl_sched_graph *graph) { int i; graph->maxvar = 0; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int nvar; if (node_update_cmap(node) < 0) return -1; nvar = node->nvar + graph->n_row - node->rank; if (nvar > graph->maxvar) graph->maxvar = nvar; } return 0; } static int compute_schedule(isl_ctx *ctx, struct isl_sched_graph *graph); static int compute_schedule_wcc(isl_ctx *ctx, struct isl_sched_graph *graph); /* Compute a schedule for a subgraph of "graph". In particular, for * the graph composed of nodes that satisfy node_pred and edges that * that satisfy edge_pred. The caller should precompute the number * of nodes and edges that satisfy these predicates and pass them along * as "n" and "n_edge". * If the subgraph is known to consist of a single component, then wcc should * be set and then we call compute_schedule_wcc on the constructed subgraph. * Otherwise, we call compute_schedule, which will check whether the subgraph * is connected. */ static int compute_sub_schedule(isl_ctx *ctx, struct isl_sched_graph *graph, int n, int n_edge, int (*node_pred)(struct isl_sched_node *node, int data), int (*edge_pred)(struct isl_sched_edge *edge, int data), int data, int wcc) { struct isl_sched_graph split = { 0 }; int t; if (graph_alloc(ctx, &split, n, n_edge) < 0) goto error; if (copy_nodes(&split, graph, node_pred, data) < 0) goto error; if (graph_init_table(ctx, &split) < 0) goto error; for (t = 0; t <= isl_edge_last; ++t) split.max_edge[t] = graph->max_edge[t]; if (graph_init_edge_tables(ctx, &split) < 0) goto error; if (copy_edges(ctx, &split, graph, edge_pred, data) < 0) goto error; split.n_row = graph->n_row; split.max_row = graph->max_row; split.n_total_row = graph->n_total_row; split.n_band = graph->n_band; split.band_start = graph->band_start; if (wcc && compute_schedule_wcc(ctx, &split) < 0) goto error; if (!wcc && compute_schedule(ctx, &split) < 0) goto error; copy_schedule(graph, &split, node_pred, data); graph_free(ctx, &split); return 0; error: graph_free(ctx, &split); return -1; } static int node_scc_exactly(struct isl_sched_node *node, int scc) { return node->scc == scc; } static int node_scc_at_most(struct isl_sched_node *node, int scc) { return node->scc <= scc; } static int node_scc_at_least(struct isl_sched_node *node, int scc) { return node->scc >= scc; } static int edge_scc_exactly(struct isl_sched_edge *edge, int scc) { return edge->src->scc == scc && edge->dst->scc == scc; } static int edge_dst_scc_at_most(struct isl_sched_edge *edge, int scc) { return edge->dst->scc <= scc; } static int edge_src_scc_at_least(struct isl_sched_edge *edge, int scc) { return edge->src->scc >= scc; } /* Pad the schedules of all nodes with zero rows such that in the end * they all have graph->n_total_row rows. * The extra rows don't belong to any band, so they get assigned band number -1. */ static int pad_schedule(struct isl_sched_graph *graph) { int i, j; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int row = isl_mat_rows(node->sched); if (graph->n_total_row > row) { isl_map_free(node->sched_map); node->sched_map = NULL; } node->sched = isl_mat_add_zero_rows(node->sched, graph->n_total_row - row); if (!node->sched) return -1; for (j = row; j < graph->n_total_row; ++j) node->band[j] = -1; } return 0; } /* Split the current graph into two parts and compute a schedule for each * part individually. In particular, one part consists of all SCCs up * to and including graph->src_scc, while the other part contains the other * SCCS. * * The split is enforced in the schedule by constant rows with two different * values (0 and 1). These constant rows replace the previously computed rows * in the current band. * It would be possible to reuse them as the first rows in the next * band, but recomputing them may result in better rows as we are looking * at a smaller part of the dependence graph. * compute_split_schedule is only called when no zero-distance schedule row * could be found on the entire graph, so we wark the splitting row as * non zero-distance. * * The band_id of the second group is set to n, where n is the number * of nodes in the first group. This ensures that the band_ids over * the two groups remain disjoint, even if either or both of the two * groups contain independent components. */ static int compute_split_schedule(isl_ctx *ctx, struct isl_sched_graph *graph) { int i, j, n, e1, e2; int n_total_row, orig_total_row; int n_band, orig_band; int drop; if (graph->n_total_row >= graph->max_row) isl_die(ctx, isl_error_internal, "too many schedule rows", return -1); drop = graph->n_total_row - graph->band_start; graph->n_total_row -= drop; graph->n_row -= drop; n = 0; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int row = isl_mat_rows(node->sched) - drop; int cols = isl_mat_cols(node->sched); int before = node->scc <= graph->src_scc; if (before) n++; isl_map_free(node->sched_map); node->sched_map = NULL; node->sched = isl_mat_drop_rows(node->sched, graph->band_start, drop); node->sched = isl_mat_add_rows(node->sched, 1); if (!node->sched) return -1; node->sched = isl_mat_set_element_si(node->sched, row, 0, !before); for (j = 1; j < cols; ++j) node->sched = isl_mat_set_element_si(node->sched, row, j, 0); node->band[graph->n_total_row] = graph->n_band; node->zero[graph->n_total_row] = 0; } e1 = e2 = 0; for (i = 0; i < graph->n_edge; ++i) { if (graph->edge[i].dst->scc <= graph->src_scc) e1++; if (graph->edge[i].src->scc > graph->src_scc) e2++; } graph->n_total_row++; next_band(graph); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; if (node->scc > graph->src_scc) node->band_id[graph->n_band] = n; } orig_total_row = graph->n_total_row; orig_band = graph->n_band; if (compute_sub_schedule(ctx, graph, n, e1, &node_scc_at_most, &edge_dst_scc_at_most, graph->src_scc, 0) < 0) return -1; n_total_row = graph->n_total_row; graph->n_total_row = orig_total_row; n_band = graph->n_band; graph->n_band = orig_band; if (compute_sub_schedule(ctx, graph, graph->n - n, e2, &node_scc_at_least, &edge_src_scc_at_least, graph->src_scc + 1, 0) < 0) return -1; if (n_total_row > graph->n_total_row) graph->n_total_row = n_total_row; if (n_band > graph->n_band) graph->n_band = n_band; return pad_schedule(graph); } /* Compute the next band of the schedule after updating the dependence * relations based on the the current schedule. */ static int compute_next_band(isl_ctx *ctx, struct isl_sched_graph *graph) { if (update_edges(ctx, graph) < 0) return -1; next_band(graph); return compute_schedule(ctx, graph); } /* Add constraints to graph->lp that force the dependence "map" (which * is part of the dependence relation of "edge") * to be respected and attempt to carry it, where the edge is one from * a node j to itself. "pos" is the sequence number of the given map. * That is, add constraints that enforce * * (c_j_0 + c_j_n n + c_j_x y) - (c_j_0 + c_j_n n + c_j_x x) * = c_j_x (y - x) >= e_i * * for each (x,y) in R. * We obtain general constraints on coefficients (c_0, c_n, c_x) * of valid constraints for (y - x) and then plug in (-e_i, 0, c_j_x), * with each coefficient in c_j_x represented as a pair of non-negative * coefficients. */ static int add_intra_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int pos) { unsigned total; isl_ctx *ctx = isl_map_get_ctx(map); isl_space *dim; isl_dim_map *dim_map; isl_basic_set *coef; struct isl_sched_node *node = edge->src; coef = intra_coefficients(graph, map); if (!coef) return -1; dim = isl_space_domain(isl_space_unwrap(isl_basic_set_get_space(coef))); total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); isl_dim_map_range(dim_map, 3 + pos, 0, 0, 0, 1, -1); isl_dim_map_range(dim_map, node->start + 2 * node->nparam + 1, 2, isl_space_dim(dim, isl_dim_set), 1, node->nvar, -1); isl_dim_map_range(dim_map, node->start + 2 * node->nparam + 2, 2, isl_space_dim(dim, isl_dim_set), 1, node->nvar, 1); graph->lp = isl_basic_set_extend_constraints(graph->lp, coef->n_eq, coef->n_ineq); graph->lp = isl_basic_set_add_constraints_dim_map(graph->lp, coef, dim_map); isl_space_free(dim); return 0; } /* Add constraints to graph->lp that force the dependence "map" (which * is part of the dependence relation of "edge") * to be respected and attempt to carry it, where the edge is one from * node j to node k. "pos" is the sequence number of the given map. * That is, add constraints that enforce * * (c_k_0 + c_k_n n + c_k_x y) - (c_j_0 + c_j_n n + c_j_x x) >= e_i * * for each (x,y) in R. * We obtain general constraints on coefficients (c_0, c_n, c_x) * of valid constraints for R and then plug in * (-e_i + c_k_0 - c_j_0, c_k_n - c_j_n, c_k_x - c_j_x) * with each coefficient (except e_i, c_k_0 and c_j_0) * represented as a pair of non-negative coefficients. */ static int add_inter_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int pos) { unsigned total; isl_ctx *ctx = isl_map_get_ctx(map); isl_space *dim; isl_dim_map *dim_map; isl_basic_set *coef; struct isl_sched_node *src = edge->src; struct isl_sched_node *dst = edge->dst; coef = inter_coefficients(graph, map); if (!coef) return -1; dim = isl_space_domain(isl_space_unwrap(isl_basic_set_get_space(coef))); total = isl_basic_set_total_dim(graph->lp); dim_map = isl_dim_map_alloc(ctx, total); isl_dim_map_range(dim_map, 3 + pos, 0, 0, 0, 1, -1); isl_dim_map_range(dim_map, dst->start, 0, 0, 0, 1, 1); isl_dim_map_range(dim_map, dst->start + 1, 2, 1, 1, dst->nparam, -1); isl_dim_map_range(dim_map, dst->start + 2, 2, 1, 1, dst->nparam, 1); isl_dim_map_range(dim_map, dst->start + 2 * dst->nparam + 1, 2, isl_space_dim(dim, isl_dim_set) + src->nvar, 1, dst->nvar, -1); isl_dim_map_range(dim_map, dst->start + 2 * dst->nparam + 2, 2, isl_space_dim(dim, isl_dim_set) + src->nvar, 1, dst->nvar, 1); isl_dim_map_range(dim_map, src->start, 0, 0, 0, 1, -1); isl_dim_map_range(dim_map, src->start + 1, 2, 1, 1, src->nparam, 1); isl_dim_map_range(dim_map, src->start + 2, 2, 1, 1, src->nparam, -1); isl_dim_map_range(dim_map, src->start + 2 * src->nparam + 1, 2, isl_space_dim(dim, isl_dim_set), 1, src->nvar, 1); isl_dim_map_range(dim_map, src->start + 2 * src->nparam + 2, 2, isl_space_dim(dim, isl_dim_set), 1, src->nvar, -1); graph->lp = isl_basic_set_extend_constraints(graph->lp, coef->n_eq, coef->n_ineq); graph->lp = isl_basic_set_add_constraints_dim_map(graph->lp, coef, dim_map); isl_space_free(dim); return 0; } /* Add constraints to graph->lp that force all validity dependences * to be respected and attempt to carry them. */ static int add_all_constraints(struct isl_sched_graph *graph) { int i, j; int pos; pos = 0; for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge= &graph->edge[i]; if (!edge->validity) continue; for (j = 0; j < edge->map->n; ++j) { isl_basic_map *bmap; isl_map *map; bmap = isl_basic_map_copy(edge->map->p[j]); map = isl_map_from_basic_map(bmap); if (edge->src == edge->dst && add_intra_constraints(graph, edge, map, pos) < 0) return -1; if (edge->src != edge->dst && add_inter_constraints(graph, edge, map, pos) < 0) return -1; ++pos; } } return 0; } /* Count the number of equality and inequality constraints * that will be added to the carry_lp problem. * We count each edge exactly once. */ static int count_all_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) { int i, j; *n_eq = *n_ineq = 0; for (i = 0; i < graph->n_edge; ++i) { struct isl_sched_edge *edge= &graph->edge[i]; for (j = 0; j < edge->map->n; ++j) { isl_basic_map *bmap; isl_map *map; bmap = isl_basic_map_copy(edge->map->p[j]); map = isl_map_from_basic_map(bmap); if (count_map_constraints(graph, edge, map, n_eq, n_ineq, 1) < 0) return -1; } } return 0; } /* Construct an LP problem for finding schedule coefficients * such that the schedule carries as many dependences as possible. * In particular, for each dependence i, we bound the dependence distance * from below by e_i, with 0 <= e_i <= 1 and then maximize the sum * of all e_i's. Dependence with e_i = 0 in the solution are simply * respected, while those with e_i > 0 (in practice e_i = 1) are carried. * Note that if the dependence relation is a union of basic maps, * then we have to consider each basic map individually as it may only * be possible to carry the dependences expressed by some of those * basic maps and not all off them. * Below, we consider each of those basic maps as a separate "edge". * * All variables of the LP are non-negative. The actual coefficients * may be negative, so each coefficient is represented as the difference * of two non-negative variables. The negative part always appears * immediately before the positive part. * Other than that, the variables have the following order * * - sum of (1 - e_i) over all edges * - sum of positive and negative parts of all c_n coefficients * (unconstrained when computing non-parametric schedules) * - sum of positive and negative parts of all c_x coefficients * - for each edge * - e_i * - for each node * - c_i_0 * - positive and negative parts of c_i_n (if parametric) * - positive and negative parts of c_i_x * * The constraints are those from the (validity) edges plus three equalities * to express the sums and n_edge inequalities to express e_i <= 1. */ static int setup_carry_lp(isl_ctx *ctx, struct isl_sched_graph *graph) { int i, j; int k; isl_space *dim; unsigned total; int n_eq, n_ineq; int n_edge; n_edge = 0; for (i = 0; i < graph->n_edge; ++i) n_edge += graph->edge[i].map->n; total = 3 + n_edge; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[graph->sorted[i]]; node->start = total; total += 1 + 2 * (node->nparam + node->nvar); } if (count_all_constraints(graph, &n_eq, &n_ineq) < 0) return -1; dim = isl_space_set_alloc(ctx, 0, total); isl_basic_set_free(graph->lp); n_eq += 3; n_ineq += n_edge; graph->lp = isl_basic_set_alloc_space(dim, 0, n_eq, n_ineq); graph->lp = isl_basic_set_set_rational(graph->lp); k = isl_basic_set_alloc_equality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->eq[k], 1 + total); isl_int_set_si(graph->lp->eq[k][0], -n_edge); isl_int_set_si(graph->lp->eq[k][1], 1); for (i = 0; i < n_edge; ++i) isl_int_set_si(graph->lp->eq[k][4 + i], 1); k = isl_basic_set_alloc_equality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->eq[k], 1 + total); isl_int_set_si(graph->lp->eq[k][2], -1); for (i = 0; i < graph->n; ++i) { int pos = 1 + graph->node[i].start + 1; for (j = 0; j < 2 * graph->node[i].nparam; ++j) isl_int_set_si(graph->lp->eq[k][pos + j], 1); } k = isl_basic_set_alloc_equality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->eq[k], 1 + total); isl_int_set_si(graph->lp->eq[k][3], -1); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int pos = 1 + node->start + 1 + 2 * node->nparam; for (j = 0; j < 2 * node->nvar; ++j) isl_int_set_si(graph->lp->eq[k][pos + j], 1); } for (i = 0; i < n_edge; ++i) { k = isl_basic_set_alloc_inequality(graph->lp); if (k < 0) return -1; isl_seq_clr(graph->lp->ineq[k], 1 + total); isl_int_set_si(graph->lp->ineq[k][4 + i], -1); isl_int_set_si(graph->lp->ineq[k][0], 1); } if (add_all_constraints(graph) < 0) return -1; return 0; } /* If the schedule_split_scaled option is set and if the linear * parts of the scheduling rows for all nodes in the graphs have * non-trivial common divisor, then split off the constant term * from the linear part. * The constant term is then placed in a separate band and * the linear part is reduced. */ static int split_scaled(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; int row; isl_int gcd, gcd_i; if (!ctx->opt->schedule_split_scaled) return 0; if (graph->n <= 1) return 0; if (graph->n_total_row >= graph->max_row) isl_die(ctx, isl_error_internal, "too many schedule rows", return -1); isl_int_init(gcd); isl_int_init(gcd_i); isl_int_set_si(gcd, 0); row = isl_mat_rows(graph->node[0].sched) - 1; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int cols = isl_mat_cols(node->sched); isl_seq_gcd(node->sched->row[row] + 1, cols - 1, &gcd_i); isl_int_gcd(gcd, gcd, gcd_i); } isl_int_clear(gcd_i); if (isl_int_cmp_si(gcd, 1) <= 0) { isl_int_clear(gcd); return 0; } next_band(graph); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; isl_map_free(node->sched_map); node->sched_map = NULL; node->sched = isl_mat_add_zero_rows(node->sched, 1); if (!node->sched) goto error; isl_int_fdiv_r(node->sched->row[row + 1][0], node->sched->row[row][0], gcd); isl_int_fdiv_q(node->sched->row[row][0], node->sched->row[row][0], gcd); isl_int_mul(node->sched->row[row][0], node->sched->row[row][0], gcd); node->sched = isl_mat_scale_down_row(node->sched, row, gcd); if (!node->sched) goto error; node->band[graph->n_total_row] = graph->n_band; } graph->n_total_row++; isl_int_clear(gcd); return 0; error: isl_int_clear(gcd); return -1; } static int compute_component_schedule(isl_ctx *ctx, struct isl_sched_graph *graph); /* Is the schedule row "sol" trivial on node "node"? * That is, is the solution zero on the dimensions orthogonal to * the previously found solutions? * Each coefficient is represented as the difference between * two non-negative values in "sol". The coefficient is then * zero if those two values are equal to each other. */ static int is_trivial(struct isl_sched_node *node, __isl_keep isl_vec *sol) { int i; int pos; int len; pos = 1 + node->start + 1 + 2 * (node->nparam + node->rank); len = 2 * (node->nvar - node->rank); if (len == 0) return 0; for (i = 0; i < len; i += 2) if (isl_int_ne(sol->el[pos + i], sol->el[pos + i + 1])) return 0; return 1; } /* Is the schedule row "sol" trivial on any node where it should * not be trivial? */ static int is_any_trivial(struct isl_sched_graph *graph, __isl_keep isl_vec *sol) { int i; for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; if (!needs_row(graph, node)) continue; if (is_trivial(node, sol)) return 1; } return 0; } /* Construct a schedule row for each node such that as many dependences * as possible are carried and then continue with the next band. * * If the computed schedule row turns out to be trivial on one or * more nodes where it should not be trivial, then we throw it away * and try again on each component separately. */ static int carry_dependences(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; int n_edge; isl_vec *sol; isl_basic_set *lp; n_edge = 0; for (i = 0; i < graph->n_edge; ++i) n_edge += graph->edge[i].map->n; if (setup_carry_lp(ctx, graph) < 0) return -1; lp = isl_basic_set_copy(graph->lp); sol = isl_tab_basic_set_non_neg_lexmin(lp); if (!sol) return -1; if (sol->size == 0) { isl_vec_free(sol); isl_die(ctx, isl_error_internal, "error in schedule construction", return -1); } isl_int_divexact(sol->el[1], sol->el[1], sol->el[0]); if (isl_int_cmp_si(sol->el[1], n_edge) >= 0) { isl_vec_free(sol); isl_die(ctx, isl_error_unknown, "unable to carry dependences", return -1); } if (is_any_trivial(graph, sol)) { isl_vec_free(sol); if (graph->scc > 1) return compute_component_schedule(ctx, graph); isl_die(ctx, isl_error_unknown, "unable to construct non-trivial solution", return -1); } if (update_schedule(graph, sol, 0, 0) < 0) return -1; if (split_scaled(ctx, graph) < 0) return -1; return compute_next_band(ctx, graph); } /* Are there any (non-empty) validity edges in the graph? */ static int has_validity_edges(struct isl_sched_graph *graph) { int i; for (i = 0; i < graph->n_edge; ++i) { int empty; empty = isl_map_plain_is_empty(graph->edge[i].map); if (empty < 0) return -1; if (empty) continue; if (graph->edge[i].validity) return 1; } return 0; } /* Should we apply a Feautrier step? * That is, did the user request the Feautrier algorithm and are * there any validity dependences (left)? */ static int need_feautrier_step(isl_ctx *ctx, struct isl_sched_graph *graph) { if (ctx->opt->schedule_algorithm != ISL_SCHEDULE_ALGORITHM_FEAUTRIER) return 0; return has_validity_edges(graph); } /* Compute a schedule for a connected dependence graph using Feautrier's * multi-dimensional scheduling algorithm. * The original algorithm is described in [1]. * The main idea is to minimize the number of scheduling dimensions, by * trying to satisfy as many dependences as possible per scheduling dimension. * * [1] P. Feautrier, Some Efficient Solutions to the Affine Scheduling * Problem, Part II: Multi-Dimensional Time. * In Intl. Journal of Parallel Programming, 1992. */ static int compute_schedule_wcc_feautrier(isl_ctx *ctx, struct isl_sched_graph *graph) { return carry_dependences(ctx, graph); } /* Compute a schedule for a connected dependence graph. * We try to find a sequence of as many schedule rows as possible that result * in non-negative dependence distances (independent of the previous rows * in the sequence, i.e., such that the sequence is tilable). * If we can't find any more rows we either * - split between SCCs and start over (assuming we found an interesting * pair of SCCs between which to split) * - continue with the next band (assuming the current band has at least * one row) * - try to carry as many dependences as possible and continue with the next * band * * If Feautrier's algorithm is selected, we first recursively try to satisfy * as many validity dependences as possible. When all validity dependences * are satisfied we extend the schedule to a full-dimensional schedule. * * If we manage to complete the schedule, we finish off by topologically * sorting the statements based on the remaining dependences. * * If ctx->opt->schedule_outer_zero_distance is set, then we force the * outermost dimension in the current band to be zero distance. If this * turns out to be impossible, we fall back on the general scheme above * and try to carry as many dependences as possible. */ static int compute_schedule_wcc(isl_ctx *ctx, struct isl_sched_graph *graph) { int force_zero = 0; if (detect_sccs(ctx, graph) < 0) return -1; if (sort_sccs(graph) < 0) return -1; if (compute_maxvar(graph) < 0) return -1; if (need_feautrier_step(ctx, graph)) return compute_schedule_wcc_feautrier(ctx, graph); if (ctx->opt->schedule_outer_zero_distance) force_zero = 1; while (graph->n_row < graph->maxvar) { isl_vec *sol; graph->src_scc = -1; graph->dst_scc = -1; if (setup_lp(ctx, graph, force_zero) < 0) return -1; sol = solve_lp(graph); if (!sol) return -1; if (sol->size == 0) { isl_vec_free(sol); if (!ctx->opt->schedule_maximize_band_depth && graph->n_total_row > graph->band_start) return compute_next_band(ctx, graph); if (graph->src_scc >= 0) return compute_split_schedule(ctx, graph); if (graph->n_total_row > graph->band_start) return compute_next_band(ctx, graph); return carry_dependences(ctx, graph); } if (update_schedule(graph, sol, 1, 1) < 0) return -1; force_zero = 0; } if (graph->n_total_row > graph->band_start) next_band(graph); return sort_statements(ctx, graph); } /* Add a row to the schedules that separates the SCCs and move * to the next band. */ static int split_on_scc(isl_ctx *ctx, struct isl_sched_graph *graph) { int i; if (graph->n_total_row >= graph->max_row) isl_die(ctx, isl_error_internal, "too many schedule rows", return -1); for (i = 0; i < graph->n; ++i) { struct isl_sched_node *node = &graph->node[i]; int row = isl_mat_rows(node->sched); isl_map_free(node->sched_map); node->sched_map = NULL; node->sched = isl_mat_add_zero_rows(node->sched, 1); node->sched = isl_mat_set_element_si(node->sched, row, 0, node->scc); if (!node->sched) return -1; node->band[graph->n_total_row] = graph->n_band; } graph->n_total_row++; next_band(graph); return 0; } /* Compute a schedule for each component (identified by node->scc) * of the dependence graph separately and then combine the results. * Depending on the setting of schedule_fuse, a component may be * either weakly or strongly connected. * * The band_id is adjusted such that each component has a separate id. * Note that the band_id may have already been set to a value different * from zero by compute_split_schedule. */ static int compute_component_schedule(isl_ctx *ctx, struct isl_sched_graph *graph) { int wcc, i; int n, n_edge; int n_total_row, orig_total_row; int n_band, orig_band; if (ctx->opt->schedule_fuse == ISL_SCHEDULE_FUSE_MIN || ctx->opt->schedule_separate_components) if (split_on_scc(ctx, graph) < 0) return -1; n_total_row = 0; orig_total_row = graph->n_total_row; n_band = 0; orig_band = graph->n_band; for (i = 0; i < graph->n; ++i) graph->node[i].band_id[graph->n_band] += graph->node[i].scc; for (wcc = 0; wcc < graph->scc; ++wcc) { n = 0; for (i = 0; i < graph->n; ++i) if (graph->node[i].scc == wcc) n++; n_edge = 0; for (i = 0; i < graph->n_edge; ++i) if (graph->edge[i].src->scc == wcc && graph->edge[i].dst->scc == wcc) n_edge++; if (compute_sub_schedule(ctx, graph, n, n_edge, &node_scc_exactly, &edge_scc_exactly, wcc, 1) < 0) return -1; if (graph->n_total_row > n_total_row) n_total_row = graph->n_total_row; graph->n_total_row = orig_total_row; if (graph->n_band > n_band) n_band = graph->n_band; graph->n_band = orig_band; } graph->n_total_row = n_total_row; graph->n_band = n_band; return pad_schedule(graph); } /* Compute a schedule for the given dependence graph. * We first check if the graph is connected (through validity dependences) * and, if not, compute a schedule for each component separately. * If schedule_fuse is set to minimal fusion, then we check for strongly * connected components instead and compute a separate schedule for * each such strongly connected component. */ static int compute_schedule(isl_ctx *ctx, struct isl_sched_graph *graph) { if (ctx->opt->schedule_fuse == ISL_SCHEDULE_FUSE_MIN) { if (detect_sccs(ctx, graph) < 0) return -1; } else { if (detect_wccs(ctx, graph) < 0) return -1; } if (graph->scc > 1) return compute_component_schedule(ctx, graph); return compute_schedule_wcc(ctx, graph); } /* Compute a schedule for the given union of domains that respects * all the validity dependences. * If the default isl scheduling algorithm is used, it tries to minimize * the dependence distances over the proximity dependences. * If Feautrier's scheduling algorithm is used, the proximity dependence * distances are only minimized during the extension to a full-dimensional * schedule. */ __isl_give isl_schedule *isl_union_set_compute_schedule( __isl_take isl_union_set *domain, __isl_take isl_union_map *validity, __isl_take isl_union_map *proximity) { isl_ctx *ctx = isl_union_set_get_ctx(domain); isl_space *dim; struct isl_sched_graph graph = { 0 }; isl_schedule *sched; struct isl_extract_edge_data data; domain = isl_union_set_align_params(domain, isl_union_map_get_space(validity)); domain = isl_union_set_align_params(domain, isl_union_map_get_space(proximity)); dim = isl_union_set_get_space(domain); validity = isl_union_map_align_params(validity, isl_space_copy(dim)); proximity = isl_union_map_align_params(proximity, dim); if (!domain) goto error; graph.n = isl_union_set_n_set(domain); if (graph.n == 0) goto empty; if (graph_alloc(ctx, &graph, graph.n, isl_union_map_n_map(validity) + isl_union_map_n_map(proximity)) < 0) goto error; if (compute_max_row(&graph, domain) < 0) goto error; graph.root = 1; graph.n = 0; if (isl_union_set_foreach_set(domain, &extract_node, &graph) < 0) goto error; if (graph_init_table(ctx, &graph) < 0) goto error; graph.max_edge[isl_edge_validity] = isl_union_map_n_map(validity); graph.max_edge[isl_edge_proximity] = isl_union_map_n_map(proximity); if (graph_init_edge_tables(ctx, &graph) < 0) goto error; graph.n_edge = 0; data.graph = &graph; data.type = isl_edge_validity; if (isl_union_map_foreach_map(validity, &extract_edge, &data) < 0) goto error; data.type = isl_edge_proximity; if (isl_union_map_foreach_map(proximity, &extract_edge, &data) < 0) goto error; if (compute_schedule(ctx, &graph) < 0) goto error; empty: sched = extract_schedule(&graph, isl_union_set_get_space(domain)); graph_free(ctx, &graph); isl_union_set_free(domain); isl_union_map_free(validity); isl_union_map_free(proximity); return sched; error: graph_free(ctx, &graph); isl_union_set_free(domain); isl_union_map_free(validity); isl_union_map_free(proximity); return NULL; } void *isl_schedule_free(__isl_take isl_schedule *sched) { int i; if (!sched) return NULL; if (--sched->ref > 0) return NULL; for (i = 0; i < sched->n; ++i) { isl_multi_aff_free(sched->node[i].sched); free(sched->node[i].band_end); free(sched->node[i].band_id); free(sched->node[i].zero); } isl_space_free(sched->dim); isl_band_list_free(sched->band_forest); free(sched); return NULL; } isl_ctx *isl_schedule_get_ctx(__isl_keep isl_schedule *schedule) { return schedule ? isl_space_get_ctx(schedule->dim) : NULL; } /* Set max_out to the maximal number of output dimensions over * all maps. */ static int update_max_out(__isl_take isl_map *map, void *user) { int *max_out = user; int n_out = isl_map_dim(map, isl_dim_out); if (n_out > *max_out) *max_out = n_out; isl_map_free(map); return 0; } /* Internal data structure for map_pad_range. * * "max_out" is the maximal schedule dimension. * "res" collects the results. */ struct isl_pad_schedule_map_data { int max_out; isl_union_map *res; }; /* Pad the range of the given map with zeros to data->max_out and * then add the result to data->res. */ static int map_pad_range(__isl_take isl_map *map, void *user) { struct isl_pad_schedule_map_data *data = user; int i; int n_out = isl_map_dim(map, isl_dim_out); map = isl_map_add_dims(map, isl_dim_out, data->max_out - n_out); for (i = n_out; i < data->max_out; ++i) map = isl_map_fix_si(map, isl_dim_out, i, 0); data->res = isl_union_map_add_map(data->res, map); if (!data->res) return -1; return 0; } /* Pad the ranges of the maps in the union map with zeros such they all have * the same dimension. */ static __isl_give isl_union_map *pad_schedule_map( __isl_take isl_union_map *umap) { struct isl_pad_schedule_map_data data; if (!umap) return NULL; if (isl_union_map_n_map(umap) <= 1) return umap; data.max_out = 0; if (isl_union_map_foreach_map(umap, &update_max_out, &data.max_out) < 0) return isl_union_map_free(umap); data.res = isl_union_map_empty(isl_union_map_get_space(umap)); if (isl_union_map_foreach_map(umap, &map_pad_range, &data) < 0) data.res = isl_union_map_free(data.res); isl_union_map_free(umap); return data.res; } /* Return an isl_union_map of the schedule. If we have already constructed * a band forest, then this band forest may have been modified so we need * to extract the isl_union_map from the forest rather than from * the originally computed schedule. This reconstructed schedule map * then needs to be padded with zeros to unify the schedule space * since the result of isl_band_list_get_suffix_schedule may not have * a unified schedule space. */ __isl_give isl_union_map *isl_schedule_get_map(__isl_keep isl_schedule *sched) { int i; isl_union_map *umap; if (!sched) return NULL; if (sched->band_forest) { umap = isl_band_list_get_suffix_schedule(sched->band_forest); return pad_schedule_map(umap); } umap = isl_union_map_empty(isl_space_copy(sched->dim)); for (i = 0; i < sched->n; ++i) { isl_multi_aff *ma; ma = isl_multi_aff_copy(sched->node[i].sched); umap = isl_union_map_add_map(umap, isl_map_from_multi_aff(ma)); } return umap; } static __isl_give isl_band_list *construct_band_list( __isl_keep isl_schedule *schedule, __isl_keep isl_band *parent, int band_nr, int *parent_active, int n_active); /* Construct an isl_band structure for the band in the given schedule * with sequence number band_nr for the n_active nodes marked by active. * If the nodes don't have a band with the given sequence number, * then a band without members is created. * * Because of the way the schedule is constructed, we know that * the position of the band inside the schedule of a node is the same * for all active nodes. * * The partial schedule for the band is created before the children * are created to that construct_band_list can refer to the partial * schedule of the parent. */ static __isl_give isl_band *construct_band(__isl_keep isl_schedule *schedule, __isl_keep isl_band *parent, int band_nr, int *active, int n_active) { int i, j; isl_ctx *ctx = isl_schedule_get_ctx(schedule); isl_band *band; unsigned start, end; band = isl_band_alloc(ctx); if (!band) return NULL; band->schedule = schedule; band->parent = parent; for (i = 0; i < schedule->n; ++i) if (active[i]) break; if (i >= schedule->n) isl_die(ctx, isl_error_internal, "band without active statements", goto error); start = band_nr ? schedule->node[i].band_end[band_nr - 1] : 0; end = band_nr < schedule->node[i].n_band ? schedule->node[i].band_end[band_nr] : start; band->n = end - start; band->zero = isl_alloc_array(ctx, int, band->n); if (band->n && !band->zero) goto error; for (j = 0; j < band->n; ++j) band->zero[j] = schedule->node[i].zero[start + j]; band->pma = isl_union_pw_multi_aff_empty(isl_space_copy(schedule->dim)); for (i = 0; i < schedule->n; ++i) { isl_multi_aff *ma; isl_pw_multi_aff *pma; unsigned n_out; if (!active[i]) continue; ma = isl_multi_aff_copy(schedule->node[i].sched); n_out = isl_multi_aff_dim(ma, isl_dim_out); ma = isl_multi_aff_drop_dims(ma, isl_dim_out, end, n_out - end); ma = isl_multi_aff_drop_dims(ma, isl_dim_out, 0, start); pma = isl_pw_multi_aff_from_multi_aff(ma); band->pma = isl_union_pw_multi_aff_add_pw_multi_aff(band->pma, pma); } if (!band->pma) goto error; for (i = 0; i < schedule->n; ++i) if (active[i] && schedule->node[i].n_band > band_nr + 1) break; if (i < schedule->n) { band->children = construct_band_list(schedule, band, band_nr + 1, active, n_active); if (!band->children) goto error; } return band; error: isl_band_free(band); return NULL; } /* Internal data structure used inside cmp_band and pw_multi_aff_extract_int. * * r is set to a negative value if anything goes wrong. * * c1 stores the result of extract_int. * c2 is a temporary value used inside cmp_band_in_ancestor. * t is a temporary value used inside extract_int. * * first and equal are used inside extract_int. * first is set if we are looking at the first isl_multi_aff inside * the isl_union_pw_multi_aff. * equal is set if all the isl_multi_affs have been equal so far. */ struct isl_cmp_band_data { int r; int first; int equal; isl_int t; isl_int c1; isl_int c2; }; /* Check if "ma" assigns a constant value. * Note that this function is only called on isl_multi_affs * with a single output dimension. * * If "ma" assigns a constant value then we compare it to data->c1 * or assign it to data->c1 if this is the first isl_multi_aff we consider. * If "ma" does not assign a constant value or if it assigns a value * that is different from data->c1, then we set data->equal to zero * and terminate the check. */ static int multi_aff_extract_int(__isl_take isl_set *set, __isl_take isl_multi_aff *ma, void *user) { isl_aff *aff; struct isl_cmp_band_data *data = user; aff = isl_multi_aff_get_aff(ma, 0); data->r = isl_aff_is_cst(aff); if (data->r >= 0 && data->r) { isl_aff_get_constant(aff, &data->t); if (data->first) { isl_int_set(data->c1, data->t); data->first = 0; } else if (!isl_int_eq(data->c1, data->t)) data->equal = 0; } else if (data->r >= 0 && !data->r) data->equal = 0; isl_aff_free(aff); isl_set_free(set); isl_multi_aff_free(ma); if (data->r < 0) return -1; if (!data->equal) return -1; return 0; } /* This function is called for each isl_pw_multi_aff in * the isl_union_pw_multi_aff checked by extract_int. * Check all the isl_multi_affs inside "pma". */ static int pw_multi_aff_extract_int(__isl_take isl_pw_multi_aff *pma, void *user) { int r; r = isl_pw_multi_aff_foreach_piece(pma, &multi_aff_extract_int, user); isl_pw_multi_aff_free(pma); return r; } /* Check if "upma" assigns a single constant value to its domain. * If so, return 1 and store the result in data->c1. * If not, return 0. * * A negative return value from isl_union_pw_multi_aff_foreach_pw_multi_aff * means that either an error occurred or that we have broken off the check * because we already know the result is going to be negative. * In the latter case, data->equal is set to zero. */ static int extract_int(__isl_keep isl_union_pw_multi_aff *upma, struct isl_cmp_band_data *data) { data->first = 1; data->equal = 1; if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma, &pw_multi_aff_extract_int, data) < 0) { if (!data->equal) return 0; return -1; } return !data->first && data->equal; } /* Compare "b1" and "b2" based on the parent schedule of their ancestor * "ancestor". * * If the parent of "ancestor" also has a single member, then we * first try to compare the two band based on the partial schedule * of this parent. * * Otherwise, or if the result is inconclusive, we look at the partial schedule * of "ancestor" itself. * In particular, we specialize the parent schedule based * on the domains of the child schedules, check if both assign * a single constant value and, if so, compare the two constant values. * If the specialized parent schedules do not assign a constant value, * then they cannot be used to order the two bands and so in this case * we return 0. */ static int cmp_band_in_ancestor(__isl_keep isl_band *b1, __isl_keep isl_band *b2, struct isl_cmp_band_data *data, __isl_keep isl_band *ancestor) { isl_union_pw_multi_aff *upma; isl_union_set *domain; int r; if (data->r < 0) return 0; if (ancestor->parent && ancestor->parent->n == 1) { r = cmp_band_in_ancestor(b1, b2, data, ancestor->parent); if (data->r < 0) return 0; if (r) return r; } upma = isl_union_pw_multi_aff_copy(b1->pma); domain = isl_union_pw_multi_aff_domain(upma); upma = isl_union_pw_multi_aff_copy(ancestor->pma); upma = isl_union_pw_multi_aff_intersect_domain(upma, domain); r = extract_int(upma, data); isl_union_pw_multi_aff_free(upma); if (r < 0) data->r = -1; if (r < 0 || !r) return 0; isl_int_set(data->c2, data->c1); upma = isl_union_pw_multi_aff_copy(b2->pma); domain = isl_union_pw_multi_aff_domain(upma); upma = isl_union_pw_multi_aff_copy(ancestor->pma); upma = isl_union_pw_multi_aff_intersect_domain(upma, domain); r = extract_int(upma, data); isl_union_pw_multi_aff_free(upma); if (r < 0) data->r = -1; if (r < 0 || !r) return 0; return isl_int_cmp(data->c2, data->c1); } /* Compare "a" and "b" based on the parent schedule of their parent. */ static int cmp_band(const void *a, const void *b, void *user) { isl_band *b1 = *(isl_band * const *) a; isl_band *b2 = *(isl_band * const *) b; struct isl_cmp_band_data *data = user; return cmp_band_in_ancestor(b1, b2, data, b1->parent); } /* Sort the elements in "list" based on the partial schedules of its parent * (and ancestors). In particular if the parent assigns constant values * to the domains of the bands in "list", then the elements are sorted * according to that order. * This order should be a more "natural" order for the user, but otherwise * shouldn't have any effect. * If we would be constructing an isl_band forest directly in * isl_union_set_compute_schedule then there wouldn't be any need * for a reordering, since the children would be added to the list * in their natural order automatically. * * If there is only one element in the list, then there is no need to sort * anything. * If the partial schedule of the parent has more than one member * (or if there is no parent), then it's * defnitely not assigning constant values to the different children in * the list and so we wouldn't be able to use it to sort the list. */ static __isl_give isl_band_list *sort_band_list(__isl_take isl_band_list *list, __isl_keep isl_band *parent) { struct isl_cmp_band_data data; if (!list) return NULL; if (list->n <= 1) return list; if (!parent || parent->n != 1) return list; data.r = 0; isl_int_init(data.c1); isl_int_init(data.c2); isl_int_init(data.t); isl_sort(list->p, list->n, sizeof(list->p[0]), &cmp_band, &data); if (data.r < 0) list = isl_band_list_free(list); isl_int_clear(data.c1); isl_int_clear(data.c2); isl_int_clear(data.t); return list; } /* Construct a list of bands that start at the same position (with * sequence number band_nr) in the schedules of the nodes that * were active in the parent band. * * A separate isl_band structure is created for each band_id * and for each node that does not have a band with sequence * number band_nr. In the latter case, a band without members * is created. * This ensures that if a band has any children, then each node * that was active in the band is active in exactly one of the children. */ static __isl_give isl_band_list *construct_band_list( __isl_keep isl_schedule *schedule, __isl_keep isl_band *parent, int band_nr, int *parent_active, int n_active) { int i, j; isl_ctx *ctx = isl_schedule_get_ctx(schedule); int *active; int n_band; isl_band_list *list; n_band = 0; for (i = 0; i < n_active; ++i) { for (j = 0; j < schedule->n; ++j) { if (!parent_active[j]) continue; if (schedule->node[j].n_band <= band_nr) continue; if (schedule->node[j].band_id[band_nr] == i) { n_band++; break; } } } for (j = 0; j < schedule->n; ++j) if (schedule->node[j].n_band <= band_nr) n_band++; if (n_band == 1) { isl_band *band; list = isl_band_list_alloc(ctx, n_band); band = construct_band(schedule, parent, band_nr, parent_active, n_active); return isl_band_list_add(list, band); } active = isl_alloc_array(ctx, int, schedule->n); if (schedule->n && !active) return NULL; list = isl_band_list_alloc(ctx, n_band); for (i = 0; i < n_active; ++i) { int n = 0; isl_band *band; for (j = 0; j < schedule->n; ++j) { active[j] = parent_active[j] && schedule->node[j].n_band > band_nr && schedule->node[j].band_id[band_nr] == i; if (active[j]) n++; } if (n == 0) continue; band = construct_band(schedule, parent, band_nr, active, n); list = isl_band_list_add(list, band); } for (i = 0; i < schedule->n; ++i) { isl_band *band; if (!parent_active[i]) continue; if (schedule->node[i].n_band > band_nr) continue; for (j = 0; j < schedule->n; ++j) active[j] = j == i; band = construct_band(schedule, parent, band_nr, active, 1); list = isl_band_list_add(list, band); } free(active); list = sort_band_list(list, parent); return list; } /* Construct a band forest representation of the schedule and * return the list of roots. */ static __isl_give isl_band_list *construct_forest( __isl_keep isl_schedule *schedule) { int i; isl_ctx *ctx = isl_schedule_get_ctx(schedule); isl_band_list *forest; int *active; active = isl_alloc_array(ctx, int, schedule->n); if (schedule->n && !active) return NULL; for (i = 0; i < schedule->n; ++i) active[i] = 1; forest = construct_band_list(schedule, NULL, 0, active, schedule->n); free(active); return forest; } /* Return the roots of a band forest representation of the schedule. */ __isl_give isl_band_list *isl_schedule_get_band_forest( __isl_keep isl_schedule *schedule) { if (!schedule) return NULL; if (!schedule->band_forest) schedule->band_forest = construct_forest(schedule); return isl_band_list_dup(schedule->band_forest); } /* Call "fn" on each band in the schedule in depth-first post-order. */ int isl_schedule_foreach_band(__isl_keep isl_schedule *sched, int (*fn)(__isl_keep isl_band *band, void *user), void *user) { int r; isl_band_list *forest; if (!sched) return -1; forest = isl_schedule_get_band_forest(sched); r = isl_band_list_foreach_band(forest, fn, user); isl_band_list_free(forest); return r; } static __isl_give isl_printer *print_band_list(__isl_take isl_printer *p, __isl_keep isl_band_list *list); static __isl_give isl_printer *print_band(__isl_take isl_printer *p, __isl_keep isl_band *band) { isl_band_list *children; p = isl_printer_start_line(p); p = isl_printer_print_union_pw_multi_aff(p, band->pma); p = isl_printer_end_line(p); if (!isl_band_has_children(band)) return p; children = isl_band_get_children(band); p = isl_printer_indent(p, 4); p = print_band_list(p, children); p = isl_printer_indent(p, -4); isl_band_list_free(children); return p; } static __isl_give isl_printer *print_band_list(__isl_take isl_printer *p, __isl_keep isl_band_list *list) { int i, n; n = isl_band_list_n_band(list); for (i = 0; i < n; ++i) { isl_band *band; band = isl_band_list_get_band(list, i); p = print_band(p, band); isl_band_free(band); } return p; } __isl_give isl_printer *isl_printer_print_schedule(__isl_take isl_printer *p, __isl_keep isl_schedule *schedule) { isl_band_list *forest; forest = isl_schedule_get_band_forest(schedule); p = print_band_list(p, forest); isl_band_list_free(forest); return p; } void isl_schedule_dump(__isl_keep isl_schedule *schedule) { isl_printer *printer; if (!schedule) return; printer = isl_printer_to_file(isl_schedule_get_ctx(schedule), stderr); printer = isl_printer_print_schedule(printer, schedule); isl_printer_free(printer); } cloog-0.18.2/isl/basis_reduction_templ.c0000664000175000017500000002071312254313240015140 00000000000000/* * Copyright 2006-2007 Universiteit Leiden * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, Leiden Institute of Advanced Computer Science, * Universiteit Leiden, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands * and K.U.Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A, * B-3001 Leuven, Belgium */ #include #include #include #include #include "isl_basis_reduction.h" static void save_alpha(GBR_LP *lp, int first, int n, GBR_type *alpha) { int i; for (i = 0; i < n; ++i) GBR_lp_get_alpha(lp, first + i, &alpha[i]); } /* Compute a reduced basis for the set represented by the tableau "tab". * tab->basis, which must be initialized by the calling function to an affine * unimodular basis, is updated to reflect the reduced basis. * The first tab->n_zero rows of the basis (ignoring the constant row) * are assumed to correspond to equalities and are left untouched. * tab->n_zero is updated to reflect any additional equalities that * have been detected in the first rows of the new basis. * The final tab->n_unbounded rows of the basis are assumed to correspond * to unbounded directions and are also left untouched. * In particular this means that the remaining rows are assumed to * correspond to bounded directions. * * This function implements the algorithm described in * "An Implementation of the Generalized Basis Reduction Algorithm * for Integer Programming" of Cook el al. to compute a reduced basis. * We use \epsilon = 1/4. * * If ctx->opt->gbr_only_first is set, the user is only interested * in the first direction. In this case we stop the basis reduction when * the width in the first direction becomes smaller than 2. */ struct isl_tab *isl_tab_compute_reduced_basis(struct isl_tab *tab) { unsigned dim; struct isl_ctx *ctx; struct isl_mat *B; int unbounded; int i; GBR_LP *lp = NULL; GBR_type F_old, alpha, F_new; int row; isl_int tmp; struct isl_vec *b_tmp; GBR_type *F = NULL; GBR_type *alpha_buffer[2] = { NULL, NULL }; GBR_type *alpha_saved; GBR_type F_saved; int use_saved = 0; isl_int mu[2]; GBR_type mu_F[2]; GBR_type two; GBR_type one; int empty = 0; int fixed = 0; int fixed_saved = 0; int mu_fixed[2]; int n_bounded; int gbr_only_first; if (!tab) return NULL; if (tab->empty) return tab; ctx = tab->mat->ctx; gbr_only_first = ctx->opt->gbr_only_first; dim = tab->n_var; B = tab->basis; if (!B) return tab; n_bounded = dim - tab->n_unbounded; if (n_bounded <= tab->n_zero + 1) return tab; isl_int_init(tmp); isl_int_init(mu[0]); isl_int_init(mu[1]); GBR_init(alpha); GBR_init(F_old); GBR_init(F_new); GBR_init(F_saved); GBR_init(mu_F[0]); GBR_init(mu_F[1]); GBR_init(two); GBR_init(one); b_tmp = isl_vec_alloc(ctx, dim); if (!b_tmp) goto error; F = isl_alloc_array(ctx, GBR_type, n_bounded); alpha_buffer[0] = isl_alloc_array(ctx, GBR_type, n_bounded); alpha_buffer[1] = isl_alloc_array(ctx, GBR_type, n_bounded); alpha_saved = alpha_buffer[0]; if (!F || !alpha_buffer[0] || !alpha_buffer[1]) goto error; for (i = 0; i < n_bounded; ++i) { GBR_init(F[i]); GBR_init(alpha_buffer[0][i]); GBR_init(alpha_buffer[1][i]); } GBR_set_ui(two, 2); GBR_set_ui(one, 1); lp = GBR_lp_init(tab); if (!lp) goto error; i = tab->n_zero; GBR_lp_set_obj(lp, B->row[1+i]+1, dim); ctx->stats->gbr_solved_lps++; unbounded = GBR_lp_solve(lp); isl_assert(ctx, !unbounded, goto error); GBR_lp_get_obj_val(lp, &F[i]); if (GBR_lt(F[i], one)) { if (!GBR_is_zero(F[i])) { empty = GBR_lp_cut(lp, B->row[1+i]+1); if (empty) goto done; GBR_set_ui(F[i], 0); } tab->n_zero++; } do { if (i+1 == tab->n_zero) { GBR_lp_set_obj(lp, B->row[1+i+1]+1, dim); ctx->stats->gbr_solved_lps++; unbounded = GBR_lp_solve(lp); isl_assert(ctx, !unbounded, goto error); GBR_lp_get_obj_val(lp, &F_new); fixed = GBR_lp_is_fixed(lp); GBR_set_ui(alpha, 0); } else if (use_saved) { row = GBR_lp_next_row(lp); GBR_set(F_new, F_saved); fixed = fixed_saved; GBR_set(alpha, alpha_saved[i]); } else { row = GBR_lp_add_row(lp, B->row[1+i]+1, dim); GBR_lp_set_obj(lp, B->row[1+i+1]+1, dim); ctx->stats->gbr_solved_lps++; unbounded = GBR_lp_solve(lp); isl_assert(ctx, !unbounded, goto error); GBR_lp_get_obj_val(lp, &F_new); fixed = GBR_lp_is_fixed(lp); GBR_lp_get_alpha(lp, row, &alpha); if (i > 0) save_alpha(lp, row-i, i, alpha_saved); if (GBR_lp_del_row(lp) < 0) goto error; } GBR_set(F[i+1], F_new); GBR_floor(mu[0], alpha); GBR_ceil(mu[1], alpha); if (isl_int_eq(mu[0], mu[1])) isl_int_set(tmp, mu[0]); else { int j; for (j = 0; j <= 1; ++j) { isl_int_set(tmp, mu[j]); isl_seq_combine(b_tmp->el, ctx->one, B->row[1+i+1]+1, tmp, B->row[1+i]+1, dim); GBR_lp_set_obj(lp, b_tmp->el, dim); ctx->stats->gbr_solved_lps++; unbounded = GBR_lp_solve(lp); isl_assert(ctx, !unbounded, goto error); GBR_lp_get_obj_val(lp, &mu_F[j]); mu_fixed[j] = GBR_lp_is_fixed(lp); if (i > 0) save_alpha(lp, row-i, i, alpha_buffer[j]); } if (GBR_lt(mu_F[0], mu_F[1])) j = 0; else j = 1; isl_int_set(tmp, mu[j]); GBR_set(F_new, mu_F[j]); fixed = mu_fixed[j]; alpha_saved = alpha_buffer[j]; } isl_seq_combine(B->row[1+i+1]+1, ctx->one, B->row[1+i+1]+1, tmp, B->row[1+i]+1, dim); if (i+1 == tab->n_zero && fixed) { if (!GBR_is_zero(F[i+1])) { empty = GBR_lp_cut(lp, B->row[1+i+1]+1); if (empty) goto done; GBR_set_ui(F[i+1], 0); } tab->n_zero++; } GBR_set(F_old, F[i]); use_saved = 0; /* mu_F[0] = 4 * F_new; mu_F[1] = 3 * F_old */ GBR_set_ui(mu_F[0], 4); GBR_mul(mu_F[0], mu_F[0], F_new); GBR_set_ui(mu_F[1], 3); GBR_mul(mu_F[1], mu_F[1], F_old); if (GBR_lt(mu_F[0], mu_F[1])) { B = isl_mat_swap_rows(B, 1 + i, 1 + i + 1); if (i > tab->n_zero) { use_saved = 1; GBR_set(F_saved, F_new); fixed_saved = fixed; if (GBR_lp_del_row(lp) < 0) goto error; --i; } else { GBR_set(F[tab->n_zero], F_new); if (gbr_only_first && GBR_lt(F[tab->n_zero], two)) break; if (fixed) { if (!GBR_is_zero(F[tab->n_zero])) { empty = GBR_lp_cut(lp, B->row[1+tab->n_zero]+1); if (empty) goto done; GBR_set_ui(F[tab->n_zero], 0); } tab->n_zero++; } } } else { GBR_lp_add_row(lp, B->row[1+i]+1, dim); ++i; } } while (i < n_bounded - 1); if (0) { done: if (empty < 0) { error: isl_mat_free(B); B = NULL; } } GBR_lp_delete(lp); if (alpha_buffer[1]) for (i = 0; i < n_bounded; ++i) { GBR_clear(F[i]); GBR_clear(alpha_buffer[0][i]); GBR_clear(alpha_buffer[1][i]); } free(F); free(alpha_buffer[0]); free(alpha_buffer[1]); isl_vec_free(b_tmp); GBR_clear(alpha); GBR_clear(F_old); GBR_clear(F_new); GBR_clear(F_saved); GBR_clear(mu_F[0]); GBR_clear(mu_F[1]); GBR_clear(two); GBR_clear(one); isl_int_clear(tmp); isl_int_clear(mu[0]); isl_int_clear(mu[1]); tab->basis = B; return tab; } /* Compute an affine form of a reduced basis of the given basic * non-parametric set, which is assumed to be bounded and not * include any integer divisions. * The first column and the first row correspond to the constant term. * * If the input contains any equalities, we first create an initial * basis with the equalities first. Otherwise, we start off with * the identity matrix. */ struct isl_mat *isl_basic_set_reduced_basis(struct isl_basic_set *bset) { struct isl_mat *basis; struct isl_tab *tab; if (!bset) return NULL; if (isl_basic_set_dim(bset, isl_dim_div) != 0) isl_die(bset->ctx, isl_error_invalid, "no integer division allowed", return NULL); if (isl_basic_set_dim(bset, isl_dim_param) != 0) isl_die(bset->ctx, isl_error_invalid, "no parameters allowed", return NULL); tab = isl_tab_from_basic_set(bset, 0); if (!tab) return NULL; if (bset->n_eq == 0) tab->basis = isl_mat_identity(bset->ctx, 1 + tab->n_var); else { isl_mat *eq; unsigned nvar = isl_basic_set_total_dim(bset); eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 1, nvar); eq = isl_mat_left_hermite(eq, 0, NULL, &tab->basis); tab->basis = isl_mat_lin_to_aff(tab->basis); tab->n_zero = bset->n_eq; isl_mat_free(eq); } tab = isl_tab_compute_reduced_basis(tab); if (!tab) return NULL; basis = isl_mat_copy(tab->basis); isl_tab_free(tab); return basis; } cloog-0.18.2/isl/isl_version.c0000664000175000017500000000012412254313240013110 00000000000000#include "gitversion.h" const char *isl_version(void) { return GIT_HEAD_ID"\n"; } cloog-0.18.2/isl/isl_sample_no_piplib.c0000664000175000017500000000061412254313240014743 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include "isl_sample_piplib.h" struct isl_vec *isl_pip_basic_set_sample(struct isl_basic_set *bset) { isl_basic_set_free(bset); return NULL; } cloog-0.18.2/isl/isl_ast_build_private.h0000664000175000017500000002437512254313240015146 00000000000000#ifndef ISL_AST_BUILD_PRIVATE_H #define ISL_AST_BUILD_PRIVATE_H #include #include #include #include #include enum isl_ast_build_domain_type { atomic, unroll, separate }; /* An isl_ast_build represents the context in which AST is being * generated. That is, it (mostly) contains information about outer * loops that can be used to simplify inner loops. * * "domain" represents constraints on the internal schedule domain, * corresponding to the context of the AST generation and the constraints * implied by the loops that have already been generated. * When an isl_ast_build is first created, outside any AST generation, * the domain is typically a parameter set. It is only when a AST * generation phase is initiated that the domain of the isl_ast_build * is changed to refer to the internal schedule domain. * The domain then lives in a space of the form * * S * * or * * [O -> S] * * O represents the loops generated in outer AST generations. * S represents the loops (both generated and to be generated) * of the current AST generation. * Both include eliminated loops. * "domain" is expected not to have any unknown divs because * it is used as the context argument in a call to isl_basic_set_gist * in isl_ast_build_compute_gist_basic_set. * * "depth" is equal to the number of loops that have already * been generated (including those in outer AST generations). * "outer_pos" is equal to the number of loops in outer AST generations. * * "generated" is a superset of "domain" corresponding to those * constraints that were either given by the user or that have * effectively been generated (as bounds on a for loop). * * "pending" is a superset of "domain" corresponding to the constraints * that still need to be generated (as guards), but that may end up * not getting generated if they are implied by any constraints * enforced by inner loops. * * "strides" contains the stride of each loop. The number of elements * is equal to the number of dimensions in "domain". * "offsets" constains the offsets of strided loops. If s is the stride * for a given dimension and f is the corresponding offset, then the * dimension takes on values * * f + s a * * with a an integer. For non-strided loops, the offset is zero. * * "iterators" contains the loop iterators of both generated and * to be generated loops. The number of elements is at least as * large as the dimension of the internal schedule domain. The * number may be larger, in which case the additional ids can be * used in a nested AST generation should the schedule be non-injective. * * "values" lives in the space * * [O -> S] -> [O -> S] (or S -> S) * * and expresses (if possible) loop iterators in terms of parameters * and outer loop iterators. If the value of a given loop iterator * cannot be expressed as an affine expression (either because the iterator * attains multiple values or because the single value is a piecewise * affine expression), then it is expressed in "values" as being equal * to itself. * * "value" is the value of the loop iterator at the current depth. * It is NULL if it has not been computed yet or if the value of the * given loop iterator cannot be expressed as a piecewise affine expression * (because the iterator attains multiple values). * * "schedule_map" maps the internal schedule domain to the external schedule * domain. It may be NULL if it hasn't been computed yet. * See isl_ast_build_get_schedule_map_multi_aff. * * The "create_leaf" callback is called for every leaf in the generated AST. * The callback is responsible for creating the node to be placed at those * leaves. If this callback is not set, then isl will generated user * nodes with call expressions corresponding to an element of the domain. * * The "at_each_domain" callback is called on every node created to represent * an element of the domain. Each of these nodes is a user node * with as expression a call expression. * * The "before_each_for" callback is called on each for node before * its children have been created. * * The "after_each_for" callback is called on each for node after * its children have been created. * * "executed" contains the inverse schedule at this point * of the AST generation. * It is currently only used in isl_ast_build_get_schedule, which is * in turn only used by user code from within a callback. * The value is set right before we may be calling such a callback. * * "single_valued" is set if the current inverse schedule (which may or may * not be stored in "executed") is known to be single valued, specifically * an inverse schedule that was not (appeared not to be) single valued * is extended to a single valued inverse schedule. This is mainly used * to avoid an infinite recursion when we fail to detect later on that * the extended inverse schedule is single valued. */ struct isl_ast_build { int ref; int outer_pos; int depth; isl_id_list *iterators; isl_set *domain; isl_set *generated; isl_set *pending; isl_multi_aff *values; isl_pw_aff *value; isl_vec *strides; isl_multi_aff *offsets; isl_multi_aff *schedule_map; isl_union_map *options; __isl_give isl_ast_node *(*at_each_domain)( __isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user); void *at_each_domain_user; __isl_give isl_id *(*before_each_for)( __isl_keep isl_ast_build *context, void *user); void *before_each_for_user; __isl_give isl_ast_node *(*after_each_for)( __isl_take isl_ast_node *node, __isl_keep isl_ast_build *context, void *user); void *after_each_for_user; __isl_give isl_ast_node *(*create_leaf)( __isl_take isl_ast_build *build, void *user); void *create_leaf_user; isl_union_map *executed; int single_valued; }; __isl_give isl_ast_build *isl_ast_build_clear_local_info( __isl_take isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_increase_depth( __isl_take isl_ast_build *build); int isl_ast_build_get_depth(__isl_keep isl_ast_build *build); __isl_give isl_space *isl_ast_build_get_space( __isl_keep isl_ast_build *build, int internal); __isl_give isl_ast_build *isl_ast_build_align_params( __isl_take isl_ast_build *build, __isl_take isl_space *model); __isl_give isl_ast_build *isl_ast_build_cow( __isl_take isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_insert_dim( __isl_take isl_ast_build *build, int pos); __isl_give isl_ast_build *isl_ast_build_scale_down( __isl_take isl_ast_build *build, __isl_take isl_val *m, __isl_take isl_union_map *umap); __isl_give isl_ast_build *isl_ast_build_product( __isl_take isl_ast_build *build, __isl_take isl_space *embedding); __isl_give isl_ast_build *isl_ast_build_set_loop_bounds( __isl_take isl_ast_build *build, __isl_take isl_basic_set *bounds); __isl_give isl_ast_build *isl_ast_build_detect_strides( __isl_take isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_ast_build *isl_ast_build_include_stride( __isl_take isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_set_executed( __isl_take isl_ast_build *build, __isl_take isl_union_map *executed); __isl_give isl_ast_build *isl_ast_build_set_single_valued( __isl_take isl_ast_build *build, int sv); __isl_give isl_set *isl_ast_build_get_domain( __isl_keep isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_restrict_generated( __isl_take isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_ast_build *isl_ast_build_restrict_pending( __isl_take isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_ast_build *isl_ast_build_set_enforced( __isl_take isl_ast_build *build, __isl_take isl_basic_set *enforced); __isl_give int isl_ast_build_need_schedule_map( __isl_keep isl_ast_build *build); __isl_give isl_multi_aff *isl_ast_build_get_schedule_map_multi_aff( __isl_keep isl_ast_build *build); __isl_give isl_map *isl_ast_build_get_schedule_map( __isl_keep isl_ast_build *build); int isl_ast_build_has_affine_value(__isl_keep isl_ast_build *build, int pos); int isl_ast_build_has_value(__isl_keep isl_ast_build *build); __isl_give isl_id *isl_ast_build_get_iterator_id( __isl_keep isl_ast_build *build, int pos); __isl_give isl_basic_set *isl_ast_build_compute_gist_basic_set( __isl_keep isl_ast_build *build, __isl_take isl_basic_set *bset); __isl_give isl_set *isl_ast_build_compute_gist( __isl_keep isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_map *isl_ast_build_compute_gist_map_domain( __isl_keep isl_ast_build *build, __isl_take isl_map *map); __isl_give isl_aff *isl_ast_build_compute_gist_aff( __isl_keep isl_ast_build *build, __isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_ast_build_compute_gist_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa); __isl_give isl_pw_multi_aff *isl_ast_build_compute_gist_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma); __isl_give isl_union_map *isl_ast_build_substitute_values_union_map_domain( __isl_keep isl_ast_build *build, __isl_take isl_union_map *umap); int isl_ast_build_aff_is_nonneg(__isl_keep isl_ast_build *build, __isl_keep isl_aff *aff); int isl_ast_build_has_stride(__isl_keep isl_ast_build *build, int pos); __isl_give isl_aff *isl_ast_build_get_offset(__isl_keep isl_ast_build *build, int pos); __isl_give isl_val *isl_ast_build_get_stride(__isl_keep isl_ast_build *build, int pos); __isl_give isl_set *isl_ast_build_get_stride_constraint( __isl_keep isl_ast_build *build); __isl_give isl_multi_aff *isl_ast_build_get_stride_expansion( __isl_keep isl_ast_build *build); void isl_ast_build_dump(__isl_keep isl_ast_build *build); __isl_give isl_set *isl_ast_build_get_option_domain( __isl_keep isl_ast_build *build, enum isl_ast_build_domain_type type); __isl_give isl_map *isl_ast_build_get_separation_class( __isl_keep isl_ast_build *build); __isl_give isl_set *isl_ast_build_eliminate( __isl_keep isl_ast_build *build, __isl_take isl_set *domain); __isl_give isl_set *isl_ast_build_eliminate_inner( __isl_keep isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_set *isl_ast_build_eliminate_divs( __isl_keep isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_map *isl_ast_build_map_to_iterator( __isl_keep isl_ast_build *build, __isl_take isl_set *set); int isl_ast_build_options_involve_depth(__isl_keep isl_ast_build *build); #endif cloog-0.18.2/isl/ChangeLog0000664000175000017500000000602512254313240012170 00000000000000version: 0.12.1 date: Wed Jul 24 12:54:46 CEST 2013 changes: - handle malloc returning NULL on zero-size allocation - fix regression in AST generator --- version: 0.12 date: Sun Jun 23 20:23:05 CEST 2013 changes: - add isl_val abstraction --- version: 0.11.2 date: Tue Apr 9 18:45:10 CEST 2013 changes: - make code generation output the same on Solaris - fix some hard to trigger bugs --- version: 0.11.1 date: Mon Dec 10 11:55:30 CET 2012 changes: - add LICENSE file to distribution - make code generation output independent of endianness --- version: 0.11 date: Mon Dec 3 08:17:18 CET 2012 changes: - change license from LGPL 2.1 to MIT - add support for multi piecewise quasi-affine expressions - add code generation - various minor bug fixes --- version: 0.10 date: Sun Jun 3 18:00:16 CEST 2012 changes: - support for interaction with dependence analysis - add public API for vectors - improved support for (piecewise) multi quasi-affine expressions - various minor bug fixes --- version: 0.09 date: Sat Dec 17 18:19:26 CET 2011 changes: - improved argument parsing - hide internal structure of isl_options - improved support for parameter sets - configurable scheduling --- version: 0.08 date: Fri Oct 21 12:36:20 CEST 2011 changes: - improved parsing - drop isl_div abstraction - rename isl_dim to isl_space - |- explicitly differentiate between spaces of maps, sets and parameter sets - add support for identifiers - add support for (piecewise) multi quasi-affine expressions - preliminary Python bindings --- version: 0.07 date: Tue Jul 12 19:34:51 CEST 2011 changes: - hide internal structures of isl_div and isl_constraint - preliminary scheduling - add support for local spaces and (piecewise) quasi-affine expressions --- version: 0.06 date: Fri Mar 18 15:59:16 CET 2011 changes: - improved parsing - consistency changes in API - hide internal structure of isl_ctx --- version: 0.05.1 date: Wed Jan 5 10:21:42 CET 2011 changes: - fix simple symmetry detection in parametric integer programming --- version: 0.05 date: Thu Dec 23 17:03:14 CET 2010 changes: - rename header files from isl_header.h to isl/header.h - add higher level interface for dependence analysis - improved argument parsing - optionally triangulate domains during Bernstein expansion - support extended PolyLib format - hide internal structure of some data types - improved coalescing - add simple symmetry detection in parametric integer programming --- version: 0.04 date: Fri Sep 10 12:57:50 CEST 2010 changes: - rename isl_pw_qpolynomial_fold_add - add isl_map_apply_pw_qpolynomial_fold - support named and nested spaces - support union sets and maps - add public API for matrices --- version: 0.03 date: Tue Jun 29 13:16:46 CEST 2010 changes: - new printing functions - support for "may" accesses in dependence analysis - improved coalescing - improved transitive closure - fix several hard to trigger bugs - improved argument parsing - support parametric vertex enumeration for barvinok - optionally use Bernstein expansion to compute bounds cloog-0.18.2/isl/isl_hmap_map_basic_set.c0000664000175000017500000000437212254313240015232 00000000000000#include struct isl_map_basic_set_pair { isl_map *key; isl_basic_set *val; }; __isl_give isl_hmap_map_basic_set *isl_hmap_map_basic_set_alloc(isl_ctx *ctx, int min_size) { return (isl_hmap_map_basic_set *) isl_hash_table_alloc(ctx, min_size); } static int free_pair(void **entry, void *user) { struct isl_map_basic_set_pair *pair = *entry; isl_map_free(pair->key); isl_basic_set_free(pair->val); free(pair); *entry = NULL; return 0; } void isl_hmap_map_basic_set_free(isl_ctx *ctx, __isl_take isl_hmap_map_basic_set *hmap) { if (!hmap) return; isl_hash_table_foreach(ctx, &hmap->table, &free_pair, NULL); isl_hash_table_free(ctx, &hmap->table); } static int has_key(const void *entry, const void *key) { const struct isl_map_basic_set_pair *pair = entry; isl_map *map = (isl_map *)key; return isl_map_plain_is_equal(pair->key, map); } int isl_hmap_map_basic_set_has(isl_ctx *ctx, __isl_keep isl_hmap_map_basic_set *hmap, __isl_keep isl_map *key) { uint32_t hash; hash = isl_map_get_hash(key); return !!isl_hash_table_find(ctx, &hmap->table, hash, &has_key, key, 0); } __isl_give isl_basic_set *isl_hmap_map_basic_set_get(isl_ctx *ctx, __isl_keep isl_hmap_map_basic_set *hmap, __isl_take isl_map *key) { struct isl_hash_table_entry *entry; struct isl_map_basic_set_pair *pair; uint32_t hash; hash = isl_map_get_hash(key); entry = isl_hash_table_find(ctx, &hmap->table, hash, &has_key, key, 0); isl_map_free(key); if (!entry) return NULL; pair = entry->data; return isl_basic_set_copy(pair->val); } int isl_hmap_map_basic_set_set(isl_ctx *ctx, __isl_keep isl_hmap_map_basic_set *hmap, __isl_take isl_map *key, __isl_take isl_basic_set *val) { struct isl_hash_table_entry *entry; struct isl_map_basic_set_pair *pair; uint32_t hash; hash = isl_map_get_hash(key); entry = isl_hash_table_find(ctx, &hmap->table, hash, &has_key, key, 1); if (!entry) goto error; if (entry->data) { pair = entry->data; isl_basic_set_free(pair->val); pair->val = val; isl_map_free(key); return 0; } pair = isl_alloc_type(ctx, struct isl_map_basic_set_pair); if (!pair) goto error; entry->data = pair; pair->key = key; pair->val = val; return 0; error: isl_map_free(key); isl_basic_set_free(val); return -1; } cloog-0.18.2/isl/configure.ac0000664000175000017500000002121112254313240012676 00000000000000AC_INIT([isl], [0.12.1], [isl-development@googlegroups.com]) AC_CONFIG_AUX_DIR([.]) AC_CONFIG_MACRO_DIR([m4]) AM_INIT_AUTOMAKE([foreign]) m4_ifdef([AM_SILENT_RULES],[AM_SILENT_RULES([yes])]) AC_SUBST(versioninfo) versioninfo=12:1:2 if test "x$prefix" != "xNONE"; then prefix_wd=`cd $prefix && pwd` srcdir_wd=`cd $srcdir && pwd` wd=`pwd` if test "x$prefix_wd" = "x$srcdir_wd"; then AC_MSG_ERROR(Installation in source directory not supported) fi if test "x$prefix_wd" = "x$wd"; then AC_MSG_ERROR(Installation in build directory not supported) fi fi AC_PROG_CC AC_PROG_CXX AX_CC_MAXOPT AX_GCC_WARN_UNUSED_RESULT AX_C___ATTRIBUTE__ AC_PROG_LIBTOOL AC_CHECK_PROG(PERL, perl, perl, []) AC_CHECK_PROG(PDFLATEX, pdflatex, pdflatex, []) AC_CHECK_PROG(POD2HTML, pod2html, pod2html, []) AM_CONDITIONAL(GENERATE_DOC, test -n "$PERL" -a -n "$PDFLATEX" -a -n "$POD2HTML") AX_CREATE_STDINT_H(include/isl/stdint.h) AX_SUBMODULE(gmp,system|build,system) AC_SUBST(GMP_CPPFLAGS) AC_SUBST(GMP_LDFLAGS) AC_SUBST(GMP_LIBS) case "$with_gmp" in system) if test "x$with_gmp_prefix" != "x"; then isl_configure_args="$isl_configure_args --with-gmp=$with_gmp_prefix" GMP_CPPFLAGS="-I$with_gmp_prefix/include" GMP_LDFLAGS="-L$with_gmp_prefix/lib" fi GMP_LIBS=-lgmp SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$GMP_CPPFLAGS $CPPFLAGS" LDFLAGS="$GMP_LDFLAGS $LDFLAGS" LIBS="$GMP_LIBS $LIBS" AC_CHECK_HEADER([gmp.h], [], [AC_ERROR([gmp.h header not found])]) AC_CHECK_LIB([gmp], [main], [], [AC_ERROR([gmp library not found])]) AC_LINK_IFELSE([AC_LANG_PROGRAM([[#include ]], [[ mpz_t n, d; if (mpz_divisible_p(n, d)) mpz_divexact_ui(n, n, 4); ]])], [], [AC_ERROR([gmp library too old])]) CPPFLAGS="$SAVE_CPPFLAGS" LDFLAGS="$SAVE_LDFLAGS" LIBS="$SAVE_LIBS" ;; build) GMP_CPPFLAGS="-I$gmp_srcdir -I$with_gmp_builddir" GMP_LIBS="$with_gmp_builddir/libgmp.la" ;; esac SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$GMP_CPPFLAGS $CPPFLAGS" LDFLAGS="$GMP_LDFLAGS $LDFLAGS" LIBS="$GMP_LIBS $LIBS" need_get_memory_functions=false AC_CHECK_DECLS(mp_get_memory_functions,[],[ need_get_memory_functions=true ],[#include ]) AC_RUN_IFELSE([AC_LANG_PROGRAM([[#include ]], [[ mpz_t x,y,g,a,b; mpz_init(x); mpz_init(y); mpz_init(g); mpz_init(a); mpz_init(b); mpz_set_si(x, -1); mpz_set_si(y, 9); mpz_gcdext(g, a, b, x, y); if (mpz_get_si(a) == -1 && mpz_get_si(b) == 0) return 0; else return 1; ]])], [need_normalized_gcdext=false], [need_normalized_gcdext=true], [need_normalized_gcdext=true]) CPPFLAGS="$SAVE_CPPFLAGS" LDFLAGS="$SAVE_LDFLAGS" LIBS="$SAVE_LIBS" AM_CONDITIONAL(NEED_GET_MEMORY_FUNCTIONS, test x$need_get_memory_functions = xtrue) if test $need_normalized_gcdext = true; then AC_DEFINE([GMP_NORMALIZE_GCDEXT], [], [result of mpz_gcdext needs to be normalized]) fi AX_SUBMODULE(piplib,no|system|build,no) have_piplib=false AC_SUBST(PIPLIB_CPPFLAGS) AC_SUBST(PIPLIB_LDFLAGS) AC_SUBST(PIPLIB_LIBS) case "$with_piplib" in build) PIPLIB_CPPFLAGS="-I$piplib_srcdir/include" PIPLIB_LIBS="$with_piplib_builddir/libpiplibMP.la" ;; system) PIPLIB_LIBS="-lpiplibMP" if test "x$with_piplib_prefix" != "x"; then PIPLIB_CPPFLAGS="-I$with_piplib_prefix/include" PIPLIB_LDFLAGS="-L$with_piplib_prefix/lib" fi SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" CPPFLAGS="$PIPLIB_CPPFLAGS $CPPFLAGS" LDFLAGS="$PIPLIB_LDFLAGS $LDFLAGS" AC_CHECK_LIB(piplibMP, pip_solve,[ AC_CHECK_MEMBER(PipOptions.Urs_parms, [], [ AC_MSG_ERROR([Piplib too old; please install version 1.3.6 or newer]) ],[#include ]) ],[ AC_MSG_ERROR([Piplib not found]) ]) CPPFLAGS="$SAVE_CPPFLAGS" LDFLAGS="$SAVE_LDFLAGS" ;; no) ;; *) AC_MSG_ERROR(unsupported) ;; esac if test "$with_piplib" != "no"; then AC_DEFINE(ISL_PIPLIB,,piplib is available) have_piplib=true fi AM_CONDITIONAL(HAVE_PIPLIB, test x$have_piplib = xtrue) AC_SUBST(CLANG_CXXFLAGS) AC_SUBST(CLANG_LDFLAGS) AC_SUBST(CLANG_LIBS) AX_SUBMODULE(clang,system|no,no) case "$with_clang" in system) AC_PROG_GREP llvm_config="llvm-config" AC_CHECK_PROG([llvm_config_found], ["$llvm_config"], [yes]) if test "x$with_clang_prefix" != "x"; then llvm_config="$with_clang_prefix/bin/llvm-config" if test -x "$llvm_config"; then llvm_config_found=yes fi fi if test "$llvm_config_found" != yes; then AC_MSG_ERROR([llvm-config not found]) fi CLANG_CXXFLAGS=`$llvm_config --cxxflags` CLANG_LDFLAGS=`$llvm_config --ldflags` targets=`$llvm_config --targets-built` components="$targets asmparser bitreader support mc" $llvm_config --components | $GREP option > /dev/null 2> /dev/null if test $? -eq 0; then components="$components option" fi CLANG_LIBS=`$llvm_config --libs $components` CLANG_PREFIX=`$llvm_config --prefix` AC_DEFINE_UNQUOTED(CLANG_PREFIX, ["$CLANG_PREFIX"], [Clang installation prefix]) SAVE_CPPFLAGS="$CPPFLAGS" CPPFLAGS="$CLANG_CXXFLAGS $CPPFLAGS" AC_LANG_PUSH(C++) AC_CHECK_HEADER([clang/Basic/SourceLocation.h], [], [AC_ERROR([clang header file not found])]) AC_EGREP_HEADER([getDefaultTargetTriple], [llvm/Support/Host.h], [], [AC_DEFINE([getDefaultTargetTriple], [getHostTriple], [Define to getHostTriple for older versions of clang])]) AC_EGREP_HEADER([getExpansionLineNumber], [clang/Basic/SourceLocation.h], [], [AC_DEFINE([getExpansionLineNumber], [getInstantiationLineNumber], [Define to getInstantiationLineNumber for older versions of clang])]) AC_EGREP_HEADER([DiagnosticsEngine], [clang/Basic/Diagnostic.h], [], [AC_DEFINE([DiagnosticsEngine], [Diagnostic], [Define to Diagnostic for older versions of clang])]) AC_EGREP_HEADER([ArrayRef], [clang/Driver/Driver.h], [AC_DEFINE([USE_ARRAYREF], [], [Define if Driver::BuildCompilation takes ArrayRef])]) AC_EGREP_HEADER([CXXIsProduction], [clang/Driver/Driver.h], [AC_DEFINE([HAVE_CXXISPRODUCTION], [], [Define if Driver constructor takes CXXIsProduction argument])]) AC_EGREP_HEADER([ IsProduction], [clang/Driver/Driver.h], [AC_DEFINE([HAVE_ISPRODUCTION], [], [Define if Driver constructor takes IsProduction argument])]) AC_EGREP_HEADER([void HandleTopLevelDecl\(], [clang/AST/ASTConsumer.h], [AC_DEFINE([HandleTopLevelDeclReturn], [void], [Return type of HandleTopLevelDeclReturn]) AC_DEFINE([HandleTopLevelDeclContinue], [], [Return type of HandleTopLevelDeclReturn])], [AC_DEFINE([HandleTopLevelDeclReturn], [bool], [Return type of HandleTopLevelDeclReturn]) AC_DEFINE([HandleTopLevelDeclContinue], [true], [Return type of HandleTopLevelDeclReturn])]) AC_CHECK_HEADER([clang/Basic/DiagnosticOptions.h], [AC_DEFINE([HAVE_BASIC_DIAGNOSTICOPTIONS_H], [], [Define if clang/Basic/DiagnosticOptions.h exists])]) AC_TRY_COMPILE([#include ], [ using namespace clang; TargetOptions *TO; DiagnosticsEngine *Diags; TargetInfo::CreateTargetInfo(*Diags, TO); ], [AC_DEFINE([CREATETARGETINFO_TAKES_POINTER], [], [Define if TargetInfo::CreateTargetInfo takes pointer])]) AC_TRY_COMPILE([#include ], [ using namespace clang; DiagnosticConsumer *client; CompilerInstance *Clang; Clang->createDiagnostics(client); ], [], [AC_DEFINE([CREATEDIAGNOSTICS_TAKES_ARG], [], [Define if CompilerInstance::createDiagnostics takes argc and argv])]) AC_TRY_COMPILE([#include ], [ using namespace clang; HeaderSearchOptions HSO; HSO.AddPath("", frontend::Angled, false, false); ], [AC_DEFINE([ADDPATH_TAKES_4_ARGUMENTS], [], [Define if HeaderSearchOptions::AddPath takes 4 arguments])]) AC_LANG_POP CPPFLAGS="$SAVE_CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" LDFLAGS="$CLANG_LDFLAGS $LDFLAGS" AC_SUBST(LIB_CLANG_EDIT) AC_CHECK_LIB([clangEdit], [main], [LIB_CLANG_EDIT=-lclangEdit], []) LDFLAGS="$SAVE_LDFLAGS" ;; esac AM_CONDITIONAL(HAVE_CLANG, test $with_clang = system) AX_SET_WARNING_FLAGS AC_SUBST(WARNING_FLAGS) PACKAGE_CFLAGS="$GMP_CPPFLAGS" PACKAGE_LDFLAGS="$GMP_LDFLAGS" PACKAGE_LIBS="-lisl -lgmp" AX_CREATE_PKGCONFIG_INFO AX_DETECT_GIT_HEAD echo '#define GIT_HEAD_ID "'$GIT_HEAD_ID'"' > gitversion.h AH_BOTTOM([#include ]) AC_CONFIG_HEADERS(isl_config.h) AC_CONFIG_HEADERS(include/isl/config.h) AC_CONFIG_FILES(Makefile) AC_CONFIG_FILES(doc/Makefile) if test $with_clang = system; then AC_CONFIG_FILES(interface/Makefile) fi AC_CONFIG_FILES([bound_test.sh], [chmod +x bound_test.sh]) AC_CONFIG_FILES([codegen_test.sh], [chmod +x codegen_test.sh]) AC_CONFIG_FILES([pip_test.sh], [chmod +x pip_test.sh]) AC_CONFIG_COMMANDS_POST([ dnl pass on arguments to subdir configures, but don't dnl add them to config.status ac_configure_args="$ac_configure_args $isl_configure_args" ]) AC_OUTPUT cloog-0.18.2/isl/isl_lp.c0000664000175000017500000002252712254313240012051 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include "isl_lp_piplib.h" #include #include "isl_tab.h" #include #include #include #include #include enum isl_lp_result isl_tab_solve_lp(struct isl_basic_map *bmap, int maximize, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) { struct isl_tab *tab; enum isl_lp_result res; unsigned dim = isl_basic_map_total_dim(bmap); if (maximize) isl_seq_neg(f, f, 1 + dim); bmap = isl_basic_map_gauss(bmap, NULL); tab = isl_tab_from_basic_map(bmap, 0); res = isl_tab_min(tab, f, denom, opt, opt_denom, 0); if (res == isl_lp_ok && sol) { *sol = isl_tab_get_sample_value(tab); if (!*sol) res = isl_lp_error; } isl_tab_free(tab); if (maximize) isl_seq_neg(f, f, 1 + dim); if (maximize && opt) isl_int_neg(*opt, *opt); return res; } /* Given a basic map "bmap" and an affine combination of the variables "f" * with denominator "denom", set *opt / *opt_denom to the minimal * (or maximal if "maximize" is true) value attained by f/d over "bmap", * assuming the basic map is not empty and the expression cannot attain * arbitrarily small (or large) values. * If opt_denom is NULL, then *opt is rounded up (or down) * to the nearest integer. * The return value reflects the nature of the result (empty, unbounded, * minmimal or maximal value returned in *opt). */ enum isl_lp_result isl_basic_map_solve_lp(struct isl_basic_map *bmap, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) { if (sol) *sol = NULL; if (!bmap) return isl_lp_error; switch (bmap->ctx->opt->lp_solver) { case ISL_LP_PIP: return isl_pip_solve_lp(bmap, max, f, d, opt, opt_denom, sol); case ISL_LP_TAB: return isl_tab_solve_lp(bmap, max, f, d, opt, opt_denom, sol); default: return isl_lp_error; } } enum isl_lp_result isl_basic_set_solve_lp(struct isl_basic_set *bset, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) { return isl_basic_map_solve_lp((struct isl_basic_map *)bset, max, f, d, opt, opt_denom, sol); } enum isl_lp_result isl_map_solve_lp(__isl_keep isl_map *map, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) { int i; isl_int o; isl_int t; isl_int opt_i; isl_int opt_denom_i; enum isl_lp_result res; int max_div; isl_vec *v = NULL; if (!map) return isl_lp_error; if (map->n == 0) return isl_lp_empty; max_div = 0; for (i = 0; i < map->n; ++i) if (map->p[i]->n_div > max_div) max_div = map->p[i]->n_div; if (max_div > 0) { unsigned total = isl_space_dim(map->dim, isl_dim_all); v = isl_vec_alloc(map->ctx, 1 + total + max_div); if (!v) return isl_lp_error; isl_seq_cpy(v->el, f, 1 + total); isl_seq_clr(v->el + 1 + total, max_div); f = v->el; } if (!opt && map->n > 1 && sol) { isl_int_init(o); opt = &o; } if (map->n > 0) isl_int_init(opt_i); if (map->n > 0 && opt_denom) { isl_int_init(opt_denom_i); isl_int_init(t); } res = isl_basic_map_solve_lp(map->p[0], max, f, d, opt, opt_denom, sol); if (res == isl_lp_error || res == isl_lp_unbounded) goto done; if (sol) *sol = NULL; for (i = 1; i < map->n; ++i) { isl_vec *sol_i = NULL; enum isl_lp_result res_i; int better; res_i = isl_basic_map_solve_lp(map->p[i], max, f, d, &opt_i, opt_denom ? &opt_denom_i : NULL, sol ? &sol_i : NULL); if (res_i == isl_lp_error || res_i == isl_lp_unbounded) { res = res_i; goto done; } if (res_i == isl_lp_empty) continue; if (res == isl_lp_empty) { better = 1; } else if (!opt_denom) { if (max) better = isl_int_gt(opt_i, *opt); else better = isl_int_lt(opt_i, *opt); } else { isl_int_mul(t, opt_i, *opt_denom); isl_int_submul(t, *opt, opt_denom_i); if (max) better = isl_int_is_pos(t); else better = isl_int_is_neg(t); } if (better) { res = res_i; if (opt) isl_int_set(*opt, opt_i); if (opt_denom) isl_int_set(*opt_denom, opt_denom_i); if (sol) { isl_vec_free(*sol); *sol = sol_i; } } else isl_vec_free(sol_i); } done: isl_vec_free(v); if (map->n > 0 && opt_denom) { isl_int_clear(opt_denom_i); isl_int_clear(t); } if (map->n > 0) isl_int_clear(opt_i); if (opt == &o) isl_int_clear(o); return res; } enum isl_lp_result isl_set_solve_lp(__isl_keep isl_set *set, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) { return isl_map_solve_lp((struct isl_map *)set, max, f, d, opt, opt_denom, sol); } /* Return the optimal (rational) value of "obj" over "bset", assuming * that "obj" and "bset" have aligned parameters and divs. * If "max" is set, then the maximal value is computed. * Otherwise, the minimal value is computed. * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. * * Call isl_basic_set_solve_lp and translate the results. */ static __isl_give isl_val *basic_set_opt_lp( __isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj) { isl_ctx *ctx; isl_val *res; enum isl_lp_result lp_res; if (!bset || !obj) return NULL; ctx = isl_aff_get_ctx(obj); res = isl_val_alloc(ctx); if (!res) return NULL; lp_res = isl_basic_set_solve_lp(bset, max, obj->v->el + 1, obj->v->el[0], &res->n, &res->d, NULL); if (lp_res == isl_lp_ok) return isl_val_normalize(res); isl_val_free(res); if (lp_res == isl_lp_error) return NULL; if (lp_res == isl_lp_empty) return isl_val_nan(ctx); if (max) return isl_val_infty(ctx); else return isl_val_neginfty(ctx); } /* Return the optimal (rational) value of "obj" over "bset", assuming * that "obj" and "bset" have aligned parameters. * If "max" is set, then the maximal value is computed. * Otherwise, the minimal value is computed. * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. * * Align the divs of "bset" and "obj" and call basic_set_opt_lp. */ static __isl_give isl_val *isl_basic_set_opt_lp_val_aligned( __isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj) { int *exp1 = NULL; int *exp2 = NULL; isl_ctx *ctx; isl_mat *bset_div = NULL; isl_mat *div = NULL; isl_val *res; int bset_n_div, obj_n_div; if (!bset || !obj) return NULL; ctx = isl_aff_get_ctx(obj); if (!isl_space_is_equal(bset->dim, obj->ls->dim)) isl_die(ctx, isl_error_invalid, "spaces don't match", return NULL); bset_n_div = isl_basic_set_dim(bset, isl_dim_div); obj_n_div = isl_aff_dim(obj, isl_dim_div); if (bset_n_div == 0 && obj_n_div == 0) return basic_set_opt_lp(bset, max, obj); bset = isl_basic_set_copy(bset); obj = isl_aff_copy(obj); bset_div = isl_basic_set_get_divs(bset); exp1 = isl_alloc_array(ctx, int, bset_n_div); exp2 = isl_alloc_array(ctx, int, obj_n_div); if (!bset_div || (bset_n_div && !exp1) || (obj_n_div && !exp2)) goto error; div = isl_merge_divs(bset_div, obj->ls->div, exp1, exp2); bset = isl_basic_set_expand_divs(bset, isl_mat_copy(div), exp1); obj = isl_aff_expand_divs(obj, isl_mat_copy(div), exp2); res = basic_set_opt_lp(bset, max, obj); isl_mat_free(bset_div); isl_mat_free(div); free(exp1); free(exp2); isl_basic_set_free(bset); isl_aff_free(obj); return res; error: isl_mat_free(div); isl_mat_free(bset_div); free(exp1); free(exp2); isl_basic_set_free(bset); isl_aff_free(obj); return NULL; } /* Return the optimal (rational) value of "obj" over "bset". * If "max" is set, then the maximal value is computed. * Otherwise, the minimal value is computed. * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. */ static __isl_give isl_val *isl_basic_set_opt_lp_val( __isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj) { isl_val *res; if (!bset || !obj) return NULL; if (isl_space_match(bset->dim, isl_dim_param, obj->ls->dim, isl_dim_param)) return isl_basic_set_opt_lp_val_aligned(bset, max, obj); bset = isl_basic_set_copy(bset); obj = isl_aff_copy(obj); bset = isl_basic_set_align_params(bset, isl_aff_get_domain_space(obj)); obj = isl_aff_align_params(obj, isl_basic_set_get_space(bset)); res = isl_basic_set_opt_lp_val_aligned(bset, max, obj); isl_basic_set_free(bset); isl_aff_free(obj); return res; } /* Return the minimal (rational) value of "obj" over "bset". * * Return negative infinity if the minimal value is unbounded and * NaN if "bset" is empty. */ __isl_give isl_val *isl_basic_set_min_lp_val(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj) { return isl_basic_set_opt_lp_val(bset, 0, obj); } /* Return the maximal (rational) value of "obj" over "bset". * * Return infinity if the maximal value is unbounded and * NaN if "bset" is empty. */ __isl_give isl_val *isl_basic_set_max_lp_val(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj) { return isl_basic_set_opt_lp_val(bset, 1, obj); } cloog-0.18.2/isl/basis_reduction_tab.c0000664000175000017500000001476312254313240014575 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include "isl_tab.h" struct tab_lp { struct isl_ctx *ctx; struct isl_vec *row; struct isl_tab *tab; struct isl_tab_undo **stack; isl_int *obj; isl_int opt; isl_int opt_denom; isl_int tmp; isl_int tmp2; int neq; unsigned dim; /* number of constraints in initial product tableau */ int con_offset; /* objective function has fixed or no integer value */ int is_fixed; }; static struct tab_lp *init_lp(struct isl_tab *tab); static void set_lp_obj(struct tab_lp *lp, isl_int *row, int dim); static int solve_lp(struct tab_lp *lp); static void get_obj_val(struct tab_lp* lp, mpq_t *F); static void delete_lp(struct tab_lp *lp); static int add_lp_row(struct tab_lp *lp, isl_int *row, int dim); static void get_alpha(struct tab_lp* lp, int row, mpq_t *alpha); static int del_lp_row(struct tab_lp *lp) WARN_UNUSED; static int cut_lp_to_hyperplane(struct tab_lp *lp, isl_int *row); #define GBR_LP struct tab_lp #define GBR_type mpq_t #define GBR_init(v) mpq_init(v) #define GBR_clear(v) mpq_clear(v) #define GBR_set(a,b) mpq_set(a,b) #define GBR_set_ui(a,b) mpq_set_ui(a,b,1) #define GBR_mul(a,b,c) mpq_mul(a,b,c) #define GBR_lt(a,b) (mpq_cmp(a,b) < 0) #define GBR_is_zero(a) (mpq_sgn(a) == 0) #define GBR_floor(a,b) mpz_fdiv_q(a,mpq_numref(b),mpq_denref(b)) #define GBR_ceil(a,b) mpz_cdiv_q(a,mpq_numref(b),mpq_denref(b)) #define GBR_lp_init(P) init_lp(P) #define GBR_lp_set_obj(lp, obj, dim) set_lp_obj(lp, obj, dim) #define GBR_lp_solve(lp) solve_lp(lp) #define GBR_lp_get_obj_val(lp, F) get_obj_val(lp, F) #define GBR_lp_delete(lp) delete_lp(lp) #define GBR_lp_next_row(lp) lp->neq #define GBR_lp_add_row(lp, row, dim) add_lp_row(lp, row, dim) #define GBR_lp_get_alpha(lp, row, alpha) get_alpha(lp, row, alpha) #define GBR_lp_del_row(lp) del_lp_row(lp) #define GBR_lp_is_fixed(lp) (lp)->is_fixed #define GBR_lp_cut(lp, obj) cut_lp_to_hyperplane(lp, obj) #include "basis_reduction_templ.c" /* Set up a tableau for the Cartesian product of bset with itself. * This could be optimized by first setting up a tableau for bset * and then performing the Cartesian product on the tableau. */ static struct isl_tab *gbr_tab(struct isl_tab *tab, struct isl_vec *row) { unsigned dim; struct isl_tab *prod; if (!tab || !row) return NULL; dim = tab->n_var; prod = isl_tab_product(tab, tab); if (isl_tab_extend_cons(prod, 3 * dim + 1) < 0) { isl_tab_free(prod); return NULL; } return prod; } static struct tab_lp *init_lp(struct isl_tab *tab) { struct tab_lp *lp = NULL; if (!tab) return NULL; lp = isl_calloc_type(tab->mat->ctx, struct tab_lp); if (!lp) return NULL; isl_int_init(lp->opt); isl_int_init(lp->opt_denom); isl_int_init(lp->tmp); isl_int_init(lp->tmp2); lp->dim = tab->n_var; lp->ctx = tab->mat->ctx; isl_ctx_ref(lp->ctx); lp->stack = isl_alloc_array(lp->ctx, struct isl_tab_undo *, lp->dim); lp->row = isl_vec_alloc(lp->ctx, 1 + 2 * lp->dim); if (!lp->row) goto error; lp->tab = gbr_tab(tab, lp->row); if (!lp->tab) goto error; lp->con_offset = lp->tab->n_con; lp->obj = NULL; lp->neq = 0; return lp; error: delete_lp(lp); return NULL; } static void set_lp_obj(struct tab_lp *lp, isl_int *row, int dim) { lp->obj = row; } static int solve_lp(struct tab_lp *lp) { enum isl_lp_result res; unsigned flags = 0; lp->is_fixed = 0; isl_int_set_si(lp->row->el[0], 0); isl_seq_cpy(lp->row->el + 1, lp->obj, lp->dim); isl_seq_neg(lp->row->el + 1 + lp->dim, lp->obj, lp->dim); if (lp->neq) flags = ISL_TAB_SAVE_DUAL; res = isl_tab_min(lp->tab, lp->row->el, lp->ctx->one, &lp->opt, &lp->opt_denom, flags); isl_int_mul_ui(lp->opt_denom, lp->opt_denom, 2); if (isl_int_abs_lt(lp->opt, lp->opt_denom)) { struct isl_vec *sample = isl_tab_get_sample_value(lp->tab); if (!sample) return -1; isl_seq_inner_product(lp->obj, sample->el + 1, lp->dim, &lp->tmp); isl_seq_inner_product(lp->obj, sample->el + 1 + lp->dim, lp->dim, &lp->tmp2); isl_int_cdiv_q(lp->tmp, lp->tmp, sample->el[0]); isl_int_fdiv_q(lp->tmp2, lp->tmp2, sample->el[0]); if (isl_int_ge(lp->tmp, lp->tmp2)) lp->is_fixed = 1; isl_vec_free(sample); } isl_int_divexact_ui(lp->opt_denom, lp->opt_denom, 2); if (res != isl_lp_ok) return -1; return 0; } /* The current objective function has a fixed (or no) integer value. * Cut the tableau to the hyperplane that fixes this value in * both halves of the tableau. * Return 1 if the resulting tableau is empty. */ static int cut_lp_to_hyperplane(struct tab_lp *lp, isl_int *row) { enum isl_lp_result res; isl_int_set_si(lp->row->el[0], 0); isl_seq_cpy(lp->row->el + 1, row, lp->dim); isl_seq_clr(lp->row->el + 1 + lp->dim, lp->dim); res = isl_tab_min(lp->tab, lp->row->el, lp->ctx->one, &lp->tmp, NULL, 0); if (res != isl_lp_ok) return -1; isl_int_neg(lp->row->el[0], lp->tmp); if (isl_tab_add_eq(lp->tab, lp->row->el) < 0) return -1; isl_seq_cpy(lp->row->el + 1 + lp->dim, row, lp->dim); isl_seq_clr(lp->row->el + 1, lp->dim); if (isl_tab_add_eq(lp->tab, lp->row->el) < 0) return -1; lp->con_offset += 2; return lp->tab->empty; } static void get_obj_val(struct tab_lp* lp, mpq_t *F) { isl_int_neg(mpq_numref(*F), lp->opt); isl_int_set(mpq_denref(*F), lp->opt_denom); } static void delete_lp(struct tab_lp *lp) { if (!lp) return; isl_int_clear(lp->opt); isl_int_clear(lp->opt_denom); isl_int_clear(lp->tmp); isl_int_clear(lp->tmp2); isl_vec_free(lp->row); free(lp->stack); isl_tab_free(lp->tab); isl_ctx_deref(lp->ctx); free(lp); } static int add_lp_row(struct tab_lp *lp, isl_int *row, int dim) { lp->stack[lp->neq] = isl_tab_snap(lp->tab); isl_int_set_si(lp->row->el[0], 0); isl_seq_cpy(lp->row->el + 1, row, lp->dim); isl_seq_neg(lp->row->el + 1 + lp->dim, row, lp->dim); if (isl_tab_add_valid_eq(lp->tab, lp->row->el) < 0) return -1; return lp->neq++; } static void get_alpha(struct tab_lp* lp, int row, mpq_t *alpha) { row += lp->con_offset; isl_int_neg(mpq_numref(*alpha), lp->tab->dual->el[1 + row]); isl_int_set(mpq_denref(*alpha), lp->tab->dual->el[0]); } static int del_lp_row(struct tab_lp *lp) { lp->neq--; return isl_tab_rollback(lp->tab, lp->stack[lp->neq]); } cloog-0.18.2/isl/isl_schedule_private.h0000664000175000017500000000224612254313240014765 00000000000000#ifndef ISL_SCHEDLUE_PRIVATE_H #define ISL_SCHEDLUE_PRIVATE_H #include #include /* The schedule for an individual domain, plus information about the bands * and scheduling dimensions. * In particular, we keep track of the number of bands and for each * band, the starting position of the next band. The first band starts at * position 0. * For each scheduling dimension, we keep track of whether it result * in zero dependence distances (within its band) with respect * to the proximity edges. */ struct isl_schedule_node { isl_multi_aff *sched; int n_band; int *band_end; int *band_id; int *zero; }; /* Information about the computed schedule. * n is the number of nodes/domains/statements. * n_band is the maximal number of bands. * n_total_row is the number of coordinates of the schedule. * dim contains a description of the parameters. * band_forest points to a band forest representation of the schedule * and may be NULL if the forest hasn't been created yet. */ struct isl_schedule { int ref; int n; int n_band; int n_total_row; isl_space *dim; isl_band_list *band_forest; struct isl_schedule_node node[1]; }; #endif cloog-0.18.2/isl/isl_config_post.h0000664000175000017500000000007312254313240013745 00000000000000#ifndef HAVE___ATTRIBUTE__ #define __attribute__(x) #endif cloog-0.18.2/isl/include/0000775000175000017500000000000012254314446012127 500000000000000cloog-0.18.2/isl/include/isl/0000775000175000017500000000000012254314446012716 500000000000000cloog-0.18.2/isl/include/isl/id.h0000664000175000017500000000151212254313240013371 00000000000000#ifndef ISL_ID_H #define ISL_ID_H #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_id; typedef struct isl_id isl_id; ISL_DECLARE_LIST(id) isl_ctx *isl_id_get_ctx(__isl_keep isl_id *id); __isl_give isl_id *isl_id_alloc(isl_ctx *ctx, __isl_keep const char *name, void *user); __isl_give isl_id *isl_id_copy(isl_id *id); void *isl_id_free(__isl_take isl_id *id); void *isl_id_get_user(__isl_keep isl_id *id); __isl_keep const char *isl_id_get_name(__isl_keep isl_id *id); __isl_give isl_id *isl_id_set_free_user(__isl_take isl_id *id, __isl_give void (*free_user)(void *user)); __isl_give isl_printer *isl_printer_print_id(__isl_take isl_printer *p, __isl_keep isl_id *id); void isl_id_dump(__isl_keep isl_id *id); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/map.h0000664000175000017500000007365212254313240013570 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_MAP_H #define ISL_MAP_H #include #include #include #include #include #include #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif /* General notes: * * All structures are reference counted to allow reuse without duplication. * A *_copy operation will increase the reference count, while a *_free * operation will decrease the reference count and only actually release * the structures when the reference count drops to zero. * * Functions that return an isa structure will in general _destroy_ * all argument isa structures (the obvious execption begin the _copy * functions). A pointer passed to such a function may therefore * never be used after the function call. If you want to keep a * reference to the old structure(s), use the appropriate _copy function. */ unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap); unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap); unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap); unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap); unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap); unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap, enum isl_dim_type type); unsigned isl_map_n_in(const struct isl_map *map); unsigned isl_map_n_out(const struct isl_map *map); unsigned isl_map_n_param(const struct isl_map *map); unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type); isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap); isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map); __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap); __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map); __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap, int pos); __isl_give isl_local_space *isl_basic_map_get_local_space( __isl_keep isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_set_tuple_name( __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s); const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap, enum isl_dim_type type); int isl_map_has_tuple_name(__isl_keep isl_map *map, enum isl_dim_type type); const char *isl_map_get_tuple_name(__isl_keep isl_map *map, enum isl_dim_type type); __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map, enum isl_dim_type type, const char *s); const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); int isl_map_has_dim_name(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); const char *isl_map_get_dim_name(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); __isl_give isl_basic_map *isl_basic_map_set_dim_name( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); int isl_map_has_dim_id(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map, enum isl_dim_type type); int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type); __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type); int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type, __isl_keep isl_id *id); int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type, const char *name); int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap); struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned in, unsigned out, unsigned extra, unsigned n_eq, unsigned n_ineq); __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim); struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model); struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap); void *isl_basic_map_free(__isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_copy(__isl_keep isl_basic_map *bmap); struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base, unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra, unsigned n_eq, unsigned n_ineq); struct isl_basic_map *isl_basic_map_extend_constraints( struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq); __isl_give isl_basic_map *isl_basic_map_equal( __isl_take isl_space *dim, unsigned n_equal); __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim, unsigned pos); __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim, unsigned pos); __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim); struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model); struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model); __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim); __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim); __isl_give isl_basic_map *isl_basic_map_universe_like( __isl_keep isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_remove_redundancies( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_remove_redundancies(__isl_take isl_map *map); __isl_give isl_basic_map *isl_map_simple_hull(__isl_take isl_map *map); __isl_give isl_basic_map *isl_map_unshifted_simple_hull( __isl_take isl_map *map); __isl_export __isl_give isl_basic_map *isl_basic_map_intersect_domain( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *bset); __isl_export __isl_give isl_basic_map *isl_basic_map_intersect_range( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *bset); __isl_export __isl_give isl_basic_map *isl_basic_map_intersect( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_export __isl_give isl_map *isl_basic_map_union( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_export __isl_give isl_basic_map *isl_basic_map_apply_domain( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_export __isl_give isl_basic_map *isl_basic_map_apply_range( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_export __isl_give isl_basic_map *isl_basic_map_affine_hull( __isl_take isl_basic_map *bmap); __isl_export __isl_give isl_basic_map *isl_basic_map_reverse(__isl_take isl_basic_map *bmap); __isl_give isl_basic_set *isl_basic_map_domain(__isl_take isl_basic_map *bmap); __isl_give isl_basic_set *isl_basic_map_range(__isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_domain_map( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_range_map( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_remove_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map *isl_basic_map_eliminate( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map *isl_basic_map_from_basic_set( __isl_take isl_basic_set *bset, __isl_take isl_space *dim); struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap); __isl_export __isl_give isl_basic_map *isl_basic_map_sample(__isl_take isl_basic_map *bmap); struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap); __isl_export __isl_give isl_basic_map *isl_basic_map_detect_equalities( __isl_take isl_basic_map *bmap); __isl_give isl_basic_map *isl_basic_map_read_from_file(isl_ctx *ctx, FILE *input); __isl_constructor __isl_give isl_basic_map *isl_basic_map_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_map *isl_map_read_from_file(isl_ctx *ctx, FILE *input); __isl_constructor __isl_give isl_map *isl_map_read_from_str(isl_ctx *ctx, const char *str); void isl_basic_map_dump(__isl_keep isl_basic_map *bmap); void isl_basic_map_print(__isl_keep isl_basic_map *bmap, FILE *out, int indent, const char *prefix, const char *suffix, unsigned output_format); void isl_map_dump(__isl_keep isl_map *map); void isl_map_print(__isl_keep isl_map *map, FILE *out, int indent, unsigned output_format); __isl_give isl_printer *isl_printer_print_basic_map( __isl_take isl_printer *printer, __isl_keep isl_basic_map *bmap); __isl_give isl_printer *isl_printer_print_map(__isl_take isl_printer *printer, __isl_keep isl_map *map); __isl_give isl_basic_map *isl_basic_map_fix_si(__isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_basic_map *isl_basic_map_fix_val(__isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); __isl_give isl_basic_map *isl_basic_map_lower_bound_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_basic_map *isl_basic_map_upper_bound_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value); struct isl_basic_map *isl_basic_map_sum( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2); struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap); struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap, isl_int d); struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2); struct isl_map *isl_map_neg(struct isl_map *map); struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d); __isl_give isl_map *isl_map_floordiv_val(__isl_take isl_map *map, __isl_take isl_val *d); __isl_export int isl_basic_map_is_equal( __isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); __isl_give isl_map *isl_basic_map_partial_lexmax( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_map *isl_basic_map_partial_lexmin( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_map *isl_map_partial_lexmax( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty); __isl_give isl_map *isl_map_partial_lexmin( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty); __isl_export __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap); __isl_export __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap); __isl_export __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map); __isl_export __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map); __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff( __isl_take isl_basic_map *bmap); __isl_give isl_pw_multi_aff *isl_map_lexmin_pw_multi_aff( __isl_take isl_map *map); __isl_give isl_pw_multi_aff *isl_map_lexmax_pw_multi_aff( __isl_take isl_map *map); void isl_basic_map_print_internal(__isl_keep isl_basic_map *bmap, FILE *out, int indent); struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map); __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map, __isl_keep isl_basic_map *bmap); int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, isl_int *val); __isl_give isl_val *isl_basic_map_plain_get_val_if_fixed( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos); int isl_basic_map_image_is_bounded(__isl_keep isl_basic_map *bmap); int isl_basic_map_is_universe(__isl_keep isl_basic_map *bmap); int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap); int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap); __isl_export int isl_basic_map_is_empty(__isl_keep isl_basic_map *bmap); __isl_export int isl_basic_map_is_subset(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); int isl_basic_map_is_strict_subset(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2); struct isl_map *isl_map_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned in, unsigned out, int n, unsigned flags); __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim); __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim); __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim); struct isl_map *isl_map_empty_like(struct isl_map *model); struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model); struct isl_map *isl_map_dup(struct isl_map *map); __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map, __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim); struct isl_map *isl_map_identity_like(struct isl_map *model); struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model); __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n); __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n); __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim); __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim); __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n); __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n); __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim); __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim); struct isl_map *isl_map_finalize(struct isl_map *map); void *isl_map_free(__isl_take isl_map *map); __isl_give isl_map *isl_map_copy(__isl_keep isl_map *map); struct isl_map *isl_map_extend(struct isl_map *base, unsigned nparam, unsigned n_in, unsigned n_out); __isl_export __isl_give isl_map *isl_map_reverse(__isl_take isl_map *map); __isl_export __isl_give isl_map *isl_map_union( __isl_take isl_map *map1, __isl_take isl_map *map2); struct isl_map *isl_map_union_disjoint( struct isl_map *map1, struct isl_map *map2); __isl_export __isl_give isl_map *isl_map_intersect_domain( __isl_take isl_map *map, __isl_take isl_set *set); __isl_export __isl_give isl_map *isl_map_intersect_range( __isl_take isl_map *map, __isl_take isl_set *set); __isl_export __isl_give isl_map *isl_map_apply_domain( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_export __isl_give isl_map *isl_map_apply_range( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_preimage_domain_multi_aff(__isl_take isl_map *map, __isl_take isl_multi_aff *ma); __isl_give isl_basic_map *isl_basic_map_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_product(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_basic_map *isl_basic_map_domain_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_basic_map *isl_basic_map_range_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_basic_map *isl_basic_map_flat_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_basic_map *isl_basic_map_flat_range_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2); __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_export __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_export __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map, __isl_take isl_set *params); __isl_export __isl_give isl_map *isl_map_subtract( __isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_subtract_domain(__isl_take isl_map *map, __isl_take isl_set *dom); __isl_give isl_map *isl_map_subtract_range(__isl_take isl_map *map, __isl_take isl_set *dom); __isl_export __isl_give isl_map *isl_map_complement(__isl_take isl_map *map); struct isl_map *isl_map_fix_input_si(struct isl_map *map, unsigned input, int value); __isl_give isl_map *isl_map_fix(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_map *isl_map_fix_si(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_map *isl_map_fix_val(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value); __isl_export __isl_give isl_basic_set *isl_basic_map_deltas(__isl_take isl_basic_map *bmap); __isl_export __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map); __isl_give isl_basic_map *isl_basic_map_deltas_map( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map); __isl_export __isl_give isl_map *isl_map_detect_equalities(__isl_take isl_map *map); __isl_export __isl_give isl_basic_map *isl_map_affine_hull(__isl_take isl_map *map); __isl_give isl_basic_map *isl_map_convex_hull(__isl_take isl_map *map); __isl_export __isl_give isl_basic_map *isl_map_polyhedral_hull(__isl_take isl_map *map); __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned n); __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map, enum isl_dim_type type, unsigned n); __isl_give isl_basic_map *isl_basic_map_insert_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_basic_map *isl_basic_map_move_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_basic_map *isl_basic_map_project_out( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map *isl_basic_map_remove_divs( __isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map); __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map); __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map *isl_map_remove_dims(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); struct isl_map *isl_map_remove_inputs(struct isl_map *map, unsigned first, unsigned n); __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_basic_map *isl_basic_map_order_ge(__isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_map *isl_map_equate(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_basic_map *isl_basic_map_order_gt(__isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); __isl_export __isl_give isl_map *isl_set_identity(__isl_take isl_set *set); __isl_export int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset); __isl_export int isl_set_is_wrapping(__isl_keep isl_set *set); __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap); __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map); __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset); __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set); __isl_export __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap); __isl_export __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map); __isl_export __isl_give isl_basic_map *isl_basic_map_flatten_domain( __isl_take isl_basic_map *bmap); __isl_export __isl_give isl_basic_map *isl_basic_map_flatten_range( __isl_take isl_basic_map *bmap); __isl_export __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map); __isl_export __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map); __isl_export __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset); __isl_export __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set); __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set); __isl_give isl_set *isl_map_params(__isl_take isl_map *map); __isl_give isl_set *isl_map_domain(__isl_take isl_map *bmap); __isl_give isl_set *isl_map_range(__isl_take isl_map *map); __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map); __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map); __isl_constructor __isl_give isl_map *isl_map_from_basic_map(__isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set); __isl_give isl_basic_map *isl_basic_map_from_domain( __isl_take isl_basic_set *bset); __isl_give isl_basic_map *isl_basic_map_from_range( __isl_take isl_basic_set *bset); struct isl_map *isl_map_from_range(struct isl_set *set); __isl_give isl_basic_map *isl_basic_map_from_domain_and_range( __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range); __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain, __isl_take isl_set *range); __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set, __isl_take isl_space *dim); struct isl_set *isl_set_from_map(struct isl_map *map); __isl_export __isl_give isl_basic_map *isl_map_sample(__isl_take isl_map *map); int isl_map_plain_is_empty(__isl_keep isl_map *map); int isl_map_fast_is_empty(__isl_keep isl_map *map); int isl_map_plain_is_universe(__isl_keep isl_map *map); __isl_export int isl_map_is_empty(__isl_keep isl_map *map); __isl_export int isl_map_is_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2); __isl_export int isl_map_is_strict_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2); __isl_export int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); __isl_export int isl_map_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2); int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap); int isl_map_plain_is_single_valued(__isl_keep isl_map *map); __isl_export int isl_map_is_single_valued(__isl_keep isl_map *map); int isl_map_plain_is_injective(__isl_keep isl_map *map); __isl_export int isl_map_is_injective(__isl_keep isl_map *map); __isl_export int isl_map_is_bijective(__isl_keep isl_map *map); int isl_map_is_translation(__isl_keep isl_map *map); int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2); int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap); int isl_map_can_zip(__isl_keep isl_map *map); __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_zip(__isl_take isl_map *map); int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap); int isl_map_can_curry(__isl_keep isl_map *map); __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_curry(__isl_take isl_map *map); int isl_basic_map_can_uncurry(__isl_keep isl_basic_map *bmap); int isl_map_can_uncurry(__isl_keep isl_map *map); __isl_give isl_basic_map *isl_basic_map_uncurry(__isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_uncurry(__isl_take isl_map *map); __isl_give isl_map *isl_map_make_disjoint(__isl_take isl_map *map); __isl_give isl_map *isl_basic_map_compute_divs(__isl_take isl_basic_map *bmap); __isl_give isl_map *isl_map_compute_divs(__isl_take isl_map *map); __isl_give isl_map *isl_map_align_divs(__isl_take isl_map *map); __isl_give isl_basic_map *isl_basic_map_drop_constraints_involving_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_map *isl_map_drop_constraints_involving_dims( __isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n); int isl_map_involves_dims(__isl_keep isl_map *map, enum isl_dim_type type, unsigned first, unsigned n); void isl_map_print_internal(__isl_keep isl_map *map, FILE *out, int indent); int isl_map_plain_input_is_fixed(__isl_keep isl_map *map, unsigned in, isl_int *val); int isl_map_plain_is_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_int *val); int isl_map_fast_is_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_int *val); __isl_give isl_val *isl_map_plain_get_val_if_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos); __isl_export __isl_give isl_basic_map *isl_basic_map_gist(__isl_take isl_basic_map *bmap, __isl_take isl_basic_map *context); __isl_export __isl_give isl_map *isl_map_gist(__isl_take isl_map *map, __isl_take isl_map *context); __isl_export __isl_give isl_map *isl_map_gist_domain(__isl_take isl_map *map, __isl_take isl_set *context); __isl_give isl_map *isl_map_gist_range(__isl_take isl_map *map, __isl_take isl_set *context); __isl_give isl_map *isl_map_gist_params(__isl_take isl_map *map, __isl_take isl_set *context); __isl_give isl_map *isl_map_gist_basic_map(__isl_take isl_map *map, __isl_take isl_basic_map *context); __isl_export __isl_give isl_map *isl_map_coalesce(__isl_take isl_map *map); int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2); uint32_t isl_map_get_hash(__isl_keep isl_map *map); __isl_export int isl_map_foreach_basic_map(__isl_keep isl_map *map, int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user); __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set); __isl_give isl_map *isl_map_fixed_power(__isl_take isl_map *map, isl_int exp); __isl_give isl_map *isl_map_fixed_power_val(__isl_take isl_map *map, __isl_take isl_val *exp); __isl_give isl_map *isl_map_power(__isl_take isl_map *map, int *exact); __isl_give isl_map *isl_map_reaching_path_lengths(__isl_take isl_map *map, int *exact); __isl_give isl_map *isl_map_transitive_closure(__isl_take isl_map *map, int *exact); __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1, __isl_take isl_map *map2); __isl_give isl_basic_map *isl_basic_map_align_params( __isl_take isl_basic_map *bmap, __isl_take isl_space *model); __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map, __isl_take isl_space *model); __isl_give isl_mat *isl_basic_map_equalities_matrix( __isl_keep isl_basic_map *bmap, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5); __isl_give isl_mat *isl_basic_map_inequalities_matrix( __isl_keep isl_basic_map *bmap, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5); __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices( __isl_take isl_space *dim, __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5); __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff); __isl_give isl_basic_map *isl_basic_map_from_multi_aff( __isl_take isl_multi_aff *maff); __isl_give isl_basic_map *isl_basic_map_from_aff_list( __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list); __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff); __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff); __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/list.h0000664000175000017500000000536212254313240013757 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_LIST_H #define ISL_LIST_H #include #include #if defined(__cplusplus) extern "C" { #endif #define ISL_DECLARE_LIST_TYPE(EL) \ struct isl_##EL; \ struct isl_##EL##_list; \ typedef struct isl_##EL##_list isl_##EL##_list; #define ISL_DECLARE_LIST_FN(EL) \ isl_ctx *isl_##EL##_list_get_ctx(__isl_keep isl_##EL##_list *list); \ __isl_give isl_##EL##_list *isl_##EL##_list_from_##EL( \ __isl_take struct isl_##EL *el); \ __isl_give isl_##EL##_list *isl_##EL##_list_alloc(isl_ctx *ctx, int n); \ __isl_give isl_##EL##_list *isl_##EL##_list_copy( \ __isl_keep isl_##EL##_list *list); \ void *isl_##EL##_list_free(__isl_take isl_##EL##_list *list); \ __isl_give isl_##EL##_list *isl_##EL##_list_add( \ __isl_take isl_##EL##_list *list, \ __isl_take struct isl_##EL *el); \ __isl_give isl_##EL##_list *isl_##EL##_list_insert( \ __isl_take isl_##EL##_list *list, unsigned pos, \ __isl_take struct isl_##EL *el); \ __isl_give isl_##EL##_list *isl_##EL##_list_drop( \ __isl_take isl_##EL##_list *list, unsigned first, unsigned n); \ __isl_give isl_##EL##_list *isl_##EL##_list_concat( \ __isl_take isl_##EL##_list *list1, \ __isl_take isl_##EL##_list *list2); \ int isl_##EL##_list_n_##EL(__isl_keep isl_##EL##_list *list); \ __isl_give struct isl_##EL *isl_##EL##_list_get_##EL( \ __isl_keep isl_##EL##_list *list, int index); \ __isl_give struct isl_##EL##_list *isl_##EL##_list_set_##EL( \ __isl_take struct isl_##EL##_list *list, int index, \ __isl_take struct isl_##EL *el); \ int isl_##EL##_list_foreach(__isl_keep isl_##EL##_list *list, \ int (*fn)(__isl_take struct isl_##EL *el, void *user), \ void *user); \ __isl_give isl_##EL##_list *isl_##EL##_list_sort( \ __isl_take isl_##EL##_list *list, \ int (*cmp)(__isl_keep struct isl_##EL *a, \ __isl_keep struct isl_##EL *b, \ void *user), void *user); \ int isl_##EL##_list_foreach_scc(__isl_keep isl_##EL##_list *list, \ int (*follows)(__isl_keep struct isl_##EL *a, \ __isl_keep struct isl_##EL *b, void *user), \ void *follows_user, \ int (*fn)(__isl_take isl_##EL##_list *scc, void *user), \ void *fn_user); \ __isl_give isl_printer *isl_printer_print_##EL##_list( \ __isl_take isl_printer *p, __isl_keep isl_##EL##_list *list); \ void isl_##EL##_list_dump(__isl_keep isl_##EL##_list *list); #define ISL_DECLARE_LIST(EL) \ ISL_DECLARE_LIST_TYPE(EL) \ ISL_DECLARE_LIST_FN(EL) #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/set_type.h0000664000175000017500000000012112254313240014624 00000000000000#ifndef ISL_SET_TYPE_H #define ISL_SET_TYPE_H #include #endif cloog-0.18.2/isl/include/isl/polynomial_type.h0000664000175000017500000000137612254313240016231 00000000000000#ifndef ISL_POLYNOMIAL_TYPE_H #define ISL_POLYNOMIAL_TYPE_H struct isl_qpolynomial; typedef struct isl_qpolynomial isl_qpolynomial; struct isl_term; typedef struct isl_term isl_term; struct __isl_export isl_pw_qpolynomial; typedef struct isl_pw_qpolynomial isl_pw_qpolynomial; enum isl_fold { isl_fold_min, isl_fold_max, isl_fold_list }; struct isl_qpolynomial_fold; typedef struct isl_qpolynomial_fold isl_qpolynomial_fold; struct isl_pw_qpolynomial_fold; typedef struct isl_pw_qpolynomial_fold isl_pw_qpolynomial_fold; struct __isl_export isl_union_pw_qpolynomial; typedef struct isl_union_pw_qpolynomial isl_union_pw_qpolynomial; struct isl_union_pw_qpolynomial_fold; typedef struct isl_union_pw_qpolynomial_fold isl_union_pw_qpolynomial_fold; #endif cloog-0.18.2/isl/include/isl/val.h0000664000175000017500000001031512254313240013560 00000000000000#ifndef ISL_VAL_H #define ISL_VAL_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_val; typedef struct isl_val isl_val; ISL_DECLARE_LIST(val) struct isl_multi_val; typedef struct isl_multi_val isl_multi_val; ISL_DECLARE_MULTI(val) __isl_give isl_val *isl_val_zero(isl_ctx *ctx); __isl_give isl_val *isl_val_one(isl_ctx *ctx); __isl_give isl_val *isl_val_nan(isl_ctx *ctx); __isl_give isl_val *isl_val_infty(isl_ctx *ctx); __isl_give isl_val *isl_val_neginfty(isl_ctx *ctx); __isl_give isl_val *isl_val_int_from_si(isl_ctx *ctx, long i); __isl_give isl_val *isl_val_int_from_ui(isl_ctx *ctx, unsigned long u); __isl_give isl_val *isl_val_int_from_chunks(isl_ctx *ctx, size_t n, size_t size, const void *chunks); __isl_give isl_val *isl_val_copy(__isl_keep isl_val *v); void *isl_val_free(__isl_take isl_val *v); isl_ctx *isl_val_get_ctx(__isl_keep isl_val *val); long isl_val_get_num_si(__isl_keep isl_val *v); long isl_val_get_den_si(__isl_keep isl_val *v); double isl_val_get_d(__isl_keep isl_val *v); size_t isl_val_n_abs_num_chunks(__isl_keep isl_val *v, size_t size); int isl_val_get_abs_num_chunks(__isl_keep isl_val *v, size_t size, void *chunks); __isl_give isl_val *isl_val_set_si(__isl_take isl_val *v, long i); __isl_give isl_val *isl_val_abs(__isl_take isl_val *v); __isl_give isl_val *isl_val_neg(__isl_take isl_val *v); __isl_give isl_val *isl_val_floor(__isl_take isl_val *v); __isl_give isl_val *isl_val_ceil(__isl_take isl_val *v); __isl_give isl_val *isl_val_trunc(__isl_take isl_val *v); __isl_give isl_val *isl_val_2exp(__isl_take isl_val *v); __isl_give isl_val *isl_val_min(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_max(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_add(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_add_ui(__isl_take isl_val *v1, unsigned long v2); __isl_give isl_val *isl_val_sub(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_sub_ui(__isl_take isl_val *v1, unsigned long v2); __isl_give isl_val *isl_val_mul(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_mul_ui(__isl_take isl_val *v1, unsigned long v2); __isl_give isl_val *isl_val_div(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_mod(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_gcd(__isl_take isl_val *v1, __isl_take isl_val *v2); __isl_give isl_val *isl_val_gcdext(__isl_take isl_val *v1, __isl_take isl_val *v2, __isl_give isl_val **x, __isl_give isl_val **y); int isl_val_sgn(__isl_keep isl_val *v); int isl_val_is_zero(__isl_keep isl_val *v); int isl_val_is_one(__isl_keep isl_val *v); int isl_val_is_negone(__isl_keep isl_val *v); int isl_val_is_nonneg(__isl_keep isl_val *v); int isl_val_is_nonpos(__isl_keep isl_val *v); int isl_val_is_pos(__isl_keep isl_val *v); int isl_val_is_neg(__isl_keep isl_val *v); int isl_val_is_int(__isl_keep isl_val *v); int isl_val_is_rat(__isl_keep isl_val *v); int isl_val_is_nan(__isl_keep isl_val *v); int isl_val_is_infty(__isl_keep isl_val *v); int isl_val_is_neginfty(__isl_keep isl_val *v); int isl_val_cmp_si(__isl_keep isl_val *v, long i); int isl_val_lt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_le(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_gt(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_ge(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_eq(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_ne(__isl_keep isl_val *v1, __isl_keep isl_val *v2); int isl_val_is_divisible_by(__isl_keep isl_val *v1, __isl_keep isl_val *v2); __isl_give isl_val *isl_val_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_printer *isl_printer_print_val(__isl_take isl_printer *p, __isl_keep isl_val *v); void isl_val_dump(__isl_keep isl_val *v); __isl_give char *isl_val_to_str(__isl_keep isl_val *v); __isl_give isl_multi_val *isl_multi_val_add_val(__isl_take isl_multi_val *mv, __isl_take isl_val *v); __isl_give isl_multi_val *isl_multi_val_mod_val(__isl_take isl_multi_val *mv, __isl_take isl_val *v); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/polynomial.h0000664000175000017500000006755312254313240015201 00000000000000#ifndef ISL_POLYNOMIAL_H #define ISL_POLYNOMIAL_H #include #include #include #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp); __isl_give isl_space *isl_qpolynomial_get_domain_space( __isl_keep isl_qpolynomial *qp); __isl_give isl_space *isl_qpolynomial_get_space(__isl_keep isl_qpolynomial *qp); unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp, enum isl_dim_type type); int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_val *isl_qpolynomial_get_constant_val( __isl_keep isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_qpolynomial *isl_qpolynomial_zero_on_domain(__isl_take isl_space *dim); __isl_give isl_qpolynomial *isl_qpolynomial_one_on_domain(__isl_take isl_space *dim); __isl_give isl_qpolynomial *isl_qpolynomial_infty_on_domain(__isl_take isl_space *dim); __isl_give isl_qpolynomial *isl_qpolynomial_neginfty_on_domain(__isl_take isl_space *dim); __isl_give isl_qpolynomial *isl_qpolynomial_nan_on_domain(__isl_take isl_space *dim); __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst_on_domain(__isl_take isl_space *dim, const isl_int n, const isl_int d); __isl_give isl_qpolynomial *isl_qpolynomial_val_on_domain( __isl_take isl_space *space, __isl_take isl_val *val); __isl_give isl_qpolynomial *isl_qpolynomial_var_on_domain(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos); __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp); void *isl_qpolynomial_free(__isl_take isl_qpolynomial *qp); int isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1, __isl_keep isl_qpolynomial *qp2); int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp); int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp, isl_int *n, isl_int *d); void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d); __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2); __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp, unsigned power); __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int( __isl_take isl_qpolynomial *qp, isl_int v); __isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int( __isl_take isl_qpolynomial *qp, isl_int v); __isl_give isl_qpolynomial *isl_qpolynomial_scale( __isl_take isl_qpolynomial *qp, isl_int v); __isl_give isl_qpolynomial *isl_qpolynomial_scale_val( __isl_take isl_qpolynomial *qp, __isl_take isl_val *v); __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_qpolynomial *isl_qpolynomial_add_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n); __isl_give isl_qpolynomial *isl_qpolynomial_move_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_qpolynomial *isl_qpolynomial_project_domain_on_params( __isl_take isl_qpolynomial *qp); __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_qpolynomial *isl_qpolynomial_substitute( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n, __isl_keep isl_qpolynomial **subs); int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp, __isl_keep isl_basic_set *bset, int (*fn)(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, void *user), void *user); __isl_give isl_qpolynomial *isl_qpolynomial_homogenize( __isl_take isl_qpolynomial *poly); __isl_give isl_qpolynomial *isl_qpolynomial_align_params( __isl_take isl_qpolynomial *qp, __isl_take isl_space *model); isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term); __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term); void isl_term_free(__isl_take isl_term *term); unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type); void isl_term_get_num(__isl_keep isl_term *term, isl_int *n); void isl_term_get_den(__isl_keep isl_term *term, isl_int *d); __isl_give isl_val *isl_term_get_coefficient_val(__isl_keep isl_term *term); int isl_term_get_exp(__isl_keep isl_term *term, enum isl_dim_type type, unsigned pos); __isl_give isl_aff *isl_term_get_div(__isl_keep isl_term *term, unsigned pos); int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp, int (*fn)(__isl_take isl_term *term, void *user), void *user); __isl_give isl_qpolynomial *isl_qpolynomial_eval( __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt); __isl_give isl_qpolynomial *isl_qpolynomial_gist_params( __isl_take isl_qpolynomial *qp, __isl_take isl_set *context); __isl_give isl_qpolynomial *isl_qpolynomial_gist( __isl_take isl_qpolynomial *qp, __isl_take isl_set *context); __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint( __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos); __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term); __isl_give isl_qpolynomial *isl_qpolynomial_from_aff(__isl_take isl_aff *aff); __isl_give isl_basic_map *isl_basic_map_from_qpolynomial( __isl_take isl_qpolynomial *qp); __isl_give isl_printer *isl_printer_print_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_qpolynomial *qp); void isl_qpolynomial_print(__isl_keep isl_qpolynomial *qp, FILE *out, unsigned output_format); void isl_qpolynomial_dump(__isl_keep isl_qpolynomial *qp); isl_ctx *isl_pw_qpolynomial_get_ctx(__isl_keep isl_pw_qpolynomial *pwqp); int isl_pw_qpolynomial_plain_is_equal(__isl_keep isl_pw_qpolynomial *pwqp1, __isl_keep isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_zero(__isl_take isl_space *dim); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_alloc(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_qpolynomial( __isl_take isl_qpolynomial *qp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_copy( __isl_keep isl_pw_qpolynomial *pwqp); void *isl_pw_qpolynomial_free(__isl_take isl_pw_qpolynomial *pwqp); int isl_pw_qpolynomial_is_zero(__isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_space *isl_pw_qpolynomial_get_domain_space( __isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_space *isl_pw_qpolynomial_get_space( __isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_reset_domain_space( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_space *dim); unsigned isl_pw_qpolynomial_dim(__isl_keep isl_pw_qpolynomial *pwqp, enum isl_dim_type type); int isl_pw_qpolynomial_involves_dims(__isl_keep isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned first, unsigned n); int isl_pw_qpolynomial_has_equal_space(__isl_keep isl_pw_qpolynomial *pwqp1, __isl_keep isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_set_dim_name( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_set *isl_pw_qpolynomial_domain(__isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_intersect_domain( __isl_take isl_pw_qpolynomial *pwpq, __isl_take isl_set *set); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_intersect_params( __isl_take isl_pw_qpolynomial *pwpq, __isl_take isl_set *set); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_project_domain_on_params( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_drop_dims( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_dims( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_disjoint( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul_isl_int( __isl_take isl_pw_qpolynomial *pwqp, isl_int v); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_scale_val( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_pow( __isl_take isl_pw_qpolynomial *pwqp, unsigned exponent); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_insert_dims( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned n); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move_dims( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_fix_dim( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned n, isl_int v); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_fix_val( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned n, __isl_take isl_val *v); __isl_give isl_qpolynomial *isl_pw_qpolynomial_eval( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_point *pnt); __isl_give isl_qpolynomial *isl_pw_qpolynomial_max( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_qpolynomial *isl_pw_qpolynomial_min( __isl_take isl_pw_qpolynomial *pwqp); int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user), void *user); int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user), void *user); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_pw_aff( __isl_take isl_pw_aff *pwaff); __isl_constructor __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_read_from_file(isl_ctx *ctx, FILE *input); __isl_give isl_printer *isl_printer_print_pw_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial *pwqp); void isl_pw_qpolynomial_print(__isl_keep isl_pw_qpolynomial *pwqp, FILE *out, unsigned output_format); void isl_pw_qpolynomial_dump(__isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_coalesce( __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_gist( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_set *context); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_gist_params( __isl_take isl_pw_qpolynomial *pwqp, __isl_take isl_set *context); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods( __isl_take isl_pw_qpolynomial *pwqp, int max_periods); __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call( __isl_take isl_basic_set *bset, __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset)); isl_ctx *isl_qpolynomial_fold_get_ctx(__isl_keep isl_qpolynomial_fold *fold); enum isl_fold isl_qpolynomial_fold_get_type(__isl_keep isl_qpolynomial_fold *fold); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type, __isl_take isl_space *dim); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc( enum isl_fold type, __isl_take isl_qpolynomial *qp); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy( __isl_keep isl_qpolynomial_fold *fold); void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold); int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold); int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1, __isl_keep isl_qpolynomial_fold *fold2); __isl_give isl_space *isl_qpolynomial_fold_get_space( __isl_keep isl_qpolynomial_fold *fold); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold( __isl_take isl_qpolynomial_fold *fold1, __isl_take isl_qpolynomial_fold *fold2); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_mul_isl_int( __isl_take isl_qpolynomial_fold *fold, isl_int v); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale( __isl_take isl_qpolynomial_fold *fold, isl_int v); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_val( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_move_dims( __isl_take isl_qpolynomial_fold *fold, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute( __isl_take isl_qpolynomial_fold *fold, enum isl_dim_type type, unsigned first, unsigned n, __isl_keep isl_qpolynomial **subs); __isl_give isl_qpolynomial *isl_qpolynomial_fold_eval( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist_params( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context); __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context); int isl_qpolynomial_fold_foreach_qpolynomial( __isl_keep isl_qpolynomial_fold *fold, int (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user); __isl_give isl_printer *isl_printer_print_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_qpolynomial_fold *fold); void isl_qpolynomial_fold_print(__isl_keep isl_qpolynomial_fold *fold, FILE *out, unsigned output_format); void isl_qpolynomial_fold_dump(__isl_keep isl_qpolynomial_fold *fold); isl_ctx *isl_pw_qpolynomial_fold_get_ctx(__isl_keep isl_pw_qpolynomial_fold *pwf); int isl_pw_qpolynomial_fold_plain_is_equal( __isl_keep isl_pw_qpolynomial_fold *pwf1, __isl_keep isl_pw_qpolynomial_fold *pwf2); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial( enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_alloc( enum isl_fold type, __isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_copy( __isl_keep isl_pw_qpolynomial_fold *pwf); void *isl_pw_qpolynomial_fold_free(__isl_take isl_pw_qpolynomial_fold *pwf); int isl_pw_qpolynomial_fold_is_zero(__isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_space *isl_pw_qpolynomial_fold_get_domain_space( __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_space *isl_pw_qpolynomial_fold_get_space( __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_reset_space( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_space *dim); unsigned isl_pw_qpolynomial_fold_dim(__isl_keep isl_pw_qpolynomial_fold *pwf, enum isl_dim_type type); int isl_pw_qpolynomial_fold_has_equal_space( __isl_keep isl_pw_qpolynomial_fold *pwf1, __isl_keep isl_pw_qpolynomial_fold *pwf2); size_t isl_pw_qpolynomial_fold_size(__isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_zero( __isl_take isl_space *dim, enum isl_fold type); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_set_dim_name( __isl_take isl_pw_qpolynomial_fold *pwf, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_set *isl_pw_qpolynomial_fold_domain( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_intersect_domain( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *set); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_intersect_params( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *set); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_add( __isl_take isl_pw_qpolynomial_fold *pwf1, __isl_take isl_pw_qpolynomial_fold *pwf2); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_fold( __isl_take isl_pw_qpolynomial_fold *pwf1, __isl_take isl_pw_qpolynomial_fold *pwf2); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_add_disjoint( __isl_take isl_pw_qpolynomial_fold *pwf1, __isl_take isl_pw_qpolynomial_fold *pwf2); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_mul_isl_int( __isl_take isl_pw_qpolynomial_fold *pwf, isl_int v); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_scale_val( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_val *v); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_project_domain_on_params( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_drop_dims( __isl_take isl_pw_qpolynomial_fold *pwf, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_move_dims( __isl_take isl_pw_qpolynomial_fold *pwf, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_fix_dim( __isl_take isl_pw_qpolynomial_fold *pwf, enum isl_dim_type type, unsigned n, isl_int v); __isl_give isl_qpolynomial *isl_pw_qpolynomial_fold_eval( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_point *pnt); int isl_pw_qpolynomial_fold_foreach_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, void *user), void *user); int isl_pw_qpolynomial_fold_foreach_lifted_piece( __isl_keep isl_pw_qpolynomial_fold *pwf, int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, void *user), void *user); __isl_give isl_printer *isl_printer_print_pw_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_pw_qpolynomial_fold *pwf); void isl_pw_qpolynomial_fold_print(__isl_keep isl_pw_qpolynomial_fold *pwf, FILE *out, unsigned output_format); void isl_pw_qpolynomial_fold_dump(__isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_coalesce( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_gist( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *context); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_gist_params( __isl_take isl_pw_qpolynomial_fold *pwf, __isl_take isl_set *context); __isl_give isl_qpolynomial *isl_pw_qpolynomial_fold_max( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_qpolynomial *isl_pw_qpolynomial_fold_min( __isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_bound( __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight); __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_bound( __isl_take isl_pw_qpolynomial_fold *pwf, int *tight); __isl_give isl_pw_qpolynomial_fold *isl_set_apply_pw_qpolynomial_fold( __isl_take isl_set *set, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight); __isl_give isl_pw_qpolynomial_fold *isl_map_apply_pw_qpolynomial_fold( __isl_take isl_map *map, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight); __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial( __isl_take isl_pw_qpolynomial *pwqp, int sign); isl_ctx *isl_union_pw_qpolynomial_get_ctx( __isl_keep isl_union_pw_qpolynomial *upwqp); int isl_union_pw_qpolynomial_plain_is_equal( __isl_keep isl_union_pw_qpolynomial *upwqp1, __isl_keep isl_union_pw_qpolynomial *upwqp2); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_from_pw_qpolynomial(__isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_zero( __isl_take isl_space *dim); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_add_pw_qpolynomial( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_pw_qpolynomial *pwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_copy( __isl_keep isl_union_pw_qpolynomial *upwqp); void *isl_union_pw_qpolynomial_free(__isl_take isl_union_pw_qpolynomial *upwqp); __isl_constructor __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_read_from_str( isl_ctx *ctx, const char *str); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_add( __isl_take isl_union_pw_qpolynomial *upwqp1, __isl_take isl_union_pw_qpolynomial *upwqp2); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub( __isl_take isl_union_pw_qpolynomial *upwqp1, __isl_take isl_union_pw_qpolynomial *upwqp2); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul( __isl_take isl_union_pw_qpolynomial *upwqp1, __isl_take isl_union_pw_qpolynomial *upwqp2); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul_isl_int( __isl_take isl_union_pw_qpolynomial *upwqp, isl_int v); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_scale_val( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_val *v); __isl_give isl_union_set *isl_union_pw_qpolynomial_domain( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_intersect_domain( __isl_take isl_union_pw_qpolynomial *upwpq, __isl_take isl_union_set *uset); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_intersect_params( __isl_take isl_union_pw_qpolynomial *upwpq, __isl_take isl_set *set); __isl_give isl_space *isl_union_pw_qpolynomial_get_space( __isl_keep isl_union_pw_qpolynomial *upwqp); __isl_give isl_qpolynomial *isl_union_pw_qpolynomial_eval( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_point *pnt); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_coalesce( __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_gist( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_union_set *context); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_gist_params( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_set *context); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_align_params( __isl_take isl_union_pw_qpolynomial *upwqp, __isl_take isl_space *model); int isl_union_pw_qpolynomial_foreach_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp, int (*fn)(__isl_take isl_pw_qpolynomial *pwqp, void *user), void *user); __isl_give isl_pw_qpolynomial *isl_union_pw_qpolynomial_extract_pw_qpolynomial( __isl_keep isl_union_pw_qpolynomial *upwqp, __isl_take isl_space *dim); __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial *upwqp); isl_ctx *isl_union_pw_qpolynomial_fold_get_ctx( __isl_keep isl_union_pw_qpolynomial_fold *upwf); int isl_union_pw_qpolynomial_fold_plain_is_equal( __isl_keep isl_union_pw_qpolynomial_fold *upwf1, __isl_keep isl_union_pw_qpolynomial_fold *upwf2); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_from_pw_qpolynomial_fold(__isl_take isl_pw_qpolynomial_fold *pwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_zero( __isl_take isl_space *dim, enum isl_fold type); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold( __isl_take isl_union_pw_qpolynomial_fold *upwqp, __isl_take isl_pw_qpolynomial_fold *pwqp); void *isl_union_pw_qpolynomial_fold_free( __isl_take isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_copy( __isl_keep isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold( __isl_take isl_union_pw_qpolynomial_fold *upwf1, __isl_take isl_union_pw_qpolynomial_fold *upwf2); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_pw_qpolynomial *upwqp); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_mul_isl_int( __isl_take isl_union_pw_qpolynomial_fold *upwf, isl_int v); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_scale_val( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_val *v); __isl_give isl_union_set *isl_union_pw_qpolynomial_fold_domain( __isl_take isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_intersect_domain( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_set *uset); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_intersect_params( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_set *set); enum isl_fold isl_union_pw_qpolynomial_fold_get_type( __isl_keep isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_space *isl_union_pw_qpolynomial_fold_get_space( __isl_keep isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_qpolynomial *isl_union_pw_qpolynomial_fold_eval( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_point *pnt); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_coalesce( __isl_take isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_gist( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_set *context); __isl_give isl_union_pw_qpolynomial_fold * isl_union_pw_qpolynomial_fold_gist_params( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_set *context); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_align_params( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_space *model); int isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold( __isl_keep isl_union_pw_qpolynomial_fold *upwf, int (*fn)(__isl_take isl_pw_qpolynomial_fold *pwf, void *user), void *user); __isl_give isl_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_extract_pw_qpolynomial_fold( __isl_keep isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_space *dim); __isl_give isl_printer *isl_printer_print_union_pw_qpolynomial_fold( __isl_take isl_printer *p, __isl_keep isl_union_pw_qpolynomial_fold *upwf); __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_bound( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_fold type, int *tight); __isl_give isl_union_pw_qpolynomial_fold *isl_union_set_apply_union_pw_qpolynomial_fold( __isl_take isl_union_set *uset, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight); __isl_give isl_union_pw_qpolynomial_fold *isl_union_map_apply_union_pw_qpolynomial_fold( __isl_take isl_union_map *umap, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight); __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial( __isl_take isl_union_pw_qpolynomial *upwqp, int sign); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/local_space.h0000664000175000017500000000540012254313240015242 00000000000000#ifndef ISL_LOCAL_SPACE_H #define ISL_LOCAL_SPACE_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_local_space; typedef struct isl_local_space isl_local_space; isl_ctx *isl_local_space_get_ctx(__isl_keep isl_local_space *ls); __isl_give isl_local_space *isl_local_space_from_space(__isl_take isl_space *dim); __isl_give isl_local_space *isl_local_space_copy( __isl_keep isl_local_space *ls); void *isl_local_space_free(__isl_take isl_local_space *ls); int isl_local_space_is_set(__isl_keep isl_local_space *ls); int isl_local_space_dim(__isl_keep isl_local_space *ls, enum isl_dim_type type); int isl_local_space_has_dim_name(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos); const char *isl_local_space_get_dim_name(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_local_space *isl_local_space_set_dim_name( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, const char *s); int isl_local_space_has_dim_id(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_local_space_get_dim_id(__isl_keep isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_local_space *isl_local_space_set_dim_id( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); __isl_give isl_space *isl_local_space_get_space(__isl_keep isl_local_space *ls); __isl_give isl_aff *isl_local_space_get_div(__isl_keep isl_local_space *ls, int pos); __isl_give isl_local_space *isl_local_space_domain( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_range( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_from_domain( __isl_take isl_local_space *ls); __isl_give isl_local_space *isl_local_space_add_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned n); __isl_give isl_local_space *isl_local_space_drop_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_local_space *isl_local_space_insert_dims( __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_local_space *isl_local_space_intersect( __isl_take isl_local_space *ls1, __isl_take isl_local_space *ls2); int isl_local_space_is_equal(__isl_keep isl_local_space *ls1, __isl_keep isl_local_space *ls2); __isl_give isl_basic_map *isl_local_space_lifting( __isl_take isl_local_space *ls); __isl_give isl_printer *isl_printer_print_local_space(__isl_take isl_printer *p, __isl_keep isl_local_space *ls); void isl_local_space_dump(__isl_keep isl_local_space *ls); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/ast_build.h0000664000175000017500000000655512254313240014757 00000000000000#ifndef ISL_AST_CONTEXT_H #define ISL_AST_CONTEXT_H #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_ast_build; typedef struct isl_ast_build isl_ast_build; int isl_options_set_ast_build_atomic_upper_bound(isl_ctx *ctx, int val); int isl_options_get_ast_build_atomic_upper_bound(isl_ctx *ctx); int isl_options_set_ast_build_prefer_pdiv(isl_ctx *ctx, int val); int isl_options_get_ast_build_prefer_pdiv(isl_ctx *ctx); int isl_options_set_ast_build_exploit_nested_bounds(isl_ctx *ctx, int val); int isl_options_get_ast_build_exploit_nested_bounds(isl_ctx *ctx); int isl_options_set_ast_build_group_coscheduled(isl_ctx *ctx, int val); int isl_options_get_ast_build_group_coscheduled(isl_ctx *ctx); #define ISL_AST_BUILD_SEPARATION_BOUNDS_EXPLICIT 0 #define ISL_AST_BUILD_SEPARATION_BOUNDS_IMPLICIT 1 int isl_options_set_ast_build_separation_bounds(isl_ctx *ctx, int val); int isl_options_get_ast_build_separation_bounds(isl_ctx *ctx); int isl_options_set_ast_build_scale_strides(isl_ctx *ctx, int val); int isl_options_get_ast_build_scale_strides(isl_ctx *ctx); int isl_options_set_ast_build_allow_else(isl_ctx *ctx, int val); int isl_options_get_ast_build_allow_else(isl_ctx *ctx); int isl_options_set_ast_build_allow_or(isl_ctx *ctx, int val); int isl_options_get_ast_build_allow_or(isl_ctx *ctx); isl_ctx *isl_ast_build_get_ctx(__isl_keep isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_from_context(__isl_take isl_set *set); __isl_give isl_space *isl_ast_build_get_schedule_space( __isl_keep isl_ast_build *build); __isl_give isl_union_map *isl_ast_build_get_schedule( __isl_keep isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_restrict( __isl_take isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_ast_build *isl_ast_build_copy( __isl_keep isl_ast_build *build); void *isl_ast_build_free(__isl_take isl_ast_build *build); __isl_give isl_ast_build *isl_ast_build_set_options( __isl_take isl_ast_build *build, __isl_take isl_union_map *options); __isl_give isl_ast_build *isl_ast_build_set_iterators( __isl_take isl_ast_build *build, __isl_take isl_id_list *iterators); __isl_give isl_ast_build *isl_ast_build_set_at_each_domain( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)(__isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user), void *user); __isl_give isl_ast_build *isl_ast_build_set_before_each_for( __isl_take isl_ast_build *build, __isl_give isl_id *(*fn)(__isl_keep isl_ast_build *build, void *user), void *user); __isl_give isl_ast_build *isl_ast_build_set_after_each_for( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)(__isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user), void *user); __isl_give isl_ast_build *isl_ast_build_set_create_leaf( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)(__isl_take isl_ast_build *build, void *user), void *user); __isl_give isl_ast_expr *isl_ast_build_expr_from_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa); __isl_give isl_ast_expr *isl_ast_build_call_from_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma); __isl_give isl_ast_node *isl_ast_build_ast_from_schedule( __isl_keep isl_ast_build *build, __isl_take isl_union_map *schedule); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/seq.h0000664000175000017500000000446612254313240013600 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_SEQ_H #define ISL_SEQ_H #include #include #include #if defined(__cplusplus) extern "C" { #endif /* Some common operations on sequences of isl_int's */ void isl_seq_clr(isl_int *p, unsigned len); void isl_seq_set(isl_int *p, isl_int v, unsigned len); void isl_seq_set_si(isl_int *p, int v, unsigned len); void isl_seq_neg(isl_int *dat, isl_int *src, unsigned len); void isl_seq_cpy(isl_int *dst, isl_int *src, unsigned len); void isl_seq_addmul(isl_int *dst, isl_int f, isl_int *src, unsigned len); void isl_seq_submul(isl_int *dst, isl_int f, isl_int *src, unsigned len); void isl_seq_swp_or_cpy(isl_int *dst, isl_int *src, unsigned len); void isl_seq_scale(isl_int *dst, isl_int *src, isl_int f, unsigned len); void isl_seq_scale_down(isl_int *dst, isl_int *src, isl_int f, unsigned len); void isl_seq_cdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len); void isl_seq_fdiv_q(isl_int *dst, isl_int *src, isl_int m, unsigned len); void isl_seq_fdiv_r(isl_int *dst, isl_int *src, isl_int m, unsigned len); void isl_seq_combine(isl_int *dst, isl_int m1, isl_int *src1, isl_int m2, isl_int *src2, unsigned len); void isl_seq_elim(isl_int *dst, isl_int *src, unsigned pos, unsigned len, isl_int *m); void isl_seq_abs_max(isl_int *p, unsigned len, isl_int *max); void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd); void isl_seq_lcm(isl_int *p, unsigned len, isl_int *lcm); void isl_seq_normalize(struct isl_ctx *ctx, isl_int *p, unsigned len); void isl_seq_inner_product(isl_int *p1, isl_int *p2, unsigned len, isl_int *prod); int isl_seq_first_non_zero(isl_int *p, unsigned len); int isl_seq_last_non_zero(isl_int *p, unsigned len); int isl_seq_abs_min_non_zero(isl_int *p, unsigned len); int isl_seq_eq(isl_int *p1, isl_int *p2, unsigned len); int isl_seq_cmp(isl_int *p1, isl_int *p2, unsigned len); int isl_seq_is_neg(isl_int *p1, isl_int *p2, unsigned len); uint32_t isl_seq_get_hash(isl_int *p, unsigned len); uint32_t isl_seq_get_hash_bits(isl_int *p, unsigned len, unsigned bits); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/hash.h0000664000175000017500000000416212254313240013724 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_HASH_H #define ISL_HASH_H #include #include #if defined(__cplusplus) extern "C" { #endif #define isl_hash_init() (2166136261u) #define isl_hash_byte(h,b) do { \ h *= 16777619; \ h ^= b; \ } while(0) #define isl_hash_hash(h,h2) \ do { \ isl_hash_byte(h, (h2) & 0xFF); \ isl_hash_byte(h, ((h2) >> 8) & 0xFF); \ isl_hash_byte(h, ((h2) >> 16) & 0xFF); \ isl_hash_byte(h, ((h2) >> 24) & 0xFF); \ } while(0) #define isl_hash_bits(h,bits) \ ((bits) == 32) ? (h) : \ ((bits) >= 16) ? \ ((h) >> (bits)) ^ ((h) & (((uint32_t)1 << (bits)) - 1)) : \ (((h) >> (bits)) ^ (h)) & (((uint32_t)1 << (bits)) - 1) uint32_t isl_hash_string(uint32_t hash, const char *s); uint32_t isl_hash_mem(uint32_t hash, const void *p, size_t len); #define isl_hash_builtin(h,l) isl_hash_mem(h, &l, sizeof(l)) struct isl_hash_table_entry { uint32_t hash; void *data; }; struct isl_hash_table { int bits; int n; struct isl_hash_table_entry *entries; }; struct isl_ctx; struct isl_hash_table *isl_hash_table_alloc(struct isl_ctx *ctx, int min_size); void isl_hash_table_free(struct isl_ctx *ctx, struct isl_hash_table *table); int isl_hash_table_init(struct isl_ctx *ctx, struct isl_hash_table *table, int min_size); void isl_hash_table_clear(struct isl_hash_table *table); struct isl_hash_table_entry *isl_hash_table_find(struct isl_ctx *ctx, struct isl_hash_table *table, uint32_t key_hash, int (*eq)(const void *entry, const void *val), const void *val, int reserve); int isl_hash_table_foreach(struct isl_ctx *ctx, struct isl_hash_table *table, int (*fn)(void **entry, void *user), void *user); void isl_hash_table_remove(struct isl_ctx *ctx, struct isl_hash_table *table, struct isl_hash_table_entry *entry); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/options.h0000664000175000017500000000242512254313240014474 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_OPTIONS_H #define ISL_OPTIONS_H #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_options; ISL_ARG_DECL(isl_options, struct isl_options, isl_options_args) #define ISL_BOUND_BERNSTEIN 0 #define ISL_BOUND_RANGE 1 int isl_options_set_bound(isl_ctx *ctx, int val); int isl_options_get_bound(isl_ctx *ctx); #define ISL_ON_ERROR_WARN 0 #define ISL_ON_ERROR_CONTINUE 1 #define ISL_ON_ERROR_ABORT 2 int isl_options_set_on_error(isl_ctx *ctx, int val); int isl_options_get_on_error(isl_ctx *ctx); int isl_options_set_gbr_only_first(isl_ctx *ctx, int val); int isl_options_get_gbr_only_first(isl_ctx *ctx); #define ISL_SCHEDULE_ALGORITHM_ISL 0 #define ISL_SCHEDULE_ALGORITHM_FEAUTRIER 1 int isl_options_set_schedule_algorithm(isl_ctx *ctx, int val); int isl_options_get_schedule_algorithm(isl_ctx *ctx); int isl_options_set_coalesce_bounded_wrapping(isl_ctx *ctx, int val); int isl_options_get_coalesce_bounded_wrapping(isl_ctx *ctx); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/union_set.h0000664000175000017500000001172512254313240015007 00000000000000#ifndef ISL_UNION_SET_H #define ISL_UNION_SET_H #include #include #if defined(__cplusplus) extern "C" { #endif __isl_constructor __isl_give isl_union_set *isl_union_set_from_basic_set( __isl_take isl_basic_set *bset); __isl_constructor __isl_give isl_union_set *isl_union_set_from_set(__isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_empty(__isl_take isl_space *dim); __isl_give isl_union_set *isl_union_set_copy(__isl_keep isl_union_set *uset); void *isl_union_set_free(__isl_take isl_union_set *uset); isl_ctx *isl_union_set_get_ctx(__isl_keep isl_union_set *uset); __isl_give isl_space *isl_union_set_get_space(__isl_keep isl_union_set *uset); __isl_give isl_union_set *isl_union_set_universe( __isl_take isl_union_set *uset); __isl_give isl_set *isl_union_set_params(__isl_take isl_union_set *uset); __isl_export __isl_give isl_union_set *isl_union_set_detect_equalities( __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_set *isl_union_set_affine_hull( __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_set *isl_union_set_polyhedral_hull( __isl_take isl_union_set *uset); __isl_give isl_union_set *isl_union_set_simple_hull( __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_set *isl_union_set_coalesce( __isl_take isl_union_set *uset); __isl_give isl_union_set *isl_union_set_compute_divs( __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_set *isl_union_set_lexmin(__isl_take isl_union_set *uset); __isl_export __isl_give isl_union_set *isl_union_set_lexmax(__isl_take isl_union_set *uset); __isl_give isl_union_set *isl_union_set_add_set(__isl_take isl_union_set *uset, __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_union(__isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_export __isl_give isl_union_set *isl_union_set_subtract( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_export __isl_give isl_union_set *isl_union_set_intersect( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_export __isl_give isl_union_set *isl_union_set_intersect_params( __isl_take isl_union_set *uset, __isl_take isl_set *set); __isl_give isl_union_set *isl_union_set_product(__isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_export __isl_give isl_union_set *isl_union_set_gist(__isl_take isl_union_set *uset, __isl_take isl_union_set *context); __isl_export __isl_give isl_union_set *isl_union_set_gist_params( __isl_take isl_union_set *uset, __isl_take isl_set *set); __isl_export __isl_give isl_union_set *isl_union_set_apply( __isl_take isl_union_set *uset, __isl_take isl_union_map *umap); int isl_union_set_is_params(__isl_keep isl_union_set *uset); __isl_export int isl_union_set_is_empty(__isl_keep isl_union_set *uset); __isl_export int isl_union_set_is_subset(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); __isl_export int isl_union_set_is_equal(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); __isl_export int isl_union_set_is_strict_subset(__isl_keep isl_union_set *uset1, __isl_keep isl_union_set *uset2); int isl_union_set_n_set(__isl_keep isl_union_set *uset); __isl_export int isl_union_set_foreach_set(__isl_keep isl_union_set *uset, int (*fn)(__isl_take isl_set *set, void *user), void *user); __isl_give int isl_union_set_contains(__isl_keep isl_union_set *uset, __isl_keep isl_space *dim); __isl_give isl_set *isl_union_set_extract_set(__isl_keep isl_union_set *uset, __isl_take isl_space *dim); __isl_give isl_set *isl_set_from_union_set(__isl_take isl_union_set *uset); int isl_union_set_foreach_point(__isl_keep isl_union_set *uset, int (*fn)(__isl_take isl_point *pnt, void *user), void *user); __isl_give isl_basic_set *isl_union_set_sample(__isl_take isl_union_set *uset); __isl_give isl_union_set *isl_union_set_lift(__isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_set_lex_lt_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_union_map *isl_union_set_lex_le_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_union_map *isl_union_set_lex_gt_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_union_map *isl_union_set_lex_ge_union_set( __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2); __isl_give isl_union_set *isl_union_set_coefficients( __isl_take isl_union_set *bset); __isl_give isl_union_set *isl_union_set_solutions( __isl_take isl_union_set *bset); __isl_give isl_union_set *isl_union_set_read_from_file(isl_ctx *ctx, FILE *input); __isl_constructor __isl_give isl_union_set *isl_union_set_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_printer *isl_printer_print_union_set(__isl_take isl_printer *p, __isl_keep isl_union_set *uset); void isl_union_set_dump(__isl_keep isl_union_set *uset); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/stream.h0000664000175000017500000000641712254313240014301 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_STREAM_H #define ISL_STREAM_H #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif enum isl_token_type { ISL_TOKEN_ERROR = -1, ISL_TOKEN_UNKNOWN = 256, ISL_TOKEN_VALUE, ISL_TOKEN_IDENT, ISL_TOKEN_GE, ISL_TOKEN_LE, ISL_TOKEN_GT, ISL_TOKEN_LT, ISL_TOKEN_NE, ISL_TOKEN_EQ_EQ, ISL_TOKEN_LEX_GE, ISL_TOKEN_LEX_LE, ISL_TOKEN_LEX_GT, ISL_TOKEN_LEX_LT, ISL_TOKEN_TO, ISL_TOKEN_AND, ISL_TOKEN_OR, ISL_TOKEN_EXISTS, ISL_TOKEN_NOT, ISL_TOKEN_DEF, ISL_TOKEN_INFTY, ISL_TOKEN_NAN, ISL_TOKEN_MIN, ISL_TOKEN_MAX, ISL_TOKEN_RAT, ISL_TOKEN_TRUE, ISL_TOKEN_FALSE, ISL_TOKEN_CEILD, ISL_TOKEN_FLOORD, ISL_TOKEN_MOD, ISL_TOKEN_STRING, ISL_TOKEN_MAP, ISL_TOKEN_AFF, ISL_TOKEN_CEIL, ISL_TOKEN_FLOOR, ISL_TOKEN_IMPLIES, ISL_TOKEN_LAST }; struct isl_token { int type; unsigned int on_new_line : 1; unsigned is_keyword : 1; int line; int col; union { isl_int v; char *s; isl_map *map; isl_pw_aff *pwaff; } u; }; __isl_give isl_val *isl_token_get_val(isl_ctx *ctx, struct isl_token *tok); __isl_give char *isl_token_get_str(isl_ctx *ctx, struct isl_token *tok); int isl_token_get_type(struct isl_token *tok); void isl_token_free(struct isl_token *tok); struct isl_stream { struct isl_ctx *ctx; FILE *file; const char *str; int line; int col; int eof; char *buffer; size_t size; size_t len; int c; int un[5]; int n_un; struct isl_token *tokens[5]; int n_token; struct isl_hash_table *keywords; enum isl_token_type next_type; }; struct isl_stream* isl_stream_new_file(struct isl_ctx *ctx, FILE *file); struct isl_stream* isl_stream_new_str(struct isl_ctx *ctx, const char *str); void isl_stream_free(struct isl_stream *s); void isl_stream_error(struct isl_stream *s, struct isl_token *tok, char *msg); struct isl_token *isl_stream_next_token(struct isl_stream *s); struct isl_token *isl_stream_next_token_on_same_line(struct isl_stream *s); int isl_stream_next_token_is(struct isl_stream *s, int type); void isl_stream_push_token(struct isl_stream *s, struct isl_token *tok); void isl_stream_flush_tokens(struct isl_stream *s); int isl_stream_eat_if_available(struct isl_stream *s, int type); char *isl_stream_read_ident_if_available(struct isl_stream *s); int isl_stream_eat(struct isl_stream *s, int type); int isl_stream_is_empty(struct isl_stream *s); int isl_stream_skip_line(struct isl_stream *s); enum isl_token_type isl_stream_register_keyword(struct isl_stream *s, const char *name); struct isl_obj isl_stream_read_obj(struct isl_stream *s); __isl_give isl_multi_aff *isl_stream_read_multi_aff(struct isl_stream *s); __isl_give isl_map *isl_stream_read_map(struct isl_stream *s); __isl_give isl_set *isl_stream_read_set(struct isl_stream *s); __isl_give isl_pw_qpolynomial *isl_stream_read_pw_qpolynomial( struct isl_stream *s); __isl_give isl_union_map *isl_stream_read_union_map(struct isl_stream *s); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/val_gmp.h0000664000175000017500000000054212254313240014424 00000000000000#ifndef ISL_VAL_GMP_H #define ISL_VAL_GMP_H #include #include __isl_give isl_val *isl_val_int_from_gmp(isl_ctx *ctx, mpz_t z); __isl_give isl_val *isl_val_from_gmp(isl_ctx *ctx, const mpz_t n, const mpz_t d); int isl_val_get_num_gmp(__isl_keep isl_val *v, mpz_t z); int isl_val_get_den_gmp(__isl_keep isl_val *v, mpz_t z); #endif cloog-0.18.2/isl/include/isl/union_map.h0000664000175000017500000002053112254313240014764 00000000000000#ifndef ISL_UNION_MAP_H #define ISL_UNION_MAP_H #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif __isl_constructor __isl_give isl_union_map *isl_union_map_from_basic_map( __isl_take isl_basic_map *bmap); __isl_constructor __isl_give isl_union_map *isl_union_map_from_map(__isl_take isl_map *map); __isl_give isl_union_map *isl_union_map_empty(__isl_take isl_space *dim); __isl_give isl_union_map *isl_union_map_copy(__isl_keep isl_union_map *umap); void *isl_union_map_free(__isl_take isl_union_map *umap); isl_ctx *isl_union_map_get_ctx(__isl_keep isl_union_map *umap); __isl_give isl_space *isl_union_map_get_space(__isl_keep isl_union_map *umap); __isl_give isl_union_map *isl_union_map_universe( __isl_take isl_union_map *umap); __isl_give isl_set *isl_union_map_params(__isl_take isl_union_map *umap); __isl_give isl_union_set *isl_union_map_domain(__isl_take isl_union_map *umap); __isl_give isl_union_set *isl_union_map_range(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_domain_map( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_range_map( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_from_domain( __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_from_range( __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_map *isl_union_map_affine_hull( __isl_take isl_union_map *umap); __isl_export __isl_give isl_union_map *isl_union_map_polyhedral_hull( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_simple_hull( __isl_take isl_union_map *umap); __isl_export __isl_give isl_union_map *isl_union_map_coalesce( __isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_compute_divs( __isl_take isl_union_map *umap); __isl_export __isl_give isl_union_map *isl_union_map_lexmin(__isl_take isl_union_map *umap); __isl_export __isl_give isl_union_map *isl_union_map_lexmax(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_add_map(__isl_take isl_union_map *umap, __isl_take isl_map *map); __isl_export __isl_give isl_union_map *isl_union_map_union(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_export __isl_give isl_union_map *isl_union_map_subtract( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_export __isl_give isl_union_map *isl_union_map_intersect( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_export __isl_give isl_union_map *isl_union_map_intersect_params( __isl_take isl_union_map *umap, __isl_take isl_set *set); __isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_domain_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_flat_range_product( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_export __isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap, __isl_take isl_union_map *context); __isl_export __isl_give isl_union_map *isl_union_map_gist_params( __isl_take isl_union_map *umap, __isl_take isl_set *set); __isl_export __isl_give isl_union_map *isl_union_map_gist_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_map *isl_union_map_gist_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_map *isl_union_map_intersect_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_map *isl_union_map_intersect_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *uset); __isl_export __isl_give isl_union_map *isl_union_map_subtract_domain( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom); __isl_export __isl_give isl_union_map *isl_union_map_subtract_range( __isl_take isl_union_map *umap, __isl_take isl_union_set *dom); __isl_export __isl_give isl_union_map *isl_union_map_apply_domain( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_export __isl_give isl_union_map *isl_union_map_apply_range( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_preimage_domain_multi_aff( __isl_take isl_union_map *umap, __isl_take isl_multi_aff *ma); __isl_export __isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_from_domain_and_range( __isl_take isl_union_set *domain, __isl_take isl_union_set *range); __isl_export __isl_give isl_union_map *isl_union_map_detect_equalities( __isl_take isl_union_map *umap); __isl_export __isl_give isl_union_set *isl_union_map_deltas(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_deltas_map( __isl_take isl_union_map *umap); __isl_export __isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_set *uset); __isl_export int isl_union_map_is_empty(__isl_keep isl_union_map *umap); __isl_export int isl_union_map_is_single_valued(__isl_keep isl_union_map *umap); int isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap); __isl_export int isl_union_map_is_injective(__isl_keep isl_union_map *umap); __isl_export int isl_union_map_is_bijective(__isl_keep isl_union_map *umap); __isl_export int isl_union_map_is_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); __isl_export int isl_union_map_is_equal(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); __isl_export int isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1, __isl_keep isl_union_map *umap2); int isl_union_map_n_map(__isl_keep isl_union_map *umap); __isl_export int isl_union_map_foreach_map(__isl_keep isl_union_map *umap, int (*fn)(__isl_take isl_map *map, void *user), void *user); __isl_give int isl_union_map_contains(__isl_keep isl_union_map *umap, __isl_keep isl_space *dim); __isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap, __isl_take isl_space *dim); __isl_give isl_map *isl_map_from_union_map(__isl_take isl_union_map *umap); __isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_fixed_power( __isl_take isl_union_map *umap, isl_int exp); __isl_give isl_union_map *isl_union_map_fixed_power_val( __isl_take isl_union_map *umap, __isl_take isl_val *exp); __isl_give isl_union_map *isl_union_map_power(__isl_take isl_union_map *umap, int *exact); __isl_give isl_union_map *isl_union_map_transitive_closure( __isl_take isl_union_map *umap, int *exact); __isl_give isl_union_map *isl_union_map_lex_lt_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_lex_le_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_lex_gt_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_lex_ge_union_map( __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2); __isl_give isl_union_map *isl_union_map_read_from_file(isl_ctx *ctx, FILE *input); __isl_constructor __isl_give isl_union_map *isl_union_map_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_printer *isl_printer_print_union_map(__isl_take isl_printer *p, __isl_keep isl_union_map *umap); void isl_union_map_dump(__isl_keep isl_union_map *umap); __isl_give isl_union_set *isl_union_map_wrap(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_curry(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_uncurry(__isl_take isl_union_map *umap); __isl_give isl_union_map *isl_union_map_align_params( __isl_take isl_union_map *umap, __isl_take isl_space *model); __isl_give isl_union_set *isl_union_set_align_params( __isl_take isl_union_set *uset, __isl_take isl_space *model); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/ast.h0000664000175000017500000001501312254313240013565 00000000000000#ifndef ISL_AST_H #define ISL_AST_H #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_ast_expr; typedef struct isl_ast_expr isl_ast_expr; struct isl_ast_node; typedef struct isl_ast_node isl_ast_node; enum isl_ast_op_type { isl_ast_op_error = -1, isl_ast_op_and, isl_ast_op_and_then, isl_ast_op_or, isl_ast_op_or_else, isl_ast_op_max, isl_ast_op_min, isl_ast_op_minus, isl_ast_op_add, isl_ast_op_sub, isl_ast_op_mul, isl_ast_op_div, isl_ast_op_fdiv_q, /* Round towards -infty */ isl_ast_op_pdiv_q, /* Dividend is non-negative */ isl_ast_op_pdiv_r, /* Dividend is non-negative */ isl_ast_op_cond, isl_ast_op_select, isl_ast_op_eq, isl_ast_op_le, isl_ast_op_lt, isl_ast_op_ge, isl_ast_op_gt, isl_ast_op_call }; enum isl_ast_expr_type { isl_ast_expr_error = -1, isl_ast_expr_op, isl_ast_expr_id, isl_ast_expr_int }; enum isl_ast_node_type { isl_ast_node_error = -1, isl_ast_node_for = 1, isl_ast_node_if, isl_ast_node_block, isl_ast_node_user }; struct isl_ast_print_options; typedef struct isl_ast_print_options isl_ast_print_options; ISL_DECLARE_LIST(ast_expr) ISL_DECLARE_LIST(ast_node) int isl_options_set_ast_iterator_type(isl_ctx *ctx, const char *val); const char *isl_options_get_ast_iterator_type(isl_ctx *ctx); __isl_give isl_ast_expr *isl_ast_expr_from_val(__isl_take isl_val *v); __isl_give isl_ast_expr *isl_ast_expr_from_id(__isl_take isl_id *id); __isl_give isl_ast_expr *isl_ast_expr_neg(__isl_take isl_ast_expr *expr); __isl_give isl_ast_expr *isl_ast_expr_add(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_sub(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_mul(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_div(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_and(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_or(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); __isl_give isl_ast_expr *isl_ast_expr_copy(__isl_keep isl_ast_expr *expr); void *isl_ast_expr_free(__isl_take isl_ast_expr *expr); isl_ctx *isl_ast_expr_get_ctx(__isl_keep isl_ast_expr *expr); enum isl_ast_expr_type isl_ast_expr_get_type(__isl_keep isl_ast_expr *expr); int isl_ast_expr_get_int(__isl_keep isl_ast_expr *expr, isl_int *v); __isl_give isl_val *isl_ast_expr_get_val(__isl_keep isl_ast_expr *expr); __isl_give isl_id *isl_ast_expr_get_id(__isl_keep isl_ast_expr *expr); enum isl_ast_op_type isl_ast_expr_get_op_type(__isl_keep isl_ast_expr *expr); int isl_ast_expr_get_op_n_arg(__isl_keep isl_ast_expr *expr); __isl_give isl_ast_expr *isl_ast_expr_get_op_arg(__isl_keep isl_ast_expr *expr, int pos); __isl_give isl_printer *isl_printer_print_ast_expr(__isl_take isl_printer *p, __isl_keep isl_ast_expr *expr); void isl_ast_expr_dump(__isl_keep isl_ast_expr *expr); __isl_give char *isl_ast_expr_to_str(__isl_keep isl_ast_expr *expr); __isl_give isl_ast_node *isl_ast_node_alloc_user(__isl_take isl_ast_expr *expr); __isl_give isl_ast_node *isl_ast_node_copy(__isl_keep isl_ast_node *node); void *isl_ast_node_free(__isl_take isl_ast_node *node); isl_ctx *isl_ast_node_get_ctx(__isl_keep isl_ast_node *node); enum isl_ast_node_type isl_ast_node_get_type(__isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_set_annotation( __isl_take isl_ast_node *node, __isl_take isl_id *annotation); __isl_give isl_id *isl_ast_node_get_annotation(__isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_for_get_iterator( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_for_get_init( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_for_get_cond( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_for_get_inc( __isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_for_get_body( __isl_keep isl_ast_node *node); int isl_ast_node_for_is_degenerate(__isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_if_get_cond( __isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_if_get_then( __isl_keep isl_ast_node *node); int isl_ast_node_if_has_else(__isl_keep isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_if_get_else( __isl_keep isl_ast_node *node); __isl_give isl_ast_node_list *isl_ast_node_block_get_children( __isl_keep isl_ast_node *node); __isl_give isl_ast_expr *isl_ast_node_user_get_expr( __isl_keep isl_ast_node *node); __isl_give isl_printer *isl_printer_print_ast_node(__isl_take isl_printer *p, __isl_keep isl_ast_node *node); void isl_ast_node_dump(__isl_keep isl_ast_node *node); __isl_give isl_ast_print_options *isl_ast_print_options_alloc(isl_ctx *ctx); __isl_give isl_ast_print_options *isl_ast_print_options_copy( __isl_keep isl_ast_print_options *options); void *isl_ast_print_options_free(__isl_take isl_ast_print_options *options); isl_ctx *isl_ast_print_options_get_ctx( __isl_keep isl_ast_print_options *options); __isl_give isl_ast_print_options *isl_ast_print_options_set_print_user( __isl_take isl_ast_print_options *options, __isl_give isl_printer *(*print_user)(__isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user), void *user); __isl_give isl_ast_print_options *isl_ast_print_options_set_print_for( __isl_take isl_ast_print_options *options, __isl_give isl_printer *(*print_for)(__isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user), void *user); int isl_ast_node_foreach_ast_op_type(__isl_keep isl_ast_node *node, int (*fn)(enum isl_ast_op_type type, void *user), void *user); __isl_give isl_printer *isl_ast_op_type_print_macro( enum isl_ast_op_type type, __isl_take isl_printer *p); __isl_give isl_printer *isl_ast_node_print_macros( __isl_keep isl_ast_node *node, __isl_take isl_printer *p); __isl_give isl_printer *isl_ast_node_print(__isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options); __isl_give isl_printer *isl_ast_node_for_print(__isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options); __isl_give isl_printer *isl_ast_node_if_print(__isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/vec.h0000664000175000017500000000601712254313240013557 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_VEC_H #define ISL_VEC_H #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_vec { int ref; struct isl_ctx *ctx; unsigned size; isl_int *el; struct isl_blk block; }; typedef struct isl_vec isl_vec; __isl_give isl_vec *isl_vec_alloc(isl_ctx *ctx, unsigned size); __isl_give isl_vec *isl_vec_copy(__isl_keep isl_vec *vec); struct isl_vec *isl_vec_cow(struct isl_vec *vec); void *isl_vec_free(__isl_take isl_vec *vec); isl_ctx *isl_vec_get_ctx(__isl_keep isl_vec *vec); int isl_vec_size(__isl_keep isl_vec *vec); int isl_vec_get_element(__isl_keep isl_vec *vec, int pos, isl_int *v); __isl_give isl_val *isl_vec_get_element_val(__isl_keep isl_vec *vec, int pos); __isl_give isl_vec *isl_vec_set_element(__isl_take isl_vec *vec, int pos, isl_int v); __isl_give isl_vec *isl_vec_set_element_si(__isl_take isl_vec *vec, int pos, int v); __isl_give isl_vec *isl_vec_set_element_val(__isl_take isl_vec *vec, int pos, __isl_take isl_val *v); int isl_vec_is_equal(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2); int isl_vec_cmp_element(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2, int pos); void isl_vec_dump(__isl_keep isl_vec *vec); __isl_give isl_printer *isl_printer_print_vec(__isl_take isl_printer *printer, __isl_keep isl_vec *vec); void isl_vec_lcm(struct isl_vec *vec, isl_int *lcm); struct isl_vec *isl_vec_ceil(struct isl_vec *vec); struct isl_vec *isl_vec_normalize(struct isl_vec *vec); __isl_give isl_vec *isl_vec_set(__isl_take isl_vec *vec, isl_int v); __isl_give isl_vec *isl_vec_set_si(__isl_take isl_vec *vec, int v); __isl_give isl_vec *isl_vec_set_val(__isl_take isl_vec *vec, __isl_take isl_val *v); __isl_give isl_vec *isl_vec_clr(__isl_take isl_vec *vec); __isl_give isl_vec *isl_vec_neg(__isl_take isl_vec *vec); __isl_give isl_vec *isl_vec_scale(__isl_take isl_vec *vec, isl_int m); __isl_give isl_vec *isl_vec_fdiv_r(__isl_take isl_vec *vec, isl_int m); __isl_give isl_vec *isl_vec_add(__isl_take isl_vec *vec1, __isl_take isl_vec *vec2); __isl_give isl_vec *isl_vec_extend(__isl_take isl_vec *vec, unsigned size); __isl_give isl_vec *isl_vec_zero_extend(__isl_take isl_vec *vec, unsigned size); __isl_give isl_vec *isl_vec_concat(__isl_take isl_vec *vec1, __isl_take isl_vec *vec2); __isl_give isl_vec *isl_vec_sort(__isl_take isl_vec *vec); __isl_give isl_vec *isl_vec_read_from_file(isl_ctx *ctx, FILE *input); __isl_give isl_vec *isl_vec_drop_els(__isl_take isl_vec *vec, unsigned pos, unsigned n); __isl_give isl_vec *isl_vec_insert_els(__isl_take isl_vec *vec, unsigned pos, unsigned n); __isl_give isl_vec *isl_vec_insert_zero_els(__isl_take isl_vec *vec, unsigned pos, unsigned n); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/blk.h0000664000175000017500000000150712254313240013551 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_BLK_H #define ISL_BLK_H #include #if defined(__cplusplus) extern "C" { #endif struct isl_blk { size_t size; isl_int *data; }; #define ISL_BLK_CACHE_SIZE 20 struct isl_ctx; struct isl_blk isl_blk_alloc(struct isl_ctx *ctx, size_t n); struct isl_blk isl_blk_empty(void); int isl_blk_is_error(struct isl_blk block); struct isl_blk isl_blk_extend(struct isl_ctx *ctx, struct isl_blk block, size_t new_n); void isl_blk_free(struct isl_ctx *ctx, struct isl_blk block); void isl_blk_clear_cache(struct isl_ctx *ctx); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/ctx.h0000664000175000017500000001636312254313240013605 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_CTX_H #define ISL_CTX_H #include #include #include #include #include #include #include #ifndef __isl_give #define __isl_give #endif #ifndef __isl_take #define __isl_take #endif #ifndef __isl_keep #define __isl_keep #endif #ifndef __isl_export #define __isl_export #endif #ifndef __isl_constructor #define __isl_constructor #endif #ifndef __isl_subclass #define __isl_subclass(super) #endif #ifdef GCC_WARN_UNUSED_RESULT #define WARN_UNUSED GCC_WARN_UNUSED_RESULT #else #define WARN_UNUSED #endif #if defined(__cplusplus) extern "C" { #endif /* Nearly all isa functions require a struct isl_ctx allocated using * isl_ctx_alloc. This ctx contains (or will contain) options that * control the behavior of the library and some caches. * * An object allocated within a given ctx should never be used inside * another ctx. Functions for moving objects from one ctx to another * will be added as the need arises. * * A given context should only be used inside a single thread. * A global context for synchronization between different threads * as well as functions for moving a context to a different thread * will be added as the need arises. * * If anything goes wrong (out of memory, failed assertion), then * the library will currently simply abort. This will be made * configurable in the future. * Users of the library should expect functions that return * a pointer to a structure, to return NULL, indicating failure. * Any function accepting a pointer to a structure will treat * a NULL argument as a failure, resulting in the function freeing * the remaining structures (if any) and returning NULL itself * (in case of pointer return type). * The only exception is the isl_ctx argument, which should never be NULL. */ struct isl_stats { long gbr_solved_lps; }; enum isl_error { isl_error_none = 0, isl_error_abort, isl_error_unknown, isl_error_internal, isl_error_invalid, isl_error_unsupported }; struct isl_ctx; typedef struct isl_ctx isl_ctx; /* Some helper macros */ #define ISL_FL_INIT(l, f) (l) = (f) /* Specific flags location. */ #define ISL_FL_SET(l, f) ((l) |= (f)) #define ISL_FL_CLR(l, f) ((l) &= ~(f)) #define ISL_FL_ISSET(l, f) (!!((l) & (f))) #define ISL_F_INIT(p, f) ISL_FL_INIT((p)->flags, f) /* Structure element flags. */ #define ISL_F_SET(p, f) ISL_FL_SET((p)->flags, f) #define ISL_F_CLR(p, f) ISL_FL_CLR((p)->flags, f) #define ISL_F_ISSET(p, f) ISL_FL_ISSET((p)->flags, f) /* isl_check_ctx() checks at compile time if 'ctx' is of type 'isl_ctx *' and * returns the value of 'expr'. It is used to ensure, that always an isl_ctx is * passed to the following macros, even if they currently do not use it. */ #define isl_check_ctx(ctx, expr) ((ctx != (isl_ctx *) 0) ? expr : NULL) #define isl_alloc(ctx,type,size) ((type *)isl_check_ctx(ctx,\ malloc(size))) #define isl_calloc(ctx,type,size) ((type *)isl_check_ctx(ctx,\ calloc(1, size))) #define isl_realloc(ctx,ptr,type,size) ((type *)isl_check_ctx(ctx,\ realloc(ptr,size))) #define isl_alloc_type(ctx,type) isl_alloc(ctx,type,sizeof(type)) #define isl_calloc_type(ctx,type) isl_calloc(ctx,type,sizeof(type)) #define isl_realloc_type(ctx,ptr,type) isl_realloc(ctx,ptr,type,sizeof(type)) #define isl_alloc_array(ctx,type,n) isl_alloc(ctx,type,(n)*sizeof(type)) #define isl_calloc_array(ctx,type,n) ((type *)isl_check_ctx(ctx,\ calloc(n, sizeof(type)))) #define isl_realloc_array(ctx,ptr,type,n) \ isl_realloc(ctx,ptr,type,(n)*sizeof(type)) #define isl_die(ctx,errno,msg,code) \ do { \ isl_handle_error(ctx, errno, msg, __FILE__, __LINE__); \ code; \ } while (0) void isl_handle_error(isl_ctx *ctx, enum isl_error error, const char *msg, const char *file, int line); #define isl_assert4(ctx,test,code,errno) \ do { \ if (test) \ break; \ isl_die(ctx, errno, "Assertion \"" #test "\" failed", code); \ } while (0) #define isl_assert(ctx,test,code) \ isl_assert4(ctx,test,code,isl_error_unknown) #define isl_min(a,b) ((a < b) ? (a) : (b)) /* struct isl_ctx functions */ struct isl_options *isl_ctx_options(isl_ctx *ctx); isl_ctx *isl_ctx_alloc_with_options(struct isl_args *args, __isl_take void *opt); isl_ctx *isl_ctx_alloc(void); void *isl_ctx_peek_options(isl_ctx *ctx, struct isl_args *args); int isl_ctx_parse_options(isl_ctx *ctx, int argc, char **argv, unsigned flags); void isl_ctx_ref(struct isl_ctx *ctx); void isl_ctx_deref(struct isl_ctx *ctx); void isl_ctx_free(isl_ctx *ctx); void isl_ctx_abort(isl_ctx *ctx); void isl_ctx_resume(isl_ctx *ctx); int isl_ctx_aborted(isl_ctx *ctx); #define ISL_ARG_CTX_DECL(prefix,st,args) \ st *isl_ctx_peek_ ## prefix(isl_ctx *ctx); #define ISL_ARG_CTX_DEF(prefix,st,args) \ st *isl_ctx_peek_ ## prefix(isl_ctx *ctx) \ { \ return (st *)isl_ctx_peek_options(ctx, &(args)); \ } #define ISL_CTX_GET_INT_DEF(prefix,st,args,field) \ int prefix ## _get_ ## field(isl_ctx *ctx) \ { \ st *options; \ options = isl_ctx_peek_ ## prefix(ctx); \ if (!options) \ isl_die(ctx, isl_error_invalid, \ "isl_ctx does not reference " #prefix, \ return -1); \ return options->field; \ } #define ISL_CTX_SET_INT_DEF(prefix,st,args,field) \ int prefix ## _set_ ## field(isl_ctx *ctx, int val) \ { \ st *options; \ options = isl_ctx_peek_ ## prefix(ctx); \ if (!options) \ isl_die(ctx, isl_error_invalid, \ "isl_ctx does not reference " #prefix, \ return -1); \ options->field = val; \ return 0; \ } #define ISL_CTX_GET_STR_DEF(prefix,st,args,field) \ const char *prefix ## _get_ ## field(isl_ctx *ctx) \ { \ st *options; \ options = isl_ctx_peek_ ## prefix(ctx); \ if (!options) \ isl_die(ctx, isl_error_invalid, \ "isl_ctx does not reference " #prefix, \ return NULL); \ return options->field; \ } #define ISL_CTX_SET_STR_DEF(prefix,st,args,field) \ int prefix ## _set_ ## field(isl_ctx *ctx, const char *val) \ { \ st *options; \ options = isl_ctx_peek_ ## prefix(ctx); \ if (!options) \ isl_die(ctx, isl_error_invalid, \ "isl_ctx does not reference " #prefix, \ return -1); \ if (!val) \ return -1; \ free(options->field); \ options->field = strdup(val); \ if (!options->field) \ return -1; \ return 0; \ } #define ISL_CTX_GET_BOOL_DEF(prefix,st,args,field) \ ISL_CTX_GET_INT_DEF(prefix,st,args,field) #define ISL_CTX_SET_BOOL_DEF(prefix,st,args,field) \ ISL_CTX_SET_INT_DEF(prefix,st,args,field) #define ISL_CTX_GET_CHOICE_DEF(prefix,st,args,field) \ ISL_CTX_GET_INT_DEF(prefix,st,args,field) #define ISL_CTX_SET_CHOICE_DEF(prefix,st,args,field) \ ISL_CTX_SET_INT_DEF(prefix,st,args,field) enum isl_error isl_ctx_last_error(isl_ctx *ctx); void isl_ctx_reset_error(isl_ctx *ctx); void isl_ctx_set_error(isl_ctx *ctx, enum isl_error error); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/multi.h0000664000175000017500000000650412254313240014135 00000000000000#ifndef ISL_MULTI_H #define ISL_MULTI_H #include #include #if defined(__cplusplus) extern "C" { #endif #define ISL_DECLARE_MULTI(BASE) \ unsigned isl_multi_##BASE##_dim(__isl_keep isl_multi_##BASE *multi, \ enum isl_dim_type type); \ isl_ctx *isl_multi_##BASE##_get_ctx( \ __isl_keep isl_multi_##BASE *multi); \ __isl_give isl_space *isl_multi_##BASE##_get_space( \ __isl_keep isl_multi_##BASE *multi); \ __isl_give isl_space *isl_multi_##BASE##_get_domain_space( \ __isl_keep isl_multi_##BASE *multi); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_from_##BASE##_list( \ __isl_take isl_space *space, __isl_take isl_##BASE##_list *list); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_zero( \ __isl_take isl_space *space); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_copy( \ __isl_keep isl_multi_##BASE *multi); \ void *isl_multi_##BASE##_free(__isl_take isl_multi_##BASE *multi); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_set_dim_name( \ __isl_take isl_multi_##BASE *multi, \ enum isl_dim_type type, unsigned pos, const char *s); \ const char *isl_multi_##BASE##_get_tuple_name( \ __isl_keep isl_multi_##BASE *multi, enum isl_dim_type type); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_set_tuple_name( \ __isl_take isl_multi_##BASE *multi, \ enum isl_dim_type type, const char *s); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_set_tuple_id( \ __isl_take isl_multi_##BASE *multi, \ enum isl_dim_type type, __isl_take isl_id *id); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_insert_dims( \ __isl_take isl_multi_##BASE *multi, enum isl_dim_type type, \ unsigned first, unsigned n); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_add_dims( \ __isl_take isl_multi_##BASE *multi, enum isl_dim_type type, \ unsigned n); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_drop_dims( \ __isl_take isl_multi_##BASE *multi, enum isl_dim_type type, \ unsigned first, unsigned n); \ __isl_give isl_##BASE *isl_multi_##BASE##_get_##BASE( \ __isl_keep isl_multi_##BASE *multi, int pos); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_set_##BASE( \ __isl_take isl_multi_##BASE *multi, int pos, \ __isl_take isl_##BASE *el); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_range_splice( \ __isl_take isl_multi_##BASE *multi1, unsigned pos, \ __isl_take isl_multi_##BASE *multi2); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_splice( \ __isl_take isl_multi_##BASE *multi1, unsigned in_pos, \ unsigned out_pos, __isl_take isl_multi_##BASE *multi2); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_flat_range_product( \ __isl_take isl_multi_##BASE *multi1, \ __isl_take isl_multi_##BASE *multi2); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_range_product( \ __isl_take isl_multi_##BASE *multi1, \ __isl_take isl_multi_##BASE *multi2); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_scale_val( \ __isl_take isl_multi_##BASE *multi, __isl_take isl_val *v); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_scale_multi_val( \ __isl_take isl_multi_##BASE *multi, \ __isl_take isl_multi_val *mv); \ __isl_give isl_multi_##BASE *isl_multi_##BASE##_align_params( \ __isl_take isl_multi_##BASE *multi, \ __isl_take isl_space *model); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/config.h.in0000664000175000017500000000006112254313240014645 00000000000000#undef GCC_WARN_UNUSED_RESULT #undef ISL_PIPLIB cloog-0.18.2/isl/include/isl/arg.h0000664000175000017500000001763312254313240013561 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_ARG_H #define ISL_ARG_H #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_arg_choice { const char *name; unsigned value; }; struct isl_arg_flags { const char *name; unsigned mask; unsigned value; }; enum isl_arg_type { isl_arg_end, isl_arg_alias, isl_arg_arg, isl_arg_bool, isl_arg_child, isl_arg_choice, isl_arg_flags, isl_arg_footer, isl_arg_int, isl_arg_user, isl_arg_long, isl_arg_ulong, isl_arg_str, isl_arg_str_list, isl_arg_version }; struct isl_args; struct isl_arg { enum isl_arg_type type; char short_name; const char *long_name; const char *argument_name; size_t offset; const char *help_msg; #define ISL_ARG_SINGLE_DASH (1 << 0) #define ISL_ARG_BOOL_ARG (1 << 1) #define ISL_ARG_HIDDEN (1 << 2) unsigned flags; union { struct { struct isl_arg_choice *choice; unsigned default_value; unsigned default_selected; int (*set)(void *opt, unsigned val); } choice; struct { struct isl_arg_flags *flags; unsigned default_value; } flags; struct { unsigned default_value; int (*set)(void *opt, unsigned val); } b; struct { int default_value; } i; struct { long default_value; long default_selected; int (*set)(void *opt, long val); } l; struct { unsigned long default_value; } ul; struct { const char *default_value; } str; struct { size_t offset_n; } str_list; struct { struct isl_args *child; } child; struct { void (*print_version)(void); } version; struct { int (*init)(void*); void (*clear)(void*); } user; } u; }; struct isl_args { size_t options_size; struct isl_arg *args; }; #define ISL_ARGS_START(s,name) \ struct isl_arg name ## LIST[]; \ struct isl_args name = { sizeof(s), name ## LIST }; \ struct isl_arg name ## LIST[] = { #define ISL_ARGS_END \ { isl_arg_end } }; #define ISL_ARG_ALIAS(l) { \ .type = isl_arg_alias, \ .long_name = l, \ }, #define ISL_ARG_ARG(st,f,a,d) { \ .type = isl_arg_arg, \ .argument_name = a, \ .offset = offsetof(st, f), \ .u = { .str = { .default_value = d } } \ }, #define ISL_ARG_FOOTER(h) { \ .type = isl_arg_footer, \ .help_msg = h, \ }, #define ISL_ARG_CHOICE(st,f,s,l,c,d,h) { \ .type = isl_arg_choice, \ .short_name = s, \ .long_name = l, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .choice = { .choice = c, .default_value = d, \ .default_selected = d, .set = NULL } } \ }, #define ISL_ARG_OPT_CHOICE(st,f,s,l,c,d,ds,h) { \ .type = isl_arg_choice, \ .short_name = s, \ .long_name = l, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .choice = { .choice = c, .default_value = d, \ .default_selected = ds, .set = NULL } } \ }, #define ISL_ARG_USER_OPT_CHOICE(st,f,s,l,c,setter,d,ds,h) { \ .type = isl_arg_choice, \ .short_name = s, \ .long_name = l, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .choice = { .choice = c, .default_value = d, \ .default_selected = ds, .set = setter } } \ }, #define _ISL_ARG_BOOL_F(o,s,l,setter,d,h,fl) { \ .type = isl_arg_bool, \ .short_name = s, \ .long_name = l, \ .offset = o, \ .help_msg = h, \ .flags = fl, \ .u = { .b = { .default_value = d, .set = setter } } \ }, #define ISL_ARG_BOOL_F(st,f,s,l,d,h,fl) \ _ISL_ARG_BOOL_F(offsetof(st, f),s,l,NULL,d,h,fl) #define ISL_ARG_BOOL(st,f,s,l,d,h) \ ISL_ARG_BOOL_F(st,f,s,l,d,h,0) #define ISL_ARG_PHANTOM_BOOL_F(s,l,setter,h,fl) \ _ISL_ARG_BOOL_F(-1,s,l,setter,0,h,fl) #define ISL_ARG_PHANTOM_BOOL(s,l,setter,h) \ ISL_ARG_PHANTOM_BOOL_F(s,l,setter,h,0) #define ISL_ARG_INT_F(st,f,s,l,a,d,h,fl) { \ .type = isl_arg_int, \ .short_name = s, \ .long_name = l, \ .argument_name = a, \ .offset = offsetof(st, f), \ .help_msg = h, \ .flags = fl, \ .u = { .ul = { .default_value = d } } \ }, #define ISL_ARG_INT(st,f,s,l,a,d,h) \ ISL_ARG_INT_F(st,f,s,l,a,d,h,0) #define ISL_ARG_LONG(st,f,s,lo,d,h) { \ .type = isl_arg_long, \ .short_name = s, \ .long_name = lo, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .l = { .default_value = d, .default_selected = d, \ .set = NULL } } \ }, #define ISL_ARG_USER_LONG(st,f,s,lo,setter,d,h) { \ .type = isl_arg_long, \ .short_name = s, \ .long_name = lo, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .l = { .default_value = d, .default_selected = d, \ .set = setter } } \ }, #define ISL_ARG_OPT_LONG(st,f,s,lo,d,ds,h) { \ .type = isl_arg_long, \ .short_name = s, \ .long_name = lo, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .l = { .default_value = d, .default_selected = ds, \ .set = NULL } } \ }, #define ISL_ARG_ULONG(st,f,s,l,d,h) { \ .type = isl_arg_ulong, \ .short_name = s, \ .long_name = l, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .ul = { .default_value = d } } \ }, #define ISL_ARG_STR_F(st,f,s,l,a,d,h,fl) { \ .type = isl_arg_str, \ .short_name = s, \ .long_name = l, \ .argument_name = a, \ .offset = offsetof(st, f), \ .help_msg = h, \ .flags = fl, \ .u = { .str = { .default_value = d } } \ }, #define ISL_ARG_STR(st,f,s,l,a,d,h) \ ISL_ARG_STR_F(st,f,s,l,a,d,h,0) #define ISL_ARG_STR_LIST(st,f_n,f_l,s,l,a,h) { \ .type = isl_arg_str_list, \ .short_name = s, \ .long_name = l, \ .argument_name = a, \ .offset = offsetof(st, f_l), \ .help_msg = h, \ .u = { .str_list = { .offset_n = offsetof(st, f_n) } } \ }, #define _ISL_ARG_CHILD(o,l,c,h,fl) { \ .type = isl_arg_child, \ .long_name = l, \ .offset = o, \ .help_msg = h, \ .flags = fl, \ .u = { .child = { .child = c } } \ }, #define ISL_ARG_CHILD(st,f,l,c,h) \ _ISL_ARG_CHILD(offsetof(st, f),l,c,h,0) #define ISL_ARG_GROUP_F(c,h,fl) \ _ISL_ARG_CHILD(-1,NULL,c,h,fl) #define ISL_ARG_GROUP(c,h) \ ISL_ARG_GROUP_F(c,h,0) #define ISL_ARG_FLAGS(st,f,s,l,c,d,h) { \ .type = isl_arg_flags, \ .short_name = s, \ .long_name = l, \ .offset = offsetof(st, f), \ .help_msg = h, \ .u = { .flags = { .flags = c, .default_value = d } } \ }, #define ISL_ARG_USER(st,f,i,c) { \ .type = isl_arg_user, \ .offset = offsetof(st, f), \ .u = { .user = { .init = i, .clear = c} } \ }, #define ISL_ARG_VERSION(print) { \ .type = isl_arg_version, \ .u = { .version = { .print_version = print } } \ }, #define ISL_ARG_ALL (1 << 0) #define ISL_ARG_SKIP_HELP (1 << 1) void isl_args_set_defaults(struct isl_args *args, void *opt); void isl_args_free(struct isl_args *args, void *opt); int isl_args_parse(struct isl_args *args, int argc, char **argv, void *opt, unsigned flags); #define ISL_ARG_DECL(prefix,st,args) \ extern struct isl_args args; \ st *prefix ## _new_with_defaults(void); \ void prefix ## _free(st *opt); \ int prefix ## _parse(st *opt, int argc, char **argv, unsigned flags); #define ISL_ARG_DEF(prefix,st,args) \ st *prefix ## _new_with_defaults() \ { \ st *opt = (st *)calloc(1, sizeof(st)); \ if (opt) \ isl_args_set_defaults(&(args), opt); \ return opt; \ } \ \ void prefix ## _free(st *opt) \ { \ isl_args_free(&(args), opt); \ } \ \ int prefix ## _parse(st *opt, int argc, char **argv, unsigned flags) \ { \ return isl_args_parse(&(args), argc, argv, opt, flags); \ } #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/space.h0000664000175000017500000001421112254313240014070 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_SPACE_H #define ISL_SPACE_H #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_space; typedef struct isl_space isl_space; enum isl_dim_type { isl_dim_cst, isl_dim_param, isl_dim_in, isl_dim_out, isl_dim_set = isl_dim_out, isl_dim_div, isl_dim_all }; isl_ctx *isl_space_get_ctx(__isl_keep isl_space *dim); __isl_give isl_space *isl_space_alloc(isl_ctx *ctx, unsigned nparam, unsigned n_in, unsigned n_out); __isl_give isl_space *isl_space_set_alloc(isl_ctx *ctx, unsigned nparam, unsigned dim); __isl_give isl_space *isl_space_params_alloc(isl_ctx *ctx, unsigned nparam); __isl_give isl_space *isl_space_copy(__isl_keep isl_space *dim); void *isl_space_free(__isl_take isl_space *dim); int isl_space_is_params(__isl_keep isl_space *space); int isl_space_is_set(__isl_keep isl_space *space); int isl_space_is_map(__isl_keep isl_space *space); __isl_give isl_space *isl_space_set_tuple_name(__isl_take isl_space *dim, enum isl_dim_type type, const char *s); int isl_space_has_tuple_name(__isl_keep isl_space *space, enum isl_dim_type type); const char *isl_space_get_tuple_name(__isl_keep isl_space *dim, enum isl_dim_type type); __isl_give isl_space *isl_space_set_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_space *isl_space_reset_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type); int isl_space_has_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type); __isl_give isl_id *isl_space_get_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type); __isl_give isl_space *isl_space_set_dim_id(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_space_has_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_space_get_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos); int isl_space_find_dim_by_id(__isl_keep isl_space *dim, enum isl_dim_type type, __isl_keep isl_id *id); int isl_space_find_dim_by_name(__isl_keep isl_space *space, enum isl_dim_type type, const char *name); int isl_space_has_dim_name(__isl_keep isl_space *space, enum isl_dim_type type, unsigned pos); __isl_give isl_space *isl_space_set_dim_name(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, __isl_keep const char *name); __isl_keep const char *isl_space_get_dim_name(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos); __isl_give isl_space *isl_space_extend(__isl_take isl_space *dim, unsigned nparam, unsigned n_in, unsigned n_out); __isl_give isl_space *isl_space_add_dims(__isl_take isl_space *dim, enum isl_dim_type type, unsigned n); __isl_give isl_space *isl_space_move_dims(__isl_take isl_space *dim, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_space *isl_space_insert_dims(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_space *isl_space_join(__isl_take isl_space *left, __isl_take isl_space *right); __isl_give isl_space *isl_space_product(__isl_take isl_space *left, __isl_take isl_space *right); __isl_give isl_space *isl_space_domain_product(__isl_take isl_space *left, __isl_take isl_space *right); __isl_give isl_space *isl_space_range_product(__isl_take isl_space *left, __isl_take isl_space *right); __isl_give isl_space *isl_space_map_from_set(__isl_take isl_space *dim); __isl_give isl_space *isl_space_map_from_domain_and_range( __isl_take isl_space *domain, __isl_take isl_space *range); __isl_give isl_space *isl_space_reverse(__isl_take isl_space *dim); __isl_give isl_space *isl_space_drop_dims(__isl_take isl_space *dim, enum isl_dim_type type, unsigned first, unsigned num); __isl_give isl_space *isl_space_drop_inputs(__isl_take isl_space *dim, unsigned first, unsigned n); __isl_give isl_space *isl_space_drop_outputs(__isl_take isl_space *dim, unsigned first, unsigned n); __isl_give isl_space *isl_space_domain(__isl_take isl_space *dim); __isl_give isl_space *isl_space_from_domain(__isl_take isl_space *dim); __isl_give isl_space *isl_space_range(__isl_take isl_space *dim); __isl_give isl_space *isl_space_from_range(__isl_take isl_space *dim); __isl_give isl_space *isl_space_params(__isl_take isl_space *space); __isl_give isl_space *isl_space_set_from_params(__isl_take isl_space *space); __isl_give isl_space *isl_space_align_params(__isl_take isl_space *dim1, __isl_take isl_space *dim2); int isl_space_is_wrapping(__isl_keep isl_space *dim); __isl_give isl_space *isl_space_wrap(__isl_take isl_space *dim); __isl_give isl_space *isl_space_unwrap(__isl_take isl_space *dim); int isl_space_can_zip(__isl_keep isl_space *dim); __isl_give isl_space *isl_space_zip(__isl_take isl_space *dim); int isl_space_can_curry(__isl_keep isl_space *space); __isl_give isl_space *isl_space_curry(__isl_take isl_space *space); int isl_space_can_uncurry(__isl_keep isl_space *space); __isl_give isl_space *isl_space_uncurry(__isl_take isl_space *space); int isl_space_is_domain(__isl_keep isl_space *space1, __isl_keep isl_space *space2); int isl_space_is_range(__isl_keep isl_space *space1, __isl_keep isl_space *space2); int isl_space_is_equal(__isl_keep isl_space *space1, __isl_keep isl_space *space2); int isl_space_match(__isl_keep isl_space *dim1, enum isl_dim_type dim1_type, __isl_keep isl_space *dim2, enum isl_dim_type dim2_type); int isl_space_tuple_match(__isl_keep isl_space *dim1, enum isl_dim_type dim1_type, __isl_keep isl_space *dim2, enum isl_dim_type dim2_type); int isl_space_compatible(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2); unsigned isl_space_dim(__isl_keep isl_space *dim, enum isl_dim_type type); __isl_give isl_printer *isl_printer_print_space(__isl_take isl_printer *p, __isl_keep isl_space *dim); void isl_space_dump(__isl_keep isl_space *dim); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/obj.h0000664000175000017500000000447212254313240013557 00000000000000#ifndef ISL_OBJ_H #define ISL_OBJ_H #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_obj_vtable { void *(*copy)(void *v1); void *(*add)(void *v1, void *v2); __isl_give isl_printer *(*print)(__isl_take isl_printer *p, void *v); void (*free)(void *v); }; typedef struct isl_obj_vtable *isl_obj_type; extern struct isl_obj_vtable isl_obj_none_vtable; #define isl_obj_none (&isl_obj_none_vtable) extern struct isl_obj_vtable isl_obj_int_vtable; #define isl_obj_int (&isl_obj_int_vtable) extern struct isl_obj_vtable isl_obj_val_vtable; #define isl_obj_val (&isl_obj_val_vtable) extern struct isl_obj_vtable isl_obj_set_vtable; #define isl_obj_set (&isl_obj_set_vtable) extern struct isl_obj_vtable isl_obj_union_set_vtable; #define isl_obj_union_set (&isl_obj_union_set_vtable) extern struct isl_obj_vtable isl_obj_map_vtable; #define isl_obj_map (&isl_obj_map_vtable) extern struct isl_obj_vtable isl_obj_union_map_vtable; #define isl_obj_union_map (&isl_obj_union_map_vtable) extern struct isl_obj_vtable isl_obj_pw_qpolynomial_vtable; #define isl_obj_pw_qpolynomial (&isl_obj_pw_qpolynomial_vtable) extern struct isl_obj_vtable isl_obj_union_pw_qpolynomial_vtable; #define isl_obj_union_pw_qpolynomial (&isl_obj_union_pw_qpolynomial_vtable) extern struct isl_obj_vtable isl_obj_pw_qpolynomial_fold_vtable; #define isl_obj_pw_qpolynomial_fold (&isl_obj_pw_qpolynomial_fold_vtable) extern struct isl_obj_vtable isl_obj_union_pw_qpolynomial_fold_vtable; #define isl_obj_union_pw_qpolynomial_fold (&isl_obj_union_pw_qpolynomial_fold_vtable) struct isl_obj { isl_obj_type type; void *v; }; struct isl_int_obj; typedef struct isl_int_obj isl_int_obj; __isl_give isl_int_obj *isl_int_obj_alloc(isl_ctx *ctx, isl_int v); void isl_int_obj_free(__isl_take isl_int_obj *i); __isl_give isl_int_obj *isl_int_obj_add(__isl_take isl_int_obj *i1, __isl_take isl_int_obj *i2); __isl_give isl_int_obj *isl_int_obj_sub(__isl_take isl_int_obj *i1, __isl_take isl_int_obj *i2); __isl_give isl_int_obj *isl_int_obj_mul(__isl_take isl_int_obj *i1, __isl_take isl_int_obj *i2); void isl_int_obj_get_int(__isl_keep isl_int_obj *i, isl_int *v); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/map_type.h0000664000175000017500000000125712254313240014621 00000000000000#ifndef ISL_MAP_TYPE_H #define ISL_MAP_TYPE_H #include #include #if defined(__cplusplus) extern "C" { #endif struct __isl_subclass(isl_map) isl_basic_map; typedef struct isl_basic_map isl_basic_map; struct __isl_subclass(isl_union_map) isl_map; typedef struct isl_map isl_map; #ifndef isl_basic_set struct __isl_subclass(isl_set) isl_basic_set; typedef struct isl_basic_set isl_basic_set; ISL_DECLARE_LIST_TYPE(basic_set) #endif #ifndef isl_set struct __isl_subclass(isl_union_set) isl_set; typedef struct isl_set isl_set; ISL_DECLARE_LIST_TYPE(set) #endif ISL_DECLARE_LIST_FN(basic_set) ISL_DECLARE_LIST_FN(set) #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/dim.h0000664000175000017500000001150612254313240013552 00000000000000#ifndef ISL_DIM_H #define ISL_DIM_H #include #include #include #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif #define isl_dim isl_space isl_ctx *isl_dim_get_ctx(__isl_keep isl_space *dim); __isl_give isl_space *isl_dim_alloc(isl_ctx *ctx, unsigned nparam, unsigned n_in, unsigned n_out); __isl_give isl_space *isl_dim_set_alloc(isl_ctx *ctx, unsigned nparam, unsigned dim); __isl_give isl_space *isl_dim_copy(__isl_keep isl_space *dim); void isl_dim_free(__isl_take isl_space *dim); unsigned isl_dim_size(__isl_keep isl_space *dim, enum isl_dim_type type); __isl_give isl_space *isl_dim_set_dim_id(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_dim_has_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_dim_get_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos); int isl_dim_find_dim_by_id(__isl_keep isl_space *dim, enum isl_dim_type type, __isl_keep isl_id *id); __isl_give isl_space *isl_dim_set_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_space *isl_dim_reset_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type); int isl_dim_has_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type); __isl_give isl_id *isl_dim_get_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type); __isl_give isl_space *isl_dim_set_name(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, __isl_keep const char *name); __isl_keep const char *isl_dim_get_name(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos); __isl_give isl_space *isl_dim_set_tuple_name(__isl_take isl_space *dim, enum isl_dim_type type, const char *s); const char *isl_dim_get_tuple_name(__isl_keep isl_space *dim, enum isl_dim_type type); int isl_dim_is_wrapping(__isl_keep isl_space *dim); __isl_give isl_space *isl_dim_wrap(__isl_take isl_space *dim); __isl_give isl_space *isl_dim_unwrap(__isl_take isl_space *dim); __isl_give isl_space *isl_dim_domain(__isl_take isl_space *dim); __isl_give isl_space *isl_dim_from_domain(__isl_take isl_space *dim); __isl_give isl_space *isl_dim_range(__isl_take isl_space *dim); __isl_give isl_space *isl_dim_from_range(__isl_take isl_space *dim); __isl_give isl_space *isl_dim_reverse(__isl_take isl_space *dim); __isl_give isl_space *isl_dim_join(__isl_take isl_space *left, __isl_take isl_space *right); __isl_give isl_space *isl_dim_align_params(__isl_take isl_space *dim1, __isl_take isl_space *dim2); __isl_give isl_space *isl_dim_insert(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_space *isl_dim_add(__isl_take isl_space *dim, enum isl_dim_type type, unsigned n); __isl_give isl_space *isl_dim_drop(__isl_take isl_space *dim, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_space *isl_dim_move(__isl_take isl_space *dim, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_space *isl_dim_map_from_set( __isl_take isl_space *dim); __isl_give isl_space *isl_dim_zip(__isl_take isl_space *dim); __isl_give isl_local_space *isl_local_space_from_dim( __isl_take isl_space *dim); __isl_give isl_space *isl_local_space_get_dim( __isl_keep isl_local_space *ls); __isl_give isl_space *isl_aff_get_dim(__isl_keep isl_aff *aff); __isl_give isl_space *isl_pw_aff_get_dim(__isl_keep isl_pw_aff *pwaff); __isl_give isl_space *isl_constraint_get_dim( __isl_keep isl_constraint *constraint); __isl_give isl_space *isl_basic_map_get_dim(__isl_keep isl_basic_map *bmap); __isl_give isl_space *isl_map_get_dim(__isl_keep isl_map *map); __isl_give isl_space *isl_union_map_get_dim(__isl_keep isl_union_map *umap); __isl_give isl_space *isl_basic_set_get_dim(__isl_keep isl_basic_set *bset); __isl_give isl_space *isl_set_get_dim(__isl_keep isl_set *set); __isl_give isl_space *isl_union_set_get_dim(__isl_keep isl_union_set *uset); __isl_give isl_space *isl_point_get_dim(__isl_keep isl_point *pnt); __isl_give isl_space *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp); __isl_give isl_space *isl_pw_qpolynomial_get_dim( __isl_keep isl_pw_qpolynomial *pwqp); __isl_give isl_space *isl_qpolynomial_fold_get_dim( __isl_keep isl_qpolynomial_fold *fold); __isl_give isl_space *isl_pw_qpolynomial_fold_get_dim( __isl_keep isl_pw_qpolynomial_fold *pwf); __isl_give isl_space *isl_union_pw_qpolynomial_get_dim( __isl_keep isl_union_pw_qpolynomial *upwqp); __isl_give isl_space *isl_union_pw_qpolynomial_fold_get_dim( __isl_keep isl_union_pw_qpolynomial_fold *upwf); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/val_int.h0000664000175000017500000000034712254313240014436 00000000000000#ifndef ISL_VAL_INT_H #define ISL_VAL_INT_H #include #include __isl_give isl_val *isl_val_int_from_isl_int(isl_ctx *ctx, isl_int n); int isl_val_get_num_isl_int(__isl_keep isl_val *v, isl_int *n); #endif cloog-0.18.2/isl/include/isl/version.h0000664000175000017500000000024512254313240014464 00000000000000#ifndef ISL_VERSION_H #define ISL_VERSION_H #if defined(__cplusplus) extern "C" { #endif const char *isl_version(void); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/int.h0000664000175000017500000001037112254313240013572 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_INT_H #define ISL_INT_H #include #include #include #if defined(__cplusplus) #include #endif #if defined(__cplusplus) extern "C" { #endif #ifndef mp_get_memory_functions void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)); #endif /* isl_int is the basic integer type. It currently always corresponds * to a gmp mpz_t, but in the future, different types such as long long * or cln::cl_I will be supported. */ typedef mpz_t isl_int; #define isl_int_init(i) mpz_init(i) #define isl_int_clear(i) mpz_clear(i) #define isl_int_set(r,i) mpz_set(r,i) #define isl_int_set_gmp(r,i) mpz_set(r,i) #define isl_int_set_si(r,i) mpz_set_si(r,i) #define isl_int_set_ui(r,i) mpz_set_ui(r,i) #define isl_int_get_gmp(i,g) mpz_set(g,i) #define isl_int_get_si(r) mpz_get_si(r) #define isl_int_get_ui(r) mpz_get_ui(r) #define isl_int_get_d(r) mpz_get_d(r) #define isl_int_get_str(r) mpz_get_str(0, 10, r) typedef void (*isl_int_print_gmp_free_t)(void *, size_t); #define isl_int_free_str(s) \ do { \ isl_int_print_gmp_free_t gmp_free; \ mp_get_memory_functions(NULL, NULL, &gmp_free); \ (*gmp_free)(s, strlen(s) + 1); \ } while (0) #define isl_int_abs(r,i) mpz_abs(r,i) #define isl_int_neg(r,i) mpz_neg(r,i) #define isl_int_swap(i,j) mpz_swap(i,j) #define isl_int_swap_or_set(i,j) mpz_swap(i,j) #define isl_int_add_ui(r,i,j) mpz_add_ui(r,i,j) #define isl_int_sub_ui(r,i,j) mpz_sub_ui(r,i,j) #define isl_int_add(r,i,j) mpz_add(r,i,j) #define isl_int_sub(r,i,j) mpz_sub(r,i,j) #define isl_int_mul(r,i,j) mpz_mul(r,i,j) #define isl_int_mul_2exp(r,i,j) mpz_mul_2exp(r,i,j) #define isl_int_mul_ui(r,i,j) mpz_mul_ui(r,i,j) #define isl_int_pow_ui(r,i,j) mpz_pow_ui(r,i,j) #define isl_int_addmul(r,i,j) mpz_addmul(r,i,j) #define isl_int_submul(r,i,j) mpz_submul(r,i,j) #define isl_int_gcd(r,i,j) mpz_gcd(r,i,j) #define isl_int_lcm(r,i,j) mpz_lcm(r,i,j) #define isl_int_divexact(r,i,j) mpz_divexact(r,i,j) #define isl_int_divexact_ui(r,i,j) mpz_divexact_ui(r,i,j) #define isl_int_tdiv_q(r,i,j) mpz_tdiv_q(r,i,j) #define isl_int_cdiv_q(r,i,j) mpz_cdiv_q(r,i,j) #define isl_int_fdiv_q(r,i,j) mpz_fdiv_q(r,i,j) #define isl_int_fdiv_r(r,i,j) mpz_fdiv_r(r,i,j) #define isl_int_fdiv_q_ui(r,i,j) mpz_fdiv_q_ui(r,i,j) #define isl_int_read(r,s) mpz_set_str(r,s,10) #define isl_int_print(out,i,width) \ do { \ char *s; \ s = mpz_get_str(0, 10, i); \ fprintf(out, "%*s", width, s); \ isl_int_free_str(s); \ } while (0) #define isl_int_sgn(i) mpz_sgn(i) #define isl_int_cmp(i,j) mpz_cmp(i,j) #define isl_int_cmp_si(i,si) mpz_cmp_si(i,si) #define isl_int_eq(i,j) (mpz_cmp(i,j) == 0) #define isl_int_ne(i,j) (mpz_cmp(i,j) != 0) #define isl_int_lt(i,j) (mpz_cmp(i,j) < 0) #define isl_int_le(i,j) (mpz_cmp(i,j) <= 0) #define isl_int_gt(i,j) (mpz_cmp(i,j) > 0) #define isl_int_ge(i,j) (mpz_cmp(i,j) >= 0) #define isl_int_abs_eq(i,j) (mpz_cmpabs(i,j) == 0) #define isl_int_abs_ne(i,j) (mpz_cmpabs(i,j) != 0) #define isl_int_abs_lt(i,j) (mpz_cmpabs(i,j) < 0) #define isl_int_abs_gt(i,j) (mpz_cmpabs(i,j) > 0) #define isl_int_abs_ge(i,j) (mpz_cmpabs(i,j) >= 0) #define isl_int_is_zero(i) (isl_int_sgn(i) == 0) #define isl_int_is_one(i) (isl_int_cmp_si(i,1) == 0) #define isl_int_is_negone(i) (isl_int_cmp_si(i,-1) == 0) #define isl_int_is_pos(i) (isl_int_sgn(i) > 0) #define isl_int_is_neg(i) (isl_int_sgn(i) < 0) #define isl_int_is_nonpos(i) (isl_int_sgn(i) <= 0) #define isl_int_is_nonneg(i) (isl_int_sgn(i) >= 0) #define isl_int_is_divisible_by(i,j) mpz_divisible_p(i,j) uint32_t isl_gmp_hash(mpz_t v, uint32_t hash); #define isl_int_hash(v,h) isl_gmp_hash(v,h) #if defined(__cplusplus) } #endif #if defined(__cplusplus) extern "C" { typedef void (*isl_gmp_free_t)(void *, size_t); } static inline std::ostream &operator<<(std::ostream &os, isl_int i) { char *s; s = mpz_get_str(0, 10, i); os << s; isl_int_free_str(s); return os; } #endif #endif cloog-0.18.2/isl/include/isl/point.h0000664000175000017500000000302112254313240014123 00000000000000#ifndef ISL_POINT_H #define ISL_POINT_H #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_point; typedef struct isl_point isl_point; isl_ctx *isl_point_get_ctx(__isl_keep isl_point *pnt); __isl_give isl_space *isl_point_get_space(__isl_keep isl_point *pnt); __isl_give isl_point *isl_point_zero(__isl_take isl_space *dim); __isl_give isl_point *isl_point_copy(__isl_keep isl_point *pnt); void isl_point_free(__isl_take isl_point *pnt); int isl_point_get_coordinate(__isl_keep isl_point *pnt, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_val *isl_point_get_coordinate_val(__isl_keep isl_point *pnt, enum isl_dim_type type, int pos); __isl_give isl_point *isl_point_set_coordinate(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_point *isl_point_set_coordinate_val(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, __isl_take isl_val *v); __isl_give isl_point *isl_point_add_ui(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, unsigned val); __isl_give isl_point *isl_point_sub_ui(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, unsigned val); __isl_give isl_point *isl_point_void(__isl_take isl_space *dim); int isl_point_is_void(__isl_keep isl_point *pnt); __isl_give isl_printer *isl_printer_print_point( __isl_take isl_printer *printer, __isl_keep isl_point *pnt); void isl_point_dump(__isl_keep isl_point *pnt); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/vertices.h0000664000175000017500000000277212254313240014632 00000000000000#ifndef ISL_VERTICES_H #define ISL_VERTICES_H #include #if defined(__cplusplus) extern "C" { #endif struct isl_external_vertex; typedef struct isl_external_vertex isl_vertex; struct isl_cell; typedef struct isl_cell isl_cell; struct isl_vertices; typedef struct isl_vertices isl_vertices; isl_ctx *isl_vertex_get_ctx(__isl_keep isl_vertex *vertex); int isl_vertex_get_id(__isl_keep isl_vertex *vertex); __isl_give isl_basic_set *isl_vertex_get_domain(__isl_keep isl_vertex *vertex); __isl_give isl_basic_set *isl_vertex_get_expr(__isl_keep isl_vertex *vertex); void isl_vertex_free(__isl_take isl_vertex *vertex); __isl_give isl_vertices *isl_basic_set_compute_vertices( __isl_keep isl_basic_set *bset); isl_ctx *isl_vertices_get_ctx(__isl_keep isl_vertices *vertices); int isl_vertices_get_n_vertices(__isl_keep isl_vertices *vertices); int isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user); void isl_vertices_free(__isl_take isl_vertices *vertices); isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell); __isl_give isl_basic_set *isl_cell_get_domain(__isl_keep isl_cell *cell); int isl_cell_foreach_vertex(__isl_keep isl_cell *cell, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user); void isl_cell_free(__isl_take isl_cell *cell); int isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/set.h0000664000175000017500000006074112254313240013601 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_SET_H #define ISL_SET_H #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset); unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset); unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset); unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset, enum isl_dim_type type); unsigned isl_set_n_dim(__isl_keep isl_set *set); unsigned isl_set_n_param(__isl_keep isl_set *set); unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type); isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset); isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set); __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset); __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set); __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set, __isl_take isl_space *dim); __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset, int pos); __isl_give isl_local_space *isl_basic_set_get_local_space( __isl_keep isl_basic_set *bset); const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset); int isl_set_has_tuple_name(__isl_keep isl_set *set); const char *isl_set_get_tuple_name(__isl_keep isl_set *set); __isl_give isl_basic_set *isl_basic_set_set_tuple_name( __isl_take isl_basic_set *set, const char *s); __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set, const char *s); const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos); __isl_give isl_basic_set *isl_basic_set_set_dim_name( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, const char *s); int isl_set_has_dim_name(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); const char *isl_set_get_dim_name(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_id *isl_basic_set_get_dim_id(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos); __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_set_has_dim_id(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set, __isl_take isl_id *id); __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set); int isl_set_has_tuple_id(__isl_keep isl_set *set); __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set); int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type, __isl_keep isl_id *id); int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type, const char *name); int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset); struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq); struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq); struct isl_basic_set *isl_basic_set_extend_constraints( struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq); struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset); void *isl_basic_set_free(__isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_copy(__isl_keep isl_basic_set *bset); struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim); struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim); __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim); struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_universe_like_set( __isl_keep isl_set *model); struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx, isl_int min, isl_int max); __isl_give isl_basic_set *isl_basic_set_positive_orthant( __isl_take isl_space *space); void isl_basic_set_print_internal(__isl_keep isl_basic_set *bset, FILE *out, int indent); __isl_export __isl_give isl_basic_set *isl_basic_set_intersect( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_export __isl_give isl_basic_set *isl_basic_set_intersect_params( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_export __isl_give isl_basic_set *isl_basic_set_apply( __isl_take isl_basic_set *bset, __isl_take isl_basic_map *bmap); __isl_give isl_basic_set *isl_basic_set_preimage_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_multi_aff *ma); __isl_export __isl_give isl_basic_set *isl_basic_set_affine_hull( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_remove_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_export __isl_give isl_basic_set *isl_basic_set_sample(__isl_take isl_basic_set *bset); struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset); __isl_export __isl_give isl_basic_set *isl_basic_set_detect_equalities( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_remove_redundancies( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_remove_redundancies(__isl_take isl_set *set); __isl_give isl_basic_set *isl_basic_set_list_product( __isl_take struct isl_basic_set_list *list); __isl_give isl_basic_set *isl_basic_set_read_from_file(isl_ctx *ctx, FILE *input); __isl_constructor __isl_give isl_basic_set *isl_basic_set_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_set *isl_set_read_from_file(isl_ctx *ctx, FILE *input); __isl_constructor __isl_give isl_set *isl_set_read_from_str(isl_ctx *ctx, const char *str); void isl_basic_set_dump(__isl_keep isl_basic_set *bset); void isl_set_dump(__isl_keep isl_set *set); __isl_give isl_printer *isl_printer_print_basic_set( __isl_take isl_printer *printer, __isl_keep isl_basic_set *bset); __isl_give isl_printer *isl_printer_print_set(__isl_take isl_printer *printer, __isl_keep isl_set *map); void isl_basic_set_print(__isl_keep isl_basic_set *bset, FILE *out, int indent, const char *prefix, const char *suffix, unsigned output_format); void isl_set_print(__isl_keep struct isl_set *set, FILE *out, int indent, unsigned output_format); __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_basic_set *isl_basic_set_fix_si(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_basic_set *isl_basic_set_fix_val(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_set *isl_set_lower_bound_val(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *value); __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value); __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_set *isl_set_upper_bound_val(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *value); __isl_give isl_set *isl_set_equate(__isl_take isl_set *set, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2); struct isl_basic_set *isl_basic_set_from_underlying_set( struct isl_basic_set *bset, struct isl_basic_set *like); struct isl_set *isl_set_from_underlying_set( struct isl_set *set, struct isl_basic_set *like); struct isl_set *isl_set_to_underlying_set(struct isl_set *set); __isl_export int isl_basic_set_is_equal( struct isl_basic_set *bset1, struct isl_basic_set *bset2); __isl_give isl_set *isl_basic_set_partial_lexmin( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_set *isl_basic_set_partial_lexmax( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_set *isl_set_partial_lexmin( __isl_take isl_set *set, __isl_take isl_set *dom, __isl_give isl_set **empty); __isl_give isl_set *isl_set_partial_lexmax( __isl_take isl_set *set, __isl_take isl_set *dom, __isl_give isl_set **empty); __isl_export __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset); __isl_export __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset); __isl_export __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set); __isl_export __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty); __isl_give isl_pw_multi_aff *isl_set_lexmin_pw_multi_aff( __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_set_lexmax_pw_multi_aff( __isl_take isl_set *set); __isl_export __isl_give isl_set *isl_basic_set_union( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); int isl_basic_set_compare_at(struct isl_basic_set *bset1, struct isl_basic_set *bset2, int pos); int isl_set_follows_at(__isl_keep isl_set *set1, __isl_keep isl_set *set2, int pos); __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_from_params( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_params(__isl_take isl_set *set); __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set); int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos, unsigned n, int *signs); int isl_basic_set_is_universe(__isl_keep isl_basic_set *bset); int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset); int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset); __isl_export int isl_basic_set_is_empty(__isl_keep isl_basic_set *bset); int isl_basic_set_is_bounded(__isl_keep isl_basic_set *bset); __isl_export int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2); struct isl_set *isl_set_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned dim, int n, unsigned flags); struct isl_set *isl_set_extend(struct isl_set *base, unsigned nparam, unsigned dim); __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim); struct isl_set *isl_set_empty_like(struct isl_set *set); __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim); __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim); __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model); __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set, __isl_take isl_basic_set *bset); struct isl_set *isl_set_finalize(struct isl_set *set); __isl_give isl_set *isl_set_copy(__isl_keep isl_set *set); void *isl_set_free(__isl_take isl_set *set); struct isl_set *isl_set_dup(struct isl_set *set); __isl_constructor __isl_give isl_set *isl_set_from_basic_set(__isl_take isl_basic_set *bset); __isl_export __isl_give isl_basic_set *isl_set_sample(__isl_take isl_set *set); __isl_give isl_point *isl_basic_set_sample_point(__isl_take isl_basic_set *bset); __isl_give isl_point *isl_set_sample_point(__isl_take isl_set *set); __isl_export __isl_give isl_set *isl_set_detect_equalities(__isl_take isl_set *set); __isl_export __isl_give isl_basic_set *isl_set_affine_hull(__isl_take isl_set *set); __isl_give isl_basic_set *isl_set_convex_hull(__isl_take isl_set *set); __isl_export __isl_give isl_basic_set *isl_set_polyhedral_hull(__isl_take isl_set *set); __isl_give isl_basic_set *isl_set_simple_hull(__isl_take isl_set *set); __isl_give isl_basic_set *isl_set_unshifted_simple_hull( __isl_take isl_set *set); struct isl_basic_set *isl_set_bounded_simple_hull(struct isl_set *set); __isl_give isl_set *isl_set_recession_cone(__isl_take isl_set *set); struct isl_set *isl_set_union_disjoint( struct isl_set *set1, struct isl_set *set2); __isl_export __isl_give isl_set *isl_set_union( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_set *isl_set_product(__isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_basic_set *isl_basic_set_flat_product( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2); __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1, __isl_take isl_set *set2); __isl_export __isl_give isl_set *isl_set_intersect( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_export __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set, __isl_take isl_set *params); __isl_export __isl_give isl_set *isl_set_subtract( __isl_take isl_set *set1, __isl_take isl_set *set2); __isl_export __isl_give isl_set *isl_set_complement(__isl_take isl_set *set); __isl_export __isl_give isl_set *isl_set_apply( __isl_take isl_set *set, __isl_take isl_map *map); __isl_give isl_set *isl_set_preimage_multi_aff(__isl_take isl_set *set, __isl_take isl_multi_aff *ma); __isl_give isl_set *isl_set_preimage_pw_multi_aff(__isl_take isl_set *set, __isl_take isl_pw_multi_aff *pma); __isl_give isl_set *isl_set_fix(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value); __isl_give isl_set *isl_set_fix_val(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v); struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value); struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim, isl_int value); __isl_give isl_basic_set *isl_basic_set_insert_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, unsigned n); __isl_give isl_basic_set *isl_basic_set_add_dims(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned n); /* deprecated */ __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned n); __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned n); __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n); __isl_give isl_basic_set *isl_basic_set_project_out( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set *isl_basic_set_remove_divs( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_eliminate( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); struct isl_set *isl_set_eliminate_dims(struct isl_set *set, unsigned first, unsigned n); __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set *isl_basic_set_remove_divs_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set *isl_basic_set_remove_unknown_divs( __isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set); __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set); __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set *isl_basic_set_drop_constraints_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_basic_set *isl_basic_set_drop_constraints_not_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_set_drop_constraints_involving_dims( __isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n); int isl_set_involves_dims(__isl_keep isl_set *set, enum isl_dim_type type, unsigned first, unsigned n); void isl_set_print_internal(__isl_keep isl_set *set, FILE *out, int indent); int isl_set_plain_is_empty(__isl_keep isl_set *set); int isl_set_fast_is_empty(__isl_keep isl_set *set); int isl_set_plain_is_universe(__isl_keep isl_set *set); int isl_set_fast_is_universe(__isl_keep isl_set *set); int isl_set_is_params(__isl_keep isl_set *set); __isl_export int isl_set_is_empty(__isl_keep isl_set *set); int isl_set_is_bounded(__isl_keep isl_set *set); __isl_export int isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2); __isl_export int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2); __isl_export int isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); __isl_export int isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_is_singleton(__isl_keep isl_set *set); int isl_set_is_box(__isl_keep isl_set *set); int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2); __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_neg(__isl_take isl_set *set); __isl_give isl_set *isl_set_make_disjoint(__isl_take isl_set *set); struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset); __isl_give isl_set *isl_set_compute_divs(__isl_take isl_set *set); __isl_give isl_set *isl_set_align_divs(__isl_take isl_set *set); struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set); struct isl_set *isl_set_drop_basic_set(struct isl_set *set, struct isl_basic_set *bset); int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset, unsigned dim, isl_int *val); int isl_set_plain_is_fixed(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos, isl_int *val); int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set, unsigned dim, isl_int *val); int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set, unsigned dim, isl_int *val); __isl_give isl_val *isl_set_plain_get_val_if_fixed(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set, unsigned dim, isl_int *val); int isl_set_dim_is_bounded(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_set_dim_has_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_set_dim_has_upper_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); int isl_set_dim_has_any_upper_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos); __isl_export __isl_give isl_basic_set *isl_basic_set_gist(__isl_take isl_basic_set *bset, __isl_take isl_basic_set *context); __isl_give isl_set *isl_set_gist_basic_set(__isl_take isl_set *set, __isl_take isl_basic_set *context); __isl_export __isl_give isl_set *isl_set_gist(__isl_take isl_set *set, __isl_take isl_set *context); __isl_give isl_set *isl_set_gist_params(__isl_take isl_set *set, __isl_take isl_set *context); int isl_basic_set_dim_residue_class(struct isl_basic_set *bset, int pos, isl_int *modulo, isl_int *residue); int isl_set_dim_residue_class(struct isl_set *set, int pos, isl_int *modulo, isl_int *residue); int isl_set_dim_residue_class_val(__isl_keep isl_set *set, int pos, __isl_give isl_val **modulo, __isl_give isl_val **residue); __isl_export __isl_give isl_set *isl_set_coalesce(__isl_take isl_set *set); int isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_plain_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2); int isl_set_fast_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2); uint32_t isl_set_get_hash(struct isl_set *set); int isl_set_dim_is_unique(struct isl_set *set, unsigned dim); int isl_set_n_basic_set(__isl_keep isl_set *set); __isl_export int isl_set_foreach_basic_set(__isl_keep isl_set *set, int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user); int isl_set_foreach_point(__isl_keep isl_set *set, int (*fn)(__isl_take isl_point *pnt, void *user), void *user); int isl_set_count(__isl_keep isl_set *set, isl_int *count); __isl_give isl_val *isl_set_count_val(__isl_keep isl_set *set); int isl_basic_set_count_upto(__isl_keep isl_basic_set *bset, isl_int max, isl_int *count); int isl_set_count_upto(__isl_keep isl_set *set, isl_int max, isl_int *count); __isl_give isl_basic_set *isl_basic_set_from_point(__isl_take isl_point *pnt); __isl_give isl_set *isl_set_from_point(__isl_take isl_point *pnt); __isl_give isl_basic_set *isl_basic_set_box_from_points( __isl_take isl_point *pnt1, __isl_take isl_point *pnt2); __isl_give isl_set *isl_set_box_from_points(__isl_take isl_point *pnt1, __isl_take isl_point *pnt2); __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset); __isl_give isl_set *isl_set_lift(__isl_take isl_set *set); __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1, __isl_take isl_set *set2); __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1, __isl_take isl_set *set2); int isl_set_size(__isl_keep isl_set *set); __isl_give isl_basic_set *isl_basic_set_align_params( __isl_take isl_basic_set *bset, __isl_take isl_space *model); __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set, __isl_take isl_space *model); __isl_give isl_mat *isl_basic_set_equalities_matrix( __isl_keep isl_basic_set *bset, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4); __isl_give isl_mat *isl_basic_set_inequalities_matrix( __isl_keep isl_basic_set *bset, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4); __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices( __isl_take isl_space *dim, __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4); __isl_give isl_mat *isl_basic_set_reduced_basis(__isl_keep isl_basic_set *bset); __isl_give isl_basic_set *isl_basic_set_coefficients( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_set_coefficients(__isl_take isl_set *set); __isl_give isl_basic_set *isl_basic_set_solutions( __isl_take isl_basic_set *bset); __isl_give isl_basic_set *isl_set_solutions(__isl_take isl_set *set); __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos); __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos); __isl_give char *isl_set_to_str(__isl_keep isl_set *set); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/constraint.h0000664000175000017500000001335312254313240015167 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_CONSTRAINT_H #define ISL_CONSTRAINT_H #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_constraint; typedef struct isl_constraint isl_constraint; ISL_DECLARE_LIST(constraint) isl_ctx *isl_constraint_get_ctx(__isl_keep isl_constraint *c); __isl_give isl_constraint *isl_equality_alloc(__isl_take isl_local_space *ls); __isl_give isl_constraint *isl_inequality_alloc(__isl_take isl_local_space *ls); struct isl_constraint *isl_constraint_cow(struct isl_constraint *c); struct isl_constraint *isl_constraint_copy(struct isl_constraint *c); void *isl_constraint_free(__isl_take isl_constraint *c); int isl_basic_set_n_constraint(__isl_keep isl_basic_set *bset); int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap, int (*fn)(__isl_take isl_constraint *c, void *user), void *user); int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset, int (*fn)(__isl_take isl_constraint *c, void *user), void *user); int isl_constraint_is_equal(struct isl_constraint *constraint1, struct isl_constraint *constraint2); int isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos, int (*fn)(__isl_take isl_constraint *lower, __isl_take isl_constraint *upper, __isl_take isl_basic_set *bset, void *user), void *user); __isl_give isl_basic_map *isl_basic_map_add_constraint( __isl_take isl_basic_map *bmap, __isl_take isl_constraint *constraint); __isl_give isl_basic_set *isl_basic_set_add_constraint( __isl_take isl_basic_set *bset, __isl_take isl_constraint *constraint); __isl_give isl_map *isl_map_add_constraint(__isl_take isl_map *map, __isl_take isl_constraint *constraint); __isl_give isl_set *isl_set_add_constraint(__isl_take isl_set *set, __isl_take isl_constraint *constraint); int isl_basic_map_has_defining_equality( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, int pos, __isl_give isl_constraint **c); int isl_basic_set_has_defining_equality( struct isl_basic_set *bset, enum isl_dim_type type, int pos, struct isl_constraint **constraint); int isl_basic_set_has_defining_inequalities( struct isl_basic_set *bset, enum isl_dim_type type, int pos, struct isl_constraint **lower, struct isl_constraint **upper); __isl_give isl_space *isl_constraint_get_space( __isl_keep isl_constraint *constraint); __isl_give isl_local_space *isl_constraint_get_local_space( __isl_keep isl_constraint *constraint); int isl_constraint_dim(struct isl_constraint *constraint, enum isl_dim_type type); int isl_constraint_involves_dims(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned first, unsigned n); const char *isl_constraint_get_dim_name(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); void isl_constraint_get_constant(__isl_keep isl_constraint *constraint, isl_int *v); __isl_give isl_val *isl_constraint_get_constant_val( __isl_keep isl_constraint *constraint); void isl_constraint_get_coefficient(__isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_val *isl_constraint_get_coefficient_val( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos); __isl_give isl_constraint *isl_constraint_set_constant( __isl_take isl_constraint *constraint, isl_int v); __isl_give isl_constraint *isl_constraint_set_constant_si( __isl_take isl_constraint *constraint, int v); __isl_give isl_constraint *isl_constraint_set_constant_val( __isl_take isl_constraint *constraint, __isl_take isl_val *v); __isl_give isl_constraint *isl_constraint_set_coefficient( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_constraint *isl_constraint_set_coefficient_si( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, int v); __isl_give isl_constraint *isl_constraint_set_coefficient_val( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_val *v); __isl_give isl_aff *isl_constraint_get_div(__isl_keep isl_constraint *constraint, int pos); struct isl_constraint *isl_constraint_negate(struct isl_constraint *constraint); int isl_constraint_is_equality(__isl_keep isl_constraint *constraint); int isl_constraint_is_div_constraint(__isl_keep isl_constraint *constraint); int isl_constraint_is_lower_bound(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); int isl_constraint_is_upper_bound(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos); __isl_give isl_basic_map *isl_basic_map_from_constraint( __isl_take isl_constraint *constraint); struct isl_basic_set *isl_basic_set_from_constraint( struct isl_constraint *constraint); __isl_give isl_aff *isl_constraint_get_bound( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos); __isl_give isl_aff *isl_constraint_get_aff( __isl_keep isl_constraint *constraint); __isl_give isl_constraint *isl_equality_from_aff(__isl_take isl_aff *aff); __isl_give isl_constraint *isl_inequality_from_aff(__isl_take isl_aff *aff); __isl_give isl_basic_set *isl_basic_set_drop_constraint( __isl_take isl_basic_set *bset, __isl_take isl_constraint *constraint); __isl_give isl_printer *isl_printer_print_constraint(__isl_take isl_printer *p, __isl_keep isl_constraint *c); void isl_constraint_dump(__isl_keep isl_constraint *c); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/lp.h0000664000175000017500000000303712254313240013414 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_LP_H #define ISL_LP_H #include #include #include #include #include #include enum isl_lp_result { isl_lp_error = -1, isl_lp_ok = 0, isl_lp_unbounded, isl_lp_empty }; #if defined(__cplusplus) extern "C" { #endif enum isl_lp_result isl_basic_map_solve_lp(struct isl_basic_map *bmap, int max, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol); enum isl_lp_result isl_basic_set_solve_lp(struct isl_basic_set *bset, int max, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol); enum isl_lp_result isl_map_solve_lp(__isl_keep isl_map *map, int max, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol); enum isl_lp_result isl_set_solve_lp(__isl_keep isl_set *set, int max, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol); __isl_give isl_val *isl_basic_set_min_lp_val(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj); __isl_give isl_val *isl_basic_set_max_lp_val(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/union_map_type.h0000664000175000017500000000054512254313240016030 00000000000000#ifndef ISL_UNION_MAP_TYPE_H #define ISL_UNION_MAP_TYPE_H #include #if defined(__cplusplus) extern "C" { #endif struct __isl_export isl_union_map; typedef struct isl_union_map isl_union_map; #ifndef isl_union_set struct __isl_export isl_union_set; typedef struct isl_union_set isl_union_set; #endif #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/ilp.h0000664000175000017500000000223012254313240013557 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_ILP_H #define ISL_ILP_H #include #include #include #if defined(__cplusplus) extern "C" { #endif enum isl_lp_result isl_basic_set_solve_ilp(struct isl_basic_set *bset, int max, isl_int *f, isl_int *opt, struct isl_vec **sol_p); enum isl_lp_result isl_basic_set_max(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj, isl_int *opt); __isl_give isl_val *isl_basic_set_max_val(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj); enum isl_lp_result isl_set_min(__isl_keep isl_set *set, __isl_keep isl_aff *obj, isl_int *opt); enum isl_lp_result isl_set_max(__isl_keep isl_set *set, __isl_keep isl_aff *obj, isl_int *opt); __isl_give isl_val *isl_set_min_val(__isl_keep isl_set *set, __isl_keep isl_aff *obj); __isl_give isl_val *isl_set_max_val(__isl_keep isl_set *set, __isl_keep isl_aff *obj); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/flow.h0000664000175000017500000000510012254313240013741 00000000000000#ifndef ISL_FLOW_H #define ISL_FLOW_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif /* Let n (>= 0) be the number of iterators shared by first and second. * If first precedes second textually return 2 * n + 1, * otherwise return 2 * n. */ typedef int (*isl_access_level_before)(void *first, void *second); struct isl_restriction; typedef struct isl_restriction isl_restriction; void *isl_restriction_free(__isl_take isl_restriction *restr); __isl_give isl_restriction *isl_restriction_empty( __isl_take isl_map *source_map); __isl_give isl_restriction *isl_restriction_none( __isl_take isl_map *source_map); __isl_give isl_restriction *isl_restriction_input( __isl_take isl_set *source_restr, __isl_take isl_set *sink_restr); __isl_give isl_restriction *isl_restriction_output( __isl_take isl_set *source_restr); isl_ctx *isl_restriction_get_ctx(__isl_keep isl_restriction *restr); typedef __isl_give isl_restriction *(*isl_access_restrict)( __isl_keep isl_map *source_map, __isl_keep isl_set *sink, void *source_user, void *user); struct isl_access_info; typedef struct isl_access_info isl_access_info; struct isl_flow; typedef struct isl_flow isl_flow; __isl_give isl_access_info *isl_access_info_alloc(__isl_take isl_map *sink, void *sink_user, isl_access_level_before fn, int max_source); __isl_give isl_access_info *isl_access_info_set_restrict( __isl_take isl_access_info *acc, isl_access_restrict fn, void *user); __isl_give isl_access_info *isl_access_info_add_source( __isl_take isl_access_info *acc, __isl_take isl_map *source, int must, void *source_user); void *isl_access_info_free(__isl_take isl_access_info *acc); isl_ctx *isl_access_info_get_ctx(__isl_keep isl_access_info *acc); __isl_give isl_flow *isl_access_info_compute_flow(__isl_take isl_access_info *acc); int isl_flow_foreach(__isl_keep isl_flow *deps, int (*fn)(__isl_take isl_map *dep, int must, void *dep_user, void *user), void *user); __isl_give isl_map *isl_flow_get_no_source(__isl_keep isl_flow *deps, int must); void isl_flow_free(__isl_take isl_flow *deps); isl_ctx *isl_flow_get_ctx(__isl_keep isl_flow *deps); int isl_union_map_compute_flow(__isl_take isl_union_map *sink, __isl_take isl_union_map *must_source, __isl_take isl_union_map *may_source, __isl_take isl_union_map *schedule, __isl_give isl_union_map **must_dep, __isl_give isl_union_map **may_dep, __isl_give isl_union_map **must_no_source, __isl_give isl_union_map **may_no_source); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/aff.h0000664000175000017500000005641012254313240013540 00000000000000#ifndef ISL_AFF_H #define ISL_AFF_H #include #include #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif __isl_give isl_aff *isl_aff_zero_on_domain(__isl_take isl_local_space *ls); __isl_give isl_aff *isl_aff_var_on_domain(__isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff); void *isl_aff_free(__isl_take isl_aff *aff); isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff); int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type); int isl_aff_involves_dims(__isl_keep isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_space *isl_aff_get_domain_space(__isl_keep isl_aff *aff); __isl_give isl_space *isl_aff_get_space(__isl_keep isl_aff *aff); __isl_give isl_local_space *isl_aff_get_domain_local_space( __isl_keep isl_aff *aff); __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff); const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff, enum isl_dim_type type, unsigned pos); int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v); __isl_give isl_val *isl_aff_get_constant_val(__isl_keep isl_aff *aff); int isl_aff_get_coefficient(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos, isl_int *v); __isl_give isl_val *isl_aff_get_coefficient_val(__isl_keep isl_aff *aff, enum isl_dim_type type, int pos); int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v); __isl_give isl_val *isl_aff_get_denominator_val(__isl_keep isl_aff *aff); __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v); __isl_give isl_aff *isl_aff_set_constant_val(__isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, int v); __isl_give isl_aff *isl_aff_set_coefficient_val(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v); __isl_give isl_aff *isl_aff_add_constant_val(__isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_add_constant_num(__isl_take isl_aff *aff, isl_int v); __isl_give isl_aff *isl_aff_add_constant_num_si(__isl_take isl_aff *aff, int v); __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, isl_int v); __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, int v); __isl_give isl_aff *isl_aff_add_coefficient_val(__isl_take isl_aff *aff, enum isl_dim_type type, int pos, __isl_take isl_val *v); int isl_aff_is_cst(__isl_keep isl_aff *aff); __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2); int isl_aff_plain_is_zero(__isl_keep isl_aff *aff); __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos); __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff); __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff); __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff); __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int mod); __isl_give isl_aff *isl_aff_mod_val(__isl_take isl_aff *aff, __isl_take isl_val *mod); __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_aff *isl_aff_div(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f); __isl_give isl_aff *isl_aff_scale_val(__isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f); __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f); __isl_give isl_aff *isl_aff_scale_down_val(__isl_take isl_aff *aff, __isl_take isl_val *v); __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned n); __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_aff *isl_aff_project_domain_on_params(__isl_take isl_aff *aff); __isl_give isl_aff *isl_aff_align_params(__isl_take isl_aff *aff, __isl_take isl_space *model); __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff, __isl_take isl_set *context); __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff, __isl_take isl_set *context); __isl_give isl_aff *isl_aff_pullback_multi_aff(__isl_take isl_aff *aff, __isl_take isl_multi_aff *ma); __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff); __isl_give isl_basic_set *isl_aff_neg_basic_set(__isl_take isl_aff *aff); __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1, __isl_take isl_aff *aff2); __isl_give isl_aff *isl_aff_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_printer *isl_printer_print_aff(__isl_take isl_printer *p, __isl_keep isl_aff *aff); void isl_aff_dump(__isl_keep isl_aff *aff); isl_ctx *isl_pw_aff_get_ctx(__isl_keep isl_pw_aff *pwaff); __isl_give isl_space *isl_pw_aff_get_domain_space(__isl_keep isl_pw_aff *pwaff); __isl_give isl_space *isl_pw_aff_get_space(__isl_keep isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_pw_aff_empty(__isl_take isl_space *dim); __isl_give isl_pw_aff *isl_pw_aff_alloc(__isl_take isl_set *set, __isl_take isl_aff *aff); __isl_give isl_pw_aff *isl_pw_aff_zero_on_domain( __isl_take isl_local_space *ls); __isl_give isl_pw_aff *isl_pw_aff_var_on_domain(__isl_take isl_local_space *ls, enum isl_dim_type type, unsigned pos); __isl_give isl_pw_aff *isl_set_indicator_function(__isl_take isl_set *set); const char *isl_pw_aff_get_dim_name(__isl_keep isl_pw_aff *pa, enum isl_dim_type type, unsigned pos); int isl_pw_aff_has_dim_id(__isl_keep isl_pw_aff *pa, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_pw_aff_get_dim_id(__isl_keep isl_pw_aff *pa, enum isl_dim_type type, unsigned pos); __isl_give isl_pw_aff *isl_pw_aff_set_dim_id(__isl_take isl_pw_aff *pma, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_pw_aff_is_empty(__isl_keep isl_pw_aff *pwaff); int isl_pw_aff_plain_is_equal(__isl_keep isl_pw_aff *pwaff1, __isl_keep isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_copy(__isl_keep isl_pw_aff *pwaff); void *isl_pw_aff_free(__isl_take isl_pw_aff *pwaff); unsigned isl_pw_aff_dim(__isl_keep isl_pw_aff *pwaff, enum isl_dim_type type); int isl_pw_aff_involves_dims(__isl_keep isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_align_params(__isl_take isl_pw_aff *pwaff, __isl_take isl_space *model); __isl_give isl_id *isl_pw_aff_get_tuple_id(__isl_keep isl_pw_aff *pa, enum isl_dim_type type); __isl_give isl_pw_aff *isl_pw_aff_set_tuple_id(__isl_take isl_pw_aff *pwaff, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_set *isl_pw_aff_domain(__isl_take isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_div(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_sub(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_neg(__isl_take isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int mod); __isl_give isl_pw_aff *isl_pw_aff_mod_val(__isl_take isl_pw_aff *pa, __isl_take isl_val *mod); __isl_give isl_pw_aff *isl_pw_aff_tdiv_q(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_pw_aff *isl_pw_aff_tdiv_r(__isl_take isl_pw_aff *pa1, __isl_take isl_pw_aff *pa2); __isl_give isl_pw_aff *isl_pw_aff_intersect_params(__isl_take isl_pw_aff *pa, __isl_take isl_set *set); __isl_give isl_pw_aff *isl_pw_aff_intersect_domain(__isl_take isl_pw_aff *pa, __isl_take isl_set *set); __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_pw_aff *cond, __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false); __isl_give isl_pw_aff *isl_pw_aff_scale(__isl_take isl_pw_aff *pwaff, isl_int f); __isl_give isl_pw_aff *isl_pw_aff_scale_val(__isl_take isl_pw_aff *pa, __isl_take isl_val *v); __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff, isl_int f); __isl_give isl_pw_aff *isl_pw_aff_scale_down_val(__isl_take isl_pw_aff *pa, __isl_take isl_val *f); __isl_give isl_pw_aff *isl_pw_aff_insert_dims(__isl_take isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff, enum isl_dim_type type, unsigned n); __isl_give isl_pw_aff *isl_pw_aff_drop_dims(__isl_take isl_pw_aff *pwaff, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_pw_aff *isl_pw_aff_coalesce(__isl_take isl_pw_aff *pwqp); __isl_give isl_pw_aff *isl_pw_aff_gist(__isl_take isl_pw_aff *pwaff, __isl_take isl_set *context); __isl_give isl_pw_aff *isl_pw_aff_gist_params(__isl_take isl_pw_aff *pwaff, __isl_take isl_set *context); __isl_give isl_pw_aff *isl_pw_aff_pullback_multi_aff( __isl_take isl_pw_aff *pa, __isl_take isl_multi_aff *ma); __isl_give isl_pw_aff *isl_pw_aff_pullback_pw_multi_aff( __isl_take isl_pw_aff *pa, __isl_take isl_pw_multi_aff *pma); int isl_pw_aff_n_piece(__isl_keep isl_pw_aff *pwaff); int isl_pw_aff_foreach_piece(__isl_keep isl_pw_aff *pwaff, int (*fn)(__isl_take isl_set *set, __isl_take isl_aff *aff, void *user), void *user); __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff); __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff); __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff); __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff); __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff); __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_read_from_str(isl_ctx *ctx, const char *str); __isl_give isl_printer *isl_printer_print_pw_aff(__isl_take isl_printer *p, __isl_keep isl_pw_aff *pwaff); void isl_pw_aff_dump(__isl_keep isl_pw_aff *pwaff); __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list); __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list); __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2); ISL_DECLARE_MULTI(aff) __isl_give isl_multi_aff *isl_multi_aff_from_aff(__isl_take isl_aff *aff); __isl_give isl_multi_aff *isl_multi_aff_identity(__isl_take isl_space *space); int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1, __isl_keep isl_multi_aff *maff2); __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2); __isl_give isl_multi_aff *isl_multi_aff_sub(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff, isl_int f); __isl_give isl_multi_aff *isl_multi_aff_product( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_multi_aff *isl_multi_aff_gist_params( __isl_take isl_multi_aff *maff, __isl_take isl_set *context); __isl_give isl_multi_aff *isl_multi_aff_gist(__isl_take isl_multi_aff *maff, __isl_take isl_set *context); __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff, __isl_give isl_local_space **ls); __isl_give isl_multi_aff *isl_multi_aff_pullback_multi_aff( __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_set *isl_multi_aff_lex_le_set(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_set *isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2); __isl_give isl_printer *isl_printer_print_multi_aff(__isl_take isl_printer *p, __isl_keep isl_multi_aff *maff); __isl_give isl_multi_aff *isl_multi_aff_read_from_str(isl_ctx *ctx, const char *str); void isl_multi_aff_dump(__isl_keep isl_multi_aff *maff); ISL_DECLARE_MULTI(pw_aff) __isl_give isl_pw_multi_aff *isl_pw_multi_aff_identity( __isl_take isl_space *space); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_aff( __isl_take isl_multi_aff *ma); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_alloc(__isl_take isl_set *set, __isl_take isl_multi_aff *maff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_copy( __isl_keep isl_pw_multi_aff *pma); void *isl_pw_multi_aff_free(__isl_take isl_pw_multi_aff *pma); unsigned isl_pw_multi_aff_dim(__isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff( __isl_keep isl_pw_multi_aff *pma, int pos); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_pw_aff( __isl_take isl_pw_multi_aff *pma, unsigned pos, __isl_take isl_pw_aff *pa); isl_ctx *isl_pw_multi_aff_get_ctx(__isl_keep isl_pw_multi_aff *pma); __isl_give isl_space *isl_pw_multi_aff_get_domain_space( __isl_keep isl_pw_multi_aff *pma); __isl_give isl_space *isl_pw_multi_aff_get_space( __isl_keep isl_pw_multi_aff *pma); int isl_pw_multi_aff_has_tuple_name(__isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); const char *isl_pw_multi_aff_get_tuple_name(__isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); __isl_give isl_id *isl_pw_multi_aff_get_tuple_id( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); int isl_pw_multi_aff_has_tuple_id(__isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_tuple_id( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, __isl_take isl_id *id); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_drop_dims( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_set *isl_pw_multi_aff_domain(__isl_take isl_pw_multi_aff *pma); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_empty(__isl_take isl_space *space); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain( __isl_take isl_set *set); const char *isl_pw_multi_aff_get_dim_name(__isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos); __isl_give isl_id *isl_pw_multi_aff_get_dim_id( __isl_keep isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_dim_id( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id); int isl_pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff *pma1, __isl_keep isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_sub( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_scale_val( __isl_take isl_pw_multi_aff *pma, __isl_take isl_val *v); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_scale_multi_val( __isl_take isl_pw_multi_aff *pma, __isl_take isl_multi_val *mv); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmin( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmax( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_flat_range_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_product( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_intersect_params( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_intersect_domain( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_project_domain_on_params( __isl_take isl_pw_multi_aff *pma); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_align_params( __isl_take isl_pw_multi_aff *pma, __isl_take isl_space *model); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_coalesce( __isl_take isl_pw_multi_aff *pma); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_gist_params( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_gist( __isl_take isl_pw_multi_aff *pma, __isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_pullback_multi_aff( __isl_take isl_pw_multi_aff *pma, __isl_take isl_multi_aff *ma); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_pullback_pw_multi_aff( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); int isl_pw_multi_aff_foreach_piece(__isl_keep isl_pw_multi_aff *pma, int (*fn)(__isl_take isl_set *set, __isl_take isl_multi_aff *maff, void *user), void *user); __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma); __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma); __isl_give isl_printer *isl_printer_print_pw_multi_aff(__isl_take isl_printer *p, __isl_keep isl_pw_multi_aff *pma); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_read_from_str(isl_ctx *ctx, const char *str); void isl_pw_multi_aff_dump(__isl_keep isl_pw_multi_aff *pma); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_empty( __isl_take isl_space *space); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_domain( __isl_take isl_union_set *uset); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_copy( __isl_keep isl_union_pw_multi_aff *upma); void *isl_union_pw_multi_aff_free(__isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_add_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_pw_multi_aff *pma); isl_ctx *isl_union_pw_multi_aff_get_ctx( __isl_keep isl_union_pw_multi_aff *upma); __isl_give isl_space *isl_union_pw_multi_aff_get_space( __isl_keep isl_union_pw_multi_aff *upma); int isl_union_pw_multi_aff_foreach_pw_multi_aff( __isl_keep isl_union_pw_multi_aff *upma, int (*fn)(__isl_take isl_pw_multi_aff *pma, void *user), void *user); __isl_give isl_union_set *isl_union_pw_multi_aff_domain( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_add( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_sub( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_scale_multi_val( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_multi_val *mv); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_flat_range_product( __isl_take isl_union_pw_multi_aff *upma1, __isl_take isl_union_pw_multi_aff *upma2); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_intersect_domain( __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_union_set *uset); __isl_give isl_union_map *isl_union_map_from_union_pw_multi_aff( __isl_take isl_union_pw_multi_aff *upma); __isl_give isl_printer *isl_printer_print_union_pw_multi_aff( __isl_take isl_printer *p, __isl_keep isl_union_pw_multi_aff *upma); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_set( __isl_take isl_union_set *uset); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_map( __isl_take isl_union_map *umap); __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_read_from_str( isl_ctx *ctx, const char *str); void isl_union_pw_multi_aff_dump(__isl_keep isl_union_pw_multi_aff *upma); __isl_give char *isl_union_pw_multi_aff_to_str( __isl_keep isl_union_pw_multi_aff *upma); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_identity( __isl_take isl_space *space); __isl_give isl_multi_pw_aff *isl_multi_pw_aff_from_pw_aff( __isl_take isl_pw_aff *pa); __isl_give isl_printer *isl_printer_print_multi_pw_aff( __isl_take isl_printer *p, __isl_keep isl_multi_pw_aff *mpa); void isl_multi_pw_aff_dump(__isl_keep isl_multi_pw_aff *mpa); #if defined(__cplusplus) } #endif #include #endif cloog-0.18.2/isl/include/isl/printer.h0000664000175000017500000000375212254313240014470 00000000000000#ifndef ISL_PRINTER_H #define ISL_PRINTER_H #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_printer; typedef struct isl_printer isl_printer; __isl_give isl_printer *isl_printer_to_file(isl_ctx *ctx, FILE *file); __isl_give isl_printer *isl_printer_to_str(isl_ctx *ctx); void *isl_printer_free(__isl_take isl_printer *printer); isl_ctx *isl_printer_get_ctx(__isl_keep isl_printer *printer); FILE *isl_printer_get_file(__isl_keep isl_printer *printer); __isl_give char *isl_printer_get_str(__isl_keep isl_printer *printer); __isl_give isl_printer *isl_printer_set_indent(__isl_take isl_printer *p, int indent); __isl_give isl_printer *isl_printer_indent(__isl_take isl_printer *p, int indent); #define ISL_FORMAT_ISL 0 #define ISL_FORMAT_POLYLIB 1 #define ISL_FORMAT_POLYLIB_CONSTRAINTS 2 #define ISL_FORMAT_OMEGA 3 #define ISL_FORMAT_C 4 #define ISL_FORMAT_LATEX 5 #define ISL_FORMAT_EXT_POLYLIB 6 __isl_give isl_printer *isl_printer_set_output_format(__isl_take isl_printer *p, int output_format); int isl_printer_get_output_format(__isl_keep isl_printer *p); __isl_give isl_printer *isl_printer_set_prefix(__isl_take isl_printer *p, const char *prefix); __isl_give isl_printer *isl_printer_set_suffix(__isl_take isl_printer *p, const char *suffix); __isl_give isl_printer *isl_printer_set_isl_int_width(__isl_take isl_printer *p, int width); __isl_give isl_printer *isl_printer_start_line(__isl_take isl_printer *p); __isl_give isl_printer *isl_printer_end_line(__isl_take isl_printer *p); __isl_give isl_printer *isl_printer_print_double(__isl_take isl_printer *p, double d); __isl_give isl_printer *isl_printer_print_int(__isl_take isl_printer *p, int i); __isl_give isl_printer *isl_printer_print_isl_int(__isl_take isl_printer *p, isl_int i); __isl_give isl_printer *isl_printer_print_str(__isl_take isl_printer *p, const char *s); __isl_give isl_printer *isl_printer_flush(__isl_take isl_printer *p); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/aff_type.h0000664000175000017500000000116312254313240014574 00000000000000#ifndef ISL_AFF_TYPE_H #define ISL_AFF_TYPE_H #include #if defined(__cplusplus) extern "C" { #endif struct isl_aff; typedef struct isl_aff isl_aff; ISL_DECLARE_LIST(aff) struct isl_pw_aff; typedef struct isl_pw_aff isl_pw_aff; ISL_DECLARE_LIST(pw_aff) struct isl_multi_aff; typedef struct isl_multi_aff isl_multi_aff; struct isl_pw_multi_aff; typedef struct isl_pw_multi_aff isl_pw_multi_aff; struct isl_union_pw_multi_aff; typedef struct isl_union_pw_multi_aff isl_union_pw_multi_aff; struct isl_multi_pw_aff; typedef struct isl_multi_pw_aff isl_multi_pw_aff; #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/union_set_type.h0000664000175000017500000000014312254313240016040 00000000000000#ifndef ISL_UNION_SET_TYPE_H #define ISL_UNION_SET_TYPE_H #include #endif cloog-0.18.2/isl/include/isl/schedule.h0000664000175000017500000000400612254313240014572 00000000000000#ifndef ISL_SCHEDULE_H #define ISL_SCHEDULE_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_schedule; typedef struct isl_schedule isl_schedule; int isl_options_set_schedule_max_coefficient(isl_ctx *ctx, int val); int isl_options_get_schedule_max_coefficient(isl_ctx *ctx); int isl_options_set_schedule_max_constant_term(isl_ctx *ctx, int val); int isl_options_get_schedule_max_constant_term(isl_ctx *ctx); int isl_options_set_schedule_maximize_band_depth(isl_ctx *ctx, int val); int isl_options_get_schedule_maximize_band_depth(isl_ctx *ctx); int isl_options_set_schedule_outer_zero_distance(isl_ctx *ctx, int val); int isl_options_get_schedule_outer_zero_distance(isl_ctx *ctx); int isl_options_set_schedule_split_scaled(isl_ctx *ctx, int val); int isl_options_get_schedule_split_scaled(isl_ctx *ctx); int isl_options_set_schedule_separate_components(isl_ctx *ctx, int val); int isl_options_get_schedule_separate_components(isl_ctx *ctx); #define ISL_SCHEDULE_FUSE_MAX 0 #define ISL_SCHEDULE_FUSE_MIN 1 int isl_options_set_schedule_fuse(isl_ctx *ctx, int val); int isl_options_get_schedule_fuse(isl_ctx *ctx); __isl_give isl_schedule *isl_union_set_compute_schedule( __isl_take isl_union_set *domain, __isl_take isl_union_map *validity, __isl_take isl_union_map *proximity); void *isl_schedule_free(__isl_take isl_schedule *sched); __isl_give isl_union_map *isl_schedule_get_map(__isl_keep isl_schedule *sched); isl_ctx *isl_schedule_get_ctx(__isl_keep isl_schedule *sched); __isl_give isl_band_list *isl_schedule_get_band_forest( __isl_keep isl_schedule *schedule); __isl_give isl_printer *isl_printer_print_schedule(__isl_take isl_printer *p, __isl_keep isl_schedule *schedule); void isl_schedule_dump(__isl_keep isl_schedule *schedule); int isl_schedule_foreach_band(__isl_keep isl_schedule *sched, int (*fn)(__isl_keep isl_band *band, void *user), void *user); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/band.h0000664000175000017500000000315412254313240013705 00000000000000#ifndef ISL_BAND_H #define ISL_BAND_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_band; typedef struct isl_band isl_band; ISL_DECLARE_LIST(band) __isl_give isl_band *isl_band_copy(__isl_keep isl_band *band); void *isl_band_free(__isl_take isl_band *band); isl_ctx *isl_band_get_ctx(__isl_keep isl_band *band); int isl_band_has_children(__isl_keep isl_band *band); __isl_give isl_band_list *isl_band_get_children( __isl_keep isl_band *band); __isl_give isl_union_map *isl_band_get_prefix_schedule( __isl_keep isl_band *band); __isl_give isl_union_map *isl_band_get_partial_schedule( __isl_keep isl_band *band); __isl_give isl_union_map *isl_band_get_suffix_schedule( __isl_keep isl_band *band); int isl_options_set_tile_scale_tile_loops(isl_ctx *ctx, int val); int isl_options_get_tile_scale_tile_loops(isl_ctx *ctx); int isl_options_set_tile_shift_point_loops(isl_ctx *ctx, int val); int isl_options_get_tile_shift_point_loops(isl_ctx *ctx); int isl_band_tile(__isl_keep isl_band *band, __isl_take isl_vec *sizes); int isl_band_split(__isl_keep isl_band *band, int pos); int isl_band_n_member(__isl_keep isl_band *band); int isl_band_member_is_zero_distance(__isl_keep isl_band *band, int pos); int isl_band_list_foreach_band(__isl_keep isl_band_list *list, int (*fn)(__isl_keep isl_band *band, void *user), void *user); __isl_give isl_printer *isl_printer_print_band(__isl_take isl_printer *p, __isl_keep isl_band *band); void isl_band_dump(__isl_keep isl_band *band); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/include/isl/mat.h0000664000175000017500000001114212254313240013556 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_MAT_H #define ISL_MAT_H #include #include #include #include #include #include #if defined(__cplusplus) extern "C" { #endif struct isl_mat; typedef struct isl_mat isl_mat; isl_ctx *isl_mat_get_ctx(__isl_keep isl_mat *mat); __isl_give isl_mat *isl_mat_alloc(isl_ctx *ctx, unsigned n_row, unsigned n_col); struct isl_mat *isl_mat_dup(struct isl_mat *mat); struct isl_mat *isl_mat_extend(struct isl_mat *mat, unsigned n_row, unsigned n_col); struct isl_mat *isl_mat_identity(struct isl_ctx *ctx, unsigned n_row); __isl_give isl_mat *isl_mat_copy(__isl_keep isl_mat *mat); struct isl_mat *isl_mat_cow(struct isl_mat *mat); void *isl_mat_free(__isl_take isl_mat *mat); int isl_mat_rows(__isl_keep isl_mat *mat); int isl_mat_cols(__isl_keep isl_mat *mat); int isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v); __isl_give isl_val *isl_mat_get_element_val(__isl_keep isl_mat *mat, int row, int col); __isl_give isl_mat *isl_mat_set_element(__isl_take isl_mat *mat, int row, int col, isl_int v); __isl_give isl_mat *isl_mat_set_element_si(__isl_take isl_mat *mat, int row, int col, int v); __isl_give isl_mat *isl_mat_set_element_val(__isl_take isl_mat *mat, int row, int col, __isl_take isl_val *v); struct isl_mat *isl_mat_swap_cols(struct isl_mat *mat, unsigned i, unsigned j); struct isl_mat *isl_mat_swap_rows(struct isl_mat *mat, unsigned i, unsigned j); struct isl_vec *isl_mat_vec_product(struct isl_mat *mat, struct isl_vec *vec); struct isl_vec *isl_vec_mat_product(struct isl_vec *vec, struct isl_mat *mat); __isl_give isl_vec *isl_mat_vec_inverse_product(__isl_take isl_mat *mat, __isl_take isl_vec *vec); struct isl_mat *isl_mat_aff_direct_sum(struct isl_mat *left, struct isl_mat *right); __isl_give isl_mat *isl_mat_diagonal(__isl_take isl_mat *mat1, __isl_take isl_mat *mat2); struct isl_mat *isl_mat_left_hermite(struct isl_mat *M, int neg, struct isl_mat **U, struct isl_mat **Q); struct isl_mat *isl_mat_lin_to_aff(struct isl_mat *mat); struct isl_mat *isl_mat_inverse_product(struct isl_mat *left, struct isl_mat *right); __isl_give isl_mat *isl_mat_product(__isl_take isl_mat *left, __isl_take isl_mat *right); struct isl_mat *isl_mat_transpose(struct isl_mat *mat); __isl_give isl_mat *isl_mat_right_inverse(__isl_take isl_mat *mat); __isl_give isl_mat *isl_mat_right_kernel(__isl_take isl_mat *mat); __isl_give isl_mat *isl_mat_scale_down_row(__isl_take isl_mat *mat, int row, isl_int m); __isl_give isl_mat *isl_mat_normalize(__isl_take isl_mat *mat); __isl_give isl_mat *isl_mat_normalize_row(__isl_take isl_mat *mat, int row); struct isl_mat *isl_mat_drop_cols(struct isl_mat *mat, unsigned col, unsigned n); struct isl_mat *isl_mat_drop_rows(struct isl_mat *mat, unsigned row, unsigned n); __isl_give isl_mat *isl_mat_insert_cols(__isl_take isl_mat *mat, unsigned col, unsigned n); __isl_give isl_mat *isl_mat_insert_rows(__isl_take isl_mat *mat, unsigned row, unsigned n); __isl_give isl_mat *isl_mat_move_cols(__isl_take isl_mat *mat, unsigned dst_col, unsigned src_col, unsigned n); __isl_give isl_mat *isl_mat_add_rows(__isl_take isl_mat *mat, unsigned n); __isl_give isl_mat *isl_mat_insert_zero_cols(__isl_take isl_mat *mat, unsigned first, unsigned n); __isl_give isl_mat *isl_mat_add_zero_cols(__isl_take isl_mat *mat, unsigned n); __isl_give isl_mat *isl_mat_insert_zero_rows(__isl_take isl_mat *mat, unsigned row, unsigned n); __isl_give isl_mat *isl_mat_add_zero_rows(__isl_take isl_mat *mat, unsigned n); void isl_mat_col_add(__isl_keep isl_mat *mat, int dst_col, int src_col); void isl_mat_col_mul(struct isl_mat *mat, int dst_col, isl_int f, int src_col); void isl_mat_col_submul(struct isl_mat *mat, int dst_col, isl_int f, int src_col); struct isl_mat *isl_mat_unimodular_complete(struct isl_mat *M, int row); __isl_give isl_mat *isl_mat_from_row_vec(__isl_take isl_vec *vec); __isl_give isl_mat *isl_mat_concat(__isl_take isl_mat *top, __isl_take isl_mat *bot); __isl_give isl_mat *isl_mat_vec_concat(__isl_take isl_mat *top, __isl_take isl_vec *bot); int isl_mat_is_equal(__isl_keep isl_mat *mat1, __isl_keep isl_mat *mat2); int isl_mat_initial_non_zero_cols(__isl_keep isl_mat *mat); void isl_mat_print_internal(__isl_keep isl_mat *mat, FILE *out, int indent); void isl_mat_dump(__isl_keep isl_mat *mat); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/Makefile.am0000664000175000017500000001575012254313240012457 00000000000000if HAVE_CLANG MAYBE_INTERFACE = interface endif SUBDIRS = . $(MAYBE_INTERFACE) doc DIST_SUBDIRS = $(MAYBE_INTERFACE) doc ACLOCAL_AMFLAGS = -I m4 AUTOMAKE_OPTIONS = nostdinc lib_LTLIBRARIES = libisl.la noinst_PROGRAMS = isl_test isl_polyhedron_sample isl_pip \ isl_polyhedron_minimize isl_polytope_scan \ isl_polyhedron_detect_equalities isl_cat \ isl_closure isl_bound isl_codegen TESTS = isl_test codegen_test.sh pip_test.sh bound_test.sh if HAVE_PIPLIB ISL_PIPLIB = \ isl_lp_piplib.c \ isl_map_piplib.c \ isl_sample_piplib.c \ isl_sample_piplib.h \ isl_piplib.c else ISL_PIPLIB = \ isl_lp_no_piplib.c \ isl_map_no_piplib.c \ isl_sample_no_piplib.c endif if NEED_GET_MEMORY_FUNCTIONS GET_MEMORY_FUNCTIONS=mp_get_memory_functions.c endif INCLUDES = -I. -I$(srcdir) -I$(srcdir)/include -Iinclude/ AM_CFLAGS = @WARNING_FLAGS@ libisl_la_SOURCES = \ $(ISL_PIPLIB) \ $(GET_MEMORY_FUNCTIONS) \ isl_aff.c \ isl_aff_private.h \ isl_affine_hull.c \ isl_arg.c \ isl_ast.c \ isl_ast_private.h \ isl_ast_build.c \ isl_ast_build_private.h \ isl_ast_build_expr.c \ isl_ast_build_expr.h \ isl_ast_codegen.c \ isl_ast_graft.c \ isl_ast_graft_private.h \ isl_band.c \ isl_band_private.h \ isl_basis_reduction.h \ basis_reduction_tab.c \ isl_bernstein.c \ isl_bernstein.h \ isl_blk.c \ isl_bound.c \ isl_bound.h \ isl_coalesce.c \ isl_constraint.c \ isl_constraint_private.h \ isl_convex_hull.c \ isl_ctx.c \ isl_ctx_private.h \ isl_deprecated.c \ isl_dim.c \ isl_dim_map.h \ isl_dim_map.c \ isl_equalities.c \ isl_equalities.h \ isl_factorization.c \ isl_factorization.h \ isl_farkas.c \ isl_flow.c \ isl_fold.c \ isl_gmp.c \ isl_hash.c \ isl_hmap_map_basic_set.c \ isl_hmap_map_basic_set.h \ isl_ilp.c \ isl_input.c \ isl_int.h \ isl_local_space_private.h \ isl_local_space.c \ isl_lp.c \ isl_lp_piplib.h \ isl_map.c \ isl_map_simplify.c \ isl_map_subtract.c \ isl_map_private.h \ isl_map_piplib.h \ isl_mat.c \ isl_mat_private.h \ isl_morph.c \ isl_morph.h \ isl_id.c \ isl_id_private.h \ isl_obj.c \ isl_options.c \ isl_options_private.h \ isl_output.c \ isl_piplib.h \ isl_point_private.h \ isl_point.c \ isl_polynomial_private.h \ isl_polynomial.c \ isl_printer_private.h \ isl_printer.c \ print.c \ isl_range.c \ isl_range.h \ isl_reordering.c \ isl_reordering.h \ isl_sample.h \ isl_sample.c \ isl_scan.c \ isl_scan.h \ isl_schedule.c \ isl_schedule_private.h \ isl_set_list.c \ isl_sort.c \ isl_sort.h \ isl_space.c \ isl_space_private.h \ isl_stream.c \ isl_stream_private.h \ isl_seq.c \ isl_tab.c \ isl_tab.h \ isl_tab_pip.c \ isl_tarjan.c \ isl_tarjan.h \ isl_transitive_closure.c \ isl_union_map.c \ isl_union_map_private.h \ isl_val.c \ isl_val_gmp.c \ isl_val_private.h \ isl_vec.c \ isl_version.c \ isl_vertices_private.h \ isl_vertices.c EXTRA_libisl_la_SOURCES = \ isl_lp_piplib.c \ isl_lp_no_piplib.c \ isl_map_piplib.c \ isl_map_no_piplib.c \ isl_sample_no_piplib.c \ isl_sample_piplib.c \ isl_sample_piplib.h \ isl_piplib.c libisl_la_LIBADD = @PIPLIB_LIBS@ @GMP_LIBS@ libisl_la_LDFLAGS = -version-info @versioninfo@ \ @PIPLIB_LDFLAGS@ @GMP_LDFLAGS@ libisl_la_CPPFLAGS = $(INCLUDES) @PIPLIB_CPPFLAGS@ @GMP_CPPFLAGS@ isl_test_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_test_LDFLAGS = @GMP_LDFLAGS@ isl_test_LDADD = libisl.la @GMP_LIBS@ isl_polyhedron_sample_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polyhedron_sample_LDADD = libisl.la isl_polyhedron_sample_SOURCES = \ polyhedron_sample.c isl_pip_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_pip_LDFLAGS = @GMP_LDFLAGS@ isl_pip_LDADD = libisl.la @GMP_LIBS@ isl_pip_SOURCES = \ pip.c isl_codegen_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_codegen_LDFLAGS = @GMP_LDFLAGS@ isl_codegen_LDADD = libisl.la @GMP_LIBS@ isl_codegen_SOURCES = \ codegen.c isl_bound_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_bound_LDFLAGS = @GMP_LDFLAGS@ isl_bound_LDADD = libisl.la @GMP_LIBS@ isl_bound_SOURCES = \ bound.c isl_polyhedron_minimize_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polyhedron_minimize_LDFLAGS = @GMP_LDFLAGS@ isl_polyhedron_minimize_LDADD = libisl.la @GMP_LIBS@ isl_polyhedron_minimize_SOURCES = \ polyhedron_minimize.c isl_polytope_scan_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polytope_scan_LDADD = libisl.la isl_polytope_scan_SOURCES = \ polytope_scan.c isl_polyhedron_detect_equalities_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polyhedron_detect_equalities_LDADD = libisl.la isl_polyhedron_detect_equalities_SOURCES = \ polyhedron_detect_equalities.c isl_cat_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_cat_LDADD = libisl.la isl_cat_SOURCES = \ cat.c isl_closure_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_closure_LDADD = libisl.la isl_closure_SOURCES = \ closure.c nodist_pkginclude_HEADERS = \ include/isl/config.h \ include/isl/stdint.h pkginclude_HEADERS = \ include/isl/aff.h \ include/isl/aff_type.h \ include/isl/arg.h \ include/isl/ast.h \ include/isl/ast_build.h \ include/isl/band.h \ include/isl/blk.h \ include/isl/constraint.h \ include/isl/ctx.h \ include/isl/dim.h \ include/isl/flow.h \ include/isl/id.h \ include/isl/ilp.h \ include/isl/int.h \ include/isl/hash.h \ include/isl/list.h \ include/isl/local_space.h \ include/isl/lp.h \ include/isl/mat.h \ include/isl/map.h \ include/isl/map_type.h \ include/isl/multi.h \ include/isl/obj.h \ include/isl/options.h \ include/isl/point.h \ include/isl/polynomial.h \ include/isl/polynomial_type.h \ include/isl/printer.h \ include/isl/schedule.h \ include/isl/seq.h \ include/isl/set.h \ include/isl/set_type.h \ include/isl/space.h \ include/isl/stream.h \ include/isl/union_map.h \ include/isl/union_map_type.h \ include/isl/union_set.h \ include/isl/union_set_type.h \ include/isl/val.h \ include/isl/val_gmp.h \ include/isl/val_int.h \ include/isl/vec.h \ include/isl/version.h \ include/isl/vertices.h EXTRA_DIST = \ LICENSE \ isl_config_post.h \ basis_reduction_templ.c \ isl_list_templ.c \ isl_list_templ.h \ isl_map_lexopt_templ.c \ isl_multi_templ.c \ isl_multi_templ.h \ print_templ.c \ isl_power_templ.c \ isl_pw_templ.c \ isl_union_templ.c \ isl.py \ doc/SubmittingPatches \ doc/chicago.bst \ doc/chicago.sty \ doc/implementation.tex \ doc/isl.bib \ doc/mypod2latex \ doc/manual.tex \ doc/user.pod \ interface/all.h \ interface/isl.py.top \ test_inputs dist-hook: echo @GIT_HEAD_VERSION@ > $(distdir)/GIT_HEAD_ID (cd doc; make manual.pdf) cp doc/manual.pdf $(distdir)/doc/ pkgconfigdir=$(pkgconfig_libdir) pkgconfig_DATA = $(pkgconfig_libfile) gitversion.h: @GIT_HEAD@ $(AM_V_GEN)echo '#define GIT_HEAD_ID "'@GIT_HEAD_VERSION@'"' > $@ install-data-local: $(srcdir)/isl.py @libisl=`sed -ne "/^library_names=/{s/.*='//;s/'$$//;s/ .*//;p;}" \ $(builddir)/libisl.la`; \ case $$libisl in \ '') echo Cannot find isl library name. GDB bindings not installed.;; \ *) echo $(INSTALL_DATA) $(srcdir)/isl.py \ $(DESTDIR)$(libdir)/$$libisl-gdb.py; \ test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)"; \ $(INSTALL_DATA) $(srcdir)/isl.py $(DESTDIR)$(libdir)/$$libisl-gdb.py; esac cloog-0.18.2/isl/isl_map_subtract.c0000664000175000017500000005204212254313240014115 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include "isl_tab.h" #include /* Expand the constraint "c" into "v". The initial "dim" dimensions * are the same, but "v" may have more divs than "c" and the divs of "c" * may appear in different positions in "v". * The number of divs in "c" is given by "n_div" and the mapping * of divs in "c" to divs in "v" is given by "div_map". * * Although it shouldn't happen in practice, it is theoretically * possible that two or more divs in "c" are mapped to the same div in "v". * These divs are then necessarily the same, so we simply add their * coefficients. */ static void expand_constraint(isl_vec *v, unsigned dim, isl_int *c, int *div_map, unsigned n_div) { int i; isl_seq_cpy(v->el, c, 1 + dim); isl_seq_clr(v->el + 1 + dim, v->size - (1 + dim)); for (i = 0; i < n_div; ++i) { int pos = 1 + dim + div_map[i]; isl_int_add(v->el[pos], v->el[pos], c[1 + dim + i]); } } /* Add all constraints of bmap to tab. The equalities of bmap * are added as a pair of inequalities. */ static int tab_add_constraints(struct isl_tab *tab, __isl_keep isl_basic_map *bmap, int *div_map) { int i; unsigned dim; unsigned tab_total; unsigned bmap_total; isl_vec *v; if (!tab || !bmap) return -1; tab_total = isl_basic_map_total_dim(tab->bmap); bmap_total = isl_basic_map_total_dim(bmap); dim = isl_space_dim(tab->bmap->dim, isl_dim_all); if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0) return -1; v = isl_vec_alloc(bmap->ctx, 1 + tab_total); if (!v) return -1; for (i = 0; i < bmap->n_eq; ++i) { expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div); if (isl_tab_add_ineq(tab, v->el) < 0) goto error; isl_seq_neg(bmap->eq[i], bmap->eq[i], 1 + bmap_total); expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div); if (isl_tab_add_ineq(tab, v->el) < 0) goto error; isl_seq_neg(bmap->eq[i], bmap->eq[i], 1 + bmap_total); if (tab->empty) break; } for (i = 0; i < bmap->n_ineq; ++i) { expand_constraint(v, dim, bmap->ineq[i], div_map, bmap->n_div); if (isl_tab_add_ineq(tab, v->el) < 0) goto error; if (tab->empty) break; } isl_vec_free(v); return 0; error: isl_vec_free(v); return -1; } /* Add a specific constraint of bmap (or its opposite) to tab. * The position of the constraint is specified by "c", where * the equalities of bmap are counted twice, once for the inequality * that is equal to the equality, and once for its negation. */ static int tab_add_constraint(struct isl_tab *tab, __isl_keep isl_basic_map *bmap, int *div_map, int c, int oppose) { unsigned dim; unsigned tab_total; unsigned bmap_total; isl_vec *v; int r; if (!tab || !bmap) return -1; tab_total = isl_basic_map_total_dim(tab->bmap); bmap_total = isl_basic_map_total_dim(bmap); dim = isl_space_dim(tab->bmap->dim, isl_dim_all); v = isl_vec_alloc(bmap->ctx, 1 + tab_total); if (!v) return -1; if (c < 2 * bmap->n_eq) { if ((c % 2) != oppose) isl_seq_neg(bmap->eq[c/2], bmap->eq[c/2], 1 + bmap_total); if (oppose) isl_int_sub_ui(bmap->eq[c/2][0], bmap->eq[c/2][0], 1); expand_constraint(v, dim, bmap->eq[c/2], div_map, bmap->n_div); r = isl_tab_add_ineq(tab, v->el); if (oppose) isl_int_add_ui(bmap->eq[c/2][0], bmap->eq[c/2][0], 1); if ((c % 2) != oppose) isl_seq_neg(bmap->eq[c/2], bmap->eq[c/2], 1 + bmap_total); } else { c -= 2 * bmap->n_eq; if (oppose) { isl_seq_neg(bmap->ineq[c], bmap->ineq[c], 1 + bmap_total); isl_int_sub_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1); } expand_constraint(v, dim, bmap->ineq[c], div_map, bmap->n_div); r = isl_tab_add_ineq(tab, v->el); if (oppose) { isl_int_add_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1); isl_seq_neg(bmap->ineq[c], bmap->ineq[c], 1 + bmap_total); } } isl_vec_free(v); return r; } static int tab_add_divs(struct isl_tab *tab, __isl_keep isl_basic_map *bmap, int **div_map) { int i, j; struct isl_vec *vec; unsigned total; unsigned dim; if (!bmap) return -1; if (!bmap->n_div) return 0; if (!*div_map) *div_map = isl_alloc_array(bmap->ctx, int, bmap->n_div); if (!*div_map) return -1; total = isl_basic_map_total_dim(tab->bmap); dim = total - tab->bmap->n_div; vec = isl_vec_alloc(bmap->ctx, 2 + total + bmap->n_div); if (!vec) return -1; for (i = 0; i < bmap->n_div; ++i) { isl_seq_cpy(vec->el, bmap->div[i], 2 + dim); isl_seq_clr(vec->el + 2 + dim, tab->bmap->n_div); for (j = 0; j < i; ++j) isl_int_set(vec->el[2 + dim + (*div_map)[j]], bmap->div[i][2 + dim + j]); for (j = 0; j < tab->bmap->n_div; ++j) if (isl_seq_eq(tab->bmap->div[j], vec->el, 2 + dim + tab->bmap->n_div)) break; (*div_map)[i] = j; if (j == tab->bmap->n_div) { vec->size = 2 + dim + tab->bmap->n_div; if (isl_tab_add_div(tab, vec, NULL, NULL) < 0) goto error; } } isl_vec_free(vec); return 0; error: isl_vec_free(vec); return -1; } /* Freeze all constraints of tableau tab. */ static int tab_freeze_constraints(struct isl_tab *tab) { int i; for (i = 0; i < tab->n_con; ++i) if (isl_tab_freeze_constraint(tab, i) < 0) return -1; return 0; } /* Check for redundant constraints starting at offset. * Put the indices of the redundant constraints in index * and return the number of redundant constraints. */ static int n_non_redundant(isl_ctx *ctx, struct isl_tab *tab, int offset, int **index) { int i, n; int n_test = tab->n_con - offset; if (isl_tab_detect_redundant(tab) < 0) return -1; if (n_test == 0) return 0; if (!*index) *index = isl_alloc_array(ctx, int, n_test); if (!*index) return -1; for (n = 0, i = 0; i < n_test; ++i) { int r; r = isl_tab_is_redundant(tab, offset + i); if (r < 0) return -1; if (r) continue; (*index)[n++] = i; } return n; } /* basic_map_collect_diff calls add on each of the pieces of * the set difference between bmap and map until the add method * return a negative value. */ struct isl_diff_collector { int (*add)(struct isl_diff_collector *dc, __isl_take isl_basic_map *bmap); }; /* Compute the set difference between bmap and map and call * dc->add on each of the piece until this function returns * a negative value. * Return 0 on success and -1 on error. dc->add returning * a negative value is treated as an error, but the calling * function can interpret the results based on the state of dc. * * Assumes that map has known divs. * * The difference is computed by a backtracking algorithm. * Each level corresponds to a basic map in "map". * When a node in entered for the first time, we check * if the corresonding basic map intersects the current piece * of "bmap". If not, we move to the next level. * Otherwise, we split the current piece into as many * pieces as there are non-redundant constraints of the current * basic map in the intersection. Each of these pieces is * handled by a child of the current node. * In particular, if there are n non-redundant constraints, * then for each 0 <= i < n, a piece is cut off by adding * constraints 0 <= j < i and adding the opposite of constraint i. * If there are no non-redundant constraints, meaning that the current * piece is a subset of the current basic map, then we simply backtrack. * * In the leaves, we check if the remaining piece has any integer points * and if so, pass it along to dc->add. As a special case, if nothing * has been removed when we end up in a leaf, we simply pass along * the original basic map. */ static int basic_map_collect_diff(__isl_take isl_basic_map *bmap, __isl_take isl_map *map, struct isl_diff_collector *dc) { int i; int modified; int level; int init; int empty; isl_ctx *ctx; struct isl_tab *tab = NULL; struct isl_tab_undo **snap = NULL; int *k = NULL; int *n = NULL; int **index = NULL; int **div_map = NULL; empty = isl_basic_map_is_empty(bmap); if (empty) { isl_basic_map_free(bmap); isl_map_free(map); return empty < 0 ? -1 : 0; } bmap = isl_basic_map_cow(bmap); map = isl_map_cow(map); if (!bmap || !map) goto error; ctx = map->ctx; snap = isl_alloc_array(map->ctx, struct isl_tab_undo *, map->n); k = isl_alloc_array(map->ctx, int, map->n); n = isl_alloc_array(map->ctx, int, map->n); index = isl_calloc_array(map->ctx, int *, map->n); div_map = isl_calloc_array(map->ctx, int *, map->n); if (!snap || !k || !n || !index || !div_map) goto error; bmap = isl_basic_map_order_divs(bmap); map = isl_map_order_divs(map); tab = isl_tab_from_basic_map(bmap, 1); if (!tab) goto error; modified = 0; level = 0; init = 1; while (level >= 0) { if (level >= map->n) { int empty; struct isl_basic_map *bm; if (!modified) { if (dc->add(dc, isl_basic_map_copy(bmap)) < 0) goto error; break; } bm = isl_basic_map_copy(tab->bmap); bm = isl_basic_map_cow(bm); bm = isl_basic_map_update_from_tab(bm, tab); bm = isl_basic_map_simplify(bm); bm = isl_basic_map_finalize(bm); empty = isl_basic_map_is_empty(bm); if (empty) isl_basic_map_free(bm); else if (dc->add(dc, bm) < 0) goto error; if (empty < 0) goto error; level--; init = 0; continue; } if (init) { int offset; struct isl_tab_undo *snap2; snap2 = isl_tab_snap(tab); if (tab_add_divs(tab, map->p[level], &div_map[level]) < 0) goto error; offset = tab->n_con; snap[level] = isl_tab_snap(tab); if (tab_freeze_constraints(tab) < 0) goto error; if (tab_add_constraints(tab, map->p[level], div_map[level]) < 0) goto error; k[level] = 0; n[level] = 0; if (tab->empty) { if (isl_tab_rollback(tab, snap2) < 0) goto error; level++; continue; } modified = 1; n[level] = n_non_redundant(ctx, tab, offset, &index[level]); if (n[level] < 0) goto error; if (n[level] == 0) { level--; init = 0; continue; } if (isl_tab_rollback(tab, snap[level]) < 0) goto error; if (tab_add_constraint(tab, map->p[level], div_map[level], index[level][0], 1) < 0) goto error; level++; continue; } else { if (k[level] + 1 >= n[level]) { level--; continue; } if (isl_tab_rollback(tab, snap[level]) < 0) goto error; if (tab_add_constraint(tab, map->p[level], div_map[level], index[level][k[level]], 0) < 0) goto error; snap[level] = isl_tab_snap(tab); k[level]++; if (tab_add_constraint(tab, map->p[level], div_map[level], index[level][k[level]], 1) < 0) goto error; level++; init = 1; continue; } } isl_tab_free(tab); free(snap); free(n); free(k); for (i = 0; index && i < map->n; ++i) free(index[i]); free(index); for (i = 0; div_map && i < map->n; ++i) free(div_map[i]); free(div_map); isl_basic_map_free(bmap); isl_map_free(map); return 0; error: isl_tab_free(tab); free(snap); free(n); free(k); for (i = 0; index && i < map->n; ++i) free(index[i]); free(index); for (i = 0; div_map && i < map->n; ++i) free(div_map[i]); free(div_map); isl_basic_map_free(bmap); isl_map_free(map); return -1; } /* A diff collector that actually collects all parts of the * set difference in the field diff. */ struct isl_subtract_diff_collector { struct isl_diff_collector dc; struct isl_map *diff; }; /* isl_subtract_diff_collector callback. */ static int basic_map_subtract_add(struct isl_diff_collector *dc, __isl_take isl_basic_map *bmap) { struct isl_subtract_diff_collector *sdc; sdc = (struct isl_subtract_diff_collector *)dc; sdc->diff = isl_map_union_disjoint(sdc->diff, isl_map_from_basic_map(bmap)); return sdc->diff ? 0 : -1; } /* Return the set difference between bmap and map. */ static __isl_give isl_map *basic_map_subtract(__isl_take isl_basic_map *bmap, __isl_take isl_map *map) { struct isl_subtract_diff_collector sdc; sdc.dc.add = &basic_map_subtract_add; sdc.diff = isl_map_empty_like_basic_map(bmap); if (basic_map_collect_diff(bmap, map, &sdc.dc) < 0) { isl_map_free(sdc.diff); sdc.diff = NULL; } return sdc.diff; } /* Return the set difference between map1 and map2. * (U_i A_i) \ (U_j B_j) is computed as U_i (A_i \ (U_j B_j)) */ static __isl_give isl_map *map_subtract( __isl_take isl_map *map1, __isl_take isl_map *map2) { int i; struct isl_map *diff; if (!map1 || !map2) goto error; isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error); if (isl_map_is_empty(map2)) { isl_map_free(map2); return map1; } map1 = isl_map_compute_divs(map1); map2 = isl_map_compute_divs(map2); if (!map1 || !map2) goto error; map1 = isl_map_remove_empty_parts(map1); map2 = isl_map_remove_empty_parts(map2); diff = isl_map_empty_like(map1); for (i = 0; i < map1->n; ++i) { struct isl_map *d; d = basic_map_subtract(isl_basic_map_copy(map1->p[i]), isl_map_copy(map2)); if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT)) diff = isl_map_union_disjoint(diff, d); else diff = isl_map_union(diff, d); } isl_map_free(map1); isl_map_free(map2); return diff; error: isl_map_free(map1); isl_map_free(map2); return NULL; } __isl_give isl_map *isl_map_subtract( __isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_subtract); } struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2) { return (struct isl_set *) isl_map_subtract( (struct isl_map *)set1, (struct isl_map *)set2); } /* Remove the elements of "dom" from the domain of "map". */ static __isl_give isl_map *map_subtract_domain(__isl_take isl_map *map, __isl_take isl_set *dom) { isl_map *ext_dom; if (!isl_map_compatible_domain(map, dom)) isl_die(isl_set_get_ctx(dom), isl_error_invalid, "incompatible spaces", goto error); ext_dom = isl_map_universe(isl_map_get_space(map)); ext_dom = isl_map_intersect_domain(ext_dom, dom); return isl_map_subtract(map, ext_dom); error: isl_map_free(map); isl_set_free(dom); return NULL; } __isl_give isl_map *isl_map_subtract_domain(__isl_take isl_map *map, __isl_take isl_set *dom) { return isl_map_align_params_map_map_and(map, dom, &map_subtract_domain); } /* Remove the elements of "dom" from the range of "map". */ static __isl_give isl_map *map_subtract_range(__isl_take isl_map *map, __isl_take isl_set *dom) { isl_map *ext_dom; if (!isl_map_compatible_range(map, dom)) isl_die(isl_set_get_ctx(dom), isl_error_invalid, "incompatible spaces", goto error); ext_dom = isl_map_universe(isl_map_get_space(map)); ext_dom = isl_map_intersect_range(ext_dom, dom); return isl_map_subtract(map, ext_dom); error: isl_map_free(map); isl_set_free(dom); return NULL; } __isl_give isl_map *isl_map_subtract_range(__isl_take isl_map *map, __isl_take isl_set *dom) { return isl_map_align_params_map_map_and(map, dom, &map_subtract_range); } /* A diff collector that aborts as soon as its add function is called, * setting empty to 0. */ struct isl_is_empty_diff_collector { struct isl_diff_collector dc; int empty; }; /* isl_is_empty_diff_collector callback. */ static int basic_map_is_empty_add(struct isl_diff_collector *dc, __isl_take isl_basic_map *bmap) { struct isl_is_empty_diff_collector *edc; edc = (struct isl_is_empty_diff_collector *)dc; edc->empty = 0; isl_basic_map_free(bmap); return -1; } /* Check if bmap \ map is empty by computing this set difference * and breaking off as soon as the difference is known to be non-empty. */ static int basic_map_diff_is_empty(__isl_keep isl_basic_map *bmap, __isl_keep isl_map *map) { int r; struct isl_is_empty_diff_collector edc; r = isl_basic_map_plain_is_empty(bmap); if (r) return r; edc.dc.add = &basic_map_is_empty_add; edc.empty = 1; r = basic_map_collect_diff(isl_basic_map_copy(bmap), isl_map_copy(map), &edc.dc); if (!edc.empty) return 0; return r < 0 ? -1 : 1; } /* Check if map1 \ map2 is empty by checking if the set difference is empty * for each of the basic maps in map1. */ static int map_diff_is_empty(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i; int is_empty = 1; if (!map1 || !map2) return -1; for (i = 0; i < map1->n; ++i) { is_empty = basic_map_diff_is_empty(map1->p[i], map2); if (is_empty < 0 || !is_empty) break; } return is_empty; } /* Return 1 if "bmap" contains a single element. */ int isl_basic_map_plain_is_singleton(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; if (bmap->n_div) return 0; if (bmap->n_ineq) return 0; return bmap->n_eq == isl_basic_map_total_dim(bmap); } /* Return 1 if "map" contains a single element. */ int isl_map_plain_is_singleton(__isl_keep isl_map *map) { if (!map) return -1; if (map->n != 1) return 0; return isl_basic_map_plain_is_singleton(map->p[0]); } /* Given a singleton basic map, extract the single element * as an isl_point. */ static __isl_give isl_point *singleton_extract_point( __isl_keep isl_basic_map *bmap) { int j; unsigned dim; struct isl_vec *point; isl_int m; if (!bmap) return NULL; dim = isl_basic_map_total_dim(bmap); isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL); point = isl_vec_alloc(bmap->ctx, 1 + dim); if (!point) return NULL; isl_int_init(m); isl_int_set_si(point->el[0], 1); for (j = 0; j < bmap->n_eq; ++j) { int i = dim - 1 - j; isl_assert(bmap->ctx, isl_seq_first_non_zero(bmap->eq[j] + 1, i) == -1, goto error); isl_assert(bmap->ctx, isl_int_is_one(bmap->eq[j][1 + i]) || isl_int_is_negone(bmap->eq[j][1 + i]), goto error); isl_assert(bmap->ctx, isl_seq_first_non_zero(bmap->eq[j]+1+i+1, dim-i-1) == -1, goto error); isl_int_gcd(m, point->el[0], bmap->eq[j][1 + i]); isl_int_divexact(m, bmap->eq[j][1 + i], m); isl_int_abs(m, m); isl_seq_scale(point->el, point->el, m, 1 + i); isl_int_divexact(m, point->el[0], bmap->eq[j][1 + i]); isl_int_neg(m, m); isl_int_mul(point->el[1 + i], m, bmap->eq[j][0]); } isl_int_clear(m); return isl_point_alloc(isl_basic_map_get_space(bmap), point); error: isl_int_clear(m); isl_vec_free(point); return NULL; } /* Return 1 is the singleton map "map1" is a subset of "map2", * i.e., if the single element of "map1" is also an element of "map2". * Assumes "map2" has known divs. */ static int map_is_singleton_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i; int is_subset = 0; struct isl_point *point; if (!map1 || !map2) return -1; if (map1->n != 1) return -1; point = singleton_extract_point(map1->p[0]); if (!point) return -1; for (i = 0; i < map2->n; ++i) { is_subset = isl_basic_map_contains_point(map2->p[i], point); if (is_subset) break; } isl_point_free(point); return is_subset; } static int map_is_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int is_subset = 0; int empty; int rat1, rat2; if (!map1 || !map2) return -1; if (!isl_map_has_equal_space(map1, map2)) return 0; empty = isl_map_is_empty(map1); if (empty < 0) return -1; if (empty) return 1; empty = isl_map_is_empty(map2); if (empty < 0) return -1; if (empty) return 0; rat1 = isl_map_has_rational(map1); rat2 = isl_map_has_rational(map2); if (rat1 < 0 || rat2 < 0) return -1; if (rat1 && !rat2) return 0; if (isl_map_plain_is_universe(map2)) return 1; map2 = isl_map_compute_divs(isl_map_copy(map2)); if (isl_map_plain_is_singleton(map1)) { is_subset = map_is_singleton_subset(map1, map2); isl_map_free(map2); return is_subset; } is_subset = map_diff_is_empty(map1, map2); isl_map_free(map2); return is_subset; } int isl_map_is_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { return isl_map_align_params_map_map_and_test(map1, map2, &map_is_subset); } int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2) { return isl_map_is_subset( (struct isl_map *)set1, (struct isl_map *)set2); } __isl_give isl_map *isl_map_make_disjoint(__isl_take isl_map *map) { int i; struct isl_subtract_diff_collector sdc; sdc.dc.add = &basic_map_subtract_add; if (!map) return NULL; if (ISL_F_ISSET(map, ISL_MAP_DISJOINT)) return map; if (map->n <= 1) return map; map = isl_map_compute_divs(map); map = isl_map_remove_empty_parts(map); if (!map || map->n <= 1) return map; sdc.diff = isl_map_from_basic_map(isl_basic_map_copy(map->p[0])); for (i = 1; i < map->n; ++i) { struct isl_basic_map *bmap = isl_basic_map_copy(map->p[i]); struct isl_map *copy = isl_map_copy(sdc.diff); if (basic_map_collect_diff(bmap, copy, &sdc.dc) < 0) { isl_map_free(sdc.diff); sdc.diff = NULL; break; } } isl_map_free(map); return sdc.diff; } __isl_give isl_set *isl_set_make_disjoint(__isl_take isl_set *set) { return (struct isl_set *)isl_map_make_disjoint((struct isl_map *)set); } __isl_give isl_map *isl_map_complement(__isl_take isl_map *map) { isl_map *universe; if (!map) return NULL; universe = isl_map_universe(isl_map_get_space(map)); return isl_map_subtract(universe, map); } __isl_give isl_set *isl_set_complement(__isl_take isl_set *set) { return isl_map_complement(set); } cloog-0.18.2/isl/isl_ctx_private.h0000664000175000017500000000065212254313240013766 00000000000000#include struct isl_ctx { int ref; struct isl_stats *stats; int opt_allocated; struct isl_options *opt; void *user_opt; struct isl_args *user_args; isl_int zero; isl_int one; isl_int two; isl_int negone; isl_int normalize_gcd; int n_cached; int n_miss; struct isl_blk cache[ISL_BLK_CACHE_SIZE]; struct isl_hash_table id_table; enum isl_error error; int abort; }; cloog-0.18.2/isl/isl_list_templ.c0000664000175000017500000002711512254313240013610 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2011 INRIA Saclay * Copyright 2012-2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #define xCAT(A,B) A ## B #define CAT(A,B) xCAT(A,B) #undef EL #define EL CAT(isl_,BASE) #define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) #define xLIST(EL) EL ## _list #define LIST(EL) xLIST(EL) #define xS(TYPE,NAME) struct TYPE ## _ ## NAME #define S(TYPE,NAME) xS(TYPE,NAME) isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list) { return list ? list->ctx : NULL; } __isl_give LIST(EL) *FN(LIST(EL),alloc)(isl_ctx *ctx, int n) { LIST(EL) *list; if (n < 0) isl_die(ctx, isl_error_invalid, "cannot create list of negative length", return NULL); list = isl_alloc(ctx, LIST(EL), sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *)); if (!list) return NULL; list->ctx = ctx; isl_ctx_ref(ctx); list->ref = 1; list->size = n; list->n = 0; return list; } __isl_give LIST(EL) *FN(LIST(EL),copy)(__isl_keep LIST(EL) *list) { if (!list) return NULL; list->ref++; return list; } __isl_give LIST(EL) *FN(LIST(EL),dup)(__isl_keep LIST(EL) *list) { int i; LIST(EL) *dup; if (!list) return NULL; dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n); if (!dup) return NULL; for (i = 0; i < list->n; ++i) dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i])); return dup; } __isl_give LIST(EL) *FN(LIST(EL),cow)(__isl_take LIST(EL) *list) { if (!list) return NULL; if (list->ref == 1) return list; list->ref--; return FN(LIST(EL),dup)(list); } /* Make sure "list" has room for at least "n" more pieces. * * If there is only one reference to list, we extend it in place. * Otherwise, we create a new LIST(EL) and copy the elements. */ static __isl_give LIST(EL) *FN(LIST(EL),grow)(__isl_take LIST(EL) *list, int n) { isl_ctx *ctx; int i, new_size; LIST(EL) *res; if (!list) return NULL; if (list->n + n <= list->size) return list; ctx = FN(LIST(EL),get_ctx)(list); new_size = ((list->n + n + 1) * 3) / 2; if (list->ref == 1) { res = isl_realloc(ctx, list, LIST(EL), sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *)); if (!res) return FN(LIST(EL),free)(list); res->size = new_size; return res; } res = FN(LIST(EL),alloc)(ctx, new_size); if (!res) return FN(LIST(EL),free)(list); for (i = 0; i < list->n; ++i) res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i])); FN(LIST(EL),free)(list); return res; } __isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list, __isl_take struct EL *el) { list = FN(LIST(EL),grow)(list, 1); if (!list || !el) goto error; list->p[list->n] = el; list->n++; return list; error: FN(EL,free)(el); FN(LIST(EL),free)(list); return NULL; } /* Remove the "n" elements starting at "first" from "list". */ __isl_give LIST(EL) *FN(LIST(EL),drop)(__isl_take LIST(EL) *list, unsigned first, unsigned n) { int i; if (!list) return NULL; if (first + n > list->n || first + n < first) isl_die(list->ctx, isl_error_invalid, "index out of bounds", return FN(LIST(EL),free)(list)); if (n == 0) return list; list = FN(LIST(EL),cow)(list); if (!list) return NULL; for (i = 0; i < n; ++i) FN(EL,free)(list->p[first + i]); for (i = first; i + n < list->n; ++i) list->p[i] = list->p[i + n]; list->n -= n; return list; } /* Insert "el" at position "pos" in "list". * * If there is only one reference to "list" and if it already has space * for one extra element, we insert it directly into "list". * Otherwise, we create a new list consisting of "el" and copied * elements from "list". */ __isl_give LIST(EL) *FN(LIST(EL),insert)(__isl_take LIST(EL) *list, unsigned pos, __isl_take struct EL *el) { int i; isl_ctx *ctx; LIST(EL) *res; if (!list || !el) goto error; ctx = FN(LIST(EL),get_ctx)(list); if (pos > list->n) isl_die(ctx, isl_error_invalid, "index out of bounds", goto error); if (list->ref == 1 && list->size > list->n) { for (i = list->n - 1; i >= pos; --i) list->p[i + 1] = list->p[i]; list->n++; list->p[pos] = el; return list; } res = FN(LIST(EL),alloc)(ctx, list->n + 1); for (i = 0; i < pos; ++i) res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i])); res = FN(LIST(EL),add)(res, el); for (i = pos; i < list->n; ++i) res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i])); FN(LIST(EL),free)(list); return res; error: FN(EL,free)(el); FN(LIST(EL),free)(list); return NULL; } void *FN(LIST(EL),free)(__isl_take LIST(EL) *list) { int i; if (!list) return NULL; if (--list->ref > 0) return NULL; isl_ctx_deref(list->ctx); for (i = 0; i < list->n; ++i) FN(EL,free)(list->p[i]); free(list); return NULL; } int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list) { return list ? list->n : 0; } __isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index) { if (!list) return NULL; if (index < 0 || index >= list->n) isl_die(list->ctx, isl_error_invalid, "index out of bounds", return NULL); return FN(EL,copy)(list->p[index]); } /* Replace the element at position "index" in "list" by "el". */ __isl_give LIST(EL) *FN(FN(LIST(EL),set),BASE)(__isl_take LIST(EL) *list, int index, __isl_take EL *el) { if (!list || !el) goto error; if (index < 0 || index >= list->n) isl_die(list->ctx, isl_error_invalid, "index out of bounds", goto error); if (list->p[index] == el) { FN(EL,free)(el); return list; } list = FN(LIST(EL),cow)(list); if (!list) goto error; FN(EL,free)(list->p[index]); list->p[index] = el; return list; error: FN(EL,free)(el); FN(LIST(EL),free)(list); return NULL; } int FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list, int (*fn)(__isl_take EL *el, void *user), void *user) { int i; if (!list) return -1; for (i = 0; i < list->n; ++i) { EL *el = FN(EL,copy(list->p[i])); if (!el) return -1; if (fn(el, user) < 0) return -1; } return 0; } /* Internal data structure for isl_*_list_sort. * * "cmp" is the original comparison function. * "user" is a user provided pointer that should be passed to "cmp". */ S(LIST(EL),sort_data) { int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user); void *user; }; /* Compare two entries of an isl_*_list based on the user provided * comparison function on pairs of isl_* objects. */ static int FN(LIST(EL),cmp)(const void *a, const void *b, void *user) { S(LIST(EL),sort_data) *data = user; EL * const *el1 = a; EL * const *el2 = b; return data->cmp(*el1, *el2, data->user); } /* Sort the elements of "list" in ascending order according to * comparison function "cmp". */ __isl_give LIST(EL) *FN(LIST(EL),sort)(__isl_take LIST(EL) *list, int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *user) { S(LIST(EL),sort_data) data = { cmp, user }; if (!list) return NULL; if (list->n <= 1) return list; list = FN(LIST(EL),cow)(list); if (!list) return NULL; if (isl_sort(list->p, list->n, sizeof(list->p[0]), &FN(LIST(EL),cmp), &data) < 0) return FN(LIST(EL),free)(list); return list; } /* Internal data structure for isl_*_list_foreach_scc. * * "list" is the original list. * "follows" is the user provided callback that defines the edges of the graph. */ S(LIST(EL),foreach_scc_data) { LIST(EL) *list; int (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user); void *follows_user; }; /* Does element i of data->list follow element j? * * Use the user provided callback to find out. */ static int FN(LIST(EL),follows)(int i, int j, void *user) { S(LIST(EL),foreach_scc_data) *data = user; return data->follows(data->list->p[i], data->list->p[j], data->follows_user); } /* Call "fn" on the sublist of "list" that consists of the elements * with indices specified by the "n" elements of "pos". */ static int FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos, int n, int (*fn)(__isl_take LIST(EL) *scc, void *user), void *user) { int i; isl_ctx *ctx; LIST(EL) *slice; ctx = FN(LIST(EL),get_ctx)(list); slice = FN(LIST(EL),alloc)(ctx, n); for (i = 0; i < n; ++i) { EL *el; el = FN(EL,copy)(list->p[pos[i]]); slice = FN(LIST(EL),add)(slice, el); } return fn(slice, user); } /* Call "fn" on each of the strongly connected components (SCCs) of * the graph with as vertices the elements of "list" and * a directed edge from node b to node a iff follows(a, b) * returns 1. follows should return -1 on error. * * If SCC a contains a node i that follows a node j in another SCC b * (i.e., follows(i, j, user) returns 1), then fn will be called on SCC a * after being called on SCC b. * * We simply call isl_tarjan_graph_init, extract the SCCs from the result and * call fn on each of them. */ int FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list, int (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *follows_user, int (*fn)(__isl_take LIST(EL) *scc, void *user), void *fn_user) { S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user }; int i, n; isl_ctx *ctx; struct isl_tarjan_graph *g; if (!list) return -1; if (list->n == 0) return 0; if (list->n == 1) return fn(FN(LIST(EL),copy)(list), fn_user); ctx = FN(LIST(EL),get_ctx)(list); n = list->n; g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data); if (!g) return -1; i = 0; do { int first; if (g->order[i] == -1) isl_die(ctx, isl_error_internal, "cannot happen", break); first = i; while (g->order[i] != -1) { ++i; --n; } if (first == 0 && n == 0) { isl_tarjan_graph_free(g); return fn(FN(LIST(EL),copy)(list), fn_user); } if (FN(LIST(EL),call_on_scc)(list, g->order + first, i - first, fn, fn_user) < 0) break; ++i; } while (n); isl_tarjan_graph_free(g); return n > 0 ? -1 : 0; } __isl_give LIST(EL) *FN(FN(LIST(EL),from),BASE)(__isl_take EL *el) { isl_ctx *ctx; LIST(EL) *list; if (!el) return NULL; ctx = FN(EL,get_ctx)(el); list = FN(LIST(EL),alloc)(ctx, 1); if (!list) goto error; list = FN(LIST(EL),add)(list, el); return list; error: FN(EL,free)(el); return NULL; } __isl_give LIST(EL) *FN(LIST(EL),concat)(__isl_take LIST(EL) *list1, __isl_take LIST(EL) *list2) { int i; isl_ctx *ctx; LIST(EL) *res; if (!list1 || !list2) goto error; ctx = FN(LIST(EL),get_ctx)(list1); res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n); for (i = 0; i < list1->n; ++i) res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i])); for (i = 0; i < list2->n; ++i) res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i])); FN(LIST(EL),free)(list1); FN(LIST(EL),free)(list2); return res; error: FN(LIST(EL),free)(list1); FN(LIST(EL),free)(list2); return NULL; } __isl_give isl_printer *CAT(isl_printer_print_,LIST(BASE))( __isl_take isl_printer *p, __isl_keep LIST(EL) *list) { int i; if (!p || !list) goto error; p = isl_printer_print_str(p, "("); for (i = 0; i < list->n; ++i) { if (i) p = isl_printer_print_str(p, ","); p = CAT(isl_printer_print_,BASE)(p, list->p[i]); } p = isl_printer_print_str(p, ")"); return p; error: isl_printer_free(p); return NULL; } void FN(LIST(EL),dump)(__isl_keep LIST(EL) *list) { isl_printer *printer; if (!list) return; printer = isl_printer_to_file(FN(LIST(EL),get_ctx)(list), stderr); printer = CAT(isl_printer_print_,LIST(BASE))(printer, list); printer = isl_printer_end_line(printer); isl_printer_free(printer); } cloog-0.18.2/isl/mp_get_memory_functions.c0000664000175000017500000000056512254313240015520 00000000000000#include void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)) { if (alloc_func_ptr) *alloc_func_ptr = __gmp_allocate_func; if (realloc_func_ptr) *realloc_func_ptr = __gmp_reallocate_func; if (free_func_ptr) *free_func_ptr = __gmp_free_func; } cloog-0.18.2/isl/isl_dim.c0000664000175000017500000001537212254313240012207 00000000000000#include #include #include #include #include isl_ctx *isl_dim_get_ctx(__isl_keep isl_space *dim) { return isl_space_get_ctx(dim); } __isl_give isl_space *isl_dim_alloc(isl_ctx *ctx, unsigned nparam, unsigned n_in, unsigned n_out) { return isl_space_alloc(ctx, nparam, n_in, n_out); } __isl_give isl_space *isl_dim_set_alloc(isl_ctx *ctx, unsigned nparam, unsigned dim) { return isl_space_set_alloc(ctx, nparam, dim); } __isl_give isl_space *isl_dim_copy(__isl_keep isl_space *dim) { return isl_space_copy(dim); } void isl_dim_free(__isl_take isl_space *dim) { isl_space_free(dim); } unsigned isl_dim_size(__isl_keep isl_space *dim, enum isl_dim_type type) { return isl_space_dim(dim, type); } __isl_give isl_space *isl_dim_set_dim_id(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { return isl_space_set_dim_id(dim, type, pos, id); } int isl_dim_has_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { return isl_space_has_dim_id(dim, type, pos); } __isl_give isl_id *isl_dim_get_dim_id(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { return isl_space_get_dim_id(dim, type, pos); } int isl_dim_find_dim_by_id(__isl_keep isl_space *dim, enum isl_dim_type type, __isl_keep isl_id *id) { return isl_space_find_dim_by_id(dim, type, id); } __isl_give isl_space *isl_dim_set_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type, __isl_take isl_id *id) { return isl_space_set_tuple_id(dim, type, id); } __isl_give isl_space *isl_dim_reset_tuple_id(__isl_take isl_space *dim, enum isl_dim_type type) { return isl_space_reset_tuple_id(dim, type); } int isl_dim_has_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type) { return isl_space_has_tuple_id(dim, type); } __isl_give isl_id *isl_dim_get_tuple_id(__isl_keep isl_space *dim, enum isl_dim_type type) { return isl_space_get_tuple_id(dim, type); } __isl_give isl_space *isl_dim_set_name(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, __isl_keep const char *name) { return isl_space_set_dim_name(dim, type, pos, name); } __isl_keep const char *isl_dim_get_name(__isl_keep isl_space *dim, enum isl_dim_type type, unsigned pos) { return isl_space_get_dim_name(dim, type, pos); } __isl_give isl_space *isl_dim_set_tuple_name(__isl_take isl_space *dim, enum isl_dim_type type, const char *s) { return isl_space_set_tuple_name(dim, type, s); } const char *isl_dim_get_tuple_name(__isl_keep isl_space *dim, enum isl_dim_type type) { return isl_space_get_tuple_name(dim, type); } int isl_dim_is_wrapping(__isl_keep isl_space *dim) { return isl_space_is_wrapping(dim); } __isl_give isl_space *isl_dim_wrap(__isl_take isl_space *dim) { return isl_space_wrap(dim); } __isl_give isl_space *isl_dim_unwrap(__isl_take isl_space *dim) { return isl_space_unwrap(dim); } __isl_give isl_space *isl_dim_domain(__isl_take isl_space *dim) { return isl_space_domain(dim); } __isl_give isl_space *isl_dim_from_domain(__isl_take isl_space *dim) { return isl_space_from_domain(dim); } __isl_give isl_space *isl_dim_range(__isl_take isl_space *dim) { return isl_space_range(dim); } __isl_give isl_space *isl_dim_from_range(__isl_take isl_space *dim) { return isl_space_from_range(dim); } __isl_give isl_space *isl_dim_reverse(__isl_take isl_space *dim) { return isl_space_reverse(dim); } __isl_give isl_space *isl_dim_join(__isl_take isl_space *left, __isl_take isl_space *right) { return isl_space_join(left, right); } __isl_give isl_space *isl_dim_align_params(__isl_take isl_space *dim1, __isl_take isl_space *dim2) { return isl_space_align_params(dim1, dim2); } __isl_give isl_space *isl_dim_insert(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos, unsigned n) { return isl_space_insert_dims(dim, type, pos, n); } __isl_give isl_space *isl_dim_add(__isl_take isl_space *dim, enum isl_dim_type type, unsigned n) { return isl_space_add_dims(dim, type, n); } __isl_give isl_space *isl_dim_drop(__isl_take isl_space *dim, enum isl_dim_type type, unsigned first, unsigned n) { return isl_space_drop_dims(dim, type, first, n); } __isl_give isl_space *isl_dim_move(__isl_take isl_space *dim, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { return isl_space_move_dims(dim, dst_type, dst_pos, src_type, src_pos, n); } __isl_give isl_space *isl_dim_map_from_set(__isl_take isl_space *dim) { return isl_space_map_from_set(dim); } __isl_give isl_space *isl_dim_zip(__isl_take isl_space *dim) { return isl_space_zip(dim); } __isl_give isl_local_space *isl_local_space_from_dim( __isl_take isl_space *dim) { return isl_local_space_from_space(dim); } __isl_give isl_space *isl_local_space_get_dim( __isl_keep isl_local_space *ls) { return isl_local_space_get_space(ls); } __isl_give isl_space *isl_aff_get_dim(__isl_keep isl_aff *aff) { return isl_aff_get_space(aff); } __isl_give isl_space *isl_pw_aff_get_dim(__isl_keep isl_pw_aff *pwaff) { return isl_pw_aff_get_space(pwaff); } __isl_give isl_space *isl_constraint_get_dim( __isl_keep isl_constraint *constraint) { return isl_constraint_get_space(constraint); } __isl_give isl_space *isl_basic_map_get_dim(__isl_keep isl_basic_map *bmap) { return isl_basic_map_get_space(bmap); } __isl_give isl_space *isl_map_get_dim(__isl_keep isl_map *map) { return isl_map_get_space(map); } __isl_give isl_space *isl_union_map_get_dim(__isl_keep isl_union_map *umap) { return isl_union_map_get_space(umap); } __isl_give isl_space *isl_basic_set_get_dim(__isl_keep isl_basic_set *bset) { return isl_basic_set_get_space(bset); } __isl_give isl_space *isl_set_get_dim(__isl_keep isl_set *set) { return isl_set_get_space(set); } __isl_give isl_space *isl_union_set_get_dim(__isl_keep isl_union_set *uset) { return isl_union_set_get_space(uset); } __isl_give isl_space *isl_point_get_dim(__isl_keep isl_point *pnt) { return isl_point_get_space(pnt); } __isl_give isl_space *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp) { return isl_qpolynomial_get_space(qp); } __isl_give isl_space *isl_pw_qpolynomial_get_dim( __isl_keep isl_pw_qpolynomial *pwqp) { return isl_pw_qpolynomial_get_space(pwqp); } __isl_give isl_space *isl_qpolynomial_fold_get_dim( __isl_keep isl_qpolynomial_fold *fold) { return isl_qpolynomial_fold_get_space(fold); } __isl_give isl_space *isl_pw_qpolynomial_fold_get_dim( __isl_keep isl_pw_qpolynomial_fold *pwf) { return isl_pw_qpolynomial_fold_get_space(pwf); } __isl_give isl_space *isl_union_pw_qpolynomial_get_dim( __isl_keep isl_union_pw_qpolynomial *upwqp) { return isl_union_pw_qpolynomial_get_space(upwqp); } __isl_give isl_space *isl_union_pw_qpolynomial_fold_get_dim( __isl_keep isl_union_pw_qpolynomial_fold *upwf) { return isl_union_pw_qpolynomial_fold_get_space(upwf); } cloog-0.18.2/isl/isl_polynomial.c0000664000175000017500000032327012254313240013620 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #define ISL_DIM_H #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type) { switch (type) { case isl_dim_param: return 0; case isl_dim_in: return dim->nparam; case isl_dim_out: return dim->nparam + dim->n_in; default: return 0; } } int isl_upoly_is_cst(__isl_keep struct isl_upoly *up) { if (!up) return -1; return up->var < 0; } __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up) { if (!up) return NULL; isl_assert(up->ctx, up->var < 0, return NULL); return (struct isl_upoly_cst *)up; } __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up) { if (!up) return NULL; isl_assert(up->ctx, up->var >= 0, return NULL); return (struct isl_upoly_rec *)up; } int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1, __isl_keep struct isl_upoly *up2) { int i; struct isl_upoly_rec *rec1, *rec2; if (!up1 || !up2) return -1; if (up1 == up2) return 1; if (up1->var != up2->var) return 0; if (isl_upoly_is_cst(up1)) { struct isl_upoly_cst *cst1, *cst2; cst1 = isl_upoly_as_cst(up1); cst2 = isl_upoly_as_cst(up2); if (!cst1 || !cst2) return -1; return isl_int_eq(cst1->n, cst2->n) && isl_int_eq(cst1->d, cst2->d); } rec1 = isl_upoly_as_rec(up1); rec2 = isl_upoly_as_rec(up2); if (!rec1 || !rec2) return -1; if (rec1->n != rec2->n) return 0; for (i = 0; i < rec1->n; ++i) { int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]); if (eq < 0 || !eq) return eq; } return 1; } int isl_upoly_is_zero(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return -1; if (!isl_upoly_is_cst(up)) return 0; cst = isl_upoly_as_cst(up); if (!cst) return -1; return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d); } int isl_upoly_sgn(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return 0; if (!isl_upoly_is_cst(up)) return 0; cst = isl_upoly_as_cst(up); if (!cst) return 0; return isl_int_sgn(cst->n); } int isl_upoly_is_nan(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return -1; if (!isl_upoly_is_cst(up)) return 0; cst = isl_upoly_as_cst(up); if (!cst) return -1; return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d); } int isl_upoly_is_infty(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return -1; if (!isl_upoly_is_cst(up)) return 0; cst = isl_upoly_as_cst(up); if (!cst) return -1; return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d); } int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return -1; if (!isl_upoly_is_cst(up)) return 0; cst = isl_upoly_as_cst(up); if (!cst) return -1; return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d); } int isl_upoly_is_one(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return -1; if (!isl_upoly_is_cst(up)) return 0; cst = isl_upoly_as_cst(up); if (!cst) return -1; return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d); } int isl_upoly_is_negone(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return -1; if (!isl_upoly_is_cst(up)) return 0; cst = isl_upoly_as_cst(up); if (!cst) return -1; return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d); } __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx) { struct isl_upoly_cst *cst; cst = isl_alloc_type(ctx, struct isl_upoly_cst); if (!cst) return NULL; cst->up.ref = 1; cst->up.ctx = ctx; isl_ctx_ref(ctx); cst->up.var = -1; isl_int_init(cst->n); isl_int_init(cst->d); return cst; } __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx) { struct isl_upoly_cst *cst; cst = isl_upoly_cst_alloc(ctx); if (!cst) return NULL; isl_int_set_si(cst->n, 0); isl_int_set_si(cst->d, 1); return &cst->up; } __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx) { struct isl_upoly_cst *cst; cst = isl_upoly_cst_alloc(ctx); if (!cst) return NULL; isl_int_set_si(cst->n, 1); isl_int_set_si(cst->d, 1); return &cst->up; } __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx) { struct isl_upoly_cst *cst; cst = isl_upoly_cst_alloc(ctx); if (!cst) return NULL; isl_int_set_si(cst->n, 1); isl_int_set_si(cst->d, 0); return &cst->up; } __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx) { struct isl_upoly_cst *cst; cst = isl_upoly_cst_alloc(ctx); if (!cst) return NULL; isl_int_set_si(cst->n, -1); isl_int_set_si(cst->d, 0); return &cst->up; } __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx) { struct isl_upoly_cst *cst; cst = isl_upoly_cst_alloc(ctx); if (!cst) return NULL; isl_int_set_si(cst->n, 0); isl_int_set_si(cst->d, 0); return &cst->up; } __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx, isl_int n, isl_int d) { struct isl_upoly_cst *cst; cst = isl_upoly_cst_alloc(ctx); if (!cst) return NULL; isl_int_set(cst->n, n); isl_int_set(cst->d, d); return &cst->up; } __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx, int var, int size) { struct isl_upoly_rec *rec; isl_assert(ctx, var >= 0, return NULL); isl_assert(ctx, size >= 0, return NULL); rec = isl_calloc(ctx, struct isl_upoly_rec, sizeof(struct isl_upoly_rec) + size * sizeof(struct isl_upoly *)); if (!rec) return NULL; rec->up.ref = 1; rec->up.ctx = ctx; isl_ctx_ref(ctx); rec->up.var = var; rec->n = 0; rec->size = size; return rec; } __isl_give isl_qpolynomial *isl_qpolynomial_reset_domain_space( __isl_take isl_qpolynomial *qp, __isl_take isl_space *dim) { qp = isl_qpolynomial_cow(qp); if (!qp || !dim) goto error; isl_space_free(qp->dim); qp->dim = dim; return qp; error: isl_qpolynomial_free(qp); isl_space_free(dim); return NULL; } /* Reset the space of "qp". This function is called from isl_pw_templ.c * and doesn't know if the space of an element object is represented * directly or through its domain. It therefore passes along both. */ __isl_give isl_qpolynomial *isl_qpolynomial_reset_space_and_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_space *space, __isl_take isl_space *domain) { isl_space_free(space); return isl_qpolynomial_reset_domain_space(qp, domain); } isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp) { return qp ? qp->dim->ctx : NULL; } __isl_give isl_space *isl_qpolynomial_get_domain_space( __isl_keep isl_qpolynomial *qp) { return qp ? isl_space_copy(qp->dim) : NULL; } __isl_give isl_space *isl_qpolynomial_get_space(__isl_keep isl_qpolynomial *qp) { isl_space *space; if (!qp) return NULL; space = isl_space_copy(qp->dim); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, 1); return space; } /* Externally, an isl_qpolynomial has a map space, but internally, the * ls field corresponds to the domain of that space. */ unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp, enum isl_dim_type type) { if (!qp) return 0; if (type == isl_dim_out) return 1; if (type == isl_dim_in) type = isl_dim_set; return isl_space_dim(qp->dim, type); } int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_zero(qp->upoly) : -1; } int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_one(qp->upoly) : -1; } int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_nan(qp->upoly) : -1; } int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_infty(qp->upoly) : -1; } int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_is_neginfty(qp->upoly) : -1; } int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp) { return qp ? isl_upoly_sgn(qp->upoly) : 0; } static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst) { isl_int_clear(cst->n); isl_int_clear(cst->d); } static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec) { int i; for (i = 0; i < rec->n; ++i) isl_upoly_free(rec->p[i]); } __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up) { if (!up) return NULL; up->ref++; return up; } __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; struct isl_upoly_cst *dup; cst = isl_upoly_as_cst(up); if (!cst) return NULL; dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx)); if (!dup) return NULL; isl_int_set(dup->n, cst->n); isl_int_set(dup->d, cst->d); return &dup->up; } __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up) { int i; struct isl_upoly_rec *rec; struct isl_upoly_rec *dup; rec = isl_upoly_as_rec(up); if (!rec) return NULL; dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n); if (!dup) return NULL; for (i = 0; i < rec->n; ++i) { dup->p[i] = isl_upoly_copy(rec->p[i]); if (!dup->p[i]) goto error; dup->n++; } return &dup->up; error: isl_upoly_free(&dup->up); return NULL; } __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up) { if (!up) return NULL; if (isl_upoly_is_cst(up)) return isl_upoly_dup_cst(up); else return isl_upoly_dup_rec(up); } __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up) { if (!up) return NULL; if (up->ref == 1) return up; up->ref--; return isl_upoly_dup(up); } void isl_upoly_free(__isl_take struct isl_upoly *up) { if (!up) return; if (--up->ref > 0) return; if (up->var < 0) upoly_free_cst((struct isl_upoly_cst *)up); else upoly_free_rec((struct isl_upoly_rec *)up); isl_ctx_deref(up->ctx); free(up); } static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst) { isl_int gcd; isl_int_init(gcd); isl_int_gcd(gcd, cst->n, cst->d); if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) { isl_int_divexact(cst->n, cst->n, gcd); isl_int_divexact(cst->d, cst->d, gcd); } isl_int_clear(gcd); } __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1, __isl_take struct isl_upoly *up2) { struct isl_upoly_cst *cst1; struct isl_upoly_cst *cst2; up1 = isl_upoly_cow(up1); if (!up1 || !up2) goto error; cst1 = isl_upoly_as_cst(up1); cst2 = isl_upoly_as_cst(up2); if (isl_int_eq(cst1->d, cst2->d)) isl_int_add(cst1->n, cst1->n, cst2->n); else { isl_int_mul(cst1->n, cst1->n, cst2->d); isl_int_addmul(cst1->n, cst2->n, cst1->d); isl_int_mul(cst1->d, cst1->d, cst2->d); } isl_upoly_cst_reduce(cst1); isl_upoly_free(up2); return up1; error: isl_upoly_free(up1); isl_upoly_free(up2); return NULL; } static __isl_give struct isl_upoly *replace_by_zero( __isl_take struct isl_upoly *up) { struct isl_ctx *ctx; if (!up) return NULL; ctx = up->ctx; isl_upoly_free(up); return isl_upoly_zero(ctx); } static __isl_give struct isl_upoly *replace_by_constant_term( __isl_take struct isl_upoly *up) { struct isl_upoly_rec *rec; struct isl_upoly *cst; if (!up) return NULL; rec = isl_upoly_as_rec(up); if (!rec) goto error; cst = isl_upoly_copy(rec->p[0]); isl_upoly_free(up); return cst; error: isl_upoly_free(up); return NULL; } __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1, __isl_take struct isl_upoly *up2) { int i; struct isl_upoly_rec *rec1, *rec2; if (!up1 || !up2) goto error; if (isl_upoly_is_nan(up1)) { isl_upoly_free(up2); return up1; } if (isl_upoly_is_nan(up2)) { isl_upoly_free(up1); return up2; } if (isl_upoly_is_zero(up1)) { isl_upoly_free(up1); return up2; } if (isl_upoly_is_zero(up2)) { isl_upoly_free(up2); return up1; } if (up1->var < up2->var) return isl_upoly_sum(up2, up1); if (up2->var < up1->var) { struct isl_upoly_rec *rec; if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) { isl_upoly_free(up1); return up2; } up1 = isl_upoly_cow(up1); rec = isl_upoly_as_rec(up1); if (!rec) goto error; rec->p[0] = isl_upoly_sum(rec->p[0], up2); if (rec->n == 1) up1 = replace_by_constant_term(up1); return up1; } if (isl_upoly_is_cst(up1)) return isl_upoly_sum_cst(up1, up2); rec1 = isl_upoly_as_rec(up1); rec2 = isl_upoly_as_rec(up2); if (!rec1 || !rec2) goto error; if (rec1->n < rec2->n) return isl_upoly_sum(up2, up1); up1 = isl_upoly_cow(up1); rec1 = isl_upoly_as_rec(up1); if (!rec1) goto error; for (i = rec2->n - 1; i >= 0; --i) { rec1->p[i] = isl_upoly_sum(rec1->p[i], isl_upoly_copy(rec2->p[i])); if (!rec1->p[i]) goto error; if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) { isl_upoly_free(rec1->p[i]); rec1->n--; } } if (rec1->n == 0) up1 = replace_by_zero(up1); else if (rec1->n == 1) up1 = replace_by_constant_term(up1); isl_upoly_free(up2); return up1; error: isl_upoly_free(up1); isl_upoly_free(up2); return NULL; } __isl_give struct isl_upoly *isl_upoly_cst_add_isl_int( __isl_take struct isl_upoly *up, isl_int v) { struct isl_upoly_cst *cst; up = isl_upoly_cow(up); if (!up) return NULL; cst = isl_upoly_as_cst(up); isl_int_addmul(cst->n, cst->d, v); return up; } __isl_give struct isl_upoly *isl_upoly_add_isl_int( __isl_take struct isl_upoly *up, isl_int v) { struct isl_upoly_rec *rec; if (!up) return NULL; if (isl_upoly_is_cst(up)) return isl_upoly_cst_add_isl_int(up, v); up = isl_upoly_cow(up); rec = isl_upoly_as_rec(up); if (!rec) goto error; rec->p[0] = isl_upoly_add_isl_int(rec->p[0], v); if (!rec->p[0]) goto error; return up; error: isl_upoly_free(up); return NULL; } __isl_give struct isl_upoly *isl_upoly_cst_mul_isl_int( __isl_take struct isl_upoly *up, isl_int v) { struct isl_upoly_cst *cst; if (isl_upoly_is_zero(up)) return up; up = isl_upoly_cow(up); if (!up) return NULL; cst = isl_upoly_as_cst(up); isl_int_mul(cst->n, cst->n, v); return up; } __isl_give struct isl_upoly *isl_upoly_mul_isl_int( __isl_take struct isl_upoly *up, isl_int v) { int i; struct isl_upoly_rec *rec; if (!up) return NULL; if (isl_upoly_is_cst(up)) return isl_upoly_cst_mul_isl_int(up, v); up = isl_upoly_cow(up); rec = isl_upoly_as_rec(up); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { rec->p[i] = isl_upoly_mul_isl_int(rec->p[i], v); if (!rec->p[i]) goto error; } return up; error: isl_upoly_free(up); return NULL; } /* Multiply the constant polynomial "up" by "v". */ static __isl_give struct isl_upoly *isl_upoly_cst_scale_val( __isl_take struct isl_upoly *up, __isl_keep isl_val *v) { struct isl_upoly_cst *cst; if (isl_upoly_is_zero(up)) return up; up = isl_upoly_cow(up); if (!up) return NULL; cst = isl_upoly_as_cst(up); isl_int_mul(cst->n, cst->n, v->n); isl_int_mul(cst->d, cst->d, v->d); isl_upoly_cst_reduce(cst); return up; } /* Multiply the polynomial "up" by "v". */ static __isl_give struct isl_upoly *isl_upoly_scale_val( __isl_take struct isl_upoly *up, __isl_keep isl_val *v) { int i; struct isl_upoly_rec *rec; if (!up) return NULL; if (isl_upoly_is_cst(up)) return isl_upoly_cst_scale_val(up, v); up = isl_upoly_cow(up); rec = isl_upoly_as_rec(up); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { rec->p[i] = isl_upoly_scale_val(rec->p[i], v); if (!rec->p[i]) goto error; } return up; error: isl_upoly_free(up); return NULL; } __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1, __isl_take struct isl_upoly *up2) { struct isl_upoly_cst *cst1; struct isl_upoly_cst *cst2; up1 = isl_upoly_cow(up1); if (!up1 || !up2) goto error; cst1 = isl_upoly_as_cst(up1); cst2 = isl_upoly_as_cst(up2); isl_int_mul(cst1->n, cst1->n, cst2->n); isl_int_mul(cst1->d, cst1->d, cst2->d); isl_upoly_cst_reduce(cst1); isl_upoly_free(up2); return up1; error: isl_upoly_free(up1); isl_upoly_free(up2); return NULL; } __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1, __isl_take struct isl_upoly *up2) { struct isl_upoly_rec *rec1; struct isl_upoly_rec *rec2; struct isl_upoly_rec *res = NULL; int i, j; int size; rec1 = isl_upoly_as_rec(up1); rec2 = isl_upoly_as_rec(up2); if (!rec1 || !rec2) goto error; size = rec1->n + rec2->n - 1; res = isl_upoly_alloc_rec(up1->ctx, up1->var, size); if (!res) goto error; for (i = 0; i < rec1->n; ++i) { res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]), isl_upoly_copy(rec1->p[i])); if (!res->p[i]) goto error; res->n++; } for (; i < size; ++i) { res->p[i] = isl_upoly_zero(up1->ctx); if (!res->p[i]) goto error; res->n++; } for (i = 0; i < rec1->n; ++i) { for (j = 1; j < rec2->n; ++j) { struct isl_upoly *up; up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]), isl_upoly_copy(rec1->p[i])); res->p[i + j] = isl_upoly_sum(res->p[i + j], up); if (!res->p[i + j]) goto error; } } isl_upoly_free(up1); isl_upoly_free(up2); return &res->up; error: isl_upoly_free(up1); isl_upoly_free(up2); isl_upoly_free(&res->up); return NULL; } __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1, __isl_take struct isl_upoly *up2) { if (!up1 || !up2) goto error; if (isl_upoly_is_nan(up1)) { isl_upoly_free(up2); return up1; } if (isl_upoly_is_nan(up2)) { isl_upoly_free(up1); return up2; } if (isl_upoly_is_zero(up1)) { isl_upoly_free(up2); return up1; } if (isl_upoly_is_zero(up2)) { isl_upoly_free(up1); return up2; } if (isl_upoly_is_one(up1)) { isl_upoly_free(up1); return up2; } if (isl_upoly_is_one(up2)) { isl_upoly_free(up2); return up1; } if (up1->var < up2->var) return isl_upoly_mul(up2, up1); if (up2->var < up1->var) { int i; struct isl_upoly_rec *rec; if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) { isl_ctx *ctx = up1->ctx; isl_upoly_free(up1); isl_upoly_free(up2); return isl_upoly_nan(ctx); } up1 = isl_upoly_cow(up1); rec = isl_upoly_as_rec(up1); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { rec->p[i] = isl_upoly_mul(rec->p[i], isl_upoly_copy(up2)); if (!rec->p[i]) goto error; } isl_upoly_free(up2); return up1; } if (isl_upoly_is_cst(up1)) return isl_upoly_mul_cst(up1, up2); return isl_upoly_mul_rec(up1, up2); error: isl_upoly_free(up1); isl_upoly_free(up2); return NULL; } __isl_give struct isl_upoly *isl_upoly_pow(__isl_take struct isl_upoly *up, unsigned power) { struct isl_upoly *res; if (!up) return NULL; if (power == 1) return up; if (power % 2) res = isl_upoly_copy(up); else res = isl_upoly_one(up->ctx); while (power >>= 1) { up = isl_upoly_mul(up, isl_upoly_copy(up)); if (power % 2) res = isl_upoly_mul(res, isl_upoly_copy(up)); } isl_upoly_free(up); return res; } __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_space *dim, unsigned n_div, __isl_take struct isl_upoly *up) { struct isl_qpolynomial *qp = NULL; unsigned total; if (!dim || !up) goto error; if (!isl_space_is_set(dim)) isl_die(isl_space_get_ctx(dim), isl_error_invalid, "domain of polynomial should be a set", goto error); total = isl_space_dim(dim, isl_dim_all); qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial); if (!qp) goto error; qp->ref = 1; qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div); if (!qp->div) goto error; qp->dim = dim; qp->upoly = up; return qp; error: isl_space_free(dim); isl_upoly_free(up); isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp) { if (!qp) return NULL; qp->ref++; return qp; } __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp) { struct isl_qpolynomial *dup; if (!qp) return NULL; dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row, isl_upoly_copy(qp->upoly)); if (!dup) return NULL; isl_mat_free(dup->div); dup->div = isl_mat_copy(qp->div); if (!dup->div) goto error; return dup; error: isl_qpolynomial_free(dup); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp) { if (!qp) return NULL; if (qp->ref == 1) return qp; qp->ref--; return isl_qpolynomial_dup(qp); } void *isl_qpolynomial_free(__isl_take isl_qpolynomial *qp) { if (!qp) return NULL; if (--qp->ref > 0) return NULL; isl_space_free(qp->dim); isl_mat_free(qp->div); isl_upoly_free(qp->upoly); free(qp); return NULL; } __isl_give struct isl_upoly *isl_upoly_var_pow(isl_ctx *ctx, int pos, int power) { int i; struct isl_upoly_rec *rec; struct isl_upoly_cst *cst; rec = isl_upoly_alloc_rec(ctx, pos, 1 + power); if (!rec) return NULL; for (i = 0; i < 1 + power; ++i) { rec->p[i] = isl_upoly_zero(ctx); if (!rec->p[i]) goto error; rec->n++; } cst = isl_upoly_as_cst(rec->p[power]); isl_int_set_si(cst->n, 1); return &rec->up; error: isl_upoly_free(&rec->up); return NULL; } /* r array maps original positions to new positions. */ static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up, int *r) { int i; struct isl_upoly_rec *rec; struct isl_upoly *base; struct isl_upoly *res; if (isl_upoly_is_cst(up)) return up; rec = isl_upoly_as_rec(up); if (!rec) goto error; isl_assert(up->ctx, rec->n >= 1, goto error); base = isl_upoly_var_pow(up->ctx, r[up->var], 1); res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r); for (i = rec->n - 2; i >= 0; --i) { res = isl_upoly_mul(res, isl_upoly_copy(base)); res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r)); } isl_upoly_free(base); isl_upoly_free(up); return res; error: isl_upoly_free(up); return NULL; } static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2) { int n_row, n_col; int equal; isl_assert(div1->ctx, div1->n_row >= div2->n_row && div1->n_col >= div2->n_col, return -1); if (div1->n_row == div2->n_row) return isl_mat_is_equal(div1, div2); n_row = div1->n_row; n_col = div1->n_col; div1->n_row = div2->n_row; div1->n_col = div2->n_col; equal = isl_mat_is_equal(div1, div2); div1->n_row = n_row; div1->n_col = n_col; return equal; } static int cmp_row(__isl_keep isl_mat *div, int i, int j) { int li, lj; li = isl_seq_last_non_zero(div->row[i], div->n_col); lj = isl_seq_last_non_zero(div->row[j], div->n_col); if (li != lj) return li - lj; return isl_seq_cmp(div->row[i], div->row[j], div->n_col); } struct isl_div_sort_info { isl_mat *div; int row; }; static int div_sort_cmp(const void *p1, const void *p2) { const struct isl_div_sort_info *i1, *i2; i1 = (const struct isl_div_sort_info *) p1; i2 = (const struct isl_div_sort_info *) p2; return cmp_row(i1->div, i1->row, i2->row); } /* Sort divs and remove duplicates. */ static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp) { int i; int skip; int len; struct isl_div_sort_info *array = NULL; int *pos = NULL, *at = NULL; int *reordering = NULL; unsigned div_pos; if (!qp) return NULL; if (qp->div->n_row <= 1) return qp; div_pos = isl_space_dim(qp->dim, isl_dim_all); array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info, qp->div->n_row); pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row); at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row); len = qp->div->n_col - 2; reordering = isl_alloc_array(qp->div->ctx, int, len); if (!array || !pos || !at || !reordering) goto error; for (i = 0; i < qp->div->n_row; ++i) { array[i].div = qp->div; array[i].row = i; pos[i] = i; at[i] = i; } qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info), div_sort_cmp); for (i = 0; i < div_pos; ++i) reordering[i] = i; for (i = 0; i < qp->div->n_row; ++i) { if (pos[array[i].row] == i) continue; qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]); pos[at[i]] = pos[array[i].row]; at[pos[array[i].row]] = at[i]; at[i] = array[i].row; pos[array[i].row] = i; } skip = 0; for (i = 0; i < len - div_pos; ++i) { if (i > 0 && isl_seq_eq(qp->div->row[i - skip - 1], qp->div->row[i - skip], qp->div->n_col)) { qp->div = isl_mat_drop_rows(qp->div, i - skip, 1); isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1, 2 + div_pos + i - skip); qp->div = isl_mat_drop_cols(qp->div, 2 + div_pos + i - skip, 1); skip++; } reordering[div_pos + array[i].row] = div_pos + i - skip; } qp->upoly = reorder(qp->upoly, reordering); if (!qp->upoly || !qp->div) goto error; free(at); free(pos); free(array); free(reordering); return qp; error: free(at); free(pos); free(array); free(reordering); isl_qpolynomial_free(qp); return NULL; } static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up, int *exp, int first) { int i; struct isl_upoly_rec *rec; if (isl_upoly_is_cst(up)) return up; if (up->var < first) return up; if (exp[up->var - first] == up->var - first) return up; up = isl_upoly_cow(up); if (!up) goto error; up->var = exp[up->var - first] + first; rec = isl_upoly_as_rec(up); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { rec->p[i] = expand(rec->p[i], exp, first); if (!rec->p[i]) goto error; } return up; error: isl_upoly_free(up); return NULL; } static __isl_give isl_qpolynomial *with_merged_divs( __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2), __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2) { int *exp1 = NULL; int *exp2 = NULL; isl_mat *div = NULL; int n_div1, n_div2; qp1 = isl_qpolynomial_cow(qp1); qp2 = isl_qpolynomial_cow(qp2); if (!qp1 || !qp2) goto error; isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row && qp1->div->n_col >= qp2->div->n_col, goto error); n_div1 = qp1->div->n_row; n_div2 = qp2->div->n_row; exp1 = isl_alloc_array(qp1->div->ctx, int, n_div1); exp2 = isl_alloc_array(qp2->div->ctx, int, n_div2); if ((n_div1 && !exp1) || (n_div2 && !exp2)) goto error; div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2); if (!div) goto error; isl_mat_free(qp1->div); qp1->div = isl_mat_copy(div); isl_mat_free(qp2->div); qp2->div = isl_mat_copy(div); qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2); qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2); if (!qp1->upoly || !qp2->upoly) goto error; isl_mat_free(div); free(exp1); free(exp2); return fn(qp1, qp2); error: isl_mat_free(div); free(exp1); free(exp2); isl_qpolynomial_free(qp1); isl_qpolynomial_free(qp2); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2) { qp1 = isl_qpolynomial_cow(qp1); if (!qp1 || !qp2) goto error; if (qp1->div->n_row < qp2->div->n_row) return isl_qpolynomial_add(qp2, qp1); isl_assert(qp1->dim->ctx, isl_space_is_equal(qp1->dim, qp2->dim), goto error); if (!compatible_divs(qp1->div, qp2->div)) return with_merged_divs(isl_qpolynomial_add, qp1, qp2); qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly)); if (!qp1->upoly) goto error; isl_qpolynomial_free(qp2); return qp1; error: isl_qpolynomial_free(qp1); isl_qpolynomial_free(qp2); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain( __isl_keep isl_set *dom, __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2) { qp1 = isl_qpolynomial_add(qp1, qp2); qp1 = isl_qpolynomial_gist(qp1, isl_set_copy(dom)); return qp1; } __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2) { return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2)); } __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int( __isl_take isl_qpolynomial *qp, isl_int v) { if (isl_int_is_zero(v)) return qp; qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; qp->upoly = isl_upoly_add_isl_int(qp->upoly, v); if (!qp->upoly) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp) { if (!qp) return NULL; return isl_qpolynomial_mul_isl_int(qp, qp->dim->ctx->negone); } __isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int( __isl_take isl_qpolynomial *qp, isl_int v) { if (isl_int_is_one(v)) return qp; if (qp && isl_int_is_zero(v)) { isl_qpolynomial *zero; zero = isl_qpolynomial_zero_on_domain(isl_space_copy(qp->dim)); isl_qpolynomial_free(qp); return zero; } qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; qp->upoly = isl_upoly_mul_isl_int(qp->upoly, v); if (!qp->upoly) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_scale( __isl_take isl_qpolynomial *qp, isl_int v) { return isl_qpolynomial_mul_isl_int(qp, v); } /* Multiply "qp" by "v". */ __isl_give isl_qpolynomial *isl_qpolynomial_scale_val( __isl_take isl_qpolynomial *qp, __isl_take isl_val *v) { if (!qp || !v) goto error; if (!isl_val_is_rat(v)) isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid, "expecting rational factor", goto error); if (isl_val_is_one(v)) { isl_val_free(v); return qp; } if (isl_val_is_zero(v)) { isl_space *space; space = isl_qpolynomial_get_domain_space(qp); isl_qpolynomial_free(qp); isl_val_free(v); return isl_qpolynomial_zero_on_domain(space); } qp = isl_qpolynomial_cow(qp); if (!qp) goto error; qp->upoly = isl_upoly_scale_val(qp->upoly, v); if (!qp->upoly) qp = isl_qpolynomial_free(qp); isl_val_free(v); return qp; error: isl_val_free(v); isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2) { qp1 = isl_qpolynomial_cow(qp1); if (!qp1 || !qp2) goto error; if (qp1->div->n_row < qp2->div->n_row) return isl_qpolynomial_mul(qp2, qp1); isl_assert(qp1->dim->ctx, isl_space_is_equal(qp1->dim, qp2->dim), goto error); if (!compatible_divs(qp1->div, qp2->div)) return with_merged_divs(isl_qpolynomial_mul, qp1, qp2); qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly)); if (!qp1->upoly) goto error; isl_qpolynomial_free(qp2); return qp1; error: isl_qpolynomial_free(qp1); isl_qpolynomial_free(qp2); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp, unsigned power) { qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; qp->upoly = isl_upoly_pow(qp->upoly, power); if (!qp->upoly) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_pow( __isl_take isl_pw_qpolynomial *pwqp, unsigned power) { int i; if (power == 1) return pwqp; pwqp = isl_pw_qpolynomial_cow(pwqp); if (!pwqp) return NULL; for (i = 0; i < pwqp->n; ++i) { pwqp->p[i].qp = isl_qpolynomial_pow(pwqp->p[i].qp, power); if (!pwqp->p[i].qp) return isl_pw_qpolynomial_free(pwqp); } return pwqp; } __isl_give isl_qpolynomial *isl_qpolynomial_zero_on_domain( __isl_take isl_space *dim) { if (!dim) return NULL; return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx)); } __isl_give isl_qpolynomial *isl_qpolynomial_one_on_domain( __isl_take isl_space *dim) { if (!dim) return NULL; return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx)); } __isl_give isl_qpolynomial *isl_qpolynomial_infty_on_domain( __isl_take isl_space *dim) { if (!dim) return NULL; return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx)); } __isl_give isl_qpolynomial *isl_qpolynomial_neginfty_on_domain( __isl_take isl_space *dim) { if (!dim) return NULL; return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx)); } __isl_give isl_qpolynomial *isl_qpolynomial_nan_on_domain( __isl_take isl_space *dim) { if (!dim) return NULL; return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx)); } __isl_give isl_qpolynomial *isl_qpolynomial_cst_on_domain( __isl_take isl_space *dim, isl_int v) { struct isl_qpolynomial *qp; struct isl_upoly_cst *cst; if (!dim) return NULL; qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx)); if (!qp) return NULL; cst = isl_upoly_as_cst(qp->upoly); isl_int_set(cst->n, v); return qp; } int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp, isl_int *n, isl_int *d) { struct isl_upoly_cst *cst; if (!qp) return -1; if (!isl_upoly_is_cst(qp->upoly)) return 0; cst = isl_upoly_as_cst(qp->upoly); if (!cst) return -1; if (n) isl_int_set(*n, cst->n); if (d) isl_int_set(*d, cst->d); return 1; } /* Return the constant term of "up". */ static __isl_give isl_val *isl_upoly_get_constant_val( __isl_keep struct isl_upoly *up) { struct isl_upoly_cst *cst; if (!up) return NULL; while (!isl_upoly_is_cst(up)) { struct isl_upoly_rec *rec; rec = isl_upoly_as_rec(up); if (!rec) return NULL; up = rec->p[0]; } cst = isl_upoly_as_cst(up); if (!cst) return NULL; return isl_val_rat_from_isl_int(cst->up.ctx, cst->n, cst->d); } /* Return the constant term of "qp". */ __isl_give isl_val *isl_qpolynomial_get_constant_val( __isl_keep isl_qpolynomial *qp) { if (!qp) return NULL; return isl_upoly_get_constant_val(qp->upoly); } int isl_upoly_is_affine(__isl_keep struct isl_upoly *up) { int is_cst; struct isl_upoly_rec *rec; if (!up) return -1; if (up->var < 0) return 1; rec = isl_upoly_as_rec(up); if (!rec) return -1; if (rec->n > 2) return 0; isl_assert(up->ctx, rec->n > 1, return -1); is_cst = isl_upoly_is_cst(rec->p[1]); if (is_cst < 0) return -1; if (!is_cst) return 0; return isl_upoly_is_affine(rec->p[0]); } int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp) { if (!qp) return -1; if (qp->div->n_row > 0) return 0; return isl_upoly_is_affine(qp->upoly); } static void update_coeff(__isl_keep isl_vec *aff, __isl_keep struct isl_upoly_cst *cst, int pos) { isl_int gcd; isl_int f; if (isl_int_is_zero(cst->n)) return; isl_int_init(gcd); isl_int_init(f); isl_int_gcd(gcd, cst->d, aff->el[0]); isl_int_divexact(f, cst->d, gcd); isl_int_divexact(gcd, aff->el[0], gcd); isl_seq_scale(aff->el, aff->el, f, aff->size); isl_int_mul(aff->el[1 + pos], gcd, cst->n); isl_int_clear(gcd); isl_int_clear(f); } int isl_upoly_update_affine(__isl_keep struct isl_upoly *up, __isl_keep isl_vec *aff) { struct isl_upoly_cst *cst; struct isl_upoly_rec *rec; if (!up || !aff) return -1; if (up->var < 0) { struct isl_upoly_cst *cst; cst = isl_upoly_as_cst(up); if (!cst) return -1; update_coeff(aff, cst, 0); return 0; } rec = isl_upoly_as_rec(up); if (!rec) return -1; isl_assert(up->ctx, rec->n == 2, return -1); cst = isl_upoly_as_cst(rec->p[1]); if (!cst) return -1; update_coeff(aff, cst, 1 + up->var); return isl_upoly_update_affine(rec->p[0], aff); } __isl_give isl_vec *isl_qpolynomial_extract_affine( __isl_keep isl_qpolynomial *qp) { isl_vec *aff; unsigned d; if (!qp) return NULL; d = isl_space_dim(qp->dim, isl_dim_all); aff = isl_vec_alloc(qp->div->ctx, 2 + d + qp->div->n_row); if (!aff) return NULL; isl_seq_clr(aff->el + 1, 1 + d + qp->div->n_row); isl_int_set_si(aff->el[0], 1); if (isl_upoly_update_affine(qp->upoly, aff) < 0) goto error; return aff; error: isl_vec_free(aff); return NULL; } int isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1, __isl_keep isl_qpolynomial *qp2) { int equal; if (!qp1 || !qp2) return -1; equal = isl_space_is_equal(qp1->dim, qp2->dim); if (equal < 0 || !equal) return equal; equal = isl_mat_is_equal(qp1->div, qp2->div); if (equal < 0 || !equal) return equal; return isl_upoly_is_equal(qp1->upoly, qp2->upoly); } static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d) { int i; struct isl_upoly_rec *rec; if (isl_upoly_is_cst(up)) { struct isl_upoly_cst *cst; cst = isl_upoly_as_cst(up); if (!cst) return; isl_int_lcm(*d, *d, cst->d); return; } rec = isl_upoly_as_rec(up); if (!rec) return; for (i = 0; i < rec->n; ++i) upoly_update_den(rec->p[i], d); } void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d) { isl_int_set_si(*d, 1); if (!qp) return; upoly_update_den(qp->upoly, d); } __isl_give isl_qpolynomial *isl_qpolynomial_var_pow_on_domain( __isl_take isl_space *dim, int pos, int power) { struct isl_ctx *ctx; if (!dim) return NULL; ctx = dim->ctx; return isl_qpolynomial_alloc(dim, 0, isl_upoly_var_pow(ctx, pos, power)); } __isl_give isl_qpolynomial *isl_qpolynomial_var_on_domain(__isl_take isl_space *dim, enum isl_dim_type type, unsigned pos) { if (!dim) return NULL; isl_assert(dim->ctx, isl_space_dim(dim, isl_dim_in) == 0, goto error); isl_assert(dim->ctx, pos < isl_space_dim(dim, type), goto error); if (type == isl_dim_set) pos += isl_space_dim(dim, isl_dim_param); return isl_qpolynomial_var_pow_on_domain(dim, pos, 1); error: isl_space_free(dim); return NULL; } __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up, unsigned first, unsigned n, __isl_keep struct isl_upoly **subs) { int i; struct isl_upoly_rec *rec; struct isl_upoly *base, *res; if (!up) return NULL; if (isl_upoly_is_cst(up)) return up; if (up->var < first) return up; rec = isl_upoly_as_rec(up); if (!rec) goto error; isl_assert(up->ctx, rec->n >= 1, goto error); if (up->var >= first + n) base = isl_upoly_var_pow(up->ctx, up->var, 1); else base = isl_upoly_copy(subs[up->var - first]); res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs); for (i = rec->n - 2; i >= 0; --i) { struct isl_upoly *t; t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs); res = isl_upoly_mul(res, isl_upoly_copy(base)); res = isl_upoly_sum(res, t); } isl_upoly_free(base); isl_upoly_free(up); return res; error: isl_upoly_free(up); return NULL; } __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f, isl_int denom, unsigned len) { int i; struct isl_upoly *up; isl_assert(ctx, len >= 1, return NULL); up = isl_upoly_rat_cst(ctx, f[0], denom); for (i = 0; i < len - 1; ++i) { struct isl_upoly *t; struct isl_upoly *c; if (isl_int_is_zero(f[1 + i])) continue; c = isl_upoly_rat_cst(ctx, f[1 + i], denom); t = isl_upoly_var_pow(ctx, i, 1); t = isl_upoly_mul(c, t); up = isl_upoly_sum(up, t); } return up; } /* Remove common factor of non-constant terms and denominator. */ static void normalize_div(__isl_keep isl_qpolynomial *qp, int div) { isl_ctx *ctx = qp->div->ctx; unsigned total = qp->div->n_col - 2; isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd); isl_int_gcd(ctx->normalize_gcd, ctx->normalize_gcd, qp->div->row[div][0]); if (isl_int_is_one(ctx->normalize_gcd)) return; isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2, ctx->normalize_gcd, total); isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0], ctx->normalize_gcd); isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1], ctx->normalize_gcd); } /* Replace the integer division identified by "div" by the polynomial "s". * The integer division is assumed not to appear in the definition * of any other integer divisions. */ static __isl_give isl_qpolynomial *substitute_div( __isl_take isl_qpolynomial *qp, int div, __isl_take struct isl_upoly *s) { int i; int total; int *reordering; if (!qp || !s) goto error; qp = isl_qpolynomial_cow(qp); if (!qp) goto error; total = isl_space_dim(qp->dim, isl_dim_all); qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s); if (!qp->upoly) goto error; reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row); if (!reordering) goto error; for (i = 0; i < total + div; ++i) reordering[i] = i; for (i = total + div + 1; i < total + qp->div->n_row; ++i) reordering[i] = i - 1; qp->div = isl_mat_drop_rows(qp->div, div, 1); qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1); qp->upoly = reorder(qp->upoly, reordering); free(reordering); if (!qp->upoly || !qp->div) goto error; isl_upoly_free(s); return qp; error: isl_qpolynomial_free(qp); isl_upoly_free(s); return NULL; } /* Replace all integer divisions [e/d] that turn out to not actually be integer * divisions because d is equal to 1 by their definition, i.e., e. */ static __isl_give isl_qpolynomial *substitute_non_divs( __isl_take isl_qpolynomial *qp) { int i, j; int total; struct isl_upoly *s; if (!qp) return NULL; total = isl_space_dim(qp->dim, isl_dim_all); for (i = 0; qp && i < qp->div->n_row; ++i) { if (!isl_int_is_one(qp->div->row[i][0])) continue; for (j = i + 1; j < qp->div->n_row; ++j) { if (isl_int_is_zero(qp->div->row[j][2 + total + i])) continue; isl_seq_combine(qp->div->row[j] + 1, qp->div->ctx->one, qp->div->row[j] + 1, qp->div->row[j][2 + total + i], qp->div->row[i] + 1, 1 + total + i); isl_int_set_si(qp->div->row[j][2 + total + i], 0); normalize_div(qp, j); } s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1, qp->div->row[i][0], qp->div->n_col - 1); qp = substitute_div(qp, i, s); --i; } return qp; } /* Reduce the coefficients of div "div" to lie in the interval [0, d-1], * with d the denominator. When replacing the coefficient e of x by * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x * inside the division, so we need to add floor(e/d) * x outside. * That is, we replace q by q' + floor(e/d) * x and we therefore need * to adjust the coefficient of x in each later div that depends on the * current div "div" and also in the affine expression "aff" * (if it too depends on "div"). */ static void reduce_div(__isl_keep isl_qpolynomial *qp, int div, __isl_keep isl_vec *aff) { int i, j; isl_int v; unsigned total = qp->div->n_col - qp->div->n_row - 2; isl_int_init(v); for (i = 0; i < 1 + total + div; ++i) { if (isl_int_is_nonneg(qp->div->row[div][1 + i]) && isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0])) continue; isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0]); isl_int_fdiv_r(qp->div->row[div][1 + i], qp->div->row[div][1 + i], qp->div->row[div][0]); if (!isl_int_is_zero(aff->el[1 + total + div])) isl_int_addmul(aff->el[i], v, aff->el[1 + total + div]); for (j = div + 1; j < qp->div->n_row; ++j) { if (isl_int_is_zero(qp->div->row[j][2 + total + div])) continue; isl_int_addmul(qp->div->row[j][1 + i], v, qp->div->row[j][2 + total + div]); } } isl_int_clear(v); } /* Check if the last non-zero coefficient is bigger that half of the * denominator. If so, we will invert the div to further reduce the number * of distinct divs that may appear. * If the last non-zero coefficient is exactly half the denominator, * then we continue looking for earlier coefficients that are bigger * than half the denominator. */ static int needs_invert(__isl_keep isl_mat *div, int row) { int i; int cmp; for (i = div->n_col - 1; i >= 1; --i) { if (isl_int_is_zero(div->row[row][i])) continue; isl_int_mul_ui(div->row[row][i], div->row[row][i], 2); cmp = isl_int_cmp(div->row[row][i], div->row[row][0]); isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2); if (cmp) return cmp > 0; if (i == 1) return 1; } return 0; } /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d]. * We only invert the coefficients of e (and the coefficient of q in * later divs and in "aff"). After calling this function, the * coefficients of e should be reduced again. */ static void invert_div(__isl_keep isl_qpolynomial *qp, int div, __isl_keep isl_vec *aff) { unsigned total = qp->div->n_col - qp->div->n_row - 2; isl_seq_neg(qp->div->row[div] + 1, qp->div->row[div] + 1, qp->div->n_col - 1); isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1); isl_int_add(qp->div->row[div][1], qp->div->row[div][1], qp->div->row[div][0]); if (!isl_int_is_zero(aff->el[1 + total + div])) isl_int_neg(aff->el[1 + total + div], aff->el[1 + total + div]); isl_mat_col_mul(qp->div, 2 + total + div, qp->div->ctx->negone, 2 + total + div); } /* Assuming "qp" is a monomial, reduce all its divs to have coefficients * in the interval [0, d-1], with d the denominator and such that the * last non-zero coefficient that is not equal to d/2 is smaller than d/2. * * After the reduction, some divs may have become redundant or identical, * so we call substitute_non_divs and sort_divs. If these functions * eliminate divs or merge two or more divs into one, the coefficients * of the enclosing divs may have to be reduced again, so we call * ourselves recursively if the number of divs decreases. */ static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp) { int i; isl_vec *aff = NULL; struct isl_upoly *s; unsigned n_div; if (!qp) return NULL; aff = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1); aff = isl_vec_clr(aff); if (!aff) goto error; isl_int_set_si(aff->el[1 + qp->upoly->var], 1); for (i = 0; i < qp->div->n_row; ++i) { normalize_div(qp, i); reduce_div(qp, i, aff); if (needs_invert(qp->div, i)) { invert_div(qp, i, aff); reduce_div(qp, i, aff); } } s = isl_upoly_from_affine(qp->div->ctx, aff->el, qp->div->ctx->one, aff->size); qp->upoly = isl_upoly_subs(qp->upoly, qp->upoly->var, 1, &s); isl_upoly_free(s); if (!qp->upoly) goto error; isl_vec_free(aff); n_div = qp->div->n_row; qp = substitute_non_divs(qp); qp = sort_divs(qp); if (qp && qp->div->n_row < n_div) return reduce_divs(qp); return qp; error: isl_qpolynomial_free(qp); isl_vec_free(aff); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst_on_domain( __isl_take isl_space *dim, const isl_int n, const isl_int d) { struct isl_qpolynomial *qp; struct isl_upoly_cst *cst; if (!dim) return NULL; qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx)); if (!qp) return NULL; cst = isl_upoly_as_cst(qp->upoly); isl_int_set(cst->n, n); isl_int_set(cst->d, d); return qp; } /* Return an isl_qpolynomial that is equal to "val" on domain space "domain". */ __isl_give isl_qpolynomial *isl_qpolynomial_val_on_domain( __isl_take isl_space *domain, __isl_take isl_val *val) { isl_qpolynomial *qp; struct isl_upoly_cst *cst; if (!domain || !val) goto error; qp = isl_qpolynomial_alloc(isl_space_copy(domain), 0, isl_upoly_zero(domain->ctx)); if (!qp) goto error; cst = isl_upoly_as_cst(qp->upoly); isl_int_set(cst->n, val->n); isl_int_set(cst->d, val->d); isl_space_free(domain); isl_val_free(val); return qp; error: isl_space_free(domain); isl_val_free(val); return NULL; } static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d) { struct isl_upoly_rec *rec; int i; if (!up) return -1; if (isl_upoly_is_cst(up)) return 0; if (up->var < d) active[up->var] = 1; rec = isl_upoly_as_rec(up); for (i = 0; i < rec->n; ++i) if (up_set_active(rec->p[i], active, d) < 0) return -1; return 0; } static int set_active(__isl_keep isl_qpolynomial *qp, int *active) { int i, j; int d = isl_space_dim(qp->dim, isl_dim_all); if (!qp || !active) return -1; for (i = 0; i < d; ++i) for (j = 0; j < qp->div->n_row; ++j) { if (isl_int_is_zero(qp->div->row[j][2 + i])) continue; active[i] = 1; break; } return up_set_active(qp->upoly, active, d); } int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n) { int i; int *active = NULL; int involves = 0; if (!qp) return -1; if (n == 0) return 0; isl_assert(qp->dim->ctx, first + n <= isl_qpolynomial_dim(qp, type), return -1); isl_assert(qp->dim->ctx, type == isl_dim_param || type == isl_dim_in, return -1); active = isl_calloc_array(qp->dim->ctx, int, isl_space_dim(qp->dim, isl_dim_all)); if (set_active(qp, active) < 0) goto error; if (type == isl_dim_in) first += isl_space_dim(qp->dim, isl_dim_param); for (i = 0; i < n; ++i) if (active[first + i]) { involves = 1; break; } free(active); return involves; error: free(active); return -1; } /* Remove divs that do not appear in the quasi-polynomial, nor in any * of the divs that do appear in the quasi-polynomial. */ static __isl_give isl_qpolynomial *remove_redundant_divs( __isl_take isl_qpolynomial *qp) { int i, j; int d; int len; int skip; int *active = NULL; int *reordering = NULL; int redundant = 0; int n_div; isl_ctx *ctx; if (!qp) return NULL; if (qp->div->n_row == 0) return qp; d = isl_space_dim(qp->dim, isl_dim_all); len = qp->div->n_col - 2; ctx = isl_qpolynomial_get_ctx(qp); active = isl_calloc_array(ctx, int, len); if (!active) goto error; if (up_set_active(qp->upoly, active, len) < 0) goto error; for (i = qp->div->n_row - 1; i >= 0; --i) { if (!active[d + i]) { redundant = 1; continue; } for (j = 0; j < i; ++j) { if (isl_int_is_zero(qp->div->row[i][2 + d + j])) continue; active[d + j] = 1; break; } } if (!redundant) { free(active); return qp; } reordering = isl_alloc_array(qp->div->ctx, int, len); if (!reordering) goto error; for (i = 0; i < d; ++i) reordering[i] = i; skip = 0; n_div = qp->div->n_row; for (i = 0; i < n_div; ++i) { if (!active[d + i]) { qp->div = isl_mat_drop_rows(qp->div, i - skip, 1); qp->div = isl_mat_drop_cols(qp->div, 2 + d + i - skip, 1); skip++; } reordering[d + i] = d + i - skip; } qp->upoly = reorder(qp->upoly, reordering); if (!qp->upoly || !qp->div) goto error; free(active); free(reordering); return qp; error: free(active); free(reordering); isl_qpolynomial_free(qp); return NULL; } __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up, unsigned first, unsigned n) { int i; struct isl_upoly_rec *rec; if (!up) return NULL; if (n == 0 || up->var < 0 || up->var < first) return up; if (up->var < first + n) { up = replace_by_constant_term(up); return isl_upoly_drop(up, first, n); } up = isl_upoly_cow(up); if (!up) return NULL; up->var -= n; rec = isl_upoly_as_rec(up); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { rec->p[i] = isl_upoly_drop(rec->p[i], first, n); if (!rec->p[i]) goto error; } return up; error: isl_upoly_free(up); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned pos, const char *s) { qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; qp->dim = isl_space_set_dim_name(qp->dim, type, pos, s); if (!qp->dim) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n) { if (!qp) return NULL; if (type == isl_dim_out) isl_die(qp->dim->ctx, isl_error_invalid, "cannot drop output/set dimension", goto error); if (type == isl_dim_in) type = isl_dim_set; if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type)) return qp; qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; isl_assert(qp->dim->ctx, first + n <= isl_space_dim(qp->dim, type), goto error); isl_assert(qp->dim->ctx, type == isl_dim_param || type == isl_dim_set, goto error); qp->dim = isl_space_drop_dims(qp->dim, type, first, n); if (!qp->dim) goto error; if (type == isl_dim_set) first += isl_space_dim(qp->dim, isl_dim_param); qp->div = isl_mat_drop_cols(qp->div, 2 + first, n); if (!qp->div) goto error; qp->upoly = isl_upoly_drop(qp->upoly, first, n); if (!qp->upoly) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } /* Project the domain of the quasi-polynomial onto its parameter space. * The quasi-polynomial may not involve any of the domain dimensions. */ __isl_give isl_qpolynomial *isl_qpolynomial_project_domain_on_params( __isl_take isl_qpolynomial *qp) { isl_space *space; unsigned n; int involves; n = isl_qpolynomial_dim(qp, isl_dim_in); involves = isl_qpolynomial_involves_dims(qp, isl_dim_in, 0, n); if (involves < 0) return isl_qpolynomial_free(qp); if (involves) isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid, "polynomial involves some of the domain dimensions", return isl_qpolynomial_free(qp)); qp = isl_qpolynomial_drop_dims(qp, isl_dim_in, 0, n); space = isl_qpolynomial_get_domain_space(qp); space = isl_space_params(space); qp = isl_qpolynomial_reset_domain_space(qp, space); return qp; } static __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities_lifted( __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq) { int i, j, k; isl_int denom; unsigned total; unsigned n_div; struct isl_upoly *up; if (!eq) goto error; if (eq->n_eq == 0) { isl_basic_set_free(eq); return qp; } qp = isl_qpolynomial_cow(qp); if (!qp) goto error; qp->div = isl_mat_cow(qp->div); if (!qp->div) goto error; total = 1 + isl_space_dim(eq->dim, isl_dim_all); n_div = eq->n_div; isl_int_init(denom); for (i = 0; i < eq->n_eq; ++i) { j = isl_seq_last_non_zero(eq->eq[i], total + n_div); if (j < 0 || j == 0 || j >= total) continue; for (k = 0; k < qp->div->n_row; ++k) { if (isl_int_is_zero(qp->div->row[k][1 + j])) continue; isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total, &qp->div->row[k][0]); normalize_div(qp, k); } if (isl_int_is_pos(eq->eq[i][j])) isl_seq_neg(eq->eq[i], eq->eq[i], total); isl_int_abs(denom, eq->eq[i][j]); isl_int_set_si(eq->eq[i][j], 0); up = isl_upoly_from_affine(qp->dim->ctx, eq->eq[i], denom, total); qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up); isl_upoly_free(up); } isl_int_clear(denom); if (!qp->upoly) goto error; isl_basic_set_free(eq); qp = substitute_non_divs(qp); qp = sort_divs(qp); return qp; error: isl_basic_set_free(eq); isl_qpolynomial_free(qp); return NULL; } /* Exploit the equalities in "eq" to simplify the quasi-polynomial. */ __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities( __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq) { if (!qp || !eq) goto error; if (qp->div->n_row > 0) eq = isl_basic_set_add_dims(eq, isl_dim_set, qp->div->n_row); return isl_qpolynomial_substitute_equalities_lifted(qp, eq); error: isl_basic_set_free(eq); isl_qpolynomial_free(qp); return NULL; } static __isl_give isl_basic_set *add_div_constraints( __isl_take isl_basic_set *bset, __isl_take isl_mat *div) { int i; unsigned total; if (!bset || !div) goto error; bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row); if (!bset) goto error; total = isl_basic_set_total_dim(bset); for (i = 0; i < div->n_row; ++i) if (isl_basic_set_add_div_constraints_var(bset, total - div->n_row + i, div->row[i]) < 0) goto error; isl_mat_free(div); return bset; error: isl_mat_free(div); isl_basic_set_free(bset); return NULL; } /* Look for equalities among the variables shared by context and qp * and the integer divisions of qp, if any. * The equalities are then used to eliminate variables and/or integer * divisions from qp. */ __isl_give isl_qpolynomial *isl_qpolynomial_gist( __isl_take isl_qpolynomial *qp, __isl_take isl_set *context) { isl_basic_set *aff; if (!qp) goto error; if (qp->div->n_row > 0) { isl_basic_set *bset; context = isl_set_add_dims(context, isl_dim_set, qp->div->n_row); bset = isl_basic_set_universe(isl_set_get_space(context)); bset = add_div_constraints(bset, isl_mat_copy(qp->div)); context = isl_set_intersect(context, isl_set_from_basic_set(bset)); } aff = isl_set_affine_hull(context); return isl_qpolynomial_substitute_equalities_lifted(qp, aff); error: isl_qpolynomial_free(qp); isl_set_free(context); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_gist_params( __isl_take isl_qpolynomial *qp, __isl_take isl_set *context) { isl_space *space = isl_qpolynomial_get_domain_space(qp); isl_set *dom_context = isl_set_universe(space); dom_context = isl_set_intersect_params(dom_context, context); return isl_qpolynomial_gist(qp, dom_context); } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_qpolynomial( __isl_take isl_qpolynomial *qp) { isl_set *dom; if (!qp) return NULL; if (isl_qpolynomial_is_zero(qp)) { isl_space *dim = isl_qpolynomial_get_space(qp); isl_qpolynomial_free(qp); return isl_pw_qpolynomial_zero(dim); } dom = isl_set_universe(isl_qpolynomial_get_domain_space(qp)); return isl_pw_qpolynomial_alloc(dom, qp); } #undef PW #define PW isl_pw_qpolynomial #undef EL #define EL isl_qpolynomial #undef EL_IS_ZERO #define EL_IS_ZERO is_zero #undef ZERO #define ZERO zero #undef IS_ZERO #define IS_ZERO is_zero #undef FIELD #define FIELD qp #undef DEFAULT_IS_ZERO #define DEFAULT_IS_ZERO 1 #define NO_PULLBACK #include #undef UNION #define UNION isl_union_pw_qpolynomial #undef PART #define PART isl_pw_qpolynomial #undef PARTS #define PARTS pw_qpolynomial #define ALIGN_DOMAIN #include int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp) { if (!pwqp) return -1; if (pwqp->n != -1) return 0; if (!isl_set_plain_is_universe(pwqp->p[0].set)) return 0; return isl_qpolynomial_is_one(pwqp->p[0].qp); } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2) { return isl_pw_qpolynomial_union_add_(pwqp1, pwqp2); } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul( __isl_take isl_pw_qpolynomial *pwqp1, __isl_take isl_pw_qpolynomial *pwqp2) { int i, j, n; struct isl_pw_qpolynomial *res; if (!pwqp1 || !pwqp2) goto error; isl_assert(pwqp1->dim->ctx, isl_space_is_equal(pwqp1->dim, pwqp2->dim), goto error); if (isl_pw_qpolynomial_is_zero(pwqp1)) { isl_pw_qpolynomial_free(pwqp2); return pwqp1; } if (isl_pw_qpolynomial_is_zero(pwqp2)) { isl_pw_qpolynomial_free(pwqp1); return pwqp2; } if (isl_pw_qpolynomial_is_one(pwqp1)) { isl_pw_qpolynomial_free(pwqp1); return pwqp2; } if (isl_pw_qpolynomial_is_one(pwqp2)) { isl_pw_qpolynomial_free(pwqp2); return pwqp1; } n = pwqp1->n * pwqp2->n; res = isl_pw_qpolynomial_alloc_size(isl_space_copy(pwqp1->dim), n); for (i = 0; i < pwqp1->n; ++i) { for (j = 0; j < pwqp2->n; ++j) { struct isl_set *common; struct isl_qpolynomial *prod; common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set), isl_set_copy(pwqp2->p[j].set)); if (isl_set_plain_is_empty(common)) { isl_set_free(common); continue; } prod = isl_qpolynomial_mul( isl_qpolynomial_copy(pwqp1->p[i].qp), isl_qpolynomial_copy(pwqp2->p[j].qp)); res = isl_pw_qpolynomial_add_piece(res, common, prod); } } isl_pw_qpolynomial_free(pwqp1); isl_pw_qpolynomial_free(pwqp2); return res; error: isl_pw_qpolynomial_free(pwqp1); isl_pw_qpolynomial_free(pwqp2); return NULL; } __isl_give struct isl_upoly *isl_upoly_eval( __isl_take struct isl_upoly *up, __isl_take isl_vec *vec) { int i; struct isl_upoly_rec *rec; struct isl_upoly *res; struct isl_upoly *base; if (isl_upoly_is_cst(up)) { isl_vec_free(vec); return up; } rec = isl_upoly_as_rec(up); if (!rec) goto error; isl_assert(up->ctx, rec->n >= 1, goto error); base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]); res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]), isl_vec_copy(vec)); for (i = rec->n - 2; i >= 0; --i) { res = isl_upoly_mul(res, isl_upoly_copy(base)); res = isl_upoly_sum(res, isl_upoly_eval(isl_upoly_copy(rec->p[i]), isl_vec_copy(vec))); } isl_upoly_free(base); isl_upoly_free(up); isl_vec_free(vec); return res; error: isl_upoly_free(up); isl_vec_free(vec); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_eval( __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt) { isl_vec *ext; struct isl_upoly *up; isl_space *dim; if (!qp || !pnt) goto error; isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, qp->dim), goto error); if (qp->div->n_row == 0) ext = isl_vec_copy(pnt->vec); else { int i; unsigned dim = isl_space_dim(qp->dim, isl_dim_all); ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row); if (!ext) goto error; isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size); for (i = 0; i < qp->div->n_row; ++i) { isl_seq_inner_product(qp->div->row[i] + 1, ext->el, 1 + dim + i, &ext->el[1+dim+i]); isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i], qp->div->row[i][0]); } } up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext); if (!up) goto error; dim = isl_space_copy(qp->dim); isl_qpolynomial_free(qp); isl_point_free(pnt); return isl_qpolynomial_alloc(dim, 0, up); error: isl_qpolynomial_free(qp); isl_point_free(pnt); return NULL; } int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1, __isl_keep struct isl_upoly_cst *cst2) { int cmp; isl_int t; isl_int_init(t); isl_int_mul(t, cst1->n, cst2->d); isl_int_submul(t, cst2->n, cst1->d); cmp = isl_int_sgn(t); isl_int_clear(t); return cmp; } int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1, __isl_keep isl_qpolynomial *qp2) { struct isl_upoly_cst *cst1, *cst2; if (!qp1 || !qp2) return -1; isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1); isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1); if (isl_qpolynomial_is_nan(qp1)) return -1; if (isl_qpolynomial_is_nan(qp2)) return -1; cst1 = isl_upoly_as_cst(qp1->upoly); cst2 = isl_upoly_as_cst(qp2->upoly); return isl_upoly_cmp(cst1, cst2) <= 0; } __isl_give isl_qpolynomial *isl_qpolynomial_min_cst( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2) { struct isl_upoly_cst *cst1, *cst2; int cmp; if (!qp1 || !qp2) goto error; isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error); isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error); cst1 = isl_upoly_as_cst(qp1->upoly); cst2 = isl_upoly_as_cst(qp2->upoly); cmp = isl_upoly_cmp(cst1, cst2); if (cmp <= 0) { isl_qpolynomial_free(qp2); } else { isl_qpolynomial_free(qp1); qp1 = qp2; } return qp1; error: isl_qpolynomial_free(qp1); isl_qpolynomial_free(qp2); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_max_cst( __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2) { struct isl_upoly_cst *cst1, *cst2; int cmp; if (!qp1 || !qp2) goto error; isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error); isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error); cst1 = isl_upoly_as_cst(qp1->upoly); cst2 = isl_upoly_as_cst(qp2->upoly); cmp = isl_upoly_cmp(cst1, cst2); if (cmp >= 0) { isl_qpolynomial_free(qp2); } else { isl_qpolynomial_free(qp1); qp1 = qp2; } return qp1; error: isl_qpolynomial_free(qp1); isl_qpolynomial_free(qp2); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n) { unsigned total; unsigned g_pos; int *exp; if (!qp) return NULL; if (type == isl_dim_out) isl_die(qp->div->ctx, isl_error_invalid, "cannot insert output/set dimensions", goto error); if (type == isl_dim_in) type = isl_dim_set; if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type)) return qp; qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; isl_assert(qp->div->ctx, first <= isl_space_dim(qp->dim, type), goto error); g_pos = pos(qp->dim, type) + first; qp->div = isl_mat_insert_zero_cols(qp->div, 2 + g_pos, n); if (!qp->div) goto error; total = qp->div->n_col - 2; if (total > g_pos) { int i; exp = isl_alloc_array(qp->div->ctx, int, total - g_pos); if (!exp) goto error; for (i = 0; i < total - g_pos; ++i) exp[i] = i + n; qp->upoly = expand(qp->upoly, exp, g_pos); free(exp); if (!qp->upoly) goto error; } qp->dim = isl_space_insert_dims(qp->dim, type, first, n); if (!qp->dim) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_add_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n) { unsigned pos; pos = isl_qpolynomial_dim(qp, type); return isl_qpolynomial_insert_dims(qp, type, pos, n); } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims( __isl_take isl_pw_qpolynomial *pwqp, enum isl_dim_type type, unsigned n) { unsigned pos; pos = isl_pw_qpolynomial_dim(pwqp, type); return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n); } static int *reordering_move(isl_ctx *ctx, unsigned len, unsigned dst, unsigned src, unsigned n) { int i; int *reordering; reordering = isl_alloc_array(ctx, int, len); if (!reordering) return NULL; if (dst <= src) { for (i = 0; i < dst; ++i) reordering[i] = i; for (i = 0; i < n; ++i) reordering[src + i] = dst + i; for (i = 0; i < src - dst; ++i) reordering[dst + i] = dst + n + i; for (i = 0; i < len - src - n; ++i) reordering[src + n + i] = src + n + i; } else { for (i = 0; i < src; ++i) reordering[i] = i; for (i = 0; i < n; ++i) reordering[src + i] = dst + i; for (i = 0; i < dst - src; ++i) reordering[src + n + i] = src + i; for (i = 0; i < len - dst - n; ++i) reordering[dst + n + i] = dst + n + i; } return reordering; } __isl_give isl_qpolynomial *isl_qpolynomial_move_dims( __isl_take isl_qpolynomial *qp, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { unsigned g_dst_pos; unsigned g_src_pos; int *reordering; if (n == 0) return qp; qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; if (dst_type == isl_dim_out || src_type == isl_dim_out) isl_die(qp->dim->ctx, isl_error_invalid, "cannot move output/set dimension", goto error); if (dst_type == isl_dim_in) dst_type = isl_dim_set; if (src_type == isl_dim_in) src_type = isl_dim_set; isl_assert(qp->dim->ctx, src_pos + n <= isl_space_dim(qp->dim, src_type), goto error); g_dst_pos = pos(qp->dim, dst_type) + dst_pos; g_src_pos = pos(qp->dim, src_type) + src_pos; if (dst_type > src_type) g_dst_pos -= n; qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n); if (!qp->div) goto error; qp = sort_divs(qp); if (!qp) goto error; reordering = reordering_move(qp->dim->ctx, qp->div->n_col - 2, g_dst_pos, g_src_pos, n); if (!reordering) goto error; qp->upoly = reorder(qp->upoly, reordering); free(reordering); if (!qp->upoly) goto error; qp->dim = isl_space_move_dims(qp->dim, dst_type, dst_pos, src_type, src_pos, n); if (!qp->dim) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_space *dim, isl_int *f, isl_int denom) { struct isl_upoly *up; dim = isl_space_domain(dim); if (!dim) return NULL; up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_space_dim(dim, isl_dim_all)); return isl_qpolynomial_alloc(dim, 0, up); } __isl_give isl_qpolynomial *isl_qpolynomial_from_aff(__isl_take isl_aff *aff) { isl_ctx *ctx; struct isl_upoly *up; isl_qpolynomial *qp; if (!aff) return NULL; ctx = isl_aff_get_ctx(aff); up = isl_upoly_from_affine(ctx, aff->v->el + 1, aff->v->el[0], aff->v->size - 1); qp = isl_qpolynomial_alloc(isl_aff_get_domain_space(aff), aff->ls->div->n_row, up); if (!qp) goto error; isl_mat_free(qp->div); qp->div = isl_mat_copy(aff->ls->div); qp->div = isl_mat_cow(qp->div); if (!qp->div) goto error; isl_aff_free(aff); qp = reduce_divs(qp); qp = remove_redundant_divs(qp); return qp; error: isl_aff_free(aff); return NULL; } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_pw_aff( __isl_take isl_pw_aff *pwaff) { int i; isl_pw_qpolynomial *pwqp; if (!pwaff) return NULL; pwqp = isl_pw_qpolynomial_alloc_size(isl_pw_aff_get_space(pwaff), pwaff->n); for (i = 0; i < pwaff->n; ++i) { isl_set *dom; isl_qpolynomial *qp; dom = isl_set_copy(pwaff->p[i].set); qp = isl_qpolynomial_from_aff(isl_aff_copy(pwaff->p[i].aff)); pwqp = isl_pw_qpolynomial_add_piece(pwqp, dom, qp); } isl_pw_aff_free(pwaff); return pwqp; } __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint( __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos) { isl_aff *aff; aff = isl_constraint_get_bound(c, type, pos); isl_constraint_free(c); return isl_qpolynomial_from_aff(aff); } /* For each 0 <= i < "n", replace variable "first" + i of type "type" * in "qp" by subs[i]. */ __isl_give isl_qpolynomial *isl_qpolynomial_substitute( __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned first, unsigned n, __isl_keep isl_qpolynomial **subs) { int i; struct isl_upoly **ups; if (n == 0) return qp; qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; if (type == isl_dim_out) isl_die(qp->dim->ctx, isl_error_invalid, "cannot substitute output/set dimension", goto error); if (type == isl_dim_in) type = isl_dim_set; for (i = 0; i < n; ++i) if (!subs[i]) goto error; isl_assert(qp->dim->ctx, first + n <= isl_space_dim(qp->dim, type), goto error); for (i = 0; i < n; ++i) isl_assert(qp->dim->ctx, isl_space_is_equal(qp->dim, subs[i]->dim), goto error); isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error); for (i = 0; i < n; ++i) isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error); first += pos(qp->dim, type); ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n); if (!ups) goto error; for (i = 0; i < n; ++i) ups[i] = subs[i]->upoly; qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups); free(ups); if (!qp->upoly) goto error; return qp; error: isl_qpolynomial_free(qp); return NULL; } /* Extend "bset" with extra set dimensions for each integer division * in "qp" and then call "fn" with the extended bset and the polynomial * that results from replacing each of the integer divisions by the * corresponding extra set dimension. */ int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp, __isl_keep isl_basic_set *bset, int (*fn)(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, void *user), void *user) { isl_space *dim; isl_mat *div; isl_qpolynomial *poly; if (!qp || !bset) goto error; if (qp->div->n_row == 0) return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp), user); div = isl_mat_copy(qp->div); dim = isl_space_copy(qp->dim); dim = isl_space_add_dims(dim, isl_dim_set, qp->div->n_row); poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly)); bset = isl_basic_set_copy(bset); bset = isl_basic_set_add_dims(bset, isl_dim_set, qp->div->n_row); bset = add_div_constraints(bset, div); return fn(bset, poly, user); error: return -1; } /* Return total degree in variables first (inclusive) up to last (exclusive). */ int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last) { int deg = -1; int i; struct isl_upoly_rec *rec; if (!up) return -2; if (isl_upoly_is_zero(up)) return -1; if (isl_upoly_is_cst(up) || up->var < first) return 0; rec = isl_upoly_as_rec(up); if (!rec) return -2; for (i = 0; i < rec->n; ++i) { int d; if (isl_upoly_is_zero(rec->p[i])) continue; d = isl_upoly_degree(rec->p[i], first, last); if (up->var < last) d += i; if (d > deg) deg = d; } return deg; } /* Return total degree in set variables. */ int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly) { unsigned ovar; unsigned nvar; if (!poly) return -2; ovar = isl_space_offset(poly->dim, isl_dim_set); nvar = isl_space_dim(poly->dim, isl_dim_set); return isl_upoly_degree(poly->upoly, ovar, ovar + nvar); } __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up, unsigned pos, int deg) { int i; struct isl_upoly_rec *rec; if (!up) return NULL; if (isl_upoly_is_cst(up) || up->var < pos) { if (deg == 0) return isl_upoly_copy(up); else return isl_upoly_zero(up->ctx); } rec = isl_upoly_as_rec(up); if (!rec) return NULL; if (up->var == pos) { if (deg < rec->n) return isl_upoly_copy(rec->p[deg]); else return isl_upoly_zero(up->ctx); } up = isl_upoly_copy(up); up = isl_upoly_cow(up); rec = isl_upoly_as_rec(up); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { struct isl_upoly *t; t = isl_upoly_coeff(rec->p[i], pos, deg); if (!t) goto error; isl_upoly_free(rec->p[i]); rec->p[i] = t; } return up; error: isl_upoly_free(up); return NULL; } /* Return coefficient of power "deg" of variable "t_pos" of type "type". */ __isl_give isl_qpolynomial *isl_qpolynomial_coeff( __isl_keep isl_qpolynomial *qp, enum isl_dim_type type, unsigned t_pos, int deg) { unsigned g_pos; struct isl_upoly *up; isl_qpolynomial *c; if (!qp) return NULL; if (type == isl_dim_out) isl_die(qp->div->ctx, isl_error_invalid, "output/set dimension does not have a coefficient", return NULL); if (type == isl_dim_in) type = isl_dim_set; isl_assert(qp->div->ctx, t_pos < isl_space_dim(qp->dim, type), return NULL); g_pos = pos(qp->dim, type) + t_pos; up = isl_upoly_coeff(qp->upoly, g_pos, deg); c = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row, up); if (!c) return NULL; isl_mat_free(c->div); c->div = isl_mat_copy(qp->div); if (!c->div) goto error; return c; error: isl_qpolynomial_free(c); return NULL; } /* Homogenize the polynomial in the variables first (inclusive) up to * last (exclusive) by inserting powers of variable first. * Variable first is assumed not to appear in the input. */ __isl_give struct isl_upoly *isl_upoly_homogenize( __isl_take struct isl_upoly *up, int deg, int target, int first, int last) { int i; struct isl_upoly_rec *rec; if (!up) return NULL; if (isl_upoly_is_zero(up)) return up; if (deg == target) return up; if (isl_upoly_is_cst(up) || up->var < first) { struct isl_upoly *hom; hom = isl_upoly_var_pow(up->ctx, first, target - deg); if (!hom) goto error; rec = isl_upoly_as_rec(hom); rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up); return hom; } up = isl_upoly_cow(up); rec = isl_upoly_as_rec(up); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { if (isl_upoly_is_zero(rec->p[i])) continue; rec->p[i] = isl_upoly_homogenize(rec->p[i], up->var < last ? deg + i : i, target, first, last); if (!rec->p[i]) goto error; } return up; error: isl_upoly_free(up); return NULL; } /* Homogenize the polynomial in the set variables by introducing * powers of an extra set variable at position 0. */ __isl_give isl_qpolynomial *isl_qpolynomial_homogenize( __isl_take isl_qpolynomial *poly) { unsigned ovar; unsigned nvar; int deg = isl_qpolynomial_degree(poly); if (deg < -1) goto error; poly = isl_qpolynomial_insert_dims(poly, isl_dim_in, 0, 1); poly = isl_qpolynomial_cow(poly); if (!poly) goto error; ovar = isl_space_offset(poly->dim, isl_dim_set); nvar = isl_space_dim(poly->dim, isl_dim_set); poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg, ovar, ovar + nvar); if (!poly->upoly) goto error; return poly; error: isl_qpolynomial_free(poly); return NULL; } __isl_give isl_term *isl_term_alloc(__isl_take isl_space *dim, __isl_take isl_mat *div) { isl_term *term; int n; if (!dim || !div) goto error; n = isl_space_dim(dim, isl_dim_all) + div->n_row; term = isl_calloc(dim->ctx, struct isl_term, sizeof(struct isl_term) + (n - 1) * sizeof(int)); if (!term) goto error; term->ref = 1; term->dim = dim; term->div = div; isl_int_init(term->n); isl_int_init(term->d); return term; error: isl_space_free(dim); isl_mat_free(div); return NULL; } __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term) { if (!term) return NULL; term->ref++; return term; } __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term) { int i; isl_term *dup; unsigned total; if (!term) return NULL; total = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row; dup = isl_term_alloc(isl_space_copy(term->dim), isl_mat_copy(term->div)); if (!dup) return NULL; isl_int_set(dup->n, term->n); isl_int_set(dup->d, term->d); for (i = 0; i < total; ++i) dup->pow[i] = term->pow[i]; return dup; } __isl_give isl_term *isl_term_cow(__isl_take isl_term *term) { if (!term) return NULL; if (term->ref == 1) return term; term->ref--; return isl_term_dup(term); } void isl_term_free(__isl_take isl_term *term) { if (!term) return; if (--term->ref > 0) return; isl_space_free(term->dim); isl_mat_free(term->div); isl_int_clear(term->n); isl_int_clear(term->d); free(term); } unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type) { if (!term) return 0; switch (type) { case isl_dim_param: case isl_dim_in: case isl_dim_out: return isl_space_dim(term->dim, type); case isl_dim_div: return term->div->n_row; case isl_dim_all: return isl_space_dim(term->dim, isl_dim_all) + term->div->n_row; default: return 0; } } isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term) { return term ? term->dim->ctx : NULL; } void isl_term_get_num(__isl_keep isl_term *term, isl_int *n) { if (!term) return; isl_int_set(*n, term->n); } void isl_term_get_den(__isl_keep isl_term *term, isl_int *d) { if (!term) return; isl_int_set(*d, term->d); } /* Return the coefficient of the term "term". */ __isl_give isl_val *isl_term_get_coefficient_val(__isl_keep isl_term *term) { if (!term) return NULL; return isl_val_rat_from_isl_int(isl_term_get_ctx(term), term->n, term->d); } int isl_term_get_exp(__isl_keep isl_term *term, enum isl_dim_type type, unsigned pos) { if (!term) return -1; isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1); if (type >= isl_dim_set) pos += isl_space_dim(term->dim, isl_dim_param); if (type >= isl_dim_div) pos += isl_space_dim(term->dim, isl_dim_set); return term->pow[pos]; } __isl_give isl_aff *isl_term_get_div(__isl_keep isl_term *term, unsigned pos) { isl_local_space *ls; isl_aff *aff; if (!term) return NULL; isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div), return NULL); ls = isl_local_space_alloc_div(isl_space_copy(term->dim), isl_mat_copy(term->div)); aff = isl_aff_alloc(ls); if (!aff) return NULL; isl_seq_cpy(aff->v->el, term->div->row[pos], aff->v->size); aff = isl_aff_normalize(aff); return aff; } __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up, int (*fn)(__isl_take isl_term *term, void *user), __isl_take isl_term *term, void *user) { int i; struct isl_upoly_rec *rec; if (!up || !term) goto error; if (isl_upoly_is_zero(up)) return term; isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error); isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error); isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error); if (isl_upoly_is_cst(up)) { struct isl_upoly_cst *cst; cst = isl_upoly_as_cst(up); if (!cst) goto error; term = isl_term_cow(term); if (!term) goto error; isl_int_set(term->n, cst->n); isl_int_set(term->d, cst->d); if (fn(isl_term_copy(term), user) < 0) goto error; return term; } rec = isl_upoly_as_rec(up); if (!rec) goto error; for (i = 0; i < rec->n; ++i) { term = isl_term_cow(term); if (!term) goto error; term->pow[up->var] = i; term = isl_upoly_foreach_term(rec->p[i], fn, term, user); if (!term) goto error; } term->pow[up->var] = 0; return term; error: isl_term_free(term); return NULL; } int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp, int (*fn)(__isl_take isl_term *term, void *user), void *user) { isl_term *term; if (!qp) return -1; term = isl_term_alloc(isl_space_copy(qp->dim), isl_mat_copy(qp->div)); if (!term) return -1; term = isl_upoly_foreach_term(qp->upoly, fn, term, user); isl_term_free(term); return term ? 0 : -1; } __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term) { struct isl_upoly *up; isl_qpolynomial *qp; int i, n; if (!term) return NULL; n = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row; up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d); for (i = 0; i < n; ++i) { if (!term->pow[i]) continue; up = isl_upoly_mul(up, isl_upoly_var_pow(term->dim->ctx, i, term->pow[i])); } qp = isl_qpolynomial_alloc(isl_space_copy(term->dim), term->div->n_row, up); if (!qp) goto error; isl_mat_free(qp->div); qp->div = isl_mat_copy(term->div); if (!qp->div) goto error; isl_term_free(term); return qp; error: isl_qpolynomial_free(qp); isl_term_free(term); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp, __isl_take isl_space *dim) { int i; int extra; unsigned total; if (!qp || !dim) goto error; if (isl_space_is_equal(qp->dim, dim)) { isl_space_free(dim); return qp; } qp = isl_qpolynomial_cow(qp); if (!qp) goto error; extra = isl_space_dim(dim, isl_dim_set) - isl_space_dim(qp->dim, isl_dim_set); total = isl_space_dim(qp->dim, isl_dim_all); if (qp->div->n_row) { int *exp; exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row); if (!exp) goto error; for (i = 0; i < qp->div->n_row; ++i) exp[i] = extra + i; qp->upoly = expand(qp->upoly, exp, total); free(exp); if (!qp->upoly) goto error; } qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra); if (!qp->div) goto error; for (i = 0; i < qp->div->n_row; ++i) isl_seq_clr(qp->div->row[i] + 2 + total, extra); isl_space_free(qp->dim); qp->dim = dim; return qp; error: isl_space_free(dim); isl_qpolynomial_free(qp); return NULL; } /* For each parameter or variable that does not appear in qp, * first eliminate the variable from all constraints and then set it to zero. */ static __isl_give isl_set *fix_inactive(__isl_take isl_set *set, __isl_keep isl_qpolynomial *qp) { int *active = NULL; int i; int d; unsigned nparam; unsigned nvar; if (!set || !qp) goto error; d = isl_space_dim(set->dim, isl_dim_all); active = isl_calloc_array(set->ctx, int, d); if (set_active(qp, active) < 0) goto error; for (i = 0; i < d; ++i) if (!active[i]) break; if (i == d) { free(active); return set; } nparam = isl_space_dim(set->dim, isl_dim_param); nvar = isl_space_dim(set->dim, isl_dim_set); for (i = 0; i < nparam; ++i) { if (active[i]) continue; set = isl_set_eliminate(set, isl_dim_param, i, 1); set = isl_set_fix_si(set, isl_dim_param, i, 0); } for (i = 0; i < nvar; ++i) { if (active[nparam + i]) continue; set = isl_set_eliminate(set, isl_dim_set, i, 1); set = isl_set_fix_si(set, isl_dim_set, i, 0); } free(active); return set; error: free(active); isl_set_free(set); return NULL; } struct isl_opt_data { isl_qpolynomial *qp; int first; isl_qpolynomial *opt; int max; }; static int opt_fn(__isl_take isl_point *pnt, void *user) { struct isl_opt_data *data = (struct isl_opt_data *)user; isl_qpolynomial *val; val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt); if (data->first) { data->first = 0; data->opt = val; } else if (data->max) { data->opt = isl_qpolynomial_max_cst(data->opt, val); } else { data->opt = isl_qpolynomial_min_cst(data->opt, val); } return 0; } __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max) { struct isl_opt_data data = { NULL, 1, NULL, max }; if (!set || !qp) goto error; if (isl_upoly_is_cst(qp->upoly)) { isl_set_free(set); return qp; } set = fix_inactive(set, qp); data.qp = qp; if (isl_set_foreach_point(set, opt_fn, &data) < 0) goto error; if (data.first) { isl_space *space = isl_qpolynomial_get_domain_space(qp); data.opt = isl_qpolynomial_zero_on_domain(space); } isl_set_free(set); isl_qpolynomial_free(qp); return data.opt; error: isl_set_free(set); isl_qpolynomial_free(qp); isl_qpolynomial_free(data.opt); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_morph_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_morph *morph) { int i; int n_sub; isl_ctx *ctx; struct isl_upoly **subs; isl_mat *mat, *diag; qp = isl_qpolynomial_cow(qp); if (!qp || !morph) goto error; ctx = qp->dim->ctx; isl_assert(ctx, isl_space_is_equal(qp->dim, morph->dom->dim), goto error); n_sub = morph->inv->n_row - 1; if (morph->inv->n_row != morph->inv->n_col) n_sub += qp->div->n_row; subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub); if (n_sub && !subs) goto error; for (i = 0; 1 + i < morph->inv->n_row; ++i) subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i], morph->inv->row[0][0], morph->inv->n_col); if (morph->inv->n_row != morph->inv->n_col) for (i = 0; i < qp->div->n_row; ++i) subs[morph->inv->n_row - 1 + i] = isl_upoly_var_pow(ctx, morph->inv->n_col - 1 + i, 1); qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs); for (i = 0; i < n_sub; ++i) isl_upoly_free(subs[i]); free(subs); diag = isl_mat_diag(ctx, 1, morph->inv->row[0][0]); mat = isl_mat_diagonal(diag, isl_mat_copy(morph->inv)); diag = isl_mat_diag(ctx, qp->div->n_row, morph->inv->row[0][0]); mat = isl_mat_diagonal(mat, diag); qp->div = isl_mat_product(qp->div, mat); isl_space_free(qp->dim); qp->dim = isl_space_copy(morph->ran->dim); if (!qp->upoly || !qp->div || !qp->dim) goto error; isl_morph_free(morph); return qp; error: isl_qpolynomial_free(qp); isl_morph_free(morph); return NULL; } static int neg_entry(void **entry, void *user) { isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry; *pwqp = isl_pw_qpolynomial_neg(*pwqp); return *pwqp ? 0 : -1; } __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg( __isl_take isl_union_pw_qpolynomial *upwqp) { upwqp = isl_union_pw_qpolynomial_cow(upwqp); if (!upwqp) return NULL; if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table, &neg_entry, NULL) < 0) goto error; return upwqp; error: isl_union_pw_qpolynomial_free(upwqp); return NULL; } __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul( __isl_take isl_union_pw_qpolynomial *upwqp1, __isl_take isl_union_pw_qpolynomial *upwqp2) { return match_bin_op(upwqp1, upwqp2, &isl_pw_qpolynomial_mul); } /* Reorder the columns of the given div definitions according to the * given reordering. */ static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div, __isl_take isl_reordering *r) { int i, j; isl_mat *mat; int extra; if (!div || !r) goto error; extra = isl_space_dim(r->dim, isl_dim_all) + div->n_row - r->len; mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra); if (!mat) goto error; for (i = 0; i < div->n_row; ++i) { isl_seq_cpy(mat->row[i], div->row[i], 2); isl_seq_clr(mat->row[i] + 2, mat->n_col - 2); for (j = 0; j < r->len; ++j) isl_int_set(mat->row[i][2 + r->pos[j]], div->row[i][2 + j]); } isl_reordering_free(r); isl_mat_free(div); return mat; error: isl_reordering_free(r); isl_mat_free(div); return NULL; } /* Reorder the dimension of "qp" according to the given reordering. */ __isl_give isl_qpolynomial *isl_qpolynomial_realign_domain( __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r) { qp = isl_qpolynomial_cow(qp); if (!qp) goto error; r = isl_reordering_extend(r, qp->div->n_row); if (!r) goto error; qp->div = reorder_divs(qp->div, isl_reordering_copy(r)); if (!qp->div) goto error; qp->upoly = reorder(qp->upoly, r->pos); if (!qp->upoly) goto error; qp = isl_qpolynomial_reset_domain_space(qp, isl_space_copy(r->dim)); isl_reordering_free(r); return qp; error: isl_qpolynomial_free(qp); isl_reordering_free(r); return NULL; } __isl_give isl_qpolynomial *isl_qpolynomial_align_params( __isl_take isl_qpolynomial *qp, __isl_take isl_space *model) { if (!qp || !model) goto error; if (!isl_space_match(qp->dim, isl_dim_param, model, isl_dim_param)) { isl_reordering *exp; model = isl_space_drop_dims(model, isl_dim_in, 0, isl_space_dim(model, isl_dim_in)); model = isl_space_drop_dims(model, isl_dim_out, 0, isl_space_dim(model, isl_dim_out)); exp = isl_parameter_alignment_reordering(qp->dim, model); exp = isl_reordering_extend_space(exp, isl_qpolynomial_get_domain_space(qp)); qp = isl_qpolynomial_realign_domain(qp, exp); } isl_space_free(model); return qp; error: isl_space_free(model); isl_qpolynomial_free(qp); return NULL; } struct isl_split_periods_data { int max_periods; isl_pw_qpolynomial *res; }; /* Create a slice where the integer division "div" has the fixed value "v". * In particular, if "div" refers to floor(f/m), then create a slice * * m v <= f <= m v + (m - 1) * * or * * f - m v >= 0 * -f + m v + (m - 1) >= 0 */ static __isl_give isl_set *set_div_slice(__isl_take isl_space *dim, __isl_keep isl_qpolynomial *qp, int div, isl_int v) { int total; isl_basic_set *bset = NULL; int k; if (!dim || !qp) goto error; total = isl_space_dim(dim, isl_dim_all); bset = isl_basic_set_alloc_space(isl_space_copy(dim), 0, 0, 2); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total); isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total); isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]); isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]); isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1); isl_space_free(dim); return isl_set_from_basic_set(bset); error: isl_basic_set_free(bset); isl_space_free(dim); return NULL; } static int split_periods(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user); /* Create a slice of the domain "set" such that integer division "div" * has the fixed value "v" and add the results to data->res, * replacing the integer division by "v" in "qp". */ static int set_div(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, int div, isl_int v, struct isl_split_periods_data *data) { int i; int total; isl_set *slice; struct isl_upoly *cst; slice = set_div_slice(isl_set_get_space(set), qp, div, v); set = isl_set_intersect(set, slice); if (!qp) goto error; total = isl_space_dim(qp->dim, isl_dim_all); for (i = div + 1; i < qp->div->n_row; ++i) { if (isl_int_is_zero(qp->div->row[i][2 + total + div])) continue; isl_int_addmul(qp->div->row[i][1], qp->div->row[i][2 + total + div], v); isl_int_set_si(qp->div->row[i][2 + total + div], 0); } cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one); qp = substitute_div(qp, div, cst); return split_periods(set, qp, data); error: isl_set_free(set); isl_qpolynomial_free(qp); return -1; } /* Split the domain "set" such that integer division "div" * has a fixed value (ranging from "min" to "max") on each slice * and add the results to data->res. */ static int split_div(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max, struct isl_split_periods_data *data) { for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) { isl_set *set_i = isl_set_copy(set); isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp); if (set_div(set_i, qp_i, div, min, data) < 0) goto error; } isl_set_free(set); isl_qpolynomial_free(qp); return 0; error: isl_set_free(set); isl_qpolynomial_free(qp); return -1; } /* If "qp" refers to any integer division * that can only attain "max_periods" distinct values on "set" * then split the domain along those distinct values. * Add the results (or the original if no splitting occurs) * to data->res. */ static int split_periods(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp, void *user) { int i; isl_pw_qpolynomial *pwqp; struct isl_split_periods_data *data; isl_int min, max; int total; int r = 0; data = (struct isl_split_periods_data *)user; if (!set || !qp) goto error; if (qp->div->n_row == 0) { pwqp = isl_pw_qpolynomial_alloc(set, qp); data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp); return 0; } isl_int_init(min); isl_int_init(max); total = isl_space_dim(qp->dim, isl_dim_all); for (i = 0; i < qp->div->n_row; ++i) { enum isl_lp_result lp_res; if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total, qp->div->n_row) != -1) continue; lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1, set->ctx->one, &min, NULL, NULL); if (lp_res == isl_lp_error) goto error2; if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty) continue; isl_int_fdiv_q(min, min, qp->div->row[i][0]); lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1, set->ctx->one, &max, NULL, NULL); if (lp_res == isl_lp_error) goto error2; if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty) continue; isl_int_fdiv_q(max, max, qp->div->row[i][0]); isl_int_sub(max, max, min); if (isl_int_cmp_si(max, data->max_periods) < 0) { isl_int_add(max, max, min); break; } } if (i < qp->div->n_row) { r = split_div(set, qp, i, min, max, data); } else { pwqp = isl_pw_qpolynomial_alloc(set, qp); data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp); } isl_int_clear(max); isl_int_clear(min); return r; error2: isl_int_clear(max); isl_int_clear(min); error: isl_set_free(set); isl_qpolynomial_free(qp); return -1; } /* If any quasi-polynomial in pwqp refers to any integer division * that can only attain "max_periods" distinct values on its domain * then split the domain along those distinct values. */ __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods( __isl_take isl_pw_qpolynomial *pwqp, int max_periods) { struct isl_split_periods_data data; data.max_periods = max_periods; data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp)); if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0) goto error; isl_pw_qpolynomial_free(pwqp); return data.res; error: isl_pw_qpolynomial_free(data.res); isl_pw_qpolynomial_free(pwqp); return NULL; } /* Construct a piecewise quasipolynomial that is constant on the given * domain. In particular, it is * 0 if cst == 0 * 1 if cst == 1 * infinity if cst == -1 */ static __isl_give isl_pw_qpolynomial *constant_on_domain( __isl_take isl_basic_set *bset, int cst) { isl_space *dim; isl_qpolynomial *qp; if (!bset) return NULL; bset = isl_basic_set_params(bset); dim = isl_basic_set_get_space(bset); if (cst < 0) qp = isl_qpolynomial_infty_on_domain(dim); else if (cst == 0) qp = isl_qpolynomial_zero_on_domain(dim); else qp = isl_qpolynomial_one_on_domain(dim); return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp); } /* Factor bset, call fn on each of the factors and return the product. * * If no factors can be found, simply call fn on the input. * Otherwise, construct the factors based on the factorizer, * call fn on each factor and compute the product. */ static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call( __isl_take isl_basic_set *bset, __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset)) { int i, n; isl_space *dim; isl_set *set; isl_factorizer *f; isl_qpolynomial *qp; isl_pw_qpolynomial *pwqp; unsigned nparam; unsigned nvar; f = isl_basic_set_factorizer(bset); if (!f) goto error; if (f->n_group == 0) { isl_factorizer_free(f); return fn(bset); } nparam = isl_basic_set_dim(bset, isl_dim_param); nvar = isl_basic_set_dim(bset, isl_dim_set); dim = isl_basic_set_get_space(bset); dim = isl_space_domain(dim); set = isl_set_universe(isl_space_copy(dim)); qp = isl_qpolynomial_one_on_domain(dim); pwqp = isl_pw_qpolynomial_alloc(set, qp); bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset); for (i = 0, n = 0; i < f->n_group; ++i) { isl_basic_set *bset_i; isl_pw_qpolynomial *pwqp_i; bset_i = isl_basic_set_copy(bset); bset_i = isl_basic_set_drop_constraints_involving(bset_i, nparam + n + f->len[i], nvar - n - f->len[i]); bset_i = isl_basic_set_drop_constraints_involving(bset_i, nparam, n); bset_i = isl_basic_set_drop(bset_i, isl_dim_set, n + f->len[i], nvar - n - f->len[i]); bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n); pwqp_i = fn(bset_i); pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i); n += f->len[i]; } isl_basic_set_free(bset); isl_factorizer_free(f); return pwqp; error: isl_basic_set_free(bset); return NULL; } /* Factor bset, call fn on each of the factors and return the product. * The function is assumed to evaluate to zero on empty domains, * to one on zero-dimensional domains and to infinity on unbounded domains * and will not be called explicitly on zero-dimensional or unbounded domains. * * We first check for some special cases and remove all equalities. * Then we hand over control to compressed_multiplicative_call. */ __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call( __isl_take isl_basic_set *bset, __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset)) { int bounded; isl_morph *morph; isl_pw_qpolynomial *pwqp; if (!bset) return NULL; if (isl_basic_set_plain_is_empty(bset)) return constant_on_domain(bset, 0); if (isl_basic_set_dim(bset, isl_dim_set) == 0) return constant_on_domain(bset, 1); bounded = isl_basic_set_is_bounded(bset); if (bounded < 0) goto error; if (!bounded) return constant_on_domain(bset, -1); if (bset->n_eq == 0) return compressed_multiplicative_call(bset, fn); morph = isl_basic_set_full_compression(bset); bset = isl_morph_basic_set(isl_morph_copy(morph), bset); pwqp = compressed_multiplicative_call(bset, fn); morph = isl_morph_dom_params(morph); morph = isl_morph_ran_params(morph); morph = isl_morph_inverse(morph); pwqp = isl_pw_qpolynomial_morph_domain(pwqp, morph); return pwqp; error: isl_basic_set_free(bset); return NULL; } /* Drop all floors in "qp", turning each integer division [a/m] into * a rational division a/m. If "down" is set, then the integer division * is replaced by (a-(m-1))/m instead. */ static __isl_give isl_qpolynomial *qp_drop_floors( __isl_take isl_qpolynomial *qp, int down) { int i; struct isl_upoly *s; if (!qp) return NULL; if (qp->div->n_row == 0) return qp; qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; for (i = qp->div->n_row - 1; i >= 0; --i) { if (down) { isl_int_sub(qp->div->row[i][1], qp->div->row[i][1], qp->div->row[i][0]); isl_int_add_ui(qp->div->row[i][1], qp->div->row[i][1], 1); } s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1, qp->div->row[i][0], qp->div->n_col - 1); qp = substitute_div(qp, i, s); if (!qp) return NULL; } return qp; } /* Drop all floors in "pwqp", turning each integer division [a/m] into * a rational division a/m. */ static __isl_give isl_pw_qpolynomial *pwqp_drop_floors( __isl_take isl_pw_qpolynomial *pwqp) { int i; if (!pwqp) return NULL; if (isl_pw_qpolynomial_is_zero(pwqp)) return pwqp; pwqp = isl_pw_qpolynomial_cow(pwqp); if (!pwqp) return NULL; for (i = 0; i < pwqp->n; ++i) { pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0); if (!pwqp->p[i].qp) goto error; } return pwqp; error: isl_pw_qpolynomial_free(pwqp); return NULL; } /* Adjust all the integer divisions in "qp" such that they are at least * one over the given orthant (identified by "signs"). This ensures * that they will still be non-negative even after subtracting (m-1)/m. * * In particular, f is replaced by f' + v, changing f = [a/m] * to f' = [(a - m v)/m]. * If the constant term k in a is smaller than m, * the constant term of v is set to floor(k/m) - 1. * For any other term, if the coefficient c and the variable x have * the same sign, then no changes are needed. * Otherwise, if the variable is positive (and c is negative), * then the coefficient of x in v is set to floor(c/m). * If the variable is negative (and c is positive), * then the coefficient of x in v is set to ceil(c/m). */ static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp, int *signs) { int i, j; int total; isl_vec *v = NULL; struct isl_upoly *s; qp = isl_qpolynomial_cow(qp); if (!qp) return NULL; qp->div = isl_mat_cow(qp->div); if (!qp->div) goto error; total = isl_space_dim(qp->dim, isl_dim_all); v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1); for (i = 0; i < qp->div->n_row; ++i) { isl_int *row = qp->div->row[i]; v = isl_vec_clr(v); if (!v) goto error; if (isl_int_lt(row[1], row[0])) { isl_int_fdiv_q(v->el[0], row[1], row[0]); isl_int_sub_ui(v->el[0], v->el[0], 1); isl_int_submul(row[1], row[0], v->el[0]); } for (j = 0; j < total; ++j) { if (isl_int_sgn(row[2 + j]) * signs[j] >= 0) continue; if (signs[j] < 0) isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]); else isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]); isl_int_submul(row[2 + j], row[0], v->el[1 + j]); } for (j = 0; j < i; ++j) { if (isl_int_sgn(row[2 + total + j]) >= 0) continue; isl_int_fdiv_q(v->el[1 + total + j], row[2 + total + j], row[0]); isl_int_submul(row[2 + total + j], row[0], v->el[1 + total + j]); } for (j = i + 1; j < qp->div->n_row; ++j) { if (isl_int_is_zero(qp->div->row[j][2 + total + i])) continue; isl_seq_combine(qp->div->row[j] + 1, qp->div->ctx->one, qp->div->row[j] + 1, qp->div->row[j][2 + total + i], v->el, v->size); } isl_int_set_si(v->el[1 + total + i], 1); s = isl_upoly_from_affine(qp->dim->ctx, v->el, qp->div->ctx->one, v->size); qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s); isl_upoly_free(s); if (!qp->upoly) goto error; } isl_vec_free(v); return qp; error: isl_vec_free(v); isl_qpolynomial_free(qp); return NULL; } struct isl_to_poly_data { int sign; isl_pw_qpolynomial *res; isl_qpolynomial *qp; }; /* Appoximate data->qp by a polynomial on the orthant identified by "signs". * We first make all integer divisions positive and then split the * quasipolynomials into terms with sign data->sign (the direction * of the requested approximation) and terms with the opposite sign. * In the first set of terms, each integer division [a/m] is * overapproximated by a/m, while in the second it is underapproximated * by (a-(m-1))/m. */ static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs, void *user) { struct isl_to_poly_data *data = user; isl_pw_qpolynomial *t; isl_qpolynomial *qp, *up, *down; qp = isl_qpolynomial_copy(data->qp); qp = make_divs_pos(qp, signs); up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign); up = qp_drop_floors(up, 0); down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign); down = qp_drop_floors(down, 1); isl_qpolynomial_free(qp); qp = isl_qpolynomial_add(up, down); t = isl_pw_qpolynomial_alloc(orthant, qp); data->res = isl_pw_qpolynomial_add_disjoint(data->res, t); return 0; } /* Approximate each quasipolynomial by a polynomial. If "sign" is positive, * the polynomial will be an overapproximation. If "sign" is negative, * it will be an underapproximation. If "sign" is zero, the approximation * will lie somewhere in between. * * In particular, is sign == 0, we simply drop the floors, turning * the integer divisions into rational divisions. * Otherwise, we split the domains into orthants, make all integer divisions * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m, * depending on the requested sign and the sign of the term in which * the integer division appears. */ __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial( __isl_take isl_pw_qpolynomial *pwqp, int sign) { int i; struct isl_to_poly_data data; if (sign == 0) return pwqp_drop_floors(pwqp); if (!pwqp) return NULL; data.sign = sign; data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp)); for (i = 0; i < pwqp->n; ++i) { if (pwqp->p[i].qp->div->n_row == 0) { isl_pw_qpolynomial *t; t = isl_pw_qpolynomial_alloc( isl_set_copy(pwqp->p[i].set), isl_qpolynomial_copy(pwqp->p[i].qp)); data.res = isl_pw_qpolynomial_add_disjoint(data.res, t); continue; } data.qp = pwqp->p[i].qp; if (isl_set_foreach_orthant(pwqp->p[i].set, &to_polynomial_on_orthant, &data) < 0) goto error; } isl_pw_qpolynomial_free(pwqp); return data.res; error: isl_pw_qpolynomial_free(pwqp); isl_pw_qpolynomial_free(data.res); return NULL; } static int poly_entry(void **entry, void *user) { int *sign = user; isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry; *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign); return *pwqp ? 0 : -1; } __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial( __isl_take isl_union_pw_qpolynomial *upwqp, int sign) { upwqp = isl_union_pw_qpolynomial_cow(upwqp); if (!upwqp) return NULL; if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table, &poly_entry, &sign) < 0) goto error; return upwqp; error: isl_union_pw_qpolynomial_free(upwqp); return NULL; } __isl_give isl_basic_map *isl_basic_map_from_qpolynomial( __isl_take isl_qpolynomial *qp) { int i, k; isl_space *dim; isl_vec *aff = NULL; isl_basic_map *bmap = NULL; unsigned pos; unsigned n_div; if (!qp) return NULL; if (!isl_upoly_is_affine(qp->upoly)) isl_die(qp->dim->ctx, isl_error_invalid, "input quasi-polynomial not affine", goto error); aff = isl_qpolynomial_extract_affine(qp); if (!aff) goto error; dim = isl_qpolynomial_get_space(qp); pos = 1 + isl_space_offset(dim, isl_dim_out); n_div = qp->div->n_row; bmap = isl_basic_map_alloc_space(dim, n_div, 1, 2 * n_div); for (i = 0; i < n_div; ++i) { k = isl_basic_map_alloc_div(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->div[k], qp->div->row[i], qp->div->n_col); isl_int_set_si(bmap->div[k][qp->div->n_col], 0); if (isl_basic_map_add_div_constraints(bmap, k) < 0) goto error; } k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_int_neg(bmap->eq[k][pos], aff->el[0]); isl_seq_cpy(bmap->eq[k], aff->el + 1, pos); isl_seq_cpy(bmap->eq[k] + pos + 1, aff->el + 1 + pos, n_div); isl_vec_free(aff); isl_qpolynomial_free(qp); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_vec_free(aff); isl_qpolynomial_free(qp); isl_basic_map_free(bmap); return NULL; } cloog-0.18.2/isl/isl_sample.h0000664000175000017500000000162012254313240012713 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_SAMPLE_H #define ISL_SAMPLE #include #include #if defined(__cplusplus) extern "C" { #endif __isl_give isl_vec *isl_basic_set_sample_vec(__isl_take isl_basic_set *bset); struct isl_vec *isl_basic_set_sample_bounded(struct isl_basic_set *bset); __isl_give isl_vec *isl_basic_set_sample_with_cone( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *cone); __isl_give isl_basic_set *isl_basic_set_from_vec(__isl_take isl_vec *vec); int isl_tab_set_initial_basis_with_cone(struct isl_tab *tab, struct isl_tab *tab_cone); struct isl_vec *isl_tab_sample(struct isl_tab *tab); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/isl_affine_hull.c0000664000175000017500000011221012254313240013677 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France */ #include #include #include #include #include #include #include "isl_equalities.h" #include "isl_sample.h" #include "isl_tab.h" #include struct isl_basic_map *isl_basic_map_implicit_equalities( struct isl_basic_map *bmap) { struct isl_tab *tab; if (!bmap) return bmap; bmap = isl_basic_map_gauss(bmap, NULL); if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NO_IMPLICIT)) return bmap; if (bmap->n_ineq <= 1) return bmap; tab = isl_tab_from_basic_map(bmap, 0); if (isl_tab_detect_implicit_equalities(tab) < 0) goto error; bmap = isl_basic_map_update_from_tab(bmap, tab); isl_tab_free(tab); bmap = isl_basic_map_gauss(bmap, NULL); ISL_F_SET(bmap, ISL_BASIC_MAP_NO_IMPLICIT); return bmap; error: isl_tab_free(tab); isl_basic_map_free(bmap); return NULL; } struct isl_basic_set *isl_basic_set_implicit_equalities( struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_implicit_equalities((struct isl_basic_map*)bset); } struct isl_map *isl_map_implicit_equalities(struct isl_map *map) { int i; if (!map) return map; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_implicit_equalities(map->p[i]); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } /* Make eq[row][col] of both bmaps equal so we can add the row * add the column to the common matrix. * Note that because of the echelon form, the columns of row row * after column col are zero. */ static void set_common_multiple( struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned row, unsigned col) { isl_int m, c; if (isl_int_eq(bset1->eq[row][col], bset2->eq[row][col])) return; isl_int_init(c); isl_int_init(m); isl_int_lcm(m, bset1->eq[row][col], bset2->eq[row][col]); isl_int_divexact(c, m, bset1->eq[row][col]); isl_seq_scale(bset1->eq[row], bset1->eq[row], c, col+1); isl_int_divexact(c, m, bset2->eq[row][col]); isl_seq_scale(bset2->eq[row], bset2->eq[row], c, col+1); isl_int_clear(c); isl_int_clear(m); } /* Delete a given equality, moving all the following equalities one up. */ static void delete_row(struct isl_basic_set *bset, unsigned row) { isl_int *t; int r; t = bset->eq[row]; bset->n_eq--; for (r = row; r < bset->n_eq; ++r) bset->eq[r] = bset->eq[r+1]; bset->eq[bset->n_eq] = t; } /* Make first row entries in column col of bset1 identical to * those of bset2, using the fact that entry bset1->eq[row][col]=a * is non-zero. Initially, these elements of bset1 are all zero. * For each row i < row, we set * A[i] = a * A[i] + B[i][col] * A[row] * B[i] = a * B[i] * so that * A[i][col] = B[i][col] = a * old(B[i][col]) */ static void construct_column( struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned row, unsigned col) { int r; isl_int a; isl_int b; unsigned total; isl_int_init(a); isl_int_init(b); total = 1 + isl_basic_set_n_dim(bset1); for (r = 0; r < row; ++r) { if (isl_int_is_zero(bset2->eq[r][col])) continue; isl_int_gcd(b, bset2->eq[r][col], bset1->eq[row][col]); isl_int_divexact(a, bset1->eq[row][col], b); isl_int_divexact(b, bset2->eq[r][col], b); isl_seq_combine(bset1->eq[r], a, bset1->eq[r], b, bset1->eq[row], total); isl_seq_scale(bset2->eq[r], bset2->eq[r], a, total); } isl_int_clear(a); isl_int_clear(b); delete_row(bset1, row); } /* Make first row entries in column col of bset1 identical to * those of bset2, using only these entries of the two matrices. * Let t be the last row with different entries. * For each row i < t, we set * A[i] = (A[t][col]-B[t][col]) * A[i] + (B[i][col]-A[i][col) * A[t] * B[i] = (A[t][col]-B[t][col]) * B[i] + (B[i][col]-A[i][col) * B[t] * so that * A[i][col] = B[i][col] = old(A[t][col]*B[i][col]-A[i][col]*B[t][col]) */ static int transform_column( struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned row, unsigned col) { int i, t; isl_int a, b, g; unsigned total; for (t = row-1; t >= 0; --t) if (isl_int_ne(bset1->eq[t][col], bset2->eq[t][col])) break; if (t < 0) return 0; total = 1 + isl_basic_set_n_dim(bset1); isl_int_init(a); isl_int_init(b); isl_int_init(g); isl_int_sub(b, bset1->eq[t][col], bset2->eq[t][col]); for (i = 0; i < t; ++i) { isl_int_sub(a, bset2->eq[i][col], bset1->eq[i][col]); isl_int_gcd(g, a, b); isl_int_divexact(a, a, g); isl_int_divexact(g, b, g); isl_seq_combine(bset1->eq[i], g, bset1->eq[i], a, bset1->eq[t], total); isl_seq_combine(bset2->eq[i], g, bset2->eq[i], a, bset2->eq[t], total); } isl_int_clear(a); isl_int_clear(b); isl_int_clear(g); delete_row(bset1, t); delete_row(bset2, t); return 1; } /* The implementation is based on Section 5.2 of Michael Karr, * "Affine Relationships Among Variables of a Program", * except that the echelon form we use starts from the last column * and that we are dealing with integer coefficients. */ static struct isl_basic_set *affine_hull( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { unsigned total; int col; int row; if (!bset1 || !bset2) goto error; total = 1 + isl_basic_set_n_dim(bset1); row = 0; for (col = total-1; col >= 0; --col) { int is_zero1 = row >= bset1->n_eq || isl_int_is_zero(bset1->eq[row][col]); int is_zero2 = row >= bset2->n_eq || isl_int_is_zero(bset2->eq[row][col]); if (!is_zero1 && !is_zero2) { set_common_multiple(bset1, bset2, row, col); ++row; } else if (!is_zero1 && is_zero2) { construct_column(bset1, bset2, row, col); } else if (is_zero1 && !is_zero2) { construct_column(bset2, bset1, row, col); } else { if (transform_column(bset1, bset2, row, col)) --row; } } isl_assert(bset1->ctx, row == bset1->n_eq, goto error); isl_basic_set_free(bset2); bset1 = isl_basic_set_normalize_constraints(bset1); return bset1; error: isl_basic_set_free(bset1); isl_basic_set_free(bset2); return NULL; } /* Find an integer point in the set represented by "tab" * that lies outside of the equality "eq" e(x) = 0. * If "up" is true, look for a point satisfying e(x) - 1 >= 0. * Otherwise, look for a point satisfying -e(x) - 1 >= 0 (i.e., e(x) <= -1). * The point, if found, is returned. * If no point can be found, a zero-length vector is returned. * * Before solving an ILP problem, we first check if simply * adding the normal of the constraint to one of the known * integer points in the basic set represented by "tab" * yields another point inside the basic set. * * The caller of this function ensures that the tableau is bounded or * that tab->basis and tab->n_unbounded have been set appropriately. */ static struct isl_vec *outside_point(struct isl_tab *tab, isl_int *eq, int up) { struct isl_ctx *ctx; struct isl_vec *sample = NULL; struct isl_tab_undo *snap; unsigned dim; if (!tab) return NULL; ctx = tab->mat->ctx; dim = tab->n_var; sample = isl_vec_alloc(ctx, 1 + dim); if (!sample) return NULL; isl_int_set_si(sample->el[0], 1); isl_seq_combine(sample->el + 1, ctx->one, tab->bmap->sample->el + 1, up ? ctx->one : ctx->negone, eq + 1, dim); if (isl_basic_map_contains(tab->bmap, sample)) return sample; isl_vec_free(sample); sample = NULL; snap = isl_tab_snap(tab); if (!up) isl_seq_neg(eq, eq, 1 + dim); isl_int_sub_ui(eq[0], eq[0], 1); if (isl_tab_extend_cons(tab, 1) < 0) goto error; if (isl_tab_add_ineq(tab, eq) < 0) goto error; sample = isl_tab_sample(tab); isl_int_add_ui(eq[0], eq[0], 1); if (!up) isl_seq_neg(eq, eq, 1 + dim); if (sample && isl_tab_rollback(tab, snap) < 0) goto error; return sample; error: isl_vec_free(sample); return NULL; } struct isl_basic_set *isl_basic_set_recession_cone(struct isl_basic_set *bset) { int i; bset = isl_basic_set_cow(bset); if (!bset) return NULL; isl_assert(bset->ctx, bset->n_div == 0, goto error); for (i = 0; i < bset->n_eq; ++i) isl_int_set_si(bset->eq[i][0], 0); for (i = 0; i < bset->n_ineq; ++i) isl_int_set_si(bset->ineq[i][0], 0); ISL_F_CLR(bset, ISL_BASIC_SET_NO_IMPLICIT); return isl_basic_set_implicit_equalities(bset); error: isl_basic_set_free(bset); return NULL; } __isl_give isl_set *isl_set_recession_cone(__isl_take isl_set *set) { int i; if (!set) return NULL; if (set->n == 0) return set; set = isl_set_remove_divs(set); set = isl_set_cow(set); if (!set) return NULL; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_recession_cone(set->p[i]); if (!set->p[i]) goto error; } return set; error: isl_set_free(set); return NULL; } /* Move "sample" to a point that is one up (or down) from the original * point in dimension "pos". */ static void adjacent_point(__isl_keep isl_vec *sample, int pos, int up) { if (up) isl_int_add_ui(sample->el[1 + pos], sample->el[1 + pos], 1); else isl_int_sub_ui(sample->el[1 + pos], sample->el[1 + pos], 1); } /* Check if any points that are adjacent to "sample" also belong to "bset". * If so, add them to "hull" and return the updated hull. * * Before checking whether and adjacent point belongs to "bset", we first * check whether it already belongs to "hull" as this test is typically * much cheaper. */ static __isl_give isl_basic_set *add_adjacent_points( __isl_take isl_basic_set *hull, __isl_take isl_vec *sample, __isl_keep isl_basic_set *bset) { int i, up; int dim; if (!sample) goto error; dim = isl_basic_set_dim(hull, isl_dim_set); for (i = 0; i < dim; ++i) { for (up = 0; up <= 1; ++up) { int contains; isl_basic_set *point; adjacent_point(sample, i, up); contains = isl_basic_set_contains(hull, sample); if (contains < 0) goto error; if (contains) { adjacent_point(sample, i, !up); continue; } contains = isl_basic_set_contains(bset, sample); if (contains < 0) goto error; if (contains) { point = isl_basic_set_from_vec( isl_vec_copy(sample)); hull = affine_hull(hull, point); } adjacent_point(sample, i, !up); if (contains) break; } } isl_vec_free(sample); return hull; error: isl_vec_free(sample); isl_basic_set_free(hull); return NULL; } /* Extend an initial (under-)approximation of the affine hull of basic * set represented by the tableau "tab" * by looking for points that do not satisfy one of the equalities * in the current approximation and adding them to that approximation * until no such points can be found any more. * * The caller of this function ensures that "tab" is bounded or * that tab->basis and tab->n_unbounded have been set appropriately. * * "bset" may be either NULL or the basic set represented by "tab". * If "bset" is not NULL, we check for any point we find if any * of its adjacent points also belong to "bset". */ static __isl_give isl_basic_set *extend_affine_hull(struct isl_tab *tab, __isl_take isl_basic_set *hull, __isl_keep isl_basic_set *bset) { int i, j; unsigned dim; if (!tab || !hull) goto error; dim = tab->n_var; if (isl_tab_extend_cons(tab, 2 * dim + 1) < 0) goto error; for (i = 0; i < dim; ++i) { struct isl_vec *sample; struct isl_basic_set *point; for (j = 0; j < hull->n_eq; ++j) { sample = outside_point(tab, hull->eq[j], 1); if (!sample) goto error; if (sample->size > 0) break; isl_vec_free(sample); sample = outside_point(tab, hull->eq[j], 0); if (!sample) goto error; if (sample->size > 0) break; isl_vec_free(sample); if (isl_tab_add_eq(tab, hull->eq[j]) < 0) goto error; } if (j == hull->n_eq) break; if (tab->samples) tab = isl_tab_add_sample(tab, isl_vec_copy(sample)); if (!tab) goto error; if (bset) hull = add_adjacent_points(hull, isl_vec_copy(sample), bset); point = isl_basic_set_from_vec(sample); hull = affine_hull(hull, point); if (!hull) return NULL; } return hull; error: isl_basic_set_free(hull); return NULL; } /* Drop all constraints in bmap that involve any of the dimensions * first to first+n-1. */ static __isl_give isl_basic_map *isl_basic_map_drop_constraints_involving( __isl_take isl_basic_map *bmap, unsigned first, unsigned n) { int i; if (n == 0) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; for (i = bmap->n_eq - 1; i >= 0; --i) { if (isl_seq_first_non_zero(bmap->eq[i] + 1 + first, n) == -1) continue; isl_basic_map_drop_equality(bmap, i); } for (i = bmap->n_ineq - 1; i >= 0; --i) { if (isl_seq_first_non_zero(bmap->ineq[i] + 1 + first, n) == -1) continue; isl_basic_map_drop_inequality(bmap, i); } return bmap; } /* Drop all constraints in bset that involve any of the dimensions * first to first+n-1. */ __isl_give isl_basic_set *isl_basic_set_drop_constraints_involving( __isl_take isl_basic_set *bset, unsigned first, unsigned n) { return isl_basic_map_drop_constraints_involving(bset, first, n); } /* Drop all constraints in bmap that do not involve any of the dimensions * first to first + n - 1 of the given type. */ __isl_give isl_basic_map *isl_basic_map_drop_constraints_not_involving_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { int i; unsigned dim; if (n == 0) return isl_basic_map_set_to_empty(bmap); bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; dim = isl_basic_map_dim(bmap, type); if (first + n > dim || first + n < first) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "index out of bounds", return isl_basic_map_free(bmap)); first += isl_basic_map_offset(bmap, type) - 1; for (i = bmap->n_eq - 1; i >= 0; --i) { if (isl_seq_first_non_zero(bmap->eq[i] + 1 + first, n) != -1) continue; isl_basic_map_drop_equality(bmap, i); } for (i = bmap->n_ineq - 1; i >= 0; --i) { if (isl_seq_first_non_zero(bmap->ineq[i] + 1 + first, n) != -1) continue; isl_basic_map_drop_inequality(bmap, i); } return bmap; } /* Drop all constraints in bset that do not involve any of the dimensions * first to first + n - 1 of the given type. */ __isl_give isl_basic_set *isl_basic_set_drop_constraints_not_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return isl_basic_map_drop_constraints_not_involving_dims(bset, type, first, n); } /* Drop all constraints in bmap that involve any of the dimensions * first to first + n - 1 of the given type. */ __isl_give isl_basic_map *isl_basic_map_drop_constraints_involving_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { unsigned dim; if (!bmap) return NULL; if (n == 0) return bmap; dim = isl_basic_map_dim(bmap, type); if (first + n > dim || first + n < first) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "index out of bounds", return isl_basic_map_free(bmap)); bmap = isl_basic_map_remove_divs_involving_dims(bmap, type, first, n); first += isl_basic_map_offset(bmap, type) - 1; return isl_basic_map_drop_constraints_involving(bmap, first, n); } /* Drop all constraints in bset that involve any of the dimensions * first to first + n - 1 of the given type. */ __isl_give isl_basic_set *isl_basic_set_drop_constraints_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return isl_basic_map_drop_constraints_involving_dims(bset, type, first, n); } /* Drop all constraints in map that involve any of the dimensions * first to first + n - 1 of the given type. */ __isl_give isl_map *isl_map_drop_constraints_involving_dims( __isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; unsigned dim; if (!map) return NULL; if (n == 0) return map; dim = isl_map_dim(map, type); if (first + n > dim || first + n < first) isl_die(isl_map_get_ctx(map), isl_error_invalid, "index out of bounds", return isl_map_free(map)); map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_drop_constraints_involving_dims( map->p[i], type, first, n); if (!map->p[i]) return isl_map_free(map); } return map; } /* Drop all constraints in set that involve any of the dimensions * first to first + n - 1 of the given type. */ __isl_give isl_set *isl_set_drop_constraints_involving_dims( __isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n) { return isl_map_drop_constraints_involving_dims(set, type, first, n); } /* Construct an initial underapproximatino of the hull of "bset" * from "sample" and any of its adjacent points that also belong to "bset". */ static __isl_give isl_basic_set *initialize_hull(__isl_keep isl_basic_set *bset, __isl_take isl_vec *sample) { isl_basic_set *hull; hull = isl_basic_set_from_vec(isl_vec_copy(sample)); hull = add_adjacent_points(hull, sample, bset); return hull; } /* Look for all equalities satisfied by the integer points in bset, * which is assumed to be bounded. * * The equalities are obtained by successively looking for * a point that is affinely independent of the points found so far. * In particular, for each equality satisfied by the points so far, * we check if there is any point on a hyperplane parallel to the * corresponding hyperplane shifted by at least one (in either direction). */ static struct isl_basic_set *uset_affine_hull_bounded(struct isl_basic_set *bset) { struct isl_vec *sample = NULL; struct isl_basic_set *hull; struct isl_tab *tab = NULL; unsigned dim; if (isl_basic_set_plain_is_empty(bset)) return bset; dim = isl_basic_set_n_dim(bset); if (bset->sample && bset->sample->size == 1 + dim) { int contains = isl_basic_set_contains(bset, bset->sample); if (contains < 0) goto error; if (contains) { if (dim == 0) return bset; sample = isl_vec_copy(bset->sample); } else { isl_vec_free(bset->sample); bset->sample = NULL; } } tab = isl_tab_from_basic_set(bset, 1); if (!tab) goto error; if (tab->empty) { isl_tab_free(tab); isl_vec_free(sample); return isl_basic_set_set_to_empty(bset); } if (!sample) { struct isl_tab_undo *snap; snap = isl_tab_snap(tab); sample = isl_tab_sample(tab); if (isl_tab_rollback(tab, snap) < 0) goto error; isl_vec_free(tab->bmap->sample); tab->bmap->sample = isl_vec_copy(sample); } if (!sample) goto error; if (sample->size == 0) { isl_tab_free(tab); isl_vec_free(sample); return isl_basic_set_set_to_empty(bset); } hull = initialize_hull(bset, sample); hull = extend_affine_hull(tab, hull, bset); isl_basic_set_free(bset); isl_tab_free(tab); return hull; error: isl_vec_free(sample); isl_tab_free(tab); isl_basic_set_free(bset); return NULL; } /* Given an unbounded tableau and an integer point satisfying the tableau, * construct an initial affine hull containing the recession cone * shifted to the given point. * * The unbounded directions are taken from the last rows of the basis, * which is assumed to have been initialized appropriately. */ static __isl_give isl_basic_set *initial_hull(struct isl_tab *tab, __isl_take isl_vec *vec) { int i; int k; struct isl_basic_set *bset = NULL; struct isl_ctx *ctx; unsigned dim; if (!vec || !tab) return NULL; ctx = vec->ctx; isl_assert(ctx, vec->size != 0, goto error); bset = isl_basic_set_alloc(ctx, 0, vec->size - 1, 0, vec->size - 1, 0); if (!bset) goto error; dim = isl_basic_set_n_dim(bset) - tab->n_unbounded; for (i = 0; i < dim; ++i) { k = isl_basic_set_alloc_equality(bset); if (k < 0) goto error; isl_seq_cpy(bset->eq[k] + 1, tab->basis->row[1 + i] + 1, vec->size - 1); isl_seq_inner_product(bset->eq[k] + 1, vec->el +1, vec->size - 1, &bset->eq[k][0]); isl_int_neg(bset->eq[k][0], bset->eq[k][0]); } bset->sample = vec; bset = isl_basic_set_gauss(bset, NULL); return bset; error: isl_basic_set_free(bset); isl_vec_free(vec); return NULL; } /* Given a tableau of a set and a tableau of the corresponding * recession cone, detect and add all equalities to the tableau. * If the tableau is bounded, then we can simply keep the * tableau in its state after the return from extend_affine_hull. * However, if the tableau is unbounded, then * isl_tab_set_initial_basis_with_cone will add some additional * constraints to the tableau that have to be removed again. * In this case, we therefore rollback to the state before * any constraints were added and then add the equalities back in. */ struct isl_tab *isl_tab_detect_equalities(struct isl_tab *tab, struct isl_tab *tab_cone) { int j; struct isl_vec *sample; struct isl_basic_set *hull = NULL; struct isl_tab_undo *snap; if (!tab || !tab_cone) goto error; snap = isl_tab_snap(tab); isl_mat_free(tab->basis); tab->basis = NULL; isl_assert(tab->mat->ctx, tab->bmap, goto error); isl_assert(tab->mat->ctx, tab->samples, goto error); isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, goto error); isl_assert(tab->mat->ctx, tab->n_sample > tab->n_outside, goto error); if (isl_tab_set_initial_basis_with_cone(tab, tab_cone) < 0) goto error; sample = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_var); if (!sample) goto error; isl_seq_cpy(sample->el, tab->samples->row[tab->n_outside], sample->size); isl_vec_free(tab->bmap->sample); tab->bmap->sample = isl_vec_copy(sample); if (tab->n_unbounded == 0) hull = isl_basic_set_from_vec(isl_vec_copy(sample)); else hull = initial_hull(tab, isl_vec_copy(sample)); for (j = tab->n_outside + 1; j < tab->n_sample; ++j) { isl_seq_cpy(sample->el, tab->samples->row[j], sample->size); hull = affine_hull(hull, isl_basic_set_from_vec(isl_vec_copy(sample))); } isl_vec_free(sample); hull = extend_affine_hull(tab, hull, NULL); if (!hull) goto error; if (tab->n_unbounded == 0) { isl_basic_set_free(hull); return tab; } if (isl_tab_rollback(tab, snap) < 0) goto error; if (hull->n_eq > tab->n_zero) { for (j = 0; j < hull->n_eq; ++j) { isl_seq_normalize(tab->mat->ctx, hull->eq[j], 1 + tab->n_var); if (isl_tab_add_eq(tab, hull->eq[j]) < 0) goto error; } } isl_basic_set_free(hull); return tab; error: isl_basic_set_free(hull); isl_tab_free(tab); return NULL; } /* Compute the affine hull of "bset", where "cone" is the recession cone * of "bset". * * We first compute a unimodular transformation that puts the unbounded * directions in the last dimensions. In particular, we take a transformation * that maps all equalities to equalities (in HNF) on the first dimensions. * Let x be the original dimensions and y the transformed, with y_1 bounded * and y_2 unbounded. * * [ y_1 ] [ y_1 ] [ Q_1 ] * x = U [ y_2 ] [ y_2 ] = [ Q_2 ] x * * Let's call the input basic set S. We compute S' = preimage(S, U) * and drop the final dimensions including any constraints involving them. * This results in set S''. * Then we compute the affine hull A'' of S''. * Let F y_1 >= g be the constraint system of A''. In the transformed * space the y_2 are unbounded, so we can add them back without any constraints, * resulting in * * [ y_1 ] * [ F 0 ] [ y_2 ] >= g * or * [ Q_1 ] * [ F 0 ] [ Q_2 ] x >= g * or * F Q_1 x >= g * * The affine hull in the original space is then obtained as * A = preimage(A'', Q_1). */ static struct isl_basic_set *affine_hull_with_cone(struct isl_basic_set *bset, struct isl_basic_set *cone) { unsigned total; unsigned cone_dim; struct isl_basic_set *hull; struct isl_mat *M, *U, *Q; if (!bset || !cone) goto error; total = isl_basic_set_total_dim(cone); cone_dim = total - cone->n_eq; M = isl_mat_sub_alloc6(bset->ctx, cone->eq, 0, cone->n_eq, 1, total); M = isl_mat_left_hermite(M, 0, &U, &Q); if (!M) goto error; isl_mat_free(M); U = isl_mat_lin_to_aff(U); bset = isl_basic_set_preimage(bset, isl_mat_copy(U)); bset = isl_basic_set_drop_constraints_involving(bset, total - cone_dim, cone_dim); bset = isl_basic_set_drop_dims(bset, total - cone_dim, cone_dim); Q = isl_mat_lin_to_aff(Q); Q = isl_mat_drop_rows(Q, 1 + total - cone_dim, cone_dim); if (bset && bset->sample && bset->sample->size == 1 + total) bset->sample = isl_mat_vec_product(isl_mat_copy(Q), bset->sample); hull = uset_affine_hull_bounded(bset); if (!hull) { isl_mat_free(Q); isl_mat_free(U); } else { struct isl_vec *sample = isl_vec_copy(hull->sample); U = isl_mat_drop_cols(U, 1 + total - cone_dim, cone_dim); if (sample && sample->size > 0) sample = isl_mat_vec_product(U, sample); else isl_mat_free(U); hull = isl_basic_set_preimage(hull, Q); if (hull) { isl_vec_free(hull->sample); hull->sample = sample; } else isl_vec_free(sample); } isl_basic_set_free(cone); return hull; error: isl_basic_set_free(bset); isl_basic_set_free(cone); return NULL; } /* Look for all equalities satisfied by the integer points in bset, * which is assumed not to have any explicit equalities. * * The equalities are obtained by successively looking for * a point that is affinely independent of the points found so far. * In particular, for each equality satisfied by the points so far, * we check if there is any point on a hyperplane parallel to the * corresponding hyperplane shifted by at least one (in either direction). * * Before looking for any outside points, we first compute the recession * cone. The directions of this recession cone will always be part * of the affine hull, so there is no need for looking for any points * in these directions. * In particular, if the recession cone is full-dimensional, then * the affine hull is simply the whole universe. */ static struct isl_basic_set *uset_affine_hull(struct isl_basic_set *bset) { struct isl_basic_set *cone; if (isl_basic_set_plain_is_empty(bset)) return bset; cone = isl_basic_set_recession_cone(isl_basic_set_copy(bset)); if (!cone) goto error; if (cone->n_eq == 0) { struct isl_basic_set *hull; isl_basic_set_free(cone); hull = isl_basic_set_universe_like(bset); isl_basic_set_free(bset); return hull; } if (cone->n_eq < isl_basic_set_total_dim(cone)) return affine_hull_with_cone(bset, cone); isl_basic_set_free(cone); return uset_affine_hull_bounded(bset); error: isl_basic_set_free(bset); return NULL; } /* Look for all equalities satisfied by the integer points in bmap * that are independent of the equalities already explicitly available * in bmap. * * We first remove all equalities already explicitly available, * then look for additional equalities in the reduced space * and then transform the result to the original space. * The original equalities are _not_ added to this set. This is * the responsibility of the calling function. * The resulting basic set has all meaning about the dimensions removed. * In particular, dimensions that correspond to existential variables * in bmap and that are found to be fixed are not removed. */ static struct isl_basic_set *equalities_in_underlying_set( struct isl_basic_map *bmap) { struct isl_mat *T1 = NULL; struct isl_mat *T2 = NULL; struct isl_basic_set *bset = NULL; struct isl_basic_set *hull = NULL; bset = isl_basic_map_underlying_set(bmap); if (!bset) return NULL; if (bset->n_eq) bset = isl_basic_set_remove_equalities(bset, &T1, &T2); if (!bset) goto error; hull = uset_affine_hull(bset); if (!T2) return hull; if (!hull) { isl_mat_free(T1); isl_mat_free(T2); } else { struct isl_vec *sample = isl_vec_copy(hull->sample); if (sample && sample->size > 0) sample = isl_mat_vec_product(T1, sample); else isl_mat_free(T1); hull = isl_basic_set_preimage(hull, T2); if (hull) { isl_vec_free(hull->sample); hull->sample = sample; } else isl_vec_free(sample); } return hull; error: isl_mat_free(T1); isl_mat_free(T2); isl_basic_set_free(bset); isl_basic_set_free(hull); return NULL; } /* Detect and make explicit all equalities satisfied by the (integer) * points in bmap. */ struct isl_basic_map *isl_basic_map_detect_equalities( struct isl_basic_map *bmap) { int i, j; struct isl_basic_set *hull = NULL; if (!bmap) return NULL; if (bmap->n_ineq == 0) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_ALL_EQUALITIES)) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) return isl_basic_map_implicit_equalities(bmap); hull = equalities_in_underlying_set(isl_basic_map_copy(bmap)); if (!hull) goto error; if (ISL_F_ISSET(hull, ISL_BASIC_SET_EMPTY)) { isl_basic_set_free(hull); return isl_basic_map_set_to_empty(bmap); } bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim), 0, hull->n_eq, 0); for (i = 0; i < hull->n_eq; ++i) { j = isl_basic_map_alloc_equality(bmap); if (j < 0) goto error; isl_seq_cpy(bmap->eq[j], hull->eq[i], 1 + isl_basic_set_total_dim(hull)); } isl_vec_free(bmap->sample); bmap->sample = isl_vec_copy(hull->sample); isl_basic_set_free(hull); ISL_F_SET(bmap, ISL_BASIC_MAP_NO_IMPLICIT | ISL_BASIC_MAP_ALL_EQUALITIES); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_set_free(hull); isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_detect_equalities( __isl_take isl_basic_set *bset) { return (isl_basic_set *) isl_basic_map_detect_equalities((isl_basic_map *)bset); } __isl_give isl_map *isl_map_detect_equalities(__isl_take isl_map *map) { return isl_map_inline_foreach_basic_map(map, &isl_basic_map_detect_equalities); } __isl_give isl_set *isl_set_detect_equalities(__isl_take isl_set *set) { return (isl_set *)isl_map_detect_equalities((isl_map *)set); } /* After computing the rational affine hull (by detecting the implicit * equalities), we compute the additional equalities satisfied by * the integer points (if any) and add the original equalities back in. */ struct isl_basic_map *isl_basic_map_affine_hull(struct isl_basic_map *bmap) { bmap = isl_basic_map_detect_equalities(bmap); bmap = isl_basic_map_cow(bmap); if (bmap) isl_basic_map_free_inequality(bmap, bmap->n_ineq); bmap = isl_basic_map_finalize(bmap); return bmap; } struct isl_basic_set *isl_basic_set_affine_hull(struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_affine_hull((struct isl_basic_map *)bset); } /* Given a rational affine matrix "M", add stride constraints to "bmap" * that ensure that * * M(x) * * is an integer vector. The variables x include all the variables * of "bmap" except the unknown divs. * * If d is the common denominator of M, then we need to impose that * * d M(x) = 0 mod d * * or * * exists alpha : d M(x) = d alpha * * This function is similar to add_strides in isl_morph.c */ static __isl_give isl_basic_map *add_strides(__isl_take isl_basic_map *bmap, __isl_keep isl_mat *M, int n_known) { int i, div, k; isl_int gcd; if (isl_int_is_one(M->row[0][0])) return bmap; bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim), M->n_row - 1, M->n_row - 1, 0); isl_int_init(gcd); for (i = 1; i < M->n_row; ++i) { isl_seq_gcd(M->row[i], M->n_col, &gcd); if (isl_int_is_divisible_by(gcd, M->row[0][0])) continue; div = isl_basic_map_alloc_div(bmap); if (div < 0) goto error; isl_int_set_si(bmap->div[div][0], 0); k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->eq[k], M->row[i], M->n_col); isl_seq_clr(bmap->eq[k] + M->n_col, bmap->n_div - n_known); isl_int_set(bmap->eq[k][M->n_col - n_known + div], M->row[0][0]); } isl_int_clear(gcd); return bmap; error: isl_int_clear(gcd); isl_basic_map_free(bmap); return NULL; } /* If there are any equalities that involve (multiple) unknown divs, * then extract the stride information encoded by those equalities * and make it explicitly available in "bmap". * * We first sort the divs so that the unknown divs appear last and * then we count how many equalities involve these divs. * * Let these equalities be of the form * * A(x) + B y = 0 * * where y represents the unknown divs and x the remaining variables. * Let [H 0] be the Hermite Normal Form of B, i.e., * * B = [H 0] Q * * Then x is a solution of the equalities iff * * H^-1 A(x) (= - [I 0] Q y) * * is an integer vector. Let d be the common denominator of H^-1. * We impose * * d H^-1 A(x) = d alpha * * in add_strides, with alpha fresh existentially quantified variables. */ static __isl_give isl_basic_map *isl_basic_map_make_strides_explicit( __isl_take isl_basic_map *bmap) { int known; int n_known; int n, n_col; int total; isl_ctx *ctx; isl_mat *A, *B, *M; known = isl_basic_map_divs_known(bmap); if (known < 0) return isl_basic_map_free(bmap); if (known) return bmap; bmap = isl_basic_map_sort_divs(bmap); bmap = isl_basic_map_gauss(bmap, NULL); if (!bmap) return NULL; for (n_known = 0; n_known < bmap->n_div; ++n_known) if (isl_int_is_zero(bmap->div[n_known][0])) break; ctx = isl_basic_map_get_ctx(bmap); total = isl_space_dim(bmap->dim, isl_dim_all); for (n = 0; n < bmap->n_eq; ++n) if (isl_seq_first_non_zero(bmap->eq[n] + 1 + total + n_known, bmap->n_div - n_known) == -1) break; if (n == 0) return bmap; B = isl_mat_sub_alloc6(ctx, bmap->eq, 0, n, 0, 1 + total + n_known); n_col = bmap->n_div - n_known; A = isl_mat_sub_alloc6(ctx, bmap->eq, 0, n, 1 + total + n_known, n_col); A = isl_mat_left_hermite(A, 0, NULL, NULL); A = isl_mat_drop_cols(A, n, n_col - n); A = isl_mat_lin_to_aff(A); A = isl_mat_right_inverse(A); B = isl_mat_insert_zero_rows(B, 0, 1); B = isl_mat_set_element_si(B, 0, 0, 1); M = isl_mat_product(A, B); if (!M) return isl_basic_map_free(bmap); bmap = add_strides(bmap, M, n_known); bmap = isl_basic_map_gauss(bmap, NULL); isl_mat_free(M); return bmap; } /* Compute the affine hull of each basic map in "map" separately * and make all stride information explicit so that we can remove * all unknown divs without losing this information. * The result is also guaranteed to be gaussed. * * In simple cases where a div is determined by an equality, * calling isl_basic_map_gauss is enough to make the stride information * explicit, as it will derive an explicit representation for the div * from the equality. If, however, the stride information * is encoded through multiple unknown divs then we need to make * some extra effort in isl_basic_map_make_strides_explicit. */ static __isl_give isl_map *isl_map_local_affine_hull(__isl_take isl_map *map) { int i; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_affine_hull(map->p[i]); map->p[i] = isl_basic_map_gauss(map->p[i], NULL); map->p[i] = isl_basic_map_make_strides_explicit(map->p[i]); if (!map->p[i]) return isl_map_free(map); } return map; } static __isl_give isl_set *isl_set_local_affine_hull(__isl_take isl_set *set) { return isl_map_local_affine_hull(set); } /* Compute the affine hull of "map". * * We first compute the affine hull of each basic map separately. * Then we align the divs and recompute the affine hulls of the basic * maps since some of them may now have extra divs. * In order to avoid performing parametric integer programming to * compute explicit expressions for the divs, possible leading to * an explosion in the number of basic maps, we first drop all unknown * divs before aligning the divs. Note that isl_map_local_affine_hull tries * to make sure that all stride information is explicitly available * in terms of known divs. This involves calling isl_basic_set_gauss, * which is also needed because affine_hull assumes its input has been gaussed, * while isl_map_affine_hull may be called on input that has not been gaussed, * in particular from initial_facet_constraint. * Similarly, align_divs may reorder some divs so that we need to * gauss the result again. * Finally, we combine the individual affine hulls into a single * affine hull. */ __isl_give isl_basic_map *isl_map_affine_hull(__isl_take isl_map *map) { struct isl_basic_map *model = NULL; struct isl_basic_map *hull = NULL; struct isl_set *set; isl_basic_set *bset; map = isl_map_detect_equalities(map); map = isl_map_local_affine_hull(map); map = isl_map_remove_empty_parts(map); map = isl_map_remove_unknown_divs(map); map = isl_map_align_divs(map); if (!map) return NULL; if (map->n == 0) { hull = isl_basic_map_empty_like_map(map); isl_map_free(map); return hull; } model = isl_basic_map_copy(map->p[0]); set = isl_map_underlying_set(map); set = isl_set_cow(set); set = isl_set_local_affine_hull(set); if (!set) goto error; while (set->n > 1) set->p[0] = affine_hull(set->p[0], set->p[--set->n]); bset = isl_basic_set_copy(set->p[0]); hull = isl_basic_map_overlying_set(bset, model); isl_set_free(set); hull = isl_basic_map_simplify(hull); return isl_basic_map_finalize(hull); error: isl_basic_map_free(model); isl_set_free(set); return NULL; } struct isl_basic_set *isl_set_affine_hull(struct isl_set *set) { return (struct isl_basic_set *) isl_map_affine_hull((struct isl_map *)set); } cloog-0.18.2/isl/isl_reordering.h0000664000175000017500000000207112254313240013573 00000000000000#ifndef ISL_REORDERING_H #define ISL_REORDERING_H #include /* pos maps original dimensions to new dimensions. * The final dimension is given by dim. * The number of dimensions (i.e., the range of values) in the result * may be larger than the number of dimensions in the input. * In particular, the possible values of the entries in pos ranges from 0 to * the total dimension of dim - 1, unless isl_reordering_extend * has been called. */ struct isl_reordering { int ref; isl_space *dim; unsigned len; int pos[1]; }; typedef struct isl_reordering isl_reordering; __isl_give isl_reordering *isl_parameter_alignment_reordering( __isl_keep isl_space *alignee, __isl_keep isl_space *aligner); __isl_give isl_reordering *isl_reordering_copy(__isl_keep isl_reordering *exp); void *isl_reordering_free(__isl_take isl_reordering *exp); __isl_give isl_reordering *isl_reordering_extend_space( __isl_take isl_reordering *exp, __isl_take isl_space *dim); __isl_give isl_reordering *isl_reordering_extend(__isl_take isl_reordering *exp, unsigned extra); #endif cloog-0.18.2/isl/isl_stream_private.h0000664000175000017500000000016212254313240014457 00000000000000#include struct isl_token *isl_token_new(isl_ctx *ctx, int line, int col, unsigned on_new_line); cloog-0.18.2/isl/pip.c0000664000175000017500000002245312254313240011355 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include #include #include "isl_tab.h" #include "isl_sample.h" #include "isl_scan.h" #include #include #include #include #include /* The input of this program is the same as that of the "example" program * from the PipLib distribution, except that the "big parameter column" * should always be -1. * * Context constraints in PolyLib format * -1 * Problem constraints in PolyLib format * Optional list of options * * The options are * Maximize compute maximum instead of minimum * Rational compute rational optimum instead of integer optimum * Urs_parms don't assume parameters are non-negative * Urs_unknowns don't assume unknowns are non-negative */ struct options { struct isl_options *isl; unsigned verify; unsigned format; }; #define FORMAT_SET 0 #define FORMAT_AFF 1 struct isl_arg_choice pip_format[] = { {"set", FORMAT_SET}, {"affine", FORMAT_AFF}, {0} }; ISL_ARGS_START(struct options, options_args) ISL_ARG_CHILD(struct options, isl, "isl", &isl_options_args, "isl options") ISL_ARG_BOOL(struct options, verify, 'T', "verify", 0, NULL) ISL_ARG_CHOICE(struct options, format, 0, "format", pip_format, FORMAT_SET, "output format") ISL_ARGS_END ISL_ARG_DEF(options, struct options, options_args) static __isl_give isl_basic_set *set_bounds(__isl_take isl_basic_set *bset) { unsigned nparam; int i, r; isl_point *pt, *pt2; isl_basic_set *box; nparam = isl_basic_set_dim(bset, isl_dim_param); r = nparam >= 8 ? 4 : nparam >= 5 ? 6 : 30; pt = isl_basic_set_sample_point(isl_basic_set_copy(bset)); pt2 = isl_point_copy(pt); for (i = 0; i < nparam; ++i) { pt = isl_point_add_ui(pt, isl_dim_param, i, r); pt2 = isl_point_sub_ui(pt2, isl_dim_param, i, r); } box = isl_basic_set_box_from_points(pt, pt2); return isl_basic_set_intersect(bset, box); } static struct isl_basic_set *to_parameter_domain(struct isl_basic_set *context) { context = isl_basic_set_move_dims(context, isl_dim_param, 0, isl_dim_set, 0, isl_basic_set_dim(context, isl_dim_set)); context = isl_basic_set_params(context); return context; } isl_basic_set *plug_in_parameters(isl_basic_set *bset, struct isl_vec *params) { int i; for (i = 0; i < params->size - 1; ++i) bset = isl_basic_set_fix(bset, isl_dim_param, i, params->el[1 + i]); bset = isl_basic_set_remove_dims(bset, isl_dim_param, 0, params->size - 1); isl_vec_free(params); return bset; } isl_set *set_plug_in_parameters(isl_set *set, struct isl_vec *params) { int i; for (i = 0; i < params->size - 1; ++i) set = isl_set_fix(set, isl_dim_param, i, params->el[1 + i]); set = isl_set_remove_dims(set, isl_dim_param, 0, params->size - 1); isl_vec_free(params); return set; } /* Compute the lexicographically minimal (or maximal if max is set) * element of bset for the given values of the parameters, by * successively solving an ilp problem in each direction. */ struct isl_vec *opt_at(struct isl_basic_set *bset, struct isl_vec *params, int max) { unsigned dim; struct isl_vec *opt; struct isl_vec *obj; int i; dim = isl_basic_set_dim(bset, isl_dim_set); bset = plug_in_parameters(bset, params); if (isl_basic_set_plain_is_empty(bset)) { opt = isl_vec_alloc(bset->ctx, 0); isl_basic_set_free(bset); return opt; } opt = isl_vec_alloc(bset->ctx, 1 + dim); assert(opt); obj = isl_vec_alloc(bset->ctx, 1 + dim); assert(obj); isl_int_set_si(opt->el[0], 1); isl_int_set_si(obj->el[0], 0); for (i = 0; i < dim; ++i) { enum isl_lp_result res; isl_seq_clr(obj->el + 1, dim); isl_int_set_si(obj->el[1 + i], 1); res = isl_basic_set_solve_ilp(bset, max, obj->el, &opt->el[1 + i], NULL); if (res == isl_lp_empty) goto empty; assert(res == isl_lp_ok); bset = isl_basic_set_fix(bset, isl_dim_set, i, opt->el[1 + i]); } isl_basic_set_free(bset); isl_vec_free(obj); return opt; empty: isl_vec_free(opt); opt = isl_vec_alloc(bset->ctx, 0); isl_basic_set_free(bset); isl_vec_free(obj); return opt; } struct isl_scan_pip { struct isl_scan_callback callback; isl_basic_set *bset; isl_set *sol; isl_set *empty; int stride; int n; int max; }; /* Check if the "manually" computed optimum of bset at the "sample" * values of the parameters agrees with the solution of pilp problem * represented by the pair (sol, empty). * In particular, if there is no solution for this value of the parameters, * then it should be an element of the parameter domain "empty". * Otherwise, the optimal solution, should be equal to the result of * plugging in the value of the parameters in "sol". */ static int scan_one(struct isl_scan_callback *callback, __isl_take isl_vec *sample) { struct isl_scan_pip *sp = (struct isl_scan_pip *)callback; struct isl_vec *opt; sp->n--; opt = opt_at(isl_basic_set_copy(sp->bset), isl_vec_copy(sample), sp->max); assert(opt); if (opt->size == 0) { isl_point *sample_pnt; sample_pnt = isl_point_alloc(isl_set_get_space(sp->empty), sample); assert(isl_set_contains_point(sp->empty, sample_pnt)); isl_point_free(sample_pnt); isl_vec_free(opt); } else { isl_set *sol; isl_set *opt_set; opt_set = isl_set_from_basic_set(isl_basic_set_from_vec(opt)); sol = set_plug_in_parameters(isl_set_copy(sp->sol), sample); assert(isl_set_is_equal(opt_set, sol)); isl_set_free(sol); isl_set_free(opt_set); } if (!(sp->n % sp->stride)) { printf("o"); fflush(stdout); } return sp->n >= 1 ? 0 : -1; } static void check_solution(isl_basic_set *bset, isl_basic_set *context, isl_set *sol, isl_set *empty, int max) { struct isl_scan_pip sp; isl_int count, count_max; int i, n; int r; context = set_bounds(context); context = isl_basic_set_underlying_set(context); isl_int_init(count); isl_int_init(count_max); isl_int_set_si(count_max, 2000); r = isl_basic_set_count_upto(context, count_max, &count); assert(r >= 0); n = isl_int_get_si(count); isl_int_clear(count_max); isl_int_clear(count); sp.callback.add = scan_one; sp.bset = bset; sp.sol = sol; sp.empty = empty; sp.n = n; sp.stride = n > 70 ? 1 + (n + 1)/70 : 1; sp.max = max; for (i = 0; i < n; i += sp.stride) printf("."); printf("\r"); fflush(stdout); isl_basic_set_scan(context, &sp.callback); printf("\n"); isl_basic_set_free(bset); } int main(int argc, char **argv) { struct isl_ctx *ctx; struct isl_basic_set *context, *bset, *copy, *context_copy; struct isl_set *set = NULL; struct isl_set *empty; isl_pw_multi_aff *pma = NULL; int neg_one; char s[1024]; int urs_parms = 0; int urs_unknowns = 0; int max = 0; int rational = 0; int n; int nparam; struct options *options; options = options_new_with_defaults(); assert(options); argc = options_parse(options, argc, argv, ISL_ARG_ALL); ctx = isl_ctx_alloc_with_options(&options_args, options); context = isl_basic_set_read_from_file(ctx, stdin); assert(context); n = fscanf(stdin, "%d", &neg_one); assert(n == 1); assert(neg_one == -1); bset = isl_basic_set_read_from_file(ctx, stdin); while (fgets(s, sizeof(s), stdin)) { if (strncasecmp(s, "Maximize", 8) == 0) max = 1; if (strncasecmp(s, "Rational", 8) == 0) { rational = 1; bset = isl_basic_set_set_rational(bset); } if (strncasecmp(s, "Urs_parms", 9) == 0) urs_parms = 1; if (strncasecmp(s, "Urs_unknowns", 12) == 0) urs_unknowns = 1; } if (!urs_parms) context = isl_basic_set_intersect(context, isl_basic_set_positive_orthant(isl_basic_set_get_space(context))); context = to_parameter_domain(context); nparam = isl_basic_set_dim(context, isl_dim_param); if (nparam != isl_basic_set_dim(bset, isl_dim_param)) { int dim = isl_basic_set_dim(bset, isl_dim_set); bset = isl_basic_set_move_dims(bset, isl_dim_param, 0, isl_dim_set, dim - nparam, nparam); } if (!urs_unknowns) bset = isl_basic_set_intersect(bset, isl_basic_set_positive_orthant(isl_basic_set_get_space(bset))); if (options->verify) { copy = isl_basic_set_copy(bset); context_copy = isl_basic_set_copy(context); } if (options->format == FORMAT_AFF) { if (max) pma = isl_basic_set_partial_lexmax_pw_multi_aff(bset, context, &empty); else pma = isl_basic_set_partial_lexmin_pw_multi_aff(bset, context, &empty); } else { if (max) set = isl_basic_set_partial_lexmax(bset, context, &empty); else set = isl_basic_set_partial_lexmin(bset, context, &empty); } if (options->verify) { assert(!rational); if (options->format == FORMAT_AFF) set = isl_set_from_pw_multi_aff(pma); check_solution(copy, context_copy, set, empty, max); isl_set_free(set); } else { isl_printer *p; p = isl_printer_to_file(ctx, stdout); if (options->format == FORMAT_AFF) p = isl_printer_print_pw_multi_aff(p, pma); else p = isl_printer_print_set(p, set); p = isl_printer_end_line(p); p = isl_printer_print_str(p, "no solution: "); p = isl_printer_print_set(p, empty); p = isl_printer_end_line(p); isl_printer_free(p); isl_set_free(set); isl_pw_multi_aff_free(pma); } isl_set_free(empty); isl_ctx_free(ctx); return 0; } cloog-0.18.2/isl/isl_lp_piplib.h0000664000175000017500000000113112254313240013401 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_LP_PIPLIB_H #define ISL_LP_PIPLIB_H #include #if defined(__cplusplus) extern "C" { #endif enum isl_lp_result isl_pip_solve_lp(struct isl_basic_map *bmap, int maximize, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/isl_tab.h0000664000175000017500000002513212254313240012204 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_TAB_H #define ISL_TAB_H #include #include #include #include struct isl_tab_var { int index; unsigned is_row : 1; unsigned is_nonneg : 1; unsigned is_zero : 1; unsigned is_redundant : 1; unsigned marked : 1; unsigned frozen : 1; unsigned negated : 1; }; enum isl_tab_undo_type { isl_tab_undo_bottom, isl_tab_undo_empty, isl_tab_undo_nonneg, isl_tab_undo_redundant, isl_tab_undo_freeze, isl_tab_undo_zero, isl_tab_undo_allocate, isl_tab_undo_relax, isl_tab_undo_unrestrict, isl_tab_undo_bmap_ineq, isl_tab_undo_bmap_eq, isl_tab_undo_bmap_div, isl_tab_undo_saved_basis, isl_tab_undo_drop_sample, isl_tab_undo_saved_samples, isl_tab_undo_callback, }; struct isl_tab_callback { int (*run)(struct isl_tab_callback *cb); }; union isl_tab_undo_val { int var_index; int *col_var; int n; struct isl_tab_callback *callback; }; struct isl_tab_undo { enum isl_tab_undo_type type; union isl_tab_undo_val u; struct isl_tab_undo *next; }; /* The tableau maintains equality relations. * Each column and each row is associated to a variable or a constraint. * The "value" of an inequality constraint is the value of the corresponding * slack variable. * The "row_var" and "col_var" arrays map column and row indices * to indices in the "var" and "con" arrays. The elements of these * arrays maintain extra information about the variables and the constraints. * Each row expresses the corresponding row variable as an affine expression * of the column variables. * The first two columns in the matrix contain the common denominator of * the row and the numerator of the constant term. * If "M" is set, then the third column represents the "big parameter". * The third (M = 0) or fourth (M = 1) column * in the matrix is called column 0 with respect to the col_var array. * The sample value of the tableau is the value that assigns zero * to all the column variables and the constant term of each affine * expression to the corresponding row variable. * The operations on the tableau maintain the property that the sample * value satisfies the non-negativity constraints (usually on the slack * variables). * * The big parameter represents an arbitrarily big (and divisible) * positive number. If present, then the sign of a row is determined * lexicographically, with the sign of the big parameter coefficient * considered first. The big parameter is only used while * solving PILP problems. * * The first n_dead column variables have their values fixed to zero. * The corresponding tab_vars are flagged "is_zero". * Some of the rows that have have zero coefficients in all but * the dead columns are also flagged "is_zero". * * The first n_redundant rows correspond to inequality constraints * that are always satisfied for any value satisfying the non-redundant * rows. The corresponding tab_vars are flagged "is_redundant". * A row variable that is flagged "is_zero" is also flagged "is_redundant" * since the constraint has been reduced to 0 = 0 and is therefore always * satisfied. * * There are "n_var" variables in total. The first "n_param" of these * are called parameters and the last "n_div" of these are called divs. * The basic tableau operations makes no distinction between different * kinds of variables. These special variables are only used while * solving PILP problems. * * Dead columns and redundant rows are detected on the fly. * However, the basic operations do not ensure that all dead columns * or all redundant rows are detected. * isl_tab_detect_implicit_equalities and isl_tab_detect_redundant can be used * to perform and exhaustive search for dead columns and redundant rows. * * The samples matrix contains "n_sample" integer points that have at some * point been elements satisfying the tableau. The first "n_outside" * of them no longer satisfy the tableau. They are kept because they * can be reinstated during rollback when the constraint that cut them * out is removed. These samples are only maintained for the context * tableau while solving PILP problems. * * If "preserve" is set, then we want to keep all constraints in the * tableau, even if they turn out to be redundant. */ enum isl_tab_row_sign { isl_tab_row_unknown = 0, isl_tab_row_pos, isl_tab_row_neg, isl_tab_row_any, }; struct isl_tab { struct isl_mat *mat; unsigned n_row; unsigned n_col; unsigned n_dead; unsigned n_redundant; unsigned n_var; unsigned n_param; unsigned n_div; unsigned max_var; unsigned n_con; unsigned n_eq; unsigned max_con; struct isl_tab_var *var; struct isl_tab_var *con; int *row_var; /* v >= 0 -> var v; v < 0 -> con ~v */ int *col_var; /* v >= 0 -> var v; v < 0 -> con ~v */ enum isl_tab_row_sign *row_sign; struct isl_tab_undo bottom; struct isl_tab_undo *top; struct isl_vec *dual; struct isl_basic_map *bmap; unsigned n_sample; unsigned n_outside; int *sample_index; struct isl_mat *samples; int n_zero; int n_unbounded; struct isl_mat *basis; int (*conflict)(int con, void *user); void *conflict_user; unsigned strict_redundant : 1; unsigned need_undo : 1; unsigned preserve : 1; unsigned rational : 1; unsigned empty : 1; unsigned in_undo : 1; unsigned M : 1; unsigned cone : 1; }; struct isl_tab *isl_tab_alloc(struct isl_ctx *ctx, unsigned n_row, unsigned n_var, unsigned M); void isl_tab_free(struct isl_tab *tab); isl_ctx *isl_tab_get_ctx(struct isl_tab *tab); __isl_give struct isl_tab *isl_tab_from_basic_map( __isl_keep isl_basic_map *bmap, int track); __isl_give struct isl_tab *isl_tab_from_basic_set( __isl_keep isl_basic_set *bset, int track); struct isl_tab *isl_tab_from_recession_cone(struct isl_basic_set *bset, int parametric); int isl_tab_cone_is_bounded(struct isl_tab *tab); struct isl_basic_map *isl_basic_map_update_from_tab(struct isl_basic_map *bmap, struct isl_tab *tab); struct isl_basic_set *isl_basic_set_update_from_tab(struct isl_basic_set *bset, struct isl_tab *tab); int isl_tab_detect_implicit_equalities(struct isl_tab *tab) WARN_UNUSED; __isl_give isl_basic_map *isl_tab_make_equalities_explicit(struct isl_tab *tab, __isl_take isl_basic_map *bmap); int isl_tab_detect_redundant(struct isl_tab *tab) WARN_UNUSED; #define ISL_TAB_SAVE_DUAL (1 << 0) enum isl_lp_result isl_tab_min(struct isl_tab *tab, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, unsigned flags) WARN_UNUSED; struct isl_tab *isl_tab_extend(struct isl_tab *tab, unsigned n_new) WARN_UNUSED; int isl_tab_add_ineq(struct isl_tab *tab, isl_int *ineq) WARN_UNUSED; int isl_tab_add_eq(struct isl_tab *tab, isl_int *eq) WARN_UNUSED; int isl_tab_add_valid_eq(struct isl_tab *tab, isl_int *eq) WARN_UNUSED; int isl_tab_freeze_constraint(struct isl_tab *tab, int con) WARN_UNUSED; int isl_tab_track_bmap(struct isl_tab *tab, __isl_take isl_basic_map *bmap) WARN_UNUSED; int isl_tab_track_bset(struct isl_tab *tab, __isl_take isl_basic_set *bset) WARN_UNUSED; __isl_keep isl_basic_set *isl_tab_peek_bset(struct isl_tab *tab); int isl_tab_is_equality(struct isl_tab *tab, int con); int isl_tab_is_redundant(struct isl_tab *tab, int con); int isl_tab_sample_is_integer(struct isl_tab *tab); struct isl_vec *isl_tab_get_sample_value(struct isl_tab *tab); enum isl_ineq_type { isl_ineq_error = -1, isl_ineq_redundant, isl_ineq_separate, isl_ineq_cut, isl_ineq_adj_eq, isl_ineq_adj_ineq, }; enum isl_ineq_type isl_tab_ineq_type(struct isl_tab *tab, isl_int *ineq); struct isl_tab_undo *isl_tab_snap(struct isl_tab *tab); int isl_tab_rollback(struct isl_tab *tab, struct isl_tab_undo *snap) WARN_UNUSED; struct isl_tab *isl_tab_relax(struct isl_tab *tab, int con) WARN_UNUSED; int isl_tab_select_facet(struct isl_tab *tab, int con) WARN_UNUSED; int isl_tab_unrestrict(struct isl_tab *tab, int con) WARN_UNUSED; void isl_tab_dump(__isl_keep struct isl_tab *tab); struct isl_map *isl_tab_basic_map_partial_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max); __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexopt_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max); /* An isl_region represents a sequence of consecutive variables. * pos is the location (starting at 0) of the first variable in the sequence. */ struct isl_region { int pos; int len; }; __isl_give isl_vec *isl_tab_basic_set_non_trivial_lexmin( __isl_take isl_basic_set *bset, int n_op, int n_region, struct isl_region *region, int (*conflict)(int con, void *user), void *user); __isl_give isl_vec *isl_tab_basic_set_non_neg_lexmin( __isl_take isl_basic_set *bset); /* private */ struct isl_tab_var *isl_tab_var_from_row(struct isl_tab *tab, int i); int isl_tab_mark_redundant(struct isl_tab *tab, int row) WARN_UNUSED; int isl_tab_mark_empty(struct isl_tab *tab) WARN_UNUSED; struct isl_tab *isl_tab_dup(struct isl_tab *tab); struct isl_tab *isl_tab_product(struct isl_tab *tab1, struct isl_tab *tab2); int isl_tab_extend_cons(struct isl_tab *tab, unsigned n_new) WARN_UNUSED; int isl_tab_allocate_con(struct isl_tab *tab) WARN_UNUSED; int isl_tab_extend_vars(struct isl_tab *tab, unsigned n_new) WARN_UNUSED; int isl_tab_allocate_var(struct isl_tab *tab) WARN_UNUSED; int isl_tab_pivot(struct isl_tab *tab, int row, int col) WARN_UNUSED; int isl_tab_add_row(struct isl_tab *tab, isl_int *line) WARN_UNUSED; int isl_tab_row_is_redundant(struct isl_tab *tab, int row); int isl_tab_min_at_most_neg_one(struct isl_tab *tab, struct isl_tab_var *var); int isl_tab_sign_of_max(struct isl_tab *tab, int con); int isl_tab_kill_col(struct isl_tab *tab, int col) WARN_UNUSED; int isl_tab_push(struct isl_tab *tab, enum isl_tab_undo_type type) WARN_UNUSED; int isl_tab_push_var(struct isl_tab *tab, enum isl_tab_undo_type type, struct isl_tab_var *var) WARN_UNUSED; int isl_tab_push_basis(struct isl_tab *tab) WARN_UNUSED; struct isl_tab *isl_tab_init_samples(struct isl_tab *tab) WARN_UNUSED; struct isl_tab *isl_tab_add_sample(struct isl_tab *tab, __isl_take isl_vec *sample) WARN_UNUSED; struct isl_tab *isl_tab_drop_sample(struct isl_tab *tab, int s); int isl_tab_save_samples(struct isl_tab *tab) WARN_UNUSED; struct isl_tab *isl_tab_detect_equalities(struct isl_tab *tab, struct isl_tab *tab_cone) WARN_UNUSED; int isl_tab_push_callback(struct isl_tab *tab, struct isl_tab_callback *callback) WARN_UNUSED; int isl_tab_add_div(struct isl_tab *tab, __isl_keep isl_vec *div, int (*add_ineq)(void *user, isl_int *), void *user); #endif cloog-0.18.2/isl/Makefile.in0000664000175000017500000047357212254313260012504 00000000000000# Makefile.in generated by automake 1.11.3 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ noinst_PROGRAMS = isl_test$(EXEEXT) isl_polyhedron_sample$(EXEEXT) \ isl_pip$(EXEEXT) isl_polyhedron_minimize$(EXEEXT) \ isl_polytope_scan$(EXEEXT) \ isl_polyhedron_detect_equalities$(EXEEXT) isl_cat$(EXEEXT) \ isl_closure$(EXEEXT) isl_bound$(EXEEXT) isl_codegen$(EXEEXT) TESTS = isl_test$(EXEEXT) codegen_test.sh pip_test.sh bound_test.sh subdir = . DIST_COMMON = README $(am__configure_deps) $(pkginclude_HEADERS) \ $(srcdir)/Makefile.am $(srcdir)/Makefile.in \ $(srcdir)/bound_test.sh.in $(srcdir)/codegen_test.sh.in \ $(srcdir)/isl_config.h.in $(srcdir)/pip_test.sh.in \ $(top_srcdir)/configure $(top_srcdir)/include/isl/config.h.in \ AUTHORS ChangeLog config.guess config.sub depcomp install-sh \ ltmain.sh missing ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ax_c___attribute__.m4 \ $(top_srcdir)/m4/ax_cc_maxopt.m4 \ $(top_srcdir)/m4/ax_check_compiler_flags.m4 \ $(top_srcdir)/m4/ax_compiler_vendor.m4 \ $(top_srcdir)/m4/ax_create_pkgconfig_info.m4 \ $(top_srcdir)/m4/ax_create_stdint_h.m4 \ $(top_srcdir)/m4/ax_detect_git_head.m4 \ $(top_srcdir)/m4/ax_gcc_archflag.m4 \ $(top_srcdir)/m4/ax_gcc_warn_unused_result.m4 \ $(top_srcdir)/m4/ax_gcc_x86_cpuid.m4 \ $(top_srcdir)/m4/ax_set_warning_flags.m4 \ $(top_srcdir)/m4/ax_submodule.m4 $(top_srcdir)/m4/libtool.m4 \ $(top_srcdir)/m4/ltoptions.m4 $(top_srcdir)/m4/ltsugar.m4 \ $(top_srcdir)/m4/ltversion.m4 $(top_srcdir)/m4/lt~obsolete.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = isl_config.h $(top_builddir)/include/isl/config.h CONFIG_CLEAN_FILES = bound_test.sh codegen_test.sh pip_test.sh CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(pkgconfigdir)" \ "$(DESTDIR)$(pkgincludedir)" "$(DESTDIR)$(pkgincludedir)" LTLIBRARIES = $(lib_LTLIBRARIES) libisl_la_DEPENDENCIES = am__libisl_la_SOURCES_DIST = isl_lp_no_piplib.c isl_map_no_piplib.c \ isl_sample_no_piplib.c isl_lp_piplib.c isl_map_piplib.c \ isl_sample_piplib.c isl_sample_piplib.h isl_piplib.c \ mp_get_memory_functions.c isl_aff.c isl_aff_private.h \ isl_affine_hull.c isl_arg.c isl_ast.c isl_ast_private.h \ isl_ast_build.c isl_ast_build_private.h isl_ast_build_expr.c \ isl_ast_build_expr.h isl_ast_codegen.c isl_ast_graft.c \ isl_ast_graft_private.h isl_band.c isl_band_private.h \ isl_basis_reduction.h basis_reduction_tab.c isl_bernstein.c \ isl_bernstein.h isl_blk.c isl_bound.c isl_bound.h \ isl_coalesce.c isl_constraint.c isl_constraint_private.h \ isl_convex_hull.c isl_ctx.c isl_ctx_private.h isl_deprecated.c \ isl_dim.c isl_dim_map.h isl_dim_map.c isl_equalities.c \ isl_equalities.h isl_factorization.c isl_factorization.h \ isl_farkas.c isl_flow.c isl_fold.c isl_gmp.c isl_hash.c \ isl_hmap_map_basic_set.c isl_hmap_map_basic_set.h isl_ilp.c \ isl_input.c isl_int.h isl_local_space_private.h \ isl_local_space.c isl_lp.c isl_lp_piplib.h isl_map.c \ isl_map_simplify.c isl_map_subtract.c isl_map_private.h \ isl_map_piplib.h isl_mat.c isl_mat_private.h isl_morph.c \ isl_morph.h isl_id.c isl_id_private.h isl_obj.c isl_options.c \ isl_options_private.h isl_output.c isl_piplib.h \ isl_point_private.h isl_point.c isl_polynomial_private.h \ isl_polynomial.c isl_printer_private.h isl_printer.c print.c \ isl_range.c isl_range.h isl_reordering.c isl_reordering.h \ isl_sample.h isl_sample.c isl_scan.c isl_scan.h isl_schedule.c \ isl_schedule_private.h isl_set_list.c isl_sort.c isl_sort.h \ isl_space.c isl_space_private.h isl_stream.c \ isl_stream_private.h isl_seq.c isl_tab.c isl_tab.h \ isl_tab_pip.c isl_tarjan.c isl_tarjan.h \ isl_transitive_closure.c isl_union_map.c \ isl_union_map_private.h isl_val.c isl_val_gmp.c \ isl_val_private.h isl_vec.c isl_version.c \ isl_vertices_private.h isl_vertices.c @HAVE_PIPLIB_FALSE@am__objects_1 = libisl_la-isl_lp_no_piplib.lo \ @HAVE_PIPLIB_FALSE@ libisl_la-isl_map_no_piplib.lo \ @HAVE_PIPLIB_FALSE@ libisl_la-isl_sample_no_piplib.lo @HAVE_PIPLIB_TRUE@am__objects_1 = libisl_la-isl_lp_piplib.lo \ @HAVE_PIPLIB_TRUE@ libisl_la-isl_map_piplib.lo \ @HAVE_PIPLIB_TRUE@ libisl_la-isl_sample_piplib.lo \ @HAVE_PIPLIB_TRUE@ libisl_la-isl_piplib.lo @NEED_GET_MEMORY_FUNCTIONS_TRUE@am__objects_2 = libisl_la-mp_get_memory_functions.lo am_libisl_la_OBJECTS = $(am__objects_1) $(am__objects_2) \ libisl_la-isl_aff.lo libisl_la-isl_affine_hull.lo \ libisl_la-isl_arg.lo libisl_la-isl_ast.lo \ libisl_la-isl_ast_build.lo libisl_la-isl_ast_build_expr.lo \ libisl_la-isl_ast_codegen.lo libisl_la-isl_ast_graft.lo \ libisl_la-isl_band.lo libisl_la-basis_reduction_tab.lo \ libisl_la-isl_bernstein.lo libisl_la-isl_blk.lo \ libisl_la-isl_bound.lo libisl_la-isl_coalesce.lo \ libisl_la-isl_constraint.lo libisl_la-isl_convex_hull.lo \ libisl_la-isl_ctx.lo libisl_la-isl_deprecated.lo \ libisl_la-isl_dim.lo libisl_la-isl_dim_map.lo \ libisl_la-isl_equalities.lo libisl_la-isl_factorization.lo \ libisl_la-isl_farkas.lo libisl_la-isl_flow.lo \ libisl_la-isl_fold.lo libisl_la-isl_gmp.lo \ libisl_la-isl_hash.lo libisl_la-isl_hmap_map_basic_set.lo \ libisl_la-isl_ilp.lo libisl_la-isl_input.lo \ libisl_la-isl_local_space.lo libisl_la-isl_lp.lo \ libisl_la-isl_map.lo libisl_la-isl_map_simplify.lo \ libisl_la-isl_map_subtract.lo libisl_la-isl_mat.lo \ libisl_la-isl_morph.lo libisl_la-isl_id.lo \ libisl_la-isl_obj.lo libisl_la-isl_options.lo \ libisl_la-isl_output.lo libisl_la-isl_point.lo \ libisl_la-isl_polynomial.lo libisl_la-isl_printer.lo \ libisl_la-print.lo libisl_la-isl_range.lo \ libisl_la-isl_reordering.lo libisl_la-isl_sample.lo \ libisl_la-isl_scan.lo libisl_la-isl_schedule.lo \ libisl_la-isl_set_list.lo libisl_la-isl_sort.lo \ libisl_la-isl_space.lo libisl_la-isl_stream.lo \ libisl_la-isl_seq.lo libisl_la-isl_tab.lo \ libisl_la-isl_tab_pip.lo libisl_la-isl_tarjan.lo \ libisl_la-isl_transitive_closure.lo libisl_la-isl_union_map.lo \ libisl_la-isl_val.lo libisl_la-isl_val_gmp.lo \ libisl_la-isl_vec.lo libisl_la-isl_version.lo \ libisl_la-isl_vertices.lo libisl_la_OBJECTS = $(am_libisl_la_OBJECTS) AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent libisl_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(libisl_la_LDFLAGS) $(LDFLAGS) -o $@ PROGRAMS = $(noinst_PROGRAMS) am_isl_bound_OBJECTS = isl_bound-bound.$(OBJEXT) isl_bound_OBJECTS = $(am_isl_bound_OBJECTS) isl_bound_DEPENDENCIES = libisl.la isl_bound_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(isl_bound_LDFLAGS) $(LDFLAGS) -o $@ am_isl_cat_OBJECTS = isl_cat-cat.$(OBJEXT) isl_cat_OBJECTS = $(am_isl_cat_OBJECTS) isl_cat_DEPENDENCIES = libisl.la am_isl_closure_OBJECTS = isl_closure-closure.$(OBJEXT) isl_closure_OBJECTS = $(am_isl_closure_OBJECTS) isl_closure_DEPENDENCIES = libisl.la am_isl_codegen_OBJECTS = isl_codegen-codegen.$(OBJEXT) isl_codegen_OBJECTS = $(am_isl_codegen_OBJECTS) isl_codegen_DEPENDENCIES = libisl.la isl_codegen_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(isl_codegen_LDFLAGS) $(LDFLAGS) -o $@ am_isl_pip_OBJECTS = isl_pip-pip.$(OBJEXT) isl_pip_OBJECTS = $(am_isl_pip_OBJECTS) isl_pip_DEPENDENCIES = libisl.la isl_pip_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(isl_pip_LDFLAGS) $(LDFLAGS) -o $@ am_isl_polyhedron_detect_equalities_OBJECTS = isl_polyhedron_detect_equalities-polyhedron_detect_equalities.$(OBJEXT) isl_polyhedron_detect_equalities_OBJECTS = \ $(am_isl_polyhedron_detect_equalities_OBJECTS) isl_polyhedron_detect_equalities_DEPENDENCIES = libisl.la am_isl_polyhedron_minimize_OBJECTS = \ isl_polyhedron_minimize-polyhedron_minimize.$(OBJEXT) isl_polyhedron_minimize_OBJECTS = \ $(am_isl_polyhedron_minimize_OBJECTS) isl_polyhedron_minimize_DEPENDENCIES = libisl.la isl_polyhedron_minimize_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC \ $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CCLD) \ $(AM_CFLAGS) $(CFLAGS) $(isl_polyhedron_minimize_LDFLAGS) \ $(LDFLAGS) -o $@ am_isl_polyhedron_sample_OBJECTS = \ isl_polyhedron_sample-polyhedron_sample.$(OBJEXT) isl_polyhedron_sample_OBJECTS = $(am_isl_polyhedron_sample_OBJECTS) isl_polyhedron_sample_DEPENDENCIES = libisl.la am_isl_polytope_scan_OBJECTS = \ isl_polytope_scan-polytope_scan.$(OBJEXT) isl_polytope_scan_OBJECTS = $(am_isl_polytope_scan_OBJECTS) isl_polytope_scan_DEPENDENCIES = libisl.la isl_test_SOURCES = isl_test.c isl_test_OBJECTS = isl_test-isl_test.$(OBJEXT) isl_test_DEPENDENCIES = libisl.la isl_test_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(isl_test_LDFLAGS) $(LDFLAGS) -o $@ DEFAULT_INCLUDES = depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) AM_V_CC = $(am__v_CC_@AM_V@) am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@) am__v_CC_0 = @echo " CC " $@; AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ CCLD = $(CC) LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CCLD = $(am__v_CCLD_@AM_V@) am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@) am__v_CCLD_0 = @echo " CCLD " $@; AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; SOURCES = $(libisl_la_SOURCES) $(EXTRA_libisl_la_SOURCES) \ $(isl_bound_SOURCES) $(isl_cat_SOURCES) $(isl_closure_SOURCES) \ $(isl_codegen_SOURCES) $(isl_pip_SOURCES) \ $(isl_polyhedron_detect_equalities_SOURCES) \ $(isl_polyhedron_minimize_SOURCES) \ $(isl_polyhedron_sample_SOURCES) $(isl_polytope_scan_SOURCES) \ isl_test.c DIST_SOURCES = $(am__libisl_la_SOURCES_DIST) \ $(EXTRA_libisl_la_SOURCES) $(isl_bound_SOURCES) \ $(isl_cat_SOURCES) $(isl_closure_SOURCES) \ $(isl_codegen_SOURCES) $(isl_pip_SOURCES) \ $(isl_polyhedron_detect_equalities_SOURCES) \ $(isl_polyhedron_minimize_SOURCES) \ $(isl_polyhedron_sample_SOURCES) $(isl_polytope_scan_SOURCES) \ isl_test.c RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \ html-recursive info-recursive install-data-recursive \ install-dvi-recursive install-exec-recursive \ install-html-recursive install-info-recursive \ install-pdf-recursive install-ps-recursive install-recursive \ installcheck-recursive installdirs-recursive pdf-recursive \ ps-recursive uninstall-recursive DATA = $(pkgconfig_DATA) HEADERS = $(nodist_pkginclude_HEADERS) $(pkginclude_HEADERS) RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \ $(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \ distdir dist dist-all distcheck ETAGS = etags CTAGS = ctags am__tty_colors = \ red=; grn=; lgn=; blu=; std= DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ if test -d "$(distdir)"; then \ find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -rf "$(distdir)" \ || { sleep 5 && rm -rf "$(distdir)"; }; \ else :; fi am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" DIST_ARCHIVES = $(distdir).tar.gz GZIP_ENV = --best distuninstallcheck_listfiles = find . -type f -print am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \ | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$' distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CLANG_CXXFLAGS = @CLANG_CXXFLAGS@ CLANG_LDFLAGS = @CLANG_LDFLAGS@ CLANG_LIBS = @CLANG_LIBS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GIT_HEAD = @GIT_HEAD@ GIT_HEAD_ID = @GIT_HEAD_ID@ GIT_HEAD_VERSION = @GIT_HEAD_VERSION@ GMP_CPPFLAGS = @GMP_CPPFLAGS@ GMP_LDFLAGS = @GMP_LDFLAGS@ GMP_LIBS = @GMP_LIBS@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIB_CLANG_EDIT = @LIB_CLANG_EDIT@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PDFLATEX = @PDFLATEX@ PERL = @PERL@ PIPLIB_CPPFLAGS = @PIPLIB_CPPFLAGS@ PIPLIB_LDFLAGS = @PIPLIB_LDFLAGS@ PIPLIB_LIBS = @PIPLIB_LIBS@ POD2HTML = @POD2HTML@ PRTDIAG = @PRTDIAG@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ WARNING_FLAGS = @WARNING_FLAGS@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ llvm_config_found = @llvm_config_found@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ versioninfo = @versioninfo@ @HAVE_CLANG_TRUE@MAYBE_INTERFACE = interface SUBDIRS = . $(MAYBE_INTERFACE) doc DIST_SUBDIRS = $(MAYBE_INTERFACE) doc ACLOCAL_AMFLAGS = -I m4 AUTOMAKE_OPTIONS = nostdinc lib_LTLIBRARIES = libisl.la @HAVE_PIPLIB_FALSE@ISL_PIPLIB = \ @HAVE_PIPLIB_FALSE@ isl_lp_no_piplib.c \ @HAVE_PIPLIB_FALSE@ isl_map_no_piplib.c \ @HAVE_PIPLIB_FALSE@ isl_sample_no_piplib.c @HAVE_PIPLIB_TRUE@ISL_PIPLIB = \ @HAVE_PIPLIB_TRUE@ isl_lp_piplib.c \ @HAVE_PIPLIB_TRUE@ isl_map_piplib.c \ @HAVE_PIPLIB_TRUE@ isl_sample_piplib.c \ @HAVE_PIPLIB_TRUE@ isl_sample_piplib.h \ @HAVE_PIPLIB_TRUE@ isl_piplib.c @NEED_GET_MEMORY_FUNCTIONS_TRUE@GET_MEMORY_FUNCTIONS = mp_get_memory_functions.c INCLUDES = -I. -I$(srcdir) -I$(srcdir)/include -Iinclude/ AM_CFLAGS = @WARNING_FLAGS@ libisl_la_SOURCES = \ $(ISL_PIPLIB) \ $(GET_MEMORY_FUNCTIONS) \ isl_aff.c \ isl_aff_private.h \ isl_affine_hull.c \ isl_arg.c \ isl_ast.c \ isl_ast_private.h \ isl_ast_build.c \ isl_ast_build_private.h \ isl_ast_build_expr.c \ isl_ast_build_expr.h \ isl_ast_codegen.c \ isl_ast_graft.c \ isl_ast_graft_private.h \ isl_band.c \ isl_band_private.h \ isl_basis_reduction.h \ basis_reduction_tab.c \ isl_bernstein.c \ isl_bernstein.h \ isl_blk.c \ isl_bound.c \ isl_bound.h \ isl_coalesce.c \ isl_constraint.c \ isl_constraint_private.h \ isl_convex_hull.c \ isl_ctx.c \ isl_ctx_private.h \ isl_deprecated.c \ isl_dim.c \ isl_dim_map.h \ isl_dim_map.c \ isl_equalities.c \ isl_equalities.h \ isl_factorization.c \ isl_factorization.h \ isl_farkas.c \ isl_flow.c \ isl_fold.c \ isl_gmp.c \ isl_hash.c \ isl_hmap_map_basic_set.c \ isl_hmap_map_basic_set.h \ isl_ilp.c \ isl_input.c \ isl_int.h \ isl_local_space_private.h \ isl_local_space.c \ isl_lp.c \ isl_lp_piplib.h \ isl_map.c \ isl_map_simplify.c \ isl_map_subtract.c \ isl_map_private.h \ isl_map_piplib.h \ isl_mat.c \ isl_mat_private.h \ isl_morph.c \ isl_morph.h \ isl_id.c \ isl_id_private.h \ isl_obj.c \ isl_options.c \ isl_options_private.h \ isl_output.c \ isl_piplib.h \ isl_point_private.h \ isl_point.c \ isl_polynomial_private.h \ isl_polynomial.c \ isl_printer_private.h \ isl_printer.c \ print.c \ isl_range.c \ isl_range.h \ isl_reordering.c \ isl_reordering.h \ isl_sample.h \ isl_sample.c \ isl_scan.c \ isl_scan.h \ isl_schedule.c \ isl_schedule_private.h \ isl_set_list.c \ isl_sort.c \ isl_sort.h \ isl_space.c \ isl_space_private.h \ isl_stream.c \ isl_stream_private.h \ isl_seq.c \ isl_tab.c \ isl_tab.h \ isl_tab_pip.c \ isl_tarjan.c \ isl_tarjan.h \ isl_transitive_closure.c \ isl_union_map.c \ isl_union_map_private.h \ isl_val.c \ isl_val_gmp.c \ isl_val_private.h \ isl_vec.c \ isl_version.c \ isl_vertices_private.h \ isl_vertices.c EXTRA_libisl_la_SOURCES = \ isl_lp_piplib.c \ isl_lp_no_piplib.c \ isl_map_piplib.c \ isl_map_no_piplib.c \ isl_sample_no_piplib.c \ isl_sample_piplib.c \ isl_sample_piplib.h \ isl_piplib.c libisl_la_LIBADD = @PIPLIB_LIBS@ @GMP_LIBS@ libisl_la_LDFLAGS = -version-info @versioninfo@ \ @PIPLIB_LDFLAGS@ @GMP_LDFLAGS@ libisl_la_CPPFLAGS = $(INCLUDES) @PIPLIB_CPPFLAGS@ @GMP_CPPFLAGS@ isl_test_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_test_LDFLAGS = @GMP_LDFLAGS@ isl_test_LDADD = libisl.la @GMP_LIBS@ isl_polyhedron_sample_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polyhedron_sample_LDADD = libisl.la isl_polyhedron_sample_SOURCES = \ polyhedron_sample.c isl_pip_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_pip_LDFLAGS = @GMP_LDFLAGS@ isl_pip_LDADD = libisl.la @GMP_LIBS@ isl_pip_SOURCES = \ pip.c isl_codegen_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_codegen_LDFLAGS = @GMP_LDFLAGS@ isl_codegen_LDADD = libisl.la @GMP_LIBS@ isl_codegen_SOURCES = \ codegen.c isl_bound_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_bound_LDFLAGS = @GMP_LDFLAGS@ isl_bound_LDADD = libisl.la @GMP_LIBS@ isl_bound_SOURCES = \ bound.c isl_polyhedron_minimize_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polyhedron_minimize_LDFLAGS = @GMP_LDFLAGS@ isl_polyhedron_minimize_LDADD = libisl.la @GMP_LIBS@ isl_polyhedron_minimize_SOURCES = \ polyhedron_minimize.c isl_polytope_scan_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polytope_scan_LDADD = libisl.la isl_polytope_scan_SOURCES = \ polytope_scan.c isl_polyhedron_detect_equalities_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_polyhedron_detect_equalities_LDADD = libisl.la isl_polyhedron_detect_equalities_SOURCES = \ polyhedron_detect_equalities.c isl_cat_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_cat_LDADD = libisl.la isl_cat_SOURCES = \ cat.c isl_closure_CPPFLAGS = $(INCLUDES) @GMP_CPPFLAGS@ isl_closure_LDADD = libisl.la isl_closure_SOURCES = \ closure.c nodist_pkginclude_HEADERS = \ include/isl/config.h \ include/isl/stdint.h pkginclude_HEADERS = \ include/isl/aff.h \ include/isl/aff_type.h \ include/isl/arg.h \ include/isl/ast.h \ include/isl/ast_build.h \ include/isl/band.h \ include/isl/blk.h \ include/isl/constraint.h \ include/isl/ctx.h \ include/isl/dim.h \ include/isl/flow.h \ include/isl/id.h \ include/isl/ilp.h \ include/isl/int.h \ include/isl/hash.h \ include/isl/list.h \ include/isl/local_space.h \ include/isl/lp.h \ include/isl/mat.h \ include/isl/map.h \ include/isl/map_type.h \ include/isl/multi.h \ include/isl/obj.h \ include/isl/options.h \ include/isl/point.h \ include/isl/polynomial.h \ include/isl/polynomial_type.h \ include/isl/printer.h \ include/isl/schedule.h \ include/isl/seq.h \ include/isl/set.h \ include/isl/set_type.h \ include/isl/space.h \ include/isl/stream.h \ include/isl/union_map.h \ include/isl/union_map_type.h \ include/isl/union_set.h \ include/isl/union_set_type.h \ include/isl/val.h \ include/isl/val_gmp.h \ include/isl/val_int.h \ include/isl/vec.h \ include/isl/version.h \ include/isl/vertices.h EXTRA_DIST = \ LICENSE \ isl_config_post.h \ basis_reduction_templ.c \ isl_list_templ.c \ isl_list_templ.h \ isl_map_lexopt_templ.c \ isl_multi_templ.c \ isl_multi_templ.h \ print_templ.c \ isl_power_templ.c \ isl_pw_templ.c \ isl_union_templ.c \ isl.py \ doc/SubmittingPatches \ doc/chicago.bst \ doc/chicago.sty \ doc/implementation.tex \ doc/isl.bib \ doc/mypod2latex \ doc/manual.tex \ doc/user.pod \ interface/all.h \ interface/isl.py.top \ test_inputs pkgconfigdir = $(pkgconfig_libdir) pkgconfig_DATA = $(pkgconfig_libfile) all: isl_config.h $(MAKE) $(AM_MAKEFLAGS) all-recursive .SUFFIXES: .SUFFIXES: .c .lo .o .obj am--refresh: Makefile @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): isl_config.h: stamp-h1 @if test ! -f $@; then rm -f stamp-h1; else :; fi @if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) stamp-h1; else :; fi stamp-h1: $(srcdir)/isl_config.h.in $(top_builddir)/config.status @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status isl_config.h $(srcdir)/isl_config.h.in: $(am__configure_deps) ($(am__cd) $(top_srcdir) && $(AUTOHEADER)) rm -f stamp-h1 touch $@ include/isl/config.h: include/isl/stamp-h2 @if test ! -f $@; then rm -f include/isl/stamp-h2; else :; fi @if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) include/isl/stamp-h2; else :; fi include/isl/stamp-h2: $(top_srcdir)/include/isl/config.h.in $(top_builddir)/config.status @rm -f include/isl/stamp-h2 cd $(top_builddir) && $(SHELL) ./config.status include/isl/config.h distclean-hdr: -rm -f isl_config.h stamp-h1 include/isl/config.h include/isl/stamp-h2 bound_test.sh: $(top_builddir)/config.status $(srcdir)/bound_test.sh.in cd $(top_builddir) && $(SHELL) ./config.status $@ codegen_test.sh: $(top_builddir)/config.status $(srcdir)/codegen_test.sh.in cd $(top_builddir) && $(SHELL) ./config.status $@ pip_test.sh: $(top_builddir)/config.status $(srcdir)/pip_test.sh.in cd $(top_builddir) && $(SHELL) ./config.status $@ install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)" @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; for p in $$list; do \ dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \ test "$$dir" != "$$p" || dir=.; \ echo "rm -f \"$${dir}/so_locations\""; \ rm -f "$${dir}/so_locations"; \ done libisl.la: $(libisl_la_OBJECTS) $(libisl_la_DEPENDENCIES) $(EXTRA_libisl_la_DEPENDENCIES) $(AM_V_CCLD)$(libisl_la_LINK) -rpath $(libdir) $(libisl_la_OBJECTS) $(libisl_la_LIBADD) $(LIBS) clean-noinstPROGRAMS: @list='$(noinst_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list isl_bound$(EXEEXT): $(isl_bound_OBJECTS) $(isl_bound_DEPENDENCIES) $(EXTRA_isl_bound_DEPENDENCIES) @rm -f isl_bound$(EXEEXT) $(AM_V_CCLD)$(isl_bound_LINK) $(isl_bound_OBJECTS) $(isl_bound_LDADD) $(LIBS) isl_cat$(EXEEXT): $(isl_cat_OBJECTS) $(isl_cat_DEPENDENCIES) $(EXTRA_isl_cat_DEPENDENCIES) @rm -f isl_cat$(EXEEXT) $(AM_V_CCLD)$(LINK) $(isl_cat_OBJECTS) $(isl_cat_LDADD) $(LIBS) isl_closure$(EXEEXT): $(isl_closure_OBJECTS) $(isl_closure_DEPENDENCIES) $(EXTRA_isl_closure_DEPENDENCIES) @rm -f isl_closure$(EXEEXT) $(AM_V_CCLD)$(LINK) $(isl_closure_OBJECTS) $(isl_closure_LDADD) $(LIBS) isl_codegen$(EXEEXT): $(isl_codegen_OBJECTS) $(isl_codegen_DEPENDENCIES) $(EXTRA_isl_codegen_DEPENDENCIES) @rm -f isl_codegen$(EXEEXT) $(AM_V_CCLD)$(isl_codegen_LINK) $(isl_codegen_OBJECTS) $(isl_codegen_LDADD) $(LIBS) isl_pip$(EXEEXT): $(isl_pip_OBJECTS) $(isl_pip_DEPENDENCIES) $(EXTRA_isl_pip_DEPENDENCIES) @rm -f isl_pip$(EXEEXT) $(AM_V_CCLD)$(isl_pip_LINK) $(isl_pip_OBJECTS) $(isl_pip_LDADD) $(LIBS) isl_polyhedron_detect_equalities$(EXEEXT): $(isl_polyhedron_detect_equalities_OBJECTS) $(isl_polyhedron_detect_equalities_DEPENDENCIES) $(EXTRA_isl_polyhedron_detect_equalities_DEPENDENCIES) @rm -f isl_polyhedron_detect_equalities$(EXEEXT) $(AM_V_CCLD)$(LINK) $(isl_polyhedron_detect_equalities_OBJECTS) $(isl_polyhedron_detect_equalities_LDADD) $(LIBS) isl_polyhedron_minimize$(EXEEXT): $(isl_polyhedron_minimize_OBJECTS) $(isl_polyhedron_minimize_DEPENDENCIES) $(EXTRA_isl_polyhedron_minimize_DEPENDENCIES) @rm -f isl_polyhedron_minimize$(EXEEXT) $(AM_V_CCLD)$(isl_polyhedron_minimize_LINK) $(isl_polyhedron_minimize_OBJECTS) $(isl_polyhedron_minimize_LDADD) $(LIBS) isl_polyhedron_sample$(EXEEXT): $(isl_polyhedron_sample_OBJECTS) $(isl_polyhedron_sample_DEPENDENCIES) $(EXTRA_isl_polyhedron_sample_DEPENDENCIES) @rm -f isl_polyhedron_sample$(EXEEXT) $(AM_V_CCLD)$(LINK) $(isl_polyhedron_sample_OBJECTS) $(isl_polyhedron_sample_LDADD) $(LIBS) isl_polytope_scan$(EXEEXT): $(isl_polytope_scan_OBJECTS) $(isl_polytope_scan_DEPENDENCIES) $(EXTRA_isl_polytope_scan_DEPENDENCIES) @rm -f isl_polytope_scan$(EXEEXT) $(AM_V_CCLD)$(LINK) $(isl_polytope_scan_OBJECTS) $(isl_polytope_scan_LDADD) $(LIBS) isl_test$(EXEEXT): $(isl_test_OBJECTS) $(isl_test_DEPENDENCIES) $(EXTRA_isl_test_DEPENDENCIES) @rm -f isl_test$(EXEEXT) $(AM_V_CCLD)$(isl_test_LINK) $(isl_test_OBJECTS) $(isl_test_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_bound-bound.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_cat-cat.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_closure-closure.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_codegen-codegen.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_pip-pip.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_polyhedron_detect_equalities-polyhedron_detect_equalities.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_polyhedron_minimize-polyhedron_minimize.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_polyhedron_sample-polyhedron_sample.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_polytope_scan-polytope_scan.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/isl_test-isl_test.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-basis_reduction_tab.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_aff.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_affine_hull.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_arg.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_ast.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_ast_build.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_ast_build_expr.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_ast_codegen.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_ast_graft.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_band.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_bernstein.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_blk.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_bound.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_coalesce.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_constraint.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_convex_hull.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_ctx.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_deprecated.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_dim.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_dim_map.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_equalities.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_factorization.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_farkas.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_flow.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_fold.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_gmp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_hash.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_hmap_map_basic_set.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_id.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_ilp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_input.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_local_space.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_lp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_lp_no_piplib.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_lp_piplib.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_map.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_map_no_piplib.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_map_piplib.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_map_simplify.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_map_subtract.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_mat.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_morph.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_obj.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_options.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_output.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_piplib.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_point.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_polynomial.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_printer.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_range.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_reordering.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_sample.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_sample_no_piplib.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_sample_piplib.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_scan.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_schedule.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_seq.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_set_list.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_sort.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_space.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_stream.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_tab.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_tab_pip.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_tarjan.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_transitive_closure.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_union_map.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_val.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_val_gmp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_vec.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_version.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-isl_vertices.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-mp_get_memory_functions.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libisl_la-print.Plo@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(AM_V_CC)$(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LTCOMPILE) -c -o $@ $< libisl_la-isl_lp_no_piplib.lo: isl_lp_no_piplib.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_lp_no_piplib.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_lp_no_piplib.Tpo -c -o libisl_la-isl_lp_no_piplib.lo `test -f 'isl_lp_no_piplib.c' || echo '$(srcdir)/'`isl_lp_no_piplib.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_lp_no_piplib.Tpo $(DEPDIR)/libisl_la-isl_lp_no_piplib.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_lp_no_piplib.c' object='libisl_la-isl_lp_no_piplib.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_lp_no_piplib.lo `test -f 'isl_lp_no_piplib.c' || echo '$(srcdir)/'`isl_lp_no_piplib.c libisl_la-isl_map_no_piplib.lo: isl_map_no_piplib.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_map_no_piplib.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_map_no_piplib.Tpo -c -o libisl_la-isl_map_no_piplib.lo `test -f 'isl_map_no_piplib.c' || echo '$(srcdir)/'`isl_map_no_piplib.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_map_no_piplib.Tpo $(DEPDIR)/libisl_la-isl_map_no_piplib.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_map_no_piplib.c' object='libisl_la-isl_map_no_piplib.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_map_no_piplib.lo `test -f 'isl_map_no_piplib.c' || echo '$(srcdir)/'`isl_map_no_piplib.c libisl_la-isl_sample_no_piplib.lo: isl_sample_no_piplib.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_sample_no_piplib.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_sample_no_piplib.Tpo -c -o libisl_la-isl_sample_no_piplib.lo `test -f 'isl_sample_no_piplib.c' || echo '$(srcdir)/'`isl_sample_no_piplib.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_sample_no_piplib.Tpo $(DEPDIR)/libisl_la-isl_sample_no_piplib.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_sample_no_piplib.c' object='libisl_la-isl_sample_no_piplib.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_sample_no_piplib.lo `test -f 'isl_sample_no_piplib.c' || echo '$(srcdir)/'`isl_sample_no_piplib.c libisl_la-isl_lp_piplib.lo: isl_lp_piplib.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_lp_piplib.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_lp_piplib.Tpo -c -o libisl_la-isl_lp_piplib.lo `test -f 'isl_lp_piplib.c' || echo '$(srcdir)/'`isl_lp_piplib.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_lp_piplib.Tpo $(DEPDIR)/libisl_la-isl_lp_piplib.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_lp_piplib.c' object='libisl_la-isl_lp_piplib.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_lp_piplib.lo `test -f 'isl_lp_piplib.c' || echo '$(srcdir)/'`isl_lp_piplib.c libisl_la-isl_map_piplib.lo: isl_map_piplib.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_map_piplib.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_map_piplib.Tpo -c -o libisl_la-isl_map_piplib.lo `test -f 'isl_map_piplib.c' || echo '$(srcdir)/'`isl_map_piplib.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_map_piplib.Tpo $(DEPDIR)/libisl_la-isl_map_piplib.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_map_piplib.c' object='libisl_la-isl_map_piplib.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_map_piplib.lo `test -f 'isl_map_piplib.c' || echo '$(srcdir)/'`isl_map_piplib.c libisl_la-isl_sample_piplib.lo: isl_sample_piplib.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_sample_piplib.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_sample_piplib.Tpo -c -o libisl_la-isl_sample_piplib.lo `test -f 'isl_sample_piplib.c' || echo '$(srcdir)/'`isl_sample_piplib.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_sample_piplib.Tpo $(DEPDIR)/libisl_la-isl_sample_piplib.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_sample_piplib.c' object='libisl_la-isl_sample_piplib.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_sample_piplib.lo `test -f 'isl_sample_piplib.c' || echo '$(srcdir)/'`isl_sample_piplib.c libisl_la-isl_piplib.lo: isl_piplib.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_piplib.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_piplib.Tpo -c -o libisl_la-isl_piplib.lo `test -f 'isl_piplib.c' || echo '$(srcdir)/'`isl_piplib.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_piplib.Tpo $(DEPDIR)/libisl_la-isl_piplib.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_piplib.c' object='libisl_la-isl_piplib.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_piplib.lo `test -f 'isl_piplib.c' || echo '$(srcdir)/'`isl_piplib.c libisl_la-mp_get_memory_functions.lo: mp_get_memory_functions.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-mp_get_memory_functions.lo -MD -MP -MF $(DEPDIR)/libisl_la-mp_get_memory_functions.Tpo -c -o libisl_la-mp_get_memory_functions.lo `test -f 'mp_get_memory_functions.c' || echo '$(srcdir)/'`mp_get_memory_functions.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-mp_get_memory_functions.Tpo $(DEPDIR)/libisl_la-mp_get_memory_functions.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='mp_get_memory_functions.c' object='libisl_la-mp_get_memory_functions.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-mp_get_memory_functions.lo `test -f 'mp_get_memory_functions.c' || echo '$(srcdir)/'`mp_get_memory_functions.c libisl_la-isl_aff.lo: isl_aff.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_aff.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_aff.Tpo -c -o libisl_la-isl_aff.lo `test -f 'isl_aff.c' || echo '$(srcdir)/'`isl_aff.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_aff.Tpo $(DEPDIR)/libisl_la-isl_aff.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_aff.c' object='libisl_la-isl_aff.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_aff.lo `test -f 'isl_aff.c' || echo '$(srcdir)/'`isl_aff.c libisl_la-isl_affine_hull.lo: isl_affine_hull.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_affine_hull.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_affine_hull.Tpo -c -o libisl_la-isl_affine_hull.lo `test -f 'isl_affine_hull.c' || echo '$(srcdir)/'`isl_affine_hull.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_affine_hull.Tpo $(DEPDIR)/libisl_la-isl_affine_hull.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_affine_hull.c' object='libisl_la-isl_affine_hull.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_affine_hull.lo `test -f 'isl_affine_hull.c' || echo '$(srcdir)/'`isl_affine_hull.c libisl_la-isl_arg.lo: isl_arg.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_arg.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_arg.Tpo -c -o libisl_la-isl_arg.lo `test -f 'isl_arg.c' || echo '$(srcdir)/'`isl_arg.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_arg.Tpo $(DEPDIR)/libisl_la-isl_arg.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_arg.c' object='libisl_la-isl_arg.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_arg.lo `test -f 'isl_arg.c' || echo '$(srcdir)/'`isl_arg.c libisl_la-isl_ast.lo: isl_ast.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_ast.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_ast.Tpo -c -o libisl_la-isl_ast.lo `test -f 'isl_ast.c' || echo '$(srcdir)/'`isl_ast.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_ast.Tpo $(DEPDIR)/libisl_la-isl_ast.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_ast.c' object='libisl_la-isl_ast.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_ast.lo `test -f 'isl_ast.c' || echo '$(srcdir)/'`isl_ast.c libisl_la-isl_ast_build.lo: isl_ast_build.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_ast_build.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_ast_build.Tpo -c -o libisl_la-isl_ast_build.lo `test -f 'isl_ast_build.c' || echo '$(srcdir)/'`isl_ast_build.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_ast_build.Tpo $(DEPDIR)/libisl_la-isl_ast_build.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_ast_build.c' object='libisl_la-isl_ast_build.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_ast_build.lo `test -f 'isl_ast_build.c' || echo '$(srcdir)/'`isl_ast_build.c libisl_la-isl_ast_build_expr.lo: isl_ast_build_expr.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_ast_build_expr.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_ast_build_expr.Tpo -c -o libisl_la-isl_ast_build_expr.lo `test -f 'isl_ast_build_expr.c' || echo '$(srcdir)/'`isl_ast_build_expr.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_ast_build_expr.Tpo $(DEPDIR)/libisl_la-isl_ast_build_expr.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_ast_build_expr.c' object='libisl_la-isl_ast_build_expr.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_ast_build_expr.lo `test -f 'isl_ast_build_expr.c' || echo '$(srcdir)/'`isl_ast_build_expr.c libisl_la-isl_ast_codegen.lo: isl_ast_codegen.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_ast_codegen.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_ast_codegen.Tpo -c -o libisl_la-isl_ast_codegen.lo `test -f 'isl_ast_codegen.c' || echo '$(srcdir)/'`isl_ast_codegen.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_ast_codegen.Tpo $(DEPDIR)/libisl_la-isl_ast_codegen.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_ast_codegen.c' object='libisl_la-isl_ast_codegen.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_ast_codegen.lo `test -f 'isl_ast_codegen.c' || echo '$(srcdir)/'`isl_ast_codegen.c libisl_la-isl_ast_graft.lo: isl_ast_graft.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_ast_graft.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_ast_graft.Tpo -c -o libisl_la-isl_ast_graft.lo `test -f 'isl_ast_graft.c' || echo '$(srcdir)/'`isl_ast_graft.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_ast_graft.Tpo $(DEPDIR)/libisl_la-isl_ast_graft.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_ast_graft.c' object='libisl_la-isl_ast_graft.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_ast_graft.lo `test -f 'isl_ast_graft.c' || echo '$(srcdir)/'`isl_ast_graft.c libisl_la-isl_band.lo: isl_band.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_band.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_band.Tpo -c -o libisl_la-isl_band.lo `test -f 'isl_band.c' || echo '$(srcdir)/'`isl_band.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_band.Tpo $(DEPDIR)/libisl_la-isl_band.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_band.c' object='libisl_la-isl_band.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_band.lo `test -f 'isl_band.c' || echo '$(srcdir)/'`isl_band.c libisl_la-basis_reduction_tab.lo: basis_reduction_tab.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-basis_reduction_tab.lo -MD -MP -MF $(DEPDIR)/libisl_la-basis_reduction_tab.Tpo -c -o libisl_la-basis_reduction_tab.lo `test -f 'basis_reduction_tab.c' || echo '$(srcdir)/'`basis_reduction_tab.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-basis_reduction_tab.Tpo $(DEPDIR)/libisl_la-basis_reduction_tab.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='basis_reduction_tab.c' object='libisl_la-basis_reduction_tab.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-basis_reduction_tab.lo `test -f 'basis_reduction_tab.c' || echo '$(srcdir)/'`basis_reduction_tab.c libisl_la-isl_bernstein.lo: isl_bernstein.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_bernstein.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_bernstein.Tpo -c -o libisl_la-isl_bernstein.lo `test -f 'isl_bernstein.c' || echo '$(srcdir)/'`isl_bernstein.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_bernstein.Tpo $(DEPDIR)/libisl_la-isl_bernstein.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_bernstein.c' object='libisl_la-isl_bernstein.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_bernstein.lo `test -f 'isl_bernstein.c' || echo '$(srcdir)/'`isl_bernstein.c libisl_la-isl_blk.lo: isl_blk.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_blk.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_blk.Tpo -c -o libisl_la-isl_blk.lo `test -f 'isl_blk.c' || echo '$(srcdir)/'`isl_blk.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_blk.Tpo $(DEPDIR)/libisl_la-isl_blk.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_blk.c' object='libisl_la-isl_blk.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_blk.lo `test -f 'isl_blk.c' || echo '$(srcdir)/'`isl_blk.c libisl_la-isl_bound.lo: isl_bound.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_bound.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_bound.Tpo -c -o libisl_la-isl_bound.lo `test -f 'isl_bound.c' || echo '$(srcdir)/'`isl_bound.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_bound.Tpo $(DEPDIR)/libisl_la-isl_bound.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_bound.c' object='libisl_la-isl_bound.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_bound.lo `test -f 'isl_bound.c' || echo '$(srcdir)/'`isl_bound.c libisl_la-isl_coalesce.lo: isl_coalesce.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_coalesce.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_coalesce.Tpo -c -o libisl_la-isl_coalesce.lo `test -f 'isl_coalesce.c' || echo '$(srcdir)/'`isl_coalesce.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_coalesce.Tpo $(DEPDIR)/libisl_la-isl_coalesce.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_coalesce.c' object='libisl_la-isl_coalesce.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_coalesce.lo `test -f 'isl_coalesce.c' || echo '$(srcdir)/'`isl_coalesce.c libisl_la-isl_constraint.lo: isl_constraint.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_constraint.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_constraint.Tpo -c -o libisl_la-isl_constraint.lo `test -f 'isl_constraint.c' || echo '$(srcdir)/'`isl_constraint.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_constraint.Tpo $(DEPDIR)/libisl_la-isl_constraint.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_constraint.c' object='libisl_la-isl_constraint.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_constraint.lo `test -f 'isl_constraint.c' || echo '$(srcdir)/'`isl_constraint.c libisl_la-isl_convex_hull.lo: isl_convex_hull.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_convex_hull.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_convex_hull.Tpo -c -o libisl_la-isl_convex_hull.lo `test -f 'isl_convex_hull.c' || echo '$(srcdir)/'`isl_convex_hull.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_convex_hull.Tpo $(DEPDIR)/libisl_la-isl_convex_hull.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_convex_hull.c' object='libisl_la-isl_convex_hull.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_convex_hull.lo `test -f 'isl_convex_hull.c' || echo '$(srcdir)/'`isl_convex_hull.c libisl_la-isl_ctx.lo: isl_ctx.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_ctx.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_ctx.Tpo -c -o libisl_la-isl_ctx.lo `test -f 'isl_ctx.c' || echo '$(srcdir)/'`isl_ctx.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_ctx.Tpo $(DEPDIR)/libisl_la-isl_ctx.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_ctx.c' object='libisl_la-isl_ctx.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_ctx.lo `test -f 'isl_ctx.c' || echo '$(srcdir)/'`isl_ctx.c libisl_la-isl_deprecated.lo: isl_deprecated.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_deprecated.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_deprecated.Tpo -c -o libisl_la-isl_deprecated.lo `test -f 'isl_deprecated.c' || echo '$(srcdir)/'`isl_deprecated.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_deprecated.Tpo $(DEPDIR)/libisl_la-isl_deprecated.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_deprecated.c' object='libisl_la-isl_deprecated.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_deprecated.lo `test -f 'isl_deprecated.c' || echo '$(srcdir)/'`isl_deprecated.c libisl_la-isl_dim.lo: isl_dim.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_dim.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_dim.Tpo -c -o libisl_la-isl_dim.lo `test -f 'isl_dim.c' || echo '$(srcdir)/'`isl_dim.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_dim.Tpo $(DEPDIR)/libisl_la-isl_dim.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_dim.c' object='libisl_la-isl_dim.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_dim.lo `test -f 'isl_dim.c' || echo '$(srcdir)/'`isl_dim.c libisl_la-isl_dim_map.lo: isl_dim_map.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_dim_map.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_dim_map.Tpo -c -o libisl_la-isl_dim_map.lo `test -f 'isl_dim_map.c' || echo '$(srcdir)/'`isl_dim_map.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_dim_map.Tpo $(DEPDIR)/libisl_la-isl_dim_map.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_dim_map.c' object='libisl_la-isl_dim_map.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_dim_map.lo `test -f 'isl_dim_map.c' || echo '$(srcdir)/'`isl_dim_map.c libisl_la-isl_equalities.lo: isl_equalities.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_equalities.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_equalities.Tpo -c -o libisl_la-isl_equalities.lo `test -f 'isl_equalities.c' || echo '$(srcdir)/'`isl_equalities.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_equalities.Tpo $(DEPDIR)/libisl_la-isl_equalities.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_equalities.c' object='libisl_la-isl_equalities.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_equalities.lo `test -f 'isl_equalities.c' || echo '$(srcdir)/'`isl_equalities.c libisl_la-isl_factorization.lo: isl_factorization.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_factorization.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_factorization.Tpo -c -o libisl_la-isl_factorization.lo `test -f 'isl_factorization.c' || echo '$(srcdir)/'`isl_factorization.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_factorization.Tpo $(DEPDIR)/libisl_la-isl_factorization.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_factorization.c' object='libisl_la-isl_factorization.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_factorization.lo `test -f 'isl_factorization.c' || echo '$(srcdir)/'`isl_factorization.c libisl_la-isl_farkas.lo: isl_farkas.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_farkas.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_farkas.Tpo -c -o libisl_la-isl_farkas.lo `test -f 'isl_farkas.c' || echo '$(srcdir)/'`isl_farkas.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_farkas.Tpo $(DEPDIR)/libisl_la-isl_farkas.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_farkas.c' object='libisl_la-isl_farkas.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_farkas.lo `test -f 'isl_farkas.c' || echo '$(srcdir)/'`isl_farkas.c libisl_la-isl_flow.lo: isl_flow.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_flow.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_flow.Tpo -c -o libisl_la-isl_flow.lo `test -f 'isl_flow.c' || echo '$(srcdir)/'`isl_flow.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_flow.Tpo $(DEPDIR)/libisl_la-isl_flow.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_flow.c' object='libisl_la-isl_flow.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_flow.lo `test -f 'isl_flow.c' || echo '$(srcdir)/'`isl_flow.c libisl_la-isl_fold.lo: isl_fold.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_fold.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_fold.Tpo -c -o libisl_la-isl_fold.lo `test -f 'isl_fold.c' || echo '$(srcdir)/'`isl_fold.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_fold.Tpo $(DEPDIR)/libisl_la-isl_fold.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_fold.c' object='libisl_la-isl_fold.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_fold.lo `test -f 'isl_fold.c' || echo '$(srcdir)/'`isl_fold.c libisl_la-isl_gmp.lo: isl_gmp.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_gmp.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_gmp.Tpo -c -o libisl_la-isl_gmp.lo `test -f 'isl_gmp.c' || echo '$(srcdir)/'`isl_gmp.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_gmp.Tpo $(DEPDIR)/libisl_la-isl_gmp.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_gmp.c' object='libisl_la-isl_gmp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_gmp.lo `test -f 'isl_gmp.c' || echo '$(srcdir)/'`isl_gmp.c libisl_la-isl_hash.lo: isl_hash.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_hash.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_hash.Tpo -c -o libisl_la-isl_hash.lo `test -f 'isl_hash.c' || echo '$(srcdir)/'`isl_hash.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_hash.Tpo $(DEPDIR)/libisl_la-isl_hash.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_hash.c' object='libisl_la-isl_hash.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_hash.lo `test -f 'isl_hash.c' || echo '$(srcdir)/'`isl_hash.c libisl_la-isl_hmap_map_basic_set.lo: isl_hmap_map_basic_set.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_hmap_map_basic_set.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_hmap_map_basic_set.Tpo -c -o libisl_la-isl_hmap_map_basic_set.lo `test -f 'isl_hmap_map_basic_set.c' || echo '$(srcdir)/'`isl_hmap_map_basic_set.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_hmap_map_basic_set.Tpo $(DEPDIR)/libisl_la-isl_hmap_map_basic_set.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_hmap_map_basic_set.c' object='libisl_la-isl_hmap_map_basic_set.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_hmap_map_basic_set.lo `test -f 'isl_hmap_map_basic_set.c' || echo '$(srcdir)/'`isl_hmap_map_basic_set.c libisl_la-isl_ilp.lo: isl_ilp.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_ilp.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_ilp.Tpo -c -o libisl_la-isl_ilp.lo `test -f 'isl_ilp.c' || echo '$(srcdir)/'`isl_ilp.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_ilp.Tpo $(DEPDIR)/libisl_la-isl_ilp.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_ilp.c' object='libisl_la-isl_ilp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_ilp.lo `test -f 'isl_ilp.c' || echo '$(srcdir)/'`isl_ilp.c libisl_la-isl_input.lo: isl_input.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_input.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_input.Tpo -c -o libisl_la-isl_input.lo `test -f 'isl_input.c' || echo '$(srcdir)/'`isl_input.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_input.Tpo $(DEPDIR)/libisl_la-isl_input.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_input.c' object='libisl_la-isl_input.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_input.lo `test -f 'isl_input.c' || echo '$(srcdir)/'`isl_input.c libisl_la-isl_local_space.lo: isl_local_space.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_local_space.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_local_space.Tpo -c -o libisl_la-isl_local_space.lo `test -f 'isl_local_space.c' || echo '$(srcdir)/'`isl_local_space.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_local_space.Tpo $(DEPDIR)/libisl_la-isl_local_space.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_local_space.c' object='libisl_la-isl_local_space.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_local_space.lo `test -f 'isl_local_space.c' || echo '$(srcdir)/'`isl_local_space.c libisl_la-isl_lp.lo: isl_lp.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_lp.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_lp.Tpo -c -o libisl_la-isl_lp.lo `test -f 'isl_lp.c' || echo '$(srcdir)/'`isl_lp.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_lp.Tpo $(DEPDIR)/libisl_la-isl_lp.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_lp.c' object='libisl_la-isl_lp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_lp.lo `test -f 'isl_lp.c' || echo '$(srcdir)/'`isl_lp.c libisl_la-isl_map.lo: isl_map.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_map.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_map.Tpo -c -o libisl_la-isl_map.lo `test -f 'isl_map.c' || echo '$(srcdir)/'`isl_map.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_map.Tpo $(DEPDIR)/libisl_la-isl_map.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_map.c' object='libisl_la-isl_map.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_map.lo `test -f 'isl_map.c' || echo '$(srcdir)/'`isl_map.c libisl_la-isl_map_simplify.lo: isl_map_simplify.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_map_simplify.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_map_simplify.Tpo -c -o libisl_la-isl_map_simplify.lo `test -f 'isl_map_simplify.c' || echo '$(srcdir)/'`isl_map_simplify.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_map_simplify.Tpo $(DEPDIR)/libisl_la-isl_map_simplify.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_map_simplify.c' object='libisl_la-isl_map_simplify.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_map_simplify.lo `test -f 'isl_map_simplify.c' || echo '$(srcdir)/'`isl_map_simplify.c libisl_la-isl_map_subtract.lo: isl_map_subtract.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_map_subtract.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_map_subtract.Tpo -c -o libisl_la-isl_map_subtract.lo `test -f 'isl_map_subtract.c' || echo '$(srcdir)/'`isl_map_subtract.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_map_subtract.Tpo $(DEPDIR)/libisl_la-isl_map_subtract.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_map_subtract.c' object='libisl_la-isl_map_subtract.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_map_subtract.lo `test -f 'isl_map_subtract.c' || echo '$(srcdir)/'`isl_map_subtract.c libisl_la-isl_mat.lo: isl_mat.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_mat.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_mat.Tpo -c -o libisl_la-isl_mat.lo `test -f 'isl_mat.c' || echo '$(srcdir)/'`isl_mat.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_mat.Tpo $(DEPDIR)/libisl_la-isl_mat.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_mat.c' object='libisl_la-isl_mat.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_mat.lo `test -f 'isl_mat.c' || echo '$(srcdir)/'`isl_mat.c libisl_la-isl_morph.lo: isl_morph.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_morph.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_morph.Tpo -c -o libisl_la-isl_morph.lo `test -f 'isl_morph.c' || echo '$(srcdir)/'`isl_morph.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_morph.Tpo $(DEPDIR)/libisl_la-isl_morph.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_morph.c' object='libisl_la-isl_morph.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_morph.lo `test -f 'isl_morph.c' || echo '$(srcdir)/'`isl_morph.c libisl_la-isl_id.lo: isl_id.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_id.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_id.Tpo -c -o libisl_la-isl_id.lo `test -f 'isl_id.c' || echo '$(srcdir)/'`isl_id.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_id.Tpo $(DEPDIR)/libisl_la-isl_id.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_id.c' object='libisl_la-isl_id.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_id.lo `test -f 'isl_id.c' || echo '$(srcdir)/'`isl_id.c libisl_la-isl_obj.lo: isl_obj.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_obj.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_obj.Tpo -c -o libisl_la-isl_obj.lo `test -f 'isl_obj.c' || echo '$(srcdir)/'`isl_obj.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_obj.Tpo $(DEPDIR)/libisl_la-isl_obj.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_obj.c' object='libisl_la-isl_obj.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_obj.lo `test -f 'isl_obj.c' || echo '$(srcdir)/'`isl_obj.c libisl_la-isl_options.lo: isl_options.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_options.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_options.Tpo -c -o libisl_la-isl_options.lo `test -f 'isl_options.c' || echo '$(srcdir)/'`isl_options.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_options.Tpo $(DEPDIR)/libisl_la-isl_options.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_options.c' object='libisl_la-isl_options.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_options.lo `test -f 'isl_options.c' || echo '$(srcdir)/'`isl_options.c libisl_la-isl_output.lo: isl_output.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_output.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_output.Tpo -c -o libisl_la-isl_output.lo `test -f 'isl_output.c' || echo '$(srcdir)/'`isl_output.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_output.Tpo $(DEPDIR)/libisl_la-isl_output.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_output.c' object='libisl_la-isl_output.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_output.lo `test -f 'isl_output.c' || echo '$(srcdir)/'`isl_output.c libisl_la-isl_point.lo: isl_point.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_point.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_point.Tpo -c -o libisl_la-isl_point.lo `test -f 'isl_point.c' || echo '$(srcdir)/'`isl_point.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_point.Tpo $(DEPDIR)/libisl_la-isl_point.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_point.c' object='libisl_la-isl_point.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_point.lo `test -f 'isl_point.c' || echo '$(srcdir)/'`isl_point.c libisl_la-isl_polynomial.lo: isl_polynomial.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_polynomial.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_polynomial.Tpo -c -o libisl_la-isl_polynomial.lo `test -f 'isl_polynomial.c' || echo '$(srcdir)/'`isl_polynomial.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_polynomial.Tpo $(DEPDIR)/libisl_la-isl_polynomial.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_polynomial.c' object='libisl_la-isl_polynomial.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_polynomial.lo `test -f 'isl_polynomial.c' || echo '$(srcdir)/'`isl_polynomial.c libisl_la-isl_printer.lo: isl_printer.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_printer.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_printer.Tpo -c -o libisl_la-isl_printer.lo `test -f 'isl_printer.c' || echo '$(srcdir)/'`isl_printer.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_printer.Tpo $(DEPDIR)/libisl_la-isl_printer.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_printer.c' object='libisl_la-isl_printer.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_printer.lo `test -f 'isl_printer.c' || echo '$(srcdir)/'`isl_printer.c libisl_la-print.lo: print.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-print.lo -MD -MP -MF $(DEPDIR)/libisl_la-print.Tpo -c -o libisl_la-print.lo `test -f 'print.c' || echo '$(srcdir)/'`print.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-print.Tpo $(DEPDIR)/libisl_la-print.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='print.c' object='libisl_la-print.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-print.lo `test -f 'print.c' || echo '$(srcdir)/'`print.c libisl_la-isl_range.lo: isl_range.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_range.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_range.Tpo -c -o libisl_la-isl_range.lo `test -f 'isl_range.c' || echo '$(srcdir)/'`isl_range.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_range.Tpo $(DEPDIR)/libisl_la-isl_range.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_range.c' object='libisl_la-isl_range.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_range.lo `test -f 'isl_range.c' || echo '$(srcdir)/'`isl_range.c libisl_la-isl_reordering.lo: isl_reordering.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_reordering.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_reordering.Tpo -c -o libisl_la-isl_reordering.lo `test -f 'isl_reordering.c' || echo '$(srcdir)/'`isl_reordering.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_reordering.Tpo $(DEPDIR)/libisl_la-isl_reordering.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_reordering.c' object='libisl_la-isl_reordering.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_reordering.lo `test -f 'isl_reordering.c' || echo '$(srcdir)/'`isl_reordering.c libisl_la-isl_sample.lo: isl_sample.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_sample.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_sample.Tpo -c -o libisl_la-isl_sample.lo `test -f 'isl_sample.c' || echo '$(srcdir)/'`isl_sample.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_sample.Tpo $(DEPDIR)/libisl_la-isl_sample.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_sample.c' object='libisl_la-isl_sample.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_sample.lo `test -f 'isl_sample.c' || echo '$(srcdir)/'`isl_sample.c libisl_la-isl_scan.lo: isl_scan.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_scan.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_scan.Tpo -c -o libisl_la-isl_scan.lo `test -f 'isl_scan.c' || echo '$(srcdir)/'`isl_scan.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_scan.Tpo $(DEPDIR)/libisl_la-isl_scan.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_scan.c' object='libisl_la-isl_scan.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_scan.lo `test -f 'isl_scan.c' || echo '$(srcdir)/'`isl_scan.c libisl_la-isl_schedule.lo: isl_schedule.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_schedule.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_schedule.Tpo -c -o libisl_la-isl_schedule.lo `test -f 'isl_schedule.c' || echo '$(srcdir)/'`isl_schedule.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_schedule.Tpo $(DEPDIR)/libisl_la-isl_schedule.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_schedule.c' object='libisl_la-isl_schedule.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_schedule.lo `test -f 'isl_schedule.c' || echo '$(srcdir)/'`isl_schedule.c libisl_la-isl_set_list.lo: isl_set_list.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_set_list.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_set_list.Tpo -c -o libisl_la-isl_set_list.lo `test -f 'isl_set_list.c' || echo '$(srcdir)/'`isl_set_list.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_set_list.Tpo $(DEPDIR)/libisl_la-isl_set_list.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_set_list.c' object='libisl_la-isl_set_list.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_set_list.lo `test -f 'isl_set_list.c' || echo '$(srcdir)/'`isl_set_list.c libisl_la-isl_sort.lo: isl_sort.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_sort.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_sort.Tpo -c -o libisl_la-isl_sort.lo `test -f 'isl_sort.c' || echo '$(srcdir)/'`isl_sort.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_sort.Tpo $(DEPDIR)/libisl_la-isl_sort.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_sort.c' object='libisl_la-isl_sort.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_sort.lo `test -f 'isl_sort.c' || echo '$(srcdir)/'`isl_sort.c libisl_la-isl_space.lo: isl_space.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_space.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_space.Tpo -c -o libisl_la-isl_space.lo `test -f 'isl_space.c' || echo '$(srcdir)/'`isl_space.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_space.Tpo $(DEPDIR)/libisl_la-isl_space.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_space.c' object='libisl_la-isl_space.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_space.lo `test -f 'isl_space.c' || echo '$(srcdir)/'`isl_space.c libisl_la-isl_stream.lo: isl_stream.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_stream.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_stream.Tpo -c -o libisl_la-isl_stream.lo `test -f 'isl_stream.c' || echo '$(srcdir)/'`isl_stream.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_stream.Tpo $(DEPDIR)/libisl_la-isl_stream.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_stream.c' object='libisl_la-isl_stream.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_stream.lo `test -f 'isl_stream.c' || echo '$(srcdir)/'`isl_stream.c libisl_la-isl_seq.lo: isl_seq.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_seq.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_seq.Tpo -c -o libisl_la-isl_seq.lo `test -f 'isl_seq.c' || echo '$(srcdir)/'`isl_seq.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_seq.Tpo $(DEPDIR)/libisl_la-isl_seq.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_seq.c' object='libisl_la-isl_seq.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_seq.lo `test -f 'isl_seq.c' || echo '$(srcdir)/'`isl_seq.c libisl_la-isl_tab.lo: isl_tab.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_tab.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_tab.Tpo -c -o libisl_la-isl_tab.lo `test -f 'isl_tab.c' || echo '$(srcdir)/'`isl_tab.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_tab.Tpo $(DEPDIR)/libisl_la-isl_tab.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_tab.c' object='libisl_la-isl_tab.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_tab.lo `test -f 'isl_tab.c' || echo '$(srcdir)/'`isl_tab.c libisl_la-isl_tab_pip.lo: isl_tab_pip.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_tab_pip.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_tab_pip.Tpo -c -o libisl_la-isl_tab_pip.lo `test -f 'isl_tab_pip.c' || echo '$(srcdir)/'`isl_tab_pip.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_tab_pip.Tpo $(DEPDIR)/libisl_la-isl_tab_pip.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_tab_pip.c' object='libisl_la-isl_tab_pip.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_tab_pip.lo `test -f 'isl_tab_pip.c' || echo '$(srcdir)/'`isl_tab_pip.c libisl_la-isl_tarjan.lo: isl_tarjan.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_tarjan.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_tarjan.Tpo -c -o libisl_la-isl_tarjan.lo `test -f 'isl_tarjan.c' || echo '$(srcdir)/'`isl_tarjan.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_tarjan.Tpo $(DEPDIR)/libisl_la-isl_tarjan.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_tarjan.c' object='libisl_la-isl_tarjan.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_tarjan.lo `test -f 'isl_tarjan.c' || echo '$(srcdir)/'`isl_tarjan.c libisl_la-isl_transitive_closure.lo: isl_transitive_closure.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_transitive_closure.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_transitive_closure.Tpo -c -o libisl_la-isl_transitive_closure.lo `test -f 'isl_transitive_closure.c' || echo '$(srcdir)/'`isl_transitive_closure.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_transitive_closure.Tpo $(DEPDIR)/libisl_la-isl_transitive_closure.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_transitive_closure.c' object='libisl_la-isl_transitive_closure.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_transitive_closure.lo `test -f 'isl_transitive_closure.c' || echo '$(srcdir)/'`isl_transitive_closure.c libisl_la-isl_union_map.lo: isl_union_map.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_union_map.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_union_map.Tpo -c -o libisl_la-isl_union_map.lo `test -f 'isl_union_map.c' || echo '$(srcdir)/'`isl_union_map.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_union_map.Tpo $(DEPDIR)/libisl_la-isl_union_map.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_union_map.c' object='libisl_la-isl_union_map.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_union_map.lo `test -f 'isl_union_map.c' || echo '$(srcdir)/'`isl_union_map.c libisl_la-isl_val.lo: isl_val.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_val.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_val.Tpo -c -o libisl_la-isl_val.lo `test -f 'isl_val.c' || echo '$(srcdir)/'`isl_val.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_val.Tpo $(DEPDIR)/libisl_la-isl_val.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_val.c' object='libisl_la-isl_val.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_val.lo `test -f 'isl_val.c' || echo '$(srcdir)/'`isl_val.c libisl_la-isl_val_gmp.lo: isl_val_gmp.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_val_gmp.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_val_gmp.Tpo -c -o libisl_la-isl_val_gmp.lo `test -f 'isl_val_gmp.c' || echo '$(srcdir)/'`isl_val_gmp.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_val_gmp.Tpo $(DEPDIR)/libisl_la-isl_val_gmp.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_val_gmp.c' object='libisl_la-isl_val_gmp.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_val_gmp.lo `test -f 'isl_val_gmp.c' || echo '$(srcdir)/'`isl_val_gmp.c libisl_la-isl_vec.lo: isl_vec.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_vec.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_vec.Tpo -c -o libisl_la-isl_vec.lo `test -f 'isl_vec.c' || echo '$(srcdir)/'`isl_vec.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_vec.Tpo $(DEPDIR)/libisl_la-isl_vec.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_vec.c' object='libisl_la-isl_vec.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_vec.lo `test -f 'isl_vec.c' || echo '$(srcdir)/'`isl_vec.c libisl_la-isl_version.lo: isl_version.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_version.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_version.Tpo -c -o libisl_la-isl_version.lo `test -f 'isl_version.c' || echo '$(srcdir)/'`isl_version.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_version.Tpo $(DEPDIR)/libisl_la-isl_version.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_version.c' object='libisl_la-isl_version.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_version.lo `test -f 'isl_version.c' || echo '$(srcdir)/'`isl_version.c libisl_la-isl_vertices.lo: isl_vertices.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT libisl_la-isl_vertices.lo -MD -MP -MF $(DEPDIR)/libisl_la-isl_vertices.Tpo -c -o libisl_la-isl_vertices.lo `test -f 'isl_vertices.c' || echo '$(srcdir)/'`isl_vertices.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libisl_la-isl_vertices.Tpo $(DEPDIR)/libisl_la-isl_vertices.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_vertices.c' object='libisl_la-isl_vertices.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libisl_la_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o libisl_la-isl_vertices.lo `test -f 'isl_vertices.c' || echo '$(srcdir)/'`isl_vertices.c isl_bound-bound.o: bound.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_bound-bound.o -MD -MP -MF $(DEPDIR)/isl_bound-bound.Tpo -c -o isl_bound-bound.o `test -f 'bound.c' || echo '$(srcdir)/'`bound.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_bound-bound.Tpo $(DEPDIR)/isl_bound-bound.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='bound.c' object='isl_bound-bound.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_bound-bound.o `test -f 'bound.c' || echo '$(srcdir)/'`bound.c isl_bound-bound.obj: bound.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_bound-bound.obj -MD -MP -MF $(DEPDIR)/isl_bound-bound.Tpo -c -o isl_bound-bound.obj `if test -f 'bound.c'; then $(CYGPATH_W) 'bound.c'; else $(CYGPATH_W) '$(srcdir)/bound.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_bound-bound.Tpo $(DEPDIR)/isl_bound-bound.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='bound.c' object='isl_bound-bound.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_bound_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_bound-bound.obj `if test -f 'bound.c'; then $(CYGPATH_W) 'bound.c'; else $(CYGPATH_W) '$(srcdir)/bound.c'; fi` isl_cat-cat.o: cat.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_cat_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_cat-cat.o -MD -MP -MF $(DEPDIR)/isl_cat-cat.Tpo -c -o isl_cat-cat.o `test -f 'cat.c' || echo '$(srcdir)/'`cat.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_cat-cat.Tpo $(DEPDIR)/isl_cat-cat.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='cat.c' object='isl_cat-cat.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_cat_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_cat-cat.o `test -f 'cat.c' || echo '$(srcdir)/'`cat.c isl_cat-cat.obj: cat.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_cat_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_cat-cat.obj -MD -MP -MF $(DEPDIR)/isl_cat-cat.Tpo -c -o isl_cat-cat.obj `if test -f 'cat.c'; then $(CYGPATH_W) 'cat.c'; else $(CYGPATH_W) '$(srcdir)/cat.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_cat-cat.Tpo $(DEPDIR)/isl_cat-cat.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='cat.c' object='isl_cat-cat.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_cat_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_cat-cat.obj `if test -f 'cat.c'; then $(CYGPATH_W) 'cat.c'; else $(CYGPATH_W) '$(srcdir)/cat.c'; fi` isl_closure-closure.o: closure.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_closure_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_closure-closure.o -MD -MP -MF $(DEPDIR)/isl_closure-closure.Tpo -c -o isl_closure-closure.o `test -f 'closure.c' || echo '$(srcdir)/'`closure.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_closure-closure.Tpo $(DEPDIR)/isl_closure-closure.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='closure.c' object='isl_closure-closure.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_closure_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_closure-closure.o `test -f 'closure.c' || echo '$(srcdir)/'`closure.c isl_closure-closure.obj: closure.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_closure_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_closure-closure.obj -MD -MP -MF $(DEPDIR)/isl_closure-closure.Tpo -c -o isl_closure-closure.obj `if test -f 'closure.c'; then $(CYGPATH_W) 'closure.c'; else $(CYGPATH_W) '$(srcdir)/closure.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_closure-closure.Tpo $(DEPDIR)/isl_closure-closure.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='closure.c' object='isl_closure-closure.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_closure_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_closure-closure.obj `if test -f 'closure.c'; then $(CYGPATH_W) 'closure.c'; else $(CYGPATH_W) '$(srcdir)/closure.c'; fi` isl_codegen-codegen.o: codegen.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_codegen_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_codegen-codegen.o -MD -MP -MF $(DEPDIR)/isl_codegen-codegen.Tpo -c -o isl_codegen-codegen.o `test -f 'codegen.c' || echo '$(srcdir)/'`codegen.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_codegen-codegen.Tpo $(DEPDIR)/isl_codegen-codegen.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='codegen.c' object='isl_codegen-codegen.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_codegen_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_codegen-codegen.o `test -f 'codegen.c' || echo '$(srcdir)/'`codegen.c isl_codegen-codegen.obj: codegen.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_codegen_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_codegen-codegen.obj -MD -MP -MF $(DEPDIR)/isl_codegen-codegen.Tpo -c -o isl_codegen-codegen.obj `if test -f 'codegen.c'; then $(CYGPATH_W) 'codegen.c'; else $(CYGPATH_W) '$(srcdir)/codegen.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_codegen-codegen.Tpo $(DEPDIR)/isl_codegen-codegen.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='codegen.c' object='isl_codegen-codegen.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_codegen_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_codegen-codegen.obj `if test -f 'codegen.c'; then $(CYGPATH_W) 'codegen.c'; else $(CYGPATH_W) '$(srcdir)/codegen.c'; fi` isl_pip-pip.o: pip.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_pip_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_pip-pip.o -MD -MP -MF $(DEPDIR)/isl_pip-pip.Tpo -c -o isl_pip-pip.o `test -f 'pip.c' || echo '$(srcdir)/'`pip.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_pip-pip.Tpo $(DEPDIR)/isl_pip-pip.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='pip.c' object='isl_pip-pip.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_pip_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_pip-pip.o `test -f 'pip.c' || echo '$(srcdir)/'`pip.c isl_pip-pip.obj: pip.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_pip_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_pip-pip.obj -MD -MP -MF $(DEPDIR)/isl_pip-pip.Tpo -c -o isl_pip-pip.obj `if test -f 'pip.c'; then $(CYGPATH_W) 'pip.c'; else $(CYGPATH_W) '$(srcdir)/pip.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_pip-pip.Tpo $(DEPDIR)/isl_pip-pip.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='pip.c' object='isl_pip-pip.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_pip_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_pip-pip.obj `if test -f 'pip.c'; then $(CYGPATH_W) 'pip.c'; else $(CYGPATH_W) '$(srcdir)/pip.c'; fi` isl_polyhedron_detect_equalities-polyhedron_detect_equalities.o: polyhedron_detect_equalities.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_detect_equalities_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polyhedron_detect_equalities-polyhedron_detect_equalities.o -MD -MP -MF $(DEPDIR)/isl_polyhedron_detect_equalities-polyhedron_detect_equalities.Tpo -c -o isl_polyhedron_detect_equalities-polyhedron_detect_equalities.o `test -f 'polyhedron_detect_equalities.c' || echo '$(srcdir)/'`polyhedron_detect_equalities.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polyhedron_detect_equalities-polyhedron_detect_equalities.Tpo $(DEPDIR)/isl_polyhedron_detect_equalities-polyhedron_detect_equalities.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polyhedron_detect_equalities.c' object='isl_polyhedron_detect_equalities-polyhedron_detect_equalities.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_detect_equalities_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polyhedron_detect_equalities-polyhedron_detect_equalities.o `test -f 'polyhedron_detect_equalities.c' || echo '$(srcdir)/'`polyhedron_detect_equalities.c isl_polyhedron_detect_equalities-polyhedron_detect_equalities.obj: polyhedron_detect_equalities.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_detect_equalities_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polyhedron_detect_equalities-polyhedron_detect_equalities.obj -MD -MP -MF $(DEPDIR)/isl_polyhedron_detect_equalities-polyhedron_detect_equalities.Tpo -c -o isl_polyhedron_detect_equalities-polyhedron_detect_equalities.obj `if test -f 'polyhedron_detect_equalities.c'; then $(CYGPATH_W) 'polyhedron_detect_equalities.c'; else $(CYGPATH_W) '$(srcdir)/polyhedron_detect_equalities.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polyhedron_detect_equalities-polyhedron_detect_equalities.Tpo $(DEPDIR)/isl_polyhedron_detect_equalities-polyhedron_detect_equalities.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polyhedron_detect_equalities.c' object='isl_polyhedron_detect_equalities-polyhedron_detect_equalities.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_detect_equalities_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polyhedron_detect_equalities-polyhedron_detect_equalities.obj `if test -f 'polyhedron_detect_equalities.c'; then $(CYGPATH_W) 'polyhedron_detect_equalities.c'; else $(CYGPATH_W) '$(srcdir)/polyhedron_detect_equalities.c'; fi` isl_polyhedron_minimize-polyhedron_minimize.o: polyhedron_minimize.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_minimize_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polyhedron_minimize-polyhedron_minimize.o -MD -MP -MF $(DEPDIR)/isl_polyhedron_minimize-polyhedron_minimize.Tpo -c -o isl_polyhedron_minimize-polyhedron_minimize.o `test -f 'polyhedron_minimize.c' || echo '$(srcdir)/'`polyhedron_minimize.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polyhedron_minimize-polyhedron_minimize.Tpo $(DEPDIR)/isl_polyhedron_minimize-polyhedron_minimize.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polyhedron_minimize.c' object='isl_polyhedron_minimize-polyhedron_minimize.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_minimize_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polyhedron_minimize-polyhedron_minimize.o `test -f 'polyhedron_minimize.c' || echo '$(srcdir)/'`polyhedron_minimize.c isl_polyhedron_minimize-polyhedron_minimize.obj: polyhedron_minimize.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_minimize_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polyhedron_minimize-polyhedron_minimize.obj -MD -MP -MF $(DEPDIR)/isl_polyhedron_minimize-polyhedron_minimize.Tpo -c -o isl_polyhedron_minimize-polyhedron_minimize.obj `if test -f 'polyhedron_minimize.c'; then $(CYGPATH_W) 'polyhedron_minimize.c'; else $(CYGPATH_W) '$(srcdir)/polyhedron_minimize.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polyhedron_minimize-polyhedron_minimize.Tpo $(DEPDIR)/isl_polyhedron_minimize-polyhedron_minimize.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polyhedron_minimize.c' object='isl_polyhedron_minimize-polyhedron_minimize.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_minimize_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polyhedron_minimize-polyhedron_minimize.obj `if test -f 'polyhedron_minimize.c'; then $(CYGPATH_W) 'polyhedron_minimize.c'; else $(CYGPATH_W) '$(srcdir)/polyhedron_minimize.c'; fi` isl_polyhedron_sample-polyhedron_sample.o: polyhedron_sample.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_sample_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polyhedron_sample-polyhedron_sample.o -MD -MP -MF $(DEPDIR)/isl_polyhedron_sample-polyhedron_sample.Tpo -c -o isl_polyhedron_sample-polyhedron_sample.o `test -f 'polyhedron_sample.c' || echo '$(srcdir)/'`polyhedron_sample.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polyhedron_sample-polyhedron_sample.Tpo $(DEPDIR)/isl_polyhedron_sample-polyhedron_sample.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polyhedron_sample.c' object='isl_polyhedron_sample-polyhedron_sample.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_sample_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polyhedron_sample-polyhedron_sample.o `test -f 'polyhedron_sample.c' || echo '$(srcdir)/'`polyhedron_sample.c isl_polyhedron_sample-polyhedron_sample.obj: polyhedron_sample.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_sample_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polyhedron_sample-polyhedron_sample.obj -MD -MP -MF $(DEPDIR)/isl_polyhedron_sample-polyhedron_sample.Tpo -c -o isl_polyhedron_sample-polyhedron_sample.obj `if test -f 'polyhedron_sample.c'; then $(CYGPATH_W) 'polyhedron_sample.c'; else $(CYGPATH_W) '$(srcdir)/polyhedron_sample.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polyhedron_sample-polyhedron_sample.Tpo $(DEPDIR)/isl_polyhedron_sample-polyhedron_sample.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polyhedron_sample.c' object='isl_polyhedron_sample-polyhedron_sample.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polyhedron_sample_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polyhedron_sample-polyhedron_sample.obj `if test -f 'polyhedron_sample.c'; then $(CYGPATH_W) 'polyhedron_sample.c'; else $(CYGPATH_W) '$(srcdir)/polyhedron_sample.c'; fi` isl_polytope_scan-polytope_scan.o: polytope_scan.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polytope_scan_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polytope_scan-polytope_scan.o -MD -MP -MF $(DEPDIR)/isl_polytope_scan-polytope_scan.Tpo -c -o isl_polytope_scan-polytope_scan.o `test -f 'polytope_scan.c' || echo '$(srcdir)/'`polytope_scan.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polytope_scan-polytope_scan.Tpo $(DEPDIR)/isl_polytope_scan-polytope_scan.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polytope_scan.c' object='isl_polytope_scan-polytope_scan.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polytope_scan_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polytope_scan-polytope_scan.o `test -f 'polytope_scan.c' || echo '$(srcdir)/'`polytope_scan.c isl_polytope_scan-polytope_scan.obj: polytope_scan.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polytope_scan_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_polytope_scan-polytope_scan.obj -MD -MP -MF $(DEPDIR)/isl_polytope_scan-polytope_scan.Tpo -c -o isl_polytope_scan-polytope_scan.obj `if test -f 'polytope_scan.c'; then $(CYGPATH_W) 'polytope_scan.c'; else $(CYGPATH_W) '$(srcdir)/polytope_scan.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_polytope_scan-polytope_scan.Tpo $(DEPDIR)/isl_polytope_scan-polytope_scan.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='polytope_scan.c' object='isl_polytope_scan-polytope_scan.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_polytope_scan_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_polytope_scan-polytope_scan.obj `if test -f 'polytope_scan.c'; then $(CYGPATH_W) 'polytope_scan.c'; else $(CYGPATH_W) '$(srcdir)/polytope_scan.c'; fi` isl_test-isl_test.o: isl_test.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_test-isl_test.o -MD -MP -MF $(DEPDIR)/isl_test-isl_test.Tpo -c -o isl_test-isl_test.o `test -f 'isl_test.c' || echo '$(srcdir)/'`isl_test.c @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_test-isl_test.Tpo $(DEPDIR)/isl_test-isl_test.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_test.c' object='isl_test-isl_test.o' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_test-isl_test.o `test -f 'isl_test.c' || echo '$(srcdir)/'`isl_test.c isl_test-isl_test.obj: isl_test.c @am__fastdepCC_TRUE@ $(AM_V_CC)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT isl_test-isl_test.obj -MD -MP -MF $(DEPDIR)/isl_test-isl_test.Tpo -c -o isl_test-isl_test.obj `if test -f 'isl_test.c'; then $(CYGPATH_W) 'isl_test.c'; else $(CYGPATH_W) '$(srcdir)/isl_test.c'; fi` @am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/isl_test-isl_test.Tpo $(DEPDIR)/isl_test-isl_test.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='isl_test.c' object='isl_test-isl_test.obj' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(isl_test_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o isl_test-isl_test.obj `if test -f 'isl_test.c'; then $(CYGPATH_W) 'isl_test.c'; else $(CYGPATH_W) '$(srcdir)/isl_test.c'; fi` mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool config.lt install-pkgconfigDATA: $(pkgconfig_DATA) @$(NORMAL_INSTALL) test -z "$(pkgconfigdir)" || $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)" @list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(pkgconfigdir)'"; \ $(INSTALL_DATA) $$files "$(DESTDIR)$(pkgconfigdir)" || exit $$?; \ done uninstall-pkgconfigDATA: @$(NORMAL_UNINSTALL) @list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgconfigdir)'; $(am__uninstall_files_from_dir) install-nodist_pkgincludeHEADERS: $(nodist_pkginclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkgincludedir)" || $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" @list='$(nodist_pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkgincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgincludedir)" || exit $$?; \ done uninstall-nodist_pkgincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(nodist_pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgincludedir)'; $(am__uninstall_files_from_dir) install-pkgincludeHEADERS: $(pkginclude_HEADERS) @$(NORMAL_INSTALL) test -z "$(pkgincludedir)" || $(MKDIR_P) "$(DESTDIR)$(pkgincludedir)" @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(pkgincludedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(pkgincludedir)" || exit $$?; \ done uninstall-pkgincludeHEADERS: @$(NORMAL_UNINSTALL) @list='$(pkginclude_HEADERS)'; test -n "$(pkgincludedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgincludedir)'; $(am__uninstall_files_from_dir) # This directory's subdirectories are mostly independent; you can cd # into them and run `make' without going through this Makefile. # To change the values of `make' variables: instead of editing Makefiles, # (1) if the variable is set in `config.status', edit `config.status' # (which will cause the Makefiles to be regenerated when you run `make'); # (2) otherwise, pass the desired values on the `make' command line. $(RECURSIVE_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ list='$(SUBDIRS)'; for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" $(RECURSIVE_CLEAN_TARGETS): @fail= failcom='exit 1'; \ for f in x $$MAKEFLAGS; do \ case $$f in \ *=* | --[!k]*);; \ *k*) failcom='fail=yes';; \ esac; \ done; \ dot_seen=no; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ rev=''; for subdir in $$list; do \ if test "$$subdir" = "."; then :; else \ rev="$$subdir $$rev"; \ fi; \ done; \ rev="$$rev ."; \ target=`echo $@ | sed s/-recursive//`; \ for subdir in $$rev; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done && test -z "$$fail" tags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \ done ctags-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: tags-recursive $(HEADERS) $(SOURCES) isl_config.h.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ list='$(SOURCES) $(HEADERS) isl_config.h.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: CTAGS CTAGS: ctags-recursive $(HEADERS) $(SOURCES) isl_config.h.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) list='$(SOURCES) $(HEADERS) isl_config.h.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags check-TESTS: $(TESTS) @failed=0; all=0; xfail=0; xpass=0; skip=0; \ srcdir=$(srcdir); export srcdir; \ list=' $(TESTS) '; \ $(am__tty_colors); \ if test -n "$$list"; then \ for tst in $$list; do \ if test -f ./$$tst; then dir=./; \ elif test -f $$tst; then dir=; \ else dir="$(srcdir)/"; fi; \ if $(TESTS_ENVIRONMENT) $${dir}$$tst; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xpass=`expr $$xpass + 1`; \ failed=`expr $$failed + 1`; \ col=$$red; res=XPASS; \ ;; \ *) \ col=$$grn; res=PASS; \ ;; \ esac; \ elif test $$? -ne 77; then \ all=`expr $$all + 1`; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$tst[\ \ ]*) \ xfail=`expr $$xfail + 1`; \ col=$$lgn; res=XFAIL; \ ;; \ *) \ failed=`expr $$failed + 1`; \ col=$$red; res=FAIL; \ ;; \ esac; \ else \ skip=`expr $$skip + 1`; \ col=$$blu; res=SKIP; \ fi; \ echo "$${col}$$res$${std}: $$tst"; \ done; \ if test "$$all" -eq 1; then \ tests="test"; \ All=""; \ else \ tests="tests"; \ All="All "; \ fi; \ if test "$$failed" -eq 0; then \ if test "$$xfail" -eq 0; then \ banner="$$All$$all $$tests passed"; \ else \ if test "$$xfail" -eq 1; then failures=failure; else failures=failures; fi; \ banner="$$All$$all $$tests behaved as expected ($$xfail expected $$failures)"; \ fi; \ else \ if test "$$xpass" -eq 0; then \ banner="$$failed of $$all $$tests failed"; \ else \ if test "$$xpass" -eq 1; then passes=pass; else passes=passes; fi; \ banner="$$failed of $$all $$tests did not behave as expected ($$xpass unexpected $$passes)"; \ fi; \ fi; \ dashes="$$banner"; \ skipped=""; \ if test "$$skip" -ne 0; then \ if test "$$skip" -eq 1; then \ skipped="($$skip test was not run)"; \ else \ skipped="($$skip tests were not run)"; \ fi; \ test `echo "$$skipped" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$skipped"; \ fi; \ report=""; \ if test "$$failed" -ne 0 && test -n "$(PACKAGE_BUGREPORT)"; then \ report="Please report to $(PACKAGE_BUGREPORT)"; \ test `echo "$$report" | wc -c` -le `echo "$$banner" | wc -c` || \ dashes="$$report"; \ fi; \ dashes=`echo "$$dashes" | sed s/./=/g`; \ if test "$$failed" -eq 0; then \ col="$$grn"; \ else \ col="$$red"; \ fi; \ echo "$${col}$$dashes$${std}"; \ echo "$${col}$$banner$${std}"; \ test -z "$$skipped" || echo "$${col}$$skipped$${std}"; \ test -z "$$report" || echo "$${col}$$report$${std}"; \ echo "$${col}$$dashes$${std}"; \ test "$$failed" -eq 0; \ else :; fi distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__remove_distdir) dist-lzma: distdir tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma $(am__remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lzma*) \ lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\ *.tar.lz*) \ lzip -dc $(distdir).tar.lz | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @test -n '$(distuninstallcheck_dir)' || { \ echo 'ERROR: trying to run $@ with an empty' \ '$$(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ $(am__cd) '$(distuninstallcheck_dir)' || { \ echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: check-recursive all-am: Makefile $(LTLIBRARIES) $(PROGRAMS) $(DATA) $(HEADERS) \ isl_config.h installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(pkgconfigdir)" "$(DESTDIR)$(pkgincludedir)" "$(DESTDIR)$(pkgincludedir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-generic clean-libLTLIBRARIES clean-libtool \ clean-noinstPROGRAMS mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-hdr distclean-libtool distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-data-local install-nodist_pkgincludeHEADERS \ install-pkgconfigDATA install-pkgincludeHEADERS install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-libLTLIBRARIES install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-libLTLIBRARIES \ uninstall-nodist_pkgincludeHEADERS uninstall-pkgconfigDATA \ uninstall-pkgincludeHEADERS .MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all check-am \ ctags-recursive install-am install-strip tags-recursive .PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \ all all-am am--refresh check check-TESTS check-am clean \ clean-generic clean-libLTLIBRARIES clean-libtool \ clean-noinstPROGRAMS ctags ctags-recursive dist dist-all \ dist-bzip2 dist-gzip dist-hook dist-lzip dist-lzma dist-shar \ dist-tarZ dist-xz dist-zip distcheck distclean \ distclean-compile distclean-generic distclean-hdr \ distclean-libtool distclean-tags distcleancheck distdir \ distuninstallcheck dvi dvi-am html html-am info info-am \ install install-am install-data install-data-am \ install-data-local install-dvi install-dvi-am install-exec \ install-exec-am install-html install-html-am install-info \ install-info-am install-libLTLIBRARIES install-man \ install-nodist_pkgincludeHEADERS install-pdf install-pdf-am \ install-pkgconfigDATA install-pkgincludeHEADERS install-ps \ install-ps-am install-strip installcheck installcheck-am \ installdirs installdirs-am maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags tags-recursive uninstall uninstall-am \ uninstall-libLTLIBRARIES uninstall-nodist_pkgincludeHEADERS \ uninstall-pkgconfigDATA uninstall-pkgincludeHEADERS dist-hook: echo @GIT_HEAD_VERSION@ > $(distdir)/GIT_HEAD_ID (cd doc; make manual.pdf) cp doc/manual.pdf $(distdir)/doc/ gitversion.h: @GIT_HEAD@ $(AM_V_GEN)echo '#define GIT_HEAD_ID "'@GIT_HEAD_VERSION@'"' > $@ install-data-local: $(srcdir)/isl.py @libisl=`sed -ne "/^library_names=/{s/.*='//;s/'$$//;s/ .*//;p;}" \ $(builddir)/libisl.la`; \ case $$libisl in \ '') echo Cannot find isl library name. GDB bindings not installed.;; \ *) echo $(INSTALL_DATA) $(srcdir)/isl.py \ $(DESTDIR)$(libdir)/$$libisl-gdb.py; \ test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)"; \ $(INSTALL_DATA) $(srcdir)/isl.py $(DESTDIR)$(libdir)/$$libisl-gdb.py; esac # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: cloog-0.18.2/isl/isl_ast_graft_private.h0000664000175000017500000000611512254313240015142 00000000000000#ifndef ISL_AST_GRAFT_PRIVATE_H #define ISL_AST_GRAFT_PRIVATE_H #include #include #include #include struct isl_ast_graft; typedef struct isl_ast_graft isl_ast_graft; /* Representation of part of an AST ("node") with some additional polyhedral * information about the tree. * * "guard" contains conditions that should still be enforced by * some ancestor of the current tree. In particular, the already * generated tree assumes that these conditions hold, but may not * enforced them itself. * The guard should not contain any unknown divs as it will be used * to generate an if condition. * * "enforced" expresses constraints that are already enforced by the for * nodes in the current tree and that therefore do not need to be enforced * by any ancestor. * The constraints only involve outer loop iterators. */ struct isl_ast_graft { int ref; isl_ast_node *node; isl_set *guard; isl_basic_set *enforced; }; ISL_DECLARE_LIST(ast_graft) #undef EL #define EL isl_ast_graft #include isl_ctx *isl_ast_graft_get_ctx(__isl_keep isl_ast_graft *graft); __isl_give isl_ast_graft *isl_ast_graft_alloc( __isl_take isl_ast_node *node, __isl_keep isl_ast_build *build); __isl_give isl_ast_graft *isl_ast_graft_alloc_level( __isl_take isl_ast_graft_list *children, __isl_keep isl_ast_build *build, __isl_keep isl_ast_build *sub_build); __isl_give isl_ast_graft_list *isl_ast_graft_list_fuse( __isl_take isl_ast_graft_list *children, __isl_keep isl_ast_build *build); __isl_give isl_ast_graft *isl_ast_graft_alloc_domain( __isl_take isl_map *schedule, __isl_keep isl_ast_build *build); void *isl_ast_graft_free(__isl_take isl_ast_graft *graft); __isl_give isl_ast_graft_list *isl_ast_graft_list_sort_guard( __isl_take isl_ast_graft_list *list); __isl_give isl_ast_graft_list *isl_ast_graft_list_merge( __isl_take isl_ast_graft_list *list1, __isl_take isl_ast_graft_list *list2, __isl_keep isl_ast_build *build); __isl_give isl_ast_node *isl_ast_graft_get_node( __isl_keep isl_ast_graft *graft); __isl_give isl_basic_set *isl_ast_graft_get_enforced( __isl_keep isl_ast_graft *graft); __isl_give isl_set *isl_ast_graft_get_guard(__isl_keep isl_ast_graft *graft); __isl_give isl_ast_graft *isl_ast_graft_insert_for( __isl_take isl_ast_graft *graft, __isl_take isl_ast_node *node); __isl_give isl_ast_graft *isl_ast_graft_add_guard( __isl_take isl_ast_graft *graft, __isl_take isl_set *guard, __isl_keep isl_ast_build *build); __isl_give isl_ast_graft *isl_ast_graft_enforce( __isl_take isl_ast_graft *graft, __isl_take isl_basic_set *enforced); __isl_give isl_ast_graft_list *isl_ast_graft_list_unembed( __isl_take isl_ast_graft_list *list, int product); __isl_give isl_ast_graft_list *isl_ast_graft_list_preimage_multi_aff( __isl_take isl_ast_graft_list *list, __isl_take isl_multi_aff *ma); __isl_give isl_ast_node *isl_ast_node_from_graft_list( __isl_take isl_ast_graft_list *list, __isl_keep isl_ast_build *build); __isl_give isl_printer *isl_printer_print_ast_graft(__isl_take isl_printer *p, __isl_keep isl_ast_graft *graft); #endif cloog-0.18.2/isl/isl_tab.c0000664000175000017500000026315412254313240012207 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France */ #include #include #include "isl_map_private.h" #include "isl_tab.h" #include #include /* * The implementation of tableaus in this file was inspired by Section 8 * of David Detlefs, Greg Nelson and James B. Saxe, "Simplify: a theorem * prover for program checking". */ struct isl_tab *isl_tab_alloc(struct isl_ctx *ctx, unsigned n_row, unsigned n_var, unsigned M) { int i; struct isl_tab *tab; unsigned off = 2 + M; tab = isl_calloc_type(ctx, struct isl_tab); if (!tab) return NULL; tab->mat = isl_mat_alloc(ctx, n_row, off + n_var); if (!tab->mat) goto error; tab->var = isl_alloc_array(ctx, struct isl_tab_var, n_var); if (n_var && !tab->var) goto error; tab->con = isl_alloc_array(ctx, struct isl_tab_var, n_row); if (n_row && !tab->con) goto error; tab->col_var = isl_alloc_array(ctx, int, n_var); if (n_var && !tab->col_var) goto error; tab->row_var = isl_alloc_array(ctx, int, n_row); if (n_row && !tab->row_var) goto error; for (i = 0; i < n_var; ++i) { tab->var[i].index = i; tab->var[i].is_row = 0; tab->var[i].is_nonneg = 0; tab->var[i].is_zero = 0; tab->var[i].is_redundant = 0; tab->var[i].frozen = 0; tab->var[i].negated = 0; tab->col_var[i] = i; } tab->n_row = 0; tab->n_con = 0; tab->n_eq = 0; tab->max_con = n_row; tab->n_col = n_var; tab->n_var = n_var; tab->max_var = n_var; tab->n_param = 0; tab->n_div = 0; tab->n_dead = 0; tab->n_redundant = 0; tab->strict_redundant = 0; tab->need_undo = 0; tab->rational = 0; tab->empty = 0; tab->in_undo = 0; tab->M = M; tab->cone = 0; tab->bottom.type = isl_tab_undo_bottom; tab->bottom.next = NULL; tab->top = &tab->bottom; tab->n_zero = 0; tab->n_unbounded = 0; tab->basis = NULL; return tab; error: isl_tab_free(tab); return NULL; } isl_ctx *isl_tab_get_ctx(struct isl_tab *tab) { return tab ? isl_mat_get_ctx(tab->mat) : NULL; } int isl_tab_extend_cons(struct isl_tab *tab, unsigned n_new) { unsigned off; if (!tab) return -1; off = 2 + tab->M; if (tab->max_con < tab->n_con + n_new) { struct isl_tab_var *con; con = isl_realloc_array(tab->mat->ctx, tab->con, struct isl_tab_var, tab->max_con + n_new); if (!con) return -1; tab->con = con; tab->max_con += n_new; } if (tab->mat->n_row < tab->n_row + n_new) { int *row_var; tab->mat = isl_mat_extend(tab->mat, tab->n_row + n_new, off + tab->n_col); if (!tab->mat) return -1; row_var = isl_realloc_array(tab->mat->ctx, tab->row_var, int, tab->mat->n_row); if (!row_var) return -1; tab->row_var = row_var; if (tab->row_sign) { enum isl_tab_row_sign *s; s = isl_realloc_array(tab->mat->ctx, tab->row_sign, enum isl_tab_row_sign, tab->mat->n_row); if (!s) return -1; tab->row_sign = s; } } return 0; } /* Make room for at least n_new extra variables. * Return -1 if anything went wrong. */ int isl_tab_extend_vars(struct isl_tab *tab, unsigned n_new) { struct isl_tab_var *var; unsigned off = 2 + tab->M; if (tab->max_var < tab->n_var + n_new) { var = isl_realloc_array(tab->mat->ctx, tab->var, struct isl_tab_var, tab->n_var + n_new); if (!var) return -1; tab->var = var; tab->max_var += n_new; } if (tab->mat->n_col < off + tab->n_col + n_new) { int *p; tab->mat = isl_mat_extend(tab->mat, tab->mat->n_row, off + tab->n_col + n_new); if (!tab->mat) return -1; p = isl_realloc_array(tab->mat->ctx, tab->col_var, int, tab->n_col + n_new); if (!p) return -1; tab->col_var = p; } return 0; } struct isl_tab *isl_tab_extend(struct isl_tab *tab, unsigned n_new) { if (isl_tab_extend_cons(tab, n_new) >= 0) return tab; isl_tab_free(tab); return NULL; } static void free_undo_record(struct isl_tab_undo *undo) { switch (undo->type) { case isl_tab_undo_saved_basis: free(undo->u.col_var); break; default:; } free(undo); } static void free_undo(struct isl_tab *tab) { struct isl_tab_undo *undo, *next; for (undo = tab->top; undo && undo != &tab->bottom; undo = next) { next = undo->next; free_undo_record(undo); } tab->top = undo; } void isl_tab_free(struct isl_tab *tab) { if (!tab) return; free_undo(tab); isl_mat_free(tab->mat); isl_vec_free(tab->dual); isl_basic_map_free(tab->bmap); free(tab->var); free(tab->con); free(tab->row_var); free(tab->col_var); free(tab->row_sign); isl_mat_free(tab->samples); free(tab->sample_index); isl_mat_free(tab->basis); free(tab); } struct isl_tab *isl_tab_dup(struct isl_tab *tab) { int i; struct isl_tab *dup; unsigned off; if (!tab) return NULL; off = 2 + tab->M; dup = isl_calloc_type(tab->mat->ctx, struct isl_tab); if (!dup) return NULL; dup->mat = isl_mat_dup(tab->mat); if (!dup->mat) goto error; dup->var = isl_alloc_array(tab->mat->ctx, struct isl_tab_var, tab->max_var); if (tab->max_var && !dup->var) goto error; for (i = 0; i < tab->n_var; ++i) dup->var[i] = tab->var[i]; dup->con = isl_alloc_array(tab->mat->ctx, struct isl_tab_var, tab->max_con); if (tab->max_con && !dup->con) goto error; for (i = 0; i < tab->n_con; ++i) dup->con[i] = tab->con[i]; dup->col_var = isl_alloc_array(tab->mat->ctx, int, tab->mat->n_col - off); if ((tab->mat->n_col - off) && !dup->col_var) goto error; for (i = 0; i < tab->n_col; ++i) dup->col_var[i] = tab->col_var[i]; dup->row_var = isl_alloc_array(tab->mat->ctx, int, tab->mat->n_row); if (tab->mat->n_row && !dup->row_var) goto error; for (i = 0; i < tab->n_row; ++i) dup->row_var[i] = tab->row_var[i]; if (tab->row_sign) { dup->row_sign = isl_alloc_array(tab->mat->ctx, enum isl_tab_row_sign, tab->mat->n_row); if (tab->mat->n_row && !dup->row_sign) goto error; for (i = 0; i < tab->n_row; ++i) dup->row_sign[i] = tab->row_sign[i]; } if (tab->samples) { dup->samples = isl_mat_dup(tab->samples); if (!dup->samples) goto error; dup->sample_index = isl_alloc_array(tab->mat->ctx, int, tab->samples->n_row); if (tab->samples->n_row && !dup->sample_index) goto error; dup->n_sample = tab->n_sample; dup->n_outside = tab->n_outside; } dup->n_row = tab->n_row; dup->n_con = tab->n_con; dup->n_eq = tab->n_eq; dup->max_con = tab->max_con; dup->n_col = tab->n_col; dup->n_var = tab->n_var; dup->max_var = tab->max_var; dup->n_param = tab->n_param; dup->n_div = tab->n_div; dup->n_dead = tab->n_dead; dup->n_redundant = tab->n_redundant; dup->rational = tab->rational; dup->empty = tab->empty; dup->strict_redundant = 0; dup->need_undo = 0; dup->in_undo = 0; dup->M = tab->M; tab->cone = tab->cone; dup->bottom.type = isl_tab_undo_bottom; dup->bottom.next = NULL; dup->top = &dup->bottom; dup->n_zero = tab->n_zero; dup->n_unbounded = tab->n_unbounded; dup->basis = isl_mat_dup(tab->basis); return dup; error: isl_tab_free(dup); return NULL; } /* Construct the coefficient matrix of the product tableau * of two tableaus. * mat{1,2} is the coefficient matrix of tableau {1,2} * row{1,2} is the number of rows in tableau {1,2} * col{1,2} is the number of columns in tableau {1,2} * off is the offset to the coefficient column (skipping the * denominator, the constant term and the big parameter if any) * r{1,2} is the number of redundant rows in tableau {1,2} * d{1,2} is the number of dead columns in tableau {1,2} * * The order of the rows and columns in the result is as explained * in isl_tab_product. */ static struct isl_mat *tab_mat_product(struct isl_mat *mat1, struct isl_mat *mat2, unsigned row1, unsigned row2, unsigned col1, unsigned col2, unsigned off, unsigned r1, unsigned r2, unsigned d1, unsigned d2) { int i; struct isl_mat *prod; unsigned n; prod = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row, off + col1 + col2); if (!prod) return NULL; n = 0; for (i = 0; i < r1; ++i) { isl_seq_cpy(prod->row[n + i], mat1->row[i], off + d1); isl_seq_clr(prod->row[n + i] + off + d1, d2); isl_seq_cpy(prod->row[n + i] + off + d1 + d2, mat1->row[i] + off + d1, col1 - d1); isl_seq_clr(prod->row[n + i] + off + col1 + d1, col2 - d2); } n += r1; for (i = 0; i < r2; ++i) { isl_seq_cpy(prod->row[n + i], mat2->row[i], off); isl_seq_clr(prod->row[n + i] + off, d1); isl_seq_cpy(prod->row[n + i] + off + d1, mat2->row[i] + off, d2); isl_seq_clr(prod->row[n + i] + off + d1 + d2, col1 - d1); isl_seq_cpy(prod->row[n + i] + off + col1 + d1, mat2->row[i] + off + d2, col2 - d2); } n += r2; for (i = 0; i < row1 - r1; ++i) { isl_seq_cpy(prod->row[n + i], mat1->row[r1 + i], off + d1); isl_seq_clr(prod->row[n + i] + off + d1, d2); isl_seq_cpy(prod->row[n + i] + off + d1 + d2, mat1->row[r1 + i] + off + d1, col1 - d1); isl_seq_clr(prod->row[n + i] + off + col1 + d1, col2 - d2); } n += row1 - r1; for (i = 0; i < row2 - r2; ++i) { isl_seq_cpy(prod->row[n + i], mat2->row[r2 + i], off); isl_seq_clr(prod->row[n + i] + off, d1); isl_seq_cpy(prod->row[n + i] + off + d1, mat2->row[r2 + i] + off, d2); isl_seq_clr(prod->row[n + i] + off + d1 + d2, col1 - d1); isl_seq_cpy(prod->row[n + i] + off + col1 + d1, mat2->row[r2 + i] + off + d2, col2 - d2); } return prod; } /* Update the row or column index of a variable that corresponds * to a variable in the first input tableau. */ static void update_index1(struct isl_tab_var *var, unsigned r1, unsigned r2, unsigned d1, unsigned d2) { if (var->index == -1) return; if (var->is_row && var->index >= r1) var->index += r2; if (!var->is_row && var->index >= d1) var->index += d2; } /* Update the row or column index of a variable that corresponds * to a variable in the second input tableau. */ static void update_index2(struct isl_tab_var *var, unsigned row1, unsigned col1, unsigned r1, unsigned r2, unsigned d1, unsigned d2) { if (var->index == -1) return; if (var->is_row) { if (var->index < r2) var->index += r1; else var->index += row1; } else { if (var->index < d2) var->index += d1; else var->index += col1; } } /* Create a tableau that represents the Cartesian product of the sets * represented by tableaus tab1 and tab2. * The order of the rows in the product is * - redundant rows of tab1 * - redundant rows of tab2 * - non-redundant rows of tab1 * - non-redundant rows of tab2 * The order of the columns is * - denominator * - constant term * - coefficient of big parameter, if any * - dead columns of tab1 * - dead columns of tab2 * - live columns of tab1 * - live columns of tab2 * The order of the variables and the constraints is a concatenation * of order in the two input tableaus. */ struct isl_tab *isl_tab_product(struct isl_tab *tab1, struct isl_tab *tab2) { int i; struct isl_tab *prod; unsigned off; unsigned r1, r2, d1, d2; if (!tab1 || !tab2) return NULL; isl_assert(tab1->mat->ctx, tab1->M == tab2->M, return NULL); isl_assert(tab1->mat->ctx, tab1->rational == tab2->rational, return NULL); isl_assert(tab1->mat->ctx, tab1->cone == tab2->cone, return NULL); isl_assert(tab1->mat->ctx, !tab1->row_sign, return NULL); isl_assert(tab1->mat->ctx, !tab2->row_sign, return NULL); isl_assert(tab1->mat->ctx, tab1->n_param == 0, return NULL); isl_assert(tab1->mat->ctx, tab2->n_param == 0, return NULL); isl_assert(tab1->mat->ctx, tab1->n_div == 0, return NULL); isl_assert(tab1->mat->ctx, tab2->n_div == 0, return NULL); off = 2 + tab1->M; r1 = tab1->n_redundant; r2 = tab2->n_redundant; d1 = tab1->n_dead; d2 = tab2->n_dead; prod = isl_calloc_type(tab1->mat->ctx, struct isl_tab); if (!prod) return NULL; prod->mat = tab_mat_product(tab1->mat, tab2->mat, tab1->n_row, tab2->n_row, tab1->n_col, tab2->n_col, off, r1, r2, d1, d2); if (!prod->mat) goto error; prod->var = isl_alloc_array(tab1->mat->ctx, struct isl_tab_var, tab1->max_var + tab2->max_var); if ((tab1->max_var + tab2->max_var) && !prod->var) goto error; for (i = 0; i < tab1->n_var; ++i) { prod->var[i] = tab1->var[i]; update_index1(&prod->var[i], r1, r2, d1, d2); } for (i = 0; i < tab2->n_var; ++i) { prod->var[tab1->n_var + i] = tab2->var[i]; update_index2(&prod->var[tab1->n_var + i], tab1->n_row, tab1->n_col, r1, r2, d1, d2); } prod->con = isl_alloc_array(tab1->mat->ctx, struct isl_tab_var, tab1->max_con + tab2->max_con); if ((tab1->max_con + tab2->max_con) && !prod->con) goto error; for (i = 0; i < tab1->n_con; ++i) { prod->con[i] = tab1->con[i]; update_index1(&prod->con[i], r1, r2, d1, d2); } for (i = 0; i < tab2->n_con; ++i) { prod->con[tab1->n_con + i] = tab2->con[i]; update_index2(&prod->con[tab1->n_con + i], tab1->n_row, tab1->n_col, r1, r2, d1, d2); } prod->col_var = isl_alloc_array(tab1->mat->ctx, int, tab1->n_col + tab2->n_col); if ((tab1->n_col + tab2->n_col) && !prod->col_var) goto error; for (i = 0; i < tab1->n_col; ++i) { int pos = i < d1 ? i : i + d2; prod->col_var[pos] = tab1->col_var[i]; } for (i = 0; i < tab2->n_col; ++i) { int pos = i < d2 ? d1 + i : tab1->n_col + i; int t = tab2->col_var[i]; if (t >= 0) t += tab1->n_var; else t -= tab1->n_con; prod->col_var[pos] = t; } prod->row_var = isl_alloc_array(tab1->mat->ctx, int, tab1->mat->n_row + tab2->mat->n_row); if ((tab1->mat->n_row + tab2->mat->n_row) && !prod->row_var) goto error; for (i = 0; i < tab1->n_row; ++i) { int pos = i < r1 ? i : i + r2; prod->row_var[pos] = tab1->row_var[i]; } for (i = 0; i < tab2->n_row; ++i) { int pos = i < r2 ? r1 + i : tab1->n_row + i; int t = tab2->row_var[i]; if (t >= 0) t += tab1->n_var; else t -= tab1->n_con; prod->row_var[pos] = t; } prod->samples = NULL; prod->sample_index = NULL; prod->n_row = tab1->n_row + tab2->n_row; prod->n_con = tab1->n_con + tab2->n_con; prod->n_eq = 0; prod->max_con = tab1->max_con + tab2->max_con; prod->n_col = tab1->n_col + tab2->n_col; prod->n_var = tab1->n_var + tab2->n_var; prod->max_var = tab1->max_var + tab2->max_var; prod->n_param = 0; prod->n_div = 0; prod->n_dead = tab1->n_dead + tab2->n_dead; prod->n_redundant = tab1->n_redundant + tab2->n_redundant; prod->rational = tab1->rational; prod->empty = tab1->empty || tab2->empty; prod->strict_redundant = tab1->strict_redundant || tab2->strict_redundant; prod->need_undo = 0; prod->in_undo = 0; prod->M = tab1->M; prod->cone = tab1->cone; prod->bottom.type = isl_tab_undo_bottom; prod->bottom.next = NULL; prod->top = &prod->bottom; prod->n_zero = 0; prod->n_unbounded = 0; prod->basis = NULL; return prod; error: isl_tab_free(prod); return NULL; } static struct isl_tab_var *var_from_index(struct isl_tab *tab, int i) { if (i >= 0) return &tab->var[i]; else return &tab->con[~i]; } struct isl_tab_var *isl_tab_var_from_row(struct isl_tab *tab, int i) { return var_from_index(tab, tab->row_var[i]); } static struct isl_tab_var *var_from_col(struct isl_tab *tab, int i) { return var_from_index(tab, tab->col_var[i]); } /* Check if there are any upper bounds on column variable "var", * i.e., non-negative rows where var appears with a negative coefficient. * Return 1 if there are no such bounds. */ static int max_is_manifestly_unbounded(struct isl_tab *tab, struct isl_tab_var *var) { int i; unsigned off = 2 + tab->M; if (var->is_row) return 0; for (i = tab->n_redundant; i < tab->n_row; ++i) { if (!isl_int_is_neg(tab->mat->row[i][off + var->index])) continue; if (isl_tab_var_from_row(tab, i)->is_nonneg) return 0; } return 1; } /* Check if there are any lower bounds on column variable "var", * i.e., non-negative rows where var appears with a positive coefficient. * Return 1 if there are no such bounds. */ static int min_is_manifestly_unbounded(struct isl_tab *tab, struct isl_tab_var *var) { int i; unsigned off = 2 + tab->M; if (var->is_row) return 0; for (i = tab->n_redundant; i < tab->n_row; ++i) { if (!isl_int_is_pos(tab->mat->row[i][off + var->index])) continue; if (isl_tab_var_from_row(tab, i)->is_nonneg) return 0; } return 1; } static int row_cmp(struct isl_tab *tab, int r1, int r2, int c, isl_int t) { unsigned off = 2 + tab->M; if (tab->M) { int s; isl_int_mul(t, tab->mat->row[r1][2], tab->mat->row[r2][off+c]); isl_int_submul(t, tab->mat->row[r2][2], tab->mat->row[r1][off+c]); s = isl_int_sgn(t); if (s) return s; } isl_int_mul(t, tab->mat->row[r1][1], tab->mat->row[r2][off + c]); isl_int_submul(t, tab->mat->row[r2][1], tab->mat->row[r1][off + c]); return isl_int_sgn(t); } /* Given the index of a column "c", return the index of a row * that can be used to pivot the column in, with either an increase * (sgn > 0) or a decrease (sgn < 0) of the corresponding variable. * If "var" is not NULL, then the row returned will be different from * the one associated with "var". * * Each row in the tableau is of the form * * x_r = a_r0 + \sum_i a_ri x_i * * Only rows with x_r >= 0 and with the sign of a_ri opposite to "sgn" * impose any limit on the increase or decrease in the value of x_c * and this bound is equal to a_r0 / |a_rc|. We are therefore looking * for the row with the smallest (most stringent) such bound. * Note that the common denominator of each row drops out of the fraction. * To check if row j has a smaller bound than row r, i.e., * a_j0 / |a_jc| < a_r0 / |a_rc| or a_j0 |a_rc| < a_r0 |a_jc|, * we check if -sign(a_jc) (a_j0 a_rc - a_r0 a_jc) < 0, * where -sign(a_jc) is equal to "sgn". */ static int pivot_row(struct isl_tab *tab, struct isl_tab_var *var, int sgn, int c) { int j, r, tsgn; isl_int t; unsigned off = 2 + tab->M; isl_int_init(t); r = -1; for (j = tab->n_redundant; j < tab->n_row; ++j) { if (var && j == var->index) continue; if (!isl_tab_var_from_row(tab, j)->is_nonneg) continue; if (sgn * isl_int_sgn(tab->mat->row[j][off + c]) >= 0) continue; if (r < 0) { r = j; continue; } tsgn = sgn * row_cmp(tab, r, j, c, t); if (tsgn < 0 || (tsgn == 0 && tab->row_var[j] < tab->row_var[r])) r = j; } isl_int_clear(t); return r; } /* Find a pivot (row and col) that will increase (sgn > 0) or decrease * (sgn < 0) the value of row variable var. * If not NULL, then skip_var is a row variable that should be ignored * while looking for a pivot row. It is usually equal to var. * * As the given row in the tableau is of the form * * x_r = a_r0 + \sum_i a_ri x_i * * we need to find a column such that the sign of a_ri is equal to "sgn" * (such that an increase in x_i will have the desired effect) or a * column with a variable that may attain negative values. * If a_ri is positive, then we need to move x_i in the same direction * to obtain the desired effect. Otherwise, x_i has to move in the * opposite direction. */ static void find_pivot(struct isl_tab *tab, struct isl_tab_var *var, struct isl_tab_var *skip_var, int sgn, int *row, int *col) { int j, r, c; isl_int *tr; *row = *col = -1; isl_assert(tab->mat->ctx, var->is_row, return); tr = tab->mat->row[var->index] + 2 + tab->M; c = -1; for (j = tab->n_dead; j < tab->n_col; ++j) { if (isl_int_is_zero(tr[j])) continue; if (isl_int_sgn(tr[j]) != sgn && var_from_col(tab, j)->is_nonneg) continue; if (c < 0 || tab->col_var[j] < tab->col_var[c]) c = j; } if (c < 0) return; sgn *= isl_int_sgn(tr[c]); r = pivot_row(tab, skip_var, sgn, c); *row = r < 0 ? var->index : r; *col = c; } /* Return 1 if row "row" represents an obviously redundant inequality. * This means * - it represents an inequality or a variable * - that is the sum of a non-negative sample value and a positive * combination of zero or more non-negative constraints. */ int isl_tab_row_is_redundant(struct isl_tab *tab, int row) { int i; unsigned off = 2 + tab->M; if (tab->row_var[row] < 0 && !isl_tab_var_from_row(tab, row)->is_nonneg) return 0; if (isl_int_is_neg(tab->mat->row[row][1])) return 0; if (tab->strict_redundant && isl_int_is_zero(tab->mat->row[row][1])) return 0; if (tab->M && isl_int_is_neg(tab->mat->row[row][2])) return 0; for (i = tab->n_dead; i < tab->n_col; ++i) { if (isl_int_is_zero(tab->mat->row[row][off + i])) continue; if (tab->col_var[i] >= 0) return 0; if (isl_int_is_neg(tab->mat->row[row][off + i])) return 0; if (!var_from_col(tab, i)->is_nonneg) return 0; } return 1; } static void swap_rows(struct isl_tab *tab, int row1, int row2) { int t; enum isl_tab_row_sign s; t = tab->row_var[row1]; tab->row_var[row1] = tab->row_var[row2]; tab->row_var[row2] = t; isl_tab_var_from_row(tab, row1)->index = row1; isl_tab_var_from_row(tab, row2)->index = row2; tab->mat = isl_mat_swap_rows(tab->mat, row1, row2); if (!tab->row_sign) return; s = tab->row_sign[row1]; tab->row_sign[row1] = tab->row_sign[row2]; tab->row_sign[row2] = s; } static int push_union(struct isl_tab *tab, enum isl_tab_undo_type type, union isl_tab_undo_val u) WARN_UNUSED; static int push_union(struct isl_tab *tab, enum isl_tab_undo_type type, union isl_tab_undo_val u) { struct isl_tab_undo *undo; if (!tab) return -1; if (!tab->need_undo) return 0; undo = isl_alloc_type(tab->mat->ctx, struct isl_tab_undo); if (!undo) return -1; undo->type = type; undo->u = u; undo->next = tab->top; tab->top = undo; return 0; } int isl_tab_push_var(struct isl_tab *tab, enum isl_tab_undo_type type, struct isl_tab_var *var) { union isl_tab_undo_val u; if (var->is_row) u.var_index = tab->row_var[var->index]; else u.var_index = tab->col_var[var->index]; return push_union(tab, type, u); } int isl_tab_push(struct isl_tab *tab, enum isl_tab_undo_type type) { union isl_tab_undo_val u = { 0 }; return push_union(tab, type, u); } /* Push a record on the undo stack describing the current basic * variables, so that the this state can be restored during rollback. */ int isl_tab_push_basis(struct isl_tab *tab) { int i; union isl_tab_undo_val u; u.col_var = isl_alloc_array(tab->mat->ctx, int, tab->n_col); if (tab->n_col && !u.col_var) return -1; for (i = 0; i < tab->n_col; ++i) u.col_var[i] = tab->col_var[i]; return push_union(tab, isl_tab_undo_saved_basis, u); } int isl_tab_push_callback(struct isl_tab *tab, struct isl_tab_callback *callback) { union isl_tab_undo_val u; u.callback = callback; return push_union(tab, isl_tab_undo_callback, u); } struct isl_tab *isl_tab_init_samples(struct isl_tab *tab) { if (!tab) return NULL; tab->n_sample = 0; tab->n_outside = 0; tab->samples = isl_mat_alloc(tab->mat->ctx, 1, 1 + tab->n_var); if (!tab->samples) goto error; tab->sample_index = isl_alloc_array(tab->mat->ctx, int, 1); if (!tab->sample_index) goto error; return tab; error: isl_tab_free(tab); return NULL; } struct isl_tab *isl_tab_add_sample(struct isl_tab *tab, __isl_take isl_vec *sample) { if (!tab || !sample) goto error; if (tab->n_sample + 1 > tab->samples->n_row) { int *t = isl_realloc_array(tab->mat->ctx, tab->sample_index, int, tab->n_sample + 1); if (!t) goto error; tab->sample_index = t; } tab->samples = isl_mat_extend(tab->samples, tab->n_sample + 1, tab->samples->n_col); if (!tab->samples) goto error; isl_seq_cpy(tab->samples->row[tab->n_sample], sample->el, sample->size); isl_vec_free(sample); tab->sample_index[tab->n_sample] = tab->n_sample; tab->n_sample++; return tab; error: isl_vec_free(sample); isl_tab_free(tab); return NULL; } struct isl_tab *isl_tab_drop_sample(struct isl_tab *tab, int s) { if (s != tab->n_outside) { int t = tab->sample_index[tab->n_outside]; tab->sample_index[tab->n_outside] = tab->sample_index[s]; tab->sample_index[s] = t; isl_mat_swap_rows(tab->samples, tab->n_outside, s); } tab->n_outside++; if (isl_tab_push(tab, isl_tab_undo_drop_sample) < 0) { isl_tab_free(tab); return NULL; } return tab; } /* Record the current number of samples so that we can remove newer * samples during a rollback. */ int isl_tab_save_samples(struct isl_tab *tab) { union isl_tab_undo_val u; if (!tab) return -1; u.n = tab->n_sample; return push_union(tab, isl_tab_undo_saved_samples, u); } /* Mark row with index "row" as being redundant. * If we may need to undo the operation or if the row represents * a variable of the original problem, the row is kept, * but no longer considered when looking for a pivot row. * Otherwise, the row is simply removed. * * The row may be interchanged with some other row. If it * is interchanged with a later row, return 1. Otherwise return 0. * If the rows are checked in order in the calling function, * then a return value of 1 means that the row with the given * row number may now contain a different row that hasn't been checked yet. */ int isl_tab_mark_redundant(struct isl_tab *tab, int row) { struct isl_tab_var *var = isl_tab_var_from_row(tab, row); var->is_redundant = 1; isl_assert(tab->mat->ctx, row >= tab->n_redundant, return -1); if (tab->preserve || tab->need_undo || tab->row_var[row] >= 0) { if (tab->row_var[row] >= 0 && !var->is_nonneg) { var->is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, var) < 0) return -1; } if (row != tab->n_redundant) swap_rows(tab, row, tab->n_redundant); tab->n_redundant++; return isl_tab_push_var(tab, isl_tab_undo_redundant, var); } else { if (row != tab->n_row - 1) swap_rows(tab, row, tab->n_row - 1); isl_tab_var_from_row(tab, tab->n_row - 1)->index = -1; tab->n_row--; return 1; } } int isl_tab_mark_empty(struct isl_tab *tab) { if (!tab) return -1; if (!tab->empty && tab->need_undo) if (isl_tab_push(tab, isl_tab_undo_empty) < 0) return -1; tab->empty = 1; return 0; } int isl_tab_freeze_constraint(struct isl_tab *tab, int con) { struct isl_tab_var *var; if (!tab) return -1; var = &tab->con[con]; if (var->frozen) return 0; if (var->index < 0) return 0; var->frozen = 1; if (tab->need_undo) return isl_tab_push_var(tab, isl_tab_undo_freeze, var); return 0; } /* Update the rows signs after a pivot of "row" and "col", with "row_sgn" * the original sign of the pivot element. * We only keep track of row signs during PILP solving and in this case * we only pivot a row with negative sign (meaning the value is always * non-positive) using a positive pivot element. * * For each row j, the new value of the parametric constant is equal to * * a_j0 - a_jc a_r0/a_rc * * where a_j0 is the original parametric constant, a_rc is the pivot element, * a_r0 is the parametric constant of the pivot row and a_jc is the * pivot column entry of the row j. * Since a_r0 is non-positive and a_rc is positive, the sign of row j * remains the same if a_jc has the same sign as the row j or if * a_jc is zero. In all other cases, we reset the sign to "unknown". */ static void update_row_sign(struct isl_tab *tab, int row, int col, int row_sgn) { int i; struct isl_mat *mat = tab->mat; unsigned off = 2 + tab->M; if (!tab->row_sign) return; if (tab->row_sign[row] == 0) return; isl_assert(mat->ctx, row_sgn > 0, return); isl_assert(mat->ctx, tab->row_sign[row] == isl_tab_row_neg, return); tab->row_sign[row] = isl_tab_row_pos; for (i = 0; i < tab->n_row; ++i) { int s; if (i == row) continue; s = isl_int_sgn(mat->row[i][off + col]); if (!s) continue; if (!tab->row_sign[i]) continue; if (s < 0 && tab->row_sign[i] == isl_tab_row_neg) continue; if (s > 0 && tab->row_sign[i] == isl_tab_row_pos) continue; tab->row_sign[i] = isl_tab_row_unknown; } } /* Given a row number "row" and a column number "col", pivot the tableau * such that the associated variables are interchanged. * The given row in the tableau expresses * * x_r = a_r0 + \sum_i a_ri x_i * * or * * x_c = 1/a_rc x_r - a_r0/a_rc + sum_{i \ne r} -a_ri/a_rc * * Substituting this equality into the other rows * * x_j = a_j0 + \sum_i a_ji x_i * * with a_jc \ne 0, we obtain * * x_j = a_jc/a_rc x_r + a_j0 - a_jc a_r0/a_rc + sum a_ji - a_jc a_ri/a_rc * * The tableau * * n_rc/d_r n_ri/d_r * n_jc/d_j n_ji/d_j * * where i is any other column and j is any other row, * is therefore transformed into * * s(n_rc)d_r/|n_rc| -s(n_rc)n_ri/|n_rc| * s(n_rc)d_r n_jc/(|n_rc| d_j) (n_ji |n_rc| - s(n_rc)n_jc n_ri)/(|n_rc| d_j) * * The transformation is performed along the following steps * * d_r/n_rc n_ri/n_rc * n_jc/d_j n_ji/d_j * * s(n_rc)d_r/|n_rc| -s(n_rc)n_ri/|n_rc| * n_jc/d_j n_ji/d_j * * s(n_rc)d_r/|n_rc| -s(n_rc)n_ri/|n_rc| * n_jc/(|n_rc| d_j) n_ji/(|n_rc| d_j) * * s(n_rc)d_r/|n_rc| -s(n_rc)n_ri/|n_rc| * n_jc/(|n_rc| d_j) (n_ji |n_rc|)/(|n_rc| d_j) * * s(n_rc)d_r/|n_rc| -s(n_rc)n_ri/|n_rc| * n_jc/(|n_rc| d_j) (n_ji |n_rc| - s(n_rc)n_jc n_ri)/(|n_rc| d_j) * * s(n_rc)d_r/|n_rc| -s(n_rc)n_ri/|n_rc| * s(n_rc)d_r n_jc/(|n_rc| d_j) (n_ji |n_rc| - s(n_rc)n_jc n_ri)/(|n_rc| d_j) * */ int isl_tab_pivot(struct isl_tab *tab, int row, int col) { int i, j; int sgn; int t; struct isl_mat *mat = tab->mat; struct isl_tab_var *var; unsigned off = 2 + tab->M; if (tab->mat->ctx->abort) { isl_ctx_set_error(tab->mat->ctx, isl_error_abort); return -1; } isl_int_swap(mat->row[row][0], mat->row[row][off + col]); sgn = isl_int_sgn(mat->row[row][0]); if (sgn < 0) { isl_int_neg(mat->row[row][0], mat->row[row][0]); isl_int_neg(mat->row[row][off + col], mat->row[row][off + col]); } else for (j = 0; j < off - 1 + tab->n_col; ++j) { if (j == off - 1 + col) continue; isl_int_neg(mat->row[row][1 + j], mat->row[row][1 + j]); } if (!isl_int_is_one(mat->row[row][0])) isl_seq_normalize(mat->ctx, mat->row[row], off + tab->n_col); for (i = 0; i < tab->n_row; ++i) { if (i == row) continue; if (isl_int_is_zero(mat->row[i][off + col])) continue; isl_int_mul(mat->row[i][0], mat->row[i][0], mat->row[row][0]); for (j = 0; j < off - 1 + tab->n_col; ++j) { if (j == off - 1 + col) continue; isl_int_mul(mat->row[i][1 + j], mat->row[i][1 + j], mat->row[row][0]); isl_int_addmul(mat->row[i][1 + j], mat->row[i][off + col], mat->row[row][1 + j]); } isl_int_mul(mat->row[i][off + col], mat->row[i][off + col], mat->row[row][off + col]); if (!isl_int_is_one(mat->row[i][0])) isl_seq_normalize(mat->ctx, mat->row[i], off + tab->n_col); } t = tab->row_var[row]; tab->row_var[row] = tab->col_var[col]; tab->col_var[col] = t; var = isl_tab_var_from_row(tab, row); var->is_row = 1; var->index = row; var = var_from_col(tab, col); var->is_row = 0; var->index = col; update_row_sign(tab, row, col, sgn); if (tab->in_undo) return 0; for (i = tab->n_redundant; i < tab->n_row; ++i) { if (isl_int_is_zero(mat->row[i][off + col])) continue; if (!isl_tab_var_from_row(tab, i)->frozen && isl_tab_row_is_redundant(tab, i)) { int redo = isl_tab_mark_redundant(tab, i); if (redo < 0) return -1; if (redo) --i; } } return 0; } /* If "var" represents a column variable, then pivot is up (sgn > 0) * or down (sgn < 0) to a row. The variable is assumed not to be * unbounded in the specified direction. * If sgn = 0, then the variable is unbounded in both directions, * and we pivot with any row we can find. */ static int to_row(struct isl_tab *tab, struct isl_tab_var *var, int sign) WARN_UNUSED; static int to_row(struct isl_tab *tab, struct isl_tab_var *var, int sign) { int r; unsigned off = 2 + tab->M; if (var->is_row) return 0; if (sign == 0) { for (r = tab->n_redundant; r < tab->n_row; ++r) if (!isl_int_is_zero(tab->mat->row[r][off+var->index])) break; isl_assert(tab->mat->ctx, r < tab->n_row, return -1); } else { r = pivot_row(tab, NULL, sign, var->index); isl_assert(tab->mat->ctx, r >= 0, return -1); } return isl_tab_pivot(tab, r, var->index); } /* Check whether all variables that are marked as non-negative * also have a non-negative sample value. This function is not * called from the current code but is useful during debugging. */ static void check_table(struct isl_tab *tab) __attribute__ ((unused)); static void check_table(struct isl_tab *tab) { int i; if (tab->empty) return; for (i = tab->n_redundant; i < tab->n_row; ++i) { struct isl_tab_var *var; var = isl_tab_var_from_row(tab, i); if (!var->is_nonneg) continue; if (tab->M) { isl_assert(tab->mat->ctx, !isl_int_is_neg(tab->mat->row[i][2]), abort()); if (isl_int_is_pos(tab->mat->row[i][2])) continue; } isl_assert(tab->mat->ctx, !isl_int_is_neg(tab->mat->row[i][1]), abort()); } } /* Return the sign of the maximal value of "var". * If the sign is not negative, then on return from this function, * the sample value will also be non-negative. * * If "var" is manifestly unbounded wrt positive values, we are done. * Otherwise, we pivot the variable up to a row if needed * Then we continue pivoting down until either * - no more down pivots can be performed * - the sample value is positive * - the variable is pivoted into a manifestly unbounded column */ static int sign_of_max(struct isl_tab *tab, struct isl_tab_var *var) { int row, col; if (max_is_manifestly_unbounded(tab, var)) return 1; if (to_row(tab, var, 1) < 0) return -2; while (!isl_int_is_pos(tab->mat->row[var->index][1])) { find_pivot(tab, var, var, 1, &row, &col); if (row == -1) return isl_int_sgn(tab->mat->row[var->index][1]); if (isl_tab_pivot(tab, row, col) < 0) return -2; if (!var->is_row) /* manifestly unbounded */ return 1; } return 1; } int isl_tab_sign_of_max(struct isl_tab *tab, int con) { struct isl_tab_var *var; if (!tab) return -2; var = &tab->con[con]; isl_assert(tab->mat->ctx, !var->is_redundant, return -2); isl_assert(tab->mat->ctx, !var->is_zero, return -2); return sign_of_max(tab, var); } static int row_is_neg(struct isl_tab *tab, int row) { if (!tab->M) return isl_int_is_neg(tab->mat->row[row][1]); if (isl_int_is_pos(tab->mat->row[row][2])) return 0; if (isl_int_is_neg(tab->mat->row[row][2])) return 1; return isl_int_is_neg(tab->mat->row[row][1]); } static int row_sgn(struct isl_tab *tab, int row) { if (!tab->M) return isl_int_sgn(tab->mat->row[row][1]); if (!isl_int_is_zero(tab->mat->row[row][2])) return isl_int_sgn(tab->mat->row[row][2]); else return isl_int_sgn(tab->mat->row[row][1]); } /* Perform pivots until the row variable "var" has a non-negative * sample value or until no more upward pivots can be performed. * Return the sign of the sample value after the pivots have been * performed. */ static int restore_row(struct isl_tab *tab, struct isl_tab_var *var) { int row, col; while (row_is_neg(tab, var->index)) { find_pivot(tab, var, var, 1, &row, &col); if (row == -1) break; if (isl_tab_pivot(tab, row, col) < 0) return -2; if (!var->is_row) /* manifestly unbounded */ return 1; } return row_sgn(tab, var->index); } /* Perform pivots until we are sure that the row variable "var" * can attain non-negative values. After return from this * function, "var" is still a row variable, but its sample * value may not be non-negative, even if the function returns 1. */ static int at_least_zero(struct isl_tab *tab, struct isl_tab_var *var) { int row, col; while (isl_int_is_neg(tab->mat->row[var->index][1])) { find_pivot(tab, var, var, 1, &row, &col); if (row == -1) break; if (row == var->index) /* manifestly unbounded */ return 1; if (isl_tab_pivot(tab, row, col) < 0) return -1; } return !isl_int_is_neg(tab->mat->row[var->index][1]); } /* Return a negative value if "var" can attain negative values. * Return a non-negative value otherwise. * * If "var" is manifestly unbounded wrt negative values, we are done. * Otherwise, if var is in a column, we can pivot it down to a row. * Then we continue pivoting down until either * - the pivot would result in a manifestly unbounded column * => we don't perform the pivot, but simply return -1 * - no more down pivots can be performed * - the sample value is negative * If the sample value becomes negative and the variable is supposed * to be nonnegative, then we undo the last pivot. * However, if the last pivot has made the pivoting variable * obviously redundant, then it may have moved to another row. * In that case we look for upward pivots until we reach a non-negative * value again. */ static int sign_of_min(struct isl_tab *tab, struct isl_tab_var *var) { int row, col; struct isl_tab_var *pivot_var = NULL; if (min_is_manifestly_unbounded(tab, var)) return -1; if (!var->is_row) { col = var->index; row = pivot_row(tab, NULL, -1, col); pivot_var = var_from_col(tab, col); if (isl_tab_pivot(tab, row, col) < 0) return -2; if (var->is_redundant) return 0; if (isl_int_is_neg(tab->mat->row[var->index][1])) { if (var->is_nonneg) { if (!pivot_var->is_redundant && pivot_var->index == row) { if (isl_tab_pivot(tab, row, col) < 0) return -2; } else if (restore_row(tab, var) < -1) return -2; } return -1; } } if (var->is_redundant) return 0; while (!isl_int_is_neg(tab->mat->row[var->index][1])) { find_pivot(tab, var, var, -1, &row, &col); if (row == var->index) return -1; if (row == -1) return isl_int_sgn(tab->mat->row[var->index][1]); pivot_var = var_from_col(tab, col); if (isl_tab_pivot(tab, row, col) < 0) return -2; if (var->is_redundant) return 0; } if (pivot_var && var->is_nonneg) { /* pivot back to non-negative value */ if (!pivot_var->is_redundant && pivot_var->index == row) { if (isl_tab_pivot(tab, row, col) < 0) return -2; } else if (restore_row(tab, var) < -1) return -2; } return -1; } static int row_at_most_neg_one(struct isl_tab *tab, int row) { if (tab->M) { if (isl_int_is_pos(tab->mat->row[row][2])) return 0; if (isl_int_is_neg(tab->mat->row[row][2])) return 1; } return isl_int_is_neg(tab->mat->row[row][1]) && isl_int_abs_ge(tab->mat->row[row][1], tab->mat->row[row][0]); } /* Return 1 if "var" can attain values <= -1. * Return 0 otherwise. * * The sample value of "var" is assumed to be non-negative when the * the function is called. If 1 is returned then the constraint * is not redundant and the sample value is made non-negative again before * the function returns. */ int isl_tab_min_at_most_neg_one(struct isl_tab *tab, struct isl_tab_var *var) { int row, col; struct isl_tab_var *pivot_var; if (min_is_manifestly_unbounded(tab, var)) return 1; if (!var->is_row) { col = var->index; row = pivot_row(tab, NULL, -1, col); pivot_var = var_from_col(tab, col); if (isl_tab_pivot(tab, row, col) < 0) return -1; if (var->is_redundant) return 0; if (row_at_most_neg_one(tab, var->index)) { if (var->is_nonneg) { if (!pivot_var->is_redundant && pivot_var->index == row) { if (isl_tab_pivot(tab, row, col) < 0) return -1; } else if (restore_row(tab, var) < -1) return -1; } return 1; } } if (var->is_redundant) return 0; do { find_pivot(tab, var, var, -1, &row, &col); if (row == var->index) { if (restore_row(tab, var) < -1) return -1; return 1; } if (row == -1) return 0; pivot_var = var_from_col(tab, col); if (isl_tab_pivot(tab, row, col) < 0) return -1; if (var->is_redundant) return 0; } while (!row_at_most_neg_one(tab, var->index)); if (var->is_nonneg) { /* pivot back to non-negative value */ if (!pivot_var->is_redundant && pivot_var->index == row) if (isl_tab_pivot(tab, row, col) < 0) return -1; if (restore_row(tab, var) < -1) return -1; } return 1; } /* Return 1 if "var" can attain values >= 1. * Return 0 otherwise. */ static int at_least_one(struct isl_tab *tab, struct isl_tab_var *var) { int row, col; isl_int *r; if (max_is_manifestly_unbounded(tab, var)) return 1; if (to_row(tab, var, 1) < 0) return -1; r = tab->mat->row[var->index]; while (isl_int_lt(r[1], r[0])) { find_pivot(tab, var, var, 1, &row, &col); if (row == -1) return isl_int_ge(r[1], r[0]); if (row == var->index) /* manifestly unbounded */ return 1; if (isl_tab_pivot(tab, row, col) < 0) return -1; } return 1; } static void swap_cols(struct isl_tab *tab, int col1, int col2) { int t; unsigned off = 2 + tab->M; t = tab->col_var[col1]; tab->col_var[col1] = tab->col_var[col2]; tab->col_var[col2] = t; var_from_col(tab, col1)->index = col1; var_from_col(tab, col2)->index = col2; tab->mat = isl_mat_swap_cols(tab->mat, off + col1, off + col2); } /* Mark column with index "col" as representing a zero variable. * If we may need to undo the operation the column is kept, * but no longer considered. * Otherwise, the column is simply removed. * * The column may be interchanged with some other column. If it * is interchanged with a later column, return 1. Otherwise return 0. * If the columns are checked in order in the calling function, * then a return value of 1 means that the column with the given * column number may now contain a different column that * hasn't been checked yet. */ int isl_tab_kill_col(struct isl_tab *tab, int col) { var_from_col(tab, col)->is_zero = 1; if (tab->need_undo) { if (isl_tab_push_var(tab, isl_tab_undo_zero, var_from_col(tab, col)) < 0) return -1; if (col != tab->n_dead) swap_cols(tab, col, tab->n_dead); tab->n_dead++; return 0; } else { if (col != tab->n_col - 1) swap_cols(tab, col, tab->n_col - 1); var_from_col(tab, tab->n_col - 1)->index = -1; tab->n_col--; return 1; } } static int row_is_manifestly_non_integral(struct isl_tab *tab, int row) { unsigned off = 2 + tab->M; if (tab->M && !isl_int_eq(tab->mat->row[row][2], tab->mat->row[row][0])) return 0; if (isl_seq_first_non_zero(tab->mat->row[row] + off + tab->n_dead, tab->n_col - tab->n_dead) != -1) return 0; return !isl_int_is_divisible_by(tab->mat->row[row][1], tab->mat->row[row][0]); } /* For integer tableaus, check if any of the coordinates are stuck * at a non-integral value. */ static int tab_is_manifestly_empty(struct isl_tab *tab) { int i; if (tab->empty) return 1; if (tab->rational) return 0; for (i = 0; i < tab->n_var; ++i) { if (!tab->var[i].is_row) continue; if (row_is_manifestly_non_integral(tab, tab->var[i].index)) return 1; } return 0; } /* Row variable "var" is non-negative and cannot attain any values * larger than zero. This means that the coefficients of the unrestricted * column variables are zero and that the coefficients of the non-negative * column variables are zero or negative. * Each of the non-negative variables with a negative coefficient can * then also be written as the negative sum of non-negative variables * and must therefore also be zero. */ static int close_row(struct isl_tab *tab, struct isl_tab_var *var) WARN_UNUSED; static int close_row(struct isl_tab *tab, struct isl_tab_var *var) { int j; struct isl_mat *mat = tab->mat; unsigned off = 2 + tab->M; isl_assert(tab->mat->ctx, var->is_nonneg, return -1); var->is_zero = 1; if (tab->need_undo) if (isl_tab_push_var(tab, isl_tab_undo_zero, var) < 0) return -1; for (j = tab->n_dead; j < tab->n_col; ++j) { int recheck; if (isl_int_is_zero(mat->row[var->index][off + j])) continue; isl_assert(tab->mat->ctx, isl_int_is_neg(mat->row[var->index][off + j]), return -1); recheck = isl_tab_kill_col(tab, j); if (recheck < 0) return -1; if (recheck) --j; } if (isl_tab_mark_redundant(tab, var->index) < 0) return -1; if (tab_is_manifestly_empty(tab) && isl_tab_mark_empty(tab) < 0) return -1; return 0; } /* Add a constraint to the tableau and allocate a row for it. * Return the index into the constraint array "con". */ int isl_tab_allocate_con(struct isl_tab *tab) { int r; isl_assert(tab->mat->ctx, tab->n_row < tab->mat->n_row, return -1); isl_assert(tab->mat->ctx, tab->n_con < tab->max_con, return -1); r = tab->n_con; tab->con[r].index = tab->n_row; tab->con[r].is_row = 1; tab->con[r].is_nonneg = 0; tab->con[r].is_zero = 0; tab->con[r].is_redundant = 0; tab->con[r].frozen = 0; tab->con[r].negated = 0; tab->row_var[tab->n_row] = ~r; tab->n_row++; tab->n_con++; if (isl_tab_push_var(tab, isl_tab_undo_allocate, &tab->con[r]) < 0) return -1; return r; } /* Add a variable to the tableau and allocate a column for it. * Return the index into the variable array "var". */ int isl_tab_allocate_var(struct isl_tab *tab) { int r; int i; unsigned off = 2 + tab->M; isl_assert(tab->mat->ctx, tab->n_col < tab->mat->n_col, return -1); isl_assert(tab->mat->ctx, tab->n_var < tab->max_var, return -1); r = tab->n_var; tab->var[r].index = tab->n_col; tab->var[r].is_row = 0; tab->var[r].is_nonneg = 0; tab->var[r].is_zero = 0; tab->var[r].is_redundant = 0; tab->var[r].frozen = 0; tab->var[r].negated = 0; tab->col_var[tab->n_col] = r; for (i = 0; i < tab->n_row; ++i) isl_int_set_si(tab->mat->row[i][off + tab->n_col], 0); tab->n_var++; tab->n_col++; if (isl_tab_push_var(tab, isl_tab_undo_allocate, &tab->var[r]) < 0) return -1; return r; } /* Add a row to the tableau. The row is given as an affine combination * of the original variables and needs to be expressed in terms of the * column variables. * * We add each term in turn. * If r = n/d_r is the current sum and we need to add k x, then * if x is a column variable, we increase the numerator of * this column by k d_r * if x = f/d_x is a row variable, then the new representation of r is * * n k f d_x/g n + d_r/g k f m/d_r n + m/d_g k f * --- + --- = ------------------- = ------------------- * d_r d_r d_r d_x/g m * * with g the gcd of d_r and d_x and m the lcm of d_r and d_x. * * If tab->M is set, then, internally, each variable x is represented * as x' - M. We then also need no subtract k d_r from the coefficient of M. */ int isl_tab_add_row(struct isl_tab *tab, isl_int *line) { int i; int r; isl_int *row; isl_int a, b; unsigned off = 2 + tab->M; r = isl_tab_allocate_con(tab); if (r < 0) return -1; isl_int_init(a); isl_int_init(b); row = tab->mat->row[tab->con[r].index]; isl_int_set_si(row[0], 1); isl_int_set(row[1], line[0]); isl_seq_clr(row + 2, tab->M + tab->n_col); for (i = 0; i < tab->n_var; ++i) { if (tab->var[i].is_zero) continue; if (tab->var[i].is_row) { isl_int_lcm(a, row[0], tab->mat->row[tab->var[i].index][0]); isl_int_swap(a, row[0]); isl_int_divexact(a, row[0], a); isl_int_divexact(b, row[0], tab->mat->row[tab->var[i].index][0]); isl_int_mul(b, b, line[1 + i]); isl_seq_combine(row + 1, a, row + 1, b, tab->mat->row[tab->var[i].index] + 1, 1 + tab->M + tab->n_col); } else isl_int_addmul(row[off + tab->var[i].index], line[1 + i], row[0]); if (tab->M && i >= tab->n_param && i < tab->n_var - tab->n_div) isl_int_submul(row[2], line[1 + i], row[0]); } isl_seq_normalize(tab->mat->ctx, row, off + tab->n_col); isl_int_clear(a); isl_int_clear(b); if (tab->row_sign) tab->row_sign[tab->con[r].index] = isl_tab_row_unknown; return r; } static int drop_row(struct isl_tab *tab, int row) { isl_assert(tab->mat->ctx, ~tab->row_var[row] == tab->n_con - 1, return -1); if (row != tab->n_row - 1) swap_rows(tab, row, tab->n_row - 1); tab->n_row--; tab->n_con--; return 0; } static int drop_col(struct isl_tab *tab, int col) { isl_assert(tab->mat->ctx, tab->col_var[col] == tab->n_var - 1, return -1); if (col != tab->n_col - 1) swap_cols(tab, col, tab->n_col - 1); tab->n_col--; tab->n_var--; return 0; } /* Add inequality "ineq" and check if it conflicts with the * previously added constraints or if it is obviously redundant. */ int isl_tab_add_ineq(struct isl_tab *tab, isl_int *ineq) { int r; int sgn; isl_int cst; if (!tab) return -1; if (tab->bmap) { struct isl_basic_map *bmap = tab->bmap; isl_assert(tab->mat->ctx, tab->n_eq == bmap->n_eq, return -1); isl_assert(tab->mat->ctx, tab->n_con == bmap->n_eq + bmap->n_ineq, return -1); tab->bmap = isl_basic_map_add_ineq(tab->bmap, ineq); if (isl_tab_push(tab, isl_tab_undo_bmap_ineq) < 0) return -1; if (!tab->bmap) return -1; } if (tab->cone) { isl_int_init(cst); isl_int_swap(ineq[0], cst); } r = isl_tab_add_row(tab, ineq); if (tab->cone) { isl_int_swap(ineq[0], cst); isl_int_clear(cst); } if (r < 0) return -1; tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) return -1; if (isl_tab_row_is_redundant(tab, tab->con[r].index)) { if (isl_tab_mark_redundant(tab, tab->con[r].index) < 0) return -1; return 0; } sgn = restore_row(tab, &tab->con[r]); if (sgn < -1) return -1; if (sgn < 0) return isl_tab_mark_empty(tab); if (tab->con[r].is_row && isl_tab_row_is_redundant(tab, tab->con[r].index)) if (isl_tab_mark_redundant(tab, tab->con[r].index) < 0) return -1; return 0; } /* Pivot a non-negative variable down until it reaches the value zero * and then pivot the variable into a column position. */ static int to_col(struct isl_tab *tab, struct isl_tab_var *var) WARN_UNUSED; static int to_col(struct isl_tab *tab, struct isl_tab_var *var) { int i; int row, col; unsigned off = 2 + tab->M; if (!var->is_row) return 0; while (isl_int_is_pos(tab->mat->row[var->index][1])) { find_pivot(tab, var, NULL, -1, &row, &col); isl_assert(tab->mat->ctx, row != -1, return -1); if (isl_tab_pivot(tab, row, col) < 0) return -1; if (!var->is_row) return 0; } for (i = tab->n_dead; i < tab->n_col; ++i) if (!isl_int_is_zero(tab->mat->row[var->index][off + i])) break; isl_assert(tab->mat->ctx, i < tab->n_col, return -1); if (isl_tab_pivot(tab, var->index, i) < 0) return -1; return 0; } /* We assume Gaussian elimination has been performed on the equalities. * The equalities can therefore never conflict. * Adding the equalities is currently only really useful for a later call * to isl_tab_ineq_type. */ static struct isl_tab *add_eq(struct isl_tab *tab, isl_int *eq) { int i; int r; if (!tab) return NULL; r = isl_tab_add_row(tab, eq); if (r < 0) goto error; r = tab->con[r].index; i = isl_seq_first_non_zero(tab->mat->row[r] + 2 + tab->M + tab->n_dead, tab->n_col - tab->n_dead); isl_assert(tab->mat->ctx, i >= 0, goto error); i += tab->n_dead; if (isl_tab_pivot(tab, r, i) < 0) goto error; if (isl_tab_kill_col(tab, i) < 0) goto error; tab->n_eq++; return tab; error: isl_tab_free(tab); return NULL; } static int row_is_manifestly_zero(struct isl_tab *tab, int row) { unsigned off = 2 + tab->M; if (!isl_int_is_zero(tab->mat->row[row][1])) return 0; if (tab->M && !isl_int_is_zero(tab->mat->row[row][2])) return 0; return isl_seq_first_non_zero(tab->mat->row[row] + off + tab->n_dead, tab->n_col - tab->n_dead) == -1; } /* Add an equality that is known to be valid for the given tableau. */ int isl_tab_add_valid_eq(struct isl_tab *tab, isl_int *eq) { struct isl_tab_var *var; int r; if (!tab) return -1; r = isl_tab_add_row(tab, eq); if (r < 0) return -1; var = &tab->con[r]; r = var->index; if (row_is_manifestly_zero(tab, r)) { var->is_zero = 1; if (isl_tab_mark_redundant(tab, r) < 0) return -1; return 0; } if (isl_int_is_neg(tab->mat->row[r][1])) { isl_seq_neg(tab->mat->row[r] + 1, tab->mat->row[r] + 1, 1 + tab->n_col); var->negated = 1; } var->is_nonneg = 1; if (to_col(tab, var) < 0) return -1; var->is_nonneg = 0; if (isl_tab_kill_col(tab, var->index) < 0) return -1; return 0; } static int add_zero_row(struct isl_tab *tab) { int r; isl_int *row; r = isl_tab_allocate_con(tab); if (r < 0) return -1; row = tab->mat->row[tab->con[r].index]; isl_seq_clr(row + 1, 1 + tab->M + tab->n_col); isl_int_set_si(row[0], 1); return r; } /* Add equality "eq" and check if it conflicts with the * previously added constraints or if it is obviously redundant. */ int isl_tab_add_eq(struct isl_tab *tab, isl_int *eq) { struct isl_tab_undo *snap = NULL; struct isl_tab_var *var; int r; int row; int sgn; isl_int cst; if (!tab) return -1; isl_assert(tab->mat->ctx, !tab->M, return -1); if (tab->need_undo) snap = isl_tab_snap(tab); if (tab->cone) { isl_int_init(cst); isl_int_swap(eq[0], cst); } r = isl_tab_add_row(tab, eq); if (tab->cone) { isl_int_swap(eq[0], cst); isl_int_clear(cst); } if (r < 0) return -1; var = &tab->con[r]; row = var->index; if (row_is_manifestly_zero(tab, row)) { if (snap) { if (isl_tab_rollback(tab, snap) < 0) return -1; } else drop_row(tab, row); return 0; } if (tab->bmap) { tab->bmap = isl_basic_map_add_ineq(tab->bmap, eq); if (isl_tab_push(tab, isl_tab_undo_bmap_ineq) < 0) return -1; isl_seq_neg(eq, eq, 1 + tab->n_var); tab->bmap = isl_basic_map_add_ineq(tab->bmap, eq); isl_seq_neg(eq, eq, 1 + tab->n_var); if (isl_tab_push(tab, isl_tab_undo_bmap_ineq) < 0) return -1; if (!tab->bmap) return -1; if (add_zero_row(tab) < 0) return -1; } sgn = isl_int_sgn(tab->mat->row[row][1]); if (sgn > 0) { isl_seq_neg(tab->mat->row[row] + 1, tab->mat->row[row] + 1, 1 + tab->n_col); var->negated = 1; sgn = -1; } if (sgn < 0) { sgn = sign_of_max(tab, var); if (sgn < -1) return -1; if (sgn < 0) { if (isl_tab_mark_empty(tab) < 0) return -1; return 0; } } var->is_nonneg = 1; if (to_col(tab, var) < 0) return -1; var->is_nonneg = 0; if (isl_tab_kill_col(tab, var->index) < 0) return -1; return 0; } /* Construct and return an inequality that expresses an upper bound * on the given div. * In particular, if the div is given by * * d = floor(e/m) * * then the inequality expresses * * m d <= e */ static struct isl_vec *ineq_for_div(struct isl_basic_map *bmap, unsigned div) { unsigned total; unsigned div_pos; struct isl_vec *ineq; if (!bmap) return NULL; total = isl_basic_map_total_dim(bmap); div_pos = 1 + total - bmap->n_div + div; ineq = isl_vec_alloc(bmap->ctx, 1 + total); if (!ineq) return NULL; isl_seq_cpy(ineq->el, bmap->div[div] + 1, 1 + total); isl_int_neg(ineq->el[div_pos], bmap->div[div][0]); return ineq; } /* For a div d = floor(f/m), add the constraints * * f - m d >= 0 * -(f-(m-1)) + m d >= 0 * * Note that the second constraint is the negation of * * f - m d >= m * * If add_ineq is not NULL, then this function is used * instead of isl_tab_add_ineq to effectively add the inequalities. */ static int add_div_constraints(struct isl_tab *tab, unsigned div, int (*add_ineq)(void *user, isl_int *), void *user) { unsigned total; unsigned div_pos; struct isl_vec *ineq; total = isl_basic_map_total_dim(tab->bmap); div_pos = 1 + total - tab->bmap->n_div + div; ineq = ineq_for_div(tab->bmap, div); if (!ineq) goto error; if (add_ineq) { if (add_ineq(user, ineq->el) < 0) goto error; } else { if (isl_tab_add_ineq(tab, ineq->el) < 0) goto error; } isl_seq_neg(ineq->el, tab->bmap->div[div] + 1, 1 + total); isl_int_set(ineq->el[div_pos], tab->bmap->div[div][0]); isl_int_add(ineq->el[0], ineq->el[0], ineq->el[div_pos]); isl_int_sub_ui(ineq->el[0], ineq->el[0], 1); if (add_ineq) { if (add_ineq(user, ineq->el) < 0) goto error; } else { if (isl_tab_add_ineq(tab, ineq->el) < 0) goto error; } isl_vec_free(ineq); return 0; error: isl_vec_free(ineq); return -1; } /* Check whether the div described by "div" is obviously non-negative. * If we are using a big parameter, then we will encode the div * as div' = M + div, which is always non-negative. * Otherwise, we check whether div is a non-negative affine combination * of non-negative variables. */ static int div_is_nonneg(struct isl_tab *tab, __isl_keep isl_vec *div) { int i; if (tab->M) return 1; if (isl_int_is_neg(div->el[1])) return 0; for (i = 0; i < tab->n_var; ++i) { if (isl_int_is_neg(div->el[2 + i])) return 0; if (isl_int_is_zero(div->el[2 + i])) continue; if (!tab->var[i].is_nonneg) return 0; } return 1; } /* Add an extra div, prescribed by "div" to the tableau and * the associated bmap (which is assumed to be non-NULL). * * If add_ineq is not NULL, then this function is used instead * of isl_tab_add_ineq to add the div constraints. * This complication is needed because the code in isl_tab_pip * wants to perform some extra processing when an inequality * is added to the tableau. */ int isl_tab_add_div(struct isl_tab *tab, __isl_keep isl_vec *div, int (*add_ineq)(void *user, isl_int *), void *user) { int r; int k; int nonneg; if (!tab || !div) return -1; isl_assert(tab->mat->ctx, tab->bmap, return -1); nonneg = div_is_nonneg(tab, div); if (isl_tab_extend_cons(tab, 3) < 0) return -1; if (isl_tab_extend_vars(tab, 1) < 0) return -1; r = isl_tab_allocate_var(tab); if (r < 0) return -1; if (nonneg) tab->var[r].is_nonneg = 1; tab->bmap = isl_basic_map_extend_space(tab->bmap, isl_basic_map_get_space(tab->bmap), 1, 0, 2); k = isl_basic_map_alloc_div(tab->bmap); if (k < 0) return -1; isl_seq_cpy(tab->bmap->div[k], div->el, div->size); if (isl_tab_push(tab, isl_tab_undo_bmap_div) < 0) return -1; if (add_div_constraints(tab, k, add_ineq, user) < 0) return -1; return r; } /* If "track" is set, then we want to keep track of all constraints in tab * in its bmap field. This field is initialized from a copy of "bmap", * so we need to make sure that all constraints in "bmap" also appear * in the constructed tab. */ __isl_give struct isl_tab *isl_tab_from_basic_map( __isl_keep isl_basic_map *bmap, int track) { int i; struct isl_tab *tab; if (!bmap) return NULL; tab = isl_tab_alloc(bmap->ctx, isl_basic_map_total_dim(bmap) + bmap->n_ineq + 1, isl_basic_map_total_dim(bmap), 0); if (!tab) return NULL; tab->preserve = track; tab->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) { if (isl_tab_mark_empty(tab) < 0) goto error; goto done; } for (i = 0; i < bmap->n_eq; ++i) { tab = add_eq(tab, bmap->eq[i]); if (!tab) return tab; } for (i = 0; i < bmap->n_ineq; ++i) { if (isl_tab_add_ineq(tab, bmap->ineq[i]) < 0) goto error; if (tab->empty) goto done; } done: if (track && isl_tab_track_bmap(tab, isl_basic_map_copy(bmap)) < 0) goto error; return tab; error: isl_tab_free(tab); return NULL; } __isl_give struct isl_tab *isl_tab_from_basic_set( __isl_keep isl_basic_set *bset, int track) { return isl_tab_from_basic_map(bset, track); } /* Construct a tableau corresponding to the recession cone of "bset". */ struct isl_tab *isl_tab_from_recession_cone(__isl_keep isl_basic_set *bset, int parametric) { isl_int cst; int i; struct isl_tab *tab; unsigned offset = 0; if (!bset) return NULL; if (parametric) offset = isl_basic_set_dim(bset, isl_dim_param); tab = isl_tab_alloc(bset->ctx, bset->n_eq + bset->n_ineq, isl_basic_set_total_dim(bset) - offset, 0); if (!tab) return NULL; tab->rational = ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL); tab->cone = 1; isl_int_init(cst); for (i = 0; i < bset->n_eq; ++i) { isl_int_swap(bset->eq[i][offset], cst); if (offset > 0) { if (isl_tab_add_eq(tab, bset->eq[i] + offset) < 0) goto error; } else tab = add_eq(tab, bset->eq[i]); isl_int_swap(bset->eq[i][offset], cst); if (!tab) goto done; } for (i = 0; i < bset->n_ineq; ++i) { int r; isl_int_swap(bset->ineq[i][offset], cst); r = isl_tab_add_row(tab, bset->ineq[i] + offset); isl_int_swap(bset->ineq[i][offset], cst); if (r < 0) goto error; tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) goto error; } done: isl_int_clear(cst); return tab; error: isl_int_clear(cst); isl_tab_free(tab); return NULL; } /* Assuming "tab" is the tableau of a cone, check if the cone is * bounded, i.e., if it is empty or only contains the origin. */ int isl_tab_cone_is_bounded(struct isl_tab *tab) { int i; if (!tab) return -1; if (tab->empty) return 1; if (tab->n_dead == tab->n_col) return 1; for (;;) { for (i = tab->n_redundant; i < tab->n_row; ++i) { struct isl_tab_var *var; int sgn; var = isl_tab_var_from_row(tab, i); if (!var->is_nonneg) continue; sgn = sign_of_max(tab, var); if (sgn < -1) return -1; if (sgn != 0) return 0; if (close_row(tab, var) < 0) return -1; break; } if (tab->n_dead == tab->n_col) return 1; if (i == tab->n_row) return 0; } } int isl_tab_sample_is_integer(struct isl_tab *tab) { int i; if (!tab) return -1; for (i = 0; i < tab->n_var; ++i) { int row; if (!tab->var[i].is_row) continue; row = tab->var[i].index; if (!isl_int_is_divisible_by(tab->mat->row[row][1], tab->mat->row[row][0])) return 0; } return 1; } static struct isl_vec *extract_integer_sample(struct isl_tab *tab) { int i; struct isl_vec *vec; vec = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_var); if (!vec) return NULL; isl_int_set_si(vec->block.data[0], 1); for (i = 0; i < tab->n_var; ++i) { if (!tab->var[i].is_row) isl_int_set_si(vec->block.data[1 + i], 0); else { int row = tab->var[i].index; isl_int_divexact(vec->block.data[1 + i], tab->mat->row[row][1], tab->mat->row[row][0]); } } return vec; } struct isl_vec *isl_tab_get_sample_value(struct isl_tab *tab) { int i; struct isl_vec *vec; isl_int m; if (!tab) return NULL; vec = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_var); if (!vec) return NULL; isl_int_init(m); isl_int_set_si(vec->block.data[0], 1); for (i = 0; i < tab->n_var; ++i) { int row; if (!tab->var[i].is_row) { isl_int_set_si(vec->block.data[1 + i], 0); continue; } row = tab->var[i].index; isl_int_gcd(m, vec->block.data[0], tab->mat->row[row][0]); isl_int_divexact(m, tab->mat->row[row][0], m); isl_seq_scale(vec->block.data, vec->block.data, m, 1 + i); isl_int_divexact(m, vec->block.data[0], tab->mat->row[row][0]); isl_int_mul(vec->block.data[1 + i], m, tab->mat->row[row][1]); } vec = isl_vec_normalize(vec); isl_int_clear(m); return vec; } /* Update "bmap" based on the results of the tableau "tab". * In particular, implicit equalities are made explicit, redundant constraints * are removed and if the sample value happens to be integer, it is stored * in "bmap" (unless "bmap" already had an integer sample). * * The tableau is assumed to have been created from "bmap" using * isl_tab_from_basic_map. */ struct isl_basic_map *isl_basic_map_update_from_tab(struct isl_basic_map *bmap, struct isl_tab *tab) { int i; unsigned n_eq; if (!bmap) return NULL; if (!tab) return bmap; n_eq = tab->n_eq; if (tab->empty) bmap = isl_basic_map_set_to_empty(bmap); else for (i = bmap->n_ineq - 1; i >= 0; --i) { if (isl_tab_is_equality(tab, n_eq + i)) isl_basic_map_inequality_to_equality(bmap, i); else if (isl_tab_is_redundant(tab, n_eq + i)) isl_basic_map_drop_inequality(bmap, i); } if (bmap->n_eq != n_eq) isl_basic_map_gauss(bmap, NULL); if (!tab->rational && !bmap->sample && isl_tab_sample_is_integer(tab)) bmap->sample = extract_integer_sample(tab); return bmap; } struct isl_basic_set *isl_basic_set_update_from_tab(struct isl_basic_set *bset, struct isl_tab *tab) { return (struct isl_basic_set *)isl_basic_map_update_from_tab( (struct isl_basic_map *)bset, tab); } /* Given a non-negative variable "var", add a new non-negative variable * that is the opposite of "var", ensuring that var can only attain the * value zero. * If var = n/d is a row variable, then the new variable = -n/d. * If var is a column variables, then the new variable = -var. * If the new variable cannot attain non-negative values, then * the resulting tableau is empty. * Otherwise, we know the value will be zero and we close the row. */ static int cut_to_hyperplane(struct isl_tab *tab, struct isl_tab_var *var) { unsigned r; isl_int *row; int sgn; unsigned off = 2 + tab->M; if (var->is_zero) return 0; isl_assert(tab->mat->ctx, !var->is_redundant, return -1); isl_assert(tab->mat->ctx, var->is_nonneg, return -1); if (isl_tab_extend_cons(tab, 1) < 0) return -1; r = tab->n_con; tab->con[r].index = tab->n_row; tab->con[r].is_row = 1; tab->con[r].is_nonneg = 0; tab->con[r].is_zero = 0; tab->con[r].is_redundant = 0; tab->con[r].frozen = 0; tab->con[r].negated = 0; tab->row_var[tab->n_row] = ~r; row = tab->mat->row[tab->n_row]; if (var->is_row) { isl_int_set(row[0], tab->mat->row[var->index][0]); isl_seq_neg(row + 1, tab->mat->row[var->index] + 1, 1 + tab->n_col); } else { isl_int_set_si(row[0], 1); isl_seq_clr(row + 1, 1 + tab->n_col); isl_int_set_si(row[off + var->index], -1); } tab->n_row++; tab->n_con++; if (isl_tab_push_var(tab, isl_tab_undo_allocate, &tab->con[r]) < 0) return -1; sgn = sign_of_max(tab, &tab->con[r]); if (sgn < -1) return -1; if (sgn < 0) { if (isl_tab_mark_empty(tab) < 0) return -1; return 0; } tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) return -1; /* sgn == 0 */ if (close_row(tab, &tab->con[r]) < 0) return -1; return 0; } /* Given a tableau "tab" and an inequality constraint "con" of the tableau, * relax the inequality by one. That is, the inequality r >= 0 is replaced * by r' = r + 1 >= 0. * If r is a row variable, we simply increase the constant term by one * (taking into account the denominator). * If r is a column variable, then we need to modify each row that * refers to r = r' - 1 by substituting this equality, effectively * subtracting the coefficient of the column from the constant. * We should only do this if the minimum is manifestly unbounded, * however. Otherwise, we may end up with negative sample values * for non-negative variables. * So, if r is a column variable with a minimum that is not * manifestly unbounded, then we need to move it to a row. * However, the sample value of this row may be negative, * even after the relaxation, so we need to restore it. * We therefore prefer to pivot a column up to a row, if possible. */ struct isl_tab *isl_tab_relax(struct isl_tab *tab, int con) { struct isl_tab_var *var; unsigned off = 2 + tab->M; if (!tab) return NULL; var = &tab->con[con]; if (var->is_row && (var->index < 0 || var->index < tab->n_redundant)) isl_die(tab->mat->ctx, isl_error_invalid, "cannot relax redundant constraint", goto error); if (!var->is_row && (var->index < 0 || var->index < tab->n_dead)) isl_die(tab->mat->ctx, isl_error_invalid, "cannot relax dead constraint", goto error); if (!var->is_row && !max_is_manifestly_unbounded(tab, var)) if (to_row(tab, var, 1) < 0) goto error; if (!var->is_row && !min_is_manifestly_unbounded(tab, var)) if (to_row(tab, var, -1) < 0) goto error; if (var->is_row) { isl_int_add(tab->mat->row[var->index][1], tab->mat->row[var->index][1], tab->mat->row[var->index][0]); if (restore_row(tab, var) < 0) goto error; } else { int i; for (i = 0; i < tab->n_row; ++i) { if (isl_int_is_zero(tab->mat->row[i][off + var->index])) continue; isl_int_sub(tab->mat->row[i][1], tab->mat->row[i][1], tab->mat->row[i][off + var->index]); } } if (isl_tab_push_var(tab, isl_tab_undo_relax, var) < 0) goto error; return tab; error: isl_tab_free(tab); return NULL; } /* Remove the sign constraint from constraint "con". * * If the constraint variable was originally marked non-negative, * then we make sure we mark it non-negative again during rollback. */ int isl_tab_unrestrict(struct isl_tab *tab, int con) { struct isl_tab_var *var; if (!tab) return -1; var = &tab->con[con]; if (!var->is_nonneg) return 0; var->is_nonneg = 0; if (isl_tab_push_var(tab, isl_tab_undo_unrestrict, var) < 0) return -1; return 0; } int isl_tab_select_facet(struct isl_tab *tab, int con) { if (!tab) return -1; return cut_to_hyperplane(tab, &tab->con[con]); } static int may_be_equality(struct isl_tab *tab, int row) { return tab->rational ? isl_int_is_zero(tab->mat->row[row][1]) : isl_int_lt(tab->mat->row[row][1], tab->mat->row[row][0]); } /* Check for (near) equalities among the constraints. * A constraint is an equality if it is non-negative and if * its maximal value is either * - zero (in case of rational tableaus), or * - strictly less than 1 (in case of integer tableaus) * * We first mark all non-redundant and non-dead variables that * are not frozen and not obviously not an equality. * Then we iterate over all marked variables if they can attain * any values larger than zero or at least one. * If the maximal value is zero, we mark any column variables * that appear in the row as being zero and mark the row as being redundant. * Otherwise, if the maximal value is strictly less than one (and the * tableau is integer), then we restrict the value to being zero * by adding an opposite non-negative variable. */ int isl_tab_detect_implicit_equalities(struct isl_tab *tab) { int i; unsigned n_marked; if (!tab) return -1; if (tab->empty) return 0; if (tab->n_dead == tab->n_col) return 0; n_marked = 0; for (i = tab->n_redundant; i < tab->n_row; ++i) { struct isl_tab_var *var = isl_tab_var_from_row(tab, i); var->marked = !var->frozen && var->is_nonneg && may_be_equality(tab, i); if (var->marked) n_marked++; } for (i = tab->n_dead; i < tab->n_col; ++i) { struct isl_tab_var *var = var_from_col(tab, i); var->marked = !var->frozen && var->is_nonneg; if (var->marked) n_marked++; } while (n_marked) { struct isl_tab_var *var; int sgn; for (i = tab->n_redundant; i < tab->n_row; ++i) { var = isl_tab_var_from_row(tab, i); if (var->marked) break; } if (i == tab->n_row) { for (i = tab->n_dead; i < tab->n_col; ++i) { var = var_from_col(tab, i); if (var->marked) break; } if (i == tab->n_col) break; } var->marked = 0; n_marked--; sgn = sign_of_max(tab, var); if (sgn < 0) return -1; if (sgn == 0) { if (close_row(tab, var) < 0) return -1; } else if (!tab->rational && !at_least_one(tab, var)) { if (cut_to_hyperplane(tab, var) < 0) return -1; return isl_tab_detect_implicit_equalities(tab); } for (i = tab->n_redundant; i < tab->n_row; ++i) { var = isl_tab_var_from_row(tab, i); if (!var->marked) continue; if (may_be_equality(tab, i)) continue; var->marked = 0; n_marked--; } } return 0; } /* Update the element of row_var or col_var that corresponds to * constraint tab->con[i] to a move from position "old" to position "i". */ static int update_con_after_move(struct isl_tab *tab, int i, int old) { int *p; int index; index = tab->con[i].index; if (index == -1) return 0; p = tab->con[i].is_row ? tab->row_var : tab->col_var; if (p[index] != ~old) isl_die(tab->mat->ctx, isl_error_internal, "broken internal state", return -1); p[index] = ~i; return 0; } /* Rotate the "n" constraints starting at "first" to the right, * putting the last constraint in the position of the first constraint. */ static int rotate_constraints(struct isl_tab *tab, int first, int n) { int i, last; struct isl_tab_var var; if (n <= 1) return 0; last = first + n - 1; var = tab->con[last]; for (i = last; i > first; --i) { tab->con[i] = tab->con[i - 1]; if (update_con_after_move(tab, i, i - 1) < 0) return -1; } tab->con[first] = var; if (update_con_after_move(tab, first, last) < 0) return -1; return 0; } /* Make the equalities that are implicit in "bmap" but that have been * detected in the corresponding "tab" explicit in "bmap" and update * "tab" to reflect the new order of the constraints. * * In particular, if inequality i is an implicit equality then * isl_basic_map_inequality_to_equality will move the inequality * in front of the other equality and it will move the last inequality * in the position of inequality i. * In the tableau, the inequalities of "bmap" are stored after the equalities * and so the original order * * E E E E E A A A I B B B B L * * is changed into * * I E E E E E A A A L B B B B * * where I is the implicit equality, the E are equalities, * the A inequalities before I, the B inequalities after I and * L the last inequality. * We therefore need to rotate to the right two sets of constraints, * those up to and including I and those after I. * * If "tab" contains any constraints that are not in "bmap" then they * appear after those in "bmap" and they should be left untouched. * * Note that this function leaves "bmap" in a temporary state * as it does not call isl_basic_map_gauss. Calling this function * is the responsibility of the caller. */ __isl_give isl_basic_map *isl_tab_make_equalities_explicit(struct isl_tab *tab, __isl_take isl_basic_map *bmap) { int i; if (!tab || !bmap) return isl_basic_map_free(bmap); if (tab->empty) return bmap; for (i = bmap->n_ineq - 1; i >= 0; --i) { if (!isl_tab_is_equality(tab, bmap->n_eq + i)) continue; isl_basic_map_inequality_to_equality(bmap, i); if (rotate_constraints(tab, 0, tab->n_eq + i + 1) < 0) return isl_basic_map_free(bmap); if (rotate_constraints(tab, tab->n_eq + i + 1, bmap->n_ineq - i) < 0) return isl_basic_map_free(bmap); tab->n_eq++; } return bmap; } static int con_is_redundant(struct isl_tab *tab, struct isl_tab_var *var) { if (!tab) return -1; if (tab->rational) { int sgn = sign_of_min(tab, var); if (sgn < -1) return -1; return sgn >= 0; } else { int irred = isl_tab_min_at_most_neg_one(tab, var); if (irred < 0) return -1; return !irred; } } /* Check for (near) redundant constraints. * A constraint is redundant if it is non-negative and if * its minimal value (temporarily ignoring the non-negativity) is either * - zero (in case of rational tableaus), or * - strictly larger than -1 (in case of integer tableaus) * * We first mark all non-redundant and non-dead variables that * are not frozen and not obviously negatively unbounded. * Then we iterate over all marked variables if they can attain * any values smaller than zero or at most negative one. * If not, we mark the row as being redundant (assuming it hasn't * been detected as being obviously redundant in the mean time). */ int isl_tab_detect_redundant(struct isl_tab *tab) { int i; unsigned n_marked; if (!tab) return -1; if (tab->empty) return 0; if (tab->n_redundant == tab->n_row) return 0; n_marked = 0; for (i = tab->n_redundant; i < tab->n_row; ++i) { struct isl_tab_var *var = isl_tab_var_from_row(tab, i); var->marked = !var->frozen && var->is_nonneg; if (var->marked) n_marked++; } for (i = tab->n_dead; i < tab->n_col; ++i) { struct isl_tab_var *var = var_from_col(tab, i); var->marked = !var->frozen && var->is_nonneg && !min_is_manifestly_unbounded(tab, var); if (var->marked) n_marked++; } while (n_marked) { struct isl_tab_var *var; int red; for (i = tab->n_redundant; i < tab->n_row; ++i) { var = isl_tab_var_from_row(tab, i); if (var->marked) break; } if (i == tab->n_row) { for (i = tab->n_dead; i < tab->n_col; ++i) { var = var_from_col(tab, i); if (var->marked) break; } if (i == tab->n_col) break; } var->marked = 0; n_marked--; red = con_is_redundant(tab, var); if (red < 0) return -1; if (red && !var->is_redundant) if (isl_tab_mark_redundant(tab, var->index) < 0) return -1; for (i = tab->n_dead; i < tab->n_col; ++i) { var = var_from_col(tab, i); if (!var->marked) continue; if (!min_is_manifestly_unbounded(tab, var)) continue; var->marked = 0; n_marked--; } } return 0; } int isl_tab_is_equality(struct isl_tab *tab, int con) { int row; unsigned off; if (!tab) return -1; if (tab->con[con].is_zero) return 1; if (tab->con[con].is_redundant) return 0; if (!tab->con[con].is_row) return tab->con[con].index < tab->n_dead; row = tab->con[con].index; off = 2 + tab->M; return isl_int_is_zero(tab->mat->row[row][1]) && (!tab->M || isl_int_is_zero(tab->mat->row[row][2])) && isl_seq_first_non_zero(tab->mat->row[row] + off + tab->n_dead, tab->n_col - tab->n_dead) == -1; } /* Return the minimal value of the affine expression "f" with denominator * "denom" in *opt, *opt_denom, assuming the tableau is not empty and * the expression cannot attain arbitrarily small values. * If opt_denom is NULL, then *opt is rounded up to the nearest integer. * The return value reflects the nature of the result (empty, unbounded, * minimal value returned in *opt). */ enum isl_lp_result isl_tab_min(struct isl_tab *tab, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, unsigned flags) { int r; enum isl_lp_result res = isl_lp_ok; struct isl_tab_var *var; struct isl_tab_undo *snap; if (!tab) return isl_lp_error; if (tab->empty) return isl_lp_empty; snap = isl_tab_snap(tab); r = isl_tab_add_row(tab, f); if (r < 0) return isl_lp_error; var = &tab->con[r]; for (;;) { int row, col; find_pivot(tab, var, var, -1, &row, &col); if (row == var->index) { res = isl_lp_unbounded; break; } if (row == -1) break; if (isl_tab_pivot(tab, row, col) < 0) return isl_lp_error; } isl_int_mul(tab->mat->row[var->index][0], tab->mat->row[var->index][0], denom); if (ISL_FL_ISSET(flags, ISL_TAB_SAVE_DUAL)) { int i; isl_vec_free(tab->dual); tab->dual = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_con); if (!tab->dual) return isl_lp_error; isl_int_set(tab->dual->el[0], tab->mat->row[var->index][0]); for (i = 0; i < tab->n_con; ++i) { int pos; if (tab->con[i].is_row) { isl_int_set_si(tab->dual->el[1 + i], 0); continue; } pos = 2 + tab->M + tab->con[i].index; if (tab->con[i].negated) isl_int_neg(tab->dual->el[1 + i], tab->mat->row[var->index][pos]); else isl_int_set(tab->dual->el[1 + i], tab->mat->row[var->index][pos]); } } if (opt && res == isl_lp_ok) { if (opt_denom) { isl_int_set(*opt, tab->mat->row[var->index][1]); isl_int_set(*opt_denom, tab->mat->row[var->index][0]); } else isl_int_cdiv_q(*opt, tab->mat->row[var->index][1], tab->mat->row[var->index][0]); } if (isl_tab_rollback(tab, snap) < 0) return isl_lp_error; return res; } int isl_tab_is_redundant(struct isl_tab *tab, int con) { if (!tab) return -1; if (tab->con[con].is_zero) return 0; if (tab->con[con].is_redundant) return 1; return tab->con[con].is_row && tab->con[con].index < tab->n_redundant; } /* Take a snapshot of the tableau that can be restored by s call to * isl_tab_rollback. */ struct isl_tab_undo *isl_tab_snap(struct isl_tab *tab) { if (!tab) return NULL; tab->need_undo = 1; return tab->top; } /* Undo the operation performed by isl_tab_relax. */ static int unrelax(struct isl_tab *tab, struct isl_tab_var *var) WARN_UNUSED; static int unrelax(struct isl_tab *tab, struct isl_tab_var *var) { unsigned off = 2 + tab->M; if (!var->is_row && !max_is_manifestly_unbounded(tab, var)) if (to_row(tab, var, 1) < 0) return -1; if (var->is_row) { isl_int_sub(tab->mat->row[var->index][1], tab->mat->row[var->index][1], tab->mat->row[var->index][0]); if (var->is_nonneg) { int sgn = restore_row(tab, var); isl_assert(tab->mat->ctx, sgn >= 0, return -1); } } else { int i; for (i = 0; i < tab->n_row; ++i) { if (isl_int_is_zero(tab->mat->row[i][off + var->index])) continue; isl_int_add(tab->mat->row[i][1], tab->mat->row[i][1], tab->mat->row[i][off + var->index]); } } return 0; } /* Undo the operation performed by isl_tab_unrestrict. * * In particular, mark the variable as being non-negative and make * sure the sample value respects this constraint. */ static int ununrestrict(struct isl_tab *tab, struct isl_tab_var *var) { var->is_nonneg = 1; if (var->is_row && restore_row(tab, var) < -1) return -1; return 0; } static int perform_undo_var(struct isl_tab *tab, struct isl_tab_undo *undo) WARN_UNUSED; static int perform_undo_var(struct isl_tab *tab, struct isl_tab_undo *undo) { struct isl_tab_var *var = var_from_index(tab, undo->u.var_index); switch (undo->type) { case isl_tab_undo_nonneg: var->is_nonneg = 0; break; case isl_tab_undo_redundant: var->is_redundant = 0; tab->n_redundant--; restore_row(tab, isl_tab_var_from_row(tab, tab->n_redundant)); break; case isl_tab_undo_freeze: var->frozen = 0; break; case isl_tab_undo_zero: var->is_zero = 0; if (!var->is_row) tab->n_dead--; break; case isl_tab_undo_allocate: if (undo->u.var_index >= 0) { isl_assert(tab->mat->ctx, !var->is_row, return -1); drop_col(tab, var->index); break; } if (!var->is_row) { if (!max_is_manifestly_unbounded(tab, var)) { if (to_row(tab, var, 1) < 0) return -1; } else if (!min_is_manifestly_unbounded(tab, var)) { if (to_row(tab, var, -1) < 0) return -1; } else if (to_row(tab, var, 0) < 0) return -1; } drop_row(tab, var->index); break; case isl_tab_undo_relax: return unrelax(tab, var); case isl_tab_undo_unrestrict: return ununrestrict(tab, var); default: isl_die(tab->mat->ctx, isl_error_internal, "perform_undo_var called on invalid undo record", return -1); } return 0; } /* Restore the tableau to the state where the basic variables * are those in "col_var". * We first construct a list of variables that are currently in * the basis, but shouldn't. Then we iterate over all variables * that should be in the basis and for each one that is currently * not in the basis, we exchange it with one of the elements of the * list constructed before. * We can always find an appropriate variable to pivot with because * the current basis is mapped to the old basis by a non-singular * matrix and so we can never end up with a zero row. */ static int restore_basis(struct isl_tab *tab, int *col_var) { int i, j; int n_extra = 0; int *extra = NULL; /* current columns that contain bad stuff */ unsigned off = 2 + tab->M; extra = isl_alloc_array(tab->mat->ctx, int, tab->n_col); if (tab->n_col && !extra) goto error; for (i = 0; i < tab->n_col; ++i) { for (j = 0; j < tab->n_col; ++j) if (tab->col_var[i] == col_var[j]) break; if (j < tab->n_col) continue; extra[n_extra++] = i; } for (i = 0; i < tab->n_col && n_extra > 0; ++i) { struct isl_tab_var *var; int row; for (j = 0; j < tab->n_col; ++j) if (col_var[i] == tab->col_var[j]) break; if (j < tab->n_col) continue; var = var_from_index(tab, col_var[i]); row = var->index; for (j = 0; j < n_extra; ++j) if (!isl_int_is_zero(tab->mat->row[row][off+extra[j]])) break; isl_assert(tab->mat->ctx, j < n_extra, goto error); if (isl_tab_pivot(tab, row, extra[j]) < 0) goto error; extra[j] = extra[--n_extra]; } free(extra); return 0; error: free(extra); return -1; } /* Remove all samples with index n or greater, i.e., those samples * that were added since we saved this number of samples in * isl_tab_save_samples. */ static void drop_samples_since(struct isl_tab *tab, int n) { int i; for (i = tab->n_sample - 1; i >= 0 && tab->n_sample > n; --i) { if (tab->sample_index[i] < n) continue; if (i != tab->n_sample - 1) { int t = tab->sample_index[tab->n_sample-1]; tab->sample_index[tab->n_sample-1] = tab->sample_index[i]; tab->sample_index[i] = t; isl_mat_swap_rows(tab->samples, tab->n_sample-1, i); } tab->n_sample--; } } static int perform_undo(struct isl_tab *tab, struct isl_tab_undo *undo) WARN_UNUSED; static int perform_undo(struct isl_tab *tab, struct isl_tab_undo *undo) { switch (undo->type) { case isl_tab_undo_empty: tab->empty = 0; break; case isl_tab_undo_nonneg: case isl_tab_undo_redundant: case isl_tab_undo_freeze: case isl_tab_undo_zero: case isl_tab_undo_allocate: case isl_tab_undo_relax: case isl_tab_undo_unrestrict: return perform_undo_var(tab, undo); case isl_tab_undo_bmap_eq: return isl_basic_map_free_equality(tab->bmap, 1); case isl_tab_undo_bmap_ineq: return isl_basic_map_free_inequality(tab->bmap, 1); case isl_tab_undo_bmap_div: if (isl_basic_map_free_div(tab->bmap, 1) < 0) return -1; if (tab->samples) tab->samples->n_col--; break; case isl_tab_undo_saved_basis: if (restore_basis(tab, undo->u.col_var) < 0) return -1; break; case isl_tab_undo_drop_sample: tab->n_outside--; break; case isl_tab_undo_saved_samples: drop_samples_since(tab, undo->u.n); break; case isl_tab_undo_callback: return undo->u.callback->run(undo->u.callback); default: isl_assert(tab->mat->ctx, 0, return -1); } return 0; } /* Return the tableau to the state it was in when the snapshot "snap" * was taken. */ int isl_tab_rollback(struct isl_tab *tab, struct isl_tab_undo *snap) { struct isl_tab_undo *undo, *next; if (!tab) return -1; tab->in_undo = 1; for (undo = tab->top; undo && undo != &tab->bottom; undo = next) { next = undo->next; if (undo == snap) break; if (perform_undo(tab, undo) < 0) { tab->top = undo; free_undo(tab); tab->in_undo = 0; return -1; } free_undo_record(undo); } tab->in_undo = 0; tab->top = undo; if (!undo) return -1; return 0; } /* The given row "row" represents an inequality violated by all * points in the tableau. Check for some special cases of such * separating constraints. * In particular, if the row has been reduced to the constant -1, * then we know the inequality is adjacent (but opposite) to * an equality in the tableau. * If the row has been reduced to r = c*(-1 -r'), with r' an inequality * of the tableau and c a positive constant, then the inequality * is adjacent (but opposite) to the inequality r'. */ static enum isl_ineq_type separation_type(struct isl_tab *tab, unsigned row) { int pos; unsigned off = 2 + tab->M; if (tab->rational) return isl_ineq_separate; if (!isl_int_is_one(tab->mat->row[row][0])) return isl_ineq_separate; pos = isl_seq_first_non_zero(tab->mat->row[row] + off + tab->n_dead, tab->n_col - tab->n_dead); if (pos == -1) { if (isl_int_is_negone(tab->mat->row[row][1])) return isl_ineq_adj_eq; else return isl_ineq_separate; } if (!isl_int_eq(tab->mat->row[row][1], tab->mat->row[row][off + tab->n_dead + pos])) return isl_ineq_separate; pos = isl_seq_first_non_zero( tab->mat->row[row] + off + tab->n_dead + pos + 1, tab->n_col - tab->n_dead - pos - 1); return pos == -1 ? isl_ineq_adj_ineq : isl_ineq_separate; } /* Check the effect of inequality "ineq" on the tableau "tab". * The result may be * isl_ineq_redundant: satisfied by all points in the tableau * isl_ineq_separate: satisfied by no point in the tableau * isl_ineq_cut: satisfied by some by not all points * isl_ineq_adj_eq: adjacent to an equality * isl_ineq_adj_ineq: adjacent to an inequality. */ enum isl_ineq_type isl_tab_ineq_type(struct isl_tab *tab, isl_int *ineq) { enum isl_ineq_type type = isl_ineq_error; struct isl_tab_undo *snap = NULL; int con; int row; if (!tab) return isl_ineq_error; if (isl_tab_extend_cons(tab, 1) < 0) return isl_ineq_error; snap = isl_tab_snap(tab); con = isl_tab_add_row(tab, ineq); if (con < 0) goto error; row = tab->con[con].index; if (isl_tab_row_is_redundant(tab, row)) type = isl_ineq_redundant; else if (isl_int_is_neg(tab->mat->row[row][1]) && (tab->rational || isl_int_abs_ge(tab->mat->row[row][1], tab->mat->row[row][0]))) { int nonneg = at_least_zero(tab, &tab->con[con]); if (nonneg < 0) goto error; if (nonneg) type = isl_ineq_cut; else type = separation_type(tab, row); } else { int red = con_is_redundant(tab, &tab->con[con]); if (red < 0) goto error; if (!red) type = isl_ineq_cut; else type = isl_ineq_redundant; } if (isl_tab_rollback(tab, snap)) return isl_ineq_error; return type; error: return isl_ineq_error; } int isl_tab_track_bmap(struct isl_tab *tab, __isl_take isl_basic_map *bmap) { bmap = isl_basic_map_cow(bmap); if (!tab || !bmap) goto error; if (tab->empty) { bmap = isl_basic_map_set_to_empty(bmap); if (!bmap) goto error; tab->bmap = bmap; return 0; } isl_assert(tab->mat->ctx, tab->n_eq == bmap->n_eq, goto error); isl_assert(tab->mat->ctx, tab->n_con == bmap->n_eq + bmap->n_ineq, goto error); tab->bmap = bmap; return 0; error: isl_basic_map_free(bmap); return -1; } int isl_tab_track_bset(struct isl_tab *tab, __isl_take isl_basic_set *bset) { return isl_tab_track_bmap(tab, (isl_basic_map *)bset); } __isl_keep isl_basic_set *isl_tab_peek_bset(struct isl_tab *tab) { if (!tab) return NULL; return (isl_basic_set *)tab->bmap; } static void isl_tab_print_internal(__isl_keep struct isl_tab *tab, FILE *out, int indent) { unsigned r, c; int i; if (!tab) { fprintf(out, "%*snull tab\n", indent, ""); return; } fprintf(out, "%*sn_redundant: %d, n_dead: %d", indent, "", tab->n_redundant, tab->n_dead); if (tab->rational) fprintf(out, ", rational"); if (tab->empty) fprintf(out, ", empty"); fprintf(out, "\n"); fprintf(out, "%*s[", indent, ""); for (i = 0; i < tab->n_var; ++i) { if (i) fprintf(out, (i == tab->n_param || i == tab->n_var - tab->n_div) ? "; " : ", "); fprintf(out, "%c%d%s", tab->var[i].is_row ? 'r' : 'c', tab->var[i].index, tab->var[i].is_zero ? " [=0]" : tab->var[i].is_redundant ? " [R]" : ""); } fprintf(out, "]\n"); fprintf(out, "%*s[", indent, ""); for (i = 0; i < tab->n_con; ++i) { if (i) fprintf(out, ", "); fprintf(out, "%c%d%s", tab->con[i].is_row ? 'r' : 'c', tab->con[i].index, tab->con[i].is_zero ? " [=0]" : tab->con[i].is_redundant ? " [R]" : ""); } fprintf(out, "]\n"); fprintf(out, "%*s[", indent, ""); for (i = 0; i < tab->n_row; ++i) { const char *sign = ""; if (i) fprintf(out, ", "); if (tab->row_sign) { if (tab->row_sign[i] == isl_tab_row_unknown) sign = "?"; else if (tab->row_sign[i] == isl_tab_row_neg) sign = "-"; else if (tab->row_sign[i] == isl_tab_row_pos) sign = "+"; else sign = "+-"; } fprintf(out, "r%d: %d%s%s", i, tab->row_var[i], isl_tab_var_from_row(tab, i)->is_nonneg ? " [>=0]" : "", sign); } fprintf(out, "]\n"); fprintf(out, "%*s[", indent, ""); for (i = 0; i < tab->n_col; ++i) { if (i) fprintf(out, ", "); fprintf(out, "c%d: %d%s", i, tab->col_var[i], var_from_col(tab, i)->is_nonneg ? " [>=0]" : ""); } fprintf(out, "]\n"); r = tab->mat->n_row; tab->mat->n_row = tab->n_row; c = tab->mat->n_col; tab->mat->n_col = 2 + tab->M + tab->n_col; isl_mat_print_internal(tab->mat, out, indent); tab->mat->n_row = r; tab->mat->n_col = c; if (tab->bmap) isl_basic_map_print_internal(tab->bmap, out, indent); } void isl_tab_dump(__isl_keep struct isl_tab *tab) { isl_tab_print_internal(tab, stderr, 0); } cloog-0.18.2/isl/isl_sample_piplib.h0000664000175000017500000000074012254313240014254 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_SAMPLE_PIP_H #define ISL_SAMPLE_PIP #include #if defined(__cplusplus) extern "C" { #endif struct isl_vec *isl_pip_basic_set_sample(struct isl_basic_set *bset); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/isl_vertices.c0000664000175000017500000011040212254313240013250 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #include #include #include #include #include #include #include #define SELECTED 1 #define DESELECTED -1 #define UNSELECTED 0 static __isl_give isl_vertices *compute_chambers(__isl_take isl_basic_set *bset, __isl_take isl_vertices *vertices); __isl_give isl_vertices *isl_vertices_copy(__isl_keep isl_vertices *vertices) { if (!vertices) return NULL; vertices->ref++; return vertices; } void isl_vertices_free(__isl_take isl_vertices *vertices) { int i; if (!vertices) return; if (--vertices->ref > 0) return; for (i = 0; i < vertices->n_vertices; ++i) { isl_basic_set_free(vertices->v[i].vertex); isl_basic_set_free(vertices->v[i].dom); } free(vertices->v); for (i = 0; i < vertices->n_chambers; ++i) { free(vertices->c[i].vertices); isl_basic_set_free(vertices->c[i].dom); } free(vertices->c); isl_basic_set_free(vertices->bset); free(vertices); } struct isl_vertex_list { struct isl_vertex v; struct isl_vertex_list *next; }; static void free_vertex_list(struct isl_vertex_list *list) { struct isl_vertex_list *next; for (; list; list = next) { next = list->next; isl_basic_set_free(list->v.vertex); isl_basic_set_free(list->v.dom); free(list); } } static __isl_give isl_vertices *vertices_from_list(__isl_keep isl_basic_set *bset, int n_vertices, struct isl_vertex_list *list) { int i; struct isl_vertex_list *next; isl_vertices *vertices; vertices = isl_calloc_type(bset->ctx, isl_vertices); if (!vertices) goto error; vertices->ref = 1; vertices->bset = isl_basic_set_copy(bset); vertices->v = isl_alloc_array(bset->ctx, struct isl_vertex, n_vertices); if (n_vertices && !vertices->v) goto error; vertices->n_vertices = n_vertices; for (i = 0; list; list = next, i++) { next = list->next; vertices->v[i] = list->v; free(list); } return vertices; error: isl_vertices_free(vertices); free_vertex_list(list); return NULL; } /* Prepend a vertex to the linked list "list" based on the equalities in "tab". */ static int add_vertex(struct isl_vertex_list **list, __isl_keep isl_basic_set *bset, struct isl_tab *tab) { unsigned nvar; unsigned nparam; struct isl_vertex_list *v = NULL; if (isl_tab_detect_implicit_equalities(tab) < 0) return -1; nvar = isl_basic_set_dim(bset, isl_dim_set); nparam = isl_basic_set_dim(bset, isl_dim_param); v = isl_calloc_type(tab->mat->ctx, struct isl_vertex_list); if (!v) goto error; v->v.vertex = isl_basic_set_copy(bset); v->v.vertex = isl_basic_set_cow(v->v.vertex); v->v.vertex = isl_basic_set_update_from_tab(v->v.vertex, tab); v->v.vertex = isl_basic_set_simplify(v->v.vertex); v->v.vertex = isl_basic_set_finalize(v->v.vertex); if (!v->v.vertex) goto error; isl_assert(bset->ctx, v->v.vertex->n_eq >= nvar, goto error); v->v.dom = isl_basic_set_copy(v->v.vertex); v->v.dom = isl_basic_set_params(v->v.dom); if (!v->v.dom) goto error; v->next = *list; *list = v; return 0; error: free_vertex_list(v); return -1; } /* Compute the parametric vertices and the chamber decomposition * of an empty parametric polytope. */ static __isl_give isl_vertices *vertices_empty(__isl_keep isl_basic_set *bset) { isl_vertices *vertices; unsigned nparam; if (!bset) return NULL; nparam = isl_basic_set_dim(bset, isl_dim_param); vertices = isl_calloc_type(bset->ctx, isl_vertices); if (!vertices) return NULL; vertices->bset = isl_basic_set_copy(bset); vertices->ref = 1; vertices->n_vertices = 0; vertices->n_chambers = 0; return vertices; } /* Compute the parametric vertices and the chamber decomposition * of the parametric polytope defined using the same constraints * as "bset" in the 0D case. * There is exactly one 0D vertex and a single chamber containing * the vertex. */ static __isl_give isl_vertices *vertices_0D(__isl_keep isl_basic_set *bset) { isl_vertices *vertices; unsigned nparam; if (!bset) return NULL; nparam = isl_basic_set_dim(bset, isl_dim_param); vertices = isl_calloc_type(bset->ctx, isl_vertices); if (!vertices) return NULL; vertices->ref = 1; vertices->bset = isl_basic_set_copy(bset); vertices->v = isl_calloc_array(bset->ctx, struct isl_vertex, 1); if (!vertices->v) goto error; vertices->n_vertices = 1; vertices->v[0].vertex = isl_basic_set_copy(bset); vertices->v[0].dom = isl_basic_set_params(isl_basic_set_copy(bset)); if (!vertices->v[0].vertex || !vertices->v[0].dom) goto error; vertices->c = isl_calloc_array(bset->ctx, struct isl_chamber, 1); if (!vertices->c) goto error; vertices->n_chambers = 1; vertices->c[0].n_vertices = 1; vertices->c[0].vertices = isl_calloc_array(bset->ctx, int, 1); if (!vertices->c[0].vertices) goto error; vertices->c[0].dom = isl_basic_set_copy(vertices->v[0].dom); if (!vertices->c[0].dom) goto error; return vertices; error: isl_vertices_free(vertices); return NULL; } static int isl_mat_rank(__isl_keep isl_mat *mat) { int row, col; isl_mat *H; H = isl_mat_left_hermite(isl_mat_copy(mat), 0, NULL, NULL); if (!H) return -1; for (col = 0; col < H->n_col; ++col) { for (row = 0; row < H->n_row; ++row) if (!isl_int_is_zero(H->row[row][col])) break; if (row == H->n_row) break; } isl_mat_free(H); return col; } /* Is the row pointed to by "f" linearly independent of the "n" first * rows in "facets"? */ static int is_independent(__isl_keep isl_mat *facets, int n, isl_int *f) { int rank; if (isl_seq_first_non_zero(f, facets->n_col) < 0) return 0; isl_seq_cpy(facets->row[n], f, facets->n_col); facets->n_row = n + 1; rank = isl_mat_rank(facets); if (rank < 0) return -1; return rank == n + 1; } /* Check whether we can select constraint "level", given the current selection * reflected by facets in "tab", the rows of "facets" and the earlier * "selected" elements of "selection". * * If the constraint is (strictly) redundant in the tableau, selecting it would * result in an empty tableau, so it can't be selected. * If the set variable part of the constraint is not linearly indepedent * of the set variable parts of the already selected constraints, * the constraint cannot be selected. * If selecting the constraint results in an empty tableau, the constraint * cannot be selected. * Finally, if selecting the constraint results in some explicitly * deselected constraints turning into equalities, then the corresponding * vertices have already been generated, so the constraint cannot be selected. */ static int can_select(__isl_keep isl_basic_set *bset, int level, struct isl_tab *tab, __isl_keep isl_mat *facets, int selected, int *selection) { int i; int indep; unsigned ovar; struct isl_tab_undo *snap; if (isl_tab_is_redundant(tab, level)) return 0; ovar = isl_space_offset(bset->dim, isl_dim_set); indep = is_independent(facets, selected, bset->ineq[level] + 1 + ovar); if (indep < 0) return -1; if (!indep) return 0; snap = isl_tab_snap(tab); if (isl_tab_select_facet(tab, level) < 0) return -1; if (tab->empty) { if (isl_tab_rollback(tab, snap) < 0) return -1; return 0; } for (i = 0; i < level; ++i) { int sgn; if (selection[i] != DESELECTED) continue; if (isl_tab_is_equality(tab, i)) sgn = 0; else if (isl_tab_is_redundant(tab, i)) sgn = 1; else sgn = isl_tab_sign_of_max(tab, i); if (sgn < -1) return -1; if (sgn <= 0) { if (isl_tab_rollback(tab, snap) < 0) return -1; return 0; } } return 1; } /* Compute the parametric vertices and the chamber decomposition * of a parametric polytope that is not full-dimensional. * * Simply map the parametric polytope to a lower dimensional space * and map the resulting vertices back. */ static __isl_give isl_vertices *lower_dim_vertices( __isl_keep isl_basic_set *bset) { isl_morph *morph; isl_vertices *vertices; bset = isl_basic_set_copy(bset); morph = isl_basic_set_full_compression(bset); bset = isl_morph_basic_set(isl_morph_copy(morph), bset); vertices = isl_basic_set_compute_vertices(bset); isl_basic_set_free(bset); morph = isl_morph_inverse(morph); vertices = isl_morph_vertices(morph, vertices); return vertices; } /* Compute the parametric vertices and the chamber decomposition * of the parametric polytope defined using the same constraints * as "bset". "bset" is assumed to have no existentially quantified * variables. * * The vertices themselves are computed in a fairly simplistic way. * We simply run through all combinations of d constraints, * with d the number of set variables, and check if those d constraints * define a vertex. To avoid the generation of duplicate vertices, * which we may happen if a vertex is defined by more that d constraints, * we make sure we only generate the vertex for the d constraints with * smallest index. * * We set up a tableau and keep track of which facets have been * selected. The tableau is marked strict_redundant so that we can be * sure that any constraint that is marked redundant (and that is not * also marked zero) is not an equality. * If a constraint is marked DESELECTED, it means the constraint was * SELECTED before (in combination with the same selection of earlier * constraints). If such a deselected constraint turns out to be an * equality, then any vertex that may still be found with the current * selection has already been generated when the constraint was selected. * A constraint is marked UNSELECTED when there is no way selecting * the constraint could lead to a vertex (in combination with the current * selection of earlier constraints). * * The set variable coefficients of the selected constraints are stored * in the facets matrix. */ __isl_give isl_vertices *isl_basic_set_compute_vertices( __isl_keep isl_basic_set *bset) { struct isl_tab *tab; int level; int init; unsigned nvar; int *selection = NULL; int selected; struct isl_tab_undo **snap = NULL; isl_mat *facets = NULL; struct isl_vertex_list *list = NULL; int n_vertices = 0; isl_vertices *vertices; if (!bset) return NULL; if (isl_basic_set_plain_is_empty(bset)) return vertices_empty(bset); if (bset->n_eq != 0) return lower_dim_vertices(bset); isl_assert(bset->ctx, isl_basic_set_dim(bset, isl_dim_div) == 0, return NULL); if (isl_basic_set_dim(bset, isl_dim_set) == 0) return vertices_0D(bset); nvar = isl_basic_set_dim(bset, isl_dim_set); bset = isl_basic_set_copy(bset); bset = isl_basic_set_set_rational(bset); if (!bset) return NULL; tab = isl_tab_from_basic_set(bset, 0); if (!tab) goto error; tab->strict_redundant = 1; if (tab->empty) { vertices = vertices_empty(bset); isl_basic_set_free(bset); isl_tab_free(tab); return vertices; } selection = isl_alloc_array(bset->ctx, int, bset->n_ineq); snap = isl_alloc_array(bset->ctx, struct isl_tab_undo *, bset->n_ineq); facets = isl_mat_alloc(bset->ctx, nvar, nvar); if ((bset->n_ineq && (!selection || !snap)) || !facets) goto error; level = 0; init = 1; selected = 0; while (level >= 0) { if (level >= bset->n_ineq || (!init && selection[level] != SELECTED)) { --level; init = 0; continue; } if (init) { int ok; snap[level] = isl_tab_snap(tab); ok = can_select(bset, level, tab, facets, selected, selection); if (ok < 0) goto error; if (ok) { selection[level] = SELECTED; selected++; } else selection[level] = UNSELECTED; } else { selection[level] = DESELECTED; selected--; if (isl_tab_rollback(tab, snap[level]) < 0) goto error; } if (selected == nvar) { if (tab->n_dead == nvar) { if (add_vertex(&list, bset, tab) < 0) goto error; n_vertices++; } init = 0; continue; } ++level; init = 1; } isl_mat_free(facets); free(selection); free(snap); isl_tab_free(tab); vertices = vertices_from_list(bset, n_vertices, list); vertices = compute_chambers(bset, vertices); return vertices; error: free_vertex_list(list); isl_mat_free(facets); free(selection); free(snap); isl_tab_free(tab); isl_basic_set_free(bset); return NULL; } struct isl_chamber_list { struct isl_chamber c; struct isl_chamber_list *next; }; static void free_chamber_list(struct isl_chamber_list *list) { struct isl_chamber_list *next; for (; list; list = next) { next = list->next; isl_basic_set_free(list->c.dom); free(list->c.vertices); free(list); } } /* Check whether the basic set "bset" is a superset of the basic set described * by "tab", i.e., check whether all constraints of "bset" are redundant. */ static int bset_covers_tab(__isl_keep isl_basic_set *bset, struct isl_tab *tab) { int i; if (!bset || !tab) return -1; for (i = 0; i < bset->n_ineq; ++i) { enum isl_ineq_type type = isl_tab_ineq_type(tab, bset->ineq[i]); switch (type) { case isl_ineq_error: return -1; case isl_ineq_redundant: continue; default: return 0; } } return 1; } static __isl_give isl_vertices *vertices_add_chambers( __isl_take isl_vertices *vertices, int n_chambers, struct isl_chamber_list *list) { int i; isl_ctx *ctx; struct isl_chamber_list *next; ctx = isl_vertices_get_ctx(vertices); vertices->c = isl_alloc_array(ctx, struct isl_chamber, n_chambers); if (!vertices->c) goto error; vertices->n_chambers = n_chambers; for (i = 0; list; list = next, i++) { next = list->next; vertices->c[i] = list->c; free(list); } return vertices; error: isl_vertices_free(vertices); free_chamber_list(list); return NULL; } /* Can "tab" be intersected with "bset" without resulting in * a lower-dimensional set. */ static int can_intersect(struct isl_tab *tab, __isl_keep isl_basic_set *bset) { int i; struct isl_tab_undo *snap; if (isl_tab_extend_cons(tab, bset->n_ineq) < 0) return -1; snap = isl_tab_snap(tab); for (i = 0; i < bset->n_ineq; ++i) { if (isl_tab_ineq_type(tab, bset->ineq[i]) == isl_ineq_redundant) continue; if (isl_tab_add_ineq(tab, bset->ineq[i]) < 0) return -1; } if (isl_tab_detect_implicit_equalities(tab) < 0) return -1; if (tab->n_dead) { if (isl_tab_rollback(tab, snap) < 0) return -1; return 0; } return 1; } static int add_chamber(struct isl_chamber_list **list, __isl_keep isl_vertices *vertices, struct isl_tab *tab, int *selection) { int n_frozen; int i, j; int n_vertices = 0; struct isl_tab_undo *snap; struct isl_chamber_list *c = NULL; for (i = 0; i < vertices->n_vertices; ++i) if (selection[i]) n_vertices++; snap = isl_tab_snap(tab); for (i = 0; i < tab->n_con && tab->con[i].frozen; ++i) tab->con[i].frozen = 0; n_frozen = i; if (isl_tab_detect_redundant(tab) < 0) return -1; c = isl_calloc_type(tab->mat->ctx, struct isl_chamber_list); if (!c) goto error; c->c.vertices = isl_alloc_array(tab->mat->ctx, int, n_vertices); if (n_vertices && !c->c.vertices) goto error; c->c.dom = isl_basic_set_from_basic_map(isl_basic_map_copy(tab->bmap)); c->c.dom = isl_basic_set_set_rational(c->c.dom); c->c.dom = isl_basic_set_cow(c->c.dom); c->c.dom = isl_basic_set_update_from_tab(c->c.dom, tab); c->c.dom = isl_basic_set_simplify(c->c.dom); c->c.dom = isl_basic_set_finalize(c->c.dom); if (!c->c.dom) goto error; c->c.n_vertices = n_vertices; for (i = 0, j = 0; i < vertices->n_vertices; ++i) if (selection[i]) { c->c.vertices[j] = i; j++; } c->next = *list; *list = c; for (i = 0; i < n_frozen; ++i) tab->con[i].frozen = 1; if (isl_tab_rollback(tab, snap) < 0) return -1; return 0; error: free_chamber_list(c); return -1; } struct isl_facet_todo { struct isl_tab *tab; /* A tableau representation of the facet */ isl_basic_set *bset; /* A normalized basic set representation */ isl_vec *constraint; /* Constraint pointing to the other side */ struct isl_facet_todo *next; }; static void free_todo(struct isl_facet_todo *todo) { while (todo) { struct isl_facet_todo *next = todo->next; isl_tab_free(todo->tab); isl_basic_set_free(todo->bset); isl_vec_free(todo->constraint); free(todo); todo = next; } } static struct isl_facet_todo *create_todo(struct isl_tab *tab, int con) { int i; int n_frozen; struct isl_tab_undo *snap; struct isl_facet_todo *todo; snap = isl_tab_snap(tab); for (i = 0; i < tab->n_con && tab->con[i].frozen; ++i) tab->con[i].frozen = 0; n_frozen = i; if (isl_tab_detect_redundant(tab) < 0) return NULL; todo = isl_calloc_type(tab->mat->ctx, struct isl_facet_todo); if (!todo) return NULL; todo->constraint = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_var); if (!todo->constraint) goto error; isl_seq_neg(todo->constraint->el, tab->bmap->ineq[con], 1 + tab->n_var); todo->bset = isl_basic_set_from_basic_map(isl_basic_map_copy(tab->bmap)); todo->bset = isl_basic_set_set_rational(todo->bset); todo->bset = isl_basic_set_cow(todo->bset); todo->bset = isl_basic_set_update_from_tab(todo->bset, tab); todo->bset = isl_basic_set_simplify(todo->bset); todo->bset = isl_basic_set_sort_constraints(todo->bset); if (!todo->bset) goto error; ISL_F_SET(todo->bset, ISL_BASIC_SET_NORMALIZED); todo->tab = isl_tab_dup(tab); if (!todo->tab) goto error; for (i = 0; i < n_frozen; ++i) tab->con[i].frozen = 1; if (isl_tab_rollback(tab, snap) < 0) goto error; return todo; error: free_todo(todo); return NULL; } /* Create todo items for all interior facets of the chamber represented * by "tab" and collect them in "next". */ static int init_todo(struct isl_facet_todo **next, struct isl_tab *tab) { int i; struct isl_tab_undo *snap; struct isl_facet_todo *todo; snap = isl_tab_snap(tab); for (i = 0; i < tab->n_con; ++i) { if (tab->con[i].frozen) continue; if (tab->con[i].is_redundant) continue; if (isl_tab_select_facet(tab, i) < 0) return -1; todo = create_todo(tab, i); if (!todo) return -1; todo->next = *next; *next = todo; if (isl_tab_rollback(tab, snap) < 0) return -1; } return 0; } /* Does the linked list contain a todo item that is the opposite of "todo". * If so, return 1 and remove the opposite todo item. */ static int has_opposite(struct isl_facet_todo *todo, struct isl_facet_todo **list) { for (; *list; list = &(*list)->next) { int eq; eq = isl_basic_set_plain_is_equal(todo->bset, (*list)->bset); if (eq < 0) return -1; if (!eq) continue; todo = *list; *list = todo->next; todo->next = NULL; free_todo(todo); return 1; } return 0; } /* Create todo items for all interior facets of the chamber represented * by "tab" and collect them in first->next, taking care to cancel * opposite todo items. */ static int update_todo(struct isl_facet_todo *first, struct isl_tab *tab) { int i; struct isl_tab_undo *snap; struct isl_facet_todo *todo; snap = isl_tab_snap(tab); for (i = 0; i < tab->n_con; ++i) { int drop; if (tab->con[i].frozen) continue; if (tab->con[i].is_redundant) continue; if (isl_tab_select_facet(tab, i) < 0) return -1; todo = create_todo(tab, i); if (!todo) return -1; drop = has_opposite(todo, &first->next); if (drop < 0) return -1; if (drop) free_todo(todo); else { todo->next = first->next; first->next = todo; } if (isl_tab_rollback(tab, snap) < 0) return -1; } return 0; } /* Compute the chamber decomposition of the parametric polytope respresented * by "bset" given the parametric vertices and their activity domains. * * We are only interested in full-dimensional chambers. * Each of these chambers is the intersection of the activity domains of * one or more vertices and the union of all chambers is equal to the * projection of the entire parametric polytope onto the parameter space. * * We first create an initial chamber by intersecting as many activity * domains as possible without ending up with an empty or lower-dimensional * set. As a minor optimization, we only consider those activity domains * that contain some arbitrary point. * * For each of interior facets of the chamber, we construct a todo item, * containing the facet and a constraint containing the other side of the facet, * for constructing the chamber on the other side. * While their are any todo items left, we pick a todo item and * create the required chamber by intersecting all activity domains * that contain the facet and have a full-dimensional intersection with * the other side of the facet. For each of the interior facets, we * again create todo items, taking care to cancel opposite todo items. */ static __isl_give isl_vertices *compute_chambers(__isl_take isl_basic_set *bset, __isl_take isl_vertices *vertices) { int i; isl_ctx *ctx; isl_vec *sample = NULL; struct isl_tab *tab = NULL; struct isl_tab_undo *snap; int *selection = NULL; int n_chambers = 0; struct isl_chamber_list *list = NULL; struct isl_facet_todo *todo = NULL; if (!bset || !vertices) goto error; ctx = isl_vertices_get_ctx(vertices); selection = isl_alloc_array(ctx, int, vertices->n_vertices); if (vertices->n_vertices && !selection) goto error; bset = isl_basic_set_params(bset); tab = isl_tab_from_basic_set(bset, 1); if (!tab) goto error; for (i = 0; i < bset->n_ineq; ++i) if (isl_tab_freeze_constraint(tab, i) < 0) goto error; isl_basic_set_free(bset); snap = isl_tab_snap(tab); sample = isl_tab_get_sample_value(tab); for (i = 0; i < vertices->n_vertices; ++i) { selection[i] = isl_basic_set_contains(vertices->v[i].dom, sample); if (selection[i] < 0) goto error; if (!selection[i]) continue; selection[i] = can_intersect(tab, vertices->v[i].dom); if (selection[i] < 0) goto error; } if (isl_tab_detect_redundant(tab) < 0) goto error; if (add_chamber(&list, vertices, tab, selection) < 0) goto error; n_chambers++; if (init_todo(&todo, tab) < 0) goto error; while (todo) { struct isl_facet_todo *next; if (isl_tab_rollback(tab, snap) < 0) goto error; if (isl_tab_add_ineq(tab, todo->constraint->el) < 0) goto error; if (isl_tab_freeze_constraint(tab, tab->n_con - 1) < 0) goto error; for (i = 0; i < vertices->n_vertices; ++i) { selection[i] = bset_covers_tab(vertices->v[i].dom, todo->tab); if (selection[i] < 0) goto error; if (!selection[i]) continue; selection[i] = can_intersect(tab, vertices->v[i].dom); if (selection[i] < 0) goto error; } if (isl_tab_detect_redundant(tab) < 0) goto error; if (add_chamber(&list, vertices, tab, selection) < 0) goto error; n_chambers++; if (update_todo(todo, tab) < 0) goto error; next = todo->next; todo->next = NULL; free_todo(todo); todo = next; } isl_vec_free(sample); isl_tab_free(tab); free(selection); vertices = vertices_add_chambers(vertices, n_chambers, list); for (i = 0; vertices && i < vertices->n_vertices; ++i) { isl_basic_set_free(vertices->v[i].dom); vertices->v[i].dom = NULL; } return vertices; error: free_chamber_list(list); free_todo(todo); isl_vec_free(sample); isl_tab_free(tab); free(selection); if (!tab) isl_basic_set_free(bset); isl_vertices_free(vertices); return NULL; } isl_ctx *isl_vertex_get_ctx(__isl_keep isl_vertex *vertex) { return vertex ? isl_vertices_get_ctx(vertex->vertices) : NULL; } int isl_vertex_get_id(__isl_keep isl_vertex *vertex) { return vertex ? vertex->id : -1; } __isl_give isl_basic_set *isl_vertex_get_domain(__isl_keep isl_vertex *vertex) { struct isl_vertex *v; if (!vertex) return NULL; v = &vertex->vertices->v[vertex->id]; if (!v->dom) { v->dom = isl_basic_set_copy(v->vertex); v->dom = isl_basic_set_params(v->dom); } return isl_basic_set_copy(v->dom); } __isl_give isl_basic_set *isl_vertex_get_expr(__isl_keep isl_vertex *vertex) { struct isl_vertex *v; if (!vertex) return NULL; v = &vertex->vertices->v[vertex->id]; return isl_basic_set_copy(v->vertex); } static __isl_give isl_vertex *isl_vertex_alloc(__isl_take isl_vertices *vertices, int id) { isl_ctx *ctx; isl_vertex *vertex; if (!vertices) return NULL; ctx = isl_vertices_get_ctx(vertices); vertex = isl_alloc_type(ctx, isl_vertex); if (!vertex) goto error; vertex->vertices = vertices; vertex->id = id; return vertex; error: isl_vertices_free(vertices); return NULL; } void isl_vertex_free(__isl_take isl_vertex *vertex) { if (!vertex) return; isl_vertices_free(vertex->vertices); free(vertex); } __isl_give isl_basic_set *isl_basic_set_set_integral(__isl_take isl_basic_set *bset) { if (!bset) return NULL; if (!ISL_F_ISSET(bset, ISL_BASIC_MAP_RATIONAL)) return bset; bset = isl_basic_set_cow(bset); if (!bset) return NULL; ISL_F_CLR(bset, ISL_BASIC_MAP_RATIONAL); return isl_basic_set_finalize(bset); } isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell) { return cell ? cell->dom->ctx : NULL; } __isl_give isl_basic_set *isl_cell_get_domain(__isl_keep isl_cell *cell) { return cell ? isl_basic_set_copy(cell->dom) : NULL; } static __isl_give isl_cell *isl_cell_alloc(__isl_take isl_vertices *vertices, __isl_take isl_basic_set *dom, int id) { int i; isl_cell *cell = NULL; if (!vertices || !dom) goto error; cell = isl_calloc_type(dom->ctx, isl_cell); if (!cell) goto error; cell->n_vertices = vertices->c[id].n_vertices; cell->ids = isl_alloc_array(dom->ctx, int, cell->n_vertices); if (cell->n_vertices && !cell->ids) goto error; for (i = 0; i < cell->n_vertices; ++i) cell->ids[i] = vertices->c[id].vertices[i]; cell->vertices = vertices; cell->dom = dom; return cell; error: isl_cell_free(cell); isl_vertices_free(vertices); isl_basic_set_free(dom); return NULL; } void isl_cell_free(__isl_take isl_cell *cell) { if (!cell) return; isl_vertices_free(cell->vertices); free(cell->ids); isl_basic_set_free(cell->dom); free(cell); } /* Create a tableau of the cone obtained by first homogenizing the given * polytope and then making all inequalities strict by setting the * constant term to -1. */ static struct isl_tab *tab_for_shifted_cone(__isl_keep isl_basic_set *bset) { int i; isl_vec *c = NULL; struct isl_tab *tab; if (!bset) return NULL; tab = isl_tab_alloc(bset->ctx, bset->n_ineq + 1, 1 + isl_basic_set_total_dim(bset), 0); if (!tab) return NULL; tab->rational = ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL); if (ISL_F_ISSET(bset, ISL_BASIC_MAP_EMPTY)) { if (isl_tab_mark_empty(tab) < 0) goto error; return tab; } c = isl_vec_alloc(bset->ctx, 1 + 1 + isl_basic_set_total_dim(bset)); if (!c) goto error; isl_int_set_si(c->el[0], 0); for (i = 0; i < bset->n_eq; ++i) { isl_seq_cpy(c->el + 1, bset->eq[i], c->size - 1); if (isl_tab_add_eq(tab, c->el) < 0) goto error; } isl_int_set_si(c->el[0], -1); for (i = 0; i < bset->n_ineq; ++i) { isl_seq_cpy(c->el + 1, bset->ineq[i], c->size - 1); if (isl_tab_add_ineq(tab, c->el) < 0) goto error; if (tab->empty) { isl_vec_free(c); return tab; } } isl_seq_clr(c->el + 1, c->size - 1); isl_int_set_si(c->el[1], 1); if (isl_tab_add_ineq(tab, c->el) < 0) goto error; isl_vec_free(c); return tab; error: isl_vec_free(c); isl_tab_free(tab); return NULL; } /* Compute an interior point of "bset" by selecting an interior * point in homogeneous space and projecting the point back down. */ static __isl_give isl_vec *isl_basic_set_interior_point( __isl_keep isl_basic_set *bset) { isl_vec *vec; struct isl_tab *tab; tab = tab_for_shifted_cone(bset); vec = isl_tab_get_sample_value(tab); isl_tab_free(tab); if (!vec) return NULL; isl_seq_cpy(vec->el, vec->el + 1, vec->size - 1); vec->size--; return vec; } /* Call "fn" on all chambers of the parametric polytope with the shared * facets of neighboring chambers only appearing in one of the chambers. * * We pick an interior point from one of the chambers and then make * all constraints that do not satisfy this point strict. */ int isl_vertices_foreach_disjoint_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user) { int i, j; isl_vec *vec; isl_int v; isl_cell *cell; if (!vertices) return -1; if (vertices->n_chambers == 0) return 0; if (vertices->n_chambers == 1) { isl_basic_set *dom = isl_basic_set_copy(vertices->c[0].dom); dom = isl_basic_set_set_integral(dom); cell = isl_cell_alloc(isl_vertices_copy(vertices), dom, 0); if (!cell) return -1; return fn(cell, user); } vec = isl_basic_set_interior_point(vertices->c[0].dom); if (!vec) return -1; isl_int_init(v); for (i = 0; i < vertices->n_chambers; ++i) { int r; isl_basic_set *dom = isl_basic_set_copy(vertices->c[i].dom); dom = isl_basic_set_cow(dom); if (!dom) goto error; for (j = 0; i && j < dom->n_ineq; ++j) { isl_seq_inner_product(vec->el, dom->ineq[j], vec->size, &v); if (!isl_int_is_neg(v)) continue; isl_int_sub_ui(dom->ineq[j][0], dom->ineq[j][0], 1); } dom = isl_basic_set_set_integral(dom); cell = isl_cell_alloc(isl_vertices_copy(vertices), dom, i); if (!cell) goto error; r = fn(cell, user); if (r < 0) goto error; } isl_int_clear(v); isl_vec_free(vec); return 0; error: isl_int_clear(v); isl_vec_free(vec); return -1; } int isl_vertices_foreach_cell(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_cell *cell, void *user), void *user) { int i; isl_cell *cell; if (!vertices) return -1; if (vertices->n_chambers == 0) return 0; for (i = 0; i < vertices->n_chambers; ++i) { int r; isl_basic_set *dom = isl_basic_set_copy(vertices->c[i].dom); cell = isl_cell_alloc(isl_vertices_copy(vertices), dom, i); if (!cell) return -1; r = fn(cell, user); if (r < 0) return -1; } return 0; } int isl_vertices_foreach_vertex(__isl_keep isl_vertices *vertices, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) { int i; isl_vertex *vertex; if (!vertices) return -1; if (vertices->n_vertices == 0) return 0; for (i = 0; i < vertices->n_vertices; ++i) { int r; vertex = isl_vertex_alloc(isl_vertices_copy(vertices), i); if (!vertex) return -1; r = fn(vertex, user); if (r < 0) return -1; } return 0; } int isl_cell_foreach_vertex(__isl_keep isl_cell *cell, int (*fn)(__isl_take isl_vertex *vertex, void *user), void *user) { int i; isl_vertex *vertex; if (!cell) return -1; if (cell->n_vertices == 0) return 0; for (i = 0; i < cell->n_vertices; ++i) { int r; vertex = isl_vertex_alloc(isl_vertices_copy(cell->vertices), cell->ids[i]); if (!vertex) return -1; r = fn(vertex, user); if (r < 0) return -1; } return 0; } isl_ctx *isl_vertices_get_ctx(__isl_keep isl_vertices *vertices) { return vertices ? vertices->bset->ctx : NULL; } int isl_vertices_get_n_vertices(__isl_keep isl_vertices *vertices) { return vertices ? vertices->n_vertices : -1; } __isl_give isl_vertices *isl_morph_vertices(__isl_take isl_morph *morph, __isl_take isl_vertices *vertices) { int i; isl_morph *param_morph = NULL; if (!morph || !vertices) goto error; isl_assert(vertices->bset->ctx, vertices->ref == 1, goto error); param_morph = isl_morph_copy(morph); param_morph = isl_morph_dom_params(param_morph); param_morph = isl_morph_ran_params(param_morph); for (i = 0; i < vertices->n_vertices; ++i) { vertices->v[i].dom = isl_morph_basic_set( isl_morph_copy(param_morph), vertices->v[i].dom); vertices->v[i].vertex = isl_morph_basic_set( isl_morph_copy(morph), vertices->v[i].vertex); if (!vertices->v[i].vertex) goto error; } for (i = 0; i < vertices->n_chambers; ++i) { vertices->c[i].dom = isl_morph_basic_set( isl_morph_copy(param_morph), vertices->c[i].dom); if (!vertices->c[i].dom) goto error; } isl_morph_free(param_morph); isl_morph_free(morph); return vertices; error: isl_morph_free(param_morph); isl_morph_free(morph); isl_vertices_free(vertices); return NULL; } /* Construct a simplex isl_cell spanned by the vertices with indices in * "simplex_ids" and "other_ids" and call "fn" on this isl_cell. */ static int call_on_simplex(__isl_keep isl_cell *cell, int *simplex_ids, int n_simplex, int *other_ids, int n_other, int (*fn)(__isl_take isl_cell *simplex, void *user), void *user) { int i; isl_ctx *ctx; struct isl_cell *simplex; ctx = isl_cell_get_ctx(cell); simplex = isl_calloc_type(ctx, struct isl_cell); if (!simplex) return -1; simplex->vertices = isl_vertices_copy(cell->vertices); if (!simplex->vertices) goto error; simplex->dom = isl_basic_set_copy(cell->dom); if (!simplex->dom) goto error; simplex->n_vertices = n_simplex + n_other; simplex->ids = isl_alloc_array(ctx, int, simplex->n_vertices); if (!simplex->ids) goto error; for (i = 0; i < n_simplex; ++i) simplex->ids[i] = simplex_ids[i]; for (i = 0; i < n_other; ++i) simplex->ids[n_simplex + i] = other_ids[i]; return fn(simplex, user); error: isl_cell_free(simplex); return -1; } /* Check whether the parametric vertex described by "vertex" * lies on the facet corresponding to constraint "facet" of "bset". * The isl_vec "v" is a temporary vector than can be used by this function. * * We eliminate the variables from the facet constraint using the * equalities defining the vertex and check if the result is identical * to zero. * * It would probably be better to keep track of the constraints defining * a vertex during the vertex construction so that we could simply look * it up here. */ static int vertex_on_facet(__isl_keep isl_basic_set *vertex, __isl_keep isl_basic_set *bset, int facet, __isl_keep isl_vec *v) { int i; isl_int m; isl_seq_cpy(v->el, bset->ineq[facet], v->size); isl_int_init(m); for (i = 0; i < vertex->n_eq; ++i) { int k = isl_seq_last_non_zero(vertex->eq[i], v->size); isl_seq_elim(v->el, vertex->eq[i], k, v->size, &m); } isl_int_clear(m); return isl_seq_first_non_zero(v->el, v->size) == -1; } /* Triangulate the polytope spanned by the vertices with ids * in "simplex_ids" and "other_ids" and call "fn" on each of * the resulting simplices. * If the input polytope is already a simplex, we simply call "fn". * Otherwise, we pick a point from "other_ids" and add it to "simplex_ids". * Then we consider each facet of "bset" that does not contain the point * we just picked, but does contain some of the other points in "other_ids" * and call ourselves recursively on the polytope spanned by the new * "simplex_ids" and those points in "other_ids" that lie on the facet. */ static int triangulate(__isl_keep isl_cell *cell, __isl_keep isl_vec *v, int *simplex_ids, int n_simplex, int *other_ids, int n_other, int (*fn)(__isl_take isl_cell *simplex, void *user), void *user) { int i, j, k; int d, nparam; int *ids; isl_ctx *ctx; isl_basic_set *vertex; isl_basic_set *bset; ctx = isl_cell_get_ctx(cell); d = isl_basic_set_dim(cell->vertices->bset, isl_dim_set); nparam = isl_basic_set_dim(cell->vertices->bset, isl_dim_param); if (n_simplex + n_other == d + 1) return call_on_simplex(cell, simplex_ids, n_simplex, other_ids, n_other, fn, user); simplex_ids[n_simplex] = other_ids[0]; vertex = cell->vertices->v[other_ids[0]].vertex; bset = cell->vertices->bset; ids = isl_alloc_array(ctx, int, n_other - 1); for (i = 0; i < bset->n_ineq; ++i) { if (isl_seq_first_non_zero(bset->ineq[i] + 1 + nparam, d) == -1) continue; if (vertex_on_facet(vertex, bset, i, v)) continue; for (j = 1, k = 0; j < n_other; ++j) { isl_basic_set *ov; ov = cell->vertices->v[other_ids[j]].vertex; if (vertex_on_facet(ov, bset, i, v)) ids[k++] = other_ids[j]; } if (k == 0) continue; if (triangulate(cell, v, simplex_ids, n_simplex + 1, ids, k, fn, user) < 0) goto error; } free(ids); return 0; error: free(ids); return -1; } /* Triangulate the given cell and call "fn" on each of the resulting * simplices. */ int isl_cell_foreach_simplex(__isl_take isl_cell *cell, int (*fn)(__isl_take isl_cell *simplex, void *user), void *user) { int d, total; int r; isl_ctx *ctx; isl_vec *v = NULL; int *simplex_ids = NULL; if (!cell) return -1; d = isl_basic_set_dim(cell->vertices->bset, isl_dim_set); total = isl_basic_set_total_dim(cell->vertices->bset); if (cell->n_vertices == d + 1) return fn(cell, user); ctx = isl_cell_get_ctx(cell); simplex_ids = isl_alloc_array(ctx, int, d + 1); if (!simplex_ids) goto error; v = isl_vec_alloc(ctx, 1 + total); if (!v) goto error; r = triangulate(cell, v, simplex_ids, 0, cell->ids, cell->n_vertices, fn, user); isl_vec_free(v); free(simplex_ids); isl_cell_free(cell); return r; error: free(simplex_ids); isl_vec_free(v); isl_cell_free(cell); return -1; } cloog-0.18.2/isl/isl_map_lexopt_templ.c0000664000175000017500000000777312254313240015015 00000000000000/* * Copyright 2010 INRIA Saclay * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ /* Function for computing the lexicographic optimum of a map * in the form of either an isl_map or an isl_pw_multi_aff. */ #define xSF(TYPE,SUFFIX) TYPE ## SUFFIX #define SF(TYPE,SUFFIX) xSF(TYPE,SUFFIX) /* Given a basic map "bmap", compute the lexicographically minimal * (or maximal) image element for each domain element in dom. * Set *empty to those elements in dom that do not have an image element. * * We first make sure the basic sets in dom are disjoint and then * simply collect the results over each of the basic sets separately. * We could probably improve the efficiency a bit by moving the union * domain down into the parametric integer programming. */ static __isl_give TYPE *SF(basic_map_partial_lexopt,SUFFIX)( __isl_take isl_basic_map *bmap, __isl_take isl_set *dom, __isl_give isl_set **empty, int max) { int i; TYPE *res; dom = isl_set_make_disjoint(dom); if (!dom) goto error; if (isl_set_plain_is_empty(dom)) { isl_space *space = isl_basic_map_get_space(bmap); if (empty) *empty = dom; else isl_set_free(dom); isl_basic_map_free(bmap); return EMPTY(space); } res = SF(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap), isl_basic_set_copy(dom->p[0]), empty, max); for (i = 1; i < dom->n; ++i) { TYPE *res_i; isl_set *empty_i; res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)( isl_basic_map_copy(bmap), isl_basic_set_copy(dom->p[i]), &empty_i, max); res = ADD(res, res_i); *empty = isl_set_union_disjoint(*empty, empty_i); } isl_set_free(dom); isl_basic_map_free(bmap); return res; error: *empty = NULL; isl_set_free(dom); isl_basic_map_free(bmap); return NULL; } static __isl_give TYPE *SF(isl_map_partial_lexopt_aligned,SUFFIX)( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty, int max); /* Given a map "map", compute the lexicographically minimal * (or maximal) image element for each domain element in dom. * Set *empty to those elements in dom that do not have an image element. * * Align parameters if needed and then call isl_map_partial_lexopt_aligned. */ static __isl_give TYPE *SF(isl_map_partial_lexopt,SUFFIX)( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty, int max) { if (!map || !dom) goto error; if (isl_space_match(map->dim, isl_dim_param, dom->dim, isl_dim_param)) return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom, empty, max); if (!isl_space_has_named_params(map->dim) || !isl_space_has_named_params(dom->dim)) isl_die(map->ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); map = isl_map_align_params(map, isl_map_get_space(dom)); dom = isl_map_align_params(dom, isl_map_get_space(map)); return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom, empty, max); error: if (empty) *empty = NULL; isl_set_free(dom); isl_map_free(map); return NULL; } __isl_give TYPE *SF(isl_map_lexopt,SUFFIX)(__isl_take isl_map *map, int max) { isl_set *dom = NULL; isl_space *dom_space; if (!map) goto error; dom_space = isl_space_domain(isl_space_copy(map->dim)); dom = isl_set_universe(dom_space); return SF(isl_map_partial_lexopt,SUFFIX)(map, dom, NULL, max); error: isl_map_free(map); return NULL; } __isl_give TYPE *SF(isl_map_lexmin,SUFFIX)(__isl_take isl_map *map) { return SF(isl_map_lexopt,SUFFIX)(map, 0); } __isl_give TYPE *SF(isl_map_lexmax,SUFFIX)(__isl_take isl_map *map) { return SF(isl_map_lexopt,SUFFIX)(map, 1); } __isl_give TYPE *SF(isl_set_lexmin,SUFFIX)(__isl_take isl_set *set) { return SF(isl_map_lexmin,SUFFIX)(set); } __isl_give TYPE *SF(isl_set_lexmax,SUFFIX)(__isl_take isl_set *set) { return SF(isl_map_lexmax,SUFFIX)(set); } cloog-0.18.2/isl/isl_constraint_private.h0000664000175000017500000000061612254313240015354 00000000000000#ifndef ISL_CONSTRAINT_PRIVATE_H #define ISL_CONSTRAINT_PRIVATE_H #include #include #include struct isl_constraint { int ref; int eq; isl_local_space *ls; isl_vec *v; }; #undef EL #define EL isl_constraint #include struct isl_constraint *isl_basic_set_constraint(struct isl_basic_set *bset, isl_int **line); #endif cloog-0.18.2/isl/isl_fold.c0000664000175000017500000011337412254313240012363 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #define ISL_DIM_H #include #include #include #include #include #include #include #include #include #include enum isl_fold isl_fold_type_negate(enum isl_fold type) { switch (type) { case isl_fold_min: return isl_fold_max; case isl_fold_max: return isl_fold_min; case isl_fold_list: return isl_fold_list; } isl_die(NULL, isl_error_internal, "unhandled isl_fold type", abort()); } static __isl_give isl_qpolynomial_fold *qpolynomial_fold_alloc( enum isl_fold type, __isl_take isl_space *dim, int n) { isl_qpolynomial_fold *fold; if (!dim) goto error; isl_assert(dim->ctx, n >= 0, goto error); fold = isl_calloc(dim->ctx, struct isl_qpolynomial_fold, sizeof(struct isl_qpolynomial_fold) + (n - 1) * sizeof(struct isl_qpolynomial *)); if (!fold) goto error; fold->ref = 1; fold->size = n; fold->n = 0; fold->type = type; fold->dim = dim; return fold; error: isl_space_free(dim); return NULL; } isl_ctx *isl_qpolynomial_fold_get_ctx(__isl_keep isl_qpolynomial_fold *fold) { return fold ? fold->dim->ctx : NULL; } __isl_give isl_space *isl_qpolynomial_fold_get_domain_space( __isl_keep isl_qpolynomial_fold *fold) { return fold ? isl_space_copy(fold->dim) : NULL; } __isl_give isl_space *isl_qpolynomial_fold_get_space( __isl_keep isl_qpolynomial_fold *fold) { isl_space *space; if (!fold) return NULL; space = isl_space_copy(fold->dim); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, 1); return space; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_domain_space( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim) { int i; fold = isl_qpolynomial_fold_cow(fold); if (!fold || !dim) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_reset_domain_space(fold->qp[i], isl_space_copy(dim)); if (!fold->qp[i]) goto error; } isl_space_free(fold->dim); fold->dim = dim; return fold; error: isl_qpolynomial_fold_free(fold); isl_space_free(dim); return NULL; } /* Reset the space of "fold". This function is called from isl_pw_templ.c * and doesn't know if the space of an element object is represented * directly or through its domain. It therefore passes along both. */ __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_space_and_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *space, __isl_take isl_space *domain) { isl_space_free(space); return isl_qpolynomial_fold_reset_domain_space(fold, domain); } int isl_qpolynomial_fold_involves_dims(__isl_keep isl_qpolynomial_fold *fold, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!fold) return -1; if (fold->n == 0 || n == 0) return 0; for (i = 0; i < fold->n; ++i) { int involves = isl_qpolynomial_involves_dims(fold->qp[i], type, first, n); if (involves < 0 || involves) return involves; } return 0; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_set_dim_name( __isl_take isl_qpolynomial_fold *fold, enum isl_dim_type type, unsigned pos, const char *s) { int i; fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; fold->dim = isl_space_set_dim_name(fold->dim, type, pos, s); if (!fold->dim) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_set_dim_name(fold->qp[i], type, pos, s); if (!fold->qp[i]) goto error; } return fold; error: isl_qpolynomial_fold_free(fold); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_drop_dims( __isl_take isl_qpolynomial_fold *fold, enum isl_dim_type type, unsigned first, unsigned n) { int i; enum isl_dim_type set_type; if (!fold) return NULL; if (n == 0) return fold; set_type = type == isl_dim_in ? isl_dim_set : type; fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; fold->dim = isl_space_drop_dims(fold->dim, set_type, first, n); if (!fold->dim) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_drop_dims(fold->qp[i], type, first, n); if (!fold->qp[i]) goto error; } return fold; error: isl_qpolynomial_fold_free(fold); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_insert_dims( __isl_take isl_qpolynomial_fold *fold, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!fold) return NULL; if (n == 0 && !isl_space_is_named_or_nested(fold->dim, type)) return fold; fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; fold->dim = isl_space_insert_dims(fold->dim, type, first, n); if (!fold->dim) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_insert_dims(fold->qp[i], type, first, n); if (!fold->qp[i]) goto error; } return fold; error: isl_qpolynomial_fold_free(fold); return NULL; } static int isl_qpolynomial_cst_sign(__isl_keep isl_qpolynomial *qp) { struct isl_upoly_cst *cst; cst = isl_upoly_as_cst(qp->upoly); if (!cst) return 0; return isl_int_sgn(cst->n) < 0 ? -1 : 1; } static int isl_qpolynomial_aff_sign(__isl_keep isl_set *set, __isl_keep isl_qpolynomial *qp) { enum isl_lp_result res; isl_vec *aff; isl_int opt; int sgn = 0; aff = isl_qpolynomial_extract_affine(qp); if (!aff) return 0; isl_int_init(opt); res = isl_set_solve_lp(set, 0, aff->el + 1, aff->el[0], &opt, NULL, NULL); if (res == isl_lp_error) goto done; if (res == isl_lp_empty || (res == isl_lp_ok && !isl_int_is_neg(opt))) { sgn = 1; goto done; } res = isl_set_solve_lp(set, 1, aff->el + 1, aff->el[0], &opt, NULL, NULL); if (res == isl_lp_ok && !isl_int_is_pos(opt)) sgn = -1; done: isl_int_clear(opt); isl_vec_free(aff); return sgn; } /* Determine, if possible, the sign of the quasipolynomial "qp" on * the domain "set". * * If qp is a constant, then the problem is trivial. * If qp is linear, then we check if the minimum of the corresponding * affine constraint is non-negative or if the maximum is non-positive. * * Otherwise, we check if the outermost variable "v" has a lower bound "l" * in "set". If so, we write qp(v,v') as * * q(v,v') * (v - l) + r(v') * * if q(v,v') and r(v') have the same known sign, then the original * quasipolynomial has the same sign as well. * * Return * -1 if qp <= 0 * 1 if qp >= 0 * 0 if unknown */ static int isl_qpolynomial_sign(__isl_keep isl_set *set, __isl_keep isl_qpolynomial *qp) { int d; int i; int is; struct isl_upoly_rec *rec; isl_vec *v; isl_int l; enum isl_lp_result res; int sgn = 0; is = isl_qpolynomial_is_cst(qp, NULL, NULL); if (is < 0) return 0; if (is) return isl_qpolynomial_cst_sign(qp); is = isl_qpolynomial_is_affine(qp); if (is < 0) return 0; if (is) return isl_qpolynomial_aff_sign(set, qp); if (qp->div->n_row > 0) return 0; rec = isl_upoly_as_rec(qp->upoly); if (!rec) return 0; d = isl_space_dim(qp->dim, isl_dim_all); v = isl_vec_alloc(set->ctx, 2 + d); if (!v) return 0; isl_seq_clr(v->el + 1, 1 + d); isl_int_set_si(v->el[0], 1); isl_int_set_si(v->el[2 + qp->upoly->var], 1); isl_int_init(l); res = isl_set_solve_lp(set, 0, v->el + 1, v->el[0], &l, NULL, NULL); if (res == isl_lp_ok) { isl_qpolynomial *min; isl_qpolynomial *base; isl_qpolynomial *r, *q; isl_qpolynomial *t; min = isl_qpolynomial_cst_on_domain(isl_space_copy(qp->dim), l); base = isl_qpolynomial_var_pow_on_domain(isl_space_copy(qp->dim), qp->upoly->var, 1); r = isl_qpolynomial_alloc(isl_space_copy(qp->dim), 0, isl_upoly_copy(rec->p[rec->n - 1])); q = isl_qpolynomial_copy(r); for (i = rec->n - 2; i >= 0; --i) { r = isl_qpolynomial_mul(r, isl_qpolynomial_copy(min)); t = isl_qpolynomial_alloc(isl_space_copy(qp->dim), 0, isl_upoly_copy(rec->p[i])); r = isl_qpolynomial_add(r, t); if (i == 0) break; q = isl_qpolynomial_mul(q, isl_qpolynomial_copy(base)); q = isl_qpolynomial_add(q, isl_qpolynomial_copy(r)); } if (isl_qpolynomial_is_zero(q)) sgn = isl_qpolynomial_sign(set, r); else if (isl_qpolynomial_is_zero(r)) sgn = isl_qpolynomial_sign(set, q); else { int sgn_q, sgn_r; sgn_r = isl_qpolynomial_sign(set, r); sgn_q = isl_qpolynomial_sign(set, q); if (sgn_r == sgn_q) sgn = sgn_r; } isl_qpolynomial_free(min); isl_qpolynomial_free(base); isl_qpolynomial_free(q); isl_qpolynomial_free(r); } isl_int_clear(l); isl_vec_free(v); return sgn; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold_on_domain( __isl_keep isl_set *set, __isl_take isl_qpolynomial_fold *fold1, __isl_take isl_qpolynomial_fold *fold2) { int i, j; int n1; struct isl_qpolynomial_fold *res = NULL; int better; if (!fold1 || !fold2) goto error; isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error); isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim), goto error); better = fold1->type == isl_fold_max ? -1 : 1; if (isl_qpolynomial_fold_is_empty(fold1)) { isl_qpolynomial_fold_free(fold1); return fold2; } if (isl_qpolynomial_fold_is_empty(fold2)) { isl_qpolynomial_fold_free(fold2); return fold1; } res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim), fold1->n + fold2->n); if (!res) goto error; for (i = 0; i < fold1->n; ++i) { res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]); if (!res->qp[res->n]) goto error; res->n++; } n1 = res->n; for (i = 0; i < fold2->n; ++i) { for (j = n1 - 1; j >= 0; --j) { isl_qpolynomial *d; int sgn; d = isl_qpolynomial_sub( isl_qpolynomial_copy(res->qp[j]), isl_qpolynomial_copy(fold2->qp[i])); sgn = isl_qpolynomial_sign(set, d); isl_qpolynomial_free(d); if (sgn == 0) continue; if (sgn != better) break; isl_qpolynomial_free(res->qp[j]); if (j != n1 - 1) res->qp[j] = res->qp[n1 - 1]; n1--; if (n1 != res->n - 1) res->qp[n1] = res->qp[res->n - 1]; res->n--; } if (j >= 0) continue; res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]); if (!res->qp[res->n]) goto error; res->n++; } isl_qpolynomial_fold_free(fold1); isl_qpolynomial_fold_free(fold2); return res; error: isl_qpolynomial_fold_free(res); isl_qpolynomial_fold_free(fold1); isl_qpolynomial_fold_free(fold2); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_qpolynomial( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_qpolynomial *qp) { int i; if (!fold || !qp) goto error; if (isl_qpolynomial_is_zero(qp)) { isl_qpolynomial_free(qp); return fold; } fold = isl_qpolynomial_fold_cow(fold); if (!fold) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_add(fold->qp[i], isl_qpolynomial_copy(qp)); if (!fold->qp[i]) goto error; } isl_qpolynomial_free(qp); return fold; error: isl_qpolynomial_fold_free(fold); isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_on_domain( __isl_keep isl_set *dom, __isl_take isl_qpolynomial_fold *fold1, __isl_take isl_qpolynomial_fold *fold2) { int i; isl_qpolynomial_fold *res = NULL; if (!fold1 || !fold2) goto error; if (isl_qpolynomial_fold_is_empty(fold1)) { isl_qpolynomial_fold_free(fold1); return fold2; } if (isl_qpolynomial_fold_is_empty(fold2)) { isl_qpolynomial_fold_free(fold2); return fold1; } if (fold1->n == 1 && fold2->n != 1) return isl_qpolynomial_fold_add_on_domain(dom, fold2, fold1); if (fold2->n == 1) { res = isl_qpolynomial_fold_add_qpolynomial(fold1, isl_qpolynomial_copy(fold2->qp[0])); isl_qpolynomial_fold_free(fold2); return res; } res = isl_qpolynomial_fold_add_qpolynomial( isl_qpolynomial_fold_copy(fold1), isl_qpolynomial_copy(fold2->qp[0])); for (i = 1; i < fold2->n; ++i) { isl_qpolynomial_fold *res_i; res_i = isl_qpolynomial_fold_add_qpolynomial( isl_qpolynomial_fold_copy(fold1), isl_qpolynomial_copy(fold2->qp[i])); res = isl_qpolynomial_fold_fold_on_domain(dom, res, res_i); } isl_qpolynomial_fold_free(fold1); isl_qpolynomial_fold_free(fold2); return res; error: isl_qpolynomial_fold_free(res); isl_qpolynomial_fold_free(fold1); isl_qpolynomial_fold_free(fold2); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute_equalities( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_basic_set *eq) { int i; if (!fold || !eq) goto error; fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_substitute_equalities(fold->qp[i], isl_basic_set_copy(eq)); if (!fold->qp[i]) goto error; } isl_basic_set_free(eq); return fold; error: isl_basic_set_free(eq); isl_qpolynomial_fold_free(fold); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context) { int i; if (!fold || !context) goto error; fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_gist(fold->qp[i], isl_set_copy(context)); if (!fold->qp[i]) goto error; } isl_set_free(context); return fold; error: isl_set_free(context); isl_qpolynomial_fold_free(fold); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist_params( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context) { isl_space *space = isl_qpolynomial_fold_get_domain_space(fold); isl_set *dom_context = isl_set_universe(space); dom_context = isl_set_intersect_params(dom_context, context); return isl_qpolynomial_fold_gist(fold, dom_context); } #define HAS_TYPE #undef PW #define PW isl_pw_qpolynomial_fold #undef EL #define EL isl_qpolynomial_fold #undef EL_IS_ZERO #define EL_IS_ZERO is_empty #undef ZERO #define ZERO zero #undef IS_ZERO #define IS_ZERO is_zero #undef FIELD #define FIELD fold #undef DEFAULT_IS_ZERO #define DEFAULT_IS_ZERO 1 #define NO_NEG #define NO_PULLBACK #include #undef UNION #define UNION isl_union_pw_qpolynomial_fold #undef PART #define PART isl_pw_qpolynomial_fold #undef PARTS #define PARTS pw_qpolynomial_fold #define ALIGN_DOMAIN #define NO_SUB #include __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type, __isl_take isl_space *dim) { return qpolynomial_fold_alloc(type, dim, 0); } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc( enum isl_fold type, __isl_take isl_qpolynomial *qp) { isl_qpolynomial_fold *fold; if (!qp) return NULL; fold = qpolynomial_fold_alloc(type, isl_space_copy(qp->dim), 1); if (!fold) goto error; fold->qp[0] = qp; fold->n++; return fold; error: isl_qpolynomial_fold_free(fold); isl_qpolynomial_free(qp); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy( __isl_keep isl_qpolynomial_fold *fold) { if (!fold) return NULL; fold->ref++; return fold; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_dup( __isl_keep isl_qpolynomial_fold *fold) { int i; isl_qpolynomial_fold *dup; if (!fold) return NULL; dup = qpolynomial_fold_alloc(fold->type, isl_space_copy(fold->dim), fold->n); if (!dup) return NULL; dup->n = fold->n; for (i = 0; i < fold->n; ++i) { dup->qp[i] = isl_qpolynomial_copy(fold->qp[i]); if (!dup->qp[i]) goto error; } return dup; error: isl_qpolynomial_fold_free(dup); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_cow( __isl_take isl_qpolynomial_fold *fold) { if (!fold) return NULL; if (fold->ref == 1) return fold; fold->ref--; return isl_qpolynomial_fold_dup(fold); } void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold) { int i; if (!fold) return; if (--fold->ref > 0) return; for (i = 0; i < fold->n; ++i) isl_qpolynomial_free(fold->qp[i]); isl_space_free(fold->dim); free(fold); } int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold) { if (!fold) return -1; return fold->n == 0; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold( __isl_take isl_qpolynomial_fold *fold1, __isl_take isl_qpolynomial_fold *fold2) { int i; struct isl_qpolynomial_fold *res = NULL; if (!fold1 || !fold2) goto error; isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error); isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim), goto error); if (isl_qpolynomial_fold_is_empty(fold1)) { isl_qpolynomial_fold_free(fold1); return fold2; } if (isl_qpolynomial_fold_is_empty(fold2)) { isl_qpolynomial_fold_free(fold2); return fold1; } res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim), fold1->n + fold2->n); if (!res) goto error; for (i = 0; i < fold1->n; ++i) { res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]); if (!res->qp[res->n]) goto error; res->n++; } for (i = 0; i < fold2->n; ++i) { res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]); if (!res->qp[res->n]) goto error; res->n++; } isl_qpolynomial_fold_free(fold1); isl_qpolynomial_fold_free(fold2); return res; error: isl_qpolynomial_fold_free(res); isl_qpolynomial_fold_free(fold1); isl_qpolynomial_fold_free(fold2); return NULL; } __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_fold( __isl_take isl_pw_qpolynomial_fold *pw1, __isl_take isl_pw_qpolynomial_fold *pw2) { int i, j, n; struct isl_pw_qpolynomial_fold *res; isl_set *set; if (!pw1 || !pw2) goto error; isl_assert(pw1->dim->ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error); if (isl_pw_qpolynomial_fold_is_zero(pw1)) { isl_pw_qpolynomial_fold_free(pw1); return pw2; } if (isl_pw_qpolynomial_fold_is_zero(pw2)) { isl_pw_qpolynomial_fold_free(pw2); return pw1; } if (pw1->type != pw2->type) isl_die(pw1->dim->ctx, isl_error_invalid, "fold types don't match", goto error); n = (pw1->n + 1) * (pw2->n + 1); res = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pw1->dim), pw1->type, n); for (i = 0; i < pw1->n; ++i) { set = isl_set_copy(pw1->p[i].set); for (j = 0; j < pw2->n; ++j) { struct isl_set *common; isl_qpolynomial_fold *sum; set = isl_set_subtract(set, isl_set_copy(pw2->p[j].set)); common = isl_set_intersect(isl_set_copy(pw1->p[i].set), isl_set_copy(pw2->p[j].set)); if (isl_set_plain_is_empty(common)) { isl_set_free(common); continue; } sum = isl_qpolynomial_fold_fold_on_domain(common, isl_qpolynomial_fold_copy(pw1->p[i].fold), isl_qpolynomial_fold_copy(pw2->p[j].fold)); res = isl_pw_qpolynomial_fold_add_piece(res, common, sum); } res = isl_pw_qpolynomial_fold_add_piece(res, set, isl_qpolynomial_fold_copy(pw1->p[i].fold)); } for (j = 0; j < pw2->n; ++j) { set = isl_set_copy(pw2->p[j].set); for (i = 0; i < pw1->n; ++i) set = isl_set_subtract(set, isl_set_copy(pw1->p[i].set)); res = isl_pw_qpolynomial_fold_add_piece(res, set, isl_qpolynomial_fold_copy(pw2->p[j].fold)); } isl_pw_qpolynomial_fold_free(pw1); isl_pw_qpolynomial_fold_free(pw2); return res; error: isl_pw_qpolynomial_fold_free(pw1); isl_pw_qpolynomial_fold_free(pw2); return NULL; } __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold( __isl_take isl_union_pw_qpolynomial_fold *u, __isl_take isl_pw_qpolynomial_fold *part) { uint32_t hash; struct isl_hash_table_entry *entry; u = isl_union_pw_qpolynomial_fold_cow(u); if (!part || !u) goto error; isl_assert(u->dim->ctx, isl_space_match(part->dim, isl_dim_param, u->dim, isl_dim_param), goto error); hash = isl_space_get_hash(part->dim); entry = isl_hash_table_find(u->dim->ctx, &u->table, hash, &has_dim, part->dim, 1); if (!entry) goto error; if (!entry->data) entry->data = part; else { entry->data = isl_pw_qpolynomial_fold_fold(entry->data, isl_pw_qpolynomial_fold_copy(part)); if (!entry->data) goto error; isl_pw_qpolynomial_fold_free(part); } return u; error: isl_pw_qpolynomial_fold_free(part); isl_union_pw_qpolynomial_fold_free(u); return NULL; } static int fold_part(__isl_take isl_pw_qpolynomial_fold *part, void *user) { isl_union_pw_qpolynomial_fold **u; u = (isl_union_pw_qpolynomial_fold **)user; *u = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(*u, part); return 0; } __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold( __isl_take isl_union_pw_qpolynomial_fold *u1, __isl_take isl_union_pw_qpolynomial_fold *u2) { u1 = isl_union_pw_qpolynomial_fold_cow(u1); if (!u1 || !u2) goto error; if (isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(u2, &fold_part, &u1) < 0) goto error; isl_union_pw_qpolynomial_fold_free(u2); return u1; error: isl_union_pw_qpolynomial_fold_free(u1); isl_union_pw_qpolynomial_fold_free(u2); return NULL; } __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial( enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp) { int i; isl_pw_qpolynomial_fold *pwf; if (!pwqp) return NULL; pwf = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pwqp->dim), type, pwqp->n); for (i = 0; i < pwqp->n; ++i) pwf = isl_pw_qpolynomial_fold_add_piece(pwf, isl_set_copy(pwqp->p[i].set), isl_qpolynomial_fold_alloc(type, isl_qpolynomial_copy(pwqp->p[i].qp))); isl_pw_qpolynomial_free(pwqp); return pwf; } __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_add( __isl_take isl_pw_qpolynomial_fold *pwf1, __isl_take isl_pw_qpolynomial_fold *pwf2) { return isl_pw_qpolynomial_fold_union_add_(pwf1, pwf2); } int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1, __isl_keep isl_qpolynomial_fold *fold2) { int i; if (!fold1 || !fold2) return -1; if (fold1->n != fold2->n) return 0; /* We probably want to sort the qps first... */ for (i = 0; i < fold1->n; ++i) { int eq = isl_qpolynomial_plain_is_equal(fold1->qp[i], fold2->qp[i]); if (eq < 0 || !eq) return eq; } return 1; } __isl_give isl_qpolynomial *isl_qpolynomial_fold_eval( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt) { isl_qpolynomial *qp; if (!fold || !pnt) goto error; isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, fold->dim), goto error); isl_assert(pnt->dim->ctx, fold->type == isl_fold_max || fold->type == isl_fold_min, goto error); if (fold->n == 0) qp = isl_qpolynomial_zero_on_domain(isl_space_copy(fold->dim)); else { int i; qp = isl_qpolynomial_eval(isl_qpolynomial_copy(fold->qp[0]), isl_point_copy(pnt)); for (i = 1; i < fold->n; ++i) { isl_qpolynomial *qp_i; qp_i = isl_qpolynomial_eval( isl_qpolynomial_copy(fold->qp[i]), isl_point_copy(pnt)); if (fold->type == isl_fold_max) qp = isl_qpolynomial_max_cst(qp, qp_i); else qp = isl_qpolynomial_min_cst(qp, qp_i); } } isl_qpolynomial_fold_free(fold); isl_point_free(pnt); return qp; error: isl_qpolynomial_fold_free(fold); isl_point_free(pnt); return NULL; } size_t isl_pw_qpolynomial_fold_size(__isl_keep isl_pw_qpolynomial_fold *pwf) { int i; size_t n = 0; for (i = 0; i < pwf->n; ++i) n += pwf->p[i].fold->n; return n; } __isl_give isl_qpolynomial *isl_qpolynomial_fold_opt_on_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *set, int max) { int i; isl_qpolynomial *opt; if (!set || !fold) goto error; if (fold->n == 0) { isl_space *dim = isl_space_copy(fold->dim); isl_set_free(set); isl_qpolynomial_fold_free(fold); return isl_qpolynomial_zero_on_domain(dim); } opt = isl_qpolynomial_opt_on_domain(isl_qpolynomial_copy(fold->qp[0]), isl_set_copy(set), max); for (i = 1; i < fold->n; ++i) { isl_qpolynomial *opt_i; opt_i = isl_qpolynomial_opt_on_domain( isl_qpolynomial_copy(fold->qp[i]), isl_set_copy(set), max); if (max) opt = isl_qpolynomial_max_cst(opt, opt_i); else opt = isl_qpolynomial_min_cst(opt, opt_i); } isl_set_free(set); isl_qpolynomial_fold_free(fold); return opt; error: isl_set_free(set); isl_qpolynomial_fold_free(fold); return NULL; } /* Check whether for each quasi-polynomial in "fold2" there is * a quasi-polynomial in "fold1" that dominates it on "set". */ static int qpolynomial_fold_covers_on_domain(__isl_keep isl_set *set, __isl_keep isl_qpolynomial_fold *fold1, __isl_keep isl_qpolynomial_fold *fold2) { int i, j; int covers; if (!set || !fold1 || !fold2) return -1; covers = fold1->type == isl_fold_max ? 1 : -1; for (i = 0; i < fold2->n; ++i) { for (j = 0; j < fold1->n; ++j) { isl_qpolynomial *d; int sgn; d = isl_qpolynomial_sub( isl_qpolynomial_copy(fold1->qp[j]), isl_qpolynomial_copy(fold2->qp[i])); sgn = isl_qpolynomial_sign(set, d); isl_qpolynomial_free(d); if (sgn == covers) break; } if (j >= fold1->n) return 0; } return 1; } /* Check whether "pwf1" dominated "pwf2", i.e., the domain of "pwf1" contains * that of "pwf2" and on each cell, the corresponding fold from pwf1 dominates * that of pwf2. */ int isl_pw_qpolynomial_fold_covers(__isl_keep isl_pw_qpolynomial_fold *pwf1, __isl_keep isl_pw_qpolynomial_fold *pwf2) { int i, j; isl_set *dom1, *dom2; int is_subset; if (!pwf1 || !pwf2) return -1; if (pwf2->n == 0) return 1; if (pwf1->n == 0) return 0; dom1 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf1)); dom2 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf2)); is_subset = isl_set_is_subset(dom2, dom1); isl_set_free(dom1); isl_set_free(dom2); if (is_subset < 0 || !is_subset) return is_subset; for (i = 0; i < pwf2->n; ++i) { for (j = 0; j < pwf1->n; ++j) { int is_empty; isl_set *common; int covers; common = isl_set_intersect(isl_set_copy(pwf1->p[j].set), isl_set_copy(pwf2->p[i].set)); is_empty = isl_set_is_empty(common); if (is_empty < 0 || is_empty) { isl_set_free(common); if (is_empty < 0) return -1; continue; } covers = qpolynomial_fold_covers_on_domain(common, pwf1->p[j].fold, pwf2->p[i].fold); isl_set_free(common); if (covers < 0 || !covers) return covers; } } return 1; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_morph_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_morph *morph) { int i; isl_ctx *ctx; if (!fold || !morph) goto error; ctx = fold->dim->ctx; isl_assert(ctx, isl_space_is_equal(fold->dim, morph->dom->dim), goto error); fold = isl_qpolynomial_fold_cow(fold); if (!fold) goto error; isl_space_free(fold->dim); fold->dim = isl_space_copy(morph->ran->dim); if (!fold->dim) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_morph_domain(fold->qp[i], isl_morph_copy(morph)); if (!fold->qp[i]) goto error; } isl_morph_free(morph); return fold; error: isl_qpolynomial_fold_free(fold); isl_morph_free(morph); return NULL; } enum isl_fold isl_qpolynomial_fold_get_type(__isl_keep isl_qpolynomial_fold *fold) { if (!fold) return isl_fold_list; return fold->type; } enum isl_fold isl_union_pw_qpolynomial_fold_get_type( __isl_keep isl_union_pw_qpolynomial_fold *upwf) { if (!upwf) return isl_fold_list; return upwf->type; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_lift( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim) { int i; if (!fold || !dim) goto error; if (isl_space_is_equal(fold->dim, dim)) { isl_space_free(dim); return fold; } fold = isl_qpolynomial_fold_cow(fold); if (!fold) goto error; isl_space_free(fold->dim); fold->dim = isl_space_copy(dim); if (!fold->dim) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_lift(fold->qp[i], isl_space_copy(dim)); if (!fold->qp[i]) goto error; } isl_space_free(dim); return fold; error: isl_qpolynomial_fold_free(fold); isl_space_free(dim); return NULL; } int isl_qpolynomial_fold_foreach_qpolynomial( __isl_keep isl_qpolynomial_fold *fold, int (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user) { int i; if (!fold) return -1; for (i = 0; i < fold->n; ++i) if (fn(isl_qpolynomial_copy(fold->qp[i]), user) < 0) return -1; return 0; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_move_dims( __isl_take isl_qpolynomial_fold *fold, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { int i; if (n == 0) return fold; fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; fold->dim = isl_space_move_dims(fold->dim, dst_type, dst_pos, src_type, src_pos, n); if (!fold->dim) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_move_dims(fold->qp[i], dst_type, dst_pos, src_type, src_pos, n); if (!fold->qp[i]) goto error; } return fold; error: isl_qpolynomial_fold_free(fold); return NULL; } /* For each 0 <= i < "n", replace variable "first" + i of type "type" * in fold->qp[k] by subs[i]. */ __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute( __isl_take isl_qpolynomial_fold *fold, enum isl_dim_type type, unsigned first, unsigned n, __isl_keep isl_qpolynomial **subs) { int i; if (n == 0) return fold; fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_substitute(fold->qp[i], type, first, n, subs); if (!fold->qp[i]) goto error; } return fold; error: isl_qpolynomial_fold_free(fold); return NULL; } static int add_pwqp(__isl_take isl_pw_qpolynomial *pwqp, void *user) { isl_ctx *ctx; isl_pw_qpolynomial_fold *pwf; isl_union_pw_qpolynomial_fold **upwf; uint32_t hash; struct isl_hash_table_entry *entry; upwf = (isl_union_pw_qpolynomial_fold **)user; ctx = pwqp->dim->ctx; hash = isl_space_get_hash(pwqp->dim); entry = isl_hash_table_find(ctx, &(*upwf)->table, hash, &has_dim, pwqp->dim, 1); if (!entry) goto error; pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial((*upwf)->type, pwqp); if (!entry->data) entry->data = pwf; else { entry->data = isl_pw_qpolynomial_fold_add(entry->data, pwf); if (!entry->data) return -1; if (isl_pw_qpolynomial_fold_is_zero(entry->data)) { isl_pw_qpolynomial_fold_free(entry->data); isl_hash_table_remove(ctx, &(*upwf)->table, entry); } } return 0; error: isl_pw_qpolynomial_free(pwqp); return -1; } __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial( __isl_take isl_union_pw_qpolynomial_fold *upwf, __isl_take isl_union_pw_qpolynomial *upwqp) { upwf = isl_union_pw_qpolynomial_fold_align_params(upwf, isl_union_pw_qpolynomial_get_space(upwqp)); upwqp = isl_union_pw_qpolynomial_align_params(upwqp, isl_union_pw_qpolynomial_fold_get_space(upwf)); upwf = isl_union_pw_qpolynomial_fold_cow(upwf); if (!upwf || !upwqp) goto error; if (isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp, &add_pwqp, &upwf) < 0) goto error; isl_union_pw_qpolynomial_free(upwqp); return upwf; error: isl_union_pw_qpolynomial_fold_free(upwf); isl_union_pw_qpolynomial_free(upwqp); return NULL; } static int join_compatible(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2) { int m; m = isl_space_match(dim1, isl_dim_param, dim2, isl_dim_param); if (m < 0 || !m) return m; return isl_space_tuple_match(dim1, isl_dim_out, dim2, isl_dim_in); } /* Compute the intersection of the range of the map and the domain * of the piecewise quasipolynomial reduction and then compute a bound * on the associated quasipolynomial reduction over all elements * in this intersection. * * We first introduce some unconstrained dimensions in the * piecewise quasipolynomial, intersect the resulting domain * with the wrapped map and the compute the sum. */ __isl_give isl_pw_qpolynomial_fold *isl_map_apply_pw_qpolynomial_fold( __isl_take isl_map *map, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight) { isl_ctx *ctx; isl_set *dom; isl_space *map_dim; isl_space *pwf_dim; unsigned n_in; int ok; ctx = isl_map_get_ctx(map); if (!ctx) goto error; map_dim = isl_map_get_space(map); pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf); ok = join_compatible(map_dim, pwf_dim); isl_space_free(map_dim); isl_space_free(pwf_dim); if (!ok) isl_die(ctx, isl_error_invalid, "incompatible dimensions", goto error); n_in = isl_map_dim(map, isl_dim_in); pwf = isl_pw_qpolynomial_fold_insert_dims(pwf, isl_dim_in, 0, n_in); dom = isl_map_wrap(map); pwf = isl_pw_qpolynomial_fold_reset_domain_space(pwf, isl_set_get_space(dom)); pwf = isl_pw_qpolynomial_fold_intersect_domain(pwf, dom); pwf = isl_pw_qpolynomial_fold_bound(pwf, tight); return pwf; error: isl_map_free(map); isl_pw_qpolynomial_fold_free(pwf); return NULL; } __isl_give isl_pw_qpolynomial_fold *isl_set_apply_pw_qpolynomial_fold( __isl_take isl_set *set, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight) { return isl_map_apply_pw_qpolynomial_fold(set, pwf, tight); } struct isl_apply_fold_data { isl_union_pw_qpolynomial_fold *upwf; isl_union_pw_qpolynomial_fold *res; isl_map *map; int tight; }; static int pw_qpolynomial_fold_apply(__isl_take isl_pw_qpolynomial_fold *pwf, void *user) { isl_space *map_dim; isl_space *pwf_dim; struct isl_apply_fold_data *data = user; int ok; map_dim = isl_map_get_space(data->map); pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf); ok = join_compatible(map_dim, pwf_dim); isl_space_free(map_dim); isl_space_free(pwf_dim); if (ok) { pwf = isl_map_apply_pw_qpolynomial_fold(isl_map_copy(data->map), pwf, data->tight ? &data->tight : NULL); data->res = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold( data->res, pwf); } else isl_pw_qpolynomial_fold_free(pwf); return 0; } static int map_apply(__isl_take isl_map *map, void *user) { struct isl_apply_fold_data *data = user; int r; data->map = map; r = isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold( data->upwf, &pw_qpolynomial_fold_apply, data); isl_map_free(map); return r; } __isl_give isl_union_pw_qpolynomial_fold *isl_union_map_apply_union_pw_qpolynomial_fold( __isl_take isl_union_map *umap, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight) { isl_space *dim; enum isl_fold type; struct isl_apply_fold_data data; upwf = isl_union_pw_qpolynomial_fold_align_params(upwf, isl_union_map_get_space(umap)); umap = isl_union_map_align_params(umap, isl_union_pw_qpolynomial_fold_get_space(upwf)); data.upwf = upwf; data.tight = tight ? 1 : 0; dim = isl_union_pw_qpolynomial_fold_get_space(upwf); type = isl_union_pw_qpolynomial_fold_get_type(upwf); data.res = isl_union_pw_qpolynomial_fold_zero(dim, type); if (isl_union_map_foreach_map(umap, &map_apply, &data) < 0) goto error; isl_union_map_free(umap); isl_union_pw_qpolynomial_fold_free(upwf); if (tight) *tight = data.tight; return data.res; error: isl_union_map_free(umap); isl_union_pw_qpolynomial_fold_free(upwf); isl_union_pw_qpolynomial_fold_free(data.res); return NULL; } __isl_give isl_union_pw_qpolynomial_fold *isl_union_set_apply_union_pw_qpolynomial_fold( __isl_take isl_union_set *uset, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight) { return isl_union_map_apply_union_pw_qpolynomial_fold(uset, upwf, tight); } /* Reorder the dimension of "fold" according to the given reordering. */ __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_realign_domain( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_reordering *r) { int i; fold = isl_qpolynomial_fold_cow(fold); if (!fold || !r) goto error; for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_realign_domain(fold->qp[i], isl_reordering_copy(r)); if (!fold->qp[i]) goto error; } fold = isl_qpolynomial_fold_reset_domain_space(fold, isl_space_copy(r->dim)); isl_reordering_free(r); return fold; error: isl_qpolynomial_fold_free(fold); isl_reordering_free(r); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_mul_isl_int( __isl_take isl_qpolynomial_fold *fold, isl_int v) { int i; if (isl_int_is_one(v)) return fold; if (fold && isl_int_is_zero(v)) { isl_qpolynomial_fold *zero; isl_space *dim = isl_space_copy(fold->dim); zero = isl_qpolynomial_fold_empty(fold->type, dim); isl_qpolynomial_fold_free(fold); return zero; } fold = isl_qpolynomial_fold_cow(fold); if (!fold) return NULL; if (isl_int_is_neg(v)) fold->type = isl_fold_type_negate(fold->type); for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_mul_isl_int(fold->qp[i], v); if (!fold->qp[i]) goto error; } return fold; error: isl_qpolynomial_fold_free(fold); return NULL; } __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale( __isl_take isl_qpolynomial_fold *fold, isl_int v) { return isl_qpolynomial_fold_mul_isl_int(fold, v); } /* Multiply "fold" by "v". */ __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_val( __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v) { int i; if (!fold || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return fold; } if (isl_val_is_zero(v)) { isl_qpolynomial_fold *zero; isl_space *space = isl_qpolynomial_fold_get_domain_space(fold); zero = isl_qpolynomial_fold_empty(fold->type, space); isl_qpolynomial_fold_free(fold); isl_val_free(v); return zero; } if (!isl_val_is_rat(v)) isl_die(isl_qpolynomial_fold_get_ctx(fold), isl_error_invalid, "expecting rational factor", goto error); fold = isl_qpolynomial_fold_cow(fold); if (!fold) goto error; if (isl_val_is_neg(v)) fold->type = isl_fold_type_negate(fold->type); for (i = 0; i < fold->n; ++i) { fold->qp[i] = isl_qpolynomial_scale_val(fold->qp[i], isl_val_copy(v)); if (!fold->qp[i]) goto error; } isl_val_free(v); return fold; error: isl_val_free(v); isl_qpolynomial_fold_free(fold); return NULL; } cloog-0.18.2/isl/isl_map_piplib.h0000664000175000017500000000104312254313240013545 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_MAP_PIPLIB_H #define ISL_MAP_PIPLIB_H #include #if defined(__cplusplus) extern "C" { #endif struct isl_map *isl_pip_basic_map_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/isl_ast_private.h0000664000175000017500000000544212254313240013761 00000000000000#ifndef ISL_AST_PRIVATE_H #define ISL_AST_PRIVATE_H #include #include #include #include #include #include /* An expression is either an integer, an identifier or an operation * with zero or more arguments. */ struct isl_ast_expr { int ref; isl_ctx *ctx; enum isl_ast_expr_type type; union { isl_val *v; isl_id *id; struct { enum isl_ast_op_type op; unsigned n_arg; isl_ast_expr **args; } op; } u; }; #undef EL #define EL isl_ast_expr #include __isl_give isl_ast_expr *isl_ast_expr_alloc_int_si(isl_ctx *ctx, int i); __isl_give isl_ast_expr *isl_ast_expr_alloc_op(isl_ctx *ctx, enum isl_ast_op_type op, int n_arg); __isl_give isl_ast_expr *isl_ast_expr_alloc_binary(enum isl_ast_op_type type, __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2); #undef EL #define EL isl_ast_node #include /* A node is either a block, an if, a for or a user node. * "else_node" is NULL if the if node does not have an else branch. * "cond" and "inc" are NULL for degenerate for nodes. */ struct isl_ast_node { int ref; isl_ctx *ctx; enum isl_ast_node_type type; union { struct { isl_ast_node_list *children; } b; struct { isl_ast_expr *guard; isl_ast_node *then; isl_ast_node *else_node; } i; struct { unsigned degenerate : 1; isl_ast_expr *iterator; isl_ast_expr *init; isl_ast_expr *cond; isl_ast_expr *inc; isl_ast_node *body; } f; struct { isl_ast_expr *expr; } e; } u; isl_id *annotation; }; __isl_give isl_ast_node *isl_ast_node_alloc_for(__isl_take isl_id *id); __isl_give isl_ast_node *isl_ast_node_for_mark_degenerate( __isl_take isl_ast_node *node); __isl_give isl_ast_node *isl_ast_node_alloc_if(__isl_take isl_ast_expr *guard); __isl_give isl_ast_node *isl_ast_node_alloc_block( __isl_take isl_ast_node_list *list); __isl_give isl_ast_node *isl_ast_node_from_ast_node_list( __isl_take isl_ast_node_list *list); __isl_give isl_ast_node *isl_ast_node_for_set_body( __isl_take isl_ast_node *node, __isl_take isl_ast_node *body); __isl_give isl_ast_node *isl_ast_node_if_set_then( __isl_take isl_ast_node *node, __isl_take isl_ast_node *child); struct isl_ast_print_options { int ref; isl_ctx *ctx; __isl_give isl_printer *(*print_for)(__isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user); void *print_for_user; __isl_give isl_printer *(*print_user)(__isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user); void *print_user_user; }; __isl_give isl_printer *isl_ast_node_list_print( __isl_keep isl_ast_node_list *list, __isl_take isl_printer *p, __isl_keep isl_ast_print_options *options); #endif cloog-0.18.2/isl/isl_id_private.h0000664000175000017500000000140312254313240013557 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_ID_PRIVATE_H #define ISL_ID_PRIVATE_H #include /* Represent a name and/or user pointer. * * If "free_user" is set, then it will be called on "user" when * the last instance of the isl_id is freed. */ struct isl_id { int ref; isl_ctx *ctx; const char *name; void *user; uint32_t hash; __isl_give void (*free_user)(void *user); }; #undef EL #define EL isl_id #include uint32_t isl_hash_id(uint32_t hash, __isl_keep isl_id *id); extern isl_id isl_id_none; #endif cloog-0.18.2/isl/polyhedron_minimize.c0000664000175000017500000000453712254313240014654 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include /* The input of this program is the same as that of the "polytope_minimize" * program from the barvinok distribution. * * Constraints of set is PolyLib format. * Linear or affine objective function in PolyLib format. */ static struct isl_vec *isl_vec_lin_to_aff(struct isl_vec *vec) { struct isl_vec *aff; if (!vec) return NULL; aff = isl_vec_alloc(vec->ctx, 1 + vec->size); if (!aff) goto error; isl_int_set_si(aff->el[0], 0); isl_seq_cpy(aff->el + 1, vec->el, vec->size); isl_vec_free(vec); return aff; error: isl_vec_free(vec); return NULL; } /* Rotate elements of vector right. * In particular, move the constant term from the end of the * vector to the start of the vector. */ static struct isl_vec *vec_ror(struct isl_vec *vec) { int i; if (!vec) return NULL; for (i = vec->size - 2; i >= 0; --i) isl_int_swap(vec->el[i], vec->el[i + 1]); return vec; } int main(int argc, char **argv) { struct isl_ctx *ctx = isl_ctx_alloc(); struct isl_basic_set *bset; struct isl_vec *obj; struct isl_vec *sol; isl_int opt; unsigned dim; enum isl_lp_result res; isl_printer *p; isl_int_init(opt); bset = isl_basic_set_read_from_file(ctx, stdin); assert(bset); obj = isl_vec_read_from_file(ctx, stdin); assert(obj); dim = isl_basic_set_total_dim(bset); assert(obj->size >= dim && obj->size <= dim + 1); if (obj->size != dim + 1) obj = isl_vec_lin_to_aff(obj); else obj = vec_ror(obj); res = isl_basic_set_solve_ilp(bset, 0, obj->el, &opt, &sol); switch (res) { case isl_lp_error: fprintf(stderr, "error\n"); return -1; case isl_lp_empty: fprintf(stdout, "empty\n"); break; case isl_lp_unbounded: fprintf(stdout, "unbounded\n"); break; case isl_lp_ok: p = isl_printer_to_file(ctx, stdout); p = isl_printer_print_vec(p, sol); p = isl_printer_end_line(p); p = isl_printer_print_isl_int(p, opt); p = isl_printer_end_line(p); isl_printer_free(p); } isl_basic_set_free(bset); isl_vec_free(obj); isl_vec_free(sol); isl_ctx_free(ctx); isl_int_clear(opt); return 0; } cloog-0.18.2/isl/isl_band.c0000664000175000017500000004334512254313240012343 00000000000000/* * Copyright 2011 INRIA Saclay * Copyright 2012-2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France */ #include #include #undef BASE #define BASE band #include isl_ctx *isl_band_get_ctx(__isl_keep isl_band *band) { return band ? isl_union_pw_multi_aff_get_ctx(band->pma) : NULL; } __isl_give isl_band *isl_band_alloc(isl_ctx *ctx) { isl_band *band; band = isl_calloc_type(ctx, isl_band); if (!band) return NULL; band->ref = 1; return band; } /* Create a duplicate of the given band. The duplicate refers * to the same schedule and parent as the input, but does not * increment their reference counts. */ __isl_give isl_band *isl_band_dup(__isl_keep isl_band *band) { int i; isl_ctx *ctx; isl_band *dup; if (!band) return NULL; ctx = isl_band_get_ctx(band); dup = isl_band_alloc(ctx); if (!dup) return NULL; dup->n = band->n; dup->zero = isl_alloc_array(ctx, int, band->n); if (band->n && !dup->zero) goto error; for (i = 0; i < band->n; ++i) dup->zero[i] = band->zero[i]; dup->pma = isl_union_pw_multi_aff_copy(band->pma); dup->schedule = band->schedule; dup->parent = band->parent; if (!dup->pma) goto error; return dup; error: isl_band_free(dup); return NULL; } /* We not only increment the reference count of the band, * but also that of the schedule that contains this band. * This ensures that the schedule won't disappear while there * is still a reference to the band outside of the schedule. * There is no need to increment the reference count of the parent * band as the parent band is part of the same schedule. */ __isl_give isl_band *isl_band_copy(__isl_keep isl_band *band) { if (!band) return NULL; band->ref++; band->schedule->ref++; return band; } /* If this is not the last reference to the band (the one from within the * schedule), then we also need to decrement the reference count of the * containing schedule as it was incremented in isl_band_copy. */ void *isl_band_free(__isl_take isl_band *band) { if (!band) return NULL; if (--band->ref > 0) return isl_schedule_free(band->schedule); isl_union_pw_multi_aff_free(band->pma); isl_band_list_free(band->children); free(band->zero); free(band); return NULL; } int isl_band_has_children(__isl_keep isl_band *band) { if (!band) return -1; return band->children != NULL; } __isl_give isl_band_list *isl_band_get_children( __isl_keep isl_band *band) { if (!band) return NULL; if (!band->children) isl_die(isl_band_get_ctx(band), isl_error_invalid, "band has no children", return NULL); return isl_band_list_dup(band->children); } int isl_band_n_member(__isl_keep isl_band *band) { return band ? band->n : 0; } /* Is the given scheduling dimension zero distance within the band and * with respect to the proximity dependences. */ int isl_band_member_is_zero_distance(__isl_keep isl_band *band, int pos) { if (!band) return -1; if (pos < 0 || pos >= band->n) isl_die(isl_band_get_ctx(band), isl_error_invalid, "invalid member position", return -1); return band->zero[pos]; } /* Return the schedule that leads up to this band. */ __isl_give isl_union_map *isl_band_get_prefix_schedule( __isl_keep isl_band *band) { isl_union_set *domain; isl_union_pw_multi_aff *prefix; isl_band *a; if (!band) return NULL; prefix = isl_union_pw_multi_aff_copy(band->pma); domain = isl_union_pw_multi_aff_domain(prefix); prefix = isl_union_pw_multi_aff_from_domain(domain); for (a = band->parent; a; a = a->parent) { isl_union_pw_multi_aff *partial; partial = isl_union_pw_multi_aff_copy(a->pma); prefix = isl_union_pw_multi_aff_flat_range_product(partial, prefix); } return isl_union_map_from_union_pw_multi_aff(prefix); } /* Return the schedule of the band in isolation. */ __isl_give isl_union_pw_multi_aff * isl_band_get_partial_schedule_union_pw_multi_aff(__isl_keep isl_band *band) { return band ? isl_union_pw_multi_aff_copy(band->pma) : NULL; } /* Return the schedule of the band in isolation. */ __isl_give isl_union_map *isl_band_get_partial_schedule( __isl_keep isl_band *band) { isl_union_pw_multi_aff *sched; sched = isl_band_get_partial_schedule_union_pw_multi_aff(band); return isl_union_map_from_union_pw_multi_aff(sched); } __isl_give isl_union_pw_multi_aff * isl_band_get_suffix_schedule_union_pw_multi_aff(__isl_keep isl_band *band); /* Return the schedule for the given band list. * For each band in the list, the schedule is composed of the partial * and suffix schedules of that band. */ __isl_give isl_union_pw_multi_aff * isl_band_list_get_suffix_schedule_union_pw_multi_aff( __isl_keep isl_band_list *list) { isl_ctx *ctx; int i, n; isl_space *space; isl_union_pw_multi_aff *suffix; if (!list) return NULL; ctx = isl_band_list_get_ctx(list); space = isl_space_alloc(ctx, 0, 0, 0); suffix = isl_union_pw_multi_aff_empty(space); n = isl_band_list_n_band(list); for (i = 0; i < n; ++i) { isl_band *el; isl_union_pw_multi_aff *partial; isl_union_pw_multi_aff *suffix_i; el = isl_band_list_get_band(list, i); partial = isl_band_get_partial_schedule_union_pw_multi_aff(el); suffix_i = isl_band_get_suffix_schedule_union_pw_multi_aff(el); suffix_i = isl_union_pw_multi_aff_flat_range_product( partial, suffix_i); suffix = isl_union_pw_multi_aff_add(suffix, suffix_i); isl_band_free(el); } return suffix; } /* Return the schedule for the given band list. * For each band in the list, the schedule is composed of the partial * and suffix schedules of that band. */ __isl_give isl_union_map *isl_band_list_get_suffix_schedule( __isl_keep isl_band_list *list) { isl_union_pw_multi_aff *suffix; suffix = isl_band_list_get_suffix_schedule_union_pw_multi_aff(list); return isl_union_map_from_union_pw_multi_aff(suffix); } /* Return the schedule for the forest underneath the given band. */ __isl_give isl_union_pw_multi_aff * isl_band_get_suffix_schedule_union_pw_multi_aff(__isl_keep isl_band *band) { isl_union_pw_multi_aff *suffix; if (!band) return NULL; if (!isl_band_has_children(band)) { isl_union_set *domain; suffix = isl_union_pw_multi_aff_copy(band->pma); domain = isl_union_pw_multi_aff_domain(suffix); suffix = isl_union_pw_multi_aff_from_domain(domain); } else { isl_band_list *list; list = isl_band_get_children(band); suffix = isl_band_list_get_suffix_schedule_union_pw_multi_aff(list); isl_band_list_free(list); } return suffix; } /* Return the schedule for the forest underneath the given band. */ __isl_give isl_union_map *isl_band_get_suffix_schedule( __isl_keep isl_band *band) { isl_union_pw_multi_aff *suffix; suffix = isl_band_get_suffix_schedule_union_pw_multi_aff(band); return isl_union_map_from_union_pw_multi_aff(suffix); } /* Call "fn" on each band (recursively) in the list * in depth-first post-order. */ int isl_band_list_foreach_band(__isl_keep isl_band_list *list, int (*fn)(__isl_keep isl_band *band, void *user), void *user) { int i, n; if (!list) return -1; n = isl_band_list_n_band(list); for (i = 0; i < n; ++i) { isl_band *band; int r = 0; band = isl_band_list_get_band(list, i); if (isl_band_has_children(band)) { isl_band_list *children; children = isl_band_get_children(band); r = isl_band_list_foreach_band(children, fn, user); isl_band_list_free(children); } if (!band) r = -1; if (r == 0) r = fn(band, user); isl_band_free(band); if (r) return r; } return 0; } /* Internal data used during the construction of the schedule * for the tile loops. * * sizes contains the tile sizes * scale is set if the tile loops should be scaled * tiled collects the result for a single statement * res collects the result for all statements */ struct isl_band_tile_data { isl_multi_val *sizes; isl_union_pw_multi_aff *res; isl_pw_multi_aff *tiled; int scale; }; /* Given part of the schedule of a band, construct the corresponding * schedule for the tile loops based on the tile sizes in data->sizes * and add the result to data->tiled. * * If data->scale is set, then dimension i of the schedule will be * of the form * * m_i * floor(s_i(x) / m_i) * * where s_i(x) refers to the original schedule and m_i is the tile size. * If data->scale is not set, then dimension i of the schedule will be * of the form * * floor(s_i(x) / m_i) * */ static int multi_aff_tile(__isl_take isl_set *set, __isl_take isl_multi_aff *ma, void *user) { struct isl_band_tile_data *data = user; isl_pw_multi_aff *pma; int i, n; isl_val *v; n = isl_multi_aff_dim(ma, isl_dim_out); for (i = 0; i < n; ++i) { isl_aff *aff; aff = isl_multi_aff_get_aff(ma, i); v = isl_multi_val_get_val(data->sizes, i); aff = isl_aff_scale_down_val(aff, isl_val_copy(v)); aff = isl_aff_floor(aff); if (data->scale) aff = isl_aff_scale_val(aff, isl_val_copy(v)); isl_val_free(v); ma = isl_multi_aff_set_aff(ma, i, aff); } pma = isl_pw_multi_aff_alloc(set, ma); data->tiled = isl_pw_multi_aff_union_add(data->tiled, pma); return 0; } /* Given part of the schedule of a band, construct the corresponding * schedule for the tile loops based on the tile sizes in data->sizes * and add the result to data->res. */ static int pw_multi_aff_tile(__isl_take isl_pw_multi_aff *pma, void *user) { struct isl_band_tile_data *data = user; data->tiled = isl_pw_multi_aff_empty(isl_pw_multi_aff_get_space(pma)); if (isl_pw_multi_aff_foreach_piece(pma, &multi_aff_tile, data) < 0) goto error; isl_pw_multi_aff_free(pma); data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, data->tiled); return 0; error: isl_pw_multi_aff_free(pma); isl_pw_multi_aff_free(data->tiled); return -1; } /* Given the schedule of a band, construct the corresponding * schedule for the tile loops based on the given tile sizes * and return the result. */ static isl_union_pw_multi_aff *isl_union_pw_multi_aff_tile( __isl_take isl_union_pw_multi_aff *sched, __isl_keep isl_multi_val *sizes) { isl_ctx *ctx; isl_space *space; struct isl_band_tile_data data = { sizes }; ctx = isl_multi_val_get_ctx(sizes); space = isl_union_pw_multi_aff_get_space(sched); data.res = isl_union_pw_multi_aff_empty(space); data.scale = isl_options_get_tile_scale_tile_loops(ctx); if (isl_union_pw_multi_aff_foreach_pw_multi_aff(sched, &pw_multi_aff_tile, &data) < 0) goto error; isl_union_pw_multi_aff_free(sched); return data.res; error: isl_union_pw_multi_aff_free(sched); isl_union_pw_multi_aff_free(data.res); return NULL; } /* Extract the range space from "pma" and store it in *user. * All entries are expected to have the same range space, so we can * stop after extracting the range space from the first entry. */ static int extract_range_space(__isl_take isl_pw_multi_aff *pma, void *user) { isl_space **space = user; *space = isl_space_range(isl_pw_multi_aff_get_space(pma)); isl_pw_multi_aff_free(pma); return -1; } /* Extract the range space of "band". All entries in band->pma should * have the same range space. Furthermore, band->pma should have at least * one entry. */ static __isl_give isl_space *band_get_range_space(__isl_keep isl_band *band) { isl_space *space; if (!band) return NULL; space = NULL; isl_union_pw_multi_aff_foreach_pw_multi_aff(band->pma, &extract_range_space, &space); return space; } /* Construct and return an isl_multi_val in the given space, with as entries * the first elements of "v", padded with ones if the size of "v" is smaller * than the dimension of "space". */ static __isl_give isl_multi_val *multi_val_from_vec(__isl_take isl_space *space, __isl_take isl_vec *v) { isl_ctx *ctx; isl_multi_val *mv; int i, n, size; if (!space || !v) goto error; ctx = isl_space_get_ctx(space); mv = isl_multi_val_zero(space); n = isl_multi_val_dim(mv, isl_dim_set); size = isl_vec_size(v); if (n < size) size = n; for (i = 0; i < size; ++i) { isl_val *val = isl_vec_get_element_val(v, i); mv = isl_multi_val_set_val(mv, i, val); } for (i = size; i < n; ++i) mv = isl_multi_val_set_val(mv, i, isl_val_one(ctx)); isl_vec_free(v); return mv; error: isl_space_free(space); isl_vec_free(v); return NULL; } /* Tile the given band using the specified tile sizes. * The given band is modified to refer to the tile loops and * a child band is created to refer to the point loops. * The children of this point loop band are the children * of the original band. * * If the scale tile loops option is set, then the tile loops * are scaled by the tile sizes. If the shift point loops option is set, * then the point loops are shifted to start at zero. * In particular, these options affect the tile and point loop schedules * as follows * * scale shift original tile point * * 0 0 i floor(i/s) i * 1 0 i s * floor(i/s) i * 0 1 i floor(i/s) i - s * floor(i/s) * 1 1 i s * floor(i/s) i - s * floor(i/s) */ int isl_band_tile(__isl_keep isl_band *band, __isl_take isl_vec *sizes) { isl_ctx *ctx; isl_band *child; isl_band_list *list = NULL; isl_union_pw_multi_aff *sched = NULL, *child_sched = NULL; isl_space *space; isl_multi_val *mv_sizes; if (!band || !sizes) goto error; ctx = isl_vec_get_ctx(sizes); child = isl_band_dup(band); list = isl_band_list_alloc(ctx, 1); list = isl_band_list_add(list, child); if (!list) goto error; space = band_get_range_space(band); mv_sizes = multi_val_from_vec(space, isl_vec_copy(sizes)); sched = isl_union_pw_multi_aff_copy(band->pma); sched = isl_union_pw_multi_aff_tile(sched, mv_sizes); child_sched = isl_union_pw_multi_aff_copy(child->pma); if (isl_options_get_tile_shift_point_loops(ctx)) { isl_union_pw_multi_aff *scaled; scaled = isl_union_pw_multi_aff_copy(sched); if (!isl_options_get_tile_scale_tile_loops(ctx)) scaled = isl_union_pw_multi_aff_scale_multi_val(scaled, isl_multi_val_copy(mv_sizes)); child_sched = isl_union_pw_multi_aff_sub(child_sched, scaled); } isl_multi_val_free(mv_sizes); if (!sched || !child_sched) goto error; child->children = band->children; band->children = list; child->parent = band; isl_union_pw_multi_aff_free(band->pma); band->pma = sched; isl_union_pw_multi_aff_free(child->pma); child->pma = child_sched; isl_vec_free(sizes); return 0; error: isl_union_pw_multi_aff_free(sched); isl_union_pw_multi_aff_free(child_sched); isl_band_list_free(list); isl_vec_free(sizes); return -1; } /* Internal data structure used inside isl_union_pw_multi_aff_drop. * * "pos" is the position of the first dimension to drop. * "n" is the number of dimensions to drop. * "res" accumulates the result. */ struct isl_union_pw_multi_aff_drop_data { int pos; int n; isl_union_pw_multi_aff *res; }; /* Drop the data->n output dimensions starting at data->pos from "pma" * and add the result to data->res. */ static int pw_multi_aff_drop(__isl_take isl_pw_multi_aff *pma, void *user) { struct isl_union_pw_multi_aff_drop_data *data = user; pma = isl_pw_multi_aff_drop_dims(pma, isl_dim_out, data->pos, data->n); data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma); if (!data->res) return -1; return 0; } /* Drop the "n" output dimensions starting at "pos" from "sched". */ static isl_union_pw_multi_aff *isl_union_pw_multi_aff_drop( __isl_take isl_union_pw_multi_aff *sched, int pos, int n) { isl_space *space; struct isl_union_pw_multi_aff_drop_data data = { pos, n }; space = isl_union_pw_multi_aff_get_space(sched); data.res = isl_union_pw_multi_aff_empty(space); if (isl_union_pw_multi_aff_foreach_pw_multi_aff(sched, &pw_multi_aff_drop, &data) < 0) data.res = isl_union_pw_multi_aff_free(data.res); isl_union_pw_multi_aff_free(sched); return data.res; } /* Drop the "n" dimensions starting at "pos" from "band". */ static int isl_band_drop(__isl_keep isl_band *band, int pos, int n) { int i; isl_union_pw_multi_aff *sched; if (!band) return -1; if (n == 0) return 0; sched = isl_union_pw_multi_aff_copy(band->pma); sched = isl_union_pw_multi_aff_drop(sched, pos, n); if (!sched) return -1; isl_union_pw_multi_aff_free(band->pma); band->pma = sched; for (i = pos + n; i < band->n; ++i) band->zero[i - n] = band->zero[i]; band->n -= n; return 0; } /* Split the given band into two nested bands, one with the first "pos" * dimensions of "band" and one with the remaining band->n - pos dimensions. */ int isl_band_split(__isl_keep isl_band *band, int pos) { isl_ctx *ctx; isl_band *child; isl_band_list *list; if (!band) return -1; ctx = isl_band_get_ctx(band); if (pos < 0 || pos > band->n) isl_die(ctx, isl_error_invalid, "position out of bounds", return -1); child = isl_band_dup(band); if (isl_band_drop(child, 0, pos) < 0) child = isl_band_free(child); list = isl_band_list_alloc(ctx, 1); list = isl_band_list_add(list, child); if (!list) return -1; if (isl_band_drop(band, pos, band->n - pos) < 0) { isl_band_list_free(list); return -1; } child->children = band->children; band->children = list; child->parent = band; return 0; } __isl_give isl_printer *isl_printer_print_band(__isl_take isl_printer *p, __isl_keep isl_band *band) { isl_union_map *prefix, *partial, *suffix; prefix = isl_band_get_prefix_schedule(band); partial = isl_band_get_partial_schedule(band); suffix = isl_band_get_suffix_schedule(band); p = isl_printer_print_str(p, "("); p = isl_printer_print_union_map(p, prefix); p = isl_printer_print_str(p, ","); p = isl_printer_print_union_map(p, partial); p = isl_printer_print_str(p, ","); p = isl_printer_print_union_map(p, suffix); p = isl_printer_print_str(p, ")"); isl_union_map_free(prefix); isl_union_map_free(partial); isl_union_map_free(suffix); return p; } cloog-0.18.2/isl/isl_printer_private.h0000664000175000017500000000043012254313240014645 00000000000000#include struct isl_printer_ops; struct isl_printer { struct isl_ctx *ctx; struct isl_printer_ops *ops; FILE *file; int buf_n; int buf_size; char *buf; int indent; int output_format; const char *prefix; const char *suffix; int width; }; cloog-0.18.2/isl/isl_morph.h0000664000175000017500000000511112254313240012556 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #ifndef ISL_MORHP_H #define ISL_MORHP_H #include #include #include #include #if defined(__cplusplus) extern "C" { #endif /* An isl_morph is a "morphism" on (basic) sets. * "map" is an affine mapping from "dom" to "ran" * and "inv" is the inverse mapping. */ struct isl_morph { int ref; isl_basic_set *dom; isl_basic_set *ran; isl_mat *map; isl_mat *inv; }; typedef struct isl_morph isl_morph; __isl_give isl_morph *isl_morph_alloc( __isl_take isl_basic_set *dom, __isl_take isl_basic_set *ran, __isl_take isl_mat *map, __isl_take isl_mat *inv); __isl_give isl_morph *isl_morph_copy(__isl_keep isl_morph *morph); __isl_give isl_morph *isl_morph_identity(__isl_keep isl_basic_set *bset); void isl_morph_free(__isl_take isl_morph *morph); __isl_give isl_space *isl_morph_get_ran_space(__isl_keep isl_morph *morph); unsigned isl_morph_dom_dim(__isl_keep isl_morph *morph, enum isl_dim_type type); unsigned isl_morph_ran_dim(__isl_keep isl_morph *morph, enum isl_dim_type type); __isl_give isl_morph *isl_morph_remove_dom_dims(__isl_take isl_morph *morph, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_morph *isl_morph_remove_ran_dims(__isl_take isl_morph *morph, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_morph *isl_morph_dom_params(__isl_take isl_morph *morph); __isl_give isl_morph *isl_morph_ran_params(__isl_take isl_morph *morph); __isl_give isl_morph *isl_morph_compose(__isl_take isl_morph *morph1, __isl_take isl_morph *morph2); __isl_give isl_morph *isl_morph_inverse(__isl_take isl_morph *morph); void isl_morph_print_internal(__isl_take isl_morph *morph, FILE *out); void isl_morph_dump(__isl_take isl_morph *morph); __isl_give isl_morph *isl_basic_set_variable_compression( __isl_keep isl_basic_set *bset, enum isl_dim_type type); __isl_give isl_morph *isl_basic_set_parameter_compression( __isl_keep isl_basic_set *bset); __isl_give isl_morph *isl_basic_set_full_compression( __isl_keep isl_basic_set *bset); __isl_give isl_basic_set *isl_morph_basic_set(__isl_take isl_morph *morph, __isl_take isl_basic_set *bset); __isl_give isl_set *isl_morph_set(__isl_take isl_morph *morph, __isl_take isl_set *set); __isl_give isl_vec *isl_morph_vec(__isl_take isl_morph *morph, __isl_take isl_vec *vec); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/isl_map_simplify.c0000664000175000017500000024142212254313240014124 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include "isl_equalities.h" #include #include #include "isl_tab.h" #include #include static void swap_equality(struct isl_basic_map *bmap, int a, int b) { isl_int *t = bmap->eq[a]; bmap->eq[a] = bmap->eq[b]; bmap->eq[b] = t; } static void swap_inequality(struct isl_basic_map *bmap, int a, int b) { if (a != b) { isl_int *t = bmap->ineq[a]; bmap->ineq[a] = bmap->ineq[b]; bmap->ineq[b] = t; } } static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem) { isl_seq_cpy(c, c + n, rem); isl_seq_clr(c + rem, n); } /* Drop n dimensions starting at first. * * In principle, this frees up some extra variables as the number * of columns remains constant, but we would have to extend * the div array too as the number of rows in this array is assumed * to be equal to extra. */ struct isl_basic_set *isl_basic_set_drop_dims( struct isl_basic_set *bset, unsigned first, unsigned n) { int i; if (!bset) goto error; isl_assert(bset->ctx, first + n <= bset->dim->n_out, goto error); if (n == 0 && !isl_space_get_tuple_name(bset->dim, isl_dim_set)) return bset; bset = isl_basic_set_cow(bset); if (!bset) return NULL; for (i = 0; i < bset->n_eq; ++i) constraint_drop_vars(bset->eq[i]+1+bset->dim->nparam+first, n, (bset->dim->n_out-first-n)+bset->extra); for (i = 0; i < bset->n_ineq; ++i) constraint_drop_vars(bset->ineq[i]+1+bset->dim->nparam+first, n, (bset->dim->n_out-first-n)+bset->extra); for (i = 0; i < bset->n_div; ++i) constraint_drop_vars(bset->div[i]+1+1+bset->dim->nparam+first, n, (bset->dim->n_out-first-n)+bset->extra); bset->dim = isl_space_drop_outputs(bset->dim, first, n); if (!bset->dim) goto error; ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED); bset = isl_basic_set_simplify(bset); return isl_basic_set_finalize(bset); error: isl_basic_set_free(bset); return NULL; } struct isl_set *isl_set_drop_dims( struct isl_set *set, unsigned first, unsigned n) { int i; if (!set) goto error; isl_assert(set->ctx, first + n <= set->dim->n_out, goto error); if (n == 0 && !isl_space_get_tuple_name(set->dim, isl_dim_set)) return set; set = isl_set_cow(set); if (!set) goto error; set->dim = isl_space_drop_outputs(set->dim, first, n); if (!set->dim) goto error; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n); if (!set->p[i]) goto error; } ISL_F_CLR(set, ISL_SET_NORMALIZED); return set; error: isl_set_free(set); return NULL; } /* Move "n" divs starting at "first" to the end of the list of divs. */ static struct isl_basic_map *move_divs_last(struct isl_basic_map *bmap, unsigned first, unsigned n) { isl_int **div; int i; if (first + n == bmap->n_div) return bmap; div = isl_alloc_array(bmap->ctx, isl_int *, n); if (!div) goto error; for (i = 0; i < n; ++i) div[i] = bmap->div[first + i]; for (i = 0; i < bmap->n_div - first - n; ++i) bmap->div[first + i] = bmap->div[first + n + i]; for (i = 0; i < n; ++i) bmap->div[bmap->n_div - n + i] = div[i]; free(div); return bmap; error: isl_basic_map_free(bmap); return NULL; } /* Drop "n" dimensions of type "type" starting at "first". * * In principle, this frees up some extra variables as the number * of columns remains constant, but we would have to extend * the div array too as the number of rows in this array is assumed * to be equal to extra. */ struct isl_basic_map *isl_basic_map_drop(struct isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { int i; unsigned dim; unsigned offset; unsigned left; if (!bmap) goto error; dim = isl_basic_map_dim(bmap, type); isl_assert(bmap->ctx, first + n <= dim, goto error); if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type)) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; offset = isl_basic_map_offset(bmap, type) + first; left = isl_basic_map_total_dim(bmap) - (offset - 1) - n; for (i = 0; i < bmap->n_eq; ++i) constraint_drop_vars(bmap->eq[i]+offset, n, left); for (i = 0; i < bmap->n_ineq; ++i) constraint_drop_vars(bmap->ineq[i]+offset, n, left); for (i = 0; i < bmap->n_div; ++i) constraint_drop_vars(bmap->div[i]+1+offset, n, left); if (type == isl_dim_div) { bmap = move_divs_last(bmap, first, n); if (!bmap) goto error; isl_basic_map_free_div(bmap, n); } else bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n); if (!bmap->dim) goto error; ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_drop(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_basic_set *)isl_basic_map_drop((isl_basic_map *)bset, type, first, n); } struct isl_basic_map *isl_basic_map_drop_inputs( struct isl_basic_map *bmap, unsigned first, unsigned n) { return isl_basic_map_drop(bmap, isl_dim_in, first, n); } struct isl_map *isl_map_drop(struct isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!map) goto error; isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error); if (n == 0 && !isl_space_get_tuple_name(map->dim, type)) return map; map = isl_map_cow(map); if (!map) goto error; map->dim = isl_space_drop_dims(map->dim, type, first, n); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_drop(map->p[i], type, first, n); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } struct isl_set *isl_set_drop(struct isl_set *set, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_set *)isl_map_drop((isl_map *)set, type, first, n); } struct isl_map *isl_map_drop_inputs( struct isl_map *map, unsigned first, unsigned n) { return isl_map_drop(map, isl_dim_in, first, n); } /* * We don't cow, as the div is assumed to be redundant. */ static struct isl_basic_map *isl_basic_map_drop_div( struct isl_basic_map *bmap, unsigned div) { int i; unsigned pos; if (!bmap) goto error; pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div; isl_assert(bmap->ctx, div < bmap->n_div, goto error); for (i = 0; i < bmap->n_eq; ++i) constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1); for (i = 0; i < bmap->n_ineq; ++i) { if (!isl_int_is_zero(bmap->ineq[i][pos])) { isl_basic_map_drop_inequality(bmap, i); --i; continue; } constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1); } for (i = 0; i < bmap->n_div; ++i) constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1); if (div != bmap->n_div - 1) { int j; isl_int *t = bmap->div[div]; for (j = div; j < bmap->n_div - 1; ++j) bmap->div[j] = bmap->div[j+1]; bmap->div[bmap->n_div - 1] = t; } ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); isl_basic_map_free_div(bmap, 1); return bmap; error: isl_basic_map_free(bmap); return NULL; } struct isl_basic_map *isl_basic_map_normalize_constraints( struct isl_basic_map *bmap) { int i; isl_int gcd; unsigned total = isl_basic_map_total_dim(bmap); if (!bmap) return NULL; isl_int_init(gcd); for (i = bmap->n_eq - 1; i >= 0; --i) { isl_seq_gcd(bmap->eq[i]+1, total, &gcd); if (isl_int_is_zero(gcd)) { if (!isl_int_is_zero(bmap->eq[i][0])) { bmap = isl_basic_map_set_to_empty(bmap); break; } isl_basic_map_drop_equality(bmap, i); continue; } if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) isl_int_gcd(gcd, gcd, bmap->eq[i][0]); if (isl_int_is_one(gcd)) continue; if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) { bmap = isl_basic_map_set_to_empty(bmap); break; } isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total); } for (i = bmap->n_ineq - 1; i >= 0; --i) { isl_seq_gcd(bmap->ineq[i]+1, total, &gcd); if (isl_int_is_zero(gcd)) { if (isl_int_is_neg(bmap->ineq[i][0])) { bmap = isl_basic_map_set_to_empty(bmap); break; } isl_basic_map_drop_inequality(bmap, i); continue; } if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) isl_int_gcd(gcd, gcd, bmap->ineq[i][0]); if (isl_int_is_one(gcd)) continue; isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd); isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total); } isl_int_clear(gcd); return bmap; } struct isl_basic_set *isl_basic_set_normalize_constraints( struct isl_basic_set *bset) { return (struct isl_basic_set *)isl_basic_map_normalize_constraints( (struct isl_basic_map *)bset); } /* Remove any common factor in numerator and denominator of the div expression, * not taking into account the constant term. * That is, if the div is of the form * * floor((a + m f(x))/(m d)) * * then replace it by * * floor((floor(a/m) + f(x))/d) * * The difference {a/m}/d in the argument satisfies 0 <= {a/m}/d < 1/d * and can therefore not influence the result of the floor. */ static void normalize_div_expression(__isl_keep isl_basic_map *bmap, int div) { unsigned total = isl_basic_map_total_dim(bmap); isl_ctx *ctx = bmap->ctx; if (isl_int_is_zero(bmap->div[div][0])) return; isl_seq_gcd(bmap->div[div] + 2, total, &ctx->normalize_gcd); isl_int_gcd(ctx->normalize_gcd, ctx->normalize_gcd, bmap->div[div][0]); if (isl_int_is_one(ctx->normalize_gcd)) return; isl_int_fdiv_q(bmap->div[div][1], bmap->div[div][1], ctx->normalize_gcd); isl_int_divexact(bmap->div[div][0], bmap->div[div][0], ctx->normalize_gcd); isl_seq_scale_down(bmap->div[div] + 2, bmap->div[div] + 2, ctx->normalize_gcd, total); } /* Remove any common factor in numerator and denominator of a div expression, * not taking into account the constant term. * That is, look for any div of the form * * floor((a + m f(x))/(m d)) * * and replace it by * * floor((floor(a/m) + f(x))/d) * * The difference {a/m}/d in the argument satisfies 0 <= {a/m}/d < 1/d * and can therefore not influence the result of the floor. */ static __isl_give isl_basic_map *normalize_div_expressions( __isl_take isl_basic_map *bmap) { int i; if (!bmap) return NULL; if (bmap->n_div == 0) return bmap; for (i = 0; i < bmap->n_div; ++i) normalize_div_expression(bmap, i); return bmap; } /* Assumes divs have been ordered if keep_divs is set. */ static void eliminate_var_using_equality(struct isl_basic_map *bmap, unsigned pos, isl_int *eq, int keep_divs, int *progress) { unsigned total; unsigned space_total; int k; int last_div; total = isl_basic_map_total_dim(bmap); space_total = isl_space_dim(bmap->dim, isl_dim_all); last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div); for (k = 0; k < bmap->n_eq; ++k) { if (bmap->eq[k] == eq) continue; if (isl_int_is_zero(bmap->eq[k][1+pos])) continue; if (progress) *progress = 1; isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL); isl_seq_normalize(bmap->ctx, bmap->eq[k], 1 + total); } for (k = 0; k < bmap->n_ineq; ++k) { if (isl_int_is_zero(bmap->ineq[k][1+pos])) continue; if (progress) *progress = 1; isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL); isl_seq_normalize(bmap->ctx, bmap->ineq[k], 1 + total); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); } for (k = 0; k < bmap->n_div; ++k) { if (isl_int_is_zero(bmap->div[k][0])) continue; if (isl_int_is_zero(bmap->div[k][1+1+pos])) continue; if (progress) *progress = 1; /* We need to be careful about circular definitions, * so for now we just remove the definition of div k * if the equality contains any divs. * If keep_divs is set, then the divs have been ordered * and we can keep the definition as long as the result * is still ordered. */ if (last_div == -1 || (keep_divs && last_div < k)) { isl_seq_elim(bmap->div[k]+1, eq, 1+pos, 1+total, &bmap->div[k][0]); normalize_div_expression(bmap, k); } else isl_seq_clr(bmap->div[k], 1 + total); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); } } /* Assumes divs have been ordered if keep_divs is set. */ static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div, int keep_divs) { unsigned pos = isl_space_dim(bmap->dim, isl_dim_all) + div; eliminate_var_using_equality(bmap, pos, eq, keep_divs, NULL); isl_basic_map_drop_div(bmap, div); } /* Check if elimination of div "div" using equality "eq" would not * result in a div depending on a later div. */ static int ok_to_eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div) { int k; int last_div; unsigned space_total = isl_space_dim(bmap->dim, isl_dim_all); unsigned pos = space_total + div; last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div); if (last_div < 0 || last_div <= div) return 1; for (k = 0; k <= last_div; ++k) { if (isl_int_is_zero(bmap->div[k][0])) return 1; if (!isl_int_is_zero(bmap->div[k][1 + 1 + pos])) return 0; } return 1; } /* Elimininate divs based on equalities */ static struct isl_basic_map *eliminate_divs_eq( struct isl_basic_map *bmap, int *progress) { int d; int i; int modified = 0; unsigned off; bmap = isl_basic_map_order_divs(bmap); if (!bmap) return NULL; off = 1 + isl_space_dim(bmap->dim, isl_dim_all); for (d = bmap->n_div - 1; d >= 0 ; --d) { for (i = 0; i < bmap->n_eq; ++i) { if (!isl_int_is_one(bmap->eq[i][off + d]) && !isl_int_is_negone(bmap->eq[i][off + d])) continue; if (!ok_to_eliminate_div(bmap, bmap->eq[i], d)) continue; modified = 1; *progress = 1; eliminate_div(bmap, bmap->eq[i], d, 1); isl_basic_map_drop_equality(bmap, i); break; } } if (modified) return eliminate_divs_eq(bmap, progress); return bmap; } /* Elimininate divs based on inequalities */ static struct isl_basic_map *eliminate_divs_ineq( struct isl_basic_map *bmap, int *progress) { int d; int i; unsigned off; struct isl_ctx *ctx; if (!bmap) return NULL; ctx = bmap->ctx; off = 1 + isl_space_dim(bmap->dim, isl_dim_all); for (d = bmap->n_div - 1; d >= 0 ; --d) { for (i = 0; i < bmap->n_eq; ++i) if (!isl_int_is_zero(bmap->eq[i][off + d])) break; if (i < bmap->n_eq) continue; for (i = 0; i < bmap->n_ineq; ++i) if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one)) break; if (i < bmap->n_ineq) continue; *progress = 1; bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1); if (!bmap || ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) break; bmap = isl_basic_map_drop_div(bmap, d); if (!bmap) break; } return bmap; } struct isl_basic_map *isl_basic_map_gauss( struct isl_basic_map *bmap, int *progress) { int k; int done; int last_var; unsigned total_var; unsigned total; bmap = isl_basic_map_order_divs(bmap); if (!bmap) return NULL; total = isl_basic_map_total_dim(bmap); total_var = total - bmap->n_div; last_var = total - 1; for (done = 0; done < bmap->n_eq; ++done) { for (; last_var >= 0; --last_var) { for (k = done; k < bmap->n_eq; ++k) if (!isl_int_is_zero(bmap->eq[k][1+last_var])) break; if (k < bmap->n_eq) break; } if (last_var < 0) break; if (k != done) swap_equality(bmap, k, done); if (isl_int_is_neg(bmap->eq[done][1+last_var])) isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total); eliminate_var_using_equality(bmap, last_var, bmap->eq[done], 1, progress); if (last_var >= total_var && isl_int_is_zero(bmap->div[last_var - total_var][0])) { unsigned div = last_var - total_var; isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total); isl_int_set_si(bmap->div[div][1+1+last_var], 0); isl_int_set(bmap->div[div][0], bmap->eq[done][1+last_var]); if (progress) *progress = 1; ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); } } if (done == bmap->n_eq) return bmap; for (k = done; k < bmap->n_eq; ++k) { if (isl_int_is_zero(bmap->eq[k][0])) continue; return isl_basic_map_set_to_empty(bmap); } isl_basic_map_free_equality(bmap, bmap->n_eq-done); return bmap; } struct isl_basic_set *isl_basic_set_gauss( struct isl_basic_set *bset, int *progress) { return (struct isl_basic_set*)isl_basic_map_gauss( (struct isl_basic_map *)bset, progress); } static unsigned int round_up(unsigned int v) { int old_v = v; while (v) { old_v = v; v ^= v & -v; } return old_v << 1; } static int hash_index(isl_int ***index, unsigned int size, int bits, struct isl_basic_map *bmap, int k) { int h; unsigned total = isl_basic_map_total_dim(bmap); uint32_t hash = isl_seq_get_hash_bits(bmap->ineq[k]+1, total, bits); for (h = hash; index[h]; h = (h+1) % size) if (&bmap->ineq[k] != index[h] && isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total)) break; return h; } static int set_hash_index(isl_int ***index, unsigned int size, int bits, struct isl_basic_set *bset, int k) { return hash_index(index, size, bits, (struct isl_basic_map *)bset, k); } /* If we can eliminate more than one div, then we need to make * sure we do it from last div to first div, in order not to * change the position of the other divs that still need to * be removed. */ static struct isl_basic_map *remove_duplicate_divs( struct isl_basic_map *bmap, int *progress) { unsigned int size; int *index; int *elim_for; int k, l, h; int bits; struct isl_blk eq; unsigned total_var; unsigned total; struct isl_ctx *ctx; bmap = isl_basic_map_order_divs(bmap); if (!bmap || bmap->n_div <= 1) return bmap; total_var = isl_space_dim(bmap->dim, isl_dim_all); total = total_var + bmap->n_div; ctx = bmap->ctx; for (k = bmap->n_div - 1; k >= 0; --k) if (!isl_int_is_zero(bmap->div[k][0])) break; if (k <= 0) return bmap; elim_for = isl_calloc_array(ctx, int, bmap->n_div); size = round_up(4 * bmap->n_div / 3 - 1); bits = ffs(size) - 1; index = isl_calloc_array(ctx, int, size); if (!index) return bmap; eq = isl_blk_alloc(ctx, 1+total); if (isl_blk_is_error(eq)) goto out; isl_seq_clr(eq.data, 1+total); index[isl_seq_get_hash_bits(bmap->div[k], 2+total, bits)] = k + 1; for (--k; k >= 0; --k) { uint32_t hash; if (isl_int_is_zero(bmap->div[k][0])) continue; hash = isl_seq_get_hash_bits(bmap->div[k], 2+total, bits); for (h = hash; index[h]; h = (h+1) % size) if (isl_seq_eq(bmap->div[k], bmap->div[index[h]-1], 2+total)) break; if (index[h]) { *progress = 1; l = index[h] - 1; elim_for[l] = k + 1; } index[h] = k+1; } for (l = bmap->n_div - 1; l >= 0; --l) { if (!elim_for[l]) continue; k = elim_for[l] - 1; isl_int_set_si(eq.data[1+total_var+k], -1); isl_int_set_si(eq.data[1+total_var+l], 1); eliminate_div(bmap, eq.data, l, 1); isl_int_set_si(eq.data[1+total_var+k], 0); isl_int_set_si(eq.data[1+total_var+l], 0); } isl_blk_free(ctx, eq); out: free(index); free(elim_for); return bmap; } static int n_pure_div_eq(struct isl_basic_map *bmap) { int i, j; unsigned total; total = isl_space_dim(bmap->dim, isl_dim_all); for (i = 0, j = bmap->n_div-1; i < bmap->n_eq; ++i) { while (j >= 0 && isl_int_is_zero(bmap->eq[i][1 + total + j])) --j; if (j < 0) break; if (isl_seq_first_non_zero(bmap->eq[i] + 1 + total, j) != -1) return 0; } return i; } /* Normalize divs that appear in equalities. * * In particular, we assume that bmap contains some equalities * of the form * * a x = m * e_i * * and we want to replace the set of e_i by a minimal set and * such that the new e_i have a canonical representation in terms * of the vector x. * If any of the equalities involves more than one divs, then * we currently simply bail out. * * Let us first additionally assume that all equalities involve * a div. The equalities then express modulo constraints on the * remaining variables and we can use "parameter compression" * to find a minimal set of constraints. The result is a transformation * * x = T(x') = x_0 + G x' * * with G a lower-triangular matrix with all elements below the diagonal * non-negative and smaller than the diagonal element on the same row. * We first normalize x_0 by making the same property hold in the affine * T matrix. * The rows i of G with a 1 on the diagonal do not impose any modulo * constraint and simply express x_i = x'_i. * For each of the remaining rows i, we introduce a div and a corresponding * equality. In particular * * g_ii e_j = x_i - g_i(x') * * where each x'_k is replaced either by x_k (if g_kk = 1) or the * corresponding div (if g_kk != 1). * * If there are any equalities not involving any div, then we * first apply a variable compression on the variables x: * * x = C x'' x'' = C_2 x * * and perform the above parameter compression on A C instead of on A. * The resulting compression is then of the form * * x'' = T(x') = x_0 + G x' * * and in constructing the new divs and the corresponding equalities, * we have to replace each x'', i.e., the x'_k with (g_kk = 1), * by the corresponding row from C_2. */ static struct isl_basic_map *normalize_divs( struct isl_basic_map *bmap, int *progress) { int i, j, k; int total; int div_eq; struct isl_mat *B; struct isl_vec *d; struct isl_mat *T = NULL; struct isl_mat *C = NULL; struct isl_mat *C2 = NULL; isl_int v; int *pos; int dropped, needed; if (!bmap) return NULL; if (bmap->n_div == 0) return bmap; if (bmap->n_eq == 0) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS)) return bmap; total = isl_space_dim(bmap->dim, isl_dim_all); div_eq = n_pure_div_eq(bmap); if (div_eq == 0) return bmap; if (div_eq < bmap->n_eq) { B = isl_mat_sub_alloc6(bmap->ctx, bmap->eq, div_eq, bmap->n_eq - div_eq, 0, 1 + total); C = isl_mat_variable_compression(B, &C2); if (!C || !C2) goto error; if (C->n_col == 0) { bmap = isl_basic_map_set_to_empty(bmap); isl_mat_free(C); isl_mat_free(C2); goto done; } } d = isl_vec_alloc(bmap->ctx, div_eq); if (!d) goto error; for (i = 0, j = bmap->n_div-1; i < div_eq; ++i) { while (j >= 0 && isl_int_is_zero(bmap->eq[i][1 + total + j])) --j; isl_int_set(d->block.data[i], bmap->eq[i][1 + total + j]); } B = isl_mat_sub_alloc6(bmap->ctx, bmap->eq, 0, div_eq, 0, 1 + total); if (C) { B = isl_mat_product(B, C); C = NULL; } T = isl_mat_parameter_compression(B, d); if (!T) goto error; if (T->n_col == 0) { bmap = isl_basic_map_set_to_empty(bmap); isl_mat_free(C2); isl_mat_free(T); goto done; } isl_int_init(v); for (i = 0; i < T->n_row - 1; ++i) { isl_int_fdiv_q(v, T->row[1 + i][0], T->row[1 + i][1 + i]); if (isl_int_is_zero(v)) continue; isl_mat_col_submul(T, 0, v, 1 + i); } isl_int_clear(v); pos = isl_alloc_array(bmap->ctx, int, T->n_row); if (!pos) goto error; /* We have to be careful because dropping equalities may reorder them */ dropped = 0; for (j = bmap->n_div - 1; j >= 0; --j) { for (i = 0; i < bmap->n_eq; ++i) if (!isl_int_is_zero(bmap->eq[i][1 + total + j])) break; if (i < bmap->n_eq) { bmap = isl_basic_map_drop_div(bmap, j); isl_basic_map_drop_equality(bmap, i); ++dropped; } } pos[0] = 0; needed = 0; for (i = 1; i < T->n_row; ++i) { if (isl_int_is_one(T->row[i][i])) pos[i] = i; else needed++; } if (needed > dropped) { bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim), needed, needed, 0); if (!bmap) goto error; } for (i = 1; i < T->n_row; ++i) { if (isl_int_is_one(T->row[i][i])) continue; k = isl_basic_map_alloc_div(bmap); pos[i] = 1 + total + k; isl_seq_clr(bmap->div[k] + 1, 1 + total + bmap->n_div); isl_int_set(bmap->div[k][0], T->row[i][i]); if (C2) isl_seq_cpy(bmap->div[k] + 1, C2->row[i], 1 + total); else isl_int_set_si(bmap->div[k][1 + i], 1); for (j = 0; j < i; ++j) { if (isl_int_is_zero(T->row[i][j])) continue; if (pos[j] < T->n_row && C2) isl_seq_submul(bmap->div[k] + 1, T->row[i][j], C2->row[pos[j]], 1 + total); else isl_int_neg(bmap->div[k][1 + pos[j]], T->row[i][j]); } j = isl_basic_map_alloc_equality(bmap); isl_seq_neg(bmap->eq[j], bmap->div[k]+1, 1+total+bmap->n_div); isl_int_set(bmap->eq[j][pos[i]], bmap->div[k][0]); } free(pos); isl_mat_free(C2); isl_mat_free(T); if (progress) *progress = 1; done: ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS); return bmap; error: isl_mat_free(C); isl_mat_free(C2); isl_mat_free(T); return bmap; } static struct isl_basic_map *set_div_from_lower_bound( struct isl_basic_map *bmap, int div, int ineq) { unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all); isl_seq_neg(bmap->div[div] + 1, bmap->ineq[ineq], total + bmap->n_div); isl_int_set(bmap->div[div][0], bmap->ineq[ineq][total + div]); isl_int_add(bmap->div[div][1], bmap->div[div][1], bmap->div[div][0]); isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1); isl_int_set_si(bmap->div[div][1 + total + div], 0); return bmap; } /* Check whether it is ok to define a div based on an inequality. * To avoid the introduction of circular definitions of divs, we * do not allow such a definition if the resulting expression would refer to * any other undefined divs or if any known div is defined in * terms of the unknown div. */ static int ok_to_set_div_from_bound(struct isl_basic_map *bmap, int div, int ineq) { int j; unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all); /* Not defined in terms of unknown divs */ for (j = 0; j < bmap->n_div; ++j) { if (div == j) continue; if (isl_int_is_zero(bmap->ineq[ineq][total + j])) continue; if (isl_int_is_zero(bmap->div[j][0])) return 0; } /* No other div defined in terms of this one => avoid loops */ for (j = 0; j < bmap->n_div; ++j) { if (div == j) continue; if (isl_int_is_zero(bmap->div[j][0])) continue; if (!isl_int_is_zero(bmap->div[j][1 + total + div])) return 0; } return 1; } /* Would an expression for div "div" based on inequality "ineq" of "bmap" * be a better expression than the current one? * * If we do not have any expression yet, then any expression would be better. * Otherwise we check if the last variable involved in the inequality * (disregarding the div that it would define) is in an earlier position * than the last variable involved in the current div expression. */ static int better_div_constraint(__isl_keep isl_basic_map *bmap, int div, int ineq) { unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all); int last_div; int last_ineq; if (isl_int_is_zero(bmap->div[div][0])) return 1; if (isl_seq_last_non_zero(bmap->ineq[ineq] + total + div + 1, bmap->n_div - (div + 1)) >= 0) return 0; last_ineq = isl_seq_last_non_zero(bmap->ineq[ineq], total + div); last_div = isl_seq_last_non_zero(bmap->div[div] + 1, total + bmap->n_div); return last_ineq < last_div; } /* Given two constraints "k" and "l" that are opposite to each other, * except for the constant term, check if we can use them * to obtain an expression for one of the hitherto unknown divs or * a "better" expression for a div for which we already have an expression. * "sum" is the sum of the constant terms of the constraints. * If this sum is strictly smaller than the coefficient of one * of the divs, then this pair can be used define the div. * To avoid the introduction of circular definitions of divs, we * do not use the pair if the resulting expression would refer to * any other undefined divs or if any known div is defined in * terms of the unknown div. */ static struct isl_basic_map *check_for_div_constraints( struct isl_basic_map *bmap, int k, int l, isl_int sum, int *progress) { int i; unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all); for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->ineq[k][total + i])) continue; if (isl_int_abs_ge(sum, bmap->ineq[k][total + i])) continue; if (!better_div_constraint(bmap, i, k)) continue; if (!ok_to_set_div_from_bound(bmap, i, k)) break; if (isl_int_is_pos(bmap->ineq[k][total + i])) bmap = set_div_from_lower_bound(bmap, i, k); else bmap = set_div_from_lower_bound(bmap, i, l); if (progress) *progress = 1; break; } return bmap; } static struct isl_basic_map *remove_duplicate_constraints( struct isl_basic_map *bmap, int *progress, int detect_divs) { unsigned int size; isl_int ***index; int k, l, h; int bits; unsigned total = isl_basic_map_total_dim(bmap); isl_int sum; isl_ctx *ctx; if (!bmap || bmap->n_ineq <= 1) return bmap; size = round_up(4 * (bmap->n_ineq+1) / 3 - 1); bits = ffs(size) - 1; ctx = isl_basic_map_get_ctx(bmap); index = isl_calloc_array(ctx, isl_int **, size); if (!index) return bmap; index[isl_seq_get_hash_bits(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0]; for (k = 1; k < bmap->n_ineq; ++k) { h = hash_index(index, size, bits, bmap, k); if (!index[h]) { index[h] = &bmap->ineq[k]; continue; } if (progress) *progress = 1; l = index[h] - &bmap->ineq[0]; if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0])) swap_inequality(bmap, k, l); isl_basic_map_drop_inequality(bmap, k); --k; } isl_int_init(sum); for (k = 0; k < bmap->n_ineq-1; ++k) { isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total); h = hash_index(index, size, bits, bmap, k); isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total); if (!index[h]) continue; l = index[h] - &bmap->ineq[0]; isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]); if (isl_int_is_pos(sum)) { if (detect_divs) bmap = check_for_div_constraints(bmap, k, l, sum, progress); continue; } if (isl_int_is_zero(sum)) { /* We need to break out of the loop after these * changes since the contents of the hash * will no longer be valid. * Plus, we probably we want to regauss first. */ if (progress) *progress = 1; isl_basic_map_drop_inequality(bmap, l); isl_basic_map_inequality_to_equality(bmap, k); } else bmap = isl_basic_map_set_to_empty(bmap); break; } isl_int_clear(sum); free(index); return bmap; } /* Eliminate knowns divs from constraints where they appear with * a (positive or negative) unit coefficient. * * That is, replace * * floor(e/m) + f >= 0 * * by * * e + m f >= 0 * * and * * -floor(e/m) + f >= 0 * * by * * -e + m f + m - 1 >= 0 * * The first conversion is valid because floor(e/m) >= -f is equivalent * to e/m >= -f because -f is an integral expression. * The second conversion follows from the fact that * * -floor(e/m) = ceil(-e/m) = floor((-e + m - 1)/m) * * * We skip integral divs, i.e., those with denominator 1, as we would * risk eliminating the div from the div constraints. We do not need * to handle those divs here anyway since the div constraints will turn * out to form an equality and this equality can then be use to eliminate * the div from all constraints. */ static __isl_give isl_basic_map *eliminate_unit_divs( __isl_take isl_basic_map *bmap, int *progress) { int i, j; isl_ctx *ctx; unsigned total; if (!bmap) return NULL; ctx = isl_basic_map_get_ctx(bmap); total = 1 + isl_space_dim(bmap->dim, isl_dim_all); for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (isl_int_is_one(bmap->div[i][0])) continue; for (j = 0; j < bmap->n_ineq; ++j) { int s; if (!isl_int_is_one(bmap->ineq[j][total + i]) && !isl_int_is_negone(bmap->ineq[j][total + i])) continue; *progress = 1; s = isl_int_sgn(bmap->ineq[j][total + i]); isl_int_set_si(bmap->ineq[j][total + i], 0); if (s < 0) isl_seq_combine(bmap->ineq[j], ctx->negone, bmap->div[i] + 1, bmap->div[i][0], bmap->ineq[j], total + bmap->n_div); else isl_seq_combine(bmap->ineq[j], ctx->one, bmap->div[i] + 1, bmap->div[i][0], bmap->ineq[j], total + bmap->n_div); if (s < 0) { isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->div[i][0]); isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1); } } } return bmap; } struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap) { int progress = 1; if (!bmap) return NULL; while (progress) { progress = 0; if (!bmap) break; if (isl_basic_map_plain_is_empty(bmap)) break; bmap = isl_basic_map_normalize_constraints(bmap); bmap = normalize_div_expressions(bmap); bmap = remove_duplicate_divs(bmap, &progress); bmap = eliminate_unit_divs(bmap, &progress); bmap = eliminate_divs_eq(bmap, &progress); bmap = eliminate_divs_ineq(bmap, &progress); bmap = isl_basic_map_gauss(bmap, &progress); /* requires equalities in normal form */ bmap = normalize_divs(bmap, &progress); bmap = remove_duplicate_constraints(bmap, &progress, 1); } return bmap; } struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_simplify((struct isl_basic_map *)bset); } int isl_basic_map_is_div_constraint(__isl_keep isl_basic_map *bmap, isl_int *constraint, unsigned div) { unsigned pos; if (!bmap) return -1; pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div; if (isl_int_eq(constraint[pos], bmap->div[div][0])) { int neg; isl_int_sub(bmap->div[div][1], bmap->div[div][1], bmap->div[div][0]); isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1); neg = isl_seq_is_neg(constraint, bmap->div[div]+1, pos); isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1); isl_int_add(bmap->div[div][1], bmap->div[div][1], bmap->div[div][0]); if (!neg) return 0; if (isl_seq_first_non_zero(constraint+pos+1, bmap->n_div-div-1) != -1) return 0; } else if (isl_int_abs_eq(constraint[pos], bmap->div[div][0])) { if (!isl_seq_eq(constraint, bmap->div[div]+1, pos)) return 0; if (isl_seq_first_non_zero(constraint+pos+1, bmap->n_div-div-1) != -1) return 0; } else return 0; return 1; } int isl_basic_set_is_div_constraint(__isl_keep isl_basic_set *bset, isl_int *constraint, unsigned div) { return isl_basic_map_is_div_constraint(bset, constraint, div); } /* If the only constraints a div d=floor(f/m) * appears in are its two defining constraints * * f - m d >=0 * -(f - (m - 1)) + m d >= 0 * * then it can safely be removed. */ static int div_is_redundant(struct isl_basic_map *bmap, int div) { int i; unsigned pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div; for (i = 0; i < bmap->n_eq; ++i) if (!isl_int_is_zero(bmap->eq[i][pos])) return 0; for (i = 0; i < bmap->n_ineq; ++i) { if (isl_int_is_zero(bmap->ineq[i][pos])) continue; if (!isl_basic_map_is_div_constraint(bmap, bmap->ineq[i], div)) return 0; } for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (!isl_int_is_zero(bmap->div[i][1+pos])) return 0; } return 1; } /* * Remove divs that don't occur in any of the constraints or other divs. * These can arise when dropping some of the variables in a quast * returned by piplib. */ static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap) { int i; if (!bmap) return NULL; for (i = bmap->n_div-1; i >= 0; --i) { if (!div_is_redundant(bmap, i)) continue; bmap = isl_basic_map_drop_div(bmap, i); } return bmap; } struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap) { bmap = remove_redundant_divs(bmap); if (!bmap) return NULL; ISL_F_SET(bmap, ISL_BASIC_SET_FINAL); return bmap; } struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_finalize((struct isl_basic_map *)bset); } struct isl_set *isl_set_finalize(struct isl_set *set) { int i; if (!set) return NULL; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_finalize(set->p[i]); if (!set->p[i]) goto error; } return set; error: isl_set_free(set); return NULL; } struct isl_map *isl_map_finalize(struct isl_map *map) { int i; if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_finalize(map->p[i]); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } /* Remove definition of any div that is defined in terms of the given variable. * The div itself is not removed. Functions such as * eliminate_divs_ineq depend on the other divs remaining in place. */ static struct isl_basic_map *remove_dependent_vars(struct isl_basic_map *bmap, int pos) { int i; if (!bmap) return NULL; for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (isl_int_is_zero(bmap->div[i][1+1+pos])) continue; isl_int_set_si(bmap->div[i][0], 0); } return bmap; } /* Eliminate the specified variables from the constraints using * Fourier-Motzkin. The variables themselves are not removed. */ struct isl_basic_map *isl_basic_map_eliminate_vars( struct isl_basic_map *bmap, unsigned pos, unsigned n) { int d; int i, j, k; unsigned total; int need_gauss = 0; if (n == 0) return bmap; if (!bmap) return NULL; total = isl_basic_map_total_dim(bmap); bmap = isl_basic_map_cow(bmap); for (d = pos + n - 1; d >= 0 && d >= pos; --d) bmap = remove_dependent_vars(bmap, d); if (!bmap) return NULL; for (d = pos + n - 1; d >= 0 && d >= total - bmap->n_div && d >= pos; --d) isl_seq_clr(bmap->div[d-(total-bmap->n_div)], 2+total); for (d = pos + n - 1; d >= 0 && d >= pos; --d) { int n_lower, n_upper; if (!bmap) return NULL; for (i = 0; i < bmap->n_eq; ++i) { if (isl_int_is_zero(bmap->eq[i][1+d])) continue; eliminate_var_using_equality(bmap, d, bmap->eq[i], 0, NULL); isl_basic_map_drop_equality(bmap, i); need_gauss = 1; break; } if (i < bmap->n_eq) continue; n_lower = 0; n_upper = 0; for (i = 0; i < bmap->n_ineq; ++i) { if (isl_int_is_pos(bmap->ineq[i][1+d])) n_lower++; else if (isl_int_is_neg(bmap->ineq[i][1+d])) n_upper++; } bmap = isl_basic_map_extend_constraints(bmap, 0, n_lower * n_upper); if (!bmap) goto error; for (i = bmap->n_ineq - 1; i >= 0; --i) { int last; if (isl_int_is_zero(bmap->ineq[i][1+d])) continue; last = -1; for (j = 0; j < i; ++j) { if (isl_int_is_zero(bmap->ineq[j][1+d])) continue; last = j; if (isl_int_sgn(bmap->ineq[i][1+d]) == isl_int_sgn(bmap->ineq[j][1+d])) continue; k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->ineq[k], bmap->ineq[i], 1+total); isl_seq_elim(bmap->ineq[k], bmap->ineq[j], 1+d, 1+total, NULL); } isl_basic_map_drop_inequality(bmap, i); i = last + 1; } if (n_lower > 0 && n_upper > 0) { bmap = isl_basic_map_normalize_constraints(bmap); bmap = remove_duplicate_constraints(bmap, NULL, 0); bmap = isl_basic_map_gauss(bmap, NULL); bmap = isl_basic_map_remove_redundancies(bmap); need_gauss = 0; if (!bmap) goto error; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) break; } } ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); if (need_gauss) bmap = isl_basic_map_gauss(bmap, NULL); return bmap; error: isl_basic_map_free(bmap); return NULL; } struct isl_basic_set *isl_basic_set_eliminate_vars( struct isl_basic_set *bset, unsigned pos, unsigned n) { return (struct isl_basic_set *)isl_basic_map_eliminate_vars( (struct isl_basic_map *)bset, pos, n); } /* Eliminate the specified n dimensions starting at first from the * constraints, without removing the dimensions from the space. * If the set is rational, the dimensions are eliminated using Fourier-Motzkin. * Otherwise, they are projected out and the original space is restored. */ __isl_give isl_basic_map *isl_basic_map_eliminate( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { isl_space *space; if (!bmap) return NULL; if (n == 0) return bmap; if (first + n > isl_basic_map_dim(bmap, type) || first + n < first) isl_die(bmap->ctx, isl_error_invalid, "index out of bounds", goto error); if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) { first += isl_basic_map_offset(bmap, type) - 1; bmap = isl_basic_map_eliminate_vars(bmap, first, n); return isl_basic_map_finalize(bmap); } space = isl_basic_map_get_space(bmap); bmap = isl_basic_map_project_out(bmap, type, first, n); bmap = isl_basic_map_insert_dims(bmap, type, first, n); bmap = isl_basic_map_reset_space(bmap, space); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_eliminate( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return isl_basic_map_eliminate(bset, type, first, n); } /* Don't assume equalities are in order, because align_divs * may have changed the order of the divs. */ static void compute_elimination_index(struct isl_basic_map *bmap, int *elim) { int d, i; unsigned total; total = isl_space_dim(bmap->dim, isl_dim_all); for (d = 0; d < total; ++d) elim[d] = -1; for (i = 0; i < bmap->n_eq; ++i) { for (d = total - 1; d >= 0; --d) { if (isl_int_is_zero(bmap->eq[i][1+d])) continue; elim[d] = i; break; } } } static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim) { compute_elimination_index((struct isl_basic_map *)bset, elim); } static int reduced_using_equalities(isl_int *dst, isl_int *src, struct isl_basic_map *bmap, int *elim) { int d; int copied = 0; unsigned total; total = isl_space_dim(bmap->dim, isl_dim_all); for (d = total - 1; d >= 0; --d) { if (isl_int_is_zero(src[1+d])) continue; if (elim[d] == -1) continue; if (!copied) { isl_seq_cpy(dst, src, 1 + total); copied = 1; } isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL); } return copied; } static int set_reduced_using_equalities(isl_int *dst, isl_int *src, struct isl_basic_set *bset, int *elim) { return reduced_using_equalities(dst, src, (struct isl_basic_map *)bset, elim); } static struct isl_basic_set *isl_basic_set_reduce_using_equalities( struct isl_basic_set *bset, struct isl_basic_set *context) { int i; int *elim; if (!bset || !context) goto error; if (context->n_eq == 0) { isl_basic_set_free(context); return bset; } bset = isl_basic_set_cow(bset); if (!bset) goto error; elim = isl_alloc_array(bset->ctx, int, isl_basic_set_n_dim(bset)); if (!elim) goto error; set_compute_elimination_index(context, elim); for (i = 0; i < bset->n_eq; ++i) set_reduced_using_equalities(bset->eq[i], bset->eq[i], context, elim); for (i = 0; i < bset->n_ineq; ++i) set_reduced_using_equalities(bset->ineq[i], bset->ineq[i], context, elim); isl_basic_set_free(context); free(elim); bset = isl_basic_set_simplify(bset); bset = isl_basic_set_finalize(bset); return bset; error: isl_basic_set_free(bset); isl_basic_set_free(context); return NULL; } static struct isl_basic_set *remove_shifted_constraints( struct isl_basic_set *bset, struct isl_basic_set *context) { unsigned int size; isl_int ***index; int bits; int k, h, l; isl_ctx *ctx; if (!bset) return NULL; size = round_up(4 * (context->n_ineq+1) / 3 - 1); bits = ffs(size) - 1; ctx = isl_basic_set_get_ctx(bset); index = isl_calloc_array(ctx, isl_int **, size); if (!index) return bset; for (k = 0; k < context->n_ineq; ++k) { h = set_hash_index(index, size, bits, context, k); index[h] = &context->ineq[k]; } for (k = 0; k < bset->n_ineq; ++k) { h = set_hash_index(index, size, bits, bset, k); if (!index[h]) continue; l = index[h] - &context->ineq[0]; if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0])) continue; bset = isl_basic_set_cow(bset); if (!bset) goto error; isl_basic_set_drop_inequality(bset, k); --k; } free(index); return bset; error: free(index); return bset; } /* Does the (linear part of a) constraint "c" involve any of the "len" * "relevant" dimensions? */ static int is_related(isl_int *c, int len, int *relevant) { int i; for (i = 0; i < len; ++i) { if (!relevant[i]) continue; if (!isl_int_is_zero(c[i])) return 1; } return 0; } /* Drop constraints from "bset" that do not involve any of * the dimensions marked "relevant". */ static __isl_give isl_basic_set *drop_unrelated_constraints( __isl_take isl_basic_set *bset, int *relevant) { int i, dim; dim = isl_basic_set_dim(bset, isl_dim_set); for (i = 0; i < dim; ++i) if (!relevant[i]) break; if (i >= dim) return bset; for (i = bset->n_eq - 1; i >= 0; --i) if (!is_related(bset->eq[i] + 1, dim, relevant)) isl_basic_set_drop_equality(bset, i); for (i = bset->n_ineq - 1; i >= 0; --i) if (!is_related(bset->ineq[i] + 1, dim, relevant)) isl_basic_set_drop_inequality(bset, i); return bset; } /* Update the groups in "group" based on the (linear part of a) constraint "c". * * In particular, for any variable involved in the constraint, * find the actual group id from before and replace the group * of the corresponding variable by the minimal group of all * the variables involved in the constraint considered so far * (if this minimum is smaller) or replace the minimum by this group * (if the minimum is larger). * * At the end, all the variables in "c" will (indirectly) point * to the minimal of the groups that they referred to originally. */ static void update_groups(int dim, int *group, isl_int *c) { int j; int min = dim; for (j = 0; j < dim; ++j) { if (isl_int_is_zero(c[j])) continue; while (group[j] >= 0 && group[group[j]] != group[j]) group[j] = group[group[j]]; if (group[j] == min) continue; if (group[j] < min) { if (min >= 0 && min < dim) group[min] = group[j]; min = group[j]; } else group[group[j]] = min; } } /* Drop constraints from "context" that are irrelevant for computing * the gist of "bset". * * In particular, drop constraints in variables that are not related * to any of the variables involved in the constraints of "bset" * in the sense that there is no sequence of constraints that connects them. * * We construct groups of variables that collect variables that * (indirectly) appear in some common constraint of "context". * Each group is identified by the first variable in the group, * except for the special group of variables that appear in "bset" * (or are related to those variables), which is identified by -1. * If group[i] is equal to i (or -1), then the group of i is i (or -1), * otherwise the group of i is the group of group[i]. * * We first initialize the -1 group with the variables that appear in "bset". * Then we initialize groups for the remaining variables. * Then we iterate over the constraints of "context" and update the * group of the variables in the constraint by the smallest group. * Finally, we resolve indirect references to groups by running over * the variables. * * After computing the groups, we drop constraints that do not involve * any variables in the -1 group. */ static __isl_give isl_basic_set *drop_irrelevant_constraints( __isl_take isl_basic_set *context, __isl_keep isl_basic_set *bset) { isl_ctx *ctx; int *group; int dim; int i, j; int last; if (!context || !bset) return isl_basic_set_free(context); dim = isl_basic_set_dim(bset, isl_dim_set); ctx = isl_basic_set_get_ctx(bset); group = isl_calloc_array(ctx, int, dim); if (!group) goto error; for (i = 0; i < dim; ++i) { for (j = 0; j < bset->n_eq; ++j) if (!isl_int_is_zero(bset->eq[j][1 + i])) break; if (j < bset->n_eq) { group[i] = -1; continue; } for (j = 0; j < bset->n_ineq; ++j) if (!isl_int_is_zero(bset->ineq[j][1 + i])) break; if (j < bset->n_ineq) group[i] = -1; } last = -1; for (i = 0; i < dim; ++i) if (group[i] >= 0) last = group[i] = i; if (last < 0) { free(group); return context; } for (i = 0; i < context->n_eq; ++i) update_groups(dim, group, context->eq[i] + 1); for (i = 0; i < context->n_ineq; ++i) update_groups(dim, group, context->ineq[i] + 1); for (i = 0; i < dim; ++i) if (group[i] >= 0) group[i] = group[group[i]]; for (i = 0; i < dim; ++i) group[i] = group[i] == -1; context = drop_unrelated_constraints(context, group); free(group); return context; error: free(group); return isl_basic_set_free(context); } /* Remove all information from bset that is redundant in the context * of context. Both bset and context are assumed to be full-dimensional. * * We first remove the inequalities from "bset" * that are obviously redundant with respect to some inequality in "context". * Then we remove those constraints from "context" that have become * irrelevant for computing the gist of "bset". * Note that this removal of constraints cannot be replaced by * a factorization because factors in "bset" may still be connected * to each other through constraints in "context". * * If there are any inequalities left, we construct a tableau for * the context and then add the inequalities of "bset". * Before adding these inequalities, we freeze all constraints such that * they won't be considered redundant in terms of the constraints of "bset". * Then we detect all redundant constraints (among the * constraints that weren't frozen), first by checking for redundancy in the * the tableau and then by checking if replacing a constraint by its negation * would lead to an empty set. This last step is fairly expensive * and could be optimized by more reuse of the tableau. * Finally, we update bset according to the results. */ static __isl_give isl_basic_set *uset_gist_full(__isl_take isl_basic_set *bset, __isl_take isl_basic_set *context) { int i, k; isl_basic_set *combined = NULL; struct isl_tab *tab = NULL; unsigned context_ineq; unsigned total; if (!bset || !context) goto error; if (isl_basic_set_is_universe(bset)) { isl_basic_set_free(context); return bset; } if (isl_basic_set_is_universe(context)) { isl_basic_set_free(context); return bset; } bset = remove_shifted_constraints(bset, context); if (!bset) goto error; if (bset->n_ineq == 0) goto done; context = drop_irrelevant_constraints(context, bset); if (!context) goto error; if (isl_basic_set_is_universe(context)) { isl_basic_set_free(context); return bset; } context_ineq = context->n_ineq; combined = isl_basic_set_cow(isl_basic_set_copy(context)); combined = isl_basic_set_extend_constraints(combined, 0, bset->n_ineq); tab = isl_tab_from_basic_set(combined, 0); for (i = 0; i < context_ineq; ++i) if (isl_tab_freeze_constraint(tab, i) < 0) goto error; tab = isl_tab_extend(tab, bset->n_ineq); for (i = 0; i < bset->n_ineq; ++i) if (isl_tab_add_ineq(tab, bset->ineq[i]) < 0) goto error; bset = isl_basic_set_add_constraints(combined, bset, 0); combined = NULL; if (!bset) goto error; if (isl_tab_detect_redundant(tab) < 0) goto error; total = isl_basic_set_total_dim(bset); for (i = context_ineq; i < bset->n_ineq; ++i) { int is_empty; if (tab->con[i].is_redundant) continue; tab->con[i].is_redundant = 1; combined = isl_basic_set_dup(bset); combined = isl_basic_set_update_from_tab(combined, tab); combined = isl_basic_set_extend_constraints(combined, 0, 1); k = isl_basic_set_alloc_inequality(combined); if (k < 0) goto error; isl_seq_neg(combined->ineq[k], bset->ineq[i], 1 + total); isl_int_sub_ui(combined->ineq[k][0], combined->ineq[k][0], 1); is_empty = isl_basic_set_is_empty(combined); if (is_empty < 0) goto error; isl_basic_set_free(combined); combined = NULL; if (!is_empty) tab->con[i].is_redundant = 0; } for (i = 0; i < context_ineq; ++i) tab->con[i].is_redundant = 1; bset = isl_basic_set_update_from_tab(bset, tab); if (bset) { ISL_F_SET(bset, ISL_BASIC_SET_NO_IMPLICIT); ISL_F_SET(bset, ISL_BASIC_SET_NO_REDUNDANT); } isl_tab_free(tab); done: bset = isl_basic_set_simplify(bset); bset = isl_basic_set_finalize(bset); isl_basic_set_free(context); return bset; error: isl_tab_free(tab); isl_basic_set_free(combined); isl_basic_set_free(context); isl_basic_set_free(bset); return NULL; } /* Remove all information from bset that is redundant in the context * of context. In particular, equalities that are linear combinations * of those in context are removed. Then the inequalities that are * redundant in the context of the equalities and inequalities of * context are removed. * * First of all, we drop those constraints from "context" * that are irrelevant for computing the gist of "bset". * Alternatively, we could factorize the intersection of "context" and "bset". * * We first compute the integer affine hull of the intersection, * compute the gist inside this affine hull and then add back * those equalities that are not implied by the context. * * If two constraints are mutually redundant, then uset_gist_full * will remove the second of those constraints. We therefore first * sort the constraints so that constraints not involving existentially * quantified variables are given precedence over those that do. * We have to perform this sorting before the variable compression, * because that may effect the order of the variables. */ static __isl_give isl_basic_set *uset_gist(__isl_take isl_basic_set *bset, __isl_take isl_basic_set *context) { isl_mat *eq; isl_mat *T, *T2; isl_basic_set *aff; isl_basic_set *aff_context; unsigned total; if (!bset || !context) goto error; context = drop_irrelevant_constraints(context, bset); bset = isl_basic_set_intersect(bset, isl_basic_set_copy(context)); if (isl_basic_set_plain_is_empty(bset)) { isl_basic_set_free(context); return bset; } bset = isl_basic_set_sort_constraints(bset); aff = isl_basic_set_affine_hull(isl_basic_set_copy(bset)); if (!aff) goto error; if (isl_basic_set_plain_is_empty(aff)) { isl_basic_set_free(aff); isl_basic_set_free(context); return bset; } if (aff->n_eq == 0) { isl_basic_set_free(aff); return uset_gist_full(bset, context); } total = isl_basic_set_total_dim(bset); eq = isl_mat_sub_alloc6(bset->ctx, aff->eq, 0, aff->n_eq, 0, 1 + total); eq = isl_mat_cow(eq); T = isl_mat_variable_compression(eq, &T2); if (T && T->n_col == 0) { isl_mat_free(T); isl_mat_free(T2); isl_basic_set_free(context); isl_basic_set_free(aff); return isl_basic_set_set_to_empty(bset); } aff_context = isl_basic_set_affine_hull(isl_basic_set_copy(context)); bset = isl_basic_set_preimage(bset, isl_mat_copy(T)); context = isl_basic_set_preimage(context, T); bset = uset_gist_full(bset, context); bset = isl_basic_set_preimage(bset, T2); bset = isl_basic_set_intersect(bset, aff); bset = isl_basic_set_reduce_using_equalities(bset, aff_context); if (bset) { ISL_F_SET(bset, ISL_BASIC_SET_NO_IMPLICIT); ISL_F_SET(bset, ISL_BASIC_SET_NO_REDUNDANT); } return bset; error: isl_basic_set_free(bset); isl_basic_set_free(context); return NULL; } /* Normalize the divs in "bmap" in the context of the equalities in "context". * We simply add the equalities in context to bmap and then do a regular * div normalizations. Better results can be obtained by normalizing * only the divs in bmap than do not also appear in context. * We need to be careful to reduce the divs using the equalities * so that later calls to isl_basic_map_overlying_set wouldn't introduce * spurious constraints. */ static struct isl_basic_map *normalize_divs_in_context( struct isl_basic_map *bmap, struct isl_basic_map *context) { int i; unsigned total_context; int div_eq; div_eq = n_pure_div_eq(bmap); if (div_eq == 0) return bmap; if (context->n_div > 0) bmap = isl_basic_map_align_divs(bmap, context); total_context = isl_basic_map_total_dim(context); bmap = isl_basic_map_extend_constraints(bmap, context->n_eq, 0); for (i = 0; i < context->n_eq; ++i) { int k; k = isl_basic_map_alloc_equality(bmap); if (k < 0) return isl_basic_map_free(bmap); isl_seq_cpy(bmap->eq[k], context->eq[i], 1 + total_context); isl_seq_clr(bmap->eq[k] + 1 + total_context, isl_basic_map_total_dim(bmap) - total_context); } bmap = isl_basic_map_gauss(bmap, NULL); bmap = normalize_divs(bmap, NULL); bmap = isl_basic_map_gauss(bmap, NULL); return bmap; } struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap, struct isl_basic_map *context) { struct isl_basic_set *bset; if (!bmap || !context) goto error; if (isl_basic_map_is_universe(bmap)) { isl_basic_map_free(context); return bmap; } if (isl_basic_map_plain_is_empty(context)) { isl_basic_map_free(bmap); return context; } if (isl_basic_map_plain_is_empty(bmap)) { isl_basic_map_free(context); return bmap; } bmap = isl_basic_map_remove_redundancies(bmap); context = isl_basic_map_remove_redundancies(context); if (!context) goto error; if (context->n_eq) bmap = normalize_divs_in_context(bmap, context); context = isl_basic_map_align_divs(context, bmap); bmap = isl_basic_map_align_divs(bmap, context); bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)), isl_basic_map_underlying_set(context)); return isl_basic_map_overlying_set(bset, bmap); error: isl_basic_map_free(bmap); isl_basic_map_free(context); return NULL; } /* * Assumes context has no implicit divs. */ __isl_give isl_map *isl_map_gist_basic_map(__isl_take isl_map *map, __isl_take isl_basic_map *context) { int i; if (!map || !context) goto error;; if (isl_basic_map_plain_is_empty(context)) { isl_map_free(map); return isl_map_from_basic_map(context); } context = isl_basic_map_remove_redundancies(context); map = isl_map_cow(map); if (!map || !context) goto error;; isl_assert(map->ctx, isl_space_is_equal(map->dim, context->dim), goto error); map = isl_map_compute_divs(map); if (!map) goto error; for (i = map->n - 1; i >= 0; --i) { map->p[i] = isl_basic_map_gist(map->p[i], isl_basic_map_copy(context)); if (!map->p[i]) goto error; if (isl_basic_map_plain_is_empty(map->p[i])) { isl_basic_map_free(map->p[i]); if (i != map->n - 1) map->p[i] = map->p[map->n - 1]; map->n--; } } isl_basic_map_free(context); ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); isl_basic_map_free(context); return NULL; } /* Return a map that has the same intersection with "context" as "map" * and that as "simple" as possible. * * If "map" is already the universe, then we cannot make it any simpler. * Similarly, if "context" is the universe, then we cannot exploit it * to simplify "map" * If "map" and "context" are identical to each other, then we can * return the corresponding universe. * * If none of these cases apply, we have to work a bit harder. */ static __isl_give isl_map *map_gist(__isl_take isl_map *map, __isl_take isl_map *context) { int equal; int is_universe; is_universe = isl_map_plain_is_universe(map); if (is_universe >= 0 && !is_universe) is_universe = isl_map_plain_is_universe(context); if (is_universe < 0) goto error; if (is_universe) { isl_map_free(context); return map; } equal = isl_map_plain_is_equal(map, context); if (equal < 0) goto error; if (equal) { isl_map *res = isl_map_universe(isl_map_get_space(map)); isl_map_free(map); isl_map_free(context); return res; } context = isl_map_compute_divs(context); return isl_map_gist_basic_map(map, isl_map_simple_hull(context)); error: isl_map_free(map); isl_map_free(context); return NULL; } __isl_give isl_map *isl_map_gist(__isl_take isl_map *map, __isl_take isl_map *context) { return isl_map_align_params_map_map_and(map, context, &map_gist); } struct isl_basic_set *isl_basic_set_gist(struct isl_basic_set *bset, struct isl_basic_set *context) { return (struct isl_basic_set *)isl_basic_map_gist( (struct isl_basic_map *)bset, (struct isl_basic_map *)context); } __isl_give isl_set *isl_set_gist_basic_set(__isl_take isl_set *set, __isl_take isl_basic_set *context) { return (struct isl_set *)isl_map_gist_basic_map((struct isl_map *)set, (struct isl_basic_map *)context); } __isl_give isl_set *isl_set_gist_params_basic_set(__isl_take isl_set *set, __isl_take isl_basic_set *context) { isl_space *space = isl_set_get_space(set); isl_basic_set *dom_context = isl_basic_set_universe(space); dom_context = isl_basic_set_intersect_params(dom_context, context); return isl_set_gist_basic_set(set, dom_context); } __isl_give isl_set *isl_set_gist(__isl_take isl_set *set, __isl_take isl_set *context) { return (struct isl_set *)isl_map_gist((struct isl_map *)set, (struct isl_map *)context); } __isl_give isl_map *isl_map_gist_domain(__isl_take isl_map *map, __isl_take isl_set *context) { isl_map *map_context = isl_map_universe(isl_map_get_space(map)); map_context = isl_map_intersect_domain(map_context, context); return isl_map_gist(map, map_context); } __isl_give isl_map *isl_map_gist_range(__isl_take isl_map *map, __isl_take isl_set *context) { isl_map *map_context = isl_map_universe(isl_map_get_space(map)); map_context = isl_map_intersect_range(map_context, context); return isl_map_gist(map, map_context); } __isl_give isl_map *isl_map_gist_params(__isl_take isl_map *map, __isl_take isl_set *context) { isl_map *map_context = isl_map_universe(isl_map_get_space(map)); map_context = isl_map_intersect_params(map_context, context); return isl_map_gist(map, map_context); } __isl_give isl_set *isl_set_gist_params(__isl_take isl_set *set, __isl_take isl_set *context) { return isl_map_gist_params(set, context); } /* Quick check to see if two basic maps are disjoint. * In particular, we reduce the equalities and inequalities of * one basic map in the context of the equalities of the other * basic map and check if we get a contradiction. */ int isl_basic_map_plain_is_disjoint(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2) { struct isl_vec *v = NULL; int *elim = NULL; unsigned total; int i; if (!bmap1 || !bmap2) return -1; isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), return -1); if (bmap1->n_div || bmap2->n_div) return 0; if (!bmap1->n_eq && !bmap2->n_eq) return 0; total = isl_space_dim(bmap1->dim, isl_dim_all); if (total == 0) return 0; v = isl_vec_alloc(bmap1->ctx, 1 + total); if (!v) goto error; elim = isl_alloc_array(bmap1->ctx, int, total); if (!elim) goto error; compute_elimination_index(bmap1, elim); for (i = 0; i < bmap2->n_eq; ++i) { int reduced; reduced = reduced_using_equalities(v->block.data, bmap2->eq[i], bmap1, elim); if (reduced && !isl_int_is_zero(v->block.data[0]) && isl_seq_first_non_zero(v->block.data + 1, total) == -1) goto disjoint; } for (i = 0; i < bmap2->n_ineq; ++i) { int reduced; reduced = reduced_using_equalities(v->block.data, bmap2->ineq[i], bmap1, elim); if (reduced && isl_int_is_neg(v->block.data[0]) && isl_seq_first_non_zero(v->block.data + 1, total) == -1) goto disjoint; } compute_elimination_index(bmap2, elim); for (i = 0; i < bmap1->n_ineq; ++i) { int reduced; reduced = reduced_using_equalities(v->block.data, bmap1->ineq[i], bmap2, elim); if (reduced && isl_int_is_neg(v->block.data[0]) && isl_seq_first_non_zero(v->block.data + 1, total) == -1) goto disjoint; } isl_vec_free(v); free(elim); return 0; disjoint: isl_vec_free(v); free(elim); return 1; error: isl_vec_free(v); free(elim); return -1; } int isl_basic_set_plain_is_disjoint(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2) { return isl_basic_map_plain_is_disjoint((struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2); } /* Are "map1" and "map2" obviously disjoint? * * If one of them is empty or if they live in different spaces (ignoring * parameters), then they are clearly disjoint. * * If they have different parameters, then we skip any further tests. * * If they are obviously equal, but not obviously empty, then we will * not be able to detect if they are disjoint. * * Otherwise we check if each basic map in "map1" is obviously disjoint * from each basic map in "map2". */ int isl_map_plain_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i, j; int disjoint; int intersect; int match; if (!map1 || !map2) return -1; disjoint = isl_map_plain_is_empty(map1); if (disjoint < 0 || disjoint) return disjoint; disjoint = isl_map_plain_is_empty(map2); if (disjoint < 0 || disjoint) return disjoint; match = isl_space_tuple_match(map1->dim, isl_dim_in, map2->dim, isl_dim_in); if (match < 0 || !match) return match < 0 ? -1 : 1; match = isl_space_tuple_match(map1->dim, isl_dim_out, map2->dim, isl_dim_out); if (match < 0 || !match) return match < 0 ? -1 : 1; match = isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param); if (match < 0 || !match) return match < 0 ? -1 : 0; intersect = isl_map_plain_is_equal(map1, map2); if (intersect < 0 || intersect) return intersect < 0 ? -1 : 0; for (i = 0; i < map1->n; ++i) { for (j = 0; j < map2->n; ++j) { int d = isl_basic_map_plain_is_disjoint(map1->p[i], map2->p[j]); if (d != 1) return d; } } return 1; } /* Are "map1" and "map2" disjoint? * * They are disjoint if they are "obviously disjoint" or if one of them * is empty. Otherwise, they are not disjoint if one of them is universal. * If none of these cases apply, we compute the intersection and see if * the result is empty. */ int isl_map_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int disjoint; int intersect; isl_map *test; disjoint = isl_map_plain_is_disjoint(map1, map2); if (disjoint < 0 || disjoint) return disjoint; disjoint = isl_map_is_empty(map1); if (disjoint < 0 || disjoint) return disjoint; disjoint = isl_map_is_empty(map2); if (disjoint < 0 || disjoint) return disjoint; intersect = isl_map_plain_is_universe(map1); if (intersect < 0 || intersect) return intersect < 0 ? -1 : 0; intersect = isl_map_plain_is_universe(map2); if (intersect < 0 || intersect) return intersect < 0 ? -1 : 0; test = isl_map_intersect(isl_map_copy(map1), isl_map_copy(map2)); disjoint = isl_map_is_empty(test); isl_map_free(test); return disjoint; } int isl_set_plain_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_map_plain_is_disjoint((struct isl_map *)set1, (struct isl_map *)set2); } /* Are "set1" and "set2" disjoint? */ int isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_map_is_disjoint(set1, set2); } int isl_set_fast_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_set_plain_is_disjoint(set1, set2); } /* Check if we can combine a given div with lower bound l and upper * bound u with some other div and if so return that other div. * Otherwise return -1. * * We first check that * - the bounds are opposites of each other (except for the constant * term) * - the bounds do not reference any other div * - no div is defined in terms of this div * * Let m be the size of the range allowed on the div by the bounds. * That is, the bounds are of the form * * e <= a <= e + m - 1 * * with e some expression in the other variables. * We look for another div b such that no third div is defined in terms * of this second div b and such that in any constraint that contains * a (except for the given lower and upper bound), also contains b * with a coefficient that is m times that of b. * That is, all constraints (execpt for the lower and upper bound) * are of the form * * e + f (a + m b) >= 0 * * If so, we return b so that "a + m b" can be replaced by * a single div "c = a + m b". */ static int div_find_coalesce(struct isl_basic_map *bmap, int *pairs, unsigned div, unsigned l, unsigned u) { int i, j; unsigned dim; int coalesce = -1; if (bmap->n_div <= 1) return -1; dim = isl_space_dim(bmap->dim, isl_dim_all); if (isl_seq_first_non_zero(bmap->ineq[l] + 1 + dim, div) != -1) return -1; if (isl_seq_first_non_zero(bmap->ineq[l] + 1 + dim + div + 1, bmap->n_div - div - 1) != -1) return -1; if (!isl_seq_is_neg(bmap->ineq[l] + 1, bmap->ineq[u] + 1, dim + bmap->n_div)) return -1; for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (!isl_int_is_zero(bmap->div[i][1 + 1 + dim + div])) return -1; } isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0], bmap->ineq[u][0]); if (isl_int_is_neg(bmap->ineq[l][0])) { isl_int_sub(bmap->ineq[l][0], bmap->ineq[l][0], bmap->ineq[u][0]); bmap = isl_basic_map_copy(bmap); bmap = isl_basic_map_set_to_empty(bmap); isl_basic_map_free(bmap); return -1; } isl_int_add_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1); for (i = 0; i < bmap->n_div; ++i) { if (i == div) continue; if (!pairs[i]) continue; for (j = 0; j < bmap->n_div; ++j) { if (isl_int_is_zero(bmap->div[j][0])) continue; if (!isl_int_is_zero(bmap->div[j][1 + 1 + dim + i])) break; } if (j < bmap->n_div) continue; for (j = 0; j < bmap->n_ineq; ++j) { int valid; if (j == l || j == u) continue; if (isl_int_is_zero(bmap->ineq[j][1 + dim + div])) continue; if (isl_int_is_zero(bmap->ineq[j][1 + dim + i])) break; isl_int_mul(bmap->ineq[j][1 + dim + div], bmap->ineq[j][1 + dim + div], bmap->ineq[l][0]); valid = isl_int_eq(bmap->ineq[j][1 + dim + div], bmap->ineq[j][1 + dim + i]); isl_int_divexact(bmap->ineq[j][1 + dim + div], bmap->ineq[j][1 + dim + div], bmap->ineq[l][0]); if (!valid) break; } if (j < bmap->n_ineq) continue; coalesce = i; break; } isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1); isl_int_sub(bmap->ineq[l][0], bmap->ineq[l][0], bmap->ineq[u][0]); return coalesce; } /* Given a lower and an upper bound on div i, construct an inequality * that when nonnegative ensures that this pair of bounds always allows * for an integer value of the given div. * The lower bound is inequality l, while the upper bound is inequality u. * The constructed inequality is stored in ineq. * g, fl, fu are temporary scalars. * * Let the upper bound be * * -n_u a + e_u >= 0 * * and the lower bound * * n_l a + e_l >= 0 * * Let n_u = f_u g and n_l = f_l g, with g = gcd(n_u, n_l). * We have * * - f_u e_l <= f_u f_l g a <= f_l e_u * * Since all variables are integer valued, this is equivalent to * * - f_u e_l - (f_u - 1) <= f_u f_l g a <= f_l e_u + (f_l - 1) * * If this interval is at least f_u f_l g, then it contains at least * one integer value for a. * That is, the test constraint is * * f_l e_u + f_u e_l + f_l - 1 + f_u - 1 + 1 >= f_u f_l g */ static void construct_test_ineq(struct isl_basic_map *bmap, int i, int l, int u, isl_int *ineq, isl_int g, isl_int fl, isl_int fu) { unsigned dim; dim = isl_space_dim(bmap->dim, isl_dim_all); isl_int_gcd(g, bmap->ineq[l][1 + dim + i], bmap->ineq[u][1 + dim + i]); isl_int_divexact(fl, bmap->ineq[l][1 + dim + i], g); isl_int_divexact(fu, bmap->ineq[u][1 + dim + i], g); isl_int_neg(fu, fu); isl_seq_combine(ineq, fl, bmap->ineq[u], fu, bmap->ineq[l], 1 + dim + bmap->n_div); isl_int_add(ineq[0], ineq[0], fl); isl_int_add(ineq[0], ineq[0], fu); isl_int_sub_ui(ineq[0], ineq[0], 1); isl_int_mul(g, g, fl); isl_int_mul(g, g, fu); isl_int_sub(ineq[0], ineq[0], g); } /* Remove more kinds of divs that are not strictly needed. * In particular, if all pairs of lower and upper bounds on a div * are such that they allow at least one integer value of the div, * the we can eliminate the div using Fourier-Motzkin without * introducing any spurious solutions. */ static struct isl_basic_map *drop_more_redundant_divs( struct isl_basic_map *bmap, int *pairs, int n) { struct isl_tab *tab = NULL; struct isl_vec *vec = NULL; unsigned dim; int remove = -1; isl_int g, fl, fu; isl_int_init(g); isl_int_init(fl); isl_int_init(fu); if (!bmap) goto error; dim = isl_space_dim(bmap->dim, isl_dim_all); vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div); if (!vec) goto error; tab = isl_tab_from_basic_map(bmap, 0); while (n > 0) { int i, l, u; int best = -1; enum isl_lp_result res; for (i = 0; i < bmap->n_div; ++i) { if (!pairs[i]) continue; if (best >= 0 && pairs[best] <= pairs[i]) continue; best = i; } i = best; for (l = 0; l < bmap->n_ineq; ++l) { if (!isl_int_is_pos(bmap->ineq[l][1 + dim + i])) continue; for (u = 0; u < bmap->n_ineq; ++u) { if (!isl_int_is_neg(bmap->ineq[u][1 + dim + i])) continue; construct_test_ineq(bmap, i, l, u, vec->el, g, fl, fu); res = isl_tab_min(tab, vec->el, bmap->ctx->one, &g, NULL, 0); if (res == isl_lp_error) goto error; if (res == isl_lp_empty) { bmap = isl_basic_map_set_to_empty(bmap); break; } if (res != isl_lp_ok || isl_int_is_neg(g)) break; } if (u < bmap->n_ineq) break; } if (l == bmap->n_ineq) { remove = i; break; } pairs[i] = 0; --n; } isl_tab_free(tab); isl_vec_free(vec); isl_int_clear(g); isl_int_clear(fl); isl_int_clear(fu); free(pairs); if (remove < 0) return bmap; bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, remove, 1); return isl_basic_map_drop_redundant_divs(bmap); error: free(pairs); isl_basic_map_free(bmap); isl_tab_free(tab); isl_vec_free(vec); isl_int_clear(g); isl_int_clear(fl); isl_int_clear(fu); return NULL; } /* Given a pair of divs div1 and div2 such that, expect for the lower bound l * and the upper bound u, div1 always occurs together with div2 in the form * (div1 + m div2), where m is the constant range on the variable div1 * allowed by l and u, replace the pair div1 and div2 by a single * div that is equal to div1 + m div2. * * The new div will appear in the location that contains div2. * We need to modify all constraints that contain * div2 = (div - div1) / m * (If a constraint does not contain div2, it will also not contain div1.) * If the constraint also contains div1, then we know they appear * as f (div1 + m div2) and we can simply replace (div1 + m div2) by div, * i.e., the coefficient of div is f. * * Otherwise, we first need to introduce div1 into the constraint. * Let the l be * * div1 + f >=0 * * and u * * -div1 + f' >= 0 * * A lower bound on div2 * * n div2 + t >= 0 * * can be replaced by * * (n * (m div 2 + div1) + m t + n f)/g >= 0 * * with g = gcd(m,n). * An upper bound * * -n div2 + t >= 0 * * can be replaced by * * (-n * (m div2 + div1) + m t + n f')/g >= 0 * * These constraint are those that we would obtain from eliminating * div1 using Fourier-Motzkin. * * After all constraints have been modified, we drop the lower and upper * bound and then drop div1. */ static struct isl_basic_map *coalesce_divs(struct isl_basic_map *bmap, unsigned div1, unsigned div2, unsigned l, unsigned u) { isl_int a; isl_int b; isl_int m; unsigned dim, total; int i; dim = isl_space_dim(bmap->dim, isl_dim_all); total = 1 + dim + bmap->n_div; isl_int_init(a); isl_int_init(b); isl_int_init(m); isl_int_add(m, bmap->ineq[l][0], bmap->ineq[u][0]); isl_int_add_ui(m, m, 1); for (i = 0; i < bmap->n_ineq; ++i) { if (i == l || i == u) continue; if (isl_int_is_zero(bmap->ineq[i][1 + dim + div2])) continue; if (isl_int_is_zero(bmap->ineq[i][1 + dim + div1])) { isl_int_gcd(b, m, bmap->ineq[i][1 + dim + div2]); isl_int_divexact(a, m, b); isl_int_divexact(b, bmap->ineq[i][1 + dim + div2], b); if (isl_int_is_pos(b)) { isl_seq_combine(bmap->ineq[i], a, bmap->ineq[i], b, bmap->ineq[l], total); } else { isl_int_neg(b, b); isl_seq_combine(bmap->ineq[i], a, bmap->ineq[i], b, bmap->ineq[u], total); } } isl_int_set(bmap->ineq[i][1 + dim + div2], bmap->ineq[i][1 + dim + div1]); isl_int_set_si(bmap->ineq[i][1 + dim + div1], 0); } isl_int_clear(a); isl_int_clear(b); isl_int_clear(m); if (l > u) { isl_basic_map_drop_inequality(bmap, l); isl_basic_map_drop_inequality(bmap, u); } else { isl_basic_map_drop_inequality(bmap, u); isl_basic_map_drop_inequality(bmap, l); } bmap = isl_basic_map_drop_div(bmap, div1); return bmap; } /* First check if we can coalesce any pair of divs and * then continue with dropping more redundant divs. * * We loop over all pairs of lower and upper bounds on a div * with coefficient 1 and -1, respectively, check if there * is any other div "c" with which we can coalesce the div * and if so, perform the coalescing. */ static struct isl_basic_map *coalesce_or_drop_more_redundant_divs( struct isl_basic_map *bmap, int *pairs, int n) { int i, l, u; unsigned dim; dim = isl_space_dim(bmap->dim, isl_dim_all); for (i = 0; i < bmap->n_div; ++i) { if (!pairs[i]) continue; for (l = 0; l < bmap->n_ineq; ++l) { if (!isl_int_is_one(bmap->ineq[l][1 + dim + i])) continue; for (u = 0; u < bmap->n_ineq; ++u) { int c; if (!isl_int_is_negone(bmap->ineq[u][1+dim+i])) continue; c = div_find_coalesce(bmap, pairs, i, l, u); if (c < 0) continue; free(pairs); bmap = coalesce_divs(bmap, i, c, l, u); return isl_basic_map_drop_redundant_divs(bmap); } } } if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) return bmap; return drop_more_redundant_divs(bmap, pairs, n); } /* Remove divs that are not strictly needed. * In particular, if a div only occurs positively (or negatively) * in constraints, then it can simply be dropped. * Also, if a div occurs in only two constraints and if moreover * those two constraints are opposite to each other, except for the constant * term and if the sum of the constant terms is such that for any value * of the other values, there is always at least one integer value of the * div, i.e., if one plus this sum is greater than or equal to * the (absolute value) of the coefficent of the div in the constraints, * then we can also simply drop the div. * * We skip divs that appear in equalities or in the definition of other divs. * Divs that appear in the definition of other divs usually occur in at least * 4 constraints, but the constraints may have been simplified. * * If any divs are left after these simple checks then we move on * to more complicated cases in drop_more_redundant_divs. */ struct isl_basic_map *isl_basic_map_drop_redundant_divs( struct isl_basic_map *bmap) { int i, j; unsigned off; int *pairs = NULL; int n = 0; if (!bmap) goto error; if (bmap->n_div == 0) return bmap; off = isl_space_dim(bmap->dim, isl_dim_all); pairs = isl_calloc_array(bmap->ctx, int, bmap->n_div); if (!pairs) goto error; for (i = 0; i < bmap->n_div; ++i) { int pos, neg; int last_pos, last_neg; int redundant; int defined; defined = !isl_int_is_zero(bmap->div[i][0]); for (j = i; j < bmap->n_div; ++j) if (!isl_int_is_zero(bmap->div[j][1 + 1 + off + i])) break; if (j < bmap->n_div) continue; for (j = 0; j < bmap->n_eq; ++j) if (!isl_int_is_zero(bmap->eq[j][1 + off + i])) break; if (j < bmap->n_eq) continue; ++n; pos = neg = 0; for (j = 0; j < bmap->n_ineq; ++j) { if (isl_int_is_pos(bmap->ineq[j][1 + off + i])) { last_pos = j; ++pos; } if (isl_int_is_neg(bmap->ineq[j][1 + off + i])) { last_neg = j; ++neg; } } pairs[i] = pos * neg; if (pairs[i] == 0) { for (j = bmap->n_ineq - 1; j >= 0; --j) if (!isl_int_is_zero(bmap->ineq[j][1+off+i])) isl_basic_map_drop_inequality(bmap, j); bmap = isl_basic_map_drop_div(bmap, i); free(pairs); return isl_basic_map_drop_redundant_divs(bmap); } if (pairs[i] != 1) continue; if (!isl_seq_is_neg(bmap->ineq[last_pos] + 1, bmap->ineq[last_neg] + 1, off + bmap->n_div)) continue; isl_int_add(bmap->ineq[last_pos][0], bmap->ineq[last_pos][0], bmap->ineq[last_neg][0]); isl_int_add_ui(bmap->ineq[last_pos][0], bmap->ineq[last_pos][0], 1); redundant = isl_int_ge(bmap->ineq[last_pos][0], bmap->ineq[last_pos][1+off+i]); isl_int_sub_ui(bmap->ineq[last_pos][0], bmap->ineq[last_pos][0], 1); isl_int_sub(bmap->ineq[last_pos][0], bmap->ineq[last_pos][0], bmap->ineq[last_neg][0]); if (!redundant) { if (defined || !ok_to_set_div_from_bound(bmap, i, last_pos)) { pairs[i] = 0; --n; continue; } bmap = set_div_from_lower_bound(bmap, i, last_pos); bmap = isl_basic_map_simplify(bmap); free(pairs); return isl_basic_map_drop_redundant_divs(bmap); } if (last_pos > last_neg) { isl_basic_map_drop_inequality(bmap, last_pos); isl_basic_map_drop_inequality(bmap, last_neg); } else { isl_basic_map_drop_inequality(bmap, last_neg); isl_basic_map_drop_inequality(bmap, last_pos); } bmap = isl_basic_map_drop_div(bmap, i); free(pairs); return isl_basic_map_drop_redundant_divs(bmap); } if (n > 0) return coalesce_or_drop_more_redundant_divs(bmap, pairs, n); free(pairs); return bmap; error: free(pairs); isl_basic_map_free(bmap); return NULL; } struct isl_basic_set *isl_basic_set_drop_redundant_divs( struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_drop_redundant_divs((struct isl_basic_map *)bset); } struct isl_map *isl_map_drop_redundant_divs(struct isl_map *map) { int i; if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_drop_redundant_divs(map->p[i]); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } struct isl_set *isl_set_drop_redundant_divs(struct isl_set *set) { return (struct isl_set *) isl_map_drop_redundant_divs((struct isl_map *)set); } cloog-0.18.2/isl/isl_multi_templ.h0000664000175000017500000000052212254313240013765 00000000000000#include #define xCAT(A,B) A ## B #define CAT(A,B) xCAT(A,B) #undef EL #define EL CAT(isl_,BASE) #define xMULTI(BASE) isl_multi_ ## BASE #define MULTI(BASE) xMULTI(BASE) struct MULTI(BASE) { int ref; isl_space *space; int n; EL *p[1]; }; __isl_give MULTI(BASE) *CAT(MULTI(BASE),_alloc)(__isl_take isl_space *space); cloog-0.18.2/isl/isl_point_private.h0000664000175000017500000000035112254313240014315 00000000000000#include #include #include struct isl_point { int ref; isl_space *dim; struct isl_vec *vec; }; __isl_give isl_point *isl_point_alloc(__isl_take isl_space *dim, __isl_take isl_vec *vec); cloog-0.18.2/isl/interface/0000775000175000017500000000000012254314446012444 500000000000000cloog-0.18.2/isl/interface/all.h0000664000175000017500000000014012254313240013267 00000000000000#include #include #include #include cloog-0.18.2/isl/interface/isl.py.top0000664000175000017500000000115012254313240014312 00000000000000from ctypes import * isl = cdll.LoadLibrary("libisl.so") libc = cdll.LoadLibrary("libc.so.6") class Error(Exception): pass class Context: defaultInstance = None def __init__(self): ptr = isl.isl_ctx_alloc() self.ptr = ptr def __del__(self): isl.isl_ctx_free(self) def from_param(self): return self.ptr @staticmethod def getDefaultInstance(): if Context.defaultInstance == None: Context.defaultInstance = Context() return Context.defaultInstance isl.isl_ctx_alloc.restype = c_void_p isl.isl_ctx_free.argtypes = [Context] cloog-0.18.2/isl/isl_union_map_private.h0000664000175000017500000000025712254313240015156 00000000000000#define isl_union_set isl_union_map #include #include struct isl_union_map { int ref; isl_space *dim; struct isl_hash_table table; }; cloog-0.18.2/isl/codegen_test.sh.in0000664000175000017500000000067012254313240014022 00000000000000#!/bin/sh EXEEXT=@EXEEXT@ srcdir=@srcdir@ failed=0 for i in $srcdir/test_inputs/codegen/*.in \ $srcdir/test_inputs/codegen/cloog/*.in \ $srcdir/test_inputs/codegen/omega/*.in \ $srcdir/test_inputs/codegen/pldi2012/*.in; do echo $i; base=`basename $i .in` test=test-$base.c dir=`dirname $i` ref=$dir/$base.c (./isl_codegen$EXEEXT < $i > $test && diff -uw $ref $test && rm $test) || failed=1 done test $failed -eq 0 || exit cloog-0.18.2/isl/isl_arg.c0000664000175000017500000006172112254313240012206 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include static struct isl_arg help_arg[] = { ISL_ARG_PHANTOM_BOOL('h', "help", NULL, "print this help, then exit") }; static void set_default_choice(struct isl_arg *arg, void *opt) { *(unsigned *)(((char *)opt) + arg->offset) = arg->u.choice.default_value; } static void set_default_flags(struct isl_arg *arg, void *opt) { *(unsigned *)(((char *)opt) + arg->offset) = arg->u.flags.default_value; } static void set_default_bool(struct isl_arg *arg, void *opt) { if (arg->offset == (size_t) -1) return; *(unsigned *)(((char *)opt) + arg->offset) = arg->u.b.default_value; } static void set_default_child(struct isl_arg *arg, void *opt) { void *child; if (arg->offset == (size_t) -1) child = opt; else { child = calloc(1, arg->u.child.child->options_size); *(void **)(((char *)opt) + arg->offset) = child; } if (child) isl_args_set_defaults(arg->u.child.child, child); } static void set_default_user(struct isl_arg *arg, void *opt) { arg->u.user.init(((char *)opt) + arg->offset); } static void set_default_int(struct isl_arg *arg, void *opt) { *(int *)(((char *)opt) + arg->offset) = arg->u.i.default_value; } static void set_default_long(struct isl_arg *arg, void *opt) { *(long *)(((char *)opt) + arg->offset) = arg->u.l.default_value; } static void set_default_ulong(struct isl_arg *arg, void *opt) { *(unsigned long *)(((char *)opt) + arg->offset) = arg->u.ul.default_value; } static void set_default_str(struct isl_arg *arg, void *opt) { const char *str = NULL; if (arg->u.str.default_value) str = strdup(arg->u.str.default_value); *(const char **)(((char *)opt) + arg->offset) = str; } static void set_default_str_list(struct isl_arg *arg, void *opt) { *(const char ***)(((char *) opt) + arg->offset) = NULL; *(int *)(((char *) opt) + arg->u.str_list.offset_n) = 0; } void isl_args_set_defaults(struct isl_args *args, void *opt) { int i; for (i = 0; args->args[i].type != isl_arg_end; ++i) { switch (args->args[i].type) { case isl_arg_choice: set_default_choice(&args->args[i], opt); break; case isl_arg_flags: set_default_flags(&args->args[i], opt); break; case isl_arg_bool: set_default_bool(&args->args[i], opt); break; case isl_arg_child: set_default_child(&args->args[i], opt); break; case isl_arg_user: set_default_user(&args->args[i], opt); break; case isl_arg_int: set_default_int(&args->args[i], opt); break; case isl_arg_long: set_default_long(&args->args[i], opt); break; case isl_arg_ulong: set_default_ulong(&args->args[i], opt); break; case isl_arg_arg: case isl_arg_str: set_default_str(&args->args[i], opt); break; case isl_arg_str_list: set_default_str_list(&args->args[i], opt); break; case isl_arg_alias: case isl_arg_footer: case isl_arg_version: case isl_arg_end: break; } } } static void free_args(struct isl_arg *arg, void *opt); static void free_child(struct isl_arg *arg, void *opt) { if (arg->offset == (size_t) -1) free_args(arg->u.child.child->args, opt); else isl_args_free(arg->u.child.child, *(void **)(((char *)opt) + arg->offset)); } static void free_str_list(struct isl_arg *arg, void *opt) { int i; int n = *(int *)(((char *) opt) + arg->u.str_list.offset_n); char **list = *(char ***)(((char *) opt) + arg->offset); for (i = 0; i < n; ++i) free(list[i]); free(list); } static void free_user(struct isl_arg *arg, void *opt) { if (arg->u.user.clear) arg->u.user.clear(((char *)opt) + arg->offset); } static void free_args(struct isl_arg *arg, void *opt) { int i; for (i = 0; arg[i].type != isl_arg_end; ++i) { switch (arg[i].type) { case isl_arg_child: free_child(&arg[i], opt); break; case isl_arg_arg: case isl_arg_str: free(*(char **)(((char *)opt) + arg[i].offset)); break; case isl_arg_str_list: free_str_list(&arg[i], opt); break; case isl_arg_user: free_user(&arg[i], opt); break; case isl_arg_alias: case isl_arg_bool: case isl_arg_choice: case isl_arg_flags: case isl_arg_int: case isl_arg_long: case isl_arg_ulong: case isl_arg_version: case isl_arg_footer: case isl_arg_end: break; } } } void isl_args_free(struct isl_args *args, void *opt) { if (!opt) return; free_args(args->args, opt); free(opt); } static int print_arg_help(struct isl_arg *decl, const char *prefix, int no) { int len = 0; if (!decl->long_name) { printf(" -%c", decl->short_name); return 4; } if (decl->short_name) { printf(" -%c, --", decl->short_name); len += 8; } else if (decl->flags & ISL_ARG_SINGLE_DASH) { printf(" -"); len += 3; } else { printf(" --"); len += 8; } if (prefix) { printf("%s-", prefix); len += strlen(prefix) + 1; } if (no) { printf("no-"); len += 3; } printf("%s", decl->long_name); len += strlen(decl->long_name); while ((++decl)->type == isl_arg_alias) { printf(", --"); len += 4; if (no) { printf("no-"); len += 3; } printf("%s", decl->long_name); len += strlen(decl->long_name); } return len; } const void *isl_memrchr(const void *s, int c, size_t n) { const char *p = s; while (n-- > 0) if (p[n] == c) return p + n; return NULL; } static int wrap_msg(const char *s, int indent, int pos) { int len; int wrap_len = 75 - indent; if (pos + 1 >= indent) printf("\n%*s", indent, ""); else printf("%*s", indent - pos, ""); len = strlen(s); while (len > wrap_len) { const char *space = isl_memrchr(s, ' ', wrap_len); int l; if (!space) space = strchr(s + wrap_len, ' '); if (!space) break; l = space - s; printf("%.*s", l, s); s = space + 1; len -= l + 1; printf("\n%*s", indent, ""); } printf("%s", s); return len; } static int print_help_msg(struct isl_arg *decl, int pos) { if (!decl->help_msg) return pos; return wrap_msg(decl->help_msg, 30, pos); } static void print_default(struct isl_arg *decl, const char *def, int pos) { const char *default_prefix = "[default: "; const char *default_suffix = "]"; int len; len = strlen(default_prefix) + strlen(def) + strlen(default_suffix); if (!decl->help_msg) { if (pos >= 29) printf("\n%30s", ""); else printf("%*s", 30 - pos, ""); pos = 0; } else { if (pos + len >= 48) printf("\n%30s", ""); else printf(" "); } printf("%s%s%s", default_prefix, def, default_suffix); } static void print_default_choice(struct isl_arg *decl, void *opt, int pos) { int i; const char *s = "none"; unsigned *p; p = (unsigned *)(((char *) opt) + decl->offset); for (i = 0; decl->u.choice.choice[i].name; ++i) if (decl->u.choice.choice[i].value == *p) { s = decl->u.choice.choice[i].name; break; } print_default(decl, s, pos); } static void print_choice_help(struct isl_arg *decl, const char *prefix, void *opt) { int i; int pos; pos = print_arg_help(decl, prefix, 0); printf("="); pos++; for (i = 0; decl->u.choice.choice[i].name; ++i) { if (i) { printf("|"); pos++; } printf("%s", decl->u.choice.choice[i].name); pos += strlen(decl->u.choice.choice[i].name); } pos = print_help_msg(decl, pos); print_default_choice(decl, opt, pos); printf("\n"); } static void print_default_flags(struct isl_arg *decl, void *opt, int pos) { int i, first; const char *default_prefix = "[default: "; const char *default_suffix = "]"; int len = strlen(default_prefix) + strlen(default_suffix); unsigned *p; p = (unsigned *)(((char *) opt) + decl->offset); for (i = 0; decl->u.flags.flags[i].name; ++i) if ((*p & decl->u.flags.flags[i].mask) == decl->u.flags.flags[i].value) len += strlen(decl->u.flags.flags[i].name); if (!decl->help_msg) { if (pos >= 29) printf("\n%30s", ""); else printf("%*s", 30 - pos, ""); pos = 0; } else { if (pos + len >= 48) printf("\n%30s", ""); else printf(" "); } printf("%s", default_prefix); for (first = 1, i = 0; decl->u.flags.flags[i].name; ++i) if ((*p & decl->u.flags.flags[i].mask) == decl->u.flags.flags[i].value) { if (!first) printf(","); printf("%s", decl->u.flags.flags[i].name); first = 0; } printf("%s", default_suffix); } static void print_flags_help(struct isl_arg *decl, const char *prefix, void *opt) { int i, j; int pos; pos = print_arg_help(decl, prefix, 0); printf("="); pos++; for (i = 0; decl->u.flags.flags[i].name; ++i) { if (i) { printf(","); pos++; } for (j = i; decl->u.flags.flags[j].mask == decl->u.flags.flags[i].mask; ++j) { if (j != i) { printf("|"); pos++; } printf("%s", decl->u.flags.flags[j].name); pos += strlen(decl->u.flags.flags[j].name); } i = j - 1; } pos = print_help_msg(decl, pos); print_default_flags(decl, opt, pos); printf("\n"); } static void print_bool_help(struct isl_arg *decl, const char *prefix, void *opt) { int pos; unsigned *p = opt ? (unsigned *)(((char *) opt) + decl->offset) : NULL; int no = p ? *p == 1 : 0; pos = print_arg_help(decl, prefix, no); pos = print_help_msg(decl, pos); if (decl->offset != (size_t) -1) print_default(decl, no ? "yes" : "no", pos); printf("\n"); } static int print_argument_name(struct isl_arg *decl, const char *name, int pos) { printf("%c<%s>", decl->long_name ? '=' : ' ', name); return pos + 3 + strlen(name); } static void print_int_help(struct isl_arg *decl, const char *prefix, void *opt) { int pos; char val[20]; int *p = (int *)(((char *) opt) + decl->offset); pos = print_arg_help(decl, prefix, 0); pos = print_argument_name(decl, decl->argument_name, pos); pos = print_help_msg(decl, pos); snprintf(val, sizeof(val), "%d", *p); print_default(decl, val, pos); printf("\n"); } static void print_long_help(struct isl_arg *decl, const char *prefix, void *opt) { int pos; long *p = (long *)(((char *) opt) + decl->offset); pos = print_arg_help(decl, prefix, 0); if (*p != decl->u.l.default_selected) { printf("["); pos++; } printf("=long"); pos += 5; if (*p != decl->u.l.default_selected) { printf("]"); pos++; } print_help_msg(decl, pos); printf("\n"); } static void print_ulong_help(struct isl_arg *decl, const char *prefix) { int pos; pos = print_arg_help(decl, prefix, 0); printf("=ulong"); pos += 6; print_help_msg(decl, pos); printf("\n"); } static void print_str_help(struct isl_arg *decl, const char *prefix, void *opt) { int pos; const char *a = decl->argument_name ? decl->argument_name : "string"; const char **p = (const char **)(((char *) opt) + decl->offset); pos = print_arg_help(decl, prefix, 0); pos = print_argument_name(decl, a, pos); pos = print_help_msg(decl, pos); if (*p) print_default(decl, *p, pos); printf("\n"); } static void print_str_list_help(struct isl_arg *decl, const char *prefix) { int pos; const char *a = decl->argument_name ? decl->argument_name : "string"; pos = print_arg_help(decl, prefix, 0); pos = print_argument_name(decl, a, pos); pos = print_help_msg(decl, pos); printf("\n"); } static void print_help(struct isl_arg *arg, const char *prefix, void *opt) { int i; int any = 0; for (i = 0; arg[i].type != isl_arg_end; ++i) { if (arg[i].flags & ISL_ARG_HIDDEN) continue; switch (arg[i].type) { case isl_arg_flags: print_flags_help(&arg[i], prefix, opt); any = 1; break; case isl_arg_choice: print_choice_help(&arg[i], prefix, opt); any = 1; break; case isl_arg_bool: print_bool_help(&arg[i], prefix, opt); any = 1; break; case isl_arg_int: print_int_help(&arg[i], prefix, opt); any = 1; break; case isl_arg_long: print_long_help(&arg[i], prefix, opt); any = 1; break; case isl_arg_ulong: print_ulong_help(&arg[i], prefix); any = 1; break; case isl_arg_str: print_str_help(&arg[i], prefix, opt); any = 1; break; case isl_arg_str_list: print_str_list_help(&arg[i], prefix); any = 1; break; case isl_arg_alias: case isl_arg_version: case isl_arg_arg: case isl_arg_footer: case isl_arg_child: case isl_arg_user: case isl_arg_end: break; } } for (i = 0; arg[i].type != isl_arg_end; ++i) { void *child; if (arg[i].type != isl_arg_child) continue; if (arg[i].flags & ISL_ARG_HIDDEN) continue; if (any) printf("\n"); if (arg[i].help_msg) printf(" %s\n", arg[i].help_msg); if (arg[i].offset == (size_t) -1) child = opt; else child = *(void **)(((char *) opt) + arg[i].offset); print_help(arg[i].u.child.child->args, arg[i].long_name, child); any = 1; } } static const char *prog_name(const char *prog) { const char *slash; slash = strrchr(prog, '/'); if (slash) prog = slash + 1; if (strncmp(prog, "lt-", 3) == 0) prog += 3; return prog; } static int any_version(struct isl_arg *decl) { int i; for (i = 0; decl[i].type != isl_arg_end; ++i) { switch (decl[i].type) { case isl_arg_version: return 1; case isl_arg_child: if (any_version(decl[i].u.child.child->args)) return 1; break; default: break; } } return 0; } static void print_help_and_exit(struct isl_arg *arg, const char *prog, void *opt) { int i; printf("Usage: %s [OPTION...]", prog_name(prog)); for (i = 0; arg[i].type != isl_arg_end; ++i) if (arg[i].type == isl_arg_arg) printf(" %s", arg[i].argument_name); printf("\n\n"); print_help(arg, NULL, opt); printf("\n"); if (any_version(arg)) printf(" -V, --version\n"); print_bool_help(help_arg, NULL, NULL); for (i = 0; arg[i].type != isl_arg_end; ++i) { if (arg[i].type != isl_arg_footer) continue; wrap_msg(arg[i].help_msg, 0, 0); printf("\n"); } exit(0); } static int match_long_name(struct isl_arg *decl, const char *start, const char *end) { do { if (end - start == strlen(decl->long_name) && !strncmp(start, decl->long_name, end - start)) return 1; } while ((++decl)->type == isl_arg_alias); return 0; } static const char *skip_dash_dash(struct isl_arg *decl, const char *arg) { if (!strncmp(arg, "--", 2)) return arg + 2; if ((decl->flags & ISL_ARG_SINGLE_DASH) && arg[0] == '-') return arg + 1; return NULL; } static const char *skip_name(struct isl_arg *decl, const char *arg, const char *prefix, int need_argument, int *has_argument) { const char *equal; const char *name; const char *end; if (arg[0] == '-' && arg[1] && arg[1] == decl->short_name) { if (need_argument && !arg[2]) return NULL; if (has_argument) *has_argument = arg[2] != '\0'; return arg + 2; } if (!decl->long_name) return NULL; name = skip_dash_dash(decl, arg); if (!name) return NULL; equal = strchr(name, '='); if (need_argument && !equal) return NULL; if (has_argument) *has_argument = !!equal; end = equal ? equal : name + strlen(name); if (prefix) { size_t prefix_len = strlen(prefix); if (strncmp(name, prefix, prefix_len) == 0 && name[prefix_len] == '-') name += prefix_len + 1; } if (!match_long_name(decl, name, end)) return NULL; return equal ? equal + 1 : end; } static int parse_choice_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int i; int has_argument; const char *choice; choice = skip_name(decl, arg[0], prefix, 0, &has_argument); if (!choice) return 0; if (!has_argument && (!arg[1] || arg[1][0] == '-')) { unsigned u = decl->u.choice.default_selected; *(unsigned *)(((char *)opt) + decl->offset) = u; if (decl->u.choice.set) decl->u.choice.set(opt, u); return 1; } if (!has_argument) choice = arg[1]; for (i = 0; decl->u.choice.choice[i].name; ++i) { unsigned u; if (strcmp(choice, decl->u.choice.choice[i].name)) continue; u = decl->u.choice.choice[i].value; *(unsigned *)(((char *)opt) + decl->offset) = u; if (decl->u.choice.set) decl->u.choice.set(opt, u); return has_argument ? 1 : 2; } return 0; } static int set_flag(struct isl_arg *decl, unsigned *val, const char *flag, size_t len) { int i; for (i = 0; decl->u.flags.flags[i].name; ++i) { if (strncmp(flag, decl->u.flags.flags[i].name, len)) continue; *val &= ~decl->u.flags.flags[i].mask; *val |= decl->u.flags.flags[i].value; return 1; } return 0; } static int parse_flags_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int has_argument; const char *flags; const char *comma; unsigned val; flags = skip_name(decl, arg[0], prefix, 0, &has_argument); if (!flags) return 0; if (!has_argument && !arg[1]) return 0; if (!has_argument) flags = arg[1]; val = 0; while ((comma = strchr(flags, ',')) != NULL) { if (!set_flag(decl, &val, flags, comma - flags)) return 0; flags = comma + 1; } if (!set_flag(decl, &val, flags, strlen(flags))) return 0; *(unsigned *)(((char *)opt) + decl->offset) = val; return has_argument ? 1 : 2; } static int parse_bool_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { const char *name; unsigned *p = (unsigned *)(((char *)opt) + decl->offset); if (skip_name(decl, arg[0], prefix, 0, NULL)) { if ((decl->flags & ISL_ARG_BOOL_ARG) && arg[1]) { char *endptr; int val = strtol(arg[1], &endptr, 0); if (*endptr == '\0' && (val == 0 || val == 1)) { if (decl->offset != (size_t) -1) *p = val; if (decl->u.b.set) decl->u.b.set(opt, val); return 2; } } if (decl->offset != (size_t) -1) *p = 1; if (decl->u.b.set) decl->u.b.set(opt, 1); return 1; } if (!decl->long_name) return 0; name = skip_dash_dash(decl, arg[0]); if (!name) return 0; if (prefix) { size_t prefix_len = strlen(prefix); if (strncmp(name, prefix, prefix_len) == 0 && name[prefix_len] == '-') { name += prefix_len + 1; prefix = NULL; } } if (strncmp(name, "no-", 3)) return 0; name += 3; if (prefix) { size_t prefix_len = strlen(prefix); if (strncmp(name, prefix, prefix_len) == 0 && name[prefix_len] == '-') name += prefix_len + 1; } if (match_long_name(decl, name, name + strlen(name))) { if (decl->offset != (size_t) -1) *p = 0; if (decl->u.b.set) decl->u.b.set(opt, 0); return 1; } return 0; } static int parse_str_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int has_argument; const char *s; char **p = (char **)(((char *)opt) + decl->offset); s = skip_name(decl, arg[0], prefix, 0, &has_argument); if (!s) return 0; if (has_argument) { free(*p); *p = strdup(s); return 1; } if (arg[1]) { free(*p); *p = strdup(arg[1]); return 2; } return 0; } static int isl_arg_str_list_append(struct isl_arg *decl, void *opt, const char *s) { int *n = (int *)(((char *) opt) + decl->u.str_list.offset_n); char **list = *(char ***)(((char *) opt) + decl->offset); list = realloc(list, (*n + 1) * sizeof(char *)); if (!list) return -1; *(char ***)(((char *) opt) + decl->offset) = list; list[*n] = strdup(s); (*n)++; return 0; } static int parse_str_list_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int has_argument; const char *s; s = skip_name(decl, arg[0], prefix, 0, &has_argument); if (!s) return 0; if (has_argument) { isl_arg_str_list_append(decl, opt, s); return 1; } if (arg[1]) { isl_arg_str_list_append(decl, opt, arg[1]); return 2; } return 0; } static int parse_int_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int has_argument; const char *val; char *endptr; int *p = (int *)(((char *)opt) + decl->offset); val = skip_name(decl, arg[0], prefix, 0, &has_argument); if (!val) return 0; if (has_argument) { *p = atoi(val); return 1; } if (arg[1]) { int i = strtol(arg[1], &endptr, 0); if (*endptr == '\0') { *p = i; return 2; } } return 0; } static int parse_long_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int has_argument; const char *val; char *endptr; long *p = (long *)(((char *)opt) + decl->offset); val = skip_name(decl, arg[0], prefix, 0, &has_argument); if (!val) return 0; if (has_argument) { long l = strtol(val, NULL, 0); *p = l; if (decl->u.l.set) decl->u.l.set(opt, l); return 1; } if (arg[1]) { long l = strtol(arg[1], &endptr, 0); if (*endptr == '\0') { *p = l; if (decl->u.l.set) decl->u.l.set(opt, l); return 2; } } if (decl->u.l.default_value != decl->u.l.default_selected) { *p = decl->u.l.default_selected; if (decl->u.l.set) decl->u.l.set(opt, decl->u.l.default_selected); return 1; } return 0; } static int parse_ulong_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int has_argument; const char *val; char *endptr; unsigned long *p = (unsigned long *)(((char *)opt) + decl->offset); val = skip_name(decl, arg[0], prefix, 0, &has_argument); if (!val) return 0; if (has_argument) { *p = strtoul(val, NULL, 0); return 1; } if (arg[1]) { unsigned long ul = strtoul(arg[1], &endptr, 0); if (*endptr == '\0') { *p = ul; return 2; } } return 0; } static int parse_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt); static int parse_child_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { void *child; if (decl->offset == (size_t) -1) child = opt; else { child = *(void **)(((char *)opt) + decl->offset); prefix = decl->long_name; } return parse_option(decl->u.child.child->args, arg, prefix, child); } static int parse_option(struct isl_arg *decl, char **arg, const char *prefix, void *opt) { int i; for (i = 0; decl[i].type != isl_arg_end; ++i) { int parsed = 0; switch (decl[i].type) { case isl_arg_choice: parsed = parse_choice_option(&decl[i], arg, prefix, opt); break; case isl_arg_flags: parsed = parse_flags_option(&decl[i], arg, prefix, opt); break; case isl_arg_int: parsed = parse_int_option(&decl[i], arg, prefix, opt); break; case isl_arg_long: parsed = parse_long_option(&decl[i], arg, prefix, opt); break; case isl_arg_ulong: parsed = parse_ulong_option(&decl[i], arg, prefix, opt); break; case isl_arg_bool: parsed = parse_bool_option(&decl[i], arg, prefix, opt); break; case isl_arg_str: parsed = parse_str_option(&decl[i], arg, prefix, opt); break; case isl_arg_str_list: parsed = parse_str_list_option(&decl[i], arg, prefix, opt); break; case isl_arg_child: parsed = parse_child_option(&decl[i], arg, prefix, opt); break; case isl_arg_alias: case isl_arg_arg: case isl_arg_footer: case isl_arg_user: case isl_arg_version: case isl_arg_end: break; } if (parsed) return parsed; } return 0; } static void print_version(struct isl_arg *decl) { int i; for (i = 0; decl[i].type != isl_arg_end; ++i) { switch (decl[i].type) { case isl_arg_version: decl[i].u.version.print_version(); break; case isl_arg_child: print_version(decl[i].u.child.child->args); break; default: break; } } } static void print_version_and_exit(struct isl_arg *decl) { print_version(decl); exit(0); } static int drop_argument(int argc, char **argv, int drop, int n) { for (; drop + n < argc; ++drop) argv[drop] = argv[drop + n]; return argc - n; } static int n_arg(struct isl_arg *arg) { int i; int n_arg = 0; for (i = 0; arg[i].type != isl_arg_end; ++i) if (arg[i].type == isl_arg_arg) n_arg++; return n_arg; } static int next_arg(struct isl_arg *arg, int a) { for (++a; arg[a].type != isl_arg_end; ++a) if (arg[a].type == isl_arg_arg) return a; return -1; } /* Unless ISL_ARG_SKIP_HELP is set, check if "arg" is * equal to "--help" and if so call print_help_and_exit. */ static void check_help(struct isl_args *args, char *arg, char *prog, void *opt, unsigned flags) { if (ISL_FL_ISSET(flags, ISL_ARG_SKIP_HELP)) return; if (strcmp(arg, "--help") == 0) print_help_and_exit(args->args, prog, opt); } int isl_args_parse(struct isl_args *args, int argc, char **argv, void *opt, unsigned flags) { int a = -1; int skip = 0; int i; int n; n = n_arg(args->args); for (i = 1; i < argc; ++i) { if ((strcmp(argv[i], "--version") == 0 || strcmp(argv[i], "-V") == 0) && any_version(args->args)) print_version_and_exit(args->args); } while (argc > 1 + skip) { int parsed; if (argv[1 + skip][0] != '-') { a = next_arg(args->args, a); if (a >= 0) { char **p; p = (char **)(((char *)opt)+args->args[a].offset); free(*p); *p = strdup(argv[1 + skip]); argc = drop_argument(argc, argv, 1 + skip, 1); --n; } else if (ISL_FL_ISSET(flags, ISL_ARG_ALL)) { fprintf(stderr, "%s: extra argument: %s\n", prog_name(argv[0]), argv[1 + skip]); exit(-1); } else ++skip; continue; } check_help(args, argv[1 + skip], argv[0], opt, flags); parsed = parse_option(args->args, &argv[1 + skip], NULL, opt); if (parsed) argc = drop_argument(argc, argv, 1 + skip, parsed); else if (ISL_FL_ISSET(flags, ISL_ARG_ALL)) { fprintf(stderr, "%s: unrecognized option: %s\n", prog_name(argv[0]), argv[1 + skip]); exit(-1); } else ++skip; } if (n > 0) { fprintf(stderr, "%s: expecting %d more argument(s)\n", prog_name(argv[0]), n); exit(-1); } return argc; } cloog-0.18.2/isl/isl_scan.c0000664000175000017500000001665512254313240012367 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include "isl_basis_reduction.h" #include "isl_scan.h" #include #include "isl_tab.h" #include struct isl_counter { struct isl_scan_callback callback; isl_int count; isl_int max; }; static int increment_counter(struct isl_scan_callback *cb, __isl_take isl_vec *sample) { struct isl_counter *cnt = (struct isl_counter *)cb; isl_int_add_ui(cnt->count, cnt->count, 1); isl_vec_free(sample); if (isl_int_is_zero(cnt->max) || isl_int_lt(cnt->count, cnt->max)) return 0; return -1; } static int increment_range(struct isl_scan_callback *cb, isl_int min, isl_int max) { struct isl_counter *cnt = (struct isl_counter *)cb; isl_int_add(cnt->count, cnt->count, max); isl_int_sub(cnt->count, cnt->count, min); isl_int_add_ui(cnt->count, cnt->count, 1); if (isl_int_is_zero(cnt->max) || isl_int_lt(cnt->count, cnt->max)) return 0; isl_int_set(cnt->count, cnt->max); return -1; } /* Call callback->add with the current sample value of the tableau "tab". */ static int add_solution(struct isl_tab *tab, struct isl_scan_callback *callback) { struct isl_vec *sample; if (!tab) return -1; sample = isl_tab_get_sample_value(tab); if (!sample) return -1; return callback->add(callback, sample); } static int scan_0D(struct isl_basic_set *bset, struct isl_scan_callback *callback) { struct isl_vec *sample; sample = isl_vec_alloc(bset->ctx, 1); isl_basic_set_free(bset); if (!sample) return -1; isl_int_set_si(sample->el[0], 1); return callback->add(callback, sample); } /* Look for all integer points in "bset", which is assumed to be bounded, * and call callback->add on each of them. * * We first compute a reduced basis for the set and then scan * the set in the directions of this basis. * We basically perform a depth first search, where in each level i * we compute the range in the i-th basis vector direction, given * fixed values in the directions of the previous basis vector. * We then add an equality to the tableau fixing the value in the * direction of the current basis vector to each value in the range * in turn and then continue to the next level. * * The search is implemented iteratively. "level" identifies the current * basis vector. "init" is true if we want the first value at the current * level and false if we want the next value. * Solutions are added in the leaves of the search tree, i.e., after * we have fixed a value in each direction of the basis. */ int isl_basic_set_scan(struct isl_basic_set *bset, struct isl_scan_callback *callback) { unsigned dim; struct isl_mat *B = NULL; struct isl_tab *tab = NULL; struct isl_vec *min; struct isl_vec *max; struct isl_tab_undo **snap; int level; int init; enum isl_lp_result res; if (!bset) return -1; dim = isl_basic_set_total_dim(bset); if (dim == 0) return scan_0D(bset, callback); min = isl_vec_alloc(bset->ctx, dim); max = isl_vec_alloc(bset->ctx, dim); snap = isl_alloc_array(bset->ctx, struct isl_tab_undo *, dim); if (!min || !max || !snap) goto error; tab = isl_tab_from_basic_set(bset, 0); if (!tab) goto error; if (isl_tab_extend_cons(tab, dim + 1) < 0) goto error; tab->basis = isl_mat_identity(bset->ctx, 1 + dim); if (1) tab = isl_tab_compute_reduced_basis(tab); if (!tab) goto error; B = isl_mat_copy(tab->basis); if (!B) goto error; level = 0; init = 1; while (level >= 0) { int empty = 0; if (init) { res = isl_tab_min(tab, B->row[1 + level], bset->ctx->one, &min->el[level], NULL, 0); if (res == isl_lp_empty) empty = 1; if (res == isl_lp_error || res == isl_lp_unbounded) goto error; isl_seq_neg(B->row[1 + level] + 1, B->row[1 + level] + 1, dim); res = isl_tab_min(tab, B->row[1 + level], bset->ctx->one, &max->el[level], NULL, 0); isl_seq_neg(B->row[1 + level] + 1, B->row[1 + level] + 1, dim); isl_int_neg(max->el[level], max->el[level]); if (res == isl_lp_empty) empty = 1; if (res == isl_lp_error || res == isl_lp_unbounded) goto error; snap[level] = isl_tab_snap(tab); } else isl_int_add_ui(min->el[level], min->el[level], 1); if (empty || isl_int_gt(min->el[level], max->el[level])) { level--; init = 0; if (level >= 0) if (isl_tab_rollback(tab, snap[level]) < 0) goto error; continue; } if (level == dim - 1 && callback->add == increment_counter) { if (increment_range(callback, min->el[level], max->el[level])) goto error; level--; init = 0; if (level >= 0) if (isl_tab_rollback(tab, snap[level]) < 0) goto error; continue; } isl_int_neg(B->row[1 + level][0], min->el[level]); if (isl_tab_add_valid_eq(tab, B->row[1 + level]) < 0) goto error; isl_int_set_si(B->row[1 + level][0], 0); if (level < dim - 1) { ++level; init = 1; continue; } if (add_solution(tab, callback) < 0) goto error; init = 0; if (isl_tab_rollback(tab, snap[level]) < 0) goto error; } isl_tab_free(tab); free(snap); isl_vec_free(min); isl_vec_free(max); isl_basic_set_free(bset); isl_mat_free(B); return 0; error: isl_tab_free(tab); free(snap); isl_vec_free(min); isl_vec_free(max); isl_basic_set_free(bset); isl_mat_free(B); return -1; } int isl_set_scan(__isl_take isl_set *set, struct isl_scan_callback *callback) { int i; if (!set || !callback) goto error; set = isl_set_cow(set); set = isl_set_make_disjoint(set); set = isl_set_compute_divs(set); if (!set) goto error; for (i = 0; i < set->n; ++i) if (isl_basic_set_scan(isl_basic_set_copy(set->p[i]), callback) < 0) goto error; isl_set_free(set); return 0; error: isl_set_free(set); return -1; } int isl_basic_set_count_upto(__isl_keep isl_basic_set *bset, isl_int max, isl_int *count) { struct isl_counter cnt = { { &increment_counter } }; if (!bset) return -1; isl_int_init(cnt.count); isl_int_init(cnt.max); isl_int_set_si(cnt.count, 0); isl_int_set(cnt.max, max); if (isl_basic_set_scan(isl_basic_set_copy(bset), &cnt.callback) < 0 && isl_int_lt(cnt.count, cnt.max)) goto error; isl_int_set(*count, cnt.count); isl_int_clear(cnt.max); isl_int_clear(cnt.count); return 0; error: isl_int_clear(cnt.count); return -1; } int isl_set_count_upto(__isl_keep isl_set *set, isl_int max, isl_int *count) { struct isl_counter cnt = { { &increment_counter } }; if (!set) return -1; isl_int_init(cnt.count); isl_int_init(cnt.max); isl_int_set_si(cnt.count, 0); isl_int_set(cnt.max, max); if (isl_set_scan(isl_set_copy(set), &cnt.callback) < 0 && isl_int_lt(cnt.count, cnt.max)) goto error; isl_int_set(*count, cnt.count); isl_int_clear(cnt.max); isl_int_clear(cnt.count); return 0; error: isl_int_clear(cnt.count); return -1; } int isl_set_count(__isl_keep isl_set *set, isl_int *count) { if (!set) return -1; return isl_set_count_upto(set, set->ctx->zero, count); } /* Count the total number of elements in "set" (in an inefficient way) and * return the result. */ __isl_give isl_val *isl_set_count_val(__isl_keep isl_set *set) { isl_val *v; if (!set) return NULL; v = isl_val_zero(isl_set_get_ctx(set)); v = isl_val_cow(v); if (!v) return NULL; if (isl_set_count(set, &v->n) < 0) v = isl_val_free(v); return v; } cloog-0.18.2/isl/isl_val_private.h0000664000175000017500000000335212254313240013752 00000000000000#ifndef ISL_VAL_PRIVATE_H #define ISL_VAL_PRIVATE_H #include #include #include #include /* Represents a "value", which may be an integer value, a rational value, * plus or minus infinity or "not a number". * * Internally, +infinity is represented as 1/0, * -infinity as -1/0 and NaN as 0/0. * * A rational value is always normalized before it is passed to the user. */ struct isl_val { int ref; isl_ctx *ctx; isl_int n; isl_int d; }; #undef EL #define EL isl_val #include __isl_give isl_val *isl_val_alloc(isl_ctx *ctx); __isl_give isl_val *isl_val_normalize(__isl_take isl_val *v); __isl_give isl_val *isl_val_int_from_isl_int(isl_ctx *ctx, isl_int n); __isl_give isl_val *isl_val_rat_from_isl_int(isl_ctx *ctx, isl_int n, isl_int d); __isl_give isl_val *isl_val_cow(__isl_take isl_val *val); __isl_give isl_val *isl_val_insert_dims(__isl_take isl_val *v, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_val *isl_val_drop_dims(__isl_take isl_val *v, enum isl_dim_type type, unsigned first, unsigned n); __isl_give isl_val *isl_val_set_dim_name(__isl_take isl_val *v, enum isl_dim_type type, unsigned pos, const char *s); __isl_give isl_val *isl_val_reset_domain_space(__isl_take isl_val *v, __isl_take isl_space *space); __isl_give isl_val *isl_val_realign_domain(__isl_take isl_val *v, __isl_take isl_reordering *r); __isl_give isl_val *isl_val_zero_on_domain(__isl_take isl_local_space *ls); __isl_give isl_val *isl_val_scale_val(__isl_take isl_val *v1, __isl_take isl_val *v2); int isl_val_check_match_domain_space(__isl_keep isl_val *v, __isl_keep isl_space *space); #undef BASE #define BASE val #include #endif cloog-0.18.2/isl/isl_flow.c0000664000175000017500000012412412254313240012401 00000000000000/* * Copyright 2005-2007 Universiteit Leiden * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012 Universiteit Leiden * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, Leiden Institute of Advanced Computer Science, * Universiteit Leiden, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands * and K.U.Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A, * B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include #include enum isl_restriction_type { isl_restriction_type_empty, isl_restriction_type_none, isl_restriction_type_input, isl_restriction_type_output }; struct isl_restriction { enum isl_restriction_type type; isl_set *source; isl_set *sink; }; /* Create a restriction of the given type. */ static __isl_give isl_restriction *isl_restriction_alloc( __isl_take isl_map *source_map, enum isl_restriction_type type) { isl_ctx *ctx; isl_restriction *restr; if (!source_map) return NULL; ctx = isl_map_get_ctx(source_map); restr = isl_calloc_type(ctx, struct isl_restriction); if (!restr) goto error; restr->type = type; isl_map_free(source_map); return restr; error: isl_map_free(source_map); return NULL; } /* Create a restriction that doesn't restrict anything. */ __isl_give isl_restriction *isl_restriction_none(__isl_take isl_map *source_map) { return isl_restriction_alloc(source_map, isl_restriction_type_none); } /* Create a restriction that removes everything. */ __isl_give isl_restriction *isl_restriction_empty( __isl_take isl_map *source_map) { return isl_restriction_alloc(source_map, isl_restriction_type_empty); } /* Create a restriction on the input of the maximization problem * based on the given source and sink restrictions. */ __isl_give isl_restriction *isl_restriction_input( __isl_take isl_set *source_restr, __isl_take isl_set *sink_restr) { isl_ctx *ctx; isl_restriction *restr; if (!source_restr || !sink_restr) goto error; ctx = isl_set_get_ctx(source_restr); restr = isl_calloc_type(ctx, struct isl_restriction); if (!restr) goto error; restr->type = isl_restriction_type_input; restr->source = source_restr; restr->sink = sink_restr; return restr; error: isl_set_free(source_restr); isl_set_free(sink_restr); return NULL; } /* Create a restriction on the output of the maximization problem * based on the given source restriction. */ __isl_give isl_restriction *isl_restriction_output( __isl_take isl_set *source_restr) { isl_ctx *ctx; isl_restriction *restr; if (!source_restr) return NULL; ctx = isl_set_get_ctx(source_restr); restr = isl_calloc_type(ctx, struct isl_restriction); if (!restr) goto error; restr->type = isl_restriction_type_output; restr->source = source_restr; return restr; error: isl_set_free(source_restr); return NULL; } void *isl_restriction_free(__isl_take isl_restriction *restr) { if (!restr) return NULL; isl_set_free(restr->source); isl_set_free(restr->sink); free(restr); return NULL; } isl_ctx *isl_restriction_get_ctx(__isl_keep isl_restriction *restr) { return restr ? isl_set_get_ctx(restr->source) : NULL; } /* A private structure to keep track of a mapping together with * a user-specified identifier and a boolean indicating whether * the map represents a must or may access/dependence. */ struct isl_labeled_map { struct isl_map *map; void *data; int must; }; /* A structure containing the input for dependence analysis: * - a sink * - n_must + n_may (<= max_source) sources * - a function for determining the relative order of sources and sink * The must sources are placed before the may sources. * * domain_map is an auxiliary map that maps the sink access relation * to the domain of this access relation. * * restrict_fn is a callback that (if not NULL) will be called * right before any lexicographical maximization. */ struct isl_access_info { isl_map *domain_map; struct isl_labeled_map sink; isl_access_level_before level_before; isl_access_restrict restrict_fn; void *restrict_user; int max_source; int n_must; int n_may; struct isl_labeled_map source[1]; }; /* A structure containing the output of dependence analysis: * - n_source dependences * - a wrapped subset of the sink for which definitely no source could be found * - a wrapped subset of the sink for which possibly no source could be found */ struct isl_flow { isl_set *must_no_source; isl_set *may_no_source; int n_source; struct isl_labeled_map *dep; }; /* Construct an isl_access_info structure and fill it up with * the given data. The number of sources is set to 0. */ __isl_give isl_access_info *isl_access_info_alloc(__isl_take isl_map *sink, void *sink_user, isl_access_level_before fn, int max_source) { isl_ctx *ctx; struct isl_access_info *acc; if (!sink) return NULL; ctx = isl_map_get_ctx(sink); isl_assert(ctx, max_source >= 0, goto error); acc = isl_calloc(ctx, struct isl_access_info, sizeof(struct isl_access_info) + (max_source - 1) * sizeof(struct isl_labeled_map)); if (!acc) goto error; acc->sink.map = sink; acc->sink.data = sink_user; acc->level_before = fn; acc->max_source = max_source; acc->n_must = 0; acc->n_may = 0; return acc; error: isl_map_free(sink); return NULL; } /* Free the given isl_access_info structure. */ void *isl_access_info_free(__isl_take isl_access_info *acc) { int i; if (!acc) return NULL; isl_map_free(acc->domain_map); isl_map_free(acc->sink.map); for (i = 0; i < acc->n_must + acc->n_may; ++i) isl_map_free(acc->source[i].map); free(acc); return NULL; } isl_ctx *isl_access_info_get_ctx(__isl_keep isl_access_info *acc) { return acc ? isl_map_get_ctx(acc->sink.map) : NULL; } __isl_give isl_access_info *isl_access_info_set_restrict( __isl_take isl_access_info *acc, isl_access_restrict fn, void *user) { if (!acc) return NULL; acc->restrict_fn = fn; acc->restrict_user = user; return acc; } /* Add another source to an isl_access_info structure, making * sure the "must" sources are placed before the "may" sources. * This function may be called at most max_source times on a * given isl_access_info structure, with max_source as specified * in the call to isl_access_info_alloc that constructed the structure. */ __isl_give isl_access_info *isl_access_info_add_source( __isl_take isl_access_info *acc, __isl_take isl_map *source, int must, void *source_user) { isl_ctx *ctx; if (!acc) goto error; ctx = isl_map_get_ctx(acc->sink.map); isl_assert(ctx, acc->n_must + acc->n_may < acc->max_source, goto error); if (must) { if (acc->n_may) acc->source[acc->n_must + acc->n_may] = acc->source[acc->n_must]; acc->source[acc->n_must].map = source; acc->source[acc->n_must].data = source_user; acc->source[acc->n_must].must = 1; acc->n_must++; } else { acc->source[acc->n_must + acc->n_may].map = source; acc->source[acc->n_must + acc->n_may].data = source_user; acc->source[acc->n_must + acc->n_may].must = 0; acc->n_may++; } return acc; error: isl_map_free(source); isl_access_info_free(acc); return NULL; } /* Return -n, 0 or n (with n a positive value), depending on whether * the source access identified by p1 should be sorted before, together * or after that identified by p2. * * If p1 appears before p2, then it should be sorted first. * For more generic initial schedules, it is possible that neither * p1 nor p2 appears before the other, or at least not in any obvious way. * We therefore also check if p2 appears before p1, in which case p2 * should be sorted first. * If not, we try to order the two statements based on the description * of the iteration domains. This results in an arbitrary, but fairly * stable ordering. */ static int access_sort_cmp(const void *p1, const void *p2, void *user) { isl_access_info *acc = user; const struct isl_labeled_map *i1, *i2; int level1, level2; uint32_t h1, h2; i1 = (const struct isl_labeled_map *) p1; i2 = (const struct isl_labeled_map *) p2; level1 = acc->level_before(i1->data, i2->data); if (level1 % 2) return -1; level2 = acc->level_before(i2->data, i1->data); if (level2 % 2) return 1; h1 = isl_map_get_hash(i1->map); h2 = isl_map_get_hash(i2->map); return h1 > h2 ? 1 : h1 < h2 ? -1 : 0; } /* Sort the must source accesses in their textual order. */ static __isl_give isl_access_info *isl_access_info_sort_sources( __isl_take isl_access_info *acc) { if (!acc) return NULL; if (acc->n_must <= 1) return acc; if (isl_sort(acc->source, acc->n_must, sizeof(struct isl_labeled_map), access_sort_cmp, acc) < 0) return isl_access_info_free(acc); return acc; } /* Align the parameters of the two spaces if needed and then call * isl_space_join. */ static __isl_give isl_space *space_align_and_join(__isl_take isl_space *left, __isl_take isl_space *right) { if (isl_space_match(left, isl_dim_param, right, isl_dim_param)) return isl_space_join(left, right); left = isl_space_align_params(left, isl_space_copy(right)); right = isl_space_align_params(right, isl_space_copy(left)); return isl_space_join(left, right); } /* Initialize an empty isl_flow structure corresponding to a given * isl_access_info structure. * For each must access, two dependences are created (initialized * to the empty relation), one for the resulting must dependences * and one for the resulting may dependences. May accesses can * only lead to may dependences, so only one dependence is created * for each of them. * This function is private as isl_flow structures are only supposed * to be created by isl_access_info_compute_flow. */ static __isl_give isl_flow *isl_flow_alloc(__isl_keep isl_access_info *acc) { int i, n; struct isl_ctx *ctx; struct isl_flow *dep; if (!acc) return NULL; ctx = isl_map_get_ctx(acc->sink.map); dep = isl_calloc_type(ctx, struct isl_flow); if (!dep) return NULL; n = 2 * acc->n_must + acc->n_may; dep->dep = isl_calloc_array(ctx, struct isl_labeled_map, n); if (n && !dep->dep) goto error; dep->n_source = n; for (i = 0; i < acc->n_must; ++i) { isl_space *dim; dim = space_align_and_join( isl_map_get_space(acc->source[i].map), isl_space_reverse(isl_map_get_space(acc->sink.map))); dep->dep[2 * i].map = isl_map_empty(dim); dep->dep[2 * i + 1].map = isl_map_copy(dep->dep[2 * i].map); dep->dep[2 * i].data = acc->source[i].data; dep->dep[2 * i + 1].data = acc->source[i].data; dep->dep[2 * i].must = 1; dep->dep[2 * i + 1].must = 0; if (!dep->dep[2 * i].map || !dep->dep[2 * i + 1].map) goto error; } for (i = acc->n_must; i < acc->n_must + acc->n_may; ++i) { isl_space *dim; dim = space_align_and_join( isl_map_get_space(acc->source[i].map), isl_space_reverse(isl_map_get_space(acc->sink.map))); dep->dep[acc->n_must + i].map = isl_map_empty(dim); dep->dep[acc->n_must + i].data = acc->source[i].data; dep->dep[acc->n_must + i].must = 0; if (!dep->dep[acc->n_must + i].map) goto error; } return dep; error: isl_flow_free(dep); return NULL; } /* Iterate over all sources and for each resulting flow dependence * that is not empty, call the user specfied function. * The second argument in this function call identifies the source, * while the third argument correspond to the final argument of * the isl_flow_foreach call. */ int isl_flow_foreach(__isl_keep isl_flow *deps, int (*fn)(__isl_take isl_map *dep, int must, void *dep_user, void *user), void *user) { int i; if (!deps) return -1; for (i = 0; i < deps->n_source; ++i) { if (isl_map_plain_is_empty(deps->dep[i].map)) continue; if (fn(isl_map_copy(deps->dep[i].map), deps->dep[i].must, deps->dep[i].data, user) < 0) return -1; } return 0; } /* Return a copy of the subset of the sink for which no source could be found. */ __isl_give isl_map *isl_flow_get_no_source(__isl_keep isl_flow *deps, int must) { if (!deps) return NULL; if (must) return isl_set_unwrap(isl_set_copy(deps->must_no_source)); else return isl_set_unwrap(isl_set_copy(deps->may_no_source)); } void isl_flow_free(__isl_take isl_flow *deps) { int i; if (!deps) return; isl_set_free(deps->must_no_source); isl_set_free(deps->may_no_source); if (deps->dep) { for (i = 0; i < deps->n_source; ++i) isl_map_free(deps->dep[i].map); free(deps->dep); } free(deps); } isl_ctx *isl_flow_get_ctx(__isl_keep isl_flow *deps) { return deps ? isl_set_get_ctx(deps->must_no_source) : NULL; } /* Return a map that enforces that the domain iteration occurs after * the range iteration at the given level. * If level is odd, then the domain iteration should occur after * the target iteration in their shared level/2 outermost loops. * In this case we simply need to enforce that these outermost * loop iterations are the same. * If level is even, then the loop iterator of the domain should * be greater than the loop iterator of the range at the last * of the level/2 shared loops, i.e., loop level/2 - 1. */ static __isl_give isl_map *after_at_level(__isl_take isl_space *dim, int level) { struct isl_basic_map *bmap; if (level % 2) bmap = isl_basic_map_equal(dim, level/2); else bmap = isl_basic_map_more_at(dim, level/2 - 1); return isl_map_from_basic_map(bmap); } /* Compute the partial lexicographic maximum of "dep" on domain "sink", * but first check if the user has set acc->restrict_fn and if so * update either the input or the output of the maximization problem * with respect to the resulting restriction. * * Since the user expects a mapping from sink iterations to source iterations, * whereas the domain of "dep" is a wrapped map, mapping sink iterations * to accessed array elements, we first need to project out the accessed * sink array elements by applying acc->domain_map. * Similarly, the sink restriction specified by the user needs to be * converted back to the wrapped map. */ static __isl_give isl_map *restricted_partial_lexmax( __isl_keep isl_access_info *acc, __isl_take isl_map *dep, int source, __isl_take isl_set *sink, __isl_give isl_set **empty) { isl_map *source_map; isl_restriction *restr; isl_set *sink_domain; isl_set *sink_restr; isl_map *res; if (!acc->restrict_fn) return isl_map_partial_lexmax(dep, sink, empty); source_map = isl_map_copy(dep); source_map = isl_map_apply_domain(source_map, isl_map_copy(acc->domain_map)); sink_domain = isl_set_copy(sink); sink_domain = isl_set_apply(sink_domain, isl_map_copy(acc->domain_map)); restr = acc->restrict_fn(source_map, sink_domain, acc->source[source].data, acc->restrict_user); isl_set_free(sink_domain); isl_map_free(source_map); if (!restr) goto error; if (restr->type == isl_restriction_type_input) { dep = isl_map_intersect_range(dep, isl_set_copy(restr->source)); sink_restr = isl_set_copy(restr->sink); sink_restr = isl_set_apply(sink_restr, isl_map_reverse(isl_map_copy(acc->domain_map))); sink = isl_set_intersect(sink, sink_restr); } else if (restr->type == isl_restriction_type_empty) { isl_space *space = isl_map_get_space(dep); isl_map_free(dep); dep = isl_map_empty(space); } res = isl_map_partial_lexmax(dep, sink, empty); if (restr->type == isl_restriction_type_output) res = isl_map_intersect_range(res, isl_set_copy(restr->source)); isl_restriction_free(restr); return res; error: isl_map_free(dep); isl_set_free(sink); *empty = NULL; return NULL; } /* Compute the last iteration of must source j that precedes the sink * at the given level for sink iterations in set_C. * The subset of set_C for which no such iteration can be found is returned * in *empty. */ static struct isl_map *last_source(struct isl_access_info *acc, struct isl_set *set_C, int j, int level, struct isl_set **empty) { struct isl_map *read_map; struct isl_map *write_map; struct isl_map *dep_map; struct isl_map *after; struct isl_map *result; read_map = isl_map_copy(acc->sink.map); write_map = isl_map_copy(acc->source[j].map); write_map = isl_map_reverse(write_map); dep_map = isl_map_apply_range(read_map, write_map); after = after_at_level(isl_map_get_space(dep_map), level); dep_map = isl_map_intersect(dep_map, after); result = restricted_partial_lexmax(acc, dep_map, j, set_C, empty); result = isl_map_reverse(result); return result; } /* For a given mapping between iterations of must source j and iterations * of the sink, compute the last iteration of must source k preceding * the sink at level before_level for any of the sink iterations, * but following the corresponding iteration of must source j at level * after_level. */ static struct isl_map *last_later_source(struct isl_access_info *acc, struct isl_map *old_map, int j, int before_level, int k, int after_level, struct isl_set **empty) { isl_space *dim; struct isl_set *set_C; struct isl_map *read_map; struct isl_map *write_map; struct isl_map *dep_map; struct isl_map *after_write; struct isl_map *before_read; struct isl_map *result; set_C = isl_map_range(isl_map_copy(old_map)); read_map = isl_map_copy(acc->sink.map); write_map = isl_map_copy(acc->source[k].map); write_map = isl_map_reverse(write_map); dep_map = isl_map_apply_range(read_map, write_map); dim = space_align_and_join(isl_map_get_space(acc->source[k].map), isl_space_reverse(isl_map_get_space(acc->source[j].map))); after_write = after_at_level(dim, after_level); after_write = isl_map_apply_range(after_write, old_map); after_write = isl_map_reverse(after_write); dep_map = isl_map_intersect(dep_map, after_write); before_read = after_at_level(isl_map_get_space(dep_map), before_level); dep_map = isl_map_intersect(dep_map, before_read); result = restricted_partial_lexmax(acc, dep_map, k, set_C, empty); result = isl_map_reverse(result); return result; } /* Given a shared_level between two accesses, return 1 if the * the first can precede the second at the requested target_level. * If the target level is odd, i.e., refers to a statement level * dimension, then first needs to precede second at the requested * level, i.e., shared_level must be equal to target_level. * If the target level is odd, then the two loops should share * at least the requested number of outer loops. */ static int can_precede_at_level(int shared_level, int target_level) { if (shared_level < target_level) return 0; if ((target_level % 2) && shared_level > target_level) return 0; return 1; } /* Given a possible flow dependence temp_rel[j] between source j and the sink * at level sink_level, remove those elements for which * there is an iteration of another source k < j that is closer to the sink. * The flow dependences temp_rel[k] are updated with the improved sources. * Any improved source needs to precede the sink at the same level * and needs to follow source j at the same or a deeper level. * The lower this level, the later the execution date of source k. * We therefore consider lower levels first. * * If temp_rel[j] is empty, then there can be no improvement and * we return immediately. */ static int intermediate_sources(__isl_keep isl_access_info *acc, struct isl_map **temp_rel, int j, int sink_level) { int k, level; int depth = 2 * isl_map_dim(acc->source[j].map, isl_dim_in) + 1; if (isl_map_plain_is_empty(temp_rel[j])) return 0; for (k = j - 1; k >= 0; --k) { int plevel, plevel2; plevel = acc->level_before(acc->source[k].data, acc->sink.data); if (!can_precede_at_level(plevel, sink_level)) continue; plevel2 = acc->level_before(acc->source[j].data, acc->source[k].data); for (level = sink_level; level <= depth; ++level) { struct isl_map *T; struct isl_set *trest; struct isl_map *copy; if (!can_precede_at_level(plevel2, level)) continue; copy = isl_map_copy(temp_rel[j]); T = last_later_source(acc, copy, j, sink_level, k, level, &trest); if (isl_map_plain_is_empty(T)) { isl_set_free(trest); isl_map_free(T); continue; } temp_rel[j] = isl_map_intersect_range(temp_rel[j], trest); temp_rel[k] = isl_map_union_disjoint(temp_rel[k], T); } } return 0; } /* Compute all iterations of may source j that precedes the sink at the given * level for sink iterations in set_C. */ static __isl_give isl_map *all_sources(__isl_keep isl_access_info *acc, __isl_take isl_set *set_C, int j, int level) { isl_map *read_map; isl_map *write_map; isl_map *dep_map; isl_map *after; read_map = isl_map_copy(acc->sink.map); read_map = isl_map_intersect_domain(read_map, set_C); write_map = isl_map_copy(acc->source[acc->n_must + j].map); write_map = isl_map_reverse(write_map); dep_map = isl_map_apply_range(read_map, write_map); after = after_at_level(isl_map_get_space(dep_map), level); dep_map = isl_map_intersect(dep_map, after); return isl_map_reverse(dep_map); } /* For a given mapping between iterations of must source k and iterations * of the sink, compute the all iteration of may source j preceding * the sink at level before_level for any of the sink iterations, * but following the corresponding iteration of must source k at level * after_level. */ static __isl_give isl_map *all_later_sources(__isl_keep isl_access_info *acc, __isl_keep isl_map *old_map, int j, int before_level, int k, int after_level) { isl_space *dim; isl_set *set_C; isl_map *read_map; isl_map *write_map; isl_map *dep_map; isl_map *after_write; isl_map *before_read; set_C = isl_map_range(isl_map_copy(old_map)); read_map = isl_map_copy(acc->sink.map); read_map = isl_map_intersect_domain(read_map, set_C); write_map = isl_map_copy(acc->source[acc->n_must + j].map); write_map = isl_map_reverse(write_map); dep_map = isl_map_apply_range(read_map, write_map); dim = isl_space_join(isl_map_get_space(acc->source[acc->n_must + j].map), isl_space_reverse(isl_map_get_space(acc->source[k].map))); after_write = after_at_level(dim, after_level); after_write = isl_map_apply_range(after_write, old_map); after_write = isl_map_reverse(after_write); dep_map = isl_map_intersect(dep_map, after_write); before_read = after_at_level(isl_map_get_space(dep_map), before_level); dep_map = isl_map_intersect(dep_map, before_read); return isl_map_reverse(dep_map); } /* Given the must and may dependence relations for the must accesses * for level sink_level, check if there are any accesses of may access j * that occur in between and return their union. * If some of these accesses are intermediate with respect to * (previously thought to be) must dependences, then these * must dependences are turned into may dependences. */ static __isl_give isl_map *all_intermediate_sources( __isl_keep isl_access_info *acc, __isl_take isl_map *map, struct isl_map **must_rel, struct isl_map **may_rel, int j, int sink_level) { int k, level; int depth = 2 * isl_map_dim(acc->source[acc->n_must + j].map, isl_dim_in) + 1; for (k = 0; k < acc->n_must; ++k) { int plevel; if (isl_map_plain_is_empty(may_rel[k]) && isl_map_plain_is_empty(must_rel[k])) continue; plevel = acc->level_before(acc->source[k].data, acc->source[acc->n_must + j].data); for (level = sink_level; level <= depth; ++level) { isl_map *T; isl_map *copy; isl_set *ran; if (!can_precede_at_level(plevel, level)) continue; copy = isl_map_copy(may_rel[k]); T = all_later_sources(acc, copy, j, sink_level, k, level); map = isl_map_union(map, T); copy = isl_map_copy(must_rel[k]); T = all_later_sources(acc, copy, j, sink_level, k, level); ran = isl_map_range(isl_map_copy(T)); map = isl_map_union(map, T); may_rel[k] = isl_map_union_disjoint(may_rel[k], isl_map_intersect_range(isl_map_copy(must_rel[k]), isl_set_copy(ran))); T = isl_map_from_domain_and_range( isl_set_universe( isl_space_domain(isl_map_get_space(must_rel[k]))), ran); must_rel[k] = isl_map_subtract(must_rel[k], T); } } return map; } /* Compute dependences for the case where all accesses are "may" * accesses, which boils down to computing memory based dependences. * The generic algorithm would also work in this case, but it would * be overkill to use it. */ static __isl_give isl_flow *compute_mem_based_dependences( __isl_keep isl_access_info *acc) { int i; isl_set *mustdo; isl_set *maydo; isl_flow *res; res = isl_flow_alloc(acc); if (!res) return NULL; mustdo = isl_map_domain(isl_map_copy(acc->sink.map)); maydo = isl_set_copy(mustdo); for (i = 0; i < acc->n_may; ++i) { int plevel; int is_before; isl_space *dim; isl_map *before; isl_map *dep; plevel = acc->level_before(acc->source[i].data, acc->sink.data); is_before = plevel & 1; plevel >>= 1; dim = isl_map_get_space(res->dep[i].map); if (is_before) before = isl_map_lex_le_first(dim, plevel); else before = isl_map_lex_lt_first(dim, plevel); dep = isl_map_apply_range(isl_map_copy(acc->source[i].map), isl_map_reverse(isl_map_copy(acc->sink.map))); dep = isl_map_intersect(dep, before); mustdo = isl_set_subtract(mustdo, isl_map_range(isl_map_copy(dep))); res->dep[i].map = isl_map_union(res->dep[i].map, dep); } res->may_no_source = isl_set_subtract(maydo, isl_set_copy(mustdo)); res->must_no_source = mustdo; return res; } /* Compute dependences for the case where there is at least one * "must" access. * * The core algorithm considers all levels in which a source may precede * the sink, where a level may either be a statement level or a loop level. * The outermost statement level is 1, the first loop level is 2, etc... * The algorithm basically does the following: * for all levels l of the read access from innermost to outermost * for all sources w that may precede the sink access at that level * compute the last iteration of the source that precedes the sink access * at that level * add result to possible last accesses at level l of source w * for all sources w2 that we haven't considered yet at this level that may * also precede the sink access * for all levels l2 of w from l to innermost * for all possible last accesses dep of w at l * compute last iteration of w2 between the source and sink * of dep * add result to possible last accesses at level l of write w2 * and replace possible last accesses dep by the remainder * * * The above algorithm is applied to the must access. During the course * of the algorithm, we keep track of sink iterations that still * need to be considered. These iterations are split into those that * haven't been matched to any source access (mustdo) and those that have only * been matched to may accesses (maydo). * At the end of each level, we also consider the may accesses. * In particular, we consider may accesses that precede the remaining * sink iterations, moving elements from mustdo to maydo when appropriate, * and may accesses that occur between a must source and a sink of any * dependences found at the current level, turning must dependences into * may dependences when appropriate. * */ static __isl_give isl_flow *compute_val_based_dependences( __isl_keep isl_access_info *acc) { isl_ctx *ctx; isl_flow *res; isl_set *mustdo = NULL; isl_set *maydo = NULL; int level, j; int depth; isl_map **must_rel = NULL; isl_map **may_rel = NULL; if (!acc) return NULL; res = isl_flow_alloc(acc); if (!res) goto error; ctx = isl_map_get_ctx(acc->sink.map); depth = 2 * isl_map_dim(acc->sink.map, isl_dim_in) + 1; mustdo = isl_map_domain(isl_map_copy(acc->sink.map)); maydo = isl_set_empty_like(mustdo); if (!mustdo || !maydo) goto error; if (isl_set_plain_is_empty(mustdo)) goto done; must_rel = isl_alloc_array(ctx, struct isl_map *, acc->n_must); may_rel = isl_alloc_array(ctx, struct isl_map *, acc->n_must); if (!must_rel || !may_rel) goto error; for (level = depth; level >= 1; --level) { for (j = acc->n_must-1; j >=0; --j) { must_rel[j] = isl_map_empty_like(res->dep[j].map); may_rel[j] = isl_map_copy(must_rel[j]); } for (j = acc->n_must - 1; j >= 0; --j) { struct isl_map *T; struct isl_set *rest; int plevel; plevel = acc->level_before(acc->source[j].data, acc->sink.data); if (!can_precede_at_level(plevel, level)) continue; T = last_source(acc, mustdo, j, level, &rest); must_rel[j] = isl_map_union_disjoint(must_rel[j], T); mustdo = rest; intermediate_sources(acc, must_rel, j, level); T = last_source(acc, maydo, j, level, &rest); may_rel[j] = isl_map_union_disjoint(may_rel[j], T); maydo = rest; intermediate_sources(acc, may_rel, j, level); if (isl_set_plain_is_empty(mustdo) && isl_set_plain_is_empty(maydo)) break; } for (j = j - 1; j >= 0; --j) { int plevel; plevel = acc->level_before(acc->source[j].data, acc->sink.data); if (!can_precede_at_level(plevel, level)) continue; intermediate_sources(acc, must_rel, j, level); intermediate_sources(acc, may_rel, j, level); } for (j = 0; j < acc->n_may; ++j) { int plevel; isl_map *T; isl_set *ran; plevel = acc->level_before(acc->source[acc->n_must + j].data, acc->sink.data); if (!can_precede_at_level(plevel, level)) continue; T = all_sources(acc, isl_set_copy(maydo), j, level); res->dep[2 * acc->n_must + j].map = isl_map_union(res->dep[2 * acc->n_must + j].map, T); T = all_sources(acc, isl_set_copy(mustdo), j, level); ran = isl_map_range(isl_map_copy(T)); res->dep[2 * acc->n_must + j].map = isl_map_union(res->dep[2 * acc->n_must + j].map, T); mustdo = isl_set_subtract(mustdo, isl_set_copy(ran)); maydo = isl_set_union_disjoint(maydo, ran); T = res->dep[2 * acc->n_must + j].map; T = all_intermediate_sources(acc, T, must_rel, may_rel, j, level); res->dep[2 * acc->n_must + j].map = T; } for (j = acc->n_must - 1; j >= 0; --j) { res->dep[2 * j].map = isl_map_union_disjoint(res->dep[2 * j].map, must_rel[j]); res->dep[2 * j + 1].map = isl_map_union_disjoint(res->dep[2 * j + 1].map, may_rel[j]); } if (isl_set_plain_is_empty(mustdo) && isl_set_plain_is_empty(maydo)) break; } free(must_rel); free(may_rel); done: res->must_no_source = mustdo; res->may_no_source = maydo; return res; error: isl_flow_free(res); isl_set_free(mustdo); isl_set_free(maydo); free(must_rel); free(may_rel); return NULL; } /* Given a "sink" access, a list of n "source" accesses, * compute for each iteration of the sink access * and for each element accessed by that iteration, * the source access in the list that last accessed the * element accessed by the sink access before this sink access. * Each access is given as a map from the loop iterators * to the array indices. * The result is a list of n relations between source and sink * iterations and a subset of the domain of the sink access, * corresponding to those iterations that access an element * not previously accessed. * * To deal with multi-valued sink access relations, the sink iteration * domain is first extended with dimensions that correspond to the data * space. After the computation is finished, these extra dimensions are * projected out again. */ __isl_give isl_flow *isl_access_info_compute_flow(__isl_take isl_access_info *acc) { int j; struct isl_flow *res = NULL; if (!acc) return NULL; acc->domain_map = isl_map_domain_map(isl_map_copy(acc->sink.map)); acc->sink.map = isl_map_range_map(acc->sink.map); if (!acc->sink.map) goto error; if (acc->n_must == 0) res = compute_mem_based_dependences(acc); else { acc = isl_access_info_sort_sources(acc); res = compute_val_based_dependences(acc); } if (!res) goto error; for (j = 0; j < res->n_source; ++j) { res->dep[j].map = isl_map_apply_range(res->dep[j].map, isl_map_copy(acc->domain_map)); if (!res->dep[j].map) goto error; } if (!res->must_no_source || !res->may_no_source) goto error; isl_access_info_free(acc); return res; error: isl_access_info_free(acc); isl_flow_free(res); return NULL; } /* Keep track of some information about a schedule for a given * access. In particular, keep track of which dimensions * have a constant value and of the actual constant values. */ struct isl_sched_info { int *is_cst; isl_vec *cst; }; static void sched_info_free(__isl_take struct isl_sched_info *info) { if (!info) return; isl_vec_free(info->cst); free(info->is_cst); free(info); } /* Extract information on the constant dimensions of the schedule * for a given access. The "map" is of the form * * [S -> D] -> A * * with S the schedule domain, D the iteration domain and A the data domain. */ static __isl_give struct isl_sched_info *sched_info_alloc( __isl_keep isl_map *map) { isl_ctx *ctx; isl_space *dim; struct isl_sched_info *info; int i, n; if (!map) return NULL; dim = isl_space_unwrap(isl_space_domain(isl_map_get_space(map))); if (!dim) return NULL; n = isl_space_dim(dim, isl_dim_in); isl_space_free(dim); ctx = isl_map_get_ctx(map); info = isl_alloc_type(ctx, struct isl_sched_info); if (!info) return NULL; info->is_cst = isl_alloc_array(ctx, int, n); info->cst = isl_vec_alloc(ctx, n); if (n && (!info->is_cst || !info->cst)) goto error; for (i = 0; i < n; ++i) { isl_val *v; v = isl_map_plain_get_val_if_fixed(map, isl_dim_in, i); if (!v) goto error; info->is_cst[i] = !isl_val_is_nan(v); if (info->is_cst[i]) info->cst = isl_vec_set_element_val(info->cst, i, v); else isl_val_free(v); } return info; error: sched_info_free(info); return NULL; } struct isl_compute_flow_data { isl_union_map *must_source; isl_union_map *may_source; isl_union_map *must_dep; isl_union_map *may_dep; isl_union_map *must_no_source; isl_union_map *may_no_source; int count; int must; isl_space *dim; struct isl_sched_info *sink_info; struct isl_sched_info **source_info; isl_access_info *accesses; }; static int count_matching_array(__isl_take isl_map *map, void *user) { int eq; isl_space *dim; struct isl_compute_flow_data *data; data = (struct isl_compute_flow_data *)user; dim = isl_space_range(isl_map_get_space(map)); eq = isl_space_is_equal(dim, data->dim); isl_space_free(dim); isl_map_free(map); if (eq < 0) return -1; if (eq) data->count++; return 0; } static int collect_matching_array(__isl_take isl_map *map, void *user) { int eq; isl_space *dim; struct isl_sched_info *info; struct isl_compute_flow_data *data; data = (struct isl_compute_flow_data *)user; dim = isl_space_range(isl_map_get_space(map)); eq = isl_space_is_equal(dim, data->dim); isl_space_free(dim); if (eq < 0) goto error; if (!eq) { isl_map_free(map); return 0; } info = sched_info_alloc(map); data->source_info[data->count] = info; data->accesses = isl_access_info_add_source(data->accesses, map, data->must, info); data->count++; return 0; error: isl_map_free(map); return -1; } /* Determine the shared nesting level and the "textual order" of * the given accesses. * * We first determine the minimal schedule dimension for both accesses. * * If among those dimensions, we can find one where both have a fixed * value and if moreover those values are different, then the previous * dimension is the last shared nesting level and the textual order * is determined based on the order of the fixed values. * If no such fixed values can be found, then we set the shared * nesting level to the minimal schedule dimension, with no textual ordering. */ static int before(void *first, void *second) { struct isl_sched_info *info1 = first; struct isl_sched_info *info2 = second; int n1, n2; int i; n1 = isl_vec_size(info1->cst); n2 = isl_vec_size(info2->cst); if (n2 < n1) n1 = n2; for (i = 0; i < n1; ++i) { int r; int cmp; if (!info1->is_cst[i]) continue; if (!info2->is_cst[i]) continue; cmp = isl_vec_cmp_element(info1->cst, info2->cst, i); if (cmp == 0) continue; r = 2 * i + (cmp < 0); return r; } return 2 * n1; } /* Given a sink access, look for all the source accesses that access * the same array and perform dataflow analysis on them using * isl_access_info_compute_flow. */ static int compute_flow(__isl_take isl_map *map, void *user) { int i; isl_ctx *ctx; struct isl_compute_flow_data *data; isl_flow *flow; data = (struct isl_compute_flow_data *)user; ctx = isl_map_get_ctx(map); data->accesses = NULL; data->sink_info = NULL; data->source_info = NULL; data->count = 0; data->dim = isl_space_range(isl_map_get_space(map)); if (isl_union_map_foreach_map(data->must_source, &count_matching_array, data) < 0) goto error; if (isl_union_map_foreach_map(data->may_source, &count_matching_array, data) < 0) goto error; data->sink_info = sched_info_alloc(map); data->source_info = isl_calloc_array(ctx, struct isl_sched_info *, data->count); data->accesses = isl_access_info_alloc(isl_map_copy(map), data->sink_info, &before, data->count); if (!data->sink_info || (data->count && !data->source_info) || !data->accesses) goto error; data->count = 0; data->must = 1; if (isl_union_map_foreach_map(data->must_source, &collect_matching_array, data) < 0) goto error; data->must = 0; if (isl_union_map_foreach_map(data->may_source, &collect_matching_array, data) < 0) goto error; flow = isl_access_info_compute_flow(data->accesses); data->accesses = NULL; if (!flow) goto error; data->must_no_source = isl_union_map_union(data->must_no_source, isl_union_map_from_map(isl_flow_get_no_source(flow, 1))); data->may_no_source = isl_union_map_union(data->may_no_source, isl_union_map_from_map(isl_flow_get_no_source(flow, 0))); for (i = 0; i < flow->n_source; ++i) { isl_union_map *dep; dep = isl_union_map_from_map(isl_map_copy(flow->dep[i].map)); if (flow->dep[i].must) data->must_dep = isl_union_map_union(data->must_dep, dep); else data->may_dep = isl_union_map_union(data->may_dep, dep); } isl_flow_free(flow); sched_info_free(data->sink_info); if (data->source_info) { for (i = 0; i < data->count; ++i) sched_info_free(data->source_info[i]); free(data->source_info); } isl_space_free(data->dim); isl_map_free(map); return 0; error: isl_access_info_free(data->accesses); sched_info_free(data->sink_info); if (data->source_info) { for (i = 0; i < data->count; ++i) sched_info_free(data->source_info[i]); free(data->source_info); } isl_space_free(data->dim); isl_map_free(map); return -1; } /* Given a collection of "sink" and "source" accesses, * compute for each iteration of a sink access * and for each element accessed by that iteration, * the source access in the list that last accessed the * element accessed by the sink access before this sink access. * Each access is given as a map from the loop iterators * to the array indices. * The result is a relations between source and sink * iterations and a subset of the domain of the sink accesses, * corresponding to those iterations that access an element * not previously accessed. * * We first prepend the schedule dimensions to the domain * of the accesses so that we can easily compare their relative order. * Then we consider each sink access individually in compute_flow. */ int isl_union_map_compute_flow(__isl_take isl_union_map *sink, __isl_take isl_union_map *must_source, __isl_take isl_union_map *may_source, __isl_take isl_union_map *schedule, __isl_give isl_union_map **must_dep, __isl_give isl_union_map **may_dep, __isl_give isl_union_map **must_no_source, __isl_give isl_union_map **may_no_source) { isl_space *dim; isl_union_map *range_map = NULL; struct isl_compute_flow_data data; sink = isl_union_map_align_params(sink, isl_union_map_get_space(must_source)); sink = isl_union_map_align_params(sink, isl_union_map_get_space(may_source)); sink = isl_union_map_align_params(sink, isl_union_map_get_space(schedule)); dim = isl_union_map_get_space(sink); must_source = isl_union_map_align_params(must_source, isl_space_copy(dim)); may_source = isl_union_map_align_params(may_source, isl_space_copy(dim)); schedule = isl_union_map_align_params(schedule, isl_space_copy(dim)); schedule = isl_union_map_reverse(schedule); range_map = isl_union_map_range_map(schedule); schedule = isl_union_map_reverse(isl_union_map_copy(range_map)); sink = isl_union_map_apply_domain(sink, isl_union_map_copy(schedule)); must_source = isl_union_map_apply_domain(must_source, isl_union_map_copy(schedule)); may_source = isl_union_map_apply_domain(may_source, schedule); data.must_source = must_source; data.may_source = may_source; data.must_dep = must_dep ? isl_union_map_empty(isl_space_copy(dim)) : NULL; data.may_dep = may_dep ? isl_union_map_empty(isl_space_copy(dim)) : NULL; data.must_no_source = must_no_source ? isl_union_map_empty(isl_space_copy(dim)) : NULL; data.may_no_source = may_no_source ? isl_union_map_empty(isl_space_copy(dim)) : NULL; isl_space_free(dim); if (isl_union_map_foreach_map(sink, &compute_flow, &data) < 0) goto error; isl_union_map_free(sink); isl_union_map_free(must_source); isl_union_map_free(may_source); if (must_dep) { data.must_dep = isl_union_map_apply_domain(data.must_dep, isl_union_map_copy(range_map)); data.must_dep = isl_union_map_apply_range(data.must_dep, isl_union_map_copy(range_map)); *must_dep = data.must_dep; } if (may_dep) { data.may_dep = isl_union_map_apply_domain(data.may_dep, isl_union_map_copy(range_map)); data.may_dep = isl_union_map_apply_range(data.may_dep, isl_union_map_copy(range_map)); *may_dep = data.may_dep; } if (must_no_source) { data.must_no_source = isl_union_map_apply_domain( data.must_no_source, isl_union_map_copy(range_map)); *must_no_source = data.must_no_source; } if (may_no_source) { data.may_no_source = isl_union_map_apply_domain( data.may_no_source, isl_union_map_copy(range_map)); *may_no_source = data.may_no_source; } isl_union_map_free(range_map); return 0; error: isl_union_map_free(range_map); isl_union_map_free(sink); isl_union_map_free(must_source); isl_union_map_free(may_source); isl_union_map_free(data.must_dep); isl_union_map_free(data.may_dep); isl_union_map_free(data.must_no_source); isl_union_map_free(data.may_no_source); if (must_dep) *must_dep = NULL; if (may_dep) *may_dep = NULL; if (must_no_source) *must_no_source = NULL; if (may_no_source) *may_no_source = NULL; return -1; } cloog-0.18.2/isl/isl_basis_reduction.h0000664000175000017500000000103412254313240014606 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_BASIS_REDUCTION_H #define ISL_BASIS_REDUCTION_H #include #include #include "isl_tab.h" #if defined(__cplusplus) extern "C" { #endif struct isl_tab *isl_tab_compute_reduced_basis(struct isl_tab *tab); #if defined(__cplusplus) } #endif #endif cloog-0.18.2/isl/missing0000755000175000017500000002415212254313260012016 00000000000000#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2012-01-06.13; # UTC # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006, # 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' sed_minuso='s/.* -o \([^ ]*\).*/\1/p' # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case $1 in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' autom4te touch the output file, or create a stub one automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file yacc create \`y.tab.[ch]', if possible, from existing .[ch] Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and \`g' are ignored when checking the name. Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # normalize program name to check for. program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). This is about non-GNU programs, so use $1 not # $program. case $1 in lex*|yacc*) # Not GNU programs, they don't have --version. ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case $program in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case $f in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te*) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison*|yacc*) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if test $# -ne 1; then eval LASTARG=\${$#} case $LASTARG in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.h fi ;; esac fi if test ! -f y.tab.h; then echo >y.tab.h fi if test ! -f y.tab.c; then echo 'main() { return 0; }' >y.tab.c fi ;; lex*|flex*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if test $# -ne 1; then eval LASTARG=\${$#} case $LASTARG in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if test ! -f lex.yy.c; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit $? fi ;; makeinfo*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n ' /^@setfilename/{ s/.* \([^ ]*\) *$/\1/ p q }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: cloog-0.18.2/isl/isl_dim_map.c0000664000175000017500000001253412254313240013041 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010-2011 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include #include struct isl_dim_map_entry { int pos; int sgn; }; /* Maps dst positions to src positions */ struct isl_dim_map { unsigned len; struct isl_dim_map_entry m[1]; }; __isl_give isl_dim_map *isl_dim_map_alloc(isl_ctx *ctx, unsigned len) { int i; struct isl_dim_map *dim_map; dim_map = isl_alloc(ctx, struct isl_dim_map, sizeof(struct isl_dim_map) + len * sizeof(struct isl_dim_map_entry)); if (!dim_map) return NULL; dim_map->len = 1 + len; dim_map->m[0].pos = 0; dim_map->m[0].sgn = 1; for (i = 0; i < len; ++i) dim_map->m[1 + i].sgn = 0; return dim_map; } void isl_dim_map_range(__isl_keep isl_dim_map *dim_map, unsigned dst_pos, unsigned dst_stride, unsigned src_pos, unsigned src_stride, unsigned n, int sign) { int i; if (!dim_map) return; for (i = 0; i < n; ++i) { unsigned d = 1 + dst_pos + dst_stride * i; unsigned s = 1 + src_pos + src_stride * i; dim_map->m[d].pos = s; dim_map->m[d].sgn = sign; } } void isl_dim_map_dim_range(__isl_keep isl_dim_map *dim_map, __isl_keep isl_space *dim, enum isl_dim_type type, unsigned first, unsigned n, unsigned dst_pos) { int i; unsigned src_pos; if (!dim_map || !dim) return; src_pos = 1 + isl_space_offset(dim, type); for (i = 0; i < n; ++i) { dim_map->m[1 + dst_pos + i].pos = src_pos + first + i; dim_map->m[1 + dst_pos + i].sgn = 1; } } void isl_dim_map_dim(__isl_keep isl_dim_map *dim_map, __isl_keep isl_space *dim, enum isl_dim_type type, unsigned dst_pos) { isl_dim_map_dim_range(dim_map, dim, type, 0, isl_space_dim(dim, type), dst_pos); } void isl_dim_map_div(__isl_keep isl_dim_map *dim_map, __isl_keep isl_basic_map *bmap, unsigned dst_pos) { int i; unsigned src_pos; if (!dim_map || !bmap) return; src_pos = 1 + isl_space_dim(bmap->dim, isl_dim_all); for (i = 0; i < bmap->n_div; ++i) { dim_map->m[1 + dst_pos + i].pos = src_pos + i; dim_map->m[1 + dst_pos + i].sgn = 1; } } void isl_dim_map_dump(struct isl_dim_map *dim_map) { int i; for (i = 0; i < dim_map->len; ++i) fprintf(stderr, "%d -> %d * %d; ", i, dim_map->m[i].sgn, dim_map->m[i].pos); fprintf(stderr, "\n"); } static void copy_constraint_dim_map(isl_int *dst, isl_int *src, struct isl_dim_map *dim_map) { int i; for (i = 0; i < dim_map->len; ++i) { if (dim_map->m[i].sgn == 0) isl_int_set_si(dst[i], 0); else if (dim_map->m[i].sgn > 0) isl_int_set(dst[i], src[dim_map->m[i].pos]); else isl_int_neg(dst[i], src[dim_map->m[i].pos]); } } static void copy_div_dim_map(isl_int *dst, isl_int *src, struct isl_dim_map *dim_map) { isl_int_set(dst[0], src[0]); copy_constraint_dim_map(dst+1, src+1, dim_map); } __isl_give isl_basic_map *isl_basic_map_add_constraints_dim_map( __isl_take isl_basic_map *dst, __isl_take isl_basic_map *src, __isl_take isl_dim_map *dim_map) { int i; if (!src || !dst || !dim_map) goto error; for (i = 0; i < src->n_eq; ++i) { int i1 = isl_basic_map_alloc_equality(dst); if (i1 < 0) goto error; copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map); } for (i = 0; i < src->n_ineq; ++i) { int i1 = isl_basic_map_alloc_inequality(dst); if (i1 < 0) goto error; copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map); } for (i = 0; i < src->n_div; ++i) { int i1 = isl_basic_map_alloc_div(dst); if (i1 < 0) goto error; copy_div_dim_map(dst->div[i1], src->div[i], dim_map); } free(dim_map); isl_basic_map_free(src); return dst; error: free(dim_map); isl_basic_map_free(src); isl_basic_map_free(dst); return NULL; } __isl_give isl_basic_set *isl_basic_set_add_constraints_dim_map( __isl_take isl_basic_set *dst, __isl_take isl_basic_set *src, __isl_take isl_dim_map *dim_map) { return isl_basic_map_add_constraints_dim_map(dst, src, dim_map); } /* Extend the given dim_map with mappings for the divs in bmap. */ __isl_give isl_dim_map *isl_dim_map_extend(__isl_keep isl_dim_map *dim_map, __isl_keep isl_basic_map *bmap) { int i; struct isl_dim_map *res; int offset; offset = isl_basic_map_offset(bmap, isl_dim_div); res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div); if (!res) return NULL; for (i = 0; i < dim_map->len; ++i) res->m[i] = dim_map->m[i]; for (i = 0; i < bmap->n_div; ++i) { res->m[dim_map->len + i].pos = offset + i; res->m[dim_map->len + i].sgn = 1; } return res; } /* Extract a dim_map from a reordering. * We essentially need to reverse the mapping, and add an offset * of 1 for the constant term. */ __isl_give isl_dim_map *isl_dim_map_from_reordering( __isl_keep isl_reordering *exp) { int i; isl_ctx *ctx; struct isl_dim_map *dim_map; if (!exp) return NULL; ctx = isl_space_get_ctx(exp->dim); dim_map = isl_dim_map_alloc(ctx, isl_space_dim(exp->dim, isl_dim_all)); if (!dim_map) return NULL; for (i = 0; i < exp->len; ++i) { dim_map->m[1 + exp->pos[i]].pos = 1 + i; dim_map->m[1 + exp->pos[i]].sgn = 1; } return dim_map; } cloog-0.18.2/isl/isl_dim_map.h0000664000175000017500000000244412254313240013045 00000000000000#ifndef ISL_DIM_MAP_H #define ISL_DIM_MAP_H #include #include #include struct isl_dim_map; typedef struct isl_dim_map isl_dim_map; __isl_give isl_dim_map *isl_dim_map_alloc(isl_ctx *ctx, unsigned len); void isl_dim_map_range(__isl_keep isl_dim_map *dim_map, unsigned dst_pos, unsigned dst_stride, unsigned src_pos, unsigned src_stride, unsigned n, int sign); void isl_dim_map_dim_range(__isl_keep isl_dim_map *dim_map, isl_space *dim, enum isl_dim_type type, unsigned first, unsigned n, unsigned dst_pos); void isl_dim_map_dim(__isl_keep isl_dim_map *dim_map, __isl_keep isl_space *dim, enum isl_dim_type type, unsigned dst_pos); void isl_dim_map_div(__isl_keep isl_dim_map *dim_map, __isl_keep isl_basic_map *bmap, unsigned dst_pos); __isl_give isl_basic_set *isl_basic_set_add_constraints_dim_map( __isl_take isl_basic_set *dst, __isl_take isl_basic_set *src, __isl_take isl_dim_map *dim_map); __isl_give isl_basic_map *isl_basic_map_add_constraints_dim_map( __isl_take isl_basic_map *dst, __isl_take isl_basic_map *src, __isl_take isl_dim_map *dim_map); __isl_give isl_dim_map *isl_dim_map_extend(__isl_keep isl_dim_map *dim_map, __isl_keep isl_basic_map *bmap); __isl_give isl_dim_map *isl_dim_map_from_reordering( __isl_keep isl_reordering *exp); #endif cloog-0.18.2/isl/closure.c0000664000175000017500000000141212254313240012231 00000000000000#include #include #include int main(int argc, char **argv) { struct isl_ctx *ctx; struct isl_map *map; struct isl_options *options; int exact; options = isl_options_new_with_defaults(); assert(options); argc = isl_options_parse(options, argc, argv, ISL_ARG_ALL); ctx = isl_ctx_alloc_with_options(&isl_options_args, options); map = isl_map_read_from_file(ctx, stdin); map = isl_map_transitive_closure(map, &exact); if (!exact) printf("# NOT exact\n"); isl_map_print(map, stdout, 0, ISL_FORMAT_ISL); printf("\n"); map = isl_map_compute_divs(map); map = isl_map_coalesce(map); printf("# coalesced\n"); isl_map_print(map, stdout, 0, ISL_FORMAT_ISL); printf("\n"); isl_map_free(map); isl_ctx_free(ctx); return 0; } cloog-0.18.2/isl/isl_constraint.c0000664000175000017500000010056512254313240013621 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include #include #include #include #include #undef BASE #define BASE constraint #include isl_ctx *isl_constraint_get_ctx(__isl_keep isl_constraint *c) { return c ? isl_local_space_get_ctx(c->ls) : NULL; } static unsigned n(struct isl_constraint *c, enum isl_dim_type type) { return isl_local_space_dim(c->ls, type); } static unsigned offset(struct isl_constraint *c, enum isl_dim_type type) { return isl_local_space_offset(c->ls, type); } static unsigned basic_map_offset(__isl_keep isl_basic_map *bmap, enum isl_dim_type type) { return type == isl_dim_div ? 1 + isl_space_dim(bmap->dim, isl_dim_all) : 1 + isl_space_offset(bmap->dim, type); } static unsigned basic_set_offset(struct isl_basic_set *bset, enum isl_dim_type type) { isl_space *dim = bset->dim; switch (type) { case isl_dim_param: return 1; case isl_dim_in: return 1 + dim->nparam; case isl_dim_out: return 1 + dim->nparam + dim->n_in; case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out; default: return 0; } } __isl_give isl_constraint *isl_constraint_alloc_vec(int eq, __isl_take isl_local_space *ls, __isl_take isl_vec *v) { isl_constraint *constraint; if (!ls || !v) goto error; constraint = isl_alloc_type(isl_vec_get_ctx(v), isl_constraint); if (!constraint) goto error; constraint->ref = 1; constraint->eq = eq; constraint->ls = ls; constraint->v = v; return constraint; error: isl_local_space_free(ls); isl_vec_free(v); return NULL; } __isl_give isl_constraint *isl_constraint_alloc(int eq, __isl_take isl_local_space *ls) { isl_ctx *ctx; isl_vec *v; if (!ls) return NULL; ctx = isl_local_space_get_ctx(ls); v = isl_vec_alloc(ctx, 1 + isl_local_space_dim(ls, isl_dim_all)); v = isl_vec_clr(v); return isl_constraint_alloc_vec(eq, ls, v); } struct isl_constraint *isl_basic_map_constraint(struct isl_basic_map *bmap, isl_int **line) { int eq; isl_ctx *ctx; isl_vec *v; isl_local_space *ls = NULL; isl_constraint *constraint; if (!bmap || !line) goto error; eq = line >= bmap->eq; ctx = isl_basic_map_get_ctx(bmap); ls = isl_basic_map_get_local_space(bmap); v = isl_vec_alloc(ctx, 1 + isl_local_space_dim(ls, isl_dim_all)); if (!v) goto error; isl_seq_cpy(v->el, line[0], v->size); constraint = isl_constraint_alloc_vec(eq, ls, v); isl_basic_map_free(bmap); return constraint; error: isl_local_space_free(ls); isl_basic_map_free(bmap); return NULL; } struct isl_constraint *isl_basic_set_constraint(struct isl_basic_set *bset, isl_int **line) { return isl_basic_map_constraint((struct isl_basic_map *)bset, line); } __isl_give isl_constraint *isl_equality_alloc(__isl_take isl_local_space *ls) { return isl_constraint_alloc(1, ls); } __isl_give isl_constraint *isl_inequality_alloc(__isl_take isl_local_space *ls) { return isl_constraint_alloc(0, ls); } struct isl_constraint *isl_constraint_dup(struct isl_constraint *c) { if (!c) return NULL; return isl_constraint_alloc_vec(c->eq, isl_local_space_copy(c->ls), isl_vec_copy(c->v)); } struct isl_constraint *isl_constraint_cow(struct isl_constraint *c) { if (!c) return NULL; if (c->ref == 1) return c; c->ref--; return isl_constraint_dup(c); } struct isl_constraint *isl_constraint_copy(struct isl_constraint *constraint) { if (!constraint) return NULL; constraint->ref++; return constraint; } void *isl_constraint_free(struct isl_constraint *c) { if (!c) return NULL; if (--c->ref > 0) return NULL; isl_local_space_free(c->ls); isl_vec_free(c->v); free(c); return NULL; } /* Return the number of constraints in "bset", i.e., the * number of times isl_basic_set_foreach_constraint will * call the callback. */ int isl_basic_set_n_constraint(__isl_keep isl_basic_set *bset) { if (!bset) return -1; return bset->n_eq + bset->n_ineq; } int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap, int (*fn)(__isl_take isl_constraint *c, void *user), void *user) { int i; struct isl_constraint *c; if (!bmap) return -1; isl_assert(bmap->ctx, ISL_F_ISSET(bmap, ISL_BASIC_MAP_FINAL), return -1); for (i = 0; i < bmap->n_eq; ++i) { c = isl_basic_map_constraint(isl_basic_map_copy(bmap), &bmap->eq[i]); if (!c) return -1; if (fn(c, user) < 0) return -1; } for (i = 0; i < bmap->n_ineq; ++i) { c = isl_basic_map_constraint(isl_basic_map_copy(bmap), &bmap->ineq[i]); if (!c) return -1; if (fn(c, user) < 0) return -1; } return 0; } int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset, int (*fn)(__isl_take isl_constraint *c, void *user), void *user) { return isl_basic_map_foreach_constraint((isl_basic_map *)bset, fn, user); } int isl_constraint_is_equal(struct isl_constraint *constraint1, struct isl_constraint *constraint2) { int equal; if (!constraint1 || !constraint2) return 0; if (constraint1->eq != constraint2->eq) return 0; equal = isl_local_space_is_equal(constraint1->ls, constraint2->ls); if (equal < 0 || !equal) return equal; return isl_vec_is_equal(constraint1->v, constraint2->v); } struct isl_basic_map *isl_basic_map_add_constraint( struct isl_basic_map *bmap, struct isl_constraint *constraint) { isl_ctx *ctx; isl_space *dim; int equal_space; if (!bmap || !constraint) goto error; ctx = isl_constraint_get_ctx(constraint); dim = isl_constraint_get_space(constraint); equal_space = isl_space_is_equal(bmap->dim, dim); isl_space_free(dim); isl_assert(ctx, equal_space, goto error); bmap = isl_basic_map_intersect(bmap, isl_basic_map_from_constraint(constraint)); return bmap; error: isl_basic_map_free(bmap); isl_constraint_free(constraint); return NULL; } struct isl_basic_set *isl_basic_set_add_constraint( struct isl_basic_set *bset, struct isl_constraint *constraint) { return (struct isl_basic_set *) isl_basic_map_add_constraint((struct isl_basic_map *)bset, constraint); } __isl_give isl_map *isl_map_add_constraint(__isl_take isl_map *map, __isl_take isl_constraint *constraint) { isl_basic_map *bmap; bmap = isl_basic_map_from_constraint(constraint); map = isl_map_intersect(map, isl_map_from_basic_map(bmap)); return map; } __isl_give isl_set *isl_set_add_constraint(__isl_take isl_set *set, __isl_take isl_constraint *constraint) { return isl_map_add_constraint(set, constraint); } __isl_give isl_space *isl_constraint_get_space( __isl_keep isl_constraint *constraint) { return constraint ? isl_local_space_get_space(constraint->ls) : NULL; } __isl_give isl_local_space *isl_constraint_get_local_space( __isl_keep isl_constraint *constraint) { return constraint ? isl_local_space_copy(constraint->ls) : NULL; } int isl_constraint_dim(struct isl_constraint *constraint, enum isl_dim_type type) { if (!constraint) return -1; return n(constraint, type); } int isl_constraint_involves_dims(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned first, unsigned n) { int i; isl_ctx *ctx; int *active = NULL; int involves = 0; if (!constraint) return -1; if (n == 0) return 0; ctx = isl_constraint_get_ctx(constraint); if (first + n > isl_constraint_dim(constraint, type)) isl_die(ctx, isl_error_invalid, "range out of bounds", return -1); active = isl_local_space_get_active(constraint->ls, constraint->v->el + 1); if (!active) goto error; first += isl_local_space_offset(constraint->ls, type) - 1; for (i = 0; i < n; ++i) if (active[first + i]) { involves = 1; break; } free(active); return involves; error: free(active); return -1; } /* Does the given constraint represent a lower bound on the given * dimension? */ int isl_constraint_is_lower_bound(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos) { if (!constraint) return -1; if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "position out of bounds", return -1); pos += isl_local_space_offset(constraint->ls, type); return isl_int_is_pos(constraint->v->el[pos]); } /* Does the given constraint represent an upper bound on the given * dimension? */ int isl_constraint_is_upper_bound(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos) { if (!constraint) return -1; if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "position out of bounds", return -1); pos += isl_local_space_offset(constraint->ls, type); return isl_int_is_neg(constraint->v->el[pos]); } const char *isl_constraint_get_dim_name(__isl_keep isl_constraint *constraint, enum isl_dim_type type, unsigned pos) { return constraint ? isl_local_space_get_dim_name(constraint->ls, type, pos) : NULL; } void isl_constraint_get_constant(struct isl_constraint *constraint, isl_int *v) { if (!constraint) return; isl_int_set(*v, constraint->v->el[0]); } /* Return the constant term of "constraint". */ __isl_give isl_val *isl_constraint_get_constant_val( __isl_keep isl_constraint *constraint) { isl_ctx *ctx; if (!constraint) return NULL; ctx = isl_constraint_get_ctx(constraint); return isl_val_int_from_isl_int(ctx, constraint->v->el[0]); } void isl_constraint_get_coefficient(struct isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int *v) { if (!constraint) return; if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(constraint->v->ctx, isl_error_invalid, "position out of bounds", return); pos += isl_local_space_offset(constraint->ls, type); isl_int_set(*v, constraint->v->el[pos]); } /* Return the coefficient of the variable of type "type" at position "pos" * of "constraint". */ __isl_give isl_val *isl_constraint_get_coefficient_val( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos) { isl_ctx *ctx; if (!constraint) return NULL; ctx = isl_constraint_get_ctx(constraint); if (pos < 0 || pos >= isl_local_space_dim(constraint->ls, type)) isl_die(ctx, isl_error_invalid, "position out of bounds", return NULL); pos += isl_local_space_offset(constraint->ls, type); return isl_val_int_from_isl_int(ctx, constraint->v->el[pos]); } __isl_give isl_aff *isl_constraint_get_div(__isl_keep isl_constraint *constraint, int pos) { if (!constraint) return NULL; return isl_local_space_get_div(constraint->ls, pos); } __isl_give isl_constraint *isl_constraint_set_constant( __isl_take isl_constraint *constraint, isl_int v) { constraint = isl_constraint_cow(constraint); if (!constraint) return NULL; constraint->v = isl_vec_cow(constraint->v); if (!constraint->v) return isl_constraint_free(constraint); isl_int_set(constraint->v->el[0], v); return constraint; } /* Replace the constant term of "constraint" by "v". */ __isl_give isl_constraint *isl_constraint_set_constant_val( __isl_take isl_constraint *constraint, __isl_take isl_val *v) { constraint = isl_constraint_cow(constraint); if (!constraint || !v) goto error; if (!isl_val_is_int(v)) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "expecting integer value", goto error); constraint->v = isl_vec_set_element_val(constraint->v, 0, v); if (!constraint->v) constraint = isl_constraint_free(constraint); return constraint; error: isl_val_free(v); return isl_constraint_free(constraint); } __isl_give isl_constraint *isl_constraint_set_constant_si( __isl_take isl_constraint *constraint, int v) { constraint = isl_constraint_cow(constraint); if (!constraint) return NULL; constraint->v = isl_vec_cow(constraint->v); if (!constraint->v) return isl_constraint_free(constraint); isl_int_set_si(constraint->v->el[0], v); return constraint; } __isl_give isl_constraint *isl_constraint_set_coefficient( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_int v) { constraint = isl_constraint_cow(constraint); if (!constraint) return NULL; if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(constraint->v->ctx, isl_error_invalid, "position out of bounds", return isl_constraint_free(constraint)); constraint = isl_constraint_cow(constraint); if (!constraint) return NULL; constraint->v = isl_vec_cow(constraint->v); if (!constraint->v) return isl_constraint_free(constraint); pos += isl_local_space_offset(constraint->ls, type); isl_int_set(constraint->v->el[pos], v); return constraint; } /* Replace the coefficient of the variable of type "type" at position "pos" * of "constraint" by "v". */ __isl_give isl_constraint *isl_constraint_set_coefficient_val( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, isl_val *v) { constraint = isl_constraint_cow(constraint); if (!constraint || !v) goto error; if (!isl_val_is_int(v)) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "expecting integer value", goto error); if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "position out of bounds", goto error); pos += isl_local_space_offset(constraint->ls, type); constraint->v = isl_vec_set_element_val(constraint->v, pos, v); if (!constraint->v) constraint = isl_constraint_free(constraint); return constraint; error: isl_val_free(v); return isl_constraint_free(constraint); } __isl_give isl_constraint *isl_constraint_set_coefficient_si( __isl_take isl_constraint *constraint, enum isl_dim_type type, int pos, int v) { constraint = isl_constraint_cow(constraint); if (!constraint) return NULL; if (pos >= isl_local_space_dim(constraint->ls, type)) isl_die(constraint->v->ctx, isl_error_invalid, "position out of bounds", return isl_constraint_free(constraint)); constraint = isl_constraint_cow(constraint); if (!constraint) return NULL; constraint->v = isl_vec_cow(constraint->v); if (!constraint->v) return isl_constraint_free(constraint); pos += isl_local_space_offset(constraint->ls, type); isl_int_set_si(constraint->v->el[pos], v); return constraint; } /* Drop any constraint from "bset" that is identical to "constraint". * In particular, this means that the local spaces of "bset" and * "constraint" need to be the same. * * Since the given constraint may actually be a pointer into the bset, * we have to be careful not to reorder the constraints as the user * may be holding on to other constraints from the same bset. * This should be cleaned up when the internal representation of * isl_constraint is changed to use isl_aff. */ __isl_give isl_basic_set *isl_basic_set_drop_constraint( __isl_take isl_basic_set *bset, __isl_take isl_constraint *constraint) { int i; unsigned n; isl_int **row; unsigned total; isl_local_space *ls1; int equal; if (!bset || !constraint) goto error; ls1 = isl_basic_set_get_local_space(bset); equal = isl_local_space_is_equal(ls1, constraint->ls); isl_local_space_free(ls1); if (equal < 0) goto error; if (!equal) { isl_constraint_free(constraint); return bset; } if (isl_constraint_is_equality(constraint)) { n = bset->n_eq; row = bset->eq; } else { n = bset->n_ineq; row = bset->ineq; } total = isl_constraint_dim(constraint, isl_dim_all); for (i = 0; i < n; ++i) if (isl_seq_eq(row[i], constraint->v->el, 1 + total)) isl_seq_clr(row[i], 1 + total); isl_constraint_free(constraint); return bset; error: isl_constraint_free(constraint); isl_basic_set_free(bset); return NULL; } struct isl_constraint *isl_constraint_negate(struct isl_constraint *constraint) { isl_ctx *ctx; constraint = isl_constraint_cow(constraint); if (!constraint) return NULL; ctx = isl_constraint_get_ctx(constraint); if (isl_constraint_is_equality(constraint)) isl_die(ctx, isl_error_invalid, "cannot negate equality", return isl_constraint_free(constraint)); constraint->v = isl_vec_neg(constraint->v); constraint->v = isl_vec_cow(constraint->v); if (!constraint->v) return isl_constraint_free(constraint); isl_int_sub_ui(constraint->v->el[0], constraint->v->el[0], 1); return constraint; } int isl_constraint_is_equality(struct isl_constraint *constraint) { if (!constraint) return -1; return constraint->eq; } int isl_constraint_is_div_constraint(__isl_keep isl_constraint *constraint) { int i; int n_div; if (!constraint) return -1; if (isl_constraint_is_equality(constraint)) return 0; n_div = isl_constraint_dim(constraint, isl_dim_div); for (i = 0; i < n_div; ++i) { if (isl_local_space_is_div_constraint(constraint->ls, constraint->v->el, i)) return 1; } return 0; } /* We manually set ISL_BASIC_SET_FINAL instead of calling * isl_basic_map_finalize because we want to keep the position * of the divs and we therefore do not want to throw away redundant divs. * This is arguably a bit fragile. */ __isl_give isl_basic_map *isl_basic_map_from_constraint( __isl_take isl_constraint *constraint) { int k; isl_local_space *ls; struct isl_basic_map *bmap; isl_int *c; unsigned total; if (!constraint) return NULL; ls = isl_local_space_copy(constraint->ls); bmap = isl_basic_map_from_local_space(ls); bmap = isl_basic_map_extend_constraints(bmap, 1, 1); if (isl_constraint_is_equality(constraint)) { k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; c = bmap->eq[k]; } else { k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; c = bmap->ineq[k]; } total = isl_basic_map_total_dim(bmap); isl_seq_cpy(c, constraint->v->el, 1 + total); isl_constraint_free(constraint); if (bmap) ISL_F_SET(bmap, ISL_BASIC_SET_FINAL); return bmap; error: isl_constraint_free(constraint); isl_basic_map_free(bmap); return NULL; } struct isl_basic_set *isl_basic_set_from_constraint( struct isl_constraint *constraint) { if (!constraint) return NULL; if (isl_constraint_dim(constraint, isl_dim_in) != 0) isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid, "not a set constraint", return isl_constraint_free(constraint)); return (isl_basic_set *)isl_basic_map_from_constraint(constraint); } int isl_basic_map_has_defining_equality( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, int pos, __isl_give isl_constraint **c) { int i; unsigned offset; unsigned total; if (!bmap) return -1; offset = basic_map_offset(bmap, type); total = isl_basic_map_total_dim(bmap); isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1); for (i = 0; i < bmap->n_eq; ++i) if (!isl_int_is_zero(bmap->eq[i][offset + pos]) && isl_seq_first_non_zero(bmap->eq[i]+offset+pos+1, 1+total-offset-pos-1) == -1) { *c = isl_basic_map_constraint(isl_basic_map_copy(bmap), &bmap->eq[i]); return 1; } return 0; } int isl_basic_set_has_defining_equality( __isl_keep isl_basic_set *bset, enum isl_dim_type type, int pos, __isl_give isl_constraint **c) { return isl_basic_map_has_defining_equality((isl_basic_map *)bset, type, pos, c); } int isl_basic_set_has_defining_inequalities( struct isl_basic_set *bset, enum isl_dim_type type, int pos, struct isl_constraint **lower, struct isl_constraint **upper) { int i, j; unsigned offset; unsigned total; isl_int m; isl_int **lower_line, **upper_line; if (!bset) return -1; offset = basic_set_offset(bset, type); total = isl_basic_set_total_dim(bset); isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1); isl_int_init(m); for (i = 0; i < bset->n_ineq; ++i) { if (isl_int_is_zero(bset->ineq[i][offset + pos])) continue; if (isl_int_is_one(bset->ineq[i][offset + pos])) continue; if (isl_int_is_negone(bset->ineq[i][offset + pos])) continue; if (isl_seq_first_non_zero(bset->ineq[i]+offset+pos+1, 1+total-offset-pos-1) != -1) continue; for (j = i + 1; j < bset->n_ineq; ++j) { if (!isl_seq_is_neg(bset->ineq[i]+1, bset->ineq[j]+1, total)) continue; isl_int_add(m, bset->ineq[i][0], bset->ineq[j][0]); if (isl_int_abs_ge(m, bset->ineq[i][offset+pos])) continue; if (isl_int_is_pos(bset->ineq[i][offset+pos])) { lower_line = &bset->ineq[i]; upper_line = &bset->ineq[j]; } else { lower_line = &bset->ineq[j]; upper_line = &bset->ineq[i]; } *lower = isl_basic_set_constraint( isl_basic_set_copy(bset), lower_line); *upper = isl_basic_set_constraint( isl_basic_set_copy(bset), upper_line); isl_int_clear(m); return 1; } } *lower = NULL; *upper = NULL; isl_int_clear(m); return 0; } /* Given two constraints "a" and "b" on the variable at position "abs_pos" * (in "a" and "b"), add a constraint to "bset" that ensures that the * bound implied by "a" is (strictly) larger than the bound implied by "b". * * If both constraints imply lower bounds, then this means that "a" is * active in the result. * If both constraints imply upper bounds, then this means that "b" is * active in the result. */ static __isl_give isl_basic_set *add_larger_bound_constraint( __isl_take isl_basic_set *bset, isl_int *a, isl_int *b, unsigned abs_pos, int strict) { int k; isl_int t; unsigned total; k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; total = isl_basic_set_dim(bset, isl_dim_all); isl_int_init(t); isl_int_neg(t, b[1 + abs_pos]); isl_seq_combine(bset->ineq[k], t, a, a[1 + abs_pos], b, 1 + abs_pos); isl_seq_combine(bset->ineq[k] + 1 + abs_pos, t, a + 1 + abs_pos + 1, a[1 + abs_pos], b + 1 + abs_pos + 1, total - abs_pos); if (strict) isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1); isl_int_clear(t); return bset; error: isl_basic_set_free(bset); return NULL; } /* Add constraints to "context" that ensure that "u" is the smallest * (and therefore active) upper bound on "abs_pos" in "bset" and return * the resulting basic set. */ static __isl_give isl_basic_set *set_smallest_upper_bound( __isl_keep isl_basic_set *context, __isl_keep isl_basic_set *bset, unsigned abs_pos, int n_upper, int u) { int j; context = isl_basic_set_copy(context); context = isl_basic_set_cow(context); context = isl_basic_set_extend_constraints(context, 0, n_upper - 1); for (j = 0; j < bset->n_ineq; ++j) { if (j == u) continue; if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos])) continue; context = add_larger_bound_constraint(context, bset->ineq[j], bset->ineq[u], abs_pos, j > u); } context = isl_basic_set_simplify(context); context = isl_basic_set_finalize(context); return context; } /* Add constraints to "context" that ensure that "u" is the largest * (and therefore active) upper bound on "abs_pos" in "bset" and return * the resulting basic set. */ static __isl_give isl_basic_set *set_largest_lower_bound( __isl_keep isl_basic_set *context, __isl_keep isl_basic_set *bset, unsigned abs_pos, int n_lower, int l) { int j; context = isl_basic_set_copy(context); context = isl_basic_set_cow(context); context = isl_basic_set_extend_constraints(context, 0, n_lower - 1); for (j = 0; j < bset->n_ineq; ++j) { if (j == l) continue; if (!isl_int_is_pos(bset->ineq[j][1 + abs_pos])) continue; context = add_larger_bound_constraint(context, bset->ineq[l], bset->ineq[j], abs_pos, j > l); } context = isl_basic_set_simplify(context); context = isl_basic_set_finalize(context); return context; } static int foreach_upper_bound(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned abs_pos, __isl_take isl_basic_set *context, int n_upper, int (*fn)(__isl_take isl_constraint *lower, __isl_take isl_constraint *upper, __isl_take isl_basic_set *bset, void *user), void *user) { isl_basic_set *context_i; isl_constraint *upper = NULL; int i; for (i = 0; i < bset->n_ineq; ++i) { if (isl_int_is_zero(bset->ineq[i][1 + abs_pos])) continue; context_i = set_smallest_upper_bound(context, bset, abs_pos, n_upper, i); if (isl_basic_set_is_empty(context_i)) { isl_basic_set_free(context_i); continue; } upper = isl_basic_set_constraint(isl_basic_set_copy(bset), &bset->ineq[i]); if (!upper || !context_i) goto error; if (fn(NULL, upper, context_i, user) < 0) break; } isl_basic_set_free(context); if (i < bset->n_ineq) return -1; return 0; error: isl_constraint_free(upper); isl_basic_set_free(context_i); isl_basic_set_free(context); return -1; } static int foreach_lower_bound(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned abs_pos, __isl_take isl_basic_set *context, int n_lower, int (*fn)(__isl_take isl_constraint *lower, __isl_take isl_constraint *upper, __isl_take isl_basic_set *bset, void *user), void *user) { isl_basic_set *context_i; isl_constraint *lower = NULL; int i; for (i = 0; i < bset->n_ineq; ++i) { if (isl_int_is_zero(bset->ineq[i][1 + abs_pos])) continue; context_i = set_largest_lower_bound(context, bset, abs_pos, n_lower, i); if (isl_basic_set_is_empty(context_i)) { isl_basic_set_free(context_i); continue; } lower = isl_basic_set_constraint(isl_basic_set_copy(bset), &bset->ineq[i]); if (!lower || !context_i) goto error; if (fn(lower, NULL, context_i, user) < 0) break; } isl_basic_set_free(context); if (i < bset->n_ineq) return -1; return 0; error: isl_constraint_free(lower); isl_basic_set_free(context_i); isl_basic_set_free(context); return -1; } static int foreach_bound_pair(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned abs_pos, __isl_take isl_basic_set *context, int n_lower, int n_upper, int (*fn)(__isl_take isl_constraint *lower, __isl_take isl_constraint *upper, __isl_take isl_basic_set *bset, void *user), void *user) { isl_basic_set *context_i, *context_j; isl_constraint *lower = NULL; isl_constraint *upper = NULL; int i, j; for (i = 0; i < bset->n_ineq; ++i) { if (!isl_int_is_pos(bset->ineq[i][1 + abs_pos])) continue; context_i = set_largest_lower_bound(context, bset, abs_pos, n_lower, i); if (isl_basic_set_is_empty(context_i)) { isl_basic_set_free(context_i); continue; } for (j = 0; j < bset->n_ineq; ++j) { if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos])) continue; context_j = set_smallest_upper_bound(context_i, bset, abs_pos, n_upper, j); context_j = isl_basic_set_extend_constraints(context_j, 0, 1); context_j = add_larger_bound_constraint(context_j, bset->ineq[i], bset->ineq[j], abs_pos, 0); context_j = isl_basic_set_simplify(context_j); context_j = isl_basic_set_finalize(context_j); if (isl_basic_set_is_empty(context_j)) { isl_basic_set_free(context_j); continue; } lower = isl_basic_set_constraint(isl_basic_set_copy(bset), &bset->ineq[i]); upper = isl_basic_set_constraint(isl_basic_set_copy(bset), &bset->ineq[j]); if (!lower || !upper || !context_j) goto error; if (fn(lower, upper, context_j, user) < 0) break; } isl_basic_set_free(context_i); if (j < bset->n_ineq) break; } isl_basic_set_free(context); if (i < bset->n_ineq) return -1; return 0; error: isl_constraint_free(lower); isl_constraint_free(upper); isl_basic_set_free(context_i); isl_basic_set_free(context_j); isl_basic_set_free(context); return -1; } /* For each pair of lower and upper bounds on the variable "pos" * of type "type", call "fn" with these lower and upper bounds and the * set of constraints on the remaining variables where these bounds * are active, i.e., (stricly) larger/smaller than the other lower/upper bounds. * * If the designated variable is equal to an affine combination of the * other variables then fn is called with both lower and upper * set to the corresponding equality. * * If there is no lower (or upper) bound, then NULL is passed * as the corresponding bound. * * We first check if the variable is involved in any equality. * If not, we count the number of lower and upper bounds and * act accordingly. */ int isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos, int (*fn)(__isl_take isl_constraint *lower, __isl_take isl_constraint *upper, __isl_take isl_basic_set *bset, void *user), void *user) { int i; isl_constraint *lower = NULL; isl_constraint *upper = NULL; isl_basic_set *context = NULL; unsigned abs_pos; int n_lower, n_upper; if (!bset) return -1; isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1); isl_assert(bset->ctx, type == isl_dim_param || type == isl_dim_set, return -1); abs_pos = pos; if (type == isl_dim_set) abs_pos += isl_basic_set_dim(bset, isl_dim_param); for (i = 0; i < bset->n_eq; ++i) { if (isl_int_is_zero(bset->eq[i][1 + abs_pos])) continue; lower = isl_basic_set_constraint(isl_basic_set_copy(bset), &bset->eq[i]); upper = isl_constraint_copy(lower); context = isl_basic_set_remove_dims(isl_basic_set_copy(bset), type, pos, 1); if (!lower || !upper || !context) goto error; return fn(lower, upper, context, user); } n_lower = 0; n_upper = 0; for (i = 0; i < bset->n_ineq; ++i) { if (isl_int_is_pos(bset->ineq[i][1 + abs_pos])) n_lower++; else if (isl_int_is_neg(bset->ineq[i][1 + abs_pos])) n_upper++; } context = isl_basic_set_copy(bset); context = isl_basic_set_cow(context); if (!context) goto error; for (i = context->n_ineq - 1; i >= 0; --i) if (!isl_int_is_zero(context->ineq[i][1 + abs_pos])) isl_basic_set_drop_inequality(context, i); context = isl_basic_set_drop(context, type, pos, 1); if (!n_lower && !n_upper) return fn(NULL, NULL, context, user); if (!n_lower) return foreach_upper_bound(bset, type, abs_pos, context, n_upper, fn, user); if (!n_upper) return foreach_lower_bound(bset, type, abs_pos, context, n_lower, fn, user); return foreach_bound_pair(bset, type, abs_pos, context, n_lower, n_upper, fn, user); error: isl_constraint_free(lower); isl_constraint_free(upper); isl_basic_set_free(context); return -1; } __isl_give isl_aff *isl_constraint_get_bound( __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos) { isl_aff *aff; isl_ctx *ctx; if (!constraint) return NULL; ctx = isl_constraint_get_ctx(constraint); if (pos >= isl_constraint_dim(constraint, type)) isl_die(ctx, isl_error_invalid, "index out of bounds", return NULL); if (isl_constraint_dim(constraint, isl_dim_in) != 0) isl_die(ctx, isl_error_invalid, "not a set constraint", return NULL); pos += offset(constraint, type); if (isl_int_is_zero(constraint->v->el[pos])) isl_die(ctx, isl_error_invalid, "constraint does not define a bound on given dimension", return NULL); aff = isl_aff_alloc(isl_local_space_copy(constraint->ls)); if (!aff) return NULL; if (isl_int_is_neg(constraint->v->el[pos])) isl_seq_cpy(aff->v->el + 1, constraint->v->el, aff->v->size - 1); else isl_seq_neg(aff->v->el + 1, constraint->v->el, aff->v->size - 1); isl_int_set_si(aff->v->el[1 + pos], 0); isl_int_abs(aff->v->el[0], constraint->v->el[pos]); return aff; } /* For an inequality constraint * * f >= 0 * * or an equality constraint * * f = 0 * * return the affine expression f. */ __isl_give isl_aff *isl_constraint_get_aff( __isl_keep isl_constraint *constraint) { isl_aff *aff; if (!constraint) return NULL; aff = isl_aff_alloc(isl_local_space_copy(constraint->ls)); if (!aff) return NULL; isl_seq_cpy(aff->v->el + 1, constraint->v->el, aff->v->size - 1); isl_int_set_si(aff->v->el[0], 1); return aff; } /* Construct an inequality (eq = 0) or equality (eq = 1) constraint from "aff". * In particular, construct aff >= 0 or aff = 0. * * The denominator of "aff" can be ignored. */ static __isl_give isl_constraint *isl_constraint_alloc_aff(int eq, __isl_take isl_aff *aff) { isl_local_space *ls; isl_vec *v; if (!aff) return NULL; ls = isl_aff_get_domain_local_space(aff); v = isl_vec_drop_els(isl_vec_copy(aff->v), 0, 1); isl_aff_free(aff); return isl_constraint_alloc_vec(eq, ls, v); } /* Construct an equality constraint equating the given affine expression * to zero. */ __isl_give isl_constraint *isl_equality_from_aff(__isl_take isl_aff *aff) { return isl_constraint_alloc_aff(1, aff); } /* Construct an inequality constraint enforcing the given affine expression * to be non-negative. */ __isl_give isl_constraint *isl_inequality_from_aff(__isl_take isl_aff *aff) { return isl_constraint_alloc_aff(0, aff); } cloog-0.18.2/isl/isl_vec.c0000664000175000017500000002405312254313240012207 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include isl_ctx *isl_vec_get_ctx(__isl_keep isl_vec *vec) { return vec ? vec->ctx : NULL; } struct isl_vec *isl_vec_alloc(struct isl_ctx *ctx, unsigned size) { struct isl_vec *vec; vec = isl_alloc_type(ctx, struct isl_vec); if (!vec) return NULL; vec->block = isl_blk_alloc(ctx, size); if (isl_blk_is_error(vec->block)) goto error; vec->ctx = ctx; isl_ctx_ref(ctx); vec->ref = 1; vec->size = size; vec->el = vec->block.data; return vec; error: isl_blk_free(ctx, vec->block); return NULL; } __isl_give isl_vec *isl_vec_extend(__isl_take isl_vec *vec, unsigned size) { if (!vec) return NULL; if (size <= vec->size) return vec; vec = isl_vec_cow(vec); if (!vec) return NULL; vec->block = isl_blk_extend(vec->ctx, vec->block, size); if (!vec->block.data) goto error; vec->size = size; vec->el = vec->block.data; return vec; error: isl_vec_free(vec); return NULL; } __isl_give isl_vec *isl_vec_zero_extend(__isl_take isl_vec *vec, unsigned size) { int extra; if (!vec) return NULL; if (size <= vec->size) return vec; vec = isl_vec_cow(vec); if (!vec) return NULL; extra = size - vec->size; vec = isl_vec_extend(vec, size); if (!vec) return NULL; isl_seq_clr(vec->el + size - extra, extra); return vec; } /* Return a vector containing the elements of "vec1" followed by * those of "vec2". */ __isl_give isl_vec *isl_vec_concat(__isl_take isl_vec *vec1, __isl_take isl_vec *vec2) { if (!vec1 || !vec2) goto error; if (vec2->size == 0) { isl_vec_free(vec2); return vec1; } if (vec1->size == 0) { isl_vec_free(vec1); return vec2; } vec1 = isl_vec_extend(vec1, vec1->size + vec2->size); if (!vec1) goto error; isl_seq_cpy(vec1->el + vec1->size - vec2->size, vec2->el, vec2->size); isl_vec_free(vec2); return vec1; error: isl_vec_free(vec1); isl_vec_free(vec2); return NULL; } struct isl_vec *isl_vec_copy(struct isl_vec *vec) { if (!vec) return NULL; vec->ref++; return vec; } struct isl_vec *isl_vec_dup(struct isl_vec *vec) { struct isl_vec *vec2; if (!vec) return NULL; vec2 = isl_vec_alloc(vec->ctx, vec->size); if (!vec2) return NULL; isl_seq_cpy(vec2->el, vec->el, vec->size); return vec2; } struct isl_vec *isl_vec_cow(struct isl_vec *vec) { struct isl_vec *vec2; if (!vec) return NULL; if (vec->ref == 1) return vec; vec2 = isl_vec_dup(vec); isl_vec_free(vec); return vec2; } void *isl_vec_free(__isl_take isl_vec *vec) { if (!vec) return NULL; if (--vec->ref > 0) return NULL; isl_ctx_deref(vec->ctx); isl_blk_free(vec->ctx, vec->block); free(vec); return NULL; } int isl_vec_size(__isl_keep isl_vec *vec) { return vec ? vec->size : -1; } int isl_vec_get_element(__isl_keep isl_vec *vec, int pos, isl_int *v) { if (!vec) return -1; if (pos < 0 || pos >= vec->size) isl_die(vec->ctx, isl_error_invalid, "position out of range", return -1); isl_int_set(*v, vec->el[pos]); return 0; } /* Extract the element at position "pos" of "vec". */ __isl_give isl_val *isl_vec_get_element_val(__isl_keep isl_vec *vec, int pos) { isl_ctx *ctx; if (!vec) return NULL; ctx = isl_vec_get_ctx(vec); if (pos < 0 || pos >= vec->size) isl_die(ctx, isl_error_invalid, "position out of range", return NULL); return isl_val_int_from_isl_int(ctx, vec->el[pos]); } __isl_give isl_vec *isl_vec_set_element(__isl_take isl_vec *vec, int pos, isl_int v) { vec = isl_vec_cow(vec); if (!vec) return NULL; if (pos < 0 || pos >= vec->size) isl_die(vec->ctx, isl_error_invalid, "position out of range", goto error); isl_int_set(vec->el[pos], v); return vec; error: isl_vec_free(vec); return NULL; } __isl_give isl_vec *isl_vec_set_element_si(__isl_take isl_vec *vec, int pos, int v) { vec = isl_vec_cow(vec); if (!vec) return NULL; if (pos < 0 || pos >= vec->size) isl_die(vec->ctx, isl_error_invalid, "position out of range", goto error); isl_int_set_si(vec->el[pos], v); return vec; error: isl_vec_free(vec); return NULL; } /* Replace the element at position "pos" of "vec" by "v". */ __isl_give isl_vec *isl_vec_set_element_val(__isl_take isl_vec *vec, int pos, __isl_take isl_val *v) { if (!v) return isl_vec_free(vec); if (!isl_val_is_int(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting integer value", goto error); vec = isl_vec_set_element(vec, pos, v->n); isl_val_free(v); return vec; error: isl_val_free(v); return isl_vec_free(vec); } /* Compare the elements of "vec1" and "vec2" at position "pos". */ int isl_vec_cmp_element(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2, int pos) { if (!vec1 || !vec2) return 0; if (pos < 0 || pos >= vec1->size || pos >= vec2->size) isl_die(isl_vec_get_ctx(vec1), isl_error_invalid, "position out of range", return 0); return isl_int_cmp(vec1->el[pos], vec2->el[pos]); } int isl_vec_is_equal(__isl_keep isl_vec *vec1, __isl_keep isl_vec *vec2) { if (!vec1 || !vec2) return -1; if (vec1->size != vec2->size) return 0; return isl_seq_eq(vec1->el, vec2->el, vec1->size); } __isl_give isl_printer *isl_printer_print_vec(__isl_take isl_printer *printer, __isl_keep isl_vec *vec) { int i; if (!printer || !vec) goto error; printer = isl_printer_print_str(printer, "["); for (i = 0; i < vec->size; ++i) { if (i) printer = isl_printer_print_str(printer, ","); printer = isl_printer_print_isl_int(printer, vec->el[i]); } printer = isl_printer_print_str(printer, "]"); return printer; error: isl_printer_free(printer); return NULL; } void isl_vec_dump(struct isl_vec *vec) { isl_printer *printer; if (!vec) return; printer = isl_printer_to_file(vec->ctx, stderr); printer = isl_printer_print_vec(printer, vec); printer = isl_printer_end_line(printer); isl_printer_free(printer); } __isl_give isl_vec *isl_vec_set(__isl_take isl_vec *vec, isl_int v) { vec = isl_vec_cow(vec); if (!vec) return NULL; isl_seq_set(vec->el, v, vec->size); return vec; } __isl_give isl_vec *isl_vec_set_si(__isl_take isl_vec *vec, int v) { vec = isl_vec_cow(vec); if (!vec) return NULL; isl_seq_set_si(vec->el, v, vec->size); return vec; } /* Replace all elements of "vec" by "v". */ __isl_give isl_vec *isl_vec_set_val(__isl_take isl_vec *vec, __isl_take isl_val *v) { vec = isl_vec_cow(vec); if (!vec || !v) goto error; if (!isl_val_is_int(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting integer value", goto error); isl_seq_set(vec->el, v->n, vec->size); isl_val_free(v); return vec; error: isl_vec_free(vec); isl_val_free(v); return NULL; } __isl_give isl_vec *isl_vec_clr(__isl_take isl_vec *vec) { vec = isl_vec_cow(vec); if (!vec) return NULL; isl_seq_clr(vec->el, vec->size); return vec; } void isl_vec_lcm(struct isl_vec *vec, isl_int *lcm) { isl_seq_lcm(vec->block.data, vec->size, lcm); } /* Given a rational vector, with the denominator in the first element * of the vector, round up all coordinates. */ struct isl_vec *isl_vec_ceil(struct isl_vec *vec) { vec = isl_vec_cow(vec); if (!vec) return NULL; isl_seq_cdiv_q(vec->el + 1, vec->el + 1, vec->el[0], vec->size - 1); isl_int_set_si(vec->el[0], 1); return vec; } struct isl_vec *isl_vec_normalize(struct isl_vec *vec) { if (!vec) return NULL; isl_seq_normalize(vec->ctx, vec->el, vec->size); return vec; } __isl_give isl_vec *isl_vec_neg(__isl_take isl_vec *vec) { vec = isl_vec_cow(vec); if (!vec) return NULL; isl_seq_neg(vec->el, vec->el, vec->size); return vec; } __isl_give isl_vec *isl_vec_scale(__isl_take isl_vec *vec, isl_int m) { if (isl_int_is_one(m)) return vec; vec = isl_vec_cow(vec); if (!vec) return NULL; isl_seq_scale(vec->el, vec->el, m, vec->size); return vec; } /* Reduce the elements of "vec" modulo "m". */ __isl_give isl_vec *isl_vec_fdiv_r(__isl_take isl_vec *vec, isl_int m) { vec = isl_vec_cow(vec); if (!vec) return NULL; isl_seq_fdiv_r(vec->el, vec->el, m, vec->size); return vec; } __isl_give isl_vec *isl_vec_add(__isl_take isl_vec *vec1, __isl_take isl_vec *vec2) { vec1 = isl_vec_cow(vec1); if (!vec1 || !vec2) goto error; isl_assert(vec1->ctx, vec1->size == vec2->size, goto error); isl_seq_combine(vec1->el, vec1->ctx->one, vec1->el, vec1->ctx->one, vec2->el, vec1->size); isl_vec_free(vec2); return vec1; error: isl_vec_free(vec1); isl_vec_free(vec2); return NULL; } static int qsort_int_cmp(const void *p1, const void *p2) { const isl_int *i1 = (const isl_int *) p1; const isl_int *i2 = (const isl_int *) p2; return isl_int_cmp(*i1, *i2); } __isl_give isl_vec *isl_vec_sort(__isl_take isl_vec *vec) { if (!vec) return NULL; qsort(vec->el, vec->size, sizeof(*vec->el), &qsort_int_cmp); return vec; } __isl_give isl_vec *isl_vec_drop_els(__isl_take isl_vec *vec, unsigned pos, unsigned n) { if (n == 0) return vec; vec = isl_vec_cow(vec); if (!vec) return NULL; if (pos + n > vec->size) isl_die(vec->ctx, isl_error_invalid, "range out of bounds", goto error); if (pos + n != vec->size) isl_seq_cpy(vec->el + pos, vec->el + pos + n, vec->size - pos - n); vec->size -= n; return vec; error: isl_vec_free(vec); return NULL; } __isl_give isl_vec *isl_vec_insert_els(__isl_take isl_vec *vec, unsigned pos, unsigned n) { isl_vec *ext = NULL; if (n == 0) return vec; if (!vec) return NULL; if (pos > vec->size) isl_die(vec->ctx, isl_error_invalid, "position out of bounds", goto error); ext = isl_vec_alloc(vec->ctx, vec->size + n); if (!ext) goto error; isl_seq_cpy(ext->el, vec->el, pos); isl_seq_cpy(ext->el + pos + n, vec->el + pos, vec->size - pos); isl_vec_free(vec); return ext; error: isl_vec_free(vec); isl_vec_free(ext); return NULL; } __isl_give isl_vec *isl_vec_insert_zero_els(__isl_take isl_vec *vec, unsigned pos, unsigned n) { vec = isl_vec_insert_els(vec, pos, n); if (!vec) return NULL; isl_seq_clr(vec->el + pos, n); return vec; } cloog-0.18.2/isl/isl_int.h0000664000175000017500000001056012254313240012227 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_INT_H #define ISL_INT_H #include #include #include #include #ifndef mp_get_memory_functions void mp_get_memory_functions( void *(**alloc_func_ptr) (size_t), void *(**realloc_func_ptr) (void *, size_t, size_t), void (**free_func_ptr) (void *, size_t)); #endif /* isl_int is the basic integer type. It currently always corresponds * to a gmp mpz_t, but in the future, different types such as long long * or cln::cl_I will be supported. */ typedef mpz_t isl_int; #define isl_int_init(i) mpz_init(i) #define isl_int_clear(i) mpz_clear(i) #define isl_int_set(r,i) mpz_set(r,i) #define isl_int_set_gmp(r,i) mpz_set(r,i) #define isl_int_set_si(r,i) mpz_set_si(r,i) #define isl_int_set_ui(r,i) mpz_set_ui(r,i) #define isl_int_get_gmp(i,g) mpz_set(g,i) #define isl_int_fits_slong(r) mpz_fits_slong_p(r) #define isl_int_get_si(r) mpz_get_si(r) #define isl_int_fits_ulong(r) mpz_fits_ulong_p(r) #define isl_int_get_ui(r) mpz_get_ui(r) #define isl_int_get_d(r) mpz_get_d(r) #define isl_int_get_str(r) mpz_get_str(0, 10, r) typedef void (*isl_int_print_gmp_free_t)(void *, size_t); #define isl_int_free_str(s) \ do { \ isl_int_print_gmp_free_t gmp_free; \ mp_get_memory_functions(NULL, NULL, &gmp_free); \ (*gmp_free)(s, strlen(s) + 1); \ } while (0) #define isl_int_abs(r,i) mpz_abs(r,i) #define isl_int_neg(r,i) mpz_neg(r,i) #define isl_int_swap(i,j) mpz_swap(i,j) #define isl_int_swap_or_set(i,j) mpz_swap(i,j) #define isl_int_add_ui(r,i,j) mpz_add_ui(r,i,j) #define isl_int_sub_ui(r,i,j) mpz_sub_ui(r,i,j) #define isl_int_add(r,i,j) mpz_add(r,i,j) #define isl_int_sub(r,i,j) mpz_sub(r,i,j) #define isl_int_mul(r,i,j) mpz_mul(r,i,j) #define isl_int_mul_2exp(r,i,j) mpz_mul_2exp(r,i,j) #define isl_int_mul_si(r,i,j) mpz_mul_si(r,i,j) #define isl_int_mul_ui(r,i,j) mpz_mul_ui(r,i,j) #define isl_int_pow_ui(r,i,j) mpz_pow_ui(r,i,j) #define isl_int_addmul(r,i,j) mpz_addmul(r,i,j) #define isl_int_addmul_ui(r,i,j) mpz_addmul_ui(r,i,j) #define isl_int_submul(r,i,j) mpz_submul(r,i,j) #define isl_int_submul_ui(r,i,j) mpz_submul_ui(r,i,j) #define isl_int_gcd(r,i,j) mpz_gcd(r,i,j) #ifdef GMP_NORMALIZE_GCDEXT void isl_gmp_gcdext(mpz_t G, mpz_t S, mpz_t T, mpz_t A, mpz_t B); #define isl_int_gcdext(g,x,y,i,j) isl_gmp_gcdext(g,x,y,i,j) #else #define isl_int_gcdext(g,x,y,i,j) mpz_gcdext(g,x,y,i,j) #endif #define isl_int_lcm(r,i,j) mpz_lcm(r,i,j) #define isl_int_divexact(r,i,j) mpz_divexact(r,i,j) #define isl_int_divexact_ui(r,i,j) mpz_divexact_ui(r,i,j) #define isl_int_tdiv_q(r,i,j) mpz_tdiv_q(r,i,j) #define isl_int_cdiv_q(r,i,j) mpz_cdiv_q(r,i,j) #define isl_int_fdiv_q(r,i,j) mpz_fdiv_q(r,i,j) #define isl_int_fdiv_r(r,i,j) mpz_fdiv_r(r,i,j) #define isl_int_fdiv_q_ui(r,i,j) mpz_fdiv_q_ui(r,i,j) #define isl_int_read(r,s) mpz_set_str(r,s,10) #define isl_int_print(out,i,width) \ do { \ char *s; \ s = mpz_get_str(0, 10, i); \ fprintf(out, "%*s", width, s); \ isl_int_free_str(s); \ } while (0) #define isl_int_sgn(i) mpz_sgn(i) #define isl_int_cmp(i,j) mpz_cmp(i,j) #define isl_int_cmp_si(i,si) mpz_cmp_si(i,si) #define isl_int_eq(i,j) (mpz_cmp(i,j) == 0) #define isl_int_ne(i,j) (mpz_cmp(i,j) != 0) #define isl_int_lt(i,j) (mpz_cmp(i,j) < 0) #define isl_int_le(i,j) (mpz_cmp(i,j) <= 0) #define isl_int_gt(i,j) (mpz_cmp(i,j) > 0) #define isl_int_ge(i,j) (mpz_cmp(i,j) >= 0) #define isl_int_abs_eq(i,j) (mpz_cmpabs(i,j) == 0) #define isl_int_abs_ne(i,j) (mpz_cmpabs(i,j) != 0) #define isl_int_abs_lt(i,j) (mpz_cmpabs(i,j) < 0) #define isl_int_abs_gt(i,j) (mpz_cmpabs(i,j) > 0) #define isl_int_abs_ge(i,j) (mpz_cmpabs(i,j) >= 0) #define isl_int_is_zero(i) (isl_int_sgn(i) == 0) #define isl_int_is_one(i) (isl_int_cmp_si(i,1) == 0) #define isl_int_is_negone(i) (isl_int_cmp_si(i,-1) == 0) #define isl_int_is_pos(i) (isl_int_sgn(i) > 0) #define isl_int_is_neg(i) (isl_int_sgn(i) < 0) #define isl_int_is_nonpos(i) (isl_int_sgn(i) <= 0) #define isl_int_is_nonneg(i) (isl_int_sgn(i) >= 0) #define isl_int_is_divisible_by(i,j) mpz_divisible_p(i,j) uint32_t isl_gmp_hash(mpz_t v, uint32_t hash); #define isl_int_hash(v,h) isl_gmp_hash(v,h) #endif cloog-0.18.2/isl/install-sh0000755000175000017500000003325512254313255012433 00000000000000#!/bin/sh # install - install a program, script, or datafile scriptversion=2011-11-20.07; # UTC # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # 'make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call 'install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then do_exit='(exit $ret); exit $ret' trap "ret=129; $do_exit" 1 trap "ret=130; $do_exit" 2 trap "ret=141; $do_exit" 13 trap "ret=143; $do_exit" 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names problematic for 'test' and other utilities. case $src in -* | [=\(\)!]) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; [-=\(\)!]*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test X"$d" = X && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: cloog-0.18.2/isl/isl_coalesce.c0000664000175000017500000014344512254313240013217 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012-2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include "isl_map_private.h" #include #include #include "isl_tab.h" #include #include #define STATUS_ERROR -1 #define STATUS_REDUNDANT 1 #define STATUS_VALID 2 #define STATUS_SEPARATE 3 #define STATUS_CUT 4 #define STATUS_ADJ_EQ 5 #define STATUS_ADJ_INEQ 6 static int status_in(isl_int *ineq, struct isl_tab *tab) { enum isl_ineq_type type = isl_tab_ineq_type(tab, ineq); switch (type) { default: case isl_ineq_error: return STATUS_ERROR; case isl_ineq_redundant: return STATUS_VALID; case isl_ineq_separate: return STATUS_SEPARATE; case isl_ineq_cut: return STATUS_CUT; case isl_ineq_adj_eq: return STATUS_ADJ_EQ; case isl_ineq_adj_ineq: return STATUS_ADJ_INEQ; } } /* Compute the position of the equalities of basic map "bmap_i" * with respect to the basic map represented by "tab_j". * The resulting array has twice as many entries as the number * of equalities corresponding to the two inequalties to which * each equality corresponds. */ static int *eq_status_in(__isl_keep isl_basic_map *bmap_i, struct isl_tab *tab_j) { int k, l; int *eq = isl_calloc_array(bmap_i->ctx, int, 2 * bmap_i->n_eq); unsigned dim; dim = isl_basic_map_total_dim(bmap_i); for (k = 0; k < bmap_i->n_eq; ++k) { for (l = 0; l < 2; ++l) { isl_seq_neg(bmap_i->eq[k], bmap_i->eq[k], 1+dim); eq[2 * k + l] = status_in(bmap_i->eq[k], tab_j); if (eq[2 * k + l] == STATUS_ERROR) goto error; } if (eq[2 * k] == STATUS_SEPARATE || eq[2 * k + 1] == STATUS_SEPARATE) break; } return eq; error: free(eq); return NULL; } /* Compute the position of the inequalities of basic map "bmap_i" * (also represented by "tab_i", if not NULL) with respect to the basic map * represented by "tab_j". */ static int *ineq_status_in(__isl_keep isl_basic_map *bmap_i, struct isl_tab *tab_i, struct isl_tab *tab_j) { int k; unsigned n_eq = bmap_i->n_eq; int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq); for (k = 0; k < bmap_i->n_ineq; ++k) { if (tab_i && isl_tab_is_redundant(tab_i, n_eq + k)) { ineq[k] = STATUS_REDUNDANT; continue; } ineq[k] = status_in(bmap_i->ineq[k], tab_j); if (ineq[k] == STATUS_ERROR) goto error; if (ineq[k] == STATUS_SEPARATE) break; } return ineq; error: free(ineq); return NULL; } static int any(int *con, unsigned len, int status) { int i; for (i = 0; i < len ; ++i) if (con[i] == status) return 1; return 0; } static int count(int *con, unsigned len, int status) { int i; int c = 0; for (i = 0; i < len ; ++i) if (con[i] == status) c++; return c; } static int all(int *con, unsigned len, int status) { int i; for (i = 0; i < len ; ++i) { if (con[i] == STATUS_REDUNDANT) continue; if (con[i] != status) return 0; } return 1; } static void drop(struct isl_map *map, int i, struct isl_tab **tabs) { isl_basic_map_free(map->p[i]); isl_tab_free(tabs[i]); if (i != map->n - 1) { map->p[i] = map->p[map->n - 1]; tabs[i] = tabs[map->n - 1]; } tabs[map->n - 1] = NULL; map->n--; } /* Replace the pair of basic maps i and j by the basic map bounded * by the valid constraints in both basic maps and the constraint * in extra (if not NULL). */ static int fuse(struct isl_map *map, int i, int j, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j, __isl_keep isl_mat *extra) { int k, l; struct isl_basic_map *fused = NULL; struct isl_tab *fused_tab = NULL; unsigned total = isl_basic_map_total_dim(map->p[i]); unsigned extra_rows = extra ? extra->n_row : 0; fused = isl_basic_map_alloc_space(isl_space_copy(map->p[i]->dim), map->p[i]->n_div, map->p[i]->n_eq + map->p[j]->n_eq, map->p[i]->n_ineq + map->p[j]->n_ineq + extra_rows); if (!fused) goto error; for (k = 0; k < map->p[i]->n_eq; ++k) { if (eq_i && (eq_i[2 * k] != STATUS_VALID || eq_i[2 * k + 1] != STATUS_VALID)) continue; l = isl_basic_map_alloc_equality(fused); if (l < 0) goto error; isl_seq_cpy(fused->eq[l], map->p[i]->eq[k], 1 + total); } for (k = 0; k < map->p[j]->n_eq; ++k) { if (eq_j && (eq_j[2 * k] != STATUS_VALID || eq_j[2 * k + 1] != STATUS_VALID)) continue; l = isl_basic_map_alloc_equality(fused); if (l < 0) goto error; isl_seq_cpy(fused->eq[l], map->p[j]->eq[k], 1 + total); } for (k = 0; k < map->p[i]->n_ineq; ++k) { if (ineq_i[k] != STATUS_VALID) continue; l = isl_basic_map_alloc_inequality(fused); if (l < 0) goto error; isl_seq_cpy(fused->ineq[l], map->p[i]->ineq[k], 1 + total); } for (k = 0; k < map->p[j]->n_ineq; ++k) { if (ineq_j[k] != STATUS_VALID) continue; l = isl_basic_map_alloc_inequality(fused); if (l < 0) goto error; isl_seq_cpy(fused->ineq[l], map->p[j]->ineq[k], 1 + total); } for (k = 0; k < map->p[i]->n_div; ++k) { int l = isl_basic_map_alloc_div(fused); if (l < 0) goto error; isl_seq_cpy(fused->div[l], map->p[i]->div[k], 1 + 1 + total); } for (k = 0; k < extra_rows; ++k) { l = isl_basic_map_alloc_inequality(fused); if (l < 0) goto error; isl_seq_cpy(fused->ineq[l], extra->row[k], 1 + total); } fused = isl_basic_map_gauss(fused, NULL); ISL_F_SET(fused, ISL_BASIC_MAP_FINAL); if (ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_RATIONAL) && ISL_F_ISSET(map->p[j], ISL_BASIC_MAP_RATIONAL)) ISL_F_SET(fused, ISL_BASIC_MAP_RATIONAL); fused_tab = isl_tab_from_basic_map(fused, 0); if (isl_tab_detect_redundant(fused_tab) < 0) goto error; isl_basic_map_free(map->p[i]); map->p[i] = fused; isl_tab_free(tabs[i]); tabs[i] = fused_tab; drop(map, j, tabs); return 1; error: isl_tab_free(fused_tab); isl_basic_map_free(fused); return -1; } /* Given a pair of basic maps i and j such that all constraints are either * "valid" or "cut", check if the facets corresponding to the "cut" * constraints of i lie entirely within basic map j. * If so, replace the pair by the basic map consisting of the valid * constraints in both basic maps. * * To see that we are not introducing any extra points, call the * two basic maps A and B and the resulting map U and let x * be an element of U \setminus ( A \cup B ). * Then there is a pair of cut constraints c_1 and c_2 in A and B such that x * violates them. Let X be the intersection of U with the opposites * of these constraints. Then x \in X. * The facet corresponding to c_1 contains the corresponding facet of A. * This facet is entirely contained in B, so c_2 is valid on the facet. * However, since it is also (part of) a facet of X, -c_2 is also valid * on the facet. This means c_2 is saturated on the facet, so c_1 and * c_2 must be opposites of each other, but then x could not violate * both of them. */ static int check_facets(struct isl_map *map, int i, int j, struct isl_tab **tabs, int *ineq_i, int *ineq_j) { int k, l; struct isl_tab_undo *snap; unsigned n_eq = map->p[i]->n_eq; snap = isl_tab_snap(tabs[i]); for (k = 0; k < map->p[i]->n_ineq; ++k) { if (ineq_i[k] != STATUS_CUT) continue; if (isl_tab_select_facet(tabs[i], n_eq + k) < 0) return -1; for (l = 0; l < map->p[j]->n_ineq; ++l) { int stat; if (ineq_j[l] != STATUS_CUT) continue; stat = status_in(map->p[j]->ineq[l], tabs[i]); if (stat != STATUS_VALID) break; } if (isl_tab_rollback(tabs[i], snap) < 0) return -1; if (l < map->p[j]->n_ineq) break; } if (k < map->p[i]->n_ineq) /* BAD CUT PAIR */ return 0; return fuse(map, i, j, tabs, NULL, ineq_i, NULL, ineq_j, NULL); } /* Check if basic map "i" contains the basic map represented * by the tableau "tab". */ static int contains(struct isl_map *map, int i, int *ineq_i, struct isl_tab *tab) { int k, l; unsigned dim; dim = isl_basic_map_total_dim(map->p[i]); for (k = 0; k < map->p[i]->n_eq; ++k) { for (l = 0; l < 2; ++l) { int stat; isl_seq_neg(map->p[i]->eq[k], map->p[i]->eq[k], 1+dim); stat = status_in(map->p[i]->eq[k], tab); if (stat != STATUS_VALID) return 0; } } for (k = 0; k < map->p[i]->n_ineq; ++k) { int stat; if (ineq_i[k] == STATUS_REDUNDANT) continue; stat = status_in(map->p[i]->ineq[k], tab); if (stat != STATUS_VALID) return 0; } return 1; } /* Basic map "i" has an inequality (say "k") that is adjacent * to some inequality of basic map "j". All the other inequalities * are valid for "j". * Check if basic map "j" forms an extension of basic map "i". * * Note that this function is only called if some of the equalities or * inequalities of basic map "j" do cut basic map "i". The function is * correct even if there are no such cut constraints, but in that case * the additional checks performed by this function are overkill. * * In particular, we replace constraint k, say f >= 0, by constraint * f <= -1, add the inequalities of "j" that are valid for "i" * and check if the result is a subset of basic map "j". * If so, then we know that this result is exactly equal to basic map "j" * since all its constraints are valid for basic map "j". * By combining the valid constraints of "i" (all equalities and all * inequalities except "k") and the valid constraints of "j" we therefore * obtain a basic map that is equal to their union. * In this case, there is no need to perform a rollback of the tableau * since it is going to be destroyed in fuse(). * * * |\__ |\__ * | \__ | \__ * | \_ => | \__ * |_______| _ |_________\ * * * |\ |\ * | \ | \ * | \ | \ * | | | \ * | ||\ => | \ * | || \ | \ * | || | | | * |__||_/ |_____/ */ static int is_adj_ineq_extension(__isl_keep isl_map *map, int i, int j, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int k; struct isl_tab_undo *snap; unsigned n_eq = map->p[i]->n_eq; unsigned total = isl_basic_map_total_dim(map->p[i]); int r; if (isl_tab_extend_cons(tabs[i], 1 + map->p[j]->n_ineq) < 0) return -1; for (k = 0; k < map->p[i]->n_ineq; ++k) if (ineq_i[k] == STATUS_ADJ_INEQ) break; if (k >= map->p[i]->n_ineq) isl_die(isl_map_get_ctx(map), isl_error_internal, "ineq_i should have exactly one STATUS_ADJ_INEQ", return -1); snap = isl_tab_snap(tabs[i]); if (isl_tab_unrestrict(tabs[i], n_eq + k) < 0) return -1; isl_seq_neg(map->p[i]->ineq[k], map->p[i]->ineq[k], 1 + total); isl_int_sub_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1); r = isl_tab_add_ineq(tabs[i], map->p[i]->ineq[k]); isl_seq_neg(map->p[i]->ineq[k], map->p[i]->ineq[k], 1 + total); isl_int_sub_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1); if (r < 0) return -1; for (k = 0; k < map->p[j]->n_ineq; ++k) { if (ineq_j[k] != STATUS_VALID) continue; if (isl_tab_add_ineq(tabs[i], map->p[j]->ineq[k]) < 0) return -1; } if (contains(map, j, ineq_j, tabs[i])) return fuse(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j, NULL); if (isl_tab_rollback(tabs[i], snap) < 0) return -1; return 0; } /* Both basic maps have at least one inequality with and adjacent * (but opposite) inequality in the other basic map. * Check that there are no cut constraints and that there is only * a single pair of adjacent inequalities. * If so, we can replace the pair by a single basic map described * by all but the pair of adjacent inequalities. * Any additional points introduced lie strictly between the two * adjacent hyperplanes and can therefore be integral. * * ____ _____ * / ||\ / \ * / || \ / \ * \ || \ => \ \ * \ || / \ / * \___||_/ \_____/ * * The test for a single pair of adjancent inequalities is important * for avoiding the combination of two basic maps like the following * * /| * / | * /__| * _____ * | | * | | * |___| * * If there are some cut constraints on one side, then we may * still be able to fuse the two basic maps, but we need to perform * some additional checks in is_adj_ineq_extension. */ static int check_adj_ineq(struct isl_map *map, int i, int j, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int count_i, count_j; int cut_i, cut_j; count_i = count(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ); count_j = count(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ); if (count_i != 1 && count_j != 1) return 0; cut_i = any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT) || any(ineq_i, map->p[i]->n_ineq, STATUS_CUT); cut_j = any(eq_j, 2 * map->p[j]->n_eq, STATUS_CUT) || any(ineq_j, map->p[j]->n_ineq, STATUS_CUT); if (!cut_i && !cut_j && count_i == 1 && count_j == 1) return fuse(map, i, j, tabs, NULL, ineq_i, NULL, ineq_j, NULL); if (count_i == 1 && !cut_i) return is_adj_ineq_extension(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j); if (count_j == 1 && !cut_j) return is_adj_ineq_extension(map, j, i, tabs, eq_j, ineq_j, eq_i, ineq_i); return 0; } /* Basic map "i" has an inequality "k" that is adjacent to some equality * of basic map "j". All the other inequalities are valid for "j". * Check if basic map "j" forms an extension of basic map "i". * * In particular, we relax constraint "k", compute the corresponding * facet and check whether it is included in the other basic map. * If so, we know that relaxing the constraint extends the basic * map with exactly the other basic map (we already know that this * other basic map is included in the extension, because there * were no "cut" inequalities in "i") and we can replace the * two basic maps by this extension. * ____ _____ * / || / | * / || / | * \ || => \ | * \ || \ | * \___|| \____| */ static int is_adj_eq_extension(struct isl_map *map, int i, int j, int k, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int changed = 0; int super; struct isl_tab_undo *snap, *snap2; unsigned n_eq = map->p[i]->n_eq; if (isl_tab_is_equality(tabs[i], n_eq + k)) return 0; snap = isl_tab_snap(tabs[i]); tabs[i] = isl_tab_relax(tabs[i], n_eq + k); snap2 = isl_tab_snap(tabs[i]); if (isl_tab_select_facet(tabs[i], n_eq + k) < 0) return -1; super = contains(map, j, ineq_j, tabs[i]); if (super) { if (isl_tab_rollback(tabs[i], snap2) < 0) return -1; map->p[i] = isl_basic_map_cow(map->p[i]); if (!map->p[i]) return -1; isl_int_add_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1); ISL_F_SET(map->p[i], ISL_BASIC_MAP_FINAL); drop(map, j, tabs); changed = 1; } else if (isl_tab_rollback(tabs[i], snap) < 0) return -1; return changed; } /* Data structure that keeps track of the wrapping constraints * and of information to bound the coefficients of those constraints. * * bound is set if we want to apply a bound on the coefficients * mat contains the wrapping constraints * max is the bound on the coefficients (if bound is set) */ struct isl_wraps { int bound; isl_mat *mat; isl_int max; }; /* Update wraps->max to be greater than or equal to the coefficients * in the equalities and inequalities of bmap that can be removed if we end up * applying wrapping. */ static void wraps_update_max(struct isl_wraps *wraps, __isl_keep isl_basic_map *bmap, int *eq, int *ineq) { int k; isl_int max_k; unsigned total = isl_basic_map_total_dim(bmap); isl_int_init(max_k); for (k = 0; k < bmap->n_eq; ++k) { if (eq[2 * k] == STATUS_VALID && eq[2 * k + 1] == STATUS_VALID) continue; isl_seq_abs_max(bmap->eq[k] + 1, total, &max_k); if (isl_int_abs_gt(max_k, wraps->max)) isl_int_set(wraps->max, max_k); } for (k = 0; k < bmap->n_ineq; ++k) { if (ineq[k] == STATUS_VALID || ineq[k] == STATUS_REDUNDANT) continue; isl_seq_abs_max(bmap->ineq[k] + 1, total, &max_k); if (isl_int_abs_gt(max_k, wraps->max)) isl_int_set(wraps->max, max_k); } isl_int_clear(max_k); } /* Initialize the isl_wraps data structure. * If we want to bound the coefficients of the wrapping constraints, * we set wraps->max to the largest coefficient * in the equalities and inequalities that can be removed if we end up * applying wrapping. */ static void wraps_init(struct isl_wraps *wraps, __isl_take isl_mat *mat, __isl_keep isl_map *map, int i, int j, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { isl_ctx *ctx; wraps->bound = 0; wraps->mat = mat; if (!mat) return; ctx = isl_mat_get_ctx(mat); wraps->bound = isl_options_get_coalesce_bounded_wrapping(ctx); if (!wraps->bound) return; isl_int_init(wraps->max); isl_int_set_si(wraps->max, 0); wraps_update_max(wraps, map->p[i], eq_i, ineq_i); wraps_update_max(wraps, map->p[j], eq_j, ineq_j); } /* Free the contents of the isl_wraps data structure. */ static void wraps_free(struct isl_wraps *wraps) { isl_mat_free(wraps->mat); if (wraps->bound) isl_int_clear(wraps->max); } /* Is the wrapping constraint in row "row" allowed? * * If wraps->bound is set, we check that none of the coefficients * is greater than wraps->max. */ static int allow_wrap(struct isl_wraps *wraps, int row) { int i; if (!wraps->bound) return 1; for (i = 1; i < wraps->mat->n_col; ++i) if (isl_int_abs_gt(wraps->mat->row[row][i], wraps->max)) return 0; return 1; } /* For each non-redundant constraint in "bmap" (as determined by "tab"), * wrap the constraint around "bound" such that it includes the whole * set "set" and append the resulting constraint to "wraps". * "wraps" is assumed to have been pre-allocated to the appropriate size. * wraps->n_row is the number of actual wrapped constraints that have * been added. * If any of the wrapping problems results in a constraint that is * identical to "bound", then this means that "set" is unbounded in such * way that no wrapping is possible. If this happens then wraps->n_row * is reset to zero. * Similarly, if we want to bound the coefficients of the wrapping * constraints and a newly added wrapping constraint does not * satisfy the bound, then wraps->n_row is also reset to zero. */ static int add_wraps(struct isl_wraps *wraps, __isl_keep isl_basic_map *bmap, struct isl_tab *tab, isl_int *bound, __isl_keep isl_set *set) { int l; int w; unsigned total = isl_basic_map_total_dim(bmap); w = wraps->mat->n_row; for (l = 0; l < bmap->n_ineq; ++l) { if (isl_seq_is_neg(bound, bmap->ineq[l], 1 + total)) continue; if (isl_seq_eq(bound, bmap->ineq[l], 1 + total)) continue; if (isl_tab_is_redundant(tab, bmap->n_eq + l)) continue; isl_seq_cpy(wraps->mat->row[w], bound, 1 + total); if (!isl_set_wrap_facet(set, wraps->mat->row[w], bmap->ineq[l])) return -1; if (isl_seq_eq(wraps->mat->row[w], bound, 1 + total)) goto unbounded; if (!allow_wrap(wraps, w)) goto unbounded; ++w; } for (l = 0; l < bmap->n_eq; ++l) { if (isl_seq_is_neg(bound, bmap->eq[l], 1 + total)) continue; if (isl_seq_eq(bound, bmap->eq[l], 1 + total)) continue; isl_seq_cpy(wraps->mat->row[w], bound, 1 + total); isl_seq_neg(wraps->mat->row[w + 1], bmap->eq[l], 1 + total); if (!isl_set_wrap_facet(set, wraps->mat->row[w], wraps->mat->row[w + 1])) return -1; if (isl_seq_eq(wraps->mat->row[w], bound, 1 + total)) goto unbounded; if (!allow_wrap(wraps, w)) goto unbounded; ++w; isl_seq_cpy(wraps->mat->row[w], bound, 1 + total); if (!isl_set_wrap_facet(set, wraps->mat->row[w], bmap->eq[l])) return -1; if (isl_seq_eq(wraps->mat->row[w], bound, 1 + total)) goto unbounded; if (!allow_wrap(wraps, w)) goto unbounded; ++w; } wraps->mat->n_row = w; return 0; unbounded: wraps->mat->n_row = 0; return 0; } /* Check if the constraints in "wraps" from "first" until the last * are all valid for the basic set represented by "tab". * If not, wraps->n_row is set to zero. */ static int check_wraps(__isl_keep isl_mat *wraps, int first, struct isl_tab *tab) { int i; for (i = first; i < wraps->n_row; ++i) { enum isl_ineq_type type; type = isl_tab_ineq_type(tab, wraps->row[i]); if (type == isl_ineq_error) return -1; if (type == isl_ineq_redundant) continue; wraps->n_row = 0; return 0; } return 0; } /* Return a set that corresponds to the non-redudant constraints * (as recorded in tab) of bmap. * * It's important to remove the redundant constraints as some * of the other constraints may have been modified after the * constraints were marked redundant. * In particular, a constraint may have been relaxed. * Redundant constraints are ignored when a constraint is relaxed * and should therefore continue to be ignored ever after. * Otherwise, the relaxation might be thwarted by some of * these constraints. */ static __isl_give isl_set *set_from_updated_bmap(__isl_keep isl_basic_map *bmap, struct isl_tab *tab) { bmap = isl_basic_map_copy(bmap); bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_update_from_tab(bmap, tab); return isl_set_from_basic_set(isl_basic_map_underlying_set(bmap)); } /* Given a basic set i with a constraint k that is adjacent to either the * whole of basic set j or a facet of basic set j, check if we can wrap * both the facet corresponding to k and the facet of j (or the whole of j) * around their ridges to include the other set. * If so, replace the pair of basic sets by their union. * * All constraints of i (except k) are assumed to be valid for j. * * However, the constraints of j may not be valid for i and so * we have to check that the wrapping constraints for j are valid for i. * * In the case where j has a facet adjacent to i, tab[j] is assumed * to have been restricted to this facet, so that the non-redundant * constraints in tab[j] are the ridges of the facet. * Note that for the purpose of wrapping, it does not matter whether * we wrap the ridges of i around the whole of j or just around * the facet since all the other constraints are assumed to be valid for j. * In practice, we wrap to include the whole of j. * ____ _____ * / | / \ * / || / | * \ || => \ | * \ || \ | * \___|| \____| * */ static int can_wrap_in_facet(struct isl_map *map, int i, int j, int k, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int changed = 0; struct isl_wraps wraps; isl_mat *mat; struct isl_set *set_i = NULL; struct isl_set *set_j = NULL; struct isl_vec *bound = NULL; unsigned total = isl_basic_map_total_dim(map->p[i]); struct isl_tab_undo *snap; int n; set_i = set_from_updated_bmap(map->p[i], tabs[i]); set_j = set_from_updated_bmap(map->p[j], tabs[j]); mat = isl_mat_alloc(map->ctx, 2 * (map->p[i]->n_eq + map->p[j]->n_eq) + map->p[i]->n_ineq + map->p[j]->n_ineq, 1 + total); wraps_init(&wraps, mat, map, i, j, eq_i, ineq_i, eq_j, ineq_j); bound = isl_vec_alloc(map->ctx, 1 + total); if (!set_i || !set_j || !wraps.mat || !bound) goto error; isl_seq_cpy(bound->el, map->p[i]->ineq[k], 1 + total); isl_int_add_ui(bound->el[0], bound->el[0], 1); isl_seq_cpy(wraps.mat->row[0], bound->el, 1 + total); wraps.mat->n_row = 1; if (add_wraps(&wraps, map->p[j], tabs[j], bound->el, set_i) < 0) goto error; if (!wraps.mat->n_row) goto unbounded; snap = isl_tab_snap(tabs[i]); if (isl_tab_select_facet(tabs[i], map->p[i]->n_eq + k) < 0) goto error; if (isl_tab_detect_redundant(tabs[i]) < 0) goto error; isl_seq_neg(bound->el, map->p[i]->ineq[k], 1 + total); n = wraps.mat->n_row; if (add_wraps(&wraps, map->p[i], tabs[i], bound->el, set_j) < 0) goto error; if (isl_tab_rollback(tabs[i], snap) < 0) goto error; if (check_wraps(wraps.mat, n, tabs[i]) < 0) goto error; if (!wraps.mat->n_row) goto unbounded; changed = fuse(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j, wraps.mat); unbounded: wraps_free(&wraps); isl_set_free(set_i); isl_set_free(set_j); isl_vec_free(bound); return changed; error: wraps_free(&wraps); isl_vec_free(bound); isl_set_free(set_i); isl_set_free(set_j); return -1; } /* Set the is_redundant property of the "n" constraints in "cuts", * except "k" to "v". * This is a fairly tricky operation as it bypasses isl_tab.c. * The reason we want to temporarily mark some constraints redundant * is that we want to ignore them in add_wraps. * * Initially all cut constraints are non-redundant, but the * selection of a facet right before the call to this function * may have made some of them redundant. * Likewise, the same constraints are marked non-redundant * in the second call to this function, before they are officially * made non-redundant again in the subsequent rollback. */ static void set_is_redundant(struct isl_tab *tab, unsigned n_eq, int *cuts, int n, int k, int v) { int l; for (l = 0; l < n; ++l) { if (l == k) continue; tab->con[n_eq + cuts[l]].is_redundant = v; } } /* Given a pair of basic maps i and j such that j sticks out * of i at n cut constraints, each time by at most one, * try to compute wrapping constraints and replace the two * basic maps by a single basic map. * The other constraints of i are assumed to be valid for j. * * The facets of i corresponding to the cut constraints are * wrapped around their ridges, except those ridges determined * by any of the other cut constraints. * The intersections of cut constraints need to be ignored * as the result of wrapping one cut constraint around another * would result in a constraint cutting the union. * In each case, the facets are wrapped to include the union * of the two basic maps. * * The pieces of j that lie at an offset of exactly one from * one of the cut constraints of i are wrapped around their edges. * Here, there is no need to ignore intersections because we * are wrapping around the union of the two basic maps. * * If any wrapping fails, i.e., if we cannot wrap to touch * the union, then we give up. * Otherwise, the pair of basic maps is replaced by their union. */ static int wrap_in_facets(struct isl_map *map, int i, int j, int *cuts, int n, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int changed = 0; struct isl_wraps wraps; isl_mat *mat; isl_set *set = NULL; isl_vec *bound = NULL; unsigned total = isl_basic_map_total_dim(map->p[i]); int max_wrap; int k; struct isl_tab_undo *snap_i, *snap_j; if (isl_tab_extend_cons(tabs[j], 1) < 0) goto error; max_wrap = 2 * (map->p[i]->n_eq + map->p[j]->n_eq) + map->p[i]->n_ineq + map->p[j]->n_ineq; max_wrap *= n; set = isl_set_union(set_from_updated_bmap(map->p[i], tabs[i]), set_from_updated_bmap(map->p[j], tabs[j])); mat = isl_mat_alloc(map->ctx, max_wrap, 1 + total); wraps_init(&wraps, mat, map, i, j, eq_i, ineq_i, eq_j, ineq_j); bound = isl_vec_alloc(map->ctx, 1 + total); if (!set || !wraps.mat || !bound) goto error; snap_i = isl_tab_snap(tabs[i]); snap_j = isl_tab_snap(tabs[j]); wraps.mat->n_row = 0; for (k = 0; k < n; ++k) { if (isl_tab_select_facet(tabs[i], map->p[i]->n_eq + cuts[k]) < 0) goto error; if (isl_tab_detect_redundant(tabs[i]) < 0) goto error; set_is_redundant(tabs[i], map->p[i]->n_eq, cuts, n, k, 1); isl_seq_neg(bound->el, map->p[i]->ineq[cuts[k]], 1 + total); if (!tabs[i]->empty && add_wraps(&wraps, map->p[i], tabs[i], bound->el, set) < 0) goto error; set_is_redundant(tabs[i], map->p[i]->n_eq, cuts, n, k, 0); if (isl_tab_rollback(tabs[i], snap_i) < 0) goto error; if (tabs[i]->empty) break; if (!wraps.mat->n_row) break; isl_seq_cpy(bound->el, map->p[i]->ineq[cuts[k]], 1 + total); isl_int_add_ui(bound->el[0], bound->el[0], 1); if (isl_tab_add_eq(tabs[j], bound->el) < 0) goto error; if (isl_tab_detect_redundant(tabs[j]) < 0) goto error; if (!tabs[j]->empty && add_wraps(&wraps, map->p[j], tabs[j], bound->el, set) < 0) goto error; if (isl_tab_rollback(tabs[j], snap_j) < 0) goto error; if (!wraps.mat->n_row) break; } if (k == n) changed = fuse(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j, wraps.mat); isl_vec_free(bound); wraps_free(&wraps); isl_set_free(set); return changed; error: isl_vec_free(bound); wraps_free(&wraps); isl_set_free(set); return -1; } /* Given two basic sets i and j such that i has no cut equalities, * check if relaxing all the cut inequalities of i by one turns * them into valid constraint for j and check if we can wrap in * the bits that are sticking out. * If so, replace the pair by their union. * * We first check if all relaxed cut inequalities of i are valid for j * and then try to wrap in the intersections of the relaxed cut inequalities * with j. * * During this wrapping, we consider the points of j that lie at a distance * of exactly 1 from i. In particular, we ignore the points that lie in * between this lower-dimensional space and the basic map i. * We can therefore only apply this to integer maps. * ____ _____ * / ___|_ / \ * / | | / | * \ | | => \ | * \|____| \ | * \___| \____/ * * _____ ______ * | ____|_ | \ * | | | | | * | | | => | | * |_| | | | * |_____| \______| * * _______ * | | * | |\ | * | | \ | * | | \ | * | | \| * | | \ * | |_____\ * | | * |_______| * * Wrapping can fail if the result of wrapping one of the facets * around its edges does not produce any new facet constraint. * In particular, this happens when we try to wrap in unbounded sets. * * _______________________________________________________________________ * | * | ___ * | | | * |_| |_________________________________________________________________ * |___| * * The following is not an acceptable result of coalescing the above two * sets as it includes extra integer points. * _______________________________________________________________________ * | * | * | * | * \______________________________________________________________________ */ static int can_wrap_in_set(struct isl_map *map, int i, int j, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int changed = 0; int k, m; int n; int *cuts = NULL; if (ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_RATIONAL) || ISL_F_ISSET(map->p[j], ISL_BASIC_MAP_RATIONAL)) return 0; n = count(ineq_i, map->p[i]->n_ineq, STATUS_CUT); if (n == 0) return 0; cuts = isl_alloc_array(map->ctx, int, n); if (!cuts) return -1; for (k = 0, m = 0; m < n; ++k) { enum isl_ineq_type type; if (ineq_i[k] != STATUS_CUT) continue; isl_int_add_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1); type = isl_tab_ineq_type(tabs[j], map->p[i]->ineq[k]); isl_int_sub_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1); if (type == isl_ineq_error) goto error; if (type != isl_ineq_redundant) break; cuts[m] = k; ++m; } if (m == n) changed = wrap_in_facets(map, i, j, cuts, n, tabs, eq_i, ineq_i, eq_j, ineq_j); free(cuts); return changed; error: free(cuts); return -1; } /* Check if either i or j has a single cut constraint that can * be used to wrap in (a facet of) the other basic set. * if so, replace the pair by their union. */ static int check_wrap(struct isl_map *map, int i, int j, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int changed = 0; if (!any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT)) changed = can_wrap_in_set(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j); if (changed) return changed; if (!any(eq_j, 2 * map->p[j]->n_eq, STATUS_CUT)) changed = can_wrap_in_set(map, j, i, tabs, eq_j, ineq_j, eq_i, ineq_i); return changed; } /* At least one of the basic maps has an equality that is adjacent * to inequality. Make sure that only one of the basic maps has * such an equality and that the other basic map has exactly one * inequality adjacent to an equality. * We call the basic map that has the inequality "i" and the basic * map that has the equality "j". * If "i" has any "cut" (in)equality, then relaxing the inequality * by one would not result in a basic map that contains the other * basic map. */ static int check_adj_eq(struct isl_map *map, int i, int j, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int changed = 0; int k; if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ) && any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ)) /* ADJ EQ TOO MANY */ return 0; if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ)) return check_adj_eq(map, j, i, tabs, eq_j, ineq_j, eq_i, ineq_i); /* j has an equality adjacent to an inequality in i */ if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT)) return 0; if (any(ineq_i, map->p[i]->n_ineq, STATUS_CUT)) /* ADJ EQ CUT */ return 0; if (count(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_EQ) != 1 || any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_EQ) || any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ) || any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ)) /* ADJ EQ TOO MANY */ return 0; for (k = 0; k < map->p[i]->n_ineq; ++k) if (ineq_i[k] == STATUS_ADJ_EQ) break; changed = is_adj_eq_extension(map, i, j, k, tabs, eq_i, ineq_i, eq_j, ineq_j); if (changed) return changed; if (count(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ) != 1) return 0; changed = can_wrap_in_facet(map, i, j, k, tabs, eq_i, ineq_i, eq_j, ineq_j); return changed; } /* The two basic maps lie on adjacent hyperplanes. In particular, * basic map "i" has an equality that lies parallel to basic map "j". * Check if we can wrap the facets around the parallel hyperplanes * to include the other set. * * We perform basically the same operations as can_wrap_in_facet, * except that we don't need to select a facet of one of the sets. * _ * \\ \\ * \\ => \\ * \ \| * * We only allow one equality of "i" to be adjacent to an equality of "j" * to avoid coalescing * * [m, n] -> { [x, y] -> [x, 1 + y] : x >= 1 and y >= 1 and * x <= 10 and y <= 10; * [x, y] -> [1 + x, y] : x >= 1 and x <= 20 and * y >= 5 and y <= 15 } * * to * * [m, n] -> { [x, y] -> [x2, y2] : x >= 1 and 10y2 <= 20 - x + 10y and * 4y2 >= 5 + 3y and 5y2 <= 15 + 4y and * y2 <= 1 + x + y - x2 and y2 >= y and * y2 >= 1 + x + y - x2 } */ static int check_eq_adj_eq(struct isl_map *map, int i, int j, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) { int k; int changed = 0; struct isl_wraps wraps; isl_mat *mat; struct isl_set *set_i = NULL; struct isl_set *set_j = NULL; struct isl_vec *bound = NULL; unsigned total = isl_basic_map_total_dim(map->p[i]); if (count(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_EQ) != 1) return 0; for (k = 0; k < 2 * map->p[i]->n_eq ; ++k) if (eq_i[k] == STATUS_ADJ_EQ) break; set_i = set_from_updated_bmap(map->p[i], tabs[i]); set_j = set_from_updated_bmap(map->p[j], tabs[j]); mat = isl_mat_alloc(map->ctx, 2 * (map->p[i]->n_eq + map->p[j]->n_eq) + map->p[i]->n_ineq + map->p[j]->n_ineq, 1 + total); wraps_init(&wraps, mat, map, i, j, eq_i, ineq_i, eq_j, ineq_j); bound = isl_vec_alloc(map->ctx, 1 + total); if (!set_i || !set_j || !wraps.mat || !bound) goto error; if (k % 2 == 0) isl_seq_neg(bound->el, map->p[i]->eq[k / 2], 1 + total); else isl_seq_cpy(bound->el, map->p[i]->eq[k / 2], 1 + total); isl_int_add_ui(bound->el[0], bound->el[0], 1); isl_seq_cpy(wraps.mat->row[0], bound->el, 1 + total); wraps.mat->n_row = 1; if (add_wraps(&wraps, map->p[j], tabs[j], bound->el, set_i) < 0) goto error; if (!wraps.mat->n_row) goto unbounded; isl_int_sub_ui(bound->el[0], bound->el[0], 1); isl_seq_neg(bound->el, bound->el, 1 + total); isl_seq_cpy(wraps.mat->row[wraps.mat->n_row], bound->el, 1 + total); wraps.mat->n_row++; if (add_wraps(&wraps, map->p[i], tabs[i], bound->el, set_j) < 0) goto error; if (!wraps.mat->n_row) goto unbounded; changed = fuse(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j, wraps.mat); if (0) { error: changed = -1; } unbounded: wraps_free(&wraps); isl_set_free(set_i); isl_set_free(set_j); isl_vec_free(bound); return changed; } /* Check if the union of the given pair of basic maps * can be represented by a single basic map. * If so, replace the pair by the single basic map and return 1. * Otherwise, return 0; * The two basic maps are assumed to live in the same local space. * * We first check the effect of each constraint of one basic map * on the other basic map. * The constraint may be * redundant the constraint is redundant in its own * basic map and should be ignore and removed * in the end * valid all (integer) points of the other basic map * satisfy the constraint * separate no (integer) point of the other basic map * satisfies the constraint * cut some but not all points of the other basic map * satisfy the constraint * adj_eq the given constraint is adjacent (on the outside) * to an equality of the other basic map * adj_ineq the given constraint is adjacent (on the outside) * to an inequality of the other basic map * * We consider seven cases in which we can replace the pair by a single * basic map. We ignore all "redundant" constraints. * * 1. all constraints of one basic map are valid * => the other basic map is a subset and can be removed * * 2. all constraints of both basic maps are either "valid" or "cut" * and the facets corresponding to the "cut" constraints * of one of the basic maps lies entirely inside the other basic map * => the pair can be replaced by a basic map consisting * of the valid constraints in both basic maps * * 3. there is a single pair of adjacent inequalities * (all other constraints are "valid") * => the pair can be replaced by a basic map consisting * of the valid constraints in both basic maps * * 4. one basic map has a single adjacent inequality, while the other * constraints are "valid". The other basic map has some * "cut" constraints, but replacing the adjacent inequality by * its opposite and adding the valid constraints of the other * basic map results in a subset of the other basic map * => the pair can be replaced by a basic map consisting * of the valid constraints in both basic maps * * 5. there is a single adjacent pair of an inequality and an equality, * the other constraints of the basic map containing the inequality are * "valid". Moreover, if the inequality the basic map is relaxed * and then turned into an equality, then resulting facet lies * entirely inside the other basic map * => the pair can be replaced by the basic map containing * the inequality, with the inequality relaxed. * * 6. there is a single adjacent pair of an inequality and an equality, * the other constraints of the basic map containing the inequality are * "valid". Moreover, the facets corresponding to both * the inequality and the equality can be wrapped around their * ridges to include the other basic map * => the pair can be replaced by a basic map consisting * of the valid constraints in both basic maps together * with all wrapping constraints * * 7. one of the basic maps extends beyond the other by at most one. * Moreover, the facets corresponding to the cut constraints and * the pieces of the other basic map at offset one from these cut * constraints can be wrapped around their ridges to include * the union of the two basic maps * => the pair can be replaced by a basic map consisting * of the valid constraints in both basic maps together * with all wrapping constraints * * 8. the two basic maps live in adjacent hyperplanes. In principle * such sets can always be combined through wrapping, but we impose * that there is only one such pair, to avoid overeager coalescing. * * Throughout the computation, we maintain a collection of tableaus * corresponding to the basic maps. When the basic maps are dropped * or combined, the tableaus are modified accordingly. */ static int coalesce_local_pair(__isl_keep isl_map *map, int i, int j, struct isl_tab **tabs) { int changed = 0; int *eq_i = NULL; int *eq_j = NULL; int *ineq_i = NULL; int *ineq_j = NULL; eq_i = eq_status_in(map->p[i], tabs[j]); if (map->p[i]->n_eq && !eq_i) goto error; if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ERROR)) goto error; if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_SEPARATE)) goto done; eq_j = eq_status_in(map->p[j], tabs[i]); if (map->p[j]->n_eq && !eq_j) goto error; if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_ERROR)) goto error; if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_SEPARATE)) goto done; ineq_i = ineq_status_in(map->p[i], tabs[i], tabs[j]); if (map->p[i]->n_ineq && !ineq_i) goto error; if (any(ineq_i, map->p[i]->n_ineq, STATUS_ERROR)) goto error; if (any(ineq_i, map->p[i]->n_ineq, STATUS_SEPARATE)) goto done; ineq_j = ineq_status_in(map->p[j], tabs[j], tabs[i]); if (map->p[j]->n_ineq && !ineq_j) goto error; if (any(ineq_j, map->p[j]->n_ineq, STATUS_ERROR)) goto error; if (any(ineq_j, map->p[j]->n_ineq, STATUS_SEPARATE)) goto done; if (all(eq_i, 2 * map->p[i]->n_eq, STATUS_VALID) && all(ineq_i, map->p[i]->n_ineq, STATUS_VALID)) { drop(map, j, tabs); changed = 1; } else if (all(eq_j, 2 * map->p[j]->n_eq, STATUS_VALID) && all(ineq_j, map->p[j]->n_ineq, STATUS_VALID)) { drop(map, i, tabs); changed = 1; } else if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_EQ)) { changed = check_eq_adj_eq(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j); } else if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_EQ)) { changed = check_eq_adj_eq(map, j, i, tabs, eq_j, ineq_j, eq_i, ineq_i); } else if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ) || any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ)) { changed = check_adj_eq(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j); } else if (any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_EQ) || any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_EQ)) { /* Can't happen */ /* BAD ADJ INEQ */ } else if (any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ) || any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ)) { changed = check_adj_ineq(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j); } else { if (!any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT) && !any(eq_j, 2 * map->p[j]->n_eq, STATUS_CUT)) changed = check_facets(map, i, j, tabs, ineq_i, ineq_j); if (!changed) changed = check_wrap(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j); } done: free(eq_i); free(eq_j); free(ineq_i); free(ineq_j); return changed; error: free(eq_i); free(eq_j); free(ineq_i); free(ineq_j); return -1; } /* Do the two basic maps live in the same local space, i.e., * do they have the same (known) divs? * If either basic map has any unknown divs, then we can only assume * that they do not live in the same local space. */ static int same_divs(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2) { int i; int known; int total; if (!bmap1 || !bmap2) return -1; if (bmap1->n_div != bmap2->n_div) return 0; if (bmap1->n_div == 0) return 1; known = isl_basic_map_divs_known(bmap1); if (known < 0 || !known) return known; known = isl_basic_map_divs_known(bmap2); if (known < 0 || !known) return known; total = isl_basic_map_total_dim(bmap1); for (i = 0; i < bmap1->n_div; ++i) if (!isl_seq_eq(bmap1->div[i], bmap2->div[i], 2 + total)) return 0; return 1; } /* Given two basic maps "i" and "j", where the divs of "i" form a subset * of those of "j", check if basic map "j" is a subset of basic map "i" * and, if so, drop basic map "j". * * We first expand the divs of basic map "i" to match those of basic map "j", * using the divs and expansion computed by the caller. * Then we check if all constraints of the expanded "i" are valid for "j". */ static int coalesce_subset(__isl_keep isl_map *map, int i, int j, struct isl_tab **tabs, __isl_keep isl_mat *div, int *exp) { isl_basic_map *bmap; int changed = 0; int *eq_i = NULL; int *ineq_i = NULL; bmap = isl_basic_map_copy(map->p[i]); bmap = isl_basic_set_expand_divs(bmap, isl_mat_copy(div), exp); if (!bmap) goto error; eq_i = eq_status_in(bmap, tabs[j]); if (bmap->n_eq && !eq_i) goto error; if (any(eq_i, 2 * bmap->n_eq, STATUS_ERROR)) goto error; if (any(eq_i, 2 * bmap->n_eq, STATUS_SEPARATE)) goto done; ineq_i = ineq_status_in(bmap, NULL, tabs[j]); if (bmap->n_ineq && !ineq_i) goto error; if (any(ineq_i, bmap->n_ineq, STATUS_ERROR)) goto error; if (any(ineq_i, bmap->n_ineq, STATUS_SEPARATE)) goto done; if (all(eq_i, 2 * map->p[i]->n_eq, STATUS_VALID) && all(ineq_i, map->p[i]->n_ineq, STATUS_VALID)) { drop(map, j, tabs); changed = 1; } done: isl_basic_map_free(bmap); free(eq_i); free(ineq_i); return 0; error: isl_basic_map_free(bmap); free(eq_i); free(ineq_i); return -1; } /* Check if the basic map "j" is a subset of basic map "i", * assuming that "i" has fewer divs that "j". * If not, then we change the order. * * If the two basic maps have the same number of divs, then * they must necessarily be different. Otherwise, we would have * called coalesce_local_pair. We therefore don't try anything * in this case. * * We first check if the divs of "i" are all known and form a subset * of those of "j". If so, we pass control over to coalesce_subset. */ static int check_coalesce_subset(__isl_keep isl_map *map, int i, int j, struct isl_tab **tabs) { int known; isl_mat *div_i, *div_j, *div; int *exp1 = NULL; int *exp2 = NULL; isl_ctx *ctx; int subset; if (map->p[i]->n_div == map->p[j]->n_div) return 0; if (map->p[j]->n_div < map->p[i]->n_div) return check_coalesce_subset(map, j, i, tabs); known = isl_basic_map_divs_known(map->p[i]); if (known < 0 || !known) return known; ctx = isl_map_get_ctx(map); div_i = isl_basic_map_get_divs(map->p[i]); div_j = isl_basic_map_get_divs(map->p[j]); if (!div_i || !div_j) goto error; exp1 = isl_alloc_array(ctx, int, div_i->n_row); exp2 = isl_alloc_array(ctx, int, div_j->n_row); if ((div_i->n_row && !exp1) || (div_j->n_row && !exp2)) goto error; div = isl_merge_divs(div_i, div_j, exp1, exp2); if (!div) goto error; if (div->n_row == div_j->n_row) subset = coalesce_subset(map, i, j, tabs, div, exp1); else subset = 0; isl_mat_free(div); isl_mat_free(div_i); isl_mat_free(div_j); free(exp2); free(exp1); return subset; error: isl_mat_free(div_i); isl_mat_free(div_j); free(exp1); free(exp2); return -1; } /* Check if the union of the given pair of basic maps * can be represented by a single basic map. * If so, replace the pair by the single basic map and return 1. * Otherwise, return 0; * * We first check if the two basic maps live in the same local space. * If so, we do the complete check. Otherwise, we check if one is * an obvious subset of the other. */ static int coalesce_pair(__isl_keep isl_map *map, int i, int j, struct isl_tab **tabs) { int same; same = same_divs(map->p[i], map->p[j]); if (same < 0) return -1; if (same) return coalesce_local_pair(map, i, j, tabs); return check_coalesce_subset(map, i, j, tabs); } static struct isl_map *coalesce(struct isl_map *map, struct isl_tab **tabs) { int i, j; for (i = map->n - 2; i >= 0; --i) restart: for (j = i + 1; j < map->n; ++j) { int changed; changed = coalesce_pair(map, i, j, tabs); if (changed < 0) goto error; if (changed) goto restart; } return map; error: isl_map_free(map); return NULL; } /* For each pair of basic maps in the map, check if the union of the two * can be represented by a single basic map. * If so, replace the pair by the single basic map and start over. * * Since we are constructing the tableaus of the basic maps anyway, * we exploit them to detect implicit equalities and redundant constraints. * This also helps the coalescing as it can ignore the redundant constraints. * In order to avoid confusion, we make all implicit equalities explicit * in the basic maps. We don't call isl_basic_map_gauss, though, * as that may affect the number of constraints. * This means that we have to call isl_basic_map_gauss at the end * of the computation to ensure that the basic maps are not left * in an unexpected state. */ struct isl_map *isl_map_coalesce(struct isl_map *map) { int i; unsigned n; struct isl_tab **tabs = NULL; map = isl_map_remove_empty_parts(map); if (!map) return NULL; if (map->n <= 1) return map; map = isl_map_sort_divs(map); map = isl_map_cow(map); tabs = isl_calloc_array(map->ctx, struct isl_tab *, map->n); if (!tabs) goto error; n = map->n; for (i = 0; i < map->n; ++i) { tabs[i] = isl_tab_from_basic_map(map->p[i], 0); if (!tabs[i]) goto error; if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_NO_IMPLICIT)) if (isl_tab_detect_implicit_equalities(tabs[i]) < 0) goto error; map->p[i] = isl_tab_make_equalities_explicit(tabs[i], map->p[i]); if (!map->p[i]) goto error; if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_NO_REDUNDANT)) if (isl_tab_detect_redundant(tabs[i]) < 0) goto error; } for (i = map->n - 1; i >= 0; --i) if (tabs[i]->empty) drop(map, i, tabs); map = coalesce(map, tabs); if (map) for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_update_from_tab(map->p[i], tabs[i]); map->p[i] = isl_basic_map_gauss(map->p[i], NULL); map->p[i] = isl_basic_map_finalize(map->p[i]); if (!map->p[i]) goto error; ISL_F_SET(map->p[i], ISL_BASIC_MAP_NO_IMPLICIT); ISL_F_SET(map->p[i], ISL_BASIC_MAP_NO_REDUNDANT); } for (i = 0; i < n; ++i) isl_tab_free(tabs[i]); free(tabs); return map; error: if (tabs) for (i = 0; i < n; ++i) isl_tab_free(tabs[i]); free(tabs); isl_map_free(map); return NULL; } /* For each pair of basic sets in the set, check if the union of the two * can be represented by a single basic set. * If so, replace the pair by the single basic set and start over. */ struct isl_set *isl_set_coalesce(struct isl_set *set) { return (struct isl_set *)isl_map_coalesce((struct isl_map *)set); } cloog-0.18.2/isl/isl_sort.h0000664000175000017500000000030512254313240012420 00000000000000#ifndef ISL_SORT_H #define ISL_SORT_H #include int isl_sort(void *const pbase, size_t total_elems, size_t size, int (*cmp)(const void *, const void *, void *arg), void *arg); #endif cloog-0.18.2/isl/isl_ast.c0000664000175000017500000013040412254313240012217 00000000000000#include #include #undef BASE #define BASE ast_expr #include #undef BASE #define BASE ast_node #include isl_ctx *isl_ast_print_options_get_ctx( __isl_keep isl_ast_print_options *options) { return options ? options->ctx : NULL; } __isl_give isl_ast_print_options *isl_ast_print_options_alloc(isl_ctx *ctx) { isl_ast_print_options *options; options = isl_calloc_type(ctx, isl_ast_print_options); if (!options) return NULL; options->ctx = ctx; isl_ctx_ref(ctx); options->ref = 1; return options; } __isl_give isl_ast_print_options *isl_ast_print_options_dup( __isl_keep isl_ast_print_options *options) { isl_ctx *ctx; isl_ast_print_options *dup; if (!options) return NULL; ctx = isl_ast_print_options_get_ctx(options); dup = isl_ast_print_options_alloc(ctx); if (!dup) return NULL; dup->print_for = options->print_for; dup->print_for_user = options->print_for_user; dup->print_user = options->print_user; dup->print_user_user = options->print_user_user; return dup; } __isl_give isl_ast_print_options *isl_ast_print_options_cow( __isl_take isl_ast_print_options *options) { if (!options) return NULL; if (options->ref == 1) return options; options->ref--; return isl_ast_print_options_dup(options); } __isl_give isl_ast_print_options *isl_ast_print_options_copy( __isl_keep isl_ast_print_options *options) { if (!options) return NULL; options->ref++; return options; } void *isl_ast_print_options_free(__isl_take isl_ast_print_options *options) { if (!options) return NULL; if (--options->ref > 0) return NULL; isl_ctx_deref(options->ctx); free(options); return NULL; } /* Set the print_user callback of "options" to "print_user". * * If this callback is set, then it used to print user nodes in the AST. * Otherwise, the expression associated to the user node is printed. */ __isl_give isl_ast_print_options *isl_ast_print_options_set_print_user( __isl_take isl_ast_print_options *options, __isl_give isl_printer *(*print_user)(__isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user), void *user) { options = isl_ast_print_options_cow(options); if (!options) return NULL; options->print_user = print_user; options->print_user_user = user; return options; } /* Set the print_for callback of "options" to "print_for". * * If this callback is set, then it used to print for nodes in the AST. */ __isl_give isl_ast_print_options *isl_ast_print_options_set_print_for( __isl_take isl_ast_print_options *options, __isl_give isl_printer *(*print_for)(__isl_take isl_printer *p, __isl_take isl_ast_print_options *options, __isl_keep isl_ast_node *node, void *user), void *user) { options = isl_ast_print_options_cow(options); if (!options) return NULL; options->print_for = print_for; options->print_for_user = user; return options; } __isl_give isl_ast_expr *isl_ast_expr_copy(__isl_keep isl_ast_expr *expr) { if (!expr) return NULL; expr->ref++; return expr; } __isl_give isl_ast_expr *isl_ast_expr_dup(__isl_keep isl_ast_expr *expr) { int i; isl_ctx *ctx; isl_ast_expr *dup; if (!expr) return NULL; ctx = isl_ast_expr_get_ctx(expr); switch (expr->type) { case isl_ast_expr_int: dup = isl_ast_expr_from_val(isl_val_copy(expr->u.v)); break; case isl_ast_expr_id: dup = isl_ast_expr_from_id(isl_id_copy(expr->u.id)); break; case isl_ast_expr_op: dup = isl_ast_expr_alloc_op(ctx, expr->u.op.op, expr->u.op.n_arg); if (!dup) return NULL; for (i = 0; i < expr->u.op.n_arg; ++i) dup->u.op.args[i] = isl_ast_expr_copy(expr->u.op.args[i]); break; case isl_ast_expr_error: dup = NULL; } if (!dup) return NULL; return dup; } __isl_give isl_ast_expr *isl_ast_expr_cow(__isl_take isl_ast_expr *expr) { if (!expr) return NULL; if (expr->ref == 1) return expr; expr->ref--; return isl_ast_expr_dup(expr); } void *isl_ast_expr_free(__isl_take isl_ast_expr *expr) { int i; if (!expr) return NULL; if (--expr->ref > 0) return NULL; isl_ctx_deref(expr->ctx); switch (expr->type) { case isl_ast_expr_int: isl_val_free(expr->u.v); break; case isl_ast_expr_id: isl_id_free(expr->u.id); break; case isl_ast_expr_op: for (i = 0; i < expr->u.op.n_arg; ++i) isl_ast_expr_free(expr->u.op.args[i]); free(expr->u.op.args); break; case isl_ast_expr_error: break; } free(expr); return NULL; } isl_ctx *isl_ast_expr_get_ctx(__isl_keep isl_ast_expr *expr) { return expr ? expr->ctx : NULL; } enum isl_ast_expr_type isl_ast_expr_get_type(__isl_keep isl_ast_expr *expr) { return expr ? expr->type : isl_ast_expr_error; } int isl_ast_expr_get_int(__isl_keep isl_ast_expr *expr, isl_int *v) { if (!expr) return -1; if (expr->type != isl_ast_expr_int) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "expression not an int", return -1); return isl_val_get_num_isl_int(expr->u.v, v); } /* Return the integer value represented by "expr". */ __isl_give isl_val *isl_ast_expr_get_val(__isl_keep isl_ast_expr *expr) { if (!expr) return NULL; if (expr->type != isl_ast_expr_int) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "expression not an int", return NULL); return isl_val_copy(expr->u.v); } __isl_give isl_id *isl_ast_expr_get_id(__isl_keep isl_ast_expr *expr) { if (!expr) return NULL; if (expr->type != isl_ast_expr_id) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "expression not an identifier", return NULL); return isl_id_copy(expr->u.id); } enum isl_ast_op_type isl_ast_expr_get_op_type(__isl_keep isl_ast_expr *expr) { if (!expr) return isl_ast_op_error; if (expr->type != isl_ast_expr_op) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "expression not an operation", return isl_ast_op_error); return expr->u.op.op; } int isl_ast_expr_get_op_n_arg(__isl_keep isl_ast_expr *expr) { if (!expr) return -1; if (expr->type != isl_ast_expr_op) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "expression not an operation", return -1); return expr->u.op.n_arg; } __isl_give isl_ast_expr *isl_ast_expr_get_op_arg(__isl_keep isl_ast_expr *expr, int pos) { if (!expr) return NULL; if (expr->type != isl_ast_expr_op) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "expression not an operation", return NULL); if (pos < 0 || pos >= expr->u.op.n_arg) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "index out of bounds", return NULL); return isl_ast_expr_copy(expr->u.op.args[pos]); } /* Replace the argument at position "pos" of "expr" by "arg". */ __isl_give isl_ast_expr *isl_ast_expr_set_op_arg(__isl_take isl_ast_expr *expr, int pos, __isl_take isl_ast_expr *arg) { expr = isl_ast_expr_cow(expr); if (!expr || !arg) goto error; if (expr->type != isl_ast_expr_op) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "expression not an operation", goto error); if (pos < 0 || pos >= expr->u.op.n_arg) isl_die(isl_ast_expr_get_ctx(expr), isl_error_invalid, "index out of bounds", goto error); isl_ast_expr_free(expr->u.op.args[pos]); expr->u.op.args[pos] = arg; return expr; error: isl_ast_expr_free(arg); return isl_ast_expr_free(expr); } /* Create a new operation expression of operation type "op", * with "n_arg" as yet unspecified arguments. */ __isl_give isl_ast_expr *isl_ast_expr_alloc_op(isl_ctx *ctx, enum isl_ast_op_type op, int n_arg) { isl_ast_expr *expr; expr = isl_calloc_type(ctx, isl_ast_expr); if (!expr) return NULL; expr->ctx = ctx; isl_ctx_ref(ctx); expr->ref = 1; expr->type = isl_ast_expr_op; expr->u.op.op = op; expr->u.op.n_arg = n_arg; expr->u.op.args = isl_calloc_array(ctx, isl_ast_expr *, n_arg); if (n_arg && !expr->u.op.args) return isl_ast_expr_free(expr); return expr; } /* Create a new id expression representing "id". */ __isl_give isl_ast_expr *isl_ast_expr_from_id(__isl_take isl_id *id) { isl_ctx *ctx; isl_ast_expr *expr; if (!id) return NULL; ctx = isl_id_get_ctx(id); expr = isl_calloc_type(ctx, isl_ast_expr); if (!expr) return isl_id_free(id); expr->ctx = ctx; isl_ctx_ref(ctx); expr->ref = 1; expr->type = isl_ast_expr_id; expr->u.id = id; return expr; } /* Create a new integer expression representing "i". */ __isl_give isl_ast_expr *isl_ast_expr_alloc_int_si(isl_ctx *ctx, int i) { isl_ast_expr *expr; expr = isl_calloc_type(ctx, isl_ast_expr); if (!expr) return NULL; expr->ctx = ctx; isl_ctx_ref(ctx); expr->ref = 1; expr->type = isl_ast_expr_int; expr->u.v = isl_val_int_from_si(ctx, i); if (!expr->u.v) return isl_ast_expr_free(expr); return expr; } /* Create a new integer expression representing "v". */ __isl_give isl_ast_expr *isl_ast_expr_from_val(__isl_take isl_val *v) { isl_ctx *ctx; isl_ast_expr *expr; if (!v) return NULL; if (!isl_val_is_int(v)) isl_die(isl_val_get_ctx(v), isl_error_invalid, "expecting integer value", return isl_val_free(v)); ctx = isl_val_get_ctx(v); expr = isl_calloc_type(ctx, isl_ast_expr); if (!expr) return isl_val_free(v); expr->ctx = ctx; isl_ctx_ref(ctx); expr->ref = 1; expr->type = isl_ast_expr_int; expr->u.v = v; return expr; } /* Create an expression representing the negation of "arg". */ __isl_give isl_ast_expr *isl_ast_expr_neg(__isl_take isl_ast_expr *arg) { isl_ctx *ctx; isl_ast_expr *expr = NULL; if (!arg) return NULL; ctx = isl_ast_expr_get_ctx(arg); expr = isl_ast_expr_alloc_op(ctx, isl_ast_op_minus, 1); if (!expr) goto error; expr->u.op.args[0] = arg; return expr; error: isl_ast_expr_free(arg); return NULL; } /* Create an expression representing the binary operation "type" * applied to "expr1" and "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_alloc_binary(enum isl_ast_op_type type, __isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { isl_ctx *ctx; isl_ast_expr *expr = NULL; if (!expr1 || !expr2) goto error; ctx = isl_ast_expr_get_ctx(expr1); expr = isl_ast_expr_alloc_op(ctx, type, 2); if (!expr) goto error; expr->u.op.args[0] = expr1; expr->u.op.args[1] = expr2; return expr; error: isl_ast_expr_free(expr1); isl_ast_expr_free(expr2); return NULL; } /* Create an expression representing the sum of "expr1" and "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_add(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_add, expr1, expr2); } /* Create an expression representing the difference of "expr1" and "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_sub(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_sub, expr1, expr2); } /* Create an expression representing the product of "expr1" and "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_mul(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_mul, expr1, expr2); } /* Create an expression representing the quotient of "expr1" and "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_div(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_div, expr1, expr2); } /* Create an expression representing the conjunction of "expr1" and "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_and(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_and, expr1, expr2); } /* Create an expression representing the disjunction of "expr1" and "expr2". */ __isl_give isl_ast_expr *isl_ast_expr_or(__isl_take isl_ast_expr *expr1, __isl_take isl_ast_expr *expr2) { return isl_ast_expr_alloc_binary(isl_ast_op_or, expr1, expr2); } isl_ctx *isl_ast_node_get_ctx(__isl_keep isl_ast_node *node) { return node ? node->ctx : NULL; } enum isl_ast_node_type isl_ast_node_get_type(__isl_keep isl_ast_node *node) { return node ? node->type : isl_ast_node_error; } __isl_give isl_ast_node *isl_ast_node_alloc(isl_ctx *ctx, enum isl_ast_node_type type) { isl_ast_node *node; node = isl_calloc_type(ctx, isl_ast_node); if (!node) return NULL; node->ctx = ctx; isl_ctx_ref(ctx); node->ref = 1; node->type = type; return node; } /* Create an if node with the given guard. * * The then body needs to be filled in later. */ __isl_give isl_ast_node *isl_ast_node_alloc_if(__isl_take isl_ast_expr *guard) { isl_ast_node *node; if (!guard) return NULL; node = isl_ast_node_alloc(isl_ast_expr_get_ctx(guard), isl_ast_node_if); if (!node) goto error; node->u.i.guard = guard; return node; error: isl_ast_expr_free(guard); return NULL; } /* Create a for node with the given iterator. * * The remaining fields need to be filled in later. */ __isl_give isl_ast_node *isl_ast_node_alloc_for(__isl_take isl_id *id) { isl_ast_node *node; isl_ctx *ctx; if (!id) return NULL; ctx = isl_id_get_ctx(id); node = isl_ast_node_alloc(ctx, isl_ast_node_for); if (!node) return NULL; node->u.f.iterator = isl_ast_expr_from_id(id); if (!node->u.f.iterator) return isl_ast_node_free(node); return node; } /* Create a user node evaluating "expr". */ __isl_give isl_ast_node *isl_ast_node_alloc_user(__isl_take isl_ast_expr *expr) { isl_ctx *ctx; isl_ast_node *node; if (!expr) return NULL; ctx = isl_ast_expr_get_ctx(expr); node = isl_ast_node_alloc(ctx, isl_ast_node_user); if (!node) goto error; node->u.e.expr = expr; return node; error: isl_ast_expr_free(expr); return NULL; } /* Create a block node with the given children. */ __isl_give isl_ast_node *isl_ast_node_alloc_block( __isl_take isl_ast_node_list *list) { isl_ast_node *node; isl_ctx *ctx; if (!list) return NULL; ctx = isl_ast_node_list_get_ctx(list); node = isl_ast_node_alloc(ctx, isl_ast_node_block); if (!node) goto error; node->u.b.children = list; return node; error: isl_ast_node_list_free(list); return NULL; } /* Represent the given list of nodes as a single node, either by * extract the node from a single element list or by creating * a block node with the list of nodes as children. */ __isl_give isl_ast_node *isl_ast_node_from_ast_node_list( __isl_take isl_ast_node_list *list) { isl_ast_node *node; if (isl_ast_node_list_n_ast_node(list) != 1) return isl_ast_node_alloc_block(list); node = isl_ast_node_list_get_ast_node(list, 0); isl_ast_node_list_free(list); return node; } __isl_give isl_ast_node *isl_ast_node_copy(__isl_keep isl_ast_node *node) { if (!node) return NULL; node->ref++; return node; } __isl_give isl_ast_node *isl_ast_node_dup(__isl_keep isl_ast_node *node) { isl_ast_node *dup; if (!node) return NULL; dup = isl_ast_node_alloc(isl_ast_node_get_ctx(node), node->type); if (!dup) return NULL; switch (node->type) { case isl_ast_node_if: dup->u.i.guard = isl_ast_expr_copy(node->u.i.guard); dup->u.i.then = isl_ast_node_copy(node->u.i.then); dup->u.i.else_node = isl_ast_node_copy(node->u.i.else_node); if (!dup->u.i.guard || !dup->u.i.then || (node->u.i.else_node && !dup->u.i.else_node)) return isl_ast_node_free(dup); break; case isl_ast_node_for: dup->u.f.iterator = isl_ast_expr_copy(node->u.f.iterator); dup->u.f.init = isl_ast_expr_copy(node->u.f.init); dup->u.f.cond = isl_ast_expr_copy(node->u.f.cond); dup->u.f.inc = isl_ast_expr_copy(node->u.f.inc); dup->u.f.body = isl_ast_node_copy(node->u.f.body); if (!dup->u.f.iterator || !dup->u.f.init || !dup->u.f.cond || !dup->u.f.inc || !dup->u.f.body) return isl_ast_node_free(dup); break; case isl_ast_node_block: dup->u.b.children = isl_ast_node_list_copy(node->u.b.children); if (!dup->u.b.children) return isl_ast_node_free(dup); break; case isl_ast_node_user: dup->u.e.expr = isl_ast_expr_copy(node->u.e.expr); if (!dup->u.e.expr) return isl_ast_node_free(dup); break; case isl_ast_node_error: break; } return dup; } __isl_give isl_ast_node *isl_ast_node_cow(__isl_take isl_ast_node *node) { if (!node) return NULL; if (node->ref == 1) return node; node->ref--; return isl_ast_node_dup(node); } void *isl_ast_node_free(__isl_take isl_ast_node *node) { if (!node) return NULL; if (--node->ref > 0) return NULL; switch (node->type) { case isl_ast_node_if: isl_ast_expr_free(node->u.i.guard); isl_ast_node_free(node->u.i.then); isl_ast_node_free(node->u.i.else_node); break; case isl_ast_node_for: isl_ast_expr_free(node->u.f.iterator); isl_ast_expr_free(node->u.f.init); isl_ast_expr_free(node->u.f.cond); isl_ast_expr_free(node->u.f.inc); isl_ast_node_free(node->u.f.body); break; case isl_ast_node_block: isl_ast_node_list_free(node->u.b.children); break; case isl_ast_node_user: isl_ast_expr_free(node->u.e.expr); break; case isl_ast_node_error: break; } isl_id_free(node->annotation); isl_ctx_deref(node->ctx); free(node); return NULL; } /* Replace the body of the for node "node" by "body". */ __isl_give isl_ast_node *isl_ast_node_for_set_body( __isl_take isl_ast_node *node, __isl_take isl_ast_node *body) { node = isl_ast_node_cow(node); if (!node || !body) goto error; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", goto error); isl_ast_node_free(node->u.f.body); node->u.f.body = body; return node; error: isl_ast_node_free(node); isl_ast_node_free(body); return NULL; } __isl_give isl_ast_node *isl_ast_node_for_get_body( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", return NULL); return isl_ast_node_copy(node->u.f.body); } /* Mark the given for node as being degenerate. */ __isl_give isl_ast_node *isl_ast_node_for_mark_degenerate( __isl_take isl_ast_node *node) { node = isl_ast_node_cow(node); if (!node) return NULL; node->u.f.degenerate = 1; return node; } int isl_ast_node_for_is_degenerate(__isl_keep isl_ast_node *node) { if (!node) return -1; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", return -1); return node->u.f.degenerate; } __isl_give isl_ast_expr *isl_ast_node_for_get_iterator( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", return NULL); return isl_ast_expr_copy(node->u.f.iterator); } __isl_give isl_ast_expr *isl_ast_node_for_get_init( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", return NULL); return isl_ast_expr_copy(node->u.f.init); } /* Return the condition expression of the given for node. * * If the for node is degenerate, then the condition is not explicitly * stored in the node. Instead, it is constructed as * * iterator <= init */ __isl_give isl_ast_expr *isl_ast_node_for_get_cond( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", return NULL); if (!node->u.f.degenerate) return isl_ast_expr_copy(node->u.f.cond); return isl_ast_expr_alloc_binary(isl_ast_op_le, isl_ast_expr_copy(node->u.f.iterator), isl_ast_expr_copy(node->u.f.init)); } /* Return the increment of the given for node. * * If the for node is degenerate, then the increment is not explicitly * stored in the node. We simply return "1". */ __isl_give isl_ast_expr *isl_ast_node_for_get_inc( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", return NULL); if (!node->u.f.degenerate) return isl_ast_expr_copy(node->u.f.inc); return isl_ast_expr_alloc_int_si(isl_ast_node_get_ctx(node), 1); } /* Replace the then branch of the if node "node" by "child". */ __isl_give isl_ast_node *isl_ast_node_if_set_then( __isl_take isl_ast_node *node, __isl_take isl_ast_node *child) { node = isl_ast_node_cow(node); if (!node || !child) goto error; if (node->type != isl_ast_node_if) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not an if node", goto error); isl_ast_node_free(node->u.i.then); node->u.i.then = child; return node; error: isl_ast_node_free(node); isl_ast_node_free(child); return NULL; } __isl_give isl_ast_node *isl_ast_node_if_get_then( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_if) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not an if node", return NULL); return isl_ast_node_copy(node->u.i.then); } int isl_ast_node_if_has_else( __isl_keep isl_ast_node *node) { if (!node) return -1; if (node->type != isl_ast_node_if) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not an if node", return -1); return node->u.i.else_node != NULL; } __isl_give isl_ast_node *isl_ast_node_if_get_else( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_if) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not an if node", return NULL); return isl_ast_node_copy(node->u.i.else_node); } __isl_give isl_ast_expr *isl_ast_node_if_get_cond( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_if) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a guard node", return NULL); return isl_ast_expr_copy(node->u.i.guard); } __isl_give isl_ast_node_list *isl_ast_node_block_get_children( __isl_keep isl_ast_node *node) { if (!node) return NULL; if (node->type != isl_ast_node_block) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a block node", return NULL); return isl_ast_node_list_copy(node->u.b.children); } __isl_give isl_ast_expr *isl_ast_node_user_get_expr( __isl_keep isl_ast_node *node) { if (!node) return NULL; return isl_ast_expr_copy(node->u.e.expr); } __isl_give isl_id *isl_ast_node_get_annotation(__isl_keep isl_ast_node *node) { return node ? isl_id_copy(node->annotation) : NULL; } /* Replace node->annotation by "annotation". */ __isl_give isl_ast_node *isl_ast_node_set_annotation( __isl_take isl_ast_node *node, __isl_take isl_id *annotation) { node = isl_ast_node_cow(node); if (!node || !annotation) goto error; isl_id_free(node->annotation); node->annotation = annotation; return node; error: isl_id_free(annotation); return isl_ast_node_free(node); } /* Textual C representation of the various operators. */ static char *op_str[] = { [isl_ast_op_and] = "&&", [isl_ast_op_and_then] = "&&", [isl_ast_op_or] = "||", [isl_ast_op_or_else] = "||", [isl_ast_op_max] = "max", [isl_ast_op_min] = "min", [isl_ast_op_minus] = "-", [isl_ast_op_add] = "+", [isl_ast_op_sub] = "-", [isl_ast_op_mul] = "*", [isl_ast_op_pdiv_q] = "/", [isl_ast_op_pdiv_r] = "%", [isl_ast_op_div] = "/", [isl_ast_op_eq] = "==", [isl_ast_op_le] = "<=", [isl_ast_op_ge] = ">=", [isl_ast_op_lt] = "<", [isl_ast_op_gt] = ">" }; /* Precedence in C of the various operators. * Based on http://en.wikipedia.org/wiki/Operators_in_C_and_C++ * Lowest value means highest precedence. */ static int op_prec[] = { [isl_ast_op_and] = 13, [isl_ast_op_and_then] = 13, [isl_ast_op_or] = 14, [isl_ast_op_or_else] = 14, [isl_ast_op_max] = 2, [isl_ast_op_min] = 2, [isl_ast_op_minus] = 3, [isl_ast_op_add] = 6, [isl_ast_op_sub] = 6, [isl_ast_op_mul] = 5, [isl_ast_op_div] = 5, [isl_ast_op_fdiv_q] = 2, [isl_ast_op_pdiv_q] = 5, [isl_ast_op_pdiv_r] = 5, [isl_ast_op_cond] = 15, [isl_ast_op_select] = 15, [isl_ast_op_eq] = 9, [isl_ast_op_le] = 8, [isl_ast_op_ge] = 8, [isl_ast_op_lt] = 8, [isl_ast_op_gt] = 8, [isl_ast_op_call] = 2 }; /* Is the operator left-to-right associative? */ static int op_left[] = { [isl_ast_op_and] = 1, [isl_ast_op_and_then] = 1, [isl_ast_op_or] = 1, [isl_ast_op_or_else] = 1, [isl_ast_op_max] = 1, [isl_ast_op_min] = 1, [isl_ast_op_minus] = 0, [isl_ast_op_add] = 1, [isl_ast_op_sub] = 1, [isl_ast_op_mul] = 1, [isl_ast_op_div] = 1, [isl_ast_op_fdiv_q] = 1, [isl_ast_op_pdiv_q] = 1, [isl_ast_op_pdiv_r] = 1, [isl_ast_op_cond] = 0, [isl_ast_op_select] = 0, [isl_ast_op_eq] = 1, [isl_ast_op_le] = 1, [isl_ast_op_ge] = 1, [isl_ast_op_lt] = 1, [isl_ast_op_gt] = 1, [isl_ast_op_call] = 1 }; static int is_and(enum isl_ast_op_type op) { return op == isl_ast_op_and || op == isl_ast_op_and_then; } static int is_or(enum isl_ast_op_type op) { return op == isl_ast_op_or || op == isl_ast_op_or_else; } static int is_add_sub(enum isl_ast_op_type op) { return op == isl_ast_op_add || op == isl_ast_op_sub; } static int is_div_mod(enum isl_ast_op_type op) { return op == isl_ast_op_div || op == isl_ast_op_pdiv_r; } /* Do we need/want parentheses around "expr" as a subexpression of * an "op" operation? If "left" is set, then "expr" is the left-most * operand. * * We only need parentheses if "expr" represents an operation. * * If op has a higher precedence than expr->u.op.op, then we need * parentheses. * If op and expr->u.op.op have the same precedence, but the operations * are performed in an order that is different from the associativity, * then we need parentheses. * * An and inside an or technically does not require parentheses, * but some compilers complain about that, so we add them anyway. * * Computations such as "a / b * c" and "a % b + c" can be somewhat * difficult to read, so we add parentheses for those as well. */ static int sub_expr_need_parens(enum isl_ast_op_type op, __isl_keep isl_ast_expr *expr, int left) { if (expr->type != isl_ast_expr_op) return 0; if (op_prec[expr->u.op.op] > op_prec[op]) return 1; if (op_prec[expr->u.op.op] == op_prec[op] && left != op_left[op]) return 1; if (is_or(op) && is_and(expr->u.op.op)) return 1; if (op == isl_ast_op_mul && expr->u.op.op != isl_ast_op_mul && op_prec[expr->u.op.op] == op_prec[op]) return 1; if (is_add_sub(op) && is_div_mod(expr->u.op.op)) return 1; return 0; } /* Print "expr" as a subexpression of an "op" operation. * If "left" is set, then "expr" is the left-most operand. */ static __isl_give isl_printer *print_sub_expr(__isl_take isl_printer *p, enum isl_ast_op_type op, __isl_keep isl_ast_expr *expr, int left) { int need_parens; need_parens = sub_expr_need_parens(op, expr, left); if (need_parens) p = isl_printer_print_str(p, "("); p = isl_printer_print_ast_expr(p, expr); if (need_parens) p = isl_printer_print_str(p, ")"); return p; } /* Print a min or max reduction "expr". */ static __isl_give isl_printer *print_min_max(__isl_take isl_printer *p, __isl_keep isl_ast_expr *expr) { int i = 0; for (i = 1; i < expr->u.op.n_arg; ++i) { p = isl_printer_print_str(p, op_str[expr->u.op.op]); p = isl_printer_print_str(p, "("); } p = isl_printer_print_ast_expr(p, expr->u.op.args[0]); for (i = 1; i < expr->u.op.n_arg; ++i) { p = isl_printer_print_str(p, ", "); p = isl_printer_print_ast_expr(p, expr->u.op.args[i]); p = isl_printer_print_str(p, ")"); } return p; } /* Print a function call "expr". * * The first argument represents the function to be called. */ static __isl_give isl_printer *print_call(__isl_take isl_printer *p, __isl_keep isl_ast_expr *expr) { int i = 0; p = isl_printer_print_ast_expr(p, expr->u.op.args[0]); p = isl_printer_print_str(p, "("); for (i = 1; i < expr->u.op.n_arg; ++i) { if (i != 1) p = isl_printer_print_str(p, ", "); p = isl_printer_print_ast_expr(p, expr->u.op.args[i]); } p = isl_printer_print_str(p, ")"); return p; } /* Print "expr" to "p". * * If we are printing in isl format, then we also print an indication * of the size of the expression (if it was computed). */ __isl_give isl_printer *isl_printer_print_ast_expr(__isl_take isl_printer *p, __isl_keep isl_ast_expr *expr) { if (!p) return NULL; if (!expr) return isl_printer_free(p); switch (expr->type) { case isl_ast_expr_op: if (expr->u.op.op == isl_ast_op_call) { p = print_call(p, expr); break; } if (expr->u.op.n_arg == 1) { p = isl_printer_print_str(p, op_str[expr->u.op.op]); p = print_sub_expr(p, expr->u.op.op, expr->u.op.args[0], 0); break; } if (expr->u.op.op == isl_ast_op_fdiv_q) { p = isl_printer_print_str(p, "floord("); p = isl_printer_print_ast_expr(p, expr->u.op.args[0]); p = isl_printer_print_str(p, ", "); p = isl_printer_print_ast_expr(p, expr->u.op.args[1]); p = isl_printer_print_str(p, ")"); break; } if (expr->u.op.op == isl_ast_op_max || expr->u.op.op == isl_ast_op_min) { p = print_min_max(p, expr); break; } if (expr->u.op.op == isl_ast_op_cond || expr->u.op.op == isl_ast_op_select) { p = isl_printer_print_ast_expr(p, expr->u.op.args[0]); p = isl_printer_print_str(p, " ? "); p = isl_printer_print_ast_expr(p, expr->u.op.args[1]); p = isl_printer_print_str(p, " : "); p = isl_printer_print_ast_expr(p, expr->u.op.args[2]); break; } if (expr->u.op.n_arg != 2) isl_die(isl_printer_get_ctx(p), isl_error_internal, "operation should have two arguments", goto error); p = print_sub_expr(p, expr->u.op.op, expr->u.op.args[0], 1); p = isl_printer_print_str(p, " "); p = isl_printer_print_str(p, op_str[expr->u.op.op]); p = isl_printer_print_str(p, " "); p = print_sub_expr(p, expr->u.op.op, expr->u.op.args[1], 0); break; case isl_ast_expr_id: p = isl_printer_print_str(p, isl_id_get_name(expr->u.id)); break; case isl_ast_expr_int: p = isl_printer_print_val(p, expr->u.v); break; case isl_ast_expr_error: break; } return p; error: isl_printer_free(p); return NULL; } /* Print "node" to "p" in "isl format". */ static __isl_give isl_printer *print_ast_node_isl(__isl_take isl_printer *p, __isl_keep isl_ast_node *node) { p = isl_printer_print_str(p, "("); switch (node->type) { case isl_ast_node_for: if (node->u.f.degenerate) { p = isl_printer_print_ast_expr(p, node->u.f.init); } else { p = isl_printer_print_str(p, "init: "); p = isl_printer_print_ast_expr(p, node->u.f.init); p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, "cond: "); p = isl_printer_print_ast_expr(p, node->u.f.cond); p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, "inc: "); p = isl_printer_print_ast_expr(p, node->u.f.inc); } if (node->u.f.body) { p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, "body: "); p = isl_printer_print_ast_node(p, node->u.f.body); } break; case isl_ast_node_user: p = isl_printer_print_ast_expr(p, node->u.e.expr); break; case isl_ast_node_if: p = isl_printer_print_str(p, "guard: "); p = isl_printer_print_ast_expr(p, node->u.i.guard); if (node->u.i.then) { p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, "then: "); p = isl_printer_print_ast_node(p, node->u.i.then); } if (node->u.i.else_node) { p = isl_printer_print_str(p, ", "); p = isl_printer_print_str(p, "else: "); p = isl_printer_print_ast_node(p, node->u.i.else_node); } break; case isl_ast_node_block: p = isl_printer_print_ast_node_list(p, node->u.b.children); break; default: break; } p = isl_printer_print_str(p, ")"); return p; } /* Do we need to print a block around the body "node" of a for or if node? * * If the node is a block, then we need to print a block. * Also if the node is a degenerate for then we will print it as * an assignment followed by the body of the for loop, so we need a block * as well. */ static int need_block(__isl_keep isl_ast_node *node) { if (node->type == isl_ast_node_block) return 1; if (node->type == isl_ast_node_for && node->u.f.degenerate) return 1; return 0; } static __isl_give isl_printer *print_ast_node_c(__isl_take isl_printer *p, __isl_keep isl_ast_node *node, __isl_keep isl_ast_print_options *options, int in_block, int in_list); static __isl_give isl_printer *print_if_c(__isl_take isl_printer *p, __isl_keep isl_ast_node *node, __isl_keep isl_ast_print_options *options, int new_line); /* Print the body "node" of a for or if node. * If "else_node" is set, then it is printed as well. * * We first check if we need to print out a block. * We always print out a block if there is an else node to make * sure that the else node is matched to the correct if node. * * If the else node is itself an if, then we print it as * * } else if (..) * * Otherwise the else node is printed as * * } else * node */ static __isl_give isl_printer *print_body_c(__isl_take isl_printer *p, __isl_keep isl_ast_node *node, __isl_keep isl_ast_node *else_node, __isl_keep isl_ast_print_options *options) { if (!node) return isl_printer_free(p); if (!else_node && !need_block(node)) { p = isl_printer_end_line(p); p = isl_printer_indent(p, 2); p = isl_ast_node_print(node, p, isl_ast_print_options_copy(options)); p = isl_printer_indent(p, -2); return p; } p = isl_printer_print_str(p, " {"); p = isl_printer_end_line(p); p = isl_printer_indent(p, 2); p = print_ast_node_c(p, node, options, 1, 0); p = isl_printer_indent(p, -2); p = isl_printer_start_line(p); p = isl_printer_print_str(p, "}"); if (else_node) { if (else_node->type == isl_ast_node_if) { p = isl_printer_print_str(p, " else "); p = print_if_c(p, else_node, options, 0); } else { p = isl_printer_print_str(p, " else"); p = print_body_c(p, else_node, NULL, options); } } else p = isl_printer_end_line(p); return p; } /* Print the start of a compound statement. */ static __isl_give isl_printer *start_block(__isl_take isl_printer *p) { p = isl_printer_start_line(p); p = isl_printer_print_str(p, "{"); p = isl_printer_end_line(p); p = isl_printer_indent(p, 2); return p; } /* Print the end of a compound statement. */ static __isl_give isl_printer *end_block(__isl_take isl_printer *p) { p = isl_printer_indent(p, -2); p = isl_printer_start_line(p); p = isl_printer_print_str(p, "}"); p = isl_printer_end_line(p); return p; } /* Print the for node "node". * * If the for node is degenerate, it is printed as * * type iterator = init; * body * * Otherwise, it is printed as * * for (type iterator = init; cond; iterator += inc) * body * * "in_block" is set if we are currently inside a block. * "in_list" is set if the current node is not alone in the block. * If we are not in a block or if the current not is not alone in the block * then we print a block around a degenerate for loop such that the variable * declaration will not conflict with any potential other declaration * of the same variable. */ static __isl_give isl_printer *print_for_c(__isl_take isl_printer *p, __isl_keep isl_ast_node *node, __isl_keep isl_ast_print_options *options, int in_block, int in_list) { isl_id *id; const char *name; const char *type; type = isl_options_get_ast_iterator_type(isl_printer_get_ctx(p)); if (!node->u.f.degenerate) { id = isl_ast_expr_get_id(node->u.f.iterator); name = isl_id_get_name(id); isl_id_free(id); p = isl_printer_start_line(p); p = isl_printer_print_str(p, "for ("); p = isl_printer_print_str(p, type); p = isl_printer_print_str(p, " "); p = isl_printer_print_str(p, name); p = isl_printer_print_str(p, " = "); p = isl_printer_print_ast_expr(p, node->u.f.init); p = isl_printer_print_str(p, "; "); p = isl_printer_print_ast_expr(p, node->u.f.cond); p = isl_printer_print_str(p, "; "); p = isl_printer_print_str(p, name); p = isl_printer_print_str(p, " += "); p = isl_printer_print_ast_expr(p, node->u.f.inc); p = isl_printer_print_str(p, ")"); p = print_body_c(p, node->u.f.body, NULL, options); } else { id = isl_ast_expr_get_id(node->u.f.iterator); name = isl_id_get_name(id); isl_id_free(id); if (!in_block || in_list) p = start_block(p); p = isl_printer_start_line(p); p = isl_printer_print_str(p, type); p = isl_printer_print_str(p, " "); p = isl_printer_print_str(p, name); p = isl_printer_print_str(p, " = "); p = isl_printer_print_ast_expr(p, node->u.f.init); p = isl_printer_print_str(p, ";"); p = isl_printer_end_line(p); p = print_ast_node_c(p, node->u.f.body, options, 1, 0); if (!in_block || in_list) p = end_block(p); } return p; } /* Print the if node "node". * If "new_line" is set then the if node should be printed on a new line. */ static __isl_give isl_printer *print_if_c(__isl_take isl_printer *p, __isl_keep isl_ast_node *node, __isl_keep isl_ast_print_options *options, int new_line) { if (new_line) p = isl_printer_start_line(p); p = isl_printer_print_str(p, "if ("); p = isl_printer_print_ast_expr(p, node->u.i.guard); p = isl_printer_print_str(p, ")"); p = print_body_c(p, node->u.i.then, node->u.i.else_node, options); return p; } /* Print the "node" to "p". * * "in_block" is set if we are currently inside a block. * If so, we do not print a block around the children of a block node. * We do this to avoid an extra block around the body of a degenerate * for node. * * "in_list" is set if the current node is not alone in the block. */ static __isl_give isl_printer *print_ast_node_c(__isl_take isl_printer *p, __isl_keep isl_ast_node *node, __isl_keep isl_ast_print_options *options, int in_block, int in_list) { switch (node->type) { case isl_ast_node_for: if (options->print_for) return options->print_for(p, isl_ast_print_options_copy(options), node, options->print_for_user); p = print_for_c(p, node, options, in_block, in_list); break; case isl_ast_node_if: p = print_if_c(p, node, options, 1); break; case isl_ast_node_block: if (!in_block) p = start_block(p); p = isl_ast_node_list_print(node->u.b.children, p, options); if (!in_block) p = end_block(p); break; case isl_ast_node_user: if (options->print_user) return options->print_user(p, isl_ast_print_options_copy(options), node, options->print_user_user); p = isl_printer_start_line(p); p = isl_printer_print_ast_expr(p, node->u.e.expr); p = isl_printer_print_str(p, ";"); p = isl_printer_end_line(p); break; case isl_ast_node_error: break; } return p; } /* Print the for node "node" to "p". */ __isl_give isl_printer *isl_ast_node_for_print(__isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options) { if (!node || !options) goto error; if (node->type != isl_ast_node_for) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not a for node", goto error); p = print_for_c(p, node, options, 0, 0); isl_ast_print_options_free(options); return p; error: isl_ast_print_options_free(options); isl_printer_free(p); return NULL; } /* Print the if node "node" to "p". */ __isl_give isl_printer *isl_ast_node_if_print(__isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options) { if (!node || !options) goto error; if (node->type != isl_ast_node_if) isl_die(isl_ast_node_get_ctx(node), isl_error_invalid, "not an if node", goto error); p = print_if_c(p, node, options, 1); isl_ast_print_options_free(options); return p; error: isl_ast_print_options_free(options); isl_printer_free(p); return NULL; } /* Print "node" to "p". */ __isl_give isl_printer *isl_ast_node_print(__isl_keep isl_ast_node *node, __isl_take isl_printer *p, __isl_take isl_ast_print_options *options) { if (!options || !node) goto error; p = print_ast_node_c(p, node, options, 0, 0); isl_ast_print_options_free(options); return p; error: isl_ast_print_options_free(options); isl_printer_free(p); return NULL; } /* Print "node" to "p". */ __isl_give isl_printer *isl_printer_print_ast_node(__isl_take isl_printer *p, __isl_keep isl_ast_node *node) { int format; isl_ast_print_options *options; if (!p) return NULL; format = isl_printer_get_output_format(p); switch (format) { case ISL_FORMAT_ISL: p = print_ast_node_isl(p, node); break; case ISL_FORMAT_C: options = isl_ast_print_options_alloc(isl_printer_get_ctx(p)); p = isl_ast_node_print(node, p, options); break; default: isl_die(isl_printer_get_ctx(p), isl_error_unsupported, "output format not supported for ast_node", return isl_printer_free(p)); } return p; } /* Print the list of nodes "list" to "p". */ __isl_give isl_printer *isl_ast_node_list_print( __isl_keep isl_ast_node_list *list, __isl_take isl_printer *p, __isl_keep isl_ast_print_options *options) { int i; if (!p || !list || !options) return isl_printer_free(p); for (i = 0; i < list->n; ++i) p = print_ast_node_c(p, list->p[i], options, 1, 1); return p; } #define ISL_AST_MACRO_FLOORD (1 << 0) #define ISL_AST_MACRO_MIN (1 << 1) #define ISL_AST_MACRO_MAX (1 << 2) #define ISL_AST_MACRO_ALL (ISL_AST_MACRO_FLOORD | \ ISL_AST_MACRO_MIN | \ ISL_AST_MACRO_MAX) /* If "expr" contains an isl_ast_op_min, isl_ast_op_max or isl_ast_op_fdiv_q * then set the corresponding bit in "macros". */ static int ast_expr_required_macros(__isl_keep isl_ast_expr *expr, int macros) { int i; if (macros == ISL_AST_MACRO_ALL) return macros; if (expr->type != isl_ast_expr_op) return macros; if (expr->u.op.op == isl_ast_op_min) macros |= ISL_AST_MACRO_MIN; if (expr->u.op.op == isl_ast_op_max) macros |= ISL_AST_MACRO_MAX; if (expr->u.op.op == isl_ast_op_fdiv_q) macros |= ISL_AST_MACRO_FLOORD; for (i = 0; i < expr->u.op.n_arg; ++i) macros = ast_expr_required_macros(expr->u.op.args[i], macros); return macros; } static int ast_node_list_required_macros(__isl_keep isl_ast_node_list *list, int macros); /* If "node" contains an isl_ast_op_min, isl_ast_op_max or isl_ast_op_fdiv_q * then set the corresponding bit in "macros". */ static int ast_node_required_macros(__isl_keep isl_ast_node *node, int macros) { if (macros == ISL_AST_MACRO_ALL) return macros; switch (node->type) { case isl_ast_node_for: macros = ast_expr_required_macros(node->u.f.init, macros); if (!node->u.f.degenerate) { macros = ast_expr_required_macros(node->u.f.cond, macros); macros = ast_expr_required_macros(node->u.f.inc, macros); } macros = ast_node_required_macros(node->u.f.body, macros); break; case isl_ast_node_if: macros = ast_expr_required_macros(node->u.i.guard, macros); macros = ast_node_required_macros(node->u.i.then, macros); if (node->u.i.else_node) macros = ast_node_required_macros(node->u.i.else_node, macros); break; case isl_ast_node_block: macros = ast_node_list_required_macros(node->u.b.children, macros); break; case isl_ast_node_user: macros = ast_expr_required_macros(node->u.e.expr, macros); break; case isl_ast_node_error: break; } return macros; } /* If "list" contains an isl_ast_op_min, isl_ast_op_max or isl_ast_op_fdiv_q * then set the corresponding bit in "macros". */ static int ast_node_list_required_macros(__isl_keep isl_ast_node_list *list, int macros) { int i; for (i = 0; i < list->n; ++i) macros = ast_node_required_macros(list->p[i], macros); return macros; } /* Print a macro definition for the operator "type". */ __isl_give isl_printer *isl_ast_op_type_print_macro( enum isl_ast_op_type type, __isl_take isl_printer *p) { switch (type) { case isl_ast_op_min: p = isl_printer_start_line(p); p = isl_printer_print_str(p, "#define min(x,y) ((x) < (y) ? (x) : (y))"); p = isl_printer_end_line(p); break; case isl_ast_op_max: p = isl_printer_start_line(p); p = isl_printer_print_str(p, "#define max(x,y) ((x) > (y) ? (x) : (y))"); p = isl_printer_end_line(p); break; case isl_ast_op_fdiv_q: p = isl_printer_start_line(p); p = isl_printer_print_str(p, "#define floord(n,d) " "(((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))"); p = isl_printer_end_line(p); break; default: break; } return p; } /* Call "fn" for each type of operation that appears in "node" * and that requires a macro definition. */ int isl_ast_node_foreach_ast_op_type(__isl_keep isl_ast_node *node, int (*fn)(enum isl_ast_op_type type, void *user), void *user) { int macros; if (!node) return -1; macros = ast_node_required_macros(node, 0); if (macros & ISL_AST_MACRO_MIN && fn(isl_ast_op_min, user) < 0) return -1; if (macros & ISL_AST_MACRO_MAX && fn(isl_ast_op_max, user) < 0) return -1; if (macros & ISL_AST_MACRO_FLOORD && fn(isl_ast_op_fdiv_q, user) < 0) return -1; return 0; } static int ast_op_type_print_macro(enum isl_ast_op_type type, void *user) { isl_printer **p = user; *p = isl_ast_op_type_print_macro(type, *p); return 0; } /* Print macro definitions for all the macros used in the result * of printing "node. */ __isl_give isl_printer *isl_ast_node_print_macros( __isl_keep isl_ast_node *node, __isl_take isl_printer *p) { if (isl_ast_node_foreach_ast_op_type(node, &ast_op_type_print_macro, &p) < 0) return isl_printer_free(p); return p; } cloog-0.18.2/isl/isl_sample_piplib.c0000664000175000017500000000334512254313240014253 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include "isl_piplib.h" #include "isl_sample_piplib.h" struct isl_vec *isl_pip_basic_set_sample(struct isl_basic_set *bset) { PipOptions *options = NULL; PipMatrix *domain = NULL; PipQuast *sol = NULL; struct isl_vec *vec = NULL; unsigned dim; struct isl_ctx *ctx; if (!bset) goto error; ctx = isl_basic_set_get_ctx(bset); isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error); isl_assert(ctx, isl_basic_set_dim(bset, isl_dim_div) == 0, goto error); dim = isl_basic_set_n_dim(bset); domain = isl_basic_map_to_pip((struct isl_basic_map *)bset, 0, 0, 0); if (!domain) goto error; options = pip_options_init(); if (!options) goto error; sol = pip_solve(domain, NULL, -1, options); if (!sol) goto error; if (!sol->list) vec = isl_vec_alloc(ctx, 0); else { PipList *l; int i; vec = isl_vec_alloc(ctx, 1 + dim); if (!vec) goto error; isl_int_set_si(vec->block.data[0], 1); for (i = 0, l = sol->list; l && i < dim; ++i, l = l->next) { isl_seq_cpy_from_pip(&vec->block.data[1+i], &l->vector->the_vector[0], 1); isl_assert(ctx, !entier_zero_p(l->vector->the_deno[0]), goto error); } isl_assert(ctx, i == dim, goto error); } pip_quast_free(sol); pip_options_free(options); pip_matrix_free(domain); isl_basic_set_free(bset); return vec; error: isl_vec_free(vec); isl_basic_set_free(bset); if (sol) pip_quast_free(sol); if (domain) pip_matrix_free(domain); return NULL; } cloog-0.18.2/isl/isl_farkas.c0000664000175000017500000002367112254313240012706 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #include #include #include /* * Let C be a cone and define * * C' := { y | forall x in C : y x >= 0 } * * C' contains the coefficients of all linear constraints * that are valid for C. * Furthermore, C'' = C. * * If C is defined as { x | A x >= 0 } * then any element in C' must be a non-negative combination * of the rows of A, i.e., y = t A with t >= 0. That is, * * C' = { y | exists t >= 0 : y = t A } * * If any of the rows in A actually represents an equality, then * also negative combinations of this row are allowed and so the * non-negativity constraint on the corresponding element of t * can be dropped. * * A polyhedron P = { x | b + A x >= 0 } can be represented * in homogeneous coordinates by the cone * C = { [z,x] | b z + A x >= and z >= 0 } * The valid linear constraints on C correspond to the valid affine * constraints on P. * This is essentially Farkas' lemma. * * Let A' = [b A], then, since * [ 1 0 ] * [ w y ] = [t_0 t] [ b A ] * * we have * * C' = { w, y | exists t_0, t >= 0 : y = t A' and w = t_0 + t b } * or * * C' = { w, y | exists t >= 0 : y = t A' and w - t b >= 0 } * * In practice, we introduce an extra variable (w), shifting all * other variables to the right, and an extra inequality * (w - t b >= 0) corresponding to the positivity constraint on * the homogeneous coordinate. * * When going back from coefficients to solutions, we immediately * plug in 1 for z, which corresponds to shifting all variables * to the left, with the leftmost ending up in the constant position. */ /* Add the given prefix to all named isl_dim_set dimensions in "dim". */ static __isl_give isl_space *isl_space_prefix(__isl_take isl_space *dim, const char *prefix) { int i; isl_ctx *ctx; unsigned nvar; size_t prefix_len = strlen(prefix); if (!dim) return NULL; ctx = isl_space_get_ctx(dim); nvar = isl_space_dim(dim, isl_dim_set); for (i = 0; i < nvar; ++i) { const char *name; char *prefix_name; name = isl_space_get_dim_name(dim, isl_dim_set, i); if (!name) continue; prefix_name = isl_alloc_array(ctx, char, prefix_len + strlen(name) + 1); if (!prefix_name) goto error; memcpy(prefix_name, prefix, prefix_len); strcpy(prefix_name + prefix_len, name); dim = isl_space_set_dim_name(dim, isl_dim_set, i, prefix_name); free(prefix_name); } return dim; error: isl_space_free(dim); return NULL; } /* Given a dimension specification of the solutions space, construct * a dimension specification for the space of coefficients. * * In particular transform * * [params] -> { S } * * to * * { coefficients[[cst, params] -> S] } * * and prefix each dimension name with "c_". */ static __isl_give isl_space *isl_space_coefficients(__isl_take isl_space *dim) { isl_space *dim_param; unsigned nvar; unsigned nparam; nvar = isl_space_dim(dim, isl_dim_set); nparam = isl_space_dim(dim, isl_dim_param); dim_param = isl_space_copy(dim); dim_param = isl_space_drop_dims(dim_param, isl_dim_set, 0, nvar); dim_param = isl_space_move_dims(dim_param, isl_dim_set, 0, isl_dim_param, 0, nparam); dim_param = isl_space_prefix(dim_param, "c_"); dim_param = isl_space_insert_dims(dim_param, isl_dim_set, 0, 1); dim_param = isl_space_set_dim_name(dim_param, isl_dim_set, 0, "c_cst"); dim = isl_space_drop_dims(dim, isl_dim_param, 0, nparam); dim = isl_space_prefix(dim, "c_"); dim = isl_space_join(isl_space_from_domain(dim_param), isl_space_from_range(dim)); dim = isl_space_wrap(dim); dim = isl_space_set_tuple_name(dim, isl_dim_set, "coefficients"); return dim; } /* Drop the given prefix from all named dimensions of type "type" in "dim". */ static __isl_give isl_space *isl_space_unprefix(__isl_take isl_space *dim, enum isl_dim_type type, const char *prefix) { int i; unsigned n; size_t prefix_len = strlen(prefix); n = isl_space_dim(dim, type); for (i = 0; i < n; ++i) { const char *name; name = isl_space_get_dim_name(dim, type, i); if (!name) continue; if (strncmp(name, prefix, prefix_len)) continue; dim = isl_space_set_dim_name(dim, type, i, name + prefix_len); } return dim; } /* Given a dimension specification of the space of coefficients, construct * a dimension specification for the space of solutions. * * In particular transform * * { coefficients[[cst, params] -> S] } * * to * * [params] -> { S } * * and drop the "c_" prefix from the dimension names. */ static __isl_give isl_space *isl_space_solutions(__isl_take isl_space *dim) { unsigned nparam; dim = isl_space_unwrap(dim); dim = isl_space_drop_dims(dim, isl_dim_in, 0, 1); dim = isl_space_unprefix(dim, isl_dim_in, "c_"); dim = isl_space_unprefix(dim, isl_dim_out, "c_"); nparam = isl_space_dim(dim, isl_dim_in); dim = isl_space_move_dims(dim, isl_dim_param, 0, isl_dim_in, 0, nparam); dim = isl_space_range(dim); return dim; } /* Compute the dual of "bset" by applying Farkas' lemma. * As explained above, we add an extra dimension to represent * the coefficient of the constant term when going from solutions * to coefficients (shift == 1) and we drop the extra dimension when going * in the opposite direction (shift == -1). "dim" is the space in which * the dual should be created. */ static __isl_give isl_basic_set *farkas(__isl_take isl_space *dim, __isl_take isl_basic_set *bset, int shift) { int i, j, k; isl_basic_set *dual = NULL; unsigned total; total = isl_basic_set_total_dim(bset); dual = isl_basic_set_alloc_space(dim, bset->n_eq + bset->n_ineq, total, bset->n_ineq + (shift > 0)); dual = isl_basic_set_set_rational(dual); for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) { k = isl_basic_set_alloc_div(dual); if (k < 0) goto error; isl_int_set_si(dual->div[k][0], 0); } for (i = 0; i < total; ++i) { k = isl_basic_set_alloc_equality(dual); if (k < 0) goto error; isl_seq_clr(dual->eq[k], 1 + shift + total); isl_int_set_si(dual->eq[k][1 + shift + i], -1); for (j = 0; j < bset->n_eq; ++j) isl_int_set(dual->eq[k][1 + shift + total + j], bset->eq[j][1 + i]); for (j = 0; j < bset->n_ineq; ++j) isl_int_set(dual->eq[k][1 + shift + total + bset->n_eq + j], bset->ineq[j][1 + i]); } for (i = 0; i < bset->n_ineq; ++i) { k = isl_basic_set_alloc_inequality(dual); if (k < 0) goto error; isl_seq_clr(dual->ineq[k], 1 + shift + total + bset->n_eq + bset->n_ineq); isl_int_set_si(dual->ineq[k][1 + shift + total + bset->n_eq + i], 1); } if (shift > 0) { k = isl_basic_set_alloc_inequality(dual); if (k < 0) goto error; isl_seq_clr(dual->ineq[k], 2 + total); isl_int_set_si(dual->ineq[k][1], 1); for (j = 0; j < bset->n_eq; ++j) isl_int_neg(dual->ineq[k][2 + total + j], bset->eq[j][0]); for (j = 0; j < bset->n_ineq; ++j) isl_int_neg(dual->ineq[k][2 + total + bset->n_eq + j], bset->ineq[j][0]); } dual = isl_basic_set_remove_divs(dual); isl_basic_set_simplify(dual); isl_basic_set_finalize(dual); isl_basic_set_free(bset); return dual; error: isl_basic_set_free(bset); isl_basic_set_free(dual); return NULL; } /* Construct a basic set containing the tuples of coefficients of all * valid affine constraints on the given basic set. */ __isl_give isl_basic_set *isl_basic_set_coefficients( __isl_take isl_basic_set *bset) { isl_space *dim; if (!bset) return NULL; if (bset->n_div) isl_die(bset->ctx, isl_error_invalid, "input set not allowed to have local variables", goto error); dim = isl_basic_set_get_space(bset); dim = isl_space_coefficients(dim); return farkas(dim, bset, 1); error: isl_basic_set_free(bset); return NULL; } /* Construct a basic set containing the elements that satisfy all * affine constraints whose coefficient tuples are * contained in the given basic set. */ __isl_give isl_basic_set *isl_basic_set_solutions( __isl_take isl_basic_set *bset) { isl_space *dim; if (!bset) return NULL; if (bset->n_div) isl_die(bset->ctx, isl_error_invalid, "input set not allowed to have local variables", goto error); dim = isl_basic_set_get_space(bset); dim = isl_space_solutions(dim); return farkas(dim, bset, -1); error: isl_basic_set_free(bset); return NULL; } /* Construct a basic set containing the tuples of coefficients of all * valid affine constraints on the given set. */ __isl_give isl_basic_set *isl_set_coefficients(__isl_take isl_set *set) { int i; isl_basic_set *coeff; if (!set) return NULL; if (set->n == 0) { isl_space *dim = isl_set_get_space(set); dim = isl_space_coefficients(dim); coeff = isl_basic_set_universe(dim); coeff = isl_basic_set_set_rational(coeff); isl_set_free(set); return coeff; } coeff = isl_basic_set_coefficients(isl_basic_set_copy(set->p[0])); for (i = 1; i < set->n; ++i) { isl_basic_set *bset, *coeff_i; bset = isl_basic_set_copy(set->p[i]); coeff_i = isl_basic_set_coefficients(bset); coeff = isl_basic_set_intersect(coeff, coeff_i); } isl_set_free(set); return coeff; } /* Construct a basic set containing the elements that satisfy all * affine constraints whose coefficient tuples are * contained in the given set. */ __isl_give isl_basic_set *isl_set_solutions(__isl_take isl_set *set) { int i; isl_basic_set *sol; if (!set) return NULL; if (set->n == 0) { isl_space *dim = isl_set_get_space(set); dim = isl_space_solutions(dim); sol = isl_basic_set_universe(dim); sol = isl_basic_set_set_rational(sol); isl_set_free(set); return sol; } sol = isl_basic_set_solutions(isl_basic_set_copy(set->p[0])); for (i = 1; i < set->n; ++i) { isl_basic_set *bset, *sol_i; bset = isl_basic_set_copy(set->p[i]); sol_i = isl_basic_set_solutions(bset); sol = isl_basic_set_intersect(sol, sol_i); } isl_set_free(set); return sol; } cloog-0.18.2/isl/isl_ast_build_expr.h0000664000175000017500000000153012254313240014436 00000000000000#ifndef ISL_AST_BUILD_EXPR_PRIVATE_H #define ISL_AST_BUILD_EXPR_PRIVATE_H #include #include __isl_give isl_ast_expr *isl_ast_build_expr_from_basic_set( __isl_keep isl_ast_build *build, __isl_take isl_basic_set *bset); __isl_give isl_ast_expr *isl_ast_build_expr_from_set( __isl_keep isl_ast_build *build, __isl_take isl_set *set); __isl_give isl_ast_expr *isl_ast_build_expr_from_pw_aff_internal( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa); __isl_give isl_ast_expr *isl_ast_expr_from_aff(__isl_take isl_aff *aff, __isl_keep isl_ast_build *build); __isl_give isl_ast_expr *isl_ast_expr_set_op_arg(__isl_take isl_ast_expr *expr, int pos, __isl_take isl_ast_expr *arg); __isl_give isl_ast_node *isl_ast_build_call_from_executed( __isl_keep isl_ast_build *build, __isl_take isl_map *executed); #endif cloog-0.18.2/isl/isl_blk.c0000664000175000017500000000552212254313240012202 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include /* The maximal number of cache misses before first element is evicted */ #define ISL_BLK_MAX_MISS 100 struct isl_blk isl_blk_empty() { struct isl_blk block; block.size = 0; block.data = NULL; return block; } static int isl_blk_is_empty(struct isl_blk block) { return block.size == 0 && block.data == NULL; } static struct isl_blk isl_blk_error() { struct isl_blk block; block.size = -1; block.data = NULL; return block; } int isl_blk_is_error(struct isl_blk block) { return block.size == -1 && block.data == NULL; } static struct isl_blk extend(struct isl_ctx *ctx, struct isl_blk block, size_t new_n) { int i; isl_int *p; if (block.size >= new_n) return block; p = block.data; block.data = isl_realloc_array(ctx, block.data, isl_int, new_n); if (!block.data) { free(p); return isl_blk_error(); } for (i = block.size; i < new_n; ++i) isl_int_init(block.data[i]); block.size = new_n; return block; } static void isl_blk_free_force(struct isl_ctx *ctx, struct isl_blk block) { int i; for (i = 0; i < block.size; ++i) isl_int_clear(block.data[i]); free(block.data); } struct isl_blk isl_blk_alloc(struct isl_ctx *ctx, size_t n) { int i; struct isl_blk block; block = isl_blk_empty(); if (n && ctx->n_cached) { int best = 0; for (i = 1; ctx->cache[best].size != n && i < ctx->n_cached; ++i) { if (ctx->cache[best].size < n) { if (ctx->cache[i].size > ctx->cache[best].size) best = i; } else if (ctx->cache[i].size >= n && ctx->cache[i].size < ctx->cache[best].size) best = i; } if (ctx->cache[best].size < 2 * n + 100) { block = ctx->cache[best]; if (--ctx->n_cached != best) ctx->cache[best] = ctx->cache[ctx->n_cached]; if (best == 0) ctx->n_miss = 0; } else if (ctx->n_miss++ >= ISL_BLK_MAX_MISS) { isl_blk_free_force(ctx, ctx->cache[0]); if (--ctx->n_cached != 0) ctx->cache[0] = ctx->cache[ctx->n_cached]; ctx->n_miss = 0; } } return extend(ctx, block, n); } struct isl_blk isl_blk_extend(struct isl_ctx *ctx, struct isl_blk block, size_t new_n) { if (isl_blk_is_empty(block)) return isl_blk_alloc(ctx, new_n); return extend(ctx, block, new_n); } void isl_blk_free(struct isl_ctx *ctx, struct isl_blk block) { if (isl_blk_is_empty(block) || isl_blk_is_error(block)) return; if (ctx->n_cached < ISL_BLK_CACHE_SIZE) ctx->cache[ctx->n_cached++] = block; else isl_blk_free_force(ctx, block); } void isl_blk_clear_cache(struct isl_ctx *ctx) { int i; for (i = 0; i < ctx->n_cached; ++i) isl_blk_free_force(ctx, ctx->cache[i]); ctx->n_cached = 0; } cloog-0.18.2/isl/isl_power_templ.c0000664000175000017500000000342212254313240013764 00000000000000#include #define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) /* Compute the given non-zero power of "map" and return the result. * If the exponent "exp" is negative, then the -exp th power of the inverse * relation is computed. */ __isl_give TYPE *FN(TYPE,fixed_power)(__isl_take TYPE *map, isl_int exp) { isl_ctx *ctx; TYPE *res = NULL; isl_int r; if (!map) return NULL; ctx = FN(TYPE,get_ctx)(map); if (isl_int_is_zero(exp)) isl_die(ctx, isl_error_invalid, "expecting non-zero exponent", goto error); if (isl_int_is_neg(exp)) { isl_int_neg(exp, exp); map = FN(TYPE,reverse)(map); return FN(TYPE,fixed_power)(map, exp); } isl_int_init(r); for (;;) { isl_int_fdiv_r(r, exp, ctx->two); if (!isl_int_is_zero(r)) { if (!res) res = FN(TYPE,copy)(map); else { res = FN(TYPE,apply_range)(res, FN(TYPE,copy)(map)); res = FN(TYPE,coalesce)(res); } if (!res) break; } isl_int_fdiv_q(exp, exp, ctx->two); if (isl_int_is_zero(exp)) break; map = FN(TYPE,apply_range)(map, FN(TYPE,copy)(map)); map = FN(TYPE,coalesce)(map); } isl_int_clear(r); FN(TYPE,free)(map); return res; error: FN(TYPE,free)(map); return NULL; } /* Compute the given non-zero power of "map" and return the result. * If the exponent "exp" is negative, then the -exp th power of the inverse * relation is computed. */ __isl_give TYPE *FN(TYPE,fixed_power_val)(__isl_take TYPE *map, __isl_take isl_val *exp) { if (!map || !exp) goto error; if (!isl_val_is_int(exp)) isl_die(FN(TYPE,get_ctx)(map), isl_error_invalid, "expecting integer exponent", goto error); map = FN(TYPE,fixed_power)(map, exp->n); isl_val_free(exp); return map; error: FN(TYPE,free)(map); isl_val_free(exp); return NULL; } cloog-0.18.2/isl/isl_transitive_closure.c0000664000175000017500000022737412254313240015371 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #include #include #include #include #include #include #include #include #include int isl_map_is_transitively_closed(__isl_keep isl_map *map) { isl_map *map2; int closed; map2 = isl_map_apply_range(isl_map_copy(map), isl_map_copy(map)); closed = isl_map_is_subset(map2, map); isl_map_free(map2); return closed; } int isl_union_map_is_transitively_closed(__isl_keep isl_union_map *umap) { isl_union_map *umap2; int closed; umap2 = isl_union_map_apply_range(isl_union_map_copy(umap), isl_union_map_copy(umap)); closed = isl_union_map_is_subset(umap2, umap); isl_union_map_free(umap2); return closed; } /* Given a map that represents a path with the length of the path * encoded as the difference between the last output coordindate * and the last input coordinate, set this length to either * exactly "length" (if "exactly" is set) or at least "length" * (if "exactly" is not set). */ static __isl_give isl_map *set_path_length(__isl_take isl_map *map, int exactly, int length) { isl_space *dim; struct isl_basic_map *bmap; unsigned d; unsigned nparam; int k; isl_int *c; if (!map) return NULL; dim = isl_map_get_space(map); d = isl_space_dim(dim, isl_dim_in); nparam = isl_space_dim(dim, isl_dim_param); bmap = isl_basic_map_alloc_space(dim, 0, 1, 1); if (exactly) { k = isl_basic_map_alloc_equality(bmap); c = bmap->eq[k]; } else { k = isl_basic_map_alloc_inequality(bmap); c = bmap->ineq[k]; } if (k < 0) goto error; isl_seq_clr(c, 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(c[0], -length); isl_int_set_si(c[1 + nparam + d - 1], -1); isl_int_set_si(c[1 + nparam + d + d - 1], 1); bmap = isl_basic_map_finalize(bmap); map = isl_map_intersect(map, isl_map_from_basic_map(bmap)); return map; error: isl_basic_map_free(bmap); isl_map_free(map); return NULL; } /* Check whether the overapproximation of the power of "map" is exactly * the power of "map". Let R be "map" and A_k the overapproximation. * The approximation is exact if * * A_1 = R * A_k = A_{k-1} \circ R k >= 2 * * Since A_k is known to be an overapproximation, we only need to check * * A_1 \subset R * A_k \subset A_{k-1} \circ R k >= 2 * * In practice, "app" has an extra input and output coordinate * to encode the length of the path. So, we first need to add * this coordinate to "map" and set the length of the path to * one. */ static int check_power_exactness(__isl_take isl_map *map, __isl_take isl_map *app) { int exact; isl_map *app_1; isl_map *app_2; map = isl_map_add_dims(map, isl_dim_in, 1); map = isl_map_add_dims(map, isl_dim_out, 1); map = set_path_length(map, 1, 1); app_1 = set_path_length(isl_map_copy(app), 1, 1); exact = isl_map_is_subset(app_1, map); isl_map_free(app_1); if (!exact || exact < 0) { isl_map_free(app); isl_map_free(map); return exact; } app_1 = set_path_length(isl_map_copy(app), 0, 1); app_2 = set_path_length(app, 0, 2); app_1 = isl_map_apply_range(map, app_1); exact = isl_map_is_subset(app_2, app_1); isl_map_free(app_1); isl_map_free(app_2); return exact; } /* Check whether the overapproximation of the power of "map" is exactly * the power of "map", possibly after projecting out the power (if "project" * is set). * * If "project" is set and if "steps" can only result in acyclic paths, * then we check * * A = R \cup (A \circ R) * * where A is the overapproximation with the power projected out, i.e., * an overapproximation of the transitive closure. * More specifically, since A is known to be an overapproximation, we check * * A \subset R \cup (A \circ R) * * Otherwise, we check if the power is exact. * * Note that "app" has an extra input and output coordinate to encode * the length of the part. If we are only interested in the transitive * closure, then we can simply project out these coordinates first. */ static int check_exactness(__isl_take isl_map *map, __isl_take isl_map *app, int project) { isl_map *test; int exact; unsigned d; if (!project) return check_power_exactness(map, app); d = isl_map_dim(map, isl_dim_in); app = set_path_length(app, 0, 1); app = isl_map_project_out(app, isl_dim_in, d, 1); app = isl_map_project_out(app, isl_dim_out, d, 1); app = isl_map_reset_space(app, isl_map_get_space(map)); test = isl_map_apply_range(isl_map_copy(map), isl_map_copy(app)); test = isl_map_union(test, isl_map_copy(map)); exact = isl_map_is_subset(app, test); isl_map_free(app); isl_map_free(test); isl_map_free(map); return exact; } /* * The transitive closure implementation is based on the paper * "Computing the Transitive Closure of a Union of Affine Integer * Tuple Relations" by Anna Beletska, Denis Barthou, Wlodzimierz Bielecki and * Albert Cohen. */ /* Given a set of n offsets v_i (the rows of "steps"), construct a relation * of the given dimension specification (Z^{n+1} -> Z^{n+1}) * that maps an element x to any element that can be reached * by taking a non-negative number of steps along any of * the extended offsets v'_i = [v_i 1]. * That is, construct * * { [x] -> [y] : exists k_i >= 0, y = x + \sum_i k_i v'_i } * * For any element in this relation, the number of steps taken * is equal to the difference in the final coordinates. */ static __isl_give isl_map *path_along_steps(__isl_take isl_space *dim, __isl_keep isl_mat *steps) { int i, j, k; struct isl_basic_map *path = NULL; unsigned d; unsigned n; unsigned nparam; if (!dim || !steps) goto error; d = isl_space_dim(dim, isl_dim_in); n = steps->n_row; nparam = isl_space_dim(dim, isl_dim_param); path = isl_basic_map_alloc_space(isl_space_copy(dim), n, d, n); for (i = 0; i < n; ++i) { k = isl_basic_map_alloc_div(path); if (k < 0) goto error; isl_assert(steps->ctx, i == k, goto error); isl_int_set_si(path->div[k][0], 0); } for (i = 0; i < d; ++i) { k = isl_basic_map_alloc_equality(path); if (k < 0) goto error; isl_seq_clr(path->eq[k], 1 + isl_basic_map_total_dim(path)); isl_int_set_si(path->eq[k][1 + nparam + i], 1); isl_int_set_si(path->eq[k][1 + nparam + d + i], -1); if (i == d - 1) for (j = 0; j < n; ++j) isl_int_set_si(path->eq[k][1 + nparam + 2 * d + j], 1); else for (j = 0; j < n; ++j) isl_int_set(path->eq[k][1 + nparam + 2 * d + j], steps->row[j][i]); } for (i = 0; i < n; ++i) { k = isl_basic_map_alloc_inequality(path); if (k < 0) goto error; isl_seq_clr(path->ineq[k], 1 + isl_basic_map_total_dim(path)); isl_int_set_si(path->ineq[k][1 + nparam + 2 * d + i], 1); } isl_space_free(dim); path = isl_basic_map_simplify(path); path = isl_basic_map_finalize(path); return isl_map_from_basic_map(path); error: isl_space_free(dim); isl_basic_map_free(path); return NULL; } #define IMPURE 0 #define PURE_PARAM 1 #define PURE_VAR 2 #define MIXED 3 /* Check whether the parametric constant term of constraint c is never * positive in "bset". */ static int parametric_constant_never_positive(__isl_keep isl_basic_set *bset, isl_int *c, int *div_purity) { unsigned d; unsigned n_div; unsigned nparam; int i; int k; int empty; n_div = isl_basic_set_dim(bset, isl_dim_div); d = isl_basic_set_dim(bset, isl_dim_set); nparam = isl_basic_set_dim(bset, isl_dim_param); bset = isl_basic_set_copy(bset); bset = isl_basic_set_cow(bset); bset = isl_basic_set_extend_constraints(bset, 0, 1); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset)); isl_seq_cpy(bset->ineq[k], c, 1 + nparam); for (i = 0; i < n_div; ++i) { if (div_purity[i] != PURE_PARAM) continue; isl_int_set(bset->ineq[k][1 + nparam + d + i], c[1 + nparam + d + i]); } isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1); empty = isl_basic_set_is_empty(bset); isl_basic_set_free(bset); return empty; error: isl_basic_set_free(bset); return -1; } /* Return PURE_PARAM if only the coefficients of the parameters are non-zero. * Return PURE_VAR if only the coefficients of the set variables are non-zero. * Return MIXED if only the coefficients of the parameters and the set * variables are non-zero and if moreover the parametric constant * can never attain positive values. * Return IMPURE otherwise. */ static int purity(__isl_keep isl_basic_set *bset, isl_int *c, int *div_purity, int eq) { unsigned d; unsigned n_div; unsigned nparam; int empty; int i; int p = 0, v = 0; n_div = isl_basic_set_dim(bset, isl_dim_div); d = isl_basic_set_dim(bset, isl_dim_set); nparam = isl_basic_set_dim(bset, isl_dim_param); for (i = 0; i < n_div; ++i) { if (isl_int_is_zero(c[1 + nparam + d + i])) continue; switch (div_purity[i]) { case PURE_PARAM: p = 1; break; case PURE_VAR: v = 1; break; default: return IMPURE; } } if (!p && isl_seq_first_non_zero(c + 1, nparam) == -1) return PURE_VAR; if (!v && isl_seq_first_non_zero(c + 1 + nparam, d) == -1) return PURE_PARAM; empty = parametric_constant_never_positive(bset, c, div_purity); if (eq && empty >= 0 && !empty) { isl_seq_neg(c, c, 1 + nparam + d + n_div); empty = parametric_constant_never_positive(bset, c, div_purity); } return empty < 0 ? -1 : empty ? MIXED : IMPURE; } /* Return an array of integers indicating the type of each div in bset. * If the div is (recursively) defined in terms of only the parameters, * then the type is PURE_PARAM. * If the div is (recursively) defined in terms of only the set variables, * then the type is PURE_VAR. * Otherwise, the type is IMPURE. */ static __isl_give int *get_div_purity(__isl_keep isl_basic_set *bset) { int i, j; int *div_purity; unsigned d; unsigned n_div; unsigned nparam; if (!bset) return NULL; n_div = isl_basic_set_dim(bset, isl_dim_div); d = isl_basic_set_dim(bset, isl_dim_set); nparam = isl_basic_set_dim(bset, isl_dim_param); div_purity = isl_alloc_array(bset->ctx, int, n_div); if (n_div && !div_purity) return NULL; for (i = 0; i < bset->n_div; ++i) { int p = 0, v = 0; if (isl_int_is_zero(bset->div[i][0])) { div_purity[i] = IMPURE; continue; } if (isl_seq_first_non_zero(bset->div[i] + 2, nparam) != -1) p = 1; if (isl_seq_first_non_zero(bset->div[i] + 2 + nparam, d) != -1) v = 1; for (j = 0; j < i; ++j) { if (isl_int_is_zero(bset->div[i][2 + nparam + d + j])) continue; switch (div_purity[j]) { case PURE_PARAM: p = 1; break; case PURE_VAR: v = 1; break; default: p = v = 1; break; } } div_purity[i] = v ? p ? IMPURE : PURE_VAR : PURE_PARAM; } return div_purity; } /* Given a path with the as yet unconstrained length at position "pos", * check if setting the length to zero results in only the identity * mapping. */ static int empty_path_is_identity(__isl_keep isl_basic_map *path, unsigned pos) { isl_basic_map *test = NULL; isl_basic_map *id = NULL; int k; int is_id; test = isl_basic_map_copy(path); test = isl_basic_map_extend_constraints(test, 1, 0); k = isl_basic_map_alloc_equality(test); if (k < 0) goto error; isl_seq_clr(test->eq[k], 1 + isl_basic_map_total_dim(test)); isl_int_set_si(test->eq[k][pos], 1); id = isl_basic_map_identity(isl_basic_map_get_space(path)); is_id = isl_basic_map_is_equal(test, id); isl_basic_map_free(test); isl_basic_map_free(id); return is_id; error: isl_basic_map_free(test); return -1; } /* If any of the constraints is found to be impure then this function * sets *impurity to 1. * * If impurity is NULL then we are dealing with a non-parametric set * and so the constraints are obviously PURE_VAR. */ static __isl_give isl_basic_map *add_delta_constraints( __isl_take isl_basic_map *path, __isl_keep isl_basic_set *delta, unsigned off, unsigned nparam, unsigned d, int *div_purity, int eq, int *impurity) { int i, k; int n = eq ? delta->n_eq : delta->n_ineq; isl_int **delta_c = eq ? delta->eq : delta->ineq; unsigned n_div; n_div = isl_basic_set_dim(delta, isl_dim_div); for (i = 0; i < n; ++i) { isl_int *path_c; int p = PURE_VAR; if (impurity) p = purity(delta, delta_c[i], div_purity, eq); if (p < 0) goto error; if (p != PURE_VAR && p != PURE_PARAM && !*impurity) *impurity = 1; if (p == IMPURE) continue; if (eq && p != MIXED) { k = isl_basic_map_alloc_equality(path); path_c = path->eq[k]; } else { k = isl_basic_map_alloc_inequality(path); path_c = path->ineq[k]; } if (k < 0) goto error; isl_seq_clr(path_c, 1 + isl_basic_map_total_dim(path)); if (p == PURE_VAR) { isl_seq_cpy(path_c + off, delta_c[i] + 1 + nparam, d); isl_int_set(path_c[off + d], delta_c[i][0]); } else if (p == PURE_PARAM) { isl_seq_cpy(path_c, delta_c[i], 1 + nparam); } else { isl_seq_cpy(path_c + off, delta_c[i] + 1 + nparam, d); isl_seq_cpy(path_c, delta_c[i], 1 + nparam); } isl_seq_cpy(path_c + off - n_div, delta_c[i] + 1 + nparam + d, n_div); } return path; error: isl_basic_map_free(path); return NULL; } /* Given a set of offsets "delta", construct a relation of the * given dimension specification (Z^{n+1} -> Z^{n+1}) that * is an overapproximation of the relations that * maps an element x to any element that can be reached * by taking a non-negative number of steps along any of * the elements in "delta". * That is, construct an approximation of * * { [x] -> [y] : exists f \in \delta, k \in Z : * y = x + k [f, 1] and k >= 0 } * * For any element in this relation, the number of steps taken * is equal to the difference in the final coordinates. * * In particular, let delta be defined as * * \delta = [p] -> { [x] : A x + a >= 0 and B p + b >= 0 and * C x + C'p + c >= 0 and * D x + D'p + d >= 0 } * * where the constraints C x + C'p + c >= 0 are such that the parametric * constant term of each constraint j, "C_j x + C'_j p + c_j", * can never attain positive values, then the relation is constructed as * * { [x] -> [y] : exists [f, k] \in Z^{n+1} : y = x + f and * A f + k a >= 0 and B p + b >= 0 and * C f + C'p + c >= 0 and k >= 1 } * union { [x] -> [x] } * * If the zero-length paths happen to correspond exactly to the identity * mapping, then we return * * { [x] -> [y] : exists [f, k] \in Z^{n+1} : y = x + f and * A f + k a >= 0 and B p + b >= 0 and * C f + C'p + c >= 0 and k >= 0 } * * instead. * * Existentially quantified variables in \delta are handled by * classifying them as independent of the parameters, purely * parameter dependent and others. Constraints containing * any of the other existentially quantified variables are removed. * This is safe, but leads to an additional overapproximation. * * If there are any impure constraints, then we also eliminate * the parameters from \delta, resulting in a set * * \delta' = { [x] : E x + e >= 0 } * * and add the constraints * * E f + k e >= 0 * * to the constructed relation. */ static __isl_give isl_map *path_along_delta(__isl_take isl_space *dim, __isl_take isl_basic_set *delta) { isl_basic_map *path = NULL; unsigned d; unsigned n_div; unsigned nparam; unsigned off; int i, k; int is_id; int *div_purity = NULL; int impurity = 0; if (!delta) goto error; n_div = isl_basic_set_dim(delta, isl_dim_div); d = isl_basic_set_dim(delta, isl_dim_set); nparam = isl_basic_set_dim(delta, isl_dim_param); path = isl_basic_map_alloc_space(isl_space_copy(dim), n_div + d + 1, d + 1 + delta->n_eq, delta->n_eq + delta->n_ineq + 1); off = 1 + nparam + 2 * (d + 1) + n_div; for (i = 0; i < n_div + d + 1; ++i) { k = isl_basic_map_alloc_div(path); if (k < 0) goto error; isl_int_set_si(path->div[k][0], 0); } for (i = 0; i < d + 1; ++i) { k = isl_basic_map_alloc_equality(path); if (k < 0) goto error; isl_seq_clr(path->eq[k], 1 + isl_basic_map_total_dim(path)); isl_int_set_si(path->eq[k][1 + nparam + i], 1); isl_int_set_si(path->eq[k][1 + nparam + d + 1 + i], -1); isl_int_set_si(path->eq[k][off + i], 1); } div_purity = get_div_purity(delta); if (n_div && !div_purity) goto error; path = add_delta_constraints(path, delta, off, nparam, d, div_purity, 1, &impurity); path = add_delta_constraints(path, delta, off, nparam, d, div_purity, 0, &impurity); if (impurity) { isl_space *dim = isl_basic_set_get_space(delta); delta = isl_basic_set_project_out(delta, isl_dim_param, 0, nparam); delta = isl_basic_set_add_dims(delta, isl_dim_param, nparam); delta = isl_basic_set_reset_space(delta, dim); if (!delta) goto error; path = isl_basic_map_extend_constraints(path, delta->n_eq, delta->n_ineq + 1); path = add_delta_constraints(path, delta, off, nparam, d, NULL, 1, NULL); path = add_delta_constraints(path, delta, off, nparam, d, NULL, 0, NULL); path = isl_basic_map_gauss(path, NULL); } is_id = empty_path_is_identity(path, off + d); if (is_id < 0) goto error; k = isl_basic_map_alloc_inequality(path); if (k < 0) goto error; isl_seq_clr(path->ineq[k], 1 + isl_basic_map_total_dim(path)); if (!is_id) isl_int_set_si(path->ineq[k][0], -1); isl_int_set_si(path->ineq[k][off + d], 1); free(div_purity); isl_basic_set_free(delta); path = isl_basic_map_finalize(path); if (is_id) { isl_space_free(dim); return isl_map_from_basic_map(path); } return isl_basic_map_union(path, isl_basic_map_identity(dim)); error: free(div_purity); isl_space_free(dim); isl_basic_set_free(delta); isl_basic_map_free(path); return NULL; } /* Given a dimension specification Z^{n+1} -> Z^{n+1} and a parameter "param", * construct a map that equates the parameter to the difference * in the final coordinates and imposes that this difference is positive. * That is, construct * * { [x,x_s] -> [y,y_s] : k = y_s - x_s > 0 } */ static __isl_give isl_map *equate_parameter_to_length(__isl_take isl_space *dim, unsigned param) { struct isl_basic_map *bmap; unsigned d; unsigned nparam; int k; d = isl_space_dim(dim, isl_dim_in); nparam = isl_space_dim(dim, isl_dim_param); bmap = isl_basic_map_alloc_space(dim, 0, 1, 1); k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->eq[k][1 + param], -1); isl_int_set_si(bmap->eq[k][1 + nparam + d - 1], -1); isl_int_set_si(bmap->eq[k][1 + nparam + d + d - 1], 1); k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->ineq[k], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->ineq[k][1 + param], 1); isl_int_set_si(bmap->ineq[k][0], -1); bmap = isl_basic_map_finalize(bmap); return isl_map_from_basic_map(bmap); error: isl_basic_map_free(bmap); return NULL; } /* Check whether "path" is acyclic, where the last coordinates of domain * and range of path encode the number of steps taken. * That is, check whether * * { d | d = y - x and (x,y) in path } * * does not contain any element with positive last coordinate (positive length) * and zero remaining coordinates (cycle). */ static int is_acyclic(__isl_take isl_map *path) { int i; int acyclic; unsigned dim; struct isl_set *delta; delta = isl_map_deltas(path); dim = isl_set_dim(delta, isl_dim_set); for (i = 0; i < dim; ++i) { if (i == dim -1) delta = isl_set_lower_bound_si(delta, isl_dim_set, i, 1); else delta = isl_set_fix_si(delta, isl_dim_set, i, 0); } acyclic = isl_set_is_empty(delta); isl_set_free(delta); return acyclic; } /* Given a union of basic maps R = \cup_i R_i \subseteq D \times D * and a dimension specification (Z^{n+1} -> Z^{n+1}), * construct a map that is an overapproximation of the map * that takes an element from the space D \times Z to another * element from the same space, such that the first n coordinates of the * difference between them is a sum of differences between images * and pre-images in one of the R_i and such that the last coordinate * is equal to the number of steps taken. * That is, let * * \Delta_i = { y - x | (x, y) in R_i } * * then the constructed map is an overapproximation of * * { (x) -> (x + d) | \exists k_i >= 0, \delta_i \in \Delta_i : * d = (\sum_i k_i \delta_i, \sum_i k_i) } * * The elements of the singleton \Delta_i's are collected as the * rows of the steps matrix. For all these \Delta_i's together, * a single path is constructed. * For each of the other \Delta_i's, we compute an overapproximation * of the paths along elements of \Delta_i. * Since each of these paths performs an addition, composition is * symmetric and we can simply compose all resulting paths in any order. */ static __isl_give isl_map *construct_extended_path(__isl_take isl_space *dim, __isl_keep isl_map *map, int *project) { struct isl_mat *steps = NULL; struct isl_map *path = NULL; unsigned d; int i, j, n; d = isl_map_dim(map, isl_dim_in); path = isl_map_identity(isl_space_copy(dim)); steps = isl_mat_alloc(map->ctx, map->n, d); if (!steps) goto error; n = 0; for (i = 0; i < map->n; ++i) { struct isl_basic_set *delta; delta = isl_basic_map_deltas(isl_basic_map_copy(map->p[i])); for (j = 0; j < d; ++j) { int fixed; fixed = isl_basic_set_plain_dim_is_fixed(delta, j, &steps->row[n][j]); if (fixed < 0) { isl_basic_set_free(delta); goto error; } if (!fixed) break; } if (j < d) { path = isl_map_apply_range(path, path_along_delta(isl_space_copy(dim), delta)); path = isl_map_coalesce(path); } else { isl_basic_set_free(delta); ++n; } } if (n > 0) { steps->n_row = n; path = isl_map_apply_range(path, path_along_steps(isl_space_copy(dim), steps)); } if (project && *project) { *project = is_acyclic(isl_map_copy(path)); if (*project < 0) goto error; } isl_space_free(dim); isl_mat_free(steps); return path; error: isl_space_free(dim); isl_mat_free(steps); isl_map_free(path); return NULL; } static int isl_set_overlaps(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { isl_set *i; int no_overlap; if (!isl_space_tuple_match(set1->dim, isl_dim_set, set2->dim, isl_dim_set)) return 0; i = isl_set_intersect(isl_set_copy(set1), isl_set_copy(set2)); no_overlap = isl_set_is_empty(i); isl_set_free(i); return no_overlap < 0 ? -1 : !no_overlap; } /* Given a union of basic maps R = \cup_i R_i \subseteq D \times D * and a dimension specification (Z^{n+1} -> Z^{n+1}), * construct a map that is an overapproximation of the map * that takes an element from the dom R \times Z to an * element from ran R \times Z, such that the first n coordinates of the * difference between them is a sum of differences between images * and pre-images in one of the R_i and such that the last coordinate * is equal to the number of steps taken. * That is, let * * \Delta_i = { y - x | (x, y) in R_i } * * then the constructed map is an overapproximation of * * { (x) -> (x + d) | \exists k_i >= 0, \delta_i \in \Delta_i : * d = (\sum_i k_i \delta_i, \sum_i k_i) and * x in dom R and x + d in ran R and * \sum_i k_i >= 1 } */ static __isl_give isl_map *construct_component(__isl_take isl_space *dim, __isl_keep isl_map *map, int *exact, int project) { struct isl_set *domain = NULL; struct isl_set *range = NULL; struct isl_map *app = NULL; struct isl_map *path = NULL; domain = isl_map_domain(isl_map_copy(map)); domain = isl_set_coalesce(domain); range = isl_map_range(isl_map_copy(map)); range = isl_set_coalesce(range); if (!isl_set_overlaps(domain, range)) { isl_set_free(domain); isl_set_free(range); isl_space_free(dim); map = isl_map_copy(map); map = isl_map_add_dims(map, isl_dim_in, 1); map = isl_map_add_dims(map, isl_dim_out, 1); map = set_path_length(map, 1, 1); return map; } app = isl_map_from_domain_and_range(domain, range); app = isl_map_add_dims(app, isl_dim_in, 1); app = isl_map_add_dims(app, isl_dim_out, 1); path = construct_extended_path(isl_space_copy(dim), map, exact && *exact ? &project : NULL); app = isl_map_intersect(app, path); if (exact && *exact && (*exact = check_exactness(isl_map_copy(map), isl_map_copy(app), project)) < 0) goto error; isl_space_free(dim); app = set_path_length(app, 0, 1); return app; error: isl_space_free(dim); isl_map_free(app); return NULL; } /* Call construct_component and, if "project" is set, project out * the final coordinates. */ static __isl_give isl_map *construct_projected_component( __isl_take isl_space *dim, __isl_keep isl_map *map, int *exact, int project) { isl_map *app; unsigned d; if (!dim) return NULL; d = isl_space_dim(dim, isl_dim_in); app = construct_component(dim, map, exact, project); if (project) { app = isl_map_project_out(app, isl_dim_in, d - 1, 1); app = isl_map_project_out(app, isl_dim_out, d - 1, 1); } return app; } /* Compute an extended version, i.e., with path lengths, of * an overapproximation of the transitive closure of "bmap" * with path lengths greater than or equal to zero and with * domain and range equal to "dom". */ static __isl_give isl_map *q_closure(__isl_take isl_space *dim, __isl_take isl_set *dom, __isl_keep isl_basic_map *bmap, int *exact) { int project = 1; isl_map *path; isl_map *map; isl_map *app; dom = isl_set_add_dims(dom, isl_dim_set, 1); app = isl_map_from_domain_and_range(dom, isl_set_copy(dom)); map = isl_map_from_basic_map(isl_basic_map_copy(bmap)); path = construct_extended_path(dim, map, &project); app = isl_map_intersect(app, path); if ((*exact = check_exactness(map, isl_map_copy(app), project)) < 0) goto error; return app; error: isl_map_free(app); return NULL; } /* Check whether qc has any elements of length at least one * with domain and/or range outside of dom and ran. */ static int has_spurious_elements(__isl_keep isl_map *qc, __isl_keep isl_set *dom, __isl_keep isl_set *ran) { isl_set *s; int subset; unsigned d; if (!qc || !dom || !ran) return -1; d = isl_map_dim(qc, isl_dim_in); qc = isl_map_copy(qc); qc = set_path_length(qc, 0, 1); qc = isl_map_project_out(qc, isl_dim_in, d - 1, 1); qc = isl_map_project_out(qc, isl_dim_out, d - 1, 1); s = isl_map_domain(isl_map_copy(qc)); subset = isl_set_is_subset(s, dom); isl_set_free(s); if (subset < 0) goto error; if (!subset) { isl_map_free(qc); return 1; } s = isl_map_range(qc); subset = isl_set_is_subset(s, ran); isl_set_free(s); return subset < 0 ? -1 : !subset; error: isl_map_free(qc); return -1; } #define LEFT 2 #define RIGHT 1 /* For each basic map in "map", except i, check whether it combines * with the transitive closure that is reflexive on C combines * to the left and to the right. * * In particular, if * * dom map_j \subseteq C * * then right[j] is set to 1. Otherwise, if * * ran map_i \cap dom map_j = \emptyset * * then right[j] is set to 0. Otherwise, composing to the right * is impossible. * * Similar, for composing to the left, we have if * * ran map_j \subseteq C * * then left[j] is set to 1. Otherwise, if * * dom map_i \cap ran map_j = \emptyset * * then left[j] is set to 0. Otherwise, composing to the left * is impossible. * * The return value is or'd with LEFT if composing to the left * is possible and with RIGHT if composing to the right is possible. */ static int composability(__isl_keep isl_set *C, int i, isl_set **dom, isl_set **ran, int *left, int *right, __isl_keep isl_map *map) { int j; int ok; ok = LEFT | RIGHT; for (j = 0; j < map->n && ok; ++j) { int overlaps, subset; if (j == i) continue; if (ok & RIGHT) { if (!dom[j]) dom[j] = isl_set_from_basic_set( isl_basic_map_domain( isl_basic_map_copy(map->p[j]))); if (!dom[j]) return -1; overlaps = isl_set_overlaps(ran[i], dom[j]); if (overlaps < 0) return -1; if (!overlaps) right[j] = 0; else { subset = isl_set_is_subset(dom[j], C); if (subset < 0) return -1; if (subset) right[j] = 1; else ok &= ~RIGHT; } } if (ok & LEFT) { if (!ran[j]) ran[j] = isl_set_from_basic_set( isl_basic_map_range( isl_basic_map_copy(map->p[j]))); if (!ran[j]) return -1; overlaps = isl_set_overlaps(dom[i], ran[j]); if (overlaps < 0) return -1; if (!overlaps) left[j] = 0; else { subset = isl_set_is_subset(ran[j], C); if (subset < 0) return -1; if (subset) left[j] = 1; else ok &= ~LEFT; } } } return ok; } static __isl_give isl_map *anonymize(__isl_take isl_map *map) { map = isl_map_reset(map, isl_dim_in); map = isl_map_reset(map, isl_dim_out); return map; } /* Return a map that is a union of the basic maps in "map", except i, * composed to left and right with qc based on the entries of "left" * and "right". */ static __isl_give isl_map *compose(__isl_keep isl_map *map, int i, __isl_take isl_map *qc, int *left, int *right) { int j; isl_map *comp; comp = isl_map_empty(isl_map_get_space(map)); for (j = 0; j < map->n; ++j) { isl_map *map_j; if (j == i) continue; map_j = isl_map_from_basic_map(isl_basic_map_copy(map->p[j])); map_j = anonymize(map_j); if (left && left[j]) map_j = isl_map_apply_range(map_j, isl_map_copy(qc)); if (right && right[j]) map_j = isl_map_apply_range(isl_map_copy(qc), map_j); comp = isl_map_union(comp, map_j); } comp = isl_map_compute_divs(comp); comp = isl_map_coalesce(comp); isl_map_free(qc); return comp; } /* Compute the transitive closure of "map" incrementally by * computing * * map_i^+ \cup qc^+ * * or * * map_i^+ \cup ((id \cup map_i^) \circ qc^+) * * or * * map_i^+ \cup (qc^+ \circ (id \cup map_i^)) * * depending on whether left or right are NULL. */ static __isl_give isl_map *compute_incremental( __isl_take isl_space *dim, __isl_keep isl_map *map, int i, __isl_take isl_map *qc, int *left, int *right, int *exact) { isl_map *map_i; isl_map *tc; isl_map *rtc = NULL; if (!map) goto error; isl_assert(map->ctx, left || right, goto error); map_i = isl_map_from_basic_map(isl_basic_map_copy(map->p[i])); tc = construct_projected_component(isl_space_copy(dim), map_i, exact, 1); isl_map_free(map_i); if (*exact) qc = isl_map_transitive_closure(qc, exact); if (!*exact) { isl_space_free(dim); isl_map_free(tc); isl_map_free(qc); return isl_map_universe(isl_map_get_space(map)); } if (!left || !right) rtc = isl_map_union(isl_map_copy(tc), isl_map_identity(isl_map_get_space(tc))); if (!right) qc = isl_map_apply_range(rtc, qc); if (!left) qc = isl_map_apply_range(qc, rtc); qc = isl_map_union(tc, qc); isl_space_free(dim); return qc; error: isl_space_free(dim); isl_map_free(qc); return NULL; } /* Given a map "map", try to find a basic map such that * map^+ can be computed as * * map^+ = map_i^+ \cup * \bigcup_j ((map_i^+ \cup Id_C)^+ \circ map_j \circ (map_i^+ \cup Id_C))^+ * * with C the simple hull of the domain and range of the input map. * map_i^ \cup Id_C is computed by allowing the path lengths to be zero * and by intersecting domain and range with C. * Of course, we need to check that this is actually equal to map_i^ \cup Id_C. * Also, we only use the incremental computation if all the transitive * closures are exact and if the number of basic maps in the union, * after computing the integer divisions, is smaller than the number * of basic maps in the input map. */ static int incemental_on_entire_domain(__isl_keep isl_space *dim, __isl_keep isl_map *map, isl_set **dom, isl_set **ran, int *left, int *right, __isl_give isl_map **res) { int i; isl_set *C; unsigned d; *res = NULL; C = isl_set_union(isl_map_domain(isl_map_copy(map)), isl_map_range(isl_map_copy(map))); C = isl_set_from_basic_set(isl_set_simple_hull(C)); if (!C) return -1; if (C->n != 1) { isl_set_free(C); return 0; } d = isl_map_dim(map, isl_dim_in); for (i = 0; i < map->n; ++i) { isl_map *qc; int exact_i, spurious; int j; dom[i] = isl_set_from_basic_set(isl_basic_map_domain( isl_basic_map_copy(map->p[i]))); ran[i] = isl_set_from_basic_set(isl_basic_map_range( isl_basic_map_copy(map->p[i]))); qc = q_closure(isl_space_copy(dim), isl_set_copy(C), map->p[i], &exact_i); if (!qc) goto error; if (!exact_i) { isl_map_free(qc); continue; } spurious = has_spurious_elements(qc, dom[i], ran[i]); if (spurious) { isl_map_free(qc); if (spurious < 0) goto error; continue; } qc = isl_map_project_out(qc, isl_dim_in, d, 1); qc = isl_map_project_out(qc, isl_dim_out, d, 1); qc = isl_map_compute_divs(qc); for (j = 0; j < map->n; ++j) left[j] = right[j] = 1; qc = compose(map, i, qc, left, right); if (!qc) goto error; if (qc->n >= map->n) { isl_map_free(qc); continue; } *res = compute_incremental(isl_space_copy(dim), map, i, qc, left, right, &exact_i); if (!*res) goto error; if (exact_i) break; isl_map_free(*res); *res = NULL; } isl_set_free(C); return *res != NULL; error: isl_set_free(C); return -1; } /* Try and compute the transitive closure of "map" as * * map^+ = map_i^+ \cup * \bigcup_j ((map_i^+ \cup Id_C)^+ \circ map_j \circ (map_i^+ \cup Id_C))^+ * * with C either the simple hull of the domain and range of the entire * map or the simple hull of domain and range of map_i. */ static __isl_give isl_map *incremental_closure(__isl_take isl_space *dim, __isl_keep isl_map *map, int *exact, int project) { int i; isl_set **dom = NULL; isl_set **ran = NULL; int *left = NULL; int *right = NULL; isl_set *C; unsigned d; isl_map *res = NULL; if (!project) return construct_projected_component(dim, map, exact, project); if (!map) goto error; if (map->n <= 1) return construct_projected_component(dim, map, exact, project); d = isl_map_dim(map, isl_dim_in); dom = isl_calloc_array(map->ctx, isl_set *, map->n); ran = isl_calloc_array(map->ctx, isl_set *, map->n); left = isl_calloc_array(map->ctx, int, map->n); right = isl_calloc_array(map->ctx, int, map->n); if (!ran || !dom || !left || !right) goto error; if (incemental_on_entire_domain(dim, map, dom, ran, left, right, &res) < 0) goto error; for (i = 0; !res && i < map->n; ++i) { isl_map *qc; int exact_i, spurious, comp; if (!dom[i]) dom[i] = isl_set_from_basic_set( isl_basic_map_domain( isl_basic_map_copy(map->p[i]))); if (!dom[i]) goto error; if (!ran[i]) ran[i] = isl_set_from_basic_set( isl_basic_map_range( isl_basic_map_copy(map->p[i]))); if (!ran[i]) goto error; C = isl_set_union(isl_set_copy(dom[i]), isl_set_copy(ran[i])); C = isl_set_from_basic_set(isl_set_simple_hull(C)); if (!C) goto error; if (C->n != 1) { isl_set_free(C); continue; } comp = composability(C, i, dom, ran, left, right, map); if (!comp || comp < 0) { isl_set_free(C); if (comp < 0) goto error; continue; } qc = q_closure(isl_space_copy(dim), C, map->p[i], &exact_i); if (!qc) goto error; if (!exact_i) { isl_map_free(qc); continue; } spurious = has_spurious_elements(qc, dom[i], ran[i]); if (spurious) { isl_map_free(qc); if (spurious < 0) goto error; continue; } qc = isl_map_project_out(qc, isl_dim_in, d, 1); qc = isl_map_project_out(qc, isl_dim_out, d, 1); qc = isl_map_compute_divs(qc); qc = compose(map, i, qc, (comp & LEFT) ? left : NULL, (comp & RIGHT) ? right : NULL); if (!qc) goto error; if (qc->n >= map->n) { isl_map_free(qc); continue; } res = compute_incremental(isl_space_copy(dim), map, i, qc, (comp & LEFT) ? left : NULL, (comp & RIGHT) ? right : NULL, &exact_i); if (!res) goto error; if (exact_i) break; isl_map_free(res); res = NULL; } for (i = 0; i < map->n; ++i) { isl_set_free(dom[i]); isl_set_free(ran[i]); } free(dom); free(ran); free(left); free(right); if (res) { isl_space_free(dim); return res; } return construct_projected_component(dim, map, exact, project); error: if (dom) for (i = 0; i < map->n; ++i) isl_set_free(dom[i]); free(dom); if (ran) for (i = 0; i < map->n; ++i) isl_set_free(ran[i]); free(ran); free(left); free(right); isl_space_free(dim); return NULL; } /* Given an array of sets "set", add "dom" at position "pos" * and search for elements at earlier positions that overlap with "dom". * If any can be found, then merge all of them, together with "dom", into * a single set and assign the union to the first in the array, * which becomes the new group leader for all groups involved in the merge. * During the search, we only consider group leaders, i.e., those with * group[i] = i, as the other sets have already been combined * with one of the group leaders. */ static int merge(isl_set **set, int *group, __isl_take isl_set *dom, int pos) { int i; group[pos] = pos; set[pos] = isl_set_copy(dom); for (i = pos - 1; i >= 0; --i) { int o; if (group[i] != i) continue; o = isl_set_overlaps(set[i], dom); if (o < 0) goto error; if (!o) continue; set[i] = isl_set_union(set[i], set[group[pos]]); set[group[pos]] = NULL; if (!set[i]) goto error; group[group[pos]] = i; group[pos] = i; } isl_set_free(dom); return 0; error: isl_set_free(dom); return -1; } /* Replace each entry in the n by n grid of maps by the cross product * with the relation { [i] -> [i + 1] }. */ static int add_length(__isl_keep isl_map *map, isl_map ***grid, int n) { int i, j, k; isl_space *dim; isl_basic_map *bstep; isl_map *step; unsigned nparam; if (!map) return -1; dim = isl_map_get_space(map); nparam = isl_space_dim(dim, isl_dim_param); dim = isl_space_drop_dims(dim, isl_dim_in, 0, isl_space_dim(dim, isl_dim_in)); dim = isl_space_drop_dims(dim, isl_dim_out, 0, isl_space_dim(dim, isl_dim_out)); dim = isl_space_add_dims(dim, isl_dim_in, 1); dim = isl_space_add_dims(dim, isl_dim_out, 1); bstep = isl_basic_map_alloc_space(dim, 0, 1, 0); k = isl_basic_map_alloc_equality(bstep); if (k < 0) { isl_basic_map_free(bstep); return -1; } isl_seq_clr(bstep->eq[k], 1 + isl_basic_map_total_dim(bstep)); isl_int_set_si(bstep->eq[k][0], 1); isl_int_set_si(bstep->eq[k][1 + nparam], 1); isl_int_set_si(bstep->eq[k][1 + nparam + 1], -1); bstep = isl_basic_map_finalize(bstep); step = isl_map_from_basic_map(bstep); for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) grid[i][j] = isl_map_product(grid[i][j], isl_map_copy(step)); isl_map_free(step); return 0; } /* The core of the Floyd-Warshall algorithm. * Updates the given n x x matrix of relations in place. * * The algorithm iterates over all vertices. In each step, the whole * matrix is updated to include all paths that go to the current vertex, * possibly stay there a while (including passing through earlier vertices) * and then come back. At the start of each iteration, the diagonal * element corresponding to the current vertex is replaced by its * transitive closure to account for all indirect paths that stay * in the current vertex. */ static void floyd_warshall_iterate(isl_map ***grid, int n, int *exact) { int r, p, q; for (r = 0; r < n; ++r) { int r_exact; grid[r][r] = isl_map_transitive_closure(grid[r][r], (exact && *exact) ? &r_exact : NULL); if (exact && *exact && !r_exact) *exact = 0; for (p = 0; p < n; ++p) for (q = 0; q < n; ++q) { isl_map *loop; if (p == r && q == r) continue; loop = isl_map_apply_range( isl_map_copy(grid[p][r]), isl_map_copy(grid[r][q])); grid[p][q] = isl_map_union(grid[p][q], loop); loop = isl_map_apply_range( isl_map_copy(grid[p][r]), isl_map_apply_range( isl_map_copy(grid[r][r]), isl_map_copy(grid[r][q]))); grid[p][q] = isl_map_union(grid[p][q], loop); grid[p][q] = isl_map_coalesce(grid[p][q]); } } } /* Given a partition of the domains and ranges of the basic maps in "map", * apply the Floyd-Warshall algorithm with the elements in the partition * as vertices. * * In particular, there are "n" elements in the partition and "group" is * an array of length 2 * map->n with entries in [0,n-1]. * * We first construct a matrix of relations based on the partition information, * apply Floyd-Warshall on this matrix of relations and then take the * union of all entries in the matrix as the final result. * * If we are actually computing the power instead of the transitive closure, * i.e., when "project" is not set, then the result should have the * path lengths encoded as the difference between an extra pair of * coordinates. We therefore apply the nested transitive closures * to relations that include these lengths. In particular, we replace * the input relation by the cross product with the unit length relation * { [i] -> [i + 1] }. */ static __isl_give isl_map *floyd_warshall_with_groups(__isl_take isl_space *dim, __isl_keep isl_map *map, int *exact, int project, int *group, int n) { int i, j, k; isl_map ***grid = NULL; isl_map *app; if (!map) goto error; if (n == 1) { free(group); return incremental_closure(dim, map, exact, project); } grid = isl_calloc_array(map->ctx, isl_map **, n); if (!grid) goto error; for (i = 0; i < n; ++i) { grid[i] = isl_calloc_array(map->ctx, isl_map *, n); if (!grid[i]) goto error; for (j = 0; j < n; ++j) grid[i][j] = isl_map_empty(isl_map_get_space(map)); } for (k = 0; k < map->n; ++k) { i = group[2 * k]; j = group[2 * k + 1]; grid[i][j] = isl_map_union(grid[i][j], isl_map_from_basic_map( isl_basic_map_copy(map->p[k]))); } if (!project && add_length(map, grid, n) < 0) goto error; floyd_warshall_iterate(grid, n, exact); app = isl_map_empty(isl_map_get_space(map)); for (i = 0; i < n; ++i) { for (j = 0; j < n; ++j) app = isl_map_union(app, grid[i][j]); free(grid[i]); } free(grid); free(group); isl_space_free(dim); return app; error: if (grid) for (i = 0; i < n; ++i) { if (!grid[i]) continue; for (j = 0; j < n; ++j) isl_map_free(grid[i][j]); free(grid[i]); } free(grid); free(group); isl_space_free(dim); return NULL; } /* Partition the domains and ranges of the n basic relations in list * into disjoint cells. * * To find the partition, we simply consider all of the domains * and ranges in turn and combine those that overlap. * "set" contains the partition elements and "group" indicates * to which partition element a given domain or range belongs. * The domain of basic map i corresponds to element 2 * i in these arrays, * while the domain corresponds to element 2 * i + 1. * During the construction group[k] is either equal to k, * in which case set[k] contains the union of all the domains and * ranges in the corresponding group, or is equal to some l < k, * with l another domain or range in the same group. */ static int *setup_groups(isl_ctx *ctx, __isl_keep isl_basic_map **list, int n, isl_set ***set, int *n_group) { int i; int *group = NULL; int g; *set = isl_calloc_array(ctx, isl_set *, 2 * n); group = isl_alloc_array(ctx, int, 2 * n); if (!*set || !group) goto error; for (i = 0; i < n; ++i) { isl_set *dom; dom = isl_set_from_basic_set(isl_basic_map_domain( isl_basic_map_copy(list[i]))); if (merge(*set, group, dom, 2 * i) < 0) goto error; dom = isl_set_from_basic_set(isl_basic_map_range( isl_basic_map_copy(list[i]))); if (merge(*set, group, dom, 2 * i + 1) < 0) goto error; } g = 0; for (i = 0; i < 2 * n; ++i) if (group[i] == i) { if (g != i) { (*set)[g] = (*set)[i]; (*set)[i] = NULL; } group[i] = g++; } else group[i] = group[group[i]]; *n_group = g; return group; error: if (*set) { for (i = 0; i < 2 * n; ++i) isl_set_free((*set)[i]); free(*set); *set = NULL; } free(group); return NULL; } /* Check if the domains and ranges of the basic maps in "map" can * be partitioned, and if so, apply Floyd-Warshall on the elements * of the partition. Note that we also apply this algorithm * if we want to compute the power, i.e., when "project" is not set. * However, the results are unlikely to be exact since the recursive * calls inside the Floyd-Warshall algorithm typically result in * non-linear path lengths quite quickly. */ static __isl_give isl_map *floyd_warshall(__isl_take isl_space *dim, __isl_keep isl_map *map, int *exact, int project) { int i; isl_set **set = NULL; int *group = NULL; int n; if (!map) goto error; if (map->n <= 1) return incremental_closure(dim, map, exact, project); group = setup_groups(map->ctx, map->p, map->n, &set, &n); if (!group) goto error; for (i = 0; i < 2 * map->n; ++i) isl_set_free(set[i]); free(set); return floyd_warshall_with_groups(dim, map, exact, project, group, n); error: isl_space_free(dim); return NULL; } /* Structure for representing the nodes of the graph of which * strongly connected components are being computed. * * list contains the actual nodes * check_closed is set if we may have used the fact that * a pair of basic maps can be interchanged */ struct isl_tc_follows_data { isl_basic_map **list; int check_closed; }; /* Check whether in the computation of the transitive closure * "list[i]" (R_1) should follow (or be part of the same component as) * "list[j]" (R_2). * * That is check whether * * R_1 \circ R_2 * * is a subset of * * R_2 \circ R_1 * * If so, then there is no reason for R_1 to immediately follow R_2 * in any path. * * *check_closed is set if the subset relation holds while * R_1 \circ R_2 is not empty. */ static int basic_map_follows(int i, int j, void *user) { struct isl_tc_follows_data *data = user; struct isl_map *map12 = NULL; struct isl_map *map21 = NULL; int subset; if (!isl_space_tuple_match(data->list[i]->dim, isl_dim_in, data->list[j]->dim, isl_dim_out)) return 0; map21 = isl_map_from_basic_map( isl_basic_map_apply_range( isl_basic_map_copy(data->list[j]), isl_basic_map_copy(data->list[i]))); subset = isl_map_is_empty(map21); if (subset < 0) goto error; if (subset) { isl_map_free(map21); return 0; } if (!isl_space_tuple_match(data->list[i]->dim, isl_dim_in, data->list[i]->dim, isl_dim_out) || !isl_space_tuple_match(data->list[j]->dim, isl_dim_in, data->list[j]->dim, isl_dim_out)) { isl_map_free(map21); return 1; } map12 = isl_map_from_basic_map( isl_basic_map_apply_range( isl_basic_map_copy(data->list[i]), isl_basic_map_copy(data->list[j]))); subset = isl_map_is_subset(map21, map12); isl_map_free(map12); isl_map_free(map21); if (subset) data->check_closed = 1; return subset < 0 ? -1 : !subset; error: isl_map_free(map21); return -1; } /* Given a union of basic maps R = \cup_i R_i \subseteq D \times D * and a dimension specification (Z^{n+1} -> Z^{n+1}), * construct a map that is an overapproximation of the map * that takes an element from the dom R \times Z to an * element from ran R \times Z, such that the first n coordinates of the * difference between them is a sum of differences between images * and pre-images in one of the R_i and such that the last coordinate * is equal to the number of steps taken. * If "project" is set, then these final coordinates are not included, * i.e., a relation of type Z^n -> Z^n is returned. * That is, let * * \Delta_i = { y - x | (x, y) in R_i } * * then the constructed map is an overapproximation of * * { (x) -> (x + d) | \exists k_i >= 0, \delta_i \in \Delta_i : * d = (\sum_i k_i \delta_i, \sum_i k_i) and * x in dom R and x + d in ran R } * * or * * { (x) -> (x + d) | \exists k_i >= 0, \delta_i \in \Delta_i : * d = (\sum_i k_i \delta_i) and * x in dom R and x + d in ran R } * * if "project" is set. * * We first split the map into strongly connected components, perform * the above on each component and then join the results in the correct * order, at each join also taking in the union of both arguments * to allow for paths that do not go through one of the two arguments. */ static __isl_give isl_map *construct_power_components(__isl_take isl_space *dim, __isl_keep isl_map *map, int *exact, int project) { int i, n, c; struct isl_map *path = NULL; struct isl_tc_follows_data data; struct isl_tarjan_graph *g = NULL; int *orig_exact; int local_exact; if (!map) goto error; if (map->n <= 1) return floyd_warshall(dim, map, exact, project); data.list = map->p; data.check_closed = 0; g = isl_tarjan_graph_init(map->ctx, map->n, &basic_map_follows, &data); if (!g) goto error; orig_exact = exact; if (data.check_closed && !exact) exact = &local_exact; c = 0; i = 0; n = map->n; if (project) path = isl_map_empty(isl_map_get_space(map)); else path = isl_map_empty(isl_space_copy(dim)); path = anonymize(path); while (n) { struct isl_map *comp; isl_map *path_comp, *path_comb; comp = isl_map_alloc_space(isl_map_get_space(map), n, 0); while (g->order[i] != -1) { comp = isl_map_add_basic_map(comp, isl_basic_map_copy(map->p[g->order[i]])); --n; ++i; } path_comp = floyd_warshall(isl_space_copy(dim), comp, exact, project); path_comp = anonymize(path_comp); path_comb = isl_map_apply_range(isl_map_copy(path), isl_map_copy(path_comp)); path = isl_map_union(path, path_comp); path = isl_map_union(path, path_comb); isl_map_free(comp); ++i; ++c; } if (c > 1 && data.check_closed && !*exact) { int closed; closed = isl_map_is_transitively_closed(path); if (closed < 0) goto error; if (!closed) { isl_tarjan_graph_free(g); isl_map_free(path); return floyd_warshall(dim, map, orig_exact, project); } } isl_tarjan_graph_free(g); isl_space_free(dim); return path; error: isl_tarjan_graph_free(g); isl_space_free(dim); isl_map_free(path); return NULL; } /* Given a union of basic maps R = \cup_i R_i \subseteq D \times D, * construct a map that is an overapproximation of the map * that takes an element from the space D to another * element from the same space, such that the difference between * them is a strictly positive sum of differences between images * and pre-images in one of the R_i. * The number of differences in the sum is equated to parameter "param". * That is, let * * \Delta_i = { y - x | (x, y) in R_i } * * then the constructed map is an overapproximation of * * { (x) -> (x + d) | \exists k_i >= 0, \delta_i \in \Delta_i : * d = \sum_i k_i \delta_i and k = \sum_i k_i > 0 } * or * * { (x) -> (x + d) | \exists k_i >= 0, \delta_i \in \Delta_i : * d = \sum_i k_i \delta_i and \sum_i k_i > 0 } * * if "project" is set. * * If "project" is not set, then * we construct an extended mapping with an extra coordinate * that indicates the number of steps taken. In particular, * the difference in the last coordinate is equal to the number * of steps taken to move from a domain element to the corresponding * image element(s). */ static __isl_give isl_map *construct_power(__isl_keep isl_map *map, int *exact, int project) { struct isl_map *app = NULL; isl_space *dim = NULL; unsigned d; if (!map) return NULL; dim = isl_map_get_space(map); d = isl_space_dim(dim, isl_dim_in); dim = isl_space_add_dims(dim, isl_dim_in, 1); dim = isl_space_add_dims(dim, isl_dim_out, 1); app = construct_power_components(isl_space_copy(dim), map, exact, project); isl_space_free(dim); return app; } /* Compute the positive powers of "map", or an overapproximation. * If the result is exact, then *exact is set to 1. * * If project is set, then we are actually interested in the transitive * closure, so we can use a more relaxed exactness check. * The lengths of the paths are also projected out instead of being * encoded as the difference between an extra pair of final coordinates. */ static __isl_give isl_map *map_power(__isl_take isl_map *map, int *exact, int project) { struct isl_map *app = NULL; if (exact) *exact = 1; if (!map) return NULL; isl_assert(map->ctx, isl_map_dim(map, isl_dim_in) == isl_map_dim(map, isl_dim_out), goto error); app = construct_power(map, exact, project); isl_map_free(map); return app; error: isl_map_free(map); isl_map_free(app); return NULL; } /* Compute the positive powers of "map", or an overapproximation. * The result maps the exponent to a nested copy of the corresponding power. * If the result is exact, then *exact is set to 1. * map_power constructs an extended relation with the path lengths * encoded as the difference between the final coordinates. * In the final step, this difference is equated to an extra parameter * and made positive. The extra coordinates are subsequently projected out * and the parameter is turned into the domain of the result. */ __isl_give isl_map *isl_map_power(__isl_take isl_map *map, int *exact) { isl_space *target_dim; isl_space *dim; isl_map *diff; unsigned d; unsigned param; if (!map) return NULL; d = isl_map_dim(map, isl_dim_in); param = isl_map_dim(map, isl_dim_param); map = isl_map_compute_divs(map); map = isl_map_coalesce(map); if (isl_map_plain_is_empty(map)) { map = isl_map_from_range(isl_map_wrap(map)); map = isl_map_add_dims(map, isl_dim_in, 1); map = isl_map_set_dim_name(map, isl_dim_in, 0, "k"); return map; } target_dim = isl_map_get_space(map); target_dim = isl_space_from_range(isl_space_wrap(target_dim)); target_dim = isl_space_add_dims(target_dim, isl_dim_in, 1); target_dim = isl_space_set_dim_name(target_dim, isl_dim_in, 0, "k"); map = map_power(map, exact, 0); map = isl_map_add_dims(map, isl_dim_param, 1); dim = isl_map_get_space(map); diff = equate_parameter_to_length(dim, param); map = isl_map_intersect(map, diff); map = isl_map_project_out(map, isl_dim_in, d, 1); map = isl_map_project_out(map, isl_dim_out, d, 1); map = isl_map_from_range(isl_map_wrap(map)); map = isl_map_move_dims(map, isl_dim_in, 0, isl_dim_param, param, 1); map = isl_map_reset_space(map, target_dim); return map; } /* Compute a relation that maps each element in the range of the input * relation to the lengths of all paths composed of edges in the input * relation that end up in the given range element. * The result may be an overapproximation, in which case *exact is set to 0. * The resulting relation is very similar to the power relation. * The difference are that the domain has been projected out, the * range has become the domain and the exponent is the range instead * of a parameter. */ __isl_give isl_map *isl_map_reaching_path_lengths(__isl_take isl_map *map, int *exact) { isl_space *dim; isl_map *diff; unsigned d; unsigned param; if (!map) return NULL; d = isl_map_dim(map, isl_dim_in); param = isl_map_dim(map, isl_dim_param); map = isl_map_compute_divs(map); map = isl_map_coalesce(map); if (isl_map_plain_is_empty(map)) { if (exact) *exact = 1; map = isl_map_project_out(map, isl_dim_out, 0, d); map = isl_map_add_dims(map, isl_dim_out, 1); return map; } map = map_power(map, exact, 0); map = isl_map_add_dims(map, isl_dim_param, 1); dim = isl_map_get_space(map); diff = equate_parameter_to_length(dim, param); map = isl_map_intersect(map, diff); map = isl_map_project_out(map, isl_dim_in, 0, d + 1); map = isl_map_project_out(map, isl_dim_out, d, 1); map = isl_map_reverse(map); map = isl_map_move_dims(map, isl_dim_out, 0, isl_dim_param, param, 1); return map; } /* Check whether equality i of bset is a pure stride constraint * on a single dimensions, i.e., of the form * * v = k e * * with k a constant and e an existentially quantified variable. */ static int is_eq_stride(__isl_keep isl_basic_set *bset, int i) { unsigned nparam; unsigned d; unsigned n_div; int pos1; int pos2; if (!bset) return -1; if (!isl_int_is_zero(bset->eq[i][0])) return 0; nparam = isl_basic_set_dim(bset, isl_dim_param); d = isl_basic_set_dim(bset, isl_dim_set); n_div = isl_basic_set_dim(bset, isl_dim_div); if (isl_seq_first_non_zero(bset->eq[i] + 1, nparam) != -1) return 0; pos1 = isl_seq_first_non_zero(bset->eq[i] + 1 + nparam, d); if (pos1 == -1) return 0; if (isl_seq_first_non_zero(bset->eq[i] + 1 + nparam + pos1 + 1, d - pos1 - 1) != -1) return 0; pos2 = isl_seq_first_non_zero(bset->eq[i] + 1 + nparam + d, n_div); if (pos2 == -1) return 0; if (isl_seq_first_non_zero(bset->eq[i] + 1 + nparam + d + pos2 + 1, n_div - pos2 - 1) != -1) return 0; if (!isl_int_is_one(bset->eq[i][1 + nparam + pos1]) && !isl_int_is_negone(bset->eq[i][1 + nparam + pos1])) return 0; return 1; } /* Given a map, compute the smallest superset of this map that is of the form * * { i -> j : L <= j - i <= U and exists a_p: j_p - i_p = M_p a_p } * * (where p ranges over the (non-parametric) dimensions), * compute the transitive closure of this map, i.e., * * { i -> j : exists k > 0: * k L <= j - i <= k U and exists a: j_p - i_p = M_p a_p } * * and intersect domain and range of this transitive closure with * the given domain and range. * * If with_id is set, then try to include as much of the identity mapping * as possible, by computing * * { i -> j : exists k >= 0: * k L <= j - i <= k U and exists a: j_p - i_p = M_p a_p } * * instead (i.e., allow k = 0). * * In practice, we compute the difference set * * delta = { j - i | i -> j in map }, * * look for stride constraint on the individual dimensions and compute * (constant) lower and upper bounds for each individual dimension, * adding a constraint for each bound not equal to infinity. */ static __isl_give isl_map *box_closure_on_domain(__isl_take isl_map *map, __isl_take isl_set *dom, __isl_take isl_set *ran, int with_id) { int i; int k; unsigned d; unsigned nparam; unsigned total; isl_space *dim; isl_set *delta; isl_map *app = NULL; isl_basic_set *aff = NULL; isl_basic_map *bmap = NULL; isl_vec *obj = NULL; isl_int opt; isl_int_init(opt); delta = isl_map_deltas(isl_map_copy(map)); aff = isl_set_affine_hull(isl_set_copy(delta)); if (!aff) goto error; dim = isl_map_get_space(map); d = isl_space_dim(dim, isl_dim_in); nparam = isl_space_dim(dim, isl_dim_param); total = isl_space_dim(dim, isl_dim_all); bmap = isl_basic_map_alloc_space(dim, aff->n_div + 1, aff->n_div, 2 * d + 1); for (i = 0; i < aff->n_div + 1; ++i) { k = isl_basic_map_alloc_div(bmap); if (k < 0) goto error; isl_int_set_si(bmap->div[k][0], 0); } for (i = 0; i < aff->n_eq; ++i) { if (!is_eq_stride(aff, i)) continue; k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->eq[k], 1 + nparam); isl_seq_cpy(bmap->eq[k] + 1 + nparam + d, aff->eq[i] + 1 + nparam, d); isl_seq_neg(bmap->eq[k] + 1 + nparam, aff->eq[i] + 1 + nparam, d); isl_seq_cpy(bmap->eq[k] + 1 + nparam + 2 * d, aff->eq[i] + 1 + nparam + d, aff->n_div); isl_int_set_si(bmap->eq[k][1 + total + aff->n_div], 0); } obj = isl_vec_alloc(map->ctx, 1 + nparam + d); if (!obj) goto error; isl_seq_clr(obj->el, 1 + nparam + d); for (i = 0; i < d; ++ i) { enum isl_lp_result res; isl_int_set_si(obj->el[1 + nparam + i], 1); res = isl_set_solve_lp(delta, 0, obj->el, map->ctx->one, &opt, NULL, NULL); if (res == isl_lp_error) goto error; if (res == isl_lp_ok) { k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->ineq[k], 1 + nparam + 2 * d + bmap->n_div); isl_int_set_si(bmap->ineq[k][1 + nparam + i], -1); isl_int_set_si(bmap->ineq[k][1 + nparam + d + i], 1); isl_int_neg(bmap->ineq[k][1 + nparam + 2 * d + aff->n_div], opt); } res = isl_set_solve_lp(delta, 1, obj->el, map->ctx->one, &opt, NULL, NULL); if (res == isl_lp_error) goto error; if (res == isl_lp_ok) { k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->ineq[k], 1 + nparam + 2 * d + bmap->n_div); isl_int_set_si(bmap->ineq[k][1 + nparam + i], 1); isl_int_set_si(bmap->ineq[k][1 + nparam + d + i], -1); isl_int_set(bmap->ineq[k][1 + nparam + 2 * d + aff->n_div], opt); } isl_int_set_si(obj->el[1 + nparam + i], 0); } k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->ineq[k], 1 + nparam + 2 * d + bmap->n_div); if (!with_id) isl_int_set_si(bmap->ineq[k][0], -1); isl_int_set_si(bmap->ineq[k][1 + nparam + 2 * d + aff->n_div], 1); app = isl_map_from_domain_and_range(dom, ran); isl_vec_free(obj); isl_basic_set_free(aff); isl_map_free(map); bmap = isl_basic_map_finalize(bmap); isl_set_free(delta); isl_int_clear(opt); map = isl_map_from_basic_map(bmap); map = isl_map_intersect(map, app); return map; error: isl_vec_free(obj); isl_basic_map_free(bmap); isl_basic_set_free(aff); isl_set_free(dom); isl_set_free(ran); isl_map_free(map); isl_set_free(delta); isl_int_clear(opt); return NULL; } /* Given a map, compute the smallest superset of this map that is of the form * * { i -> j : L <= j - i <= U and exists a_p: j_p - i_p = M_p a_p } * * (where p ranges over the (non-parametric) dimensions), * compute the transitive closure of this map, i.e., * * { i -> j : exists k > 0: * k L <= j - i <= k U and exists a: j_p - i_p = M_p a_p } * * and intersect domain and range of this transitive closure with * domain and range of the original map. */ static __isl_give isl_map *box_closure(__isl_take isl_map *map) { isl_set *domain; isl_set *range; domain = isl_map_domain(isl_map_copy(map)); domain = isl_set_coalesce(domain); range = isl_map_range(isl_map_copy(map)); range = isl_set_coalesce(range); return box_closure_on_domain(map, domain, range, 0); } /* Given a map, compute the smallest superset of this map that is of the form * * { i -> j : L <= j - i <= U and exists a_p: j_p - i_p = M_p a_p } * * (where p ranges over the (non-parametric) dimensions), * compute the transitive and partially reflexive closure of this map, i.e., * * { i -> j : exists k >= 0: * k L <= j - i <= k U and exists a: j_p - i_p = M_p a_p } * * and intersect domain and range of this transitive closure with * the given domain. */ static __isl_give isl_map *box_closure_with_identity(__isl_take isl_map *map, __isl_take isl_set *dom) { return box_closure_on_domain(map, dom, isl_set_copy(dom), 1); } /* Check whether app is the transitive closure of map. * In particular, check that app is acyclic and, if so, * check that * * app \subset (map \cup (map \circ app)) */ static int check_exactness_omega(__isl_keep isl_map *map, __isl_keep isl_map *app) { isl_set *delta; int i; int is_empty, is_exact; unsigned d; isl_map *test; delta = isl_map_deltas(isl_map_copy(app)); d = isl_set_dim(delta, isl_dim_set); for (i = 0; i < d; ++i) delta = isl_set_fix_si(delta, isl_dim_set, i, 0); is_empty = isl_set_is_empty(delta); isl_set_free(delta); if (is_empty < 0) return -1; if (!is_empty) return 0; test = isl_map_apply_range(isl_map_copy(app), isl_map_copy(map)); test = isl_map_union(test, isl_map_copy(map)); is_exact = isl_map_is_subset(app, test); isl_map_free(test); return is_exact; } /* Check if basic map M_i can be combined with all the other * basic maps such that * * (\cup_j M_j)^+ * * can be computed as * * M_i \cup (\cup_{j \ne i} M_i^* \circ M_j \circ M_i^*)^+ * * In particular, check if we can compute a compact representation * of * * M_i^* \circ M_j \circ M_i^* * * for each j != i. * Let M_i^? be an extension of M_i^+ that allows paths * of length zero, i.e., the result of box_closure(., 1). * The criterion, as proposed by Kelly et al., is that * id = M_i^? - M_i^+ can be represented as a basic map * and that * * id \circ M_j \circ id = M_j * * for each j != i. * * If this function returns 1, then tc and qc are set to * M_i^+ and M_i^?, respectively. */ static int can_be_split_off(__isl_keep isl_map *map, int i, __isl_give isl_map **tc, __isl_give isl_map **qc) { isl_map *map_i, *id = NULL; int j = -1; isl_set *C; *tc = NULL; *qc = NULL; C = isl_set_union(isl_map_domain(isl_map_copy(map)), isl_map_range(isl_map_copy(map))); C = isl_set_from_basic_set(isl_set_simple_hull(C)); if (!C) goto error; map_i = isl_map_from_basic_map(isl_basic_map_copy(map->p[i])); *tc = box_closure(isl_map_copy(map_i)); *qc = box_closure_with_identity(map_i, C); id = isl_map_subtract(isl_map_copy(*qc), isl_map_copy(*tc)); if (!id || !*qc) goto error; if (id->n != 1 || (*qc)->n != 1) goto done; for (j = 0; j < map->n; ++j) { isl_map *map_j, *test; int is_ok; if (i == j) continue; map_j = isl_map_from_basic_map( isl_basic_map_copy(map->p[j])); test = isl_map_apply_range(isl_map_copy(id), isl_map_copy(map_j)); test = isl_map_apply_range(test, isl_map_copy(id)); is_ok = isl_map_is_equal(test, map_j); isl_map_free(map_j); isl_map_free(test); if (is_ok < 0) goto error; if (!is_ok) break; } done: isl_map_free(id); if (j == map->n) return 1; isl_map_free(*qc); isl_map_free(*tc); *qc = NULL; *tc = NULL; return 0; error: isl_map_free(id); isl_map_free(*qc); isl_map_free(*tc); *qc = NULL; *tc = NULL; return -1; } static __isl_give isl_map *box_closure_with_check(__isl_take isl_map *map, int *exact) { isl_map *app; app = box_closure(isl_map_copy(map)); if (exact) *exact = check_exactness_omega(map, app); isl_map_free(map); return app; } /* Compute an overapproximation of the transitive closure of "map" * using a variation of the algorithm from * "Transitive Closure of Infinite Graphs and its Applications" * by Kelly et al. * * We first check whether we can can split of any basic map M_i and * compute * * (\cup_j M_j)^+ * * as * * M_i \cup (\cup_{j \ne i} M_i^* \circ M_j \circ M_i^*)^+ * * using a recursive call on the remaining map. * * If not, we simply call box_closure on the whole map. */ static __isl_give isl_map *transitive_closure_omega(__isl_take isl_map *map, int *exact) { int i, j; int exact_i; isl_map *app; if (!map) return NULL; if (map->n == 1) return box_closure_with_check(map, exact); for (i = 0; i < map->n; ++i) { int ok; isl_map *qc, *tc; ok = can_be_split_off(map, i, &tc, &qc); if (ok < 0) goto error; if (!ok) continue; app = isl_map_alloc_space(isl_map_get_space(map), map->n - 1, 0); for (j = 0; j < map->n; ++j) { if (j == i) continue; app = isl_map_add_basic_map(app, isl_basic_map_copy(map->p[j])); } app = isl_map_apply_range(isl_map_copy(qc), app); app = isl_map_apply_range(app, qc); app = isl_map_union(tc, transitive_closure_omega(app, NULL)); exact_i = check_exactness_omega(map, app); if (exact_i == 1) { if (exact) *exact = exact_i; isl_map_free(map); return app; } isl_map_free(app); if (exact_i < 0) goto error; } return box_closure_with_check(map, exact); error: isl_map_free(map); return NULL; } /* Compute the transitive closure of "map", or an overapproximation. * If the result is exact, then *exact is set to 1. * Simply use map_power to compute the powers of map, but tell * it to project out the lengths of the paths instead of equating * the length to a parameter. */ __isl_give isl_map *isl_map_transitive_closure(__isl_take isl_map *map, int *exact) { isl_space *target_dim; int closed; if (!map) goto error; if (map->ctx->opt->closure == ISL_CLOSURE_BOX) return transitive_closure_omega(map, exact); map = isl_map_compute_divs(map); map = isl_map_coalesce(map); closed = isl_map_is_transitively_closed(map); if (closed < 0) goto error; if (closed) { if (exact) *exact = 1; return map; } target_dim = isl_map_get_space(map); map = map_power(map, exact, 1); map = isl_map_reset_space(map, target_dim); return map; error: isl_map_free(map); return NULL; } static int inc_count(__isl_take isl_map *map, void *user) { int *n = user; *n += map->n; isl_map_free(map); return 0; } static int collect_basic_map(__isl_take isl_map *map, void *user) { int i; isl_basic_map ***next = user; for (i = 0; i < map->n; ++i) { **next = isl_basic_map_copy(map->p[i]); if (!**next) goto error; (*next)++; } isl_map_free(map); return 0; error: isl_map_free(map); return -1; } /* Perform Floyd-Warshall on the given list of basic relations. * The basic relations may live in different dimensions, * but basic relations that get assigned to the diagonal of the * grid have domains and ranges of the same dimension and so * the standard algorithm can be used because the nested transitive * closures are only applied to diagonal elements and because all * compositions are peformed on relations with compatible domains and ranges. */ static __isl_give isl_union_map *union_floyd_warshall_on_list(isl_ctx *ctx, __isl_keep isl_basic_map **list, int n, int *exact) { int i, j, k; int n_group; int *group = NULL; isl_set **set = NULL; isl_map ***grid = NULL; isl_union_map *app; group = setup_groups(ctx, list, n, &set, &n_group); if (!group) goto error; grid = isl_calloc_array(ctx, isl_map **, n_group); if (!grid) goto error; for (i = 0; i < n_group; ++i) { grid[i] = isl_calloc_array(ctx, isl_map *, n_group); if (!grid[i]) goto error; for (j = 0; j < n_group; ++j) { isl_space *dim1, *dim2, *dim; dim1 = isl_space_reverse(isl_set_get_space(set[i])); dim2 = isl_set_get_space(set[j]); dim = isl_space_join(dim1, dim2); grid[i][j] = isl_map_empty(dim); } } for (k = 0; k < n; ++k) { i = group[2 * k]; j = group[2 * k + 1]; grid[i][j] = isl_map_union(grid[i][j], isl_map_from_basic_map( isl_basic_map_copy(list[k]))); } floyd_warshall_iterate(grid, n_group, exact); app = isl_union_map_empty(isl_map_get_space(grid[0][0])); for (i = 0; i < n_group; ++i) { for (j = 0; j < n_group; ++j) app = isl_union_map_add_map(app, grid[i][j]); free(grid[i]); } free(grid); for (i = 0; i < 2 * n; ++i) isl_set_free(set[i]); free(set); free(group); return app; error: if (grid) for (i = 0; i < n_group; ++i) { if (!grid[i]) continue; for (j = 0; j < n_group; ++j) isl_map_free(grid[i][j]); free(grid[i]); } free(grid); if (set) { for (i = 0; i < 2 * n; ++i) isl_set_free(set[i]); free(set); } free(group); return NULL; } /* Perform Floyd-Warshall on the given union relation. * The implementation is very similar to that for non-unions. * The main difference is that it is applied unconditionally. * We first extract a list of basic maps from the union map * and then perform the algorithm on this list. */ static __isl_give isl_union_map *union_floyd_warshall( __isl_take isl_union_map *umap, int *exact) { int i, n; isl_ctx *ctx; isl_basic_map **list = NULL; isl_basic_map **next; isl_union_map *res; n = 0; if (isl_union_map_foreach_map(umap, inc_count, &n) < 0) goto error; ctx = isl_union_map_get_ctx(umap); list = isl_calloc_array(ctx, isl_basic_map *, n); if (!list) goto error; next = list; if (isl_union_map_foreach_map(umap, collect_basic_map, &next) < 0) goto error; res = union_floyd_warshall_on_list(ctx, list, n, exact); if (list) { for (i = 0; i < n; ++i) isl_basic_map_free(list[i]); free(list); } isl_union_map_free(umap); return res; error: if (list) { for (i = 0; i < n; ++i) isl_basic_map_free(list[i]); free(list); } isl_union_map_free(umap); return NULL; } /* Decompose the give union relation into strongly connected components. * The implementation is essentially the same as that of * construct_power_components with the major difference that all * operations are performed on union maps. */ static __isl_give isl_union_map *union_components( __isl_take isl_union_map *umap, int *exact) { int i; int n; isl_ctx *ctx; isl_basic_map **list = NULL; isl_basic_map **next; isl_union_map *path = NULL; struct isl_tc_follows_data data; struct isl_tarjan_graph *g = NULL; int c, l; int recheck = 0; n = 0; if (isl_union_map_foreach_map(umap, inc_count, &n) < 0) goto error; if (n == 0) return umap; if (n <= 1) return union_floyd_warshall(umap, exact); ctx = isl_union_map_get_ctx(umap); list = isl_calloc_array(ctx, isl_basic_map *, n); if (!list) goto error; next = list; if (isl_union_map_foreach_map(umap, collect_basic_map, &next) < 0) goto error; data.list = list; data.check_closed = 0; g = isl_tarjan_graph_init(ctx, n, &basic_map_follows, &data); if (!g) goto error; c = 0; i = 0; l = n; path = isl_union_map_empty(isl_union_map_get_space(umap)); while (l) { isl_union_map *comp; isl_union_map *path_comp, *path_comb; comp = isl_union_map_empty(isl_union_map_get_space(umap)); while (g->order[i] != -1) { comp = isl_union_map_add_map(comp, isl_map_from_basic_map( isl_basic_map_copy(list[g->order[i]]))); --l; ++i; } path_comp = union_floyd_warshall(comp, exact); path_comb = isl_union_map_apply_range(isl_union_map_copy(path), isl_union_map_copy(path_comp)); path = isl_union_map_union(path, path_comp); path = isl_union_map_union(path, path_comb); ++i; ++c; } if (c > 1 && data.check_closed && !*exact) { int closed; closed = isl_union_map_is_transitively_closed(path); if (closed < 0) goto error; recheck = !closed; } isl_tarjan_graph_free(g); for (i = 0; i < n; ++i) isl_basic_map_free(list[i]); free(list); if (recheck) { isl_union_map_free(path); return union_floyd_warshall(umap, exact); } isl_union_map_free(umap); return path; error: isl_tarjan_graph_free(g); if (list) { for (i = 0; i < n; ++i) isl_basic_map_free(list[i]); free(list); } isl_union_map_free(umap); isl_union_map_free(path); return NULL; } /* Compute the transitive closure of "umap", or an overapproximation. * If the result is exact, then *exact is set to 1. */ __isl_give isl_union_map *isl_union_map_transitive_closure( __isl_take isl_union_map *umap, int *exact) { int closed; if (!umap) return NULL; if (exact) *exact = 1; umap = isl_union_map_compute_divs(umap); umap = isl_union_map_coalesce(umap); closed = isl_union_map_is_transitively_closed(umap); if (closed < 0) goto error; if (closed) return umap; umap = union_components(umap, exact); return umap; error: isl_union_map_free(umap); return NULL; } struct isl_union_power { isl_union_map *pow; int *exact; }; static int power(__isl_take isl_map *map, void *user) { struct isl_union_power *up = user; map = isl_map_power(map, up->exact); up->pow = isl_union_map_from_map(map); return -1; } /* Construct a map [x] -> [x+1], with parameters prescribed by "dim". */ static __isl_give isl_union_map *increment(__isl_take isl_space *dim) { int k; isl_basic_map *bmap; dim = isl_space_add_dims(dim, isl_dim_in, 1); dim = isl_space_add_dims(dim, isl_dim_out, 1); bmap = isl_basic_map_alloc_space(dim, 0, 1, 0); k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->eq[k], isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->eq[k][0], 1); isl_int_set_si(bmap->eq[k][isl_basic_map_offset(bmap, isl_dim_in)], 1); isl_int_set_si(bmap->eq[k][isl_basic_map_offset(bmap, isl_dim_out)], -1); return isl_union_map_from_map(isl_map_from_basic_map(bmap)); error: isl_basic_map_free(bmap); return NULL; } /* Construct a map [[x]->[y]] -> [y-x], with parameters prescribed by "dim". */ static __isl_give isl_union_map *deltas_map(__isl_take isl_space *dim) { isl_basic_map *bmap; dim = isl_space_add_dims(dim, isl_dim_in, 1); dim = isl_space_add_dims(dim, isl_dim_out, 1); bmap = isl_basic_map_universe(dim); bmap = isl_basic_map_deltas_map(bmap); return isl_union_map_from_map(isl_map_from_basic_map(bmap)); } /* Compute the positive powers of "map", or an overapproximation. * The result maps the exponent to a nested copy of the corresponding power. * If the result is exact, then *exact is set to 1. */ __isl_give isl_union_map *isl_union_map_power(__isl_take isl_union_map *umap, int *exact) { int n; isl_union_map *inc; isl_union_map *dm; if (!umap) return NULL; n = isl_union_map_n_map(umap); if (n == 0) return umap; if (n == 1) { struct isl_union_power up = { NULL, exact }; isl_union_map_foreach_map(umap, &power, &up); isl_union_map_free(umap); return up.pow; } inc = increment(isl_union_map_get_space(umap)); umap = isl_union_map_product(inc, umap); umap = isl_union_map_transitive_closure(umap, exact); umap = isl_union_map_zip(umap); dm = deltas_map(isl_union_map_get_space(umap)); umap = isl_union_map_apply_domain(umap, dm); return umap; } #undef TYPE #define TYPE isl_map #include "isl_power_templ.c" #undef TYPE #define TYPE isl_union_map #include "isl_power_templ.c" cloog-0.18.2/isl/isl_point.c0000664000175000017500000003163412254313240012566 00000000000000#include #include #include #include #include #include #include #include isl_ctx *isl_point_get_ctx(__isl_keep isl_point *pnt) { return pnt ? isl_space_get_ctx(pnt->dim) : NULL; } __isl_give isl_space *isl_point_get_space(__isl_keep isl_point *pnt) { return pnt ? isl_space_copy(pnt->dim) : NULL; } __isl_give isl_point *isl_point_alloc(__isl_take isl_space *dim, __isl_take isl_vec *vec) { struct isl_point *pnt; if (!dim || !vec) goto error; if (vec->size > 1 + isl_space_dim(dim, isl_dim_all)) { vec = isl_vec_cow(vec); if (!vec) goto error; vec->size = 1 + isl_space_dim(dim, isl_dim_all); } pnt = isl_alloc_type(dim->ctx, struct isl_point); if (!pnt) goto error; pnt->ref = 1; pnt->dim = dim; pnt->vec = vec; return pnt; error: isl_space_free(dim); isl_vec_free(vec); return NULL; } __isl_give isl_point *isl_point_zero(__isl_take isl_space *dim) { isl_vec *vec; if (!dim) return NULL; vec = isl_vec_alloc(dim->ctx, 1 + isl_space_dim(dim, isl_dim_all)); if (!vec) goto error; isl_int_set_si(vec->el[0], 1); isl_seq_clr(vec->el + 1, vec->size - 1); return isl_point_alloc(dim, vec); error: isl_space_free(dim); return NULL; } __isl_give isl_point *isl_point_dup(__isl_keep isl_point *pnt) { struct isl_point *pnt2; if (!pnt) return NULL; pnt2 = isl_point_alloc(isl_space_copy(pnt->dim), isl_vec_copy(pnt->vec)); return pnt2; } __isl_give isl_point *isl_point_cow(__isl_take isl_point *pnt) { struct isl_point *pnt2; if (!pnt) return NULL; if (pnt->ref == 1) return pnt; pnt2 = isl_point_dup(pnt); isl_point_free(pnt); return pnt2; } __isl_give isl_point *isl_point_copy(__isl_keep isl_point *pnt) { if (!pnt) return NULL; pnt->ref++; return pnt; } void isl_point_free(__isl_take isl_point *pnt) { if (!pnt) return; if (--pnt->ref > 0) return; isl_space_free(pnt->dim); isl_vec_free(pnt->vec); free(pnt); } __isl_give isl_point *isl_point_void(__isl_take isl_space *dim) { if (!dim) return NULL; return isl_point_alloc(dim, isl_vec_alloc(dim->ctx, 0)); } int isl_point_is_void(__isl_keep isl_point *pnt) { if (!pnt) return -1; return pnt->vec->size == 0; } int isl_point_get_coordinate(__isl_keep isl_point *pnt, enum isl_dim_type type, int pos, isl_int *v) { if (!pnt || isl_point_is_void(pnt)) return -1; if (pos < 0 || pos >= isl_space_dim(pnt->dim, type)) isl_die(isl_point_get_ctx(pnt), isl_error_invalid, "position out of bounds", return -1); if (type == isl_dim_set) pos += isl_space_dim(pnt->dim, isl_dim_param); isl_int_set(*v, pnt->vec->el[1 + pos]); return 0; } /* Return the value of coordinate "pos" of type "type" of "pnt". */ __isl_give isl_val *isl_point_get_coordinate_val(__isl_keep isl_point *pnt, enum isl_dim_type type, int pos) { isl_ctx *ctx; isl_val *v; if (!pnt) return NULL; ctx = isl_point_get_ctx(pnt); if (isl_point_is_void(pnt)) isl_die(ctx, isl_error_invalid, "void point does not have coordinates", return NULL); if (pos < 0 || pos >= isl_space_dim(pnt->dim, type)) isl_die(ctx, isl_error_invalid, "position out of bounds", return NULL); if (type == isl_dim_set) pos += isl_space_dim(pnt->dim, isl_dim_param); v = isl_val_rat_from_isl_int(ctx, pnt->vec->el[1 + pos], pnt->vec->el[0]); return isl_val_normalize(v); } __isl_give isl_point *isl_point_set_coordinate(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, isl_int v) { if (!pnt || isl_point_is_void(pnt)) return pnt; pnt = isl_point_cow(pnt); if (!pnt) return NULL; pnt->vec = isl_vec_cow(pnt->vec); if (!pnt->vec) goto error; if (type == isl_dim_set) pos += isl_space_dim(pnt->dim, isl_dim_param); isl_int_set(pnt->vec->el[1 + pos], v); return pnt; error: isl_point_free(pnt); return NULL; } /* Replace coordinate "pos" of type "type" of "pnt" by "v". */ __isl_give isl_point *isl_point_set_coordinate_val(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, __isl_take isl_val *v) { if (!pnt || !v) goto error; if (isl_point_is_void(pnt)) isl_die(isl_point_get_ctx(pnt), isl_error_invalid, "void point does not have coordinates", goto error); if (pos < 0 || pos >= isl_space_dim(pnt->dim, type)) isl_die(isl_point_get_ctx(pnt), isl_error_invalid, "position out of bounds", goto error); if (!isl_val_is_rat(v)) isl_die(isl_point_get_ctx(pnt), isl_error_invalid, "expecting rational value", goto error); if (isl_int_eq(pnt->vec->el[1 + pos], v->n) && isl_int_eq(pnt->vec->el[0], v->d)) { isl_val_free(v); return pnt; } pnt = isl_point_cow(pnt); if (!pnt) goto error; pnt->vec = isl_vec_cow(pnt->vec); if (!pnt->vec) goto error; if (isl_int_eq(pnt->vec->el[0], v->d)) { isl_int_set(pnt->vec->el[1 + pos], v->n); } else if (isl_int_is_one(v->d)) { isl_int_mul(pnt->vec->el[1 + pos], pnt->vec->el[0], v->n); } else { isl_seq_scale(pnt->vec->el + 1, pnt->vec->el + 1, v->d, pnt->vec->size - 1); isl_int_mul(pnt->vec->el[1 + pos], pnt->vec->el[0], v->n); isl_int_mul(pnt->vec->el[0], pnt->vec->el[0], v->d); pnt->vec = isl_vec_normalize(pnt->vec); if (!pnt->vec) goto error; } isl_val_free(v); return pnt; error: isl_val_free(v); isl_point_free(pnt); return NULL; } __isl_give isl_point *isl_point_add_ui(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, unsigned val) { if (!pnt || isl_point_is_void(pnt)) return pnt; pnt = isl_point_cow(pnt); if (!pnt) return NULL; pnt->vec = isl_vec_cow(pnt->vec); if (!pnt->vec) goto error; if (type == isl_dim_set) pos += isl_space_dim(pnt->dim, isl_dim_param); isl_int_add_ui(pnt->vec->el[1 + pos], pnt->vec->el[1 + pos], val); return pnt; error: isl_point_free(pnt); return NULL; } __isl_give isl_point *isl_point_sub_ui(__isl_take isl_point *pnt, enum isl_dim_type type, int pos, unsigned val) { if (!pnt || isl_point_is_void(pnt)) return pnt; pnt = isl_point_cow(pnt); if (!pnt) return NULL; pnt->vec = isl_vec_cow(pnt->vec); if (!pnt->vec) goto error; if (type == isl_dim_set) pos += isl_space_dim(pnt->dim, isl_dim_param); isl_int_sub_ui(pnt->vec->el[1 + pos], pnt->vec->el[1 + pos], val); return pnt; error: isl_point_free(pnt); return NULL; } struct isl_foreach_point { struct isl_scan_callback callback; int (*fn)(__isl_take isl_point *pnt, void *user); void *user; isl_space *dim; }; static int foreach_point(struct isl_scan_callback *cb, __isl_take isl_vec *sample) { struct isl_foreach_point *fp = (struct isl_foreach_point *)cb; isl_point *pnt; pnt = isl_point_alloc(isl_space_copy(fp->dim), sample); return fp->fn(pnt, fp->user); } int isl_set_foreach_point(__isl_keep isl_set *set, int (*fn)(__isl_take isl_point *pnt, void *user), void *user) { struct isl_foreach_point fp = { { &foreach_point }, fn, user }; int i; if (!set) return -1; fp.dim = isl_set_get_space(set); if (!fp.dim) return -1; set = isl_set_copy(set); set = isl_set_cow(set); set = isl_set_make_disjoint(set); set = isl_set_compute_divs(set); if (!set) goto error; for (i = 0; i < set->n; ++i) if (isl_basic_set_scan(isl_basic_set_copy(set->p[i]), &fp.callback) < 0) goto error; isl_set_free(set); isl_space_free(fp.dim); return 0; error: isl_set_free(set); isl_space_free(fp.dim); return -1; } /* Return 1 if "bmap" contains the point "point". * "bmap" is assumed to have known divs. * The point is first extended with the divs and then passed * to basic_map_contains. */ int isl_basic_map_contains_point(__isl_keep isl_basic_map *bmap, __isl_keep isl_point *point) { int i; struct isl_vec *vec; unsigned dim; int contains; if (!bmap || !point) return -1; isl_assert(bmap->ctx, isl_space_is_equal(bmap->dim, point->dim), return -1); if (bmap->n_div == 0) return isl_basic_map_contains(bmap, point->vec); dim = isl_basic_map_total_dim(bmap) - bmap->n_div; vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div); if (!vec) return -1; isl_seq_cpy(vec->el, point->vec->el, point->vec->size); for (i = 0; i < bmap->n_div; ++i) { isl_seq_inner_product(bmap->div[i] + 1, vec->el, 1 + dim + i, &vec->el[1+dim+i]); isl_int_fdiv_q(vec->el[1+dim+i], vec->el[1+dim+i], bmap->div[i][0]); } contains = isl_basic_map_contains(bmap, vec); isl_vec_free(vec); return contains; } int isl_map_contains_point(__isl_keep isl_map *map, __isl_keep isl_point *point) { int i; int found = 0; if (!map || !point) return -1; map = isl_map_copy(map); map = isl_map_compute_divs(map); if (!map) return -1; for (i = 0; i < map->n; ++i) { found = isl_basic_map_contains_point(map->p[i], point); if (found < 0) goto error; if (found) break; } isl_map_free(map); return found; error: isl_map_free(map); return -1; } int isl_set_contains_point(__isl_keep isl_set *set, __isl_keep isl_point *point) { return isl_map_contains_point((isl_map *)set, point); } __isl_give isl_basic_set *isl_basic_set_from_point(__isl_take isl_point *pnt) { isl_basic_set *bset; isl_basic_set *model; model = isl_basic_set_empty(isl_space_copy(pnt->dim)); bset = isl_basic_set_from_vec(isl_vec_copy(pnt->vec)); bset = isl_basic_set_from_underlying_set(bset, model); isl_point_free(pnt); return bset; } __isl_give isl_set *isl_set_from_point(__isl_take isl_point *pnt) { isl_basic_set *bset; bset = isl_basic_set_from_point(pnt); return isl_set_from_basic_set(bset); } __isl_give isl_basic_set *isl_basic_set_box_from_points( __isl_take isl_point *pnt1, __isl_take isl_point *pnt2) { isl_basic_set *bset; unsigned total; int i; int k; isl_int t; isl_int_init(t); if (!pnt1 || !pnt2) goto error; isl_assert(pnt1->dim->ctx, isl_space_is_equal(pnt1->dim, pnt2->dim), goto error); if (isl_point_is_void(pnt1) && isl_point_is_void(pnt2)) { isl_space *dim = isl_space_copy(pnt1->dim); isl_point_free(pnt1); isl_point_free(pnt2); isl_int_clear(t); return isl_basic_set_empty(dim); } if (isl_point_is_void(pnt1)) { isl_point_free(pnt1); isl_int_clear(t); return isl_basic_set_from_point(pnt2); } if (isl_point_is_void(pnt2)) { isl_point_free(pnt2); isl_int_clear(t); return isl_basic_set_from_point(pnt1); } total = isl_space_dim(pnt1->dim, isl_dim_all); bset = isl_basic_set_alloc_space(isl_space_copy(pnt1->dim), 0, 0, 2 * total); for (i = 0; i < total; ++i) { isl_int_mul(t, pnt1->vec->el[1 + i], pnt2->vec->el[0]); isl_int_submul(t, pnt2->vec->el[1 + i], pnt1->vec->el[0]); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_clr(bset->ineq[k] + 1, total); if (isl_int_is_pos(t)) { isl_int_set_si(bset->ineq[k][1 + i], -1); isl_int_set(bset->ineq[k][0], pnt1->vec->el[1 + i]); } else { isl_int_set_si(bset->ineq[k][1 + i], 1); isl_int_neg(bset->ineq[k][0], pnt1->vec->el[1 + i]); } isl_int_fdiv_q(bset->ineq[k][0], bset->ineq[k][0], pnt1->vec->el[0]); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_clr(bset->ineq[k] + 1, total); if (isl_int_is_pos(t)) { isl_int_set_si(bset->ineq[k][1 + i], 1); isl_int_neg(bset->ineq[k][0], pnt2->vec->el[1 + i]); } else { isl_int_set_si(bset->ineq[k][1 + i], -1); isl_int_set(bset->ineq[k][0], pnt2->vec->el[1 + i]); } isl_int_fdiv_q(bset->ineq[k][0], bset->ineq[k][0], pnt2->vec->el[0]); } bset = isl_basic_set_finalize(bset); isl_point_free(pnt1); isl_point_free(pnt2); isl_int_clear(t); return bset; error: isl_point_free(pnt1); isl_point_free(pnt2); isl_int_clear(t); return NULL; } __isl_give isl_set *isl_set_box_from_points(__isl_take isl_point *pnt1, __isl_take isl_point *pnt2) { isl_basic_set *bset; bset = isl_basic_set_box_from_points(pnt1, pnt2); return isl_set_from_basic_set(bset); } __isl_give isl_printer *isl_printer_print_point( __isl_take isl_printer *p, __isl_keep isl_point *pnt) { int i; unsigned nparam; unsigned dim; if (!pnt) return p; if (isl_point_is_void(pnt)) { p = isl_printer_print_str(p, "void"); return p; } nparam = isl_space_dim(pnt->dim, isl_dim_param); dim = isl_space_dim(pnt->dim, isl_dim_set); if (nparam > 0) { p = isl_printer_print_str(p, "["); for (i = 0; i < nparam; ++i) { const char *name; if (i) p = isl_printer_print_str(p, ", "); name = isl_space_get_dim_name(pnt->dim, isl_dim_param, i); if (name) { p = isl_printer_print_str(p, name); p = isl_printer_print_str(p, " = "); } p = isl_printer_print_isl_int(p, pnt->vec->el[1 + i]); if (!isl_int_is_one(pnt->vec->el[0])) { p = isl_printer_print_str(p, "/"); p = isl_printer_print_isl_int(p, pnt->vec->el[0]); } } p = isl_printer_print_str(p, "]"); p = isl_printer_print_str(p, " -> "); } p = isl_printer_print_str(p, "["); for (i = 0; i < dim; ++i) { if (i) p = isl_printer_print_str(p, ", "); p = isl_printer_print_isl_int(p, pnt->vec->el[1 + nparam + i]); if (!isl_int_is_one(pnt->vec->el[0])) { p = isl_printer_print_str(p, "/"); p = isl_printer_print_isl_int(p, pnt->vec->el[0]); } } p = isl_printer_print_str(p, "]"); return p; } cloog-0.18.2/isl/isl_bound.h0000664000175000017500000000047612254313240012551 00000000000000#ifndef ISL_BOUND_H #define ISL_BOUND_H #include struct isl_bound { /* input */ int check_tight; int wrapping; enum isl_fold type; isl_space *dim; isl_basic_set *bset; isl_qpolynomial_fold *fold; /* output */ isl_pw_qpolynomial_fold *pwf; isl_pw_qpolynomial_fold *pwf_tight; }; #endif cloog-0.18.2/isl/isl_bound.c0000664000175000017500000002114312254313240012536 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #include #include #include #include #include #include /* Compute a bound on the polynomial defined over the parametric polytope * using either range propagation or bernstein expansion and * store the result in bound->pwf and bound->pwf_tight. * Since bernstein expansion requires bounded domains, we apply * range propagation on unbounded domains. Otherwise, we respect the choice * of the user. */ static int compressed_guarded_poly_bound(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, void *user) { struct isl_bound *bound = (struct isl_bound *)user; int bounded; if (!bset || !poly) goto error; if (bset->ctx->opt->bound == ISL_BOUND_RANGE) return isl_qpolynomial_bound_on_domain_range(bset, poly, bound); bounded = isl_basic_set_is_bounded(bset); if (bounded < 0) goto error; if (bounded) return isl_qpolynomial_bound_on_domain_bernstein(bset, poly, bound); else return isl_qpolynomial_bound_on_domain_range(bset, poly, bound); error: isl_basic_set_free(bset); isl_qpolynomial_free(poly); return -1; } static int unwrapped_guarded_poly_bound(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, void *user) { struct isl_bound *bound = (struct isl_bound *)user; isl_pw_qpolynomial_fold *top_pwf; isl_pw_qpolynomial_fold *top_pwf_tight; isl_space *dim; isl_morph *morph; int r; bset = isl_basic_set_detect_equalities(bset); if (!bset) goto error; if (bset->n_eq == 0) return compressed_guarded_poly_bound(bset, poly, user); morph = isl_basic_set_full_compression(bset); bset = isl_morph_basic_set(isl_morph_copy(morph), bset); poly = isl_qpolynomial_morph_domain(poly, isl_morph_copy(morph)); dim = isl_morph_get_ran_space(morph); dim = isl_space_params(dim); top_pwf = bound->pwf; top_pwf_tight = bound->pwf_tight; dim = isl_space_from_domain(dim); dim = isl_space_add_dims(dim, isl_dim_out, 1); bound->pwf = isl_pw_qpolynomial_fold_zero(isl_space_copy(dim), bound->type); bound->pwf_tight = isl_pw_qpolynomial_fold_zero(dim, bound->type); r = compressed_guarded_poly_bound(bset, poly, user); morph = isl_morph_dom_params(morph); morph = isl_morph_ran_params(morph); morph = isl_morph_inverse(morph); bound->pwf = isl_pw_qpolynomial_fold_morph_domain(bound->pwf, isl_morph_copy(morph)); bound->pwf_tight = isl_pw_qpolynomial_fold_morph_domain( bound->pwf_tight, morph); bound->pwf = isl_pw_qpolynomial_fold_fold(top_pwf, bound->pwf); bound->pwf_tight = isl_pw_qpolynomial_fold_fold(top_pwf_tight, bound->pwf_tight); return r; error: isl_basic_set_free(bset); isl_qpolynomial_free(poly); return -1; } static int guarded_poly_bound(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, void *user) { struct isl_bound *bound = (struct isl_bound *)user; isl_space *dim; isl_pw_qpolynomial_fold *top_pwf; isl_pw_qpolynomial_fold *top_pwf_tight; int nparam; int n_in; int r; if (!bound->wrapping) return unwrapped_guarded_poly_bound(bset, poly, user); nparam = isl_space_dim(bound->dim, isl_dim_param); n_in = isl_space_dim(bound->dim, isl_dim_in); bset = isl_basic_set_move_dims(bset, isl_dim_param, nparam, isl_dim_set, 0, n_in); poly = isl_qpolynomial_move_dims(poly, isl_dim_param, nparam, isl_dim_in, 0, n_in); dim = isl_basic_set_get_space(bset); dim = isl_space_params(dim); top_pwf = bound->pwf; top_pwf_tight = bound->pwf_tight; dim = isl_space_from_domain(dim); dim = isl_space_add_dims(dim, isl_dim_out, 1); bound->pwf = isl_pw_qpolynomial_fold_zero(isl_space_copy(dim), bound->type); bound->pwf_tight = isl_pw_qpolynomial_fold_zero(dim, bound->type); r = unwrapped_guarded_poly_bound(bset, poly, user); bound->pwf = isl_pw_qpolynomial_fold_reset_space(bound->pwf, isl_space_copy(bound->dim)); bound->pwf_tight = isl_pw_qpolynomial_fold_reset_space(bound->pwf_tight, isl_space_copy(bound->dim)); bound->pwf = isl_pw_qpolynomial_fold_fold(top_pwf, bound->pwf); bound->pwf_tight = isl_pw_qpolynomial_fold_fold(top_pwf_tight, bound->pwf_tight); return r; } static int guarded_qp(__isl_take isl_qpolynomial *qp, void *user) { struct isl_bound *bound = (struct isl_bound *)user; int r; r = isl_qpolynomial_as_polynomial_on_domain(qp, bound->bset, &guarded_poly_bound, user); isl_qpolynomial_free(qp); return r; } static int basic_guarded_fold(__isl_take isl_basic_set *bset, void *user) { struct isl_bound *bound = (struct isl_bound *)user; int r; bound->bset = bset; r = isl_qpolynomial_fold_foreach_qpolynomial(bound->fold, &guarded_qp, user); isl_basic_set_free(bset); return r; } static int guarded_fold(__isl_take isl_set *set, __isl_take isl_qpolynomial_fold *fold, void *user) { struct isl_bound *bound = (struct isl_bound *)user; if (!set || !fold) goto error; set = isl_set_make_disjoint(set); bound->fold = fold; bound->type = isl_qpolynomial_fold_get_type(fold); if (isl_set_foreach_basic_set(set, &basic_guarded_fold, bound) < 0) goto error; isl_set_free(set); isl_qpolynomial_fold_free(fold); return 0; error: isl_set_free(set); isl_qpolynomial_fold_free(fold); return -1; } __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_bound( __isl_take isl_pw_qpolynomial_fold *pwf, int *tight) { unsigned nvar; struct isl_bound bound; int covers; if (!pwf) return NULL; bound.dim = isl_pw_qpolynomial_fold_get_domain_space(pwf); bound.wrapping = isl_space_is_wrapping(bound.dim); if (bound.wrapping) bound.dim = isl_space_unwrap(bound.dim); nvar = isl_space_dim(bound.dim, isl_dim_out); bound.dim = isl_space_domain(bound.dim); bound.dim = isl_space_from_domain(bound.dim); bound.dim = isl_space_add_dims(bound.dim, isl_dim_out, 1); if (nvar == 0) { if (tight) *tight = 1; return isl_pw_qpolynomial_fold_reset_space(pwf, bound.dim); } if (isl_pw_qpolynomial_fold_is_zero(pwf)) { enum isl_fold type = pwf->type; isl_pw_qpolynomial_fold_free(pwf); if (tight) *tight = 1; return isl_pw_qpolynomial_fold_zero(bound.dim, type); } bound.pwf = isl_pw_qpolynomial_fold_zero(isl_space_copy(bound.dim), pwf->type); bound.pwf_tight = isl_pw_qpolynomial_fold_zero(isl_space_copy(bound.dim), pwf->type); bound.check_tight = !!tight; if (isl_pw_qpolynomial_fold_foreach_lifted_piece(pwf, guarded_fold, &bound) < 0) goto error; covers = isl_pw_qpolynomial_fold_covers(bound.pwf_tight, bound.pwf); if (covers < 0) goto error; if (tight) *tight = covers; isl_space_free(bound.dim); isl_pw_qpolynomial_fold_free(pwf); if (covers) { isl_pw_qpolynomial_fold_free(bound.pwf); return bound.pwf_tight; } bound.pwf = isl_pw_qpolynomial_fold_fold(bound.pwf, bound.pwf_tight); return bound.pwf; error: isl_pw_qpolynomial_fold_free(bound.pwf_tight); isl_pw_qpolynomial_fold_free(bound.pwf); isl_pw_qpolynomial_fold_free(pwf); isl_space_free(bound.dim); return NULL; } __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_bound( __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight) { isl_pw_qpolynomial_fold *pwf; pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial(type, pwqp); return isl_pw_qpolynomial_fold_bound(pwf, tight); } struct isl_union_bound_data { enum isl_fold type; int tight; isl_union_pw_qpolynomial_fold *res; }; static int bound_pw(__isl_take isl_pw_qpolynomial *pwqp, void *user) { struct isl_union_bound_data *data = user; isl_pw_qpolynomial_fold *pwf; pwf = isl_pw_qpolynomial_bound(pwqp, data->type, data->tight ? &data->tight : NULL); data->res = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold( data->res, pwf); return 0; } __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_bound( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_fold type, int *tight) { isl_space *dim; struct isl_union_bound_data data = { type, 1, NULL }; if (!upwqp) return NULL; if (!tight) data.tight = 0; dim = isl_union_pw_qpolynomial_get_space(upwqp); data.res = isl_union_pw_qpolynomial_fold_zero(dim, type); if (isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp, &bound_pw, &data) < 0) goto error; isl_union_pw_qpolynomial_free(upwqp); if (tight) *tight = data.tight; return data.res; error: isl_union_pw_qpolynomial_free(upwqp); isl_union_pw_qpolynomial_fold_free(data.res); return NULL; } cloog-0.18.2/isl/isl_mat_private.h0000664000175000017500000000163312254313240013751 00000000000000#include struct isl_mat { int ref; struct isl_ctx *ctx; #define ISL_MAT_BORROWED (1 << 0) unsigned flags; unsigned n_row; unsigned n_col; isl_int **row; /* actual size of the rows in memory; n_col <= max_col */ unsigned max_col; struct isl_blk block; }; __isl_give isl_mat *isl_mat_sub_alloc(__isl_keep isl_mat *mat, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col); __isl_give isl_mat *isl_mat_sub_alloc6(isl_ctx *ctx, isl_int **row, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col); void isl_mat_sub_copy(struct isl_ctx *ctx, isl_int **dst, isl_int **src, unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col); void isl_mat_sub_neg(struct isl_ctx *ctx, isl_int **dst, isl_int **src, unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col); __isl_give isl_mat *isl_mat_diag(isl_ctx *ctx, unsigned n_row, isl_int d); cloog-0.18.2/isl/isl_hmap_map_basic_set.h0000664000175000017500000000151712254313240015235 00000000000000#ifndef ISL_HMAP_MAP_BASIC_SET_H #define ISL_HMAP_MAP_BASIC_SET_H #include #include #include struct isl_hmap_map_basic_set { struct isl_hash_table table; }; typedef struct isl_hmap_map_basic_set isl_hmap_map_basic_set; __isl_give isl_hmap_map_basic_set *isl_hmap_map_basic_set_alloc( isl_ctx *ctx, int min_size); void isl_hmap_map_basic_set_free(isl_ctx *ctx, __isl_take isl_hmap_map_basic_set *hmap); int isl_hmap_map_basic_set_has(isl_ctx *ctx, __isl_keep isl_hmap_map_basic_set *hmap, __isl_keep isl_map *key); __isl_give isl_basic_set *isl_hmap_map_basic_set_get(isl_ctx *ctx, __isl_keep isl_hmap_map_basic_set *hmap, __isl_take isl_map *key); int isl_hmap_map_basic_set_set(isl_ctx *ctx, __isl_keep isl_hmap_map_basic_set *hmap, __isl_take isl_map *key, __isl_take isl_basic_set *val); #endif cloog-0.18.2/isl/isl_map_piplib.c0000664000175000017500000002737312254313240013556 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include #include #include "isl_piplib.h" #include "isl_map_piplib.h" static void copy_values_from(isl_int *dst, Entier *src, unsigned n) { int i; for (i = 0; i < n; ++i) entier_assign(dst[i], src[i]); } static void add_value(isl_int *dst, Entier *src) { mpz_add(*dst, *dst, *src); } static void copy_constraint_from(isl_int *dst, PipVector *src, unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra, int *pos) { int i; copy_values_from(dst, src->the_vector+src->nb_elements-1, 1); copy_values_from(dst+1, src->the_vector, nparam+n_in); isl_seq_clr(dst+1+nparam+n_in, n_out); isl_seq_clr(dst+1+nparam+n_in+n_out, extra); for (i = 0; i + n_in + nparam < src->nb_elements-1; ++i) { int p = pos[i]; add_value(&dst[1+nparam+n_in+n_out+p], &src->the_vector[n_in+nparam+i]); } } static int add_inequality(struct isl_ctx *ctx, struct isl_basic_map *bmap, int *pos, PipVector *vec) { unsigned nparam = isl_basic_map_n_param(bmap); unsigned n_in = isl_basic_map_n_in(bmap); unsigned n_out = isl_basic_map_n_out(bmap); unsigned n_div = isl_basic_map_n_div(bmap); int i = isl_basic_map_alloc_inequality(bmap); if (i < 0) return -1; copy_constraint_from(bmap->ineq[i], vec, nparam, n_in, n_out, n_div, pos); return i; } /* For a div d = floor(f/m), add the constraints * * f - m d >= 0 * -(f-(n-1)) + m d >= 0 * * Note that the second constraint is the negation of * * f - m d >= n */ static int add_div_constraints(struct isl_ctx *ctx, struct isl_basic_map *bmap, int *pos, PipNewparm *p, unsigned div) { int i, j; unsigned total = isl_basic_map_total_dim(bmap); unsigned div_pos = 1 + total - bmap->n_div + div; i = add_inequality(ctx, bmap, pos, p->vector); if (i < 0) return -1; copy_values_from(&bmap->ineq[i][div_pos], &p->deno, 1); isl_int_neg(bmap->ineq[i][div_pos], bmap->ineq[i][div_pos]); j = isl_basic_map_alloc_inequality(bmap); if (j < 0) return -1; isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total); isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]); isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1); return j; } static int add_equality(struct isl_ctx *ctx, struct isl_basic_map *bmap, int *pos, unsigned var, PipVector *vec) { int i; unsigned nparam = isl_basic_map_n_param(bmap); unsigned n_in = isl_basic_map_n_in(bmap); unsigned n_out = isl_basic_map_n_out(bmap); isl_assert(ctx, var < n_out, return -1); i = isl_basic_map_alloc_equality(bmap); if (i < 0) return -1; copy_constraint_from(bmap->eq[i], vec, nparam, n_in, n_out, bmap->extra, pos); isl_int_set_si(bmap->eq[i][1+nparam+n_in+var], -1); return i; } static int find_div(struct isl_ctx *ctx, struct isl_basic_map *bmap, int *pos, PipNewparm *p) { int i, j; unsigned nparam = isl_basic_map_n_param(bmap); unsigned n_in = isl_basic_map_n_in(bmap); unsigned n_out = isl_basic_map_n_out(bmap); i = isl_basic_map_alloc_div(bmap); if (i < 0) return -1; copy_constraint_from(bmap->div[i]+1, p->vector, nparam, n_in, n_out, bmap->extra, pos); copy_values_from(bmap->div[i], &p->deno, 1); for (j = 0; j < i; ++j) if (isl_seq_eq(bmap->div[i], bmap->div[j], 1+1+isl_basic_map_total_dim(bmap)+j)) { isl_basic_map_free_div(bmap, 1); return j; } if (add_div_constraints(ctx, bmap, pos, p, i) < 0) return -1; return i; } /* Count some properties of a quast * - maximal number of new parameters * - maximal depth * - total number of solutions * - total number of empty branches */ static void quast_count(PipQuast *q, int *maxnew, int depth, int *maxdepth, int *sol, int *nosol) { PipNewparm *p; for (p = q->newparm; p; p = p->next) if (p->rank > *maxnew) *maxnew = p->rank; if (q->condition) { if (++depth > *maxdepth) *maxdepth = depth; quast_count(q->next_else, maxnew, depth, maxdepth, sol, nosol); quast_count(q->next_then, maxnew, depth, maxdepth, sol, nosol); } else { if (q->list) ++(*sol); else ++(*nosol); } } /* * pos: array of length bmap->set.extra, mapping each of the existential * variables PIP proposes to an existential variable in bmap * bmap: collects the currently active constraints * rest: collects the empty leaves of the quast (if not NULL) */ struct scan_data { struct isl_ctx *ctx; struct isl_basic_map *bmap; struct isl_set **rest; int *pos; }; /* * New existentially quantified variables are places after the existing ones. */ static struct isl_map *scan_quast_r(struct scan_data *data, PipQuast *q, struct isl_map *map) { PipNewparm *p; struct isl_basic_map *bmap = data->bmap; unsigned old_n_div = bmap->n_div; unsigned nparam = isl_basic_map_n_param(bmap); unsigned n_in = isl_basic_map_n_in(bmap); unsigned n_out = isl_basic_map_n_out(bmap); if (!map) goto error; for (p = q->newparm; p; p = p->next) { int pos; unsigned pip_param = nparam + n_in; pos = find_div(data->ctx, bmap, data->pos, p); if (pos < 0) goto error; data->pos[p->rank - pip_param] = pos; } if (q->condition) { int pos = add_inequality(data->ctx, bmap, data->pos, q->condition); if (pos < 0) goto error; map = scan_quast_r(data, q->next_then, map); if (isl_inequality_negate(bmap, pos)) goto error; map = scan_quast_r(data, q->next_else, map); if (isl_basic_map_free_inequality(bmap, 1)) goto error; } else if (q->list) { PipList *l; int j; /* if bmap->n_out is zero, we are only interested in the domains * where a solution exists and not in the actual solution */ for (j = 0, l = q->list; j < n_out && l; ++j, l = l->next) if (add_equality(data->ctx, bmap, data->pos, j, l->vector) < 0) goto error; map = isl_map_add_basic_map(map, isl_basic_map_copy(bmap)); if (isl_basic_map_free_equality(bmap, n_out)) goto error; } else if (data->rest) { struct isl_basic_set *bset; bset = isl_basic_set_from_basic_map(isl_basic_map_copy(bmap)); bset = isl_basic_set_drop_dims(bset, n_in, n_out); if (!bset) goto error; *data->rest = isl_set_add_basic_set(*data->rest, bset); } if (isl_basic_map_free_inequality(bmap, 2*(bmap->n_div - old_n_div))) goto error; if (isl_basic_map_free_div(bmap, bmap->n_div - old_n_div)) goto error; return map; error: isl_map_free(map); return NULL; } /* * Returns a map of dimension "keep_dim" with "context" as domain and * as range the first "isl_space_dim(keep_dim, isl_dim_out)" variables * in the quast lists. */ static struct isl_map *isl_map_from_quast(struct isl_ctx *ctx, PipQuast *q, isl_space *keep_dim, struct isl_basic_set *context, struct isl_set **rest) { int pip_param; int nexist; int max_depth; int n_sol, n_nosol; struct scan_data data; struct isl_map *map = NULL; isl_space *dims; unsigned nparam; unsigned dim; unsigned keep; data.ctx = ctx; data.rest = rest; data.bmap = NULL; data.pos = NULL; if (!context || !keep_dim) goto error; dim = isl_basic_set_n_dim(context); nparam = isl_basic_set_n_param(context); keep = isl_space_dim(keep_dim, isl_dim_out); pip_param = nparam + dim; max_depth = 0; n_sol = 0; n_nosol = 0; nexist = pip_param-1; quast_count(q, &nexist, 0, &max_depth, &n_sol, &n_nosol); nexist -= pip_param-1; if (rest) { *rest = isl_set_alloc_space(isl_space_copy(context->dim), n_nosol, ISL_MAP_DISJOINT); if (!*rest) goto error; } map = isl_map_alloc_space(isl_space_copy(keep_dim), n_sol, ISL_MAP_DISJOINT); if (!map) goto error; dims = isl_space_reverse(isl_space_copy(context->dim)); data.bmap = isl_basic_map_from_basic_set(context, dims); data.bmap = isl_basic_map_extend_space(data.bmap, keep_dim, nexist, keep, max_depth+2*nexist); if (!data.bmap) goto error2; if (data.bmap->extra) { int i; data.pos = isl_alloc_array(ctx, int, data.bmap->extra); if (!data.pos) goto error; for (i = 0; i < data.bmap->n_div; ++i) data.pos[i] = i; } map = scan_quast_r(&data, q, map); map = isl_map_finalize(map); if (!map) goto error2; if (rest) { *rest = isl_set_finalize(*rest); if (!*rest) goto error2; } isl_basic_map_free(data.bmap); if (data.pos) free(data.pos); return map; error: isl_basic_set_free(context); isl_space_free(keep_dim); error2: if (data.pos) free(data.pos); isl_basic_map_free(data.bmap); isl_map_free(map); if (rest) { isl_set_free(*rest); *rest = NULL; } return NULL; } static void copy_values_to(Entier *dst, isl_int *src, unsigned n) { int i; for (i = 0; i < n; ++i) entier_assign(dst[i], src[i]); } static void copy_constraint_to(Entier *dst, isl_int *src, unsigned pip_param, unsigned pip_var, unsigned extra_front, unsigned extra_back) { copy_values_to(dst+1+extra_front+pip_var+pip_param+extra_back, src, 1); copy_values_to(dst+1+extra_front+pip_var, src+1, pip_param); copy_values_to(dst+1+extra_front, src+1+pip_param, pip_var); } PipMatrix *isl_basic_map_to_pip(struct isl_basic_map *bmap, unsigned pip_param, unsigned extra_front, unsigned extra_back) { int i; unsigned nrow; unsigned ncol; PipMatrix *M; unsigned off; unsigned pip_var = isl_basic_map_total_dim(bmap) - pip_param; nrow = extra_front + bmap->n_eq + bmap->n_ineq; ncol = 1 + extra_front + pip_var + pip_param + extra_back + 1; M = pip_matrix_alloc(nrow, ncol); if (!M) return NULL; off = extra_front; for (i = 0; i < bmap->n_eq; ++i) { entier_set_si(M->p[off+i][0], 0); copy_constraint_to(M->p[off+i], bmap->eq[i], pip_param, pip_var, extra_front, extra_back); } off += bmap->n_eq; for (i = 0; i < bmap->n_ineq; ++i) { entier_set_si(M->p[off+i][0], 1); copy_constraint_to(M->p[off+i], bmap->ineq[i], pip_param, pip_var, extra_front, extra_back); } return M; } PipMatrix *isl_basic_set_to_pip(struct isl_basic_set *bset, unsigned pip_param, unsigned extra_front, unsigned extra_back) { return isl_basic_map_to_pip((struct isl_basic_map *)bset, pip_param, extra_front, extra_back); } struct isl_map *isl_pip_basic_map_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max) { PipOptions *options; PipQuast *sol; struct isl_map *map; struct isl_ctx *ctx; PipMatrix *domain = NULL, *context = NULL; unsigned nparam, n_in, n_out; bmap = isl_basic_map_detect_equalities(bmap); if (!bmap || !dom) goto error; ctx = bmap->ctx; isl_assert(ctx, isl_basic_map_compatible_domain(bmap, dom), goto error); nparam = isl_basic_map_n_param(bmap); n_in = isl_basic_map_n_in(bmap); n_out = isl_basic_map_n_out(bmap); domain = isl_basic_map_to_pip(bmap, nparam + n_in, 0, dom->n_div); if (!domain) goto error; context = isl_basic_map_to_pip((struct isl_basic_map *)dom, 0, 0, 0); if (!context) goto error; options = pip_options_init(); options->Simplify = 1; options->Maximize = max; options->Urs_unknowns = -1; options->Urs_parms = -1; sol = pip_solve(domain, context, -1, options); if (sol) { struct isl_basic_set *copy; copy = isl_basic_set_copy(dom); map = isl_map_from_quast(ctx, sol, isl_space_copy(bmap->dim), copy, empty); } else { map = isl_map_empty_like_basic_map(bmap); if (empty) *empty = NULL; } if (!map) goto error; if (map->n == 0 && empty) { isl_set_free(*empty); *empty = isl_set_from_basic_set(dom); } else isl_basic_set_free(dom); isl_basic_map_free(bmap); pip_quast_free(sol); pip_options_free(options); pip_matrix_free(domain); pip_matrix_free(context); return map; error: if (domain) pip_matrix_free(domain); if (context) pip_matrix_free(context); isl_basic_map_free(bmap); isl_basic_set_free(dom); return NULL; } cloog-0.18.2/isl/config.guess0000755000175000017500000013036112254313255012743 00000000000000#! /bin/sh # Attempt to guess a canonical system name. # Copyright 1992-2013 Free Software Foundation, Inc. timestamp='2013-06-10' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 3 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # # Originally written by Per Bothner. # # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD # # Please send patches with a ChangeLog entry to config-patches@gnu.org. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright 1992-2013 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown case "${UNAME_SYSTEM}" in Linux|GNU|GNU/*) # If the system lacks a compiler, then just pick glibc. # We could probably try harder. LIBC=gnu eval $set_cc_for_build cat <<-EOF > $dummy.c #include #if defined(__UCLIBC__) LIBC=uclibc #elif defined(__dietlibc__) LIBC=dietlibc #else LIBC=gnu #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC'` ;; esac # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:Bitrig:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'` echo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE} exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` # Reset EXIT trap before exiting to avoid spurious non-zero exit code. exitcode=$? trap '' 0 exit $exitcode ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm*:riscos:*:*|arm*:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*) echo i386-pc-auroraux${UNAME_RELEASE} exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval $set_cc_for_build SUN_ARCH="i386" # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH="x86_64" fi fi echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[4567]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) UNAME_PROCESSOR=`/usr/bin/uname -p` case ${UNAME_PROCESSOR} in amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW64*:*) echo ${UNAME_MACHINE}-pc-mingw64 exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:MSYS*:*) echo ${UNAME_MACHINE}-pc-msys exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; authenticamd | genuineintel | EM64T) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; 8664:Windows_NT:*) echo x86_64-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC} exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; aarch64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; aarch64_be:Linux:*:*) UNAME_MACHINE=aarch64_be echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC="gnulibc1" ; fi echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; arc:Linux:*:* | arceb:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-${LIBC} else if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_PCS_VFP then echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi else echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf fi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; cris:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; crisv32:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; frv:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; hexagon:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:Linux:*:*) echo ${UNAME_MACHINE}-pc-linux-${LIBC} exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; mips:Linux:*:* | mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef ${UNAME_MACHINE} #undef ${UNAME_MACHINE}el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=${UNAME_MACHINE}el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=${UNAME_MACHINE} #else CPU= #endif #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'` test x"${CPU}" != x && { echo "${CPU}-unknown-linux-${LIBC}"; exit; } ;; or1k:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; or32:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; padre:Linux:*:*) echo sparc-unknown-linux-${LIBC} exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-${LIBC} exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-${LIBC} ;; PA8*) echo hppa2.0-unknown-linux-${LIBC} ;; *) echo hppa-unknown-linux-${LIBC} ;; esac exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-${LIBC} exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-${LIBC} exit ;; ppc64le:Linux:*:*) echo powerpc64le-unknown-linux-${LIBC} exit ;; ppcle:Linux:*:*) echo powerpcle-unknown-linux-${LIBC} exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux-${LIBC} exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; tile*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-${LIBC} exit ;; x86_64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configury will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; x86_64:Haiku:*:*) echo x86_64-unknown-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown eval $set_cc_for_build if test "$UNAME_PROCESSOR" = unknown ; then UNAME_PROCESSOR=powerpc fi if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then case $UNAME_PROCESSOR in i386) UNAME_PROCESSOR=x86_64 ;; powerpc) UNAME_PROCESSOR=powerpc64 ;; esac fi fi echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NEO-?:NONSTOP_KERNEL:*:*) echo neo-tandem-nsk${UNAME_RELEASE} exit ;; NSE-*:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; i*86:AROS:*:*) echo ${UNAME_MACHINE}-pc-aros exit ;; x86_64:VMkernel:*:*) echo ${UNAME_MACHINE}-unknown-esx exit ;; esac eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: cloog-0.18.2/isl/isl_stream.c0000664000175000017500000004130712254313240012726 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include #include #include #include struct isl_keyword { char *name; enum isl_token_type type; }; static int same_name(const void *entry, const void *val) { const struct isl_keyword *keyword = (const struct isl_keyword *)entry; return !strcmp(keyword->name, val); } enum isl_token_type isl_stream_register_keyword(struct isl_stream *s, const char *name) { struct isl_hash_table_entry *entry; struct isl_keyword *keyword; uint32_t name_hash; if (!s->keywords) { s->keywords = isl_hash_table_alloc(s->ctx, 10); if (!s->keywords) return ISL_TOKEN_ERROR; s->next_type = ISL_TOKEN_LAST; } name_hash = isl_hash_string(isl_hash_init(), name); entry = isl_hash_table_find(s->ctx, s->keywords, name_hash, same_name, name, 1); if (!entry) return ISL_TOKEN_ERROR; if (entry->data) { keyword = entry->data; return keyword->type; } keyword = isl_calloc_type(s->ctx, struct isl_keyword); if (!keyword) return ISL_TOKEN_ERROR; keyword->type = s->next_type++; keyword->name = strdup(name); if (!keyword->name) { free(keyword); return ISL_TOKEN_ERROR; } entry->data = keyword; return keyword->type; } struct isl_token *isl_token_new(isl_ctx *ctx, int line, int col, unsigned on_new_line) { struct isl_token *tok = isl_alloc_type(ctx, struct isl_token); if (!tok) return NULL; tok->line = line; tok->col = col; tok->on_new_line = on_new_line; tok->is_keyword = 0; tok->u.s = NULL; return tok; } /* Return the type of "tok". */ int isl_token_get_type(struct isl_token *tok) { return tok ? tok->type : ISL_TOKEN_ERROR; } /* Given a token of type ISL_TOKEN_VALUE, return the value it represents. */ __isl_give isl_val *isl_token_get_val(isl_ctx *ctx, struct isl_token *tok) { if (!tok) return NULL; if (tok->type != ISL_TOKEN_VALUE) isl_die(ctx, isl_error_invalid, "not a value token", return NULL); return isl_val_int_from_isl_int(ctx, tok->u.v); } /* Given a token of type ISL_TOKEN_STRING, return the string it represents. */ __isl_give char *isl_token_get_str(isl_ctx *ctx, struct isl_token *tok) { if (!tok) return NULL; if (tok->type != ISL_TOKEN_STRING) isl_die(ctx, isl_error_invalid, "not a string token", return NULL); return strdup(tok->u.s); } void isl_token_free(struct isl_token *tok) { if (!tok) return; if (tok->type == ISL_TOKEN_VALUE) isl_int_clear(tok->u.v); else if (tok->type == ISL_TOKEN_MAP) isl_map_free(tok->u.map); else if (tok->type == ISL_TOKEN_AFF) isl_pw_aff_free(tok->u.pwaff); else free(tok->u.s); free(tok); } void isl_stream_error(struct isl_stream *s, struct isl_token *tok, char *msg) { int line = tok ? tok->line : s->line; int col = tok ? tok->col : s->col; fprintf(stderr, "syntax error (%d, %d): %s\n", line, col, msg); if (tok) { if (tok->type < 256) fprintf(stderr, "got '%c'\n", tok->type); else if (tok->type == ISL_TOKEN_IDENT) fprintf(stderr, "got ident '%s'\n", tok->u.s); else if (tok->is_keyword) fprintf(stderr, "got keyword '%s'\n", tok->u.s); else if (tok->type == ISL_TOKEN_VALUE) { fprintf(stderr, "got value '"); isl_int_print(stderr, tok->u.v, 0); fprintf(stderr, "'\n"); } else if (tok->type == ISL_TOKEN_MAP) { isl_printer *p; fprintf(stderr, "got map '"); p = isl_printer_to_file(s->ctx, stderr); p = isl_printer_print_map(p, tok->u.map); isl_printer_free(p); fprintf(stderr, "'\n"); } else if (tok->type == ISL_TOKEN_AFF) { isl_printer *p; fprintf(stderr, "got affine expression '"); p = isl_printer_to_file(s->ctx, stderr); p = isl_printer_print_pw_aff(p, tok->u.pwaff); isl_printer_free(p); fprintf(stderr, "'\n"); } else if (tok->u.s) fprintf(stderr, "got token '%s'\n", tok->u.s); else fprintf(stderr, "got token type %d\n", tok->type); } } static struct isl_stream* isl_stream_new(struct isl_ctx *ctx) { int i; struct isl_stream *s = isl_alloc_type(ctx, struct isl_stream); if (!s) return NULL; s->ctx = ctx; isl_ctx_ref(s->ctx); s->file = NULL; s->str = NULL; s->len = 0; s->line = 1; s->col = 0; s->eof = 0; s->c = -1; s->n_un = 0; for (i = 0; i < 5; ++i) s->tokens[i] = NULL; s->n_token = 0; s->keywords = NULL; s->size = 256; s->buffer = isl_alloc_array(ctx, char, s->size); if (!s->buffer) goto error; return s; error: isl_stream_free(s); return NULL; } struct isl_stream* isl_stream_new_file(struct isl_ctx *ctx, FILE *file) { struct isl_stream *s = isl_stream_new(ctx); if (!s) return NULL; s->file = file; return s; } struct isl_stream* isl_stream_new_str(struct isl_ctx *ctx, const char *str) { struct isl_stream *s; if (!str) return NULL; s = isl_stream_new(ctx); if (!s) return NULL; s->str = str; return s; } static int stream_getc(struct isl_stream *s) { int c; if (s->eof) return -1; if (s->n_un) return s->c = s->un[--s->n_un]; if (s->file) c = fgetc(s->file); else { c = *s->str++; if (c == '\0') c = -1; } if (c == -1) s->eof = 1; if (!s->eof) { if (s->c == '\n') { s->line++; s->col = 0; } else s->col++; } s->c = c; return c; } static void isl_stream_ungetc(struct isl_stream *s, int c) { isl_assert(s->ctx, s->n_un < 5, return); s->un[s->n_un++] = c; s->c = -1; } static int isl_stream_getc(struct isl_stream *s) { int c; do { c = stream_getc(s); if (c != '\\') return c; c = stream_getc(s); } while (c == '\n'); isl_stream_ungetc(s, c); return '\\'; } static int isl_stream_push_char(struct isl_stream *s, int c) { if (s->len >= s->size) { char *buffer; s->size = (3*s->size)/2; buffer = isl_realloc_array(s->ctx, s->buffer, char, s->size); if (!buffer) return -1; s->buffer = buffer; } s->buffer[s->len++] = c; return 0; } void isl_stream_push_token(struct isl_stream *s, struct isl_token *tok) { isl_assert(s->ctx, s->n_token < 5, return); s->tokens[s->n_token++] = tok; } static enum isl_token_type check_keywords(struct isl_stream *s) { struct isl_hash_table_entry *entry; struct isl_keyword *keyword; uint32_t name_hash; if (!strcasecmp(s->buffer, "exists")) return ISL_TOKEN_EXISTS; if (!strcasecmp(s->buffer, "and")) return ISL_TOKEN_AND; if (!strcasecmp(s->buffer, "or")) return ISL_TOKEN_OR; if (!strcasecmp(s->buffer, "implies")) return ISL_TOKEN_IMPLIES; if (!strcasecmp(s->buffer, "not")) return ISL_TOKEN_NOT; if (!strcasecmp(s->buffer, "infty")) return ISL_TOKEN_INFTY; if (!strcasecmp(s->buffer, "infinity")) return ISL_TOKEN_INFTY; if (!strcasecmp(s->buffer, "NaN")) return ISL_TOKEN_NAN; if (!strcasecmp(s->buffer, "min")) return ISL_TOKEN_MIN; if (!strcasecmp(s->buffer, "max")) return ISL_TOKEN_MAX; if (!strcasecmp(s->buffer, "rat")) return ISL_TOKEN_RAT; if (!strcasecmp(s->buffer, "true")) return ISL_TOKEN_TRUE; if (!strcasecmp(s->buffer, "false")) return ISL_TOKEN_FALSE; if (!strcasecmp(s->buffer, "ceild")) return ISL_TOKEN_CEILD; if (!strcasecmp(s->buffer, "floord")) return ISL_TOKEN_FLOORD; if (!strcasecmp(s->buffer, "mod")) return ISL_TOKEN_MOD; if (!strcasecmp(s->buffer, "ceil")) return ISL_TOKEN_CEIL; if (!strcasecmp(s->buffer, "floor")) return ISL_TOKEN_FLOOR; if (!s->keywords) return ISL_TOKEN_IDENT; name_hash = isl_hash_string(isl_hash_init(), s->buffer); entry = isl_hash_table_find(s->ctx, s->keywords, name_hash, same_name, s->buffer, 0); if (entry) { keyword = entry->data; return keyword->type; } return ISL_TOKEN_IDENT; } int isl_stream_skip_line(struct isl_stream *s) { int c; while ((c = isl_stream_getc(s)) != -1 && c != '\n') /* nothing */ ; return c == -1 ? -1 : 0; } static struct isl_token *next_token(struct isl_stream *s, int same_line) { int c; struct isl_token *tok = NULL; int line, col; int old_line = s->line; if (s->n_token) { if (same_line && s->tokens[s->n_token - 1]->on_new_line) return NULL; return s->tokens[--s->n_token]; } if (same_line && s->c == '\n') return NULL; s->len = 0; /* skip spaces and comment lines */ while ((c = isl_stream_getc(s)) != -1) { if (c == '#') { if (isl_stream_skip_line(s) < 0) break; c = '\n'; if (same_line) break; } else if (!isspace(c) || (same_line && c == '\n')) break; } line = s->line; col = s->col; if (c == -1 || (same_line && c == '\n')) return NULL; if (c == '(' || c == ')' || c == '+' || c == '*' || c == '%' || c == '?' || c == '^' || c == '@' || c == '$' || c == ',' || c == '.' || c == ';' || c == '[' || c == ']' || c == '{' || c == '}') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = (enum isl_token_type)c; return tok; } if (c == '-') { int c; if ((c = isl_stream_getc(s)) == '>') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->u.s = strdup("->"); tok->type = ISL_TOKEN_TO; return tok; } if (c != -1) isl_stream_ungetc(s, c); if (!isdigit(c)) { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = (enum isl_token_type) '-'; return tok; } } if (c == '-' || isdigit(c)) { int minus = c == '-'; tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = ISL_TOKEN_VALUE; isl_int_init(tok->u.v); if (isl_stream_push_char(s, c)) goto error; while ((c = isl_stream_getc(s)) != -1 && isdigit(c)) if (isl_stream_push_char(s, c)) goto error; if (c != -1) isl_stream_ungetc(s, c); isl_stream_push_char(s, '\0'); isl_int_read(tok->u.v, s->buffer); if (minus && isl_int_is_zero(tok->u.v)) { tok->col++; tok->on_new_line = 0; isl_stream_push_token(s, tok); tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = (enum isl_token_type) '-'; } return tok; } if (isalpha(c) || c == '_') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; isl_stream_push_char(s, c); while ((c = isl_stream_getc(s)) != -1 && (isalnum(c) || c == '_')) isl_stream_push_char(s, c); if (c != -1) isl_stream_ungetc(s, c); while ((c = isl_stream_getc(s)) != -1 && c == '\'') isl_stream_push_char(s, c); if (c != -1) isl_stream_ungetc(s, c); isl_stream_push_char(s, '\0'); tok->type = check_keywords(s); if (tok->type != ISL_TOKEN_IDENT) tok->is_keyword = 1; tok->u.s = strdup(s->buffer); if (!tok->u.s) goto error; return tok; } if (c == '"') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = ISL_TOKEN_STRING; tok->u.s = NULL; while ((c = isl_stream_getc(s)) != -1 && c != '"' && c != '\n') isl_stream_push_char(s, c); if (c != '"') { isl_stream_error(s, NULL, "unterminated string"); goto error; } isl_stream_push_char(s, '\0'); tok->u.s = strdup(s->buffer); return tok; } if (c == '=') { int c; tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; if ((c = isl_stream_getc(s)) == '=') { tok->u.s = strdup("=="); tok->type = ISL_TOKEN_EQ_EQ; return tok; } if (c != -1) isl_stream_ungetc(s, c); tok->type = (enum isl_token_type) '='; return tok; } if (c == ':') { int c; tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; if ((c = isl_stream_getc(s)) == '=') { tok->u.s = strdup(":="); tok->type = ISL_TOKEN_DEF; return tok; } if (c != -1) isl_stream_ungetc(s, c); tok->type = (enum isl_token_type) ':'; return tok; } if (c == '>') { int c; tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; if ((c = isl_stream_getc(s)) == '=') { tok->u.s = strdup(">="); tok->type = ISL_TOKEN_GE; return tok; } else if (c == '>') { if ((c = isl_stream_getc(s)) == '=') { tok->u.s = strdup(">>="); tok->type = ISL_TOKEN_LEX_GE; return tok; } tok->u.s = strdup(">>"); tok->type = ISL_TOKEN_LEX_GT; } else { tok->u.s = strdup(">"); tok->type = ISL_TOKEN_GT; } if (c != -1) isl_stream_ungetc(s, c); return tok; } if (c == '<') { int c; tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; if ((c = isl_stream_getc(s)) == '=') { tok->u.s = strdup("<="); tok->type = ISL_TOKEN_LE; return tok; } else if (c == '<') { if ((c = isl_stream_getc(s)) == '=') { tok->u.s = strdup("<<="); tok->type = ISL_TOKEN_LEX_LE; return tok; } tok->u.s = strdup("<<"); tok->type = ISL_TOKEN_LEX_LT; } else { tok->u.s = strdup("<"); tok->type = ISL_TOKEN_LT; } if (c != -1) isl_stream_ungetc(s, c); return tok; } if (c == '&') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = ISL_TOKEN_AND; if ((c = isl_stream_getc(s)) != '&' && c != -1) { tok->u.s = strdup("&"); isl_stream_ungetc(s, c); } else tok->u.s = strdup("&&"); return tok; } if (c == '|') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = ISL_TOKEN_OR; if ((c = isl_stream_getc(s)) != '|' && c != -1) { tok->u.s = strdup("|"); isl_stream_ungetc(s, c); } else tok->u.s = strdup("||"); return tok; } if (c == '/') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; if ((c = isl_stream_getc(s)) != '\\' && c != -1) { tok->type = (enum isl_token_type) '/'; isl_stream_ungetc(s, c); } else { tok->u.s = strdup("/\\"); tok->type = ISL_TOKEN_AND; } return tok; } if (c == '\\') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; if ((c = isl_stream_getc(s)) != '/' && c != -1) { tok->type = (enum isl_token_type) '\\'; isl_stream_ungetc(s, c); } else { tok->u.s = strdup("\\/"); tok->type = ISL_TOKEN_OR; } return tok; } if (c == '!') { tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; if ((c = isl_stream_getc(s)) == '=') { tok->u.s = strdup("!="); tok->type = ISL_TOKEN_NE; return tok; } else { tok->type = ISL_TOKEN_NOT; tok->u.s = strdup("!"); } if (c != -1) isl_stream_ungetc(s, c); return tok; } tok = isl_token_new(s->ctx, line, col, old_line != line); if (!tok) return NULL; tok->type = ISL_TOKEN_UNKNOWN; return tok; error: isl_token_free(tok); return NULL; } struct isl_token *isl_stream_next_token(struct isl_stream *s) { return next_token(s, 0); } struct isl_token *isl_stream_next_token_on_same_line(struct isl_stream *s) { return next_token(s, 1); } int isl_stream_eat_if_available(struct isl_stream *s, int type) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return 0; if (tok->type == type) { isl_token_free(tok); return 1; } isl_stream_push_token(s, tok); return 0; } int isl_stream_next_token_is(struct isl_stream *s, int type) { struct isl_token *tok; int r; tok = isl_stream_next_token(s); if (!tok) return 0; r = tok->type == type; isl_stream_push_token(s, tok); return r; } char *isl_stream_read_ident_if_available(struct isl_stream *s) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return NULL; if (tok->type == ISL_TOKEN_IDENT) { char *ident = strdup(tok->u.s); isl_token_free(tok); return ident; } isl_stream_push_token(s, tok); return NULL; } int isl_stream_eat(struct isl_stream *s, int type) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return -1; if (tok->type == type) { isl_token_free(tok); return 0; } isl_stream_error(s, tok, "expecting other token"); isl_stream_push_token(s, tok); return -1; } int isl_stream_is_empty(struct isl_stream *s) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return 1; isl_stream_push_token(s, tok); return 0; } static int free_keyword(void **p, void *user) { struct isl_keyword *keyword = *p; free(keyword->name); free(keyword); return 0; } void isl_stream_flush_tokens(struct isl_stream *s) { int i; if (!s) return; for (i = 0; i < s->n_token; ++i) isl_token_free(s->tokens[i]); s->n_token = 0; } void isl_stream_free(struct isl_stream *s) { if (!s) return; free(s->buffer); if (s->n_token != 0) { struct isl_token *tok = isl_stream_next_token(s); isl_stream_error(s, tok, "unexpected token"); isl_token_free(tok); } if (s->keywords) { isl_hash_table_foreach(s->ctx, s->keywords, &free_keyword, NULL); isl_hash_table_free(s->ctx, s->keywords); } isl_ctx_deref(s->ctx); free(s); } cloog-0.18.2/isl/codegen.c0000664000175000017500000000732412254313240012171 00000000000000/* * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ /* This program prints an AST that scans the domain elements of * the domain of a given schedule in the order of their image(s). * * The input consists of three sets/relations. * - a schedule * - a context * - a relation describing AST generation options */ #include #include #include #include #include struct options { struct isl_options *isl; unsigned atomic; unsigned separate; }; ISL_ARGS_START(struct options, options_args) ISL_ARG_CHILD(struct options, isl, "isl", &isl_options_args, "isl options") ISL_ARG_BOOL(struct options, atomic, 0, "atomic", 0, "globally set the atomic option") ISL_ARG_BOOL(struct options, separate, 0, "separate", 0, "globally set the separate option") ISL_ARGS_END ISL_ARG_DEF(options, struct options, options_args) /* Return a universal, 1-dimensional set with the given name. */ static __isl_give isl_union_set *universe(isl_ctx *ctx, const char *name) { isl_space *space; space = isl_space_set_alloc(ctx, 0, 1); space = isl_space_set_tuple_name(space, isl_dim_set, name); return isl_union_set_from_set(isl_set_universe(space)); } /* Set the "name" option for the entire schedule domain. */ static __isl_give isl_union_map *set_universe(__isl_take isl_union_map *opt, __isl_keep isl_union_map *schedule, const char *name) { isl_ctx *ctx; isl_union_set *domain, *target; isl_union_map *option; ctx = isl_union_map_get_ctx(opt); domain = isl_union_map_range(isl_union_map_copy(schedule)); domain = isl_union_set_universe(domain); target = universe(ctx, name); option = isl_union_map_from_domain_and_range(domain, target); opt = isl_union_map_union(opt, option); return opt; } /* Update the build options based on the user-specified options. * * If the --separate or --atomic options were specified, then * we clear any separate or atomic options that may already exist in "opt". */ static __isl_give isl_ast_build *set_options(__isl_take isl_ast_build *build, __isl_take isl_union_map *opt, struct options *options, __isl_keep isl_union_map *schedule) { if (options->separate || options->atomic) { isl_ctx *ctx; isl_union_set *target; ctx = isl_union_map_get_ctx(schedule); target = universe(ctx, "separate"); opt = isl_union_map_subtract_range(opt, target); target = universe(ctx, "atomic"); opt = isl_union_map_subtract_range(opt, target); } if (options->separate) opt = set_universe(opt, schedule, "separate"); if (options->atomic) opt = set_universe(opt, schedule, "atomic"); build = isl_ast_build_set_options(build, opt); return build; } int main(int argc, char **argv) { isl_ctx *ctx; isl_set *context; isl_union_map *schedule; isl_union_map *options_map; isl_ast_build *build; isl_ast_node *tree; struct options *options; isl_printer *p; options = options_new_with_defaults(); assert(options); argc = options_parse(options, argc, argv, ISL_ARG_ALL); ctx = isl_ctx_alloc_with_options(&options_args, options); schedule = isl_union_map_read_from_file(ctx, stdin); context = isl_set_read_from_file(ctx, stdin); options_map = isl_union_map_read_from_file(ctx, stdin); build = isl_ast_build_from_context(context); build = set_options(build, options_map, options, schedule); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); p = isl_printer_to_file(ctx, stdout); p = isl_printer_set_output_format(p, ISL_FORMAT_C); p = isl_printer_print_ast_node(p, tree); isl_printer_free(p); isl_ast_node_free(tree); isl_ctx_free(ctx); return 0; } cloog-0.18.2/isl/configure0000775000175000017500000241273112254313257012344 00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.68 for isl 0.12.1. # # Report bugs to . # # # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, # 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free Software # Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test -n \"\${ZSH_VERSION+set}\${BASH_VERSION+set}\" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test \"X\`printf %s \$ECHO\`\" = \"X\$ECHO\" \\ || test \"X\`print -r -- \$ECHO\`\" = \"X\$ECHO\" ) || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV export CONFIG_SHELL case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec "$CONFIG_SHELL" $as_opts "$as_myself" ${1+"$@"} fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org and $0: isl-development@googlegroups.com about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" SHELL=${CONFIG_SHELL-/bin/sh} test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='isl' PACKAGE_TARNAME='isl' PACKAGE_VERSION='0.12.1' PACKAGE_STRING='isl 0.12.1' PACKAGE_BUGREPORT='isl-development@googlegroups.com' PACKAGE_URL='' # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS LIBOBJS GIT_HEAD_VERSION GIT_HEAD GIT_HEAD_ID pkgconfig_libfile pkgconfig_libdir WARNING_FLAGS HAVE_CLANG_FALSE HAVE_CLANG_TRUE LIB_CLANG_EDIT llvm_config_found CLANG_LIBS CLANG_LDFLAGS CLANG_CXXFLAGS HAVE_PIPLIB_FALSE HAVE_PIPLIB_TRUE PIPLIB_LIBS PIPLIB_LDFLAGS PIPLIB_CPPFLAGS NEED_GET_MEMORY_FUNCTIONS_FALSE NEED_GET_MEMORY_FUNCTIONS_TRUE GMP_LIBS GMP_LDFLAGS GMP_CPPFLAGS GENERATE_DOC_FALSE GENERATE_DOC_TRUE POD2HTML PDFLATEX PERL CXXCPP CPP OTOOL64 OTOOL LIPO NMEDIT DSYMUTIL MANIFEST_TOOL RANLIB ac_ct_AR AR DLLTOOL OBJDUMP LN_S NM ac_ct_DUMPBIN DUMPBIN LD FGREP EGREP GREP SED LIBTOOL PRTDIAG host_os host_vendor host_cpu host build_os build_vendor build_cpu build am__fastdepCXX_FALSE am__fastdepCXX_TRUE CXXDEPMODE ac_ct_CXX CXXFLAGS CXX am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE am__nodep AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC versioninfo AM_BACKSLASH AM_DEFAULT_VERBOSITY AM_DEFAULT_V AM_V am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_silent_rules enable_dependency_tracking enable_portable_binary with_gcc_arch enable_shared enable_static with_pic enable_fast_install with_gnu_ld with_sysroot enable_libtool_lock with_gmp with_gmp_prefix with_gmp_exec_prefix with_gmp_builddir with_piplib with_piplib_prefix with_piplib_exec_prefix with_piplib_builddir with_clang with_clang_prefix with_clang_exec_prefix ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CXX CXXFLAGS CCC CPP CXXCPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe $as_echo "$as_me: WARNING: if you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used" >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures isl 0.12.1 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/isl] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of isl 0.12.1:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-silent-rules less verbose build output (undo: `make V=1') --disable-silent-rules verbose build output (undo: `make V=0') --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors --enable-portable-binary disable compiler optimizations that would produce unportable binaries --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-gcc-arch= use architecture for gcc -march/-mtune, instead of guessing --with-pic[=PKGS] try to use only PIC/non-PIC objects [default=use both] --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-sysroot[=DIR] Search for dependent libraries within DIR (or the compiler's sysroot if not specified). --with-gmp=system|build Which gmp to use [default=system] --with-gmp-prefix=DIR Prefix of gmp installation --with-gmp-exec-prefix=DIR Exec prefix of gmp installation --with-gmp-builddir=DIR Location of gmp builddir --with-piplib=no|system|build Which piplib to use [default=no] --with-piplib-prefix=DIR Prefix of piplib installation --with-piplib-exec-prefix=DIR Exec prefix of piplib installation --with-piplib-builddir=DIR Location of piplib builddir --with-clang=system|no Which clang to use [default=no] --with-clang-prefix=DIR Prefix of clang installation --with-clang-exec-prefix=DIR Exec prefix of clang installation Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CXX C++ compiler command CXXFLAGS C++ compiler flags CPP C preprocessor CXXCPP C++ preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to . _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF isl configure 0.12.1 generated by GNU Autoconf 2.68 Copyright (C) 2010 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_cxx_try_compile LINENO # ---------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_cxx_try_compile # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_compile # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_check_func LINENO FUNC VAR # ---------------------------------- # Tests whether FUNC exists, setting the cache variable VAR accordingly ac_fn_c_check_func () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_func # ac_fn_cxx_try_cpp LINENO # ------------------------ # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_cxx_preproc_warn_flag$ac_cxx_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_cxx_try_cpp # ac_fn_cxx_try_link LINENO # ------------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_cxx_try_link # ac_fn_c_check_type LINENO TYPE VAR INCLUDES # ------------------------------------------- # Tests whether TYPE exists after having included INCLUDES, setting cache # variable VAR accordingly. ac_fn_c_check_type () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=no" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof ($2)) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof (($2))) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else eval "$3=yes" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_type # ac_fn_c_compute_int LINENO EXPR VAR INCLUDES # -------------------------------------------- # Tries to find the compile-time value of EXPR in a program that includes # INCLUDES, setting VAR accordingly. Returns whether the value could be # computed ac_fn_c_compute_int () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if test "$cross_compiling" = yes; then # Depending upon the size, compute the lo and hi bounds. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= 0)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=0 ac_mid=0 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid; break else as_fn_arith $ac_mid + 1 && ac_lo=$as_val if test $ac_lo -le $ac_mid; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid + 1 && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) < 0)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=-1 ac_mid=-1 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= $ac_mid)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=$ac_mid; break else as_fn_arith '(' $ac_mid ')' - 1 && ac_hi=$as_val if test $ac_mid -le $ac_hi; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else ac_lo= ac_hi= fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext # Binary search between lo and hi bounds. while test "x$ac_lo" != "x$ac_hi"; do as_fn_arith '(' $ac_hi - $ac_lo ')' / 2 + $ac_lo && ac_mid=$as_val cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0 ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid else as_fn_arith '(' $ac_mid ')' + 1 && ac_lo=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done case $ac_lo in #(( ?*) eval "$3=\$ac_lo"; ac_retval=0 ;; '') ac_retval=1 ;; esac else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 static long int longval () { return $2; } static unsigned long int ulongval () { return $2; } #include #include int main () { FILE *f = fopen ("conftest.val", "w"); if (! f) return 1; if (($2) < 0) { long int i = longval (); if (i != ($2)) return 1; fprintf (f, "%ld", i); } else { unsigned long int i = ulongval (); if (i != ($2)) return 1; fprintf (f, "%lu", i); } /* Do not output a trailing newline, as this causes \r\n confusion on some platforms. */ return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : echo >>conftest.val; read $3 &5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.i conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ( $as_echo "## ----------------------------------------------- ## ## Report this to isl-development@googlegroups.com ## ## ----------------------------------------------- ##" ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_mongrel # ac_fn_c_check_decl LINENO SYMBOL VAR INCLUDES # --------------------------------------------- # Tests whether SYMBOL is declared in INCLUDES, setting cache variable VAR # accordingly. ac_fn_c_check_decl () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack as_decl_name=`echo $2|sed 's/ *(.*//'` as_decl_use=`echo $2|sed -e 's/(/((/' -e 's/)/) 0&/' -e 's/,/) 0& (/g'` { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $as_decl_name is declared" >&5 $as_echo_n "checking whether $as_decl_name is declared... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { #ifndef $as_decl_name #ifdef __cplusplus (void) $as_decl_use; #else (void) $as_decl_name; #endif #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_decl # ac_fn_c_check_member LINENO AGGR MEMBER VAR INCLUDES # ---------------------------------------------------- # Tries to find if the field MEMBER exists in type AGGR, after including # INCLUDES, setting cache variable VAR accordingly. ac_fn_c_check_member () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2.$3" >&5 $as_echo_n "checking for $2.$3... " >&6; } if eval \${$4+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $5 int main () { static $2 ac_aggr; if (ac_aggr.$3) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$4=yes" else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $5 int main () { static $2 ac_aggr; if (sizeof ac_aggr.$3) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$4=yes" else eval "$4=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$4 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_member # ac_fn_cxx_check_header_mongrel LINENO HEADER VAR INCLUDES # --------------------------------------------------------- # Tests whether HEADER exists, giving a warning if it cannot be compiled using # the include files in INCLUDES and setting the cache variable VAR # accordingly. ac_fn_cxx_check_header_mongrel () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if eval \${$3+:} false; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.i conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_cxx_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ( $as_echo "## ----------------------------------------------- ## ## Report this to isl-development@googlegroups.com ## ## ----------------------------------------------- ##" ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_cxx_check_header_mongrel cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by isl $as_me 0.12.1, which was generated by GNU Autoconf 2.68. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_aux_dir= for ac_dir in . "$srcdir"/.; do if test -f "$ac_dir/install-sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f "$ac_dir/install.sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f "$ac_dir/shtool"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then as_fn_error $? "cannot find install-sh, install.sh, or shtool in . \"$srcdir\"/." "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. am__api_version='1.11' # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if ${ac_cv_path_install+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error $? "unsafe srcdir value: \`$srcdir'" "$LINENO" 5;; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error $? "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi test "$2" = conftest.file ) then # Ok. : else as_fn_error $? "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if ${ac_cv_path_mkdir+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } mkdir_p="$MKDIR_P" case $mkdir_p in [\\/$]* | ?:[\\/]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AWK+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering ...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='isl' VERSION='0.12.1' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AMTAR='$${TAR-tar}' am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -' # Check whether --enable-silent-rules was given. if test "${enable_silent_rules+set}" = set; then : enableval=$enable_silent_rules; fi case $enable_silent_rules in yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=0;; esac am_make=${MAKE-make} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5 $as_echo_n "checking whether $am_make supports nested variables... " >&6; } if ${am_cv_make_support_nested_variables+:} false; then : $as_echo_n "(cached) " >&6 else if $as_echo 'TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5 $as_echo "$am_cv_make_support_nested_variables" >&6; } if test $am_cv_make_support_nested_variables = yes; then AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AM_BACKSLASH='\' versioninfo=12:1:2 if test "x$prefix" != "xNONE"; then prefix_wd=`cd $prefix && pwd` srcdir_wd=`cd $srcdir && pwd` wd=`pwd` if test "x$prefix_wd" = "x$srcdir_wd"; then as_fn_error $? "Installation in source directory not supported" "$LINENO" 5 fi if test "x$prefix_wd" = "x$wd"; then as_fn_error $? "Installation in build directory not supported" "$LINENO" 5 fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "C compiler cannot create executables See \`config.log' for more details" "$LINENO" 5; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details" "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if ${ac_cv_objext+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of object files: cannot compile See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CC_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -z "$CXX"; then if test -n "$CCC"; then CXX=$CCC else if test -n "$ac_tool_prefix"; then for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CXX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CXX="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CXX=$ac_cv_prog_CXX if test -n "$CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5 $as_echo "$CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CXX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CXX="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5 $as_echo "$ac_ct_CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CXX" && break done if test "x$ac_ct_CXX" = x; then CXX="g++" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CXX=$ac_ct_CXX fi fi fi fi # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5 $as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; } if ${ac_cv_cxx_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_cxx_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5 $as_echo "$ac_cv_cxx_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GXX=yes else GXX= fi ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5 $as_echo_n "checking whether $CXX accepts -g... " >&6; } if ${ac_cv_prog_cxx_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_cxx_werror_flag=$ac_cxx_werror_flag ac_cxx_werror_flag=yes ac_cv_prog_cxx_g=no CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes else CXXFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else ac_cxx_werror_flag=$ac_save_cxx_werror_flag CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cxx_werror_flag=$ac_save_cxx_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5 $as_echo "$ac_cv_prog_cxx_g" >&6; } if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu depcc="$CXX" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CXX_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5 $as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; } CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler vendor" >&5 $as_echo_n "checking for C compiler vendor... " >&6; } if ${ax_cv_c_compiler_vendor+:} false; then : $as_echo_n "(cached) " >&6 else ax_cv_c_compiler_vendor=unknown # note: don't check for gcc first since some other compilers define __GNUC__ for ventest in intel:__ICC,__ECC,__INTEL_COMPILER ibm:__xlc__,__xlC__,__IBMC__,__IBMCPP__ pathscale:__PATHCC__,__PATHSCALE__ clang:__clang__ gnu:__GNUC__ sun:__SUNPRO_C,__SUNPRO_CC hp:__HP_cc,__HP_aCC dec:__DECC,__DECCXX,__DECC_VER,__DECCXX_VER borland:__BORLANDC__,__TURBOC__ comeau:__COMO__ cray:_CRAYC kai:__KCC lcc:__LCC__ metrowerks:__MWERKS__ sgi:__sgi,sgi microsoft:_MSC_VER watcom:__WATCOMC__ portland:__PGI; do vencpp="defined("`echo $ventest | cut -d: -f2 | sed 's/,/) || defined(/g'`")" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #if !($vencpp) thisisanerror; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_compiler_vendor=`echo $ventest | cut -d: -f1`; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_c_compiler_vendor" >&5 $as_echo "$ax_cv_c_compiler_vendor" >&6; } # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if ${ac_cv_build+:} false; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if ${ac_cv_host+:} false; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac # Check whether --enable-portable-binary was given. if test "${enable_portable_binary+set}" = set; then : enableval=$enable_portable_binary; acx_maxopt_portable=$withval else acx_maxopt_portable=no fi # Try to determine "good" native compiler flags if none specified via CFLAGS if test "$ac_test_CFLAGS" != "set"; then CFLAGS="" case $ax_cv_c_compiler_vendor in dec) CFLAGS="-newc -w0 -O5 -ansi_alias -ansi_args -fp_reorder -tune host" if test "x$acx_maxopt_portable" = xno; then CFLAGS="$CFLAGS -arch host" fi;; sun) CFLAGS="-native -fast -xO5 -dalign" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS -xarch=generic" fi;; hp) CFLAGS="+Oall +Optrs_ansi +DSnative" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS +DAportable" fi;; ibm) if test "x$acx_maxopt_portable" = xno; then xlc_opt="-qarch=auto -qtune=auto" else xlc_opt="-qtune=auto" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $xlc_opt" >&5 $as_echo_n "checking whether C compiler accepts $xlc_opt... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$xlc_opt" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$xlc_opt" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$xlc_opt" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$xlc_opt" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="-O3 -qansialias -w $xlc_opt" else CFLAGS="-O3 -qansialias -w" echo "******************************************************" echo "* You seem to have the IBM C compiler. It is *" echo "* recommended for best performance that you use: *" echo "* *" echo "* CFLAGS=-O3 -qarch=xxx -qtune=xxx -qansialias -w *" echo "* ^^^ ^^^ *" echo "* where xxx is pwr2, pwr3, 604, or whatever kind of *" echo "* CPU you have. (Set the CFLAGS environment var. *" echo "* and re-run configure.) For more info, man cc. *" echo "******************************************************" fi ;; intel) CFLAGS="-O3 -ansi_alias" if test "x$acx_maxopt_portable" = xno; then icc_archflag=unknown icc_flags="" case $host_cpu in i686*|x86_64*) # icc accepts gcc assembly syntax, so these should work: ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 0 output" >&5 $as_echo_n "checking for x86 cpuid 0 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_0+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_0=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 0, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_0=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_0=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_0" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_0" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 1 output" >&5 $as_echo_n "checking for x86 cpuid 1 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_1+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_1=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 1, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_1=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_1=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_1" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_1" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu case $ax_cv_gcc_x86_cpuid_0 in # see AX_GCC_ARCHFLAG *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *6a?:*[234]:*:*|*6[789b]?:*:*:*) icc_flags="-xK";; *f3[347]:*:*:*|*f41347:*:*:*) icc_flags="-xP -xN -xW -xK";; *f??:*:*:*) icc_flags="-xN -xW -xK";; esac ;; esac ;; esac if test "x$icc_flags" != x; then for flag in $icc_flags; do { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $flag" >&5 $as_echo_n "checking whether C compiler accepts $flag... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$flag" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then icc_archflag=$flag; break else : fi done fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for icc architecture flag" >&5 $as_echo_n "checking for icc architecture flag... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $icc_archflag" >&5 $as_echo "$icc_archflag" >&6; } if test "x$icc_archflag" != xunknown; then CFLAGS="$CFLAGS $icc_archflag" fi fi ;; gnu) # default optimization flags for gcc on all systems CFLAGS="-O3 -fomit-frame-pointer" # -malign-double for x86 systems { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -malign-double" >&5 $as_echo_n "checking whether C compiler accepts -malign-double... " >&6; } if ${ax_cv_c_flags__malign_double+:} false; then : $as_echo_n "(cached) " >&6 else ax_save_FLAGS=$CFLAGS CFLAGS="-malign-double" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_flags__malign_double=yes else ax_cv_c_flags__malign_double=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS fi eval ax_check_compiler_flags=$ax_cv_c_flags__malign_double { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="$CFLAGS -malign-double" else : fi # -fstrict-aliasing for gcc-2.95+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fstrict-aliasing" >&5 $as_echo_n "checking whether C compiler accepts -fstrict-aliasing... " >&6; } if ${ax_cv_c_flags__fstrict_aliasing+:} false; then : $as_echo_n "(cached) " >&6 else ax_save_FLAGS=$CFLAGS CFLAGS="-fstrict-aliasing" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_flags__fstrict_aliasing=yes else ax_cv_c_flags__fstrict_aliasing=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS fi eval ax_check_compiler_flags=$ax_cv_c_flags__fstrict_aliasing { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="$CFLAGS -fstrict-aliasing" else : fi # note that we enable "unsafe" fp optimization with other compilers, too { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -ffast-math" >&5 $as_echo_n "checking whether C compiler accepts -ffast-math... " >&6; } if ${ax_cv_c_flags__ffast_math+:} false; then : $as_echo_n "(cached) " >&6 else ax_save_FLAGS=$CFLAGS CFLAGS="-ffast-math" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_flags__ffast_math=yes else ax_cv_c_flags__ffast_math=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS fi eval ax_check_compiler_flags=$ax_cv_c_flags__ffast_math { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="$CFLAGS -ffast-math" else : fi # Check whether --with-gcc-arch was given. if test "${with_gcc_arch+set}" = set; then : withval=$with_gcc_arch; ax_gcc_arch=$withval else ax_gcc_arch=yes fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for gcc architecture flag" >&5 $as_echo_n "checking for gcc architecture flag... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: " >&5 $as_echo "" >&6; } if ${ax_cv_gcc_archflag+:} false; then : $as_echo_n "(cached) " >&6 else ax_cv_gcc_archflag="unknown" if test "$GCC" = yes; then if test "x$ax_gcc_arch" = xyes; then ax_gcc_arch="" if test "$cross_compiling" = no; then case $host_cpu in i[3456]86*|x86_64*) # use cpuid codes, in part from x86info-1.7 by D. Jones ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 0 output" >&5 $as_echo_n "checking for x86 cpuid 0 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_0+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_0=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 0, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_0=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_0=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_0" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_0" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 1 output" >&5 $as_echo_n "checking for x86 cpuid 1 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_1+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_1=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 1, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_1=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_1=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_1" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_1" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu case $ax_cv_gcc_x86_cpuid_0 in *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *5[48]?:*:*:*) ax_gcc_arch="pentium-mmx pentium" ;; *5??:*:*:*) ax_gcc_arch=pentium ;; *6[3456]?:*:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[01]:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[234]:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6[9d]?:*:*:*) ax_gcc_arch="pentium-m pentium3 pentiumpro" ;; *6[78b]?:*:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6??:*:*:*) ax_gcc_arch=pentiumpro ;; *f3[347]:*:*:*|*f41347:*:*:*) case $host_cpu in x86_64*) ax_gcc_arch="nocona pentium4 pentiumpro" ;; *) ax_gcc_arch="prescott pentium4 pentiumpro" ;; esac ;; *f??:*:*:*) ax_gcc_arch="pentium4 pentiumpro";; esac ;; *:68747541:*:*) # AMD case $ax_cv_gcc_x86_cpuid_1 in *5[67]?:*:*:*) ax_gcc_arch=k6 ;; *5[8d]?:*:*:*) ax_gcc_arch="k6-2 k6" ;; *5[9]?:*:*:*) ax_gcc_arch="k6-3 k6" ;; *60?:*:*:*) ax_gcc_arch=k7 ;; *6[12]?:*:*:*) ax_gcc_arch="athlon k7" ;; *6[34]?:*:*:*) ax_gcc_arch="athlon-tbird k7" ;; *67?:*:*:*) ax_gcc_arch="athlon-4 athlon k7" ;; *6[68a]?:*:*:*) ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 0x80000006 output" >&5 $as_echo_n "checking for x86 cpuid 0x80000006 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_0x80000006+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_0x80000006=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 0x80000006, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_0x80000006=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_0x80000006=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_0x80000006" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_0x80000006" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # L2 cache size case $ax_cv_gcc_x86_cpuid_0x80000006 in *:*:*[1-9a-f]??????:*) # (L2 = ecx >> 16) >= 256 ax_gcc_arch="athlon-xp athlon-4 athlon k7" ;; *) ax_gcc_arch="athlon-4 athlon k7" ;; esac ;; *f[4cef8b]?:*:*:*) ax_gcc_arch="athlon64 k8" ;; *f5?:*:*:*) ax_gcc_arch="opteron k8" ;; *f7?:*:*:*) ax_gcc_arch="athlon-fx opteron k8" ;; *f??:*:*:*) ax_gcc_arch="k8" ;; esac ;; *:746e6543:*:*) # IDT case $ax_cv_gcc_x86_cpuid_1 in *54?:*:*:*) ax_gcc_arch=winchip-c6 ;; *58?:*:*:*) ax_gcc_arch=winchip2 ;; *6[78]?:*:*:*) ax_gcc_arch=c3 ;; *69?:*:*:*) ax_gcc_arch="c3-2 c3" ;; esac ;; esac if test x"$ax_gcc_arch" = x; then # fallback case $host_cpu in i586*) ax_gcc_arch=pentium ;; i686*) ax_gcc_arch=pentiumpro ;; esac fi ;; sparc*) # Extract the first word of "prtdiag", so it can be a program name with args. set dummy prtdiag; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_PRTDIAG+:} false; then : $as_echo_n "(cached) " >&6 else case $PRTDIAG in [\\/]* | ?:[\\/]*) ac_cv_path_PRTDIAG="$PRTDIAG" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_dummy="$PATH:/usr/platform/`uname -i`/sbin/:/usr/platform/`uname -m`/sbin/" for as_dir in $as_dummy do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_path_PRTDIAG="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_path_PRTDIAG" && ac_cv_path_PRTDIAG="prtdiag" ;; esac fi PRTDIAG=$ac_cv_path_PRTDIAG if test -n "$PRTDIAG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PRTDIAG" >&5 $as_echo "$PRTDIAG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi cputype=`(((grep cpu /proc/cpuinfo | cut -d: -f2) ; ($PRTDIAG -v |grep -i sparc) ; grep -i cpu /var/run/dmesg.boot ) | head -n 1) 2> /dev/null` cputype=`echo "$cputype" | tr -d ' -' |tr $as_cr_LETTERS $as_cr_letters` case $cputype in *ultrasparciv*) ax_gcc_arch="ultrasparc4 ultrasparc3 ultrasparc v9" ;; *ultrasparciii*) ax_gcc_arch="ultrasparc3 ultrasparc v9" ;; *ultrasparc*) ax_gcc_arch="ultrasparc v9" ;; *supersparc*|*tms390z5[05]*) ax_gcc_arch="supersparc v8" ;; *hypersparc*|*rt62[056]*) ax_gcc_arch="hypersparc v8" ;; *cypress*) ax_gcc_arch=cypress ;; esac ;; alphaev5) ax_gcc_arch=ev5 ;; alphaev56) ax_gcc_arch=ev56 ;; alphapca56) ax_gcc_arch="pca56 ev56" ;; alphapca57) ax_gcc_arch="pca57 pca56 ev56" ;; alphaev6) ax_gcc_arch=ev6 ;; alphaev67) ax_gcc_arch=ev67 ;; alphaev68) ax_gcc_arch="ev68 ev67" ;; alphaev69) ax_gcc_arch="ev69 ev68 ev67" ;; alphaev7) ax_gcc_arch="ev7 ev69 ev68 ev67" ;; alphaev79) ax_gcc_arch="ev79 ev7 ev69 ev68 ev67" ;; powerpc*) cputype=`((grep cpu /proc/cpuinfo | head -n 1 | cut -d: -f2 | cut -d, -f1 | sed 's/ //g') ; /usr/bin/machine ; /bin/machine; grep CPU /var/run/dmesg.boot | head -n 1 | cut -d" " -f2) 2> /dev/null` cputype=`echo $cputype | sed -e 's/ppc//g;s/ *//g'` case $cputype in *750*) ax_gcc_arch="750 G3" ;; *740[0-9]*) ax_gcc_arch="$cputype 7400 G4" ;; *74[4-5][0-9]*) ax_gcc_arch="$cputype 7450 G4" ;; *74[0-9][0-9]*) ax_gcc_arch="$cputype G4" ;; *970*) ax_gcc_arch="970 G5 power4";; *POWER4*|*power4*|*gq*) ax_gcc_arch="power4 970";; *POWER5*|*power5*|*gr*|*gs*) ax_gcc_arch="power5 power4 970";; 603ev|8240) ax_gcc_arch="$cputype 603e 603";; *) ax_gcc_arch=$cputype ;; esac ax_gcc_arch="$ax_gcc_arch powerpc" ;; esac fi # not cross-compiling fi # guess arch if test "x$ax_gcc_arch" != x -a "x$ax_gcc_arch" != xno; then for arch in $ax_gcc_arch; do if test "x$acx_maxopt_portable" = xyes; then # if we require portable code flags="-mtune=$arch" # -mcpu=$arch and m$arch generate nonportable code on every arch except # x86. And some other arches (e.g. Alpha) don't accept -mtune. Grrr. case $host_cpu in i*86|x86_64*) flags="$flags -mcpu=$arch -m$arch";; esac else flags="-march=$arch -mcpu=$arch -m$arch" fi for flag in $flags; do { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $flag" >&5 $as_echo_n "checking whether C compiler accepts $flag... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$flag" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then ax_cv_gcc_archflag=$flag; break else : fi done test "x$ax_cv_gcc_archflag" = xunknown || break done fi fi # $GCC=yes fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for gcc architecture flag" >&5 $as_echo_n "checking for gcc architecture flag... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_archflag" >&5 $as_echo "$ax_cv_gcc_archflag" >&6; } if test "x$ax_cv_gcc_archflag" = xunknown; then : else CFLAGS="$CFLAGS $ax_cv_gcc_archflag" fi # drop to -O1 for gcc 4.2 $CC --version | sed -e 's/.* \([0-9][0-9]*\)\.\([0-9][0-9]*\).*/\1 \2/' | (read major minor if test $major -eq 4 -a $minor -eq 2; then exit 0 fi exit 1 ) && CFLAGS="-O1" ;; esac if test -z "$CFLAGS"; then echo "" echo "********************************************************" echo "* WARNING: Don't know the best CFLAGS for this system *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "* (otherwise, a default of CFLAGS=-O3 will be used) *" echo "********************************************************" echo "" CFLAGS="-O3" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $CFLAGS" >&5 $as_echo_n "checking whether C compiler accepts $CFLAGS... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$CFLAGS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$CFLAGS" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$CFLAGS" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$CFLAGS" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then : else echo "" echo "********************************************************" echo "* WARNING: The guessed CFLAGS don't seem to work with *" echo "* your compiler. *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "********************************************************" echo "" CFLAGS="" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the compiler supports function __attribute__((__warn_unused_result__))" >&5 $as_echo_n "checking whether the compiler supports function __attribute__((__warn_unused_result__))... " >&6; } if ${ax_cv_gcc_warn_unused_result+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ __attribute__((__warn_unused_result__)) int f(int i) { return i; } int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_gcc_warn_unused_result=yes else ax_cv_gcc_warn_unused_result=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_warn_unused_result" >&5 $as_echo "$ax_cv_gcc_warn_unused_result" >&6; } if test "$ax_cv_gcc_warn_unused_result" = yes; then $as_echo "#define GCC_WARN_UNUSED_RESULT __attribute__((__warn_unused_result__))" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for __attribute__" >&5 $as_echo_n "checking for __attribute__... " >&6; } if ${ax_cv___attribute__+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include static void foo(void) __attribute__ ((unused)); static void foo(void) { exit(1); } int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv___attribute__=yes else ax_cv___attribute__=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv___attribute__" >&5 $as_echo "$ax_cv___attribute__" >&6; } if test "$ax_cv___attribute__" = "yes"; then $as_echo "#define HAVE___ATTRIBUTE__ 1" >>confdefs.h fi case `pwd` in *\ * | *\ *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5 $as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;; esac macro_version='2.4.2.418' macro_revision='2.4.2.418' ltmain=$ac_aux_dir/ltmain.sh # Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\(["`$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to print strings" >&5 $as_echo_n "checking how to print strings... " >&6; } # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "" } case $ECHO in printf*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: printf" >&5 $as_echo "printf" >&6; } ;; print*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: print -r" >&5 $as_echo "print -r" >&6; } ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: cat" >&5 $as_echo "cat" >&6; } ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5 $as_echo_n "checking for a sed that does not truncate output... " >&6; } if ${ac_cv_path_SED+:} false; then : $as_echo_n "(cached) " >&6 else ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/ for ac_i in 1 2 3 4 5 6 7; do ac_script="$ac_script$as_nl$ac_script" done echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed { ac_script=; unset ac_script;} if test -z "$SED"; then ac_path_SED_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_SED="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_SED" && $as_test_x "$ac_path_SED"; } || continue # Check for GNU ac_path_SED and select it if it is found. # Check for GNU $ac_path_SED case `"$ac_path_SED" --version 2>&1` in *GNU*) ac_cv_path_SED="$ac_path_SED" ac_path_SED_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo '' >> "conftest.nl" "$ac_path_SED" -f conftest.sed < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_SED_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_SED="$ac_path_SED" ac_path_SED_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_SED_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_SED"; then as_fn_error $? "no acceptable sed could be found in \$PATH" "$LINENO" 5 fi else ac_cv_path_SED=$SED fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5 $as_echo "$ac_cv_path_SED" >&6; } SED="$ac_cv_path_SED" rm -f conftest.sed test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if ${ac_cv_path_EGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for fgrep" >&5 $as_echo_n "checking for fgrep... " >&6; } if ${ac_cv_path_FGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1 then ac_cv_path_FGREP="$GREP -F" else if test -z "$FGREP"; then ac_path_FGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in fgrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_FGREP" && $as_test_x "$ac_path_FGREP"; } || continue # Check for GNU ac_path_FGREP and select it if it is found. # Check for GNU $ac_path_FGREP case `"$ac_path_FGREP" --version 2>&1` in *GNU*) ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'FGREP' >> "conftest.nl" "$ac_path_FGREP" FGREP < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_FGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_FGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_FGREP"; then as_fn_error $? "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_FGREP=$FGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5 $as_echo "$ac_cv_path_FGREP" >&6; } FGREP="$ac_cv_path_FGREP" test -z "$GREP" && GREP=grep # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test no = "$withval" || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test yes = "$GCC"; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return, which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD=$ac_prog ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test yes = "$with_gnu_ld"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${lt_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD=$ac_dir/$ac_prog # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${lt_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5 $as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; } if ${lt_cv_path_NM+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM=$NM else lt_nm_to_check=${ac_tool_prefix}nm if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. tmp_nm=$ac_dir/$lt_tmp_nm if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext"; then # Check to see if the nm accepts a BSD-compat flag. # Adding the 'sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break 2 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break 2 ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS=$lt_save_ifs done : ${lt_cv_path_NM=no} fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5 $as_echo "$lt_cv_path_NM" >&6; } if test no != "$lt_cv_path_NM"; then NM=$lt_cv_path_NM else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else if test -n "$ac_tool_prefix"; then for ac_prog in dumpbin "link -dump" do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DUMPBIN"; then ac_cv_prog_DUMPBIN="$DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DUMPBIN="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DUMPBIN=$ac_cv_prog_DUMPBIN if test -n "$DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5 $as_echo "$DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DUMPBIN" && break done fi if test -z "$DUMPBIN"; then ac_ct_DUMPBIN=$DUMPBIN for ac_prog in dumpbin "link -dump" do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DUMPBIN"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DUMPBIN="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN if test -n "$ac_ct_DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5 $as_echo "$ac_ct_DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_DUMPBIN" && break done if test "x$ac_ct_DUMPBIN" = x; then DUMPBIN=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DUMPBIN=$ac_ct_DUMPBIN fi fi case `$DUMPBIN -symbols -headers /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols -headers" ;; *) DUMPBIN=: ;; esac fi if test : != "$DUMPBIN"; then NM=$DUMPBIN fi fi test -z "$NM" && NM=nm { $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5 $as_echo_n "checking the name lister ($NM) interface... " >&6; } if ${lt_cv_nm_interface+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&5) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&5) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: output\"" >&5) cat conftest.out >&5 if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5 $as_echo "$lt_cv_nm_interface" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5 $as_echo_n "checking whether ln -s works... " >&6; } LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5 $as_echo "no, using $LN_S" >&6; } fi # find the maximum length of command line arguments { $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5 $as_echo_n "checking the maximum length of command line arguments... " >&6; } if ${lt_cv_sys_max_cmd_len+:} false; then : $as_echo_n "(cached) " >&6 else i=0 teststring=ABCD case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; bitrig* | darwin* | dragonfly* | freebsd* | netbsd* | openbsd*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test X`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test 17 != "$i" # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac fi if test -n "$lt_cv_sys_max_cmd_len"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5 $as_echo "$lt_cv_sys_max_cmd_len" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5 $as_echo "none" >&6; } fi max_cmd_len=$lt_cv_sys_max_cmd_len : ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to $host format" >&5 $as_echo_n "checking how to convert $build file names to $host format... " >&6; } if ${lt_cv_to_host_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac fi to_host_file_cmd=$lt_cv_to_host_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_host_file_cmd" >&5 $as_echo "$lt_cv_to_host_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to toolchain format" >&5 $as_echo_n "checking how to convert $build file names to toolchain format... " >&6; } if ${lt_cv_to_tool_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else #assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac fi to_tool_file_cmd=$lt_cv_to_tool_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_tool_file_cmd" >&5 $as_echo "$lt_cv_to_tool_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5 $as_echo_n "checking for $LD option to reload object files... " >&6; } if ${lt_cv_ld_reload_flag+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_reload_flag='-r' fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5 $as_echo "$lt_cv_ld_reload_flag" >&6; } reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in cygwin* | mingw* | pw32* | cegcc*) if test yes != "$GCC"; then reload_cmds=false fi ;; darwin*) if test yes = "$GCC"; then reload_cmds='$LTCC $LTCFLAGS -nostdlib $wl-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args. set dummy ${ac_tool_prefix}objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OBJDUMP"; then ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OBJDUMP=$ac_cv_prog_OBJDUMP if test -n "$OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5 $as_echo "$OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OBJDUMP"; then ac_ct_OBJDUMP=$OBJDUMP # Extract the first word of "objdump", so it can be a program name with args. set dummy objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OBJDUMP"; then ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OBJDUMP="objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP if test -n "$ac_ct_OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5 $as_echo "$ac_ct_OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OBJDUMP" = x; then OBJDUMP="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OBJDUMP=$ac_ct_OBJDUMP fi else OBJDUMP="$ac_cv_prog_OBJDUMP" fi test -z "$OBJDUMP" && OBJDUMP=objdump { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5 $as_echo_n "checking how to recognize dependent libraries... " >&6; } if ${lt_cv_deplibs_check_method+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # 'unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # that responds to the $file_magic_cmd with a given extended regex. # If you have 'file' or equivalent on your system and you're not sure # whether 'pass_all' will *always* work, you probably want this one. case $host_os in aix[4-9]*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump', # unless we find 'file', for example because we are cross-compiling. if ( file / ) >/dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9]\.[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[3-9]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd* | bitrig*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5 $as_echo "$lt_cv_deplibs_check_method" >&6; } file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[\1]\/[\1]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dlltool", so it can be a program name with args. set dummy ${ac_tool_prefix}dlltool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DLLTOOL"; then ac_cv_prog_DLLTOOL="$DLLTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DLLTOOL="${ac_tool_prefix}dlltool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DLLTOOL=$ac_cv_prog_DLLTOOL if test -n "$DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DLLTOOL" >&5 $as_echo "$DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DLLTOOL"; then ac_ct_DLLTOOL=$DLLTOOL # Extract the first word of "dlltool", so it can be a program name with args. set dummy dlltool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DLLTOOL"; then ac_cv_prog_ac_ct_DLLTOOL="$ac_ct_DLLTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DLLTOOL="dlltool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL if test -n "$ac_ct_DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL" >&5 $as_echo "$ac_ct_DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DLLTOOL" = x; then DLLTOOL="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DLLTOOL=$ac_ct_DLLTOOL fi else DLLTOOL="$ac_cv_prog_DLLTOOL" fi test -z "$DLLTOOL" && DLLTOOL=dlltool { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to associate runtime and link libraries" >&5 $as_echo_n "checking how to associate runtime and link libraries... " >&6; } if ${lt_cv_sharedlib_from_linklib_cmd+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh; # decide which one to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd=$ECHO ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sharedlib_from_linklib_cmd" >&5 $as_echo "$lt_cv_sharedlib_from_linklib_cmd" >&6; } sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO if test -n "$ac_tool_prefix"; then for ac_prog in ar do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AR="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AR" && break done fi if test -z "$AR"; then ac_ct_AR=$AR for ac_prog in ar do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_AR="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_AR" && break done if test "x$ac_ct_AR" = x; then AR="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac AR=$ac_ct_AR fi fi : ${AR=ar} : ${AR_FLAGS=cru} { $as_echo "$as_me:${as_lineno-$LINENO}: checking for archiver @FILE support" >&5 $as_echo_n "checking for archiver @FILE support... " >&6; } if ${lt_cv_ar_at_file+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ar_at_file=no cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&5' { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test 0 -eq "$ac_status"; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test 0 -ne "$ac_status"; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ar_at_file" >&5 $as_echo "$lt_cv_ar_at_file" >&6; } if test no = "$lt_cv_ar_at_file"; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi test -z "$STRIP" && STRIP=: if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi test -z "$RANLIB" && RANLIB=: # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in bitrig* | openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check for command to grab the raw symbol name followed by C symbol from nm. { $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5 $as_echo_n "checking command to parse $NM output from $compiler object... " >&6; } if ${lt_cv_sys_global_symbol_pipe+:} false; then : $as_echo_n "(cached) " >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[ABCDGISTW]' ;; hpux*) if test ia64 = "$host_cpu"; then symcode='[ABCDEGRST]' fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Gets list of data symbols to import. lt_cv_sys_global_symbol_to_import="sed -n -e 's/^I .* \(.*\)$/\1/p'" # Adjust the below global symbol transforms to fixup imported variables. lt_cdecl_hook=" -e 's/^I .* \(.*\)$/extern __declspec(dllimport) char \1;/p'" lt_c_name_hook=" -e 's/^I .* \(.*\)$/ {\"\1\", (void *) 0},/p'" lt_c_name_lib_hook="\ -e 's/^I .* \(lib.*\)$/ {\"\1\", (void *) 0},/p'\ -e 's/^I .* \(.*\)$/ {\"lib\1\", (void *) 0},/p'" else # Disable hooks by default. lt_cv_sys_global_symbol_to_import= lt_cdecl_hook= lt_c_name_hook= lt_c_name_lib_hook= fi # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n"\ $lt_cdecl_hook\ " -e 's/^T .* \(.*\)$/extern int \1();/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n"\ $lt_c_name_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/p'" # Transform an extracted symbol line into symbol name with lib prefix and # symbol address. lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n"\ $lt_c_name_lib_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(lib.*\)$/ {\"\1\", (void *) \&\1},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"lib\1\", (void *) \&\1},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function, # D for any global variable and I for any imported variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK '"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " /^ *Symbol name *: /{split(\$ 0,sn,\":\"); si=substr(sn[2],2)};"\ " /^ *Type *: code/{print \"T\",si,substr(si,length(prfx))};"\ " /^ *Type *: data/{print \"I\",si,substr(si,length(prfx))};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=\"D\"}; \$ 0~/\(\).*\|/{f=\"T\"};"\ " {split(\$ 0,a,/\||\r/); split(a[2],s)};"\ " s[1]~/^[@?]/{print f,s[1],s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print f,t[1],substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Now try to grab the symbols. nlist=conftest.nm if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist\""; } >&5 (eval $NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE /* DATA imports from DLLs on WIN32 can't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined __osf__ /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS=conftstm.$ac_objext CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest$ac_exeext; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test yes = "$pipe_works"; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[@]FILE' >/dev/null; then nm_file_list_spec='@' fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for sysroot" >&5 $as_echo_n "checking for sysroot... " >&6; } # Check whether --with-sysroot was given. if test "${with_sysroot+set}" = set; then : withval=$with_sysroot; else with_sysroot=no fi lt_sysroot= case $with_sysroot in #( yes) if test yes = "$GCC"; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_sysroot" >&5 $as_echo "$with_sysroot" >&6; } as_fn_error $? "The sysroot must be an absolute path." "$LINENO" 5 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${lt_sysroot:-no}" >&5 $as_echo "${lt_sysroot:-no}" >&6; } # Check whether --enable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then : enableval=$enable_libtool_lock; fi test no = "$enable_libtool_lock" || enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out what ABI is being produced by ac_compile, and set mode # options accordingly. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE=32 ;; *ELF-64*) HPUX_IA64_MODE=64 ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '#line '$LINENO' "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then if test yes = "$lt_cv_prog_gnu_ld"; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; mips64*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '#line '$LINENO' "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then emul=elf case `/usr/bin/file conftest.$ac_objext` in *32-bit*) emul="${emul}32" ;; *64-bit*) emul="${emul}64" ;; esac case `/usr/bin/file conftest.$ac_objext` in *MSB*) emul="${emul}btsmip" ;; *LSB*) emul="${emul}ltsmip" ;; esac case `/usr/bin/file conftest.$ac_objext` in *N32*) emul="${emul}n32" ;; esac LD="${LD-ld} -m $emul" fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. Note that the listed cases only cover the # situations where additional linker options are needed (such as when # doing 32-bit compilation for a host where ld defaults to 64-bit, or # vice versa); the common cases where no linker options are needed do # not appear in the list. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*linux*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*linux*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS=$CFLAGS CFLAGS="$CFLAGS -belf" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5 $as_echo_n "checking whether the C compiler needs -belf... " >&6; } if ${lt_cv_cc_needs_belf+:} false; then : $as_echo_n "(cached) " >&6 else ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_cc_needs_belf=yes else lt_cv_cc_needs_belf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5 $as_echo "$lt_cv_cc_needs_belf" >&6; } if test yes != "$lt_cv_cc_needs_belf"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS=$SAVE_CFLAGS fi ;; *-*solaris*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*|x86_64-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD=${LD-ld}_sol2 fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks=$enable_libtool_lock if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}mt", so it can be a program name with args. set dummy ${ac_tool_prefix}mt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$MANIFEST_TOOL"; then ac_cv_prog_MANIFEST_TOOL="$MANIFEST_TOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_MANIFEST_TOOL="${ac_tool_prefix}mt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi MANIFEST_TOOL=$ac_cv_prog_MANIFEST_TOOL if test -n "$MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MANIFEST_TOOL" >&5 $as_echo "$MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_MANIFEST_TOOL"; then ac_ct_MANIFEST_TOOL=$MANIFEST_TOOL # Extract the first word of "mt", so it can be a program name with args. set dummy mt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_MANIFEST_TOOL"; then ac_cv_prog_ac_ct_MANIFEST_TOOL="$ac_ct_MANIFEST_TOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_MANIFEST_TOOL="mt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_MANIFEST_TOOL=$ac_cv_prog_ac_ct_MANIFEST_TOOL if test -n "$ac_ct_MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_MANIFEST_TOOL" >&5 $as_echo "$ac_ct_MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_MANIFEST_TOOL" = x; then MANIFEST_TOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac MANIFEST_TOOL=$ac_ct_MANIFEST_TOOL fi else MANIFEST_TOOL="$ac_cv_prog_MANIFEST_TOOL" fi test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $MANIFEST_TOOL is a manifest tool" >&5 $as_echo_n "checking if $MANIFEST_TOOL is a manifest tool... " >&6; } if ${lt_cv_path_mainfest_tool+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&5 $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&5 if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_mainfest_tool" >&5 $as_echo "$lt_cv_path_mainfest_tool" >&6; } if test yes != "$lt_cv_path_mainfest_tool"; then MANIFEST_TOOL=: fi case $host_os in rhapsody* | darwin*) if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args. set dummy ${ac_tool_prefix}dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DSYMUTIL"; then ac_cv_prog_DSYMUTIL="$DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DSYMUTIL="${ac_tool_prefix}dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DSYMUTIL=$ac_cv_prog_DSYMUTIL if test -n "$DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5 $as_echo "$DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DSYMUTIL"; then ac_ct_DSYMUTIL=$DSYMUTIL # Extract the first word of "dsymutil", so it can be a program name with args. set dummy dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DSYMUTIL"; then ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DSYMUTIL="dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL if test -n "$ac_ct_DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5 $as_echo "$ac_ct_DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DSYMUTIL" = x; then DSYMUTIL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DSYMUTIL=$ac_ct_DSYMUTIL fi else DSYMUTIL="$ac_cv_prog_DSYMUTIL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args. set dummy ${ac_tool_prefix}nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NMEDIT"; then ac_cv_prog_NMEDIT="$NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_NMEDIT="${ac_tool_prefix}nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi NMEDIT=$ac_cv_prog_NMEDIT if test -n "$NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5 $as_echo "$NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_NMEDIT"; then ac_ct_NMEDIT=$NMEDIT # Extract the first word of "nmedit", so it can be a program name with args. set dummy nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_NMEDIT"; then ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_NMEDIT="nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT if test -n "$ac_ct_NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5 $as_echo "$ac_ct_NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_NMEDIT" = x; then NMEDIT=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac NMEDIT=$ac_ct_NMEDIT fi else NMEDIT="$ac_cv_prog_NMEDIT" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args. set dummy ${ac_tool_prefix}lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$LIPO"; then ac_cv_prog_LIPO="$LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_LIPO="${ac_tool_prefix}lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LIPO=$ac_cv_prog_LIPO if test -n "$LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5 $as_echo "$LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_LIPO"; then ac_ct_LIPO=$LIPO # Extract the first word of "lipo", so it can be a program name with args. set dummy lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_LIPO"; then ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_LIPO="lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO if test -n "$ac_ct_LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5 $as_echo "$ac_ct_LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_LIPO" = x; then LIPO=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac LIPO=$ac_ct_LIPO fi else LIPO="$ac_cv_prog_LIPO" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args. set dummy ${ac_tool_prefix}otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL"; then ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL="${ac_tool_prefix}otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL=$ac_cv_prog_OTOOL if test -n "$OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5 $as_echo "$OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL"; then ac_ct_OTOOL=$OTOOL # Extract the first word of "otool", so it can be a program name with args. set dummy otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL"; then ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL="otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL if test -n "$ac_ct_OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5 $as_echo "$ac_ct_OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL" = x; then OTOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL=$ac_ct_OTOOL fi else OTOOL="$ac_cv_prog_OTOOL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args. set dummy ${ac_tool_prefix}otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL64"; then ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL64=$ac_cv_prog_OTOOL64 if test -n "$OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5 $as_echo "$OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL64"; then ac_ct_OTOOL64=$OTOOL64 # Extract the first word of "otool64", so it can be a program name with args. set dummy otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL64"; then ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL64="otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64 if test -n "$ac_ct_OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5 $as_echo "$ac_ct_OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL64" = x; then OTOOL64=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL64=$ac_ct_OTOOL64 fi else OTOOL64="$ac_cv_prog_OTOOL64" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5 $as_echo_n "checking for -single_module linker flag... " >&6; } if ${lt_cv_apple_cc_single_mod+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_apple_cc_single_mod=no if test -z "$LT_MULTI_MODULE"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&5 $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&5 # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test 0 = "$_lt_result"; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&5 fi rm -rf libconftest.dylib* rm -f conftest.* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5 $as_echo "$lt_cv_apple_cc_single_mod" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5 $as_echo_n "checking for -exported_symbols_list linker flag... " >&6; } if ${lt_cv_ld_exported_symbols_list+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_ld_exported_symbols_list=yes else lt_cv_ld_exported_symbols_list=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5 $as_echo "$lt_cv_ld_exported_symbols_list" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -force_load linker flag" >&5 $as_echo_n "checking for -force_load linker flag... " >&6; } if ${lt_cv_ld_force_load+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&5 $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&5 echo "$AR cru libconftest.a conftest.o" >&5 $AR cru libconftest.a conftest.o 2>&5 echo "$RANLIB libconftest.a" >&5 $RANLIB libconftest.a 2>&5 cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&5 $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&5 elif test -f conftest && test 0 = "$_lt_result" && $GREP forced_load conftest >/dev/null 2>&1; then lt_cv_ld_force_load=yes else cat conftest.err >&5 fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_force_load" >&5 $as_echo "$lt_cv_ld_force_load" >&6; } case $host_os in rhapsody* | darwin1.[012]) _lt_dar_allow_undefined='$wl-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[91]*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; 10.[012]*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test yes = "$lt_cv_apple_cc_single_mod"; then _lt_dar_single_mod='$single_module' fi if test yes = "$lt_cv_ld_exported_symbols_list"; then _lt_dar_export_syms=' $wl-exported_symbols_list,$output_objdir/$libname-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/$libname-symbols.expsym $lib' fi if test : != "$DSYMUTIL" && test no = "$lt_cv_ld_force_load"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if ${ac_cv_prog_CPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do : ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default " if test "x$ac_cv_header_dlfcn_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_DLFCN_H 1 _ACEOF fi done func_stripname_cnf () { case $2 in .*) func_stripname_result=`$ECHO "$3" | $SED "s%^$1%%; s%\\\\$2\$%%"`;; *) func_stripname_result=`$ECHO "$3" | $SED "s%^$1%%; s%$2\$%%"`;; esac } # func_stripname_cnf # Set options enable_dlopen=no enable_win32_dll=no # Check whether --enable-shared was given. if test "${enable_shared+set}" = set; then : enableval=$enable_shared; p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS=$lt_save_ifs ;; esac else enable_shared=yes fi # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS=$lt_save_ifs ;; esac else enable_static=yes fi # Check whether --with-pic was given. if test "${with_pic+set}" = set; then : withval=$with_pic; lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for lt_pkg in $withval; do IFS=$lt_save_ifs if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS=$lt_save_ifs ;; esac else pic_mode=default fi # Check whether --enable-fast-install was given. if test "${enable_fast_install+set}" = set; then : enableval=$enable_fast_install; p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS=$lt_save_ifs ;; esac else enable_fast_install=yes fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS=$ltmain # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' test -z "$LN_S" && LN_S="ln -s" if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5 $as_echo_n "checking for objdir... " >&6; } if ${lt_cv_objdir+:} false; then : $as_echo_n "(cached) " >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5 $as_echo "$lt_cv_objdir" >&6; } objdir=$lt_cv_objdir cat >>confdefs.h <<_ACEOF #define LT_OBJDIR "$lt_cv_objdir/" _ACEOF case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a '.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld=$lt_cv_prog_gnu_ld old_CC=$CC old_CFLAGS=$CFLAGS # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5 $as_echo_n "checking for ${ac_tool_prefix}file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD=$MAGIC_CMD lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/${ac_tool_prefix}file"; then lt_cv_path_MAGIC_CMD=$ac_dir/"${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD=$lt_cv_path_MAGIC_CMD if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS=$lt_save_ifs MAGIC_CMD=$lt_save_MAGIC_CMD ;; esac fi MAGIC_CMD=$lt_cv_path_MAGIC_CMD if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5 $as_echo_n "checking for file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD=$MAGIC_CMD lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/file"; then lt_cv_path_MAGIC_CMD=$ac_dir/"file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD=$lt_cv_path_MAGIC_CMD if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS=$lt_save_ifs MAGIC_CMD=$lt_save_MAGIC_CMD ;; esac fi MAGIC_CMD=$lt_cv_path_MAGIC_CMD if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi else MAGIC_CMD=: fi fi fi ;; esac # Use C for the default configuration in the libtool script lt_save_CC=$CC ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then lt_prog_compiler_no_builtin_flag= if test yes = "$GCC"; then case $cc_basename in nvcc*) lt_prog_compiler_no_builtin_flag=' -Xcompiler -fno-builtin' ;; *) lt_prog_compiler_no_builtin_flag=' -fno-builtin' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 $as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; } if ${lt_cv_prog_compiler_rtti_exceptions+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" ## exclude from sc_useless_quotes_in_assignment # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 $as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; } if test yes = "$lt_cv_prog_compiler_rtti_exceptions"; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= if test yes = "$GCC"; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi lt_prog_compiler_pic='-fPIC' ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the '-m68020' flag to GCC prevents building anything better, # like '-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. lt_prog_compiler_static= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; *) lt_prog_compiler_pic='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 lt_prog_compiler_wl='-Xlinker ' if test -n "$lt_prog_compiler_pic"; then lt_prog_compiler_pic="-Xcompiler $lt_prog_compiler_pic" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' case $cc_basename in nagfor*) # NAG Fortran compiler lt_prog_compiler_wl='-Wl,-Wl,,' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; esac ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='$wl-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64, which still supported -KPIC. ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; # Lahey Fortran 8.1. lf95*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='--shared' lt_prog_compiler_static='--static' ;; nagfor*) # NAG Fortran compiler lt_prog_compiler_wl='-Wl,-Wl,,' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; tcc*) # Fabrice Bellard et al's Tiny C Compiler lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-qpic' lt_prog_compiler_static='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [1-7].* | *Sun*Fortran*\ 8.[0-3]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='' ;; *Sun\ F* | *Sun*Fortran*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Wl,' ;; *Intel*\ [CF]*Compiler*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; *Portland\ Group*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; esac ;; esac ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; rdos*) lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi case $host_os in # For platforms that do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if ${lt_cv_prog_compiler_pic+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic=$lt_prog_compiler_pic fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic" >&5 $as_echo "$lt_cv_prog_compiler_pic" >&6; } lt_prog_compiler_pic=$lt_cv_prog_compiler_pic # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; } if ${lt_cv_prog_compiler_pic_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" ## exclude from sc_useless_quotes_in_assignment # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5 $as_echo "$lt_cv_prog_compiler_pic_works" >&6; } if test yes = "$lt_cv_prog_compiler_pic_works"; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if ${lt_cv_prog_compiler_static_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works=yes fi else lt_cv_prog_compiler_static_works=yes fi fi $RM -r conftest* LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5 $as_echo "$lt_cv_prog_compiler_static_works" >&6; } if test yes = "$lt_cv_prog_compiler_static_works"; then : else lt_prog_compiler_static= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } hard_links=nottested if test no = "$lt_cv_prog_compiler_c_o" && test no != "$need_locks"; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test no = "$hard_links"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } runpath_var= allow_undefined_flag= always_export_symbols=no archive_cmds= archive_expsym_cmds= compiler_needs_object=no enable_shared_with_static_runtimes=no export_dynamic_flag_spec= export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' hardcode_automatic=no hardcode_direct=no hardcode_direct_absolute=no hardcode_libdir_flag_spec= hardcode_libdir_separator= hardcode_minus_L=no hardcode_shlibpath_var=unsupported inherit_rpath=no link_all_deplibs=unknown module_cmds= module_expsym_cmds= old_archive_from_new_cmds= old_archive_from_expsyms_cmds= thread_safe_flag_spec= whole_archive_flag_spec= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ' (' and ')$', so one must not match beginning or # end of line. Example: 'a|bc|.*d.*' will exclude the symbols 'a' and 'bc', # as well as any symbol that contains 'd'. exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test yes != "$GCC"; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd* | bitrig*) with_gnu_ld=no ;; esac ld_shlibs=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test yes = "$with_gnu_ld"; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[2-9]*) ;; *\ \(GNU\ Binutils\)\ [3-9]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test yes = "$lt_use_gnu_ld_interface"; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='$wl' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' export_dynamic_flag_spec='$wl--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v | $SED -e 's/(^)\+)\s\+//' 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[3-9]*) # On AIX/PPC, the GNU linker is very broken if test ia64 != "$host_cpu"; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' export_dynamic_flag_spec='$wl--export-all-symbols' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file, use it as # is; otherwise, prepend EXPORTS... archive_expsym_cmds='if test DEF = "`$SED -n -e '\''s/^[ ]*//'\'' -e '\''/^\(;.*\)*$/d'\'' -e '\''s/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p'\'' -e q $export_symbols`" ; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; haiku*) archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' link_all_deplibs=yes ;; interix[3-9]*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='$wl-rpath,$libdir' export_dynamic_flag_spec='$wl-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s|^|_|" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test linux-dietlibc = "$host_os"; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test no = "$tmp_diet" then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 whole_archive_flag_spec= tmp_sharedflag='--shared' ;; nagfor*) # NAGFOR 5.3 tmp_sharedflag='-Wl,-shared' ;; xl[cC]* | bgxl[cC]* | mpixl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' compiler_needs_object=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 whole_archive_flag_spec='$wl--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' compiler_needs_object=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' if test yes = "$supports_anon_versioning"; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test yes = "$supports_anon_versioning"; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else ld_shlibs=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 cannot *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test no = "$ld_shlibs"; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test yes = "$GCC" && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix[4-9]*) if test ia64 = "$host_cpu"; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag= else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do if (test x-brtl = "x$ld_flag" || test x-Wl,-brtl = "x$ld_flag"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_direct_absolute=yes hardcode_libdir_separator=':' link_all_deplibs=yes file_list_spec='$wl-f,' if test yes = "$GCC"; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`$CC -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test yes = "$aix_use_runtimelinking"; then shared_flag="$shared_flag "'$wl-G' fi else # not using gcc if test ia64 = "$host_cpu"; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test yes = "$aix_use_runtimelinking"; then shared_flag='$wl-G' else shared_flag='$wl-bM:SRE' fi fi fi export_dynamic_flag_spec='$wl-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test yes = "$aix_use_runtimelinking"; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an # empty executable. if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=/usr/lib:/lib fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='$wl-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n "$allow_undefined_flag"; then func_echo_all "$wl$allow_undefined_flag"; else :; fi` $wl'$exp_sym_flag:\$export_symbols' '$shared_flag else if test ia64 = "$host_cpu"; then hardcode_libdir_flag_spec='$wl-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\$wl$no_entry_flag"' $compiler_flags $wl$allow_undefined_flag '"\$wl$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=/usr/lib:/lib fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='$wl-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' $wl-bernotok' allow_undefined_flag=' $wl-berok' if test yes = "$with_gnu_ld"; then # We only use this code for GNU lds that support --whole-archive. whole_archive_flag_spec='$wl--whole-archive$convenience $wl--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' fi archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $wl-bnoentry $compiler_flags $wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported always_export_symbols=yes file_list_spec='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~linknames=' archive_expsym_cmds='if test DEF = "`$SED -n -e '\''s/^[ ]*//'\'' -e '\''/^\(;.*\)*$/d'\'' -e '\''s/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p'\'' -e q $export_symbols`" ; then cp "$export_symbols" "$output_objdir/$soname.def"; echo "$tool_output_objdir$soname.def" > "$output_objdir/$soname.exp"; else $SED -e '\''s/^/-link -EXPORT:/'\'' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, )='true' enable_shared_with_static_runtimes=yes exclude_expsyms='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1,DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib old_postinstall_cmds='chmod 644 $oldlib' postlink_cmds='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile=$lt_outputfile.exe lt_tool_outputfile=$lt_tool_outputfile.exe ;; esac~ if test : != "$MANIFEST_TOOL" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_from_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs' enable_shared_with_static_runtimes=yes ;; esac ;; darwin* | rhapsody*) archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported if test yes = "$lt_cv_ld_force_load"; then whole_archive_flag_spec='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience $wl-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' else whole_archive_flag_spec='' fi link_all_deplibs=yes allow_undefined_flag=$_lt_dar_allow_undefined case $cc_basename in ifort*|nagfor*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test yes = "$_lt_dar_can_shared"; then output_verbose_link_cmd=func_echo_all archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dsymutil" module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dsymutil" archive_expsym_cmds="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil" module_expsym_cmds="sed -e 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dar_export_syms$_lt_dsymutil" else ld_shlibs=no fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test yes = "$GCC"; then archive_cmds='$RM $output_objdir/$soname~$CC -shared $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' else archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='$wl+b $wl$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='$wl-E' ;; hpux10*) if test yes,no = "$GCC,$with_gnu_ld"; then archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test no = "$with_gnu_ld"; then hardcode_libdir_flag_spec='$wl+b $wl$libdir' hardcode_libdir_separator=: hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test yes,no = "$GCC,$with_gnu_ld"; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $CC understands -b" >&5 $as_echo_n "checking if $CC understands -b... " >&6; } if ${lt_cv_prog_compiler__b+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler__b=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS -b" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler__b=yes fi else lt_cv_prog_compiler__b=yes fi fi $RM -r conftest* LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler__b" >&5 $as_echo "$lt_cv_prog_compiler__b" >&6; } if test yes = "$lt_cv_prog_compiler__b"; then archive_cmds='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi ;; esac fi if test no = "$with_gnu_ld"; then hardcode_libdir_flag_spec='$wl+b $wl$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test yes = "$GCC"; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $host_os linker accepts -exported_symbol" >&5 $as_echo_n "checking whether the $host_os linker accepts -exported_symbol... " >&6; } if ${lt_cv_irix_exported_symbol+:} false; then : $as_echo_n "(cached) " >&6 else save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS -shared $wl-exported_symbol ${wl}foo $wl-update_registry $wl/dev/null" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int foo (void) { return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_irix_exported_symbol=yes else lt_cv_irix_exported_symbol=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_irix_exported_symbol" >&5 $as_echo "$lt_cv_irix_exported_symbol" >&6; } if test yes = "$lt_cv_irix_exported_symbol"; then archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations $wl-exports_file $wl$export_symbols -o $lib' fi else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -exports_file $export_symbols -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' hardcode_libdir_separator=: inherit_rpath=yes link_all_deplibs=yes ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; *nto* | *qnx*) ;; openbsd* | bitrig*) if test -f /usr/libexec/ld.so; then hardcode_direct=yes hardcode_shlibpath_var=no hardcode_direct_absolute=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags $wl-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='$wl-rpath,$libdir' export_dynamic_flag_spec='$wl-E' else archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='$wl-rpath,$libdir' fi else ld_shlibs=no fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test yes = "$GCC"; then allow_undefined_flag=' $wl-expect_unresolved $wl\*' archive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test yes = "$GCC"; then allow_undefined_flag=' $wl-expect_unresolved $wl\*' archive_cmds='$CC -shared$allow_undefined_flag $pic_flag $libobjs $deplibs $compiler_flags $wl-msym $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $wl-input $wl$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi archive_cmds_need_lc='no' hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z defs' if test yes = "$GCC"; then wlarc='$wl' archive_cmds='$CC -shared $pic_flag $wl-z ${wl}text $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag $wl-z ${wl}text $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' archive_cmds='$LD -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='$wl' archive_cmds='$CC -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands '-z linker_flag'. GCC discards it without '$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test yes = "$GCC"; then whole_archive_flag_spec='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract' else whole_archive_flag_spec='-z allextract$convenience -z defaultextract' fi ;; esac link_all_deplibs=yes ;; sunos4*) if test sequent = "$host_vendor"; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G $wl-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag='$wl-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then archive_cmds='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We CANNOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='$wl-z,text' allow_undefined_flag='$wl-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='$wl-R,$libdir' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='$wl-Bexport' runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then archive_cmds='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac if test sni = "$host_vendor"; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) export_dynamic_flag_spec='$wl-Blargedynsym' ;; esac fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5 $as_echo "$ld_shlibs" >&6; } test no = "$ld_shlibs" && can_build_shared=no with_gnu_ld=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test yes,yes = "$GCC,$enable_shared"; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } if ${lt_cv_archive_cmds_need_lc+:} false; then : $as_echo_n "(cached) " >&6 else $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then lt_cv_archive_cmds_need_lc=no else lt_cv_archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc" >&5 $as_echo "$lt_cv_archive_cmds_need_lc" >&6; } archive_cmds_need_lc=$lt_cv_archive_cmds_need_lc ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } if test yes = "$GCC"; then case $host_os in darwin*) lt_awk_arg='/^libraries:/,/LR/' ;; *) lt_awk_arg='/^libraries:/' ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq='s|=\([A-Za-z]:\)|\1|g' ;; *) lt_sed_strip_eq='s|=/|/|g' ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary... lt_tmp_lt_search_path_spec= lt_multi_os_dir=/`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` # ...but if some path component already ends with the multilib dir we assume # that all is fine and trust -print-search-dirs as is (GCC 4.2? or newer). case "$lt_multi_os_dir; $lt_search_path_spec " in "/; "* | "/.; "* | "/./; "* | *"$lt_multi_os_dir "* | *"$lt_multi_os_dir/ "*) lt_multi_os_dir= ;; esac for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path$lt_multi_os_dir" elif test -n "$lt_multi_os_dir"; then test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS = " "; FS = "/|\n";} { lt_foo = ""; lt_count = 0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo = "/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[lt_foo]++; } if (lt_freq[lt_foo] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's|/\([A-Za-z]:\)|\1|g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=.so postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='$libname$release$shared_ext$major' ;; aix[4-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test ia64 = "$host_cpu"; then # AIX 5 supports IA64 library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line '#! .'. This would cause the generated library to # depend on '.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test yes = "$aix_use_runtimelinking"; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='$libname$release.a $libname.a' soname_spec='$libname$release$shared_ext$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='$libname$shared_ext' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=.dll need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' library_names_spec='$libname.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec=$LIB if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='$libname$release$major$shared_ext $libname$shared_ext' soname_spec='$libname$release$major$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib" sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[23].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=no sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' if test 32 = "$HPUX_IA64_MODE"; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[3-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test yes = "$lt_cv_prog_gnu_ld"; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff" sys_lib_dlsearch_path_spec="/usr/lib$libsuff /lib$libsuff" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; linux*android*) version_type=none # Android doesn't support versioned libraries. need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext' soname_spec='$libname$release$shared_ext' finish_cmds= shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes dynamic_linker='Android linker' # Don't embed -rpath directories since the linker doesn't support them. hardcode_libdir_flag_spec='-L$libdir' ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH if ${lt_cv_shlibpath_overrides_runpath+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : lt_cv_shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir fi shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd* | bitrig*) version_type=sunos sys_lib_dlsearch_path_spec=/usr/lib need_lib_prefix=no if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then need_version=no else need_version=yes fi library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; os2*) libname_spec='$name' shrext_cmds=.dll need_lib_prefix=no library_names_spec='$libname$shared_ext $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test yes = "$with_gnu_ld"; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec; then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext' soname_spec='$libname$shared_ext.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test yes = "$with_gnu_ld"; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test no = "$dynamic_linker" && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test yes = "$GCC"; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test set = "${lt_cv_sys_lib_search_path_spec+set}"; then sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec fi if test set = "${lt_cv_sys_lib_dlsearch_path_spec+set}"; then sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action= if test -n "$hardcode_libdir_flag_spec" || test -n "$runpath_var" || test yes = "$hardcode_automatic"; then # We can hardcode non-existent directories. if test no != "$hardcode_direct" && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test no != "$_LT_TAGVAR(hardcode_shlibpath_var, )" && test no != "$hardcode_minus_L"; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5 $as_echo "$hardcode_action" >&6; } if test relink = "$hardcode_action" || test yes = "$inherit_rpath"; then # Fast installation is not supported enable_fast_install=no elif test yes = "$shlibpath_overrides_runpath" || test no = "$enable_shared"; then # Fast installation is not necessary enable_fast_install=needless fi if test yes != "$enable_dlopen"; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen=load_add_on lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen=LoadLibrary lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen=dlopen lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl else lt_cv_dlopen=dyld lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; tpf*) # Don't try to run any link tests for TPF. We know it's impossible # because TPF is a cross-compiler, and we know how we open DSOs. lt_cv_dlopen=dlopen lt_cv_dlopen_libs= lt_cv_dlopen_self=no ;; *) ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load" if test "x$ac_cv_func_shl_load" = xyes; then : lt_cv_dlopen=shl_load else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5 $as_echo_n "checking for shl_load in -ldld... " >&6; } if ${ac_cv_lib_dld_shl_load+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char shl_load (); int main () { return shl_load (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_shl_load=yes else ac_cv_lib_dld_shl_load=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load" >&5 $as_echo "$ac_cv_lib_dld_shl_load" >&6; } if test "x$ac_cv_lib_dld_shl_load" = xyes; then : lt_cv_dlopen=shl_load lt_cv_dlopen_libs=-ldld else ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen" if test "x$ac_cv_func_dlopen" = xyes; then : lt_cv_dlopen=dlopen else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5 $as_echo_n "checking for dlopen in -lsvld... " >&6; } if ${ac_cv_lib_svld_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_svld_dlopen=yes else ac_cv_lib_svld_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen" >&5 $as_echo "$ac_cv_lib_svld_dlopen" >&6; } if test "x$ac_cv_lib_svld_dlopen" = xyes; then : lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-lsvld else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5 $as_echo_n "checking for dld_link in -ldld... " >&6; } if ${ac_cv_lib_dld_dld_link+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dld_link (); int main () { return dld_link (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_dld_link=yes else ac_cv_lib_dld_dld_link=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link" >&5 $as_echo "$ac_cv_lib_dld_dld_link" >&6; } if test "x$ac_cv_lib_dld_dld_link" = xyes; then : lt_cv_dlopen=dld_link lt_cv_dlopen_libs=-ldld fi fi fi fi fi fi ;; esac if test no = "$lt_cv_dlopen"; then enable_dlopen=no else enable_dlopen=yes fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS=$CPPFLAGS test yes = "$ac_cv_header_dlfcn_h" && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS=$LDFLAGS wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS=$LIBS LIBS="$lt_cv_dlopen_libs $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5 $as_echo_n "checking whether a program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self+:} false; then : $as_echo_n "(cached) " >&6 else if test yes = "$cross_compiling"; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "conftest$ac_exeext" 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5 $as_echo "$lt_cv_dlopen_self" >&6; } if test yes = "$lt_cv_dlopen_self"; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5 $as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self_static+:} false; then : $as_echo_n "(cached) " >&6 else if test yes = "$cross_compiling"; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "conftest$ac_exeext" 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5 $as_echo "$lt_cv_dlopen_self_static" >&6; } fi CPPFLAGS=$save_CPPFLAGS LDFLAGS=$save_LDFLAGS LIBS=$save_LIBS ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi striplib= old_striplib= { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5 $as_echo_n "checking whether stripping libraries is possible... " >&6; } if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP"; then striplib="$STRIP -x" old_striplib="$STRIP -S" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } ;; esac fi # Report what library types will actually be built { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5 $as_echo_n "checking if libtool supports shared libraries... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5 $as_echo "$can_build_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5 $as_echo_n "checking whether to build shared libraries... " >&6; } test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5 $as_echo "$enable_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5 $as_echo_n "checking whether to build static libraries... " >&6; } # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5 $as_echo "$enable_static" >&6; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu CC=$lt_save_CC if test -n "$CXX" && ( test no != "$CXX" && ( (test g++ = "$CXX" && `g++ -v >/dev/null 2>&1` ) || (test g++ != "$CXX"))); then ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor" >&5 $as_echo_n "checking how to run the C++ preprocessor... " >&6; } if test -z "$CXXCPP"; then if ${ac_cv_prog_CXXCPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CXXCPP needs to be expanded for CXXCPP in "$CXX -E" "/lib/cpp" do ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CXXCPP=$CXXCPP fi CXXCPP=$ac_cv_prog_CXXCPP else ac_cv_prog_CXXCPP=$CXXCPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXXCPP" >&5 $as_echo "$CXXCPP" >&6; } ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C++ preprocessor \"$CXXCPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu else _lt_caught_CXX_error=yes fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu archive_cmds_need_lc_CXX=no allow_undefined_flag_CXX= always_export_symbols_CXX=no archive_expsym_cmds_CXX= compiler_needs_object_CXX=no export_dynamic_flag_spec_CXX= hardcode_direct_CXX=no hardcode_direct_absolute_CXX=no hardcode_libdir_flag_spec_CXX= hardcode_libdir_separator_CXX= hardcode_minus_L_CXX=no hardcode_shlibpath_var_CXX=unsupported hardcode_automatic_CXX=no inherit_rpath_CXX=no module_cmds_CXX= module_expsym_cmds_CXX= link_all_deplibs_CXX=unknown old_archive_cmds_CXX=$old_archive_cmds reload_flag_CXX=$reload_flag reload_cmds_CXX=$reload_cmds no_undefined_flag_CXX= whole_archive_flag_spec_CXX= enable_shared_with_static_runtimes_CXX=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o objext_CXX=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test yes != "$_lt_caught_CXX_error"; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} CFLAGS=$CXXFLAGS compiler=$CC compiler_CXX=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test yes = "$GXX"; then lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin' else lt_prog_compiler_no_builtin_flag_CXX= fi if test yes = "$GXX"; then # Set up default GNU C++ configuration # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test no = "$withval" || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test yes = "$GCC"; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return, which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD=$ac_prog ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test yes = "$with_gnu_ld"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${lt_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD=$ac_dir/$ac_prog # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${lt_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test yes = "$with_gnu_ld"; then archive_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir' export_dynamic_flag_spec_CXX='$wl--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='$wl' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_CXX=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' else whole_archive_flag_spec_CXX= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } ld_shlibs_CXX=yes case $host_os in aix3*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aix[4-9]*) if test ia64 = "$host_cpu"; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag= else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_CXX='' hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes file_list_spec_CXX='$wl-f,' if test yes = "$GXX"; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`$CC -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct_CXX=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_CXX=yes hardcode_libdir_flag_spec_CXX='-L$libdir' hardcode_libdir_separator_CXX= fi esac shared_flag='-shared' if test yes = "$aix_use_runtimelinking"; then shared_flag=$shared_flag' $wl-G' fi else # not using gcc if test ia64 = "$host_cpu"; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test yes = "$aix_use_runtimelinking"; then shared_flag='$wl-G' else shared_flag='$wl-bM:SRE' fi fi fi export_dynamic_flag_spec_CXX='$wl-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. always_export_symbols_CXX=yes if test yes = "$aix_use_runtimelinking"; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_CXX='-berok' # Determine the default libpath from the value encoded in an empty # executable. if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath__CXX+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=/usr/lib:/lib fi fi aix_libpath=$lt_cv_aix_libpath__CXX fi hardcode_libdir_flag_spec_CXX='$wl-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n "$allow_undefined_flag"; then func_echo_all "$wl$allow_undefined_flag"; else :; fi` $wl'$exp_sym_flag:\$export_symbols' '$shared_flag else if test ia64 = "$host_cpu"; then hardcode_libdir_flag_spec_CXX='$wl-R $libdir:/usr/lib:/lib' allow_undefined_flag_CXX="-z nodefs" archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\$wl$no_entry_flag"' $compiler_flags $wl$allow_undefined_flag '"\$wl$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath__CXX+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=/usr/lib:/lib fi fi aix_libpath=$lt_cv_aix_libpath__CXX fi hardcode_libdir_flag_spec_CXX='$wl-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_CXX=' $wl-bernotok' allow_undefined_flag_CXX=' $wl-berok' if test yes = "$with_gnu_ld"; then # We only use this code for GNU lds that support --whole-archive. whole_archive_flag_spec_CXX='$wl--whole-archive$convenience $wl--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_CXX='$convenience' fi archive_cmds_need_lc_CXX=yes # This is similar to how AIX traditionally builds its shared # libraries. archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $wl-bnoentry $compiler_flags $wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_CXX=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' else ld_shlibs_CXX=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) case $GXX,$cc_basename in ,cl* | no,cl*) # Native MSVC # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec_CXX=' ' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=yes file_list_spec_CXX='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. archive_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~linknames=' archive_expsym_cmds_CXX='if test DEF = "`$SED -n -e '\''s/^[ ]*//'\'' -e '\''/^\(;.*\)*$/d'\'' -e '\''s/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p'\'' -e q $export_symbols`" ; then cp "$export_symbols" "$output_objdir/$soname.def"; echo "$tool_output_objdir$soname.def" > "$output_objdir/$soname.exp"; else $SED -e '\''s/^/-link -EXPORT:/'\'' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, CXX)='true' enable_shared_with_static_runtimes_CXX=yes # Don't use ranlib old_postinstall_cmds_CXX='chmod 644 $oldlib' postlink_cmds_CXX='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile=$lt_outputfile.exe lt_tool_outputfile=$lt_tool_outputfile.exe ;; esac~ func_to_tool_file "$lt_outputfile"~ if test : != "$MANIFEST_TOOL" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # g++ # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_CXX='-L$libdir' export_dynamic_flag_spec_CXX='$wl--export-all-symbols' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=no enable_shared_with_static_runtimes_CXX=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file, use it as # is; otherwise, prepend EXPORTS... archive_expsym_cmds_CXX='if test DEF = "`$SED -n -e '\''s/^[ ]*//'\'' -e '\''/^\(;.*\)*$/d'\'' -e '\''s/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p'\'' -e q $export_symbols`" ; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_CXX=no fi ;; esac ;; darwin* | rhapsody*) archive_cmds_need_lc_CXX=no hardcode_direct_CXX=no hardcode_automatic_CXX=yes hardcode_shlibpath_var_CXX=unsupported if test yes = "$lt_cv_ld_force_load"; then whole_archive_flag_spec_CXX='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience $wl-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' else whole_archive_flag_spec_CXX='' fi link_all_deplibs_CXX=yes allow_undefined_flag_CXX=$_lt_dar_allow_undefined case $cc_basename in ifort*|nagfor*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test yes = "$_lt_dar_can_shared"; then output_verbose_link_cmd=func_echo_all archive_cmds_CXX="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dsymutil" module_cmds_CXX="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dsymutil" archive_expsym_cmds_CXX="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil" module_expsym_cmds_CXX="sed -e 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dar_export_syms$_lt_dsymutil" if test yes != "$lt_cv_apple_cc_single_mod"; then archive_cmds_CXX="\$CC -r -keep_private_externs -nostdlib -o \$lib-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$lib-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring$_lt_dsymutil" archive_expsym_cmds_CXX="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \$lib-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$lib-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring$_lt_dar_export_syms$_lt_dsymutil" fi else ld_shlibs_CXX=no fi ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; freebsd2.*) # C++ shared libraries reported to be fairly broken before # switch to ELF ld_shlibs_CXX=no ;; freebsd-elf*) archive_cmds_need_lc_CXX=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions ld_shlibs_CXX=yes ;; haiku*) archive_cmds_CXX='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' link_all_deplibs_CXX=yes ;; hpux9*) hardcode_libdir_flag_spec_CXX='$wl+b $wl$libdir' hardcode_libdir_separator_CXX=: export_dynamic_flag_spec_CXX='$wl-E' hardcode_direct_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes = "$GXX"; then archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; hpux10*|hpux11*) if test no = "$with_gnu_ld"; then hardcode_libdir_flag_spec_CXX='$wl+b $wl$libdir' hardcode_libdir_separator_CXX=: case $host_cpu in hppa*64*|ia64*) ;; *) export_dynamic_flag_spec_CXX='$wl-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no ;; *) hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -b $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes = "$GXX"; then if test no = "$with_gnu_ld"; then case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC $wl+h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared -nostdlib $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; interix[3-9]*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir' export_dynamic_flag_spec_CXX='$wl-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_CXX='sed "s|^|_|" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test yes = "$GXX"; then if test no = "$with_gnu_ld"; then archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' else archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` -o $lib' fi fi link_all_deplibs_CXX=yes ;; esac hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir' hardcode_libdir_separator_CXX=: inherit_rpath_CXX=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib $wl-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir' export_dynamic_flag_spec_CXX='$wl--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac archive_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; esac archive_cmds_need_lc_CXX=no hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir' export_dynamic_flag_spec_CXX='$wl--export-dynamic' whole_archive_flag_spec_CXX='$wl--whole-archive$convenience $wl--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [1-5].* | *pgcpp\ [1-5].*) prelink_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"' old_archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~ $RANLIB $oldlib' archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 6 and above use weak symbols archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='$wl--rpath $wl$libdir' export_dynamic_flag_spec_CXX='$wl--export-dynamic' whole_archive_flag_spec_CXX='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' ;; cxx*) # Compaq C++ archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname -o $lib $wl-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_CXX='-rpath $libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed' ;; xl* | mpixl* | bgxl*) # IBM XL 8.0 on PPC, with GNU ld hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir' export_dynamic_flag_spec_CXX='$wl--export-dynamic' archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' if test yes = "$supports_anon_versioning"; then archive_expsym_cmds_CXX='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file $wl$export_symbols' hardcode_libdir_flag_spec_CXX='-R$libdir' whole_archive_flag_spec_CXX='$wl--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' compiler_needs_object_CXX=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; m88k*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds_CXX='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) ld_shlibs_CXX=yes ;; openbsd* | bitrig*) if test -f /usr/libexec/ld.so; then hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no hardcode_direct_absolute_CXX=yes archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`"; then archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-retain-symbols-file,$export_symbols -o $lib' export_dynamic_flag_spec_CXX='$wl-E' whole_archive_flag_spec_CXX=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' fi output_verbose_link_cmd=func_echo_all else ld_shlibs_CXX=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\$tempext\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' hardcode_libdir_flag_spec_CXX='$wl-rpath,$libdir' hardcode_libdir_separator_CXX=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx*) case $host in osf3*) allow_undefined_flag_CXX=' $wl-expect_unresolved $wl\*' archive_cmds_CXX='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $soname `test -n "$verstring" && func_echo_all "$wl-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir' ;; *) allow_undefined_flag_CXX=' -expect_unresolved \*' archive_cmds_CXX='$CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname $wl-input $wl$lib.exp `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib~ $RM $lib.exp' hardcode_libdir_flag_spec_CXX='-rpath $libdir' ;; esac hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list= ; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test yes,no = "$GXX,$with_gnu_ld"; then allow_undefined_flag_CXX=' $wl-expect_unresolved $wl\*' case $host in osf3*) archive_cmds_CXX='$CC -shared -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' ;; *) archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-msym $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='$wl-rpath $wl$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ archive_cmds_need_lc_CXX=yes no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G$allow_undefined_flag -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G$allow_undefined_flag $wl-M $wl$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_shlibpath_var_CXX=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands '-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract' ;; esac link_all_deplibs_CXX=yes output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test yes,no = "$GXX,$with_gnu_ld"; then no_undefined_flag_CXX=' $wl-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # g++ 2.7 appears to require '-G' NOT '-shared' on this # platform. archive_cmds_CXX='$CC -G -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags $wl-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' fi hardcode_libdir_flag_spec_CXX='$wl-R $wl$libdir' case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) whole_archive_flag_spec_CXX='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag_CXX='$wl-z,text' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We CANNOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag_CXX='$wl-z,text' allow_undefined_flag_CXX='$wl-z,nodefs' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='$wl-R,$libdir' hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes export_dynamic_flag_spec_CXX='$wl-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' old_archive_cmds_CXX='$CC -Tprelink_objects $oldobjs~ '"$old_archive_cmds_CXX" reload_cmds_CXX='$CC -Tprelink_objects $reload_objs~ '"$reload_cmds_CXX" ;; *) archive_cmds_CXX='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test no = "$ld_shlibs_CXX" && can_build_shared=no GCC_CXX=$GXX LD_CXX=$LD ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... # Dependencies to place before and after the object being linked: predep_objects_CXX= postdep_objects_CXX= predeps_CXX= postdeps_CXX= compiler_lib_search_path_CXX= cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF _lt_libdeps_save_CFLAGS=$CFLAGS case "$CC $CFLAGS " in #( *\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;; *\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;; *\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;; esac if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case $prev$p in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test x-L = "$p" || test x-R = "$p"; then prev=$p continue fi # Expand the sysroot to ease extracting the directories later. if test -z "$prev"; then case $p in -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;; -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;; -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;; esac fi case $p in =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;; esac if test no = "$pre_test_object_deps_done"; then case $prev in -L | -R) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$compiler_lib_search_path_CXX"; then compiler_lib_search_path_CXX=$prev$p else compiler_lib_search_path_CXX="${compiler_lib_search_path_CXX} $prev$p" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$postdeps_CXX"; then postdeps_CXX=$prev$p else postdeps_CXX="${postdeps_CXX} $prev$p" fi fi prev= ;; *.lto.$objext) ;; # Ignore GCC LTO objects *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test no = "$pre_test_object_deps_done"; then if test -z "$predep_objects_CXX"; then predep_objects_CXX=$p else predep_objects_CXX="$predep_objects_CXX $p" fi else if test -z "$postdep_objects_CXX"; then postdep_objects_CXX=$p else postdep_objects_CXX="$postdep_objects_CXX $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling CXX test program" fi $RM -f confest.$objext CFLAGS=$_lt_libdeps_save_CFLAGS # PORTME: override above test on systems where it is broken case $host_os in interix[3-9]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. predep_objects_CXX= postdep_objects_CXX= postdeps_CXX= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test yes != "$solaris_use_stlport4"; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test yes != "$solaris_use_stlport4"; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; esac case " $postdeps_CXX " in *" -lc "*) archive_cmds_need_lc_CXX=no ;; esac compiler_lib_search_dirs_CXX= if test -n "${compiler_lib_search_path_CXX}"; then compiler_lib_search_dirs_CXX=`echo " ${compiler_lib_search_path_CXX}" | $SED -e 's! -L! !g' -e 's!^ !!'` fi lt_prog_compiler_wl_CXX= lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX= # C++ specific cases for pic, static, wl, etc. if test yes = "$GXX"; then lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-static' case $host_os in aix*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' fi lt_prog_compiler_pic_CXX='-fPIC' ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic_CXX='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the '-m68020' flag to GCC prevents building anything better, # like '-m68040'. lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_CXX='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all lt_prog_compiler_pic_CXX= ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. lt_prog_compiler_static_CXX= ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_CXX=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac else case $host_os in aix[4-9]*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' else lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, CXX)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; dgux*) case $cc_basename in ec++*) lt_prog_compiler_pic_CXX='-KPIC' ;; ghcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='$wl-a ${wl}archive' if test ia64 != "$host_cpu"; then lt_prog_compiler_pic_CXX='+Z' fi ;; aCC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='$wl-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_CXX='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # KAI C++ Compiler lt_prog_compiler_wl_CXX='--backend -Wl,' lt_prog_compiler_pic_CXX='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64, which still supported -KPIC. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fPIC' lt_prog_compiler_static_CXX='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fpic' lt_prog_compiler_static_CXX='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; xlc* | xlC* | bgxl[cC]* | mpixl[cC]*) # IBM XL 8.0, 9.0 on PPC and BlueGene lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-qpic' lt_prog_compiler_static_CXX='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) lt_prog_compiler_pic_CXX='-W c,exportall' ;; *) ;; esac ;; netbsd*) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) lt_prog_compiler_wl_CXX='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 lt_prog_compiler_pic_CXX='-pic' ;; cxx*) # Digital/Compaq C++ lt_prog_compiler_wl_CXX='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x lt_prog_compiler_pic_CXX='-pic' lt_prog_compiler_static_CXX='-Bstatic' ;; lcc*) # Lucid lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 lt_prog_compiler_pic_CXX='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) lt_prog_compiler_can_build_shared_CXX=no ;; esac fi case $host_os in # For platforms that do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_CXX= ;; *) lt_prog_compiler_pic_CXX="$lt_prog_compiler_pic_CXX -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if ${lt_cv_prog_compiler_pic_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_CXX=$lt_prog_compiler_pic_CXX fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_CXX" >&6; } lt_prog_compiler_pic_CXX=$lt_cv_prog_compiler_pic_CXX # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... " >&6; } if ${lt_cv_prog_compiler_pic_works_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works_CXX=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_CXX -DPIC" ## exclude from sc_useless_quotes_in_assignment # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works_CXX=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_works_CXX" >&6; } if test yes = "$lt_cv_prog_compiler_pic_works_CXX"; then case $lt_prog_compiler_pic_CXX in "" | " "*) ;; *) lt_prog_compiler_pic_CXX=" $lt_prog_compiler_pic_CXX" ;; esac else lt_prog_compiler_pic_CXX= lt_prog_compiler_can_build_shared_CXX=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\"$lt_prog_compiler_static_CXX\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if ${lt_cv_prog_compiler_static_works_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works_CXX=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works_CXX=yes fi else lt_cv_prog_compiler_static_works_CXX=yes fi fi $RM -r conftest* LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_static_works_CXX" >&6; } if test yes = "$lt_cv_prog_compiler_static_works_CXX"; then : else lt_prog_compiler_static_CXX= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } hard_links=nottested if test no = "$lt_cv_prog_compiler_c_o_CXX" && test no != "$need_locks"; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test no = "$hard_links"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' case $host_os in aix[4-9]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global defined # symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) export_symbols_cmds_CXX=$ltdll_cmds ;; cygwin* | mingw* | cegcc*) case $cc_basename in cl*) exclude_expsyms_CXX='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname' ;; esac ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test no = "$ld_shlibs_CXX" && can_build_shared=no with_gnu_ld_CXX=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_CXX" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_CXX=yes if test yes,yes = "$GCC,$enable_shared"; then case $archive_cmds_CXX in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } if ${lt_cv_archive_cmds_need_lc_CXX+:} false; then : $as_echo_n "(cached) " >&6 else $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_CXX pic_flag=$lt_prog_compiler_pic_CXX compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_CXX allow_undefined_flag_CXX= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then lt_cv_archive_cmds_need_lc_CXX=no else lt_cv_archive_cmds_need_lc_CXX=yes fi allow_undefined_flag_CXX=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc_CXX" >&5 $as_echo "$lt_cv_archive_cmds_need_lc_CXX" >&6; } archive_cmds_need_lc_CXX=$lt_cv_archive_cmds_need_lc_CXX ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=.so postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='$libname$release$shared_ext$major' ;; aix[4-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test ia64 = "$host_cpu"; then # AIX 5 supports IA64 library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line '#! .'. This would cause the generated library to # depend on '.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test yes = "$aix_use_runtimelinking"; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='$libname$release.a $libname.a' soname_spec='$libname$release$shared_ext$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='$libname$shared_ext' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=.dll need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' library_names_spec='$libname.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec=$LIB if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='$libname$release$major$shared_ext $libname$shared_ext' soname_spec='$libname$release$major$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[23].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=no sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' if test 32 = "$HPUX_IA64_MODE"; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[3-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test yes = "$lt_cv_prog_gnu_ld"; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff" sys_lib_dlsearch_path_spec="/usr/lib$libsuff /lib$libsuff" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; linux*android*) version_type=none # Android doesn't support versioned libraries. need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext' soname_spec='$libname$release$shared_ext' finish_cmds= shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes dynamic_linker='Android linker' # Don't embed -rpath directories since the linker doesn't support them. hardcode_libdir_flag_spec_CXX='-L$libdir' ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH if ${lt_cv_shlibpath_overrides_runpath+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl_CXX\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec_CXX\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : lt_cv_shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir fi shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd* | bitrig*) version_type=sunos sys_lib_dlsearch_path_spec=/usr/lib need_lib_prefix=no if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then need_version=no else need_version=yes fi library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; os2*) libname_spec='$name' shrext_cmds=.dll need_lib_prefix=no library_names_spec='$libname$shared_ext $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test yes = "$with_gnu_ld"; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec; then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext' soname_spec='$libname$shared_ext.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test yes = "$with_gnu_ld"; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test no = "$dynamic_linker" && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test yes = "$GCC"; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test set = "${lt_cv_sys_lib_search_path_spec+set}"; then sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec fi if test set = "${lt_cv_sys_lib_dlsearch_path_spec+set}"; then sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action_CXX= if test -n "$hardcode_libdir_flag_spec_CXX" || test -n "$runpath_var_CXX" || test yes = "$hardcode_automatic_CXX"; then # We can hardcode non-existent directories. if test no != "$hardcode_direct_CXX" && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test no != "$_LT_TAGVAR(hardcode_shlibpath_var, CXX)" && test no != "$hardcode_minus_L_CXX"; then # Linking always hardcodes the temporary library directory. hardcode_action_CXX=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_CXX=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_CXX=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX" >&5 $as_echo "$hardcode_action_CXX" >&6; } if test relink = "$hardcode_action_CXX" || test yes = "$inherit_rpath_CXX"; then # Fast installation is not supported enable_fast_install=no elif test yes = "$shlibpath_overrides_runpath" || test no = "$enable_shared"; then # Fast installation is not necessary enable_fast_install=needless fi fi # test -n "$compiler" CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test yes != "$_lt_caught_CXX_error" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_config_commands="$ac_config_commands libtool" # Only expand once: # Extract the first word of "perl", so it can be a program name with args. set dummy perl; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_PERL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$PERL"; then ac_cv_prog_PERL="$PERL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_PERL="perl" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi PERL=$ac_cv_prog_PERL if test -n "$PERL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PERL" >&5 $as_echo "$PERL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi # Extract the first word of "pdflatex", so it can be a program name with args. set dummy pdflatex; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_PDFLATEX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$PDFLATEX"; then ac_cv_prog_PDFLATEX="$PDFLATEX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_PDFLATEX="pdflatex" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi PDFLATEX=$ac_cv_prog_PDFLATEX if test -n "$PDFLATEX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PDFLATEX" >&5 $as_echo "$PDFLATEX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi # Extract the first word of "pod2html", so it can be a program name with args. set dummy pod2html; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_POD2HTML+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$POD2HTML"; then ac_cv_prog_POD2HTML="$POD2HTML" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_POD2HTML="pod2html" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi POD2HTML=$ac_cv_prog_POD2HTML if test -n "$POD2HTML"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $POD2HTML" >&5 $as_echo "$POD2HTML" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -n "$PERL" -a -n "$PDFLATEX" -a -n "$POD2HTML"; then GENERATE_DOC_TRUE= GENERATE_DOC_FALSE='#' else GENERATE_DOC_TRUE='#' GENERATE_DOC_FALSE= fi # ------ AX CREATE STDINT H ------------------------------------- { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint types" >&5 $as_echo_n "checking for stdint types... " >&6; } ac_stdint_h=`echo include/isl/stdint.h` # try to shortcircuit - if the default include path of the compiler # can find a "stdint.h" header then we assume that all compilers can. if ${ac_cv_header_stdint_t+:} false; then : $as_echo_n "(cached) " >&6 else old_CXXFLAGS="$CXXFLAGS" ; CXXFLAGS="" old_CPPFLAGS="$CPPFLAGS" ; CPPFLAGS="" old_CFLAGS="$CFLAGS" ; CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int_least32_t v = 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_stdint_result="(assuming C99 compatible system)" ac_cv_header_stdint_t="stdint.h"; else ac_cv_header_stdint_t="" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test "$GCC" = "yes" && test ".$ac_cv_header_stdint_t" = "."; then CFLAGS="-std=c99" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int_least32_t v = 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: your GCC compiler has a defunct stdint.h for its default-mode" >&5 $as_echo "$as_me: WARNING: your GCC compiler has a defunct stdint.h for its default-mode" >&2;} fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi CXXFLAGS="$old_CXXFLAGS" CPPFLAGS="$old_CPPFLAGS" CFLAGS="$old_CFLAGS" fi v="... $ac_cv_header_stdint_h" if test "$ac_stdint_h" = "stdint.h" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: (are you sure you want them in ./stdint.h?)" >&5 $as_echo "(are you sure you want them in ./stdint.h?)" >&6; } elif test "$ac_stdint_h" = "inttypes.h" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: (are you sure you want them in ./inttypes.h?)" >&5 $as_echo "(are you sure you want them in ./inttypes.h?)" >&6; } elif test "_$ac_cv_header_stdint_t" = "_" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: (putting them into $ac_stdint_h)$v" >&5 $as_echo "(putting them into $ac_stdint_h)$v" >&6; } else ac_cv_header_stdint="$ac_cv_header_stdint_t" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdint (shortcircuit)" >&5 $as_echo "$ac_cv_header_stdint (shortcircuit)" >&6; } fi if test "_$ac_cv_header_stdint_t" = "_" ; then # can not shortcircuit.. inttype_headers=`echo | sed -e 's/,/ /g'` ac_cv_stdint_result="(no helpful system typedefs seen)" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint uintptr_t" >&5 $as_echo_n "checking for stdint uintptr_t... " >&6; } if ${ac_cv_header_stdint_x+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_header_stdint_x="" # the 1997 typedefs (inttypes.h) { $as_echo "$as_me:${as_lineno-$LINENO}: result: (..)" >&5 $as_echo "(..)" >&6; } for i in stdint.h inttypes.h sys/inttypes.h $inttype_headers do unset ac_cv_type_uintptr_t unset ac_cv_type_uint64_t ac_fn_c_check_type "$LINENO" "uintptr_t" "ac_cv_type_uintptr_t" "#include <$i> " if test "x$ac_cv_type_uintptr_t" = xyes; then : ac_cv_header_stdint_x=$i else continue fi ac_fn_c_check_type "$LINENO" "uint64_t" "ac_cv_type_uint64_t" "#include<$i> " if test "x$ac_cv_type_uint64_t" = xyes; then : and64="/uint64_t" else and64="" fi ac_cv_stdint_result="(seen uintptr_t$and64 in $i)" break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint uintptr_t" >&5 $as_echo_n "checking for stdint uintptr_t... " >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdint_x" >&5 $as_echo "$ac_cv_header_stdint_x" >&6; } if test "_$ac_cv_header_stdint_x" = "_" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint uint32_t" >&5 $as_echo_n "checking for stdint uint32_t... " >&6; } if ${ac_cv_header_stdint_o+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_header_stdint_o="" # the 1995 typedefs (sys/inttypes.h) { $as_echo "$as_me:${as_lineno-$LINENO}: result: (..)" >&5 $as_echo "(..)" >&6; } for i in inttypes.h sys/inttypes.h stdint.h $inttype_headers do unset ac_cv_type_uint32_t unset ac_cv_type_uint64_t ac_fn_c_check_type "$LINENO" "uint32_t" "ac_cv_type_uint32_t" "#include <$i> " if test "x$ac_cv_type_uint32_t" = xyes; then : ac_cv_header_stdint_o=$i else continue fi ac_fn_c_check_type "$LINENO" "uint64_t" "ac_cv_type_uint64_t" "#include<$i> " if test "x$ac_cv_type_uint64_t" = xyes; then : and64="/uint64_t" else and64="" fi ac_cv_stdint_result="(seen uint32_t$and64 in $i)" break break; done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint uint32_t" >&5 $as_echo_n "checking for stdint uint32_t... " >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdint_o" >&5 $as_echo "$ac_cv_header_stdint_o" >&6; } fi if test "_$ac_cv_header_stdint_x" = "_" ; then if test "_$ac_cv_header_stdint_o" = "_" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint u_int32_t" >&5 $as_echo_n "checking for stdint u_int32_t... " >&6; } if ${ac_cv_header_stdint_u+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_header_stdint_u="" # the BSD typedefs (sys/types.h) { $as_echo "$as_me:${as_lineno-$LINENO}: result: (..)" >&5 $as_echo "(..)" >&6; } for i in sys/types.h inttypes.h sys/inttypes.h $inttype_headers ; do unset ac_cv_type_u_int32_t unset ac_cv_type_u_int64_t ac_fn_c_check_type "$LINENO" "u_int32_t" "ac_cv_type_u_int32_t" "#include <$i> " if test "x$ac_cv_type_u_int32_t" = xyes; then : ac_cv_header_stdint_u=$i else continue fi ac_fn_c_check_type "$LINENO" "u_int64_t" "ac_cv_type_u_int64_t" "#include<$i> " if test "x$ac_cv_type_u_int64_t" = xyes; then : and64="/u_int64_t" else and64="" fi ac_cv_stdint_result="(seen u_int32_t$and64 in $i)" break break; done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint u_int32_t" >&5 $as_echo_n "checking for stdint u_int32_t... " >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdint_u" >&5 $as_echo "$ac_cv_header_stdint_u" >&6; } fi fi if test "_$ac_cv_header_stdint_x" = "_" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdint datatype model" >&5 $as_echo_n "checking for stdint datatype model... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: (..)" >&5 $as_echo "(..)" >&6; } # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of char" >&5 $as_echo_n "checking size of char... " >&6; } if ${ac_cv_sizeof_char+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (char))" "ac_cv_sizeof_char" "$ac_includes_default"; then : else if test "$ac_cv_type_char" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (char) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_char=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_char" >&5 $as_echo "$ac_cv_sizeof_char" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_CHAR $ac_cv_sizeof_char _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of short" >&5 $as_echo_n "checking size of short... " >&6; } if ${ac_cv_sizeof_short+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (short))" "ac_cv_sizeof_short" "$ac_includes_default"; then : else if test "$ac_cv_type_short" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (short) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_short=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_short" >&5 $as_echo "$ac_cv_sizeof_short" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_SHORT $ac_cv_sizeof_short _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of int" >&5 $as_echo_n "checking size of int... " >&6; } if ${ac_cv_sizeof_int+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (int))" "ac_cv_sizeof_int" "$ac_includes_default"; then : else if test "$ac_cv_type_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (int) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_int" >&5 $as_echo "$ac_cv_sizeof_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_INT $ac_cv_sizeof_int _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long" >&5 $as_echo_n "checking size of long... " >&6; } if ${ac_cv_sizeof_long+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long))" "ac_cv_sizeof_long" "$ac_includes_default"; then : else if test "$ac_cv_type_long" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (long) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_long=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long" >&5 $as_echo "$ac_cv_sizeof_long" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_LONG $ac_cv_sizeof_long _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of void*" >&5 $as_echo_n "checking size of void*... " >&6; } if ${ac_cv_sizeof_voidp+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (void*))" "ac_cv_sizeof_voidp" "$ac_includes_default"; then : else if test "$ac_cv_type_voidp" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (void*) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_voidp=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_voidp" >&5 $as_echo "$ac_cv_sizeof_voidp" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_VOIDP $ac_cv_sizeof_voidp _ACEOF ac_cv_char_data_model="" ac_cv_char_data_model="$ac_cv_char_data_model$ac_cv_sizeof_char" ac_cv_char_data_model="$ac_cv_char_data_model$ac_cv_sizeof_short" ac_cv_char_data_model="$ac_cv_char_data_model$ac_cv_sizeof_int" ac_cv_long_data_model="" ac_cv_long_data_model="$ac_cv_long_data_model$ac_cv_sizeof_int" ac_cv_long_data_model="$ac_cv_long_data_model$ac_cv_sizeof_long" ac_cv_long_data_model="$ac_cv_long_data_model$ac_cv_sizeof_voidp" { $as_echo "$as_me:${as_lineno-$LINENO}: checking data model" >&5 $as_echo_n "checking data model... " >&6; } case "$ac_cv_char_data_model/$ac_cv_long_data_model" in 122/242) ac_cv_data_model="IP16" ; n="standard 16bit machine" ;; 122/244) ac_cv_data_model="LP32" ; n="standard 32bit machine" ;; 122/*) ac_cv_data_model="i16" ; n="unusual int16 model" ;; 124/444) ac_cv_data_model="ILP32" ; n="standard 32bit unixish" ;; 124/488) ac_cv_data_model="LP64" ; n="standard 64bit unixish" ;; 124/448) ac_cv_data_model="LLP64" ; n="unusual 64bit unixish" ;; 124/*) ac_cv_data_model="i32" ; n="unusual int32 model" ;; 128/888) ac_cv_data_model="ILP64" ; n="unusual 64bit numeric" ;; 128/*) ac_cv_data_model="i64" ; n="unusual int64 model" ;; 222/*2) ac_cv_data_model="DSP16" ; n="strict 16bit dsptype" ;; 333/*3) ac_cv_data_model="DSP24" ; n="strict 24bit dsptype" ;; 444/*4) ac_cv_data_model="DSP32" ; n="strict 32bit dsptype" ;; 666/*6) ac_cv_data_model="DSP48" ; n="strict 48bit dsptype" ;; 888/*8) ac_cv_data_model="DSP64" ; n="strict 64bit dsptype" ;; 222/*|333/*|444/*|666/*|888/*) : ac_cv_data_model="iDSP" ; n="unusual dsptype" ;; *) ac_cv_data_model="none" ; n="very unusual model" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_data_model ($ac_cv_long_data_model, $n)" >&5 $as_echo "$ac_cv_data_model ($ac_cv_long_data_model, $n)" >&6; } fi if test "_$ac_cv_header_stdint_x" != "_" ; then ac_cv_header_stdint="$ac_cv_header_stdint_x" elif test "_$ac_cv_header_stdint_o" != "_" ; then ac_cv_header_stdint="$ac_cv_header_stdint_o" elif test "_$ac_cv_header_stdint_u" != "_" ; then ac_cv_header_stdint="$ac_cv_header_stdint_u" else ac_cv_header_stdint="stddef.h" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for extra inttypes in chosen header" >&5 $as_echo_n "checking for extra inttypes in chosen header... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: ($ac_cv_header_stdint)" >&5 $as_echo "($ac_cv_header_stdint)" >&6; } unset ac_cv_type_int_least32_t unset ac_cv_type_int_fast32_t ac_fn_c_check_type "$LINENO" "int_least32_t" "ac_cv_type_int_least32_t" "#include <$ac_cv_header_stdint> " if test "x$ac_cv_type_int_least32_t" = xyes; then : fi ac_fn_c_check_type "$LINENO" "int_fast32_t" "ac_cv_type_int_fast32_t" "#include<$ac_cv_header_stdint> " if test "x$ac_cv_type_int_fast32_t" = xyes; then : fi ac_fn_c_check_type "$LINENO" "intmax_t" "ac_cv_type_intmax_t" "#include <$ac_cv_header_stdint> " if test "x$ac_cv_type_intmax_t" = xyes; then : fi fi # shortcircut to system "stdint.h" # ------------------ PREPARE VARIABLES ------------------------------ if test "$GCC" = "yes" ; then ac_cv_stdint_message="using gnu compiler "`$CC --version | head -1` else ac_cv_stdint_message="using $CC" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: make use of $ac_cv_header_stdint in $ac_stdint_h $ac_cv_stdint_result" >&5 $as_echo "make use of $ac_cv_header_stdint in $ac_stdint_h $ac_cv_stdint_result" >&6; } # ----------------- DONE inttypes.h checks START header ------------- ac_config_commands="$ac_config_commands $ac_stdint_h" # Check whether --with-gmp was given. if test "${with_gmp+set}" = set; then : withval=$with_gmp; fi case "system" in system|build) # Check whether --with-gmp_prefix was given. if test "${with_gmp_prefix+set}" = set; then : withval=$with_gmp_prefix; fi # Check whether --with-gmp_exec_prefix was given. if test "${with_gmp_exec_prefix+set}" = set; then : withval=$with_gmp_exec_prefix; fi esac # Check whether --with-gmp_builddir was given. if test "${with_gmp_builddir+set}" = set; then : withval=$with_gmp_builddir; fi if test "x$with_gmp_prefix" != "x" -a "x$with_gmp_exec_prefix" = "x"; then with_gmp_exec_prefix=$with_gmp_prefix fi if test "x$with_gmp_prefix" != "x" -o "x$with_gmp_exec_prefix" != "x"; then if test "x$with_gmp" != "x" -a "x$with_gmp" != "xyes" -a "x$with_gmp" != "xsystem"; then as_fn_error $? "Setting $with_gmp_prefix implies use of system gmp" "$LINENO" 5 fi with_gmp="system" fi if test "x$with_gmp_builddir" != "x"; then if test "x$with_gmp" != "x" -a "x$with_gmp" != "xyes" -a "x$with_gmp" != "xbuild"; then as_fn_error $? "Setting $with_gmp_builddir implies use of build gmp" "$LINENO" 5 fi with_gmp="build" gmp_srcdir=`echo @abs_srcdir@ | $with_gmp_builddir/config.status --file=-` { $as_echo "$as_me:${as_lineno-$LINENO}: gmp sources in $gmp_srcdir" >&5 $as_echo "$as_me: gmp sources in $gmp_srcdir" >&6;} fi if test "x$with_gmp_exec_prefix" != "x"; then export PKG_CONFIG_PATH="$with_gmp_exec_prefix/lib/pkgconfig${PKG_CONFIG_PATH+:$PKG_CONFIG_PATH}" fi case "$with_gmp" in system|build) ;; *) case "system" in bundled) if test -d $srcdir/.git -a \ -d $srcdir/gmp -a \ ! -d $srcdir/gmp/.git; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git repo detected, but submodule gmp not initialized" >&5 $as_echo "$as_me: WARNING: git repo detected, but submodule gmp not initialized" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You may want to run" >&5 $as_echo "$as_me: WARNING: You may want to run" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule init" >&5 $as_echo "$as_me: WARNING: git submodule init" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule update" >&5 $as_echo "$as_me: WARNING: git submodule update" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: sh autogen.sh" >&5 $as_echo "$as_me: WARNING: sh autogen.sh" >&2;} fi if test -f $srcdir/gmp/configure; then with_gmp="bundled" else with_gmp="no" fi ;; *) with_gmp="system" ;; esac ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking which gmp to use" >&5 $as_echo_n "checking which gmp to use... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_gmp" >&5 $as_echo "$with_gmp" >&6; } case "$with_gmp" in system) if test "x$with_gmp_prefix" != "x"; then isl_configure_args="$isl_configure_args --with-gmp=$with_gmp_prefix" GMP_CPPFLAGS="-I$with_gmp_prefix/include" GMP_LDFLAGS="-L$with_gmp_prefix/lib" fi GMP_LIBS=-lgmp SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$GMP_CPPFLAGS $CPPFLAGS" LDFLAGS="$GMP_LDFLAGS $LDFLAGS" LIBS="$GMP_LIBS $LIBS" ac_fn_c_check_header_mongrel "$LINENO" "gmp.h" "ac_cv_header_gmp_h" "$ac_includes_default" if test "x$ac_cv_header_gmp_h" = xyes; then : else as_fn_error $? "gmp.h header not found" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lgmp" >&5 $as_echo_n "checking for main in -lgmp... " >&6; } if ${ac_cv_lib_gmp_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lgmp $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { return main (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_gmp_main=yes else ac_cv_lib_gmp_main=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_gmp_main" >&5 $as_echo "$ac_cv_lib_gmp_main" >&6; } if test "x$ac_cv_lib_gmp_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBGMP 1 _ACEOF LIBS="-lgmp $LIBS" else as_fn_error $? "gmp library not found" "$LINENO" 5 fi cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { mpz_t n, d; if (mpz_divisible_p(n, d)) mpz_divexact_ui(n, n, 4); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : else as_fn_error $? "gmp library too old" "$LINENO" 5 fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext CPPFLAGS="$SAVE_CPPFLAGS" LDFLAGS="$SAVE_LDFLAGS" LIBS="$SAVE_LIBS" ;; build) GMP_CPPFLAGS="-I$gmp_srcdir -I$with_gmp_builddir" GMP_LIBS="$with_gmp_builddir/libgmp.la" ;; esac SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" SAVE_LIBS="$LIBS" CPPFLAGS="$GMP_CPPFLAGS $CPPFLAGS" LDFLAGS="$GMP_LDFLAGS $LDFLAGS" LIBS="$GMP_LIBS $LIBS" need_get_memory_functions=false ac_fn_c_check_decl "$LINENO" "mp_get_memory_functions" "ac_cv_have_decl_mp_get_memory_functions" "#include " if test "x$ac_cv_have_decl_mp_get_memory_functions" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_MP_GET_MEMORY_FUNCTIONS $ac_have_decl _ACEOF if test $ac_have_decl = 1; then : else need_get_memory_functions=true fi if test "$cross_compiling" = yes; then : need_normalized_gcdext=true else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { mpz_t x,y,g,a,b; mpz_init(x); mpz_init(y); mpz_init(g); mpz_init(a); mpz_init(b); mpz_set_si(x, -1); mpz_set_si(y, 9); mpz_gcdext(g, a, b, x, y); if (mpz_get_si(a) == -1 && mpz_get_si(b) == 0) return 0; else return 1; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : need_normalized_gcdext=false else need_normalized_gcdext=true fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi CPPFLAGS="$SAVE_CPPFLAGS" LDFLAGS="$SAVE_LDFLAGS" LIBS="$SAVE_LIBS" if test x$need_get_memory_functions = xtrue; then NEED_GET_MEMORY_FUNCTIONS_TRUE= NEED_GET_MEMORY_FUNCTIONS_FALSE='#' else NEED_GET_MEMORY_FUNCTIONS_TRUE='#' NEED_GET_MEMORY_FUNCTIONS_FALSE= fi if test $need_normalized_gcdext = true; then $as_echo "#define GMP_NORMALIZE_GCDEXT /**/" >>confdefs.h fi # Check whether --with-piplib was given. if test "${with_piplib+set}" = set; then : withval=$with_piplib; fi case "system" in no|system|build) # Check whether --with-piplib_prefix was given. if test "${with_piplib_prefix+set}" = set; then : withval=$with_piplib_prefix; fi # Check whether --with-piplib_exec_prefix was given. if test "${with_piplib_exec_prefix+set}" = set; then : withval=$with_piplib_exec_prefix; fi esac # Check whether --with-piplib_builddir was given. if test "${with_piplib_builddir+set}" = set; then : withval=$with_piplib_builddir; fi if test "x$with_piplib_prefix" != "x" -a "x$with_piplib_exec_prefix" = "x"; then with_piplib_exec_prefix=$with_piplib_prefix fi if test "x$with_piplib_prefix" != "x" -o "x$with_piplib_exec_prefix" != "x"; then if test "x$with_piplib" != "x" -a "x$with_piplib" != "xyes" -a "x$with_piplib" != "xsystem"; then as_fn_error $? "Setting $with_piplib_prefix implies use of system piplib" "$LINENO" 5 fi with_piplib="system" fi if test "x$with_piplib_builddir" != "x"; then if test "x$with_piplib" != "x" -a "x$with_piplib" != "xyes" -a "x$with_piplib" != "xbuild"; then as_fn_error $? "Setting $with_piplib_builddir implies use of build piplib" "$LINENO" 5 fi with_piplib="build" piplib_srcdir=`echo @abs_srcdir@ | $with_piplib_builddir/config.status --file=-` { $as_echo "$as_me:${as_lineno-$LINENO}: piplib sources in $piplib_srcdir" >&5 $as_echo "$as_me: piplib sources in $piplib_srcdir" >&6;} fi if test "x$with_piplib_exec_prefix" != "x"; then export PKG_CONFIG_PATH="$with_piplib_exec_prefix/lib/pkgconfig${PKG_CONFIG_PATH+:$PKG_CONFIG_PATH}" fi case "$with_piplib" in no|system|build) ;; *) case "no" in bundled) if test -d $srcdir/.git -a \ -d $srcdir/piplib -a \ ! -d $srcdir/piplib/.git; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git repo detected, but submodule piplib not initialized" >&5 $as_echo "$as_me: WARNING: git repo detected, but submodule piplib not initialized" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You may want to run" >&5 $as_echo "$as_me: WARNING: You may want to run" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule init" >&5 $as_echo "$as_me: WARNING: git submodule init" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule update" >&5 $as_echo "$as_me: WARNING: git submodule update" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: sh autogen.sh" >&5 $as_echo "$as_me: WARNING: sh autogen.sh" >&2;} fi if test -f $srcdir/piplib/configure; then with_piplib="bundled" else with_piplib="no" fi ;; *) with_piplib="no" ;; esac ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking which piplib to use" >&5 $as_echo_n "checking which piplib to use... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_piplib" >&5 $as_echo "$with_piplib" >&6; } have_piplib=false case "$with_piplib" in build) PIPLIB_CPPFLAGS="-I$piplib_srcdir/include" PIPLIB_LIBS="$with_piplib_builddir/libpiplibMP.la" ;; system) PIPLIB_LIBS="-lpiplibMP" if test "x$with_piplib_prefix" != "x"; then PIPLIB_CPPFLAGS="-I$with_piplib_prefix/include" PIPLIB_LDFLAGS="-L$with_piplib_prefix/lib" fi SAVE_CPPFLAGS="$CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" CPPFLAGS="$PIPLIB_CPPFLAGS $CPPFLAGS" LDFLAGS="$PIPLIB_LDFLAGS $LDFLAGS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for pip_solve in -lpiplibMP" >&5 $as_echo_n "checking for pip_solve in -lpiplibMP... " >&6; } if ${ac_cv_lib_piplibMP_pip_solve+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lpiplibMP $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char pip_solve (); int main () { return pip_solve (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_piplibMP_pip_solve=yes else ac_cv_lib_piplibMP_pip_solve=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_piplibMP_pip_solve" >&5 $as_echo "$ac_cv_lib_piplibMP_pip_solve" >&6; } if test "x$ac_cv_lib_piplibMP_pip_solve" = xyes; then : ac_fn_c_check_member "$LINENO" "PipOptions" "Urs_parms" "ac_cv_member_PipOptions_Urs_parms" "#include " if test "x$ac_cv_member_PipOptions_Urs_parms" = xyes; then : else as_fn_error $? "Piplib too old; please install version 1.3.6 or newer" "$LINENO" 5 fi else as_fn_error $? "Piplib not found" "$LINENO" 5 fi CPPFLAGS="$SAVE_CPPFLAGS" LDFLAGS="$SAVE_LDFLAGS" ;; no) ;; *) as_fn_error $? "unsupported" "$LINENO" 5 ;; esac if test "$with_piplib" != "no"; then $as_echo "#define ISL_PIPLIB /**/" >>confdefs.h have_piplib=true fi if test x$have_piplib = xtrue; then HAVE_PIPLIB_TRUE= HAVE_PIPLIB_FALSE='#' else HAVE_PIPLIB_TRUE='#' HAVE_PIPLIB_FALSE= fi # Check whether --with-clang was given. if test "${with_clang+set}" = set; then : withval=$with_clang; fi case "system" in system|no) # Check whether --with-clang_prefix was given. if test "${with_clang_prefix+set}" = set; then : withval=$with_clang_prefix; fi # Check whether --with-clang_exec_prefix was given. if test "${with_clang_exec_prefix+set}" = set; then : withval=$with_clang_exec_prefix; fi esac if test "x$with_clang_prefix" != "x" -a "x$with_clang_exec_prefix" = "x"; then with_clang_exec_prefix=$with_clang_prefix fi if test "x$with_clang_prefix" != "x" -o "x$with_clang_exec_prefix" != "x"; then if test "x$with_clang" != "x" -a "x$with_clang" != "xyes" -a "x$with_clang" != "xsystem"; then as_fn_error $? "Setting $with_clang_prefix implies use of system clang" "$LINENO" 5 fi with_clang="system" fi if test "x$with_clang_builddir" != "x"; then if test "x$with_clang" != "x" -a "x$with_clang" != "xyes" -a "x$with_clang" != "xbuild"; then as_fn_error $? "Setting $with_clang_builddir implies use of build clang" "$LINENO" 5 fi with_clang="build" clang_srcdir=`echo @abs_srcdir@ | $with_clang_builddir/config.status --file=-` { $as_echo "$as_me:${as_lineno-$LINENO}: clang sources in $clang_srcdir" >&5 $as_echo "$as_me: clang sources in $clang_srcdir" >&6;} fi if test "x$with_clang_exec_prefix" != "x"; then export PKG_CONFIG_PATH="$with_clang_exec_prefix/lib/pkgconfig${PKG_CONFIG_PATH+:$PKG_CONFIG_PATH}" fi case "$with_clang" in system|no) ;; *) case "no" in bundled) if test -d $srcdir/.git -a \ -d $srcdir/clang -a \ ! -d $srcdir/clang/.git; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git repo detected, but submodule clang not initialized" >&5 $as_echo "$as_me: WARNING: git repo detected, but submodule clang not initialized" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You may want to run" >&5 $as_echo "$as_me: WARNING: You may want to run" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule init" >&5 $as_echo "$as_me: WARNING: git submodule init" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule update" >&5 $as_echo "$as_me: WARNING: git submodule update" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: sh autogen.sh" >&5 $as_echo "$as_me: WARNING: sh autogen.sh" >&2;} fi if test -f $srcdir/clang/configure; then with_clang="bundled" else with_clang="no" fi ;; *) with_clang="no" ;; esac ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking which clang to use" >&5 $as_echo_n "checking which clang to use... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_clang" >&5 $as_echo "$with_clang" >&6; } case "$with_clang" in system) { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" llvm_config="llvm-config" # Extract the first word of ""$llvm_config"", so it can be a program name with args. set dummy "$llvm_config"; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_llvm_config_found+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$llvm_config_found"; then ac_cv_prog_llvm_config_found="$llvm_config_found" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_llvm_config_found="yes" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi llvm_config_found=$ac_cv_prog_llvm_config_found if test -n "$llvm_config_found"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $llvm_config_found" >&5 $as_echo "$llvm_config_found" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$with_clang_prefix" != "x"; then llvm_config="$with_clang_prefix/bin/llvm-config" if test -x "$llvm_config"; then llvm_config_found=yes fi fi if test "$llvm_config_found" != yes; then as_fn_error $? "llvm-config not found" "$LINENO" 5 fi CLANG_CXXFLAGS=`$llvm_config --cxxflags` CLANG_LDFLAGS=`$llvm_config --ldflags` targets=`$llvm_config --targets-built` components="$targets asmparser bitreader support mc" $llvm_config --components | $GREP option > /dev/null 2> /dev/null if test $? -eq 0; then components="$components option" fi CLANG_LIBS=`$llvm_config --libs $components` CLANG_PREFIX=`$llvm_config --prefix` cat >>confdefs.h <<_ACEOF #define CLANG_PREFIX "$CLANG_PREFIX" _ACEOF SAVE_CPPFLAGS="$CPPFLAGS" CPPFLAGS="$CLANG_CXXFLAGS $CPPFLAGS" ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu ac_fn_cxx_check_header_mongrel "$LINENO" "clang/Basic/SourceLocation.h" "ac_cv_header_clang_Basic_SourceLocation_h" "$ac_includes_default" if test "x$ac_cv_header_clang_Basic_SourceLocation_h" = xyes; then : else as_fn_error $? "clang header file not found" "$LINENO" 5 fi cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "getDefaultTargetTriple" >/dev/null 2>&1; then : else $as_echo "#define getDefaultTargetTriple getHostTriple" >>confdefs.h fi rm -f conftest* cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "getExpansionLineNumber" >/dev/null 2>&1; then : else $as_echo "#define getExpansionLineNumber getInstantiationLineNumber" >>confdefs.h fi rm -f conftest* cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "DiagnosticsEngine" >/dev/null 2>&1; then : else $as_echo "#define DiagnosticsEngine Diagnostic" >>confdefs.h fi rm -f conftest* cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "ArrayRef" >/dev/null 2>&1; then : $as_echo "#define USE_ARRAYREF /**/" >>confdefs.h fi rm -f conftest* cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "CXXIsProduction" >/dev/null 2>&1; then : $as_echo "#define HAVE_CXXISPRODUCTION /**/" >>confdefs.h fi rm -f conftest* cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP " IsProduction" >/dev/null 2>&1; then : $as_echo "#define HAVE_ISPRODUCTION /**/" >>confdefs.h fi rm -f conftest* cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "void HandleTopLevelDecl\(" >/dev/null 2>&1; then : $as_echo "#define HandleTopLevelDeclReturn void" >>confdefs.h $as_echo "#define HandleTopLevelDeclContinue /**/" >>confdefs.h else $as_echo "#define HandleTopLevelDeclReturn bool" >>confdefs.h $as_echo "#define HandleTopLevelDeclContinue true" >>confdefs.h fi rm -f conftest* ac_fn_cxx_check_header_mongrel "$LINENO" "clang/Basic/DiagnosticOptions.h" "ac_cv_header_clang_Basic_DiagnosticOptions_h" "$ac_includes_default" if test "x$ac_cv_header_clang_Basic_DiagnosticOptions_h" = xyes; then : $as_echo "#define HAVE_BASIC_DIAGNOSTICOPTIONS_H /**/" >>confdefs.h fi cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { using namespace clang; TargetOptions *TO; DiagnosticsEngine *Diags; TargetInfo::CreateTargetInfo(*Diags, TO); ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : $as_echo "#define CREATETARGETINFO_TAKES_POINTER /**/" >>confdefs.h fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { using namespace clang; DiagnosticConsumer *client; CompilerInstance *Clang; Clang->createDiagnostics(client); ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else $as_echo "#define CREATEDIAGNOSTICS_TAKES_ARG /**/" >>confdefs.h fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { using namespace clang; HeaderSearchOptions HSO; HSO.AddPath("", frontend::Angled, false, false); ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : $as_echo "#define ADDPATH_TAKES_4_ARGUMENTS /**/" >>confdefs.h fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu CPPFLAGS="$SAVE_CPPFLAGS" SAVE_LDFLAGS="$LDFLAGS" LDFLAGS="$CLANG_LDFLAGS $LDFLAGS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lclangEdit" >&5 $as_echo_n "checking for main in -lclangEdit... " >&6; } if ${ac_cv_lib_clangEdit_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lclangEdit $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { return main (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_clangEdit_main=yes else ac_cv_lib_clangEdit_main=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_clangEdit_main" >&5 $as_echo "$ac_cv_lib_clangEdit_main" >&6; } if test "x$ac_cv_lib_clangEdit_main" = xyes; then : LIB_CLANG_EDIT=-lclangEdit fi LDFLAGS="$SAVE_LDFLAGS" ;; esac if test $with_clang = system; then HAVE_CLANG_TRUE= HAVE_CLANG_FALSE='#' else HAVE_CLANG_TRUE='#' HAVE_CLANG_FALSE= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler vendor" >&5 $as_echo_n "checking for C compiler vendor... " >&6; } if ${ax_cv_c_compiler_vendor+:} false; then : $as_echo_n "(cached) " >&6 else ax_cv_c_compiler_vendor=unknown # note: don't check for gcc first since some other compilers define __GNUC__ for ventest in intel:__ICC,__ECC,__INTEL_COMPILER ibm:__xlc__,__xlC__,__IBMC__,__IBMCPP__ pathscale:__PATHCC__,__PATHSCALE__ clang:__clang__ gnu:__GNUC__ sun:__SUNPRO_C,__SUNPRO_CC hp:__HP_cc,__HP_aCC dec:__DECC,__DECCXX,__DECC_VER,__DECCXX_VER borland:__BORLANDC__,__TURBOC__ comeau:__COMO__ cray:_CRAYC kai:__KCC lcc:__LCC__ metrowerks:__MWERKS__ sgi:__sgi,sgi microsoft:_MSC_VER watcom:__WATCOMC__ portland:__PGI; do vencpp="defined("`echo $ventest | cut -d: -f2 | sed 's/,/) || defined(/g'`")" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #if !($vencpp) thisisanerror; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_compiler_vendor=`echo $ventest | cut -d: -f1`; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_c_compiler_vendor" >&5 $as_echo "$ax_cv_c_compiler_vendor" >&6; } WARNING_FLAGS="" if test "${ax_cv_c_compiler_vendor}" = "clang"; then WARNING_FLAGS="-Wall" fi PACKAGE_CFLAGS="$GMP_CPPFLAGS" PACKAGE_LDFLAGS="$GMP_LDFLAGS" PACKAGE_LIBS="-lisl -lgmp" # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig libname" >&5 $as_echo_n "checking our pkgconfig libname... " >&6; } test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="${PACKAGE_NAME}" test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="$PACKAGE" ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libname" >&5 $as_echo "$ax_create_pkgconfig_libname" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig version" >&5 $as_echo_n "checking our pkgconfig version... " >&6; } test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="${PACKAGE_VERSION}" test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="$VERSION" ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_version" >&5 $as_echo "$ax_create_pkgconfig_version" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libdir" >&5 $as_echo_n "checking our pkgconfig_libdir... " >&6; } test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' ax_create_pkgconfig_libdir=`eval echo "$pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libdir" >&5 $as_echo "$pkgconfig_libdir" >&6; } test "$pkgconfig_libdir" != "$ax_create_pkgconfig_libdir" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&5 $as_echo "expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libfile" >&5 $as_echo_n "checking our pkgconfig_libfile... " >&6; } test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_libfile=`eval echo "$pkgconfig_libfile"` ax_create_pkgconfig_libfile=`eval echo "$ax_create_pkgconfig_libfile"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libfile" >&5 $as_echo "$pkgconfig_libfile" >&6; } test "$pkgconfig_libfile" != "$ax_create_pkgconfig_libfile" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&5 $as_echo "expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our package / suffix" >&5 $as_echo_n "checking our package / suffix... " >&6; } ax_create_pkgconfig_suffix="$program_suffix" test ".$ax_create_pkgconfig_suffix" != .NONE || ax_create_pkgconfig_suffix="" { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&5 $as_echo "${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig description" >&5 $as_echo_n "checking our pkgconfig description... " >&6; } ax_create_pkgconfig_description="$PACKAGE_SUMMARY" test ".$ax_create_pkgconfig_description" != "." || \ ax_create_pkgconfig_description="$ax_create_pkgconfig_libname Library" ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_description" >&5 $as_echo "$ax_create_pkgconfig_description" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig requires" >&5 $as_echo_n "checking our pkgconfig requires... " >&6; } ax_create_pkgconfig_requires="$PACKAGE_REQUIRES" ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_requires" >&5 $as_echo "$ax_create_pkgconfig_requires" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ext libs" >&5 $as_echo_n "checking our pkgconfig ext libs... " >&6; } ax_create_pkgconfig_pkglibs="$PACKAGE_LIBS" test ".$ax_create_pkgconfig_pkglibs" != "." || ax_create_pkgconfig_pkglibs="-l$ax_create_pkgconfig_libname" ax_create_pkgconfig_libs="$ax_create_pkgconfig_pkglibs $LIBS" ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libs" >&5 $as_echo "$ax_create_pkgconfig_libs" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig cppflags" >&5 $as_echo_n "checking our pkgconfig cppflags... " >&6; } ax_create_pkgconfig_cppflags="$PACKAGE_CFLAGS" ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_cppflags" >&5 $as_echo "$ax_create_pkgconfig_cppflags" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ldflags" >&5 $as_echo_n "checking our pkgconfig ldflags... " >&6; } ax_create_pkgconfig_ldflags="$PACKAGE_LDFLAGS" ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_ldflags" >&5 $as_echo "$ax_create_pkgconfig_ldflags" >&6; } test ".$ax_create_pkgconfig_generate" != "." || \ ax_create_pkgconfig_generate="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` test "$pkgconfig_libfile" != "$ax_create_pkgconfig_generate" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: generate the pkgconfig later... $ax_create_pkgconfig_generate" >&5 $as_echo "generate the pkgconfig later... $ax_create_pkgconfig_generate" >&6; }) if test ".$ax_create_pkgconfig_src_libdir" = "." ; then ax_create_pkgconfig_src_libdir=`pwd` ax_create_pkgconfig_src_libdir=`$as_dirname -- "$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" || $as_expr X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_libdir/src || \ ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/src" case ".$objdir" in *libs) ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/$objdir" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&5 $as_echo "noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&6; } fi if test ".$ax_create_pkgconfig_src_headers" = "." ; then ax_create_pkgconfig_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) ax_create_pkgconfig_src_headers="" ;; esac ax_create_pkgconfig_src_headers=`$as_dirname -- "$ax_create_pkgconfig_src_headers/$v/x" || $as_expr X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_headers/$v/x" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_headers/include || \ ax_create_pkgconfig_src_headers="$ax_create_pkgconfig_src_headers/include" { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&5 $as_echo "noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&6; } fi ac_config_commands="$ac_config_commands $ax_create_pkgconfig_generate" if test -f $srcdir/.git/HEAD; then GIT_HEAD="$srcdir/.git/index" GIT_REPO="$srcdir/.git" GIT_HEAD_ID=`GIT_DIR=$GIT_REPO git describe` elif test -f $srcdir/GIT_HEAD_ID; then GIT_HEAD_ID=`cat $srcdir/GIT_HEAD_ID` else mysrcdir=`(cd $srcdir; pwd)` head=`basename $mysrcdir | sed -e 's/.*-//'` head2=`echo $head | sed -e 's/^0-9a-f//'` head3=`echo $head2 | sed -e 's/........................................//'` if test "x$head3" = "x" -a "x$head" = "x$head2"; then GIT_HEAD_ID="$head" else GIT_HEAD_ID="UNKNOWN" fi fi if test -z "$GIT_REPO" ; then GIT_HEAD_VERSION="$GIT_HEAD_ID" else GIT_HEAD_VERSION="\`GIT_DIR=$GIT_REPO git describe\`" fi echo '#define GIT_HEAD_ID "'$GIT_HEAD_ID'"' > gitversion.h ac_config_headers="$ac_config_headers isl_config.h" ac_config_headers="$ac_config_headers include/isl/config.h" ac_config_files="$ac_config_files Makefile" ac_config_files="$ac_config_files doc/Makefile" if test $with_clang = system; then ac_config_files="$ac_config_files interface/Makefile" fi ac_config_files="$ac_config_files bound_test.sh" ac_config_files="$ac_config_files codegen_test.sh" ac_config_files="$ac_config_files pip_test.sh" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error $? "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${GENERATE_DOC_TRUE}" && test -z "${GENERATE_DOC_FALSE}"; then as_fn_error $? "conditional \"GENERATE_DOC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${NEED_GET_MEMORY_FUNCTIONS_TRUE}" && test -z "${NEED_GET_MEMORY_FUNCTIONS_FALSE}"; then as_fn_error $? "conditional \"NEED_GET_MEMORY_FUNCTIONS\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_PIPLIB_TRUE}" && test -z "${HAVE_PIPLIB_FALSE}"; then as_fn_error $? "conditional \"HAVE_PIPLIB\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_CLANG_TRUE}" && test -z "${HAVE_CLANG_FALSE}"; then as_fn_error $? "conditional \"HAVE_CLANG\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by isl $as_me 0.12.1, which was generated by GNU Autoconf 2.68. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to ." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ isl config.status 0.12.1 configured by $0, generated by GNU Autoconf 2.68, with options \\"\$ac_cs_config\\" Copyright (C) 2010 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error $? "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X '$SHELL' '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' macro_version='`$ECHO "$macro_version" | $SED "$delay_single_quote_subst"`' macro_revision='`$ECHO "$macro_revision" | $SED "$delay_single_quote_subst"`' enable_shared='`$ECHO "$enable_shared" | $SED "$delay_single_quote_subst"`' enable_static='`$ECHO "$enable_static" | $SED "$delay_single_quote_subst"`' pic_mode='`$ECHO "$pic_mode" | $SED "$delay_single_quote_subst"`' enable_fast_install='`$ECHO "$enable_fast_install" | $SED "$delay_single_quote_subst"`' SHELL='`$ECHO "$SHELL" | $SED "$delay_single_quote_subst"`' ECHO='`$ECHO "$ECHO" | $SED "$delay_single_quote_subst"`' PATH_SEPARATOR='`$ECHO "$PATH_SEPARATOR" | $SED "$delay_single_quote_subst"`' host_alias='`$ECHO "$host_alias" | $SED "$delay_single_quote_subst"`' host='`$ECHO "$host" | $SED "$delay_single_quote_subst"`' host_os='`$ECHO "$host_os" | $SED "$delay_single_quote_subst"`' build_alias='`$ECHO "$build_alias" | $SED "$delay_single_quote_subst"`' build='`$ECHO "$build" | $SED "$delay_single_quote_subst"`' build_os='`$ECHO "$build_os" | $SED "$delay_single_quote_subst"`' SED='`$ECHO "$SED" | $SED "$delay_single_quote_subst"`' Xsed='`$ECHO "$Xsed" | $SED "$delay_single_quote_subst"`' GREP='`$ECHO "$GREP" | $SED "$delay_single_quote_subst"`' EGREP='`$ECHO "$EGREP" | $SED "$delay_single_quote_subst"`' FGREP='`$ECHO "$FGREP" | $SED "$delay_single_quote_subst"`' LD='`$ECHO "$LD" | $SED "$delay_single_quote_subst"`' NM='`$ECHO "$NM" | $SED "$delay_single_quote_subst"`' LN_S='`$ECHO "$LN_S" | $SED "$delay_single_quote_subst"`' max_cmd_len='`$ECHO "$max_cmd_len" | $SED "$delay_single_quote_subst"`' ac_objext='`$ECHO "$ac_objext" | $SED "$delay_single_quote_subst"`' exeext='`$ECHO "$exeext" | $SED "$delay_single_quote_subst"`' lt_unset='`$ECHO "$lt_unset" | $SED "$delay_single_quote_subst"`' lt_SP2NL='`$ECHO "$lt_SP2NL" | $SED "$delay_single_quote_subst"`' lt_NL2SP='`$ECHO "$lt_NL2SP" | $SED "$delay_single_quote_subst"`' lt_cv_to_host_file_cmd='`$ECHO "$lt_cv_to_host_file_cmd" | $SED "$delay_single_quote_subst"`' lt_cv_to_tool_file_cmd='`$ECHO "$lt_cv_to_tool_file_cmd" | $SED "$delay_single_quote_subst"`' reload_flag='`$ECHO "$reload_flag" | $SED "$delay_single_quote_subst"`' reload_cmds='`$ECHO "$reload_cmds" | $SED "$delay_single_quote_subst"`' OBJDUMP='`$ECHO "$OBJDUMP" | $SED "$delay_single_quote_subst"`' deplibs_check_method='`$ECHO "$deplibs_check_method" | $SED "$delay_single_quote_subst"`' file_magic_cmd='`$ECHO "$file_magic_cmd" | $SED "$delay_single_quote_subst"`' file_magic_glob='`$ECHO "$file_magic_glob" | $SED "$delay_single_quote_subst"`' want_nocaseglob='`$ECHO "$want_nocaseglob" | $SED "$delay_single_quote_subst"`' DLLTOOL='`$ECHO "$DLLTOOL" | $SED "$delay_single_quote_subst"`' sharedlib_from_linklib_cmd='`$ECHO "$sharedlib_from_linklib_cmd" | $SED "$delay_single_quote_subst"`' AR='`$ECHO "$AR" | $SED "$delay_single_quote_subst"`' AR_FLAGS='`$ECHO "$AR_FLAGS" | $SED "$delay_single_quote_subst"`' archiver_list_spec='`$ECHO "$archiver_list_spec" | $SED "$delay_single_quote_subst"`' STRIP='`$ECHO "$STRIP" | $SED "$delay_single_quote_subst"`' RANLIB='`$ECHO "$RANLIB" | $SED "$delay_single_quote_subst"`' old_postinstall_cmds='`$ECHO "$old_postinstall_cmds" | $SED "$delay_single_quote_subst"`' old_postuninstall_cmds='`$ECHO "$old_postuninstall_cmds" | $SED "$delay_single_quote_subst"`' old_archive_cmds='`$ECHO "$old_archive_cmds" | $SED "$delay_single_quote_subst"`' lock_old_archive_extraction='`$ECHO "$lock_old_archive_extraction" | $SED "$delay_single_quote_subst"`' CC='`$ECHO "$CC" | $SED "$delay_single_quote_subst"`' CFLAGS='`$ECHO "$CFLAGS" | $SED "$delay_single_quote_subst"`' compiler='`$ECHO "$compiler" | $SED "$delay_single_quote_subst"`' GCC='`$ECHO "$GCC" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_pipe='`$ECHO "$lt_cv_sys_global_symbol_pipe" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_cdecl='`$ECHO "$lt_cv_sys_global_symbol_to_cdecl" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_import='`$ECHO "$lt_cv_sys_global_symbol_to_import" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $SED "$delay_single_quote_subst"`' lt_cv_nm_interface='`$ECHO "$lt_cv_nm_interface" | $SED "$delay_single_quote_subst"`' nm_file_list_spec='`$ECHO "$nm_file_list_spec" | $SED "$delay_single_quote_subst"`' lt_sysroot='`$ECHO "$lt_sysroot" | $SED "$delay_single_quote_subst"`' objdir='`$ECHO "$objdir" | $SED "$delay_single_quote_subst"`' MAGIC_CMD='`$ECHO "$MAGIC_CMD" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag='`$ECHO "$lt_prog_compiler_no_builtin_flag" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_pic='`$ECHO "$lt_prog_compiler_pic" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_wl='`$ECHO "$lt_prog_compiler_wl" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_static='`$ECHO "$lt_prog_compiler_static" | $SED "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o='`$ECHO "$lt_cv_prog_compiler_c_o" | $SED "$delay_single_quote_subst"`' need_locks='`$ECHO "$need_locks" | $SED "$delay_single_quote_subst"`' MANIFEST_TOOL='`$ECHO "$MANIFEST_TOOL" | $SED "$delay_single_quote_subst"`' DSYMUTIL='`$ECHO "$DSYMUTIL" | $SED "$delay_single_quote_subst"`' NMEDIT='`$ECHO "$NMEDIT" | $SED "$delay_single_quote_subst"`' LIPO='`$ECHO "$LIPO" | $SED "$delay_single_quote_subst"`' OTOOL='`$ECHO "$OTOOL" | $SED "$delay_single_quote_subst"`' OTOOL64='`$ECHO "$OTOOL64" | $SED "$delay_single_quote_subst"`' libext='`$ECHO "$libext" | $SED "$delay_single_quote_subst"`' shrext_cmds='`$ECHO "$shrext_cmds" | $SED "$delay_single_quote_subst"`' extract_expsyms_cmds='`$ECHO "$extract_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds_need_lc='`$ECHO "$archive_cmds_need_lc" | $SED "$delay_single_quote_subst"`' enable_shared_with_static_runtimes='`$ECHO "$enable_shared_with_static_runtimes" | $SED "$delay_single_quote_subst"`' export_dynamic_flag_spec='`$ECHO "$export_dynamic_flag_spec" | $SED "$delay_single_quote_subst"`' whole_archive_flag_spec='`$ECHO "$whole_archive_flag_spec" | $SED "$delay_single_quote_subst"`' compiler_needs_object='`$ECHO "$compiler_needs_object" | $SED "$delay_single_quote_subst"`' old_archive_from_new_cmds='`$ECHO "$old_archive_from_new_cmds" | $SED "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds='`$ECHO "$old_archive_from_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds='`$ECHO "$archive_cmds" | $SED "$delay_single_quote_subst"`' archive_expsym_cmds='`$ECHO "$archive_expsym_cmds" | $SED "$delay_single_quote_subst"`' module_cmds='`$ECHO "$module_cmds" | $SED "$delay_single_quote_subst"`' module_expsym_cmds='`$ECHO "$module_expsym_cmds" | $SED "$delay_single_quote_subst"`' with_gnu_ld='`$ECHO "$with_gnu_ld" | $SED "$delay_single_quote_subst"`' allow_undefined_flag='`$ECHO "$allow_undefined_flag" | $SED "$delay_single_quote_subst"`' no_undefined_flag='`$ECHO "$no_undefined_flag" | $SED "$delay_single_quote_subst"`' hardcode_libdir_flag_spec='`$ECHO "$hardcode_libdir_flag_spec" | $SED "$delay_single_quote_subst"`' hardcode_libdir_separator='`$ECHO "$hardcode_libdir_separator" | $SED "$delay_single_quote_subst"`' hardcode_direct='`$ECHO "$hardcode_direct" | $SED "$delay_single_quote_subst"`' hardcode_direct_absolute='`$ECHO "$hardcode_direct_absolute" | $SED "$delay_single_quote_subst"`' hardcode_minus_L='`$ECHO "$hardcode_minus_L" | $SED "$delay_single_quote_subst"`' hardcode_shlibpath_var='`$ECHO "$hardcode_shlibpath_var" | $SED "$delay_single_quote_subst"`' hardcode_automatic='`$ECHO "$hardcode_automatic" | $SED "$delay_single_quote_subst"`' inherit_rpath='`$ECHO "$inherit_rpath" | $SED "$delay_single_quote_subst"`' link_all_deplibs='`$ECHO "$link_all_deplibs" | $SED "$delay_single_quote_subst"`' always_export_symbols='`$ECHO "$always_export_symbols" | $SED "$delay_single_quote_subst"`' export_symbols_cmds='`$ECHO "$export_symbols_cmds" | $SED "$delay_single_quote_subst"`' exclude_expsyms='`$ECHO "$exclude_expsyms" | $SED "$delay_single_quote_subst"`' include_expsyms='`$ECHO "$include_expsyms" | $SED "$delay_single_quote_subst"`' prelink_cmds='`$ECHO "$prelink_cmds" | $SED "$delay_single_quote_subst"`' postlink_cmds='`$ECHO "$postlink_cmds" | $SED "$delay_single_quote_subst"`' file_list_spec='`$ECHO "$file_list_spec" | $SED "$delay_single_quote_subst"`' variables_saved_for_relink='`$ECHO "$variables_saved_for_relink" | $SED "$delay_single_quote_subst"`' need_lib_prefix='`$ECHO "$need_lib_prefix" | $SED "$delay_single_quote_subst"`' need_version='`$ECHO "$need_version" | $SED "$delay_single_quote_subst"`' version_type='`$ECHO "$version_type" | $SED "$delay_single_quote_subst"`' runpath_var='`$ECHO "$runpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_var='`$ECHO "$shlibpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_overrides_runpath='`$ECHO "$shlibpath_overrides_runpath" | $SED "$delay_single_quote_subst"`' libname_spec='`$ECHO "$libname_spec" | $SED "$delay_single_quote_subst"`' library_names_spec='`$ECHO "$library_names_spec" | $SED "$delay_single_quote_subst"`' soname_spec='`$ECHO "$soname_spec" | $SED "$delay_single_quote_subst"`' install_override_mode='`$ECHO "$install_override_mode" | $SED "$delay_single_quote_subst"`' postinstall_cmds='`$ECHO "$postinstall_cmds" | $SED "$delay_single_quote_subst"`' postuninstall_cmds='`$ECHO "$postuninstall_cmds" | $SED "$delay_single_quote_subst"`' finish_cmds='`$ECHO "$finish_cmds" | $SED "$delay_single_quote_subst"`' finish_eval='`$ECHO "$finish_eval" | $SED "$delay_single_quote_subst"`' hardcode_into_libs='`$ECHO "$hardcode_into_libs" | $SED "$delay_single_quote_subst"`' sys_lib_search_path_spec='`$ECHO "$sys_lib_search_path_spec" | $SED "$delay_single_quote_subst"`' sys_lib_dlsearch_path_spec='`$ECHO "$sys_lib_dlsearch_path_spec" | $SED "$delay_single_quote_subst"`' hardcode_action='`$ECHO "$hardcode_action" | $SED "$delay_single_quote_subst"`' enable_dlopen='`$ECHO "$enable_dlopen" | $SED "$delay_single_quote_subst"`' enable_dlopen_self='`$ECHO "$enable_dlopen_self" | $SED "$delay_single_quote_subst"`' enable_dlopen_self_static='`$ECHO "$enable_dlopen_self_static" | $SED "$delay_single_quote_subst"`' old_striplib='`$ECHO "$old_striplib" | $SED "$delay_single_quote_subst"`' striplib='`$ECHO "$striplib" | $SED "$delay_single_quote_subst"`' compiler_lib_search_dirs='`$ECHO "$compiler_lib_search_dirs" | $SED "$delay_single_quote_subst"`' predep_objects='`$ECHO "$predep_objects" | $SED "$delay_single_quote_subst"`' postdep_objects='`$ECHO "$postdep_objects" | $SED "$delay_single_quote_subst"`' predeps='`$ECHO "$predeps" | $SED "$delay_single_quote_subst"`' postdeps='`$ECHO "$postdeps" | $SED "$delay_single_quote_subst"`' compiler_lib_search_path='`$ECHO "$compiler_lib_search_path" | $SED "$delay_single_quote_subst"`' LD_CXX='`$ECHO "$LD_CXX" | $SED "$delay_single_quote_subst"`' reload_flag_CXX='`$ECHO "$reload_flag_CXX" | $SED "$delay_single_quote_subst"`' reload_cmds_CXX='`$ECHO "$reload_cmds_CXX" | $SED "$delay_single_quote_subst"`' old_archive_cmds_CXX='`$ECHO "$old_archive_cmds_CXX" | $SED "$delay_single_quote_subst"`' compiler_CXX='`$ECHO "$compiler_CXX" | $SED "$delay_single_quote_subst"`' GCC_CXX='`$ECHO "$GCC_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag_CXX='`$ECHO "$lt_prog_compiler_no_builtin_flag_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_pic_CXX='`$ECHO "$lt_prog_compiler_pic_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_wl_CXX='`$ECHO "$lt_prog_compiler_wl_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_static_CXX='`$ECHO "$lt_prog_compiler_static_CXX" | $SED "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o_CXX='`$ECHO "$lt_cv_prog_compiler_c_o_CXX" | $SED "$delay_single_quote_subst"`' archive_cmds_need_lc_CXX='`$ECHO "$archive_cmds_need_lc_CXX" | $SED "$delay_single_quote_subst"`' enable_shared_with_static_runtimes_CXX='`$ECHO "$enable_shared_with_static_runtimes_CXX" | $SED "$delay_single_quote_subst"`' export_dynamic_flag_spec_CXX='`$ECHO "$export_dynamic_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' whole_archive_flag_spec_CXX='`$ECHO "$whole_archive_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' compiler_needs_object_CXX='`$ECHO "$compiler_needs_object_CXX" | $SED "$delay_single_quote_subst"`' old_archive_from_new_cmds_CXX='`$ECHO "$old_archive_from_new_cmds_CXX" | $SED "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds_CXX='`$ECHO "$old_archive_from_expsyms_cmds_CXX" | $SED "$delay_single_quote_subst"`' archive_cmds_CXX='`$ECHO "$archive_cmds_CXX" | $SED "$delay_single_quote_subst"`' archive_expsym_cmds_CXX='`$ECHO "$archive_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`' module_cmds_CXX='`$ECHO "$module_cmds_CXX" | $SED "$delay_single_quote_subst"`' module_expsym_cmds_CXX='`$ECHO "$module_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`' with_gnu_ld_CXX='`$ECHO "$with_gnu_ld_CXX" | $SED "$delay_single_quote_subst"`' allow_undefined_flag_CXX='`$ECHO "$allow_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`' no_undefined_flag_CXX='`$ECHO "$no_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_CXX='`$ECHO "$hardcode_libdir_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' hardcode_libdir_separator_CXX='`$ECHO "$hardcode_libdir_separator_CXX" | $SED "$delay_single_quote_subst"`' hardcode_direct_CXX='`$ECHO "$hardcode_direct_CXX" | $SED "$delay_single_quote_subst"`' hardcode_direct_absolute_CXX='`$ECHO "$hardcode_direct_absolute_CXX" | $SED "$delay_single_quote_subst"`' hardcode_minus_L_CXX='`$ECHO "$hardcode_minus_L_CXX" | $SED "$delay_single_quote_subst"`' hardcode_shlibpath_var_CXX='`$ECHO "$hardcode_shlibpath_var_CXX" | $SED "$delay_single_quote_subst"`' hardcode_automatic_CXX='`$ECHO "$hardcode_automatic_CXX" | $SED "$delay_single_quote_subst"`' inherit_rpath_CXX='`$ECHO "$inherit_rpath_CXX" | $SED "$delay_single_quote_subst"`' link_all_deplibs_CXX='`$ECHO "$link_all_deplibs_CXX" | $SED "$delay_single_quote_subst"`' always_export_symbols_CXX='`$ECHO "$always_export_symbols_CXX" | $SED "$delay_single_quote_subst"`' export_symbols_cmds_CXX='`$ECHO "$export_symbols_cmds_CXX" | $SED "$delay_single_quote_subst"`' exclude_expsyms_CXX='`$ECHO "$exclude_expsyms_CXX" | $SED "$delay_single_quote_subst"`' include_expsyms_CXX='`$ECHO "$include_expsyms_CXX" | $SED "$delay_single_quote_subst"`' prelink_cmds_CXX='`$ECHO "$prelink_cmds_CXX" | $SED "$delay_single_quote_subst"`' postlink_cmds_CXX='`$ECHO "$postlink_cmds_CXX" | $SED "$delay_single_quote_subst"`' file_list_spec_CXX='`$ECHO "$file_list_spec_CXX" | $SED "$delay_single_quote_subst"`' hardcode_action_CXX='`$ECHO "$hardcode_action_CXX" | $SED "$delay_single_quote_subst"`' compiler_lib_search_dirs_CXX='`$ECHO "$compiler_lib_search_dirs_CXX" | $SED "$delay_single_quote_subst"`' predep_objects_CXX='`$ECHO "$predep_objects_CXX" | $SED "$delay_single_quote_subst"`' postdep_objects_CXX='`$ECHO "$postdep_objects_CXX" | $SED "$delay_single_quote_subst"`' predeps_CXX='`$ECHO "$predeps_CXX" | $SED "$delay_single_quote_subst"`' postdeps_CXX='`$ECHO "$postdeps_CXX" | $SED "$delay_single_quote_subst"`' compiler_lib_search_path_CXX='`$ECHO "$compiler_lib_search_path_CXX" | $SED "$delay_single_quote_subst"`' LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } # Quote evaled strings. for var in SHELL \ ECHO \ PATH_SEPARATOR \ SED \ GREP \ EGREP \ FGREP \ LD \ NM \ LN_S \ lt_SP2NL \ lt_NL2SP \ reload_flag \ OBJDUMP \ deplibs_check_method \ file_magic_cmd \ file_magic_glob \ want_nocaseglob \ DLLTOOL \ sharedlib_from_linklib_cmd \ AR \ AR_FLAGS \ archiver_list_spec \ STRIP \ RANLIB \ CC \ CFLAGS \ compiler \ lt_cv_sys_global_symbol_pipe \ lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_import \ lt_cv_sys_global_symbol_to_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ lt_cv_nm_interface \ nm_file_list_spec \ lt_prog_compiler_no_builtin_flag \ lt_prog_compiler_pic \ lt_prog_compiler_wl \ lt_prog_compiler_static \ lt_cv_prog_compiler_c_o \ need_locks \ MANIFEST_TOOL \ DSYMUTIL \ NMEDIT \ LIPO \ OTOOL \ OTOOL64 \ shrext_cmds \ export_dynamic_flag_spec \ whole_archive_flag_spec \ compiler_needs_object \ with_gnu_ld \ allow_undefined_flag \ no_undefined_flag \ hardcode_libdir_flag_spec \ hardcode_libdir_separator \ exclude_expsyms \ include_expsyms \ file_list_spec \ variables_saved_for_relink \ libname_spec \ library_names_spec \ soname_spec \ install_override_mode \ finish_eval \ old_striplib \ striplib \ compiler_lib_search_dirs \ predep_objects \ postdep_objects \ predeps \ postdeps \ compiler_lib_search_path \ LD_CXX \ reload_flag_CXX \ compiler_CXX \ lt_prog_compiler_no_builtin_flag_CXX \ lt_prog_compiler_pic_CXX \ lt_prog_compiler_wl_CXX \ lt_prog_compiler_static_CXX \ lt_cv_prog_compiler_c_o_CXX \ export_dynamic_flag_spec_CXX \ whole_archive_flag_spec_CXX \ compiler_needs_object_CXX \ with_gnu_ld_CXX \ allow_undefined_flag_CXX \ no_undefined_flag_CXX \ hardcode_libdir_flag_spec_CXX \ hardcode_libdir_separator_CXX \ exclude_expsyms_CXX \ include_expsyms_CXX \ file_list_spec_CXX \ compiler_lib_search_dirs_CXX \ predep_objects_CXX \ postdep_objects_CXX \ predeps_CXX \ postdeps_CXX \ compiler_lib_search_path_CXX; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in reload_cmds \ old_postinstall_cmds \ old_postuninstall_cmds \ old_archive_cmds \ extract_expsyms_cmds \ old_archive_from_new_cmds \ old_archive_from_expsyms_cmds \ archive_cmds \ archive_expsym_cmds \ module_cmds \ module_expsym_cmds \ export_symbols_cmds \ prelink_cmds \ postlink_cmds \ postinstall_cmds \ postuninstall_cmds \ finish_cmds \ sys_lib_search_path_spec \ sys_lib_dlsearch_path_spec \ reload_cmds_CXX \ old_archive_cmds_CXX \ old_archive_from_new_cmds_CXX \ old_archive_from_expsyms_cmds_CXX \ archive_cmds_CXX \ archive_expsym_cmds_CXX \ module_cmds_CXX \ module_expsym_cmds_CXX \ export_symbols_cmds_CXX \ prelink_cmds_CXX \ postlink_cmds_CXX; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done ac_aux_dir='$ac_aux_dir' # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi PACKAGE='$PACKAGE' VERSION='$VERSION' RM='$RM' ofile='$ofile' # variables for create stdint.h replacement PACKAGE="$PACKAGE" VERSION="$VERSION" ac_stdint_h="$ac_stdint_h" _ac_stdint_h=`$as_echo "_$PACKAGE-$ac_stdint_h" | $as_tr_cpp` ac_cv_stdint_message="$ac_cv_stdint_message" ac_cv_header_stdint_t="$ac_cv_header_stdint_t" ac_cv_header_stdint_x="$ac_cv_header_stdint_x" ac_cv_header_stdint_o="$ac_cv_header_stdint_o" ac_cv_header_stdint_u="$ac_cv_header_stdint_u" ac_cv_type_uint64_t="$ac_cv_type_uint64_t" ac_cv_type_u_int64_t="$ac_cv_type_u_int64_t" ac_cv_char_data_model="$ac_cv_char_data_model" ac_cv_long_data_model="$ac_cv_long_data_model" ac_cv_type_int_least32_t="$ac_cv_type_int_least32_t" ac_cv_type_int_fast32_t="$ac_cv_type_int_fast32_t" ac_cv_type_intmax_t="$ac_cv_type_intmax_t" ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;; "$ac_stdint_h") CONFIG_COMMANDS="$CONFIG_COMMANDS $ac_stdint_h" ;; "$ax_create_pkgconfig_generate") CONFIG_COMMANDS="$CONFIG_COMMANDS $ax_create_pkgconfig_generate" ;; "isl_config.h") CONFIG_HEADERS="$CONFIG_HEADERS isl_config.h" ;; "include/isl/config.h") CONFIG_HEADERS="$CONFIG_HEADERS include/isl/config.h" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "doc/Makefile") CONFIG_FILES="$CONFIG_FILES doc/Makefile" ;; "interface/Makefile") CONFIG_FILES="$CONFIG_FILES interface/Makefile" ;; "bound_test.sh") CONFIG_FILES="$CONFIG_FILES bound_test.sh" ;; "codegen_test.sh") CONFIG_FILES="$CONFIG_FILES codegen_test.sh" ;; "pip_test.sh") CONFIG_FILES="$CONFIG_FILES pip_test.sh" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$ac_tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_tt=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_tt"; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error $? "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" } >"$ac_tmp/config.h" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$ac_tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$ac_tmp/config.h" "$ac_file" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error $? "could not create -" "$LINENO" 5 fi # Compute "$ac_file"'s index in $config_headers. _am_arg="$ac_file" _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; "libtool":C) # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi cfgfile=${ofile}T trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; either version 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # The names of the tagged configurations supported by this script. available_tags='CXX ' # ### BEGIN LIBTOOL CONFIG # Which release of libtool.m4 was used? macro_version=$macro_version macro_revision=$macro_revision # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # What type of objects to build. pic_mode=$pic_mode # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # An echo program that protects backslashes. ECHO=$lt_ECHO # The PATH separator for the build system. PATH_SEPARATOR=$lt_PATH_SEPARATOR # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="\$SED -e 1s/^X//" # A grep program that handles long lines. GREP=$lt_GREP # An ERE matcher. EGREP=$lt_EGREP # A literal string matcher. FGREP=$lt_FGREP # A BSD- or MS-compatible name lister. NM=$lt_NM # Whether we need soft or hard links. LN_S=$lt_LN_S # What is the maximum length of a command? max_cmd_len=$max_cmd_len # Object file suffix (normally "o"). objext=$ac_objext # Executable file suffix (normally ""). exeext=$exeext # whether the shell understands "unset". lt_unset=$lt_unset # turn spaces into newlines. SP2NL=$lt_lt_SP2NL # turn newlines into spaces. NL2SP=$lt_lt_NL2SP # convert \$build file names to \$host format. to_host_file_cmd=$lt_cv_to_host_file_cmd # convert \$build files to toolchain format. to_tool_file_cmd=$lt_cv_to_tool_file_cmd # An object symbol dumper. OBJDUMP=$lt_OBJDUMP # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method = "file_magic". file_magic_cmd=$lt_file_magic_cmd # How to find potential files when deplibs_check_method = "file_magic". file_magic_glob=$lt_file_magic_glob # Find potential files using nocaseglob when deplibs_check_method = "file_magic". want_nocaseglob=$lt_want_nocaseglob # DLL creation program. DLLTOOL=$lt_DLLTOOL # Command to associate shared and link libraries. sharedlib_from_linklib_cmd=$lt_sharedlib_from_linklib_cmd # The archiver. AR=$lt_AR # Flags to create an archive. AR_FLAGS=$lt_AR_FLAGS # How to feed a file listing to the archiver. archiver_list_spec=$lt_archiver_list_spec # A symbol stripping program. STRIP=$lt_STRIP # Commands used to install an old-style archive. RANLIB=$lt_RANLIB old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Whether to use a lock for old archive extraction. lock_old_archive_extraction=$lock_old_archive_extraction # A C compiler. LTCC=$lt_CC # LTCC compiler flags. LTCFLAGS=$lt_CFLAGS # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration. global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm into a list of symbols to manually relocate. global_symbol_to_import=$lt_lt_cv_sys_global_symbol_to_import # Transform the output of nm in a C name address pair. global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # Transform the output of nm in a C name address pair when lib prefix is needed. global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix # The name lister interface. nm_interface=$lt_lt_cv_nm_interface # Specify filename containing input files for \$NM. nm_file_list_spec=$lt_nm_file_list_spec # The root where to search for dependent libraries,and where our libraries should be installed. lt_sysroot=$lt_sysroot # The name of the directory that contains temporary libtool files. objdir=$objdir # Used to examine libraries when file_magic_cmd begins with "file". MAGIC_CMD=$MAGIC_CMD # Must we lock files when doing compilation? need_locks=$lt_need_locks # Manifest tool. MANIFEST_TOOL=$lt_MANIFEST_TOOL # Tool to manipulate archived DWARF debug symbol files on Mac OS X. DSYMUTIL=$lt_DSYMUTIL # Tool to change global to local symbols on Mac OS X. NMEDIT=$lt_NMEDIT # Tool to manipulate fat objects and archives on Mac OS X. LIPO=$lt_LIPO # ldd/readelf like tool for Mach-O binaries on Mac OS X. OTOOL=$lt_OTOOL # ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4. OTOOL64=$lt_OTOOL64 # Old archive suffix (normally "a"). libext=$libext # Shared library suffix (normally ".so"). shrext_cmds=$lt_shrext_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Variables whose values should be saved in libtool wrapper scripts and # restored at link time. variables_saved_for_relink=$lt_variables_saved_for_relink # Do we need the "lib" prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Library versioning type. version_type=$version_type # Shared library runtime path variable. runpath_var=$runpath_var # Shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Permission mode override for installation of shared libraries. install_override_mode=$lt_install_override_mode # Command to use after installation of a shared archive. postinstall_cmds=$lt_postinstall_cmds # Command to use after uninstallation of a shared archive. postuninstall_cmds=$lt_postuninstall_cmds # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # As "finish_cmds", except a single script fragment to be evaled but # not shown. finish_eval=$lt_finish_eval # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Compile-time system search path for libraries. sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries. sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # The linker used to build libraries. LD=$lt_LD # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds # A language specific compiler. CC=$lt_compiler # Is the compiler the GNU compiler? with_gcc=$GCC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to "yes" if using DIR/libNAME\$shared_ext during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct # Set to "yes" if using DIR/libNAME\$shared_ext during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \$shlibpath_var if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds # Commands necessary for finishing linking programs. postlink_cmds=$lt_postlink_cmds # Specify filename containing input files. file_list_spec=$lt_file_list_spec # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects postdep_objects=$lt_postdep_objects predeps=$lt_predeps postdeps=$lt_postdeps # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac ltmain=$ac_aux_dir/ltmain.sh # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" cat <<_LT_EOF >> "$ofile" # ### BEGIN LIBTOOL TAG CONFIG: CXX # The linker used to build libraries. LD=$lt_LD_CXX # How to create reloadable object files. reload_flag=$lt_reload_flag_CXX reload_cmds=$lt_reload_cmds_CXX # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds_CXX # A language specific compiler. CC=$lt_compiler_CXX # Is the compiler the GNU compiler? with_gcc=$GCC_CXX # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_CXX # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_CXX # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_CXX # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_CXX # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object_CXX # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds_CXX archive_expsym_cmds=$lt_archive_expsym_cmds_CXX # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds_CXX module_expsym_cmds=$lt_module_expsym_cmds_CXX # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld_CXX # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_CXX # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_CXX # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX # Set to "yes" if using DIR/libNAME\$shared_ext during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct_CXX # Set to "yes" if using DIR/libNAME\$shared_ext during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \$shlibpath_var if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute_CXX # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L_CXX # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_CXX # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic_CXX # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath_CXX # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_CXX # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols_CXX # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_CXX # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_CXX # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_CXX # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds_CXX # Commands necessary for finishing linking programs. postlink_cmds=$lt_postlink_cmds_CXX # Specify filename containing input files. file_list_spec=$lt_file_list_spec_CXX # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_CXX # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects_CXX postdep_objects=$lt_postdep_objects_CXX predeps=$lt_predeps_CXX postdeps=$lt_postdeps_CXX # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_CXX # ### END LIBTOOL TAG CONFIG: CXX _LT_EOF ;; "$ac_stdint_h":C) { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_stdint_h : $_ac_stdint_h" >&5 $as_echo "$as_me: creating $ac_stdint_h : $_ac_stdint_h" >&6;} ac_stdint=$tmp/_stdint.h echo "#ifndef" $_ac_stdint_h >$ac_stdint echo "#define" $_ac_stdint_h "1" >>$ac_stdint echo "#ifndef" _GENERATED_STDINT_H >>$ac_stdint echo "#define" _GENERATED_STDINT_H '"'$PACKAGE $VERSION'"' >>$ac_stdint echo "/* generated $ac_cv_stdint_message */" >>$ac_stdint if test "_$ac_cv_header_stdint_t" != "_" ; then echo "#define _STDINT_HAVE_STDINT_H" "1" >>$ac_stdint echo "#include " >>$ac_stdint echo "#endif" >>$ac_stdint echo "#endif" >>$ac_stdint else cat >>$ac_stdint < #else #include /* .................... configured part ............................ */ STDINT_EOF echo "/* whether we have a C99 compatible stdint header file */" >>$ac_stdint if test "_$ac_cv_header_stdint_x" != "_" ; then ac_header="$ac_cv_header_stdint_x" echo "#define _STDINT_HEADER_INTPTR" '"'"$ac_header"'"' >>$ac_stdint else echo "/* #undef _STDINT_HEADER_INTPTR */" >>$ac_stdint fi echo "/* whether we have a C96 compatible inttypes header file */" >>$ac_stdint if test "_$ac_cv_header_stdint_o" != "_" ; then ac_header="$ac_cv_header_stdint_o" echo "#define _STDINT_HEADER_UINT32" '"'"$ac_header"'"' >>$ac_stdint else echo "/* #undef _STDINT_HEADER_UINT32 */" >>$ac_stdint fi echo "/* whether we have a BSD compatible inet types header */" >>$ac_stdint if test "_$ac_cv_header_stdint_u" != "_" ; then ac_header="$ac_cv_header_stdint_u" echo "#define _STDINT_HEADER_U_INT32" '"'"$ac_header"'"' >>$ac_stdint else echo "/* #undef _STDINT_HEADER_U_INT32 */" >>$ac_stdint fi echo "" >>$ac_stdint if test "_$ac_header" != "_" ; then if test "$ac_header" != "stddef.h" ; then echo "#include <$ac_header>" >>$ac_stdint echo "" >>$ac_stdint fi fi echo "/* which 64bit typedef has been found */" >>$ac_stdint if test "$ac_cv_type_uint64_t" = "yes" ; then echo "#define _STDINT_HAVE_UINT64_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_UINT64_T */" >>$ac_stdint fi if test "$ac_cv_type_u_int64_t" = "yes" ; then echo "#define _STDINT_HAVE_U_INT64_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_U_INT64_T */" >>$ac_stdint fi echo "" >>$ac_stdint echo "/* which type model has been detected */" >>$ac_stdint if test "_$ac_cv_char_data_model" != "_" ; then echo "#define _STDINT_CHAR_MODEL" "$ac_cv_char_data_model" >>$ac_stdint echo "#define _STDINT_LONG_MODEL" "$ac_cv_long_data_model" >>$ac_stdint else echo "/* #undef _STDINT_CHAR_MODEL // skipped */" >>$ac_stdint echo "/* #undef _STDINT_LONG_MODEL // skipped */" >>$ac_stdint fi echo "" >>$ac_stdint echo "/* whether int_least types were detected */" >>$ac_stdint if test "$ac_cv_type_int_least32_t" = "yes"; then echo "#define _STDINT_HAVE_INT_LEAST32_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_INT_LEAST32_T */" >>$ac_stdint fi echo "/* whether int_fast types were detected */" >>$ac_stdint if test "$ac_cv_type_int_fast32_t" = "yes"; then echo "#define _STDINT_HAVE_INT_FAST32_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_INT_FAST32_T */" >>$ac_stdint fi echo "/* whether intmax_t type was detected */" >>$ac_stdint if test "$ac_cv_type_intmax_t" = "yes"; then echo "#define _STDINT_HAVE_INTMAX_T" "1" >>$ac_stdint else echo "/* #undef _STDINT_HAVE_INTMAX_T */" >>$ac_stdint fi echo "" >>$ac_stdint cat >>$ac_stdint <= 199901L #define _HAVE_UINT64_T #define _HAVE_LONGLONG_UINT64_T typedef long long int64_t; typedef unsigned long long uint64_t; #elif !defined __STRICT_ANSI__ #if defined _MSC_VER || defined __WATCOMC__ || defined __BORLANDC__ #define _HAVE_UINT64_T typedef __int64 int64_t; typedef unsigned __int64 uint64_t; #elif defined __GNUC__ || defined __MWERKS__ || defined __ELF__ /* note: all ELF-systems seem to have loff-support which needs 64-bit */ #if !defined _NO_LONGLONG #define _HAVE_UINT64_T #define _HAVE_LONGLONG_UINT64_T typedef long long int64_t; typedef unsigned long long uint64_t; #endif #elif defined __alpha || (defined __mips && defined _ABIN32) #if !defined _NO_LONGLONG typedef long int64_t; typedef unsigned long uint64_t; #endif /* compiler/cpu type to define int64_t */ #endif #endif #endif #if defined _STDINT_HAVE_U_INT_TYPES /* int8_t int16_t int32_t defined by inet code, redeclare the u_intXX types */ typedef u_int8_t uint8_t; typedef u_int16_t uint16_t; typedef u_int32_t uint32_t; /* glibc compatibility */ #ifndef __int8_t_defined #define __int8_t_defined #endif #endif #ifdef _STDINT_NEED_INT_MODEL_T /* we must guess all the basic types. Apart from byte-adressable system, */ /* there a few 32-bit-only dsp-systems that we guard with BYTE_MODEL 8-} */ /* (btw, those nibble-addressable systems are way off, or so we assume) */ #if defined _STDINT_BYTE_MODEL #if _STDINT_LONG_MODEL+0 == 242 /* 2:4:2 = IP16 = a normal 16-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned long uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef long int32_t; #endif #elif _STDINT_LONG_MODEL+0 == 244 || _STDINT_LONG_MODEL == 444 /* 2:4:4 = LP32 = a 32-bit system derived from a 16-bit */ /* 4:4:4 = ILP32 = a normal 32-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef int int32_t; #endif #elif _STDINT_LONG_MODEL+0 == 484 || _STDINT_LONG_MODEL+0 == 488 /* 4:8:4 = IP32 = a 32-bit system prepared for 64-bit */ /* 4:8:8 = LP64 = a normal 64-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef int int32_t; #endif /* this system has a "long" of 64bit */ #ifndef _HAVE_UINT64_T #define _HAVE_UINT64_T typedef unsigned long uint64_t; typedef long int64_t; #endif #elif _STDINT_LONG_MODEL+0 == 448 /* LLP64 a 64-bit system derived from a 32-bit system */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; #ifndef __int8_t_defined #define __int8_t_defined typedef char int8_t; typedef short int16_t; typedef int int32_t; #endif /* assuming the system has a "long long" */ #ifndef _HAVE_UINT64_T #define _HAVE_UINT64_T #define _HAVE_LONGLONG_UINT64_T typedef unsigned long long uint64_t; typedef long long int64_t; #endif #else #define _STDINT_NO_INT32_T #endif #else #define _STDINT_NO_INT8_T #define _STDINT_NO_INT32_T #endif #endif /* * quote from SunOS-5.8 sys/inttypes.h: * Use at your own risk. As of February 1996, the committee is squarely * behind the fixed sized types; the "least" and "fast" types are still being * discussed. The probability that the "fast" types may be removed before * the standard is finalized is high enough that they are not currently * implemented. */ #if defined _STDINT_NEED_INT_LEAST_T typedef int8_t int_least8_t; typedef int16_t int_least16_t; typedef int32_t int_least32_t; #ifdef _HAVE_UINT64_T typedef int64_t int_least64_t; #endif typedef uint8_t uint_least8_t; typedef uint16_t uint_least16_t; typedef uint32_t uint_least32_t; #ifdef _HAVE_UINT64_T typedef uint64_t uint_least64_t; #endif /* least types */ #endif #if defined _STDINT_NEED_INT_FAST_T typedef int8_t int_fast8_t; typedef int int_fast16_t; typedef int32_t int_fast32_t; #ifdef _HAVE_UINT64_T typedef int64_t int_fast64_t; #endif typedef uint8_t uint_fast8_t; typedef unsigned uint_fast16_t; typedef uint32_t uint_fast32_t; #ifdef _HAVE_UINT64_T typedef uint64_t uint_fast64_t; #endif /* fast types */ #endif #ifdef _STDINT_NEED_INTMAX_T #ifdef _HAVE_UINT64_T typedef int64_t intmax_t; typedef uint64_t uintmax_t; #else typedef long intmax_t; typedef unsigned long uintmax_t; #endif #endif #ifdef _STDINT_NEED_INTPTR_T #ifndef __intptr_t_defined #define __intptr_t_defined /* we encourage using "long" to store pointer values, never use "int" ! */ #if _STDINT_LONG_MODEL+0 == 242 || _STDINT_LONG_MODEL+0 == 484 typedef unsigned int uintptr_t; typedef int intptr_t; #elif _STDINT_LONG_MODEL+0 == 244 || _STDINT_LONG_MODEL+0 == 444 typedef unsigned long uintptr_t; typedef long intptr_t; #elif _STDINT_LONG_MODEL+0 == 448 && defined _HAVE_UINT64_T typedef uint64_t uintptr_t; typedef int64_t intptr_t; #else /* matches typical system types ILP32 and LP64 - but not IP16 or LLP64 */ typedef unsigned long uintptr_t; typedef long intptr_t; #endif #endif #endif /* The ISO C99 standard specifies that in C++ implementations these should only be defined if explicitly requested. */ #if !defined __cplusplus || defined __STDC_CONSTANT_MACROS #ifndef UINT32_C /* Signed. */ # define INT8_C(c) c # define INT16_C(c) c # define INT32_C(c) c # ifdef _HAVE_LONGLONG_UINT64_T # define INT64_C(c) c ## L # else # define INT64_C(c) c ## LL # endif /* Unsigned. */ # define UINT8_C(c) c ## U # define UINT16_C(c) c ## U # define UINT32_C(c) c ## U # ifdef _HAVE_LONGLONG_UINT64_T # define UINT64_C(c) c ## UL # else # define UINT64_C(c) c ## ULL # endif /* Maximal type. */ # ifdef _HAVE_LONGLONG_UINT64_T # define INTMAX_C(c) c ## L # define UINTMAX_C(c) c ## UL # else # define INTMAX_C(c) c ## LL # define UINTMAX_C(c) c ## ULL # endif /* literalnumbers */ #endif #endif /* These limits are merily those of a two complement byte-oriented system */ /* Minimum of signed integral types. */ # define INT8_MIN (-128) # define INT16_MIN (-32767-1) # define INT32_MIN (-2147483647-1) #ifndef INT64_MIN # define INT64_MIN (-__INT64_C(9223372036854775807)-1) #endif /* Maximum of signed integral types. */ # define INT8_MAX (127) # define INT16_MAX (32767) # define INT32_MAX (2147483647) #ifndef INT64_MAX # define INT64_MAX (__INT64_C(9223372036854775807)) #endif /* Maximum of unsigned integral types. */ #ifndef UINT8_MAX # define UINT8_MAX (255) #endif #ifndef UINT16_MAX # define UINT16_MAX (65535) #endif # define UINT32_MAX (4294967295U) #ifndef UINT64_MAX # define UINT64_MAX (__UINT64_C(18446744073709551615)) #endif /* Minimum of signed integral types having a minimum size. */ # define INT_LEAST8_MIN INT8_MIN # define INT_LEAST16_MIN INT16_MIN # define INT_LEAST32_MIN INT32_MIN # define INT_LEAST64_MIN INT64_MIN /* Maximum of signed integral types having a minimum size. */ # define INT_LEAST8_MAX INT8_MAX # define INT_LEAST16_MAX INT16_MAX # define INT_LEAST32_MAX INT32_MAX # define INT_LEAST64_MAX INT64_MAX /* Maximum of unsigned integral types having a minimum size. */ # define UINT_LEAST8_MAX UINT8_MAX # define UINT_LEAST16_MAX UINT16_MAX # define UINT_LEAST32_MAX UINT32_MAX # define UINT_LEAST64_MAX UINT64_MAX /* shortcircuit*/ #endif /* once */ #endif #endif STDINT_EOF fi if cmp -s $ac_stdint_h $ac_stdint 2>/dev/null; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_stdint_h is unchanged" >&5 $as_echo "$as_me: $ac_stdint_h is unchanged" >&6;} else ac_dir=`$as_dirname -- "$ac_stdint_h" || $as_expr X"$ac_stdint_h" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_stdint_h" : 'X\(//\)[^/]' \| \ X"$ac_stdint_h" : 'X\(//\)$' \| \ X"$ac_stdint_h" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_stdint_h" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p rm -f $ac_stdint_h mv $ac_stdint $ac_stdint_h fi ;; "$ax_create_pkgconfig_generate":C) pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_generate.in" >&5 $as_echo "$as_me: creating $pkgconfig_generate.in" >&6;} cat > $pkgconfig_generate.in <&5 $as_echo "$as_me: creating $pkgconfig_generate" >&6;} cat >conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then as_fn_error $? "$pkgconfig_generate is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error $? "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error $? "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ;; "bound_test.sh":F) chmod +x bound_test.sh ;; "codegen_test.sh":F) chmod +x codegen_test.sh ;; "pip_test.sh":F) chmod +x pip_test.sh ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 ac_configure_args="$ac_configure_args $isl_configure_args" # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi cloog-0.18.2/isl/isl_pw_templ.c0000664000175000017500000011763512254313240013272 00000000000000#include #include #define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) #define xS(TYPE,NAME) struct TYPE ## _ ## NAME #define S(TYPE,NAME) xS(TYPE,NAME) #ifdef HAS_TYPE __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim, enum isl_fold type, int n) #else __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim, int n) #endif { isl_ctx *ctx; struct PW *pw; if (!dim) return NULL; ctx = isl_space_get_ctx(dim); isl_assert(ctx, n >= 0, goto error); pw = isl_alloc(ctx, struct PW, sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece))); if (!pw) goto error; pw->ref = 1; #ifdef HAS_TYPE pw->type = type; #endif pw->size = n; pw->n = 0; pw->dim = dim; return pw; error: isl_space_free(dim); return NULL; } #ifdef HAS_TYPE __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim, enum isl_fold type) { return FN(PW,alloc_size)(dim, type, 0); } #else __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim) { return FN(PW,alloc_size)(dim, 0); } #endif __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw, __isl_take isl_set *set, __isl_take EL *el) { isl_ctx *ctx; isl_space *el_dim = NULL; if (!pw || !set || !el) goto error; if (isl_set_plain_is_empty(set) || FN(EL,EL_IS_ZERO)(el)) { isl_set_free(set); FN(EL,free)(el); return pw; } ctx = isl_set_get_ctx(set); #ifdef HAS_TYPE if (pw->type != el->type) isl_die(ctx, isl_error_invalid, "fold types don't match", goto error); #endif el_dim = FN(EL,get_space(el)); isl_assert(ctx, isl_space_is_equal(pw->dim, el_dim), goto error); isl_assert(ctx, pw->n < pw->size, goto error); pw->p[pw->n].set = set; pw->p[pw->n].FIELD = el; pw->n++; isl_space_free(el_dim); return pw; error: isl_space_free(el_dim); FN(PW,free)(pw); isl_set_free(set); FN(EL,free)(el); return NULL; } #ifdef HAS_TYPE __isl_give PW *FN(PW,alloc)(enum isl_fold type, __isl_take isl_set *set, __isl_take EL *el) #else __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el) #endif { PW *pw; if (!set || !el) goto error; #ifdef HAS_TYPE pw = FN(PW,alloc_size)(FN(EL,get_space)(el), type, 1); #else pw = FN(PW,alloc_size)(FN(EL,get_space)(el), 1); #endif return FN(PW,add_piece)(pw, set, el); error: isl_set_free(set); FN(EL,free)(el); return NULL; } __isl_give PW *FN(PW,dup)(__isl_keep PW *pw) { int i; PW *dup; if (!pw) return NULL; #ifdef HAS_TYPE dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, pw->n); #else dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->n); #endif if (!dup) return NULL; for (i = 0; i < pw->n; ++i) dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set), FN(EL,copy)(pw->p[i].FIELD)); return dup; } __isl_give PW *FN(PW,cow)(__isl_take PW *pw) { if (!pw) return NULL; if (pw->ref == 1) return pw; pw->ref--; return FN(PW,dup)(pw); } __isl_give PW *FN(PW,copy)(__isl_keep PW *pw) { if (!pw) return NULL; pw->ref++; return pw; } void *FN(PW,free)(__isl_take PW *pw) { int i; if (!pw) return NULL; if (--pw->ref > 0) return NULL; for (i = 0; i < pw->n; ++i) { isl_set_free(pw->p[i].set); FN(EL,free)(pw->p[i].FIELD); } isl_space_free(pw->dim); free(pw); return NULL; } const char *FN(PW,get_dim_name)(__isl_keep PW *pw, enum isl_dim_type type, unsigned pos) { return pw ? isl_space_get_dim_name(pw->dim, type, pos) : NULL; } int FN(PW,has_dim_id)(__isl_keep PW *pw, enum isl_dim_type type, unsigned pos) { return pw ? isl_space_has_dim_id(pw->dim, type, pos) : -1; } __isl_give isl_id *FN(PW,get_dim_id)(__isl_keep PW *pw, enum isl_dim_type type, unsigned pos) { return pw ? isl_space_get_dim_id(pw->dim, type, pos) : NULL; } int FN(PW,has_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type) { return pw ? isl_space_has_tuple_name(pw->dim, type) : -1; } const char *FN(PW,get_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type) { return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL; } int FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type) { return pw ? isl_space_has_tuple_id(pw->dim, type) : -1; } __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type) { return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL; } int FN(PW,IS_ZERO)(__isl_keep PW *pw) { if (!pw) return -1; return pw->n == 0; } #ifndef NO_REALIGN __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw, __isl_take isl_reordering *exp) { int i; pw = FN(PW,cow)(pw); if (!pw || !exp) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_realign(pw->p[i].set, isl_reordering_copy(exp)); if (!pw->p[i].set) goto error; pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD, isl_reordering_copy(exp)); if (!pw->p[i].FIELD) goto error; } pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim)); isl_reordering_free(exp); return pw; error: isl_reordering_free(exp); FN(PW,free)(pw); return NULL; } /* Align the parameters of "pw" to those of "model". */ __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model) { isl_ctx *ctx; if (!pw || !model) goto error; ctx = isl_space_get_ctx(model); if (!isl_space_has_named_params(model)) isl_die(ctx, isl_error_invalid, "model has unnamed parameters", goto error); if (!isl_space_has_named_params(pw->dim)) isl_die(ctx, isl_error_invalid, "input has unnamed parameters", goto error); if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) { isl_reordering *exp; model = isl_space_drop_dims(model, isl_dim_in, 0, isl_space_dim(model, isl_dim_in)); model = isl_space_drop_dims(model, isl_dim_out, 0, isl_space_dim(model, isl_dim_out)); exp = isl_parameter_alignment_reordering(pw->dim, model); exp = isl_reordering_extend_space(exp, FN(PW,get_domain_space)(pw)); pw = FN(PW,realign_domain)(pw, exp); } isl_space_free(model); return pw; error: isl_space_free(model); FN(PW,free)(pw); return NULL; } static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1, __isl_take PW *pw2, __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2)) { isl_ctx *ctx; if (!pw1 || !pw2) goto error; if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param)) return fn(pw1, pw2); ctx = FN(PW,get_ctx)(pw1); if (!isl_space_has_named_params(pw1->dim) || !isl_space_has_named_params(pw2->dim)) isl_die(ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2)); pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1)); return fn(pw1, pw2); error: FN(PW,free)(pw1); FN(PW,free)(pw2); return NULL; } static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw, __isl_take isl_set *set, __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set)) { isl_ctx *ctx; if (!pw || !set) goto error; if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param)) return fn(pw, set); ctx = FN(PW,get_ctx)(pw); if (!isl_space_has_named_params(pw->dim) || !isl_space_has_named_params(set->dim)) isl_die(ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); pw = FN(PW,align_params)(pw, isl_set_get_space(set)); set = isl_set_align_params(set, FN(PW,get_space)(pw)); return fn(pw, set); error: FN(PW,free)(pw); isl_set_free(set); return NULL; } #endif static __isl_give PW *FN(PW,union_add_aligned)(__isl_take PW *pw1, __isl_take PW *pw2) { int i, j, n; struct PW *res; isl_ctx *ctx; isl_set *set; if (!pw1 || !pw2) goto error; ctx = isl_space_get_ctx(pw1->dim); #ifdef HAS_TYPE if (pw1->type != pw2->type) isl_die(ctx, isl_error_invalid, "fold types don't match", goto error); #endif isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error); if (FN(PW,IS_ZERO)(pw1)) { FN(PW,free)(pw1); return pw2; } if (FN(PW,IS_ZERO)(pw2)) { FN(PW,free)(pw2); return pw1; } n = (pw1->n + 1) * (pw2->n + 1); #ifdef HAS_TYPE res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n); #else res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n); #endif for (i = 0; i < pw1->n; ++i) { set = isl_set_copy(pw1->p[i].set); for (j = 0; j < pw2->n; ++j) { struct isl_set *common; EL *sum; common = isl_set_intersect(isl_set_copy(pw1->p[i].set), isl_set_copy(pw2->p[j].set)); if (isl_set_plain_is_empty(common)) { isl_set_free(common); continue; } set = isl_set_subtract(set, isl_set_copy(pw2->p[j].set)); sum = FN(EL,add_on_domain)(common, FN(EL,copy)(pw1->p[i].FIELD), FN(EL,copy)(pw2->p[j].FIELD)); res = FN(PW,add_piece)(res, common, sum); } res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD)); } for (j = 0; j < pw2->n; ++j) { set = isl_set_copy(pw2->p[j].set); for (i = 0; i < pw1->n; ++i) set = isl_set_subtract(set, isl_set_copy(pw1->p[i].set)); res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD)); } FN(PW,free)(pw1); FN(PW,free)(pw2); return res; error: FN(PW,free)(pw1); FN(PW,free)(pw2); return NULL; } /* Private version of "union_add". For isl_pw_qpolynomial and * isl_pw_qpolynomial_fold, we prefer to simply call it "add". */ static __isl_give PW *FN(PW,union_add_)(__isl_take PW *pw1, __isl_take PW *pw2) { return FN(PW,align_params_pw_pw_and)(pw1, pw2, &FN(PW,union_add_aligned)); } /* Make sure "pw" has room for at least "n" more pieces. * * If there is only one reference to pw, we extend it in place. * Otherwise, we create a new PW and copy the pieces. */ static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n) { int i; isl_ctx *ctx; PW *res; if (!pw) return NULL; if (pw->n + n <= pw->size) return pw; ctx = FN(PW,get_ctx)(pw); n += pw->n; if (pw->ref == 1) { res = isl_realloc(ctx, pw, struct PW, sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece))); if (!res) return FN(PW,free)(pw); res->size = n; return res; } #ifdef HAS_TYPE res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n); #else res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n); #endif if (!res) return FN(PW,free)(pw); for (i = 0; i < pw->n; ++i) res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set), FN(EL,copy)(pw->p[i].FIELD)); FN(PW,free)(pw); return res; } static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1, __isl_take PW *pw2) { int i; isl_ctx *ctx; if (!pw1 || !pw2) goto error; if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n) return FN(PW,add_disjoint_aligned)(pw2, pw1); ctx = isl_space_get_ctx(pw1->dim); #ifdef HAS_TYPE if (pw1->type != pw2->type) isl_die(ctx, isl_error_invalid, "fold types don't match", goto error); #endif isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error); if (FN(PW,IS_ZERO)(pw1)) { FN(PW,free)(pw1); return pw2; } if (FN(PW,IS_ZERO)(pw2)) { FN(PW,free)(pw2); return pw1; } pw1 = FN(PW,grow)(pw1, pw2->n); if (!pw1) goto error; for (i = 0; i < pw2->n; ++i) pw1 = FN(PW,add_piece)(pw1, isl_set_copy(pw2->p[i].set), FN(EL,copy)(pw2->p[i].FIELD)); FN(PW,free)(pw2); return pw1; error: FN(PW,free)(pw1); FN(PW,free)(pw2); return NULL; } __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2) { return FN(PW,align_params_pw_pw_and)(pw1, pw2, &FN(PW,add_disjoint_aligned)); } /* This function is currently only used from isl_aff.c */ static __isl_give PW *FN(PW,on_shared_domain_in)(__isl_take PW *pw1, __isl_take PW *pw2, __isl_take isl_space *space, __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2)) __attribute__ ((unused)); /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains. * The result of "fn" (and therefore also of this function) lives in "space". */ static __isl_give PW *FN(PW,on_shared_domain_in)(__isl_take PW *pw1, __isl_take PW *pw2, __isl_take isl_space *space, __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2)) { int i, j, n; PW *res = NULL; if (!pw1 || !pw2) goto error; n = pw1->n * pw2->n; #ifdef HAS_TYPE res = FN(PW,alloc_size)(isl_space_copy(space), pw1->type, n); #else res = FN(PW,alloc_size)(isl_space_copy(space), n); #endif for (i = 0; i < pw1->n; ++i) { for (j = 0; j < pw2->n; ++j) { isl_set *common; EL *res_ij; int empty; common = isl_set_intersect( isl_set_copy(pw1->p[i].set), isl_set_copy(pw2->p[j].set)); empty = isl_set_plain_is_empty(common); if (empty < 0 || empty) { isl_set_free(common); if (empty < 0) goto error; continue; } res_ij = fn(FN(EL,copy)(pw1->p[i].FIELD), FN(EL,copy)(pw2->p[j].FIELD)); res_ij = FN(EL,gist)(res_ij, isl_set_copy(common)); res = FN(PW,add_piece)(res, common, res_ij); } } isl_space_free(space); FN(PW,free)(pw1); FN(PW,free)(pw2); return res; error: isl_space_free(space); FN(PW,free)(pw1); FN(PW,free)(pw2); FN(PW,free)(res); return NULL; } /* This function is currently only used from isl_aff.c */ static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1, __isl_take PW *pw2, __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2)) __attribute__ ((unused)); /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains. * The result of "fn" is assumed to live in the same space as "pw1" and "pw2". */ static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1, __isl_take PW *pw2, __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2)) { isl_space *space; if (!pw1 || !pw2) goto error; space = isl_space_copy(pw1->dim); return FN(PW,on_shared_domain_in)(pw1, pw2, space, fn); error: FN(PW,free)(pw1); FN(PW,free)(pw2); return NULL; } #ifndef NO_NEG __isl_give PW *FN(PW,neg)(__isl_take PW *pw) { int i; if (!pw) return NULL; if (FN(PW,IS_ZERO)(pw)) return pw; pw = FN(PW,cow)(pw); if (!pw) return NULL; for (i = 0; i < pw->n; ++i) { pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD); if (!pw->p[i].FIELD) return FN(PW,free)(pw); } return pw; } __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2) { return FN(PW,add)(pw1, FN(PW,neg)(pw2)); } #endif #ifndef NO_EVAL __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw, __isl_take isl_point *pnt) { int i; int found = 0; isl_ctx *ctx; isl_space *pnt_dim = NULL; isl_qpolynomial *qp; if (!pw || !pnt) goto error; ctx = isl_point_get_ctx(pnt); pnt_dim = isl_point_get_space(pnt); isl_assert(ctx, isl_space_is_domain_internal(pnt_dim, pw->dim), goto error); for (i = 0; i < pw->n; ++i) { found = isl_set_contains_point(pw->p[i].set, pnt); if (found < 0) goto error; if (found) break; } if (found) qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD), isl_point_copy(pnt)); else qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw)); FN(PW,free)(pw); isl_space_free(pnt_dim); isl_point_free(pnt); return qp; error: FN(PW,free)(pw); isl_space_free(pnt_dim); isl_point_free(pnt); return NULL; } #endif __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw) { int i; isl_set *dom; if (!pw) return NULL; dom = isl_set_empty(FN(PW,get_domain_space)(pw)); for (i = 0; i < pw->n; ++i) dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set)); FN(PW,free)(pw); return dom; } /* Exploit the equalities in the domain of piece "i" of "pw" * to simplify the associated function. * If the domain of piece "i" is empty, then remove it entirely, * replacing it with the final piece. */ static int FN(PW,exploit_equalities_and_remove_if_empty)(__isl_keep PW *pw, int i) { isl_basic_set *aff; int empty = isl_set_plain_is_empty(pw->p[i].set); if (empty < 0) return -1; if (empty) { isl_set_free(pw->p[i].set); FN(EL,free)(pw->p[i].FIELD); if (i != pw->n - 1) pw->p[i] = pw->p[pw->n - 1]; pw->n--; return 0; } aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set)); pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD, aff); if (!pw->p[i].FIELD) return -1; return 0; } /* Restrict the domain of "pw" by combining each cell * with "set" through a call to "fn", where "fn" may be * isl_set_intersect or isl_set_intersect_params. */ static __isl_give PW *FN(PW,intersect_aligned)(__isl_take PW *pw, __isl_take isl_set *set, __isl_give isl_set *(*fn)(__isl_take isl_set *set1, __isl_take isl_set *set2)) { int i; if (!pw || !set) goto error; if (pw->n == 0) { isl_set_free(set); return pw; } pw = FN(PW,cow)(pw); if (!pw) goto error; for (i = pw->n - 1; i >= 0; --i) { pw->p[i].set = fn(pw->p[i].set, isl_set_copy(set)); if (FN(PW,exploit_equalities_and_remove_if_empty)(pw, i) < 0) goto error; } isl_set_free(set); return pw; error: isl_set_free(set); FN(PW,free)(pw); return NULL; } static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw, __isl_take isl_set *set) { return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect); } __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw, __isl_take isl_set *context) { return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,intersect_domain_aligned)); } static __isl_give PW *FN(PW,intersect_params_aligned)(__isl_take PW *pw, __isl_take isl_set *set) { return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect_params); } /* Intersect the domain of "pw" with the parameter domain "context". */ __isl_give PW *FN(PW,intersect_params)(__isl_take PW *pw, __isl_take isl_set *context) { return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,intersect_params_aligned)); } static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw, __isl_take isl_set *context, __isl_give EL *(*fn_el)(__isl_take EL *el, __isl_take isl_set *set), __isl_give isl_set *(*fn_dom)(__isl_take isl_set *set, __isl_take isl_basic_set *bset)) { int i; isl_basic_set *hull = NULL; if (!pw || !context) goto error; if (pw->n == 0) { isl_set_free(context); return pw; } if (!isl_space_match(pw->dim, isl_dim_param, context->dim, isl_dim_param)) { pw = FN(PW,align_params)(pw, isl_set_get_space(context)); context = isl_set_align_params(context, FN(PW,get_space)(pw)); } context = isl_set_compute_divs(context); hull = isl_set_simple_hull(isl_set_copy(context)); pw = FN(PW,cow)(pw); if (!pw) goto error; for (i = pw->n - 1; i >= 0; --i) { isl_set *set_i; int empty; set_i = isl_set_intersect(isl_set_copy(pw->p[i].set), isl_set_copy(context)); empty = isl_set_plain_is_empty(set_i); pw->p[i].FIELD = fn_el(pw->p[i].FIELD, set_i); pw->p[i].set = fn_dom(pw->p[i].set, isl_basic_set_copy(hull)); if (!pw->p[i].FIELD || !pw->p[i].set) goto error; if (empty) { isl_set_free(pw->p[i].set); FN(EL,free)(pw->p[i].FIELD); if (i != pw->n - 1) pw->p[i] = pw->p[pw->n - 1]; pw->n--; } } isl_basic_set_free(hull); isl_set_free(context); return pw; error: FN(PW,free)(pw); isl_basic_set_free(hull); isl_set_free(context); return NULL; } static __isl_give PW *FN(PW,gist_domain_aligned)(__isl_take PW *pw, __isl_take isl_set *set) { return FN(PW,gist_aligned)(pw, set, &FN(EL,gist), &isl_set_gist_basic_set); } __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context) { return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_domain_aligned)); } static __isl_give PW *FN(PW,gist_params_aligned)(__isl_take PW *pw, __isl_take isl_set *set) { return FN(PW,gist_aligned)(pw, set, &FN(EL,gist_params), &isl_set_gist_params_basic_set); } __isl_give PW *FN(PW,gist_params)(__isl_take PW *pw, __isl_take isl_set *context) { return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_params_aligned)); } __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw) { int i, j; if (!pw) return NULL; if (pw->n == 0) return pw; for (i = pw->n - 1; i >= 0; --i) { for (j = i - 1; j >= 0; --j) { if (!FN(EL,plain_is_equal)(pw->p[i].FIELD, pw->p[j].FIELD)) continue; pw->p[j].set = isl_set_union(pw->p[j].set, pw->p[i].set); FN(EL,free)(pw->p[i].FIELD); if (i != pw->n - 1) pw->p[i] = pw->p[pw->n - 1]; pw->n--; break; } if (j >= 0) continue; pw->p[i].set = isl_set_coalesce(pw->p[i].set); if (!pw->p[i].set) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw) { return pw ? isl_space_get_ctx(pw->dim) : NULL; } #ifndef NO_INVOLVES_DIMS int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type, unsigned first, unsigned n) { int i; enum isl_dim_type set_type; if (!pw) return -1; if (pw->n == 0 || n == 0) return 0; set_type = type == isl_dim_in ? isl_dim_set : type; for (i = 0; i < pw->n; ++i) { int involves = FN(EL,involves_dims)(pw->p[i].FIELD, type, first, n); if (involves < 0 || involves) return involves; involves = isl_set_involves_dims(pw->p[i].set, set_type, first, n); if (involves < 0 || involves) return involves; } return 0; } #endif __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw, enum isl_dim_type type, unsigned pos, const char *s) { int i; enum isl_dim_type set_type; pw = FN(PW,cow)(pw); if (!pw) return NULL; set_type = type == isl_dim_in ? isl_dim_set : type; pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s); if (!pw->dim) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_set_dim_name(pw->p[i].set, set_type, pos, s); if (!pw->p[i].set) goto error; pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s); if (!pw->p[i].FIELD) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } #ifndef NO_DROP_DIMS __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw, enum isl_dim_type type, unsigned first, unsigned n) { int i; enum isl_dim_type set_type; if (!pw) return NULL; if (n == 0 && !isl_space_get_tuple_name(pw->dim, type)) return pw; set_type = type == isl_dim_in ? isl_dim_set : type; pw = FN(PW,cow)(pw); if (!pw) return NULL; pw->dim = isl_space_drop_dims(pw->dim, type, first, n); if (!pw->dim) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n); if (!pw->p[i].FIELD) goto error; if (type == isl_dim_out) continue; pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n); if (!pw->p[i].set) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } /* This function is very similar to drop_dims. * The only difference is that the cells may still involve * the specified dimensions. They are removed using * isl_set_project_out instead of isl_set_drop. */ __isl_give PW *FN(PW,project_out)(__isl_take PW *pw, enum isl_dim_type type, unsigned first, unsigned n) { int i; enum isl_dim_type set_type; if (!pw) return NULL; if (n == 0 && !isl_space_get_tuple_name(pw->dim, type)) return pw; set_type = type == isl_dim_in ? isl_dim_set : type; pw = FN(PW,cow)(pw); if (!pw) return NULL; pw->dim = isl_space_drop_dims(pw->dim, type, first, n); if (!pw->dim) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_project_out(pw->p[i].set, set_type, first, n); if (!pw->p[i].set) goto error; pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n); if (!pw->p[i].FIELD) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } /* Project the domain of pw onto its parameter space. */ __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw) { isl_space *space; unsigned n; n = FN(PW,dim)(pw, isl_dim_in); pw = FN(PW,project_out)(pw, isl_dim_in, 0, n); space = FN(PW,get_domain_space)(pw); space = isl_space_params(space); pw = FN(PW,reset_domain_space)(pw, space); return pw; } #endif #ifndef NO_INSERT_DIMS __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type, unsigned first, unsigned n) { int i; enum isl_dim_type set_type; if (!pw) return NULL; if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type)) return pw; set_type = type == isl_dim_in ? isl_dim_set : type; pw = FN(PW,cow)(pw); if (!pw) return NULL; pw->dim = isl_space_insert_dims(pw->dim, type, first, n); if (!pw->dim) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_insert_dims(pw->p[i].set, set_type, first, n); if (!pw->p[i].set) goto error; pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD, type, first, n); if (!pw->p[i].FIELD) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } #endif __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw, enum isl_dim_type type, unsigned pos, isl_int v) { int i; if (!pw) return NULL; if (type == isl_dim_in) type = isl_dim_set; pw = FN(PW,cow)(pw); if (!pw) return NULL; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v); if (FN(PW,exploit_equalities_and_remove_if_empty)(pw, i) < 0) return FN(PW,free)(pw); } return pw; } /* Fix the value of the variable at position "pos" of type "type" of "pw" * to be equal to "v". */ __isl_give PW *FN(PW,fix_val)(__isl_take PW *pw, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v) { if (!v) return FN(PW,free)(pw); if (!isl_val_is_int(v)) isl_die(FN(PW,get_ctx)(pw), isl_error_invalid, "expecting integer value", goto error); pw = FN(PW,fix_dim)(pw, type, pos, v->n); isl_val_free(v); return pw; error: isl_val_free(v); return FN(PW,free)(pw); } unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type) { return pw ? isl_space_dim(pw->dim, type) : 0; } __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!pw) return NULL; if (n == 0) return pw; if (type == isl_dim_in) type = isl_dim_set; pw = FN(PW,cow)(pw); if (!pw) return NULL; if (!pw->dim) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n); if (!pw->p[i].set) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } #ifndef NO_OPT /* Compute the maximal value attained by the piecewise quasipolynomial * on its domain or zero if the domain is empty. * In the worst case, the domain is scanned completely, * so the domain is assumed to be bounded. */ __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max) { int i; isl_qpolynomial *opt; if (!pw) return NULL; if (pw->n == 0) { isl_space *dim = isl_space_copy(pw->dim); FN(PW,free)(pw); return isl_qpolynomial_zero_on_domain(isl_space_domain(dim)); } opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD), isl_set_copy(pw->p[0].set), max); for (i = 1; i < pw->n; ++i) { isl_qpolynomial *opt_i; opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD), isl_set_copy(pw->p[i].set), max); if (max) opt = isl_qpolynomial_max_cst(opt, opt_i); else opt = isl_qpolynomial_min_cst(opt, opt_i); } FN(PW,free)(pw); return opt; } __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw) { return FN(PW,opt)(pw, 1); } __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw) { return FN(PW,opt)(pw, 0); } #endif __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw) { return pw ? isl_space_copy(pw->dim) : NULL; } __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw) { return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL; } #ifndef NO_RESET_DIM /* Reset the space of "pw". Since we don't know if the elements * represent the spaces themselves or their domains, we pass along * both when we call their reset_space_and_domain. */ static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw, __isl_take isl_space *space, __isl_take isl_space *domain) { int i; pw = FN(PW,cow)(pw); if (!pw || !space || !domain) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_reset_space(pw->p[i].set, isl_space_copy(domain)); if (!pw->p[i].set) goto error; pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD, isl_space_copy(space), isl_space_copy(domain)); if (!pw->p[i].FIELD) goto error; } isl_space_free(domain); isl_space_free(pw->dim); pw->dim = space; return pw; error: isl_space_free(domain); isl_space_free(space); FN(PW,free)(pw); return NULL; } __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw, __isl_take isl_space *domain) { isl_space *space; space = isl_space_extend_domain_with_range(isl_space_copy(domain), FN(PW,get_space)(pw)); return FN(PW,reset_space_and_domain)(pw, space, domain); } __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim) { isl_space *domain; domain = isl_space_domain(isl_space_copy(dim)); return FN(PW,reset_space_and_domain)(pw, dim, domain); } __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type, __isl_take isl_id *id) { isl_space *space; pw = FN(PW,cow)(pw); if (!pw) return isl_id_free(id); space = FN(PW,get_space)(pw); space = isl_space_set_tuple_id(space, type, id); return FN(PW,reset_space)(pw, space); } __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { pw = FN(PW,cow)(pw); if (!pw) return isl_id_free(id); pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id); return FN(PW,reset_space)(pw, isl_space_copy(pw->dim)); } #endif int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2) { if (!pw1 || !pw2) return -1; return isl_space_is_equal(pw1->dim, pw2->dim); } #ifndef NO_MORPH __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw, __isl_take isl_morph *morph) { int i; isl_ctx *ctx; if (!pw || !morph) goto error; ctx = isl_space_get_ctx(pw->dim); isl_assert(ctx, isl_space_is_domain_internal(morph->dom->dim, pw->dim), goto error); pw = FN(PW,cow)(pw); if (!pw) goto error; pw->dim = isl_space_extend_domain_with_range( isl_space_copy(morph->ran->dim), pw->dim); if (!pw->dim) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set); if (!pw->p[i].set) goto error; pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD, isl_morph_copy(morph)); if (!pw->p[i].FIELD) goto error; } isl_morph_free(morph); return pw; error: FN(PW,free)(pw); isl_morph_free(morph); return NULL; } #endif int FN(PW,n_piece)(__isl_keep PW *pw) { return pw ? pw->n : 0; } int FN(PW,foreach_piece)(__isl_keep PW *pw, int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user), void *user) { int i; if (!pw) return -1; for (i = 0; i < pw->n; ++i) if (fn(isl_set_copy(pw->p[i].set), FN(EL,copy)(pw->p[i].FIELD), user) < 0) return -1; return 0; } #ifndef NO_LIFT static int any_divs(__isl_keep isl_set *set) { int i; if (!set) return -1; for (i = 0; i < set->n; ++i) if (set->p[i]->n_div > 0) return 1; return 0; } static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el, int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user), void *user) { int i; if (!set || !el) goto error; for (i = 0; i < set->n; ++i) { isl_set *lift; EL *copy; lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i])); lift = isl_set_lift(lift); copy = FN(EL,copy)(el); copy = FN(EL,lift)(copy, isl_set_get_space(lift)); if (fn(lift, copy, user) < 0) goto error; } isl_set_free(set); FN(EL,free)(el); return 0; error: isl_set_free(set); FN(EL,free)(el); return -1; } int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw, int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user), void *user) { int i; if (!pw) return -1; for (i = 0; i < pw->n; ++i) { isl_set *set; EL *el; set = isl_set_copy(pw->p[i].set); el = FN(EL,copy)(pw->p[i].FIELD); if (!any_divs(set)) { if (fn(set, el, user) < 0) return -1; continue; } if (foreach_lifted_subset(set, el, fn, user) < 0) return -1; } return 0; } #endif #ifndef NO_MOVE_DIMS __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { int i; pw = FN(PW,cow)(pw); if (!pw) return NULL; pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n); if (!pw->dim) goto error; for (i = 0; i < pw->n; ++i) { pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD, dst_type, dst_pos, src_type, src_pos, n); if (!pw->p[i].FIELD) goto error; } if (dst_type == isl_dim_in) dst_type = isl_dim_set; if (src_type == isl_dim_in) src_type = isl_dim_set; for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_move_dims(pw->p[i].set, dst_type, dst_pos, src_type, src_pos, n); if (!pw->p[i].set) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } #endif __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v) { int i; if (isl_int_is_one(v)) return pw; if (pw && DEFAULT_IS_ZERO && isl_int_is_zero(v)) { PW *zero; isl_space *dim = FN(PW,get_space)(pw); #ifdef HAS_TYPE zero = FN(PW,ZERO)(dim, pw->type); #else zero = FN(PW,ZERO)(dim); #endif FN(PW,free)(pw); return zero; } pw = FN(PW,cow)(pw); if (!pw) return NULL; if (pw->n == 0) return pw; #ifdef HAS_TYPE if (isl_int_is_neg(v)) pw->type = isl_fold_type_negate(pw->type); #endif for (i = 0; i < pw->n; ++i) { pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v); if (!pw->p[i].FIELD) goto error; } return pw; error: FN(PW,free)(pw); return NULL; } /* Multiply the pieces of "pw" by "v" and return the result. */ __isl_give PW *FN(PW,scale_val)(__isl_take PW *pw, __isl_take isl_val *v) { int i; if (!pw || !v) goto error; if (isl_val_is_one(v)) { isl_val_free(v); return pw; } if (pw && DEFAULT_IS_ZERO && isl_val_is_zero(v)) { PW *zero; isl_space *space = FN(PW,get_space)(pw); #ifdef HAS_TYPE zero = FN(PW,ZERO)(space, pw->type); #else zero = FN(PW,ZERO)(space); #endif FN(PW,free)(pw); isl_val_free(v); return zero; } if (pw->n == 0) { isl_val_free(v); return pw; } pw = FN(PW,cow)(pw); if (!pw) goto error; #ifdef HAS_TYPE if (isl_val_is_neg(v)) pw->type = isl_fold_type_negate(pw->type); #endif for (i = 0; i < pw->n; ++i) { pw->p[i].FIELD = FN(EL,scale_val)(pw->p[i].FIELD, isl_val_copy(v)); if (!pw->p[i].FIELD) goto error; } isl_val_free(v); return pw; error: isl_val_free(v); FN(PW,free)(pw); return NULL; } __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v) { return FN(PW,mul_isl_int)(pw, v); } static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2) { isl_set *set1 = *(isl_set * const *)p1; isl_set *set2 = *(isl_set * const *)p2; return isl_set_plain_cmp(set1, set2); } /* We normalize in place, but if anything goes wrong we need * to return NULL, so we need to make sure we don't change the * meaning of any possible other copies of map. */ __isl_give PW *FN(PW,normalize)(__isl_take PW *pw) { int i, j; isl_set *set; if (!pw) return NULL; for (i = 0; i < pw->n; ++i) { set = isl_set_normalize(isl_set_copy(pw->p[i].set)); if (!set) return FN(PW,free)(pw); isl_set_free(pw->p[i].set); pw->p[i].set = set; } qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp)); for (i = pw->n - 1; i >= 1; --i) { if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set)) continue; if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD)) continue; set = isl_set_union(isl_set_copy(pw->p[i - 1].set), isl_set_copy(pw->p[i].set)); if (!set) return FN(PW,free)(pw); isl_set_free(pw->p[i].set); FN(EL,free)(pw->p[i].FIELD); isl_set_free(pw->p[i - 1].set); pw->p[i - 1].set = set; for (j = i + 1; j < pw->n; ++j) pw->p[j - 1] = pw->p[j]; pw->n--; } return pw; } /* Is pw1 obviously equal to pw2? * That is, do they have obviously identical cells and obviously identical * elements on each cell? */ int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2) { int i; int equal; if (!pw1 || !pw2) return -1; if (pw1 == pw2) return 1; if (!isl_space_is_equal(pw1->dim, pw2->dim)) return 0; pw1 = FN(PW,copy)(pw1); pw2 = FN(PW,copy)(pw2); pw1 = FN(PW,normalize)(pw1); pw2 = FN(PW,normalize)(pw2); if (!pw1 || !pw2) goto error; equal = pw1->n == pw2->n; for (i = 0; equal && i < pw1->n; ++i) { equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set); if (equal < 0) goto error; if (!equal) break; equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD); if (equal < 0) goto error; } FN(PW,free)(pw1); FN(PW,free)(pw2); return equal; error: FN(PW,free)(pw1); FN(PW,free)(pw2); return -1; } #ifndef NO_PULLBACK static __isl_give PW *FN(PW,align_params_pw_multi_aff_and)(__isl_take PW *pw, __isl_take isl_multi_aff *ma, __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_multi_aff *ma)) { isl_ctx *ctx; isl_space *ma_space; ma_space = isl_multi_aff_get_space(ma); if (!pw || !ma || !ma_space) goto error; if (isl_space_match(pw->dim, isl_dim_param, ma_space, isl_dim_param)) { isl_space_free(ma_space); return fn(pw, ma); } ctx = FN(PW,get_ctx)(pw); if (!isl_space_has_named_params(pw->dim) || !isl_space_has_named_params(ma_space)) isl_die(ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); pw = FN(PW,align_params)(pw, ma_space); ma = isl_multi_aff_align_params(ma, FN(PW,get_space)(pw)); return fn(pw, ma); error: isl_space_free(ma_space); FN(PW,free)(pw); isl_multi_aff_free(ma); return NULL; } static __isl_give PW *FN(PW,align_params_pw_pw_multi_aff_and)(__isl_take PW *pw, __isl_take isl_pw_multi_aff *pma, __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_pw_multi_aff *ma)) { isl_ctx *ctx; isl_space *pma_space; pma_space = isl_pw_multi_aff_get_space(pma); if (!pw || !pma || !pma_space) goto error; if (isl_space_match(pw->dim, isl_dim_param, pma_space, isl_dim_param)) { isl_space_free(pma_space); return fn(pw, pma); } ctx = FN(PW,get_ctx)(pw); if (!isl_space_has_named_params(pw->dim) || !isl_space_has_named_params(pma_space)) isl_die(ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); pw = FN(PW,align_params)(pw, pma_space); pma = isl_pw_multi_aff_align_params(pma, FN(PW,get_space)(pw)); return fn(pw, pma); error: isl_space_free(pma_space); FN(PW,free)(pw); isl_pw_multi_aff_free(pma); return NULL; } /* Compute the pullback of "pw" by the function represented by "ma". * In other words, plug in "ma" in "pw". */ static __isl_give PW *FN(PW,pullback_multi_aff_aligned)(__isl_take PW *pw, __isl_take isl_multi_aff *ma) { int i; isl_space *space = NULL; ma = isl_multi_aff_align_divs(ma); pw = FN(PW,cow)(pw); if (!pw || !ma) goto error; space = isl_space_join(isl_multi_aff_get_space(ma), FN(PW,get_space)(pw)); for (i = 0; i < pw->n; ++i) { pw->p[i].set = isl_set_preimage_multi_aff(pw->p[i].set, isl_multi_aff_copy(ma)); if (!pw->p[i].set) goto error; pw->p[i].FIELD = FN(EL,pullback_multi_aff)(pw->p[i].FIELD, isl_multi_aff_copy(ma)); if (!pw->p[i].FIELD) goto error; } pw = FN(PW,reset_space)(pw, space); isl_multi_aff_free(ma); return pw; error: isl_space_free(space); isl_multi_aff_free(ma); FN(PW,free)(pw); return NULL; } __isl_give PW *FN(PW,pullback_multi_aff)(__isl_take PW *pw, __isl_take isl_multi_aff *ma) { return FN(PW,align_params_pw_multi_aff_and)(pw, ma, &FN(PW,pullback_multi_aff_aligned)); } /* Compute the pullback of "pw" by the function represented by "pma". * In other words, plug in "pma" in "pw". */ static __isl_give PW *FN(PW,pullback_pw_multi_aff_aligned)(__isl_take PW *pw, __isl_take isl_pw_multi_aff *pma) { int i; PW *res; if (!pma) goto error; if (pma->n == 0) { isl_pw_multi_aff_free(pma); res = FN(PW,empty)(FN(PW,get_space)(pw)); FN(PW,free)(pw); return res; } res = FN(PW,pullback_multi_aff)(FN(PW,copy)(pw), isl_multi_aff_copy(pma->p[0].maff)); res = FN(PW,intersect_domain)(res, isl_set_copy(pma->p[0].set)); for (i = 1; i < pma->n; ++i) { PW *res_i; res_i = FN(PW,pullback_multi_aff)(FN(PW,copy)(pw), isl_multi_aff_copy(pma->p[i].maff)); res_i = FN(PW,intersect_domain)(res_i, isl_set_copy(pma->p[i].set)); res = FN(PW,add_disjoint)(res, res_i); } isl_pw_multi_aff_free(pma); FN(PW,free)(pw); return res; error: isl_pw_multi_aff_free(pma); FN(PW,free)(pw); return NULL; } __isl_give PW *FN(PW,pullback_pw_multi_aff)(__isl_take PW *pw, __isl_take isl_pw_multi_aff *pma) { return FN(PW,align_params_pw_pw_multi_aff_and)(pw, pma, &FN(PW,pullback_pw_multi_aff_aligned)); } #endif cloog-0.18.2/isl/isl_printer.c0000664000175000017500000001777612254313240013133 00000000000000#include #include static __isl_give isl_printer *file_start_line(__isl_take isl_printer *p) { fprintf(p->file, "%*s%s", p->indent, "", p->prefix ? p->prefix : ""); return p; } static __isl_give isl_printer *file_end_line(__isl_take isl_printer *p) { fprintf(p->file, "%s\n", p->suffix ? p->suffix : ""); return p; } static __isl_give isl_printer *file_flush(__isl_take isl_printer *p) { fflush(p->file); return p; } static __isl_give isl_printer *file_print_str(__isl_take isl_printer *p, const char *s) { fprintf(p->file, "%s", s); return p; } static __isl_give isl_printer *file_print_double(__isl_take isl_printer *p, double d) { fprintf(p->file, "%g", d); return p; } static __isl_give isl_printer *file_print_int(__isl_take isl_printer *p, int i) { fprintf(p->file, "%d", i); return p; } static __isl_give isl_printer *file_print_isl_int(__isl_take isl_printer *p, isl_int i) { isl_int_print(p->file, i, p->width); return p; } static int grow_buf(__isl_keep isl_printer *p, int extra) { int new_size; char *new_buf; if (p->buf_size == 0) return -1; new_size = ((p->buf_n + extra + 1) * 3) / 2; new_buf = isl_realloc_array(p->ctx, p->buf, char, new_size); if (!new_buf) { p->buf_size = 0; return -1; } p->buf = new_buf; p->buf_size = new_size; return 0; } static __isl_give isl_printer *str_print(__isl_take isl_printer *p, const char *s, int len) { if (p->buf_n + len + 1 >= p->buf_size && grow_buf(p, len)) goto error; memcpy(p->buf + p->buf_n, s, len); p->buf_n += len; p->buf[p->buf_n] = '\0'; return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *str_print_indent(__isl_take isl_printer *p, int indent) { int i; if (p->buf_n + indent + 1 >= p->buf_size && grow_buf(p, indent)) goto error; for (i = 0; i < indent; ++i) p->buf[p->buf_n++] = ' '; return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *str_start_line(__isl_take isl_printer *p) { p = str_print_indent(p, p->indent); if (p->prefix) p = str_print(p, p->prefix, strlen(p->prefix)); return p; } static __isl_give isl_printer *str_end_line(__isl_take isl_printer *p) { if (p->suffix) p = str_print(p, p->suffix, strlen(p->suffix)); p = str_print(p, "\n", strlen("\n")); return p; } static __isl_give isl_printer *str_flush(__isl_take isl_printer *p) { p->buf_n = 0; return p; } static __isl_give isl_printer *str_print_str(__isl_take isl_printer *p, const char *s) { return str_print(p, s, strlen(s)); } static __isl_give isl_printer *str_print_double(__isl_take isl_printer *p, double d) { int left = p->buf_size - p->buf_n; int need = snprintf(p->buf + p->buf_n, left, "%g", d); if (need >= left) { if (grow_buf(p, need)) goto error; left = p->buf_size - p->buf_n; need = snprintf(p->buf + p->buf_n, left, "%g", d); } p->buf_n += need; return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *str_print_int(__isl_take isl_printer *p, int i) { int left = p->buf_size - p->buf_n; int need = snprintf(p->buf + p->buf_n, left, "%d", i); if (need >= left) { if (grow_buf(p, need)) goto error; left = p->buf_size - p->buf_n; need = snprintf(p->buf + p->buf_n, left, "%d", i); } p->buf_n += need; return p; error: isl_printer_free(p); return NULL; } static __isl_give isl_printer *str_print_isl_int(__isl_take isl_printer *p, isl_int i) { char *s; int len; s = isl_int_get_str(i); len = strlen(s); if (len < p->width) p = str_print_indent(p, p->width - len); p = str_print(p, s, len); isl_int_free_str(s); return p; } struct isl_printer_ops { __isl_give isl_printer *(*start_line)(__isl_take isl_printer *p); __isl_give isl_printer *(*end_line)(__isl_take isl_printer *p); __isl_give isl_printer *(*print_double)(__isl_take isl_printer *p, double d); __isl_give isl_printer *(*print_int)(__isl_take isl_printer *p, int i); __isl_give isl_printer *(*print_isl_int)(__isl_take isl_printer *p, isl_int i); __isl_give isl_printer *(*print_str)(__isl_take isl_printer *p, const char *s); __isl_give isl_printer *(*flush)(__isl_take isl_printer *p); }; static struct isl_printer_ops file_ops = { file_start_line, file_end_line, file_print_double, file_print_int, file_print_isl_int, file_print_str, file_flush }; static struct isl_printer_ops str_ops = { str_start_line, str_end_line, str_print_double, str_print_int, str_print_isl_int, str_print_str, str_flush }; __isl_give isl_printer *isl_printer_to_file(isl_ctx *ctx, FILE *file) { struct isl_printer *p = isl_alloc_type(ctx, struct isl_printer); if (!p) return NULL; p->ctx = ctx; isl_ctx_ref(p->ctx); p->ops = &file_ops; p->file = file; p->buf = NULL; p->buf_n = 0; p->buf_size = 0; p->indent = 0; p->output_format = ISL_FORMAT_ISL; p->prefix = NULL; p->suffix = NULL; p->width = 0; return p; } __isl_give isl_printer *isl_printer_to_str(isl_ctx *ctx) { struct isl_printer *p = isl_alloc_type(ctx, struct isl_printer); if (!p) return NULL; p->ctx = ctx; isl_ctx_ref(p->ctx); p->ops = &str_ops; p->file = NULL; p->buf = isl_alloc_array(ctx, char, 256); if (!p->buf) goto error; p->buf_n = 0; p->buf[0] = '\0'; p->buf_size = 256; p->indent = 0; p->output_format = ISL_FORMAT_ISL; p->prefix = NULL; p->suffix = NULL; p->width = 0; return p; error: isl_printer_free(p); return NULL; } void *isl_printer_free(__isl_take isl_printer *p) { if (!p) return NULL; free(p->buf); isl_ctx_deref(p->ctx); free(p); return NULL; } isl_ctx *isl_printer_get_ctx(__isl_keep isl_printer *printer) { return printer ? printer->ctx : NULL; } FILE *isl_printer_get_file(__isl_keep isl_printer *printer) { if (!printer) return NULL; if (!printer->file) isl_die(isl_printer_get_ctx(printer), isl_error_invalid, "not a file printer", return NULL); return printer->file; } __isl_give isl_printer *isl_printer_set_isl_int_width(__isl_take isl_printer *p, int width) { if (!p) return NULL; p->width = width; return p; } __isl_give isl_printer *isl_printer_set_indent(__isl_take isl_printer *p, int indent) { if (!p) return NULL; p->indent = indent; return p; } __isl_give isl_printer *isl_printer_indent(__isl_take isl_printer *p, int indent) { if (!p) return NULL; p->indent += indent; if (p->indent < 0) p->indent = 0; return p; } __isl_give isl_printer *isl_printer_set_prefix(__isl_take isl_printer *p, const char *prefix) { if (!p) return NULL; p->prefix = prefix; return p; } __isl_give isl_printer *isl_printer_set_suffix(__isl_take isl_printer *p, const char *suffix) { if (!p) return NULL; p->suffix = suffix; return p; } __isl_give isl_printer *isl_printer_set_output_format(__isl_take isl_printer *p, int output_format) { if (!p) return NULL; p->output_format = output_format; return p; } int isl_printer_get_output_format(__isl_keep isl_printer *p) { if (!p) return -1; return p->output_format; } __isl_give isl_printer *isl_printer_print_str(__isl_take isl_printer *p, const char *s) { if (!p) return NULL; if (!s) return isl_printer_free(p); return p->ops->print_str(p, s); } __isl_give isl_printer *isl_printer_print_double(__isl_take isl_printer *p, double d) { if (!p) return NULL; return p->ops->print_double(p, d); } __isl_give isl_printer *isl_printer_print_int(__isl_take isl_printer *p, int i) { if (!p) return NULL; return p->ops->print_int(p, i); } __isl_give isl_printer *isl_printer_print_isl_int(__isl_take isl_printer *p, isl_int i) { if (!p) return NULL; return p->ops->print_isl_int(p, i); } __isl_give isl_printer *isl_printer_start_line(__isl_take isl_printer *p) { if (!p) return NULL; return p->ops->start_line(p); } __isl_give isl_printer *isl_printer_end_line(__isl_take isl_printer *p) { if (!p) return NULL; return p->ops->end_line(p); } char *isl_printer_get_str(__isl_keep isl_printer *printer) { if (!printer || !printer->buf) return NULL; return strdup(printer->buf); } __isl_give isl_printer *isl_printer_flush(__isl_take isl_printer *p) { if (!p) return NULL; return p->ops->flush(p); } cloog-0.18.2/isl/isl_map.c0000664000175000017500000111211212254313240012202 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012-2013 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include #include "isl_space_private.h" #include "isl_equalities.h" #include #include #include #include #include "isl_map_piplib.h" #include #include "isl_sample.h" #include "isl_tab.h" #include #include #include #include #include #include #include #include static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type) { switch (type) { case isl_dim_param: return dim->nparam; case isl_dim_in: return dim->n_in; case isl_dim_out: return dim->n_out; case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out; default: return 0; } } static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type) { switch (type) { case isl_dim_param: return 1; case isl_dim_in: return 1 + dim->nparam; case isl_dim_out: return 1 + dim->nparam + dim->n_in; default: return 0; } } unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap, enum isl_dim_type type) { if (!bmap) return 0; switch (type) { case isl_dim_cst: return 1; case isl_dim_param: case isl_dim_in: case isl_dim_out: return isl_space_dim(bmap->dim, type); case isl_dim_div: return bmap->n_div; case isl_dim_all: return isl_basic_map_total_dim(bmap); default: return 0; } } unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type) { return map ? n(map->dim, type) : 0; } unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type) { return set ? n(set->dim, type) : 0; } unsigned isl_basic_map_offset(struct isl_basic_map *bmap, enum isl_dim_type type) { isl_space *dim = bmap->dim; switch (type) { case isl_dim_cst: return 0; case isl_dim_param: return 1; case isl_dim_in: return 1 + dim->nparam; case isl_dim_out: return 1 + dim->nparam + dim->n_in; case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out; default: return 0; } } unsigned isl_basic_set_offset(struct isl_basic_set *bset, enum isl_dim_type type) { return isl_basic_map_offset(bset, type); } static unsigned map_offset(struct isl_map *map, enum isl_dim_type type) { return pos(map->dim, type); } unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset, enum isl_dim_type type) { return isl_basic_map_dim(bset, type); } unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset) { return isl_basic_set_dim(bset, isl_dim_set); } unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset) { return isl_basic_set_dim(bset, isl_dim_param); } unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset) { if (!bset) return 0; return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div; } unsigned isl_set_n_dim(__isl_keep isl_set *set) { return isl_set_dim(set, isl_dim_set); } unsigned isl_set_n_param(__isl_keep isl_set *set) { return isl_set_dim(set, isl_dim_param); } unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap) { return bmap ? bmap->dim->n_in : 0; } unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap) { return bmap ? bmap->dim->n_out : 0; } unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap) { return bmap ? bmap->dim->nparam : 0; } unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap) { return bmap ? bmap->n_div : 0; } unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap) { return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0; } unsigned isl_map_n_in(const struct isl_map *map) { return map ? map->dim->n_in : 0; } unsigned isl_map_n_out(const struct isl_map *map) { return map ? map->dim->n_out : 0; } unsigned isl_map_n_param(const struct isl_map *map) { return map ? map->dim->nparam : 0; } int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set) { int m; if (!map || !set) return -1; m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param); if (m < 0 || !m) return m; return isl_space_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set); } int isl_basic_map_compatible_domain(struct isl_basic_map *bmap, struct isl_basic_set *bset) { int m; if (!bmap || !bset) return -1; m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param); if (m < 0 || !m) return m; return isl_space_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set); } int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set) { int m; if (!map || !set) return -1; m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param); if (m < 0 || !m) return m; return isl_space_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set); } int isl_basic_map_compatible_range(struct isl_basic_map *bmap, struct isl_basic_set *bset) { int m; if (!bmap || !bset) return -1; m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param); if (m < 0 || !m) return m; return isl_space_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set); } isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap) { return bmap ? bmap->ctx : NULL; } isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset) { return bset ? bset->ctx : NULL; } isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map) { return map ? map->ctx : NULL; } isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set) { return set ? set->ctx : NULL; } __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap) { if (!bmap) return NULL; return isl_space_copy(bmap->dim); } __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset) { if (!bset) return NULL; return isl_space_copy(bset->dim); } /* Extract the divs in "bmap" as a matrix. */ __isl_give isl_mat *isl_basic_map_get_divs(__isl_keep isl_basic_map *bmap) { int i; isl_ctx *ctx; isl_mat *div; unsigned total; unsigned cols; if (!bmap) return NULL; ctx = isl_basic_map_get_ctx(bmap); total = isl_space_dim(bmap->dim, isl_dim_all); cols = 1 + 1 + total + bmap->n_div; div = isl_mat_alloc(ctx, bmap->n_div, cols); if (!div) return NULL; for (i = 0; i < bmap->n_div; ++i) isl_seq_cpy(div->row[i], bmap->div[i], cols); return div; } /* Extract the divs in "bset" as a matrix. */ __isl_give isl_mat *isl_basic_set_get_divs(__isl_keep isl_basic_set *bset) { return isl_basic_map_get_divs(bset); } __isl_give isl_local_space *isl_basic_map_get_local_space( __isl_keep isl_basic_map *bmap) { isl_mat *div; if (!bmap) return NULL; div = isl_basic_map_get_divs(bmap); return isl_local_space_alloc_div(isl_space_copy(bmap->dim), div); } __isl_give isl_local_space *isl_basic_set_get_local_space( __isl_keep isl_basic_set *bset) { return isl_basic_map_get_local_space(bset); } __isl_give isl_basic_map *isl_basic_map_from_local_space( __isl_take isl_local_space *ls) { int i; int n_div; isl_basic_map *bmap; if (!ls) return NULL; n_div = isl_local_space_dim(ls, isl_dim_div); bmap = isl_basic_map_alloc_space(isl_local_space_get_space(ls), n_div, 0, 2 * n_div); for (i = 0; i < n_div; ++i) if (isl_basic_map_alloc_div(bmap) < 0) goto error; for (i = 0; i < n_div; ++i) { isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col); if (isl_basic_map_add_div_constraints(bmap, i) < 0) goto error; } isl_local_space_free(ls); return bmap; error: isl_local_space_free(ls); isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_from_local_space( __isl_take isl_local_space *ls) { return isl_basic_map_from_local_space(ls); } __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map) { if (!map) return NULL; return isl_space_copy(map->dim); } __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set) { if (!set) return NULL; return isl_space_copy(set->dim); } __isl_give isl_basic_map *isl_basic_map_set_tuple_name( __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s) { bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_set_tuple_name(bmap->dim, type, s); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_set_tuple_name( __isl_take isl_basic_set *bset, const char *s) { return isl_basic_map_set_tuple_name(bset, isl_dim_set, s); } const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap, enum isl_dim_type type) { return bmap ? isl_space_get_tuple_name(bmap->dim, type) : NULL; } __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map, enum isl_dim_type type, const char *s) { int i; map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_set_tuple_name(map->dim, type, s); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } /* Does the input or output tuple have a name? */ int isl_map_has_tuple_name(__isl_keep isl_map *map, enum isl_dim_type type) { return map ? isl_space_has_tuple_name(map->dim, type) : -1; } const char *isl_map_get_tuple_name(__isl_keep isl_map *map, enum isl_dim_type type) { return map ? isl_space_get_tuple_name(map->dim, type) : NULL; } __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set, const char *s) { return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s); } __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_id *id) { map = isl_map_cow(map); if (!map) return isl_id_free(id); map->dim = isl_space_set_tuple_id(map->dim, type, id); return isl_map_reset_space(map, isl_space_copy(map->dim)); } __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set, __isl_take isl_id *id) { return isl_map_set_tuple_id(set, isl_dim_set, id); } __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map, enum isl_dim_type type) { map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_reset_tuple_id(map->dim, type); return isl_map_reset_space(map, isl_space_copy(map->dim)); } __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set) { return isl_map_reset_tuple_id(set, isl_dim_set); } int isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type) { return map ? isl_space_has_tuple_id(map->dim, type) : -1; } __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type) { return map ? isl_space_get_tuple_id(map->dim, type) : NULL; } int isl_set_has_tuple_id(__isl_keep isl_set *set) { return isl_map_has_tuple_id(set, isl_dim_set); } __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set) { return isl_map_get_tuple_id(set, isl_dim_set); } /* Does the set tuple have a name? */ int isl_set_has_tuple_name(__isl_keep isl_set *set) { return set ? isl_space_has_tuple_name(set->dim, isl_dim_set) : -1; } const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset) { return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL; } const char *isl_set_get_tuple_name(__isl_keep isl_set *set) { return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL; } const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos) { return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL; } const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos) { return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL; } /* Does the given dimension have a name? */ int isl_map_has_dim_name(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos) { return map ? isl_space_has_dim_name(map->dim, type, pos) : -1; } const char *isl_map_get_dim_name(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos) { return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL; } const char *isl_set_get_dim_name(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL; } /* Does the given dimension have a name? */ int isl_set_has_dim_name(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return set ? isl_space_has_dim_name(set->dim, type, pos) : -1; } __isl_give isl_basic_map *isl_basic_map_set_dim_name( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, const char *s) { bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s); if (!bmap->dim) goto error; return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, const char *s) { int i; map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_set_dim_name(map->dim, type, pos, s); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } __isl_give isl_basic_set *isl_basic_set_set_dim_name( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, const char *s) { return (isl_basic_set *)isl_basic_map_set_dim_name( (isl_basic_map *)bset, type, pos, s); } __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, const char *s) { return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s); } int isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos) { return bmap ? isl_space_has_dim_id(bmap->dim, type, pos) : -1; } __isl_give isl_id *isl_basic_set_get_dim_id(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned pos) { return bset ? isl_space_get_dim_id(bset->dim, type, pos) : NULL; } int isl_map_has_dim_id(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos) { return map ? isl_space_has_dim_id(map->dim, type, pos) : -1; } __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos) { return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL; } int isl_set_has_dim_id(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return isl_map_has_dim_id(set, type, pos); } __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return isl_map_get_dim_id(set, type, pos); } __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { map = isl_map_cow(map); if (!map) return isl_id_free(id); map->dim = isl_space_set_dim_id(map->dim, type, pos, id); return isl_map_reset_space(map, isl_space_copy(map->dim)); } __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_id *id) { return isl_map_set_dim_id(set, type, pos, id); } int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type, __isl_keep isl_id *id) { if (!map) return -1; return isl_space_find_dim_by_id(map->dim, type, id); } int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type, __isl_keep isl_id *id) { return isl_map_find_dim_by_id(set, type, id); } int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type, const char *name) { if (!map) return -1; return isl_space_find_dim_by_name(map->dim, type, name); } int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type, const char *name) { return isl_map_find_dim_by_name(set, type, name); } int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); } int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset) { return isl_basic_map_is_rational(bset); } /* Does "bmap" contain any rational points? * * If "bmap" has an equality for each dimension, equating the dimension * to an integer constant, then it has no rational points, even if it * is marked as rational. */ int isl_basic_map_has_rational(__isl_keep isl_basic_map *bmap) { int has_rational = 1; unsigned total; if (!bmap) return -1; if (isl_basic_map_plain_is_empty(bmap)) return 0; if (!isl_basic_map_is_rational(bmap)) return 0; bmap = isl_basic_map_copy(bmap); bmap = isl_basic_map_implicit_equalities(bmap); if (!bmap) return -1; total = isl_basic_map_total_dim(bmap); if (bmap->n_eq == total) { int i, j; for (i = 0; i < bmap->n_eq; ++i) { j = isl_seq_first_non_zero(bmap->eq[i] + 1, total); if (j < 0) break; if (!isl_int_is_one(bmap->eq[i][1 + j]) && !isl_int_is_negone(bmap->eq[i][1 + j])) break; j = isl_seq_first_non_zero(bmap->eq[i] + 1 + j + 1, total - j - 1); if (j >= 0) break; } if (i == bmap->n_eq) has_rational = 0; } isl_basic_map_free(bmap); return has_rational; } /* Does "map" contain any rational points? */ int isl_map_has_rational(__isl_keep isl_map *map) { int i; int has_rational; if (!map) return -1; for (i = 0; i < map->n; ++i) { has_rational = isl_basic_map_has_rational(map->p[i]); if (has_rational < 0) return -1; if (has_rational) return 1; } return 0; } /* Does "set" contain any rational points? */ int isl_set_has_rational(__isl_keep isl_set *set) { return isl_map_has_rational(set); } /* Is this basic set a parameter domain? */ int isl_basic_set_is_params(__isl_keep isl_basic_set *bset) { if (!bset) return -1; return isl_space_is_params(bset->dim); } /* Is this set a parameter domain? */ int isl_set_is_params(__isl_keep isl_set *set) { if (!set) return -1; return isl_space_is_params(set->dim); } /* Is this map actually a parameter domain? * Users should never call this function. Outside of isl, * a map can never be a parameter domain. */ int isl_map_is_params(__isl_keep isl_map *map) { if (!map) return -1; return isl_space_is_params(map->dim); } static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx, struct isl_basic_map *bmap, unsigned extra, unsigned n_eq, unsigned n_ineq) { int i; size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra; bmap->ctx = ctx; isl_ctx_ref(ctx); bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size); if (isl_blk_is_error(bmap->block)) goto error; bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq); if ((n_ineq + n_eq) && !bmap->ineq) goto error; if (extra == 0) { bmap->block2 = isl_blk_empty(); bmap->div = NULL; } else { bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size)); if (isl_blk_is_error(bmap->block2)) goto error; bmap->div = isl_alloc_array(ctx, isl_int *, extra); if (!bmap->div) goto error; } for (i = 0; i < n_ineq + n_eq; ++i) bmap->ineq[i] = bmap->block.data + i * row_size; for (i = 0; i < extra; ++i) bmap->div[i] = bmap->block2.data + i * (1 + row_size); bmap->ref = 1; bmap->flags = 0; bmap->c_size = n_eq + n_ineq; bmap->eq = bmap->ineq + n_ineq; bmap->extra = extra; bmap->n_eq = 0; bmap->n_ineq = 0; bmap->n_div = 0; bmap->sample = NULL; return bmap; error: isl_basic_map_free(bmap); return NULL; } struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq) { struct isl_basic_map *bmap; isl_space *space; space = isl_space_set_alloc(ctx, nparam, dim); if (!space) return NULL; bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq); return (struct isl_basic_set *)bmap; } struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) { struct isl_basic_map *bmap; if (!dim) return NULL; isl_assert(dim->ctx, dim->n_in == 0, goto error); bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq); return (struct isl_basic_set *)bmap; error: isl_space_free(dim); return NULL; } struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) { struct isl_basic_map *bmap; if (!dim) return NULL; bmap = isl_calloc_type(dim->ctx, struct isl_basic_map); if (!bmap) goto error; bmap->dim = dim; return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq); error: isl_space_free(dim); return NULL; } struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned in, unsigned out, unsigned extra, unsigned n_eq, unsigned n_ineq) { struct isl_basic_map *bmap; isl_space *dim; dim = isl_space_alloc(ctx, nparam, in, out); if (!dim) return NULL; bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq); return bmap; } static void dup_constraints( struct isl_basic_map *dst, struct isl_basic_map *src) { int i; unsigned total = isl_basic_map_total_dim(src); for (i = 0; i < src->n_eq; ++i) { int j = isl_basic_map_alloc_equality(dst); isl_seq_cpy(dst->eq[j], src->eq[i], 1+total); } for (i = 0; i < src->n_ineq; ++i) { int j = isl_basic_map_alloc_inequality(dst); isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total); } for (i = 0; i < src->n_div; ++i) { int j = isl_basic_map_alloc_div(dst); isl_seq_cpy(dst->div[j], src->div[i], 1+1+total); } ISL_F_SET(dst, ISL_BASIC_SET_FINAL); } struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap) { struct isl_basic_map *dup; if (!bmap) return NULL; dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim), bmap->n_div, bmap->n_eq, bmap->n_ineq); if (!dup) return NULL; dup_constraints(dup, bmap); dup->flags = bmap->flags; dup->sample = isl_vec_copy(bmap->sample); return dup; } struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset) { struct isl_basic_map *dup; dup = isl_basic_map_dup((struct isl_basic_map *)bset); return (struct isl_basic_set *)dup; } struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset) { if (!bset) return NULL; if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) { bset->ref++; return bset; } return isl_basic_set_dup(bset); } struct isl_set *isl_set_copy(struct isl_set *set) { if (!set) return NULL; set->ref++; return set; } struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap) { if (!bmap) return NULL; if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) { bmap->ref++; return bmap; } bmap = isl_basic_map_dup(bmap); if (bmap) ISL_F_SET(bmap, ISL_BASIC_SET_FINAL); return bmap; } struct isl_map *isl_map_copy(struct isl_map *map) { if (!map) return NULL; map->ref++; return map; } void *isl_basic_map_free(__isl_take isl_basic_map *bmap) { if (!bmap) return NULL; if (--bmap->ref > 0) return NULL; isl_ctx_deref(bmap->ctx); free(bmap->div); isl_blk_free(bmap->ctx, bmap->block2); free(bmap->ineq); isl_blk_free(bmap->ctx, bmap->block); isl_vec_free(bmap->sample); isl_space_free(bmap->dim); free(bmap); return NULL; } void *isl_basic_set_free(struct isl_basic_set *bset) { return isl_basic_map_free((struct isl_basic_map *)bset); } static int room_for_con(struct isl_basic_map *bmap, unsigned n) { return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size; } __isl_give isl_map *isl_map_align_params_map_map_and( __isl_take isl_map *map1, __isl_take isl_map *map2, __isl_give isl_map *(*fn)(__isl_take isl_map *map1, __isl_take isl_map *map2)) { if (!map1 || !map2) goto error; if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param)) return fn(map1, map2); if (!isl_space_has_named_params(map1->dim) || !isl_space_has_named_params(map2->dim)) isl_die(map1->ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); map1 = isl_map_align_params(map1, isl_map_get_space(map2)); map2 = isl_map_align_params(map2, isl_map_get_space(map1)); return fn(map1, map2); error: isl_map_free(map1); isl_map_free(map2); return NULL; } int isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1, __isl_keep isl_map *map2, int (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2)) { int r; if (!map1 || !map2) return -1; if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param)) return fn(map1, map2); if (!isl_space_has_named_params(map1->dim) || !isl_space_has_named_params(map2->dim)) isl_die(map1->ctx, isl_error_invalid, "unaligned unnamed parameters", return -1); map1 = isl_map_copy(map1); map2 = isl_map_copy(map2); map1 = isl_map_align_params(map1, isl_map_get_space(map2)); map2 = isl_map_align_params(map2, isl_map_get_space(map1)); r = fn(map1, map2); isl_map_free(map1); isl_map_free(map2); return r; } int isl_basic_map_alloc_equality(struct isl_basic_map *bmap) { struct isl_ctx *ctx; if (!bmap) return -1; ctx = bmap->ctx; isl_assert(ctx, room_for_con(bmap, 1), return -1); isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size, return -1); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT); ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT); ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS); if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) { isl_int *t; int j = isl_basic_map_alloc_inequality(bmap); if (j < 0) return -1; t = bmap->ineq[j]; bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1]; bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1]; bmap->eq[-1] = t; bmap->n_eq++; bmap->n_ineq--; bmap->eq--; return 0; } isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap), bmap->extra - bmap->n_div); return bmap->n_eq++; } int isl_basic_set_alloc_equality(struct isl_basic_set *bset) { return isl_basic_map_alloc_equality((struct isl_basic_map *)bset); } int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n) { if (!bmap) return -1; isl_assert(bmap->ctx, n <= bmap->n_eq, return -1); bmap->n_eq -= n; return 0; } int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n) { return isl_basic_map_free_equality((struct isl_basic_map *)bset, n); } int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos) { isl_int *t; if (!bmap) return -1; isl_assert(bmap->ctx, pos < bmap->n_eq, return -1); if (pos != bmap->n_eq - 1) { t = bmap->eq[pos]; bmap->eq[pos] = bmap->eq[bmap->n_eq - 1]; bmap->eq[bmap->n_eq - 1] = t; } bmap->n_eq--; return 0; } int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos) { return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos); } /* Turn inequality "pos" of "bmap" into an equality. * * In particular, we move the inequality in front of the equalities * and move the last inequality in the position of the moved inequality. * Note that isl_tab_make_equalities_explicit depends on this particular * change in the ordering of the constraints. */ void isl_basic_map_inequality_to_equality( struct isl_basic_map *bmap, unsigned pos) { isl_int *t; t = bmap->ineq[pos]; bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1]; bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1]; bmap->eq[-1] = t; bmap->n_eq++; bmap->n_ineq--; bmap->eq--; ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS); ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES); } static int room_for_ineq(struct isl_basic_map *bmap, unsigned n) { return bmap->n_ineq + n <= bmap->eq - bmap->ineq; } int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap) { struct isl_ctx *ctx; if (!bmap) return -1; ctx = bmap->ctx; isl_assert(ctx, room_for_ineq(bmap, 1), return -1); ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT); ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES); isl_seq_clr(bmap->ineq[bmap->n_ineq] + 1 + isl_basic_map_total_dim(bmap), bmap->extra - bmap->n_div); return bmap->n_ineq++; } int isl_basic_set_alloc_inequality(struct isl_basic_set *bset) { return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset); } int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n) { if (!bmap) return -1; isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1); bmap->n_ineq -= n; return 0; } int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n) { return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n); } int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos) { isl_int *t; if (!bmap) return -1; isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1); if (pos != bmap->n_ineq - 1) { t = bmap->ineq[pos]; bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1]; bmap->ineq[bmap->n_ineq - 1] = t; ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); } bmap->n_ineq--; return 0; } int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos) { return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos); } __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap, isl_int *eq) { int k; bmap = isl_basic_map_extend_constraints(bmap, 1, 0); if (!bmap) return NULL; k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap)); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset, isl_int *eq) { return (isl_basic_set *) isl_basic_map_add_eq((isl_basic_map *)bset, eq); } __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap, isl_int *ineq) { int k; bmap = isl_basic_map_extend_constraints(bmap, 0, 1); if (!bmap) return NULL; k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap)); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset, isl_int *ineq) { return (isl_basic_set *) isl_basic_map_add_ineq((isl_basic_map *)bset, ineq); } int isl_basic_map_alloc_div(struct isl_basic_map *bmap) { if (!bmap) return -1; isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1); isl_seq_clr(bmap->div[bmap->n_div] + 1 + 1 + isl_basic_map_total_dim(bmap), bmap->extra - bmap->n_div); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS); return bmap->n_div++; } int isl_basic_set_alloc_div(struct isl_basic_set *bset) { return isl_basic_map_alloc_div((struct isl_basic_map *)bset); } int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n) { if (!bmap) return -1; isl_assert(bmap->ctx, n <= bmap->n_div, return -1); bmap->n_div -= n; return 0; } int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n) { return isl_basic_map_free_div((struct isl_basic_map *)bset, n); } /* Copy constraint from src to dst, putting the vars of src at offset * dim_off in dst and the divs of src at offset div_off in dst. * If both sets are actually map, then dim_off applies to the input * variables. */ static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst, struct isl_basic_map *src_map, isl_int *src, unsigned in_off, unsigned out_off, unsigned div_off) { unsigned src_nparam = isl_basic_map_n_param(src_map); unsigned dst_nparam = isl_basic_map_n_param(dst_map); unsigned src_in = isl_basic_map_n_in(src_map); unsigned dst_in = isl_basic_map_n_in(dst_map); unsigned src_out = isl_basic_map_n_out(src_map); unsigned dst_out = isl_basic_map_n_out(dst_map); isl_int_set(dst[0], src[0]); isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam)); if (dst_nparam > src_nparam) isl_seq_clr(dst+1+src_nparam, dst_nparam - src_nparam); isl_seq_clr(dst+1+dst_nparam, in_off); isl_seq_cpy(dst+1+dst_nparam+in_off, src+1+src_nparam, isl_min(dst_in-in_off, src_in)); if (dst_in-in_off > src_in) isl_seq_clr(dst+1+dst_nparam+in_off+src_in, dst_in - in_off - src_in); isl_seq_clr(dst+1+dst_nparam+dst_in, out_off); isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off, src+1+src_nparam+src_in, isl_min(dst_out-out_off, src_out)); if (dst_out-out_off > src_out) isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out, dst_out - out_off - src_out); isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off); isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off, src+1+src_nparam+src_in+src_out, isl_min(dst_map->extra-div_off, src_map->n_div)); if (dst_map->n_div-div_off > src_map->n_div) isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+ div_off+src_map->n_div, dst_map->n_div - div_off - src_map->n_div); } static void copy_div(struct isl_basic_map *dst_map, isl_int *dst, struct isl_basic_map *src_map, isl_int *src, unsigned in_off, unsigned out_off, unsigned div_off) { isl_int_set(dst[0], src[0]); copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off); } static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1, struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos) { int i; unsigned div_off; if (!bmap1 || !bmap2) goto error; div_off = bmap1->n_div; for (i = 0; i < bmap2->n_eq; ++i) { int i1 = isl_basic_map_alloc_equality(bmap1); if (i1 < 0) goto error; copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i], i_pos, o_pos, div_off); } for (i = 0; i < bmap2->n_ineq; ++i) { int i1 = isl_basic_map_alloc_inequality(bmap1); if (i1 < 0) goto error; copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i], i_pos, o_pos, div_off); } for (i = 0; i < bmap2->n_div; ++i) { int i1 = isl_basic_map_alloc_div(bmap1); if (i1 < 0) goto error; copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i], i_pos, o_pos, div_off); } isl_basic_map_free(bmap2); return bmap1; error: isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned pos) { return (struct isl_basic_set *) add_constraints((struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2, 0, pos); } struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) { struct isl_basic_map *ext; unsigned flags; int dims_ok; if (!dim) goto error; if (!base) goto error; dims_ok = isl_space_is_equal(base->dim, dim) && base->extra >= base->n_div + extra; if (dims_ok && room_for_con(base, n_eq + n_ineq) && room_for_ineq(base, n_ineq)) { isl_space_free(dim); return base; } isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error); isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error); isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error); extra += base->extra; n_eq += base->n_eq; n_ineq += base->n_ineq; ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq); dim = NULL; if (!ext) goto error; if (dims_ok) ext->sample = isl_vec_copy(base->sample); flags = base->flags; ext = add_constraints(ext, base, 0, 0); if (ext) { ext->flags = flags; ISL_F_CLR(ext, ISL_BASIC_SET_FINAL); } return ext; error: isl_space_free(dim); isl_basic_map_free(base); return NULL; } struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) { return (struct isl_basic_set *) isl_basic_map_extend_space((struct isl_basic_map *)base, dim, extra, n_eq, n_ineq); } struct isl_basic_map *isl_basic_map_extend_constraints( struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq) { if (!base) return NULL; return isl_basic_map_extend_space(base, isl_space_copy(base->dim), 0, n_eq, n_ineq); } struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base, unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra, unsigned n_eq, unsigned n_ineq) { struct isl_basic_map *bmap; isl_space *dim; if (!base) return NULL; dim = isl_space_alloc(base->ctx, nparam, n_in, n_out); if (!dim) goto error; bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq); return bmap; error: isl_basic_map_free(base); return NULL; } struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq) { return (struct isl_basic_set *) isl_basic_map_extend((struct isl_basic_map *)base, nparam, 0, dim, extra, n_eq, n_ineq); } struct isl_basic_set *isl_basic_set_extend_constraints( struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq) { return (struct isl_basic_set *) isl_basic_map_extend_constraints((struct isl_basic_map *)base, n_eq, n_ineq); } struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_cow((struct isl_basic_map *)bset); } struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap) { if (!bmap) return NULL; if (bmap->ref > 1) { bmap->ref--; bmap = isl_basic_map_dup(bmap); } if (bmap) ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL); return bmap; } struct isl_set *isl_set_cow(struct isl_set *set) { if (!set) return NULL; if (set->ref == 1) return set; set->ref--; return isl_set_dup(set); } struct isl_map *isl_map_cow(struct isl_map *map) { if (!map) return NULL; if (map->ref == 1) return map; map->ref--; return isl_map_dup(map); } static void swap_vars(struct isl_blk blk, isl_int *a, unsigned a_len, unsigned b_len) { isl_seq_cpy(blk.data, a+a_len, b_len); isl_seq_cpy(blk.data+b_len, a, a_len); isl_seq_cpy(a, blk.data, b_len+a_len); } static __isl_give isl_basic_map *isl_basic_map_swap_vars( __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2) { int i; struct isl_blk blk; if (!bmap) goto error; isl_assert(bmap->ctx, pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error); if (n1 == 0 || n2 == 0) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; blk = isl_blk_alloc(bmap->ctx, n1 + n2); if (isl_blk_is_error(blk)) goto error; for (i = 0; i < bmap->n_eq; ++i) swap_vars(blk, bmap->eq[i] + pos, n1, n2); for (i = 0; i < bmap->n_ineq; ++i) swap_vars(blk, bmap->ineq[i] + pos, n1, n2); for (i = 0; i < bmap->n_div; ++i) swap_vars(blk, bmap->div[i]+1 + pos, n1, n2); isl_blk_free(bmap->ctx, blk); ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED); bmap = isl_basic_map_gauss(bmap, NULL); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } static __isl_give isl_basic_set *isl_basic_set_swap_vars( __isl_take isl_basic_set *bset, unsigned n) { unsigned dim; unsigned nparam; if (!bset) return NULL; nparam = isl_basic_set_n_param(bset); dim = isl_basic_set_n_dim(bset); isl_assert(bset->ctx, n <= dim, goto error); return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n); error: isl_basic_set_free(bset); return NULL; } struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap) { int i = 0; unsigned total; if (!bmap) goto error; total = isl_basic_map_total_dim(bmap); isl_basic_map_free_div(bmap, bmap->n_div); isl_basic_map_free_inequality(bmap, bmap->n_ineq); if (bmap->n_eq > 0) isl_basic_map_free_equality(bmap, bmap->n_eq-1); else { i = isl_basic_map_alloc_equality(bmap); if (i < 0) goto error; } isl_int_set_si(bmap->eq[i][0], 1); isl_seq_clr(bmap->eq[i]+1, total); ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY); isl_vec_free(bmap->sample); bmap->sample = NULL; return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_set_to_empty((struct isl_basic_map *)bset); } /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints * of "bmap"). */ static void swap_div(__isl_keep isl_basic_map *bmap, int a, int b) { isl_int *t = bmap->div[a]; bmap->div[a] = bmap->div[b]; bmap->div[b] = t; } /* Swap divs "a" and "b" in "bmap" and adjust the constraints and * div definitions accordingly. */ void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b) { int i; unsigned off = isl_space_dim(bmap->dim, isl_dim_all); swap_div(bmap, a, b); for (i = 0; i < bmap->n_eq; ++i) isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]); for (i = 0; i < bmap->n_ineq; ++i) isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]); for (i = 0; i < bmap->n_div; ++i) isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); } /* Eliminate the specified n dimensions starting at first from the * constraints, without removing the dimensions from the space. * If the set is rational, the dimensions are eliminated using Fourier-Motzkin. */ __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!map) return NULL; if (n == 0) return map; if (first + n > isl_map_dim(map, type) || first + n < first) isl_die(map->ctx, isl_error_invalid, "index out of bounds", goto error); map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } /* Eliminate the specified n dimensions starting at first from the * constraints, without removing the dimensions from the space. * If the set is rational, the dimensions are eliminated using Fourier-Motzkin. */ __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n); } /* Eliminate the specified n dimensions starting at first from the * constraints, without removing the dimensions from the space. * If the set is rational, the dimensions are eliminated using Fourier-Motzkin. */ __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set, unsigned first, unsigned n) { return isl_set_eliminate(set, isl_dim_set, first, n); } __isl_give isl_basic_map *isl_basic_map_remove_divs( __isl_take isl_basic_map *bmap) { if (!bmap) return NULL; bmap = isl_basic_map_eliminate_vars(bmap, isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div); if (!bmap) return NULL; bmap->n_div = 0; return isl_basic_map_finalize(bmap); } __isl_give isl_basic_set *isl_basic_set_remove_divs( __isl_take isl_basic_set *bset) { return (struct isl_basic_set *)isl_basic_map_remove_divs( (struct isl_basic_map *)bset); } __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map) { int i; if (!map) return NULL; if (map->n == 0) return map; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_remove_divs(map->p[i]); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set) { return isl_map_remove_divs(set); } struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { if (!bmap) return NULL; isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type), goto error); if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type)) return bmap; bmap = isl_basic_map_eliminate_vars(bmap, isl_basic_map_offset(bmap, type) - 1 + first, n); if (!bmap) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div) return bmap; bmap = isl_basic_map_drop(bmap, type, first, n); return bmap; error: isl_basic_map_free(bmap); return NULL; } /* Return true if the definition of the given div (recursively) involves * any of the given variables. */ static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div, unsigned first, unsigned n) { int i; unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div); if (isl_int_is_zero(bmap->div[div][0])) return 0; if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0) return 1; for (i = bmap->n_div - 1; i >= 0; --i) { if (isl_int_is_zero(bmap->div[div][1 + div_offset + i])) continue; if (div_involves_vars(bmap, i, first, n)) return 1; } return 0; } /* Try and add a lower and/or upper bound on "div" to "bmap" * based on inequality "i". * "total" is the total number of variables (excluding the divs). * "v" is a temporary object that can be used during the calculations. * If "lb" is set, then a lower bound should be constructed. * If "ub" is set, then an upper bound should be constructed. * * The calling function has already checked that the inequality does not * reference "div", but we still need to check that the inequality is * of the right form. We'll consider the case where we want to construct * a lower bound. The construction of upper bounds is similar. * * Let "div" be of the form * * q = floor((a + f(x))/d) * * We essentially check if constraint "i" is of the form * * b + f(x) >= 0 * * so that we can use it to derive a lower bound on "div". * However, we allow a slightly more general form * * b + g(x) >= 0 * * with the condition that the coefficients of g(x) - f(x) are all * divisible by d. * Rewriting this constraint as * * 0 >= -b - g(x) * * adding a + f(x) to both sides and dividing by d, we obtain * * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d * * Taking the floor on both sides, we obtain * * q >= floor((a-b)/d) + (f(x)-g(x))/d * * or * * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0 * * In the case of an upper bound, we construct the constraint * * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0 * */ static __isl_give isl_basic_map *insert_bounds_on_div_from_ineq( __isl_take isl_basic_map *bmap, int div, int i, unsigned total, isl_int v, int lb, int ub) { int j; for (j = 0; (lb || ub) && j < total + bmap->n_div; ++j) { if (lb) { isl_int_sub(v, bmap->ineq[i][1 + j], bmap->div[div][1 + 1 + j]); lb = isl_int_is_divisible_by(v, bmap->div[div][0]); } if (ub) { isl_int_add(v, bmap->ineq[i][1 + j], bmap->div[div][1 + 1 + j]); ub = isl_int_is_divisible_by(v, bmap->div[div][0]); } } if (!lb && !ub) return bmap; bmap = isl_basic_map_extend_constraints(bmap, 0, lb + ub); if (lb) { int k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; for (j = 0; j < 1 + total + bmap->n_div; ++j) { isl_int_sub(bmap->ineq[k][j], bmap->ineq[i][j], bmap->div[div][1 + j]); isl_int_cdiv_q(bmap->ineq[k][j], bmap->ineq[k][j], bmap->div[div][0]); } isl_int_set_si(bmap->ineq[k][1 + total + div], 1); } if (ub) { int k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; for (j = 0; j < 1 + total + bmap->n_div; ++j) { isl_int_add(bmap->ineq[k][j], bmap->ineq[i][j], bmap->div[div][1 + j]); isl_int_fdiv_q(bmap->ineq[k][j], bmap->ineq[k][j], bmap->div[div][0]); } isl_int_set_si(bmap->ineq[k][1 + total + div], -1); } return bmap; error: isl_basic_map_free(bmap); return NULL; } /* This function is called right before "div" is eliminated from "bmap" * using Fourier-Motzkin. * Look through the constraints of "bmap" for constraints on the argument * of the integer division and use them to construct constraints on the * integer division itself. These constraints can then be combined * during the Fourier-Motzkin elimination. * Note that it is only useful to introduce lower bounds on "div" * if "bmap" already contains upper bounds on "div" as the newly * introduce lower bounds can then be combined with the pre-existing * upper bounds. Similarly for upper bounds. * We therefore first check if "bmap" contains any lower and/or upper bounds * on "div". * * It is interesting to note that the introduction of these constraints * can indeed lead to more accurate results, even when compared to * deriving constraints on the argument of "div" from constraints on "div". * Consider, for example, the set * * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k } * * The second constraint can be rewritten as * * 2 * [(-i-2j+3)/4] + k >= 0 * * from which we can derive * * -i - 2j + 3 >= -2k * * or * * i + 2j <= 3 + 2k * * Combined with the first constraint, we obtain * * -3 <= 3 + 2k or k >= -3 * * If, on the other hand we derive a constraint on [(i+2j)/4] from * the first constraint, we obtain * * [(i + 2j)/4] >= [-3/4] = -1 * * Combining this constraint with the second constraint, we obtain * * k >= -2 */ static __isl_give isl_basic_map *insert_bounds_on_div( __isl_take isl_basic_map *bmap, int div) { int i; int check_lb, check_ub; isl_int v; unsigned total; if (!bmap) return NULL; if (isl_int_is_zero(bmap->div[div][0])) return bmap; total = isl_space_dim(bmap->dim, isl_dim_all); check_lb = 0; check_ub = 0; for (i = 0; (!check_lb || !check_ub) && i < bmap->n_ineq; ++i) { int s = isl_int_sgn(bmap->ineq[i][1 + total + div]); if (s > 0) check_ub = 1; if (s < 0) check_lb = 1; } if (!check_lb && !check_ub) return bmap; isl_int_init(v); for (i = 0; bmap && i < bmap->n_ineq; ++i) { if (!isl_int_is_zero(bmap->ineq[i][1 + total + div])) continue; bmap = insert_bounds_on_div_from_ineq(bmap, div, i, total, v, check_lb, check_ub); } isl_int_clear(v); return bmap; } /* Remove all divs (recursively) involving any of the given dimensions * in their definitions. */ __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!bmap) return NULL; isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type), goto error); first += isl_basic_map_offset(bmap, type); for (i = bmap->n_div - 1; i >= 0; --i) { if (!div_involves_vars(bmap, i, first, n)) continue; bmap = insert_bounds_on_div(bmap, i); bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1); if (!bmap) return NULL; i = bmap->n_div; } return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_remove_divs_involving_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return isl_basic_map_remove_divs_involving_dims(bset, type, first, n); } __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!map) return NULL; if (map->n == 0) return map; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i], type, first, n); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set, type, first, n); } /* Does the desciption of "bmap" depend on the specified dimensions? * We also check whether the dimensions appear in any of the div definitions. * In principle there is no need for this check. If the dimensions appear * in a div definition, they also appear in the defining constraints of that * div. */ int isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!bmap) return -1; if (first + n > isl_basic_map_dim(bmap, type)) isl_die(bmap->ctx, isl_error_invalid, "index out of bounds", return -1); first += isl_basic_map_offset(bmap, type); for (i = 0; i < bmap->n_eq; ++i) if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0) return 1; for (i = 0; i < bmap->n_ineq; ++i) if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0) return 1; for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0) return 1; } return 0; } int isl_map_involves_dims(__isl_keep isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!map) return -1; if (first + n > isl_map_dim(map, type)) isl_die(map->ctx, isl_error_invalid, "index out of bounds", return -1); for (i = 0; i < map->n; ++i) { int involves = isl_basic_map_involves_dims(map->p[i], type, first, n); if (involves < 0 || involves) return involves; } return 0; } int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return isl_basic_map_involves_dims(bset, type, first, n); } int isl_set_involves_dims(__isl_keep isl_set *set, enum isl_dim_type type, unsigned first, unsigned n) { return isl_map_involves_dims(set, type, first, n); } /* Return true if the definition of the given div is unknown or depends * on unknown divs. */ static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div) { int i; unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div); if (isl_int_is_zero(bmap->div[div][0])) return 1; for (i = bmap->n_div - 1; i >= 0; --i) { if (isl_int_is_zero(bmap->div[div][1 + div_offset + i])) continue; if (div_is_unknown(bmap, i)) return 1; } return 0; } /* Remove all divs that are unknown or defined in terms of unknown divs. */ __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs( __isl_take isl_basic_map *bmap) { int i; if (!bmap) return NULL; for (i = bmap->n_div - 1; i >= 0; --i) { if (!div_is_unknown(bmap, i)) continue; bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1); if (!bmap) return NULL; i = bmap->n_div; } return bmap; } /* Remove all divs that are unknown or defined in terms of unknown divs. */ __isl_give isl_basic_set *isl_basic_set_remove_unknown_divs( __isl_take isl_basic_set *bset) { return isl_basic_map_remove_unknown_divs(bset); } __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map) { int i; if (!map) return NULL; if (map->n == 0) return map; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set) { return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set); } __isl_give isl_basic_set *isl_basic_set_remove_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_basic_set *) isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n); } struct isl_map *isl_map_remove_dims(struct isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (n == 0) return map; map = isl_map_cow(map); if (!map) return NULL; isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error); for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_eliminate_vars(map->p[i], isl_basic_map_offset(map->p[i], type) - 1 + first, n); if (!map->p[i]) goto error; } map = isl_map_drop(map, type, first, n); return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n); } /* Project out n inputs starting at first using Fourier-Motzkin */ struct isl_map *isl_map_remove_inputs(struct isl_map *map, unsigned first, unsigned n) { return isl_map_remove_dims(map, isl_dim_in, first, n); } static void dump_term(struct isl_basic_map *bmap, isl_int c, int pos, FILE *out) { const char *name; unsigned in = isl_basic_map_n_in(bmap); unsigned dim = in + isl_basic_map_n_out(bmap); unsigned nparam = isl_basic_map_n_param(bmap); if (!pos) isl_int_print(out, c, 0); else { if (!isl_int_is_one(c)) isl_int_print(out, c, 0); if (pos < 1 + nparam) { name = isl_space_get_dim_name(bmap->dim, isl_dim_param, pos - 1); if (name) fprintf(out, "%s", name); else fprintf(out, "p%d", pos - 1); } else if (pos < 1 + nparam + in) fprintf(out, "i%d", pos - 1 - nparam); else if (pos < 1 + nparam + dim) fprintf(out, "o%d", pos - 1 - nparam - in); else fprintf(out, "e%d", pos - 1 - nparam - dim); } } static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c, int sign, FILE *out) { int i; int first; unsigned len = 1 + isl_basic_map_total_dim(bmap); isl_int v; isl_int_init(v); for (i = 0, first = 1; i < len; ++i) { if (isl_int_sgn(c[i]) * sign <= 0) continue; if (!first) fprintf(out, " + "); first = 0; isl_int_abs(v, c[i]); dump_term(bmap, v, i, out); } isl_int_clear(v); if (first) fprintf(out, "0"); } static void dump_constraint(struct isl_basic_map *bmap, isl_int *c, const char *op, FILE *out, int indent) { int i; fprintf(out, "%*s", indent, ""); dump_constraint_sign(bmap, c, 1, out); fprintf(out, " %s ", op); dump_constraint_sign(bmap, c, -1, out); fprintf(out, "\n"); for (i = bmap->n_div; i < bmap->extra; ++i) { if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i])) continue; fprintf(out, "%*s", indent, ""); fprintf(out, "ERROR: unused div coefficient not zero\n"); abort(); } } static void dump_constraints(struct isl_basic_map *bmap, isl_int **c, unsigned n, const char *op, FILE *out, int indent) { int i; for (i = 0; i < n; ++i) dump_constraint(bmap, c[i], op, out, indent); } static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out) { int j; int first = 1; unsigned total = isl_basic_map_total_dim(bmap); for (j = 0; j < 1 + total; ++j) { if (isl_int_is_zero(exp[j])) continue; if (!first && isl_int_is_pos(exp[j])) fprintf(out, "+"); dump_term(bmap, exp[j], j, out); first = 0; } } static void dump(struct isl_basic_map *bmap, FILE *out, int indent) { int i; dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent); dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent); for (i = 0; i < bmap->n_div; ++i) { fprintf(out, "%*s", indent, ""); fprintf(out, "e%d = [(", i); dump_affine(bmap, bmap->div[i]+1, out); fprintf(out, ")/"); isl_int_print(out, bmap->div[i][0], 0); fprintf(out, "]\n"); } } void isl_basic_set_print_internal(struct isl_basic_set *bset, FILE *out, int indent) { if (!bset) { fprintf(out, "null basic set\n"); return; } fprintf(out, "%*s", indent, ""); fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n", bset->ref, bset->dim->nparam, bset->dim->n_out, bset->extra, bset->flags); dump((struct isl_basic_map *)bset, out, indent); } void isl_basic_map_print_internal(struct isl_basic_map *bmap, FILE *out, int indent) { if (!bmap) { fprintf(out, "null basic map\n"); return; } fprintf(out, "%*s", indent, ""); fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, " "flags: %x, n_name: %d\n", bmap->ref, bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out, bmap->extra, bmap->flags, bmap->dim->n_id); dump(bmap, out, indent); } int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos) { unsigned total; if (!bmap) return -1; total = isl_basic_map_total_dim(bmap); isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1); isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total); isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1); ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); return 0; } __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n, unsigned flags) { struct isl_set *set; if (!dim) return NULL; isl_assert(dim->ctx, dim->n_in == 0, goto error); isl_assert(dim->ctx, n >= 0, goto error); set = isl_alloc(dim->ctx, struct isl_set, sizeof(struct isl_set) + (n - 1) * sizeof(struct isl_basic_set *)); if (!set) goto error; set->ctx = dim->ctx; isl_ctx_ref(set->ctx); set->ref = 1; set->size = n; set->n = 0; set->dim = dim; set->flags = flags; return set; error: isl_space_free(dim); return NULL; } struct isl_set *isl_set_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned dim, int n, unsigned flags) { struct isl_set *set; isl_space *dims; dims = isl_space_alloc(ctx, nparam, 0, dim); if (!dims) return NULL; set = isl_set_alloc_space(dims, n, flags); return set; } /* Make sure "map" has room for at least "n" more basic maps. */ struct isl_map *isl_map_grow(struct isl_map *map, int n) { int i; struct isl_map *grown = NULL; if (!map) return NULL; isl_assert(map->ctx, n >= 0, goto error); if (map->n + n <= map->size) return map; grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags); if (!grown) goto error; for (i = 0; i < map->n; ++i) { grown->p[i] = isl_basic_map_copy(map->p[i]); if (!grown->p[i]) goto error; grown->n++; } isl_map_free(map); return grown; error: isl_map_free(grown); isl_map_free(map); return NULL; } /* Make sure "set" has room for at least "n" more basic sets. */ struct isl_set *isl_set_grow(struct isl_set *set, int n) { return (struct isl_set *)isl_map_grow((struct isl_map *)set, n); } struct isl_set *isl_set_dup(struct isl_set *set) { int i; struct isl_set *dup; if (!set) return NULL; dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags); if (!dup) return NULL; for (i = 0; i < set->n; ++i) dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i])); return dup; } struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset) { return isl_map_from_basic_map(bset); } struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap) { struct isl_map *map; if (!bmap) return NULL; map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT); return isl_map_add_basic_map(map, bmap); } __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set, __isl_take isl_basic_set *bset) { return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set, (struct isl_basic_map *)bset); } void *isl_set_free(__isl_take isl_set *set) { int i; if (!set) return NULL; if (--set->ref > 0) return NULL; isl_ctx_deref(set->ctx); for (i = 0; i < set->n; ++i) isl_basic_set_free(set->p[i]); isl_space_free(set->dim); free(set); return NULL; } void isl_set_print_internal(struct isl_set *set, FILE *out, int indent) { int i; if (!set) { fprintf(out, "null set\n"); return; } fprintf(out, "%*s", indent, ""); fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n", set->ref, set->n, set->dim->nparam, set->dim->n_out, set->flags); for (i = 0; i < set->n; ++i) { fprintf(out, "%*s", indent, ""); fprintf(out, "basic set %d:\n", i); isl_basic_set_print_internal(set->p[i], out, indent+4); } } void isl_map_print_internal(struct isl_map *map, FILE *out, int indent) { int i; if (!map) { fprintf(out, "null map\n"); return; } fprintf(out, "%*s", indent, ""); fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, " "flags: %x, n_name: %d\n", map->ref, map->n, map->dim->nparam, map->dim->n_in, map->dim->n_out, map->flags, map->dim->n_id); for (i = 0; i < map->n; ++i) { fprintf(out, "%*s", indent, ""); fprintf(out, "basic map %d:\n", i); isl_basic_map_print_internal(map->p[i], out, indent+4); } } struct isl_basic_map *isl_basic_map_intersect_domain( struct isl_basic_map *bmap, struct isl_basic_set *bset) { struct isl_basic_map *bmap_domain; if (!bmap || !bset) goto error; isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param), goto error); if (isl_space_dim(bset->dim, isl_dim_set) != 0) isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset), goto error); bmap = isl_basic_map_cow(bmap); if (!bmap) goto error; bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim), bset->n_div, bset->n_eq, bset->n_ineq); bmap_domain = isl_basic_map_from_domain(bset); bmap = add_constraints(bmap, bmap_domain, 0, 0); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); isl_basic_set_free(bset); return NULL; } struct isl_basic_map *isl_basic_map_intersect_range( struct isl_basic_map *bmap, struct isl_basic_set *bset) { struct isl_basic_map *bmap_range; if (!bmap || !bset) goto error; isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param), goto error); if (isl_space_dim(bset->dim, isl_dim_set) != 0) isl_assert(bset->ctx, isl_basic_map_compatible_range(bmap, bset), goto error); if (isl_basic_set_is_universe(bset)) { isl_basic_set_free(bset); return bmap; } bmap = isl_basic_map_cow(bmap); if (!bmap) goto error; bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim), bset->n_div, bset->n_eq, bset->n_ineq); bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim)); bmap = add_constraints(bmap, bmap_range, 0, 0); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); isl_basic_set_free(bset); return NULL; } int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec) { int i; unsigned total; isl_int s; if (!bmap || !vec) return -1; total = 1 + isl_basic_map_total_dim(bmap); if (total != vec->size) return -1; isl_int_init(s); for (i = 0; i < bmap->n_eq; ++i) { isl_seq_inner_product(vec->el, bmap->eq[i], total, &s); if (!isl_int_is_zero(s)) { isl_int_clear(s); return 0; } } for (i = 0; i < bmap->n_ineq; ++i) { isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s); if (isl_int_is_neg(s)) { isl_int_clear(s); return 0; } } isl_int_clear(s); return 1; } int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec) { return isl_basic_map_contains((struct isl_basic_map *)bset, vec); } struct isl_basic_map *isl_basic_map_intersect( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { struct isl_vec *sample = NULL; if (!bmap1 || !bmap2) goto error; isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param, bmap2->dim, isl_dim_param), goto error); if (isl_space_dim(bmap1->dim, isl_dim_all) == isl_space_dim(bmap1->dim, isl_dim_param) && isl_space_dim(bmap2->dim, isl_dim_all) != isl_space_dim(bmap2->dim, isl_dim_param)) return isl_basic_map_intersect(bmap2, bmap1); if (isl_space_dim(bmap2->dim, isl_dim_all) != isl_space_dim(bmap2->dim, isl_dim_param)) isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error); if (bmap1->sample && isl_basic_map_contains(bmap1, bmap1->sample) > 0 && isl_basic_map_contains(bmap2, bmap1->sample) > 0) sample = isl_vec_copy(bmap1->sample); else if (bmap2->sample && isl_basic_map_contains(bmap1, bmap2->sample) > 0 && isl_basic_map_contains(bmap2, bmap2->sample) > 0) sample = isl_vec_copy(bmap2->sample); bmap1 = isl_basic_map_cow(bmap1); if (!bmap1) goto error; bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim), bmap2->n_div, bmap2->n_eq, bmap2->n_ineq); bmap1 = add_constraints(bmap1, bmap2, 0, 0); if (!bmap1) isl_vec_free(sample); else if (sample) { isl_vec_free(bmap1->sample); bmap1->sample = sample; } bmap1 = isl_basic_map_simplify(bmap1); return isl_basic_map_finalize(bmap1); error: if (sample) isl_vec_free(sample); isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } struct isl_basic_set *isl_basic_set_intersect( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { return (struct isl_basic_set *) isl_basic_map_intersect( (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2); } __isl_give isl_basic_set *isl_basic_set_intersect_params( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2) { return isl_basic_set_intersect(bset1, bset2); } /* Special case of isl_map_intersect, where both map1 and map2 * are convex, without any divs and such that either map1 or map2 * contains a single constraint. This constraint is then simply * added to the other map. */ static __isl_give isl_map *map_intersect_add_constraint( __isl_take isl_map *map1, __isl_take isl_map *map2) { isl_assert(map1->ctx, map1->n == 1, goto error); isl_assert(map2->ctx, map1->n == 1, goto error); isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error); isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error); if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1) return isl_map_intersect(map2, map1); isl_assert(map2->ctx, map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error); map1 = isl_map_cow(map1); if (!map1) goto error; if (isl_map_plain_is_empty(map1)) { isl_map_free(map2); return map1; } map1->p[0] = isl_basic_map_cow(map1->p[0]); if (map2->p[0]->n_eq == 1) map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]); else map1->p[0] = isl_basic_map_add_ineq(map1->p[0], map2->p[0]->ineq[0]); map1->p[0] = isl_basic_map_simplify(map1->p[0]); map1->p[0] = isl_basic_map_finalize(map1->p[0]); if (!map1->p[0]) goto error; if (isl_basic_map_plain_is_empty(map1->p[0])) { isl_basic_map_free(map1->p[0]); map1->n = 0; } isl_map_free(map2); return map1; error: isl_map_free(map1); isl_map_free(map2); return NULL; } /* map2 may be either a parameter domain or a map living in the same * space as map1. */ static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1, __isl_take isl_map *map2) { unsigned flags = 0; isl_map *result; int i, j; if (!map1 || !map2) goto error; if ((isl_map_plain_is_empty(map1) || isl_map_plain_is_universe(map2)) && isl_space_is_equal(map1->dim, map2->dim)) { isl_map_free(map2); return map1; } if ((isl_map_plain_is_empty(map2) || isl_map_plain_is_universe(map1)) && isl_space_is_equal(map1->dim, map2->dim)) { isl_map_free(map1); return map2; } if (map1->n == 1 && map2->n == 1 && map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 && isl_space_is_equal(map1->dim, map2->dim) && (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 || map2->p[0]->n_eq + map2->p[0]->n_ineq == 1)) return map_intersect_add_constraint(map1, map2); if (isl_space_dim(map2->dim, isl_dim_all) != isl_space_dim(map2->dim, isl_dim_param)) isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error); if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) && ISL_F_ISSET(map2, ISL_MAP_DISJOINT)) ISL_FL_SET(flags, ISL_MAP_DISJOINT); result = isl_map_alloc_space(isl_space_copy(map1->dim), map1->n * map2->n, flags); if (!result) goto error; for (i = 0; i < map1->n; ++i) for (j = 0; j < map2->n; ++j) { struct isl_basic_map *part; part = isl_basic_map_intersect( isl_basic_map_copy(map1->p[i]), isl_basic_map_copy(map2->p[j])); if (isl_basic_map_is_empty(part) < 0) part = isl_basic_map_free(part); result = isl_map_add_basic_map(result, part); if (!result) goto error; } isl_map_free(map1); isl_map_free(map2); return result; error: isl_map_free(map1); isl_map_free(map2); return NULL; } static __isl_give isl_map *map_intersect(__isl_take isl_map *map1, __isl_take isl_map *map2) { if (!map1 || !map2) goto error; if (!isl_space_is_equal(map1->dim, map2->dim)) isl_die(isl_map_get_ctx(map1), isl_error_invalid, "spaces don't match", goto error); return map_intersect_internal(map1, map2); error: isl_map_free(map1); isl_map_free(map2); return NULL; } __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_intersect); } struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2) { return (struct isl_set *) isl_map_intersect((struct isl_map *)set1, (struct isl_map *)set2); } /* map_intersect_internal accepts intersections * with parameter domains, so we can just call that function. */ static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map, __isl_take isl_set *params) { return map_intersect_internal(map, params); } __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params); } __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set, __isl_take isl_set *params) { return isl_map_intersect_params(set, params); } struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap) { isl_space *dim; struct isl_basic_set *bset; unsigned in; if (!bmap) return NULL; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; dim = isl_space_reverse(isl_space_copy(bmap->dim)); in = isl_basic_map_n_in(bmap); bset = isl_basic_set_from_basic_map(bmap); bset = isl_basic_set_swap_vars(bset, in); return isl_basic_map_from_basic_set(bset, dim); } static __isl_give isl_basic_map *basic_map_space_reset( __isl_take isl_basic_map *bmap, enum isl_dim_type type) { isl_space *space; if (!bmap) return NULL; if (!isl_space_is_named_or_nested(bmap->dim, type)) return bmap; space = isl_basic_map_get_space(bmap); space = isl_space_reset(space, type); bmap = isl_basic_map_reset_space(bmap, space); return bmap; } __isl_give isl_basic_map *isl_basic_map_insert_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, unsigned n) { isl_space *res_dim; struct isl_basic_map *res; struct isl_dim_map *dim_map; unsigned total, off; enum isl_dim_type t; if (n == 0) return basic_map_space_reset(bmap, type); if (!bmap) return NULL; res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n); total = isl_basic_map_total_dim(bmap) + n; dim_map = isl_dim_map_alloc(bmap->ctx, total); off = 0; for (t = isl_dim_param; t <= isl_dim_out; ++t) { if (t != type) { isl_dim_map_dim(dim_map, bmap->dim, t, off); } else { unsigned size = isl_basic_map_dim(bmap, t); isl_dim_map_dim_range(dim_map, bmap->dim, t, 0, pos, off); isl_dim_map_dim_range(dim_map, bmap->dim, t, pos, size - pos, off + pos + n); } off += isl_space_dim(res_dim, t); } isl_dim_map_div(dim_map, bmap, off); res = isl_basic_map_alloc_space(res_dim, bmap->n_div, bmap->n_eq, bmap->n_ineq); if (isl_basic_map_is_rational(bmap)) res = isl_basic_map_set_rational(res); if (isl_basic_map_plain_is_empty(bmap)) { isl_basic_map_free(bmap); free(dim_map); return isl_basic_map_set_to_empty(res); } res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map); return isl_basic_map_finalize(res); } __isl_give isl_basic_set *isl_basic_set_insert_dims( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, unsigned n) { return isl_basic_map_insert_dims(bset, type, pos, n); } __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned n) { if (!bmap) return NULL; return isl_basic_map_insert_dims(bmap, type, isl_basic_map_dim(bmap, type), n); } __isl_give isl_basic_set *isl_basic_set_add_dims(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned n) { if (!bset) return NULL; isl_assert(bset->ctx, type != isl_dim_in, goto error); return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n); error: isl_basic_set_free(bset); return NULL; } static __isl_give isl_map *map_space_reset(__isl_take isl_map *map, enum isl_dim_type type) { isl_space *space; if (!map || !isl_space_is_named_or_nested(map->dim, type)) return map; space = isl_map_get_space(map); space = isl_space_reset(space, type); map = isl_map_reset_space(map, space); return map; } __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, unsigned n) { int i; if (n == 0) return map_space_reset(map, type); map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_insert_dims(map->dim, type, pos, n); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_insert_dims(map->p[i], type, pos, n); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, unsigned n) { return isl_map_insert_dims(set, type, pos, n); } __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map, enum isl_dim_type type, unsigned n) { if (!map) return NULL; return isl_map_insert_dims(map, type, isl_map_dim(map, type), n); } __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned n) { if (!set) return NULL; isl_assert(set->ctx, type != isl_dim_in, goto error); return (isl_set *)isl_map_add_dims((isl_map *)set, type, n); error: isl_set_free(set); return NULL; } __isl_give isl_basic_map *isl_basic_map_move_dims( __isl_take isl_basic_map *bmap, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { struct isl_dim_map *dim_map; struct isl_basic_map *res; enum isl_dim_type t; unsigned total, off; if (!bmap) return NULL; if (n == 0) return bmap; isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type), goto error); if (dst_type == src_type && dst_pos == src_pos) return bmap; isl_assert(bmap->ctx, dst_type != src_type, goto error); if (pos(bmap->dim, dst_type) + dst_pos == pos(bmap->dim, src_type) + src_pos + ((src_type < dst_type) ? n : 0)) { bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos, src_type, src_pos, n); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return bmap; } total = isl_basic_map_total_dim(bmap); dim_map = isl_dim_map_alloc(bmap->ctx, total); off = 0; for (t = isl_dim_param; t <= isl_dim_out; ++t) { unsigned size = isl_space_dim(bmap->dim, t); if (t == dst_type) { isl_dim_map_dim_range(dim_map, bmap->dim, t, 0, dst_pos, off); off += dst_pos; isl_dim_map_dim_range(dim_map, bmap->dim, src_type, src_pos, n, off); off += n; isl_dim_map_dim_range(dim_map, bmap->dim, t, dst_pos, size - dst_pos, off); off += size - dst_pos; } else if (t == src_type) { isl_dim_map_dim_range(dim_map, bmap->dim, t, 0, src_pos, off); off += src_pos; isl_dim_map_dim_range(dim_map, bmap->dim, t, src_pos + n, size - src_pos - n, off); off += size - src_pos - n; } else { isl_dim_map_dim(dim_map, bmap->dim, t, off); off += size; } } isl_dim_map_div(dim_map, bmap, off); res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap), bmap->n_div, bmap->n_eq, bmap->n_ineq); bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map); if (!bmap) goto error; bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos, src_type, src_pos, n); if (!bmap->dim) goto error; ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED); bmap = isl_basic_map_gauss(bmap, NULL); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { return (isl_basic_set *)isl_basic_map_move_dims( (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n); } __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { if (!set) return NULL; isl_assert(set->ctx, dst_type != isl_dim_in, goto error); return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos, src_type, src_pos, n); error: isl_set_free(set); return NULL; } __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map, enum isl_dim_type dst_type, unsigned dst_pos, enum isl_dim_type src_type, unsigned src_pos, unsigned n) { int i; if (!map) return NULL; if (n == 0) return map; isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type), goto error); if (dst_type == src_type && dst_pos == src_pos) return map; isl_assert(map->ctx, dst_type != src_type, goto error); map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_move_dims(map->p[i], dst_type, dst_pos, src_type, src_pos, n); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } /* Move the specified dimensions to the last columns right before * the divs. Don't change the dimension specification of bmap. * That's the responsibility of the caller. */ static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { struct isl_dim_map *dim_map; struct isl_basic_map *res; enum isl_dim_type t; unsigned total, off; if (!bmap) return NULL; if (pos(bmap->dim, type) + first + n == 1 + isl_space_dim(bmap->dim, isl_dim_all)) return bmap; total = isl_basic_map_total_dim(bmap); dim_map = isl_dim_map_alloc(bmap->ctx, total); off = 0; for (t = isl_dim_param; t <= isl_dim_out; ++t) { unsigned size = isl_space_dim(bmap->dim, t); if (t == type) { isl_dim_map_dim_range(dim_map, bmap->dim, t, 0, first, off); off += first; isl_dim_map_dim_range(dim_map, bmap->dim, t, first, n, total - bmap->n_div - n); isl_dim_map_dim_range(dim_map, bmap->dim, t, first + n, size - (first + n), off); off += size - (first + n); } else { isl_dim_map_dim(dim_map, bmap->dim, t, off); off += size; } } isl_dim_map_div(dim_map, bmap, off + n); res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap), bmap->n_div, bmap->n_eq, bmap->n_ineq); res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map); return res; } /* Insert "n" rows in the divs of "bmap". * * The number of columns is not changed, which means that the last * dimensions of "bmap" are being reintepreted as the new divs. * The space of "bmap" is not adjusted, however, which means * that "bmap" is left in an inconsistent state. Removing "n" dimensions * from the space of "bmap" is the responsibility of the caller. */ static __isl_give isl_basic_map *insert_div_rows(__isl_take isl_basic_map *bmap, int n) { int i; size_t row_size; isl_int **new_div; isl_int *old; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra; old = bmap->block2.data; bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2, (bmap->extra + n) * (1 + row_size)); if (!bmap->block2.data) return isl_basic_map_free(bmap); new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n); if (!new_div) return isl_basic_map_free(bmap); for (i = 0; i < n; ++i) { new_div[i] = bmap->block2.data + (bmap->extra + i) * (1 + row_size); isl_seq_clr(new_div[i], 1 + row_size); } for (i = 0; i < bmap->extra; ++i) new_div[n + i] = bmap->block2.data + (bmap->div[i] - old); free(bmap->div); bmap->div = new_div; bmap->n_div += n; bmap->extra += n; return bmap; } /* Turn the n dimensions of type type, starting at first * into existentially quantified variables. */ __isl_give isl_basic_map *isl_basic_map_project_out( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned first, unsigned n) { if (n == 0) return basic_map_space_reset(bmap, type); if (!bmap) return NULL; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) return isl_basic_map_remove_dims(bmap, type, first, n); isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type), goto error); bmap = move_last(bmap, type, first, n); bmap = isl_basic_map_cow(bmap); bmap = insert_div_rows(bmap, n); if (!bmap) return NULL; bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n); if (!bmap->dim) goto error; bmap = isl_basic_map_simplify(bmap); bmap = isl_basic_map_drop_redundant_divs(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } /* Turn the n dimensions of type type, starting at first * into existentially quantified variables. */ struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_basic_set *)isl_basic_map_project_out( (isl_basic_map *)bset, type, first, n); } /* Turn the n dimensions of type type, starting at first * into existentially quantified variables. */ __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map, enum isl_dim_type type, unsigned first, unsigned n) { int i; if (!map) return NULL; if (n == 0) return map_space_reset(map, type); isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error); map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_drop_dims(map->dim, type, first, n); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } /* Turn the n dimensions of type type, starting at first * into existentially quantified variables. */ __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n) { return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n); } static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n) { int i, j; for (i = 0; i < n; ++i) { j = isl_basic_map_alloc_div(bmap); if (j < 0) goto error; isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap)); } return bmap; error: isl_basic_map_free(bmap); return NULL; } struct isl_basic_map *isl_basic_map_apply_range( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { isl_space *dim_result = NULL; struct isl_basic_map *bmap; unsigned n_in, n_out, n, nparam, total, pos; struct isl_dim_map *dim_map1, *dim_map2; if (!bmap1 || !bmap2) goto error; if (!isl_space_match(bmap1->dim, isl_dim_param, bmap2->dim, isl_dim_param)) isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid, "parameters don't match", goto error); if (!isl_space_tuple_match(bmap1->dim, isl_dim_out, bmap2->dim, isl_dim_in)) isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid, "spaces don't match", goto error); dim_result = isl_space_join(isl_space_copy(bmap1->dim), isl_space_copy(bmap2->dim)); n_in = isl_basic_map_n_in(bmap1); n_out = isl_basic_map_n_out(bmap2); n = isl_basic_map_n_out(bmap1); nparam = isl_basic_map_n_param(bmap1); total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n; dim_map1 = isl_dim_map_alloc(bmap1->ctx, total); dim_map2 = isl_dim_map_alloc(bmap1->ctx, total); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in); isl_dim_map_div(dim_map1, bmap1, pos += n_out); isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos); bmap = isl_basic_map_alloc_space(dim_result, bmap1->n_div + bmap2->n_div + n, bmap1->n_eq + bmap2->n_eq, bmap1->n_ineq + bmap2->n_ineq); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2); bmap = add_divs(bmap, n); bmap = isl_basic_map_simplify(bmap); bmap = isl_basic_map_drop_redundant_divs(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } struct isl_basic_set *isl_basic_set_apply( struct isl_basic_set *bset, struct isl_basic_map *bmap) { if (!bset || !bmap) goto error; isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset), goto error); return (struct isl_basic_set *) isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap); error: isl_basic_set_free(bset); isl_basic_map_free(bmap); return NULL; } struct isl_basic_map *isl_basic_map_apply_domain( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { if (!bmap1 || !bmap2) goto error; isl_assert(bmap1->ctx, isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error); isl_assert(bmap1->ctx, isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2), goto error); bmap1 = isl_basic_map_reverse(bmap1); bmap1 = isl_basic_map_apply_range(bmap1, bmap2); return isl_basic_map_reverse(bmap1); error: isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map * A \cap B -> f(A) + f(B) */ struct isl_basic_map *isl_basic_map_sum( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { unsigned n_in, n_out, nparam, total, pos; struct isl_basic_map *bmap = NULL; struct isl_dim_map *dim_map1, *dim_map2; int i; if (!bmap1 || !bmap2) goto error; isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error); nparam = isl_basic_map_n_param(bmap1); n_in = isl_basic_map_n_in(bmap1); n_out = isl_basic_map_n_out(bmap1); total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out; dim_map1 = isl_dim_map_alloc(bmap1->ctx, total); dim_map2 = isl_dim_map_alloc(bmap2->ctx, total); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos); isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out); isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out); bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim), bmap1->n_div + bmap2->n_div + 2 * n_out, bmap1->n_eq + bmap2->n_eq + n_out, bmap1->n_ineq + bmap2->n_ineq); for (i = 0; i < n_out; ++i) { int j = isl_basic_map_alloc_equality(bmap); if (j < 0) goto error; isl_seq_clr(bmap->eq[j], 1+total); isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1); isl_int_set_si(bmap->eq[j][1+pos+i], 1); isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1); } bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2); bmap = add_divs(bmap, 2 * n_out); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } /* Given two maps A -> f(A) and B -> g(B), construct a map * A \cap B -> f(A) + f(B) */ struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2) { struct isl_map *result; int i, j; if (!map1 || !map2) goto error; isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error); result = isl_map_alloc_space(isl_space_copy(map1->dim), map1->n * map2->n, 0); if (!result) goto error; for (i = 0; i < map1->n; ++i) for (j = 0; j < map2->n; ++j) { struct isl_basic_map *part; part = isl_basic_map_sum( isl_basic_map_copy(map1->p[i]), isl_basic_map_copy(map2->p[j])); if (isl_basic_map_is_empty(part)) isl_basic_map_free(part); else result = isl_map_add_basic_map(result, part); if (!result) goto error; } isl_map_free(map1); isl_map_free(map2); return result; error: isl_map_free(map1); isl_map_free(map2); return NULL; } __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1, __isl_take isl_set *set2) { return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2); } /* Given a basic map A -> f(A), construct A -> -f(A). */ struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap) { int i, j; unsigned off, n; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; n = isl_basic_map_dim(bmap, isl_dim_out); off = isl_basic_map_offset(bmap, isl_dim_out); for (i = 0; i < bmap->n_eq; ++i) for (j = 0; j < n; ++j) isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]); for (i = 0; i < bmap->n_ineq; ++i) for (j = 0; j < n; ++j) isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]); for (i = 0; i < bmap->n_div; ++i) for (j = 0; j < n; ++j) isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]); bmap = isl_basic_map_gauss(bmap, NULL); return isl_basic_map_finalize(bmap); } __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset) { return isl_basic_map_neg(bset); } /* Given a map A -> f(A), construct A -> -f(A). */ struct isl_map *isl_map_neg(struct isl_map *map) { int i; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_neg(map->p[i]); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_neg(__isl_take isl_set *set) { return (isl_set *)isl_map_neg((isl_map *)set); } /* Given a basic map A -> f(A) and an integer d, construct a basic map * A -> floor(f(A)/d). */ struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap, isl_int d) { unsigned n_in, n_out, nparam, total, pos; struct isl_basic_map *result = NULL; struct isl_dim_map *dim_map; int i; if (!bmap) return NULL; nparam = isl_basic_map_n_param(bmap); n_in = isl_basic_map_n_in(bmap); n_out = isl_basic_map_n_out(bmap); total = nparam + n_in + n_out + bmap->n_div + n_out; dim_map = isl_dim_map_alloc(bmap->ctx, total); isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam); isl_dim_map_div(dim_map, bmap, pos += n_in + n_out); isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div); result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim), bmap->n_div + n_out, bmap->n_eq, bmap->n_ineq + 2 * n_out); result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map); result = add_divs(result, n_out); for (i = 0; i < n_out; ++i) { int j; j = isl_basic_map_alloc_inequality(result); if (j < 0) goto error; isl_seq_clr(result->ineq[j], 1+total); isl_int_neg(result->ineq[j][1+nparam+n_in+i], d); isl_int_set_si(result->ineq[j][1+pos+i], 1); j = isl_basic_map_alloc_inequality(result); if (j < 0) goto error; isl_seq_clr(result->ineq[j], 1+total); isl_int_set(result->ineq[j][1+nparam+n_in+i], d); isl_int_set_si(result->ineq[j][1+pos+i], -1); isl_int_sub_ui(result->ineq[j][0], d, 1); } result = isl_basic_map_simplify(result); return isl_basic_map_finalize(result); error: isl_basic_map_free(result); return NULL; } /* Given a map A -> f(A) and an integer d, construct a map * A -> floor(f(A)/d). */ struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d) { int i; map = isl_map_cow(map); if (!map) return NULL; ISL_F_CLR(map, ISL_MAP_DISJOINT); ISL_F_CLR(map, ISL_MAP_NORMALIZED); for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_floordiv(map->p[i], d); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } /* Given a map A -> f(A) and an integer d, construct a map * A -> floor(f(A)/d). */ __isl_give isl_map *isl_map_floordiv_val(__isl_take isl_map *map, __isl_take isl_val *d) { if (!map || !d) goto error; if (!isl_val_is_int(d)) isl_die(isl_val_get_ctx(d), isl_error_invalid, "expecting integer denominator", goto error); map = isl_map_floordiv(map, d->n); isl_val_free(d); return map; error: isl_map_free(map); isl_val_free(d); return NULL; } static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos) { int i; unsigned nparam; unsigned n_in; i = isl_basic_map_alloc_equality(bmap); if (i < 0) goto error; nparam = isl_basic_map_n_param(bmap); n_in = isl_basic_map_n_in(bmap); isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->eq[i][1+nparam+pos], -1); isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } /* Add a constraints to "bmap" expressing i_pos < o_pos */ static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos) { int i; unsigned nparam; unsigned n_in; i = isl_basic_map_alloc_inequality(bmap); if (i < 0) goto error; nparam = isl_basic_map_n_param(bmap); n_in = isl_basic_map_n_in(bmap); isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->ineq[i][0], -1); isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1); isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } /* Add a constraint to "bmap" expressing i_pos <= o_pos */ static __isl_give isl_basic_map *var_less_or_equal( __isl_take isl_basic_map *bmap, unsigned pos) { int i; unsigned nparam; unsigned n_in; i = isl_basic_map_alloc_inequality(bmap); if (i < 0) goto error; nparam = isl_basic_map_n_param(bmap); n_in = isl_basic_map_n_in(bmap); isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1); isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } /* Add a constraints to "bmap" expressing i_pos > o_pos */ static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos) { int i; unsigned nparam; unsigned n_in; i = isl_basic_map_alloc_inequality(bmap); if (i < 0) goto error; nparam = isl_basic_map_n_param(bmap); n_in = isl_basic_map_n_in(bmap); isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->ineq[i][0], -1); isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1); isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } /* Add a constraint to "bmap" expressing i_pos >= o_pos */ static __isl_give isl_basic_map *var_more_or_equal( __isl_take isl_basic_map *bmap, unsigned pos) { int i; unsigned nparam; unsigned n_in; i = isl_basic_map_alloc_inequality(bmap); if (i < 0) goto error; nparam = isl_basic_map_n_param(bmap); n_in = isl_basic_map_n_in(bmap); isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1); isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_map *isl_basic_map_equal( __isl_take isl_space *dim, unsigned n_equal) { int i; struct isl_basic_map *bmap; bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0); if (!bmap) return NULL; for (i = 0; i < n_equal && bmap; ++i) bmap = var_equal(bmap, i); return isl_basic_map_finalize(bmap); } /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos] */ __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim, unsigned pos) { int i; struct isl_basic_map *bmap; bmap = isl_basic_map_alloc_space(dim, 0, pos, 1); if (!bmap) return NULL; for (i = 0; i < pos && bmap; ++i) bmap = var_equal(bmap, i); if (bmap) bmap = var_less(bmap, pos); return isl_basic_map_finalize(bmap); } /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos] */ __isl_give isl_basic_map *isl_basic_map_less_or_equal_at( __isl_take isl_space *dim, unsigned pos) { int i; isl_basic_map *bmap; bmap = isl_basic_map_alloc_space(dim, 0, pos, 1); for (i = 0; i < pos; ++i) bmap = var_equal(bmap, i); bmap = var_less_or_equal(bmap, pos); return isl_basic_map_finalize(bmap); } /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos */ __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim, unsigned pos) { int i; struct isl_basic_map *bmap; bmap = isl_basic_map_alloc_space(dim, 0, pos, 1); if (!bmap) return NULL; for (i = 0; i < pos && bmap; ++i) bmap = var_equal(bmap, i); if (bmap) bmap = var_more(bmap, pos); return isl_basic_map_finalize(bmap); } /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos] */ __isl_give isl_basic_map *isl_basic_map_more_or_equal_at( __isl_take isl_space *dim, unsigned pos) { int i; isl_basic_map *bmap; bmap = isl_basic_map_alloc_space(dim, 0, pos, 1); for (i = 0; i < pos; ++i) bmap = var_equal(bmap, i); bmap = var_more_or_equal(bmap, pos); return isl_basic_map_finalize(bmap); } static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims, unsigned n, int equal) { struct isl_map *map; int i; if (n == 0 && equal) return isl_map_universe(dims); map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT); for (i = 0; i + 1 < n; ++i) map = isl_map_add_basic_map(map, isl_basic_map_less_at(isl_space_copy(dims), i)); if (n > 0) { if (equal) map = isl_map_add_basic_map(map, isl_basic_map_less_or_equal_at(dims, n - 1)); else map = isl_map_add_basic_map(map, isl_basic_map_less_at(dims, n - 1)); } else isl_space_free(dims); return map; } static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal) { if (!dims) return NULL; return map_lex_lte_first(dims, dims->n_out, equal); } __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n) { return map_lex_lte_first(dim, n, 0); } __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n) { return map_lex_lte_first(dim, n, 1); } __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim) { return map_lex_lte(isl_space_map_from_set(set_dim), 0); } __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim) { return map_lex_lte(isl_space_map_from_set(set_dim), 1); } static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims, unsigned n, int equal) { struct isl_map *map; int i; if (n == 0 && equal) return isl_map_universe(dims); map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT); for (i = 0; i + 1 < n; ++i) map = isl_map_add_basic_map(map, isl_basic_map_more_at(isl_space_copy(dims), i)); if (n > 0) { if (equal) map = isl_map_add_basic_map(map, isl_basic_map_more_or_equal_at(dims, n - 1)); else map = isl_map_add_basic_map(map, isl_basic_map_more_at(dims, n - 1)); } else isl_space_free(dims); return map; } static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal) { if (!dims) return NULL; return map_lex_gte_first(dims, dims->n_out, equal); } __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n) { return map_lex_gte_first(dim, n, 0); } __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n) { return map_lex_gte_first(dim, n, 1); } __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim) { return map_lex_gte(isl_space_map_from_set(set_dim), 0); } __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim) { return map_lex_gte(isl_space_map_from_set(set_dim), 1); } __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1, __isl_take isl_set *set2) { isl_map *map; map = isl_map_lex_le(isl_set_get_space(set1)); map = isl_map_intersect_domain(map, set1); map = isl_map_intersect_range(map, set2); return map; } __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1, __isl_take isl_set *set2) { isl_map *map; map = isl_map_lex_lt(isl_set_get_space(set1)); map = isl_map_intersect_domain(map, set1); map = isl_map_intersect_range(map, set2); return map; } __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1, __isl_take isl_set *set2) { isl_map *map; map = isl_map_lex_ge(isl_set_get_space(set1)); map = isl_map_intersect_domain(map, set1); map = isl_map_intersect_range(map, set2); return map; } __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1, __isl_take isl_set *set2) { isl_map *map; map = isl_map_lex_gt(isl_set_get_space(set1)); map = isl_map_intersect_domain(map, set1); map = isl_map_intersect_range(map, set2); return map; } __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_map *map; map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1))); map = isl_map_apply_domain(map, isl_map_reverse(map1)); map = isl_map_apply_range(map, isl_map_reverse(map2)); return map; } __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_map *map; map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1))); map = isl_map_apply_domain(map, isl_map_reverse(map1)); map = isl_map_apply_range(map, isl_map_reverse(map2)); return map; } __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_map *map; map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1))); map = isl_map_apply_domain(map, isl_map_reverse(map1)); map = isl_map_apply_range(map, isl_map_reverse(map2)); return map; } __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_map *map; map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1))); map = isl_map_apply_domain(map, isl_map_reverse(map1)); map = isl_map_apply_range(map, isl_map_reverse(map2)); return map; } __isl_give isl_basic_map *isl_basic_map_from_basic_set( __isl_take isl_basic_set *bset, __isl_take isl_space *dim) { struct isl_basic_map *bmap; bset = isl_basic_set_cow(bset); if (!bset || !dim) goto error; isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error); isl_space_free(bset->dim); bmap = (struct isl_basic_map *) bset; bmap->dim = dim; return isl_basic_map_finalize(bmap); error: isl_basic_set_free(bset); isl_space_free(dim); return NULL; } struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap) { if (!bmap) goto error; if (bmap->dim->n_in == 0) return (struct isl_basic_set *)bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) goto error; bmap->dim = isl_space_as_set_space(bmap->dim); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return (struct isl_basic_set *)bmap; error: isl_basic_map_free(bmap); return NULL; } /* For a div d = floor(f/m), add the constraints * * f - m d >= 0 * -(f-(n-1)) + m d >= 0 * * Note that the second constraint is the negation of * * f - m d >= n */ int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap, unsigned pos, isl_int *div) { int i, j; unsigned total = isl_basic_map_total_dim(bmap); i = isl_basic_map_alloc_inequality(bmap); if (i < 0) return -1; isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total); isl_int_neg(bmap->ineq[i][1 + pos], div[0]); j = isl_basic_map_alloc_inequality(bmap); if (j < 0) return -1; isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total); isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]); isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1); return j; } int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset, unsigned pos, isl_int *div) { return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset, pos, div); } int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div) { unsigned total = isl_basic_map_total_dim(bmap); unsigned div_pos = total - bmap->n_div + div; return isl_basic_map_add_div_constraints_var(bmap, div_pos, bmap->div[div]); } int isl_basic_set_add_div_constraints(struct isl_basic_set *bset, unsigned div) { return isl_basic_map_add_div_constraints(bset, div); } struct isl_basic_set *isl_basic_map_underlying_set( struct isl_basic_map *bmap) { if (!bmap) goto error; if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0 && !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) && !isl_space_is_named_or_nested(bmap->dim, isl_dim_out)) return (struct isl_basic_set *)bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) goto error; bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div); if (!bmap->dim) goto error; bmap->extra -= bmap->n_div; bmap->n_div = 0; bmap = isl_basic_map_finalize(bmap); return (struct isl_basic_set *)bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_underlying_set( __isl_take isl_basic_set *bset) { return isl_basic_map_underlying_set((isl_basic_map *)bset); } struct isl_basic_map *isl_basic_map_overlying_set( struct isl_basic_set *bset, struct isl_basic_map *like) { struct isl_basic_map *bmap; struct isl_ctx *ctx; unsigned total; int i; if (!bset || !like) goto error; ctx = bset->ctx; isl_assert(ctx, bset->n_div == 0, goto error); isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error); isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like), goto error); if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) { isl_basic_map_free(like); return (struct isl_basic_map *)bset; } bset = isl_basic_set_cow(bset); if (!bset) goto error; total = bset->dim->n_out + bset->extra; bmap = (struct isl_basic_map *)bset; isl_space_free(bmap->dim); bmap->dim = isl_space_copy(like->dim); if (!bmap->dim) goto error; bmap->n_div = like->n_div; bmap->extra += like->n_div; if (bmap->extra) { unsigned ltotal; isl_int **div; ltotal = total - bmap->extra + like->extra; if (ltotal > total) ltotal = total; bmap->block2 = isl_blk_extend(ctx, bmap->block2, bmap->extra * (1 + 1 + total)); if (isl_blk_is_error(bmap->block2)) goto error; div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra); if (!div) goto error; bmap->div = div; for (i = 0; i < bmap->extra; ++i) bmap->div[i] = bmap->block2.data + i * (1 + 1 + total); for (i = 0; i < like->n_div; ++i) { isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal); isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal); } bmap = isl_basic_map_extend_constraints(bmap, 0, 2 * like->n_div); for (i = 0; i < like->n_div; ++i) { if (!bmap) break; if (isl_int_is_zero(bmap->div[i][0])) continue; if (isl_basic_map_add_div_constraints(bmap, i) < 0) bmap = isl_basic_map_free(bmap); } } isl_basic_map_free(like); bmap = isl_basic_map_simplify(bmap); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(like); isl_basic_set_free(bset); return NULL; } struct isl_basic_set *isl_basic_set_from_underlying_set( struct isl_basic_set *bset, struct isl_basic_set *like) { return (struct isl_basic_set *) isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like); } struct isl_set *isl_set_from_underlying_set( struct isl_set *set, struct isl_basic_set *like) { int i; if (!set || !like) goto error; isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like), goto error); if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) { isl_basic_set_free(like); return set; } set = isl_set_cow(set); if (!set) goto error; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_from_underlying_set(set->p[i], isl_basic_set_copy(like)); if (!set->p[i]) goto error; } isl_space_free(set->dim); set->dim = isl_space_copy(like->dim); if (!set->dim) goto error; isl_basic_set_free(like); return set; error: isl_basic_set_free(like); isl_set_free(set); return NULL; } struct isl_set *isl_map_underlying_set(struct isl_map *map) { int i; map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_cow(map->dim); if (!map->dim) goto error; for (i = 1; i < map->n; ++i) isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div, goto error); for (i = 0; i < map->n; ++i) { map->p[i] = (struct isl_basic_map *) isl_basic_map_underlying_set(map->p[i]); if (!map->p[i]) goto error; } if (map->n == 0) map->dim = isl_space_underlying(map->dim, 0); else { isl_space_free(map->dim); map->dim = isl_space_copy(map->p[0]->dim); } if (!map->dim) goto error; return (struct isl_set *)map; error: isl_map_free(map); return NULL; } struct isl_set *isl_set_to_underlying_set(struct isl_set *set) { return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set); } __isl_give isl_basic_map *isl_basic_map_reset_space( __isl_take isl_basic_map *bmap, __isl_take isl_space *dim) { bmap = isl_basic_map_cow(bmap); if (!bmap || !dim) goto error; isl_space_free(bmap->dim); bmap->dim = dim; bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); isl_space_free(dim); return NULL; } __isl_give isl_basic_set *isl_basic_set_reset_space( __isl_take isl_basic_set *bset, __isl_take isl_space *dim) { return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset, dim); } __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map, __isl_take isl_space *dim) { int i; map = isl_map_cow(map); if (!map || !dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_reset_space(map->p[i], isl_space_copy(dim)); if (!map->p[i]) goto error; } isl_space_free(map->dim); map->dim = dim; return map; error: isl_map_free(map); isl_space_free(dim); return NULL; } __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set, __isl_take isl_space *dim) { return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim); } /* Compute the parameter domain of the given basic set. */ __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset) { isl_space *space; unsigned n; if (isl_basic_set_is_params(bset)) return bset; n = isl_basic_set_dim(bset, isl_dim_set); bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n); space = isl_basic_set_get_space(bset); space = isl_space_params(space); bset = isl_basic_set_reset_space(bset, space); return bset; } /* Construct a zero-dimensional basic set with the given parameter domain. */ __isl_give isl_basic_set *isl_basic_set_from_params( __isl_take isl_basic_set *bset) { isl_space *space; space = isl_basic_set_get_space(bset); space = isl_space_set_from_params(space); bset = isl_basic_set_reset_space(bset, space); return bset; } /* Compute the parameter domain of the given set. */ __isl_give isl_set *isl_set_params(__isl_take isl_set *set) { isl_space *space; unsigned n; if (isl_set_is_params(set)) return set; n = isl_set_dim(set, isl_dim_set); set = isl_set_project_out(set, isl_dim_set, 0, n); space = isl_set_get_space(set); space = isl_space_params(space); set = isl_set_reset_space(set, space); return set; } /* Construct a zero-dimensional set with the given parameter domain. */ __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set) { isl_space *space; space = isl_set_get_space(set); space = isl_space_set_from_params(space); set = isl_set_reset_space(set, space); return set; } /* Compute the parameter domain of the given map. */ __isl_give isl_set *isl_map_params(__isl_take isl_map *map) { isl_space *space; unsigned n; n = isl_map_dim(map, isl_dim_in); map = isl_map_project_out(map, isl_dim_in, 0, n); n = isl_map_dim(map, isl_dim_out); map = isl_map_project_out(map, isl_dim_out, 0, n); space = isl_map_get_space(map); space = isl_space_params(space); map = isl_map_reset_space(map, space); return map; } struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap) { isl_space *dim; struct isl_basic_set *domain; unsigned n_in; unsigned n_out; if (!bmap) return NULL; dim = isl_space_domain(isl_basic_map_get_space(bmap)); n_in = isl_basic_map_n_in(bmap); n_out = isl_basic_map_n_out(bmap); domain = isl_basic_set_from_basic_map(bmap); domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out); domain = isl_basic_set_reset_space(domain, dim); return domain; } int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return isl_space_may_be_set(bmap->dim); } /* Is this basic map actually a set? * Users should never call this function. Outside of isl, * the type should indicate whether something is a set or a map. */ int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return isl_space_is_set(bmap->dim); } struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap) { if (!bmap) return NULL; if (isl_basic_map_is_set(bmap)) return bmap; return isl_basic_map_domain(isl_basic_map_reverse(bmap)); } __isl_give isl_basic_map *isl_basic_map_domain_map( __isl_take isl_basic_map *bmap) { int i, k; isl_space *dim; isl_basic_map *domain; int nparam, n_in, n_out; unsigned total; nparam = isl_basic_map_dim(bmap, isl_dim_param); n_in = isl_basic_map_dim(bmap, isl_dim_in); n_out = isl_basic_map_dim(bmap, isl_dim_out); dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap))); domain = isl_basic_map_universe(dim); bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap)); bmap = isl_basic_map_apply_range(bmap, domain); bmap = isl_basic_map_extend_constraints(bmap, n_in, 0); total = isl_basic_map_total_dim(bmap); for (i = 0; i < n_in; ++i) { k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->eq[k], 1 + total); isl_int_set_si(bmap->eq[k][1 + nparam + i], -1); isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1); } bmap = isl_basic_map_gauss(bmap, NULL); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_map *isl_basic_map_range_map( __isl_take isl_basic_map *bmap) { int i, k; isl_space *dim; isl_basic_map *range; int nparam, n_in, n_out; unsigned total; nparam = isl_basic_map_dim(bmap, isl_dim_param); n_in = isl_basic_map_dim(bmap, isl_dim_in); n_out = isl_basic_map_dim(bmap, isl_dim_out); dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap))); range = isl_basic_map_universe(dim); bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap)); bmap = isl_basic_map_apply_range(bmap, range); bmap = isl_basic_map_extend_constraints(bmap, n_out, 0); total = isl_basic_map_total_dim(bmap); for (i = 0; i < n_out; ++i) { k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->eq[k], 1 + total); isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1); isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1); } bmap = isl_basic_map_gauss(bmap, NULL); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } int isl_map_may_be_set(__isl_keep isl_map *map) { if (!map) return -1; return isl_space_may_be_set(map->dim); } /* Is this map actually a set? * Users should never call this function. Outside of isl, * the type should indicate whether something is a set or a map. */ int isl_map_is_set(__isl_keep isl_map *map) { if (!map) return -1; return isl_space_is_set(map->dim); } struct isl_set *isl_map_range(struct isl_map *map) { int i; struct isl_set *set; if (!map) goto error; if (isl_map_is_set(map)) return (isl_set *)map; map = isl_map_cow(map); if (!map) goto error; set = (struct isl_set *) map; set->dim = isl_space_range(set->dim); if (!set->dim) goto error; for (i = 0; i < map->n; ++i) { set->p[i] = isl_basic_map_range(map->p[i]); if (!set->p[i]) goto error; } ISL_F_CLR(set, ISL_MAP_DISJOINT); ISL_F_CLR(set, ISL_SET_NORMALIZED); return set; error: isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map) { int i; isl_space *domain_dim; map = isl_map_cow(map); if (!map) return NULL; domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map))); map->dim = isl_space_from_domain(isl_space_wrap(map->dim)); map->dim = isl_space_join(map->dim, domain_dim); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_domain_map(map->p[i]); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_DISJOINT); ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map) { int i; isl_space *range_dim; map = isl_map_cow(map); if (!map) return NULL; range_dim = isl_space_range(isl_map_get_space(map)); range_dim = isl_space_from_range(range_dim); map->dim = isl_space_from_domain(isl_space_wrap(map->dim)); map->dim = isl_space_join(map->dim, range_dim); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_range_map(map->p[i]); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_DISJOINT); ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set, __isl_take isl_space *dim) { int i; struct isl_map *map = NULL; set = isl_set_cow(set); if (!set || !dim) goto error; isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error); map = (struct isl_map *)set; for (i = 0; i < set->n; ++i) { map->p[i] = isl_basic_map_from_basic_set( set->p[i], isl_space_copy(dim)); if (!map->p[i]) goto error; } isl_space_free(map->dim); map->dim = dim; return map; error: isl_space_free(dim); isl_set_free(set); return NULL; } __isl_give isl_basic_map *isl_basic_map_from_domain( __isl_take isl_basic_set *bset) { return isl_basic_map_reverse(isl_basic_map_from_range(bset)); } __isl_give isl_basic_map *isl_basic_map_from_range( __isl_take isl_basic_set *bset) { isl_space *space; space = isl_basic_set_get_space(bset); space = isl_space_from_range(space); bset = isl_basic_set_reset_space(bset, space); return (isl_basic_map *)bset; } struct isl_map *isl_map_from_range(struct isl_set *set) { isl_space *space; space = isl_set_get_space(set); space = isl_space_from_range(space); set = isl_set_reset_space(set, space); return (struct isl_map *)set; } __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set) { return isl_map_reverse(isl_map_from_range(set)); } __isl_give isl_basic_map *isl_basic_map_from_domain_and_range( __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range) { return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range); } __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain, __isl_take isl_set *range) { return isl_map_apply_range(isl_map_reverse(domain), range); } struct isl_set *isl_set_from_map(struct isl_map *map) { int i; struct isl_set *set = NULL; if (!map) return NULL; map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_as_set_space(map->dim); if (!map->dim) goto error; set = (struct isl_set *)map; for (i = 0; i < map->n; ++i) { set->p[i] = isl_basic_set_from_basic_map(map->p[i]); if (!set->p[i]) goto error; } return set; error: isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n, unsigned flags) { struct isl_map *map; if (!dim) return NULL; if (n < 0) isl_die(dim->ctx, isl_error_internal, "negative number of basic maps", goto error); map = isl_alloc(dim->ctx, struct isl_map, sizeof(struct isl_map) + (n - 1) * sizeof(struct isl_basic_map *)); if (!map) goto error; map->ctx = dim->ctx; isl_ctx_ref(map->ctx); map->ref = 1; map->size = n; map->n = 0; map->dim = dim; map->flags = flags; return map; error: isl_space_free(dim); return NULL; } struct isl_map *isl_map_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned in, unsigned out, int n, unsigned flags) { struct isl_map *map; isl_space *dims; dims = isl_space_alloc(ctx, nparam, in, out); if (!dims) return NULL; map = isl_map_alloc_space(dims, n, flags); return map; } __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim) { struct isl_basic_map *bmap; bmap = isl_basic_map_alloc_space(dim, 0, 1, 0); bmap = isl_basic_map_set_to_empty(bmap); return bmap; } __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim) { struct isl_basic_set *bset; bset = isl_basic_set_alloc_space(dim, 0, 1, 0); bset = isl_basic_set_set_to_empty(bset); return bset; } struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model) { struct isl_basic_map *bmap; if (!model) return NULL; bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0); bmap = isl_basic_map_set_to_empty(bmap); return bmap; } struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model) { struct isl_basic_map *bmap; if (!model) return NULL; bmap = isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 1, 0); bmap = isl_basic_map_set_to_empty(bmap); return bmap; } struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model) { struct isl_basic_set *bset; if (!model) return NULL; bset = isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 1, 0); bset = isl_basic_set_set_to_empty(bset); return bset; } __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim) { struct isl_basic_map *bmap; bmap = isl_basic_map_alloc_space(dim, 0, 0, 0); bmap = isl_basic_map_finalize(bmap); return bmap; } __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim) { struct isl_basic_set *bset; bset = isl_basic_set_alloc_space(dim, 0, 0, 0); bset = isl_basic_set_finalize(bset); return bset; } __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim) { int i; unsigned total = isl_space_dim(dim, isl_dim_all); isl_basic_map *bmap; bmap= isl_basic_map_alloc_space(dim, 0, 0, total); for (i = 0; i < total; ++i) { int k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->ineq[k], 1 + total); isl_int_set_si(bmap->ineq[k][1 + i], 1); } return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim) { return isl_basic_map_nat_universe(dim); } __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim) { return isl_map_from_basic_map(isl_basic_map_nat_universe(dim)); } __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim) { return isl_map_nat_universe(dim); } __isl_give isl_basic_map *isl_basic_map_universe_like( __isl_keep isl_basic_map *model) { if (!model) return NULL; return isl_basic_map_alloc_space(isl_space_copy(model->dim), 0, 0, 0); } struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model) { if (!model) return NULL; return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0); } __isl_give isl_basic_set *isl_basic_set_universe_like_set( __isl_keep isl_set *model) { if (!model) return NULL; return isl_basic_set_alloc_space(isl_space_copy(model->dim), 0, 0, 0); } __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim) { return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT); } struct isl_map *isl_map_empty_like(struct isl_map *model) { if (!model) return NULL; return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT); } struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model) { if (!model) return NULL; return isl_map_alloc_space(isl_space_copy(model->dim), 0, ISL_MAP_DISJOINT); } __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim) { return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT); } struct isl_set *isl_set_empty_like(struct isl_set *model) { if (!model) return NULL; return isl_set_empty(isl_space_copy(model->dim)); } __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim) { struct isl_map *map; if (!dim) return NULL; map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT); map = isl_map_add_basic_map(map, isl_basic_map_universe(dim)); return map; } __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim) { struct isl_set *set; if (!dim) return NULL; set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT); set = isl_set_add_basic_set(set, isl_basic_set_universe(dim)); return set; } __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model) { if (!model) return NULL; return isl_set_universe(isl_space_copy(model->dim)); } struct isl_map *isl_map_dup(struct isl_map *map) { int i; struct isl_map *dup; if (!map) return NULL; dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags); for (i = 0; i < map->n; ++i) dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i])); return dup; } __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map, __isl_take isl_basic_map *bmap) { if (!bmap || !map) goto error; if (isl_basic_map_plain_is_empty(bmap)) { isl_basic_map_free(bmap); return map; } isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error); isl_assert(map->ctx, map->n < map->size, goto error); map->p[map->n] = bmap; map->n++; ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: if (map) isl_map_free(map); if (bmap) isl_basic_map_free(bmap); return NULL; } void *isl_map_free(struct isl_map *map) { int i; if (!map) return NULL; if (--map->ref > 0) return NULL; isl_ctx_deref(map->ctx); for (i = 0; i < map->n; ++i) isl_basic_map_free(map->p[i]); isl_space_free(map->dim); free(map); return NULL; } struct isl_map *isl_map_extend(struct isl_map *base, unsigned nparam, unsigned n_in, unsigned n_out) { int i; base = isl_map_cow(base); if (!base) return NULL; base->dim = isl_space_extend(base->dim, nparam, n_in, n_out); if (!base->dim) goto error; for (i = 0; i < base->n; ++i) { base->p[i] = isl_basic_map_extend_space(base->p[i], isl_space_copy(base->dim), 0, 0, 0); if (!base->p[i]) goto error; } return base; error: isl_map_free(base); return NULL; } struct isl_set *isl_set_extend(struct isl_set *base, unsigned nparam, unsigned dim) { return (struct isl_set *)isl_map_extend((struct isl_map *)base, nparam, 0, dim); } static struct isl_basic_map *isl_basic_map_fix_pos_si( struct isl_basic_map *bmap, unsigned pos, int value) { int j; bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_extend_constraints(bmap, 1, 0); j = isl_basic_map_alloc_equality(bmap); if (j < 0) goto error; isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->eq[j][pos], -1); isl_int_set_si(bmap->eq[j][0], value); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } static __isl_give isl_basic_map *isl_basic_map_fix_pos( __isl_take isl_basic_map *bmap, unsigned pos, isl_int value) { int j; bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_extend_constraints(bmap, 1, 0); j = isl_basic_map_alloc_equality(bmap); if (j < 0) goto error; isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->eq[j][pos], -1); isl_int_set(bmap->eq[j][0], value); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value) { if (!bmap) return NULL; isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error); return isl_basic_map_fix_pos_si(bmap, isl_basic_map_offset(bmap, type) + pos, value); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, isl_int value) { if (!bmap) return NULL; isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error); return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos, value); error: isl_basic_map_free(bmap); return NULL; } /* Fix the value of the variable at position "pos" of type "type" of "bmap" * to be equal to "v". */ __isl_give isl_basic_map *isl_basic_map_fix_val(__isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v) { if (!bmap || !v) goto error; if (!isl_val_is_int(v)) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "expecting integer value", goto error); if (pos >= isl_basic_map_dim(bmap, type)) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "index out of bounds", goto error); pos += isl_basic_map_offset(bmap, type); bmap = isl_basic_map_fix_pos(bmap, pos, v->n); isl_val_free(v); return bmap; error: isl_basic_map_free(bmap); isl_val_free(v); return NULL; } /* Fix the value of the variable at position "pos" of type "type" of "bset" * to be equal to "v". */ __isl_give isl_basic_set *isl_basic_set_fix_val(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v) { return isl_basic_map_fix_val(bset, type, pos, v); } struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset, enum isl_dim_type type, unsigned pos, int value) { return (struct isl_basic_set *) isl_basic_map_fix_si((struct isl_basic_map *)bset, type, pos, value); } __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, isl_int value) { return (struct isl_basic_set *) isl_basic_map_fix((struct isl_basic_map *)bset, type, pos, value); } struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap, unsigned input, int value) { return isl_basic_map_fix_si(bmap, isl_dim_in, input, value); } struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset, unsigned dim, int value) { return (struct isl_basic_set *) isl_basic_map_fix_si((struct isl_basic_map *)bset, isl_dim_set, dim, value); } static int remove_if_empty(__isl_keep isl_map *map, int i) { int empty = isl_basic_map_plain_is_empty(map->p[i]); if (empty < 0) return -1; if (!empty) return 0; isl_basic_map_free(map->p[i]); if (i != map->n - 1) { ISL_F_CLR(map, ISL_MAP_NORMALIZED); map->p[i] = map->p[map->n - 1]; } map->n--; return 0; } /* Perform "fn" on each basic map of "map", where we may not be holding * the only reference to "map". * In particular, "fn" should be a semantics preserving operation * that we want to apply to all copies of "map". We therefore need * to be careful not to modify "map" in a way that breaks "map" * in case anything goes wrong. */ __isl_give isl_map *isl_map_inline_foreach_basic_map(__isl_take isl_map *map, __isl_give isl_basic_map *(*fn)(__isl_take isl_basic_map *bmap)) { struct isl_basic_map *bmap; int i; if (!map) return NULL; for (i = map->n - 1; i >= 0; --i) { bmap = isl_basic_map_copy(map->p[i]); bmap = fn(bmap); if (!bmap) goto error; isl_basic_map_free(map->p[i]); map->p[i] = bmap; if (remove_if_empty(map, i) < 0) goto error; } return map; error: isl_map_free(map); return NULL; } struct isl_map *isl_map_fix_si(struct isl_map *map, enum isl_dim_type type, unsigned pos, int value) { int i; map = isl_map_cow(map); if (!map) return NULL; isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error); for (i = map->n - 1; i >= 0; --i) { map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value); if (remove_if_empty(map, i) < 0) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value) { return (struct isl_set *) isl_map_fix_si((struct isl_map *)set, type, pos, value); } __isl_give isl_map *isl_map_fix(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, isl_int value) { int i; map = isl_map_cow(map); if (!map) return NULL; isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error); for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_fix(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value) { return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value); } /* Fix the value of the variable at position "pos" of type "type" of "map" * to be equal to "v". */ __isl_give isl_map *isl_map_fix_val(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v) { int i; map = isl_map_cow(map); if (!map || !v) goto error; if (!isl_val_is_int(v)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "expecting integer value", goto error); if (pos >= isl_map_dim(map, type)) isl_die(isl_map_get_ctx(map), isl_error_invalid, "index out of bounds", goto error); for (i = map->n - 1; i >= 0; --i) { map->p[i] = isl_basic_map_fix_val(map->p[i], type, pos, isl_val_copy(v)); if (remove_if_empty(map, i) < 0) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); isl_val_free(v); return map; error: isl_map_free(map); isl_val_free(v); return NULL; } /* Fix the value of the variable at position "pos" of type "type" of "set" * to be equal to "v". */ __isl_give isl_set *isl_set_fix_val(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *v) { return isl_map_fix_val(set, type, pos, v); } struct isl_map *isl_map_fix_input_si(struct isl_map *map, unsigned input, int value) { return isl_map_fix_si(map, isl_dim_in, input, value); } struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value) { return (struct isl_set *) isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value); } static __isl_give isl_basic_map *basic_map_bound_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value, int upper) { int j; if (!bmap) return NULL; isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error); pos += isl_basic_map_offset(bmap, type); bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_extend_constraints(bmap, 0, 1); j = isl_basic_map_alloc_inequality(bmap); if (j < 0) goto error; isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap)); if (upper) { isl_int_set_si(bmap->ineq[j][pos], -1); isl_int_set_si(bmap->ineq[j][0], value); } else { isl_int_set_si(bmap->ineq[j][pos], 1); isl_int_set_si(bmap->ineq[j][0], -value); } bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_map *isl_basic_map_lower_bound_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value) { return basic_map_bound_si(bmap, type, pos, value, 0); } /* Constrain the values of the given dimension to be no greater than "value". */ __isl_give isl_basic_map *isl_basic_map_upper_bound_si( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int value) { return basic_map_bound_si(bmap, type, pos, value, 1); } struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset, unsigned dim, isl_int value) { int j; bset = isl_basic_set_cow(bset); bset = isl_basic_set_extend_constraints(bset, 0, 1); j = isl_basic_set_alloc_inequality(bset); if (j < 0) goto error; isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset)); isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1); isl_int_neg(bset->ineq[j][0], value); bset = isl_basic_set_simplify(bset); return isl_basic_set_finalize(bset); error: isl_basic_set_free(bset); return NULL; } static __isl_give isl_map *map_bound_si(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value, int upper) { int i; map = isl_map_cow(map); if (!map) return NULL; isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error); for (i = 0; i < map->n; ++i) { map->p[i] = basic_map_bound_si(map->p[i], type, pos, value, upper); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value) { return map_bound_si(map, type, pos, value, 0); } __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int value) { return map_bound_si(map, type, pos, value, 1); } __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value) { return (struct isl_set *) isl_map_lower_bound_si((struct isl_map *)set, type, pos, value); } __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, int value) { return isl_map_upper_bound_si(set, type, pos, value); } /* Bound the given variable of "bmap" from below (or above is "upper" * is set) to "value". */ static __isl_give isl_basic_map *basic_map_bound( __isl_take isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, isl_int value, int upper) { int j; if (!bmap) return NULL; if (pos >= isl_basic_map_dim(bmap, type)) isl_die(bmap->ctx, isl_error_invalid, "index out of bounds", goto error); pos += isl_basic_map_offset(bmap, type); bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_extend_constraints(bmap, 0, 1); j = isl_basic_map_alloc_inequality(bmap); if (j < 0) goto error; isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap)); if (upper) { isl_int_set_si(bmap->ineq[j][pos], -1); isl_int_set(bmap->ineq[j][0], value); } else { isl_int_set_si(bmap->ineq[j][pos], 1); isl_int_neg(bmap->ineq[j][0], value); } bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } /* Bound the given variable of "map" from below (or above is "upper" * is set) to "value". */ static __isl_give isl_map *map_bound(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, isl_int value, int upper) { int i; map = isl_map_cow(map); if (!map) return NULL; if (pos >= isl_map_dim(map, type)) isl_die(map->ctx, isl_error_invalid, "index out of bounds", goto error); for (i = map->n - 1; i >= 0; --i) { map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper); if (remove_if_empty(map, i) < 0) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, isl_int value) { return map_bound(map, type, pos, value, 0); } __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map, enum isl_dim_type type, unsigned pos, isl_int value) { return map_bound(map, type, pos, value, 1); } __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value) { return isl_map_lower_bound(set, type, pos, value); } __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, isl_int value) { return isl_map_upper_bound(set, type, pos, value); } /* Force the values of the variable at position "pos" of type "type" of "set" * to be no smaller than "value". */ __isl_give isl_set *isl_set_lower_bound_val(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *value) { if (!value) goto error; if (!isl_val_is_int(value)) isl_die(isl_set_get_ctx(set), isl_error_invalid, "expecting integer value", goto error); set = isl_set_lower_bound(set, type, pos, value->n); isl_val_free(value); return set; error: isl_val_free(value); isl_set_free(set); return NULL; } /* Force the values of the variable at position "pos" of type "type" of "set" * to be no greater than "value". */ __isl_give isl_set *isl_set_upper_bound_val(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_take isl_val *value) { if (!value) goto error; if (!isl_val_is_int(value)) isl_die(isl_set_get_ctx(set), isl_error_invalid, "expecting integer value", goto error); set = isl_set_upper_bound(set, type, pos, value->n); isl_val_free(value); return set; error: isl_val_free(value); isl_set_free(set); return NULL; } struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim, isl_int value) { int i; set = isl_set_cow(set); if (!set) return NULL; isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error); for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value); if (!set->p[i]) goto error; } return set; error: isl_set_free(set); return NULL; } struct isl_map *isl_map_reverse(struct isl_map *map) { int i; map = isl_map_cow(map); if (!map) return NULL; map->dim = isl_space_reverse(map->dim); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_reverse(map->p[i]); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } static struct isl_map *isl_basic_map_partial_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max) { if (!bmap) goto error; if (bmap->ctx->opt->pip == ISL_PIP_PIP) return isl_pip_basic_map_lexopt(bmap, dom, empty, max); else return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max); error: isl_basic_map_free(bmap); isl_basic_set_free(dom); if (empty) *empty = NULL; return NULL; } struct isl_map *isl_basic_map_partial_lexmax( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty) { return isl_basic_map_partial_lexopt(bmap, dom, empty, 1); } struct isl_map *isl_basic_map_partial_lexmin( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty) { return isl_basic_map_partial_lexopt(bmap, dom, empty, 0); } struct isl_set *isl_basic_set_partial_lexmin( struct isl_basic_set *bset, struct isl_basic_set *dom, struct isl_set **empty) { return (struct isl_set *) isl_basic_map_partial_lexmin((struct isl_basic_map *)bset, dom, empty); } struct isl_set *isl_basic_set_partial_lexmax( struct isl_basic_set *bset, struct isl_basic_set *dom, struct isl_set **empty) { return (struct isl_set *) isl_basic_map_partial_lexmax((struct isl_basic_map *)bset, dom, empty); } __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty) { return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0); } __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty) { return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1); } __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty) { return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty); } __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom, __isl_give isl_set **empty) { return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty); } __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff( __isl_take isl_basic_map *bmap, int max) { isl_basic_set *dom = NULL; isl_space *dom_space; if (!bmap) goto error; dom_space = isl_space_domain(isl_space_copy(bmap->dim)); dom = isl_basic_set_universe(dom_space); return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff( __isl_take isl_basic_map *bmap) { return isl_basic_map_lexopt_pw_multi_aff(bmap, 0); } #undef TYPE #define TYPE isl_pw_multi_aff #undef SUFFIX #define SUFFIX _pw_multi_aff #undef EMPTY #define EMPTY isl_pw_multi_aff_empty #undef ADD #define ADD isl_pw_multi_aff_union_add #include "isl_map_lexopt_templ.c" /* Given a map "map", compute the lexicographically minimal * (or maximal) image element for each domain element in dom, * in the form of an isl_pw_multi_aff. * Set *empty to those elements in dom that do not have an image element. * * We first compute the lexicographically minimal or maximal element * in the first basic map. This results in a partial solution "res" * and a subset "todo" of dom that still need to be handled. * We then consider each of the remaining maps in "map" and successively * update both "res" and "todo". */ static __isl_give isl_pw_multi_aff *isl_map_partial_lexopt_aligned_pw_multi_aff( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty, int max) { int i; isl_pw_multi_aff *res; isl_set *todo; if (!map || !dom) goto error; if (isl_map_plain_is_empty(map)) { if (empty) *empty = dom; else isl_set_free(dom); return isl_pw_multi_aff_from_map(map); } res = basic_map_partial_lexopt_pw_multi_aff( isl_basic_map_copy(map->p[0]), isl_set_copy(dom), &todo, max); for (i = 1; i < map->n; ++i) { isl_pw_multi_aff *res_i; isl_set *todo_i; res_i = basic_map_partial_lexopt_pw_multi_aff( isl_basic_map_copy(map->p[i]), isl_set_copy(dom), &todo_i, max); if (max) res = isl_pw_multi_aff_union_lexmax(res, res_i); else res = isl_pw_multi_aff_union_lexmin(res, res_i); todo = isl_set_intersect(todo, todo_i); } isl_set_free(dom); isl_map_free(map); if (empty) *empty = todo; else isl_set_free(todo); return res; error: if (empty) *empty = NULL; isl_set_free(dom); isl_map_free(map); return NULL; } #undef TYPE #define TYPE isl_map #undef SUFFIX #define SUFFIX #undef EMPTY #define EMPTY isl_map_empty #undef ADD #define ADD isl_map_union_disjoint #include "isl_map_lexopt_templ.c" /* Given a map "map", compute the lexicographically minimal * (or maximal) image element for each domain element in dom. * Set *empty to those elements in dom that do not have an image element. * * We first compute the lexicographically minimal or maximal element * in the first basic map. This results in a partial solution "res" * and a subset "todo" of dom that still need to be handled. * We then consider each of the remaining maps in "map" and successively * update both "res" and "todo". * * Let res^k and todo^k be the results after k steps and let i = k + 1. * Assume we are computing the lexicographical maximum. * We first compute the lexicographically maximal element in basic map i. * This results in a partial solution res_i and a subset todo_i. * Then we combine these results with those obtain for the first k basic maps * to obtain a result that is valid for the first k+1 basic maps. * In particular, the set where there is no solution is the set where * there is no solution for the first k basic maps and also no solution * for the ith basic map, i.e., * * todo^i = todo^k * todo_i * * On dom(res^k) * dom(res_i), we need to pick the larger of the two * solutions, arbitrarily breaking ties in favor of res^k. * That is, when res^k(a) >= res_i(a), we pick res^k and * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote * the lexicographic order.) * In practice, we compute * * res^k * (res_i . "<=") * * and * * res_i * (res^k . "<") * * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i), * where only one of res^k and res_i provides a solution and we simply pick * that one, i.e., * * res^k * todo_i * and * res_i * todo^k * * Note that we only compute these intersections when dom(res^k) intersects * dom(res_i). Otherwise, the only effect of these intersections is to * potentially break up res^k and res_i into smaller pieces. * We want to avoid such splintering as much as possible. * In fact, an earlier implementation of this function would look for * better results in the domain of res^k and for extra results in todo^k, * but this would always result in a splintering according to todo^k, * even when the domain of basic map i is disjoint from the domains of * the previous basic maps. */ static __isl_give isl_map *isl_map_partial_lexopt_aligned( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty, int max) { int i; struct isl_map *res; struct isl_set *todo; if (!map || !dom) goto error; if (isl_map_plain_is_empty(map)) { if (empty) *empty = dom; else isl_set_free(dom); return map; } res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]), isl_set_copy(dom), &todo, max); for (i = 1; i < map->n; ++i) { isl_map *lt, *le; isl_map *res_i; isl_set *todo_i; isl_space *dim = isl_space_range(isl_map_get_space(res)); res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]), isl_set_copy(dom), &todo_i, max); if (max) { lt = isl_map_lex_lt(isl_space_copy(dim)); le = isl_map_lex_le(dim); } else { lt = isl_map_lex_gt(isl_space_copy(dim)); le = isl_map_lex_ge(dim); } lt = isl_map_apply_range(isl_map_copy(res), lt); lt = isl_map_intersect(lt, isl_map_copy(res_i)); le = isl_map_apply_range(isl_map_copy(res_i), le); le = isl_map_intersect(le, isl_map_copy(res)); if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) { res = isl_map_intersect_domain(res, isl_set_copy(todo_i)); res_i = isl_map_intersect_domain(res_i, isl_set_copy(todo)); } res = isl_map_union_disjoint(res, res_i); res = isl_map_union_disjoint(res, lt); res = isl_map_union_disjoint(res, le); todo = isl_set_intersect(todo, todo_i); } isl_set_free(dom); isl_map_free(map); if (empty) *empty = todo; else isl_set_free(todo); return res; error: if (empty) *empty = NULL; isl_set_free(dom); isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_partial_lexmax( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty) { return isl_map_partial_lexopt(map, dom, empty, 1); } __isl_give isl_map *isl_map_partial_lexmin( __isl_take isl_map *map, __isl_take isl_set *dom, __isl_give isl_set **empty) { return isl_map_partial_lexopt(map, dom, empty, 0); } __isl_give isl_set *isl_set_partial_lexmin( __isl_take isl_set *set, __isl_take isl_set *dom, __isl_give isl_set **empty) { return (struct isl_set *) isl_map_partial_lexmin((struct isl_map *)set, dom, empty); } __isl_give isl_set *isl_set_partial_lexmax( __isl_take isl_set *set, __isl_take isl_set *dom, __isl_give isl_set **empty) { return (struct isl_set *) isl_map_partial_lexmax((struct isl_map *)set, dom, empty); } /* Compute the lexicographic minimum (or maximum if "max" is set) * of "bmap" over its domain. * * Since we are not interested in the part of the domain space where * there is no solution, we initialize the domain to those constraints * of "bmap" that only involve the parameters and the input dimensions. * This relieves the parametric programming engine from detecting those * inequalities and transferring them to the context. More importantly, * it ensures that those inequalities are transferred first and not * intermixed with inequalities that actually split the domain. */ __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max) { int n_div; int n_out; isl_basic_map *copy; isl_basic_set *dom; n_div = isl_basic_map_dim(bmap, isl_dim_div); n_out = isl_basic_map_dim(bmap, isl_dim_out); copy = isl_basic_map_copy(bmap); copy = isl_basic_map_drop_constraints_involving_dims(copy, isl_dim_div, 0, n_div); copy = isl_basic_map_drop_constraints_involving_dims(copy, isl_dim_out, 0, n_out); dom = isl_basic_map_domain(copy); return isl_basic_map_partial_lexopt(bmap, dom, NULL, max); } __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap) { return isl_basic_map_lexopt(bmap, 0); } __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap) { return isl_basic_map_lexopt(bmap, 1); } __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset) { return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset); } __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset) { return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset); } /* Extract the first and only affine expression from list * and then add it to *pwaff with the given dom. * This domain is known to be disjoint from other domains * because of the way isl_basic_map_foreach_lexmax works. */ static int update_dim_opt(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user) { isl_ctx *ctx = isl_basic_set_get_ctx(dom); isl_aff *aff; isl_pw_aff **pwaff = user; isl_pw_aff *pwaff_i; if (!list) goto error; if (isl_aff_list_n_aff(list) != 1) isl_die(ctx, isl_error_internal, "expecting single element list", goto error); aff = isl_aff_list_get_aff(list, 0); pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff); *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i); isl_aff_list_free(list); return 0; error: isl_basic_set_free(dom); isl_aff_list_free(list); return -1; } /* Given a basic map with one output dimension, compute the minimum or * maximum of that dimension as an isl_pw_aff. * * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt * call update_dim_opt on each leaf of the result. */ static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap, int max) { isl_space *dim = isl_basic_map_get_space(bmap); isl_pw_aff *pwaff; int r; dim = isl_space_from_domain(isl_space_domain(dim)); dim = isl_space_add_dims(dim, isl_dim_out, 1); pwaff = isl_pw_aff_empty(dim); r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff); if (r < 0) return isl_pw_aff_free(pwaff); return pwaff; } /* Compute the minimum or maximum of the given output dimension * as a function of the parameters and the input dimensions, * but independently of the other output dimensions. * * We first project out the other output dimension and then compute * the "lexicographic" maximum in each basic map, combining the results * using isl_pw_aff_union_max. */ static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos, int max) { int i; isl_pw_aff *pwaff; unsigned n_out; n_out = isl_map_dim(map, isl_dim_out); map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1)); map = isl_map_project_out(map, isl_dim_out, 0, pos); if (!map) return NULL; if (map->n == 0) { isl_space *dim = isl_map_get_space(map); dim = isl_space_domain(isl_space_from_range(dim)); isl_map_free(map); return isl_pw_aff_empty(dim); } pwaff = basic_map_dim_opt(map->p[0], max); for (i = 1; i < map->n; ++i) { isl_pw_aff *pwaff_i; pwaff_i = basic_map_dim_opt(map->p[i], max); pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max); } isl_map_free(map); return pwaff; } /* Compute the maximum of the given output dimension as a function of the * parameters and input dimensions, but independently of * the other output dimensions. */ __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos) { return map_dim_opt(map, pos, 1); } /* Compute the minimum or maximum of the given set dimension * as a function of the parameters, * but independently of the other set dimensions. */ static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos, int max) { return map_dim_opt(set, pos, max); } /* Compute the maximum of the given set dimension as a function of the * parameters, but independently of the other set dimensions. */ __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos) { return set_dim_opt(set, pos, 1); } /* Compute the minimum of the given set dimension as a function of the * parameters, but independently of the other set dimensions. */ __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos) { return set_dim_opt(set, pos, 0); } /* Apply a preimage specified by "mat" on the parameters of "bset". * bset is assumed to have only parameters and divs. */ static struct isl_basic_set *basic_set_parameter_preimage( struct isl_basic_set *bset, struct isl_mat *mat) { unsigned nparam; if (!bset || !mat) goto error; bset->dim = isl_space_cow(bset->dim); if (!bset->dim) goto error; nparam = isl_basic_set_dim(bset, isl_dim_param); isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error); bset->dim->nparam = 0; bset->dim->n_out = nparam; bset = isl_basic_set_preimage(bset, mat); if (bset) { bset->dim->nparam = bset->dim->n_out; bset->dim->n_out = 0; } return bset; error: isl_mat_free(mat); isl_basic_set_free(bset); return NULL; } /* Apply a preimage specified by "mat" on the parameters of "set". * set is assumed to have only parameters and divs. */ static struct isl_set *set_parameter_preimage( struct isl_set *set, struct isl_mat *mat) { isl_space *dim = NULL; unsigned nparam; if (!set || !mat) goto error; dim = isl_space_copy(set->dim); dim = isl_space_cow(dim); if (!dim) goto error; nparam = isl_set_dim(set, isl_dim_param); isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error); dim->nparam = 0; dim->n_out = nparam; isl_set_reset_space(set, dim); set = isl_set_preimage(set, mat); if (!set) goto error2; dim = isl_space_copy(set->dim); dim = isl_space_cow(dim); if (!dim) goto error2; dim->nparam = dim->n_out; dim->n_out = 0; isl_set_reset_space(set, dim); return set; error: isl_space_free(dim); isl_mat_free(mat); error2: isl_set_free(set); return NULL; } /* Intersect the basic set "bset" with the affine space specified by the * equalities in "eq". */ static struct isl_basic_set *basic_set_append_equalities( struct isl_basic_set *bset, struct isl_mat *eq) { int i, k; unsigned len; if (!bset || !eq) goto error; bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0, eq->n_row, 0); if (!bset) goto error; len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra; for (i = 0; i < eq->n_row; ++i) { k = isl_basic_set_alloc_equality(bset); if (k < 0) goto error; isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col); isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col); } isl_mat_free(eq); bset = isl_basic_set_gauss(bset, NULL); bset = isl_basic_set_finalize(bset); return bset; error: isl_mat_free(eq); isl_basic_set_free(bset); return NULL; } /* Intersect the set "set" with the affine space specified by the * equalities in "eq". */ static struct isl_set *set_append_equalities(struct isl_set *set, struct isl_mat *eq) { int i; if (!set || !eq) goto error; for (i = 0; i < set->n; ++i) { set->p[i] = basic_set_append_equalities(set->p[i], isl_mat_copy(eq)); if (!set->p[i]) goto error; } isl_mat_free(eq); return set; error: isl_mat_free(eq); isl_set_free(set); return NULL; } /* Given a basic set "bset" that only involves parameters and existentially * quantified variables, return the index of the first equality * that only involves parameters. If there is no such equality then * return bset->n_eq. * * This function assumes that isl_basic_set_gauss has been called on "bset". */ static int first_parameter_equality(__isl_keep isl_basic_set *bset) { int i, j; unsigned nparam, n_div; if (!bset) return -1; nparam = isl_basic_set_dim(bset, isl_dim_param); n_div = isl_basic_set_dim(bset, isl_dim_div); for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) { if (!isl_int_is_zero(bset->eq[i][1 + nparam + j])) ++i; } return i; } /* Compute an explicit representation for the existentially quantified * variables in "bset" by computing the "minimal value" of the set * variables. Since there are no set variables, the computation of * the minimal value essentially computes an explicit representation * of the non-empty part(s) of "bset". * * The input only involves parameters and existentially quantified variables. * All equalities among parameters have been removed. * * Since the existentially quantified variables in the result are in general * going to be different from those in the input, we first replace * them by the minimal number of variables based on their equalities. * This should simplify the parametric integer programming. */ static __isl_give isl_set *base_compute_divs(__isl_take isl_basic_set *bset) { isl_morph *morph1, *morph2; isl_set *set; unsigned n; if (!bset) return NULL; if (bset->n_eq == 0) return isl_basic_set_lexmin(bset); morph1 = isl_basic_set_parameter_compression(bset); bset = isl_morph_basic_set(isl_morph_copy(morph1), bset); bset = isl_basic_set_lift(bset); morph2 = isl_basic_set_variable_compression(bset, isl_dim_set); bset = isl_morph_basic_set(morph2, bset); n = isl_basic_set_dim(bset, isl_dim_set); bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n); set = isl_basic_set_lexmin(bset); set = isl_morph_set(isl_morph_inverse(morph1), set); return set; } /* Project the given basic set onto its parameter domain, possibly introducing * new, explicit, existential variables in the constraints. * The input has parameters and (possibly implicit) existential variables. * The output has the same parameters, but only * explicit existentially quantified variables. * * The actual projection is performed by pip, but pip doesn't seem * to like equalities very much, so we first remove the equalities * among the parameters by performing a variable compression on * the parameters. Afterward, an inverse transformation is performed * and the equalities among the parameters are inserted back in. * * The variable compression on the parameters may uncover additional * equalities that were only implicit before. We therefore check * if there are any new parameter equalities in the result and * if so recurse. The removal of parameter equalities is required * for the parameter compression performed by base_compute_divs. */ static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset) { int i; struct isl_mat *eq; struct isl_mat *T, *T2; struct isl_set *set; unsigned nparam; bset = isl_basic_set_cow(bset); if (!bset) return NULL; if (bset->n_eq == 0) return base_compute_divs(bset); bset = isl_basic_set_gauss(bset, NULL); if (!bset) return NULL; if (isl_basic_set_plain_is_empty(bset)) return isl_set_from_basic_set(bset); i = first_parameter_equality(bset); if (i == bset->n_eq) return base_compute_divs(bset); nparam = isl_basic_set_dim(bset, isl_dim_param); eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i, 0, 1 + nparam); eq = isl_mat_cow(eq); T = isl_mat_variable_compression(isl_mat_copy(eq), &T2); if (T && T->n_col == 0) { isl_mat_free(T); isl_mat_free(T2); isl_mat_free(eq); bset = isl_basic_set_set_to_empty(bset); return isl_set_from_basic_set(bset); } bset = basic_set_parameter_preimage(bset, T); i = first_parameter_equality(bset); if (!bset) set = NULL; else if (i == bset->n_eq) set = base_compute_divs(bset); else set = parameter_compute_divs(bset); set = set_parameter_preimage(set, T2); set = set_append_equalities(set, eq); return set; } /* Insert the divs from "ls" before those of "bmap". * * The number of columns is not changed, which means that the last * dimensions of "bmap" are being reintepreted as the divs from "ls". * The caller is responsible for removing the same number of dimensions * from the space of "bmap". */ static __isl_give isl_basic_map *insert_divs_from_local_space( __isl_take isl_basic_map *bmap, __isl_keep isl_local_space *ls) { int i; int n_div; int old_n_div; n_div = isl_local_space_dim(ls, isl_dim_div); if (n_div == 0) return bmap; old_n_div = bmap->n_div; bmap = insert_div_rows(bmap, n_div); if (!bmap) return NULL; for (i = 0; i < n_div; ++i) { isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col); isl_seq_clr(bmap->div[i] + ls->div->n_col, old_n_div); } return bmap; } /* Replace the space of "bmap" by the space and divs of "ls". * * If "ls" has any divs, then we simplify the result since we may * have discovered some additional equalities that could simplify * the div expressions. */ static __isl_give isl_basic_map *basic_replace_space_by_local_space( __isl_take isl_basic_map *bmap, __isl_take isl_local_space *ls) { int n_div; bmap = isl_basic_map_cow(bmap); if (!bmap || !ls) goto error; n_div = isl_local_space_dim(ls, isl_dim_div); bmap = insert_divs_from_local_space(bmap, ls); if (!bmap) goto error; isl_space_free(bmap->dim); bmap->dim = isl_local_space_get_space(ls); if (!bmap->dim) goto error; isl_local_space_free(ls); if (n_div > 0) bmap = isl_basic_map_simplify(bmap); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); isl_local_space_free(ls); return NULL; } /* Replace the space of "map" by the space and divs of "ls". */ static __isl_give isl_map *replace_space_by_local_space(__isl_take isl_map *map, __isl_take isl_local_space *ls) { int i; map = isl_map_cow(map); if (!map || !ls) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = basic_replace_space_by_local_space(map->p[i], isl_local_space_copy(ls)); if (!map->p[i]) goto error; } isl_space_free(map->dim); map->dim = isl_local_space_get_space(ls); if (!map->dim) goto error; isl_local_space_free(ls); return map; error: isl_local_space_free(ls); isl_map_free(map); return NULL; } /* Compute an explicit representation for the existentially * quantified variables for which do not know any explicit representation yet. * * We first sort the existentially quantified variables so that the * existentially quantified variables for which we already have an explicit * representation are placed before those for which we do not. * The input dimensions, the output dimensions and the existentially * quantified variables for which we already have an explicit * representation are then turned into parameters. * compute_divs returns a map with the same parameters and * no input or output dimensions and the dimension specification * is reset to that of the input, including the existentially quantified * variables for which we already had an explicit representation. */ static struct isl_map *compute_divs(struct isl_basic_map *bmap) { struct isl_basic_set *bset; struct isl_set *set; struct isl_map *map; isl_space *dim; isl_local_space *ls; unsigned nparam; unsigned n_in; unsigned n_out; unsigned n_known; int i; bmap = isl_basic_map_sort_divs(bmap); bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; for (n_known = 0; n_known < bmap->n_div; ++n_known) if (isl_int_is_zero(bmap->div[n_known][0])) break; nparam = isl_basic_map_dim(bmap, isl_dim_param); n_in = isl_basic_map_dim(bmap, isl_dim_in); n_out = isl_basic_map_dim(bmap, isl_dim_out); dim = isl_space_set_alloc(bmap->ctx, nparam + n_in + n_out + n_known, 0); if (!dim) goto error; ls = isl_basic_map_get_local_space(bmap); ls = isl_local_space_drop_dims(ls, isl_dim_div, n_known, bmap->n_div - n_known); if (n_known > 0) { for (i = n_known; i < bmap->n_div; ++i) swap_div(bmap, i - n_known, i); bmap->n_div -= n_known; bmap->extra -= n_known; } bmap = isl_basic_map_reset_space(bmap, dim); bset = (struct isl_basic_set *)bmap; set = parameter_compute_divs(bset); map = (struct isl_map *)set; map = replace_space_by_local_space(map, ls); return map; error: isl_basic_map_free(bmap); return NULL; } int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap) { int i; unsigned off; if (!bmap) return -1; off = isl_space_dim(bmap->dim, isl_dim_all); for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) return 0; isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]), return -1); } return 1; } static int map_divs_known(__isl_keep isl_map *map) { int i; if (!map) return -1; for (i = 0; i < map->n; ++i) { int known = isl_basic_map_divs_known(map->p[i]); if (known <= 0) return known; } return 1; } /* If bmap contains any unknown divs, then compute explicit * expressions for them. However, this computation may be * quite expensive, so first try to remove divs that aren't * strictly needed. */ struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap) { int known; struct isl_map *map; known = isl_basic_map_divs_known(bmap); if (known < 0) goto error; if (known) return isl_map_from_basic_map(bmap); bmap = isl_basic_map_drop_redundant_divs(bmap); known = isl_basic_map_divs_known(bmap); if (known < 0) goto error; if (known) return isl_map_from_basic_map(bmap); map = compute_divs(bmap); return map; error: isl_basic_map_free(bmap); return NULL; } struct isl_map *isl_map_compute_divs(struct isl_map *map) { int i; int known; struct isl_map *res; if (!map) return NULL; if (map->n == 0) return map; known = map_divs_known(map); if (known < 0) { isl_map_free(map); return NULL; } if (known) return map; res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0])); for (i = 1 ; i < map->n; ++i) { struct isl_map *r2; r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i])); if (ISL_F_ISSET(map, ISL_MAP_DISJOINT)) res = isl_map_union_disjoint(res, r2); else res = isl_map_union(res, r2); } isl_map_free(map); return res; } struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset) { return (struct isl_set *) isl_basic_map_compute_divs((struct isl_basic_map *)bset); } struct isl_set *isl_set_compute_divs(struct isl_set *set) { return (struct isl_set *) isl_map_compute_divs((struct isl_map *)set); } struct isl_set *isl_map_domain(struct isl_map *map) { int i; struct isl_set *set; if (!map) goto error; map = isl_map_cow(map); if (!map) return NULL; set = (struct isl_set *)map; set->dim = isl_space_domain(set->dim); if (!set->dim) goto error; for (i = 0; i < map->n; ++i) { set->p[i] = isl_basic_map_domain(map->p[i]); if (!set->p[i]) goto error; } ISL_F_CLR(set, ISL_MAP_DISJOINT); ISL_F_CLR(set, ISL_SET_NORMALIZED); return set; error: isl_map_free(map); return NULL; } /* Return the union of "map1" and "map2", where we assume for now that * "map1" and "map2" are disjoint. Note that the basic maps inside * "map1" or "map2" may not be disjoint from each other. * Also note that this function is also called from isl_map_union, * which takes care of handling the situation where "map1" and "map2" * may not be disjoint. * * If one of the inputs is empty, we can simply return the other input. * Similarly, if one of the inputs is universal, then it is equal to the union. */ static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1, __isl_take isl_map *map2) { int i; unsigned flags = 0; struct isl_map *map = NULL; int is_universe; if (!map1 || !map2) goto error; if (map1->n == 0) { isl_map_free(map1); return map2; } if (map2->n == 0) { isl_map_free(map2); return map1; } is_universe = isl_map_plain_is_universe(map1); if (is_universe < 0) goto error; if (is_universe) { isl_map_free(map2); return map1; } is_universe = isl_map_plain_is_universe(map2); if (is_universe < 0) goto error; if (is_universe) { isl_map_free(map1); return map2; } isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error); if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) && ISL_F_ISSET(map2, ISL_MAP_DISJOINT)) ISL_FL_SET(flags, ISL_MAP_DISJOINT); map = isl_map_alloc_space(isl_space_copy(map1->dim), map1->n + map2->n, flags); if (!map) goto error; for (i = 0; i < map1->n; ++i) { map = isl_map_add_basic_map(map, isl_basic_map_copy(map1->p[i])); if (!map) goto error; } for (i = 0; i < map2->n; ++i) { map = isl_map_add_basic_map(map, isl_basic_map_copy(map2->p[i])); if (!map) goto error; } isl_map_free(map1); isl_map_free(map2); return map; error: isl_map_free(map); isl_map_free(map1); isl_map_free(map2); return NULL; } __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint); } struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2) { map1 = isl_map_union_disjoint(map1, map2); if (!map1) return NULL; if (map1->n > 1) ISL_F_CLR(map1, ISL_MAP_DISJOINT); return map1; } struct isl_set *isl_set_union_disjoint( struct isl_set *set1, struct isl_set *set2) { return (struct isl_set *) isl_map_union_disjoint( (struct isl_map *)set1, (struct isl_map *)set2); } struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2) { return (struct isl_set *) isl_map_union((struct isl_map *)set1, (struct isl_map *)set2); } /* Apply "fn" to pairs of elements from "map" and "set" and collect * the results. * * "map" and "set" are assumed to be compatible and non-NULL. */ static __isl_give isl_map *map_intersect_set(__isl_take isl_map *map, __isl_take isl_set *set, __isl_give isl_basic_map *fn(__isl_take isl_basic_map *bmap, __isl_take isl_basic_set *bset)) { unsigned flags = 0; struct isl_map *result; int i, j; if (isl_set_plain_is_universe(set)) { isl_set_free(set); return map; } if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) && ISL_F_ISSET(set, ISL_MAP_DISJOINT)) ISL_FL_SET(flags, ISL_MAP_DISJOINT); result = isl_map_alloc_space(isl_space_copy(map->dim), map->n * set->n, flags); for (i = 0; result && i < map->n; ++i) for (j = 0; j < set->n; ++j) { result = isl_map_add_basic_map(result, fn(isl_basic_map_copy(map->p[i]), isl_basic_set_copy(set->p[j]))); if (!result) break; } isl_map_free(map); isl_set_free(set); return result; } static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map, __isl_take isl_set *set) { if (!map || !set) goto error; if (!isl_map_compatible_range(map, set)) isl_die(set->ctx, isl_error_invalid, "incompatible spaces", goto error); return map_intersect_set(map, set, &isl_basic_map_intersect_range); error: isl_map_free(map); isl_set_free(set); return NULL; } __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map, __isl_take isl_set *set) { return isl_map_align_params_map_map_and(map, set, &map_intersect_range); } static __isl_give isl_map *map_intersect_domain(__isl_take isl_map *map, __isl_take isl_set *set) { if (!map || !set) goto error; if (!isl_map_compatible_domain(map, set)) isl_die(set->ctx, isl_error_invalid, "incompatible spaces", goto error); return map_intersect_set(map, set, &isl_basic_map_intersect_domain); error: isl_map_free(map); isl_set_free(set); return NULL; } __isl_give isl_map *isl_map_intersect_domain(__isl_take isl_map *map, __isl_take isl_set *set) { return isl_map_align_params_map_map_and(map, set, &map_intersect_domain); } static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1, __isl_take isl_map *map2) { if (!map1 || !map2) goto error; map1 = isl_map_reverse(map1); map1 = isl_map_apply_range(map1, map2); return isl_map_reverse(map1); error: isl_map_free(map1); isl_map_free(map2); return NULL; } __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain); } static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_space *dim_result; struct isl_map *result; int i, j; if (!map1 || !map2) goto error; dim_result = isl_space_join(isl_space_copy(map1->dim), isl_space_copy(map2->dim)); result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0); if (!result) goto error; for (i = 0; i < map1->n; ++i) for (j = 0; j < map2->n; ++j) { result = isl_map_add_basic_map(result, isl_basic_map_apply_range( isl_basic_map_copy(map1->p[i]), isl_basic_map_copy(map2->p[j]))); if (!result) goto error; } isl_map_free(map1); isl_map_free(map2); if (result && result->n <= 1) ISL_F_SET(result, ISL_MAP_DISJOINT); return result; error: isl_map_free(map1); isl_map_free(map2); return NULL; } __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_apply_range); } /* * returns range - domain */ struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap) { isl_space *dims, *target_dim; struct isl_basic_set *bset; unsigned dim; unsigned nparam; int i; if (!bmap) goto error; isl_assert(bmap->ctx, isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out), goto error); target_dim = isl_space_domain(isl_basic_map_get_space(bmap)); dim = isl_basic_map_n_in(bmap); nparam = isl_basic_map_n_param(bmap); bset = isl_basic_set_from_basic_map(bmap); bset = isl_basic_set_cow(bset); dims = isl_basic_set_get_space(bset); dims = isl_space_add_dims(dims, isl_dim_set, dim); bset = isl_basic_set_extend_space(bset, dims, 0, dim, 0); bset = isl_basic_set_swap_vars(bset, 2*dim); for (i = 0; i < dim; ++i) { int j = isl_basic_map_alloc_equality( (struct isl_basic_map *)bset); if (j < 0) { bset = isl_basic_set_free(bset); break; } isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset)); isl_int_set_si(bset->eq[j][1+nparam+i], 1); isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1); isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1); } bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim); bset = isl_basic_set_reset_space(bset, target_dim); return bset; error: isl_basic_map_free(bmap); return NULL; } /* * returns range - domain */ __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map) { int i; isl_space *dim; struct isl_set *result; if (!map) return NULL; isl_assert(map->ctx, isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out), goto error); dim = isl_map_get_space(map); dim = isl_space_domain(dim); result = isl_set_alloc_space(dim, map->n, 0); if (!result) goto error; for (i = 0; i < map->n; ++i) result = isl_set_add_basic_set(result, isl_basic_map_deltas(isl_basic_map_copy(map->p[i]))); isl_map_free(map); return result; error: isl_map_free(map); return NULL; } /* * returns [domain -> range] -> range - domain */ __isl_give isl_basic_map *isl_basic_map_deltas_map( __isl_take isl_basic_map *bmap) { int i, k; isl_space *dim; isl_basic_map *domain; int nparam, n; unsigned total; if (!isl_space_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out)) isl_die(bmap->ctx, isl_error_invalid, "domain and range don't match", goto error); nparam = isl_basic_map_dim(bmap, isl_dim_param); n = isl_basic_map_dim(bmap, isl_dim_in); dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap))); domain = isl_basic_map_universe(dim); bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap)); bmap = isl_basic_map_apply_range(bmap, domain); bmap = isl_basic_map_extend_constraints(bmap, n, 0); total = isl_basic_map_total_dim(bmap); for (i = 0; i < n; ++i) { k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->eq[k], 1 + total); isl_int_set_si(bmap->eq[k][1 + nparam + i], 1); isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1); isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1); } bmap = isl_basic_map_gauss(bmap, NULL); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } /* * returns [domain -> range] -> range - domain */ __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map) { int i; isl_space *domain_dim; if (!map) return NULL; if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out)) isl_die(map->ctx, isl_error_invalid, "domain and range don't match", goto error); map = isl_map_cow(map); if (!map) return NULL; domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map))); map->dim = isl_space_from_domain(isl_space_wrap(map->dim)); map->dim = isl_space_join(map->dim, domain_dim); if (!map->dim) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_deltas_map(map->p[i]); if (!map->p[i]) goto error; } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; error: isl_map_free(map); return NULL; } static __isl_give isl_basic_map *basic_map_identity(__isl_take isl_space *dims) { struct isl_basic_map *bmap; unsigned nparam; unsigned dim; int i; if (!dims) return NULL; nparam = dims->nparam; dim = dims->n_out; bmap = isl_basic_map_alloc_space(dims, 0, dim, 0); if (!bmap) goto error; for (i = 0; i < dim; ++i) { int j = isl_basic_map_alloc_equality(bmap); if (j < 0) goto error; isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap)); isl_int_set_si(bmap->eq[j][1+nparam+i], 1); isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1); } return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim) { if (!dim) return NULL; if (dim->n_in != dim->n_out) isl_die(dim->ctx, isl_error_invalid, "number of input and output dimensions needs to be " "the same", goto error); return basic_map_identity(dim); error: isl_space_free(dim); return NULL; } struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model) { if (!model || !model->dim) return NULL; return isl_basic_map_identity(isl_space_copy(model->dim)); } __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim) { return isl_map_from_basic_map(isl_basic_map_identity(dim)); } struct isl_map *isl_map_identity_like(struct isl_map *model) { if (!model || !model->dim) return NULL; return isl_map_identity(isl_space_copy(model->dim)); } struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model) { if (!model || !model->dim) return NULL; return isl_map_identity(isl_space_copy(model->dim)); } __isl_give isl_map *isl_set_identity(__isl_take isl_set *set) { isl_space *dim = isl_set_get_space(set); isl_map *id; id = isl_map_identity(isl_space_map_from_set(dim)); return isl_map_intersect_range(id, set); } /* Construct a basic set with all set dimensions having only non-negative * values. */ __isl_give isl_basic_set *isl_basic_set_positive_orthant( __isl_take isl_space *space) { int i; unsigned nparam; unsigned dim; struct isl_basic_set *bset; if (!space) return NULL; nparam = space->nparam; dim = space->n_out; bset = isl_basic_set_alloc_space(space, 0, 0, dim); if (!bset) return NULL; for (i = 0; i < dim; ++i) { int k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset)); isl_int_set_si(bset->ineq[k][1 + nparam + i], 1); } return bset; error: isl_basic_set_free(bset); return NULL; } /* Construct the half-space x_pos >= 0. */ static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim, int pos) { int k; isl_basic_set *nonneg; nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1); k = isl_basic_set_alloc_inequality(nonneg); if (k < 0) goto error; isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg)); isl_int_set_si(nonneg->ineq[k][pos], 1); return isl_basic_set_finalize(nonneg); error: isl_basic_set_free(nonneg); return NULL; } /* Construct the half-space x_pos <= -1. */ static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos) { int k; isl_basic_set *neg; neg = isl_basic_set_alloc_space(dim, 0, 0, 1); k = isl_basic_set_alloc_inequality(neg); if (k < 0) goto error; isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg)); isl_int_set_si(neg->ineq[k][0], -1); isl_int_set_si(neg->ineq[k][pos], -1); return isl_basic_set_finalize(neg); error: isl_basic_set_free(neg); return NULL; } __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set, enum isl_dim_type type, unsigned first, unsigned n) { int i; isl_basic_set *nonneg; isl_basic_set *neg; if (!set) return NULL; if (n == 0) return set; isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error); for (i = 0; i < n; ++i) { nonneg = nonneg_halfspace(isl_set_get_space(set), pos(set->dim, type) + first + i); neg = neg_halfspace(isl_set_get_space(set), pos(set->dim, type) + first + i); set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg)); } return set; error: isl_set_free(set); return NULL; } static int foreach_orthant(__isl_take isl_set *set, int *signs, int first, int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user), void *user) { isl_set *half; if (!set) return -1; if (isl_set_plain_is_empty(set)) { isl_set_free(set); return 0; } if (first == len) return fn(set, signs, user); signs[first] = 1; half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set), 1 + first)); half = isl_set_intersect(half, isl_set_copy(set)); if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0) goto error; signs[first] = -1; half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set), 1 + first)); half = isl_set_intersect(half, set); return foreach_orthant(half, signs, first + 1, len, fn, user); error: isl_set_free(set); return -1; } /* Call "fn" on the intersections of "set" with each of the orthants * (except for obviously empty intersections). The orthant is identified * by the signs array, with each entry having value 1 or -1 according * to the sign of the corresponding variable. */ int isl_set_foreach_orthant(__isl_keep isl_set *set, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user), void *user) { unsigned nparam; unsigned nvar; int *signs; int r; if (!set) return -1; if (isl_set_plain_is_empty(set)) return 0; nparam = isl_set_dim(set, isl_dim_param); nvar = isl_set_dim(set, isl_dim_set); signs = isl_alloc_array(set->ctx, int, nparam + nvar); r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar, fn, user); free(signs); return r; } int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2) { return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2); } int isl_basic_map_is_subset( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { int is_subset; struct isl_map *map1; struct isl_map *map2; if (!bmap1 || !bmap2) return -1; map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1)); map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2)); is_subset = isl_map_is_subset(map1, map2); isl_map_free(map1); isl_map_free(map2); return is_subset; } int isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2) { return isl_basic_map_is_subset(bset1, bset2); } int isl_basic_map_is_equal( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { int is_subset; if (!bmap1 || !bmap2) return -1; is_subset = isl_basic_map_is_subset(bmap1, bmap2); if (is_subset != 1) return is_subset; is_subset = isl_basic_map_is_subset(bmap2, bmap1); return is_subset; } int isl_basic_set_is_equal( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { return isl_basic_map_is_equal( (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2); } int isl_map_is_empty(struct isl_map *map) { int i; int is_empty; if (!map) return -1; for (i = 0; i < map->n; ++i) { is_empty = isl_basic_map_is_empty(map->p[i]); if (is_empty < 0) return -1; if (!is_empty) return 0; } return 1; } int isl_map_plain_is_empty(__isl_keep isl_map *map) { return map ? map->n == 0 : -1; } int isl_map_fast_is_empty(__isl_keep isl_map *map) { return isl_map_plain_is_empty(map); } int isl_set_plain_is_empty(struct isl_set *set) { return set ? set->n == 0 : -1; } int isl_set_fast_is_empty(__isl_keep isl_set *set) { return isl_set_plain_is_empty(set); } int isl_set_is_empty(struct isl_set *set) { return isl_map_is_empty((struct isl_map *)set); } int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { if (!map1 || !map2) return -1; return isl_space_is_equal(map1->dim, map2->dim); } int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { if (!set1 || !set2) return -1; return isl_space_is_equal(set1->dim, set2->dim); } static int map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int is_subset; if (!map1 || !map2) return -1; is_subset = isl_map_is_subset(map1, map2); if (is_subset != 1) return is_subset; is_subset = isl_map_is_subset(map2, map1); return is_subset; } int isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal); } int isl_basic_map_is_strict_subset( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { int is_subset; if (!bmap1 || !bmap2) return -1; is_subset = isl_basic_map_is_subset(bmap1, bmap2); if (is_subset != 1) return is_subset; is_subset = isl_basic_map_is_subset(bmap2, bmap1); if (is_subset == -1) return is_subset; return !is_subset; } int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2) { int is_subset; if (!map1 || !map2) return -1; is_subset = isl_map_is_subset(map1, map2); if (is_subset != 1) return is_subset; is_subset = isl_map_is_subset(map2, map1); if (is_subset == -1) return is_subset; return !is_subset; } int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2); } int isl_basic_map_is_universe(struct isl_basic_map *bmap) { if (!bmap) return -1; return bmap->n_eq == 0 && bmap->n_ineq == 0; } int isl_basic_set_is_universe(struct isl_basic_set *bset) { if (!bset) return -1; return bset->n_eq == 0 && bset->n_ineq == 0; } int isl_map_plain_is_universe(__isl_keep isl_map *map) { int i; if (!map) return -1; for (i = 0; i < map->n; ++i) { int r = isl_basic_map_is_universe(map->p[i]); if (r < 0 || r) return r; } return 0; } int isl_set_plain_is_universe(__isl_keep isl_set *set) { return isl_map_plain_is_universe((isl_map *) set); } int isl_set_fast_is_universe(__isl_keep isl_set *set) { return isl_set_plain_is_universe(set); } int isl_basic_map_is_empty(struct isl_basic_map *bmap) { struct isl_basic_set *bset = NULL; struct isl_vec *sample = NULL; int empty; unsigned total; if (!bmap) return -1; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) return 1; if (isl_basic_map_is_universe(bmap)) return 0; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) { struct isl_basic_map *copy = isl_basic_map_copy(bmap); copy = isl_basic_map_remove_redundancies(copy); empty = isl_basic_map_plain_is_empty(copy); isl_basic_map_free(copy); return empty; } total = 1 + isl_basic_map_total_dim(bmap); if (bmap->sample && bmap->sample->size == total) { int contains = isl_basic_map_contains(bmap, bmap->sample); if (contains < 0) return -1; if (contains) return 0; } isl_vec_free(bmap->sample); bmap->sample = NULL; bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap)); if (!bset) return -1; sample = isl_basic_set_sample_vec(bset); if (!sample) return -1; empty = sample->size == 0; isl_vec_free(bmap->sample); bmap->sample = sample; if (empty) ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY); return empty; } int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY); } int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap) { return isl_basic_map_plain_is_empty(bmap); } int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset) { if (!bset) return -1; return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY); } int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset) { return isl_basic_set_plain_is_empty(bset); } int isl_basic_set_is_empty(struct isl_basic_set *bset) { return isl_basic_map_is_empty((struct isl_basic_map *)bset); } struct isl_map *isl_basic_map_union( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { struct isl_map *map; if (!bmap1 || !bmap2) goto error; isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error); map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0); if (!map) goto error; map = isl_map_add_basic_map(map, bmap1); map = isl_map_add_basic_map(map, bmap2); return map; error: isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } struct isl_set *isl_basic_set_union( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { return (struct isl_set *)isl_basic_map_union( (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2); } /* Order divs such that any div only depends on previous divs */ struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap) { int i; unsigned off; if (!bmap) return NULL; off = isl_space_dim(bmap->dim, isl_dim_all); for (i = 0; i < bmap->n_div; ++i) { int pos; if (isl_int_is_zero(bmap->div[i][0])) continue; pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i, bmap->n_div-i); if (pos == -1) continue; isl_basic_map_swap_div(bmap, i, i + pos); --i; } return bmap; } struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_order_divs((struct isl_basic_map *)bset); } __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map) { int i; if (!map) return 0; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_order_divs(map->p[i]); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } /* Apply the expansion computed by isl_merge_divs. * The expansion itself is given by "exp" while the resulting * list of divs is given by "div". */ __isl_give isl_basic_set *isl_basic_set_expand_divs( __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp) { int i, j; int n_div; bset = isl_basic_set_cow(bset); if (!bset || !div) goto error; if (div->n_row < bset->n_div) isl_die(isl_mat_get_ctx(div), isl_error_invalid, "not an expansion", goto error); n_div = bset->n_div; bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim), div->n_row - n_div, 0, 2 * (div->n_row - n_div)); for (i = n_div; i < div->n_row; ++i) if (isl_basic_set_alloc_div(bset) < 0) goto error; j = n_div - 1; for (i = div->n_row - 1; i >= 0; --i) { if (j >= 0 && exp[j] == i) { if (i != j) isl_basic_map_swap_div(bset, i, j); j--; } else { isl_seq_cpy(bset->div[i], div->row[i], div->n_col); if (isl_basic_map_add_div_constraints(bset, i) < 0) goto error; } } isl_mat_free(div); return bset; error: isl_basic_set_free(bset); isl_mat_free(div); return NULL; } /* Look for a div in dst that corresponds to the div "div" in src. * The divs before "div" in src and dst are assumed to be the same. * * Returns -1 if no corresponding div was found and the position * of the corresponding div in dst otherwise. */ static int find_div(struct isl_basic_map *dst, struct isl_basic_map *src, unsigned div) { int i; unsigned total = isl_space_dim(src->dim, isl_dim_all); isl_assert(dst->ctx, div <= dst->n_div, return -1); for (i = div; i < dst->n_div; ++i) if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) && isl_seq_first_non_zero(dst->div[i]+1+1+total+div, dst->n_div - div) == -1) return i; return -1; } struct isl_basic_map *isl_basic_map_align_divs( struct isl_basic_map *dst, struct isl_basic_map *src) { int i; unsigned total; if (!dst || !src) goto error; if (src->n_div == 0) return dst; for (i = 0; i < src->n_div; ++i) isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error); src = isl_basic_map_order_divs(src); dst = isl_basic_map_cow(dst); if (!dst) return NULL; dst = isl_basic_map_extend_space(dst, isl_space_copy(dst->dim), src->n_div, 0, 2 * src->n_div); if (!dst) return NULL; total = isl_space_dim(src->dim, isl_dim_all); for (i = 0; i < src->n_div; ++i) { int j = find_div(dst, src, i); if (j < 0) { j = isl_basic_map_alloc_div(dst); if (j < 0) goto error; isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i); isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i); if (isl_basic_map_add_div_constraints(dst, j) < 0) goto error; } if (j != i) isl_basic_map_swap_div(dst, i, j); } return dst; error: isl_basic_map_free(dst); return NULL; } struct isl_basic_set *isl_basic_set_align_divs( struct isl_basic_set *dst, struct isl_basic_set *src) { return (struct isl_basic_set *)isl_basic_map_align_divs( (struct isl_basic_map *)dst, (struct isl_basic_map *)src); } struct isl_map *isl_map_align_divs(struct isl_map *map) { int i; if (!map) return NULL; if (map->n == 0) return map; map = isl_map_compute_divs(map); map = isl_map_cow(map); if (!map) return NULL; for (i = 1; i < map->n; ++i) map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]); for (i = 1; i < map->n; ++i) { map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]); if (!map->p[i]) return isl_map_free(map); } ISL_F_CLR(map, ISL_MAP_NORMALIZED); return map; } struct isl_set *isl_set_align_divs(struct isl_set *set) { return (struct isl_set *)isl_map_align_divs((struct isl_map *)set); } static __isl_give isl_set *set_apply( __isl_take isl_set *set, __isl_take isl_map *map) { if (!set || !map) goto error; isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error); map = isl_map_intersect_domain(map, set); set = isl_map_range(map); return set; error: isl_set_free(set); isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_apply( __isl_take isl_set *set, __isl_take isl_map *map) { return isl_map_align_params_map_map_and(set, map, &set_apply); } /* There is no need to cow as removing empty parts doesn't change * the meaning of the set. */ struct isl_map *isl_map_remove_empty_parts(struct isl_map *map) { int i; if (!map) return NULL; for (i = map->n - 1; i >= 0; --i) remove_if_empty(map, i); return map; } struct isl_set *isl_set_remove_empty_parts(struct isl_set *set) { return (struct isl_set *) isl_map_remove_empty_parts((struct isl_map *)set); } struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map) { struct isl_basic_map *bmap; if (!map || map->n == 0) return NULL; bmap = map->p[map->n-1]; isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL); return isl_basic_map_copy(bmap); } struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set) { return (struct isl_basic_set *) isl_map_copy_basic_map((struct isl_map *)set); } __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map, __isl_keep isl_basic_map *bmap) { int i; if (!map || !bmap) goto error; for (i = map->n-1; i >= 0; --i) { if (map->p[i] != bmap) continue; map = isl_map_cow(map); if (!map) goto error; isl_basic_map_free(map->p[i]); if (i != map->n-1) { ISL_F_CLR(map, ISL_SET_NORMALIZED); map->p[i] = map->p[map->n-1]; } map->n--; return map; } return map; error: isl_map_free(map); return NULL; } struct isl_set *isl_set_drop_basic_set(struct isl_set *set, struct isl_basic_set *bset) { return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set, (struct isl_basic_map *)bset); } /* Given two basic sets bset1 and bset2, compute the maximal difference * between the values of dimension pos in bset1 and those in bset2 * for any common value of the parameters and dimensions preceding pos. */ static enum isl_lp_result basic_set_maximal_difference_at( __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2, int pos, isl_int *opt) { isl_space *dims; struct isl_basic_map *bmap1 = NULL; struct isl_basic_map *bmap2 = NULL; struct isl_ctx *ctx; struct isl_vec *obj; unsigned total; unsigned nparam; unsigned dim1, dim2; enum isl_lp_result res; if (!bset1 || !bset2) return isl_lp_error; nparam = isl_basic_set_n_param(bset1); dim1 = isl_basic_set_n_dim(bset1); dim2 = isl_basic_set_n_dim(bset2); dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos); bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims); dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos); bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims); if (!bmap1 || !bmap2) goto error; bmap1 = isl_basic_map_cow(bmap1); bmap1 = isl_basic_map_extend(bmap1, nparam, pos, (dim1 - pos) + (dim2 - pos), bmap2->n_div, bmap2->n_eq, bmap2->n_ineq); bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos); if (!bmap1) goto error; total = isl_basic_map_total_dim(bmap1); ctx = bmap1->ctx; obj = isl_vec_alloc(ctx, 1 + total); if (!obj) goto error2; isl_seq_clr(obj->block.data, 1 + total); isl_int_set_si(obj->block.data[1+nparam+pos], 1); isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1); res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one, opt, NULL, NULL); isl_basic_map_free(bmap1); isl_vec_free(obj); return res; error: isl_basic_map_free(bmap2); error2: isl_basic_map_free(bmap1); return isl_lp_error; } /* Given two _disjoint_ basic sets bset1 and bset2, check whether * for any common value of the parameters and dimensions preceding pos * in both basic sets, the values of dimension pos in bset1 are * smaller or larger than those in bset2. * * Returns * 1 if bset1 follows bset2 * -1 if bset1 precedes bset2 * 0 if bset1 and bset2 are incomparable * -2 if some error occurred. */ int isl_basic_set_compare_at(struct isl_basic_set *bset1, struct isl_basic_set *bset2, int pos) { isl_int opt; enum isl_lp_result res; int cmp; isl_int_init(opt); res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt); if (res == isl_lp_empty) cmp = 0; else if ((res == isl_lp_ok && isl_int_is_pos(opt)) || res == isl_lp_unbounded) cmp = 1; else if (res == isl_lp_ok && isl_int_is_neg(opt)) cmp = -1; else cmp = -2; isl_int_clear(opt); return cmp; } /* Given two basic sets bset1 and bset2, check whether * for any common value of the parameters and dimensions preceding pos * there is a value of dimension pos in bset1 that is larger * than a value of the same dimension in bset2. * * Return * 1 if there exists such a pair * 0 if there is no such pair, but there is a pair of equal values * -1 otherwise * -2 if some error occurred. */ int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2, int pos) { isl_int opt; enum isl_lp_result res; int cmp; isl_int_init(opt); res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt); if (res == isl_lp_empty) cmp = -1; else if ((res == isl_lp_ok && isl_int_is_pos(opt)) || res == isl_lp_unbounded) cmp = 1; else if (res == isl_lp_ok && isl_int_is_neg(opt)) cmp = -1; else if (res == isl_lp_ok) cmp = 0; else cmp = -2; isl_int_clear(opt); return cmp; } /* Given two sets set1 and set2, check whether * for any common value of the parameters and dimensions preceding pos * there is a value of dimension pos in set1 that is larger * than a value of the same dimension in set2. * * Return * 1 if there exists such a pair * 0 if there is no such pair, but there is a pair of equal values * -1 otherwise * -2 if some error occurred. */ int isl_set_follows_at(__isl_keep isl_set *set1, __isl_keep isl_set *set2, int pos) { int i, j; int follows = -1; if (!set1 || !set2) return -2; for (i = 0; i < set1->n; ++i) for (j = 0; j < set2->n; ++j) { int f; f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos); if (f == 1 || f == -2) return f; if (f > follows) follows = f; } return follows; } static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap, unsigned pos, isl_int *val) { int i; int d; unsigned total; if (!bmap) return -1; total = isl_basic_map_total_dim(bmap); for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) { for (; d+1 > pos; --d) if (!isl_int_is_zero(bmap->eq[i][1+d])) break; if (d != pos) continue; if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1) return 0; if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1) return 0; if (!isl_int_is_one(bmap->eq[i][1+d])) return 0; if (val) isl_int_neg(*val, bmap->eq[i][0]); return 1; } return 0; } static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map, unsigned pos, isl_int *val) { int i; isl_int v; isl_int tmp; int fixed; if (!map) return -1; if (map->n == 0) return 0; if (map->n == 1) return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val); isl_int_init(v); isl_int_init(tmp); fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v); for (i = 1; fixed == 1 && i < map->n; ++i) { fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp); if (fixed == 1 && isl_int_ne(tmp, v)) fixed = 0; } if (val) isl_int_set(*val, v); isl_int_clear(tmp); isl_int_clear(v); return fixed; } static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset, unsigned pos, isl_int *val) { return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset, pos, val); } static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos, isl_int *val) { return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val); } int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, isl_int *val) { if (pos >= isl_basic_map_dim(bmap, type)) return -1; return isl_basic_map_plain_has_fixed_var(bmap, isl_basic_map_offset(bmap, type) - 1 + pos, val); } /* If "bmap" obviously lies on a hyperplane where the given dimension * has a fixed value, then return that value. * Otherwise return NaN. */ __isl_give isl_val *isl_basic_map_plain_get_val_if_fixed( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos) { isl_ctx *ctx; isl_val *v; int fixed; if (!bmap) return NULL; ctx = isl_basic_map_get_ctx(bmap); v = isl_val_alloc(ctx); if (!v) return NULL; fixed = isl_basic_map_plain_is_fixed(bmap, type, pos, &v->n); if (fixed < 0) return isl_val_free(v); if (fixed) { isl_int_set_si(v->d, 1); return v; } isl_val_free(v); return isl_val_nan(ctx); } int isl_map_plain_is_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_int *val) { if (pos >= isl_map_dim(map, type)) return -1; return isl_map_plain_has_fixed_var(map, map_offset(map, type) - 1 + pos, val); } /* If "map" obviously lies on a hyperplane where the given dimension * has a fixed value, then return that value. * Otherwise return NaN. */ __isl_give isl_val *isl_map_plain_get_val_if_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos) { isl_ctx *ctx; isl_val *v; int fixed; if (!map) return NULL; ctx = isl_map_get_ctx(map); v = isl_val_alloc(ctx); if (!v) return NULL; fixed = isl_map_plain_is_fixed(map, type, pos, &v->n); if (fixed < 0) return isl_val_free(v); if (fixed) { isl_int_set_si(v->d, 1); return v; } isl_val_free(v); return isl_val_nan(ctx); } /* If "set" obviously lies on a hyperplane where the given dimension * has a fixed value, then return that value. * Otherwise return NaN. */ __isl_give isl_val *isl_set_plain_get_val_if_fixed(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return isl_map_plain_get_val_if_fixed(set, type, pos); } int isl_set_plain_is_fixed(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos, isl_int *val) { return isl_map_plain_is_fixed(set, type, pos, val); } int isl_map_fast_is_fixed(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, isl_int *val) { return isl_map_plain_is_fixed(map, type, pos, val); } /* Check if dimension dim has fixed value and if so and if val is not NULL, * then return this fixed value in *val. */ int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset, unsigned dim, isl_int *val) { return isl_basic_set_plain_has_fixed_var(bset, isl_basic_set_n_param(bset) + dim, val); } /* Check if dimension dim has fixed value and if so and if val is not NULL, * then return this fixed value in *val. */ int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set, unsigned dim, isl_int *val) { return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val); } int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set, unsigned dim, isl_int *val) { return isl_set_plain_dim_is_fixed(set, dim, val); } /* Check if input variable in has fixed value and if so and if val is not NULL, * then return this fixed value in *val. */ int isl_map_plain_input_is_fixed(__isl_keep isl_map *map, unsigned in, isl_int *val) { return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val); } /* Check if dimension dim has an (obvious) fixed lower bound and if so * and if val is not NULL, then return this lower bound in *val. */ int isl_basic_set_plain_dim_has_fixed_lower_bound( __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val) { int i, i_eq = -1, i_ineq = -1; isl_int *c; unsigned total; unsigned nparam; if (!bset) return -1; total = isl_basic_set_total_dim(bset); nparam = isl_basic_set_n_param(bset); for (i = 0; i < bset->n_eq; ++i) { if (isl_int_is_zero(bset->eq[i][1+nparam+dim])) continue; if (i_eq != -1) return 0; i_eq = i; } for (i = 0; i < bset->n_ineq; ++i) { if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim])) continue; if (i_eq != -1 || i_ineq != -1) return 0; i_ineq = i; } if (i_eq == -1 && i_ineq == -1) return 0; c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq]; /* The coefficient should always be one due to normalization. */ if (!isl_int_is_one(c[1+nparam+dim])) return 0; if (isl_seq_first_non_zero(c+1, nparam+dim) != -1) return 0; if (isl_seq_first_non_zero(c+1+nparam+dim+1, total - nparam - dim - 1) != -1) return 0; if (val) isl_int_neg(*val, c[0]); return 1; } int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set, unsigned dim, isl_int *val) { int i; isl_int v; isl_int tmp; int fixed; if (!set) return -1; if (set->n == 0) return 0; if (set->n == 1) return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0], dim, val); isl_int_init(v); isl_int_init(tmp); fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0], dim, &v); for (i = 1; fixed == 1 && i < set->n; ++i) { fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i], dim, &tmp); if (fixed == 1 && isl_int_ne(tmp, v)) fixed = 0; } if (val) isl_int_set(*val, v); isl_int_clear(tmp); isl_int_clear(v); return fixed; } struct constraint { unsigned size; isl_int *c; }; /* uset_gist depends on constraints without existentially quantified * variables sorting first. */ static int qsort_constraint_cmp(const void *p1, const void *p2) { const struct constraint *c1 = (const struct constraint *)p1; const struct constraint *c2 = (const struct constraint *)p2; int l1, l2; unsigned size = isl_min(c1->size, c2->size); l1 = isl_seq_last_non_zero(c1->c + 1, size); l2 = isl_seq_last_non_zero(c2->c + 1, size); if (l1 != l2) return l1 - l2; return isl_seq_cmp(c1->c + 1, c2->c + 1, size); } static struct isl_basic_map *isl_basic_map_sort_constraints( struct isl_basic_map *bmap) { int i; struct constraint *c; unsigned total; if (!bmap) return NULL; if (bmap->n_ineq == 0) return bmap; total = isl_basic_map_total_dim(bmap); c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq); if (!c) goto error; for (i = 0; i < bmap->n_ineq; ++i) { c[i].size = total; c[i].c = bmap->ineq[i]; } qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp); for (i = 0; i < bmap->n_ineq; ++i) bmap->ineq[i] = c[i].c; free(c); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_sort_constraints( __isl_take isl_basic_set *bset) { return (struct isl_basic_set *)isl_basic_map_sort_constraints( (struct isl_basic_map *)bset); } struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap) { if (!bmap) return NULL; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED)) return bmap; bmap = isl_basic_map_remove_redundancies(bmap); bmap = isl_basic_map_sort_constraints(bmap); if (bmap) ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED); return bmap; } struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset) { return (struct isl_basic_set *)isl_basic_map_normalize( (struct isl_basic_map *)bset); } int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1, const __isl_keep isl_basic_map *bmap2) { int i, cmp; unsigned total; if (bmap1 == bmap2) return 0; if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) != ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL)) return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1; if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2)) return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2); if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2)) return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2); if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2)) return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2); if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) && ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY)) return 0; if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY)) return 1; if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY)) return -1; if (bmap1->n_eq != bmap2->n_eq) return bmap1->n_eq - bmap2->n_eq; if (bmap1->n_ineq != bmap2->n_ineq) return bmap1->n_ineq - bmap2->n_ineq; if (bmap1->n_div != bmap2->n_div) return bmap1->n_div - bmap2->n_div; total = isl_basic_map_total_dim(bmap1); for (i = 0; i < bmap1->n_eq; ++i) { cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total); if (cmp) return cmp; } for (i = 0; i < bmap1->n_ineq; ++i) { cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total); if (cmp) return cmp; } for (i = 0; i < bmap1->n_div; ++i) { cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total); if (cmp) return cmp; } return 0; } int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1, const __isl_keep isl_basic_set *bset2) { return isl_basic_map_plain_cmp(bset1, bset2); } int isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { int i, cmp; if (set1 == set2) return 0; if (set1->n != set2->n) return set1->n - set2->n; for (i = 0; i < set1->n; ++i) { cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]); if (cmp) return cmp; } return 0; } int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1, __isl_keep isl_basic_map *bmap2) { return isl_basic_map_plain_cmp(bmap1, bmap2) == 0; } int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2) { return isl_basic_map_plain_is_equal((isl_basic_map *)bset1, (isl_basic_map *)bset2); } static int qsort_bmap_cmp(const void *p1, const void *p2) { const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1; const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2; return isl_basic_map_plain_cmp(bmap1, bmap2); } /* We normalize in place, but if anything goes wrong we need * to return NULL, so we need to make sure we don't change the * meaning of any possible other copies of map. */ struct isl_map *isl_map_normalize(struct isl_map *map) { int i, j; struct isl_basic_map *bmap; if (!map) return NULL; if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED)) return map; for (i = 0; i < map->n; ++i) { bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i])); if (!bmap) goto error; isl_basic_map_free(map->p[i]); map->p[i] = bmap; } qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp); ISL_F_SET(map, ISL_MAP_NORMALIZED); map = isl_map_remove_empty_parts(map); if (!map) return NULL; for (i = map->n - 1; i >= 1; --i) { if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i])) continue; isl_basic_map_free(map->p[i-1]); for (j = i; j < map->n; ++j) map->p[j-1] = map->p[j]; map->n--; } return map; error: isl_map_free(map); return NULL; } struct isl_set *isl_set_normalize(struct isl_set *set) { return (struct isl_set *)isl_map_normalize((struct isl_map *)set); } int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { int i; int equal; if (!map1 || !map2) return -1; if (map1 == map2) return 1; if (!isl_space_is_equal(map1->dim, map2->dim)) return 0; map1 = isl_map_copy(map1); map2 = isl_map_copy(map2); map1 = isl_map_normalize(map1); map2 = isl_map_normalize(map2); if (!map1 || !map2) goto error; equal = map1->n == map2->n; for (i = 0; equal && i < map1->n; ++i) { equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]); if (equal < 0) goto error; } isl_map_free(map1); isl_map_free(map2); return equal; error: isl_map_free(map1); isl_map_free(map2); return -1; } int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2) { return isl_map_plain_is_equal(map1, map2); } int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_map_plain_is_equal((struct isl_map *)set1, (struct isl_map *)set2); } int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2) { return isl_set_plain_is_equal(set1, set2); } /* Return an interval that ranges from min to max (inclusive) */ struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx, isl_int min, isl_int max) { int k; struct isl_basic_set *bset = NULL; bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2); if (!bset) goto error; k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_int_set_si(bset->ineq[k][1], 1); isl_int_neg(bset->ineq[k][0], min); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_int_set_si(bset->ineq[k][1], -1); isl_int_set(bset->ineq[k][0], max); return bset; error: isl_basic_set_free(bset); return NULL; } /* Return the Cartesian product of the basic sets in list (in the given order). */ __isl_give isl_basic_set *isl_basic_set_list_product( __isl_take struct isl_basic_set_list *list) { int i; unsigned dim; unsigned nparam; unsigned extra; unsigned n_eq; unsigned n_ineq; struct isl_basic_set *product = NULL; if (!list) goto error; isl_assert(list->ctx, list->n > 0, goto error); isl_assert(list->ctx, list->p[0], goto error); nparam = isl_basic_set_n_param(list->p[0]); dim = isl_basic_set_n_dim(list->p[0]); extra = list->p[0]->n_div; n_eq = list->p[0]->n_eq; n_ineq = list->p[0]->n_ineq; for (i = 1; i < list->n; ++i) { isl_assert(list->ctx, list->p[i], goto error); isl_assert(list->ctx, nparam == isl_basic_set_n_param(list->p[i]), goto error); dim += isl_basic_set_n_dim(list->p[i]); extra += list->p[i]->n_div; n_eq += list->p[i]->n_eq; n_ineq += list->p[i]->n_ineq; } product = isl_basic_set_alloc(list->ctx, nparam, dim, extra, n_eq, n_ineq); if (!product) goto error; dim = 0; for (i = 0; i < list->n; ++i) { isl_basic_set_add_constraints(product, isl_basic_set_copy(list->p[i]), dim); dim += isl_basic_set_n_dim(list->p[i]); } isl_basic_set_list_free(list); return product; error: isl_basic_set_free(product); isl_basic_set_list_free(list); return NULL; } struct isl_basic_map *isl_basic_map_product( struct isl_basic_map *bmap1, struct isl_basic_map *bmap2) { isl_space *dim_result = NULL; struct isl_basic_map *bmap; unsigned in1, in2, out1, out2, nparam, total, pos; struct isl_dim_map *dim_map1, *dim_map2; if (!bmap1 || !bmap2) goto error; isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param, bmap2->dim, isl_dim_param), goto error); dim_result = isl_space_product(isl_space_copy(bmap1->dim), isl_space_copy(bmap2->dim)); in1 = isl_basic_map_n_in(bmap1); in2 = isl_basic_map_n_in(bmap2); out1 = isl_basic_map_n_out(bmap1); out2 = isl_basic_map_n_out(bmap2); nparam = isl_basic_map_n_param(bmap1); total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div; dim_map1 = isl_dim_map_alloc(bmap1->ctx, total); dim_map2 = isl_dim_map_alloc(bmap1->ctx, total); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1); isl_dim_map_div(dim_map1, bmap1, pos += out2); isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div); bmap = isl_basic_map_alloc_space(dim_result, bmap1->n_div + bmap2->n_div, bmap1->n_eq + bmap2->n_eq, bmap1->n_ineq + bmap2->n_ineq); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } __isl_give isl_basic_map *isl_basic_map_flat_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2) { isl_basic_map *prod; prod = isl_basic_map_product(bmap1, bmap2); prod = isl_basic_map_flatten(prod); return prod; } __isl_give isl_basic_set *isl_basic_set_flat_product( __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2) { return isl_basic_map_flat_range_product(bset1, bset2); } __isl_give isl_basic_map *isl_basic_map_domain_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2) { isl_space *space_result = NULL; isl_basic_map *bmap; unsigned in1, in2, out, nparam, total, pos; struct isl_dim_map *dim_map1, *dim_map2; if (!bmap1 || !bmap2) goto error; space_result = isl_space_domain_product(isl_space_copy(bmap1->dim), isl_space_copy(bmap2->dim)); in1 = isl_basic_map_dim(bmap1, isl_dim_in); in2 = isl_basic_map_dim(bmap2, isl_dim_in); out = isl_basic_map_dim(bmap1, isl_dim_out); nparam = isl_basic_map_dim(bmap1, isl_dim_param); total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div; dim_map1 = isl_dim_map_alloc(bmap1->ctx, total); dim_map2 = isl_dim_map_alloc(bmap1->ctx, total); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos); isl_dim_map_div(dim_map1, bmap1, pos += out); isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div); bmap = isl_basic_map_alloc_space(space_result, bmap1->n_div + bmap2->n_div, bmap1->n_eq + bmap2->n_eq, bmap1->n_ineq + bmap2->n_ineq); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } __isl_give isl_basic_map *isl_basic_map_range_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2) { isl_space *dim_result = NULL; isl_basic_map *bmap; unsigned in, out1, out2, nparam, total, pos; struct isl_dim_map *dim_map1, *dim_map2; if (!bmap1 || !bmap2) goto error; if (!isl_space_match(bmap1->dim, isl_dim_param, bmap2->dim, isl_dim_param)) isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid, "parameters don't match", goto error); dim_result = isl_space_range_product(isl_space_copy(bmap1->dim), isl_space_copy(bmap2->dim)); in = isl_basic_map_dim(bmap1, isl_dim_in); out1 = isl_basic_map_n_out(bmap1); out2 = isl_basic_map_n_out(bmap2); nparam = isl_basic_map_n_param(bmap1); total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div; dim_map1 = isl_dim_map_alloc(bmap1->ctx, total); dim_map2 = isl_dim_map_alloc(bmap1->ctx, total); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos); isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in); isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1); isl_dim_map_div(dim_map1, bmap1, pos += out2); isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div); bmap = isl_basic_map_alloc_space(dim_result, bmap1->n_div + bmap2->n_div, bmap1->n_eq + bmap2->n_eq, bmap1->n_ineq + bmap2->n_ineq); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1); bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); return NULL; } __isl_give isl_basic_map *isl_basic_map_flat_range_product( __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2) { isl_basic_map *prod; prod = isl_basic_map_range_product(bmap1, bmap2); prod = isl_basic_map_flatten_range(prod); return prod; } static __isl_give isl_map *map_product(__isl_take isl_map *map1, __isl_take isl_map *map2, __isl_give isl_space *(*dim_product)(__isl_take isl_space *left, __isl_take isl_space *right), __isl_give isl_basic_map *(*basic_map_product)( __isl_take isl_basic_map *left, __isl_take isl_basic_map *right)) { unsigned flags = 0; struct isl_map *result; int i, j; if (!map1 || !map2) goto error; isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param), goto error); if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) && ISL_F_ISSET(map2, ISL_MAP_DISJOINT)) ISL_FL_SET(flags, ISL_MAP_DISJOINT); result = isl_map_alloc_space(dim_product(isl_space_copy(map1->dim), isl_space_copy(map2->dim)), map1->n * map2->n, flags); if (!result) goto error; for (i = 0; i < map1->n; ++i) for (j = 0; j < map2->n; ++j) { struct isl_basic_map *part; part = basic_map_product(isl_basic_map_copy(map1->p[i]), isl_basic_map_copy(map2->p[j])); if (isl_basic_map_is_empty(part)) isl_basic_map_free(part); else result = isl_map_add_basic_map(result, part); if (!result) goto error; } isl_map_free(map1); isl_map_free(map2); return result; error: isl_map_free(map1); isl_map_free(map2); return NULL; } /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D] */ static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1, __isl_take isl_map *map2) { return map_product(map1, map2, &isl_space_product, &isl_basic_map_product); } __isl_give isl_map *isl_map_product(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned); } /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D) */ __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_map *prod; prod = isl_map_product(map1, map2); prod = isl_map_flatten(prod); return prod; } /* Given two set A and B, construct its Cartesian product A x B. */ struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2) { return isl_map_range_product(set1, set2); } __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1, __isl_take isl_set *set2) { return isl_map_flat_range_product(set1, set2); } /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D) */ static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1, __isl_take isl_map *map2) { return map_product(map1, map2, &isl_space_domain_product, &isl_basic_map_domain_product); } /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D] */ static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1, __isl_take isl_map *map2) { return map_product(map1, map2, &isl_space_range_product, &isl_basic_map_range_product); } __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_domain_product_aligned); } __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1, __isl_take isl_map *map2) { return isl_map_align_params_map_map_and(map1, map2, &map_range_product_aligned); } /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D) */ __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_map *prod; prod = isl_map_domain_product(map1, map2); prod = isl_map_flatten_domain(prod); return prod; } /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D) */ __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1, __isl_take isl_map *map2) { isl_map *prod; prod = isl_map_range_product(map1, map2); prod = isl_map_flatten_range(prod); return prod; } uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap) { int i; uint32_t hash = isl_hash_init(); unsigned total; if (!bmap) return 0; bmap = isl_basic_map_copy(bmap); bmap = isl_basic_map_normalize(bmap); if (!bmap) return 0; total = isl_basic_map_total_dim(bmap); isl_hash_byte(hash, bmap->n_eq & 0xFF); for (i = 0; i < bmap->n_eq; ++i) { uint32_t c_hash; c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total); isl_hash_hash(hash, c_hash); } isl_hash_byte(hash, bmap->n_ineq & 0xFF); for (i = 0; i < bmap->n_ineq; ++i) { uint32_t c_hash; c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total); isl_hash_hash(hash, c_hash); } isl_hash_byte(hash, bmap->n_div & 0xFF); for (i = 0; i < bmap->n_div; ++i) { uint32_t c_hash; if (isl_int_is_zero(bmap->div[i][0])) continue; isl_hash_byte(hash, i & 0xFF); c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total); isl_hash_hash(hash, c_hash); } isl_basic_map_free(bmap); return hash; } uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset) { return isl_basic_map_get_hash((isl_basic_map *)bset); } uint32_t isl_map_get_hash(__isl_keep isl_map *map) { int i; uint32_t hash; if (!map) return 0; map = isl_map_copy(map); map = isl_map_normalize(map); if (!map) return 0; hash = isl_hash_init(); for (i = 0; i < map->n; ++i) { uint32_t bmap_hash; bmap_hash = isl_basic_map_get_hash(map->p[i]); isl_hash_hash(hash, bmap_hash); } isl_map_free(map); return hash; } uint32_t isl_set_get_hash(__isl_keep isl_set *set) { return isl_map_get_hash((isl_map *)set); } /* Check if the value for dimension dim is completely determined * by the values of the other parameters and variables. * That is, check if dimension dim is involved in an equality. */ int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim) { int i; unsigned nparam; if (!bset) return -1; nparam = isl_basic_set_n_param(bset); for (i = 0; i < bset->n_eq; ++i) if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim])) return 1; return 0; } /* Check if the value for dimension dim is completely determined * by the values of the other parameters and variables. * That is, check if dimension dim is involved in an equality * for each of the subsets. */ int isl_set_dim_is_unique(struct isl_set *set, unsigned dim) { int i; if (!set) return -1; for (i = 0; i < set->n; ++i) { int unique; unique = isl_basic_set_dim_is_unique(set->p[i], dim); if (unique != 1) return unique; } return 1; } int isl_set_n_basic_set(__isl_keep isl_set *set) { return set ? set->n : 0; } int isl_map_foreach_basic_map(__isl_keep isl_map *map, int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user) { int i; if (!map) return -1; for (i = 0; i < map->n; ++i) if (fn(isl_basic_map_copy(map->p[i]), user) < 0) return -1; return 0; } int isl_set_foreach_basic_set(__isl_keep isl_set *set, int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user) { int i; if (!set) return -1; for (i = 0; i < set->n; ++i) if (fn(isl_basic_set_copy(set->p[i]), user) < 0) return -1; return 0; } __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset) { isl_space *dim; if (!bset) return NULL; bset = isl_basic_set_cow(bset); if (!bset) return NULL; dim = isl_basic_set_get_space(bset); dim = isl_space_lift(dim, bset->n_div); if (!dim) goto error; isl_space_free(bset->dim); bset->dim = dim; bset->extra -= bset->n_div; bset->n_div = 0; bset = isl_basic_set_finalize(bset); return bset; error: isl_basic_set_free(bset); return NULL; } __isl_give isl_set *isl_set_lift(__isl_take isl_set *set) { int i; isl_space *dim; unsigned n_div; set = isl_set_align_divs(set); if (!set) return NULL; set = isl_set_cow(set); if (!set) return NULL; n_div = set->p[0]->n_div; dim = isl_set_get_space(set); dim = isl_space_lift(dim, n_div); if (!dim) goto error; isl_space_free(set->dim); set->dim = dim; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_lift(set->p[i]); if (!set->p[i]) goto error; } return set; error: isl_set_free(set); return NULL; } __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set) { isl_space *dim; struct isl_basic_map *bmap; unsigned n_set; unsigned n_div; unsigned n_param; unsigned total; int i, k, l; set = isl_set_align_divs(set); if (!set) return NULL; dim = isl_set_get_space(set); if (set->n == 0 || set->p[0]->n_div == 0) { isl_set_free(set); return isl_map_identity(isl_space_map_from_set(dim)); } n_div = set->p[0]->n_div; dim = isl_space_map_from_set(dim); n_param = isl_space_dim(dim, isl_dim_param); n_set = isl_space_dim(dim, isl_dim_in); dim = isl_space_extend(dim, n_param, n_set, n_set + n_div); bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div); for (i = 0; i < n_set; ++i) bmap = var_equal(bmap, i); total = n_param + n_set + n_set + n_div; for (i = 0; i < n_div; ++i) { k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param); isl_seq_clr(bmap->ineq[k]+1+n_param, n_set); isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set, set->p[0]->div[i]+1+1+n_param, n_set + n_div); isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i], set->p[0]->div[i][0]); l = isl_basic_map_alloc_inequality(bmap); if (l < 0) goto error; isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total); isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0], set->p[0]->div[i][0]); isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1); } isl_set_free(set); bmap = isl_basic_map_simplify(bmap); bmap = isl_basic_map_finalize(bmap); return isl_map_from_basic_map(bmap); error: isl_set_free(set); isl_basic_map_free(bmap); return NULL; } int isl_basic_set_size(__isl_keep isl_basic_set *bset) { unsigned dim; int size = 0; if (!bset) return -1; dim = isl_basic_set_total_dim(bset); size += bset->n_eq * (1 + dim); size += bset->n_ineq * (1 + dim); size += bset->n_div * (2 + dim); return size; } int isl_set_size(__isl_keep isl_set *set) { int i; int size = 0; if (!set) return -1; for (i = 0; i < set->n; ++i) size += isl_basic_set_size(set->p[i]); return size; } /* Check if there is any lower bound (if lower == 0) and/or upper * bound (if upper == 0) on the specified dim. */ static int basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos, int lower, int upper) { int i; if (!bmap) return -1; isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1); pos += isl_basic_map_offset(bmap, type); for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (!isl_int_is_zero(bmap->div[i][1 + pos])) return 1; } for (i = 0; i < bmap->n_eq; ++i) if (!isl_int_is_zero(bmap->eq[i][pos])) return 1; for (i = 0; i < bmap->n_ineq; ++i) { int sgn = isl_int_sgn(bmap->ineq[i][pos]); if (sgn > 0) lower = 1; if (sgn < 0) upper = 1; } return lower && upper; } int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos) { return basic_map_dim_is_bounded(bmap, type, pos, 0, 0); } int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos) { return basic_map_dim_is_bounded(bmap, type, pos, 0, 1); } int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos) { return basic_map_dim_is_bounded(bmap, type, pos, 1, 0); } int isl_map_dim_is_bounded(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos) { int i; if (!map) return -1; for (i = 0; i < map->n; ++i) { int bounded; bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos); if (bounded < 0 || !bounded) return bounded; } return 1; } /* Return 1 if the specified dim is involved in both an upper bound * and a lower bound. */ int isl_set_dim_is_bounded(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return isl_map_dim_is_bounded((isl_map *)set, type, pos); } /* Does "map" have a bound (according to "fn") for any of its basic maps? */ static int has_any_bound(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, int (*fn)(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos)) { int i; if (!map) return -1; for (i = 0; i < map->n; ++i) { int bounded; bounded = fn(map->p[i], type, pos); if (bounded < 0 || bounded) return bounded; } return 0; } /* Return 1 if the specified dim is involved in any lower bound. */ int isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return has_any_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound); } /* Return 1 if the specified dim is involved in any upper bound. */ int isl_set_dim_has_any_upper_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return has_any_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound); } /* Does "map" have a bound (according to "fn") for all of its basic maps? */ static int has_bound(__isl_keep isl_map *map, enum isl_dim_type type, unsigned pos, int (*fn)(__isl_keep isl_basic_map *bmap, enum isl_dim_type type, unsigned pos)) { int i; if (!map) return -1; for (i = 0; i < map->n; ++i) { int bounded; bounded = fn(map->p[i], type, pos); if (bounded < 0 || !bounded) return bounded; } return 1; } /* Return 1 if the specified dim has a lower bound (in each of its basic sets). */ int isl_set_dim_has_lower_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound); } /* Return 1 if the specified dim has an upper bound (in each of its basic sets). */ int isl_set_dim_has_upper_bound(__isl_keep isl_set *set, enum isl_dim_type type, unsigned pos) { return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound); } /* For each of the "n" variables starting at "first", determine * the sign of the variable and put the results in the first "n" * elements of the array "signs". * Sign * 1 means that the variable is non-negative * -1 means that the variable is non-positive * 0 means the variable attains both positive and negative values. */ int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset, unsigned first, unsigned n, int *signs) { isl_vec *bound = NULL; struct isl_tab *tab = NULL; struct isl_tab_undo *snap; int i; if (!bset || !signs) return -1; bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset)); tab = isl_tab_from_basic_set(bset, 0); if (!bound || !tab) goto error; isl_seq_clr(bound->el, bound->size); isl_int_set_si(bound->el[0], -1); snap = isl_tab_snap(tab); for (i = 0; i < n; ++i) { int empty; isl_int_set_si(bound->el[1 + first + i], -1); if (isl_tab_add_ineq(tab, bound->el) < 0) goto error; empty = tab->empty; isl_int_set_si(bound->el[1 + first + i], 0); if (isl_tab_rollback(tab, snap) < 0) goto error; if (empty) { signs[i] = 1; continue; } isl_int_set_si(bound->el[1 + first + i], 1); if (isl_tab_add_ineq(tab, bound->el) < 0) goto error; empty = tab->empty; isl_int_set_si(bound->el[1 + first + i], 0); if (isl_tab_rollback(tab, snap) < 0) goto error; signs[i] = empty ? -1 : 0; } isl_tab_free(tab); isl_vec_free(bound); return 0; error: isl_tab_free(tab); isl_vec_free(bound); return -1; } int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset, enum isl_dim_type type, unsigned first, unsigned n, int *signs) { if (!bset || !signs) return -1; isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type), return -1); first += pos(bset->dim, type) - 1; return isl_basic_set_vars_get_sign(bset, first, n, signs); } /* Check if the given basic map is obviously single-valued. * In particular, for each output dimension, check that there is * an equality that defines the output dimension in terms of * earlier dimensions. */ int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap) { int i, j; unsigned total; unsigned n_out; unsigned o_out; if (!bmap) return -1; total = 1 + isl_basic_map_total_dim(bmap); n_out = isl_basic_map_dim(bmap, isl_dim_out); o_out = isl_basic_map_offset(bmap, isl_dim_out); for (i = 0; i < n_out; ++i) { for (j = 0; j < bmap->n_eq; ++j) { if (isl_int_is_zero(bmap->eq[j][o_out + i])) continue; if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1, total - (o_out + i + 1)) == -1) break; } if (j >= bmap->n_eq) return 0; } return 1; } /* Check if the given basic map is single-valued. * We simply compute * * M \circ M^-1 * * and check if the result is a subset of the identity mapping. */ int isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap) { isl_space *space; isl_basic_map *test; isl_basic_map *id; int sv; sv = isl_basic_map_plain_is_single_valued(bmap); if (sv < 0 || sv) return sv; test = isl_basic_map_reverse(isl_basic_map_copy(bmap)); test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap)); space = isl_basic_map_get_space(bmap); space = isl_space_map_from_set(isl_space_range(space)); id = isl_basic_map_identity(space); sv = isl_basic_map_is_subset(test, id); isl_basic_map_free(test); isl_basic_map_free(id); return sv; } /* Check if the given map is obviously single-valued. */ int isl_map_plain_is_single_valued(__isl_keep isl_map *map) { if (!map) return -1; if (map->n == 0) return 1; if (map->n >= 2) return 0; return isl_basic_map_plain_is_single_valued(map->p[0]); } /* Check if the given map is single-valued. * We simply compute * * M \circ M^-1 * * and check if the result is a subset of the identity mapping. */ int isl_map_is_single_valued(__isl_keep isl_map *map) { isl_space *dim; isl_map *test; isl_map *id; int sv; sv = isl_map_plain_is_single_valued(map); if (sv < 0 || sv) return sv; test = isl_map_reverse(isl_map_copy(map)); test = isl_map_apply_range(test, isl_map_copy(map)); dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map))); id = isl_map_identity(dim); sv = isl_map_is_subset(test, id); isl_map_free(test); isl_map_free(id); return sv; } int isl_map_is_injective(__isl_keep isl_map *map) { int in; map = isl_map_copy(map); map = isl_map_reverse(map); in = isl_map_is_single_valued(map); isl_map_free(map); return in; } /* Check if the given map is obviously injective. */ int isl_map_plain_is_injective(__isl_keep isl_map *map) { int in; map = isl_map_copy(map); map = isl_map_reverse(map); in = isl_map_plain_is_single_valued(map); isl_map_free(map); return in; } int isl_map_is_bijective(__isl_keep isl_map *map) { int sv; sv = isl_map_is_single_valued(map); if (sv < 0 || !sv) return sv; return isl_map_is_injective(map); } int isl_set_is_singleton(__isl_keep isl_set *set) { return isl_map_is_single_valued((isl_map *)set); } int isl_map_is_translation(__isl_keep isl_map *map) { int ok; isl_set *delta; delta = isl_map_deltas(isl_map_copy(map)); ok = isl_set_is_singleton(delta); isl_set_free(delta); return ok; } static int unique(isl_int *p, unsigned pos, unsigned len) { if (isl_seq_first_non_zero(p, pos) != -1) return 0; if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1) return 0; return 1; } int isl_basic_set_is_box(__isl_keep isl_basic_set *bset) { int i, j; unsigned nvar; unsigned ovar; if (!bset) return -1; if (isl_basic_set_dim(bset, isl_dim_div) != 0) return 0; nvar = isl_basic_set_dim(bset, isl_dim_set); ovar = isl_space_offset(bset->dim, isl_dim_set); for (j = 0; j < nvar; ++j) { int lower = 0, upper = 0; for (i = 0; i < bset->n_eq; ++i) { if (isl_int_is_zero(bset->eq[i][1 + ovar + j])) continue; if (!unique(bset->eq[i] + 1 + ovar, j, nvar)) return 0; break; } if (i < bset->n_eq) continue; for (i = 0; i < bset->n_ineq; ++i) { if (isl_int_is_zero(bset->ineq[i][1 + ovar + j])) continue; if (!unique(bset->ineq[i] + 1 + ovar, j, nvar)) return 0; if (isl_int_is_pos(bset->ineq[i][1 + ovar + j])) lower = 1; else upper = 1; } if (!lower || !upper) return 0; } return 1; } int isl_set_is_box(__isl_keep isl_set *set) { if (!set) return -1; if (set->n != 1) return 0; return isl_basic_set_is_box(set->p[0]); } int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset) { if (!bset) return -1; return isl_space_is_wrapping(bset->dim); } int isl_set_is_wrapping(__isl_keep isl_set *set) { if (!set) return -1; return isl_space_is_wrapping(set->dim); } __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap) { bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_wrap(bmap->dim); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return (isl_basic_set *)bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map) { int i; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]); if (!map->p[i]) goto error; } map->dim = isl_space_wrap(map->dim); if (!map->dim) goto error; return (isl_set *)map; error: isl_map_free(map); return NULL; } __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset) { bset = isl_basic_set_cow(bset); if (!bset) return NULL; bset->dim = isl_space_unwrap(bset->dim); if (!bset->dim) goto error; bset = isl_basic_set_finalize(bset); return (isl_basic_map *)bset; error: isl_basic_set_free(bset); return NULL; } __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set) { int i; if (!set) return NULL; if (!isl_set_is_wrapping(set)) isl_die(set->ctx, isl_error_invalid, "not a wrapping set", goto error); set = isl_set_cow(set); if (!set) return NULL; for (i = 0; i < set->n; ++i) { set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]); if (!set->p[i]) goto error; } set->dim = isl_space_unwrap(set->dim); if (!set->dim) goto error; return (isl_map *)set; error: isl_set_free(set); return NULL; } __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap, enum isl_dim_type type) { if (!bmap) return NULL; if (!isl_space_is_named_or_nested(bmap->dim, type)) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_reset(bmap->dim, type); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_map *isl_map_reset(__isl_take isl_map *map, enum isl_dim_type type) { int i; if (!map) return NULL; if (!isl_space_is_named_or_nested(map->dim, type)) return map; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_reset(map->p[i], type); if (!map->p[i]) goto error; } map->dim = isl_space_reset(map->dim, type); if (!map->dim) goto error; return map; error: isl_map_free(map); return NULL; } __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap) { if (!bmap) return NULL; if (!bmap->dim->nested[0] && !bmap->dim->nested[1]) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_flatten(bmap->dim); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset) { return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset); } __isl_give isl_basic_map *isl_basic_map_flatten_domain( __isl_take isl_basic_map *bmap) { if (!bmap) return NULL; if (!bmap->dim->nested[0]) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_flatten_domain(bmap->dim); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_map *isl_basic_map_flatten_range( __isl_take isl_basic_map *bmap) { if (!bmap) return NULL; if (!bmap->dim->nested[1]) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_flatten_range(bmap->dim); if (!bmap->dim) goto error; bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map) { int i; if (!map) return NULL; if (!map->dim->nested[0] && !map->dim->nested[1]) return map; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_flatten(map->p[i]); if (!map->p[i]) goto error; } map->dim = isl_space_flatten(map->dim); if (!map->dim) goto error; return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set) { return (isl_set *)isl_map_flatten((isl_map *)set); } __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set) { isl_space *dim, *flat_dim; isl_map *map; dim = isl_set_get_space(set); flat_dim = isl_space_flatten(isl_space_copy(dim)); map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim)); map = isl_map_intersect_domain(map, set); return map; } __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map) { int i; if (!map) return NULL; if (!map->dim->nested[0]) return map; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_flatten_domain(map->p[i]); if (!map->p[i]) goto error; } map->dim = isl_space_flatten_domain(map->dim); if (!map->dim) goto error; return map; error: isl_map_free(map); return NULL; } __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map) { int i; if (!map) return NULL; if (!map->dim->nested[1]) return map; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_flatten_range(map->p[i]); if (!map->p[i]) goto error; } map->dim = isl_space_flatten_range(map->dim); if (!map->dim) goto error; return map; error: isl_map_free(map); return NULL; } /* Reorder the dimensions of "bmap" according to the given dim_map * and set the dimension specification to "dim". */ __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap, __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map) { isl_basic_map *res; unsigned flags; bmap = isl_basic_map_cow(bmap); if (!bmap || !dim || !dim_map) goto error; flags = bmap->flags; ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL); ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED); ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS); res = isl_basic_map_alloc_space(dim, bmap->n_div, bmap->n_eq, bmap->n_ineq); res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map); if (res) res->flags = flags; res = isl_basic_map_finalize(res); return res; error: free(dim_map); isl_basic_map_free(bmap); isl_space_free(dim); return NULL; } /* Reorder the dimensions of "map" according to given reordering. */ __isl_give isl_map *isl_map_realign(__isl_take isl_map *map, __isl_take isl_reordering *r) { int i; struct isl_dim_map *dim_map; map = isl_map_cow(map); dim_map = isl_dim_map_from_reordering(r); if (!map || !r || !dim_map) goto error; for (i = 0; i < map->n; ++i) { struct isl_dim_map *dim_map_i; dim_map_i = isl_dim_map_extend(dim_map, map->p[i]); map->p[i] = isl_basic_map_realign(map->p[i], isl_space_copy(r->dim), dim_map_i); if (!map->p[i]) goto error; } map = isl_map_reset_space(map, isl_space_copy(r->dim)); isl_reordering_free(r); free(dim_map); return map; error: free(dim_map); isl_map_free(map); isl_reordering_free(r); return NULL; } __isl_give isl_set *isl_set_realign(__isl_take isl_set *set, __isl_take isl_reordering *r) { return (isl_set *)isl_map_realign((isl_map *)set, r); } __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map, __isl_take isl_space *model) { isl_ctx *ctx; if (!map || !model) goto error; ctx = isl_space_get_ctx(model); if (!isl_space_has_named_params(model)) isl_die(ctx, isl_error_invalid, "model has unnamed parameters", goto error); if (!isl_space_has_named_params(map->dim)) isl_die(ctx, isl_error_invalid, "relation has unnamed parameters", goto error); if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) { isl_reordering *exp; model = isl_space_drop_dims(model, isl_dim_in, 0, isl_space_dim(model, isl_dim_in)); model = isl_space_drop_dims(model, isl_dim_out, 0, isl_space_dim(model, isl_dim_out)); exp = isl_parameter_alignment_reordering(map->dim, model); exp = isl_reordering_extend_space(exp, isl_map_get_space(map)); map = isl_map_realign(map, exp); } isl_space_free(model); return map; error: isl_space_free(model); isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set, __isl_take isl_space *model) { return isl_map_align_params(set, model); } /* Align the parameters of "bmap" to those of "model", introducing * additional parameters if needed. */ __isl_give isl_basic_map *isl_basic_map_align_params( __isl_take isl_basic_map *bmap, __isl_take isl_space *model) { isl_ctx *ctx; if (!bmap || !model) goto error; ctx = isl_space_get_ctx(model); if (!isl_space_has_named_params(model)) isl_die(ctx, isl_error_invalid, "model has unnamed parameters", goto error); if (!isl_space_has_named_params(bmap->dim)) isl_die(ctx, isl_error_invalid, "relation has unnamed parameters", goto error); if (!isl_space_match(bmap->dim, isl_dim_param, model, isl_dim_param)) { isl_reordering *exp; struct isl_dim_map *dim_map; model = isl_space_drop_dims(model, isl_dim_in, 0, isl_space_dim(model, isl_dim_in)); model = isl_space_drop_dims(model, isl_dim_out, 0, isl_space_dim(model, isl_dim_out)); exp = isl_parameter_alignment_reordering(bmap->dim, model); exp = isl_reordering_extend_space(exp, isl_basic_map_get_space(bmap)); dim_map = isl_dim_map_from_reordering(exp); bmap = isl_basic_map_realign(bmap, exp ? isl_space_copy(exp->dim) : NULL, isl_dim_map_extend(dim_map, bmap)); isl_reordering_free(exp); free(dim_map); } isl_space_free(model); return bmap; error: isl_space_free(model); isl_basic_map_free(bmap); return NULL; } /* Align the parameters of "bset" to those of "model", introducing * additional parameters if needed. */ __isl_give isl_basic_set *isl_basic_set_align_params( __isl_take isl_basic_set *bset, __isl_take isl_space *model) { return isl_basic_map_align_params(bset, model); } __isl_give isl_mat *isl_basic_map_equalities_matrix( __isl_keep isl_basic_map *bmap, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5) { enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 }; struct isl_mat *mat; int i, j, k; int pos; if (!bmap) return NULL; mat = isl_mat_alloc(bmap->ctx, bmap->n_eq, isl_basic_map_total_dim(bmap) + 1); if (!mat) return NULL; for (i = 0; i < bmap->n_eq; ++i) for (j = 0, pos = 0; j < 5; ++j) { int off = isl_basic_map_offset(bmap, c[j]); for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) { isl_int_set(mat->row[i][pos], bmap->eq[i][off + k]); ++pos; } } return mat; } __isl_give isl_mat *isl_basic_map_inequalities_matrix( __isl_keep isl_basic_map *bmap, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5) { enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 }; struct isl_mat *mat; int i, j, k; int pos; if (!bmap) return NULL; mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq, isl_basic_map_total_dim(bmap) + 1); if (!mat) return NULL; for (i = 0; i < bmap->n_ineq; ++i) for (j = 0, pos = 0; j < 5; ++j) { int off = isl_basic_map_offset(bmap, c[j]); for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) { isl_int_set(mat->row[i][pos], bmap->ineq[i][off + k]); ++pos; } } return mat; } __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices( __isl_take isl_space *dim, __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4, enum isl_dim_type c5) { enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 }; isl_basic_map *bmap; unsigned total; unsigned extra; int i, j, k, l; int pos; if (!dim || !eq || !ineq) goto error; if (eq->n_col != ineq->n_col) isl_die(dim->ctx, isl_error_invalid, "equalities and inequalities matrices should have " "same number of columns", goto error); total = 1 + isl_space_dim(dim, isl_dim_all); if (eq->n_col < total) isl_die(dim->ctx, isl_error_invalid, "number of columns too small", goto error); extra = eq->n_col - total; bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra, eq->n_row, ineq->n_row); if (!bmap) goto error; for (i = 0; i < extra; ++i) { k = isl_basic_map_alloc_div(bmap); if (k < 0) goto error; isl_int_set_si(bmap->div[k][0], 0); } for (i = 0; i < eq->n_row; ++i) { l = isl_basic_map_alloc_equality(bmap); if (l < 0) goto error; for (j = 0, pos = 0; j < 5; ++j) { int off = isl_basic_map_offset(bmap, c[j]); for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) { isl_int_set(bmap->eq[l][off + k], eq->row[i][pos]); ++pos; } } } for (i = 0; i < ineq->n_row; ++i) { l = isl_basic_map_alloc_inequality(bmap); if (l < 0) goto error; for (j = 0, pos = 0; j < 5; ++j) { int off = isl_basic_map_offset(bmap, c[j]); for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) { isl_int_set(bmap->ineq[l][off + k], ineq->row[i][pos]); ++pos; } } } isl_space_free(dim); isl_mat_free(eq); isl_mat_free(ineq); bmap = isl_basic_map_simplify(bmap); return isl_basic_map_finalize(bmap); error: isl_space_free(dim); isl_mat_free(eq); isl_mat_free(ineq); return NULL; } __isl_give isl_mat *isl_basic_set_equalities_matrix( __isl_keep isl_basic_set *bset, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4) { return isl_basic_map_equalities_matrix((isl_basic_map *)bset, c1, c2, c3, c4, isl_dim_in); } __isl_give isl_mat *isl_basic_set_inequalities_matrix( __isl_keep isl_basic_set *bset, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4) { return isl_basic_map_inequalities_matrix((isl_basic_map *)bset, c1, c2, c3, c4, isl_dim_in); } __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices( __isl_take isl_space *dim, __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4) { return (isl_basic_set*) isl_basic_map_from_constraint_matrices(dim, eq, ineq, c1, c2, c3, c4, isl_dim_in); } int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return isl_space_can_zip(bmap->dim); } int isl_map_can_zip(__isl_keep isl_map *map) { if (!map) return -1; return isl_space_can_zip(map->dim); } /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map * (A -> C) -> (B -> D). */ __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap) { unsigned pos; unsigned n1; unsigned n2; if (!bmap) return NULL; if (!isl_basic_map_can_zip(bmap)) isl_die(bmap->ctx, isl_error_invalid, "basic map cannot be zipped", goto error); pos = isl_basic_map_offset(bmap, isl_dim_in) + isl_space_dim(bmap->dim->nested[0], isl_dim_in); n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out); n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in); bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2); if (!bmap) return NULL; bmap->dim = isl_space_zip(bmap->dim); if (!bmap->dim) goto error; return bmap; error: isl_basic_map_free(bmap); return NULL; } /* Given a map (A -> B) -> (C -> D), return the corresponding map * (A -> C) -> (B -> D). */ __isl_give isl_map *isl_map_zip(__isl_take isl_map *map) { int i; if (!map) return NULL; if (!isl_map_can_zip(map)) isl_die(map->ctx, isl_error_invalid, "map cannot be zipped", goto error); map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_zip(map->p[i]); if (!map->p[i]) goto error; } map->dim = isl_space_zip(map->dim); if (!map->dim) goto error; return map; error: isl_map_free(map); return NULL; } /* Can we apply isl_basic_map_curry to "bmap"? * That is, does it have a nested relation in its domain? */ int isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return isl_space_can_curry(bmap->dim); } /* Can we apply isl_map_curry to "map"? * That is, does it have a nested relation in its domain? */ int isl_map_can_curry(__isl_keep isl_map *map) { if (!map) return -1; return isl_space_can_curry(map->dim); } /* Given a basic map (A -> B) -> C, return the corresponding basic map * A -> (B -> C). */ __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap) { if (!bmap) return NULL; if (!isl_basic_map_can_curry(bmap)) isl_die(bmap->ctx, isl_error_invalid, "basic map cannot be curried", goto error); bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_curry(bmap->dim); if (!bmap->dim) goto error; return bmap; error: isl_basic_map_free(bmap); return NULL; } /* Given a map (A -> B) -> C, return the corresponding map * A -> (B -> C). */ __isl_give isl_map *isl_map_curry(__isl_take isl_map *map) { int i; if (!map) return NULL; if (!isl_map_can_curry(map)) isl_die(map->ctx, isl_error_invalid, "map cannot be curried", goto error); map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_curry(map->p[i]); if (!map->p[i]) goto error; } map->dim = isl_space_curry(map->dim); if (!map->dim) goto error; return map; error: isl_map_free(map); return NULL; } /* Can we apply isl_basic_map_uncurry to "bmap"? * That is, does it have a nested relation in its domain? */ int isl_basic_map_can_uncurry(__isl_keep isl_basic_map *bmap) { if (!bmap) return -1; return isl_space_can_uncurry(bmap->dim); } /* Can we apply isl_map_uncurry to "map"? * That is, does it have a nested relation in its domain? */ int isl_map_can_uncurry(__isl_keep isl_map *map) { if (!map) return -1; return isl_space_can_uncurry(map->dim); } /* Given a basic map A -> (B -> C), return the corresponding basic map * (A -> B) -> C. */ __isl_give isl_basic_map *isl_basic_map_uncurry(__isl_take isl_basic_map *bmap) { if (!bmap) return NULL; if (!isl_basic_map_can_uncurry(bmap)) isl_die(bmap->ctx, isl_error_invalid, "basic map cannot be uncurried", return isl_basic_map_free(bmap)); bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; bmap->dim = isl_space_uncurry(bmap->dim); if (!bmap->dim) return isl_basic_map_free(bmap); return bmap; } /* Given a map A -> (B -> C), return the corresponding map * (A -> B) -> C. */ __isl_give isl_map *isl_map_uncurry(__isl_take isl_map *map) { int i; if (!map) return NULL; if (!isl_map_can_uncurry(map)) isl_die(map->ctx, isl_error_invalid, "map cannot be uncurried", return isl_map_free(map)); map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_uncurry(map->p[i]); if (!map->p[i]) return isl_map_free(map); } map->dim = isl_space_uncurry(map->dim); if (!map->dim) return isl_map_free(map); return map; } /* Construct a basic map mapping the domain of the affine expression * to a one-dimensional range prescribed by the affine expression. */ __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff) { int k; int pos; isl_local_space *ls; isl_basic_map *bmap; if (!aff) return NULL; ls = isl_aff_get_local_space(aff); bmap = isl_basic_map_from_local_space(ls); bmap = isl_basic_map_extend_constraints(bmap, 1, 0); k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; pos = isl_basic_map_offset(bmap, isl_dim_out); isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos); isl_int_neg(bmap->eq[k][pos], aff->v->el[0]); isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos, aff->v->size - (pos + 1)); isl_aff_free(aff); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_aff_free(aff); isl_basic_map_free(bmap); return NULL; } /* Construct a map mapping the domain of the affine expression * to a one-dimensional range prescribed by the affine expression. */ __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff) { isl_basic_map *bmap; bmap = isl_basic_map_from_aff(aff); return isl_map_from_basic_map(bmap); } /* Construct a basic map mapping the domain the multi-affine expression * to its range, with each dimension in the range equated to the * corresponding affine expression. */ __isl_give isl_basic_map *isl_basic_map_from_multi_aff( __isl_take isl_multi_aff *maff) { int i; isl_space *space; isl_basic_map *bmap; if (!maff) return NULL; if (isl_space_dim(maff->space, isl_dim_out) != maff->n) isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal, "invalid space", return isl_multi_aff_free(maff)); space = isl_space_domain(isl_multi_aff_get_space(maff)); bmap = isl_basic_map_universe(isl_space_from_domain(space)); for (i = 0; i < maff->n; ++i) { isl_aff *aff; isl_basic_map *bmap_i; aff = isl_aff_copy(maff->p[i]); bmap_i = isl_basic_map_from_aff(aff); bmap = isl_basic_map_flat_range_product(bmap, bmap_i); } bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff)); isl_multi_aff_free(maff); return bmap; } /* Construct a map mapping the domain the multi-affine expression * to its range, with each dimension in the range equated to the * corresponding affine expression. */ __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff) { isl_basic_map *bmap; bmap = isl_basic_map_from_multi_aff(maff); return isl_map_from_basic_map(bmap); } /* Construct a basic map mapping a domain in the given space to * to an n-dimensional range, with n the number of elements in the list, * where each coordinate in the range is prescribed by the * corresponding affine expression. * The domains of all affine expressions in the list are assumed to match * domain_dim. */ __isl_give isl_basic_map *isl_basic_map_from_aff_list( __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list) { int i; isl_space *dim; isl_basic_map *bmap; if (!list) return NULL; dim = isl_space_from_domain(domain_dim); bmap = isl_basic_map_universe(dim); for (i = 0; i < list->n; ++i) { isl_aff *aff; isl_basic_map *bmap_i; aff = isl_aff_copy(list->p[i]); bmap_i = isl_basic_map_from_aff(aff); bmap = isl_basic_map_flat_range_product(bmap, bmap_i); } isl_aff_list_free(list); return bmap; } __isl_give isl_set *isl_set_equate(__isl_take isl_set *set, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { return isl_map_equate(set, type1, pos1, type2, pos2); } /* Construct a basic map where the given dimensions are equal to each other. */ static __isl_give isl_basic_map *equator(__isl_take isl_space *space, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_basic_map *bmap = NULL; int i; if (!space) return NULL; if (pos1 >= isl_space_dim(space, type1)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "index out of bounds", goto error); if (pos2 >= isl_space_dim(space, type2)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "index out of bounds", goto error); if (type1 == type2 && pos1 == pos2) return isl_basic_map_universe(space); bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0); i = isl_basic_map_alloc_equality(bmap); if (i < 0) goto error; isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap)); pos1 += isl_basic_map_offset(bmap, type1); pos2 += isl_basic_map_offset(bmap, type2); isl_int_set_si(bmap->eq[i][pos1], -1); isl_int_set_si(bmap->eq[i][pos2], 1); bmap = isl_basic_map_finalize(bmap); isl_space_free(space); return bmap; error: isl_space_free(space); isl_basic_map_free(bmap); return NULL; } /* Add a constraint imposing that the given two dimensions are equal. */ __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_basic_map *eq; eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2); bmap = isl_basic_map_intersect(bmap, eq); return bmap; } /* Add a constraint imposing that the given two dimensions are equal. */ __isl_give isl_map *isl_map_equate(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_basic_map *bmap; bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2); map = isl_map_intersect(map, isl_map_from_basic_map(bmap)); return map; } /* Add a constraint imposing that the given two dimensions have opposite values. */ __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_basic_map *bmap = NULL; int i; if (!map) return NULL; if (pos1 >= isl_map_dim(map, type1)) isl_die(map->ctx, isl_error_invalid, "index out of bounds", goto error); if (pos2 >= isl_map_dim(map, type2)) isl_die(map->ctx, isl_error_invalid, "index out of bounds", goto error); bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0); i = isl_basic_map_alloc_equality(bmap); if (i < 0) goto error; isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap)); pos1 += isl_basic_map_offset(bmap, type1); pos2 += isl_basic_map_offset(bmap, type2); isl_int_set_si(bmap->eq[i][pos1], 1); isl_int_set_si(bmap->eq[i][pos2], 1); bmap = isl_basic_map_finalize(bmap); map = isl_map_intersect(map, isl_map_from_basic_map(bmap)); return map; error: isl_basic_map_free(bmap); isl_map_free(map); return NULL; } /* Add a constraint imposing that the value of the first dimension is * greater than or equal to that of the second. */ __isl_give isl_basic_map *isl_basic_map_order_ge(__isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_constraint *c; isl_local_space *ls; if (!bmap) return NULL; if (pos1 >= isl_basic_map_dim(bmap, type1)) isl_die(bmap->ctx, isl_error_invalid, "index out of bounds", return isl_basic_map_free(bmap)); if (pos2 >= isl_basic_map_dim(bmap, type2)) isl_die(bmap->ctx, isl_error_invalid, "index out of bounds", return isl_basic_map_free(bmap)); if (type1 == type2 && pos1 == pos2) return bmap; ls = isl_local_space_from_space(isl_basic_map_get_space(bmap)); c = isl_inequality_alloc(ls); c = isl_constraint_set_coefficient_si(c, type1, pos1, 1); c = isl_constraint_set_coefficient_si(c, type2, pos2, -1); bmap = isl_basic_map_add_constraint(bmap, c); return bmap; } /* Construct a basic map where the value of the first dimension is * greater than that of the second. */ static __isl_give isl_basic_map *greator(__isl_take isl_space *space, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_basic_map *bmap = NULL; int i; if (!space) return NULL; if (pos1 >= isl_space_dim(space, type1)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "index out of bounds", goto error); if (pos2 >= isl_space_dim(space, type2)) isl_die(isl_space_get_ctx(space), isl_error_invalid, "index out of bounds", goto error); if (type1 == type2 && pos1 == pos2) return isl_basic_map_empty(space); bmap = isl_basic_map_alloc_space(space, 0, 0, 1); i = isl_basic_map_alloc_inequality(bmap); if (i < 0) goto error; isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap)); pos1 += isl_basic_map_offset(bmap, type1); pos2 += isl_basic_map_offset(bmap, type2); isl_int_set_si(bmap->ineq[i][pos1], 1); isl_int_set_si(bmap->ineq[i][pos2], -1); isl_int_set_si(bmap->ineq[i][0], -1); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_space_free(space); isl_basic_map_free(bmap); return NULL; } /* Add a constraint imposing that the value of the first dimension is * greater than that of the second. */ __isl_give isl_basic_map *isl_basic_map_order_gt(__isl_take isl_basic_map *bmap, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_basic_map *gt; gt = greator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2); bmap = isl_basic_map_intersect(bmap, gt); return bmap; } /* Add a constraint imposing that the value of the first dimension is * greater than that of the second. */ __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { isl_basic_map *bmap; bmap = greator(isl_map_get_space(map), type1, pos1, type2, pos2); map = isl_map_intersect(map, isl_map_from_basic_map(bmap)); return map; } /* Add a constraint imposing that the value of the first dimension is * smaller than that of the second. */ __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map, enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2) { return isl_map_order_gt(map, type2, pos2, type1, pos1); } __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap, int pos) { isl_aff *div; isl_local_space *ls; if (!bmap) return NULL; if (!isl_basic_map_divs_known(bmap)) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "some divs are unknown", return NULL); ls = isl_basic_map_get_local_space(bmap); div = isl_local_space_get_div(ls, pos); isl_local_space_free(ls); return div; } __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset, int pos) { return isl_basic_map_get_div(bset, pos); } /* Plug in "subs" for dimension "type", "pos" of "bset". * * Let i be the dimension to replace and let "subs" be of the form * * f/d * * Any integer division with a non-zero coefficient for i, * * floor((a i + g)/m) * * is replaced by * * floor((a f + d g)/(m d)) * * Constraints of the form * * a i + g * * are replaced by * * a f + d g * * We currently require that "subs" is an integral expression. * Handling rational expressions may require us to add stride constraints * as we do in isl_basic_set_preimage_multi_aff. */ __isl_give isl_basic_set *isl_basic_set_substitute( __isl_take isl_basic_set *bset, enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs) { int i; isl_int v; isl_ctx *ctx; if (bset && isl_basic_set_plain_is_empty(bset)) return bset; bset = isl_basic_set_cow(bset); if (!bset || !subs) goto error; ctx = isl_basic_set_get_ctx(bset); if (!isl_space_is_equal(bset->dim, subs->ls->dim)) isl_die(ctx, isl_error_invalid, "spaces don't match", goto error); if (isl_local_space_dim(subs->ls, isl_dim_div) != 0) isl_die(ctx, isl_error_unsupported, "cannot handle divs yet", goto error); if (!isl_int_is_one(subs->v->el[0])) isl_die(ctx, isl_error_invalid, "can only substitute integer expressions", goto error); pos += isl_basic_set_offset(bset, type); isl_int_init(v); for (i = 0; i < bset->n_eq; ++i) { if (isl_int_is_zero(bset->eq[i][pos])) continue; isl_int_set(v, bset->eq[i][pos]); isl_int_set_si(bset->eq[i][pos], 0); isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i], v, subs->v->el + 1, subs->v->size - 1); } for (i = 0; i < bset->n_ineq; ++i) { if (isl_int_is_zero(bset->ineq[i][pos])) continue; isl_int_set(v, bset->ineq[i][pos]); isl_int_set_si(bset->ineq[i][pos], 0); isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i], v, subs->v->el + 1, subs->v->size - 1); } for (i = 0; i < bset->n_div; ++i) { if (isl_int_is_zero(bset->div[i][1 + pos])) continue; isl_int_set(v, bset->div[i][1 + pos]); isl_int_set_si(bset->div[i][1 + pos], 0); isl_seq_combine(bset->div[i] + 1, subs->v->el[0], bset->div[i] + 1, v, subs->v->el + 1, subs->v->size - 1); isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]); } isl_int_clear(v); bset = isl_basic_set_simplify(bset); return isl_basic_set_finalize(bset); error: isl_basic_set_free(bset); return NULL; } /* Plug in "subs" for dimension "type", "pos" of "set". */ __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set, enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs) { int i; if (set && isl_set_plain_is_empty(set)) return set; set = isl_set_cow(set); if (!set || !subs) goto error; for (i = set->n - 1; i >= 0; --i) { set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs); if (remove_if_empty(set, i) < 0) goto error; } return set; error: isl_set_free(set); return NULL; } /* Check if the range of "ma" is compatible with the domain or range * (depending on "type") of "bmap". * Return -1 if anything is wrong. */ static int check_basic_map_compatible_range_multi_aff( __isl_keep isl_basic_map *bmap, enum isl_dim_type type, __isl_keep isl_multi_aff *ma) { int m; isl_space *ma_space; ma_space = isl_multi_aff_get_space(ma); m = isl_space_tuple_match(bmap->dim, type, ma_space, isl_dim_out); isl_space_free(ma_space); if (m >= 0 && !m) isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid, "spaces don't match", return -1); return m; } /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before" * coefficients before the transformed range of dimensions, * the "n_after" coefficients after the transformed range of dimensions * and the coefficients of the other divs in "bmap". */ static int set_ma_divs(__isl_keep isl_basic_map *bmap, __isl_keep isl_multi_aff *ma, int n_before, int n_after, int n_div) { int i; int n_param; int n_set; isl_local_space *ls; if (n_div == 0) return 0; ls = isl_aff_get_domain_local_space(ma->p[0]); if (!ls) return -1; n_param = isl_local_space_dim(ls, isl_dim_param); n_set = isl_local_space_dim(ls, isl_dim_set); for (i = 0; i < n_div; ++i) { int o_bmap = 0, o_ls = 0; isl_seq_cpy(bmap->div[i], ls->div->row[i], 1 + 1 + n_param); o_bmap += 1 + 1 + n_param; o_ls += 1 + 1 + n_param; isl_seq_clr(bmap->div[i] + o_bmap, n_before); o_bmap += n_before; isl_seq_cpy(bmap->div[i] + o_bmap, ls->div->row[i] + o_ls, n_set); o_bmap += n_set; o_ls += n_set; isl_seq_clr(bmap->div[i] + o_bmap, n_after); o_bmap += n_after; isl_seq_cpy(bmap->div[i] + o_bmap, ls->div->row[i] + o_ls, n_div); o_bmap += n_div; o_ls += n_div; isl_seq_clr(bmap->div[i] + o_bmap, bmap->n_div - n_div); if (isl_basic_set_add_div_constraints(bmap, i) < 0) goto error; } isl_local_space_free(ls); return 0; error: isl_local_space_free(ls); return -1; } /* How many stride constraints does "ma" enforce? * That is, how many of the affine expressions have a denominator * different from one? */ static int multi_aff_strides(__isl_keep isl_multi_aff *ma) { int i; int strides = 0; for (i = 0; i < ma->n; ++i) if (!isl_int_is_one(ma->p[i]->v->el[0])) strides++; return strides; } /* For each affine expression in ma of the form * * x_i = (f_i y + h_i)/m_i * * with m_i different from one, add a constraint to "bmap" * of the form * * f_i y + h_i = m_i alpha_i * * with alpha_i an additional existentially quantified variable. */ static __isl_give isl_basic_map *add_ma_strides( __isl_take isl_basic_map *bmap, __isl_keep isl_multi_aff *ma, int n_before, int n_after) { int i, k; int div; int total; int n_param; int n_in; int n_div; total = isl_basic_map_total_dim(bmap); n_param = isl_multi_aff_dim(ma, isl_dim_param); n_in = isl_multi_aff_dim(ma, isl_dim_in); n_div = isl_multi_aff_dim(ma, isl_dim_div); for (i = 0; i < ma->n; ++i) { int o_bmap = 0, o_ma = 1; if (isl_int_is_one(ma->p[i]->v->el[0])) continue; div = isl_basic_map_alloc_div(bmap); k = isl_basic_map_alloc_equality(bmap); if (div < 0 || k < 0) goto error; isl_int_set_si(bmap->div[div][0], 0); isl_seq_cpy(bmap->eq[k] + o_bmap, ma->p[i]->v->el + o_ma, 1 + n_param); o_bmap += 1 + n_param; o_ma += 1 + n_param; isl_seq_clr(bmap->eq[k] + o_bmap, n_before); o_bmap += n_before; isl_seq_cpy(bmap->eq[k] + o_bmap, ma->p[i]->v->el + o_ma, n_in); o_bmap += n_in; o_ma += n_in; isl_seq_clr(bmap->eq[k] + o_bmap, n_after); o_bmap += n_after; isl_seq_cpy(bmap->eq[k] + o_bmap, ma->p[i]->v->el + o_ma, n_div); o_bmap += n_div; o_ma += n_div; isl_seq_clr(bmap->eq[k] + o_bmap, 1 + total - o_bmap); isl_int_neg(bmap->eq[k][1 + total], ma->p[i]->v->el[0]); total++; } return bmap; error: isl_basic_map_free(bmap); return NULL; } /* Replace the domain or range space (depending on "type) of "space" by "set". */ static __isl_give isl_space *isl_space_set(__isl_take isl_space *space, enum isl_dim_type type, __isl_take isl_space *set) { if (type == isl_dim_in) { space = isl_space_range(space); space = isl_space_map_from_domain_and_range(set, space); } else { space = isl_space_domain(space); space = isl_space_map_from_domain_and_range(space, set); } return space; } /* Compute the preimage of the domain or range (depending on "type") * of "bmap" under the function represented by "ma". * In other words, plug in "ma" in the domain or range of "bmap". * The result is a basic map that lives in the same space as "bmap" * except that the domain or range has been replaced by * the domain space of "ma". * * If bmap is represented by * * A(p) + S u + B x + T v + C(divs) >= 0, * * where u and x are input and output dimensions if type == isl_dim_out * while x and v are input and output dimensions if type == isl_dim_in, * and ma is represented by * * x = D(p) + F(y) + G(divs') * * then the result is * * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0 * * The divs in the input set are similarly adjusted. * In particular * * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i) * * becomes * * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v + * B_i G(divs') + c_i(divs))/n_i) * * If bmap is not a rational map and if F(y) involves any denominators * * x_i = (f_i y + h_i)/m_i * * then additional constraints are added to ensure that we only * map back integer points. That is we enforce * * f_i y + h_i = m_i alpha_i * * with alpha_i an additional existentially quantified variable. * * We first copy over the divs from "ma". * Then we add the modified constraints and divs from "bmap". * Finally, we add the stride constraints, if needed. */ __isl_give isl_basic_map *isl_basic_map_preimage_multi_aff( __isl_take isl_basic_map *bmap, enum isl_dim_type type, __isl_take isl_multi_aff *ma) { int i, k; isl_space *space; isl_basic_map *res = NULL; int n_before, n_after, n_div_bmap, n_div_ma; isl_int f, c1, c2, g; int rational, strides; isl_int_init(f); isl_int_init(c1); isl_int_init(c2); isl_int_init(g); ma = isl_multi_aff_align_divs(ma); if (!bmap || !ma) goto error; if (check_basic_map_compatible_range_multi_aff(bmap, type, ma) < 0) goto error; if (type == isl_dim_in) { n_before = 0; n_after = isl_basic_map_dim(bmap, isl_dim_out); } else { n_before = isl_basic_map_dim(bmap, isl_dim_in); n_after = 0; } n_div_bmap = isl_basic_map_dim(bmap, isl_dim_div); n_div_ma = ma->n ? isl_aff_dim(ma->p[0], isl_dim_div) : 0; space = isl_multi_aff_get_domain_space(ma); space = isl_space_set(isl_basic_map_get_space(bmap), type, space); rational = isl_basic_map_is_rational(bmap); strides = rational ? 0 : multi_aff_strides(ma); res = isl_basic_map_alloc_space(space, n_div_ma + n_div_bmap + strides, bmap->n_eq + strides, bmap->n_ineq + 2 * n_div_ma); if (rational) res = isl_basic_map_set_rational(res); for (i = 0; i < n_div_ma + n_div_bmap; ++i) if (isl_basic_map_alloc_div(res) < 0) goto error; if (set_ma_divs(res, ma, n_before, n_after, n_div_ma) < 0) goto error; for (i = 0; i < bmap->n_eq; ++i) { k = isl_basic_map_alloc_equality(res); if (k < 0) goto error; isl_seq_preimage(res->eq[k], bmap->eq[i], ma, n_before, n_after, n_div_ma, n_div_bmap, f, c1, c2, g, 0); } for (i = 0; i < bmap->n_ineq; ++i) { k = isl_basic_map_alloc_inequality(res); if (k < 0) goto error; isl_seq_preimage(res->ineq[k], bmap->ineq[i], ma, n_before, n_after, n_div_ma, n_div_bmap, f, c1, c2, g, 0); } for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) { isl_int_set_si(res->div[n_div_ma + i][0], 0); continue; } isl_seq_preimage(res->div[n_div_ma + i], bmap->div[i], ma, n_before, n_after, n_div_ma, n_div_bmap, f, c1, c2, g, 1); } if (strides) res = add_ma_strides(res, ma, n_before, n_after); isl_int_clear(f); isl_int_clear(c1); isl_int_clear(c2); isl_int_clear(g); isl_basic_map_free(bmap); isl_multi_aff_free(ma); res = isl_basic_set_simplify(res); return isl_basic_map_finalize(res); error: isl_int_clear(f); isl_int_clear(c1); isl_int_clear(c2); isl_int_clear(g); isl_basic_map_free(bmap); isl_multi_aff_free(ma); isl_basic_map_free(res); return NULL; } /* Compute the preimage of "bset" under the function represented by "ma". * In other words, plug in "ma" in "bset". The result is a basic set * that lives in the domain space of "ma". */ __isl_give isl_basic_set *isl_basic_set_preimage_multi_aff( __isl_take isl_basic_set *bset, __isl_take isl_multi_aff *ma) { return isl_basic_map_preimage_multi_aff(bset, isl_dim_set, ma); } /* Check if the range of "ma" is compatible with the domain or range * (depending on "type") of "map". * Return -1 if anything is wrong. */ static int check_map_compatible_range_multi_aff( __isl_keep isl_map *map, enum isl_dim_type type, __isl_keep isl_multi_aff *ma) { int m; isl_space *ma_space; ma_space = isl_multi_aff_get_space(ma); m = isl_space_tuple_match(map->dim, type, ma_space, isl_dim_out); isl_space_free(ma_space); if (m >= 0 && !m) isl_die(isl_map_get_ctx(map), isl_error_invalid, "spaces don't match", return -1); return m; } /* Compute the preimage of the domain or range (depending on "type") * of "map" under the function represented by "ma". * In other words, plug in "ma" in the domain or range of "map". * The result is a map that lives in the same space as "map" * except that the domain or range has been replaced by * the domain space of "ma". * * The parameters are assumed to have been aligned. */ static __isl_give isl_map *map_preimage_multi_aff(__isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_multi_aff *ma) { int i; isl_space *space; map = isl_map_cow(map); ma = isl_multi_aff_align_divs(ma); if (!map || !ma) goto error; if (check_map_compatible_range_multi_aff(map, type, ma) < 0) goto error; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_preimage_multi_aff(map->p[i], type, isl_multi_aff_copy(ma)); if (!map->p[i]) goto error; } space = isl_multi_aff_get_domain_space(ma); space = isl_space_set(isl_map_get_space(map), type, space); isl_space_free(map->dim); map->dim = space; if (!map->dim) goto error; isl_multi_aff_free(ma); if (map->n > 1) ISL_F_CLR(map, ISL_MAP_DISJOINT); ISL_F_CLR(map, ISL_SET_NORMALIZED); return map; error: isl_multi_aff_free(ma); isl_map_free(map); return NULL; } /* Compute the preimage of the domain or range (depending on "type") * of "map" under the function represented by "ma". * In other words, plug in "ma" in the domain or range of "map". * The result is a map that lives in the same space as "map" * except that the domain or range has been replaced by * the domain space of "ma". */ __isl_give isl_map *isl_map_preimage_multi_aff(__isl_take isl_map *map, enum isl_dim_type type, __isl_take isl_multi_aff *ma) { if (!map || !ma) goto error; if (isl_space_match(map->dim, isl_dim_param, ma->space, isl_dim_param)) return map_preimage_multi_aff(map, type, ma); if (!isl_space_has_named_params(map->dim) || !isl_space_has_named_params(ma->space)) isl_die(map->ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); map = isl_map_align_params(map, isl_multi_aff_get_space(ma)); ma = isl_multi_aff_align_params(ma, isl_map_get_space(map)); return map_preimage_multi_aff(map, type, ma); error: isl_multi_aff_free(ma); return isl_map_free(map); } /* Compute the preimage of "set" under the function represented by "ma". * In other words, plug in "ma" "set". The result is a set * that lives in the domain space of "ma". */ __isl_give isl_set *isl_set_preimage_multi_aff(__isl_take isl_set *set, __isl_take isl_multi_aff *ma) { return isl_map_preimage_multi_aff(set, isl_dim_set, ma); } /* Compute the preimage of the domain of "map" under the function * represented by "ma". * In other words, plug in "ma" in the domain of "map". * The result is a map that lives in the same space as "map" * except that the domain has been replaced by the domain space of "ma". */ __isl_give isl_map *isl_map_preimage_domain_multi_aff(__isl_take isl_map *map, __isl_take isl_multi_aff *ma) { return isl_map_preimage_multi_aff(map, isl_dim_in, ma); } /* Compute the preimage of "set" under the function represented by "pma". * In other words, plug in "pma" in "set. The result is a set * that lives in the domain space of "pma". */ static __isl_give isl_set *set_preimage_pw_multi_aff(__isl_take isl_set *set, __isl_take isl_pw_multi_aff *pma) { int i; isl_set *res; if (!pma) goto error; if (pma->n == 0) { isl_pw_multi_aff_free(pma); res = isl_set_empty(isl_set_get_space(set)); isl_set_free(set); return res; } res = isl_set_preimage_multi_aff(isl_set_copy(set), isl_multi_aff_copy(pma->p[0].maff)); res = isl_set_intersect(res, isl_set_copy(pma->p[0].set)); for (i = 1; i < pma->n; ++i) { isl_set *res_i; res_i = isl_set_preimage_multi_aff(isl_set_copy(set), isl_multi_aff_copy(pma->p[i].maff)); res_i = isl_set_intersect(res_i, isl_set_copy(pma->p[i].set)); res = isl_set_union(res, res_i); } isl_pw_multi_aff_free(pma); isl_set_free(set); return res; error: isl_pw_multi_aff_free(pma); isl_set_free(set); return NULL; } __isl_give isl_set *isl_set_preimage_pw_multi_aff(__isl_take isl_set *set, __isl_take isl_pw_multi_aff *pma) { if (!set || !pma) goto error; if (isl_space_match(set->dim, isl_dim_param, pma->dim, isl_dim_param)) return set_preimage_pw_multi_aff(set, pma); if (!isl_space_has_named_params(set->dim) || !isl_space_has_named_params(pma->dim)) isl_die(set->ctx, isl_error_invalid, "unaligned unnamed parameters", goto error); set = isl_set_align_params(set, isl_pw_multi_aff_get_space(pma)); pma = isl_pw_multi_aff_align_params(pma, isl_set_get_space(set)); return set_preimage_pw_multi_aff(set, pma); error: isl_pw_multi_aff_free(pma); return isl_set_free(set); } cloog-0.18.2/isl/isl.py0000664000175000017500000000754312254313240011565 00000000000000import gdb import re # GDB Pretty Printers for most isl objects class IslObjectPrinter: """Print an isl object""" def __init__ (self, val, type): self.val = val self.type = type def to_string (self): # Cast val to a void pointer to stop gdb using this pretty # printer for the pointer which would lead to an infinite loop. void_ptr = gdb.lookup_type('void').pointer() value = str(self.val.cast(void_ptr)) printer = gdb.parse_and_eval("isl_printer_to_str(isl_" + str(self.type) + "_get_ctx(" + value + "))") printer = gdb.parse_and_eval("isl_printer_print_" + str(self.type) + "(" + str(printer) + ", " + value + ")") string = gdb.parse_and_eval("(char*)isl_printer_get_str(" + str(printer) + ")") gdb.parse_and_eval("isl_printer_free(" + str(printer) + ")") return string def display_hint (self): return 'string' class IslIntPrinter: """Print an isl_int """ def __init__ (self, val): self.val = val def to_string (self): # Cast val to a void pointer to stop gdb using this pretty # printer for the pointer which would lead to an infinite loop. void_ptr = gdb.lookup_type('void').pointer() value = str(self.val.cast(void_ptr)) context = gdb.parse_and_eval("isl_ctx_alloc()") printer = gdb.parse_and_eval("isl_printer_to_str(" + str(context) + ")") printer = gdb.parse_and_eval("isl_printer_print_isl_int(" + str(printer) + ", " + value + ")") string = gdb.parse_and_eval("(char*)isl_printer_get_str(" + str(printer) + ")") gdb.parse_and_eval("isl_printer_free(" + str(printer) + ")") gdb.parse_and_eval("isl_ctx_free(" + str(context) + ")") return string def display_hint (self): return 'string' class IslPrintCommand (gdb.Command): """Print an isl value.""" def __init__ (self): super (IslPrintCommand, self).__init__ ("islprint", gdb.COMMAND_OBSCURE) def invoke (self, arg, from_tty): arg = gdb.parse_and_eval(arg); printer = str_lookup_function(arg) if printer == None: print "No isl printer for this type" return print printer.to_string() IslPrintCommand() def str_lookup_function (val): if val.type.code != gdb.TYPE_CODE_PTR: if str(val.type) == "isl_int": return IslIntPrinter(val) else: return None lookup_tag = val.type.target() regex = re.compile ("^isl_(.*)$") if lookup_tag == None: return None m = regex.match (str(lookup_tag)) if m: # Those types of printers defined in isl. if m.group(1) in ["basic_set", "set", "union_set", "basic_map", "map", "union_map", "qpolynomial", "pw_qpolynomial", "pw_qpolynomial_fold", "union_pw_qpolynomial", "union_pw_qpolynomial_fold"]: return IslObjectPrinter(val, m.group(1)) return None # Do not register the pretty printer. # gdb.current_objfile().pretty_printers.append(str_lookup_function) cloog-0.18.2/isl/isl_options.c0000664000175000017500000002757412254313240013140 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include #include #include #include struct isl_arg_choice isl_lp_solver_choice[] = { {"tab", ISL_LP_TAB}, #ifdef ISL_PIPLIB {"pip", ISL_LP_PIP}, #endif {0} }; struct isl_arg_choice isl_ilp_solver_choice[] = { {"gbr", ISL_ILP_GBR}, #ifdef ISL_PIPLIB {"pip", ISL_ILP_PIP}, #endif {0} }; struct isl_arg_choice isl_pip_solver_choice[] = { {"tab", ISL_PIP_TAB}, #ifdef ISL_PIPLIB {"pip", ISL_PIP_PIP}, #endif {0} }; struct isl_arg_choice isl_pip_context_choice[] = { {"gbr", ISL_CONTEXT_GBR}, {"lexmin", ISL_CONTEXT_LEXMIN}, {0} }; struct isl_arg_choice isl_gbr_choice[] = { {"never", ISL_GBR_NEVER}, {"once", ISL_GBR_ONCE}, {"always", ISL_GBR_ALWAYS}, {0} }; struct isl_arg_choice isl_closure_choice[] = { {"isl", ISL_CLOSURE_ISL}, {"box", ISL_CLOSURE_BOX}, {0} }; static struct isl_arg_choice bound[] = { {"bernstein", ISL_BOUND_BERNSTEIN}, {"range", ISL_BOUND_RANGE}, {0} }; static struct isl_arg_choice on_error[] = { {"warn", ISL_ON_ERROR_WARN}, {"continue", ISL_ON_ERROR_CONTINUE}, {"abort", ISL_ON_ERROR_ABORT}, {0} }; static struct isl_arg_choice isl_schedule_algorithm_choice[] = { {"isl", ISL_SCHEDULE_ALGORITHM_ISL}, {"feautrier", ISL_SCHEDULE_ALGORITHM_FEAUTRIER}, {0} }; static struct isl_arg_flags bernstein_recurse[] = { {"none", ISL_BERNSTEIN_FACTORS | ISL_BERNSTEIN_INTERVALS, 0}, {"factors", ISL_BERNSTEIN_FACTORS | ISL_BERNSTEIN_INTERVALS, ISL_BERNSTEIN_FACTORS}, {"intervals", ISL_BERNSTEIN_FACTORS | ISL_BERNSTEIN_INTERVALS, ISL_BERNSTEIN_INTERVALS}, {"full", ISL_BERNSTEIN_FACTORS | ISL_BERNSTEIN_INTERVALS, ISL_BERNSTEIN_FACTORS | ISL_BERNSTEIN_INTERVALS}, {0} }; static struct isl_arg_choice convex[] = { {"wrap", ISL_CONVEX_HULL_WRAP}, {"fm", ISL_CONVEX_HULL_FM}, {0} }; static struct isl_arg_choice fuse[] = { {"max", ISL_SCHEDULE_FUSE_MAX}, {"min", ISL_SCHEDULE_FUSE_MIN}, {0} }; static struct isl_arg_choice separation_bounds[] = { {"explicit", ISL_AST_BUILD_SEPARATION_BOUNDS_EXPLICIT}, {"implicit", ISL_AST_BUILD_SEPARATION_BOUNDS_IMPLICIT}, {0} }; static void print_version(void) { printf("%s", isl_version()); } ISL_ARGS_START(struct isl_options, isl_options_args) ISL_ARG_CHOICE(struct isl_options, lp_solver, 0, "lp-solver", \ isl_lp_solver_choice, ISL_LP_TAB, "lp solver to use") ISL_ARG_CHOICE(struct isl_options, ilp_solver, 0, "ilp-solver", \ isl_ilp_solver_choice, ISL_ILP_GBR, "ilp solver to use") ISL_ARG_CHOICE(struct isl_options, pip, 0, "pip", \ isl_pip_solver_choice, ISL_PIP_TAB, "pip solver to use") ISL_ARG_CHOICE(struct isl_options, context, 0, "context", \ isl_pip_context_choice, ISL_CONTEXT_GBR, "how to handle the pip context tableau") ISL_ARG_CHOICE(struct isl_options, gbr, 0, "gbr", \ isl_gbr_choice, ISL_GBR_ALWAYS, "how often to use generalized basis reduction") ISL_ARG_CHOICE(struct isl_options, closure, 0, "closure", \ isl_closure_choice, ISL_CLOSURE_ISL, "closure operation to use") ISL_ARG_BOOL(struct isl_options, gbr_only_first, 0, "gbr-only-first", 0, "only perform basis reduction in first direction") ISL_ARG_CHOICE(struct isl_options, bound, 0, "bound", bound, ISL_BOUND_BERNSTEIN, "algorithm to use for computing bounds") ISL_ARG_CHOICE(struct isl_options, on_error, 0, "on-error", on_error, ISL_ON_ERROR_WARN, "how to react if an error is detected") ISL_ARG_FLAGS(struct isl_options, bernstein_recurse, 0, "bernstein-recurse", bernstein_recurse, ISL_BERNSTEIN_FACTORS, NULL) ISL_ARG_BOOL(struct isl_options, bernstein_triangulate, 0, "bernstein-triangulate", 1, "triangulate domains during Bernstein expansion") ISL_ARG_BOOL(struct isl_options, pip_symmetry, 0, "pip-symmetry", 1, "detect simple symmetries in PIP input") ISL_ARG_CHOICE(struct isl_options, convex, 0, "convex-hull", \ convex, ISL_CONVEX_HULL_WRAP, "convex hull algorithm to use") ISL_ARG_BOOL(struct isl_options, coalesce_bounded_wrapping, 0, "coalesce-bounded-wrapping", 1, "bound wrapping during coalescing") ISL_ARG_INT(struct isl_options, schedule_max_coefficient, 0, "schedule-max-coefficient", "limit", -1, "Only consider schedules " "where the coefficients of the variable and parameter dimensions " "do not exceed . A value of -1 allows arbitrary coefficients.") ISL_ARG_INT(struct isl_options, schedule_max_constant_term, 0, "schedule-max-constant-term", "limit", -1, "Only consider schedules " "where the coefficients of the constant dimension do not exceed " ". A value of -1 allows arbitrary coefficients.") ISL_ARG_BOOL(struct isl_options, schedule_parametric, 0, "schedule-parametric", 1, "construct possibly parametric schedules") ISL_ARG_BOOL(struct isl_options, schedule_outer_zero_distance, 0, "schedule-outer-zero-distance", 0, "try to construct schedules with outer zero distances over " "proximity dependences") ISL_ARG_BOOL(struct isl_options, schedule_maximize_band_depth, 0, "schedule-maximize-band-depth", 0, "maximize the number of scheduling dimensions in a band") ISL_ARG_BOOL(struct isl_options, schedule_split_scaled, 0, "schedule-split-scaled", 1, "split non-tilable bands with scaled schedules") ISL_ARG_BOOL(struct isl_options, schedule_separate_components, 0, "schedule-separate-components", 1, "separate components in dependence graph") ISL_ARG_CHOICE(struct isl_options, schedule_algorithm, 0, "schedule-algorithm", isl_schedule_algorithm_choice, ISL_SCHEDULE_ALGORITHM_ISL, "scheduling algorithm to use") ISL_ARG_CHOICE(struct isl_options, schedule_fuse, 0, "schedule-fuse", fuse, ISL_SCHEDULE_FUSE_MAX, "level of fusion during scheduling") ISL_ARG_BOOL(struct isl_options, tile_scale_tile_loops, 0, "tile-scale-tile-loops", 1, "scale tile loops") ISL_ARG_BOOL(struct isl_options, tile_shift_point_loops, 0, "tile-shift-point-loops", 1, "shift point loops to start at zero") ISL_ARG_STR(struct isl_options, ast_iterator_type, 0, "ast-iterator-type", "type", "int", "type used for iterators during printing of AST") ISL_ARG_BOOL(struct isl_options, ast_build_atomic_upper_bound, 0, "ast-build-atomic-upper-bound", 1, "generate atomic upper bounds") ISL_ARG_BOOL(struct isl_options, ast_build_prefer_pdiv, 0, "ast-build-prefer-pdiv", 1, "prefer pdiv operation over fdiv") ISL_ARG_BOOL(struct isl_options, ast_build_exploit_nested_bounds, 0, "ast-build-exploit-nested-bounds", 1, "simplify conditions based on bounds of nested for loops") ISL_ARG_BOOL(struct isl_options, ast_build_group_coscheduled, 0, "ast-build-group-coscheduled", 0, "keep coscheduled domain elements together") ISL_ARG_CHOICE(struct isl_options, ast_build_separation_bounds, 0, "ast-build-separation-bounds", separation_bounds, ISL_AST_BUILD_SEPARATION_BOUNDS_EXPLICIT, "bounds to use during separation") ISL_ARG_BOOL(struct isl_options, ast_build_scale_strides, 0, "ast-build-scale-strides", 1, "allow iterators of strided loops to be scaled down") ISL_ARG_BOOL(struct isl_options, ast_build_allow_else, 0, "ast-build-allow-else", 1, "generate if statements with else branches") ISL_ARG_BOOL(struct isl_options, ast_build_allow_or, 0, "ast-build-allow-or", 1, "generate if conditions with disjunctions") ISL_ARG_VERSION(print_version) ISL_ARGS_END ISL_ARG_DEF(isl_options, struct isl_options, isl_options_args) ISL_ARG_CTX_DEF(isl_options, struct isl_options, isl_options_args) ISL_CTX_SET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, bound) ISL_CTX_GET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, bound) ISL_CTX_SET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, on_error) ISL_CTX_GET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, on_error) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, coalesce_bounded_wrapping) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, coalesce_bounded_wrapping) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, gbr_only_first) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, gbr_only_first) ISL_CTX_SET_INT_DEF(isl_options, struct isl_options, isl_options_args, schedule_max_coefficient) ISL_CTX_GET_INT_DEF(isl_options, struct isl_options, isl_options_args, schedule_max_coefficient) ISL_CTX_SET_INT_DEF(isl_options, struct isl_options, isl_options_args, schedule_max_constant_term) ISL_CTX_GET_INT_DEF(isl_options, struct isl_options, isl_options_args, schedule_max_constant_term) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_maximize_band_depth) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_maximize_band_depth) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_split_scaled) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_split_scaled) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_separate_components) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_separate_components) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_outer_zero_distance) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, schedule_outer_zero_distance) ISL_CTX_SET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, schedule_algorithm) ISL_CTX_GET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, schedule_algorithm) ISL_CTX_SET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, schedule_fuse) ISL_CTX_GET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, schedule_fuse) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, tile_scale_tile_loops) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, tile_scale_tile_loops) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, tile_shift_point_loops) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, tile_shift_point_loops) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_atomic_upper_bound) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_atomic_upper_bound) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_prefer_pdiv) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_prefer_pdiv) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_exploit_nested_bounds) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_exploit_nested_bounds) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_group_coscheduled) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_group_coscheduled) ISL_CTX_SET_STR_DEF(isl_options, struct isl_options, isl_options_args, ast_iterator_type) ISL_CTX_GET_STR_DEF(isl_options, struct isl_options, isl_options_args, ast_iterator_type) ISL_CTX_SET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, ast_build_separation_bounds) ISL_CTX_GET_CHOICE_DEF(isl_options, struct isl_options, isl_options_args, ast_build_separation_bounds) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_scale_strides) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_scale_strides) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_allow_else) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_allow_else) ISL_CTX_SET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_allow_or) ISL_CTX_GET_BOOL_DEF(isl_options, struct isl_options, isl_options_args, ast_build_allow_or) cloog-0.18.2/isl/isl_map_no_piplib.c0000664000175000017500000000077112254313240014243 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include "isl_map_piplib.h" #include struct isl_map *isl_pip_basic_map_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max) { isl_basic_map_free(bmap); isl_basic_set_free(dom); return NULL; } cloog-0.18.2/isl/isl_aff_private.h0000664000175000017500000000674212254313240013732 00000000000000#ifndef ISL_AFF_PRIVATE_H #define ISL_AFF_PRIVATE_H #include #include #include #include #include /* ls represents the domain space. */ struct isl_aff { int ref; isl_local_space *ls; isl_vec *v; }; #undef EL #define EL isl_aff #include struct isl_pw_aff_piece { struct isl_set *set; struct isl_aff *aff; }; struct isl_pw_aff { int ref; isl_space *dim; int n; size_t size; struct isl_pw_aff_piece p[1]; }; #undef EL #define EL isl_pw_aff #include struct isl_pw_multi_aff_piece { isl_set *set; isl_multi_aff *maff; }; struct isl_pw_multi_aff { int ref; isl_space *dim; int n; size_t size; struct isl_pw_multi_aff_piece p[1]; }; __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls); __isl_give isl_aff *isl_aff_reset_space_and_domain(__isl_take isl_aff *aff, __isl_take isl_space *space, __isl_take isl_space *domain); __isl_give isl_aff *isl_aff_reset_domain_space(__isl_take isl_aff *aff, __isl_take isl_space *dim); __isl_give isl_aff *isl_aff_realign_domain(__isl_take isl_aff *aff, __isl_take isl_reordering *r); __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff); __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff, __isl_take isl_mat *div, int *exp); __isl_give isl_pw_aff *isl_pw_aff_alloc_size(__isl_take isl_space *space, int n); __isl_give isl_pw_aff *isl_pw_aff_reset_space(__isl_take isl_pw_aff *pwaff, __isl_take isl_space *dim); __isl_give isl_pw_aff *isl_pw_aff_reset_domain_space( __isl_take isl_pw_aff *pwaff, __isl_take isl_space *space); __isl_give isl_pw_aff *isl_pw_aff_add_disjoint( __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2); __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2, int max); __isl_give isl_pw_aff *isl_pw_aff_set_rational(__isl_take isl_pw_aff *pwaff); __isl_give isl_pw_aff_list *isl_pw_aff_list_set_rational( __isl_take isl_pw_aff_list *list); int isl_aff_check_match_domain_space(__isl_keep isl_aff *aff, __isl_keep isl_space *space); #undef BASE #define BASE aff #include __isl_give isl_multi_aff *isl_multi_aff_dup(__isl_keep isl_multi_aff *multi); __isl_give isl_multi_aff *isl_multi_aff_align_divs( __isl_take isl_multi_aff *maff); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_reset_domain_space( __isl_take isl_pw_multi_aff *pwmaff, __isl_take isl_space *space); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_reset_space( __isl_take isl_pw_multi_aff *pwmaff, __isl_take isl_space *space); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add_disjoint( __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_project_out( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned first, unsigned n); void isl_seq_substitute(isl_int *p, int pos, isl_int *subs, int p_len, int subs_len, isl_int v); void isl_seq_preimage(isl_int *dst, isl_int *src, __isl_keep isl_multi_aff *ma, int n_before, int n_after, int n_div_ma, int n_div_bmap, isl_int f, isl_int c1, isl_int c2, isl_int g, int has_denom); __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute( __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos, __isl_keep isl_pw_aff *subs); int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff *pa, __isl_keep isl_space *space); #undef BASE #define BASE pw_aff #include #endif cloog-0.18.2/isl/isl_input.c0000664000175000017500000022157612254313240012602 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include #include #include #include #include #include #include "isl_polynomial_private.h" #include #include #include #include #include struct variable { char *name; int pos; struct variable *next; }; struct vars { struct isl_ctx *ctx; int n; struct variable *v; }; static struct vars *vars_new(struct isl_ctx *ctx) { struct vars *v; v = isl_alloc_type(ctx, struct vars); if (!v) return NULL; v->ctx = ctx; v->n = 0; v->v = NULL; return v; } static void variable_free(struct variable *var) { while (var) { struct variable *next = var->next; free(var->name); free(var); var = next; } } static void vars_free(struct vars *v) { if (!v) return; variable_free(v->v); free(v); } static void vars_drop(struct vars *v, int n) { struct variable *var; if (!v || !v->v) return; v->n -= n; var = v->v; while (--n >= 0) { struct variable *next = var->next; free(var->name); free(var); var = next; } v->v = var; } static struct variable *variable_new(struct vars *v, const char *name, int len, int pos) { struct variable *var; var = isl_calloc_type(v->ctx, struct variable); if (!var) goto error; var->name = strdup(name); var->name[len] = '\0'; var->pos = pos; var->next = v->v; return var; error: variable_free(v->v); return NULL; } static int vars_pos(struct vars *v, const char *s, int len) { int pos; struct variable *q; if (len == -1) len = strlen(s); for (q = v->v; q; q = q->next) { if (strncmp(q->name, s, len) == 0 && q->name[len] == '\0') break; } if (q) pos = q->pos; else { pos = v->n; v->v = variable_new(v, s, len, v->n); if (!v->v) return -1; v->n++; } return pos; } static int vars_add_anon(struct vars *v) { v->v = variable_new(v, "", 0, v->n); if (!v->v) return -1; v->n++; return 0; } /* Obtain next token, with some preprocessing. * In particular, evaluate expressions of the form x^y, * with x and y values. */ static struct isl_token *next_token(struct isl_stream *s) { struct isl_token *tok, *tok2; tok = isl_stream_next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) return tok; if (!isl_stream_eat_if_available(s, '^')) return tok; tok2 = isl_stream_next_token(s); if (!tok2 || tok2->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok2, "expecting constant value"); goto error; } isl_int_pow_ui(tok->u.v, tok->u.v, isl_int_get_ui(tok2->u.v)); isl_token_free(tok2); return tok; error: isl_token_free(tok); isl_token_free(tok2); return NULL; } /* Read an isl_val from "s". * * The following token sequences are recognized * * "infty" -> infty * "-" "infty" -> -infty * "NaN" -> NaN * n "/" d -> n/d * v -> v * * where n, d and v are integer constants. */ __isl_give isl_val *isl_stream_read_val(struct isl_stream *s) { struct isl_token *tok = NULL; struct isl_token *tok2 = NULL; isl_val *val; tok = next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } if (tok->type == ISL_TOKEN_INFTY) { isl_token_free(tok); return isl_val_infty(s->ctx); } if (tok->type == '-' && isl_stream_eat_if_available(s, ISL_TOKEN_INFTY)) { isl_token_free(tok); return isl_val_neginfty(s->ctx); } if (tok->type == ISL_TOKEN_NAN) { isl_token_free(tok); return isl_val_nan(s->ctx); } if (tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting value"); goto error; } if (isl_stream_eat_if_available(s, '/')) { tok2 = next_token(s); if (!tok2) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } if (tok2->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok2, "expecting value"); goto error; } val = isl_val_rat_from_isl_int(s->ctx, tok->u.v, tok2->u.v); val = isl_val_normalize(val); } else { val = isl_val_int_from_isl_int(s->ctx, tok->u.v); } isl_token_free(tok); isl_token_free(tok2); return val; error: isl_token_free(tok); isl_token_free(tok2); return NULL; } /* Read an isl_val from "str". */ struct isl_val *isl_val_read_from_str(struct isl_ctx *ctx, const char *str) { isl_val *val; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; val = isl_stream_read_val(s); isl_stream_free(s); return val; } static int accept_cst_factor(struct isl_stream *s, isl_int *f) { struct isl_token *tok; tok = next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting constant value"); goto error; } isl_int_mul(*f, *f, tok->u.v); isl_token_free(tok); if (isl_stream_eat_if_available(s, '*')) return accept_cst_factor(s, f); return 0; error: isl_token_free(tok); return -1; } /* Given an affine expression aff, return an affine expression * for aff % d, with d the next token on the stream, which is * assumed to be a constant. * * We introduce an integer division q = [aff/d] and the result * is set to aff - d q. */ static __isl_give isl_pw_aff *affine_mod(struct isl_stream *s, struct vars *v, __isl_take isl_pw_aff *aff) { struct isl_token *tok; isl_pw_aff *q; tok = next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting constant value"); goto error; } q = isl_pw_aff_copy(aff); q = isl_pw_aff_scale_down(q, tok->u.v); q = isl_pw_aff_floor(q); q = isl_pw_aff_scale(q, tok->u.v); aff = isl_pw_aff_sub(aff, q); isl_token_free(tok); return aff; error: isl_pw_aff_free(aff); isl_token_free(tok); return NULL; } static __isl_give isl_pw_aff *accept_affine(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v); static __isl_give isl_pw_aff_list *accept_affine_list(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v); static __isl_give isl_pw_aff *accept_minmax(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v) { struct isl_token *tok; isl_pw_aff_list *list = NULL; int min; tok = isl_stream_next_token(s); if (!tok) goto error; min = tok->type == ISL_TOKEN_MIN; isl_token_free(tok); if (isl_stream_eat(s, '(')) goto error; list = accept_affine_list(s, isl_space_copy(dim), v); if (!list) goto error; if (isl_stream_eat(s, ')')) goto error; isl_space_free(dim); return min ? isl_pw_aff_list_min(list) : isl_pw_aff_list_max(list); error: isl_space_free(dim); isl_pw_aff_list_free(list); return NULL; } /* Is "tok" the start of an integer division? */ static int is_start_of_div(struct isl_token *tok) { if (!tok) return 0; if (tok->type == '[') return 1; if (tok->type == ISL_TOKEN_FLOOR) return 1; if (tok->type == ISL_TOKEN_CEIL) return 1; if (tok->type == ISL_TOKEN_FLOORD) return 1; if (tok->type == ISL_TOKEN_CEILD) return 1; return 0; } /* Read an integer division from "s" and return it as an isl_pw_aff. * * The integer division can be of the form * * [] * floor() * ceil() * floord(,) * ceild(,) */ static __isl_give isl_pw_aff *accept_div(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v) { struct isl_token *tok; int f = 0; int c = 0; int extra = 0; isl_pw_aff *pwaff = NULL; if (isl_stream_eat_if_available(s, ISL_TOKEN_FLOORD)) extra = f = 1; else if (isl_stream_eat_if_available(s, ISL_TOKEN_CEILD)) extra = c = 1; else if (isl_stream_eat_if_available(s, ISL_TOKEN_FLOOR)) f = 1; else if (isl_stream_eat_if_available(s, ISL_TOKEN_CEIL)) c = 1; if (f || c) { if (isl_stream_eat(s, '(')) goto error; } else { if (isl_stream_eat(s, '[')) goto error; } pwaff = accept_affine(s, isl_space_copy(dim), v); if (extra) { if (isl_stream_eat(s, ',')) goto error; tok = next_token(s); if (!tok) goto error; if (tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expected denominator"); isl_stream_push_token(s, tok); goto error; } isl_pw_aff_scale_down(pwaff, tok->u.v); isl_token_free(tok); } if (c) pwaff = isl_pw_aff_ceil(pwaff); else pwaff = isl_pw_aff_floor(pwaff); if (f || c) { if (isl_stream_eat(s, ')')) goto error; } else { if (isl_stream_eat(s, ']')) goto error; } isl_space_free(dim); return pwaff; error: isl_space_free(dim); isl_pw_aff_free(pwaff); return NULL; } static __isl_give isl_pw_aff *accept_affine_factor(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v) { struct isl_token *tok = NULL; isl_pw_aff *res = NULL; tok = next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } if (tok->type == ISL_TOKEN_AFF) { res = isl_pw_aff_copy(tok->u.pwaff); isl_token_free(tok); } else if (tok->type == ISL_TOKEN_IDENT) { int n = v->n; int pos = vars_pos(v, tok->u.s, -1); isl_aff *aff; if (pos < 0) goto error; if (pos >= n) { vars_drop(v, v->n - n); isl_stream_error(s, tok, "unknown identifier"); goto error; } aff = isl_aff_zero_on_domain(isl_local_space_from_space(isl_space_copy(dim))); if (!aff) goto error; isl_int_set_si(aff->v->el[2 + pos], 1); res = isl_pw_aff_from_aff(aff); isl_token_free(tok); } else if (tok->type == ISL_TOKEN_VALUE) { if (isl_stream_eat_if_available(s, '*')) { res = accept_affine_factor(s, isl_space_copy(dim), v); res = isl_pw_aff_scale(res, tok->u.v); } else { isl_local_space *ls; isl_aff *aff; ls = isl_local_space_from_space(isl_space_copy(dim)); aff = isl_aff_zero_on_domain(ls); aff = isl_aff_add_constant(aff, tok->u.v); res = isl_pw_aff_from_aff(aff); } isl_token_free(tok); } else if (tok->type == '(') { isl_token_free(tok); tok = NULL; res = accept_affine(s, isl_space_copy(dim), v); if (!res) goto error; if (isl_stream_eat(s, ')')) goto error; } else if (is_start_of_div(tok)) { isl_stream_push_token(s, tok); tok = NULL; res = accept_div(s, isl_space_copy(dim), v); } else if (tok->type == ISL_TOKEN_MIN || tok->type == ISL_TOKEN_MAX) { isl_stream_push_token(s, tok); tok = NULL; res = accept_minmax(s, isl_space_copy(dim), v); } else { isl_stream_error(s, tok, "expecting factor"); goto error; } if (isl_stream_eat_if_available(s, '%') || isl_stream_eat_if_available(s, ISL_TOKEN_MOD)) { isl_space_free(dim); return affine_mod(s, v, res); } if (isl_stream_eat_if_available(s, '*')) { isl_int f; isl_int_init(f); isl_int_set_si(f, 1); if (accept_cst_factor(s, &f) < 0) { isl_int_clear(f); goto error2; } res = isl_pw_aff_scale(res, f); isl_int_clear(f); } if (isl_stream_eat_if_available(s, '/')) { isl_int f; isl_int_init(f); isl_int_set_si(f, 1); if (accept_cst_factor(s, &f) < 0) { isl_int_clear(f); goto error2; } res = isl_pw_aff_scale_down(res, f); isl_int_clear(f); } isl_space_free(dim); return res; error: isl_token_free(tok); error2: isl_pw_aff_free(res); isl_space_free(dim); return NULL; } static __isl_give isl_pw_aff *add_cst(__isl_take isl_pw_aff *pwaff, isl_int v) { isl_aff *aff; isl_space *space; space = isl_pw_aff_get_domain_space(pwaff); aff = isl_aff_zero_on_domain(isl_local_space_from_space(space)); aff = isl_aff_add_constant(aff, v); return isl_pw_aff_add(pwaff, isl_pw_aff_from_aff(aff)); } static __isl_give isl_pw_aff *accept_affine(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v) { struct isl_token *tok = NULL; isl_local_space *ls; isl_pw_aff *res; int sign = 1; ls = isl_local_space_from_space(isl_space_copy(dim)); res = isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls)); if (!res) goto error; for (;;) { tok = next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } if (tok->type == '-') { sign = -sign; isl_token_free(tok); continue; } if (tok->type == '(' || is_start_of_div(tok) || tok->type == ISL_TOKEN_MIN || tok->type == ISL_TOKEN_MAX || tok->type == ISL_TOKEN_IDENT || tok->type == ISL_TOKEN_AFF) { isl_pw_aff *term; isl_stream_push_token(s, tok); tok = NULL; term = accept_affine_factor(s, isl_space_copy(dim), v); if (sign < 0) res = isl_pw_aff_sub(res, term); else res = isl_pw_aff_add(res, term); if (!res) goto error; sign = 1; } else if (tok->type == ISL_TOKEN_VALUE) { if (sign < 0) isl_int_neg(tok->u.v, tok->u.v); if (isl_stream_eat_if_available(s, '*') || isl_stream_next_token_is(s, ISL_TOKEN_IDENT)) { isl_pw_aff *term; term = accept_affine_factor(s, isl_space_copy(dim), v); term = isl_pw_aff_scale(term, tok->u.v); res = isl_pw_aff_add(res, term); if (!res) goto error; } else { res = add_cst(res, tok->u.v); } sign = 1; } else { isl_stream_error(s, tok, "unexpected isl_token"); isl_stream_push_token(s, tok); isl_pw_aff_free(res); isl_space_free(dim); return NULL; } isl_token_free(tok); tok = next_token(s); if (tok && tok->type == '-') { sign = -sign; isl_token_free(tok); } else if (tok && tok->type == '+') { /* nothing */ isl_token_free(tok); } else if (tok && tok->type == ISL_TOKEN_VALUE && isl_int_is_neg(tok->u.v)) { isl_stream_push_token(s, tok); } else { if (tok) isl_stream_push_token(s, tok); break; } } isl_space_free(dim); return res; error: isl_space_free(dim); isl_token_free(tok); isl_pw_aff_free(res); return NULL; } static int is_comparator(struct isl_token *tok) { if (!tok) return 0; switch (tok->type) { case ISL_TOKEN_LT: case ISL_TOKEN_GT: case ISL_TOKEN_LE: case ISL_TOKEN_GE: case ISL_TOKEN_NE: case '=': return 1; default: return 0; } } static __isl_give isl_map *read_formula(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational); static __isl_give isl_pw_aff *accept_extended_affine(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v, int rational); /* Accept a ternary operator, given the first argument. */ static __isl_give isl_pw_aff *accept_ternary(struct isl_stream *s, __isl_take isl_map *cond, struct vars *v, int rational) { isl_space *dim; isl_pw_aff *pwaff1 = NULL, *pwaff2 = NULL, *pa_cond; if (!cond) return NULL; if (isl_stream_eat(s, '?')) goto error; dim = isl_space_wrap(isl_map_get_space(cond)); pwaff1 = accept_extended_affine(s, dim, v, rational); if (!pwaff1) goto error; if (isl_stream_eat(s, ':')) goto error; dim = isl_pw_aff_get_domain_space(pwaff1); pwaff2 = accept_extended_affine(s, dim, v, rational); if (!pwaff1) goto error; pa_cond = isl_set_indicator_function(isl_map_wrap(cond)); return isl_pw_aff_cond(pa_cond, pwaff1, pwaff2); error: isl_map_free(cond); isl_pw_aff_free(pwaff1); isl_pw_aff_free(pwaff2); return NULL; } /* Accept an affine expression that may involve ternary operators. * We first read an affine expression. * If it is not followed by a comparison operator, we simply return it. * Otherwise, we assume the affine epxression is part of the first * argument of a ternary operator and try to parse that. */ static __isl_give isl_pw_aff *accept_extended_affine(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v, int rational) { isl_space *space; isl_map *cond; isl_pw_aff *pwaff; struct isl_token *tok; int line = -1, col = -1; int is_comp; tok = isl_stream_next_token(s); if (tok) { line = tok->line; col = tok->col; isl_stream_push_token(s, tok); } pwaff = accept_affine(s, dim, v); if (rational) pwaff = isl_pw_aff_set_rational(pwaff); if (!pwaff) return NULL; tok = isl_stream_next_token(s); if (!tok) return isl_pw_aff_free(pwaff); is_comp = is_comparator(tok); isl_stream_push_token(s, tok); if (!is_comp) return pwaff; tok = isl_token_new(s->ctx, line, col, 0); if (!tok) return isl_pw_aff_free(pwaff); tok->type = ISL_TOKEN_AFF; tok->u.pwaff = pwaff; space = isl_pw_aff_get_domain_space(pwaff); cond = isl_map_universe(isl_space_unwrap(space)); isl_stream_push_token(s, tok); cond = read_formula(s, v, cond, rational); return accept_ternary(s, cond, v, rational); } static __isl_give isl_map *read_var_def(struct isl_stream *s, __isl_take isl_map *map, enum isl_dim_type type, struct vars *v, int rational) { isl_pw_aff *def; int pos; isl_map *def_map; if (type == isl_dim_param) pos = isl_map_dim(map, isl_dim_param); else { pos = isl_map_dim(map, isl_dim_in); if (type == isl_dim_out) pos += isl_map_dim(map, isl_dim_out); type = isl_dim_in; } --pos; def = accept_extended_affine(s, isl_space_wrap(isl_map_get_space(map)), v, rational); def_map = isl_map_from_pw_aff(def); def_map = isl_map_equate(def_map, type, pos, isl_dim_out, 0); def_map = isl_set_unwrap(isl_map_domain(def_map)); map = isl_map_intersect(map, def_map); return map; } static __isl_give isl_pw_aff_list *accept_affine_list(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v) { isl_pw_aff *pwaff; isl_pw_aff_list *list; struct isl_token *tok = NULL; pwaff = accept_affine(s, isl_space_copy(dim), v); list = isl_pw_aff_list_from_pw_aff(pwaff); if (!list) goto error; for (;;) { tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } if (tok->type != ',') { isl_stream_push_token(s, tok); break; } isl_token_free(tok); pwaff = accept_affine(s, isl_space_copy(dim), v); list = isl_pw_aff_list_concat(list, isl_pw_aff_list_from_pw_aff(pwaff)); if (!list) goto error; } isl_space_free(dim); return list; error: isl_space_free(dim); isl_pw_aff_list_free(list); return NULL; } static __isl_give isl_map *read_defined_var_list(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { struct isl_token *tok; while ((tok = isl_stream_next_token(s)) != NULL) { int p; int n = v->n; if (tok->type != ISL_TOKEN_IDENT) break; p = vars_pos(v, tok->u.s, -1); if (p < 0) goto error; if (p < n) { isl_stream_error(s, tok, "expecting unique identifier"); goto error; } map = isl_map_add_dims(map, isl_dim_out, 1); isl_token_free(tok); tok = isl_stream_next_token(s); if (tok && tok->type == '=') { isl_token_free(tok); map = read_var_def(s, map, isl_dim_out, v, rational); tok = isl_stream_next_token(s); } if (!tok || tok->type != ',') break; isl_token_free(tok); } if (tok) isl_stream_push_token(s, tok); return map; error: isl_token_free(tok); isl_map_free(map); return NULL; } static int next_is_tuple(struct isl_stream *s) { struct isl_token *tok; int is_tuple; tok = isl_stream_next_token(s); if (!tok) return 0; if (tok->type == '[') { isl_stream_push_token(s, tok); return 1; } if (tok->type != ISL_TOKEN_IDENT && !tok->is_keyword) { isl_stream_push_token(s, tok); return 0; } is_tuple = isl_stream_next_token_is(s, '['); isl_stream_push_token(s, tok); return is_tuple; } /* Allocate an initial tuple with zero dimensions and an anonymous, * unstructured space. * A tuple is represented as an isl_multi_pw_aff. * The range space is the space of the tuple. * The domain space is an anonymous space * with a dimension for each variable in the set of variables in "v". * If a given dimension is not defined in terms of earlier dimensions in * the input, then the corresponding isl_pw_aff is set equal to one time * the variable corresponding to the dimension being defined. */ static __isl_give isl_multi_pw_aff *tuple_alloc(struct vars *v) { return isl_multi_pw_aff_alloc(isl_space_alloc(v->ctx, 0, v->n, 0)); } /* Is "pa" an expression in term of earlier dimensions? * The alternative is that the dimension is defined to be equal to itself, * meaning that it has a universe domain and an expression that depends * on itself. "i" is the position of the expression in a sequence * of "n" expressions. The final dimensions of "pa" correspond to * these "n" expressions. */ static int pw_aff_is_expr(__isl_keep isl_pw_aff *pa, int i, int n) { isl_aff *aff; if (!pa) return -1; if (pa->n != 1) return 1; if (!isl_set_plain_is_universe(pa->p[0].set)) return 1; aff = pa->p[0].aff; if (isl_int_is_zero(aff->v->el[aff->v->size - n + i])) return 1; return 0; } /* Does the tuple contain any dimensions that are defined * in terms of earlier dimensions? */ static int tuple_has_expr(__isl_keep isl_multi_pw_aff *tuple) { int i, n; int has_expr = 0; isl_pw_aff *pa; if (!tuple) return -1; n = isl_multi_pw_aff_dim(tuple, isl_dim_out); for (i = 0; i < n; ++i) { pa = isl_multi_pw_aff_get_pw_aff(tuple, i); has_expr = pw_aff_is_expr(pa, i, n); isl_pw_aff_free(pa); if (has_expr < 0 || has_expr) break; } return has_expr; } /* Add a dimension to the given tuple. * The dimension is initially undefined, so it is encoded * as one times itself. */ static __isl_give isl_multi_pw_aff *tuple_add_dim( __isl_take isl_multi_pw_aff *tuple, struct vars *v) { isl_space *space; isl_aff *aff; isl_pw_aff *pa; tuple = isl_multi_pw_aff_add_dims(tuple, isl_dim_in, 1); space = isl_multi_pw_aff_get_domain_space(tuple); aff = isl_aff_zero_on_domain(isl_local_space_from_space(space)); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, v->n, 1); pa = isl_pw_aff_from_aff(aff); tuple = isl_multi_pw_aff_flat_range_product(tuple, isl_multi_pw_aff_from_pw_aff(pa)); return tuple; } /* Set the name of dimension "pos" in "tuple" to "name". * During printing, we add primes if the same name appears more than once * to distinguish the occurrences. Here, we remove those primes from "name" * before setting the name of the dimension. */ static __isl_give isl_multi_pw_aff *tuple_set_dim_name( __isl_take isl_multi_pw_aff *tuple, int pos, char *name) { char *prime; if (!name) return tuple; prime = strchr(name, '\''); if (prime) *prime = '\0'; tuple = isl_multi_pw_aff_set_dim_name(tuple, isl_dim_set, pos, name); if (prime) *prime = '\''; return tuple; } /* Read an affine expression from "s" and replace the definition * of dimension "pos" in "tuple" by this expression. * * accept_extended_affine requires a wrapped space as input. * The domain space of "tuple", on the other hand is an anonymous space, * so we have to adjust the space of the isl_pw_aff before adding it * to "tuple". */ static __isl_give isl_multi_pw_aff *read_tuple_var_def(struct isl_stream *s, __isl_take isl_multi_pw_aff *tuple, int pos, struct vars *v, int rational) { isl_space *space; isl_pw_aff *def; space = isl_space_wrap(isl_space_alloc(s->ctx, 0, v->n, 0)); def = accept_extended_affine(s, space, v, rational); space = isl_space_set_alloc(s->ctx, 0, v->n); def = isl_pw_aff_reset_domain_space(def, space); tuple = isl_multi_pw_aff_set_pw_aff(tuple, pos, def); return tuple; } /* Read a list of variables and/or affine expressions and return the list * as an isl_multi_pw_aff. * The elements in the list are separated by either "," or "][". * If "comma" is set then only "," is allowed. */ static __isl_give isl_multi_pw_aff *read_tuple_var_list(struct isl_stream *s, struct vars *v, int rational, int comma) { int i = 0; struct isl_token *tok; isl_multi_pw_aff *res; res = tuple_alloc(v); if (isl_stream_next_token_is(s, ']')) return res; while ((tok = next_token(s)) != NULL) { int new_name = 0; res = tuple_add_dim(res, v); if (tok->type == ISL_TOKEN_IDENT) { int n = v->n; int p = vars_pos(v, tok->u.s, -1); if (p < 0) goto error; new_name = p >= n; } if (tok->type == '*') { if (vars_add_anon(v) < 0) goto error; isl_token_free(tok); } else if (new_name) { res = tuple_set_dim_name(res, i, v->v->name); isl_token_free(tok); if (isl_stream_eat_if_available(s, '=')) res = read_tuple_var_def(s, res, i, v, rational); } else { isl_stream_push_token(s, tok); tok = NULL; if (vars_add_anon(v) < 0) goto error; res = read_tuple_var_def(s, res, i, v, rational); } tok = isl_stream_next_token(s); if (!comma && tok && tok->type == ']' && isl_stream_next_token_is(s, '[')) { isl_token_free(tok); tok = isl_stream_next_token(s); } else if (!tok || tok->type != ',') break; isl_token_free(tok); i++; } if (tok) isl_stream_push_token(s, tok); return res; error: isl_token_free(tok); return isl_multi_pw_aff_free(res); } /* Read a tuple and represent it as an isl_multi_pw_aff. See tuple_alloc. */ static __isl_give isl_multi_pw_aff *read_tuple(struct isl_stream *s, struct vars *v, int rational, int comma) { struct isl_token *tok; char *name = NULL; isl_multi_pw_aff *res = NULL; tok = isl_stream_next_token(s); if (!tok) goto error; if (tok->type == ISL_TOKEN_IDENT || tok->is_keyword) { name = strdup(tok->u.s); isl_token_free(tok); if (!name) goto error; } else isl_stream_push_token(s, tok); if (isl_stream_eat(s, '[')) goto error; if (next_is_tuple(s)) { isl_multi_pw_aff *out; int n; res = read_tuple(s, v, rational, comma); if (isl_stream_eat(s, ISL_TOKEN_TO)) goto error; out = read_tuple(s, v, rational, comma); n = isl_multi_pw_aff_dim(out, isl_dim_out); res = isl_multi_pw_aff_add_dims(res, isl_dim_in, n); res = isl_multi_pw_aff_range_product(res, out); } else res = read_tuple_var_list(s, v, rational, comma); if (isl_stream_eat(s, ']')) goto error; if (name) { res = isl_multi_pw_aff_set_tuple_name(res, isl_dim_out, name); free(name); } return res; error: free(name); return isl_multi_pw_aff_free(res); } /* Read a tuple from "s" and add it to "map". * The tuple is initially represented as an isl_multi_pw_aff. * We first create the appropriate space in "map" based on the range * space of this isl_multi_pw_aff. Then, we add equalities based * on the affine expressions. These live in an anonymous space, * however, so we first need to reset the space to that of "map". */ static __isl_give isl_map *read_map_tuple(struct isl_stream *s, __isl_take isl_map *map, enum isl_dim_type type, struct vars *v, int rational, int comma) { int i, n; isl_multi_pw_aff *tuple; isl_space *space = NULL; tuple = read_tuple(s, v, rational, comma); if (!tuple) goto error; n = isl_multi_pw_aff_dim(tuple, isl_dim_out); space = isl_space_range(isl_multi_pw_aff_get_space(tuple)); if (!space) goto error; if (type == isl_dim_param) { if (isl_space_has_tuple_name(space, isl_dim_set) || isl_space_is_wrapping(space)) { isl_die(s->ctx, isl_error_invalid, "parameter tuples cannot be named or nested", goto error); } map = isl_map_add_dims(map, type, n); for (i = 0; i < n; ++i) { isl_id *id; if (!isl_space_has_dim_name(space, isl_dim_set, i)) isl_die(s->ctx, isl_error_invalid, "parameters must be named", goto error); id = isl_space_get_dim_id(space, isl_dim_set, i); map = isl_map_set_dim_id(map, isl_dim_param, i, id); } } else if (type == isl_dim_in) { isl_set *set; set = isl_set_universe(isl_space_copy(space)); if (rational) set = isl_set_set_rational(set); set = isl_set_intersect_params(set, isl_map_params(map)); map = isl_map_from_domain(set); } else { isl_set *set; set = isl_set_universe(isl_space_copy(space)); if (rational) set = isl_set_set_rational(set); map = isl_map_from_domain_and_range(isl_map_domain(map), set); } for (i = 0; i < n; ++i) { isl_pw_aff *pa; isl_space *space; isl_aff *aff; isl_set *set; isl_map *map_i; pa = isl_multi_pw_aff_get_pw_aff(tuple, i); space = isl_pw_aff_get_domain_space(pa); aff = isl_aff_zero_on_domain(isl_local_space_from_space(space)); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, v->n - n + i, -1); pa = isl_pw_aff_add(pa, isl_pw_aff_from_aff(aff)); if (rational) pa = isl_pw_aff_set_rational(pa); set = isl_pw_aff_zero_set(pa); map_i = isl_map_from_range(set); map_i = isl_map_reset_space(map_i, isl_map_get_space(map)); map = isl_map_intersect(map, map_i); } isl_space_free(space); isl_multi_pw_aff_free(tuple); return map; error: isl_space_free(space); isl_multi_pw_aff_free(tuple); isl_map_free(map); return NULL; } static __isl_give isl_set *construct_constraints( __isl_take isl_set *set, int type, __isl_keep isl_pw_aff_list *left, __isl_keep isl_pw_aff_list *right, int rational) { isl_set *cond; left = isl_pw_aff_list_copy(left); right = isl_pw_aff_list_copy(right); if (rational) { left = isl_pw_aff_list_set_rational(left); right = isl_pw_aff_list_set_rational(right); } if (type == ISL_TOKEN_LE) cond = isl_pw_aff_list_le_set(left, right); else if (type == ISL_TOKEN_GE) cond = isl_pw_aff_list_ge_set(left, right); else if (type == ISL_TOKEN_LT) cond = isl_pw_aff_list_lt_set(left, right); else if (type == ISL_TOKEN_GT) cond = isl_pw_aff_list_gt_set(left, right); else if (type == ISL_TOKEN_NE) cond = isl_pw_aff_list_ne_set(left, right); else cond = isl_pw_aff_list_eq_set(left, right); return isl_set_intersect(set, cond); } static __isl_give isl_map *add_constraint(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { struct isl_token *tok = NULL; isl_pw_aff_list *list1 = NULL, *list2 = NULL; isl_set *set; set = isl_map_wrap(map); list1 = accept_affine_list(s, isl_set_get_space(set), v); if (!list1) goto error; tok = isl_stream_next_token(s); if (!is_comparator(tok)) { isl_stream_error(s, tok, "missing operator"); if (tok) isl_stream_push_token(s, tok); tok = NULL; goto error; } for (;;) { list2 = accept_affine_list(s, isl_set_get_space(set), v); if (!list2) goto error; set = construct_constraints(set, tok->type, list1, list2, rational); isl_token_free(tok); isl_pw_aff_list_free(list1); list1 = list2; tok = isl_stream_next_token(s); if (!is_comparator(tok)) { if (tok) isl_stream_push_token(s, tok); break; } } isl_pw_aff_list_free(list1); return isl_set_unwrap(set); error: if (tok) isl_token_free(tok); isl_pw_aff_list_free(list1); isl_pw_aff_list_free(list2); isl_set_free(set); return NULL; } static __isl_give isl_map *read_exists(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { int n = v->n; int seen_paren = isl_stream_eat_if_available(s, '('); map = isl_map_from_domain(isl_map_wrap(map)); map = read_defined_var_list(s, v, map, rational); if (isl_stream_eat(s, ':')) goto error; map = read_formula(s, v, map, rational); map = isl_set_unwrap(isl_map_domain(map)); vars_drop(v, v->n - n); if (seen_paren && isl_stream_eat(s, ')')) goto error; return map; error: isl_map_free(map); return NULL; } /* Parse an expression between parentheses and push the result * back on the stream. * * The parsed expression may be either an affine expression * or a condition. The first type is pushed onto the stream * as an isl_pw_aff, while the second is pushed as an isl_map. * * If the initial token indicates the start of a condition, * we parse it as such. * Otherwise, we first parse an affine expression and push * that onto the stream. If the affine expression covers the * entire expression between parentheses, we return. * Otherwise, we assume that the affine expression is the * start of a condition and continue parsing. */ static int resolve_paren_expr(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { struct isl_token *tok, *tok2; int line, col; isl_pw_aff *pwaff; tok = isl_stream_next_token(s); if (!tok || tok->type != '(') goto error; if (isl_stream_next_token_is(s, '(')) if (resolve_paren_expr(s, v, isl_map_copy(map), rational)) goto error; if (isl_stream_next_token_is(s, ISL_TOKEN_EXISTS) || isl_stream_next_token_is(s, ISL_TOKEN_NOT) || isl_stream_next_token_is(s, ISL_TOKEN_TRUE) || isl_stream_next_token_is(s, ISL_TOKEN_FALSE) || isl_stream_next_token_is(s, ISL_TOKEN_MAP)) { map = read_formula(s, v, map, rational); if (isl_stream_eat(s, ')')) goto error; tok->type = ISL_TOKEN_MAP; tok->u.map = map; isl_stream_push_token(s, tok); return 0; } tok2 = isl_stream_next_token(s); if (!tok2) goto error; line = tok2->line; col = tok2->col; isl_stream_push_token(s, tok2); pwaff = accept_affine(s, isl_space_wrap(isl_map_get_space(map)), v); if (!pwaff) goto error; tok2 = isl_token_new(s->ctx, line, col, 0); if (!tok2) goto error2; tok2->type = ISL_TOKEN_AFF; tok2->u.pwaff = pwaff; if (isl_stream_eat_if_available(s, ')')) { isl_stream_push_token(s, tok2); isl_token_free(tok); isl_map_free(map); return 0; } isl_stream_push_token(s, tok2); map = read_formula(s, v, map, rational); if (isl_stream_eat(s, ')')) goto error; tok->type = ISL_TOKEN_MAP; tok->u.map = map; isl_stream_push_token(s, tok); return 0; error2: isl_pw_aff_free(pwaff); error: isl_token_free(tok); isl_map_free(map); return -1; } static __isl_give isl_map *read_conjunct(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { if (isl_stream_next_token_is(s, '(')) if (resolve_paren_expr(s, v, isl_map_copy(map), rational)) goto error; if (isl_stream_next_token_is(s, ISL_TOKEN_MAP)) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) goto error; isl_map_free(map); map = isl_map_copy(tok->u.map); isl_token_free(tok); return map; } if (isl_stream_eat_if_available(s, ISL_TOKEN_EXISTS)) return read_exists(s, v, map, rational); if (isl_stream_eat_if_available(s, ISL_TOKEN_TRUE)) return map; if (isl_stream_eat_if_available(s, ISL_TOKEN_FALSE)) { isl_space *dim = isl_map_get_space(map); isl_map_free(map); return isl_map_empty(dim); } return add_constraint(s, v, map, rational); error: isl_map_free(map); return NULL; } static __isl_give isl_map *read_conjuncts(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { isl_map *res; int negate; negate = isl_stream_eat_if_available(s, ISL_TOKEN_NOT); res = read_conjunct(s, v, isl_map_copy(map), rational); if (negate) res = isl_map_subtract(isl_map_copy(map), res); while (res && isl_stream_eat_if_available(s, ISL_TOKEN_AND)) { isl_map *res_i; negate = isl_stream_eat_if_available(s, ISL_TOKEN_NOT); res_i = read_conjunct(s, v, isl_map_copy(map), rational); if (negate) res = isl_map_subtract(res, res_i); else res = isl_map_intersect(res, res_i); } isl_map_free(map); return res; } static struct isl_map *read_disjuncts(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { isl_map *res; if (isl_stream_next_token_is(s, '}')) { isl_space *dim = isl_map_get_space(map); isl_map_free(map); return isl_map_universe(dim); } res = read_conjuncts(s, v, isl_map_copy(map), rational); while (isl_stream_eat_if_available(s, ISL_TOKEN_OR)) { isl_map *res_i; res_i = read_conjuncts(s, v, isl_map_copy(map), rational); res = isl_map_union(res, res_i); } isl_map_free(map); return res; } /* Read a first order formula from "s", add the corresponding * constraints to "map" and return the result. * * In particular, read a formula of the form * * a * * or * * a implies b * * where a and b are disjunctions. * * In the first case, map is replaced by * * map \cap { [..] : a } * * In the second case, it is replaced by * * (map \setminus { [..] : a}) \cup (map \cap { [..] : b }) */ static __isl_give isl_map *read_formula(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) { isl_map *res; res = read_disjuncts(s, v, isl_map_copy(map), rational); if (isl_stream_eat_if_available(s, ISL_TOKEN_IMPLIES)) { isl_map *res2; res = isl_map_subtract(isl_map_copy(map), res); res2 = read_disjuncts(s, v, map, rational); res = isl_map_union(res, res2); } else isl_map_free(map); return res; } static int polylib_pos_to_isl_pos(__isl_keep isl_basic_map *bmap, int pos) { if (pos < isl_basic_map_dim(bmap, isl_dim_out)) return 1 + isl_basic_map_dim(bmap, isl_dim_param) + isl_basic_map_dim(bmap, isl_dim_in) + pos; pos -= isl_basic_map_dim(bmap, isl_dim_out); if (pos < isl_basic_map_dim(bmap, isl_dim_in)) return 1 + isl_basic_map_dim(bmap, isl_dim_param) + pos; pos -= isl_basic_map_dim(bmap, isl_dim_in); if (pos < isl_basic_map_dim(bmap, isl_dim_div)) return 1 + isl_basic_map_dim(bmap, isl_dim_param) + isl_basic_map_dim(bmap, isl_dim_in) + isl_basic_map_dim(bmap, isl_dim_out) + pos; pos -= isl_basic_map_dim(bmap, isl_dim_div); if (pos < isl_basic_map_dim(bmap, isl_dim_param)) return 1 + pos; return 0; } static __isl_give isl_basic_map *basic_map_read_polylib_constraint( struct isl_stream *s, __isl_take isl_basic_map *bmap) { int j; struct isl_token *tok; int type; int k; isl_int *c; unsigned nparam; unsigned dim; if (!bmap) return NULL; nparam = isl_basic_map_dim(bmap, isl_dim_param); dim = isl_basic_map_dim(bmap, isl_dim_out); tok = isl_stream_next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting coefficient"); if (tok) isl_stream_push_token(s, tok); goto error; } if (!tok->on_new_line) { isl_stream_error(s, tok, "coefficient should appear on new line"); isl_stream_push_token(s, tok); goto error; } type = isl_int_get_si(tok->u.v); isl_token_free(tok); isl_assert(s->ctx, type == 0 || type == 1, goto error); if (type == 0) { k = isl_basic_map_alloc_equality(bmap); c = bmap->eq[k]; } else { k = isl_basic_map_alloc_inequality(bmap); c = bmap->ineq[k]; } if (k < 0) goto error; for (j = 0; j < 1 + isl_basic_map_total_dim(bmap); ++j) { int pos; tok = isl_stream_next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting coefficient"); if (tok) isl_stream_push_token(s, tok); goto error; } if (tok->on_new_line) { isl_stream_error(s, tok, "coefficient should not appear on new line"); isl_stream_push_token(s, tok); goto error; } pos = polylib_pos_to_isl_pos(bmap, j); isl_int_set(c[pos], tok->u.v); isl_token_free(tok); } return bmap; error: isl_basic_map_free(bmap); return NULL; } static __isl_give isl_basic_map *basic_map_read_polylib(struct isl_stream *s) { int i; struct isl_token *tok; struct isl_token *tok2; int n_row, n_col; int on_new_line; unsigned in = 0, out, local = 0; struct isl_basic_map *bmap = NULL; int nparam = 0; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } tok2 = isl_stream_next_token(s); if (!tok2) { isl_token_free(tok); isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } if (tok->type != ISL_TOKEN_VALUE || tok2->type != ISL_TOKEN_VALUE) { isl_stream_push_token(s, tok2); isl_stream_push_token(s, tok); isl_stream_error(s, NULL, "expecting constraint matrix dimensions"); return NULL; } n_row = isl_int_get_si(tok->u.v); n_col = isl_int_get_si(tok2->u.v); on_new_line = tok2->on_new_line; isl_token_free(tok2); isl_token_free(tok); isl_assert(s->ctx, !on_new_line, return NULL); isl_assert(s->ctx, n_row >= 0, return NULL); isl_assert(s->ctx, n_col >= 2 + nparam, return NULL); tok = isl_stream_next_token_on_same_line(s); if (tok) { if (tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting number of output dimensions"); isl_stream_push_token(s, tok); goto error; } out = isl_int_get_si(tok->u.v); isl_token_free(tok); tok = isl_stream_next_token_on_same_line(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting number of input dimensions"); if (tok) isl_stream_push_token(s, tok); goto error; } in = isl_int_get_si(tok->u.v); isl_token_free(tok); tok = isl_stream_next_token_on_same_line(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting number of existentials"); if (tok) isl_stream_push_token(s, tok); goto error; } local = isl_int_get_si(tok->u.v); isl_token_free(tok); tok = isl_stream_next_token_on_same_line(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting number of parameters"); if (tok) isl_stream_push_token(s, tok); goto error; } nparam = isl_int_get_si(tok->u.v); isl_token_free(tok); if (n_col != 1 + out + in + local + nparam + 1) { isl_stream_error(s, NULL, "dimensions don't match"); goto error; } } else out = n_col - 2 - nparam; bmap = isl_basic_map_alloc(s->ctx, nparam, in, out, local, n_row, n_row); if (!bmap) return NULL; for (i = 0; i < local; ++i) { int k = isl_basic_map_alloc_div(bmap); if (k < 0) goto error; isl_seq_clr(bmap->div[k], 1 + 1 + nparam + in + out + local); } for (i = 0; i < n_row; ++i) bmap = basic_map_read_polylib_constraint(s, bmap); tok = isl_stream_next_token_on_same_line(s); if (tok) { isl_stream_error(s, tok, "unexpected extra token on line"); isl_stream_push_token(s, tok); goto error; } bmap = isl_basic_map_simplify(bmap); bmap = isl_basic_map_finalize(bmap); return bmap; error: isl_basic_map_free(bmap); return NULL; } static struct isl_map *map_read_polylib(struct isl_stream *s) { struct isl_token *tok; struct isl_token *tok2; int i, n; struct isl_map *map; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } tok2 = isl_stream_next_token_on_same_line(s); if (tok2 && tok2->type == ISL_TOKEN_VALUE) { isl_stream_push_token(s, tok2); isl_stream_push_token(s, tok); return isl_map_from_basic_map(basic_map_read_polylib(s)); } if (tok2) { isl_stream_error(s, tok2, "unexpected token"); isl_stream_push_token(s, tok2); isl_stream_push_token(s, tok); return NULL; } n = isl_int_get_si(tok->u.v); isl_token_free(tok); isl_assert(s->ctx, n >= 1, return NULL); map = isl_map_from_basic_map(basic_map_read_polylib(s)); for (i = 1; map && i < n; ++i) map = isl_map_union(map, isl_map_from_basic_map(basic_map_read_polylib(s))); return map; } static int optional_power(struct isl_stream *s) { int pow; struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return 1; if (tok->type != '^') { isl_stream_push_token(s, tok); return 1; } isl_token_free(tok); tok = isl_stream_next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting exponent"); if (tok) isl_stream_push_token(s, tok); return 1; } pow = isl_int_get_si(tok->u.v); isl_token_free(tok); return pow; } static __isl_give isl_pw_qpolynomial *read_term(struct isl_stream *s, __isl_keep isl_map *map, struct vars *v); static __isl_give isl_pw_qpolynomial *read_factor(struct isl_stream *s, __isl_keep isl_map *map, struct vars *v) { isl_pw_qpolynomial *pwqp; struct isl_token *tok; tok = next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); return NULL; } if (tok->type == '(') { int pow; isl_token_free(tok); pwqp = read_term(s, map, v); if (!pwqp) return NULL; if (isl_stream_eat(s, ')')) goto error; pow = optional_power(s); pwqp = isl_pw_qpolynomial_pow(pwqp, pow); } else if (tok->type == ISL_TOKEN_VALUE) { struct isl_token *tok2; isl_qpolynomial *qp; tok2 = isl_stream_next_token(s); if (tok2 && tok2->type == '/') { isl_token_free(tok2); tok2 = next_token(s); if (!tok2 || tok2->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok2, "expected denominator"); isl_token_free(tok); isl_token_free(tok2); return NULL; } qp = isl_qpolynomial_rat_cst_on_domain(isl_map_get_space(map), tok->u.v, tok2->u.v); isl_token_free(tok2); } else { isl_stream_push_token(s, tok2); qp = isl_qpolynomial_cst_on_domain(isl_map_get_space(map), tok->u.v); } isl_token_free(tok); pwqp = isl_pw_qpolynomial_from_qpolynomial(qp); } else if (tok->type == ISL_TOKEN_INFTY) { isl_qpolynomial *qp; isl_token_free(tok); qp = isl_qpolynomial_infty_on_domain(isl_map_get_space(map)); pwqp = isl_pw_qpolynomial_from_qpolynomial(qp); } else if (tok->type == ISL_TOKEN_NAN) { isl_qpolynomial *qp; isl_token_free(tok); qp = isl_qpolynomial_nan_on_domain(isl_map_get_space(map)); pwqp = isl_pw_qpolynomial_from_qpolynomial(qp); } else if (tok->type == ISL_TOKEN_IDENT) { int n = v->n; int pos = vars_pos(v, tok->u.s, -1); int pow; isl_qpolynomial *qp; if (pos < 0) { isl_token_free(tok); return NULL; } if (pos >= n) { vars_drop(v, v->n - n); isl_stream_error(s, tok, "unknown identifier"); isl_token_free(tok); return NULL; } isl_token_free(tok); pow = optional_power(s); qp = isl_qpolynomial_var_pow_on_domain(isl_map_get_space(map), pos, pow); pwqp = isl_pw_qpolynomial_from_qpolynomial(qp); } else if (is_start_of_div(tok)) { isl_pw_aff *pwaff; int pow; isl_stream_push_token(s, tok); pwaff = accept_div(s, isl_map_get_space(map), v); pow = optional_power(s); pwqp = isl_pw_qpolynomial_from_pw_aff(pwaff); pwqp = isl_pw_qpolynomial_pow(pwqp, pow); } else if (tok->type == '-') { isl_token_free(tok); pwqp = read_factor(s, map, v); pwqp = isl_pw_qpolynomial_neg(pwqp); } else { isl_stream_error(s, tok, "unexpected isl_token"); isl_stream_push_token(s, tok); return NULL; } if (isl_stream_eat_if_available(s, '*') || isl_stream_next_token_is(s, ISL_TOKEN_IDENT)) { isl_pw_qpolynomial *pwqp2; pwqp2 = read_factor(s, map, v); pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp2); } return pwqp; error: isl_pw_qpolynomial_free(pwqp); return NULL; } static __isl_give isl_pw_qpolynomial *read_term(struct isl_stream *s, __isl_keep isl_map *map, struct vars *v) { struct isl_token *tok; isl_pw_qpolynomial *pwqp; pwqp = read_factor(s, map, v); for (;;) { tok = next_token(s); if (!tok) return pwqp; if (tok->type == '+') { isl_pw_qpolynomial *pwqp2; isl_token_free(tok); pwqp2 = read_factor(s, map, v); pwqp = isl_pw_qpolynomial_add(pwqp, pwqp2); } else if (tok->type == '-') { isl_pw_qpolynomial *pwqp2; isl_token_free(tok); pwqp2 = read_factor(s, map, v); pwqp = isl_pw_qpolynomial_sub(pwqp, pwqp2); } else if (tok->type == ISL_TOKEN_VALUE && isl_int_is_neg(tok->u.v)) { isl_pw_qpolynomial *pwqp2; isl_stream_push_token(s, tok); pwqp2 = read_factor(s, map, v); pwqp = isl_pw_qpolynomial_add(pwqp, pwqp2); } else { isl_stream_push_token(s, tok); break; } } return pwqp; } static __isl_give isl_map *read_optional_formula(struct isl_stream *s, __isl_take isl_map *map, struct vars *v, int rational) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } if (tok->type == ':' || (tok->type == ISL_TOKEN_OR && !strcmp(tok->u.s, "|"))) { isl_token_free(tok); map = read_formula(s, v, map, rational); } else isl_stream_push_token(s, tok); return map; error: isl_map_free(map); return NULL; } static struct isl_obj obj_read_poly(struct isl_stream *s, __isl_take isl_map *map, struct vars *v, int n) { struct isl_obj obj = { isl_obj_pw_qpolynomial, NULL }; isl_pw_qpolynomial *pwqp; struct isl_set *set; pwqp = read_term(s, map, v); map = read_optional_formula(s, map, v, 0); set = isl_map_range(map); pwqp = isl_pw_qpolynomial_intersect_domain(pwqp, set); vars_drop(v, v->n - n); obj.v = pwqp; return obj; } static struct isl_obj obj_read_poly_or_fold(struct isl_stream *s, __isl_take isl_set *set, struct vars *v, int n) { struct isl_obj obj = { isl_obj_pw_qpolynomial_fold, NULL }; isl_pw_qpolynomial *pwqp; isl_pw_qpolynomial_fold *pwf = NULL; if (!isl_stream_eat_if_available(s, ISL_TOKEN_MAX)) return obj_read_poly(s, set, v, n); if (isl_stream_eat(s, '(')) goto error; pwqp = read_term(s, set, v); pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial(isl_fold_max, pwqp); while (isl_stream_eat_if_available(s, ',')) { isl_pw_qpolynomial_fold *pwf_i; pwqp = read_term(s, set, v); pwf_i = isl_pw_qpolynomial_fold_from_pw_qpolynomial(isl_fold_max, pwqp); pwf = isl_pw_qpolynomial_fold_fold(pwf, pwf_i); } if (isl_stream_eat(s, ')')) goto error; set = read_optional_formula(s, set, v, 0); pwf = isl_pw_qpolynomial_fold_intersect_domain(pwf, set); vars_drop(v, v->n - n); obj.v = pwf; return obj; error: isl_set_free(set); isl_pw_qpolynomial_fold_free(pwf); obj.type = isl_obj_none; return obj; } static int is_rational(struct isl_stream *s) { struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return 0; if (tok->type == ISL_TOKEN_RAT && isl_stream_next_token_is(s, ':')) { isl_token_free(tok); isl_stream_eat(s, ':'); return 1; } isl_stream_push_token(s, tok); return 0; } static struct isl_obj obj_read_body(struct isl_stream *s, __isl_take isl_map *map, struct vars *v) { struct isl_token *tok; struct isl_obj obj = { isl_obj_set, NULL }; int n = v->n; int rational; rational = is_rational(s); if (rational) map = isl_map_set_rational(map); if (isl_stream_next_token_is(s, ':')) { obj.type = isl_obj_set; obj.v = read_optional_formula(s, map, v, rational); return obj; } if (!next_is_tuple(s)) return obj_read_poly_or_fold(s, map, v, n); map = read_map_tuple(s, map, isl_dim_in, v, rational, 0); if (!map) goto error; tok = isl_stream_next_token(s); if (!tok) goto error; if (tok->type == ISL_TOKEN_TO) { obj.type = isl_obj_map; isl_token_free(tok); if (!next_is_tuple(s)) { isl_set *set = isl_map_domain(map); return obj_read_poly_or_fold(s, set, v, n); } map = read_map_tuple(s, map, isl_dim_out, v, rational, 0); if (!map) goto error; } else { map = isl_map_domain(map); isl_stream_push_token(s, tok); } map = read_optional_formula(s, map, v, rational); vars_drop(v, v->n - n); obj.v = map; return obj; error: isl_map_free(map); obj.type = isl_obj_none; return obj; } static struct isl_obj to_union(isl_ctx *ctx, struct isl_obj obj) { if (obj.type == isl_obj_map) { obj.v = isl_union_map_from_map(obj.v); obj.type = isl_obj_union_map; } else if (obj.type == isl_obj_set) { obj.v = isl_union_set_from_set(obj.v); obj.type = isl_obj_union_set; } else if (obj.type == isl_obj_pw_qpolynomial) { obj.v = isl_union_pw_qpolynomial_from_pw_qpolynomial(obj.v); obj.type = isl_obj_union_pw_qpolynomial; } else if (obj.type == isl_obj_pw_qpolynomial_fold) { obj.v = isl_union_pw_qpolynomial_fold_from_pw_qpolynomial_fold(obj.v); obj.type = isl_obj_union_pw_qpolynomial_fold; } else isl_assert(ctx, 0, goto error); return obj; error: obj.type->free(obj.v); obj.type = isl_obj_none; return obj; } static struct isl_obj obj_add(struct isl_ctx *ctx, struct isl_obj obj1, struct isl_obj obj2) { if (obj1.type == isl_obj_set && obj2.type == isl_obj_union_set) obj1 = to_union(ctx, obj1); if (obj1.type == isl_obj_union_set && obj2.type == isl_obj_set) obj2 = to_union(ctx, obj2); if (obj1.type == isl_obj_map && obj2.type == isl_obj_union_map) obj1 = to_union(ctx, obj1); if (obj1.type == isl_obj_union_map && obj2.type == isl_obj_map) obj2 = to_union(ctx, obj2); if (obj1.type == isl_obj_pw_qpolynomial && obj2.type == isl_obj_union_pw_qpolynomial) obj1 = to_union(ctx, obj1); if (obj1.type == isl_obj_union_pw_qpolynomial && obj2.type == isl_obj_pw_qpolynomial) obj2 = to_union(ctx, obj2); if (obj1.type == isl_obj_pw_qpolynomial_fold && obj2.type == isl_obj_union_pw_qpolynomial_fold) obj1 = to_union(ctx, obj1); if (obj1.type == isl_obj_union_pw_qpolynomial_fold && obj2.type == isl_obj_pw_qpolynomial_fold) obj2 = to_union(ctx, obj2); isl_assert(ctx, obj1.type == obj2.type, goto error); if (obj1.type == isl_obj_map && !isl_map_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(ctx, obj1); obj2 = to_union(ctx, obj2); } if (obj1.type == isl_obj_set && !isl_set_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(ctx, obj1); obj2 = to_union(ctx, obj2); } if (obj1.type == isl_obj_pw_qpolynomial && !isl_pw_qpolynomial_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(ctx, obj1); obj2 = to_union(ctx, obj2); } if (obj1.type == isl_obj_pw_qpolynomial_fold && !isl_pw_qpolynomial_fold_has_equal_space(obj1.v, obj2.v)) { obj1 = to_union(ctx, obj1); obj2 = to_union(ctx, obj2); } obj1.v = obj1.type->add(obj1.v, obj2.v); return obj1; error: obj1.type->free(obj1.v); obj2.type->free(obj2.v); obj1.type = isl_obj_none; obj1.v = NULL; return obj1; } static struct isl_obj obj_read(struct isl_stream *s) { isl_map *map = NULL; struct isl_token *tok; struct vars *v = NULL; struct isl_obj obj = { isl_obj_set, NULL }; tok = next_token(s); if (!tok) { isl_stream_error(s, NULL, "unexpected EOF"); goto error; } if (tok->type == ISL_TOKEN_VALUE) { struct isl_token *tok2; struct isl_map *map; tok2 = isl_stream_next_token(s); if (!tok2 || tok2->type != ISL_TOKEN_VALUE || isl_int_is_neg(tok2->u.v)) { if (tok2) isl_stream_push_token(s, tok2); obj.type = isl_obj_int; obj.v = isl_int_obj_alloc(s->ctx, tok->u.v); isl_token_free(tok); return obj; } isl_stream_push_token(s, tok2); isl_stream_push_token(s, tok); map = map_read_polylib(s); if (!map) goto error; if (isl_map_may_be_set(map)) obj.v = isl_map_range(map); else { obj.type = isl_obj_map; obj.v = map; } return obj; } v = vars_new(s->ctx); if (!v) { isl_stream_push_token(s, tok); goto error; } map = isl_map_universe(isl_space_params_alloc(s->ctx, 0)); if (tok->type == '[') { isl_stream_push_token(s, tok); map = read_map_tuple(s, map, isl_dim_param, v, 0, 0); if (!map) goto error; tok = isl_stream_next_token(s); if (!tok || tok->type != ISL_TOKEN_TO) { isl_stream_error(s, tok, "expecting '->'"); if (tok) isl_stream_push_token(s, tok); goto error; } isl_token_free(tok); tok = isl_stream_next_token(s); } if (!tok || tok->type != '{') { isl_stream_error(s, tok, "expecting '{'"); if (tok) isl_stream_push_token(s, tok); goto error; } isl_token_free(tok); tok = isl_stream_next_token(s); if (!tok) ; else if (tok->type == ISL_TOKEN_IDENT && !strcmp(tok->u.s, "Sym")) { isl_token_free(tok); if (isl_stream_eat(s, '=')) goto error; map = read_map_tuple(s, map, isl_dim_param, v, 0, 1); if (!map) goto error; } else if (tok->type == '}') { obj.type = isl_obj_union_set; obj.v = isl_union_set_empty(isl_map_get_space(map)); isl_token_free(tok); goto done; } else isl_stream_push_token(s, tok); for (;;) { struct isl_obj o; tok = NULL; o = obj_read_body(s, isl_map_copy(map), v); if (o.type == isl_obj_none || !o.v) goto error; if (!obj.v) obj = o; else { obj = obj_add(s->ctx, obj, o); if (obj.type == isl_obj_none || !obj.v) goto error; } tok = isl_stream_next_token(s); if (!tok || tok->type != ';') break; isl_token_free(tok); if (isl_stream_next_token_is(s, '}')) { tok = isl_stream_next_token(s); break; } } if (tok && tok->type == '}') { isl_token_free(tok); } else { isl_stream_error(s, tok, "unexpected isl_token"); if (tok) isl_token_free(tok); goto error; } done: vars_free(v); isl_map_free(map); return obj; error: isl_map_free(map); obj.type->free(obj.v); if (v) vars_free(v); obj.v = NULL; return obj; } struct isl_obj isl_stream_read_obj(struct isl_stream *s) { return obj_read(s); } __isl_give isl_map *isl_stream_read_map(struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (obj.v) isl_assert(s->ctx, obj.type == isl_obj_map || obj.type == isl_obj_set, goto error); if (obj.type == isl_obj_set) obj.v = isl_map_from_range(obj.v); return obj.v; error: obj.type->free(obj.v); return NULL; } __isl_give isl_set *isl_stream_read_set(struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (obj.v) { if (obj.type == isl_obj_map && isl_map_may_be_set(obj.v)) { obj.v = isl_map_range(obj.v); obj.type = isl_obj_set; } isl_assert(s->ctx, obj.type == isl_obj_set, goto error); } return obj.v; error: obj.type->free(obj.v); return NULL; } __isl_give isl_union_map *isl_stream_read_union_map(struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (obj.type == isl_obj_map) { obj.type = isl_obj_union_map; obj.v = isl_union_map_from_map(obj.v); } if (obj.type == isl_obj_set) { obj.type = isl_obj_union_set; obj.v = isl_union_set_from_set(obj.v); } if (obj.v && obj.type == isl_obj_union_set && isl_union_set_is_empty(obj.v)) obj.type = isl_obj_union_map; if (obj.v && obj.type != isl_obj_union_map) isl_die(s->ctx, isl_error_invalid, "invalid input", goto error); return obj.v; error: obj.type->free(obj.v); return NULL; } __isl_give isl_union_set *isl_stream_read_union_set(struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (obj.type == isl_obj_set) { obj.type = isl_obj_union_set; obj.v = isl_union_set_from_set(obj.v); } if (obj.v) isl_assert(s->ctx, obj.type == isl_obj_union_set, goto error); return obj.v; error: obj.type->free(obj.v); return NULL; } static __isl_give isl_basic_map *basic_map_read(struct isl_stream *s) { struct isl_obj obj; struct isl_map *map; struct isl_basic_map *bmap; obj = obj_read(s); map = obj.v; if (!map) return NULL; isl_assert(map->ctx, map->n <= 1, goto error); if (map->n == 0) bmap = isl_basic_map_empty_like_map(map); else bmap = isl_basic_map_copy(map->p[0]); isl_map_free(map); return bmap; error: isl_map_free(map); return NULL; } static __isl_give isl_basic_set *basic_set_read(struct isl_stream *s) { isl_basic_map *bmap; bmap = basic_map_read(s); if (!bmap) return NULL; if (!isl_basic_map_may_be_set(bmap)) isl_die(s->ctx, isl_error_invalid, "input is not a set", goto error); return isl_basic_map_range(bmap); error: isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_map *isl_basic_map_read_from_file(isl_ctx *ctx, FILE *input) { struct isl_basic_map *bmap; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; bmap = basic_map_read(s); isl_stream_free(s); return bmap; } __isl_give isl_basic_set *isl_basic_set_read_from_file(isl_ctx *ctx, FILE *input) { isl_basic_set *bset; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; bset = basic_set_read(s); isl_stream_free(s); return bset; } struct isl_basic_map *isl_basic_map_read_from_str(struct isl_ctx *ctx, const char *str) { struct isl_basic_map *bmap; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; bmap = basic_map_read(s); isl_stream_free(s); return bmap; } struct isl_basic_set *isl_basic_set_read_from_str(struct isl_ctx *ctx, const char *str) { isl_basic_set *bset; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; bset = basic_set_read(s); isl_stream_free(s); return bset; } __isl_give isl_map *isl_map_read_from_file(struct isl_ctx *ctx, FILE *input) { struct isl_map *map; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; map = isl_stream_read_map(s); isl_stream_free(s); return map; } __isl_give isl_map *isl_map_read_from_str(struct isl_ctx *ctx, const char *str) { struct isl_map *map; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; map = isl_stream_read_map(s); isl_stream_free(s); return map; } __isl_give isl_set *isl_set_read_from_file(struct isl_ctx *ctx, FILE *input) { isl_set *set; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; set = isl_stream_read_set(s); isl_stream_free(s); return set; } struct isl_set *isl_set_read_from_str(struct isl_ctx *ctx, const char *str) { isl_set *set; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; set = isl_stream_read_set(s); isl_stream_free(s); return set; } __isl_give isl_union_map *isl_union_map_read_from_file(isl_ctx *ctx, FILE *input) { isl_union_map *umap; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; umap = isl_stream_read_union_map(s); isl_stream_free(s); return umap; } __isl_give isl_union_map *isl_union_map_read_from_str(struct isl_ctx *ctx, const char *str) { isl_union_map *umap; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; umap = isl_stream_read_union_map(s); isl_stream_free(s); return umap; } __isl_give isl_union_set *isl_union_set_read_from_file(isl_ctx *ctx, FILE *input) { isl_union_set *uset; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; uset = isl_stream_read_union_set(s); isl_stream_free(s); return uset; } __isl_give isl_union_set *isl_union_set_read_from_str(struct isl_ctx *ctx, const char *str) { isl_union_set *uset; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; uset = isl_stream_read_union_set(s); isl_stream_free(s); return uset; } static __isl_give isl_vec *isl_vec_read_polylib(struct isl_stream *s) { struct isl_vec *vec = NULL; struct isl_token *tok; unsigned size; int j; tok = isl_stream_next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting vector length"); goto error; } size = isl_int_get_si(tok->u.v); isl_token_free(tok); vec = isl_vec_alloc(s->ctx, size); for (j = 0; j < size; ++j) { tok = isl_stream_next_token(s); if (!tok || tok->type != ISL_TOKEN_VALUE) { isl_stream_error(s, tok, "expecting constant value"); goto error; } isl_int_set(vec->el[j], tok->u.v); isl_token_free(tok); } return vec; error: isl_token_free(tok); isl_vec_free(vec); return NULL; } static __isl_give isl_vec *vec_read(struct isl_stream *s) { return isl_vec_read_polylib(s); } __isl_give isl_vec *isl_vec_read_from_file(isl_ctx *ctx, FILE *input) { isl_vec *v; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; v = vec_read(s); isl_stream_free(s); return v; } __isl_give isl_pw_qpolynomial *isl_stream_read_pw_qpolynomial( struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (obj.v) isl_assert(s->ctx, obj.type == isl_obj_pw_qpolynomial, goto error); return obj.v; error: obj.type->free(obj.v); return NULL; } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_read_from_str(isl_ctx *ctx, const char *str) { isl_pw_qpolynomial *pwqp; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; pwqp = isl_stream_read_pw_qpolynomial(s); isl_stream_free(s); return pwqp; } __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_read_from_file(isl_ctx *ctx, FILE *input) { isl_pw_qpolynomial *pwqp; struct isl_stream *s = isl_stream_new_file(ctx, input); if (!s) return NULL; pwqp = isl_stream_read_pw_qpolynomial(s); isl_stream_free(s); return pwqp; } /* Is the next token an identifer not in "v"? */ static int next_is_fresh_ident(struct isl_stream *s, struct vars *v) { int n = v->n; int fresh; struct isl_token *tok; tok = isl_stream_next_token(s); if (!tok) return 0; fresh = tok->type == ISL_TOKEN_IDENT && vars_pos(v, tok->u.s, -1) >= n; isl_stream_push_token(s, tok); vars_drop(v, v->n - n); return fresh; } /* First read the domain of the affine expression, which may be * a parameter space or a set. * The tricky part is that we don't know if the domain is a set or not, * so when we are trying to read the domain, we may actually be reading * the affine expression itself (defined on a parameter domains) * If the tuple we are reading is named, we assume it's the domain. * Also, if inside the tuple, the first thing we find is a nested tuple * or a new identifier, we again assume it's the domain. * Otherwise, we assume we are reading an affine expression. */ static __isl_give isl_set *read_aff_domain(struct isl_stream *s, __isl_take isl_set *dom, struct vars *v) { struct isl_token *tok; tok = isl_stream_next_token(s); if (tok && (tok->type == ISL_TOKEN_IDENT || tok->is_keyword)) { isl_stream_push_token(s, tok); return read_map_tuple(s, dom, isl_dim_set, v, 1, 0); } if (!tok || tok->type != '[') { isl_stream_error(s, tok, "expecting '['"); goto error; } if (next_is_tuple(s) || next_is_fresh_ident(s, v)) { isl_stream_push_token(s, tok); dom = read_map_tuple(s, dom, isl_dim_set, v, 1, 0); } else isl_stream_push_token(s, tok); return dom; error: if (tok) isl_stream_push_token(s, tok); isl_set_free(dom); return NULL; } /* Read an affine expression from "s". */ __isl_give isl_aff *isl_stream_read_aff(struct isl_stream *s) { isl_aff *aff; isl_multi_aff *ma; ma = isl_stream_read_multi_aff(s); if (!ma) return NULL; if (isl_multi_aff_dim(ma, isl_dim_out) != 1) isl_die(s->ctx, isl_error_invalid, "expecting single affine expression", goto error); aff = isl_multi_aff_get_aff(ma, 0); isl_multi_aff_free(ma); return aff; error: isl_multi_aff_free(ma); return NULL; } /* Read a piecewise affine expression from "s" with domain (space) "dom". */ static __isl_give isl_pw_aff *read_pw_aff_with_dom(struct isl_stream *s, __isl_take isl_set *dom, struct vars *v) { isl_pw_aff *pwaff = NULL; if (!isl_set_is_params(dom) && isl_stream_eat(s, ISL_TOKEN_TO)) goto error; if (isl_stream_eat(s, '[')) goto error; pwaff = accept_affine(s, isl_set_get_space(dom), v); if (isl_stream_eat(s, ']')) goto error; dom = read_optional_formula(s, dom, v, 0); pwaff = isl_pw_aff_intersect_domain(pwaff, dom); return pwaff; error: isl_set_free(dom); isl_pw_aff_free(pwaff); return NULL; } __isl_give isl_pw_aff *isl_stream_read_pw_aff(struct isl_stream *s) { struct vars *v; isl_set *dom = NULL; isl_set *aff_dom; isl_pw_aff *pa = NULL; int n; v = vars_new(s->ctx); if (!v) return NULL; dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0)); if (next_is_tuple(s)) { dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0); if (isl_stream_eat(s, ISL_TOKEN_TO)) goto error; } if (isl_stream_eat(s, '{')) goto error; n = v->n; aff_dom = read_aff_domain(s, isl_set_copy(dom), v); pa = read_pw_aff_with_dom(s, aff_dom, v); vars_drop(v, v->n - n); while (isl_stream_eat_if_available(s, ';')) { isl_pw_aff *pa_i; n = v->n; aff_dom = read_aff_domain(s, isl_set_copy(dom), v); pa_i = read_pw_aff_with_dom(s, aff_dom, v); vars_drop(v, v->n - n); pa = isl_pw_aff_union_add(pa, pa_i); } if (isl_stream_eat(s, '}')) goto error; vars_free(v); isl_set_free(dom); return pa; error: vars_free(v); isl_set_free(dom); isl_pw_aff_free(pa); return NULL; } __isl_give isl_aff *isl_aff_read_from_str(isl_ctx *ctx, const char *str) { isl_aff *aff; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; aff = isl_stream_read_aff(s); isl_stream_free(s); return aff; } __isl_give isl_pw_aff *isl_pw_aff_read_from_str(isl_ctx *ctx, const char *str) { isl_pw_aff *pa; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; pa = isl_stream_read_pw_aff(s); isl_stream_free(s); return pa; } /* Read an isl_pw_multi_aff from "s". * We currently read a generic object and if it turns out to be a set or * a map, we convert that to an isl_pw_multi_aff. * It would be more efficient if we were to construct the isl_pw_multi_aff * directly. */ __isl_give isl_pw_multi_aff *isl_stream_read_pw_multi_aff(struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (!obj.v) return NULL; if (obj.type == isl_obj_map) return isl_pw_multi_aff_from_map(obj.v); if (obj.type == isl_obj_set) return isl_pw_multi_aff_from_set(obj.v); obj.type->free(obj.v); isl_die(s->ctx, isl_error_invalid, "unexpected object type", return NULL); } __isl_give isl_pw_multi_aff *isl_pw_multi_aff_read_from_str(isl_ctx *ctx, const char *str) { isl_pw_multi_aff *pma; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; pma = isl_stream_read_pw_multi_aff(s); isl_stream_free(s); return pma; } /* Read an isl_union_pw_multi_aff from "s". * We currently read a generic object and if it turns out to be a set or * a map, we convert that to an isl_union_pw_multi_aff. * It would be more efficient if we were to construct * the isl_union_pw_multi_aff directly. */ __isl_give isl_union_pw_multi_aff *isl_stream_read_union_pw_multi_aff( struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (!obj.v) return NULL; if (obj.type == isl_obj_map || obj.type == isl_obj_set) obj = to_union(s->ctx, obj); if (obj.type == isl_obj_union_map) return isl_union_pw_multi_aff_from_union_map(obj.v); if (obj.type == isl_obj_union_set) return isl_union_pw_multi_aff_from_union_set(obj.v); obj.type->free(obj.v); isl_die(s->ctx, isl_error_invalid, "unexpected object type", return NULL); } /* Read an isl_union_pw_multi_aff from "str". */ __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_read_from_str( isl_ctx *ctx, const char *str) { isl_union_pw_multi_aff *upma; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; upma = isl_stream_read_union_pw_multi_aff(s); isl_stream_free(s); return upma; } /* Assuming "pa" represents a single affine expression defined on a universe * domain, extract this affine expression. */ static __isl_give isl_aff *aff_from_pw_aff(__isl_take isl_pw_aff *pa) { isl_aff *aff; if (!pa) return NULL; if (pa->n != 1) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "expecting single affine expression", goto error); if (!isl_set_plain_is_universe(pa->p[0].set)) isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid, "expecting universe domain", goto error); aff = isl_aff_copy(pa->p[0].aff); isl_pw_aff_free(pa); return aff; error: isl_pw_aff_free(pa); return NULL; } /* Read a multi-affine expression from "s". * If the multi-affine expression has a domain, then then tuple * representing this domain cannot involve any affine expressions. * The tuple representing the actual expressions needs to consist * of only affine expressions. Moreover, these expressions can * only depend on parameters and input dimensions and not on other * output dimensions. */ __isl_give isl_multi_aff *isl_stream_read_multi_aff(struct isl_stream *s) { struct vars *v; isl_set *dom = NULL; isl_multi_pw_aff *tuple = NULL; int dim, i, n; isl_space *space, *dom_space; isl_multi_aff *ma = NULL; v = vars_new(s->ctx); if (!v) return NULL; dom = isl_set_universe(isl_space_params_alloc(s->ctx, 0)); if (next_is_tuple(s)) { dom = read_map_tuple(s, dom, isl_dim_param, v, 1, 0); if (isl_stream_eat(s, ISL_TOKEN_TO)) goto error; } if (!isl_set_plain_is_universe(dom)) isl_die(s->ctx, isl_error_invalid, "expecting universe parameter domain", goto error); if (isl_stream_eat(s, '{')) goto error; tuple = read_tuple(s, v, 0, 0); if (!tuple) goto error; if (isl_stream_eat_if_available(s, ISL_TOKEN_TO)) { isl_set *set; isl_space *space; int has_expr; has_expr = tuple_has_expr(tuple); if (has_expr < 0) goto error; if (has_expr) isl_die(s->ctx, isl_error_invalid, "expecting universe domain", goto error); space = isl_space_range(isl_multi_pw_aff_get_space(tuple)); set = isl_set_universe(space); dom = isl_set_intersect_params(set, dom); isl_multi_pw_aff_free(tuple); tuple = read_tuple(s, v, 0, 0); if (!tuple) goto error; } if (isl_stream_eat(s, '}')) goto error; n = isl_multi_pw_aff_dim(tuple, isl_dim_out); dim = isl_set_dim(dom, isl_dim_all); dom_space = isl_set_get_space(dom); space = isl_space_range(isl_multi_pw_aff_get_space(tuple)); space = isl_space_align_params(space, isl_space_copy(dom_space)); if (!isl_space_is_params(dom_space)) space = isl_space_map_from_domain_and_range( isl_space_copy(dom_space), space); isl_space_free(dom_space); ma = isl_multi_aff_alloc(space); for (i = 0; i < n; ++i) { isl_pw_aff *pa; isl_aff *aff; pa = isl_multi_pw_aff_get_pw_aff(tuple, i); aff = aff_from_pw_aff(pa); if (!aff) goto error; if (isl_aff_involves_dims(aff, isl_dim_in, dim, i + 1)) { isl_aff_free(aff); isl_die(s->ctx, isl_error_invalid, "not an affine expression", goto error); } aff = isl_aff_drop_dims(aff, isl_dim_in, dim, n); space = isl_multi_aff_get_domain_space(ma); aff = isl_aff_reset_domain_space(aff, space); ma = isl_multi_aff_set_aff(ma, i, aff); } isl_multi_pw_aff_free(tuple); vars_free(v); isl_set_free(dom); return ma; error: isl_multi_pw_aff_free(tuple); vars_free(v); isl_set_free(dom); isl_multi_aff_free(ma); return NULL; } __isl_give isl_multi_aff *isl_multi_aff_read_from_str(isl_ctx *ctx, const char *str) { isl_multi_aff *maff; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; maff = isl_stream_read_multi_aff(s); isl_stream_free(s); return maff; } __isl_give isl_union_pw_qpolynomial *isl_stream_read_union_pw_qpolynomial( struct isl_stream *s) { struct isl_obj obj; obj = obj_read(s); if (obj.type == isl_obj_pw_qpolynomial) { obj.type = isl_obj_union_pw_qpolynomial; obj.v = isl_union_pw_qpolynomial_from_pw_qpolynomial(obj.v); } if (obj.v) isl_assert(s->ctx, obj.type == isl_obj_union_pw_qpolynomial, goto error); return obj.v; error: obj.type->free(obj.v); return NULL; } __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_read_from_str( isl_ctx *ctx, const char *str) { isl_union_pw_qpolynomial *upwqp; struct isl_stream *s = isl_stream_new_str(ctx, str); if (!s) return NULL; upwqp = isl_stream_read_union_pw_qpolynomial(s); isl_stream_free(s); return upwqp; } cloog-0.18.2/isl/isl_bernstein.h0000664000175000017500000000024312254313240013423 00000000000000#include int isl_qpolynomial_bound_on_domain_bernstein(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct isl_bound *bound); cloog-0.18.2/isl/isl_tab_pip.c0000664000175000017500000046520012254313240013053 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include "isl_map_private.h" #include #include "isl_tab.h" #include "isl_sample.h" #include #include #include #include /* * The implementation of parametric integer linear programming in this file * was inspired by the paper "Parametric Integer Programming" and the * report "Solving systems of affine (in)equalities" by Paul Feautrier * (and others). * * The strategy used for obtaining a feasible solution is different * from the one used in isl_tab.c. In particular, in isl_tab.c, * upon finding a constraint that is not yet satisfied, we pivot * in a row that increases the constant term of the row holding the * constraint, making sure the sample solution remains feasible * for all the constraints it already satisfied. * Here, we always pivot in the row holding the constraint, * choosing a column that induces the lexicographically smallest * increment to the sample solution. * * By starting out from a sample value that is lexicographically * smaller than any integer point in the problem space, the first * feasible integer sample point we find will also be the lexicographically * smallest. If all variables can be assumed to be non-negative, * then the initial sample value may be chosen equal to zero. * However, we will not make this assumption. Instead, we apply * the "big parameter" trick. Any variable x is then not directly * used in the tableau, but instead it is represented by another * variable x' = M + x, where M is an arbitrarily large (positive) * value. x' is therefore always non-negative, whatever the value of x. * Taking as initial sample value x' = 0 corresponds to x = -M, * which is always smaller than any possible value of x. * * The big parameter trick is used in the main tableau and * also in the context tableau if isl_context_lex is used. * In this case, each tableaus has its own big parameter. * Before doing any real work, we check if all the parameters * happen to be non-negative. If so, we drop the column corresponding * to M from the initial context tableau. * If isl_context_gbr is used, then the big parameter trick is only * used in the main tableau. */ struct isl_context; struct isl_context_op { /* detect nonnegative parameters in context and mark them in tab */ struct isl_tab *(*detect_nonnegative_parameters)( struct isl_context *context, struct isl_tab *tab); /* return temporary reference to basic set representation of context */ struct isl_basic_set *(*peek_basic_set)(struct isl_context *context); /* return temporary reference to tableau representation of context */ struct isl_tab *(*peek_tab)(struct isl_context *context); /* add equality; check is 1 if eq may not be valid; * update is 1 if we may want to call ineq_sign on context later. */ void (*add_eq)(struct isl_context *context, isl_int *eq, int check, int update); /* add inequality; check is 1 if ineq may not be valid; * update is 1 if we may want to call ineq_sign on context later. */ void (*add_ineq)(struct isl_context *context, isl_int *ineq, int check, int update); /* check sign of ineq based on previous information. * strict is 1 if saturation should be treated as a positive sign. */ enum isl_tab_row_sign (*ineq_sign)(struct isl_context *context, isl_int *ineq, int strict); /* check if inequality maintains feasibility */ int (*test_ineq)(struct isl_context *context, isl_int *ineq); /* return index of a div that corresponds to "div" */ int (*get_div)(struct isl_context *context, struct isl_tab *tab, struct isl_vec *div); /* add div "div" to context and return non-negativity */ int (*add_div)(struct isl_context *context, struct isl_vec *div); int (*detect_equalities)(struct isl_context *context, struct isl_tab *tab); /* return row index of "best" split */ int (*best_split)(struct isl_context *context, struct isl_tab *tab); /* check if context has already been determined to be empty */ int (*is_empty)(struct isl_context *context); /* check if context is still usable */ int (*is_ok)(struct isl_context *context); /* save a copy/snapshot of context */ void *(*save)(struct isl_context *context); /* restore saved context */ void (*restore)(struct isl_context *context, void *); /* discard saved context */ void (*discard)(void *); /* invalidate context */ void (*invalidate)(struct isl_context *context); /* free context */ void (*free)(struct isl_context *context); }; struct isl_context { struct isl_context_op *op; }; struct isl_context_lex { struct isl_context context; struct isl_tab *tab; }; /* A stack (linked list) of solutions of subtrees of the search space. * * "M" describes the solution in terms of the dimensions of "dom". * The number of columns of "M" is one more than the total number * of dimensions of "dom". * * If "M" is NULL, then there is no solution on "dom". */ struct isl_partial_sol { int level; struct isl_basic_set *dom; struct isl_mat *M; struct isl_partial_sol *next; }; struct isl_sol; struct isl_sol_callback { struct isl_tab_callback callback; struct isl_sol *sol; }; /* isl_sol is an interface for constructing a solution to * a parametric integer linear programming problem. * Every time the algorithm reaches a state where a solution * can be read off from the tableau (including cases where the tableau * is empty), the function "add" is called on the isl_sol passed * to find_solutions_main. * * The context tableau is owned by isl_sol and is updated incrementally. * * There are currently two implementations of this interface, * isl_sol_map, which simply collects the solutions in an isl_map * and (optionally) the parts of the context where there is no solution * in an isl_set, and * isl_sol_for, which calls a user-defined function for each part of * the solution. */ struct isl_sol { int error; int rational; int level; int max; int n_out; struct isl_context *context; struct isl_partial_sol *partial; void (*add)(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M); void (*add_empty)(struct isl_sol *sol, struct isl_basic_set *bset); void (*free)(struct isl_sol *sol); struct isl_sol_callback dec_level; }; static void sol_free(struct isl_sol *sol) { struct isl_partial_sol *partial, *next; if (!sol) return; for (partial = sol->partial; partial; partial = next) { next = partial->next; isl_basic_set_free(partial->dom); isl_mat_free(partial->M); free(partial); } sol->free(sol); } /* Push a partial solution represented by a domain and mapping M * onto the stack of partial solutions. */ static void sol_push_sol(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) { struct isl_partial_sol *partial; if (sol->error || !dom) goto error; partial = isl_alloc_type(dom->ctx, struct isl_partial_sol); if (!partial) goto error; partial->level = sol->level; partial->dom = dom; partial->M = M; partial->next = sol->partial; sol->partial = partial; return; error: isl_basic_set_free(dom); isl_mat_free(M); sol->error = 1; } /* Pop one partial solution from the partial solution stack and * pass it on to sol->add or sol->add_empty. */ static void sol_pop_one(struct isl_sol *sol) { struct isl_partial_sol *partial; partial = sol->partial; sol->partial = partial->next; if (partial->M) sol->add(sol, partial->dom, partial->M); else sol->add_empty(sol, partial->dom); free(partial); } /* Return a fresh copy of the domain represented by the context tableau. */ static struct isl_basic_set *sol_domain(struct isl_sol *sol) { struct isl_basic_set *bset; if (sol->error) return NULL; bset = isl_basic_set_dup(sol->context->op->peek_basic_set(sol->context)); bset = isl_basic_set_update_from_tab(bset, sol->context->op->peek_tab(sol->context)); return bset; } /* Check whether two partial solutions have the same mapping, where n_div * is the number of divs that the two partial solutions have in common. */ static int same_solution(struct isl_partial_sol *s1, struct isl_partial_sol *s2, unsigned n_div) { int i; unsigned dim; if (!s1->M != !s2->M) return 0; if (!s1->M) return 1; dim = isl_basic_set_total_dim(s1->dom) - s1->dom->n_div; for (i = 0; i < s1->M->n_row; ++i) { if (isl_seq_first_non_zero(s1->M->row[i]+1+dim+n_div, s1->M->n_col-1-dim-n_div) != -1) return 0; if (isl_seq_first_non_zero(s2->M->row[i]+1+dim+n_div, s2->M->n_col-1-dim-n_div) != -1) return 0; if (!isl_seq_eq(s1->M->row[i], s2->M->row[i], 1+dim+n_div)) return 0; } return 1; } /* Pop all solutions from the partial solution stack that were pushed onto * the stack at levels that are deeper than the current level. * If the two topmost elements on the stack have the same level * and represent the same solution, then their domains are combined. * This combined domain is the same as the current context domain * as sol_pop is called each time we move back to a higher level. */ static void sol_pop(struct isl_sol *sol) { struct isl_partial_sol *partial; unsigned n_div; if (sol->error) return; if (sol->level == 0) { for (partial = sol->partial; partial; partial = sol->partial) sol_pop_one(sol); return; } partial = sol->partial; if (!partial) return; if (partial->level <= sol->level) return; if (partial->next && partial->next->level == partial->level) { n_div = isl_basic_set_dim( sol->context->op->peek_basic_set(sol->context), isl_dim_div); if (!same_solution(partial, partial->next, n_div)) { sol_pop_one(sol); sol_pop_one(sol); } else { struct isl_basic_set *bset; isl_mat *M; unsigned n; n = isl_basic_set_dim(partial->next->dom, isl_dim_div); n -= n_div; bset = sol_domain(sol); isl_basic_set_free(partial->next->dom); partial->next->dom = bset; M = partial->next->M; if (M) { M = isl_mat_drop_cols(M, M->n_col - n, n); partial->next->M = M; if (!M) goto error; } partial->next->level = sol->level; if (!bset) goto error; sol->partial = partial->next; isl_basic_set_free(partial->dom); isl_mat_free(partial->M); free(partial); } } else sol_pop_one(sol); if (0) error: sol->error = 1; } static void sol_dec_level(struct isl_sol *sol) { if (sol->error) return; sol->level--; sol_pop(sol); } static int sol_dec_level_wrap(struct isl_tab_callback *cb) { struct isl_sol_callback *callback = (struct isl_sol_callback *)cb; sol_dec_level(callback->sol); return callback->sol->error ? -1 : 0; } /* Move down to next level and push callback onto context tableau * to decrease the level again when it gets rolled back across * the current state. That is, dec_level will be called with * the context tableau in the same state as it is when inc_level * is called. */ static void sol_inc_level(struct isl_sol *sol) { struct isl_tab *tab; if (sol->error) return; sol->level++; tab = sol->context->op->peek_tab(sol->context); if (isl_tab_push_callback(tab, &sol->dec_level.callback) < 0) sol->error = 1; } static void scale_rows(struct isl_mat *mat, isl_int m, int n_row) { int i; if (isl_int_is_one(m)) return; for (i = 0; i < n_row; ++i) isl_seq_scale(mat->row[i], mat->row[i], m, mat->n_col); } /* Add the solution identified by the tableau and the context tableau. * * The layout of the variables is as follows. * tab->n_var is equal to the total number of variables in the input * map (including divs that were copied from the context) * + the number of extra divs constructed * Of these, the first tab->n_param and the last tab->n_div variables * correspond to the variables in the context, i.e., * tab->n_param + tab->n_div = context_tab->n_var * tab->n_param is equal to the number of parameters and input * dimensions in the input map * tab->n_div is equal to the number of divs in the context * * If there is no solution, then call add_empty with a basic set * that corresponds to the context tableau. (If add_empty is NULL, * then do nothing). * * If there is a solution, then first construct a matrix that maps * all dimensions of the context to the output variables, i.e., * the output dimensions in the input map. * The divs in the input map (if any) that do not correspond to any * div in the context do not appear in the solution. * The algorithm will make sure that they have an integer value, * but these values themselves are of no interest. * We have to be careful not to drop or rearrange any divs in the * context because that would change the meaning of the matrix. * * To extract the value of the output variables, it should be noted * that we always use a big parameter M in the main tableau and so * the variable stored in this tableau is not an output variable x itself, but * x' = M + x (in case of minimization) * or * x' = M - x (in case of maximization) * If x' appears in a column, then its optimal value is zero, * which means that the optimal value of x is an unbounded number * (-M for minimization and M for maximization). * We currently assume that the output dimensions in the original map * are bounded, so this cannot occur. * Similarly, when x' appears in a row, then the coefficient of M in that * row is necessarily 1. * If the row in the tableau represents * d x' = c + d M + e(y) * then, in case of minimization, the corresponding row in the matrix * will be * a c + a e(y) * with a d = m, the (updated) common denominator of the matrix. * In case of maximization, the row will be * -a c - a e(y) */ static void sol_add(struct isl_sol *sol, struct isl_tab *tab) { struct isl_basic_set *bset = NULL; struct isl_mat *mat = NULL; unsigned off; int row; isl_int m; if (sol->error || !tab) goto error; if (tab->empty && !sol->add_empty) return; if (sol->context->op->is_empty(sol->context)) return; bset = sol_domain(sol); if (tab->empty) { sol_push_sol(sol, bset, NULL); return; } off = 2 + tab->M; mat = isl_mat_alloc(tab->mat->ctx, 1 + sol->n_out, 1 + tab->n_param + tab->n_div); if (!mat) goto error; isl_int_init(m); isl_seq_clr(mat->row[0] + 1, mat->n_col - 1); isl_int_set_si(mat->row[0][0], 1); for (row = 0; row < sol->n_out; ++row) { int i = tab->n_param + row; int r, j; isl_seq_clr(mat->row[1 + row], mat->n_col); if (!tab->var[i].is_row) { if (tab->M) isl_die(mat->ctx, isl_error_invalid, "unbounded optimum", goto error2); continue; } r = tab->var[i].index; if (tab->M && isl_int_ne(tab->mat->row[r][2], tab->mat->row[r][0])) isl_die(mat->ctx, isl_error_invalid, "unbounded optimum", goto error2); isl_int_gcd(m, mat->row[0][0], tab->mat->row[r][0]); isl_int_divexact(m, tab->mat->row[r][0], m); scale_rows(mat, m, 1 + row); isl_int_divexact(m, mat->row[0][0], tab->mat->row[r][0]); isl_int_mul(mat->row[1 + row][0], m, tab->mat->row[r][1]); for (j = 0; j < tab->n_param; ++j) { int col; if (tab->var[j].is_row) continue; col = tab->var[j].index; isl_int_mul(mat->row[1 + row][1 + j], m, tab->mat->row[r][off + col]); } for (j = 0; j < tab->n_div; ++j) { int col; if (tab->var[tab->n_var - tab->n_div+j].is_row) continue; col = tab->var[tab->n_var - tab->n_div+j].index; isl_int_mul(mat->row[1 + row][1 + tab->n_param + j], m, tab->mat->row[r][off + col]); } if (sol->max) isl_seq_neg(mat->row[1 + row], mat->row[1 + row], mat->n_col); } isl_int_clear(m); sol_push_sol(sol, bset, mat); return; error2: isl_int_clear(m); error: isl_basic_set_free(bset); isl_mat_free(mat); sol->error = 1; } struct isl_sol_map { struct isl_sol sol; struct isl_map *map; struct isl_set *empty; }; static void sol_map_free(struct isl_sol_map *sol_map) { if (!sol_map) return; if (sol_map->sol.context) sol_map->sol.context->op->free(sol_map->sol.context); isl_map_free(sol_map->map); isl_set_free(sol_map->empty); free(sol_map); } static void sol_map_free_wrap(struct isl_sol *sol) { sol_map_free((struct isl_sol_map *)sol); } /* This function is called for parts of the context where there is * no solution, with "bset" corresponding to the context tableau. * Simply add the basic set to the set "empty". */ static void sol_map_add_empty(struct isl_sol_map *sol, struct isl_basic_set *bset) { if (!bset) goto error; isl_assert(bset->ctx, sol->empty, goto error); sol->empty = isl_set_grow(sol->empty, 1); bset = isl_basic_set_simplify(bset); bset = isl_basic_set_finalize(bset); sol->empty = isl_set_add_basic_set(sol->empty, isl_basic_set_copy(bset)); if (!sol->empty) goto error; isl_basic_set_free(bset); return; error: isl_basic_set_free(bset); sol->sol.error = 1; } static void sol_map_add_empty_wrap(struct isl_sol *sol, struct isl_basic_set *bset) { sol_map_add_empty((struct isl_sol_map *)sol, bset); } /* Given a basic map "dom" that represents the context and an affine * matrix "M" that maps the dimensions of the context to the * output variables, construct a basic map with the same parameters * and divs as the context, the dimensions of the context as input * dimensions and a number of output dimensions that is equal to * the number of output dimensions in the input map. * * The constraints and divs of the context are simply copied * from "dom". For each row * x = c + e(y) * an equality * c + e(y) - d x = 0 * is added, with d the common denominator of M. */ static void sol_map_add(struct isl_sol_map *sol, struct isl_basic_set *dom, struct isl_mat *M) { int i; struct isl_basic_map *bmap = NULL; unsigned n_eq; unsigned n_ineq; unsigned nparam; unsigned total; unsigned n_div; unsigned n_out; if (sol->sol.error || !dom || !M) goto error; n_out = sol->sol.n_out; n_eq = dom->n_eq + n_out; n_ineq = dom->n_ineq; n_div = dom->n_div; nparam = isl_basic_set_total_dim(dom) - n_div; total = isl_map_dim(sol->map, isl_dim_all); bmap = isl_basic_map_alloc_space(isl_map_get_space(sol->map), n_div, n_eq, 2 * n_div + n_ineq); if (!bmap) goto error; if (sol->sol.rational) ISL_F_SET(bmap, ISL_BASIC_MAP_RATIONAL); for (i = 0; i < dom->n_div; ++i) { int k = isl_basic_map_alloc_div(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->div[k], dom->div[i], 1 + 1 + nparam); isl_seq_clr(bmap->div[k] + 1 + 1 + nparam, total - nparam); isl_seq_cpy(bmap->div[k] + 1 + 1 + total, dom->div[i] + 1 + 1 + nparam, i); } for (i = 0; i < dom->n_eq; ++i) { int k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->eq[k], dom->eq[i], 1 + nparam); isl_seq_clr(bmap->eq[k] + 1 + nparam, total - nparam); isl_seq_cpy(bmap->eq[k] + 1 + total, dom->eq[i] + 1 + nparam, n_div); } for (i = 0; i < dom->n_ineq; ++i) { int k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->ineq[k], dom->ineq[i], 1 + nparam); isl_seq_clr(bmap->ineq[k] + 1 + nparam, total - nparam); isl_seq_cpy(bmap->ineq[k] + 1 + total, dom->ineq[i] + 1 + nparam, n_div); } for (i = 0; i < M->n_row - 1; ++i) { int k = isl_basic_map_alloc_equality(bmap); if (k < 0) goto error; isl_seq_cpy(bmap->eq[k], M->row[1 + i], 1 + nparam); isl_seq_clr(bmap->eq[k] + 1 + nparam, n_out); isl_int_neg(bmap->eq[k][1 + nparam + i], M->row[0][0]); isl_seq_cpy(bmap->eq[k] + 1 + nparam + n_out, M->row[1 + i] + 1 + nparam, n_div); } bmap = isl_basic_map_simplify(bmap); bmap = isl_basic_map_finalize(bmap); sol->map = isl_map_grow(sol->map, 1); sol->map = isl_map_add_basic_map(sol->map, bmap); isl_basic_set_free(dom); isl_mat_free(M); if (!sol->map) sol->sol.error = 1; return; error: isl_basic_set_free(dom); isl_mat_free(M); isl_basic_map_free(bmap); sol->sol.error = 1; } static void sol_map_add_wrap(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) { sol_map_add((struct isl_sol_map *)sol, dom, M); } /* Store the "parametric constant" of row "row" of tableau "tab" in "line", * i.e., the constant term and the coefficients of all variables that * appear in the context tableau. * Note that the coefficient of the big parameter M is NOT copied. * The context tableau may not have a big parameter and even when it * does, it is a different big parameter. */ static void get_row_parameter_line(struct isl_tab *tab, int row, isl_int *line) { int i; unsigned off = 2 + tab->M; isl_int_set(line[0], tab->mat->row[row][1]); for (i = 0; i < tab->n_param; ++i) { if (tab->var[i].is_row) isl_int_set_si(line[1 + i], 0); else { int col = tab->var[i].index; isl_int_set(line[1 + i], tab->mat->row[row][off + col]); } } for (i = 0; i < tab->n_div; ++i) { if (tab->var[tab->n_var - tab->n_div + i].is_row) isl_int_set_si(line[1 + tab->n_param + i], 0); else { int col = tab->var[tab->n_var - tab->n_div + i].index; isl_int_set(line[1 + tab->n_param + i], tab->mat->row[row][off + col]); } } } /* Check if rows "row1" and "row2" have identical "parametric constants", * as explained above. * In this case, we also insist that the coefficients of the big parameter * be the same as the values of the constants will only be the same * if these coefficients are also the same. */ static int identical_parameter_line(struct isl_tab *tab, int row1, int row2) { int i; unsigned off = 2 + tab->M; if (isl_int_ne(tab->mat->row[row1][1], tab->mat->row[row2][1])) return 0; if (tab->M && isl_int_ne(tab->mat->row[row1][2], tab->mat->row[row2][2])) return 0; for (i = 0; i < tab->n_param + tab->n_div; ++i) { int pos = i < tab->n_param ? i : tab->n_var - tab->n_div + i - tab->n_param; int col; if (tab->var[pos].is_row) continue; col = tab->var[pos].index; if (isl_int_ne(tab->mat->row[row1][off + col], tab->mat->row[row2][off + col])) return 0; } return 1; } /* Return an inequality that expresses that the "parametric constant" * should be non-negative. * This function is only called when the coefficient of the big parameter * is equal to zero. */ static struct isl_vec *get_row_parameter_ineq(struct isl_tab *tab, int row) { struct isl_vec *ineq; ineq = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_param + tab->n_div); if (!ineq) return NULL; get_row_parameter_line(tab, row, ineq->el); if (ineq) ineq = isl_vec_normalize(ineq); return ineq; } /* Normalize a div expression of the form * * [(g*f(x) + c)/(g * m)] * * with c the constant term and f(x) the remaining coefficients, to * * [(f(x) + [c/g])/m] */ static void normalize_div(__isl_keep isl_vec *div) { isl_ctx *ctx = isl_vec_get_ctx(div); int len = div->size - 2; isl_seq_gcd(div->el + 2, len, &ctx->normalize_gcd); isl_int_gcd(ctx->normalize_gcd, ctx->normalize_gcd, div->el[0]); if (isl_int_is_one(ctx->normalize_gcd)) return; isl_int_divexact(div->el[0], div->el[0], ctx->normalize_gcd); isl_int_fdiv_q(div->el[1], div->el[1], ctx->normalize_gcd); isl_seq_scale_down(div->el + 2, div->el + 2, ctx->normalize_gcd, len); } /* Return a integer division for use in a parametric cut based on the given row. * In particular, let the parametric constant of the row be * * \sum_i a_i y_i * * where y_0 = 1, but none of the y_i corresponds to the big parameter M. * The div returned is equal to * * floor(\sum_i {-a_i} y_i) = floor((\sum_i (-a_i mod d) y_i)/d) */ static struct isl_vec *get_row_parameter_div(struct isl_tab *tab, int row) { struct isl_vec *div; div = isl_vec_alloc(tab->mat->ctx, 1 + 1 + tab->n_param + tab->n_div); if (!div) return NULL; isl_int_set(div->el[0], tab->mat->row[row][0]); get_row_parameter_line(tab, row, div->el + 1); isl_seq_neg(div->el + 1, div->el + 1, div->size - 1); normalize_div(div); isl_seq_fdiv_r(div->el + 1, div->el + 1, div->el[0], div->size - 1); return div; } /* Return a integer division for use in transferring an integrality constraint * to the context. * In particular, let the parametric constant of the row be * * \sum_i a_i y_i * * where y_0 = 1, but none of the y_i corresponds to the big parameter M. * The the returned div is equal to * * floor(\sum_i {a_i} y_i) = floor((\sum_i (a_i mod d) y_i)/d) */ static struct isl_vec *get_row_split_div(struct isl_tab *tab, int row) { struct isl_vec *div; div = isl_vec_alloc(tab->mat->ctx, 1 + 1 + tab->n_param + tab->n_div); if (!div) return NULL; isl_int_set(div->el[0], tab->mat->row[row][0]); get_row_parameter_line(tab, row, div->el + 1); normalize_div(div); isl_seq_fdiv_r(div->el + 1, div->el + 1, div->el[0], div->size - 1); return div; } /* Construct and return an inequality that expresses an upper bound * on the given div. * In particular, if the div is given by * * d = floor(e/m) * * then the inequality expresses * * m d <= e */ static struct isl_vec *ineq_for_div(struct isl_basic_set *bset, unsigned div) { unsigned total; unsigned div_pos; struct isl_vec *ineq; if (!bset) return NULL; total = isl_basic_set_total_dim(bset); div_pos = 1 + total - bset->n_div + div; ineq = isl_vec_alloc(bset->ctx, 1 + total); if (!ineq) return NULL; isl_seq_cpy(ineq->el, bset->div[div] + 1, 1 + total); isl_int_neg(ineq->el[div_pos], bset->div[div][0]); return ineq; } /* Given a row in the tableau and a div that was created * using get_row_split_div and that has been constrained to equality, i.e., * * d = floor(\sum_i {a_i} y_i) = \sum_i {a_i} y_i * * replace the expression "\sum_i {a_i} y_i" in the row by d, * i.e., we subtract "\sum_i {a_i} y_i" and add 1 d. * The coefficients of the non-parameters in the tableau have been * verified to be integral. We can therefore simply replace coefficient b * by floor(b). For the coefficients of the parameters we have * floor(a_i) = a_i - {a_i}, while for the other coefficients, we have * floor(b) = b. */ static struct isl_tab *set_row_cst_to_div(struct isl_tab *tab, int row, int div) { isl_seq_fdiv_q(tab->mat->row[row] + 1, tab->mat->row[row] + 1, tab->mat->row[row][0], 1 + tab->M + tab->n_col); isl_int_set_si(tab->mat->row[row][0], 1); if (tab->var[tab->n_var - tab->n_div + div].is_row) { int drow = tab->var[tab->n_var - tab->n_div + div].index; isl_assert(tab->mat->ctx, isl_int_is_one(tab->mat->row[drow][0]), goto error); isl_seq_combine(tab->mat->row[row] + 1, tab->mat->ctx->one, tab->mat->row[row] + 1, tab->mat->ctx->one, tab->mat->row[drow] + 1, 1 + tab->M + tab->n_col); } else { int dcol = tab->var[tab->n_var - tab->n_div + div].index; isl_int_add_ui(tab->mat->row[row][2 + tab->M + dcol], tab->mat->row[row][2 + tab->M + dcol], 1); } return tab; error: isl_tab_free(tab); return NULL; } /* Check if the (parametric) constant of the given row is obviously * negative, meaning that we don't need to consult the context tableau. * If there is a big parameter and its coefficient is non-zero, * then this coefficient determines the outcome. * Otherwise, we check whether the constant is negative and * all non-zero coefficients of parameters are negative and * belong to non-negative parameters. */ static int is_obviously_neg(struct isl_tab *tab, int row) { int i; int col; unsigned off = 2 + tab->M; if (tab->M) { if (isl_int_is_pos(tab->mat->row[row][2])) return 0; if (isl_int_is_neg(tab->mat->row[row][2])) return 1; } if (isl_int_is_nonneg(tab->mat->row[row][1])) return 0; for (i = 0; i < tab->n_param; ++i) { /* Eliminated parameter */ if (tab->var[i].is_row) continue; col = tab->var[i].index; if (isl_int_is_zero(tab->mat->row[row][off + col])) continue; if (!tab->var[i].is_nonneg) return 0; if (isl_int_is_pos(tab->mat->row[row][off + col])) return 0; } for (i = 0; i < tab->n_div; ++i) { if (tab->var[tab->n_var - tab->n_div + i].is_row) continue; col = tab->var[tab->n_var - tab->n_div + i].index; if (isl_int_is_zero(tab->mat->row[row][off + col])) continue; if (!tab->var[tab->n_var - tab->n_div + i].is_nonneg) return 0; if (isl_int_is_pos(tab->mat->row[row][off + col])) return 0; } return 1; } /* Check if the (parametric) constant of the given row is obviously * non-negative, meaning that we don't need to consult the context tableau. * If there is a big parameter and its coefficient is non-zero, * then this coefficient determines the outcome. * Otherwise, we check whether the constant is non-negative and * all non-zero coefficients of parameters are positive and * belong to non-negative parameters. */ static int is_obviously_nonneg(struct isl_tab *tab, int row) { int i; int col; unsigned off = 2 + tab->M; if (tab->M) { if (isl_int_is_pos(tab->mat->row[row][2])) return 1; if (isl_int_is_neg(tab->mat->row[row][2])) return 0; } if (isl_int_is_neg(tab->mat->row[row][1])) return 0; for (i = 0; i < tab->n_param; ++i) { /* Eliminated parameter */ if (tab->var[i].is_row) continue; col = tab->var[i].index; if (isl_int_is_zero(tab->mat->row[row][off + col])) continue; if (!tab->var[i].is_nonneg) return 0; if (isl_int_is_neg(tab->mat->row[row][off + col])) return 0; } for (i = 0; i < tab->n_div; ++i) { if (tab->var[tab->n_var - tab->n_div + i].is_row) continue; col = tab->var[tab->n_var - tab->n_div + i].index; if (isl_int_is_zero(tab->mat->row[row][off + col])) continue; if (!tab->var[tab->n_var - tab->n_div + i].is_nonneg) return 0; if (isl_int_is_neg(tab->mat->row[row][off + col])) return 0; } return 1; } /* Given a row r and two columns, return the column that would * lead to the lexicographically smallest increment in the sample * solution when leaving the basis in favor of the row. * Pivoting with column c will increment the sample value by a non-negative * constant times a_{V,c}/a_{r,c}, with a_{V,c} the elements of column c * corresponding to the non-parametric variables. * If variable v appears in a column c_v, the a_{v,c} = 1 iff c = c_v, * with all other entries in this virtual row equal to zero. * If variable v appears in a row, then a_{v,c} is the element in column c * of that row. * * Let v be the first variable with a_{v,c1}/a_{r,c1} != a_{v,c2}/a_{r,c2}. * Then if a_{v,c1}/a_{r,c1} < a_{v,c2}/a_{r,c2}, i.e., * a_{v,c2} a_{r,c1} - a_{v,c1} a_{r,c2} > 0, c1 results in the minimal * increment. Otherwise, it's c2. */ static int lexmin_col_pair(struct isl_tab *tab, int row, int col1, int col2, isl_int tmp) { int i; isl_int *tr; tr = tab->mat->row[row] + 2 + tab->M; for (i = tab->n_param; i < tab->n_var - tab->n_div; ++i) { int s1, s2; isl_int *r; if (!tab->var[i].is_row) { if (tab->var[i].index == col1) return col2; if (tab->var[i].index == col2) return col1; continue; } if (tab->var[i].index == row) continue; r = tab->mat->row[tab->var[i].index] + 2 + tab->M; s1 = isl_int_sgn(r[col1]); s2 = isl_int_sgn(r[col2]); if (s1 == 0 && s2 == 0) continue; if (s1 < s2) return col1; if (s2 < s1) return col2; isl_int_mul(tmp, r[col2], tr[col1]); isl_int_submul(tmp, r[col1], tr[col2]); if (isl_int_is_pos(tmp)) return col1; if (isl_int_is_neg(tmp)) return col2; } return -1; } /* Given a row in the tableau, find and return the column that would * result in the lexicographically smallest, but positive, increment * in the sample point. * If there is no such column, then return tab->n_col. * If anything goes wrong, return -1. */ static int lexmin_pivot_col(struct isl_tab *tab, int row) { int j; int col = tab->n_col; isl_int *tr; isl_int tmp; tr = tab->mat->row[row] + 2 + tab->M; isl_int_init(tmp); for (j = tab->n_dead; j < tab->n_col; ++j) { if (tab->col_var[j] >= 0 && (tab->col_var[j] < tab->n_param || tab->col_var[j] >= tab->n_var - tab->n_div)) continue; if (!isl_int_is_pos(tr[j])) continue; if (col == tab->n_col) col = j; else col = lexmin_col_pair(tab, row, col, j, tmp); isl_assert(tab->mat->ctx, col >= 0, goto error); } isl_int_clear(tmp); return col; error: isl_int_clear(tmp); return -1; } /* Return the first known violated constraint, i.e., a non-negative * constraint that currently has an either obviously negative value * or a previously determined to be negative value. * * If any constraint has a negative coefficient for the big parameter, * if any, then we return one of these first. */ static int first_neg(struct isl_tab *tab) { int row; if (tab->M) for (row = tab->n_redundant; row < tab->n_row; ++row) { if (!isl_tab_var_from_row(tab, row)->is_nonneg) continue; if (!isl_int_is_neg(tab->mat->row[row][2])) continue; if (tab->row_sign) tab->row_sign[row] = isl_tab_row_neg; return row; } for (row = tab->n_redundant; row < tab->n_row; ++row) { if (!isl_tab_var_from_row(tab, row)->is_nonneg) continue; if (tab->row_sign) { if (tab->row_sign[row] == 0 && is_obviously_neg(tab, row)) tab->row_sign[row] = isl_tab_row_neg; if (tab->row_sign[row] != isl_tab_row_neg) continue; } else if (!is_obviously_neg(tab, row)) continue; return row; } return -1; } /* Check whether the invariant that all columns are lexico-positive * is satisfied. This function is not called from the current code * but is useful during debugging. */ static void check_lexpos(struct isl_tab *tab) __attribute__ ((unused)); static void check_lexpos(struct isl_tab *tab) { unsigned off = 2 + tab->M; int col; int var; int row; for (col = tab->n_dead; col < tab->n_col; ++col) { if (tab->col_var[col] >= 0 && (tab->col_var[col] < tab->n_param || tab->col_var[col] >= tab->n_var - tab->n_div)) continue; for (var = tab->n_param; var < tab->n_var - tab->n_div; ++var) { if (!tab->var[var].is_row) { if (tab->var[var].index == col) break; else continue; } row = tab->var[var].index; if (isl_int_is_zero(tab->mat->row[row][off + col])) continue; if (isl_int_is_pos(tab->mat->row[row][off + col])) break; fprintf(stderr, "lexneg column %d (row %d)\n", col, row); } if (var >= tab->n_var - tab->n_div) fprintf(stderr, "zero column %d\n", col); } } /* Report to the caller that the given constraint is part of an encountered * conflict. */ static int report_conflicting_constraint(struct isl_tab *tab, int con) { return tab->conflict(con, tab->conflict_user); } /* Given a conflicting row in the tableau, report all constraints * involved in the row to the caller. That is, the row itself * (if it represents a constraint) and all constraint columns with * non-zero (and therefore negative) coefficients. */ static int report_conflict(struct isl_tab *tab, int row) { int j; isl_int *tr; if (!tab->conflict) return 0; if (tab->row_var[row] < 0 && report_conflicting_constraint(tab, ~tab->row_var[row]) < 0) return -1; tr = tab->mat->row[row] + 2 + tab->M; for (j = tab->n_dead; j < tab->n_col; ++j) { if (tab->col_var[j] >= 0 && (tab->col_var[j] < tab->n_param || tab->col_var[j] >= tab->n_var - tab->n_div)) continue; if (!isl_int_is_neg(tr[j])) continue; if (tab->col_var[j] < 0 && report_conflicting_constraint(tab, ~tab->col_var[j]) < 0) return -1; } return 0; } /* Resolve all known or obviously violated constraints through pivoting. * In particular, as long as we can find any violated constraint, we * look for a pivoting column that would result in the lexicographically * smallest increment in the sample point. If there is no such column * then the tableau is infeasible. */ static int restore_lexmin(struct isl_tab *tab) WARN_UNUSED; static int restore_lexmin(struct isl_tab *tab) { int row, col; if (!tab) return -1; if (tab->empty) return 0; while ((row = first_neg(tab)) != -1) { col = lexmin_pivot_col(tab, row); if (col >= tab->n_col) { if (report_conflict(tab, row) < 0) return -1; if (isl_tab_mark_empty(tab) < 0) return -1; return 0; } if (col < 0) return -1; if (isl_tab_pivot(tab, row, col) < 0) return -1; } return 0; } /* Given a row that represents an equality, look for an appropriate * pivoting column. * In particular, if there are any non-zero coefficients among * the non-parameter variables, then we take the last of these * variables. Eliminating this variable in terms of the other * variables and/or parameters does not influence the property * that all column in the initial tableau are lexicographically * positive. The row corresponding to the eliminated variable * will only have non-zero entries below the diagonal of the * initial tableau. That is, we transform * * I I * 1 into a * I I * * If there is no such non-parameter variable, then we are dealing with * pure parameter equality and we pick any parameter with coefficient 1 or -1 * for elimination. This will ensure that the eliminated parameter * always has an integer value whenever all the other parameters are integral. * If there is no such parameter then we return -1. */ static int last_var_col_or_int_par_col(struct isl_tab *tab, int row) { unsigned off = 2 + tab->M; int i; for (i = tab->n_var - tab->n_div - 1; i >= 0 && i >= tab->n_param; --i) { int col; if (tab->var[i].is_row) continue; col = tab->var[i].index; if (col <= tab->n_dead) continue; if (!isl_int_is_zero(tab->mat->row[row][off + col])) return col; } for (i = tab->n_dead; i < tab->n_col; ++i) { if (isl_int_is_one(tab->mat->row[row][off + i])) return i; if (isl_int_is_negone(tab->mat->row[row][off + i])) return i; } return -1; } /* Add an equality that is known to be valid to the tableau. * We first check if we can eliminate a variable or a parameter. * If not, we add the equality as two inequalities. * In this case, the equality was a pure parameter equality and there * is no need to resolve any constraint violations. */ static struct isl_tab *add_lexmin_valid_eq(struct isl_tab *tab, isl_int *eq) { int i; int r; if (!tab) return NULL; r = isl_tab_add_row(tab, eq); if (r < 0) goto error; r = tab->con[r].index; i = last_var_col_or_int_par_col(tab, r); if (i < 0) { tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) goto error; isl_seq_neg(eq, eq, 1 + tab->n_var); r = isl_tab_add_row(tab, eq); if (r < 0) goto error; tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) goto error; } else { if (isl_tab_pivot(tab, r, i) < 0) goto error; if (isl_tab_kill_col(tab, i) < 0) goto error; tab->n_eq++; } return tab; error: isl_tab_free(tab); return NULL; } /* Check if the given row is a pure constant. */ static int is_constant(struct isl_tab *tab, int row) { unsigned off = 2 + tab->M; return isl_seq_first_non_zero(tab->mat->row[row] + off + tab->n_dead, tab->n_col - tab->n_dead) == -1; } /* Add an equality that may or may not be valid to the tableau. * If the resulting row is a pure constant, then it must be zero. * Otherwise, the resulting tableau is empty. * * If the row is not a pure constant, then we add two inequalities, * each time checking that they can be satisfied. * In the end we try to use one of the two constraints to eliminate * a column. */ static int add_lexmin_eq(struct isl_tab *tab, isl_int *eq) WARN_UNUSED; static int add_lexmin_eq(struct isl_tab *tab, isl_int *eq) { int r1, r2; int row; struct isl_tab_undo *snap; if (!tab) return -1; snap = isl_tab_snap(tab); r1 = isl_tab_add_row(tab, eq); if (r1 < 0) return -1; tab->con[r1].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r1]) < 0) return -1; row = tab->con[r1].index; if (is_constant(tab, row)) { if (!isl_int_is_zero(tab->mat->row[row][1]) || (tab->M && !isl_int_is_zero(tab->mat->row[row][2]))) { if (isl_tab_mark_empty(tab) < 0) return -1; return 0; } if (isl_tab_rollback(tab, snap) < 0) return -1; return 0; } if (restore_lexmin(tab) < 0) return -1; if (tab->empty) return 0; isl_seq_neg(eq, eq, 1 + tab->n_var); r2 = isl_tab_add_row(tab, eq); if (r2 < 0) return -1; tab->con[r2].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r2]) < 0) return -1; if (restore_lexmin(tab) < 0) return -1; if (tab->empty) return 0; if (!tab->con[r1].is_row) { if (isl_tab_kill_col(tab, tab->con[r1].index) < 0) return -1; } else if (!tab->con[r2].is_row) { if (isl_tab_kill_col(tab, tab->con[r2].index) < 0) return -1; } if (tab->bmap) { tab->bmap = isl_basic_map_add_ineq(tab->bmap, eq); if (isl_tab_push(tab, isl_tab_undo_bmap_ineq) < 0) return -1; isl_seq_neg(eq, eq, 1 + tab->n_var); tab->bmap = isl_basic_map_add_ineq(tab->bmap, eq); isl_seq_neg(eq, eq, 1 + tab->n_var); if (isl_tab_push(tab, isl_tab_undo_bmap_ineq) < 0) return -1; if (!tab->bmap) return -1; } return 0; } /* Add an inequality to the tableau, resolving violations using * restore_lexmin. */ static struct isl_tab *add_lexmin_ineq(struct isl_tab *tab, isl_int *ineq) { int r; if (!tab) return NULL; if (tab->bmap) { tab->bmap = isl_basic_map_add_ineq(tab->bmap, ineq); if (isl_tab_push(tab, isl_tab_undo_bmap_ineq) < 0) goto error; if (!tab->bmap) goto error; } r = isl_tab_add_row(tab, ineq); if (r < 0) goto error; tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) goto error; if (isl_tab_row_is_redundant(tab, tab->con[r].index)) { if (isl_tab_mark_redundant(tab, tab->con[r].index) < 0) goto error; return tab; } if (restore_lexmin(tab) < 0) goto error; if (!tab->empty && tab->con[r].is_row && isl_tab_row_is_redundant(tab, tab->con[r].index)) if (isl_tab_mark_redundant(tab, tab->con[r].index) < 0) goto error; return tab; error: isl_tab_free(tab); return NULL; } /* Check if the coefficients of the parameters are all integral. */ static int integer_parameter(struct isl_tab *tab, int row) { int i; int col; unsigned off = 2 + tab->M; for (i = 0; i < tab->n_param; ++i) { /* Eliminated parameter */ if (tab->var[i].is_row) continue; col = tab->var[i].index; if (!isl_int_is_divisible_by(tab->mat->row[row][off + col], tab->mat->row[row][0])) return 0; } for (i = 0; i < tab->n_div; ++i) { if (tab->var[tab->n_var - tab->n_div + i].is_row) continue; col = tab->var[tab->n_var - tab->n_div + i].index; if (!isl_int_is_divisible_by(tab->mat->row[row][off + col], tab->mat->row[row][0])) return 0; } return 1; } /* Check if the coefficients of the non-parameter variables are all integral. */ static int integer_variable(struct isl_tab *tab, int row) { int i; unsigned off = 2 + tab->M; for (i = tab->n_dead; i < tab->n_col; ++i) { if (tab->col_var[i] >= 0 && (tab->col_var[i] < tab->n_param || tab->col_var[i] >= tab->n_var - tab->n_div)) continue; if (!isl_int_is_divisible_by(tab->mat->row[row][off + i], tab->mat->row[row][0])) return 0; } return 1; } /* Check if the constant term is integral. */ static int integer_constant(struct isl_tab *tab, int row) { return isl_int_is_divisible_by(tab->mat->row[row][1], tab->mat->row[row][0]); } #define I_CST 1 << 0 #define I_PAR 1 << 1 #define I_VAR 1 << 2 /* Check for next (non-parameter) variable after "var" (first if var == -1) * that is non-integer and therefore requires a cut and return * the index of the variable. * For parametric tableaus, there are three parts in a row, * the constant, the coefficients of the parameters and the rest. * For each part, we check whether the coefficients in that part * are all integral and if so, set the corresponding flag in *f. * If the constant and the parameter part are integral, then the * current sample value is integral and no cut is required * (irrespective of whether the variable part is integral). */ static int next_non_integer_var(struct isl_tab *tab, int var, int *f) { var = var < 0 ? tab->n_param : var + 1; for (; var < tab->n_var - tab->n_div; ++var) { int flags = 0; int row; if (!tab->var[var].is_row) continue; row = tab->var[var].index; if (integer_constant(tab, row)) ISL_FL_SET(flags, I_CST); if (integer_parameter(tab, row)) ISL_FL_SET(flags, I_PAR); if (ISL_FL_ISSET(flags, I_CST) && ISL_FL_ISSET(flags, I_PAR)) continue; if (integer_variable(tab, row)) ISL_FL_SET(flags, I_VAR); *f = flags; return var; } return -1; } /* Check for first (non-parameter) variable that is non-integer and * therefore requires a cut and return the corresponding row. * For parametric tableaus, there are three parts in a row, * the constant, the coefficients of the parameters and the rest. * For each part, we check whether the coefficients in that part * are all integral and if so, set the corresponding flag in *f. * If the constant and the parameter part are integral, then the * current sample value is integral and no cut is required * (irrespective of whether the variable part is integral). */ static int first_non_integer_row(struct isl_tab *tab, int *f) { int var = next_non_integer_var(tab, -1, f); return var < 0 ? -1 : tab->var[var].index; } /* Add a (non-parametric) cut to cut away the non-integral sample * value of the given row. * * If the row is given by * * m r = f + \sum_i a_i y_i * * then the cut is * * c = - {-f/m} + \sum_i {a_i/m} y_i >= 0 * * The big parameter, if any, is ignored, since it is assumed to be big * enough to be divisible by any integer. * If the tableau is actually a parametric tableau, then this function * is only called when all coefficients of the parameters are integral. * The cut therefore has zero coefficients for the parameters. * * The current value is known to be negative, so row_sign, if it * exists, is set accordingly. * * Return the row of the cut or -1. */ static int add_cut(struct isl_tab *tab, int row) { int i; int r; isl_int *r_row; unsigned off = 2 + tab->M; if (isl_tab_extend_cons(tab, 1) < 0) return -1; r = isl_tab_allocate_con(tab); if (r < 0) return -1; r_row = tab->mat->row[tab->con[r].index]; isl_int_set(r_row[0], tab->mat->row[row][0]); isl_int_neg(r_row[1], tab->mat->row[row][1]); isl_int_fdiv_r(r_row[1], r_row[1], tab->mat->row[row][0]); isl_int_neg(r_row[1], r_row[1]); if (tab->M) isl_int_set_si(r_row[2], 0); for (i = 0; i < tab->n_col; ++i) isl_int_fdiv_r(r_row[off + i], tab->mat->row[row][off + i], tab->mat->row[row][0]); tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) return -1; if (tab->row_sign) tab->row_sign[tab->con[r].index] = isl_tab_row_neg; return tab->con[r].index; } #define CUT_ALL 1 #define CUT_ONE 0 /* Given a non-parametric tableau, add cuts until an integer * sample point is obtained or until the tableau is determined * to be integer infeasible. * As long as there is any non-integer value in the sample point, * we add appropriate cuts, if possible, for each of these * non-integer values and then resolve the violated * cut constraints using restore_lexmin. * If one of the corresponding rows is equal to an integral * combination of variables/constraints plus a non-integral constant, * then there is no way to obtain an integer point and we return * a tableau that is marked empty. * The parameter cutting_strategy controls the strategy used when adding cuts * to remove non-integer points. CUT_ALL adds all possible cuts * before continuing the search. CUT_ONE adds only one cut at a time. */ static struct isl_tab *cut_to_integer_lexmin(struct isl_tab *tab, int cutting_strategy) { int var; int row; int flags; if (!tab) return NULL; if (tab->empty) return tab; while ((var = next_non_integer_var(tab, -1, &flags)) != -1) { do { if (ISL_FL_ISSET(flags, I_VAR)) { if (isl_tab_mark_empty(tab) < 0) goto error; return tab; } row = tab->var[var].index; row = add_cut(tab, row); if (row < 0) goto error; if (cutting_strategy == CUT_ONE) break; } while ((var = next_non_integer_var(tab, var, &flags)) != -1); if (restore_lexmin(tab) < 0) goto error; if (tab->empty) break; } return tab; error: isl_tab_free(tab); return NULL; } /* Check whether all the currently active samples also satisfy the inequality * "ineq" (treated as an equality if eq is set). * Remove those samples that do not. */ static struct isl_tab *check_samples(struct isl_tab *tab, isl_int *ineq, int eq) { int i; isl_int v; if (!tab) return NULL; isl_assert(tab->mat->ctx, tab->bmap, goto error); isl_assert(tab->mat->ctx, tab->samples, goto error); isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, goto error); isl_int_init(v); for (i = tab->n_outside; i < tab->n_sample; ++i) { int sgn; isl_seq_inner_product(ineq, tab->samples->row[i], 1 + tab->n_var, &v); sgn = isl_int_sgn(v); if (eq ? (sgn == 0) : (sgn >= 0)) continue; tab = isl_tab_drop_sample(tab, i); if (!tab) break; } isl_int_clear(v); return tab; error: isl_tab_free(tab); return NULL; } /* Check whether the sample value of the tableau is finite, * i.e., either the tableau does not use a big parameter, or * all values of the variables are equal to the big parameter plus * some constant. This constant is the actual sample value. */ static int sample_is_finite(struct isl_tab *tab) { int i; if (!tab->M) return 1; for (i = 0; i < tab->n_var; ++i) { int row; if (!tab->var[i].is_row) return 0; row = tab->var[i].index; if (isl_int_ne(tab->mat->row[row][0], tab->mat->row[row][2])) return 0; } return 1; } /* Check if the context tableau of sol has any integer points. * Leave tab in empty state if no integer point can be found. * If an integer point can be found and if moreover it is finite, * then it is added to the list of sample values. * * This function is only called when none of the currently active sample * values satisfies the most recently added constraint. */ static struct isl_tab *check_integer_feasible(struct isl_tab *tab) { struct isl_tab_undo *snap; if (!tab) return NULL; snap = isl_tab_snap(tab); if (isl_tab_push_basis(tab) < 0) goto error; tab = cut_to_integer_lexmin(tab, CUT_ALL); if (!tab) goto error; if (!tab->empty && sample_is_finite(tab)) { struct isl_vec *sample; sample = isl_tab_get_sample_value(tab); tab = isl_tab_add_sample(tab, sample); } if (!tab->empty && isl_tab_rollback(tab, snap) < 0) goto error; return tab; error: isl_tab_free(tab); return NULL; } /* Check if any of the currently active sample values satisfies * the inequality "ineq" (an equality if eq is set). */ static int tab_has_valid_sample(struct isl_tab *tab, isl_int *ineq, int eq) { int i; isl_int v; if (!tab) return -1; isl_assert(tab->mat->ctx, tab->bmap, return -1); isl_assert(tab->mat->ctx, tab->samples, return -1); isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, return -1); isl_int_init(v); for (i = tab->n_outside; i < tab->n_sample; ++i) { int sgn; isl_seq_inner_product(ineq, tab->samples->row[i], 1 + tab->n_var, &v); sgn = isl_int_sgn(v); if (eq ? (sgn == 0) : (sgn >= 0)) break; } isl_int_clear(v); return i < tab->n_sample; } /* Add a div specified by "div" to the tableau "tab" and return * 1 if the div is obviously non-negative. */ static int context_tab_add_div(struct isl_tab *tab, struct isl_vec *div, int (*add_ineq)(void *user, isl_int *), void *user) { int i; int r; struct isl_mat *samples; int nonneg; r = isl_tab_add_div(tab, div, add_ineq, user); if (r < 0) return -1; nonneg = tab->var[r].is_nonneg; tab->var[r].frozen = 1; samples = isl_mat_extend(tab->samples, tab->n_sample, 1 + tab->n_var); tab->samples = samples; if (!samples) return -1; for (i = tab->n_outside; i < samples->n_row; ++i) { isl_seq_inner_product(div->el + 1, samples->row[i], div->size - 1, &samples->row[i][samples->n_col - 1]); isl_int_fdiv_q(samples->row[i][samples->n_col - 1], samples->row[i][samples->n_col - 1], div->el[0]); } return nonneg; } /* Add a div specified by "div" to both the main tableau and * the context tableau. In case of the main tableau, we only * need to add an extra div. In the context tableau, we also * need to express the meaning of the div. * Return the index of the div or -1 if anything went wrong. */ static int add_div(struct isl_tab *tab, struct isl_context *context, struct isl_vec *div) { int r; int nonneg; if ((nonneg = context->op->add_div(context, div)) < 0) goto error; if (!context->op->is_ok(context)) goto error; if (isl_tab_extend_vars(tab, 1) < 0) goto error; r = isl_tab_allocate_var(tab); if (r < 0) goto error; if (nonneg) tab->var[r].is_nonneg = 1; tab->var[r].frozen = 1; tab->n_div++; return tab->n_div - 1; error: context->op->invalidate(context); return -1; } static int find_div(struct isl_tab *tab, isl_int *div, isl_int denom) { int i; unsigned total = isl_basic_map_total_dim(tab->bmap); for (i = 0; i < tab->bmap->n_div; ++i) { if (isl_int_ne(tab->bmap->div[i][0], denom)) continue; if (!isl_seq_eq(tab->bmap->div[i] + 1, div, 1 + total)) continue; return i; } return -1; } /* Return the index of a div that corresponds to "div". * We first check if we already have such a div and if not, we create one. */ static int get_div(struct isl_tab *tab, struct isl_context *context, struct isl_vec *div) { int d; struct isl_tab *context_tab = context->op->peek_tab(context); if (!context_tab) return -1; d = find_div(context_tab, div->el + 1, div->el[0]); if (d != -1) return d; return add_div(tab, context, div); } /* Add a parametric cut to cut away the non-integral sample value * of the give row. * Let a_i be the coefficients of the constant term and the parameters * and let b_i be the coefficients of the variables or constraints * in basis of the tableau. * Let q be the div q = floor(\sum_i {-a_i} y_i). * * The cut is expressed as * * c = \sum_i -{-a_i} y_i + \sum_i {b_i} x_i + q >= 0 * * If q did not already exist in the context tableau, then it is added first. * If q is in a column of the main tableau then the "+ q" can be accomplished * by setting the corresponding entry to the denominator of the constraint. * If q happens to be in a row of the main tableau, then the corresponding * row needs to be added instead (taking care of the denominators). * Note that this is very unlikely, but perhaps not entirely impossible. * * The current value of the cut is known to be negative (or at least * non-positive), so row_sign is set accordingly. * * Return the row of the cut or -1. */ static int add_parametric_cut(struct isl_tab *tab, int row, struct isl_context *context) { struct isl_vec *div; int d; int i; int r; isl_int *r_row; int col; int n; unsigned off = 2 + tab->M; if (!context) return -1; div = get_row_parameter_div(tab, row); if (!div) return -1; n = tab->n_div; d = context->op->get_div(context, tab, div); isl_vec_free(div); if (d < 0) return -1; if (isl_tab_extend_cons(tab, 1) < 0) return -1; r = isl_tab_allocate_con(tab); if (r < 0) return -1; r_row = tab->mat->row[tab->con[r].index]; isl_int_set(r_row[0], tab->mat->row[row][0]); isl_int_neg(r_row[1], tab->mat->row[row][1]); isl_int_fdiv_r(r_row[1], r_row[1], tab->mat->row[row][0]); isl_int_neg(r_row[1], r_row[1]); if (tab->M) isl_int_set_si(r_row[2], 0); for (i = 0; i < tab->n_param; ++i) { if (tab->var[i].is_row) continue; col = tab->var[i].index; isl_int_neg(r_row[off + col], tab->mat->row[row][off + col]); isl_int_fdiv_r(r_row[off + col], r_row[off + col], tab->mat->row[row][0]); isl_int_neg(r_row[off + col], r_row[off + col]); } for (i = 0; i < tab->n_div; ++i) { if (tab->var[tab->n_var - tab->n_div + i].is_row) continue; col = tab->var[tab->n_var - tab->n_div + i].index; isl_int_neg(r_row[off + col], tab->mat->row[row][off + col]); isl_int_fdiv_r(r_row[off + col], r_row[off + col], tab->mat->row[row][0]); isl_int_neg(r_row[off + col], r_row[off + col]); } for (i = 0; i < tab->n_col; ++i) { if (tab->col_var[i] >= 0 && (tab->col_var[i] < tab->n_param || tab->col_var[i] >= tab->n_var - tab->n_div)) continue; isl_int_fdiv_r(r_row[off + i], tab->mat->row[row][off + i], tab->mat->row[row][0]); } if (tab->var[tab->n_var - tab->n_div + d].is_row) { isl_int gcd; int d_row = tab->var[tab->n_var - tab->n_div + d].index; isl_int_init(gcd); isl_int_gcd(gcd, tab->mat->row[d_row][0], r_row[0]); isl_int_divexact(r_row[0], r_row[0], gcd); isl_int_divexact(gcd, tab->mat->row[d_row][0], gcd); isl_seq_combine(r_row + 1, gcd, r_row + 1, r_row[0], tab->mat->row[d_row] + 1, off - 1 + tab->n_col); isl_int_mul(r_row[0], r_row[0], tab->mat->row[d_row][0]); isl_int_clear(gcd); } else { col = tab->var[tab->n_var - tab->n_div + d].index; isl_int_set(r_row[off + col], tab->mat->row[row][0]); } tab->con[r].is_nonneg = 1; if (isl_tab_push_var(tab, isl_tab_undo_nonneg, &tab->con[r]) < 0) return -1; if (tab->row_sign) tab->row_sign[tab->con[r].index] = isl_tab_row_neg; row = tab->con[r].index; if (d >= n && context->op->detect_equalities(context, tab) < 0) return -1; return row; } /* Construct a tableau for bmap that can be used for computing * the lexicographic minimum (or maximum) of bmap. * If not NULL, then dom is the domain where the minimum * should be computed. In this case, we set up a parametric * tableau with row signs (initialized to "unknown"). * If M is set, then the tableau will use a big parameter. * If max is set, then a maximum should be computed instead of a minimum. * This means that for each variable x, the tableau will contain the variable * x' = M - x, rather than x' = M + x. This in turn means that the coefficient * of the variables in all constraints are negated prior to adding them * to the tableau. */ static struct isl_tab *tab_for_lexmin(struct isl_basic_map *bmap, struct isl_basic_set *dom, unsigned M, int max) { int i; struct isl_tab *tab; tab = isl_tab_alloc(bmap->ctx, 2 * bmap->n_eq + bmap->n_ineq + 1, isl_basic_map_total_dim(bmap), M); if (!tab) return NULL; tab->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); if (dom) { tab->n_param = isl_basic_set_total_dim(dom) - dom->n_div; tab->n_div = dom->n_div; tab->row_sign = isl_calloc_array(bmap->ctx, enum isl_tab_row_sign, tab->mat->n_row); if (tab->mat->n_row && !tab->row_sign) goto error; } if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) { if (isl_tab_mark_empty(tab) < 0) goto error; return tab; } for (i = tab->n_param; i < tab->n_var - tab->n_div; ++i) { tab->var[i].is_nonneg = 1; tab->var[i].frozen = 1; } for (i = 0; i < bmap->n_eq; ++i) { if (max) isl_seq_neg(bmap->eq[i] + 1 + tab->n_param, bmap->eq[i] + 1 + tab->n_param, tab->n_var - tab->n_param - tab->n_div); tab = add_lexmin_valid_eq(tab, bmap->eq[i]); if (max) isl_seq_neg(bmap->eq[i] + 1 + tab->n_param, bmap->eq[i] + 1 + tab->n_param, tab->n_var - tab->n_param - tab->n_div); if (!tab || tab->empty) return tab; } if (bmap->n_eq && restore_lexmin(tab) < 0) goto error; for (i = 0; i < bmap->n_ineq; ++i) { if (max) isl_seq_neg(bmap->ineq[i] + 1 + tab->n_param, bmap->ineq[i] + 1 + tab->n_param, tab->n_var - tab->n_param - tab->n_div); tab = add_lexmin_ineq(tab, bmap->ineq[i]); if (max) isl_seq_neg(bmap->ineq[i] + 1 + tab->n_param, bmap->ineq[i] + 1 + tab->n_param, tab->n_var - tab->n_param - tab->n_div); if (!tab || tab->empty) return tab; } return tab; error: isl_tab_free(tab); return NULL; } /* Given a main tableau where more than one row requires a split, * determine and return the "best" row to split on. * * Given two rows in the main tableau, if the inequality corresponding * to the first row is redundant with respect to that of the second row * in the current tableau, then it is better to split on the second row, * since in the positive part, both row will be positive. * (In the negative part a pivot will have to be performed and just about * anything can happen to the sign of the other row.) * * As a simple heuristic, we therefore select the row that makes the most * of the other rows redundant. * * Perhaps it would also be useful to look at the number of constraints * that conflict with any given constraint. */ static int best_split(struct isl_tab *tab, struct isl_tab *context_tab) { struct isl_tab_undo *snap; int split; int row; int best = -1; int best_r; if (isl_tab_extend_cons(context_tab, 2) < 0) return -1; snap = isl_tab_snap(context_tab); for (split = tab->n_redundant; split < tab->n_row; ++split) { struct isl_tab_undo *snap2; struct isl_vec *ineq = NULL; int r = 0; int ok; if (!isl_tab_var_from_row(tab, split)->is_nonneg) continue; if (tab->row_sign[split] != isl_tab_row_any) continue; ineq = get_row_parameter_ineq(tab, split); if (!ineq) return -1; ok = isl_tab_add_ineq(context_tab, ineq->el) >= 0; isl_vec_free(ineq); if (!ok) return -1; snap2 = isl_tab_snap(context_tab); for (row = tab->n_redundant; row < tab->n_row; ++row) { struct isl_tab_var *var; if (row == split) continue; if (!isl_tab_var_from_row(tab, row)->is_nonneg) continue; if (tab->row_sign[row] != isl_tab_row_any) continue; ineq = get_row_parameter_ineq(tab, row); if (!ineq) return -1; ok = isl_tab_add_ineq(context_tab, ineq->el) >= 0; isl_vec_free(ineq); if (!ok) return -1; var = &context_tab->con[context_tab->n_con - 1]; if (!context_tab->empty && !isl_tab_min_at_most_neg_one(context_tab, var)) r++; if (isl_tab_rollback(context_tab, snap2) < 0) return -1; } if (best == -1 || r > best_r) { best = split; best_r = r; } if (isl_tab_rollback(context_tab, snap) < 0) return -1; } return best; } static struct isl_basic_set *context_lex_peek_basic_set( struct isl_context *context) { struct isl_context_lex *clex = (struct isl_context_lex *)context; if (!clex->tab) return NULL; return isl_tab_peek_bset(clex->tab); } static struct isl_tab *context_lex_peek_tab(struct isl_context *context) { struct isl_context_lex *clex = (struct isl_context_lex *)context; return clex->tab; } static void context_lex_add_eq(struct isl_context *context, isl_int *eq, int check, int update) { struct isl_context_lex *clex = (struct isl_context_lex *)context; if (isl_tab_extend_cons(clex->tab, 2) < 0) goto error; if (add_lexmin_eq(clex->tab, eq) < 0) goto error; if (check) { int v = tab_has_valid_sample(clex->tab, eq, 1); if (v < 0) goto error; if (!v) clex->tab = check_integer_feasible(clex->tab); } if (update) clex->tab = check_samples(clex->tab, eq, 1); return; error: isl_tab_free(clex->tab); clex->tab = NULL; } static void context_lex_add_ineq(struct isl_context *context, isl_int *ineq, int check, int update) { struct isl_context_lex *clex = (struct isl_context_lex *)context; if (isl_tab_extend_cons(clex->tab, 1) < 0) goto error; clex->tab = add_lexmin_ineq(clex->tab, ineq); if (check) { int v = tab_has_valid_sample(clex->tab, ineq, 0); if (v < 0) goto error; if (!v) clex->tab = check_integer_feasible(clex->tab); } if (update) clex->tab = check_samples(clex->tab, ineq, 0); return; error: isl_tab_free(clex->tab); clex->tab = NULL; } static int context_lex_add_ineq_wrap(void *user, isl_int *ineq) { struct isl_context *context = (struct isl_context *)user; context_lex_add_ineq(context, ineq, 0, 0); return context->op->is_ok(context) ? 0 : -1; } /* Check which signs can be obtained by "ineq" on all the currently * active sample values. See row_sign for more information. */ static enum isl_tab_row_sign tab_ineq_sign(struct isl_tab *tab, isl_int *ineq, int strict) { int i; int sgn; isl_int tmp; enum isl_tab_row_sign res = isl_tab_row_unknown; isl_assert(tab->mat->ctx, tab->samples, return isl_tab_row_unknown); isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, return isl_tab_row_unknown); isl_int_init(tmp); for (i = tab->n_outside; i < tab->n_sample; ++i) { isl_seq_inner_product(tab->samples->row[i], ineq, 1 + tab->n_var, &tmp); sgn = isl_int_sgn(tmp); if (sgn > 0 || (sgn == 0 && strict)) { if (res == isl_tab_row_unknown) res = isl_tab_row_pos; if (res == isl_tab_row_neg) res = isl_tab_row_any; } if (sgn < 0) { if (res == isl_tab_row_unknown) res = isl_tab_row_neg; if (res == isl_tab_row_pos) res = isl_tab_row_any; } if (res == isl_tab_row_any) break; } isl_int_clear(tmp); return res; } static enum isl_tab_row_sign context_lex_ineq_sign(struct isl_context *context, isl_int *ineq, int strict) { struct isl_context_lex *clex = (struct isl_context_lex *)context; return tab_ineq_sign(clex->tab, ineq, strict); } /* Check whether "ineq" can be added to the tableau without rendering * it infeasible. */ static int context_lex_test_ineq(struct isl_context *context, isl_int *ineq) { struct isl_context_lex *clex = (struct isl_context_lex *)context; struct isl_tab_undo *snap; int feasible; if (!clex->tab) return -1; if (isl_tab_extend_cons(clex->tab, 1) < 0) return -1; snap = isl_tab_snap(clex->tab); if (isl_tab_push_basis(clex->tab) < 0) return -1; clex->tab = add_lexmin_ineq(clex->tab, ineq); clex->tab = check_integer_feasible(clex->tab); if (!clex->tab) return -1; feasible = !clex->tab->empty; if (isl_tab_rollback(clex->tab, snap) < 0) return -1; return feasible; } static int context_lex_get_div(struct isl_context *context, struct isl_tab *tab, struct isl_vec *div) { return get_div(tab, context, div); } /* Add a div specified by "div" to the context tableau and return * 1 if the div is obviously non-negative. * context_tab_add_div will always return 1, because all variables * in a isl_context_lex tableau are non-negative. * However, if we are using a big parameter in the context, then this only * reflects the non-negativity of the variable used to _encode_ the * div, i.e., div' = M + div, so we can't draw any conclusions. */ static int context_lex_add_div(struct isl_context *context, struct isl_vec *div) { struct isl_context_lex *clex = (struct isl_context_lex *)context; int nonneg; nonneg = context_tab_add_div(clex->tab, div, context_lex_add_ineq_wrap, context); if (nonneg < 0) return -1; if (clex->tab->M) return 0; return nonneg; } static int context_lex_detect_equalities(struct isl_context *context, struct isl_tab *tab) { return 0; } static int context_lex_best_split(struct isl_context *context, struct isl_tab *tab) { struct isl_context_lex *clex = (struct isl_context_lex *)context; struct isl_tab_undo *snap; int r; snap = isl_tab_snap(clex->tab); if (isl_tab_push_basis(clex->tab) < 0) return -1; r = best_split(tab, clex->tab); if (r >= 0 && isl_tab_rollback(clex->tab, snap) < 0) return -1; return r; } static int context_lex_is_empty(struct isl_context *context) { struct isl_context_lex *clex = (struct isl_context_lex *)context; if (!clex->tab) return -1; return clex->tab->empty; } static void *context_lex_save(struct isl_context *context) { struct isl_context_lex *clex = (struct isl_context_lex *)context; struct isl_tab_undo *snap; snap = isl_tab_snap(clex->tab); if (isl_tab_push_basis(clex->tab) < 0) return NULL; if (isl_tab_save_samples(clex->tab) < 0) return NULL; return snap; } static void context_lex_restore(struct isl_context *context, void *save) { struct isl_context_lex *clex = (struct isl_context_lex *)context; if (isl_tab_rollback(clex->tab, (struct isl_tab_undo *)save) < 0) { isl_tab_free(clex->tab); clex->tab = NULL; } } static void context_lex_discard(void *save) { } static int context_lex_is_ok(struct isl_context *context) { struct isl_context_lex *clex = (struct isl_context_lex *)context; return !!clex->tab; } /* For each variable in the context tableau, check if the variable can * only attain non-negative values. If so, mark the parameter as non-negative * in the main tableau. This allows for a more direct identification of some * cases of violated constraints. */ static struct isl_tab *tab_detect_nonnegative_parameters(struct isl_tab *tab, struct isl_tab *context_tab) { int i; struct isl_tab_undo *snap; struct isl_vec *ineq = NULL; struct isl_tab_var *var; int n; if (context_tab->n_var == 0) return tab; ineq = isl_vec_alloc(tab->mat->ctx, 1 + context_tab->n_var); if (!ineq) goto error; if (isl_tab_extend_cons(context_tab, 1) < 0) goto error; snap = isl_tab_snap(context_tab); n = 0; isl_seq_clr(ineq->el, ineq->size); for (i = 0; i < context_tab->n_var; ++i) { isl_int_set_si(ineq->el[1 + i], 1); if (isl_tab_add_ineq(context_tab, ineq->el) < 0) goto error; var = &context_tab->con[context_tab->n_con - 1]; if (!context_tab->empty && !isl_tab_min_at_most_neg_one(context_tab, var)) { int j = i; if (i >= tab->n_param) j = i - tab->n_param + tab->n_var - tab->n_div; tab->var[j].is_nonneg = 1; n++; } isl_int_set_si(ineq->el[1 + i], 0); if (isl_tab_rollback(context_tab, snap) < 0) goto error; } if (context_tab->M && n == context_tab->n_var) { context_tab->mat = isl_mat_drop_cols(context_tab->mat, 2, 1); context_tab->M = 0; } isl_vec_free(ineq); return tab; error: isl_vec_free(ineq); isl_tab_free(tab); return NULL; } static struct isl_tab *context_lex_detect_nonnegative_parameters( struct isl_context *context, struct isl_tab *tab) { struct isl_context_lex *clex = (struct isl_context_lex *)context; struct isl_tab_undo *snap; if (!tab) return NULL; snap = isl_tab_snap(clex->tab); if (isl_tab_push_basis(clex->tab) < 0) goto error; tab = tab_detect_nonnegative_parameters(tab, clex->tab); if (isl_tab_rollback(clex->tab, snap) < 0) goto error; return tab; error: isl_tab_free(tab); return NULL; } static void context_lex_invalidate(struct isl_context *context) { struct isl_context_lex *clex = (struct isl_context_lex *)context; isl_tab_free(clex->tab); clex->tab = NULL; } static void context_lex_free(struct isl_context *context) { struct isl_context_lex *clex = (struct isl_context_lex *)context; isl_tab_free(clex->tab); free(clex); } struct isl_context_op isl_context_lex_op = { context_lex_detect_nonnegative_parameters, context_lex_peek_basic_set, context_lex_peek_tab, context_lex_add_eq, context_lex_add_ineq, context_lex_ineq_sign, context_lex_test_ineq, context_lex_get_div, context_lex_add_div, context_lex_detect_equalities, context_lex_best_split, context_lex_is_empty, context_lex_is_ok, context_lex_save, context_lex_restore, context_lex_discard, context_lex_invalidate, context_lex_free, }; static struct isl_tab *context_tab_for_lexmin(struct isl_basic_set *bset) { struct isl_tab *tab; if (!bset) return NULL; tab = tab_for_lexmin((struct isl_basic_map *)bset, NULL, 1, 0); if (!tab) goto error; if (isl_tab_track_bset(tab, bset) < 0) goto error; tab = isl_tab_init_samples(tab); return tab; error: isl_basic_set_free(bset); return NULL; } static struct isl_context *isl_context_lex_alloc(struct isl_basic_set *dom) { struct isl_context_lex *clex; if (!dom) return NULL; clex = isl_alloc_type(dom->ctx, struct isl_context_lex); if (!clex) return NULL; clex->context.op = &isl_context_lex_op; clex->tab = context_tab_for_lexmin(isl_basic_set_copy(dom)); if (restore_lexmin(clex->tab) < 0) goto error; clex->tab = check_integer_feasible(clex->tab); if (!clex->tab) goto error; return &clex->context; error: clex->context.op->free(&clex->context); return NULL; } /* Representation of the context when using generalized basis reduction. * * "shifted" contains the offsets of the unit hypercubes that lie inside the * context. Any rational point in "shifted" can therefore be rounded * up to an integer point in the context. * If the context is constrained by any equality, then "shifted" is not used * as it would be empty. */ struct isl_context_gbr { struct isl_context context; struct isl_tab *tab; struct isl_tab *shifted; struct isl_tab *cone; }; static struct isl_tab *context_gbr_detect_nonnegative_parameters( struct isl_context *context, struct isl_tab *tab) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; if (!tab) return NULL; return tab_detect_nonnegative_parameters(tab, cgbr->tab); } static struct isl_basic_set *context_gbr_peek_basic_set( struct isl_context *context) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; if (!cgbr->tab) return NULL; return isl_tab_peek_bset(cgbr->tab); } static struct isl_tab *context_gbr_peek_tab(struct isl_context *context) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; return cgbr->tab; } /* Initialize the "shifted" tableau of the context, which * contains the constraints of the original tableau shifted * by the sum of all negative coefficients. This ensures * that any rational point in the shifted tableau can * be rounded up to yield an integer point in the original tableau. */ static void gbr_init_shifted(struct isl_context_gbr *cgbr) { int i, j; struct isl_vec *cst; struct isl_basic_set *bset = isl_tab_peek_bset(cgbr->tab); unsigned dim = isl_basic_set_total_dim(bset); cst = isl_vec_alloc(cgbr->tab->mat->ctx, bset->n_ineq); if (!cst) return; for (i = 0; i < bset->n_ineq; ++i) { isl_int_set(cst->el[i], bset->ineq[i][0]); for (j = 0; j < dim; ++j) { if (!isl_int_is_neg(bset->ineq[i][1 + j])) continue; isl_int_add(bset->ineq[i][0], bset->ineq[i][0], bset->ineq[i][1 + j]); } } cgbr->shifted = isl_tab_from_basic_set(bset, 0); for (i = 0; i < bset->n_ineq; ++i) isl_int_set(bset->ineq[i][0], cst->el[i]); isl_vec_free(cst); } /* Check if the shifted tableau is non-empty, and if so * use the sample point to construct an integer point * of the context tableau. */ static struct isl_vec *gbr_get_shifted_sample(struct isl_context_gbr *cgbr) { struct isl_vec *sample; if (!cgbr->shifted) gbr_init_shifted(cgbr); if (!cgbr->shifted) return NULL; if (cgbr->shifted->empty) return isl_vec_alloc(cgbr->tab->mat->ctx, 0); sample = isl_tab_get_sample_value(cgbr->shifted); sample = isl_vec_ceil(sample); return sample; } static struct isl_basic_set *drop_constant_terms(struct isl_basic_set *bset) { int i; if (!bset) return NULL; for (i = 0; i < bset->n_eq; ++i) isl_int_set_si(bset->eq[i][0], 0); for (i = 0; i < bset->n_ineq; ++i) isl_int_set_si(bset->ineq[i][0], 0); return bset; } static int use_shifted(struct isl_context_gbr *cgbr) { if (!cgbr->tab) return 0; return cgbr->tab->bmap->n_eq == 0 && cgbr->tab->bmap->n_div == 0; } static struct isl_vec *gbr_get_sample(struct isl_context_gbr *cgbr) { struct isl_basic_set *bset; struct isl_basic_set *cone; if (isl_tab_sample_is_integer(cgbr->tab)) return isl_tab_get_sample_value(cgbr->tab); if (use_shifted(cgbr)) { struct isl_vec *sample; sample = gbr_get_shifted_sample(cgbr); if (!sample || sample->size > 0) return sample; isl_vec_free(sample); } if (!cgbr->cone) { bset = isl_tab_peek_bset(cgbr->tab); cgbr->cone = isl_tab_from_recession_cone(bset, 0); if (!cgbr->cone) return NULL; if (isl_tab_track_bset(cgbr->cone, isl_basic_set_copy(bset)) < 0) return NULL; } if (isl_tab_detect_implicit_equalities(cgbr->cone) < 0) return NULL; if (cgbr->cone->n_dead == cgbr->cone->n_col) { struct isl_vec *sample; struct isl_tab_undo *snap; if (cgbr->tab->basis) { if (cgbr->tab->basis->n_col != 1 + cgbr->tab->n_var) { isl_mat_free(cgbr->tab->basis); cgbr->tab->basis = NULL; } cgbr->tab->n_zero = 0; cgbr->tab->n_unbounded = 0; } snap = isl_tab_snap(cgbr->tab); sample = isl_tab_sample(cgbr->tab); if (isl_tab_rollback(cgbr->tab, snap) < 0) { isl_vec_free(sample); return NULL; } return sample; } cone = isl_basic_set_dup(isl_tab_peek_bset(cgbr->cone)); cone = drop_constant_terms(cone); cone = isl_basic_set_update_from_tab(cone, cgbr->cone); cone = isl_basic_set_underlying_set(cone); cone = isl_basic_set_gauss(cone, NULL); bset = isl_basic_set_dup(isl_tab_peek_bset(cgbr->tab)); bset = isl_basic_set_update_from_tab(bset, cgbr->tab); bset = isl_basic_set_underlying_set(bset); bset = isl_basic_set_gauss(bset, NULL); return isl_basic_set_sample_with_cone(bset, cone); } static void check_gbr_integer_feasible(struct isl_context_gbr *cgbr) { struct isl_vec *sample; if (!cgbr->tab) return; if (cgbr->tab->empty) return; sample = gbr_get_sample(cgbr); if (!sample) goto error; if (sample->size == 0) { isl_vec_free(sample); if (isl_tab_mark_empty(cgbr->tab) < 0) goto error; return; } cgbr->tab = isl_tab_add_sample(cgbr->tab, sample); return; error: isl_tab_free(cgbr->tab); cgbr->tab = NULL; } static struct isl_tab *add_gbr_eq(struct isl_tab *tab, isl_int *eq) { if (!tab) return NULL; if (isl_tab_extend_cons(tab, 2) < 0) goto error; if (isl_tab_add_eq(tab, eq) < 0) goto error; return tab; error: isl_tab_free(tab); return NULL; } /* Add the equality described by "eq" to the context. * If "check" is set, then we check if the context is empty after * adding the equality. * If "update" is set, then we check if the samples are still valid. * * We do not explicitly add shifted copies of the equality to * cgbr->shifted since they would conflict with each other. * Instead, we directly mark cgbr->shifted empty. */ static void context_gbr_add_eq(struct isl_context *context, isl_int *eq, int check, int update) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; cgbr->tab = add_gbr_eq(cgbr->tab, eq); if (cgbr->shifted && !cgbr->shifted->empty && use_shifted(cgbr)) { if (isl_tab_mark_empty(cgbr->shifted) < 0) goto error; } if (cgbr->cone && cgbr->cone->n_col != cgbr->cone->n_dead) { if (isl_tab_extend_cons(cgbr->cone, 2) < 0) goto error; if (isl_tab_add_eq(cgbr->cone, eq) < 0) goto error; } if (check) { int v = tab_has_valid_sample(cgbr->tab, eq, 1); if (v < 0) goto error; if (!v) check_gbr_integer_feasible(cgbr); } if (update) cgbr->tab = check_samples(cgbr->tab, eq, 1); return; error: isl_tab_free(cgbr->tab); cgbr->tab = NULL; } static void add_gbr_ineq(struct isl_context_gbr *cgbr, isl_int *ineq) { if (!cgbr->tab) return; if (isl_tab_extend_cons(cgbr->tab, 1) < 0) goto error; if (isl_tab_add_ineq(cgbr->tab, ineq) < 0) goto error; if (cgbr->shifted && !cgbr->shifted->empty && use_shifted(cgbr)) { int i; unsigned dim; dim = isl_basic_map_total_dim(cgbr->tab->bmap); if (isl_tab_extend_cons(cgbr->shifted, 1) < 0) goto error; for (i = 0; i < dim; ++i) { if (!isl_int_is_neg(ineq[1 + i])) continue; isl_int_add(ineq[0], ineq[0], ineq[1 + i]); } if (isl_tab_add_ineq(cgbr->shifted, ineq) < 0) goto error; for (i = 0; i < dim; ++i) { if (!isl_int_is_neg(ineq[1 + i])) continue; isl_int_sub(ineq[0], ineq[0], ineq[1 + i]); } } if (cgbr->cone && cgbr->cone->n_col != cgbr->cone->n_dead) { if (isl_tab_extend_cons(cgbr->cone, 1) < 0) goto error; if (isl_tab_add_ineq(cgbr->cone, ineq) < 0) goto error; } return; error: isl_tab_free(cgbr->tab); cgbr->tab = NULL; } static void context_gbr_add_ineq(struct isl_context *context, isl_int *ineq, int check, int update) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; add_gbr_ineq(cgbr, ineq); if (!cgbr->tab) return; if (check) { int v = tab_has_valid_sample(cgbr->tab, ineq, 0); if (v < 0) goto error; if (!v) check_gbr_integer_feasible(cgbr); } if (update) cgbr->tab = check_samples(cgbr->tab, ineq, 0); return; error: isl_tab_free(cgbr->tab); cgbr->tab = NULL; } static int context_gbr_add_ineq_wrap(void *user, isl_int *ineq) { struct isl_context *context = (struct isl_context *)user; context_gbr_add_ineq(context, ineq, 0, 0); return context->op->is_ok(context) ? 0 : -1; } static enum isl_tab_row_sign context_gbr_ineq_sign(struct isl_context *context, isl_int *ineq, int strict) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; return tab_ineq_sign(cgbr->tab, ineq, strict); } /* Check whether "ineq" can be added to the tableau without rendering * it infeasible. */ static int context_gbr_test_ineq(struct isl_context *context, isl_int *ineq) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; struct isl_tab_undo *snap; struct isl_tab_undo *shifted_snap = NULL; struct isl_tab_undo *cone_snap = NULL; int feasible; if (!cgbr->tab) return -1; if (isl_tab_extend_cons(cgbr->tab, 1) < 0) return -1; snap = isl_tab_snap(cgbr->tab); if (cgbr->shifted) shifted_snap = isl_tab_snap(cgbr->shifted); if (cgbr->cone) cone_snap = isl_tab_snap(cgbr->cone); add_gbr_ineq(cgbr, ineq); check_gbr_integer_feasible(cgbr); if (!cgbr->tab) return -1; feasible = !cgbr->tab->empty; if (isl_tab_rollback(cgbr->tab, snap) < 0) return -1; if (shifted_snap) { if (isl_tab_rollback(cgbr->shifted, shifted_snap)) return -1; } else if (cgbr->shifted) { isl_tab_free(cgbr->shifted); cgbr->shifted = NULL; } if (cone_snap) { if (isl_tab_rollback(cgbr->cone, cone_snap)) return -1; } else if (cgbr->cone) { isl_tab_free(cgbr->cone); cgbr->cone = NULL; } return feasible; } /* Return the column of the last of the variables associated to * a column that has a non-zero coefficient. * This function is called in a context where only coefficients * of parameters or divs can be non-zero. */ static int last_non_zero_var_col(struct isl_tab *tab, isl_int *p) { int i; int col; if (tab->n_var == 0) return -1; for (i = tab->n_var - 1; i >= 0; --i) { if (i >= tab->n_param && i < tab->n_var - tab->n_div) continue; if (tab->var[i].is_row) continue; col = tab->var[i].index; if (!isl_int_is_zero(p[col])) return col; } return -1; } /* Look through all the recently added equalities in the context * to see if we can propagate any of them to the main tableau. * * The newly added equalities in the context are encoded as pairs * of inequalities starting at inequality "first". * * We tentatively add each of these equalities to the main tableau * and if this happens to result in a row with a final coefficient * that is one or negative one, we use it to kill a column * in the main tableau. Otherwise, we discard the tentatively * added row. */ static void propagate_equalities(struct isl_context_gbr *cgbr, struct isl_tab *tab, unsigned first) { int i; struct isl_vec *eq = NULL; eq = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_var); if (!eq) goto error; if (isl_tab_extend_cons(tab, (cgbr->tab->bmap->n_ineq - first)/2) < 0) goto error; isl_seq_clr(eq->el + 1 + tab->n_param, tab->n_var - tab->n_param - tab->n_div); for (i = first; i < cgbr->tab->bmap->n_ineq; i += 2) { int j; int r; struct isl_tab_undo *snap; snap = isl_tab_snap(tab); isl_seq_cpy(eq->el, cgbr->tab->bmap->ineq[i], 1 + tab->n_param); isl_seq_cpy(eq->el + 1 + tab->n_var - tab->n_div, cgbr->tab->bmap->ineq[i] + 1 + tab->n_param, tab->n_div); r = isl_tab_add_row(tab, eq->el); if (r < 0) goto error; r = tab->con[r].index; j = last_non_zero_var_col(tab, tab->mat->row[r] + 2 + tab->M); if (j < 0 || j < tab->n_dead || !isl_int_is_one(tab->mat->row[r][0]) || (!isl_int_is_one(tab->mat->row[r][2 + tab->M + j]) && !isl_int_is_negone(tab->mat->row[r][2 + tab->M + j]))) { if (isl_tab_rollback(tab, snap) < 0) goto error; continue; } if (isl_tab_pivot(tab, r, j) < 0) goto error; if (isl_tab_kill_col(tab, j) < 0) goto error; if (restore_lexmin(tab) < 0) goto error; } isl_vec_free(eq); return; error: isl_vec_free(eq); isl_tab_free(cgbr->tab); cgbr->tab = NULL; } static int context_gbr_detect_equalities(struct isl_context *context, struct isl_tab *tab) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; struct isl_ctx *ctx; unsigned n_ineq; ctx = cgbr->tab->mat->ctx; if (!cgbr->cone) { struct isl_basic_set *bset = isl_tab_peek_bset(cgbr->tab); cgbr->cone = isl_tab_from_recession_cone(bset, 0); if (!cgbr->cone) goto error; if (isl_tab_track_bset(cgbr->cone, isl_basic_set_copy(bset)) < 0) goto error; } if (isl_tab_detect_implicit_equalities(cgbr->cone) < 0) goto error; n_ineq = cgbr->tab->bmap->n_ineq; cgbr->tab = isl_tab_detect_equalities(cgbr->tab, cgbr->cone); if (!cgbr->tab) return -1; if (cgbr->tab->bmap->n_ineq > n_ineq) propagate_equalities(cgbr, tab, n_ineq); return 0; error: isl_tab_free(cgbr->tab); cgbr->tab = NULL; return -1; } static int context_gbr_get_div(struct isl_context *context, struct isl_tab *tab, struct isl_vec *div) { return get_div(tab, context, div); } static int context_gbr_add_div(struct isl_context *context, struct isl_vec *div) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; if (cgbr->cone) { int k; if (isl_tab_extend_cons(cgbr->cone, 3) < 0) return -1; if (isl_tab_extend_vars(cgbr->cone, 1) < 0) return -1; if (isl_tab_allocate_var(cgbr->cone) <0) return -1; cgbr->cone->bmap = isl_basic_map_extend_space(cgbr->cone->bmap, isl_basic_map_get_space(cgbr->cone->bmap), 1, 0, 2); k = isl_basic_map_alloc_div(cgbr->cone->bmap); if (k < 0) return -1; isl_seq_cpy(cgbr->cone->bmap->div[k], div->el, div->size); if (isl_tab_push(cgbr->cone, isl_tab_undo_bmap_div) < 0) return -1; } return context_tab_add_div(cgbr->tab, div, context_gbr_add_ineq_wrap, context); } static int context_gbr_best_split(struct isl_context *context, struct isl_tab *tab) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; struct isl_tab_undo *snap; int r; snap = isl_tab_snap(cgbr->tab); r = best_split(tab, cgbr->tab); if (r >= 0 && isl_tab_rollback(cgbr->tab, snap) < 0) return -1; return r; } static int context_gbr_is_empty(struct isl_context *context) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; if (!cgbr->tab) return -1; return cgbr->tab->empty; } struct isl_gbr_tab_undo { struct isl_tab_undo *tab_snap; struct isl_tab_undo *shifted_snap; struct isl_tab_undo *cone_snap; }; static void *context_gbr_save(struct isl_context *context) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; struct isl_gbr_tab_undo *snap; if (!cgbr->tab) return NULL; snap = isl_alloc_type(cgbr->tab->mat->ctx, struct isl_gbr_tab_undo); if (!snap) return NULL; snap->tab_snap = isl_tab_snap(cgbr->tab); if (isl_tab_save_samples(cgbr->tab) < 0) goto error; if (cgbr->shifted) snap->shifted_snap = isl_tab_snap(cgbr->shifted); else snap->shifted_snap = NULL; if (cgbr->cone) snap->cone_snap = isl_tab_snap(cgbr->cone); else snap->cone_snap = NULL; return snap; error: free(snap); return NULL; } static void context_gbr_restore(struct isl_context *context, void *save) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; struct isl_gbr_tab_undo *snap = (struct isl_gbr_tab_undo *)save; if (!snap) goto error; if (isl_tab_rollback(cgbr->tab, snap->tab_snap) < 0) { isl_tab_free(cgbr->tab); cgbr->tab = NULL; } if (snap->shifted_snap) { if (isl_tab_rollback(cgbr->shifted, snap->shifted_snap) < 0) goto error; } else if (cgbr->shifted) { isl_tab_free(cgbr->shifted); cgbr->shifted = NULL; } if (snap->cone_snap) { if (isl_tab_rollback(cgbr->cone, snap->cone_snap) < 0) goto error; } else if (cgbr->cone) { isl_tab_free(cgbr->cone); cgbr->cone = NULL; } free(snap); return; error: free(snap); isl_tab_free(cgbr->tab); cgbr->tab = NULL; } static void context_gbr_discard(void *save) { struct isl_gbr_tab_undo *snap = (struct isl_gbr_tab_undo *)save; free(snap); } static int context_gbr_is_ok(struct isl_context *context) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; return !!cgbr->tab; } static void context_gbr_invalidate(struct isl_context *context) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; isl_tab_free(cgbr->tab); cgbr->tab = NULL; } static void context_gbr_free(struct isl_context *context) { struct isl_context_gbr *cgbr = (struct isl_context_gbr *)context; isl_tab_free(cgbr->tab); isl_tab_free(cgbr->shifted); isl_tab_free(cgbr->cone); free(cgbr); } struct isl_context_op isl_context_gbr_op = { context_gbr_detect_nonnegative_parameters, context_gbr_peek_basic_set, context_gbr_peek_tab, context_gbr_add_eq, context_gbr_add_ineq, context_gbr_ineq_sign, context_gbr_test_ineq, context_gbr_get_div, context_gbr_add_div, context_gbr_detect_equalities, context_gbr_best_split, context_gbr_is_empty, context_gbr_is_ok, context_gbr_save, context_gbr_restore, context_gbr_discard, context_gbr_invalidate, context_gbr_free, }; static struct isl_context *isl_context_gbr_alloc(struct isl_basic_set *dom) { struct isl_context_gbr *cgbr; if (!dom) return NULL; cgbr = isl_calloc_type(dom->ctx, struct isl_context_gbr); if (!cgbr) return NULL; cgbr->context.op = &isl_context_gbr_op; cgbr->shifted = NULL; cgbr->cone = NULL; cgbr->tab = isl_tab_from_basic_set(dom, 1); cgbr->tab = isl_tab_init_samples(cgbr->tab); if (!cgbr->tab) goto error; check_gbr_integer_feasible(cgbr); return &cgbr->context; error: cgbr->context.op->free(&cgbr->context); return NULL; } static struct isl_context *isl_context_alloc(struct isl_basic_set *dom) { if (!dom) return NULL; if (dom->ctx->opt->context == ISL_CONTEXT_LEXMIN) return isl_context_lex_alloc(dom); else return isl_context_gbr_alloc(dom); } /* Construct an isl_sol_map structure for accumulating the solution. * If track_empty is set, then we also keep track of the parts * of the context where there is no solution. * If max is set, then we are solving a maximization, rather than * a minimization problem, which means that the variables in the * tableau have value "M - x" rather than "M + x". */ static struct isl_sol *sol_map_init(struct isl_basic_map *bmap, struct isl_basic_set *dom, int track_empty, int max) { struct isl_sol_map *sol_map = NULL; if (!bmap) goto error; sol_map = isl_calloc_type(bmap->ctx, struct isl_sol_map); if (!sol_map) goto error; sol_map->sol.rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); sol_map->sol.dec_level.callback.run = &sol_dec_level_wrap; sol_map->sol.dec_level.sol = &sol_map->sol; sol_map->sol.max = max; sol_map->sol.n_out = isl_basic_map_dim(bmap, isl_dim_out); sol_map->sol.add = &sol_map_add_wrap; sol_map->sol.add_empty = track_empty ? &sol_map_add_empty_wrap : NULL; sol_map->sol.free = &sol_map_free_wrap; sol_map->map = isl_map_alloc_space(isl_basic_map_get_space(bmap), 1, ISL_MAP_DISJOINT); if (!sol_map->map) goto error; sol_map->sol.context = isl_context_alloc(dom); if (!sol_map->sol.context) goto error; if (track_empty) { sol_map->empty = isl_set_alloc_space(isl_basic_set_get_space(dom), 1, ISL_SET_DISJOINT); if (!sol_map->empty) goto error; } isl_basic_set_free(dom); return &sol_map->sol; error: isl_basic_set_free(dom); sol_map_free(sol_map); return NULL; } /* Check whether all coefficients of (non-parameter) variables * are non-positive, meaning that no pivots can be performed on the row. */ static int is_critical(struct isl_tab *tab, int row) { int j; unsigned off = 2 + tab->M; for (j = tab->n_dead; j < tab->n_col; ++j) { if (tab->col_var[j] >= 0 && (tab->col_var[j] < tab->n_param || tab->col_var[j] >= tab->n_var - tab->n_div)) continue; if (isl_int_is_pos(tab->mat->row[row][off + j])) return 0; } return 1; } /* Check whether the inequality represented by vec is strict over the integers, * i.e., there are no integer values satisfying the constraint with * equality. This happens if the gcd of the coefficients is not a divisor * of the constant term. If so, scale the constraint down by the gcd * of the coefficients. */ static int is_strict(struct isl_vec *vec) { isl_int gcd; int strict = 0; isl_int_init(gcd); isl_seq_gcd(vec->el + 1, vec->size - 1, &gcd); if (!isl_int_is_one(gcd)) { strict = !isl_int_is_divisible_by(vec->el[0], gcd); isl_int_fdiv_q(vec->el[0], vec->el[0], gcd); isl_seq_scale_down(vec->el + 1, vec->el + 1, gcd, vec->size-1); } isl_int_clear(gcd); return strict; } /* Determine the sign of the given row of the main tableau. * The result is one of * isl_tab_row_pos: always non-negative; no pivot needed * isl_tab_row_neg: always non-positive; pivot * isl_tab_row_any: can be both positive and negative; split * * We first handle some simple cases * - the row sign may be known already * - the row may be obviously non-negative * - the parametric constant may be equal to that of another row * for which we know the sign. This sign will be either "pos" or * "any". If it had been "neg" then we would have pivoted before. * * If none of these cases hold, we check the value of the row for each * of the currently active samples. Based on the signs of these values * we make an initial determination of the sign of the row. * * all zero -> unk(nown) * all non-negative -> pos * all non-positive -> neg * both negative and positive -> all * * If we end up with "all", we are done. * Otherwise, we perform a check for positive and/or negative * values as follows. * * samples neg unk pos * <0 ? Y N Y N * pos any pos * >0 ? Y N Y N * any neg any neg * * There is no special sign for "zero", because we can usually treat zero * as either non-negative or non-positive, whatever works out best. * However, if the row is "critical", meaning that pivoting is impossible * then we don't want to limp zero with the non-positive case, because * then we we would lose the solution for those values of the parameters * where the value of the row is zero. Instead, we treat 0 as non-negative * ensuring a split if the row can attain both zero and negative values. * The same happens when the original constraint was one that could not * be satisfied with equality by any integer values of the parameters. * In this case, we normalize the constraint, but then a value of zero * for the normalized constraint is actually a positive value for the * original constraint, so again we need to treat zero as non-negative. * In both these cases, we have the following decision tree instead: * * all non-negative -> pos * all negative -> neg * both negative and non-negative -> all * * samples neg pos * <0 ? Y N * any pos * >=0 ? Y N * any neg */ static enum isl_tab_row_sign row_sign(struct isl_tab *tab, struct isl_sol *sol, int row) { struct isl_vec *ineq = NULL; enum isl_tab_row_sign res = isl_tab_row_unknown; int critical; int strict; int row2; if (tab->row_sign[row] != isl_tab_row_unknown) return tab->row_sign[row]; if (is_obviously_nonneg(tab, row)) return isl_tab_row_pos; for (row2 = tab->n_redundant; row2 < tab->n_row; ++row2) { if (tab->row_sign[row2] == isl_tab_row_unknown) continue; if (identical_parameter_line(tab, row, row2)) return tab->row_sign[row2]; } critical = is_critical(tab, row); ineq = get_row_parameter_ineq(tab, row); if (!ineq) goto error; strict = is_strict(ineq); res = sol->context->op->ineq_sign(sol->context, ineq->el, critical || strict); if (res == isl_tab_row_unknown || res == isl_tab_row_pos) { /* test for negative values */ int feasible; isl_seq_neg(ineq->el, ineq->el, ineq->size); isl_int_sub_ui(ineq->el[0], ineq->el[0], 1); feasible = sol->context->op->test_ineq(sol->context, ineq->el); if (feasible < 0) goto error; if (!feasible) res = isl_tab_row_pos; else res = (res == isl_tab_row_unknown) ? isl_tab_row_neg : isl_tab_row_any; if (res == isl_tab_row_neg) { isl_seq_neg(ineq->el, ineq->el, ineq->size); isl_int_sub_ui(ineq->el[0], ineq->el[0], 1); } } if (res == isl_tab_row_neg) { /* test for positive values */ int feasible; if (!critical && !strict) isl_int_sub_ui(ineq->el[0], ineq->el[0], 1); feasible = sol->context->op->test_ineq(sol->context, ineq->el); if (feasible < 0) goto error; if (feasible) res = isl_tab_row_any; } isl_vec_free(ineq); return res; error: isl_vec_free(ineq); return isl_tab_row_unknown; } static void find_solutions(struct isl_sol *sol, struct isl_tab *tab); /* Find solutions for values of the parameters that satisfy the given * inequality. * * We currently take a snapshot of the context tableau that is reset * when we return from this function, while we make a copy of the main * tableau, leaving the original main tableau untouched. * These are fairly arbitrary choices. Making a copy also of the context * tableau would obviate the need to undo any changes made to it later, * while taking a snapshot of the main tableau could reduce memory usage. * If we were to switch to taking a snapshot of the main tableau, * we would have to keep in mind that we need to save the row signs * and that we need to do this before saving the current basis * such that the basis has been restore before we restore the row signs. */ static void find_in_pos(struct isl_sol *sol, struct isl_tab *tab, isl_int *ineq) { void *saved; if (!sol->context) goto error; saved = sol->context->op->save(sol->context); tab = isl_tab_dup(tab); if (!tab) goto error; sol->context->op->add_ineq(sol->context, ineq, 0, 1); find_solutions(sol, tab); if (!sol->error) sol->context->op->restore(sol->context, saved); else sol->context->op->discard(saved); return; error: sol->error = 1; } /* Record the absence of solutions for those values of the parameters * that do not satisfy the given inequality with equality. */ static void no_sol_in_strict(struct isl_sol *sol, struct isl_tab *tab, struct isl_vec *ineq) { int empty; void *saved; if (!sol->context || sol->error) goto error; saved = sol->context->op->save(sol->context); isl_int_sub_ui(ineq->el[0], ineq->el[0], 1); sol->context->op->add_ineq(sol->context, ineq->el, 1, 0); if (!sol->context) goto error; empty = tab->empty; tab->empty = 1; sol_add(sol, tab); tab->empty = empty; isl_int_add_ui(ineq->el[0], ineq->el[0], 1); sol->context->op->restore(sol->context, saved); return; error: sol->error = 1; } /* Compute the lexicographic minimum of the set represented by the main * tableau "tab" within the context "sol->context_tab". * On entry the sample value of the main tableau is lexicographically * less than or equal to this lexicographic minimum. * Pivots are performed until a feasible point is found, which is then * necessarily equal to the minimum, or until the tableau is found to * be infeasible. Some pivots may need to be performed for only some * feasible values of the context tableau. If so, the context tableau * is split into a part where the pivot is needed and a part where it is not. * * Whenever we enter the main loop, the main tableau is such that no * "obvious" pivots need to be performed on it, where "obvious" means * that the given row can be seen to be negative without looking at * the context tableau. In particular, for non-parametric problems, * no pivots need to be performed on the main tableau. * The caller of find_solutions is responsible for making this property * hold prior to the first iteration of the loop, while restore_lexmin * is called before every other iteration. * * Inside the main loop, we first examine the signs of the rows of * the main tableau within the context of the context tableau. * If we find a row that is always non-positive for all values of * the parameters satisfying the context tableau and negative for at * least one value of the parameters, we perform the appropriate pivot * and start over. An exception is the case where no pivot can be * performed on the row. In this case, we require that the sign of * the row is negative for all values of the parameters (rather than just * non-positive). This special case is handled inside row_sign, which * will say that the row can have any sign if it determines that it can * attain both negative and zero values. * * If we can't find a row that always requires a pivot, but we can find * one or more rows that require a pivot for some values of the parameters * (i.e., the row can attain both positive and negative signs), then we split * the context tableau into two parts, one where we force the sign to be * non-negative and one where we force is to be negative. * The non-negative part is handled by a recursive call (through find_in_pos). * Upon returning from this call, we continue with the negative part and * perform the required pivot. * * If no such rows can be found, all rows are non-negative and we have * found a (rational) feasible point. If we only wanted a rational point * then we are done. * Otherwise, we check if all values of the sample point of the tableau * are integral for the variables. If so, we have found the minimal * integral point and we are done. * If the sample point is not integral, then we need to make a distinction * based on whether the constant term is non-integral or the coefficients * of the parameters. Furthermore, in order to decide how to handle * the non-integrality, we also need to know whether the coefficients * of the other columns in the tableau are integral. This leads * to the following table. The first two rows do not correspond * to a non-integral sample point and are only mentioned for completeness. * * constant parameters other * * int int int | * int int rat | -> no problem * * rat int int -> fail * * rat int rat -> cut * * int rat rat | * rat rat rat | -> parametric cut * * int rat int | * rat rat int | -> split context * * If the parametric constant is completely integral, then there is nothing * to be done. If the constant term is non-integral, but all the other * coefficient are integral, then there is nothing that can be done * and the tableau has no integral solution. * If, on the other hand, one or more of the other columns have rational * coefficients, but the parameter coefficients are all integral, then * we can perform a regular (non-parametric) cut. * Finally, if there is any parameter coefficient that is non-integral, * then we need to involve the context tableau. There are two cases here. * If at least one other column has a rational coefficient, then we * can perform a parametric cut in the main tableau by adding a new * integer division in the context tableau. * If all other columns have integral coefficients, then we need to * enforce that the rational combination of parameters (c + \sum a_i y_i)/m * is always integral. We do this by introducing an integer division * q = floor((c + \sum a_i y_i)/m) and stipulating that its argument should * always be integral in the context tableau, i.e., m q = c + \sum a_i y_i. * Since q is expressed in the tableau as * c + \sum a_i y_i - m q >= 0 * -c - \sum a_i y_i + m q + m - 1 >= 0 * it is sufficient to add the inequality * -c - \sum a_i y_i + m q >= 0 * In the part of the context where this inequality does not hold, the * main tableau is marked as being empty. */ static void find_solutions(struct isl_sol *sol, struct isl_tab *tab) { struct isl_context *context; int r; if (!tab || sol->error) goto error; context = sol->context; if (tab->empty) goto done; if (context->op->is_empty(context)) goto done; for (r = 0; r >= 0 && tab && !tab->empty; r = restore_lexmin(tab)) { int flags; int row; enum isl_tab_row_sign sgn; int split = -1; int n_split = 0; for (row = tab->n_redundant; row < tab->n_row; ++row) { if (!isl_tab_var_from_row(tab, row)->is_nonneg) continue; sgn = row_sign(tab, sol, row); if (!sgn) goto error; tab->row_sign[row] = sgn; if (sgn == isl_tab_row_any) n_split++; if (sgn == isl_tab_row_any && split == -1) split = row; if (sgn == isl_tab_row_neg) break; } if (row < tab->n_row) continue; if (split != -1) { struct isl_vec *ineq; if (n_split != 1) split = context->op->best_split(context, tab); if (split < 0) goto error; ineq = get_row_parameter_ineq(tab, split); if (!ineq) goto error; is_strict(ineq); for (row = tab->n_redundant; row < tab->n_row; ++row) { if (!isl_tab_var_from_row(tab, row)->is_nonneg) continue; if (tab->row_sign[row] == isl_tab_row_any) tab->row_sign[row] = isl_tab_row_unknown; } tab->row_sign[split] = isl_tab_row_pos; sol_inc_level(sol); find_in_pos(sol, tab, ineq->el); tab->row_sign[split] = isl_tab_row_neg; row = split; isl_seq_neg(ineq->el, ineq->el, ineq->size); isl_int_sub_ui(ineq->el[0], ineq->el[0], 1); if (!sol->error) context->op->add_ineq(context, ineq->el, 0, 1); isl_vec_free(ineq); if (sol->error) goto error; continue; } if (tab->rational) break; row = first_non_integer_row(tab, &flags); if (row < 0) break; if (ISL_FL_ISSET(flags, I_PAR)) { if (ISL_FL_ISSET(flags, I_VAR)) { if (isl_tab_mark_empty(tab) < 0) goto error; break; } row = add_cut(tab, row); } else if (ISL_FL_ISSET(flags, I_VAR)) { struct isl_vec *div; struct isl_vec *ineq; int d; div = get_row_split_div(tab, row); if (!div) goto error; d = context->op->get_div(context, tab, div); isl_vec_free(div); if (d < 0) goto error; ineq = ineq_for_div(context->op->peek_basic_set(context), d); if (!ineq) goto error; sol_inc_level(sol); no_sol_in_strict(sol, tab, ineq); isl_seq_neg(ineq->el, ineq->el, ineq->size); context->op->add_ineq(context, ineq->el, 1, 1); isl_vec_free(ineq); if (sol->error || !context->op->is_ok(context)) goto error; tab = set_row_cst_to_div(tab, row, d); if (context->op->is_empty(context)) break; } else row = add_parametric_cut(tab, row, context); if (row < 0) goto error; } if (r < 0) goto error; done: sol_add(sol, tab); isl_tab_free(tab); return; error: isl_tab_free(tab); sol->error = 1; } /* Does "sol" contain a pair of partial solutions that could potentially * be merged? * * We currently only check that "sol" is not in an error state * and that there are at least two partial solutions of which the final two * are defined at the same level. */ static int sol_has_mergeable_solutions(struct isl_sol *sol) { if (sol->error) return 0; if (!sol->partial) return 0; if (!sol->partial->next) return 0; return sol->partial->level == sol->partial->next->level; } /* Compute the lexicographic minimum of the set represented by the main * tableau "tab" within the context "sol->context_tab". * * As a preprocessing step, we first transfer all the purely parametric * equalities from the main tableau to the context tableau, i.e., * parameters that have been pivoted to a row. * These equalities are ignored by the main algorithm, because the * corresponding rows may not be marked as being non-negative. * In parts of the context where the added equality does not hold, * the main tableau is marked as being empty. * * Before we embark on the actual computation, we save a copy * of the context. When we return, we check if there are any * partial solutions that can potentially be merged. If so, * we perform a rollback to the initial state of the context. * The merging of partial solutions happens inside calls to * sol_dec_level that are pushed onto the undo stack of the context. * If there are no partial solutions that can potentially be merged * then the rollback is skipped as it would just be wasted effort. */ static void find_solutions_main(struct isl_sol *sol, struct isl_tab *tab) { int row; void *saved; if (!tab) goto error; sol->level = 0; for (row = tab->n_redundant; row < tab->n_row; ++row) { int p; struct isl_vec *eq; if (tab->row_var[row] < 0) continue; if (tab->row_var[row] >= tab->n_param && tab->row_var[row] < tab->n_var - tab->n_div) continue; if (tab->row_var[row] < tab->n_param) p = tab->row_var[row]; else p = tab->row_var[row] + tab->n_param - (tab->n_var - tab->n_div); eq = isl_vec_alloc(tab->mat->ctx, 1+tab->n_param+tab->n_div); if (!eq) goto error; get_row_parameter_line(tab, row, eq->el); isl_int_neg(eq->el[1 + p], tab->mat->row[row][0]); eq = isl_vec_normalize(eq); sol_inc_level(sol); no_sol_in_strict(sol, tab, eq); isl_seq_neg(eq->el, eq->el, eq->size); sol_inc_level(sol); no_sol_in_strict(sol, tab, eq); isl_seq_neg(eq->el, eq->el, eq->size); sol->context->op->add_eq(sol->context, eq->el, 1, 1); isl_vec_free(eq); if (isl_tab_mark_redundant(tab, row) < 0) goto error; if (sol->context->op->is_empty(sol->context)) break; row = tab->n_redundant - 1; } saved = sol->context->op->save(sol->context); find_solutions(sol, tab); if (sol_has_mergeable_solutions(sol)) sol->context->op->restore(sol->context, saved); else sol->context->op->discard(saved); sol->level = 0; sol_pop(sol); return; error: isl_tab_free(tab); sol->error = 1; } /* Check if integer division "div" of "dom" also occurs in "bmap". * If so, return its position within the divs. * If not, return -1. */ static int find_context_div(struct isl_basic_map *bmap, struct isl_basic_set *dom, unsigned div) { int i; unsigned b_dim = isl_space_dim(bmap->dim, isl_dim_all); unsigned d_dim = isl_space_dim(dom->dim, isl_dim_all); if (isl_int_is_zero(dom->div[div][0])) return -1; if (isl_seq_first_non_zero(dom->div[div] + 2 + d_dim, dom->n_div) != -1) return -1; for (i = 0; i < bmap->n_div; ++i) { if (isl_int_is_zero(bmap->div[i][0])) continue; if (isl_seq_first_non_zero(bmap->div[i] + 2 + d_dim, (b_dim - d_dim) + bmap->n_div) != -1) continue; if (isl_seq_eq(bmap->div[i], dom->div[div], 2 + d_dim)) return i; } return -1; } /* The correspondence between the variables in the main tableau, * the context tableau, and the input map and domain is as follows. * The first n_param and the last n_div variables of the main tableau * form the variables of the context tableau. * In the basic map, these n_param variables correspond to the * parameters and the input dimensions. In the domain, they correspond * to the parameters and the set dimensions. * The n_div variables correspond to the integer divisions in the domain. * To ensure that everything lines up, we may need to copy some of the * integer divisions of the domain to the map. These have to be placed * in the same order as those in the context and they have to be placed * after any other integer divisions that the map may have. * This function performs the required reordering. */ static struct isl_basic_map *align_context_divs(struct isl_basic_map *bmap, struct isl_basic_set *dom) { int i; int common = 0; int other; for (i = 0; i < dom->n_div; ++i) if (find_context_div(bmap, dom, i) != -1) common++; other = bmap->n_div - common; if (dom->n_div - common > 0) { bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim), dom->n_div - common, 0, 0); if (!bmap) return NULL; } for (i = 0; i < dom->n_div; ++i) { int pos = find_context_div(bmap, dom, i); if (pos < 0) { pos = isl_basic_map_alloc_div(bmap); if (pos < 0) goto error; isl_int_set_si(bmap->div[pos][0], 0); } if (pos != other + i) isl_basic_map_swap_div(bmap, pos, other + i); } return bmap; error: isl_basic_map_free(bmap); return NULL; } /* Base case of isl_tab_basic_map_partial_lexopt, after removing * some obvious symmetries. * * We make sure the divs in the domain are properly ordered, * because they will be added one by one in the given order * during the construction of the solution map. */ static struct isl_sol *basic_map_partial_lexopt_base( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, struct isl_sol *(*init)(__isl_keep isl_basic_map *bmap, __isl_take isl_basic_set *dom, int track_empty, int max)) { struct isl_tab *tab; struct isl_sol *sol = NULL; struct isl_context *context; if (dom->n_div) { dom = isl_basic_set_order_divs(dom); bmap = align_context_divs(bmap, dom); } sol = init(bmap, dom, !!empty, max); if (!sol) goto error; context = sol->context; if (isl_basic_set_plain_is_empty(context->op->peek_basic_set(context))) /* nothing */; else if (isl_basic_map_plain_is_empty(bmap)) { if (sol->add_empty) sol->add_empty(sol, isl_basic_set_copy(context->op->peek_basic_set(context))); } else { tab = tab_for_lexmin(bmap, context->op->peek_basic_set(context), 1, max); tab = context->op->detect_nonnegative_parameters(context, tab); find_solutions_main(sol, tab); } if (sol->error) goto error; isl_basic_map_free(bmap); return sol; error: sol_free(sol); isl_basic_map_free(bmap); return NULL; } /* Base case of isl_tab_basic_map_partial_lexopt, after removing * some obvious symmetries. * * We call basic_map_partial_lexopt_base and extract the results. */ static __isl_give isl_map *basic_map_partial_lexopt_base_map( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) { isl_map *result = NULL; struct isl_sol *sol; struct isl_sol_map *sol_map; sol = basic_map_partial_lexopt_base(bmap, dom, empty, max, &sol_map_init); if (!sol) return NULL; sol_map = (struct isl_sol_map *) sol; result = isl_map_copy(sol_map->map); if (empty) *empty = isl_set_copy(sol_map->empty); sol_free(&sol_map->sol); return result; } /* Structure used during detection of parallel constraints. * n_in: number of "input" variables: isl_dim_param + isl_dim_in * n_out: number of "output" variables: isl_dim_out + isl_dim_div * val: the coefficients of the output variables */ struct isl_constraint_equal_info { isl_basic_map *bmap; unsigned n_in; unsigned n_out; isl_int *val; }; /* Check whether the coefficients of the output variables * of the constraint in "entry" are equal to info->val. */ static int constraint_equal(const void *entry, const void *val) { isl_int **row = (isl_int **)entry; const struct isl_constraint_equal_info *info = val; return isl_seq_eq((*row) + 1 + info->n_in, info->val, info->n_out); } /* Check whether "bmap" has a pair of constraints that have * the same coefficients for the output variables. * Note that the coefficients of the existentially quantified * variables need to be zero since the existentially quantified * of the result are usually not the same as those of the input. * the isl_dim_out and isl_dim_div dimensions. * If so, return 1 and return the row indices of the two constraints * in *first and *second. */ static int parallel_constraints(__isl_keep isl_basic_map *bmap, int *first, int *second) { int i; isl_ctx *ctx = isl_basic_map_get_ctx(bmap); struct isl_hash_table *table = NULL; struct isl_hash_table_entry *entry; struct isl_constraint_equal_info info; unsigned n_out; unsigned n_div; ctx = isl_basic_map_get_ctx(bmap); table = isl_hash_table_alloc(ctx, bmap->n_ineq); if (!table) goto error; info.n_in = isl_basic_map_dim(bmap, isl_dim_param) + isl_basic_map_dim(bmap, isl_dim_in); info.bmap = bmap; n_out = isl_basic_map_dim(bmap, isl_dim_out); n_div = isl_basic_map_dim(bmap, isl_dim_div); info.n_out = n_out + n_div; for (i = 0; i < bmap->n_ineq; ++i) { uint32_t hash; info.val = bmap->ineq[i] + 1 + info.n_in; if (isl_seq_first_non_zero(info.val, n_out) < 0) continue; if (isl_seq_first_non_zero(info.val + n_out, n_div) >= 0) continue; hash = isl_seq_get_hash(info.val, info.n_out); entry = isl_hash_table_find(ctx, table, hash, constraint_equal, &info, 1); if (!entry) goto error; if (entry->data) break; entry->data = &bmap->ineq[i]; } if (i < bmap->n_ineq) { *first = ((isl_int **)entry->data) - bmap->ineq; *second = i; } isl_hash_table_free(ctx, table); return i < bmap->n_ineq; error: isl_hash_table_free(ctx, table); return -1; } /* Given a set of upper bounds in "var", add constraints to "bset" * that make the i-th bound smallest. * * In particular, if there are n bounds b_i, then add the constraints * * b_i <= b_j for j > i * b_i < b_j for j < i */ static __isl_give isl_basic_set *select_minimum(__isl_take isl_basic_set *bset, __isl_keep isl_mat *var, int i) { isl_ctx *ctx; int j, k; ctx = isl_mat_get_ctx(var); for (j = 0; j < var->n_row; ++j) { if (j == i) continue; k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_combine(bset->ineq[k], ctx->one, var->row[j], ctx->negone, var->row[i], var->n_col); isl_int_set_si(bset->ineq[k][var->n_col], 0); if (j < i) isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1); } bset = isl_basic_set_finalize(bset); return bset; error: isl_basic_set_free(bset); return NULL; } /* Given a set of upper bounds on the last "input" variable m, * construct a set that assigns the minimal upper bound to m, i.e., * construct a set that divides the space into cells where one * of the upper bounds is smaller than all the others and assign * this upper bound to m. * * In particular, if there are n bounds b_i, then the result * consists of n basic sets, each one of the form * * m = b_i * b_i <= b_j for j > i * b_i < b_j for j < i */ static __isl_give isl_set *set_minimum(__isl_take isl_space *dim, __isl_take isl_mat *var) { int i, k; isl_basic_set *bset = NULL; isl_ctx *ctx; isl_set *set = NULL; if (!dim || !var) goto error; ctx = isl_space_get_ctx(dim); set = isl_set_alloc_space(isl_space_copy(dim), var->n_row, ISL_SET_DISJOINT); for (i = 0; i < var->n_row; ++i) { bset = isl_basic_set_alloc_space(isl_space_copy(dim), 0, 1, var->n_row - 1); k = isl_basic_set_alloc_equality(bset); if (k < 0) goto error; isl_seq_cpy(bset->eq[k], var->row[i], var->n_col); isl_int_set_si(bset->eq[k][var->n_col], -1); bset = select_minimum(bset, var, i); set = isl_set_add_basic_set(set, bset); } isl_space_free(dim); isl_mat_free(var); return set; error: isl_basic_set_free(bset); isl_set_free(set); isl_space_free(dim); isl_mat_free(var); return NULL; } /* Given that the last input variable of "bmap" represents the minimum * of the bounds in "cst", check whether we need to split the domain * based on which bound attains the minimum. * * A split is needed when the minimum appears in an integer division * or in an equality. Otherwise, it is only needed if it appears in * an upper bound that is different from the upper bounds on which it * is defined. */ static int need_split_basic_map(__isl_keep isl_basic_map *bmap, __isl_keep isl_mat *cst) { int i, j; unsigned total; unsigned pos; pos = cst->n_col - 1; total = isl_basic_map_dim(bmap, isl_dim_all); for (i = 0; i < bmap->n_div; ++i) if (!isl_int_is_zero(bmap->div[i][2 + pos])) return 1; for (i = 0; i < bmap->n_eq; ++i) if (!isl_int_is_zero(bmap->eq[i][1 + pos])) return 1; for (i = 0; i < bmap->n_ineq; ++i) { if (isl_int_is_nonneg(bmap->ineq[i][1 + pos])) continue; if (!isl_int_is_negone(bmap->ineq[i][1 + pos])) return 1; if (isl_seq_first_non_zero(bmap->ineq[i] + 1 + pos + 1, total - pos - 1) >= 0) return 1; for (j = 0; j < cst->n_row; ++j) if (isl_seq_eq(bmap->ineq[i], cst->row[j], cst->n_col)) break; if (j >= cst->n_row) return 1; } return 0; } /* Given that the last set variable of "bset" represents the minimum * of the bounds in "cst", check whether we need to split the domain * based on which bound attains the minimum. * * We simply call need_split_basic_map here. This is safe because * the position of the minimum is computed from "cst" and not * from "bmap". */ static int need_split_basic_set(__isl_keep isl_basic_set *bset, __isl_keep isl_mat *cst) { return need_split_basic_map((isl_basic_map *)bset, cst); } /* Given that the last set variable of "set" represents the minimum * of the bounds in "cst", check whether we need to split the domain * based on which bound attains the minimum. */ static int need_split_set(__isl_keep isl_set *set, __isl_keep isl_mat *cst) { int i; for (i = 0; i < set->n; ++i) if (need_split_basic_set(set->p[i], cst)) return 1; return 0; } /* Given a set of which the last set variable is the minimum * of the bounds in "cst", split each basic set in the set * in pieces where one of the bounds is (strictly) smaller than the others. * This subdivision is given in "min_expr". * The variable is subsequently projected out. * * We only do the split when it is needed. * For example if the last input variable m = min(a,b) and the only * constraints in the given basic set are lower bounds on m, * i.e., l <= m = min(a,b), then we can simply project out m * to obtain l <= a and l <= b, without having to split on whether * m is equal to a or b. */ static __isl_give isl_set *split(__isl_take isl_set *empty, __isl_take isl_set *min_expr, __isl_take isl_mat *cst) { int n_in; int i; isl_space *dim; isl_set *res; if (!empty || !min_expr || !cst) goto error; n_in = isl_set_dim(empty, isl_dim_set); dim = isl_set_get_space(empty); dim = isl_space_drop_dims(dim, isl_dim_set, n_in - 1, 1); res = isl_set_empty(dim); for (i = 0; i < empty->n; ++i) { isl_set *set; set = isl_set_from_basic_set(isl_basic_set_copy(empty->p[i])); if (need_split_basic_set(empty->p[i], cst)) set = isl_set_intersect(set, isl_set_copy(min_expr)); set = isl_set_remove_dims(set, isl_dim_set, n_in - 1, 1); res = isl_set_union_disjoint(res, set); } isl_set_free(empty); isl_set_free(min_expr); isl_mat_free(cst); return res; error: isl_set_free(empty); isl_set_free(min_expr); isl_mat_free(cst); return NULL; } /* Given a map of which the last input variable is the minimum * of the bounds in "cst", split each basic set in the set * in pieces where one of the bounds is (strictly) smaller than the others. * This subdivision is given in "min_expr". * The variable is subsequently projected out. * * The implementation is essentially the same as that of "split". */ static __isl_give isl_map *split_domain(__isl_take isl_map *opt, __isl_take isl_set *min_expr, __isl_take isl_mat *cst) { int n_in; int i; isl_space *dim; isl_map *res; if (!opt || !min_expr || !cst) goto error; n_in = isl_map_dim(opt, isl_dim_in); dim = isl_map_get_space(opt); dim = isl_space_drop_dims(dim, isl_dim_in, n_in - 1, 1); res = isl_map_empty(dim); for (i = 0; i < opt->n; ++i) { isl_map *map; map = isl_map_from_basic_map(isl_basic_map_copy(opt->p[i])); if (need_split_basic_map(opt->p[i], cst)) map = isl_map_intersect_domain(map, isl_set_copy(min_expr)); map = isl_map_remove_dims(map, isl_dim_in, n_in - 1, 1); res = isl_map_union_disjoint(res, map); } isl_map_free(opt); isl_set_free(min_expr); isl_mat_free(cst); return res; error: isl_map_free(opt); isl_set_free(min_expr); isl_mat_free(cst); return NULL; } static __isl_give isl_map *basic_map_partial_lexopt( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max); union isl_lex_res { void *p; isl_map *map; isl_pw_multi_aff *pma; }; /* This function is called from basic_map_partial_lexopt_symm. * The last variable of "bmap" and "dom" corresponds to the minimum * of the bounds in "cst". "map_space" is the space of the original * input relation (of basic_map_partial_lexopt_symm) and "set_space" * is the space of the original domain. * * We recursively call basic_map_partial_lexopt and then plug in * the definition of the minimum in the result. */ static __isl_give union isl_lex_res basic_map_partial_lexopt_symm_map_core( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space) { isl_map *opt; isl_set *min_expr; union isl_lex_res res; min_expr = set_minimum(isl_basic_set_get_space(dom), isl_mat_copy(cst)); opt = basic_map_partial_lexopt(bmap, dom, empty, max); if (empty) { *empty = split(*empty, isl_set_copy(min_expr), isl_mat_copy(cst)); *empty = isl_set_reset_space(*empty, set_space); } opt = split_domain(opt, min_expr, cst); opt = isl_map_reset_space(opt, map_space); res.map = opt; return res; } /* Given a basic map with at least two parallel constraints (as found * by the function parallel_constraints), first look for more constraints * parallel to the two constraint and replace the found list of parallel * constraints by a single constraint with as "input" part the minimum * of the input parts of the list of constraints. Then, recursively call * basic_map_partial_lexopt (possibly finding more parallel constraints) * and plug in the definition of the minimum in the result. * * More specifically, given a set of constraints * * a x + b_i(p) >= 0 * * Replace this set by a single constraint * * a x + u >= 0 * * with u a new parameter with constraints * * u <= b_i(p) * * Any solution to the new system is also a solution for the original system * since * * a x >= -u >= -b_i(p) * * Moreover, m = min_i(b_i(p)) satisfies the constraints on u and can * therefore be plugged into the solution. */ static union isl_lex_res basic_map_partial_lexopt_symm( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, int first, int second, __isl_give union isl_lex_res (*core)(__isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space)) { int i, n, k; int *list = NULL; unsigned n_in, n_out, n_div; isl_ctx *ctx; isl_vec *var = NULL; isl_mat *cst = NULL; isl_space *map_space, *set_space; union isl_lex_res res; map_space = isl_basic_map_get_space(bmap); set_space = empty ? isl_basic_set_get_space(dom) : NULL; n_in = isl_basic_map_dim(bmap, isl_dim_param) + isl_basic_map_dim(bmap, isl_dim_in); n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in; ctx = isl_basic_map_get_ctx(bmap); list = isl_alloc_array(ctx, int, bmap->n_ineq); var = isl_vec_alloc(ctx, n_out); if ((bmap->n_ineq && !list) || (n_out && !var)) goto error; list[0] = first; list[1] = second; isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out); for (i = second + 1, n = 2; i < bmap->n_ineq; ++i) { if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out)) list[n++] = i; } cst = isl_mat_alloc(ctx, n, 1 + n_in); if (!cst) goto error; for (i = 0; i < n; ++i) isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in); bmap = isl_basic_map_cow(bmap); if (!bmap) goto error; for (i = n - 1; i >= 0; --i) if (isl_basic_map_drop_inequality(bmap, list[i]) < 0) goto error; bmap = isl_basic_map_add(bmap, isl_dim_in, 1); bmap = isl_basic_map_extend_constraints(bmap, 0, 1); k = isl_basic_map_alloc_inequality(bmap); if (k < 0) goto error; isl_seq_clr(bmap->ineq[k], 1 + n_in); isl_int_set_si(bmap->ineq[k][1 + n_in], 1); isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out); bmap = isl_basic_map_finalize(bmap); n_div = isl_basic_set_dim(dom, isl_dim_div); dom = isl_basic_set_add_dims(dom, isl_dim_set, 1); dom = isl_basic_set_extend_constraints(dom, 0, n); for (i = 0; i < n; ++i) { k = isl_basic_set_alloc_inequality(dom); if (k < 0) goto error; isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in); isl_int_set_si(dom->ineq[k][1 + n_in], -1); isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div); } isl_vec_free(var); free(list); return core(bmap, dom, empty, max, cst, map_space, set_space); error: isl_space_free(map_space); isl_space_free(set_space); isl_mat_free(cst); isl_vec_free(var); free(list); isl_basic_set_free(dom); isl_basic_map_free(bmap); res.p = NULL; return res; } static __isl_give isl_map *basic_map_partial_lexopt_symm_map( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, int first, int second) { return basic_map_partial_lexopt_symm(bmap, dom, empty, max, first, second, &basic_map_partial_lexopt_symm_map_core).map; } /* Recursive part of isl_tab_basic_map_partial_lexopt, after detecting * equalities and removing redundant constraints. * * We first check if there are any parallel constraints (left). * If not, we are in the base case. * If there are parallel constraints, we replace them by a single * constraint in basic_map_partial_lexopt_symm and then call * this function recursively to look for more parallel constraints. */ static __isl_give isl_map *basic_map_partial_lexopt( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) { int par = 0; int first, second; if (!bmap) goto error; if (bmap->ctx->opt->pip_symmetry) par = parallel_constraints(bmap, &first, &second); if (par < 0) goto error; if (!par) return basic_map_partial_lexopt_base_map(bmap, dom, empty, max); return basic_map_partial_lexopt_symm_map(bmap, dom, empty, max, first, second); error: isl_basic_set_free(dom); isl_basic_map_free(bmap); return NULL; } /* Compute the lexicographic minimum (or maximum if "max" is set) * of "bmap" over the domain "dom" and return the result as a map. * If "empty" is not NULL, then *empty is assigned a set that * contains those parts of the domain where there is no solution. * If "bmap" is marked as rational (ISL_BASIC_MAP_RATIONAL), * then we compute the rational optimum. Otherwise, we compute * the integral optimum. * * We perform some preprocessing. As the PILP solver does not * handle implicit equalities very well, we first make sure all * the equalities are explicitly available. * * We also add context constraints to the basic map and remove * redundant constraints. This is only needed because of the * way we handle simple symmetries. In particular, we currently look * for symmetries on the constraints, before we set up the main tableau. * It is then no good to look for symmetries on possibly redundant constraints. */ struct isl_map *isl_tab_basic_map_partial_lexopt( struct isl_basic_map *bmap, struct isl_basic_set *dom, struct isl_set **empty, int max) { if (empty) *empty = NULL; if (!bmap || !dom) goto error; isl_assert(bmap->ctx, isl_basic_map_compatible_domain(bmap, dom), goto error); if (isl_basic_set_dim(dom, isl_dim_all) == 0) return basic_map_partial_lexopt(bmap, dom, empty, max); bmap = isl_basic_map_intersect_domain(bmap, isl_basic_set_copy(dom)); bmap = isl_basic_map_detect_equalities(bmap); bmap = isl_basic_map_remove_redundancies(bmap); return basic_map_partial_lexopt(bmap, dom, empty, max); error: isl_basic_set_free(dom); isl_basic_map_free(bmap); return NULL; } struct isl_sol_for { struct isl_sol sol; int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user); void *user; }; static void sol_for_free(struct isl_sol_for *sol_for) { if (sol_for->sol.context) sol_for->sol.context->op->free(sol_for->sol.context); free(sol_for); } static void sol_for_free_wrap(struct isl_sol *sol) { sol_for_free((struct isl_sol_for *)sol); } /* Add the solution identified by the tableau and the context tableau. * * See documentation of sol_add for more details. * * Instead of constructing a basic map, this function calls a user * defined function with the current context as a basic set and * a list of affine expressions representing the relation between * the input and output. The space over which the affine expressions * are defined is the same as that of the domain. The number of * affine expressions in the list is equal to the number of output variables. */ static void sol_for_add(struct isl_sol_for *sol, struct isl_basic_set *dom, struct isl_mat *M) { int i; isl_ctx *ctx; isl_local_space *ls; isl_aff *aff; isl_aff_list *list; if (sol->sol.error || !dom || !M) goto error; ctx = isl_basic_set_get_ctx(dom); ls = isl_basic_set_get_local_space(dom); list = isl_aff_list_alloc(ctx, M->n_row - 1); for (i = 1; i < M->n_row; ++i) { aff = isl_aff_alloc(isl_local_space_copy(ls)); if (aff) { isl_int_set(aff->v->el[0], M->row[0][0]); isl_seq_cpy(aff->v->el + 1, M->row[i], M->n_col); } aff = isl_aff_normalize(aff); list = isl_aff_list_add(list, aff); } isl_local_space_free(ls); dom = isl_basic_set_finalize(dom); if (sol->fn(isl_basic_set_copy(dom), list, sol->user) < 0) goto error; isl_basic_set_free(dom); isl_mat_free(M); return; error: isl_basic_set_free(dom); isl_mat_free(M); sol->sol.error = 1; } static void sol_for_add_wrap(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) { sol_for_add((struct isl_sol_for *)sol, dom, M); } static struct isl_sol_for *sol_for_init(struct isl_basic_map *bmap, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user) { struct isl_sol_for *sol_for = NULL; isl_space *dom_dim; struct isl_basic_set *dom = NULL; sol_for = isl_calloc_type(bmap->ctx, struct isl_sol_for); if (!sol_for) goto error; dom_dim = isl_space_domain(isl_space_copy(bmap->dim)); dom = isl_basic_set_universe(dom_dim); sol_for->sol.rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); sol_for->sol.dec_level.callback.run = &sol_dec_level_wrap; sol_for->sol.dec_level.sol = &sol_for->sol; sol_for->fn = fn; sol_for->user = user; sol_for->sol.max = max; sol_for->sol.n_out = isl_basic_map_dim(bmap, isl_dim_out); sol_for->sol.add = &sol_for_add_wrap; sol_for->sol.add_empty = NULL; sol_for->sol.free = &sol_for_free_wrap; sol_for->sol.context = isl_context_alloc(dom); if (!sol_for->sol.context) goto error; isl_basic_set_free(dom); return sol_for; error: isl_basic_set_free(dom); sol_for_free(sol_for); return NULL; } static void sol_for_find_solutions(struct isl_sol_for *sol_for, struct isl_tab *tab) { find_solutions_main(&sol_for->sol, tab); } int isl_basic_map_foreach_lexopt(__isl_keep isl_basic_map *bmap, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user) { struct isl_sol_for *sol_for = NULL; bmap = isl_basic_map_copy(bmap); bmap = isl_basic_map_detect_equalities(bmap); if (!bmap) return -1; sol_for = sol_for_init(bmap, max, fn, user); if (!sol_for) goto error; if (isl_basic_map_plain_is_empty(bmap)) /* nothing */; else { struct isl_tab *tab; struct isl_context *context = sol_for->sol.context; tab = tab_for_lexmin(bmap, context->op->peek_basic_set(context), 1, max); tab = context->op->detect_nonnegative_parameters(context, tab); sol_for_find_solutions(sol_for, tab); if (sol_for->sol.error) goto error; } sol_free(&sol_for->sol); isl_basic_map_free(bmap); return 0; error: sol_free(&sol_for->sol); isl_basic_map_free(bmap); return -1; } int isl_basic_set_foreach_lexopt(__isl_keep isl_basic_set *bset, int max, int (*fn)(__isl_take isl_basic_set *dom, __isl_take isl_aff_list *list, void *user), void *user) { return isl_basic_map_foreach_lexopt(bset, max, fn, user); } /* Check if the given sequence of len variables starting at pos * represents a trivial (i.e., zero) solution. * The variables are assumed to be non-negative and to come in pairs, * with each pair representing a variable of unrestricted sign. * The solution is trivial if each such pair in the sequence consists * of two identical values, meaning that the variable being represented * has value zero. */ static int region_is_trivial(struct isl_tab *tab, int pos, int len) { int i; if (len == 0) return 0; for (i = 0; i < len; i += 2) { int neg_row; int pos_row; neg_row = tab->var[pos + i].is_row ? tab->var[pos + i].index : -1; pos_row = tab->var[pos + i + 1].is_row ? tab->var[pos + i + 1].index : -1; if ((neg_row < 0 || isl_int_is_zero(tab->mat->row[neg_row][1])) && (pos_row < 0 || isl_int_is_zero(tab->mat->row[pos_row][1]))) continue; if (neg_row < 0 || pos_row < 0) return 0; if (isl_int_ne(tab->mat->row[neg_row][1], tab->mat->row[pos_row][1])) return 0; } return 1; } /* Return the index of the first trivial region or -1 if all regions * are non-trivial. */ static int first_trivial_region(struct isl_tab *tab, int n_region, struct isl_region *region) { int i; for (i = 0; i < n_region; ++i) { if (region_is_trivial(tab, region[i].pos, region[i].len)) return i; } return -1; } /* Check if the solution is optimal, i.e., whether the first * n_op entries are zero. */ static int is_optimal(__isl_keep isl_vec *sol, int n_op) { int i; for (i = 0; i < n_op; ++i) if (!isl_int_is_zero(sol->el[1 + i])) return 0; return 1; } /* Add constraints to "tab" that ensure that any solution is significantly * better that that represented by "sol". That is, find the first * relevant (within first n_op) non-zero coefficient and force it (along * with all previous coefficients) to be zero. * If the solution is already optimal (all relevant coefficients are zero), * then just mark the table as empty. */ static int force_better_solution(struct isl_tab *tab, __isl_keep isl_vec *sol, int n_op) { int i; isl_ctx *ctx; isl_vec *v = NULL; if (!sol) return -1; for (i = 0; i < n_op; ++i) if (!isl_int_is_zero(sol->el[1 + i])) break; if (i == n_op) { if (isl_tab_mark_empty(tab) < 0) return -1; return 0; } ctx = isl_vec_get_ctx(sol); v = isl_vec_alloc(ctx, 1 + tab->n_var); if (!v) return -1; for (; i >= 0; --i) { v = isl_vec_clr(v); isl_int_set_si(v->el[1 + i], -1); if (add_lexmin_eq(tab, v->el) < 0) goto error; } isl_vec_free(v); return 0; error: isl_vec_free(v); return -1; } struct isl_trivial { int update; int region; int side; struct isl_tab_undo *snap; }; /* Return the lexicographically smallest non-trivial solution of the * given ILP problem. * * All variables are assumed to be non-negative. * * n_op is the number of initial coordinates to optimize. * That is, once a solution has been found, we will only continue looking * for solution that result in significantly better values for those * initial coordinates. That is, we only continue looking for solutions * that increase the number of initial zeros in this sequence. * * A solution is non-trivial, if it is non-trivial on each of the * specified regions. Each region represents a sequence of pairs * of variables. A solution is non-trivial on such a region if * at least one of these pairs consists of different values, i.e., * such that the non-negative variable represented by the pair is non-zero. * * Whenever a conflict is encountered, all constraints involved are * reported to the caller through a call to "conflict". * * We perform a simple branch-and-bound backtracking search. * Each level in the search represents initially trivial region that is forced * to be non-trivial. * At each level we consider n cases, where n is the length of the region. * In terms of the n/2 variables of unrestricted signs being encoded by * the region, we consider the cases * x_0 >= 1 * x_0 <= -1 * x_0 = 0 and x_1 >= 1 * x_0 = 0 and x_1 <= -1 * x_0 = 0 and x_1 = 0 and x_2 >= 1 * x_0 = 0 and x_1 = 0 and x_2 <= -1 * ... * The cases are considered in this order, assuming that each pair * x_i_a x_i_b represents the value x_i_b - x_i_a. * That is, x_0 >= 1 is enforced by adding the constraint * x_0_b - x_0_a >= 1 */ __isl_give isl_vec *isl_tab_basic_set_non_trivial_lexmin( __isl_take isl_basic_set *bset, int n_op, int n_region, struct isl_region *region, int (*conflict)(int con, void *user), void *user) { int i, j; int r; isl_ctx *ctx; isl_vec *v = NULL; isl_vec *sol = NULL; struct isl_tab *tab; struct isl_trivial *triv = NULL; int level, init; if (!bset) return NULL; ctx = isl_basic_set_get_ctx(bset); sol = isl_vec_alloc(ctx, 0); tab = tab_for_lexmin(bset, NULL, 0, 0); if (!tab) goto error; tab->conflict = conflict; tab->conflict_user = user; v = isl_vec_alloc(ctx, 1 + tab->n_var); triv = isl_calloc_array(ctx, struct isl_trivial, n_region); if (!v || (n_region && !triv)) goto error; level = 0; init = 1; while (level >= 0) { int side, base; if (init) { tab = cut_to_integer_lexmin(tab, CUT_ONE); if (!tab) goto error; if (tab->empty) goto backtrack; r = first_trivial_region(tab, n_region, region); if (r < 0) { for (i = 0; i < level; ++i) triv[i].update = 1; isl_vec_free(sol); sol = isl_tab_get_sample_value(tab); if (!sol) goto error; if (is_optimal(sol, n_op)) break; goto backtrack; } if (level >= n_region) isl_die(ctx, isl_error_internal, "nesting level too deep", goto error); if (isl_tab_extend_cons(tab, 2 * region[r].len + 2 * n_op) < 0) goto error; triv[level].region = r; triv[level].side = 0; } r = triv[level].region; side = triv[level].side; base = 2 * (side/2); if (side >= region[r].len) { backtrack: level--; init = 0; if (level >= 0) if (isl_tab_rollback(tab, triv[level].snap) < 0) goto error; continue; } if (triv[level].update) { if (force_better_solution(tab, sol, n_op) < 0) goto error; triv[level].update = 0; } if (side == base && base >= 2) { for (j = base - 2; j < base; ++j) { v = isl_vec_clr(v); isl_int_set_si(v->el[1 + region[r].pos + j], 1); if (add_lexmin_eq(tab, v->el) < 0) goto error; } } triv[level].snap = isl_tab_snap(tab); if (isl_tab_push_basis(tab) < 0) goto error; v = isl_vec_clr(v); isl_int_set_si(v->el[0], -1); isl_int_set_si(v->el[1 + region[r].pos + side], -1); isl_int_set_si(v->el[1 + region[r].pos + (side ^ 1)], 1); tab = add_lexmin_ineq(tab, v->el); triv[level].side++; level++; init = 1; } free(triv); isl_vec_free(v); isl_tab_free(tab); isl_basic_set_free(bset); return sol; error: free(triv); isl_vec_free(v); isl_tab_free(tab); isl_basic_set_free(bset); isl_vec_free(sol); return NULL; } /* Return the lexicographically smallest rational point in "bset", * assuming that all variables are non-negative. * If "bset" is empty, then return a zero-length vector. */ __isl_give isl_vec *isl_tab_basic_set_non_neg_lexmin( __isl_take isl_basic_set *bset) { struct isl_tab *tab; isl_ctx *ctx = isl_basic_set_get_ctx(bset); isl_vec *sol; if (!bset) return NULL; tab = tab_for_lexmin(bset, NULL, 0, 0); if (!tab) goto error; if (tab->empty) sol = isl_vec_alloc(ctx, 0); else sol = isl_tab_get_sample_value(tab); isl_tab_free(tab); isl_basic_set_free(bset); return sol; error: isl_tab_free(tab); isl_basic_set_free(bset); return NULL; } struct isl_sol_pma { struct isl_sol sol; isl_pw_multi_aff *pma; isl_set *empty; }; static void sol_pma_free(struct isl_sol_pma *sol_pma) { if (!sol_pma) return; if (sol_pma->sol.context) sol_pma->sol.context->op->free(sol_pma->sol.context); isl_pw_multi_aff_free(sol_pma->pma); isl_set_free(sol_pma->empty); free(sol_pma); } /* This function is called for parts of the context where there is * no solution, with "bset" corresponding to the context tableau. * Simply add the basic set to the set "empty". */ static void sol_pma_add_empty(struct isl_sol_pma *sol, __isl_take isl_basic_set *bset) { if (!bset) goto error; isl_assert(bset->ctx, sol->empty, goto error); sol->empty = isl_set_grow(sol->empty, 1); bset = isl_basic_set_simplify(bset); bset = isl_basic_set_finalize(bset); sol->empty = isl_set_add_basic_set(sol->empty, bset); if (!sol->empty) sol->sol.error = 1; return; error: isl_basic_set_free(bset); sol->sol.error = 1; } /* Given a basic map "dom" that represents the context and an affine * matrix "M" that maps the dimensions of the context to the * output variables, construct an isl_pw_multi_aff with a single * cell corresponding to "dom" and affine expressions copied from "M". */ static void sol_pma_add(struct isl_sol_pma *sol, __isl_take isl_basic_set *dom, __isl_take isl_mat *M) { int i; isl_local_space *ls; isl_aff *aff; isl_multi_aff *maff; isl_pw_multi_aff *pma; maff = isl_multi_aff_alloc(isl_pw_multi_aff_get_space(sol->pma)); ls = isl_basic_set_get_local_space(dom); for (i = 1; i < M->n_row; ++i) { aff = isl_aff_alloc(isl_local_space_copy(ls)); if (aff) { isl_int_set(aff->v->el[0], M->row[0][0]); isl_seq_cpy(aff->v->el + 1, M->row[i], M->n_col); } aff = isl_aff_normalize(aff); maff = isl_multi_aff_set_aff(maff, i - 1, aff); } isl_local_space_free(ls); isl_mat_free(M); dom = isl_basic_set_simplify(dom); dom = isl_basic_set_finalize(dom); pma = isl_pw_multi_aff_alloc(isl_set_from_basic_set(dom), maff); sol->pma = isl_pw_multi_aff_add_disjoint(sol->pma, pma); if (!sol->pma) sol->sol.error = 1; } static void sol_pma_free_wrap(struct isl_sol *sol) { sol_pma_free((struct isl_sol_pma *)sol); } static void sol_pma_add_empty_wrap(struct isl_sol *sol, __isl_take isl_basic_set *bset) { sol_pma_add_empty((struct isl_sol_pma *)sol, bset); } static void sol_pma_add_wrap(struct isl_sol *sol, __isl_take isl_basic_set *dom, __isl_take isl_mat *M) { sol_pma_add((struct isl_sol_pma *)sol, dom, M); } /* Construct an isl_sol_pma structure for accumulating the solution. * If track_empty is set, then we also keep track of the parts * of the context where there is no solution. * If max is set, then we are solving a maximization, rather than * a minimization problem, which means that the variables in the * tableau have value "M - x" rather than "M + x". */ static struct isl_sol *sol_pma_init(__isl_keep isl_basic_map *bmap, __isl_take isl_basic_set *dom, int track_empty, int max) { struct isl_sol_pma *sol_pma = NULL; if (!bmap) goto error; sol_pma = isl_calloc_type(bmap->ctx, struct isl_sol_pma); if (!sol_pma) goto error; sol_pma->sol.rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); sol_pma->sol.dec_level.callback.run = &sol_dec_level_wrap; sol_pma->sol.dec_level.sol = &sol_pma->sol; sol_pma->sol.max = max; sol_pma->sol.n_out = isl_basic_map_dim(bmap, isl_dim_out); sol_pma->sol.add = &sol_pma_add_wrap; sol_pma->sol.add_empty = track_empty ? &sol_pma_add_empty_wrap : NULL; sol_pma->sol.free = &sol_pma_free_wrap; sol_pma->pma = isl_pw_multi_aff_empty(isl_basic_map_get_space(bmap)); if (!sol_pma->pma) goto error; sol_pma->sol.context = isl_context_alloc(dom); if (!sol_pma->sol.context) goto error; if (track_empty) { sol_pma->empty = isl_set_alloc_space(isl_basic_set_get_space(dom), 1, ISL_SET_DISJOINT); if (!sol_pma->empty) goto error; } isl_basic_set_free(dom); return &sol_pma->sol; error: isl_basic_set_free(dom); sol_pma_free(sol_pma); return NULL; } /* Base case of isl_tab_basic_map_partial_lexopt, after removing * some obvious symmetries. * * We call basic_map_partial_lexopt_base and extract the results. */ static __isl_give isl_pw_multi_aff *basic_map_partial_lexopt_base_pma( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) { isl_pw_multi_aff *result = NULL; struct isl_sol *sol; struct isl_sol_pma *sol_pma; sol = basic_map_partial_lexopt_base(bmap, dom, empty, max, &sol_pma_init); if (!sol) return NULL; sol_pma = (struct isl_sol_pma *) sol; result = isl_pw_multi_aff_copy(sol_pma->pma); if (empty) *empty = isl_set_copy(sol_pma->empty); sol_free(&sol_pma->sol); return result; } /* Given that the last input variable of "maff" represents the minimum * of some bounds, check whether we need to plug in the expression * of the minimum. * * In particular, check if the last input variable appears in any * of the expressions in "maff". */ static int need_substitution(__isl_keep isl_multi_aff *maff) { int i; unsigned pos; pos = isl_multi_aff_dim(maff, isl_dim_in) - 1; for (i = 0; i < maff->n; ++i) if (isl_aff_involves_dims(maff->p[i], isl_dim_in, pos, 1)) return 1; return 0; } /* Given a set of upper bounds on the last "input" variable m, * construct a piecewise affine expression that selects * the minimal upper bound to m, i.e., * divide the space into cells where one * of the upper bounds is smaller than all the others and select * this upper bound on that cell. * * In particular, if there are n bounds b_i, then the result * consists of n cell, each one of the form * * b_i <= b_j for j > i * b_i < b_j for j < i * * The affine expression on this cell is * * b_i */ static __isl_give isl_pw_aff *set_minimum_pa(__isl_take isl_space *space, __isl_take isl_mat *var) { int i; isl_aff *aff = NULL; isl_basic_set *bset = NULL; isl_ctx *ctx; isl_pw_aff *paff = NULL; isl_space *pw_space; isl_local_space *ls = NULL; if (!space || !var) goto error; ctx = isl_space_get_ctx(space); ls = isl_local_space_from_space(isl_space_copy(space)); pw_space = isl_space_copy(space); pw_space = isl_space_from_domain(pw_space); pw_space = isl_space_add_dims(pw_space, isl_dim_out, 1); paff = isl_pw_aff_alloc_size(pw_space, var->n_row); for (i = 0; i < var->n_row; ++i) { isl_pw_aff *paff_i; aff = isl_aff_alloc(isl_local_space_copy(ls)); bset = isl_basic_set_alloc_space(isl_space_copy(space), 0, 0, var->n_row - 1); if (!aff || !bset) goto error; isl_int_set_si(aff->v->el[0], 1); isl_seq_cpy(aff->v->el + 1, var->row[i], var->n_col); isl_int_set_si(aff->v->el[1 + var->n_col], 0); bset = select_minimum(bset, var, i); paff_i = isl_pw_aff_alloc(isl_set_from_basic_set(bset), aff); paff = isl_pw_aff_add_disjoint(paff, paff_i); } isl_local_space_free(ls); isl_space_free(space); isl_mat_free(var); return paff; error: isl_aff_free(aff); isl_basic_set_free(bset); isl_pw_aff_free(paff); isl_local_space_free(ls); isl_space_free(space); isl_mat_free(var); return NULL; } /* Given a piecewise multi-affine expression of which the last input variable * is the minimum of the bounds in "cst", plug in the value of the minimum. * This minimum expression is given in "min_expr_pa". * The set "min_expr" contains the same information, but in the form of a set. * The variable is subsequently projected out. * * The implementation is similar to those of "split" and "split_domain". * If the variable appears in a given expression, then minimum expression * is plugged in. Otherwise, if the variable appears in the constraints * and a split is required, then the domain is split. Otherwise, no split * is performed. */ static __isl_give isl_pw_multi_aff *split_domain_pma( __isl_take isl_pw_multi_aff *opt, __isl_take isl_pw_aff *min_expr_pa, __isl_take isl_set *min_expr, __isl_take isl_mat *cst) { int n_in; int i; isl_space *space; isl_pw_multi_aff *res; if (!opt || !min_expr || !cst) goto error; n_in = isl_pw_multi_aff_dim(opt, isl_dim_in); space = isl_pw_multi_aff_get_space(opt); space = isl_space_drop_dims(space, isl_dim_in, n_in - 1, 1); res = isl_pw_multi_aff_empty(space); for (i = 0; i < opt->n; ++i) { isl_pw_multi_aff *pma; pma = isl_pw_multi_aff_alloc(isl_set_copy(opt->p[i].set), isl_multi_aff_copy(opt->p[i].maff)); if (need_substitution(opt->p[i].maff)) pma = isl_pw_multi_aff_substitute(pma, isl_dim_in, n_in - 1, min_expr_pa); else if (need_split_set(opt->p[i].set, cst)) pma = isl_pw_multi_aff_intersect_domain(pma, isl_set_copy(min_expr)); pma = isl_pw_multi_aff_project_out(pma, isl_dim_in, n_in - 1, 1); res = isl_pw_multi_aff_add_disjoint(res, pma); } isl_pw_multi_aff_free(opt); isl_pw_aff_free(min_expr_pa); isl_set_free(min_expr); isl_mat_free(cst); return res; error: isl_pw_multi_aff_free(opt); isl_pw_aff_free(min_expr_pa); isl_set_free(min_expr); isl_mat_free(cst); return NULL; } static __isl_give isl_pw_multi_aff *basic_map_partial_lexopt_pma( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max); /* This function is called from basic_map_partial_lexopt_symm. * The last variable of "bmap" and "dom" corresponds to the minimum * of the bounds in "cst". "map_space" is the space of the original * input relation (of basic_map_partial_lexopt_symm) and "set_space" * is the space of the original domain. * * We recursively call basic_map_partial_lexopt and then plug in * the definition of the minimum in the result. */ static __isl_give union isl_lex_res basic_map_partial_lexopt_symm_pma_core( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, __isl_take isl_mat *cst, __isl_take isl_space *map_space, __isl_take isl_space *set_space) { isl_pw_multi_aff *opt; isl_pw_aff *min_expr_pa; isl_set *min_expr; union isl_lex_res res; min_expr = set_minimum(isl_basic_set_get_space(dom), isl_mat_copy(cst)); min_expr_pa = set_minimum_pa(isl_basic_set_get_space(dom), isl_mat_copy(cst)); opt = basic_map_partial_lexopt_pma(bmap, dom, empty, max); if (empty) { *empty = split(*empty, isl_set_copy(min_expr), isl_mat_copy(cst)); *empty = isl_set_reset_space(*empty, set_space); } opt = split_domain_pma(opt, min_expr_pa, min_expr, cst); opt = isl_pw_multi_aff_reset_space(opt, map_space); res.pma = opt; return res; } static __isl_give isl_pw_multi_aff *basic_map_partial_lexopt_symm_pma( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max, int first, int second) { return basic_map_partial_lexopt_symm(bmap, dom, empty, max, first, second, &basic_map_partial_lexopt_symm_pma_core).pma; } /* Recursive part of isl_basic_map_partial_lexopt_pw_multi_aff, after detecting * equalities and removing redundant constraints. * * We first check if there are any parallel constraints (left). * If not, we are in the base case. * If there are parallel constraints, we replace them by a single * constraint in basic_map_partial_lexopt_symm_pma and then call * this function recursively to look for more parallel constraints. */ static __isl_give isl_pw_multi_aff *basic_map_partial_lexopt_pma( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) { int par = 0; int first, second; if (!bmap) goto error; if (bmap->ctx->opt->pip_symmetry) par = parallel_constraints(bmap, &first, &second); if (par < 0) goto error; if (!par) return basic_map_partial_lexopt_base_pma(bmap, dom, empty, max); return basic_map_partial_lexopt_symm_pma(bmap, dom, empty, max, first, second); error: isl_basic_set_free(dom); isl_basic_map_free(bmap); return NULL; } /* Compute the lexicographic minimum (or maximum if "max" is set) * of "bmap" over the domain "dom" and return the result as a piecewise * multi-affine expression. * If "empty" is not NULL, then *empty is assigned a set that * contains those parts of the domain where there is no solution. * If "bmap" is marked as rational (ISL_BASIC_MAP_RATIONAL), * then we compute the rational optimum. Otherwise, we compute * the integral optimum. * * We perform some preprocessing. As the PILP solver does not * handle implicit equalities very well, we first make sure all * the equalities are explicitly available. * * We also add context constraints to the basic map and remove * redundant constraints. This is only needed because of the * way we handle simple symmetries. In particular, we currently look * for symmetries on the constraints, before we set up the main tableau. * It is then no good to look for symmetries on possibly redundant constraints. */ __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexopt_pw_multi_aff( __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom, __isl_give isl_set **empty, int max) { if (empty) *empty = NULL; if (!bmap || !dom) goto error; isl_assert(bmap->ctx, isl_basic_map_compatible_domain(bmap, dom), goto error); if (isl_basic_set_dim(dom, isl_dim_all) == 0) return basic_map_partial_lexopt_pma(bmap, dom, empty, max); bmap = isl_basic_map_intersect_domain(bmap, isl_basic_set_copy(dom)); bmap = isl_basic_map_detect_equalities(bmap); bmap = isl_basic_map_remove_redundancies(bmap); return basic_map_partial_lexopt_pma(bmap, dom, empty, max); error: isl_basic_set_free(dom); isl_basic_map_free(bmap); return NULL; } cloog-0.18.2/isl/cat.c0000664000175000017500000000254312254313240011332 00000000000000#include #include #include #include #include struct isl_arg_choice cat_format[] = { {"isl", ISL_FORMAT_ISL}, {"omega", ISL_FORMAT_OMEGA}, {"polylib", ISL_FORMAT_POLYLIB}, {"ext-polylib", ISL_FORMAT_EXT_POLYLIB}, {"latex", ISL_FORMAT_LATEX}, {0} }; struct cat_options { struct isl_options *isl; unsigned format; }; ISL_ARGS_START(struct cat_options, cat_options_args) ISL_ARG_CHILD(struct cat_options, isl, "isl", &isl_options_args, "isl options") ISL_ARG_CHOICE(struct cat_options, format, 0, "format", \ cat_format, ISL_FORMAT_ISL, "output format") ISL_ARGS_END ISL_ARG_DEF(cat_options, struct cat_options, cat_options_args) int main(int argc, char **argv) { struct isl_ctx *ctx; struct isl_stream *s; struct isl_obj obj; struct cat_options *options; isl_printer *p; options = cat_options_new_with_defaults(); assert(options); argc = cat_options_parse(options, argc, argv, ISL_ARG_ALL); ctx = isl_ctx_alloc_with_options(&cat_options_args, options); s = isl_stream_new_file(ctx, stdin); obj = isl_stream_read_obj(s); isl_stream_free(s); p = isl_printer_to_file(ctx, stdout); p = isl_printer_set_output_format(p, options->format); p = obj.type->print(p, obj.v); p = isl_printer_end_line(p); isl_printer_free(p); obj.type->free(obj.v); isl_ctx_free(ctx); return 0; } cloog-0.18.2/isl/isl_equalities.c0000664000175000017500000005105212254313240013576 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite, * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France */ #include #include #include "isl_map_private.h" #include "isl_equalities.h" #include /* Given a set of modulo constraints * * c + A y = 0 mod d * * this function computes a particular solution y_0 * * The input is given as a matrix B = [ c A ] and a vector d. * * The output is matrix containing the solution y_0 or * a zero-column matrix if the constraints admit no integer solution. * * The given set of constrains is equivalent to * * c + A y = -D x * * with D = diag d and x a fresh set of variables. * Reducing both c and A modulo d does not change the * value of y in the solution and may lead to smaller coefficients. * Let M = [ D A ] and [ H 0 ] = M U, the Hermite normal form of M. * Then * [ x ] * M [ y ] = - c * and so * [ x ] * [ H 0 ] U^{-1} [ y ] = - c * Let * [ A ] [ x ] * [ B ] = U^{-1} [ y ] * then * H A + 0 B = -c * * so B may be chosen arbitrarily, e.g., B = 0, and then * * [ x ] = [ -c ] * U^{-1} [ y ] = [ 0 ] * or * [ x ] [ -c ] * [ y ] = U [ 0 ] * specifically, * * y = U_{2,1} (-c) * * If any of the coordinates of this y are non-integer * then the constraints admit no integer solution and * a zero-column matrix is returned. */ static struct isl_mat *particular_solution(struct isl_mat *B, struct isl_vec *d) { int i, j; struct isl_mat *M = NULL; struct isl_mat *C = NULL; struct isl_mat *U = NULL; struct isl_mat *H = NULL; struct isl_mat *cst = NULL; struct isl_mat *T = NULL; M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1); C = isl_mat_alloc(B->ctx, 1 + B->n_row, 1); if (!M || !C) goto error; isl_int_set_si(C->row[0][0], 1); for (i = 0; i < B->n_row; ++i) { isl_seq_clr(M->row[i], B->n_row); isl_int_set(M->row[i][i], d->block.data[i]); isl_int_neg(C->row[1 + i][0], B->row[i][0]); isl_int_fdiv_r(C->row[1+i][0], C->row[1+i][0], M->row[i][i]); for (j = 0; j < B->n_col - 1; ++j) isl_int_fdiv_r(M->row[i][B->n_row + j], B->row[i][1 + j], M->row[i][i]); } M = isl_mat_left_hermite(M, 0, &U, NULL); if (!M || !U) goto error; H = isl_mat_sub_alloc(M, 0, B->n_row, 0, B->n_row); H = isl_mat_lin_to_aff(H); C = isl_mat_inverse_product(H, C); if (!C) goto error; for (i = 0; i < B->n_row; ++i) { if (!isl_int_is_divisible_by(C->row[1+i][0], C->row[0][0])) break; isl_int_divexact(C->row[1+i][0], C->row[1+i][0], C->row[0][0]); } if (i < B->n_row) cst = isl_mat_alloc(B->ctx, B->n_row, 0); else cst = isl_mat_sub_alloc(C, 1, B->n_row, 0, 1); T = isl_mat_sub_alloc(U, B->n_row, B->n_col - 1, 0, B->n_row); cst = isl_mat_product(T, cst); isl_mat_free(M); isl_mat_free(C); isl_mat_free(U); return cst; error: isl_mat_free(M); isl_mat_free(C); isl_mat_free(U); return NULL; } /* Compute and return the matrix * * U_1^{-1} diag(d_1, 1, ..., 1) * * with U_1 the unimodular completion of the first (and only) row of B. * The columns of this matrix generate the lattice that satisfies * the single (linear) modulo constraint. */ static struct isl_mat *parameter_compression_1( struct isl_mat *B, struct isl_vec *d) { struct isl_mat *U; U = isl_mat_alloc(B->ctx, B->n_col - 1, B->n_col - 1); if (!U) return NULL; isl_seq_cpy(U->row[0], B->row[0] + 1, B->n_col - 1); U = isl_mat_unimodular_complete(U, 1); U = isl_mat_right_inverse(U); if (!U) return NULL; isl_mat_col_mul(U, 0, d->block.data[0], 0); U = isl_mat_lin_to_aff(U); return U; } /* Compute a common lattice of solutions to the linear modulo * constraints specified by B and d. * See also the documentation of isl_mat_parameter_compression. * We put the matrix * * A = [ L_1^{-T} L_2^{-T} ... L_k^{-T} ] * * on a common denominator. This denominator D is the lcm of modulos d. * Since L_i = U_i^{-1} diag(d_i, 1, ... 1), we have * L_i^{-T} = U_i^T diag(d_i, 1, ... 1)^{-T} = U_i^T diag(1/d_i, 1, ..., 1). * Putting this on the common denominator, we have * D * L_i^{-T} = U_i^T diag(D/d_i, D, ..., D). */ static struct isl_mat *parameter_compression_multi( struct isl_mat *B, struct isl_vec *d) { int i, j, k; isl_int D; struct isl_mat *A = NULL, *U = NULL; struct isl_mat *T; unsigned size; isl_int_init(D); isl_vec_lcm(d, &D); size = B->n_col - 1; A = isl_mat_alloc(B->ctx, size, B->n_row * size); U = isl_mat_alloc(B->ctx, size, size); if (!U || !A) goto error; for (i = 0; i < B->n_row; ++i) { isl_seq_cpy(U->row[0], B->row[i] + 1, size); U = isl_mat_unimodular_complete(U, 1); if (!U) goto error; isl_int_divexact(D, D, d->block.data[i]); for (k = 0; k < U->n_col; ++k) isl_int_mul(A->row[k][i*size+0], D, U->row[0][k]); isl_int_mul(D, D, d->block.data[i]); for (j = 1; j < U->n_row; ++j) for (k = 0; k < U->n_col; ++k) isl_int_mul(A->row[k][i*size+j], D, U->row[j][k]); } A = isl_mat_left_hermite(A, 0, NULL, NULL); T = isl_mat_sub_alloc(A, 0, A->n_row, 0, A->n_row); T = isl_mat_lin_to_aff(T); if (!T) goto error; isl_int_set(T->row[0][0], D); T = isl_mat_right_inverse(T); if (!T) goto error; isl_assert(T->ctx, isl_int_is_one(T->row[0][0]), goto error); T = isl_mat_transpose(T); isl_mat_free(A); isl_mat_free(U); isl_int_clear(D); return T; error: isl_mat_free(A); isl_mat_free(U); isl_int_clear(D); return NULL; } /* Given a set of modulo constraints * * c + A y = 0 mod d * * this function returns an affine transformation T, * * y = T y' * * that bijectively maps the integer vectors y' to integer * vectors y that satisfy the modulo constraints. * * This function is inspired by Section 2.5.3 * of B. Meister, "Stating and Manipulating Periodicity in the Polytope * Model. Applications to Program Analysis and Optimization". * However, the implementation only follows the algorithm of that * section for computing a particular solution and not for computing * a general homogeneous solution. The latter is incomplete and * may remove some valid solutions. * Instead, we use an adaptation of the algorithm in Section 7 of * B. Meister, S. Verdoolaege, "Polynomial Approximations in the Polytope * Model: Bringing the Power of Quasi-Polynomials to the Masses". * * The input is given as a matrix B = [ c A ] and a vector d. * Each element of the vector d corresponds to a row in B. * The output is a lower triangular matrix. * If no integer vector y satisfies the given constraints then * a matrix with zero columns is returned. * * We first compute a particular solution y_0 to the given set of * modulo constraints in particular_solution. If no such solution * exists, then we return a zero-columned transformation matrix. * Otherwise, we compute the generic solution to * * A y = 0 mod d * * That is we want to compute G such that * * y = G y'' * * with y'' integer, describes the set of solutions. * * We first remove the common factors of each row. * In particular if gcd(A_i,d_i) != 1, then we divide the whole * row i (including d_i) by this common factor. If afterwards gcd(A_i) != 1, * then we divide this row of A by the common factor, unless gcd(A_i) = 0. * In the later case, we simply drop the row (in both A and d). * * If there are no rows left in A, then G is the identity matrix. Otherwise, * for each row i, we now determine the lattice of integer vectors * that satisfies this row. Let U_i be the unimodular extension of the * row A_i. This unimodular extension exists because gcd(A_i) = 1. * The first component of * * y' = U_i y * * needs to be a multiple of d_i. Let y' = diag(d_i, 1, ..., 1) y''. * Then, * * y = U_i^{-1} diag(d_i, 1, ..., 1) y'' * * for arbitrary integer vectors y''. That is, y belongs to the lattice * generated by the columns of L_i = U_i^{-1} diag(d_i, 1, ..., 1). * If there is only one row, then G = L_1. * * If there is more than one row left, we need to compute the intersection * of the lattices. That is, we need to compute an L such that * * L = L_i L_i' for all i * * with L_i' some integer matrices. Let A be constructed as follows * * A = [ L_1^{-T} L_2^{-T} ... L_k^{-T} ] * * and computed the Hermite Normal Form of A = [ H 0 ] U * Then, * * L_i^{-T} = H U_{1,i} * * or * * H^{-T} = L_i U_{1,i}^T * * In other words G = L = H^{-T}. * To ensure that G is lower triangular, we compute and use its Hermite * normal form. * * The affine transformation matrix returned is then * * [ 1 0 ] * [ y_0 G ] * * as any y = y_0 + G y' with y' integer is a solution to the original * modulo constraints. */ struct isl_mat *isl_mat_parameter_compression( struct isl_mat *B, struct isl_vec *d) { int i; struct isl_mat *cst = NULL; struct isl_mat *T = NULL; isl_int D; if (!B || !d) goto error; isl_assert(B->ctx, B->n_row == d->size, goto error); cst = particular_solution(B, d); if (!cst) goto error; if (cst->n_col == 0) { T = isl_mat_alloc(B->ctx, B->n_col, 0); isl_mat_free(cst); isl_mat_free(B); isl_vec_free(d); return T; } isl_int_init(D); /* Replace a*g*row = 0 mod g*m by row = 0 mod m */ for (i = 0; i < B->n_row; ++i) { isl_seq_gcd(B->row[i] + 1, B->n_col - 1, &D); if (isl_int_is_one(D)) continue; if (isl_int_is_zero(D)) { B = isl_mat_drop_rows(B, i, 1); d = isl_vec_cow(d); if (!B || !d) goto error2; isl_seq_cpy(d->block.data+i, d->block.data+i+1, d->size - (i+1)); d->size--; i--; continue; } B = isl_mat_cow(B); if (!B) goto error2; isl_seq_scale_down(B->row[i] + 1, B->row[i] + 1, D, B->n_col-1); isl_int_gcd(D, D, d->block.data[i]); d = isl_vec_cow(d); if (!d) goto error2; isl_int_divexact(d->block.data[i], d->block.data[i], D); } isl_int_clear(D); if (B->n_row == 0) T = isl_mat_identity(B->ctx, B->n_col); else if (B->n_row == 1) T = parameter_compression_1(B, d); else T = parameter_compression_multi(B, d); T = isl_mat_left_hermite(T, 0, NULL, NULL); if (!T) goto error; isl_mat_sub_copy(T->ctx, T->row + 1, cst->row, cst->n_row, 0, 0, 1); isl_mat_free(cst); isl_mat_free(B); isl_vec_free(d); return T; error2: isl_int_clear(D); error: isl_mat_free(cst); isl_mat_free(B); isl_vec_free(d); return NULL; } /* Given a set of equalities * * B(y) + A x = 0 (*) * * compute and return an affine transformation T, * * y = T y' * * that bijectively maps the integer vectors y' to integer * vectors y that satisfy the modulo constraints for some value of x. * * Let [H 0] be the Hermite Normal Form of A, i.e., * * A = [H 0] Q * * Then y is a solution of (*) iff * * H^-1 B(y) (= - [I 0] Q x) * * is an integer vector. Let d be the common denominator of H^-1. * We impose * * d H^-1 B(y) = 0 mod d * * and compute the solution using isl_mat_parameter_compression. */ __isl_give isl_mat *isl_mat_parameter_compression_ext(__isl_take isl_mat *B, __isl_take isl_mat *A) { isl_ctx *ctx; isl_vec *d; int n_row, n_col; if (!A) return isl_mat_free(B); ctx = isl_mat_get_ctx(A); n_row = A->n_row; n_col = A->n_col; A = isl_mat_left_hermite(A, 0, NULL, NULL); A = isl_mat_drop_cols(A, n_row, n_col - n_row); A = isl_mat_lin_to_aff(A); A = isl_mat_right_inverse(A); d = isl_vec_alloc(ctx, n_row); if (A) d = isl_vec_set(d, A->row[0][0]); A = isl_mat_drop_rows(A, 0, 1); A = isl_mat_drop_cols(A, 0, 1); B = isl_mat_product(A, B); return isl_mat_parameter_compression(B, d); } /* Given a set of equalities * * M x - c = 0 * * this function computes a unimodular transformation from a lower-dimensional * space to the original space that bijectively maps the integer points x' * in the lower-dimensional space to the integer points x in the original * space that satisfy the equalities. * * The input is given as a matrix B = [ -c M ] and the output is a * matrix that maps [1 x'] to [1 x]. * If T2 is not NULL, then *T2 is set to a matrix mapping [1 x] to [1 x']. * * First compute the (left) Hermite normal form of M, * * M [U1 U2] = M U = H = [H1 0] * or * M = H Q = [H1 0] [Q1] * [Q2] * * with U, Q unimodular, Q = U^{-1} (and H lower triangular). * Define the transformed variables as * * x = [U1 U2] [ x1' ] = [U1 U2] [Q1] x * [ x2' ] [Q2] * * The equalities then become * * H1 x1' - c = 0 or x1' = H1^{-1} c = c' * * If any of the c' is non-integer, then the original set has no * integer solutions (since the x' are a unimodular transformation * of the x) and a zero-column matrix is returned. * Otherwise, the transformation is given by * * x = U1 H1^{-1} c + U2 x2' * * The inverse transformation is simply * * x2' = Q2 x */ __isl_give isl_mat *isl_mat_variable_compression(__isl_take isl_mat *B, __isl_give isl_mat **T2) { int i; struct isl_mat *H = NULL, *C = NULL, *H1, *U = NULL, *U1, *U2, *TC; unsigned dim; if (T2) *T2 = NULL; if (!B) goto error; dim = B->n_col - 1; H = isl_mat_sub_alloc(B, 0, B->n_row, 1, dim); H = isl_mat_left_hermite(H, 0, &U, T2); if (!H || !U || (T2 && !*T2)) goto error; if (T2) { *T2 = isl_mat_drop_rows(*T2, 0, B->n_row); *T2 = isl_mat_lin_to_aff(*T2); if (!*T2) goto error; } C = isl_mat_alloc(B->ctx, 1+B->n_row, 1); if (!C) goto error; isl_int_set_si(C->row[0][0], 1); isl_mat_sub_neg(C->ctx, C->row+1, B->row, B->n_row, 0, 0, 1); H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row); H1 = isl_mat_lin_to_aff(H1); TC = isl_mat_inverse_product(H1, C); if (!TC) goto error; isl_mat_free(H); if (!isl_int_is_one(TC->row[0][0])) { for (i = 0; i < B->n_row; ++i) { if (!isl_int_is_divisible_by(TC->row[1+i][0], TC->row[0][0])) { struct isl_ctx *ctx = B->ctx; isl_mat_free(B); isl_mat_free(TC); isl_mat_free(U); if (T2) { isl_mat_free(*T2); *T2 = NULL; } return isl_mat_alloc(ctx, 1 + dim, 0); } isl_seq_scale_down(TC->row[1+i], TC->row[1+i], TC->row[0][0], 1); } isl_int_set_si(TC->row[0][0], 1); } U1 = isl_mat_sub_alloc(U, 0, U->n_row, 0, B->n_row); U1 = isl_mat_lin_to_aff(U1); U2 = isl_mat_sub_alloc(U, 0, U->n_row, B->n_row, U->n_row - B->n_row); U2 = isl_mat_lin_to_aff(U2); isl_mat_free(U); TC = isl_mat_product(U1, TC); TC = isl_mat_aff_direct_sum(TC, U2); isl_mat_free(B); return TC; error: isl_mat_free(B); isl_mat_free(H); isl_mat_free(U); if (T2) { isl_mat_free(*T2); *T2 = NULL; } return NULL; } /* Use the n equalities of bset to unimodularly transform the * variables x such that n transformed variables x1' have a constant value * and rewrite the constraints of bset in terms of the remaining * transformed variables x2'. The matrix pointed to by T maps * the new variables x2' back to the original variables x, while T2 * maps the original variables to the new variables. */ static struct isl_basic_set *compress_variables( struct isl_basic_set *bset, struct isl_mat **T, struct isl_mat **T2) { struct isl_mat *B, *TC; unsigned dim; if (T) *T = NULL; if (T2) *T2 = NULL; if (!bset) goto error; isl_assert(bset->ctx, isl_basic_set_n_param(bset) == 0, goto error); isl_assert(bset->ctx, bset->n_div == 0, goto error); dim = isl_basic_set_n_dim(bset); isl_assert(bset->ctx, bset->n_eq <= dim, goto error); if (bset->n_eq == 0) return bset; B = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 0, 1 + dim); TC = isl_mat_variable_compression(B, T2); if (!TC) goto error; if (TC->n_col == 0) { isl_mat_free(TC); if (T2) { isl_mat_free(*T2); *T2 = NULL; } return isl_basic_set_set_to_empty(bset); } bset = isl_basic_set_preimage(bset, T ? isl_mat_copy(TC) : TC); if (T) *T = TC; return bset; error: isl_basic_set_free(bset); return NULL; } struct isl_basic_set *isl_basic_set_remove_equalities( struct isl_basic_set *bset, struct isl_mat **T, struct isl_mat **T2) { if (T) *T = NULL; if (T2) *T2 = NULL; if (!bset) return NULL; isl_assert(bset->ctx, isl_basic_set_n_param(bset) == 0, goto error); bset = isl_basic_set_gauss(bset, NULL); if (ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY)) return bset; bset = compress_variables(bset, T, T2); return bset; error: isl_basic_set_free(bset); *T = NULL; return NULL; } /* Check if dimension dim belongs to a residue class * i_dim \equiv r mod m * with m != 1 and if so return m in *modulo and r in *residue. * As a special case, when i_dim has a fixed value v, then * *modulo is set to 0 and *residue to v. * * If i_dim does not belong to such a residue class, then *modulo * is set to 1 and *residue is set to 0. */ int isl_basic_set_dim_residue_class(struct isl_basic_set *bset, int pos, isl_int *modulo, isl_int *residue) { struct isl_ctx *ctx; struct isl_mat *H = NULL, *U = NULL, *C, *H1, *U1; unsigned total; unsigned nparam; if (!bset || !modulo || !residue) return -1; if (isl_basic_set_plain_dim_is_fixed(bset, pos, residue)) { isl_int_set_si(*modulo, 0); return 0; } ctx = bset->ctx; total = isl_basic_set_total_dim(bset); nparam = isl_basic_set_n_param(bset); H = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 1, total); H = isl_mat_left_hermite(H, 0, &U, NULL); if (!H) return -1; isl_seq_gcd(U->row[nparam + pos]+bset->n_eq, total-bset->n_eq, modulo); if (isl_int_is_zero(*modulo)) isl_int_set_si(*modulo, 1); if (isl_int_is_one(*modulo)) { isl_int_set_si(*residue, 0); isl_mat_free(H); isl_mat_free(U); return 0; } C = isl_mat_alloc(bset->ctx, 1+bset->n_eq, 1); if (!C) goto error; isl_int_set_si(C->row[0][0], 1); isl_mat_sub_neg(C->ctx, C->row+1, bset->eq, bset->n_eq, 0, 0, 1); H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row); H1 = isl_mat_lin_to_aff(H1); C = isl_mat_inverse_product(H1, C); isl_mat_free(H); U1 = isl_mat_sub_alloc(U, nparam+pos, 1, 0, bset->n_eq); U1 = isl_mat_lin_to_aff(U1); isl_mat_free(U); C = isl_mat_product(U1, C); if (!C) goto error; if (!isl_int_is_divisible_by(C->row[1][0], C->row[0][0])) { bset = isl_basic_set_copy(bset); bset = isl_basic_set_set_to_empty(bset); isl_basic_set_free(bset); isl_int_set_si(*modulo, 1); isl_int_set_si(*residue, 0); return 0; } isl_int_divexact(*residue, C->row[1][0], C->row[0][0]); isl_int_fdiv_r(*residue, *residue, *modulo); isl_mat_free(C); return 0; error: isl_mat_free(H); isl_mat_free(U); return -1; } /* Check if dimension dim belongs to a residue class * i_dim \equiv r mod m * with m != 1 and if so return m in *modulo and r in *residue. * As a special case, when i_dim has a fixed value v, then * *modulo is set to 0 and *residue to v. * * If i_dim does not belong to such a residue class, then *modulo * is set to 1 and *residue is set to 0. */ int isl_set_dim_residue_class(struct isl_set *set, int pos, isl_int *modulo, isl_int *residue) { isl_int m; isl_int r; int i; if (!set || !modulo || !residue) return -1; if (set->n == 0) { isl_int_set_si(*modulo, 0); isl_int_set_si(*residue, 0); return 0; } if (isl_basic_set_dim_residue_class(set->p[0], pos, modulo, residue)<0) return -1; if (set->n == 1) return 0; if (isl_int_is_one(*modulo)) return 0; isl_int_init(m); isl_int_init(r); for (i = 1; i < set->n; ++i) { if (isl_basic_set_dim_residue_class(set->p[i], pos, &m, &r) < 0) goto error; isl_int_gcd(*modulo, *modulo, m); isl_int_sub(m, *residue, r); isl_int_gcd(*modulo, *modulo, m); if (!isl_int_is_zero(*modulo)) isl_int_fdiv_r(*residue, *residue, *modulo); if (isl_int_is_one(*modulo)) break; } isl_int_clear(m); isl_int_clear(r); return 0; error: isl_int_clear(m); isl_int_clear(r); return -1; } /* Check if dimension "dim" belongs to a residue class * i_dim \equiv r mod m * with m != 1 and if so return m in *modulo and r in *residue. * As a special case, when i_dim has a fixed value v, then * *modulo is set to 0 and *residue to v. * * If i_dim does not belong to such a residue class, then *modulo * is set to 1 and *residue is set to 0. */ int isl_set_dim_residue_class_val(__isl_keep isl_set *set, int pos, __isl_give isl_val **modulo, __isl_give isl_val **residue) { *modulo = NULL; *residue = NULL; if (!set) return -1; *modulo = isl_val_alloc(isl_set_get_ctx(set)); *residue = isl_val_alloc(isl_set_get_ctx(set)); if (!*modulo || !*residue) goto error; if (isl_set_dim_residue_class(set, pos, &(*modulo)->n, &(*residue)->n) < 0) goto error; isl_int_set_si((*modulo)->d, 1); isl_int_set_si((*residue)->d, 1); return 0; error: isl_val_free(*modulo); isl_val_free(*residue); return -1; } cloog-0.18.2/isl/isl_hash.c0000664000175000017500000001040312254313240012347 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include uint32_t isl_hash_string(uint32_t hash, const char *s) { for (; *s; s++) isl_hash_byte(hash, *s); return hash; } uint32_t isl_hash_mem(uint32_t hash, const void *p, size_t len) { int i; const char *s = p; for (i = 0; i < len; ++i) isl_hash_byte(hash, s[i]); return hash; } static unsigned int round_up(unsigned int v) { int old_v = v; while (v) { old_v = v; v ^= v & -v; } return old_v << 1; } int isl_hash_table_init(struct isl_ctx *ctx, struct isl_hash_table *table, int min_size) { size_t size; if (!table) return -1; if (min_size < 2) min_size = 2; table->bits = ffs(round_up(4 * (min_size + 1) / 3 - 1)) - 1; table->n = 0; size = 1 << table->bits; table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, size); if (!table->entries) return -1; return 0; } static int grow_table(struct isl_ctx *ctx, struct isl_hash_table *table, int (*eq)(const void *entry, const void *val)) { int n; size_t old_size, size; struct isl_hash_table_entry *entries; uint32_t h; entries = table->entries; old_size = 1 << table->bits; size = 2 * old_size; table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, size); if (!table->entries) { table->entries = entries; return -1; } n = table->n; table->n = 0; table->bits++; for (h = 0; h < old_size; ++h) { struct isl_hash_table_entry *entry; if (!entries[h].data) continue; entry = isl_hash_table_find(ctx, table, entries[h].hash, eq, entries[h].data, 1); if (!entry) { table->bits--; free(table->entries); table->entries = entries; table->n = n; return -1; } *entry = entries[h]; } free(entries); return 0; } struct isl_hash_table *isl_hash_table_alloc(struct isl_ctx *ctx, int min_size) { struct isl_hash_table *table = NULL; table = isl_alloc_type(ctx, struct isl_hash_table); if (isl_hash_table_init(ctx, table, min_size)) goto error; return table; error: isl_hash_table_free(ctx, table); return NULL; } void isl_hash_table_clear(struct isl_hash_table *table) { if (!table) return; free(table->entries); } void isl_hash_table_free(struct isl_ctx *ctx, struct isl_hash_table *table) { if (!table) return; isl_hash_table_clear(table); free(table); } struct isl_hash_table_entry *isl_hash_table_find(struct isl_ctx *ctx, struct isl_hash_table *table, uint32_t key_hash, int (*eq)(const void *entry, const void *val), const void *val, int reserve) { size_t size; uint32_t h, key_bits; key_bits = isl_hash_bits(key_hash, table->bits); size = 1 << table->bits; for (h = key_bits; table->entries[h].data; h = (h+1) % size) if (table->entries[h].hash == key_hash && eq(table->entries[h].data, val)) return &table->entries[h]; if (!reserve) return NULL; if (4 * table->n >= 3 * size) { if (grow_table(ctx, table, eq) < 0) return NULL; return isl_hash_table_find(ctx, table, key_hash, eq, val, 1); } table->n++; table->entries[h].hash = key_hash; return &table->entries[h]; } int isl_hash_table_foreach(struct isl_ctx *ctx, struct isl_hash_table *table, int (*fn)(void **entry, void *user), void *user) { size_t size; uint32_t h; size = 1 << table->bits; for (h = 0; h < size; ++ h) if (table->entries[h].data && fn(&table->entries[h].data, user) < 0) return -1; return 0; } void isl_hash_table_remove(struct isl_ctx *ctx, struct isl_hash_table *table, struct isl_hash_table_entry *entry) { int h, h2; size_t size; if (!table || !entry) return; size = 1 << table->bits; h = entry - table->entries; isl_assert(ctx, h >= 0 && h < size, return); for (h2 = h+1; table->entries[h2 % size].data; h2++) { uint32_t bits = isl_hash_bits(table->entries[h2 % size].hash, table->bits); uint32_t offset = (size + bits - (h+1)) % size; if (offset <= h2 - (h+1)) continue; *entry = table->entries[h2 % size]; h = h2; entry = &table->entries[h % size]; } entry->hash = 0; entry->data = NULL; table->n--; } cloog-0.18.2/isl/isl_space_private.h0000664000175000017500000000333312254313240014262 00000000000000#ifndef ISL_SPACE_PRIVATE #define ISL_SPACE_PRIVATE #include #include #include struct isl_name; struct isl_space { int ref; struct isl_ctx *ctx; unsigned nparam; unsigned n_in; /* zero for sets */ unsigned n_out; /* dim for sets */ isl_id *tuple_id[2]; isl_space *nested[2]; unsigned n_id; isl_id **ids; }; __isl_give isl_space *isl_space_cow(__isl_take isl_space *dim); __isl_give isl_space *isl_space_underlying(__isl_take isl_space *dim, unsigned n_div); uint32_t isl_space_get_hash(__isl_keep isl_space *dim); int isl_space_is_domain_internal(__isl_keep isl_space *space1, __isl_keep isl_space *space2); int isl_space_is_range_internal(__isl_keep isl_space *space1, __isl_keep isl_space *space2); __isl_give isl_space *isl_space_as_set_space(__isl_take isl_space *dim); unsigned isl_space_offset(__isl_keep isl_space *dim, enum isl_dim_type type); int isl_space_may_be_set(__isl_keep isl_space *dim); int isl_space_is_named_or_nested(__isl_keep isl_space *dim, enum isl_dim_type type); int isl_space_has_named_params(__isl_keep isl_space *dim); __isl_give isl_space *isl_space_reset(__isl_take isl_space *dim, enum isl_dim_type type); __isl_give isl_space *isl_space_flatten(__isl_take isl_space *dim); __isl_give isl_space *isl_space_flatten_domain(__isl_take isl_space *dim); __isl_give isl_space *isl_space_flatten_range(__isl_take isl_space *dim); __isl_give isl_space *isl_space_replace(__isl_take isl_space *dst, enum isl_dim_type type, __isl_keep isl_space *src); __isl_give isl_space *isl_space_lift(__isl_take isl_space *dim, unsigned n_local); __isl_give isl_space *isl_space_extend_domain_with_range( __isl_take isl_space *domain, __isl_take isl_space *model); #endif cloog-0.18.2/isl/isl_piplib.h0000664000175000017500000000127712254313240012721 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_PIPLIB_H #define ISL_PIPLIB_H #include #include #include #ifndef ISL_PIPLIB #error "no piplib" #endif #include void isl_seq_cpy_to_pip(Entier *dst, isl_int *src, unsigned len); void isl_seq_cpy_from_pip(isl_int *dst, Entier *src, unsigned len); PipMatrix *isl_basic_map_to_pip(struct isl_basic_map *bmap, unsigned pip_param, unsigned extra_front, unsigned extra_back); #endif cloog-0.18.2/isl/isl_scan.h0000664000175000017500000000114212254313240012355 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #ifndef ISL_SCAN_H #define ISL_SCAN_H #include #include struct isl_scan_callback { int (*add)(struct isl_scan_callback *cb, __isl_take isl_vec *sample); }; int isl_basic_set_scan(struct isl_basic_set *bset, struct isl_scan_callback *callback); int isl_set_scan(__isl_take isl_set *set, struct isl_scan_callback *callback); #endif cloog-0.18.2/isl/isl_options_private.h0000664000175000017500000000304612254313240014663 00000000000000#ifndef ISL_OPTIONS_PRIVATE_H #define ISL_OPTIONS_PRIVATE_H #include struct isl_options { #define ISL_LP_TAB 0 #define ISL_LP_PIP 1 unsigned lp_solver; #define ISL_ILP_GBR 0 #define ISL_ILP_PIP 1 unsigned ilp_solver; #define ISL_PIP_TAB 0 #define ISL_PIP_PIP 1 unsigned pip; #define ISL_CONTEXT_GBR 0 #define ISL_CONTEXT_LEXMIN 1 unsigned context; #define ISL_GBR_NEVER 0 #define ISL_GBR_ONCE 1 #define ISL_GBR_ALWAYS 2 unsigned gbr; unsigned gbr_only_first; #define ISL_CLOSURE_ISL 0 #define ISL_CLOSURE_BOX 1 unsigned closure; int bound; unsigned on_error; #define ISL_BERNSTEIN_FACTORS 1 #define ISL_BERNSTEIN_INTERVALS 2 int bernstein_recurse; int bernstein_triangulate; int pip_symmetry; #define ISL_CONVEX_HULL_WRAP 0 #define ISL_CONVEX_HULL_FM 1 int convex; int coalesce_bounded_wrapping; int schedule_max_coefficient; int schedule_max_constant_term; int schedule_parametric; int schedule_outer_zero_distance; int schedule_maximize_band_depth; int schedule_split_scaled; int schedule_separate_components; unsigned schedule_algorithm; int schedule_fuse; int tile_scale_tile_loops; int tile_shift_point_loops; char *ast_iterator_type; int ast_build_atomic_upper_bound; int ast_build_prefer_pdiv; int ast_build_exploit_nested_bounds; int ast_build_group_coscheduled; int ast_build_separation_bounds; int ast_build_scale_strides; int ast_build_allow_else; int ast_build_allow_or; }; #endif cloog-0.18.2/isl/isl_reordering.c0000664000175000017500000001033312254313240013566 00000000000000/* * Copyright 2010 INRIA Saclay * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France, * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod, * 91893 Orsay, France */ #include #include #include __isl_give isl_reordering *isl_reordering_alloc(isl_ctx *ctx, int len) { isl_reordering *exp; exp = isl_alloc(ctx, struct isl_reordering, sizeof(struct isl_reordering) + (len - 1) * sizeof(int)); if (!exp) return NULL; exp->ref = 1; exp->len = len; exp->dim = NULL; return exp; } __isl_give isl_reordering *isl_reordering_copy(__isl_keep isl_reordering *exp) { if (!exp) return NULL; exp->ref++; return exp; } __isl_give isl_reordering *isl_reordering_dup(__isl_keep isl_reordering *r) { int i; isl_reordering *dup; if (!r) return NULL; dup = isl_reordering_alloc(r->dim->ctx, r->len); if (!dup) return NULL; dup->dim = isl_space_copy(r->dim); if (!dup->dim) return isl_reordering_free(dup); for (i = 0; i < dup->len; ++i) dup->pos[i] = r->pos[i]; return dup; } __isl_give isl_reordering *isl_reordering_cow(__isl_take isl_reordering *r) { if (!r) return NULL; if (r->ref == 1) return r; r->ref--; return isl_reordering_dup(r); } void *isl_reordering_free(__isl_take isl_reordering *exp) { if (!exp) return NULL; if (--exp->ref > 0) return NULL; isl_space_free(exp->dim); free(exp); return NULL; } /* Construct a reordering that maps the parameters of "alignee" * to the corresponding parameters in a new dimension specification * that has the parameters of "aligner" first, followed by * any remaining parameters of "alignee" that do not occur in "aligner". */ __isl_give isl_reordering *isl_parameter_alignment_reordering( __isl_keep isl_space *alignee, __isl_keep isl_space *aligner) { int i, j; isl_reordering *exp; if (!alignee || !aligner) return NULL; exp = isl_reordering_alloc(alignee->ctx, alignee->nparam); if (!exp) return NULL; exp->dim = isl_space_copy(aligner); for (i = 0; i < alignee->nparam; ++i) { isl_id *id_i; id_i = isl_space_get_dim_id(alignee, isl_dim_param, i); if (!id_i) isl_die(alignee->ctx, isl_error_invalid, "cannot align unnamed parameters", goto error); for (j = 0; j < aligner->nparam; ++j) { isl_id *id_j; id_j = isl_space_get_dim_id(aligner, isl_dim_param, j); isl_id_free(id_j); if (id_i == id_j) break; } if (j < aligner->nparam) { exp->pos[i] = j; isl_id_free(id_i); } else { int pos; pos = isl_space_dim(exp->dim, isl_dim_param); exp->dim = isl_space_add_dims(exp->dim, isl_dim_param, 1); exp->dim = isl_space_set_dim_id(exp->dim, isl_dim_param, pos, id_i); exp->pos[i] = pos; } } if (!exp->dim) return isl_reordering_free(exp); return exp; error: isl_reordering_free(exp); return NULL; } __isl_give isl_reordering *isl_reordering_extend(__isl_take isl_reordering *exp, unsigned extra) { int i; isl_reordering *res; int offset; if (!exp) return NULL; if (extra == 0) return exp; offset = isl_space_dim(exp->dim, isl_dim_all) - exp->len; res = isl_reordering_alloc(exp->dim->ctx, exp->len + extra); if (!res) goto error; res->dim = isl_space_copy(exp->dim); for (i = 0; i < exp->len; ++i) res->pos[i] = exp->pos[i]; for (i = exp->len; i < res->len; ++i) res->pos[i] = offset + i; isl_reordering_free(exp); return res; error: isl_reordering_free(exp); return NULL; } __isl_give isl_reordering *isl_reordering_extend_space( __isl_take isl_reordering *exp, __isl_take isl_space *dim) { isl_reordering *res; if (!exp || !dim) goto error; res = isl_reordering_extend(isl_reordering_copy(exp), isl_space_dim(dim, isl_dim_all) - exp->len); res = isl_reordering_cow(res); if (!res) goto error; isl_space_free(res->dim); res->dim = isl_space_replace(dim, isl_dim_param, exp->dim); isl_reordering_free(exp); if (!res->dim) return isl_reordering_free(res); return res; error: isl_reordering_free(exp); isl_space_free(dim); return NULL; } void isl_reordering_dump(__isl_keep isl_reordering *exp) { int i; for (i = 0; i < exp->len; ++i) fprintf(stderr, "%d -> %d; ", i, exp->pos[i]); fprintf(stderr, "\n"); } cloog-0.18.2/isl/isl_convex_hull.c0000664000175000017500000020320112254313240013752 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include #include #include #include #include "isl_equalities.h" #include "isl_tab.h" static struct isl_basic_set *uset_convex_hull_wrap_bounded(struct isl_set *set); /* Return 1 if constraint c is redundant with respect to the constraints * in bmap. If c is a lower [upper] bound in some variable and bmap * does not have a lower [upper] bound in that variable, then c cannot * be redundant and we do not need solve any lp. */ int isl_basic_map_constraint_is_redundant(struct isl_basic_map **bmap, isl_int *c, isl_int *opt_n, isl_int *opt_d) { enum isl_lp_result res; unsigned total; int i, j; if (!bmap) return -1; total = isl_basic_map_total_dim(*bmap); for (i = 0; i < total; ++i) { int sign; if (isl_int_is_zero(c[1+i])) continue; sign = isl_int_sgn(c[1+i]); for (j = 0; j < (*bmap)->n_ineq; ++j) if (sign == isl_int_sgn((*bmap)->ineq[j][1+i])) break; if (j == (*bmap)->n_ineq) break; } if (i < total) return 0; res = isl_basic_map_solve_lp(*bmap, 0, c, (*bmap)->ctx->one, opt_n, opt_d, NULL); if (res == isl_lp_unbounded) return 0; if (res == isl_lp_error) return -1; if (res == isl_lp_empty) { *bmap = isl_basic_map_set_to_empty(*bmap); return 0; } return !isl_int_is_neg(*opt_n); } int isl_basic_set_constraint_is_redundant(struct isl_basic_set **bset, isl_int *c, isl_int *opt_n, isl_int *opt_d) { return isl_basic_map_constraint_is_redundant( (struct isl_basic_map **)bset, c, opt_n, opt_d); } /* Remove redundant * constraints. If the minimal value along the normal of a constraint * is the same if the constraint is removed, then the constraint is redundant. * * Alternatively, we could have intersected the basic map with the * corresponding equality and the checked if the dimension was that * of a facet. */ __isl_give isl_basic_map *isl_basic_map_remove_redundancies( __isl_take isl_basic_map *bmap) { struct isl_tab *tab; if (!bmap) return NULL; bmap = isl_basic_map_gauss(bmap, NULL); if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY)) return bmap; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NO_REDUNDANT)) return bmap; if (bmap->n_ineq <= 1) return bmap; tab = isl_tab_from_basic_map(bmap, 0); if (isl_tab_detect_implicit_equalities(tab) < 0) goto error; if (isl_tab_detect_redundant(tab) < 0) goto error; bmap = isl_basic_map_update_from_tab(bmap, tab); isl_tab_free(tab); ISL_F_SET(bmap, ISL_BASIC_MAP_NO_IMPLICIT); ISL_F_SET(bmap, ISL_BASIC_MAP_NO_REDUNDANT); return bmap; error: isl_tab_free(tab); isl_basic_map_free(bmap); return NULL; } __isl_give isl_basic_set *isl_basic_set_remove_redundancies( __isl_take isl_basic_set *bset) { return (struct isl_basic_set *) isl_basic_map_remove_redundancies((struct isl_basic_map *)bset); } /* Remove redundant constraints in each of the basic maps. */ __isl_give isl_map *isl_map_remove_redundancies(__isl_take isl_map *map) { return isl_map_inline_foreach_basic_map(map, &isl_basic_map_remove_redundancies); } __isl_give isl_set *isl_set_remove_redundancies(__isl_take isl_set *set) { return isl_map_remove_redundancies(set); } /* Check if the set set is bound in the direction of the affine * constraint c and if so, set the constant term such that the * resulting constraint is a bounding constraint for the set. */ static int uset_is_bound(struct isl_set *set, isl_int *c, unsigned len) { int first; int j; isl_int opt; isl_int opt_denom; isl_int_init(opt); isl_int_init(opt_denom); first = 1; for (j = 0; j < set->n; ++j) { enum isl_lp_result res; if (ISL_F_ISSET(set->p[j], ISL_BASIC_SET_EMPTY)) continue; res = isl_basic_set_solve_lp(set->p[j], 0, c, set->ctx->one, &opt, &opt_denom, NULL); if (res == isl_lp_unbounded) break; if (res == isl_lp_error) goto error; if (res == isl_lp_empty) { set->p[j] = isl_basic_set_set_to_empty(set->p[j]); if (!set->p[j]) goto error; continue; } if (first || isl_int_is_neg(opt)) { if (!isl_int_is_one(opt_denom)) isl_seq_scale(c, c, opt_denom, len); isl_int_sub(c[0], c[0], opt); } first = 0; } isl_int_clear(opt); isl_int_clear(opt_denom); return j >= set->n; error: isl_int_clear(opt); isl_int_clear(opt_denom); return -1; } __isl_give isl_basic_map *isl_basic_map_set_rational( __isl_take isl_basic_set *bmap) { if (!bmap) return NULL; if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) return bmap; bmap = isl_basic_map_cow(bmap); if (!bmap) return NULL; ISL_F_SET(bmap, ISL_BASIC_MAP_RATIONAL); return isl_basic_map_finalize(bmap); } __isl_give isl_basic_set *isl_basic_set_set_rational( __isl_take isl_basic_set *bset) { return isl_basic_map_set_rational(bset); } __isl_give isl_map *isl_map_set_rational(__isl_take isl_map *map) { int i; map = isl_map_cow(map); if (!map) return NULL; for (i = 0; i < map->n; ++i) { map->p[i] = isl_basic_map_set_rational(map->p[i]); if (!map->p[i]) goto error; } return map; error: isl_map_free(map); return NULL; } __isl_give isl_set *isl_set_set_rational(__isl_take isl_set *set) { return isl_map_set_rational(set); } static struct isl_basic_set *isl_basic_set_add_equality( struct isl_basic_set *bset, isl_int *c) { int i; unsigned dim; if (!bset) return NULL; if (ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY)) return bset; isl_assert(bset->ctx, isl_basic_set_n_param(bset) == 0, goto error); isl_assert(bset->ctx, bset->n_div == 0, goto error); dim = isl_basic_set_n_dim(bset); bset = isl_basic_set_cow(bset); bset = isl_basic_set_extend(bset, 0, dim, 0, 1, 0); i = isl_basic_set_alloc_equality(bset); if (i < 0) goto error; isl_seq_cpy(bset->eq[i], c, 1 + dim); return bset; error: isl_basic_set_free(bset); return NULL; } static struct isl_set *isl_set_add_basic_set_equality(struct isl_set *set, isl_int *c) { int i; set = isl_set_cow(set); if (!set) return NULL; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_add_equality(set->p[i], c); if (!set->p[i]) goto error; } return set; error: isl_set_free(set); return NULL; } /* Given a union of basic sets, construct the constraints for wrapping * a facet around one of its ridges. * In particular, if each of n the d-dimensional basic sets i in "set" * contains the origin, satisfies the constraints x_1 >= 0 and x_2 >= 0 * and is defined by the constraints * [ 1 ] * A_i [ x ] >= 0 * * then the resulting set is of dimension n*(1+d) and has as constraints * * [ a_i ] * A_i [ x_i ] >= 0 * * a_i >= 0 * * \sum_i x_{i,1} = 1 */ static struct isl_basic_set *wrap_constraints(struct isl_set *set) { struct isl_basic_set *lp; unsigned n_eq; unsigned n_ineq; int i, j, k; unsigned dim, lp_dim; if (!set) return NULL; dim = 1 + isl_set_n_dim(set); n_eq = 1; n_ineq = set->n; for (i = 0; i < set->n; ++i) { n_eq += set->p[i]->n_eq; n_ineq += set->p[i]->n_ineq; } lp = isl_basic_set_alloc(set->ctx, 0, dim * set->n, 0, n_eq, n_ineq); lp = isl_basic_set_set_rational(lp); if (!lp) return NULL; lp_dim = isl_basic_set_n_dim(lp); k = isl_basic_set_alloc_equality(lp); isl_int_set_si(lp->eq[k][0], -1); for (i = 0; i < set->n; ++i) { isl_int_set_si(lp->eq[k][1+dim*i], 0); isl_int_set_si(lp->eq[k][1+dim*i+1], 1); isl_seq_clr(lp->eq[k]+1+dim*i+2, dim-2); } for (i = 0; i < set->n; ++i) { k = isl_basic_set_alloc_inequality(lp); isl_seq_clr(lp->ineq[k], 1+lp_dim); isl_int_set_si(lp->ineq[k][1+dim*i], 1); for (j = 0; j < set->p[i]->n_eq; ++j) { k = isl_basic_set_alloc_equality(lp); isl_seq_clr(lp->eq[k], 1+dim*i); isl_seq_cpy(lp->eq[k]+1+dim*i, set->p[i]->eq[j], dim); isl_seq_clr(lp->eq[k]+1+dim*(i+1), dim*(set->n-i-1)); } for (j = 0; j < set->p[i]->n_ineq; ++j) { k = isl_basic_set_alloc_inequality(lp); isl_seq_clr(lp->ineq[k], 1+dim*i); isl_seq_cpy(lp->ineq[k]+1+dim*i, set->p[i]->ineq[j], dim); isl_seq_clr(lp->ineq[k]+1+dim*(i+1), dim*(set->n-i-1)); } } return lp; } /* Given a facet "facet" of the convex hull of "set" and a facet "ridge" * of that facet, compute the other facet of the convex hull that contains * the ridge. * * We first transform the set such that the facet constraint becomes * * x_1 >= 0 * * I.e., the facet lies in * * x_1 = 0 * * and on that facet, the constraint that defines the ridge is * * x_2 >= 0 * * (This transformation is not strictly needed, all that is needed is * that the ridge contains the origin.) * * Since the ridge contains the origin, the cone of the convex hull * will be of the form * * x_1 >= 0 * x_2 >= a x_1 * * with this second constraint defining the new facet. * The constant a is obtained by settting x_1 in the cone of the * convex hull to 1 and minimizing x_2. * Now, each element in the cone of the convex hull is the sum * of elements in the cones of the basic sets. * If a_i is the dilation factor of basic set i, then the problem * we need to solve is * * min \sum_i x_{i,2} * st * \sum_i x_{i,1} = 1 * a_i >= 0 * [ a_i ] * A [ x_i ] >= 0 * * with * [ 1 ] * A_i [ x_i ] >= 0 * * the constraints of each (transformed) basic set. * If a = n/d, then the constraint defining the new facet (in the transformed * space) is * * -n x_1 + d x_2 >= 0 * * In the original space, we need to take the same combination of the * corresponding constraints "facet" and "ridge". * * If a = -infty = "-1/0", then we just return the original facet constraint. * This means that the facet is unbounded, but has a bounded intersection * with the union of sets. */ isl_int *isl_set_wrap_facet(__isl_keep isl_set *set, isl_int *facet, isl_int *ridge) { int i; isl_ctx *ctx; struct isl_mat *T = NULL; struct isl_basic_set *lp = NULL; struct isl_vec *obj; enum isl_lp_result res; isl_int num, den; unsigned dim; if (!set) return NULL; ctx = set->ctx; set = isl_set_copy(set); set = isl_set_set_rational(set); dim = 1 + isl_set_n_dim(set); T = isl_mat_alloc(ctx, 3, dim); if (!T) goto error; isl_int_set_si(T->row[0][0], 1); isl_seq_clr(T->row[0]+1, dim - 1); isl_seq_cpy(T->row[1], facet, dim); isl_seq_cpy(T->row[2], ridge, dim); T = isl_mat_right_inverse(T); set = isl_set_preimage(set, T); T = NULL; if (!set) goto error; lp = wrap_constraints(set); obj = isl_vec_alloc(ctx, 1 + dim*set->n); if (!obj) goto error; isl_int_set_si(obj->block.data[0], 0); for (i = 0; i < set->n; ++i) { isl_seq_clr(obj->block.data + 1 + dim*i, 2); isl_int_set_si(obj->block.data[1 + dim*i+2], 1); isl_seq_clr(obj->block.data + 1 + dim*i+3, dim-3); } isl_int_init(num); isl_int_init(den); res = isl_basic_set_solve_lp(lp, 0, obj->block.data, ctx->one, &num, &den, NULL); if (res == isl_lp_ok) { isl_int_neg(num, num); isl_seq_combine(facet, num, facet, den, ridge, dim); isl_seq_normalize(ctx, facet, dim); } isl_int_clear(num); isl_int_clear(den); isl_vec_free(obj); isl_basic_set_free(lp); isl_set_free(set); if (res == isl_lp_error) return NULL; isl_assert(ctx, res == isl_lp_ok || res == isl_lp_unbounded, return NULL); return facet; error: isl_basic_set_free(lp); isl_mat_free(T); isl_set_free(set); return NULL; } /* Compute the constraint of a facet of "set". * * We first compute the intersection with a bounding constraint * that is orthogonal to one of the coordinate axes. * If the affine hull of this intersection has only one equality, * we have found a facet. * Otherwise, we wrap the current bounding constraint around * one of the equalities of the face (one that is not equal to * the current bounding constraint). * This process continues until we have found a facet. * The dimension of the intersection increases by at least * one on each iteration, so termination is guaranteed. */ static __isl_give isl_mat *initial_facet_constraint(__isl_keep isl_set *set) { struct isl_set *slice = NULL; struct isl_basic_set *face = NULL; int i; unsigned dim = isl_set_n_dim(set); int is_bound; isl_mat *bounds = NULL; isl_assert(set->ctx, set->n > 0, goto error); bounds = isl_mat_alloc(set->ctx, 1, 1 + dim); if (!bounds) return NULL; isl_seq_clr(bounds->row[0], dim); isl_int_set_si(bounds->row[0][1 + dim - 1], 1); is_bound = uset_is_bound(set, bounds->row[0], 1 + dim); if (is_bound < 0) goto error; isl_assert(set->ctx, is_bound, goto error); isl_seq_normalize(set->ctx, bounds->row[0], 1 + dim); bounds->n_row = 1; for (;;) { slice = isl_set_copy(set); slice = isl_set_add_basic_set_equality(slice, bounds->row[0]); face = isl_set_affine_hull(slice); if (!face) goto error; if (face->n_eq == 1) { isl_basic_set_free(face); break; } for (i = 0; i < face->n_eq; ++i) if (!isl_seq_eq(bounds->row[0], face->eq[i], 1 + dim) && !isl_seq_is_neg(bounds->row[0], face->eq[i], 1 + dim)) break; isl_assert(set->ctx, i < face->n_eq, goto error); if (!isl_set_wrap_facet(set, bounds->row[0], face->eq[i])) goto error; isl_seq_normalize(set->ctx, bounds->row[0], bounds->n_col); isl_basic_set_free(face); } return bounds; error: isl_basic_set_free(face); isl_mat_free(bounds); return NULL; } /* Given the bounding constraint "c" of a facet of the convex hull of "set", * compute a hyperplane description of the facet, i.e., compute the facets * of the facet. * * We compute an affine transformation that transforms the constraint * * [ 1 ] * c [ x ] = 0 * * to the constraint * * z_1 = 0 * * by computing the right inverse U of a matrix that starts with the rows * * [ 1 0 ] * [ c ] * * Then * [ 1 ] [ 1 ] * [ x ] = U [ z ] * and * [ 1 ] [ 1 ] * [ z ] = Q [ x ] * * with Q = U^{-1} * Since z_1 is zero, we can drop this variable as well as the corresponding * column of U to obtain * * [ 1 ] [ 1 ] * [ x ] = U' [ z' ] * and * [ 1 ] [ 1 ] * [ z' ] = Q' [ x ] * * with Q' equal to Q, but without the corresponding row. * After computing the facets of the facet in the z' space, * we convert them back to the x space through Q. */ static struct isl_basic_set *compute_facet(struct isl_set *set, isl_int *c) { struct isl_mat *m, *U, *Q; struct isl_basic_set *facet = NULL; struct isl_ctx *ctx; unsigned dim; ctx = set->ctx; set = isl_set_copy(set); dim = isl_set_n_dim(set); m = isl_mat_alloc(set->ctx, 2, 1 + dim); if (!m) goto error; isl_int_set_si(m->row[0][0], 1); isl_seq_clr(m->row[0]+1, dim); isl_seq_cpy(m->row[1], c, 1+dim); U = isl_mat_right_inverse(m); Q = isl_mat_right_inverse(isl_mat_copy(U)); U = isl_mat_drop_cols(U, 1, 1); Q = isl_mat_drop_rows(Q, 1, 1); set = isl_set_preimage(set, U); facet = uset_convex_hull_wrap_bounded(set); facet = isl_basic_set_preimage(facet, Q); if (facet) isl_assert(ctx, facet->n_eq == 0, goto error); return facet; error: isl_basic_set_free(facet); isl_set_free(set); return NULL; } /* Given an initial facet constraint, compute the remaining facets. * We do this by running through all facets found so far and computing * the adjacent facets through wrapping, adding those facets that we * hadn't already found before. * * For each facet we have found so far, we first compute its facets * in the resulting convex hull. That is, we compute the ridges * of the resulting convex hull contained in the facet. * We also compute the corresponding facet in the current approximation * of the convex hull. There is no need to wrap around the ridges * in this facet since that would result in a facet that is already * present in the current approximation. * * This function can still be significantly optimized by checking which of * the facets of the basic sets are also facets of the convex hull and * using all the facets so far to help in constructing the facets of the * facets * and/or * using the technique in section "3.1 Ridge Generation" of * "Extended Convex Hull" by Fukuda et al. */ static struct isl_basic_set *extend(struct isl_basic_set *hull, struct isl_set *set) { int i, j, f; int k; struct isl_basic_set *facet = NULL; struct isl_basic_set *hull_facet = NULL; unsigned dim; if (!hull) return NULL; isl_assert(set->ctx, set->n > 0, goto error); dim = isl_set_n_dim(set); for (i = 0; i < hull->n_ineq; ++i) { facet = compute_facet(set, hull->ineq[i]); facet = isl_basic_set_add_equality(facet, hull->ineq[i]); facet = isl_basic_set_gauss(facet, NULL); facet = isl_basic_set_normalize_constraints(facet); hull_facet = isl_basic_set_copy(hull); hull_facet = isl_basic_set_add_equality(hull_facet, hull->ineq[i]); hull_facet = isl_basic_set_gauss(hull_facet, NULL); hull_facet = isl_basic_set_normalize_constraints(hull_facet); if (!facet || !hull_facet) goto error; hull = isl_basic_set_cow(hull); hull = isl_basic_set_extend_space(hull, isl_space_copy(hull->dim), 0, 0, facet->n_ineq); if (!hull) goto error; for (j = 0; j < facet->n_ineq; ++j) { for (f = 0; f < hull_facet->n_ineq; ++f) if (isl_seq_eq(facet->ineq[j], hull_facet->ineq[f], 1 + dim)) break; if (f < hull_facet->n_ineq) continue; k = isl_basic_set_alloc_inequality(hull); if (k < 0) goto error; isl_seq_cpy(hull->ineq[k], hull->ineq[i], 1+dim); if (!isl_set_wrap_facet(set, hull->ineq[k], facet->ineq[j])) goto error; } isl_basic_set_free(hull_facet); isl_basic_set_free(facet); } hull = isl_basic_set_simplify(hull); hull = isl_basic_set_finalize(hull); return hull; error: isl_basic_set_free(hull_facet); isl_basic_set_free(facet); isl_basic_set_free(hull); return NULL; } /* Special case for computing the convex hull of a one dimensional set. * We simply collect the lower and upper bounds of each basic set * and the biggest of those. */ static struct isl_basic_set *convex_hull_1d(struct isl_set *set) { struct isl_mat *c = NULL; isl_int *lower = NULL; isl_int *upper = NULL; int i, j, k; isl_int a, b; struct isl_basic_set *hull; for (i = 0; i < set->n; ++i) { set->p[i] = isl_basic_set_simplify(set->p[i]); if (!set->p[i]) goto error; } set = isl_set_remove_empty_parts(set); if (!set) goto error; isl_assert(set->ctx, set->n > 0, goto error); c = isl_mat_alloc(set->ctx, 2, 2); if (!c) goto error; if (set->p[0]->n_eq > 0) { isl_assert(set->ctx, set->p[0]->n_eq == 1, goto error); lower = c->row[0]; upper = c->row[1]; if (isl_int_is_pos(set->p[0]->eq[0][1])) { isl_seq_cpy(lower, set->p[0]->eq[0], 2); isl_seq_neg(upper, set->p[0]->eq[0], 2); } else { isl_seq_neg(lower, set->p[0]->eq[0], 2); isl_seq_cpy(upper, set->p[0]->eq[0], 2); } } else { for (j = 0; j < set->p[0]->n_ineq; ++j) { if (isl_int_is_pos(set->p[0]->ineq[j][1])) { lower = c->row[0]; isl_seq_cpy(lower, set->p[0]->ineq[j], 2); } else { upper = c->row[1]; isl_seq_cpy(upper, set->p[0]->ineq[j], 2); } } } isl_int_init(a); isl_int_init(b); for (i = 0; i < set->n; ++i) { struct isl_basic_set *bset = set->p[i]; int has_lower = 0; int has_upper = 0; for (j = 0; j < bset->n_eq; ++j) { has_lower = 1; has_upper = 1; if (lower) { isl_int_mul(a, lower[0], bset->eq[j][1]); isl_int_mul(b, lower[1], bset->eq[j][0]); if (isl_int_lt(a, b) && isl_int_is_pos(bset->eq[j][1])) isl_seq_cpy(lower, bset->eq[j], 2); if (isl_int_gt(a, b) && isl_int_is_neg(bset->eq[j][1])) isl_seq_neg(lower, bset->eq[j], 2); } if (upper) { isl_int_mul(a, upper[0], bset->eq[j][1]); isl_int_mul(b, upper[1], bset->eq[j][0]); if (isl_int_lt(a, b) && isl_int_is_pos(bset->eq[j][1])) isl_seq_neg(upper, bset->eq[j], 2); if (isl_int_gt(a, b) && isl_int_is_neg(bset->eq[j][1])) isl_seq_cpy(upper, bset->eq[j], 2); } } for (j = 0; j < bset->n_ineq; ++j) { if (isl_int_is_pos(bset->ineq[j][1])) has_lower = 1; if (isl_int_is_neg(bset->ineq[j][1])) has_upper = 1; if (lower && isl_int_is_pos(bset->ineq[j][1])) { isl_int_mul(a, lower[0], bset->ineq[j][1]); isl_int_mul(b, lower[1], bset->ineq[j][0]); if (isl_int_lt(a, b)) isl_seq_cpy(lower, bset->ineq[j], 2); } if (upper && isl_int_is_neg(bset->ineq[j][1])) { isl_int_mul(a, upper[0], bset->ineq[j][1]); isl_int_mul(b, upper[1], bset->ineq[j][0]); if (isl_int_gt(a, b)) isl_seq_cpy(upper, bset->ineq[j], 2); } } if (!has_lower) lower = NULL; if (!has_upper) upper = NULL; } isl_int_clear(a); isl_int_clear(b); hull = isl_basic_set_alloc(set->ctx, 0, 1, 0, 0, 2); hull = isl_basic_set_set_rational(hull); if (!hull) goto error; if (lower) { k = isl_basic_set_alloc_inequality(hull); isl_seq_cpy(hull->ineq[k], lower, 2); } if (upper) { k = isl_basic_set_alloc_inequality(hull); isl_seq_cpy(hull->ineq[k], upper, 2); } hull = isl_basic_set_finalize(hull); isl_set_free(set); isl_mat_free(c); return hull; error: isl_set_free(set); isl_mat_free(c); return NULL; } static struct isl_basic_set *convex_hull_0d(struct isl_set *set) { struct isl_basic_set *convex_hull; if (!set) return NULL; if (isl_set_is_empty(set)) convex_hull = isl_basic_set_empty(isl_space_copy(set->dim)); else convex_hull = isl_basic_set_universe(isl_space_copy(set->dim)); isl_set_free(set); return convex_hull; } /* Compute the convex hull of a pair of basic sets without any parameters or * integer divisions using Fourier-Motzkin elimination. * The convex hull is the set of all points that can be written as * the sum of points from both basic sets (in homogeneous coordinates). * We set up the constraints in a space with dimensions for each of * the three sets and then project out the dimensions corresponding * to the two original basic sets, retaining only those corresponding * to the convex hull. */ static struct isl_basic_set *convex_hull_pair_elim(struct isl_basic_set *bset1, struct isl_basic_set *bset2) { int i, j, k; struct isl_basic_set *bset[2]; struct isl_basic_set *hull = NULL; unsigned dim; if (!bset1 || !bset2) goto error; dim = isl_basic_set_n_dim(bset1); hull = isl_basic_set_alloc(bset1->ctx, 0, 2 + 3 * dim, 0, 1 + dim + bset1->n_eq + bset2->n_eq, 2 + bset1->n_ineq + bset2->n_ineq); bset[0] = bset1; bset[1] = bset2; for (i = 0; i < 2; ++i) { for (j = 0; j < bset[i]->n_eq; ++j) { k = isl_basic_set_alloc_equality(hull); if (k < 0) goto error; isl_seq_clr(hull->eq[k], (i+1) * (1+dim)); isl_seq_clr(hull->eq[k]+(i+2)*(1+dim), (1-i)*(1+dim)); isl_seq_cpy(hull->eq[k]+(i+1)*(1+dim), bset[i]->eq[j], 1+dim); } for (j = 0; j < bset[i]->n_ineq; ++j) { k = isl_basic_set_alloc_inequality(hull); if (k < 0) goto error; isl_seq_clr(hull->ineq[k], (i+1) * (1+dim)); isl_seq_clr(hull->ineq[k]+(i+2)*(1+dim), (1-i)*(1+dim)); isl_seq_cpy(hull->ineq[k]+(i+1)*(1+dim), bset[i]->ineq[j], 1+dim); } k = isl_basic_set_alloc_inequality(hull); if (k < 0) goto error; isl_seq_clr(hull->ineq[k], 1+2+3*dim); isl_int_set_si(hull->ineq[k][(i+1)*(1+dim)], 1); } for (j = 0; j < 1+dim; ++j) { k = isl_basic_set_alloc_equality(hull); if (k < 0) goto error; isl_seq_clr(hull->eq[k], 1+2+3*dim); isl_int_set_si(hull->eq[k][j], -1); isl_int_set_si(hull->eq[k][1+dim+j], 1); isl_int_set_si(hull->eq[k][2*(1+dim)+j], 1); } hull = isl_basic_set_set_rational(hull); hull = isl_basic_set_remove_dims(hull, isl_dim_set, dim, 2*(1+dim)); hull = isl_basic_set_remove_redundancies(hull); isl_basic_set_free(bset1); isl_basic_set_free(bset2); return hull; error: isl_basic_set_free(bset1); isl_basic_set_free(bset2); isl_basic_set_free(hull); return NULL; } /* Is the set bounded for each value of the parameters? */ int isl_basic_set_is_bounded(__isl_keep isl_basic_set *bset) { struct isl_tab *tab; int bounded; if (!bset) return -1; if (isl_basic_set_plain_is_empty(bset)) return 1; tab = isl_tab_from_recession_cone(bset, 1); bounded = isl_tab_cone_is_bounded(tab); isl_tab_free(tab); return bounded; } /* Is the image bounded for each value of the parameters and * the domain variables? */ int isl_basic_map_image_is_bounded(__isl_keep isl_basic_map *bmap) { unsigned nparam = isl_basic_map_dim(bmap, isl_dim_param); unsigned n_in = isl_basic_map_dim(bmap, isl_dim_in); int bounded; bmap = isl_basic_map_copy(bmap); bmap = isl_basic_map_cow(bmap); bmap = isl_basic_map_move_dims(bmap, isl_dim_param, nparam, isl_dim_in, 0, n_in); bounded = isl_basic_set_is_bounded((isl_basic_set *)bmap); isl_basic_map_free(bmap); return bounded; } /* Is the set bounded for each value of the parameters? */ int isl_set_is_bounded(__isl_keep isl_set *set) { int i; if (!set) return -1; for (i = 0; i < set->n; ++i) { int bounded = isl_basic_set_is_bounded(set->p[i]); if (!bounded || bounded < 0) return bounded; } return 1; } /* Compute the lineality space of the convex hull of bset1 and bset2. * * We first compute the intersection of the recession cone of bset1 * with the negative of the recession cone of bset2 and then compute * the linear hull of the resulting cone. */ static struct isl_basic_set *induced_lineality_space( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { int i, k; struct isl_basic_set *lin = NULL; unsigned dim; if (!bset1 || !bset2) goto error; dim = isl_basic_set_total_dim(bset1); lin = isl_basic_set_alloc_space(isl_basic_set_get_space(bset1), 0, bset1->n_eq + bset2->n_eq, bset1->n_ineq + bset2->n_ineq); lin = isl_basic_set_set_rational(lin); if (!lin) goto error; for (i = 0; i < bset1->n_eq; ++i) { k = isl_basic_set_alloc_equality(lin); if (k < 0) goto error; isl_int_set_si(lin->eq[k][0], 0); isl_seq_cpy(lin->eq[k] + 1, bset1->eq[i] + 1, dim); } for (i = 0; i < bset1->n_ineq; ++i) { k = isl_basic_set_alloc_inequality(lin); if (k < 0) goto error; isl_int_set_si(lin->ineq[k][0], 0); isl_seq_cpy(lin->ineq[k] + 1, bset1->ineq[i] + 1, dim); } for (i = 0; i < bset2->n_eq; ++i) { k = isl_basic_set_alloc_equality(lin); if (k < 0) goto error; isl_int_set_si(lin->eq[k][0], 0); isl_seq_neg(lin->eq[k] + 1, bset2->eq[i] + 1, dim); } for (i = 0; i < bset2->n_ineq; ++i) { k = isl_basic_set_alloc_inequality(lin); if (k < 0) goto error; isl_int_set_si(lin->ineq[k][0], 0); isl_seq_neg(lin->ineq[k] + 1, bset2->ineq[i] + 1, dim); } isl_basic_set_free(bset1); isl_basic_set_free(bset2); return isl_basic_set_affine_hull(lin); error: isl_basic_set_free(lin); isl_basic_set_free(bset1); isl_basic_set_free(bset2); return NULL; } static struct isl_basic_set *uset_convex_hull(struct isl_set *set); /* Given a set and a linear space "lin" of dimension n > 0, * project the linear space from the set, compute the convex hull * and then map the set back to the original space. * * Let * * M x = 0 * * describe the linear space. We first compute the Hermite normal * form H = M U of M = H Q, to obtain * * H Q x = 0 * * The last n rows of H will be zero, so the last n variables of x' = Q x * are the one we want to project out. We do this by transforming each * basic set A x >= b to A U x' >= b and then removing the last n dimensions. * After computing the convex hull in x'_1, i.e., A' x'_1 >= b', * we transform the hull back to the original space as A' Q_1 x >= b', * with Q_1 all but the last n rows of Q. */ static struct isl_basic_set *modulo_lineality(struct isl_set *set, struct isl_basic_set *lin) { unsigned total = isl_basic_set_total_dim(lin); unsigned lin_dim; struct isl_basic_set *hull; struct isl_mat *M, *U, *Q; if (!set || !lin) goto error; lin_dim = total - lin->n_eq; M = isl_mat_sub_alloc6(set->ctx, lin->eq, 0, lin->n_eq, 1, total); M = isl_mat_left_hermite(M, 0, &U, &Q); if (!M) goto error; isl_mat_free(M); isl_basic_set_free(lin); Q = isl_mat_drop_rows(Q, Q->n_row - lin_dim, lin_dim); U = isl_mat_lin_to_aff(U); Q = isl_mat_lin_to_aff(Q); set = isl_set_preimage(set, U); set = isl_set_remove_dims(set, isl_dim_set, total - lin_dim, lin_dim); hull = uset_convex_hull(set); hull = isl_basic_set_preimage(hull, Q); return hull; error: isl_basic_set_free(lin); isl_set_free(set); return NULL; } /* Given two polyhedra with as constraints h_{ij} x >= 0 in homegeneous space, * set up an LP for solving * * \sum_j \alpha_{1j} h_{1j} = \sum_j \alpha_{2j} h_{2j} * * \alpha{i0} corresponds to the (implicit) positivity constraint 1 >= 0 * The next \alpha{ij} correspond to the equalities and come in pairs. * The final \alpha{ij} correspond to the inequalities. */ static struct isl_basic_set *valid_direction_lp( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { isl_space *dim; struct isl_basic_set *lp; unsigned d; int n; int i, j, k; if (!bset1 || !bset2) goto error; d = 1 + isl_basic_set_total_dim(bset1); n = 2 + 2 * bset1->n_eq + bset1->n_ineq + 2 * bset2->n_eq + bset2->n_ineq; dim = isl_space_set_alloc(bset1->ctx, 0, n); lp = isl_basic_set_alloc_space(dim, 0, d, n); if (!lp) goto error; for (i = 0; i < n; ++i) { k = isl_basic_set_alloc_inequality(lp); if (k < 0) goto error; isl_seq_clr(lp->ineq[k] + 1, n); isl_int_set_si(lp->ineq[k][0], -1); isl_int_set_si(lp->ineq[k][1 + i], 1); } for (i = 0; i < d; ++i) { k = isl_basic_set_alloc_equality(lp); if (k < 0) goto error; n = 0; isl_int_set_si(lp->eq[k][n], 0); n++; /* positivity constraint 1 >= 0 */ isl_int_set_si(lp->eq[k][n], i == 0); n++; for (j = 0; j < bset1->n_eq; ++j) { isl_int_set(lp->eq[k][n], bset1->eq[j][i]); n++; isl_int_neg(lp->eq[k][n], bset1->eq[j][i]); n++; } for (j = 0; j < bset1->n_ineq; ++j) { isl_int_set(lp->eq[k][n], bset1->ineq[j][i]); n++; } /* positivity constraint 1 >= 0 */ isl_int_set_si(lp->eq[k][n], -(i == 0)); n++; for (j = 0; j < bset2->n_eq; ++j) { isl_int_neg(lp->eq[k][n], bset2->eq[j][i]); n++; isl_int_set(lp->eq[k][n], bset2->eq[j][i]); n++; } for (j = 0; j < bset2->n_ineq; ++j) { isl_int_neg(lp->eq[k][n], bset2->ineq[j][i]); n++; } } lp = isl_basic_set_gauss(lp, NULL); isl_basic_set_free(bset1); isl_basic_set_free(bset2); return lp; error: isl_basic_set_free(bset1); isl_basic_set_free(bset2); return NULL; } /* Compute a vector s in the homogeneous space such that > 0 * for all rays in the homogeneous space of the two cones that correspond * to the input polyhedra bset1 and bset2. * * We compute s as a vector that satisfies * * s = \sum_j \alpha_{ij} h_{ij} for i = 1,2 (*) * * with h_{ij} the normals of the facets of polyhedron i * (including the "positivity constraint" 1 >= 0) and \alpha_{ij} * strictly positive numbers. For simplicity we impose \alpha_{ij} >= 1. * We first set up an LP with as variables the \alpha{ij}. * In this formulation, for each polyhedron i, * the first constraint is the positivity constraint, followed by pairs * of variables for the equalities, followed by variables for the inequalities. * We then simply pick a feasible solution and compute s using (*). * * Note that we simply pick any valid direction and make no attempt * to pick a "good" or even the "best" valid direction. */ static struct isl_vec *valid_direction( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { struct isl_basic_set *lp; struct isl_tab *tab; struct isl_vec *sample = NULL; struct isl_vec *dir; unsigned d; int i; int n; if (!bset1 || !bset2) goto error; lp = valid_direction_lp(isl_basic_set_copy(bset1), isl_basic_set_copy(bset2)); tab = isl_tab_from_basic_set(lp, 0); sample = isl_tab_get_sample_value(tab); isl_tab_free(tab); isl_basic_set_free(lp); if (!sample) goto error; d = isl_basic_set_total_dim(bset1); dir = isl_vec_alloc(bset1->ctx, 1 + d); if (!dir) goto error; isl_seq_clr(dir->block.data + 1, dir->size - 1); n = 1; /* positivity constraint 1 >= 0 */ isl_int_set(dir->block.data[0], sample->block.data[n]); n++; for (i = 0; i < bset1->n_eq; ++i) { isl_int_sub(sample->block.data[n], sample->block.data[n], sample->block.data[n+1]); isl_seq_combine(dir->block.data, bset1->ctx->one, dir->block.data, sample->block.data[n], bset1->eq[i], 1 + d); n += 2; } for (i = 0; i < bset1->n_ineq; ++i) isl_seq_combine(dir->block.data, bset1->ctx->one, dir->block.data, sample->block.data[n++], bset1->ineq[i], 1 + d); isl_vec_free(sample); isl_seq_normalize(bset1->ctx, dir->el, dir->size); isl_basic_set_free(bset1); isl_basic_set_free(bset2); return dir; error: isl_vec_free(sample); isl_basic_set_free(bset1); isl_basic_set_free(bset2); return NULL; } /* Given a polyhedron b_i + A_i x >= 0 and a map T = S^{-1}, * compute b_i' + A_i' x' >= 0, with * * [ b_i A_i ] [ y' ] [ y' ] * [ 1 0 ] S^{-1} [ x' ] >= 0 or [ b_i' A_i' ] [ x' ] >= 0 * * In particular, add the "positivity constraint" and then perform * the mapping. */ static struct isl_basic_set *homogeneous_map(struct isl_basic_set *bset, struct isl_mat *T) { int k; if (!bset) goto error; bset = isl_basic_set_extend_constraints(bset, 0, 1); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_clr(bset->ineq[k] + 1, isl_basic_set_total_dim(bset)); isl_int_set_si(bset->ineq[k][0], 1); bset = isl_basic_set_preimage(bset, T); return bset; error: isl_mat_free(T); isl_basic_set_free(bset); return NULL; } /* Compute the convex hull of a pair of basic sets without any parameters or * integer divisions, where the convex hull is known to be pointed, * but the basic sets may be unbounded. * * We turn this problem into the computation of a convex hull of a pair * _bounded_ polyhedra by "changing the direction of the homogeneous * dimension". This idea is due to Matthias Koeppe. * * Consider the cones in homogeneous space that correspond to the * input polyhedra. The rays of these cones are also rays of the * polyhedra if the coordinate that corresponds to the homogeneous * dimension is zero. That is, if the inner product of the rays * with the homogeneous direction is zero. * The cones in the homogeneous space can also be considered to * correspond to other pairs of polyhedra by chosing a different * homogeneous direction. To ensure that both of these polyhedra * are bounded, we need to make sure that all rays of the cones * correspond to vertices and not to rays. * Let s be a direction such that > 0 for all rays r of both cones. * Then using s as a homogeneous direction, we obtain a pair of polytopes. * The vector s is computed in valid_direction. * * Note that we need to consider _all_ rays of the cones and not just * the rays that correspond to rays in the polyhedra. If we were to * only consider those rays and turn them into vertices, then we * may inadvertently turn some vertices into rays. * * The standard homogeneous direction is the unit vector in the 0th coordinate. * We therefore transform the two polyhedra such that the selected * direction is mapped onto this standard direction and then proceed * with the normal computation. * Let S be a non-singular square matrix with s as its first row, * then we want to map the polyhedra to the space * * [ y' ] [ y ] [ y ] [ y' ] * [ x' ] = S [ x ] i.e., [ x ] = S^{-1} [ x' ] * * We take S to be the unimodular completion of s to limit the growth * of the coefficients in the following computations. * * Let b_i + A_i x >= 0 be the constraints of polyhedron i. * We first move to the homogeneous dimension * * b_i y + A_i x >= 0 [ b_i A_i ] [ y ] [ 0 ] * y >= 0 or [ 1 0 ] [ x ] >= [ 0 ] * * Then we change directoin * * [ b_i A_i ] [ y' ] [ y' ] * [ 1 0 ] S^{-1} [ x' ] >= 0 or [ b_i' A_i' ] [ x' ] >= 0 * * Then we compute the convex hull of the polytopes b_i' + A_i' x' >= 0 * resulting in b' + A' x' >= 0, which we then convert back * * [ y ] [ y ] * [ b' A' ] S [ x ] >= 0 or [ b A ] [ x ] >= 0 * * The polyhedron b + A x >= 0 is then the convex hull of the input polyhedra. */ static struct isl_basic_set *convex_hull_pair_pointed( struct isl_basic_set *bset1, struct isl_basic_set *bset2) { struct isl_ctx *ctx = NULL; struct isl_vec *dir = NULL; struct isl_mat *T = NULL; struct isl_mat *T2 = NULL; struct isl_basic_set *hull; struct isl_set *set; if (!bset1 || !bset2) goto error; ctx = bset1->ctx; dir = valid_direction(isl_basic_set_copy(bset1), isl_basic_set_copy(bset2)); if (!dir) goto error; T = isl_mat_alloc(bset1->ctx, dir->size, dir->size); if (!T) goto error; isl_seq_cpy(T->row[0], dir->block.data, dir->size); T = isl_mat_unimodular_complete(T, 1); T2 = isl_mat_right_inverse(isl_mat_copy(T)); bset1 = homogeneous_map(bset1, isl_mat_copy(T2)); bset2 = homogeneous_map(bset2, T2); set = isl_set_alloc_space(isl_basic_set_get_space(bset1), 2, 0); set = isl_set_add_basic_set(set, bset1); set = isl_set_add_basic_set(set, bset2); hull = uset_convex_hull(set); hull = isl_basic_set_preimage(hull, T); isl_vec_free(dir); return hull; error: isl_vec_free(dir); isl_basic_set_free(bset1); isl_basic_set_free(bset2); return NULL; } static struct isl_basic_set *uset_convex_hull_wrap(struct isl_set *set); static struct isl_basic_set *modulo_affine_hull( struct isl_set *set, struct isl_basic_set *affine_hull); /* Compute the convex hull of a pair of basic sets without any parameters or * integer divisions. * * This function is called from uset_convex_hull_unbounded, which * means that the complete convex hull is unbounded. Some pairs * of basic sets may still be bounded, though. * They may even lie inside a lower dimensional space, in which * case they need to be handled inside their affine hull since * the main algorithm assumes that the result is full-dimensional. * * If the convex hull of the two basic sets would have a non-trivial * lineality space, we first project out this lineality space. */ static struct isl_basic_set *convex_hull_pair(struct isl_basic_set *bset1, struct isl_basic_set *bset2) { isl_basic_set *lin, *aff; int bounded1, bounded2; if (bset1->ctx->opt->convex == ISL_CONVEX_HULL_FM) return convex_hull_pair_elim(bset1, bset2); aff = isl_set_affine_hull(isl_basic_set_union(isl_basic_set_copy(bset1), isl_basic_set_copy(bset2))); if (!aff) goto error; if (aff->n_eq != 0) return modulo_affine_hull(isl_basic_set_union(bset1, bset2), aff); isl_basic_set_free(aff); bounded1 = isl_basic_set_is_bounded(bset1); bounded2 = isl_basic_set_is_bounded(bset2); if (bounded1 < 0 || bounded2 < 0) goto error; if (bounded1 && bounded2) uset_convex_hull_wrap(isl_basic_set_union(bset1, bset2)); if (bounded1 || bounded2) return convex_hull_pair_pointed(bset1, bset2); lin = induced_lineality_space(isl_basic_set_copy(bset1), isl_basic_set_copy(bset2)); if (!lin) goto error; if (isl_basic_set_is_universe(lin)) { isl_basic_set_free(bset1); isl_basic_set_free(bset2); return lin; } if (lin->n_eq < isl_basic_set_total_dim(lin)) { struct isl_set *set; set = isl_set_alloc_space(isl_basic_set_get_space(bset1), 2, 0); set = isl_set_add_basic_set(set, bset1); set = isl_set_add_basic_set(set, bset2); return modulo_lineality(set, lin); } isl_basic_set_free(lin); return convex_hull_pair_pointed(bset1, bset2); error: isl_basic_set_free(bset1); isl_basic_set_free(bset2); return NULL; } /* Compute the lineality space of a basic set. * We currently do not allow the basic set to have any divs. * We basically just drop the constants and turn every inequality * into an equality. */ struct isl_basic_set *isl_basic_set_lineality_space(struct isl_basic_set *bset) { int i, k; struct isl_basic_set *lin = NULL; unsigned dim; if (!bset) goto error; isl_assert(bset->ctx, bset->n_div == 0, goto error); dim = isl_basic_set_total_dim(bset); lin = isl_basic_set_alloc_space(isl_basic_set_get_space(bset), 0, dim, 0); if (!lin) goto error; for (i = 0; i < bset->n_eq; ++i) { k = isl_basic_set_alloc_equality(lin); if (k < 0) goto error; isl_int_set_si(lin->eq[k][0], 0); isl_seq_cpy(lin->eq[k] + 1, bset->eq[i] + 1, dim); } lin = isl_basic_set_gauss(lin, NULL); if (!lin) goto error; for (i = 0; i < bset->n_ineq && lin->n_eq < dim; ++i) { k = isl_basic_set_alloc_equality(lin); if (k < 0) goto error; isl_int_set_si(lin->eq[k][0], 0); isl_seq_cpy(lin->eq[k] + 1, bset->ineq[i] + 1, dim); lin = isl_basic_set_gauss(lin, NULL); if (!lin) goto error; } isl_basic_set_free(bset); return lin; error: isl_basic_set_free(lin); isl_basic_set_free(bset); return NULL; } /* Compute the (linear) hull of the lineality spaces of the basic sets in the * "underlying" set "set". */ static struct isl_basic_set *uset_combined_lineality_space(struct isl_set *set) { int i; struct isl_set *lin = NULL; if (!set) return NULL; if (set->n == 0) { isl_space *dim = isl_set_get_space(set); isl_set_free(set); return isl_basic_set_empty(dim); } lin = isl_set_alloc_space(isl_set_get_space(set), set->n, 0); for (i = 0; i < set->n; ++i) lin = isl_set_add_basic_set(lin, isl_basic_set_lineality_space(isl_basic_set_copy(set->p[i]))); isl_set_free(set); return isl_set_affine_hull(lin); } /* Compute the convex hull of a set without any parameters or * integer divisions. * In each step, we combined two basic sets until only one * basic set is left. * The input basic sets are assumed not to have a non-trivial * lineality space. If any of the intermediate results has * a non-trivial lineality space, it is projected out. */ static struct isl_basic_set *uset_convex_hull_unbounded(struct isl_set *set) { struct isl_basic_set *convex_hull = NULL; convex_hull = isl_set_copy_basic_set(set); set = isl_set_drop_basic_set(set, convex_hull); if (!set) goto error; while (set->n > 0) { struct isl_basic_set *t; t = isl_set_copy_basic_set(set); if (!t) goto error; set = isl_set_drop_basic_set(set, t); if (!set) goto error; convex_hull = convex_hull_pair(convex_hull, t); if (set->n == 0) break; t = isl_basic_set_lineality_space(isl_basic_set_copy(convex_hull)); if (!t) goto error; if (isl_basic_set_is_universe(t)) { isl_basic_set_free(convex_hull); convex_hull = t; break; } if (t->n_eq < isl_basic_set_total_dim(t)) { set = isl_set_add_basic_set(set, convex_hull); return modulo_lineality(set, t); } isl_basic_set_free(t); } isl_set_free(set); return convex_hull; error: isl_set_free(set); isl_basic_set_free(convex_hull); return NULL; } /* Compute an initial hull for wrapping containing a single initial * facet. * This function assumes that the given set is bounded. */ static struct isl_basic_set *initial_hull(struct isl_basic_set *hull, struct isl_set *set) { struct isl_mat *bounds = NULL; unsigned dim; int k; if (!hull) goto error; bounds = initial_facet_constraint(set); if (!bounds) goto error; k = isl_basic_set_alloc_inequality(hull); if (k < 0) goto error; dim = isl_set_n_dim(set); isl_assert(set->ctx, 1 + dim == bounds->n_col, goto error); isl_seq_cpy(hull->ineq[k], bounds->row[0], bounds->n_col); isl_mat_free(bounds); return hull; error: isl_basic_set_free(hull); isl_mat_free(bounds); return NULL; } struct max_constraint { struct isl_mat *c; int count; int ineq; }; static int max_constraint_equal(const void *entry, const void *val) { struct max_constraint *a = (struct max_constraint *)entry; isl_int *b = (isl_int *)val; return isl_seq_eq(a->c->row[0] + 1, b, a->c->n_col - 1); } static void update_constraint(struct isl_ctx *ctx, struct isl_hash_table *table, isl_int *con, unsigned len, int n, int ineq) { struct isl_hash_table_entry *entry; struct max_constraint *c; uint32_t c_hash; c_hash = isl_seq_get_hash(con + 1, len); entry = isl_hash_table_find(ctx, table, c_hash, max_constraint_equal, con + 1, 0); if (!entry) return; c = entry->data; if (c->count < n) { isl_hash_table_remove(ctx, table, entry); return; } c->count++; if (isl_int_gt(c->c->row[0][0], con[0])) return; if (isl_int_eq(c->c->row[0][0], con[0])) { if (ineq) c->ineq = ineq; return; } c->c = isl_mat_cow(c->c); isl_int_set(c->c->row[0][0], con[0]); c->ineq = ineq; } /* Check whether the constraint hash table "table" constains the constraint * "con". */ static int has_constraint(struct isl_ctx *ctx, struct isl_hash_table *table, isl_int *con, unsigned len, int n) { struct isl_hash_table_entry *entry; struct max_constraint *c; uint32_t c_hash; c_hash = isl_seq_get_hash(con + 1, len); entry = isl_hash_table_find(ctx, table, c_hash, max_constraint_equal, con + 1, 0); if (!entry) return 0; c = entry->data; if (c->count < n) return 0; return isl_int_eq(c->c->row[0][0], con[0]); } /* Check for inequality constraints of a basic set without equalities * such that the same or more stringent copies of the constraint appear * in all of the basic sets. Such constraints are necessarily facet * constraints of the convex hull. * * If the resulting basic set is by chance identical to one of * the basic sets in "set", then we know that this basic set contains * all other basic sets and is therefore the convex hull of set. * In this case we set *is_hull to 1. */ static struct isl_basic_set *common_constraints(struct isl_basic_set *hull, struct isl_set *set, int *is_hull) { int i, j, s, n; int min_constraints; int best; struct max_constraint *constraints = NULL; struct isl_hash_table *table = NULL; unsigned total; *is_hull = 0; for (i = 0; i < set->n; ++i) if (set->p[i]->n_eq == 0) break; if (i >= set->n) return hull; min_constraints = set->p[i]->n_ineq; best = i; for (i = best + 1; i < set->n; ++i) { if (set->p[i]->n_eq != 0) continue; if (set->p[i]->n_ineq >= min_constraints) continue; min_constraints = set->p[i]->n_ineq; best = i; } constraints = isl_calloc_array(hull->ctx, struct max_constraint, min_constraints); if (!constraints) return hull; table = isl_alloc_type(hull->ctx, struct isl_hash_table); if (isl_hash_table_init(hull->ctx, table, min_constraints)) goto error; total = isl_space_dim(set->dim, isl_dim_all); for (i = 0; i < set->p[best]->n_ineq; ++i) { constraints[i].c = isl_mat_sub_alloc6(hull->ctx, set->p[best]->ineq + i, 0, 1, 0, 1 + total); if (!constraints[i].c) goto error; constraints[i].ineq = 1; } for (i = 0; i < min_constraints; ++i) { struct isl_hash_table_entry *entry; uint32_t c_hash; c_hash = isl_seq_get_hash(constraints[i].c->row[0] + 1, total); entry = isl_hash_table_find(hull->ctx, table, c_hash, max_constraint_equal, constraints[i].c->row[0] + 1, 1); if (!entry) goto error; isl_assert(hull->ctx, !entry->data, goto error); entry->data = &constraints[i]; } n = 0; for (s = 0; s < set->n; ++s) { if (s == best) continue; for (i = 0; i < set->p[s]->n_eq; ++i) { isl_int *eq = set->p[s]->eq[i]; for (j = 0; j < 2; ++j) { isl_seq_neg(eq, eq, 1 + total); update_constraint(hull->ctx, table, eq, total, n, 0); } } for (i = 0; i < set->p[s]->n_ineq; ++i) { isl_int *ineq = set->p[s]->ineq[i]; update_constraint(hull->ctx, table, ineq, total, n, set->p[s]->n_eq == 0); } ++n; } for (i = 0; i < min_constraints; ++i) { if (constraints[i].count < n) continue; if (!constraints[i].ineq) continue; j = isl_basic_set_alloc_inequality(hull); if (j < 0) goto error; isl_seq_cpy(hull->ineq[j], constraints[i].c->row[0], 1 + total); } for (s = 0; s < set->n; ++s) { if (set->p[s]->n_eq) continue; if (set->p[s]->n_ineq != hull->n_ineq) continue; for (i = 0; i < set->p[s]->n_ineq; ++i) { isl_int *ineq = set->p[s]->ineq[i]; if (!has_constraint(hull->ctx, table, ineq, total, n)) break; } if (i == set->p[s]->n_ineq) *is_hull = 1; } isl_hash_table_clear(table); for (i = 0; i < min_constraints; ++i) isl_mat_free(constraints[i].c); free(constraints); free(table); return hull; error: isl_hash_table_clear(table); free(table); if (constraints) for (i = 0; i < min_constraints; ++i) isl_mat_free(constraints[i].c); free(constraints); return hull; } /* Create a template for the convex hull of "set" and fill it up * obvious facet constraints, if any. If the result happens to * be the convex hull of "set" then *is_hull is set to 1. */ static struct isl_basic_set *proto_hull(struct isl_set *set, int *is_hull) { struct isl_basic_set *hull; unsigned n_ineq; int i; n_ineq = 1; for (i = 0; i < set->n; ++i) { n_ineq += set->p[i]->n_eq; n_ineq += set->p[i]->n_ineq; } hull = isl_basic_set_alloc_space(isl_space_copy(set->dim), 0, 0, n_ineq); hull = isl_basic_set_set_rational(hull); if (!hull) return NULL; return common_constraints(hull, set, is_hull); } static struct isl_basic_set *uset_convex_hull_wrap(struct isl_set *set) { struct isl_basic_set *hull; int is_hull; hull = proto_hull(set, &is_hull); if (hull && !is_hull) { if (hull->n_ineq == 0) hull = initial_hull(hull, set); hull = extend(hull, set); } isl_set_free(set); return hull; } /* Compute the convex hull of a set without any parameters or * integer divisions. Depending on whether the set is bounded, * we pass control to the wrapping based convex hull or * the Fourier-Motzkin elimination based convex hull. * We also handle a few special cases before checking the boundedness. */ static struct isl_basic_set *uset_convex_hull(struct isl_set *set) { struct isl_basic_set *convex_hull = NULL; struct isl_basic_set *lin; if (isl_set_n_dim(set) == 0) return convex_hull_0d(set); set = isl_set_coalesce(set); set = isl_set_set_rational(set); if (!set) goto error; if (!set) return NULL; if (set->n == 1) { convex_hull = isl_basic_set_copy(set->p[0]); isl_set_free(set); return convex_hull; } if (isl_set_n_dim(set) == 1) return convex_hull_1d(set); if (isl_set_is_bounded(set) && set->ctx->opt->convex == ISL_CONVEX_HULL_WRAP) return uset_convex_hull_wrap(set); lin = uset_combined_lineality_space(isl_set_copy(set)); if (!lin) goto error; if (isl_basic_set_is_universe(lin)) { isl_set_free(set); return lin; } if (lin->n_eq < isl_basic_set_total_dim(lin)) return modulo_lineality(set, lin); isl_basic_set_free(lin); return uset_convex_hull_unbounded(set); error: isl_set_free(set); isl_basic_set_free(convex_hull); return NULL; } /* This is the core procedure, where "set" is a "pure" set, i.e., * without parameters or divs and where the convex hull of set is * known to be full-dimensional. */ static struct isl_basic_set *uset_convex_hull_wrap_bounded(struct isl_set *set) { struct isl_basic_set *convex_hull = NULL; if (!set) goto error; if (isl_set_n_dim(set) == 0) { convex_hull = isl_basic_set_universe(isl_space_copy(set->dim)); isl_set_free(set); convex_hull = isl_basic_set_set_rational(convex_hull); return convex_hull; } set = isl_set_set_rational(set); set = isl_set_coalesce(set); if (!set) goto error; if (set->n == 1) { convex_hull = isl_basic_set_copy(set->p[0]); isl_set_free(set); convex_hull = isl_basic_map_remove_redundancies(convex_hull); return convex_hull; } if (isl_set_n_dim(set) == 1) return convex_hull_1d(set); return uset_convex_hull_wrap(set); error: isl_set_free(set); return NULL; } /* Compute the convex hull of set "set" with affine hull "affine_hull", * We first remove the equalities (transforming the set), compute the * convex hull of the transformed set and then add the equalities back * (after performing the inverse transformation. */ static struct isl_basic_set *modulo_affine_hull( struct isl_set *set, struct isl_basic_set *affine_hull) { struct isl_mat *T; struct isl_mat *T2; struct isl_basic_set *dummy; struct isl_basic_set *convex_hull; dummy = isl_basic_set_remove_equalities( isl_basic_set_copy(affine_hull), &T, &T2); if (!dummy) goto error; isl_basic_set_free(dummy); set = isl_set_preimage(set, T); convex_hull = uset_convex_hull(set); convex_hull = isl_basic_set_preimage(convex_hull, T2); convex_hull = isl_basic_set_intersect(convex_hull, affine_hull); return convex_hull; error: isl_basic_set_free(affine_hull); isl_set_free(set); return NULL; } /* Compute the convex hull of a map. * * The implementation was inspired by "Extended Convex Hull" by Fukuda et al., * specifically, the wrapping of facets to obtain new facets. */ struct isl_basic_map *isl_map_convex_hull(struct isl_map *map) { struct isl_basic_set *bset; struct isl_basic_map *model = NULL; struct isl_basic_set *affine_hull = NULL; struct isl_basic_map *convex_hull = NULL; struct isl_set *set = NULL; struct isl_ctx *ctx; if (!map) goto error; ctx = map->ctx; if (map->n == 0) { convex_hull = isl_basic_map_empty_like_map(map); isl_map_free(map); return convex_hull; } map = isl_map_detect_equalities(map); map = isl_map_align_divs(map); if (!map) goto error; model = isl_basic_map_copy(map->p[0]); set = isl_map_underlying_set(map); if (!set) goto error; affine_hull = isl_set_affine_hull(isl_set_copy(set)); if (!affine_hull) goto error; if (affine_hull->n_eq != 0) bset = modulo_affine_hull(set, affine_hull); else { isl_basic_set_free(affine_hull); bset = uset_convex_hull(set); } convex_hull = isl_basic_map_overlying_set(bset, model); if (!convex_hull) return NULL; ISL_F_SET(convex_hull, ISL_BASIC_MAP_NO_IMPLICIT); ISL_F_SET(convex_hull, ISL_BASIC_MAP_ALL_EQUALITIES); ISL_F_CLR(convex_hull, ISL_BASIC_MAP_RATIONAL); return convex_hull; error: isl_set_free(set); isl_basic_map_free(model); return NULL; } struct isl_basic_set *isl_set_convex_hull(struct isl_set *set) { return (struct isl_basic_set *) isl_map_convex_hull((struct isl_map *)set); } __isl_give isl_basic_map *isl_map_polyhedral_hull(__isl_take isl_map *map) { isl_basic_map *hull; hull = isl_map_convex_hull(map); return isl_basic_map_remove_divs(hull); } __isl_give isl_basic_set *isl_set_polyhedral_hull(__isl_take isl_set *set) { return (isl_basic_set *)isl_map_polyhedral_hull((isl_map *)set); } struct sh_data_entry { struct isl_hash_table *table; struct isl_tab *tab; }; /* Holds the data needed during the simple hull computation. * In particular, * n the number of basic sets in the original set * hull_table a hash table of already computed constraints * in the simple hull * p for each basic set, * table a hash table of the constraints * tab the tableau corresponding to the basic set */ struct sh_data { struct isl_ctx *ctx; unsigned n; struct isl_hash_table *hull_table; struct sh_data_entry p[1]; }; static void sh_data_free(struct sh_data *data) { int i; if (!data) return; isl_hash_table_free(data->ctx, data->hull_table); for (i = 0; i < data->n; ++i) { isl_hash_table_free(data->ctx, data->p[i].table); isl_tab_free(data->p[i].tab); } free(data); } struct ineq_cmp_data { unsigned len; isl_int *p; }; static int has_ineq(const void *entry, const void *val) { isl_int *row = (isl_int *)entry; struct ineq_cmp_data *v = (struct ineq_cmp_data *)val; return isl_seq_eq(row + 1, v->p + 1, v->len) || isl_seq_is_neg(row + 1, v->p + 1, v->len); } static int hash_ineq(struct isl_ctx *ctx, struct isl_hash_table *table, isl_int *ineq, unsigned len) { uint32_t c_hash; struct ineq_cmp_data v; struct isl_hash_table_entry *entry; v.len = len; v.p = ineq; c_hash = isl_seq_get_hash(ineq + 1, len); entry = isl_hash_table_find(ctx, table, c_hash, has_ineq, &v, 1); if (!entry) return - 1; entry->data = ineq; return 0; } /* Fill hash table "table" with the constraints of "bset". * Equalities are added as two inequalities. * The value in the hash table is a pointer to the (in)equality of "bset". */ static int hash_basic_set(struct isl_hash_table *table, struct isl_basic_set *bset) { int i, j; unsigned dim = isl_basic_set_total_dim(bset); for (i = 0; i < bset->n_eq; ++i) { for (j = 0; j < 2; ++j) { isl_seq_neg(bset->eq[i], bset->eq[i], 1 + dim); if (hash_ineq(bset->ctx, table, bset->eq[i], dim) < 0) return -1; } } for (i = 0; i < bset->n_ineq; ++i) { if (hash_ineq(bset->ctx, table, bset->ineq[i], dim) < 0) return -1; } return 0; } static struct sh_data *sh_data_alloc(struct isl_set *set, unsigned n_ineq) { struct sh_data *data; int i; data = isl_calloc(set->ctx, struct sh_data, sizeof(struct sh_data) + (set->n - 1) * sizeof(struct sh_data_entry)); if (!data) return NULL; data->ctx = set->ctx; data->n = set->n; data->hull_table = isl_hash_table_alloc(set->ctx, n_ineq); if (!data->hull_table) goto error; for (i = 0; i < set->n; ++i) { data->p[i].table = isl_hash_table_alloc(set->ctx, 2 * set->p[i]->n_eq + set->p[i]->n_ineq); if (!data->p[i].table) goto error; if (hash_basic_set(data->p[i].table, set->p[i]) < 0) goto error; } return data; error: sh_data_free(data); return NULL; } /* Check if inequality "ineq" is a bound for basic set "j" or if * it can be relaxed (by increasing the constant term) to become * a bound for that basic set. In the latter case, the constant * term is updated. * Relaxation of the constant term is only allowed if "shift" is set. * * Return 1 if "ineq" is a bound * 0 if "ineq" may attain arbitrarily small values on basic set "j" * -1 if some error occurred */ static int is_bound(struct sh_data *data, struct isl_set *set, int j, isl_int *ineq, int shift) { enum isl_lp_result res; isl_int opt; if (!data->p[j].tab) { data->p[j].tab = isl_tab_from_basic_set(set->p[j], 0); if (!data->p[j].tab) return -1; } isl_int_init(opt); res = isl_tab_min(data->p[j].tab, ineq, data->ctx->one, &opt, NULL, 0); if (res == isl_lp_ok && isl_int_is_neg(opt)) { if (shift) isl_int_sub(ineq[0], ineq[0], opt); else res = isl_lp_unbounded; } isl_int_clear(opt); return (res == isl_lp_ok || res == isl_lp_empty) ? 1 : res == isl_lp_unbounded ? 0 : -1; } /* Check if inequality "ineq" from basic set "i" is or can be relaxed to * become a bound on the whole set. If so, add the (relaxed) inequality * to "hull". Relaxation is only allowed if "shift" is set. * * We first check if "hull" already contains a translate of the inequality. * If so, we are done. * Then, we check if any of the previous basic sets contains a translate * of the inequality. If so, then we have already considered this * inequality and we are done. * Otherwise, for each basic set other than "i", we check if the inequality * is a bound on the basic set. * For previous basic sets, we know that they do not contain a translate * of the inequality, so we directly call is_bound. * For following basic sets, we first check if a translate of the * inequality appears in its description and if so directly update * the inequality accordingly. */ static struct isl_basic_set *add_bound(struct isl_basic_set *hull, struct sh_data *data, struct isl_set *set, int i, isl_int *ineq, int shift) { uint32_t c_hash; struct ineq_cmp_data v; struct isl_hash_table_entry *entry; int j, k; if (!hull) return NULL; v.len = isl_basic_set_total_dim(hull); v.p = ineq; c_hash = isl_seq_get_hash(ineq + 1, v.len); entry = isl_hash_table_find(hull->ctx, data->hull_table, c_hash, has_ineq, &v, 0); if (entry) return hull; for (j = 0; j < i; ++j) { entry = isl_hash_table_find(hull->ctx, data->p[j].table, c_hash, has_ineq, &v, 0); if (entry) break; } if (j < i) return hull; k = isl_basic_set_alloc_inequality(hull); isl_seq_cpy(hull->ineq[k], ineq, 1 + v.len); if (k < 0) goto error; for (j = 0; j < i; ++j) { int bound; bound = is_bound(data, set, j, hull->ineq[k], shift); if (bound < 0) goto error; if (!bound) break; } if (j < i) { isl_basic_set_free_inequality(hull, 1); return hull; } for (j = i + 1; j < set->n; ++j) { int bound, neg; isl_int *ineq_j; entry = isl_hash_table_find(hull->ctx, data->p[j].table, c_hash, has_ineq, &v, 0); if (entry) { ineq_j = entry->data; neg = isl_seq_is_neg(ineq_j + 1, hull->ineq[k] + 1, v.len); if (neg) isl_int_neg(ineq_j[0], ineq_j[0]); if (isl_int_gt(ineq_j[0], hull->ineq[k][0])) isl_int_set(hull->ineq[k][0], ineq_j[0]); if (neg) isl_int_neg(ineq_j[0], ineq_j[0]); continue; } bound = is_bound(data, set, j, hull->ineq[k], shift); if (bound < 0) goto error; if (!bound) break; } if (j < set->n) { isl_basic_set_free_inequality(hull, 1); return hull; } entry = isl_hash_table_find(hull->ctx, data->hull_table, c_hash, has_ineq, &v, 1); if (!entry) goto error; entry->data = hull->ineq[k]; return hull; error: isl_basic_set_free(hull); return NULL; } /* Check if any inequality from basic set "i" is or can be relaxed to * become a bound on the whole set. If so, add the (relaxed) inequality * to "hull". Relaxation is only allowed if "shift" is set. */ static struct isl_basic_set *add_bounds(struct isl_basic_set *bset, struct sh_data *data, struct isl_set *set, int i, int shift) { int j, k; unsigned dim = isl_basic_set_total_dim(bset); for (j = 0; j < set->p[i]->n_eq; ++j) { for (k = 0; k < 2; ++k) { isl_seq_neg(set->p[i]->eq[j], set->p[i]->eq[j], 1+dim); bset = add_bound(bset, data, set, i, set->p[i]->eq[j], shift); } } for (j = 0; j < set->p[i]->n_ineq; ++j) bset = add_bound(bset, data, set, i, set->p[i]->ineq[j], shift); return bset; } /* Compute a superset of the convex hull of set that is described * by only (translates of) the constraints in the constituents of set. * Translation is only allowed if "shift" is set. */ static __isl_give isl_basic_set *uset_simple_hull(__isl_take isl_set *set, int shift) { struct sh_data *data = NULL; struct isl_basic_set *hull = NULL; unsigned n_ineq; int i; if (!set) return NULL; n_ineq = 0; for (i = 0; i < set->n; ++i) { if (!set->p[i]) goto error; n_ineq += 2 * set->p[i]->n_eq + set->p[i]->n_ineq; } hull = isl_basic_set_alloc_space(isl_space_copy(set->dim), 0, 0, n_ineq); if (!hull) goto error; data = sh_data_alloc(set, n_ineq); if (!data) goto error; for (i = 0; i < set->n; ++i) hull = add_bounds(hull, data, set, i, shift); sh_data_free(data); isl_set_free(set); return hull; error: sh_data_free(data); isl_basic_set_free(hull); isl_set_free(set); return NULL; } /* Compute a superset of the convex hull of map that is described * by only (translates of) the constraints in the constituents of map. * Translation is only allowed if "shift" is set. */ static __isl_give isl_basic_map *map_simple_hull(__isl_take isl_map *map, int shift) { struct isl_set *set = NULL; struct isl_basic_map *model = NULL; struct isl_basic_map *hull; struct isl_basic_map *affine_hull; struct isl_basic_set *bset = NULL; if (!map) return NULL; if (map->n == 0) { hull = isl_basic_map_empty_like_map(map); isl_map_free(map); return hull; } if (map->n == 1) { hull = isl_basic_map_copy(map->p[0]); isl_map_free(map); return hull; } map = isl_map_detect_equalities(map); affine_hull = isl_map_affine_hull(isl_map_copy(map)); map = isl_map_align_divs(map); model = map ? isl_basic_map_copy(map->p[0]) : NULL; set = isl_map_underlying_set(map); bset = uset_simple_hull(set, shift); hull = isl_basic_map_overlying_set(bset, model); hull = isl_basic_map_intersect(hull, affine_hull); hull = isl_basic_map_remove_redundancies(hull); if (!hull) return NULL; ISL_F_SET(hull, ISL_BASIC_MAP_NO_IMPLICIT); ISL_F_SET(hull, ISL_BASIC_MAP_ALL_EQUALITIES); return hull; } /* Compute a superset of the convex hull of map that is described * by only translates of the constraints in the constituents of map. */ __isl_give isl_basic_map *isl_map_simple_hull(__isl_take isl_map *map) { return map_simple_hull(map, 1); } struct isl_basic_set *isl_set_simple_hull(struct isl_set *set) { return (struct isl_basic_set *) isl_map_simple_hull((struct isl_map *)set); } /* Compute a superset of the convex hull of map that is described * by only the constraints in the constituents of map. */ __isl_give isl_basic_map *isl_map_unshifted_simple_hull( __isl_take isl_map *map) { return map_simple_hull(map, 0); } __isl_give isl_basic_set *isl_set_unshifted_simple_hull( __isl_take isl_set *set) { return isl_map_unshifted_simple_hull(set); } /* Given a set "set", return parametric bounds on the dimension "dim". */ static struct isl_basic_set *set_bounds(struct isl_set *set, int dim) { unsigned set_dim = isl_set_dim(set, isl_dim_set); set = isl_set_copy(set); set = isl_set_eliminate_dims(set, dim + 1, set_dim - (dim + 1)); set = isl_set_eliminate_dims(set, 0, dim); return isl_set_convex_hull(set); } /* Computes a "simple hull" and then check if each dimension in the * resulting hull is bounded by a symbolic constant. If not, the * hull is intersected with the corresponding bounds on the whole set. */ struct isl_basic_set *isl_set_bounded_simple_hull(struct isl_set *set) { int i, j; struct isl_basic_set *hull; unsigned nparam, left; int removed_divs = 0; hull = isl_set_simple_hull(isl_set_copy(set)); if (!hull) goto error; nparam = isl_basic_set_dim(hull, isl_dim_param); for (i = 0; i < isl_basic_set_dim(hull, isl_dim_set); ++i) { int lower = 0, upper = 0; struct isl_basic_set *bounds; left = isl_basic_set_total_dim(hull) - nparam - i - 1; for (j = 0; j < hull->n_eq; ++j) { if (isl_int_is_zero(hull->eq[j][1 + nparam + i])) continue; if (isl_seq_first_non_zero(hull->eq[j]+1+nparam+i+1, left) == -1) break; } if (j < hull->n_eq) continue; for (j = 0; j < hull->n_ineq; ++j) { if (isl_int_is_zero(hull->ineq[j][1 + nparam + i])) continue; if (isl_seq_first_non_zero(hull->ineq[j]+1+nparam+i+1, left) != -1 || isl_seq_first_non_zero(hull->ineq[j]+1+nparam, i) != -1) continue; if (isl_int_is_pos(hull->ineq[j][1 + nparam + i])) lower = 1; else upper = 1; if (lower && upper) break; } if (lower && upper) continue; if (!removed_divs) { set = isl_set_remove_divs(set); if (!set) goto error; removed_divs = 1; } bounds = set_bounds(set, i); hull = isl_basic_set_intersect(hull, bounds); if (!hull) goto error; } isl_set_free(set); return hull; error: isl_set_free(set); return NULL; } cloog-0.18.2/isl/isl_range.c0000664000175000017500000003141412254313240012525 00000000000000#include #include #include #include #include #include struct range_data { struct isl_bound *bound; int *signs; int sign; int test_monotonicity; int monotonicity; int tight; isl_qpolynomial *poly; isl_pw_qpolynomial_fold *pwf; isl_pw_qpolynomial_fold *pwf_tight; }; static int propagate_on_domain(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct range_data *data); /* Check whether the polynomial "poly" has sign "sign" over "bset", * i.e., if sign == 1, check that the lower bound on the polynomial * is non-negative and if sign == -1, check that the upper bound on * the polynomial is non-positive. */ static int has_sign(__isl_keep isl_basic_set *bset, __isl_keep isl_qpolynomial *poly, int sign, int *signs) { struct range_data data_m; unsigned nvar; unsigned nparam; isl_space *dim; isl_qpolynomial *opt; int r; enum isl_fold type; nparam = isl_basic_set_dim(bset, isl_dim_param); nvar = isl_basic_set_dim(bset, isl_dim_set); bset = isl_basic_set_copy(bset); poly = isl_qpolynomial_copy(poly); bset = isl_basic_set_move_dims(bset, isl_dim_set, 0, isl_dim_param, 0, nparam); poly = isl_qpolynomial_move_dims(poly, isl_dim_in, 0, isl_dim_param, 0, nparam); dim = isl_qpolynomial_get_space(poly); dim = isl_space_params(dim); dim = isl_space_from_domain(dim); dim = isl_space_add_dims(dim, isl_dim_out, 1); data_m.test_monotonicity = 0; data_m.signs = signs; data_m.sign = -sign; type = data_m.sign < 0 ? isl_fold_min : isl_fold_max; data_m.pwf = isl_pw_qpolynomial_fold_zero(dim, type); data_m.tight = 0; data_m.pwf_tight = NULL; if (propagate_on_domain(bset, poly, &data_m) < 0) goto error; if (sign > 0) opt = isl_pw_qpolynomial_fold_min(data_m.pwf); else opt = isl_pw_qpolynomial_fold_max(data_m.pwf); if (!opt) r = -1; else if (isl_qpolynomial_is_nan(opt) || isl_qpolynomial_is_infty(opt) || isl_qpolynomial_is_neginfty(opt)) r = 0; else r = sign * isl_qpolynomial_sgn(opt) >= 0; isl_qpolynomial_free(opt); return r; error: isl_pw_qpolynomial_fold_free(data_m.pwf); return -1; } /* Return 1 if poly is monotonically increasing in the last set variable, * -1 if poly is monotonically decreasing in the last set variable, * 0 if no conclusion, * -2 on error. * * We simply check the sign of p(x+1)-p(x) */ static int monotonicity(__isl_keep isl_basic_set *bset, __isl_keep isl_qpolynomial *poly, struct range_data *data) { isl_ctx *ctx; isl_space *dim; isl_qpolynomial *sub = NULL; isl_qpolynomial *diff = NULL; int result = 0; int s; unsigned nvar; ctx = isl_qpolynomial_get_ctx(poly); dim = isl_qpolynomial_get_domain_space(poly); nvar = isl_basic_set_dim(bset, isl_dim_set); sub = isl_qpolynomial_var_on_domain(isl_space_copy(dim), isl_dim_set, nvar - 1); sub = isl_qpolynomial_add(sub, isl_qpolynomial_rat_cst_on_domain(dim, ctx->one, ctx->one)); diff = isl_qpolynomial_substitute(isl_qpolynomial_copy(poly), isl_dim_in, nvar - 1, 1, &sub); diff = isl_qpolynomial_sub(diff, isl_qpolynomial_copy(poly)); s = has_sign(bset, diff, 1, data->signs); if (s < 0) goto error; if (s) result = 1; else { s = has_sign(bset, diff, -1, data->signs); if (s < 0) goto error; if (s) result = -1; } isl_qpolynomial_free(diff); isl_qpolynomial_free(sub); return result; error: isl_qpolynomial_free(diff); isl_qpolynomial_free(sub); return -2; } static __isl_give isl_qpolynomial *bound2poly(__isl_take isl_constraint *bound, __isl_take isl_space *dim, unsigned pos, int sign) { if (!bound) { if (sign > 0) return isl_qpolynomial_infty_on_domain(dim); else return isl_qpolynomial_neginfty_on_domain(dim); } isl_space_free(dim); return isl_qpolynomial_from_constraint(bound, isl_dim_set, pos); } static int bound_is_integer(__isl_take isl_constraint *bound, unsigned pos) { isl_int c; int is_int; if (!bound) return 1; isl_int_init(c); isl_constraint_get_coefficient(bound, isl_dim_set, pos, &c); is_int = isl_int_is_one(c) || isl_int_is_negone(c); isl_int_clear(c); return is_int; } struct isl_fixed_sign_data { int *signs; int sign; isl_qpolynomial *poly; }; /* Add term "term" to data->poly if it has sign data->sign. * The sign is determined based on the signs of the parameters * and variables in data->signs. The integer divisions, if * any, are assumed to be non-negative. */ static int collect_fixed_sign_terms(__isl_take isl_term *term, void *user) { struct isl_fixed_sign_data *data = (struct isl_fixed_sign_data *)user; isl_int n; int i; int sign; unsigned nparam; unsigned nvar; if (!term) return -1; nparam = isl_term_dim(term, isl_dim_param); nvar = isl_term_dim(term, isl_dim_set); isl_int_init(n); isl_term_get_num(term, &n); sign = isl_int_sgn(n); for (i = 0; i < nparam; ++i) { if (data->signs[i] > 0) continue; if (isl_term_get_exp(term, isl_dim_param, i) % 2) sign = -sign; } for (i = 0; i < nvar; ++i) { if (data->signs[nparam + i] > 0) continue; if (isl_term_get_exp(term, isl_dim_set, i) % 2) sign = -sign; } if (sign == data->sign) { isl_qpolynomial *t = isl_qpolynomial_from_term(term); data->poly = isl_qpolynomial_add(data->poly, t); } else isl_term_free(term); isl_int_clear(n); return 0; } /* Construct and return a polynomial that consists of the terms * in "poly" that have sign "sign". The integer divisions, if * any, are assumed to be non-negative. */ __isl_give isl_qpolynomial *isl_qpolynomial_terms_of_sign( __isl_keep isl_qpolynomial *poly, int *signs, int sign) { isl_space *space; struct isl_fixed_sign_data data = { signs, sign }; space = isl_qpolynomial_get_domain_space(poly); data.poly = isl_qpolynomial_zero_on_domain(space); if (isl_qpolynomial_foreach_term(poly, collect_fixed_sign_terms, &data) < 0) goto error; return data.poly; error: isl_qpolynomial_free(data.poly); return NULL; } /* Helper function to add a guarded polynomial to either pwf_tight or pwf, * depending on whether the result has been determined to be tight. */ static int add_guarded_poly(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct range_data *data) { enum isl_fold type = data->sign < 0 ? isl_fold_min : isl_fold_max; isl_set *set; isl_qpolynomial_fold *fold; isl_pw_qpolynomial_fold *pwf; bset = isl_basic_set_params(bset); poly = isl_qpolynomial_project_domain_on_params(poly); fold = isl_qpolynomial_fold_alloc(type, poly); set = isl_set_from_basic_set(bset); pwf = isl_pw_qpolynomial_fold_alloc(type, set, fold); if (data->tight) data->pwf_tight = isl_pw_qpolynomial_fold_fold( data->pwf_tight, pwf); else data->pwf = isl_pw_qpolynomial_fold_fold(data->pwf, pwf); return 0; } /* Given a lower and upper bound on the final variable and constraints * on the remaining variables where these bounds are active, * eliminate the variable from data->poly based on these bounds. * If the polynomial has been determined to be monotonic * in the variable, then simply plug in the appropriate bound. * If the current polynomial is tight and if this bound is integer, * then the result is still tight. In all other cases, the results * may not be tight. * Otherwise, plug in the largest bound (in absolute value) in * the positive terms (if an upper bound is wanted) or the negative terms * (if a lower bounded is wanted) and the other bound in the other terms. * * If all variables have been eliminated, then record the result. * Ohterwise, recurse on the next variable. */ static int propagate_on_bound_pair(__isl_take isl_constraint *lower, __isl_take isl_constraint *upper, __isl_take isl_basic_set *bset, void *user) { struct range_data *data = (struct range_data *)user; int save_tight = data->tight; isl_qpolynomial *poly; int r; unsigned nvar; nvar = isl_basic_set_dim(bset, isl_dim_set); if (data->monotonicity) { isl_qpolynomial *sub; isl_space *dim = isl_qpolynomial_get_domain_space(data->poly); if (data->monotonicity * data->sign > 0) { if (data->tight) data->tight = bound_is_integer(upper, nvar); sub = bound2poly(upper, dim, nvar, 1); isl_constraint_free(lower); } else { if (data->tight) data->tight = bound_is_integer(lower, nvar); sub = bound2poly(lower, dim, nvar, -1); isl_constraint_free(upper); } poly = isl_qpolynomial_copy(data->poly); poly = isl_qpolynomial_substitute(poly, isl_dim_in, nvar, 1, &sub); poly = isl_qpolynomial_drop_dims(poly, isl_dim_in, nvar, 1); isl_qpolynomial_free(sub); } else { isl_qpolynomial *l, *u; isl_qpolynomial *pos, *neg; isl_space *dim = isl_qpolynomial_get_domain_space(data->poly); unsigned nparam = isl_basic_set_dim(bset, isl_dim_param); int sign = data->sign * data->signs[nparam + nvar]; data->tight = 0; u = bound2poly(upper, isl_space_copy(dim), nvar, 1); l = bound2poly(lower, dim, nvar, -1); pos = isl_qpolynomial_terms_of_sign(data->poly, data->signs, sign); neg = isl_qpolynomial_terms_of_sign(data->poly, data->signs, -sign); pos = isl_qpolynomial_substitute(pos, isl_dim_in, nvar, 1, &u); neg = isl_qpolynomial_substitute(neg, isl_dim_in, nvar, 1, &l); poly = isl_qpolynomial_add(pos, neg); poly = isl_qpolynomial_drop_dims(poly, isl_dim_in, nvar, 1); isl_qpolynomial_free(u); isl_qpolynomial_free(l); } if (isl_basic_set_dim(bset, isl_dim_set) == 0) r = add_guarded_poly(bset, poly, data); else r = propagate_on_domain(bset, poly, data); data->tight = save_tight; return r; } /* Recursively perform range propagation on the polynomial "poly" * defined over the basic set "bset" and collect the results in "data". */ static int propagate_on_domain(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct range_data *data) { isl_ctx *ctx; isl_qpolynomial *save_poly = data->poly; int save_monotonicity = data->monotonicity; unsigned d; if (!bset || !poly) goto error; ctx = isl_basic_set_get_ctx(bset); d = isl_basic_set_dim(bset, isl_dim_set); isl_assert(ctx, d >= 1, goto error); if (isl_qpolynomial_is_cst(poly, NULL, NULL)) { bset = isl_basic_set_project_out(bset, isl_dim_set, 0, d); poly = isl_qpolynomial_drop_dims(poly, isl_dim_in, 0, d); return add_guarded_poly(bset, poly, data); } if (data->test_monotonicity) data->monotonicity = monotonicity(bset, poly, data); else data->monotonicity = 0; if (data->monotonicity < -1) goto error; data->poly = poly; if (isl_basic_set_foreach_bound_pair(bset, isl_dim_set, d - 1, &propagate_on_bound_pair, data) < 0) goto error; isl_basic_set_free(bset); isl_qpolynomial_free(poly); data->monotonicity = save_monotonicity; data->poly = save_poly; return 0; error: isl_basic_set_free(bset); isl_qpolynomial_free(poly); data->monotonicity = save_monotonicity; data->poly = save_poly; return -1; } static int basic_guarded_poly_bound(__isl_take isl_basic_set *bset, void *user) { struct range_data *data = (struct range_data *)user; isl_ctx *ctx; unsigned nparam = isl_basic_set_dim(bset, isl_dim_param); unsigned dim = isl_basic_set_dim(bset, isl_dim_set); int r; data->signs = NULL; ctx = isl_basic_set_get_ctx(bset); data->signs = isl_alloc_array(ctx, int, isl_basic_set_dim(bset, isl_dim_all)); if (isl_basic_set_dims_get_sign(bset, isl_dim_set, 0, dim, data->signs + nparam) < 0) goto error; if (isl_basic_set_dims_get_sign(bset, isl_dim_param, 0, nparam, data->signs) < 0) goto error; r = propagate_on_domain(bset, isl_qpolynomial_copy(data->poly), data); free(data->signs); return r; error: free(data->signs); isl_basic_set_free(bset); return -1; } static int qpolynomial_bound_on_domain_range(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct range_data *data) { unsigned nparam = isl_basic_set_dim(bset, isl_dim_param); unsigned nvar = isl_basic_set_dim(bset, isl_dim_set); isl_set *set = NULL; if (!bset) goto error; if (nvar == 0) return add_guarded_poly(bset, poly, data); set = isl_set_from_basic_set(bset); set = isl_set_split_dims(set, isl_dim_param, 0, nparam); set = isl_set_split_dims(set, isl_dim_set, 0, nvar); data->poly = poly; data->test_monotonicity = 1; if (isl_set_foreach_basic_set(set, &basic_guarded_poly_bound, data) < 0) goto error; isl_set_free(set); isl_qpolynomial_free(poly); return 0; error: isl_set_free(set); isl_qpolynomial_free(poly); return -1; } int isl_qpolynomial_bound_on_domain_range(__isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct isl_bound *bound) { struct range_data data; int r; data.pwf = bound->pwf; data.pwf_tight = bound->pwf_tight; data.tight = bound->check_tight; if (bound->type == isl_fold_min) data.sign = -1; else data.sign = 1; r = qpolynomial_bound_on_domain_range(bset, poly, &data); bound->pwf = data.pwf; bound->pwf_tight = data.pwf_tight; return r; } cloog-0.18.2/isl/isl_ilp.c0000664000175000017500000004024312254313240012215 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include "isl_sample.h" #include #include "isl_equalities.h" #include #include #include #include /* Given a basic set "bset", construct a basic set U such that for * each element x in U, the whole unit box positioned at x is inside * the given basic set. * Note that U may not contain all points that satisfy this property. * * We simply add the sum of all negative coefficients to the constant * term. This ensures that if x satisfies the resulting constraints, * then x plus any sum of unit vectors satisfies the original constraints. */ static struct isl_basic_set *unit_box_base_points(struct isl_basic_set *bset) { int i, j, k; struct isl_basic_set *unit_box = NULL; unsigned total; if (!bset) goto error; if (bset->n_eq != 0) { unit_box = isl_basic_set_empty_like(bset); isl_basic_set_free(bset); return unit_box; } total = isl_basic_set_total_dim(bset); unit_box = isl_basic_set_alloc_space(isl_basic_set_get_space(bset), 0, 0, bset->n_ineq); for (i = 0; i < bset->n_ineq; ++i) { k = isl_basic_set_alloc_inequality(unit_box); if (k < 0) goto error; isl_seq_cpy(unit_box->ineq[k], bset->ineq[i], 1 + total); for (j = 0; j < total; ++j) { if (isl_int_is_nonneg(unit_box->ineq[k][1 + j])) continue; isl_int_add(unit_box->ineq[k][0], unit_box->ineq[k][0], unit_box->ineq[k][1 + j]); } } isl_basic_set_free(bset); return unit_box; error: isl_basic_set_free(bset); isl_basic_set_free(unit_box); return NULL; } /* Find an integer point in "bset", preferably one that is * close to minimizing "f". * * We first check if we can easily put unit boxes inside bset. * If so, we take the best base point of any of the unit boxes we can find * and round it up to the nearest integer. * If not, we simply pick any integer point in "bset". */ static struct isl_vec *initial_solution(struct isl_basic_set *bset, isl_int *f) { enum isl_lp_result res; struct isl_basic_set *unit_box; struct isl_vec *sol; unit_box = unit_box_base_points(isl_basic_set_copy(bset)); res = isl_basic_set_solve_lp(unit_box, 0, f, bset->ctx->one, NULL, NULL, &sol); if (res == isl_lp_ok) { isl_basic_set_free(unit_box); return isl_vec_ceil(sol); } isl_basic_set_free(unit_box); return isl_basic_set_sample_vec(isl_basic_set_copy(bset)); } /* Restrict "bset" to those points with values for f in the interval [l, u]. */ static struct isl_basic_set *add_bounds(struct isl_basic_set *bset, isl_int *f, isl_int l, isl_int u) { int k; unsigned total; total = isl_basic_set_total_dim(bset); bset = isl_basic_set_extend_constraints(bset, 0, 2); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_cpy(bset->ineq[k], f, 1 + total); isl_int_sub(bset->ineq[k][0], bset->ineq[k][0], l); k = isl_basic_set_alloc_inequality(bset); if (k < 0) goto error; isl_seq_neg(bset->ineq[k], f, 1 + total); isl_int_add(bset->ineq[k][0], bset->ineq[k][0], u); return bset; error: isl_basic_set_free(bset); return NULL; } /* Find an integer point in "bset" that minimizes f (in any) such that * the value of f lies inside the interval [l, u]. * Return this integer point if it can be found. * Otherwise, return sol. * * We perform a number of steps until l > u. * In each step, we look for an integer point with value in either * the whole interval [l, u] or half of the interval [l, l+floor(u-l-1/2)]. * The choice depends on whether we have found an integer point in the * previous step. If so, we look for the next point in half of the remaining * interval. * If we find a point, the current solution is updated and u is set * to its value minus 1. * If no point can be found, we update l to the upper bound of the interval * we checked (u or l+floor(u-l-1/2)) plus 1. */ static struct isl_vec *solve_ilp_search(struct isl_basic_set *bset, isl_int *f, isl_int *opt, struct isl_vec *sol, isl_int l, isl_int u) { isl_int tmp; int divide = 1; isl_int_init(tmp); while (isl_int_le(l, u)) { struct isl_basic_set *slice; struct isl_vec *sample; if (!divide) isl_int_set(tmp, u); else { isl_int_sub(tmp, u, l); isl_int_fdiv_q_ui(tmp, tmp, 2); isl_int_add(tmp, tmp, l); } slice = add_bounds(isl_basic_set_copy(bset), f, l, tmp); sample = isl_basic_set_sample_vec(slice); if (!sample) { isl_vec_free(sol); sol = NULL; break; } if (sample->size > 0) { isl_vec_free(sol); sol = sample; isl_seq_inner_product(f, sol->el, sol->size, opt); isl_int_sub_ui(u, *opt, 1); divide = 1; } else { isl_vec_free(sample); if (!divide) break; isl_int_add_ui(l, tmp, 1); divide = 0; } } isl_int_clear(tmp); return sol; } /* Find an integer point in "bset" that minimizes f (if any). * If sol_p is not NULL then the integer point is returned in *sol_p. * The optimal value of f is returned in *opt. * * The algorithm maintains a currently best solution and an interval [l, u] * of values of f for which integer solutions could potentially still be found. * The initial value of the best solution so far is any solution. * The initial value of l is minimal value of f over the rationals * (rounded up to the nearest integer). * The initial value of u is the value of f at the initial solution minus 1. * * We then call solve_ilp_search to perform a binary search on the interval. */ static enum isl_lp_result solve_ilp(struct isl_basic_set *bset, isl_int *f, isl_int *opt, struct isl_vec **sol_p) { enum isl_lp_result res; isl_int l, u; struct isl_vec *sol; res = isl_basic_set_solve_lp(bset, 0, f, bset->ctx->one, opt, NULL, &sol); if (res == isl_lp_ok && isl_int_is_one(sol->el[0])) { if (sol_p) *sol_p = sol; else isl_vec_free(sol); return isl_lp_ok; } isl_vec_free(sol); if (res == isl_lp_error || res == isl_lp_empty) return res; sol = initial_solution(bset, f); if (!sol) return isl_lp_error; if (sol->size == 0) { isl_vec_free(sol); return isl_lp_empty; } if (res == isl_lp_unbounded) { isl_vec_free(sol); return isl_lp_unbounded; } isl_int_init(l); isl_int_init(u); isl_int_set(l, *opt); isl_seq_inner_product(f, sol->el, sol->size, opt); isl_int_sub_ui(u, *opt, 1); sol = solve_ilp_search(bset, f, opt, sol, l, u); if (!sol) res = isl_lp_error; isl_int_clear(l); isl_int_clear(u); if (sol_p) *sol_p = sol; else isl_vec_free(sol); return res; } static enum isl_lp_result solve_ilp_with_eq(struct isl_basic_set *bset, int max, isl_int *f, isl_int *opt, struct isl_vec **sol_p) { unsigned dim; enum isl_lp_result res; struct isl_mat *T = NULL; struct isl_vec *v; bset = isl_basic_set_copy(bset); dim = isl_basic_set_total_dim(bset); v = isl_vec_alloc(bset->ctx, 1 + dim); if (!v) goto error; isl_seq_cpy(v->el, f, 1 + dim); bset = isl_basic_set_remove_equalities(bset, &T, NULL); v = isl_vec_mat_product(v, isl_mat_copy(T)); if (!v) goto error; res = isl_basic_set_solve_ilp(bset, max, v->el, opt, sol_p); isl_vec_free(v); if (res == isl_lp_ok && sol_p) { *sol_p = isl_mat_vec_product(T, *sol_p); if (!*sol_p) res = isl_lp_error; } else isl_mat_free(T); isl_basic_set_free(bset); return res; error: isl_mat_free(T); isl_basic_set_free(bset); return isl_lp_error; } /* Find an integer point in "bset" that minimizes (or maximizes if max is set) * f (if any). * If sol_p is not NULL then the integer point is returned in *sol_p. * The optimal value of f is returned in *opt. * * If there is any equality among the points in "bset", then we first * project it out. Otherwise, we continue with solve_ilp above. */ enum isl_lp_result isl_basic_set_solve_ilp(struct isl_basic_set *bset, int max, isl_int *f, isl_int *opt, struct isl_vec **sol_p) { unsigned dim; enum isl_lp_result res; if (!bset) return isl_lp_error; if (sol_p) *sol_p = NULL; isl_assert(bset->ctx, isl_basic_set_n_param(bset) == 0, goto error); if (isl_basic_set_plain_is_empty(bset)) return isl_lp_empty; if (bset->n_eq) return solve_ilp_with_eq(bset, max, f, opt, sol_p); dim = isl_basic_set_total_dim(bset); if (max) isl_seq_neg(f, f, 1 + dim); res = solve_ilp(bset, f, opt, sol_p); if (max) { isl_seq_neg(f, f, 1 + dim); isl_int_neg(*opt, *opt); } return res; error: isl_basic_set_free(bset); return isl_lp_error; } static enum isl_lp_result basic_set_opt(__isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj, isl_int *opt) { enum isl_lp_result res; if (!obj) return isl_lp_error; bset = isl_basic_set_copy(bset); bset = isl_basic_set_underlying_set(bset); res = isl_basic_set_solve_ilp(bset, max, obj->v->el + 1, opt, NULL); isl_basic_set_free(bset); return res; } static __isl_give isl_mat *extract_divs(__isl_keep isl_basic_set *bset) { int i; isl_ctx *ctx = isl_basic_set_get_ctx(bset); isl_mat *div; div = isl_mat_alloc(ctx, bset->n_div, 1 + 1 + isl_basic_set_total_dim(bset)); if (!div) return NULL; for (i = 0; i < bset->n_div; ++i) isl_seq_cpy(div->row[i], bset->div[i], div->n_col); return div; } enum isl_lp_result isl_basic_set_opt(__isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj, isl_int *opt) { int *exp1 = NULL; int *exp2 = NULL; isl_ctx *ctx; isl_mat *bset_div = NULL; isl_mat *div = NULL; enum isl_lp_result res; int bset_n_div, obj_n_div; if (!bset || !obj) return isl_lp_error; ctx = isl_aff_get_ctx(obj); if (!isl_space_is_equal(bset->dim, obj->ls->dim)) isl_die(ctx, isl_error_invalid, "spaces don't match", return isl_lp_error); if (!isl_int_is_one(obj->v->el[0])) isl_die(ctx, isl_error_unsupported, "expecting integer affine expression", return isl_lp_error); bset_n_div = isl_basic_set_dim(bset, isl_dim_div); obj_n_div = isl_aff_dim(obj, isl_dim_div); if (bset_n_div == 0 && obj_n_div == 0) return basic_set_opt(bset, max, obj, opt); bset = isl_basic_set_copy(bset); obj = isl_aff_copy(obj); bset_div = extract_divs(bset); exp1 = isl_alloc_array(ctx, int, bset_n_div); exp2 = isl_alloc_array(ctx, int, obj_n_div); if (!bset_div || (bset_n_div && !exp1) || (obj_n_div && !exp2)) goto error; div = isl_merge_divs(bset_div, obj->ls->div, exp1, exp2); bset = isl_basic_set_expand_divs(bset, isl_mat_copy(div), exp1); obj = isl_aff_expand_divs(obj, isl_mat_copy(div), exp2); res = basic_set_opt(bset, max, obj, opt); isl_mat_free(bset_div); isl_mat_free(div); free(exp1); free(exp2); isl_basic_set_free(bset); isl_aff_free(obj); return res; error: isl_mat_free(div); isl_mat_free(bset_div); free(exp1); free(exp2); isl_basic_set_free(bset); isl_aff_free(obj); return isl_lp_error; } /* Compute the minimum (maximum if max is set) of the integer affine * expression obj over the points in set and put the result in *opt. * * The parameters are assumed to have been aligned. */ static enum isl_lp_result isl_set_opt_aligned(__isl_keep isl_set *set, int max, __isl_keep isl_aff *obj, isl_int *opt) { int i; enum isl_lp_result res; int empty = 1; isl_int opt_i; if (!set || !obj) return isl_lp_error; if (set->n == 0) return isl_lp_empty; res = isl_basic_set_opt(set->p[0], max, obj, opt); if (res == isl_lp_error || res == isl_lp_unbounded) return res; if (set->n == 1) return res; if (res == isl_lp_ok) empty = 0; isl_int_init(opt_i); for (i = 1; i < set->n; ++i) { res = isl_basic_set_opt(set->p[i], max, obj, &opt_i); if (res == isl_lp_error || res == isl_lp_unbounded) { isl_int_clear(opt_i); return res; } if (res == isl_lp_ok) empty = 0; if (isl_int_gt(opt_i, *opt)) isl_int_set(*opt, opt_i); } isl_int_clear(opt_i); return empty ? isl_lp_empty : isl_lp_ok; } /* Compute the minimum (maximum if max is set) of the integer affine * expression obj over the points in set and put the result in *opt. */ enum isl_lp_result isl_set_opt(__isl_keep isl_set *set, int max, __isl_keep isl_aff *obj, isl_int *opt) { enum isl_lp_result res; if (!set || !obj) return isl_lp_error; if (isl_space_match(set->dim, isl_dim_param, obj->ls->dim, isl_dim_param)) return isl_set_opt_aligned(set, max, obj, opt); set = isl_set_copy(set); obj = isl_aff_copy(obj); set = isl_set_align_params(set, isl_aff_get_domain_space(obj)); obj = isl_aff_align_params(obj, isl_set_get_space(set)); res = isl_set_opt_aligned(set, max, obj, opt); isl_set_free(set); isl_aff_free(obj); return res; } enum isl_lp_result isl_basic_set_max(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj, isl_int *opt) { return isl_basic_set_opt(bset, 1, obj, opt); } enum isl_lp_result isl_set_max(__isl_keep isl_set *set, __isl_keep isl_aff *obj, isl_int *opt) { return isl_set_opt(set, 1, obj, opt); } enum isl_lp_result isl_set_min(__isl_keep isl_set *set, __isl_keep isl_aff *obj, isl_int *opt) { return isl_set_opt(set, 0, obj, opt); } /* Convert the result of a function that returns an isl_lp_result * to an isl_val. The numerator of "v" is set to the optimal value * if lp_res is isl_lp_ok. "max" is set if a maximum was computed. * * Return "v" with denominator set to 1 if lp_res is isl_lp_ok. * Return NULL on error. * Return a NaN if lp_res is isl_lp_empty. * Return infinity or negative infinity if lp_res is isl_lp_unbounded, * depending on "max". */ static __isl_give isl_val *convert_lp_result(enum isl_lp_result lp_res, __isl_take isl_val *v, int max) { isl_ctx *ctx; if (lp_res == isl_lp_ok) { isl_int_set_si(v->d, 1); return isl_val_normalize(v); } ctx = isl_val_get_ctx(v); isl_val_free(v); if (lp_res == isl_lp_error) return NULL; if (lp_res == isl_lp_empty) return isl_val_nan(ctx); if (max) return isl_val_infty(ctx); else return isl_val_neginfty(ctx); } /* Return the minimum (maximum if max is set) of the integer affine * expression "obj" over the points in "bset". * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. * * Call isl_basic_set_opt and translate the results. */ __isl_give isl_val *isl_basic_set_opt_val(__isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj) { isl_ctx *ctx; isl_val *res; enum isl_lp_result lp_res; if (!bset || !obj) return NULL; ctx = isl_aff_get_ctx(obj); res = isl_val_alloc(ctx); if (!res) return NULL; lp_res = isl_basic_set_opt(bset, max, obj, &res->n); return convert_lp_result(lp_res, res, max); } /* Return the maximum of the integer affine * expression "obj" over the points in "bset". * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. */ __isl_give isl_val *isl_basic_set_max_val(__isl_keep isl_basic_set *bset, __isl_keep isl_aff *obj) { return isl_basic_set_opt_val(bset, 1, obj); } /* Return the minimum (maximum if max is set) of the integer affine * expression "obj" over the points in "set". * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. * * Call isl_set_opt and translate the results. */ __isl_give isl_val *isl_set_opt_val(__isl_keep isl_set *set, int max, __isl_keep isl_aff *obj) { isl_ctx *ctx; isl_val *res; enum isl_lp_result lp_res; if (!set || !obj) return NULL; ctx = isl_aff_get_ctx(obj); res = isl_val_alloc(ctx); if (!res) return NULL; lp_res = isl_set_opt(set, max, obj, &res->n); return convert_lp_result(lp_res, res, max); } /* Return the minimum of the integer affine * expression "obj" over the points in "set". * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. */ __isl_give isl_val *isl_set_min_val(__isl_keep isl_set *set, __isl_keep isl_aff *obj) { return isl_set_opt_val(set, 0, obj); } /* Return the maximum of the integer affine * expression "obj" over the points in "set". * * Return infinity or negative infinity if the optimal value is unbounded and * NaN if "bset" is empty. */ __isl_give isl_val *isl_set_max_val(__isl_keep isl_set *set, __isl_keep isl_aff *obj) { return isl_set_opt_val(set, 1, obj); } cloog-0.18.2/isl/aclocal.m40000664000175000017500000011075112254313257012270 00000000000000# generated automatically by aclocal 1.11.3 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, # Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.68],, [m4_warning([this file was generated for autoconf 2.68. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically `autoreconf'.])]) # Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008, 2011 Free Software # Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.11' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.11.3], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.11.3])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to # `$srcdir', `$srcdir/..', or `$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is `.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 9 # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ(2.52)dnl ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009, # 2010, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 12 # There are a few dirty hacks below to avoid letting `AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "GCJ", or "OBJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl ifelse([$1], CC, [depcc="$CC" am_compiler_list=], [$1], CXX, [depcc="$CXX" am_compiler_list=], [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], UPC, [depcc="$UPC" am_compiler_list=], [$1], GCJ, [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE(dependency-tracking, [ --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl AC_SUBST([am__nodep])dnl _AM_SUBST_NOTMAKE([am__nodep])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. #serial 5 # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each `.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2008, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 16 # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.62])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package]) AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}) AM_MISSING_PROG(AUTOCONF, autoconf) AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}) AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AM_PROG_MKDIR_P])dnl # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES(CC)], [define([AC_PROG_CC], defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES(CXX)], [define([AC_PROG_CXX], defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES(OBJC)], [define([AC_PROG_OBJC], defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl ]) _AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl dnl The `parallel-tests' driver may need to know about EXEEXT, so add the dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro dnl is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl ]) dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001, 2003, 2005, 2008, 2011 Free Software Foundation, # Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST(install_sh)]) # Copyright (C) 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 6 # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it supports --run. # If it does, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= AC_MSG_WARN([`missing' script is too old or missing]) fi ]) # Copyright (C) 2003, 2004, 2005, 2006, 2011 Free Software Foundation, # Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_PROG_MKDIR_P # --------------- # Check for `mkdir -p'. AC_DEFUN([AM_PROG_MKDIR_P], [AC_PREREQ([2.60])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P, dnl while keeping a definition of mkdir_p for backward compatibility. dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile. dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of dnl Makefile.ins that do not define MKDIR_P, so we do our own dnl adjustment using top_builddir (which is defined more often than dnl MKDIR_P). AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl case $mkdir_p in [[\\/$]]* | ?:[[\\/]]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2008, 2010 Free Software # Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # -------------------- # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), 1)]) # _AM_SET_OPTIONS(OPTIONS) # ------------------------ # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT(yes)]) # Copyright (C) 2009, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # AM_SILENT_RULES([DEFAULT]) # -------------------------- # Enable less verbose build rules; with the default set to DEFAULT # (`yes' being less verbose, `no' or empty being verbose). AC_DEFUN([AM_SILENT_RULES], [AC_ARG_ENABLE([silent-rules], [ --enable-silent-rules less verbose build output (undo: `make V=1') --disable-silent-rules verbose build output (undo: `make V=0')]) case $enable_silent_rules in yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);; esac dnl dnl A few `make' implementations (e.g., NonStop OS and NextStep) dnl do not support nested variable expansions. dnl See automake bug#9928 and bug#10237. am_make=${MAKE-make} AC_CACHE_CHECK([whether $am_make supports nested variables], [am_cv_make_support_nested_variables], [if AS_ECHO([['TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi]) if test $am_cv_make_support_nested_variables = yes; then dnl Using `$V' instead of `$(V)' breaks IRIX make. AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AC_SUBST([AM_V])dnl AM_SUBST_NOTMAKE([AM_V])dnl AC_SUBST([AM_DEFAULT_V])dnl AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl AC_SUBST([AM_DEFAULT_VERBOSITY])dnl AM_BACKSLASH='\' AC_SUBST([AM_BACKSLASH])dnl _AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl ]) # Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in `make install-strip', and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be `maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006, 2008, 2010 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 3 # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # -------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004, 2005, 2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of `v7', `ustar', or `pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AC_SUBST([AMTAR], ['$${TAR-tar}']) m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar],, [pax],, [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' _am_tools=${am_cv_prog_tar_$1-$_am_tools} # Do not fold the above two line into one, because Tru64 sh and # Solaris sh will not grok spaces in the rhs of `-'. for _am_tool in $_am_tools do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR m4_include([m4/ax_c___attribute__.m4]) m4_include([m4/ax_cc_maxopt.m4]) m4_include([m4/ax_check_compiler_flags.m4]) m4_include([m4/ax_compiler_vendor.m4]) m4_include([m4/ax_create_pkgconfig_info.m4]) m4_include([m4/ax_create_stdint_h.m4]) m4_include([m4/ax_detect_git_head.m4]) m4_include([m4/ax_gcc_archflag.m4]) m4_include([m4/ax_gcc_warn_unused_result.m4]) m4_include([m4/ax_gcc_x86_cpuid.m4]) m4_include([m4/ax_set_warning_flags.m4]) m4_include([m4/ax_submodule.m4]) m4_include([m4/libtool.m4]) m4_include([m4/ltoptions.m4]) m4_include([m4/ltsugar.m4]) m4_include([m4/ltversion.m4]) m4_include([m4/lt~obsolete.m4]) cloog-0.18.2/isl/isl_ast_build.c0000664000175000017500000016505712254313240013412 00000000000000/* * Copyright 2012 Ecole Normale Superieure * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, * Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France */ #include #include #include #include #include /* Construct a map that isolates the current dimension. * * Essentially, the current dimension of "set" is moved to the single output * dimension in the result, with the current dimension in the domain replaced * by an unconstrained variable. */ __isl_give isl_map *isl_ast_build_map_to_iterator( __isl_keep isl_ast_build *build, __isl_take isl_set *set) { isl_map *map; map = isl_map_from_domain(set); map = isl_map_add_dims(map, isl_dim_out, 1); if (!build) return isl_map_free(map); map = isl_map_equate(map, isl_dim_in, build->depth, isl_dim_out, 0); map = isl_map_eliminate(map, isl_dim_in, build->depth, 1); return map; } /* Initialize the information derived during the AST generation to default * values for a schedule domain in "space". * * We also check that the remaining fields are not NULL so that * the calling functions don't have to perform this test. */ static __isl_give isl_ast_build *isl_ast_build_init_derived( __isl_take isl_ast_build *build, __isl_take isl_space *space) { isl_ctx *ctx; isl_vec *strides; build = isl_ast_build_cow(build); if (!build || !build->domain) goto error; ctx = isl_ast_build_get_ctx(build); strides = isl_vec_alloc(ctx, isl_space_dim(space, isl_dim_set)); strides = isl_vec_set_si(strides, 1); isl_vec_free(build->strides); build->strides = strides; space = isl_space_map_from_set(space); isl_multi_aff_free(build->offsets); build->offsets = isl_multi_aff_zero(isl_space_copy(space)); isl_multi_aff_free(build->values); build->values = isl_multi_aff_identity(space); if (!build->iterators || !build->domain || !build->generated || !build->pending || !build->values || !build->strides || !build->offsets || !build->options) return isl_ast_build_free(build); return build; error: isl_space_free(space); return isl_ast_build_free(build); } /* Return an isl_id called "c%d", with "%d" set to "i". * If an isl_id with such a name already appears among the parameters * in build->domain, then adjust the name to "c%d_%d". */ static __isl_give isl_id *generate_name(isl_ctx *ctx, int i, __isl_keep isl_ast_build *build) { int j; char name[16]; isl_set *dom = build->domain; snprintf(name, sizeof(name), "c%d", i); j = 0; while (isl_set_find_dim_by_name(dom, isl_dim_param, name) >= 0) snprintf(name, sizeof(name), "c%d_%d", i, j++); return isl_id_alloc(ctx, name, NULL); } /* Create an isl_ast_build with "set" as domain. * * The input set is usually a parameter domain, but we currently allow it to * be any kind of set. We set the domain of the returned isl_ast_build * to "set" and initialize all the other field to default values. */ __isl_give isl_ast_build *isl_ast_build_from_context(__isl_take isl_set *set) { int i, n; isl_ctx *ctx; isl_space *space; isl_ast_build *build; set = isl_set_compute_divs(set); if (!set) return NULL; ctx = isl_set_get_ctx(set); build = isl_calloc_type(ctx, isl_ast_build); if (!build) goto error; build->ref = 1; build->domain = set; build->generated = isl_set_copy(build->domain); build->pending = isl_set_universe(isl_set_get_space(build->domain)); build->options = isl_union_map_empty(isl_space_params_alloc(ctx, 0)); n = isl_set_dim(set, isl_dim_set); build->depth = n; build->iterators = isl_id_list_alloc(ctx, n); for (i = 0; i < n; ++i) { isl_id *id; if (isl_set_has_dim_id(set, isl_dim_set, i)) id = isl_set_get_dim_id(set, isl_dim_set, i); else id = generate_name(ctx, i, build); build->iterators = isl_id_list_add(build->iterators, id); } space = isl_set_get_space(set); if (isl_space_is_params(space)) space = isl_space_set_from_params(space); return isl_ast_build_init_derived(build, space); error: isl_set_free(set); return NULL; } __isl_give isl_ast_build *isl_ast_build_copy(__isl_keep isl_ast_build *build) { if (!build) return NULL; build->ref++; return build; } __isl_give isl_ast_build *isl_ast_build_dup(__isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_ast_build *dup; if (!build) return NULL; ctx = isl_ast_build_get_ctx(build); dup = isl_calloc_type(ctx, isl_ast_build); if (!dup) return NULL; dup->ref = 1; dup->outer_pos = build->outer_pos; dup->depth = build->depth; dup->iterators = isl_id_list_copy(build->iterators); dup->domain = isl_set_copy(build->domain); dup->generated = isl_set_copy(build->generated); dup->pending = isl_set_copy(build->pending); dup->values = isl_multi_aff_copy(build->values); dup->value = isl_pw_aff_copy(build->value); dup->strides = isl_vec_copy(build->strides); dup->offsets = isl_multi_aff_copy(build->offsets); dup->executed = isl_union_map_copy(build->executed); dup->single_valued = build->single_valued; dup->options = isl_union_map_copy(build->options); dup->at_each_domain = build->at_each_domain; dup->at_each_domain_user = build->at_each_domain_user; dup->before_each_for = build->before_each_for; dup->before_each_for_user = build->before_each_for_user; dup->after_each_for = build->after_each_for; dup->after_each_for_user = build->after_each_for_user; dup->create_leaf = build->create_leaf; dup->create_leaf_user = build->create_leaf_user; if (!dup->iterators || !dup->domain || !dup->generated || !dup->pending || !dup->values || !dup->strides || !dup->offsets || !dup->options || (build->executed && !dup->executed) || (build->value && !dup->value)) return isl_ast_build_free(dup); return dup; } /* Align the parameters of "build" to those of "model", introducing * additional parameters if needed. */ __isl_give isl_ast_build *isl_ast_build_align_params( __isl_take isl_ast_build *build, __isl_take isl_space *model) { build = isl_ast_build_cow(build); if (!build) goto error; build->domain = isl_set_align_params(build->domain, isl_space_copy(model)); build->generated = isl_set_align_params(build->generated, isl_space_copy(model)); build->pending = isl_set_align_params(build->pending, isl_space_copy(model)); build->values = isl_multi_aff_align_params(build->values, isl_space_copy(model)); build->offsets = isl_multi_aff_align_params(build->offsets, isl_space_copy(model)); build->options = isl_union_map_align_params(build->options, isl_space_copy(model)); isl_space_free(model); if (!build->domain || !build->values || !build->offsets || !build->options) return isl_ast_build_free(build); return build; error: isl_space_free(model); return NULL; } __isl_give isl_ast_build *isl_ast_build_cow(__isl_take isl_ast_build *build) { if (!build) return NULL; if (build->ref == 1) return build; build->ref--; return isl_ast_build_dup(build); } void *isl_ast_build_free(__isl_take isl_ast_build *build) { if (!build) return NULL; if (--build->ref > 0) return NULL; isl_id_list_free(build->iterators); isl_set_free(build->domain); isl_set_free(build->generated); isl_set_free(build->pending); isl_multi_aff_free(build->values); isl_pw_aff_free(build->value); isl_vec_free(build->strides); isl_multi_aff_free(build->offsets); isl_multi_aff_free(build->schedule_map); isl_union_map_free(build->executed); isl_union_map_free(build->options); free(build); return NULL; } isl_ctx *isl_ast_build_get_ctx(__isl_keep isl_ast_build *build) { return build ? isl_set_get_ctx(build->domain) : NULL; } /* Replace build->options by "options". */ __isl_give isl_ast_build *isl_ast_build_set_options( __isl_take isl_ast_build *build, __isl_take isl_union_map *options) { build = isl_ast_build_cow(build); if (!build || !options) goto error; isl_union_map_free(build->options); build->options = options; return build; error: isl_union_map_free(options); return isl_ast_build_free(build); } /* Set the iterators for the next code generation. * * If we still have some iterators left from the previous code generation * (if any) or if iterators have already been set by a previous * call to this function, then we remove them first. */ __isl_give isl_ast_build *isl_ast_build_set_iterators( __isl_take isl_ast_build *build, __isl_take isl_id_list *iterators) { int dim, n_it; build = isl_ast_build_cow(build); if (!build) goto error; dim = isl_set_dim(build->domain, isl_dim_set); n_it = isl_id_list_n_id(build->iterators); if (n_it < dim) isl_die(isl_ast_build_get_ctx(build), isl_error_internal, "isl_ast_build in inconsistent state", goto error); if (n_it > dim) build->iterators = isl_id_list_drop(build->iterators, dim, n_it - dim); build->iterators = isl_id_list_concat(build->iterators, iterators); if (!build->iterators) return isl_ast_build_free(build); return build; error: isl_id_list_free(iterators); return isl_ast_build_free(build); } /* Set the "at_each_domain" callback of "build" to "fn". */ __isl_give isl_ast_build *isl_ast_build_set_at_each_domain( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)(__isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user), void *user) { build = isl_ast_build_cow(build); if (!build) return NULL; build->at_each_domain = fn; build->at_each_domain_user = user; return build; } /* Set the "before_each_for" callback of "build" to "fn". */ __isl_give isl_ast_build *isl_ast_build_set_before_each_for( __isl_take isl_ast_build *build, __isl_give isl_id *(*fn)(__isl_keep isl_ast_build *build, void *user), void *user) { build = isl_ast_build_cow(build); if (!build) return NULL; build->before_each_for = fn; build->before_each_for_user = user; return build; } /* Set the "after_each_for" callback of "build" to "fn". */ __isl_give isl_ast_build *isl_ast_build_set_after_each_for( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)(__isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user), void *user) { build = isl_ast_build_cow(build); if (!build) return NULL; build->after_each_for = fn; build->after_each_for_user = user; return build; } /* Set the "create_leaf" callback of "build" to "fn". */ __isl_give isl_ast_build *isl_ast_build_set_create_leaf( __isl_take isl_ast_build *build, __isl_give isl_ast_node *(*fn)(__isl_take isl_ast_build *build, void *user), void *user) { build = isl_ast_build_cow(build); if (!build) return NULL; build->create_leaf = fn; build->create_leaf_user = user; return build; } /* Clear all information that is specific to this code generation * and that is (probably) not meaningful to any nested code generation. */ __isl_give isl_ast_build *isl_ast_build_clear_local_info( __isl_take isl_ast_build *build) { isl_space *space; build = isl_ast_build_cow(build); if (!build) return NULL; space = isl_union_map_get_space(build->options); isl_union_map_free(build->options); build->options = isl_union_map_empty(space); build->at_each_domain = NULL; build->at_each_domain_user = NULL; build->before_each_for = NULL; build->before_each_for_user = NULL; build->after_each_for = NULL; build->after_each_for_user = NULL; build->create_leaf = NULL; build->create_leaf_user = NULL; if (!build->options) return isl_ast_build_free(build); return build; } /* Have any loops been eliminated? * That is, do any of the original schedule dimensions have a fixed * value that has been substituted? */ static int any_eliminated(isl_ast_build *build) { int i; for (i = 0; i < build->depth; ++i) if (isl_ast_build_has_affine_value(build, i)) return 1; return 0; } /* Clear build->schedule_map. * This function should be called whenever anything that might affect * the result of isl_ast_build_get_schedule_map_multi_aff changes. * In particular, it should be called when the depth is changed or * when an iterator is determined to have a fixed value. */ static void isl_ast_build_reset_schedule_map(__isl_keep isl_ast_build *build) { if (!build) return; isl_multi_aff_free(build->schedule_map); build->schedule_map = NULL; } /* Do we need a (non-trivial) schedule map? * That is, is the internal schedule space different from * the external schedule space? * * The internal and external schedule spaces are only the same * if code has been generated for the entire schedule and if none * of the loops have been eliminated. */ __isl_give int isl_ast_build_need_schedule_map(__isl_keep isl_ast_build *build) { int dim; if (!build) return -1; dim = isl_set_dim(build->domain, isl_dim_set); return build->depth != dim || any_eliminated(build); } /* Return a mapping from the internal schedule space to the external * schedule space in the form of an isl_multi_aff. * The internal schedule space originally corresponds to that of the * input schedule. This may change during the code generation if * if isl_ast_build_insert_dim is ever called. * The external schedule space corresponds to the * loops that have been generated. * * Currently, the only difference between the internal schedule domain * and the external schedule domain is that some dimensions are projected * out in the external schedule domain. In particular, the dimensions * for which no code has been generated yet and the dimensions that correspond * to eliminated loops. * * We cache a copy of the schedule_map in build->schedule_map. * The cache is cleared through isl_ast_build_reset_schedule_map * whenever anything changes that might affect the result of this function. */ __isl_give isl_multi_aff *isl_ast_build_get_schedule_map_multi_aff( __isl_keep isl_ast_build *build) { isl_space *space; isl_multi_aff *ma; if (!build) return NULL; if (build->schedule_map) return isl_multi_aff_copy(build->schedule_map); space = isl_ast_build_get_space(build, 1); space = isl_space_map_from_set(space); ma = isl_multi_aff_identity(space); if (isl_ast_build_need_schedule_map(build)) { int i; int dim = isl_set_dim(build->domain, isl_dim_set); ma = isl_multi_aff_drop_dims(ma, isl_dim_out, build->depth, dim - build->depth); for (i = build->depth - 1; i >= 0; --i) if (isl_ast_build_has_affine_value(build, i)) ma = isl_multi_aff_drop_dims(ma, isl_dim_out, i, 1); } build->schedule_map = ma; return isl_multi_aff_copy(build->schedule_map); } /* Return a mapping from the internal schedule space to the external * schedule space in the form of an isl_map. */ __isl_give isl_map *isl_ast_build_get_schedule_map( __isl_keep isl_ast_build *build) { isl_multi_aff *ma; ma = isl_ast_build_get_schedule_map_multi_aff(build); return isl_map_from_multi_aff(ma); } /* Return the position of the dimension in build->domain for which * an AST node is currently being generated. */ int isl_ast_build_get_depth(__isl_keep isl_ast_build *build) { return build ? build->depth : -1; } /* Prepare for generating code for the next level. * In particular, increase the depth and reset any information * that is local to the current depth. */ __isl_give isl_ast_build *isl_ast_build_increase_depth( __isl_take isl_ast_build *build) { build = isl_ast_build_cow(build); if (!build) return NULL; build->depth++; isl_ast_build_reset_schedule_map(build); build->value = isl_pw_aff_free(build->value); return build; } void isl_ast_build_dump(__isl_keep isl_ast_build *build) { if (!build) return; fprintf(stderr, "domain: "); isl_set_dump(build->domain); fprintf(stderr, "generated: "); isl_set_dump(build->generated); fprintf(stderr, "pending: "); isl_set_dump(build->pending); fprintf(stderr, "iterators: "); isl_id_list_dump(build->iterators); fprintf(stderr, "values: "); isl_multi_aff_dump(build->values); if (build->value) { fprintf(stderr, "value: "); isl_pw_aff_dump(build->value); } fprintf(stderr, "strides: "); isl_vec_dump(build->strides); fprintf(stderr, "offsets: "); isl_multi_aff_dump(build->offsets); } /* Initialize "build" for AST construction in schedule space "space" * in the case that build->domain is a parameter set. * * build->iterators is assumed to have been updated already. */ static __isl_give isl_ast_build *isl_ast_build_init( __isl_take isl_ast_build *build, __isl_take isl_space *space) { isl_set *set; build = isl_ast_build_cow(build); if (!build) goto error; set = isl_set_universe(isl_space_copy(space)); build->domain = isl_set_intersect_params(isl_set_copy(set), build->domain); build->pending = isl_set_intersect_params(isl_set_copy(set), build->pending); build->generated = isl_set_intersect_params(set, build->generated); return isl_ast_build_init_derived(build, space); error: isl_ast_build_free(build); isl_space_free(space); return NULL; } /* Assign "aff" to *user and return -1, effectively extracting * the first (and presumably only) affine expression in the isl_pw_aff * on which this function is used. */ static int extract_single_piece(__isl_take isl_set *set, __isl_take isl_aff *aff, void *user) { isl_aff **p = user; *p = aff; isl_set_free(set); return -1; } /* Check if the given bounds on the current dimension imply that * this current dimension attains only a single value (in terms of * parameters and outer dimensions). * If so, we record it in build->value. * If, moreover, this value can be represented as a single affine expression, * then we also update build->values, effectively marking the current * dimension as "eliminated". * * When computing the gist of the fixed value that can be represented * as a single affine expression, it is important to only take into * account the domain constraints in the original AST build and * not the domain of the affine expression itself. * Otherwise, a [i/3] is changed into a i/3 because we know that i * is a multiple of 3, but then we end up not expressing anywhere * in the context that i is a multiple of 3. */ static __isl_give isl_ast_build *update_values( __isl_take isl_ast_build *build, __isl_take isl_basic_set *bounds) { int sv; isl_pw_multi_aff *pma; isl_aff *aff = NULL; isl_map *it_map; isl_set *set; set = isl_set_from_basic_set(bounds); set = isl_set_intersect(set, isl_set_copy(build->domain)); it_map = isl_ast_build_map_to_iterator(build, set); sv = isl_map_is_single_valued(it_map); if (sv < 0) build = isl_ast_build_free(build); if (!build || !sv) { isl_map_free(it_map); return build; } pma = isl_pw_multi_aff_from_map(it_map); build->value = isl_pw_multi_aff_get_pw_aff(pma, 0); build->value = isl_ast_build_compute_gist_pw_aff(build, build->value); build->value = isl_pw_aff_coalesce(build->value); isl_pw_multi_aff_free(pma); if (!build->value) return isl_ast_build_free(build); if (isl_pw_aff_n_piece(build->value) != 1) return build; isl_pw_aff_foreach_piece(build->value, &extract_single_piece, &aff); build->values = isl_multi_aff_set_aff(build->values, build->depth, aff); if (!build->values) return isl_ast_build_free(build); isl_ast_build_reset_schedule_map(build); return build; } /* Update the AST build based on the given loop bounds for * the current dimension. * * We first make sure that the bounds do not refer to any iterators * that have already been eliminated. * Then, we check if the bounds imply that the current iterator * has a fixed value. * If they do and if this fixed value can be expressed as a single * affine expression, we eliminate the iterators from the bounds. * Note that we cannot simply plug in this single value using * isl_basic_set_preimage_multi_aff as the single value may only * be defined on a subset of the domain. Plugging in the value * would restrict the build domain to this subset, while this * restriction may not be reflected in the generated code. * build->domain may, however, already refer to the current dimension * due an earlier call to isl_ast_build_include_stride. If so, we need * to eliminate the dimension so that we do not introduce it in any other sets. * Finally, we intersect build->domain with the updated bounds. * * Note that the check for a fixed value in update_values requires * us to intersect the bounds with the current build domain. * When we intersect build->domain with the updated bounds in * the final step, we make sure that these updated bounds have * not been intersected with the old build->domain. * Otherwise, we would indirectly intersect the build domain with itself, * which can lead to inefficiencies, in particular if the build domain * contains any unknown divs. */ __isl_give isl_ast_build *isl_ast_build_set_loop_bounds( __isl_take isl_ast_build *build, __isl_take isl_basic_set *bounds) { isl_set *set; build = isl_ast_build_cow(build); if (!build) goto error; bounds = isl_basic_set_preimage_multi_aff(bounds, isl_multi_aff_copy(build->values)); build = update_values(build, isl_basic_set_copy(bounds)); if (!build) goto error; set = isl_set_from_basic_set(isl_basic_set_copy(bounds)); if (isl_ast_build_has_affine_value(build, build->depth)) { set = isl_set_eliminate(set, isl_dim_set, build->depth, 1); set = isl_set_compute_divs(set); build->pending = isl_set_intersect(build->pending, isl_set_copy(set)); if (isl_ast_build_has_stride(build, build->depth)) { build->domain = isl_set_eliminate(build->domain, isl_dim_set, build->depth, 1); build->domain = isl_set_compute_divs(build->domain); } } else { isl_basic_set *generated, *pending; pending = isl_basic_set_copy(bounds); pending = isl_basic_set_drop_constraints_involving_dims(pending, isl_dim_set, build->depth, 1); build->pending = isl_set_intersect(build->pending, isl_set_from_basic_set(pending)); generated = isl_basic_set_copy(bounds); generated = isl_basic_set_drop_constraints_not_involving_dims( generated, isl_dim_set, build->depth, 1); build->generated = isl_set_intersect(build->generated, isl_set_from_basic_set(generated)); } isl_basic_set_free(bounds); build->domain = isl_set_intersect(build->domain, set); if (!build->domain || !build->pending || !build->generated) return isl_ast_build_free(build); return build; error: isl_ast_build_free(build); isl_basic_set_free(bounds); return NULL; } /* Update build->domain based on the constraints enforced by inner loops. * * The constraints in build->pending may end up not getting generated * if they are implied by "enforced". We therefore reconstruct * build->domain from build->generated and build->pending, dropping * those constraint in build->pending that may not get generated. */ __isl_give isl_ast_build *isl_ast_build_set_enforced( __isl_take isl_ast_build *build, __isl_take isl_basic_set *enforced) { isl_set *set; build = isl_ast_build_cow(build); if (!build) goto error; set = isl_set_from_basic_set(enforced); set = isl_set_gist(isl_set_copy(build->pending), set); set = isl_set_intersect(isl_set_copy(build->generated), set); isl_set_free(build->domain); build->domain = set; if (!build->domain) return isl_ast_build_free(build); return build; error: isl_basic_set_free(enforced); return isl_ast_build_free(build); } /* Intersect build->domain with "set", where "set" is specified * in terms of the internal schedule domain. */ static __isl_give isl_ast_build *isl_ast_build_restrict_internal( __isl_take isl_ast_build *build, __isl_take isl_set *set) { build = isl_ast_build_cow(build); if (!build) goto error; set = isl_set_compute_divs(set); build->domain = isl_set_intersect(build->domain, set); build->domain = isl_set_coalesce(build->domain); if (!build->domain) return isl_ast_build_free(build); return build; error: isl_ast_build_free(build); isl_set_free(set); return NULL; } /* Intersect build->generated and build->domain with "set", * where "set" is specified in terms of the internal schedule domain. */ __isl_give isl_ast_build *isl_ast_build_restrict_generated( __isl_take isl_ast_build *build, __isl_take isl_set *set) { set = isl_set_compute_divs(set); build = isl_ast_build_restrict_internal(build, isl_set_copy(set)); build = isl_ast_build_cow(build); if (!build) goto error; build->generated = isl_set_intersect(build->generated, set); build->generated = isl_set_coalesce(build->generated); if (!build->generated) return isl_ast_build_free(build); return build; error: isl_ast_build_free(build); isl_set_free(set); return NULL; } /* Intersect build->pending and build->domain with "set", * where "set" is specified in terms of the internal schedule domain. */ __isl_give isl_ast_build *isl_ast_build_restrict_pending( __isl_take isl_ast_build *build, __isl_take isl_set *set) { set = isl_set_compute_divs(set); build = isl_ast_build_restrict_internal(build, isl_set_copy(set)); build = isl_ast_build_cow(build); if (!build) goto error; build->pending = isl_set_intersect(build->pending, set); build->pending = isl_set_coalesce(build->pending); if (!build->pending) return isl_ast_build_free(build); return build; error: isl_ast_build_free(build); isl_set_free(set); return NULL; } /* Intersect build->domain with "set", where "set" is specified * in terms of the external schedule domain. */ __isl_give isl_ast_build *isl_ast_build_restrict( __isl_take isl_ast_build *build, __isl_take isl_set *set) { if (isl_set_is_params(set)) return isl_ast_build_restrict_generated(build, set); if (isl_ast_build_need_schedule_map(build)) { isl_multi_aff *ma; ma = isl_ast_build_get_schedule_map_multi_aff(build); set = isl_set_preimage_multi_aff(set, ma); } return isl_ast_build_restrict_generated(build, set); } /* Replace build->executed by "executed". */ __isl_give isl_ast_build *isl_ast_build_set_executed( __isl_take isl_ast_build *build, __isl_take isl_union_map *executed) { build = isl_ast_build_cow(build); if (!build) goto error; isl_union_map_free(build->executed); build->executed = executed; return build; error: isl_ast_build_free(build); isl_union_map_free(executed); return NULL; } /* Return a copy of the current schedule domain. */ __isl_give isl_set *isl_ast_build_get_domain(__isl_keep isl_ast_build *build) { return build ? isl_set_copy(build->domain) : NULL; } /* Return the (schedule) space of "build". * * If "internal" is set, then this space is the space of the internal * representation of the entire schedule, including those parts for * which no code has been generated yet. * * If "internal" is not set, then this space is the external representation * of the loops generated so far. */ __isl_give isl_space *isl_ast_build_get_space(__isl_keep isl_ast_build *build, int internal) { int i; int dim; isl_space *space; if (!build) return NULL; space = isl_set_get_space(build->domain); if (internal) return space; if (!isl_ast_build_need_schedule_map(build)) return space; dim = isl_set_dim(build->domain, isl_dim_set); space = isl_space_drop_dims(space, isl_dim_set, build->depth, dim - build->depth); for (i = build->depth - 1; i >= 0; --i) if (isl_ast_build_has_affine_value(build, i)) space = isl_space_drop_dims(space, isl_dim_set, i, 1); return space; } /* Return the external representation of the schedule space of "build", * i.e., a space with a dimension for each loop generated so far, * with the names of the dimensions set to the loop iterators. */ __isl_give isl_space *isl_ast_build_get_schedule_space( __isl_keep isl_ast_build *build) { isl_space *space; int i, skip; if (!build) return NULL; space = isl_ast_build_get_space(build, 0); skip = 0; for (i = 0; i < build->depth; ++i) { isl_id *id; if (isl_ast_build_has_affine_value(build, i)) { skip++; continue; } id = isl_ast_build_get_iterator_id(build, i); space = isl_space_set_dim_id(space, isl_dim_set, i - skip, id); } return space; } /* Return the current schedule, as stored in build->executed, in terms * of the external schedule domain. */ __isl_give isl_union_map *isl_ast_build_get_schedule( __isl_keep isl_ast_build *build) { isl_union_map *executed; isl_union_map *schedule; if (!build) return NULL; executed = isl_union_map_copy(build->executed); if (isl_ast_build_need_schedule_map(build)) { isl_map *proj = isl_ast_build_get_schedule_map(build); executed = isl_union_map_apply_domain(executed, isl_union_map_from_map(proj)); } schedule = isl_union_map_reverse(executed); return schedule; } /* Return the iterator attached to the internal schedule dimension "pos". */ __isl_give isl_id *isl_ast_build_get_iterator_id( __isl_keep isl_ast_build *build, int pos) { if (!build) return NULL; return isl_id_list_get_id(build->iterators, pos); } /* Set the stride and offset of the current dimension to the given * value and expression. * * If we had already found a stride before, then the two strides * are combined into a single stride. * * In particular, if the new stride information is of the form * * i = f + s (...) * * and the old stride information is of the form * * i = f2 + s2 (...) * * then we compute the extended gcd of s and s2 * * a s + b s2 = g, * * with g = gcd(s,s2), multiply the first equation with t1 = b s2/g * and the second with t2 = a s1/g. * This results in * * i = (b s2 + a s1)/g i = t1 f + t2 f2 + (s s2)/g (...) * * so that t1 f + t2 f2 is the combined offset and (s s2)/g = lcm(s,s2) * is the combined stride. */ static __isl_give isl_ast_build *set_stride(__isl_take isl_ast_build *build, __isl_take isl_val *stride, __isl_take isl_aff *offset) { int pos; build = isl_ast_build_cow(build); if (!build || !stride || !offset) goto error; pos = build->depth; if (isl_ast_build_has_stride(build, pos)) { isl_val *stride2, *a, *b, *g; isl_aff *offset2; stride2 = isl_vec_get_element_val(build->strides, pos); g = isl_val_gcdext(isl_val_copy(stride), isl_val_copy(stride2), &a, &b); a = isl_val_mul(a, isl_val_copy(stride)); a = isl_val_div(a, isl_val_copy(g)); stride2 = isl_val_div(stride2, g); b = isl_val_mul(b, isl_val_copy(stride2)); stride = isl_val_mul(stride, stride2); offset2 = isl_multi_aff_get_aff(build->offsets, pos); offset2 = isl_aff_scale_val(offset2, a); offset = isl_aff_scale_val(offset, b); offset = isl_aff_add(offset, offset2); } build->strides = isl_vec_set_element_val(build->strides, pos, stride); build->offsets = isl_multi_aff_set_aff(build->offsets, pos, offset); if (!build->strides || !build->offsets) return isl_ast_build_free(build); return build; error: isl_val_free(stride); isl_aff_free(offset); return isl_ast_build_free(build); } /* Return a set expressing the stride constraint at the current depth. * * In particular, if the current iterator (i) is known to attain values * * f + s a * * where f is the offset and s is the stride, then the returned set * expresses the constraint * * (f - i) mod s = 0 */ __isl_give isl_set *isl_ast_build_get_stride_constraint( __isl_keep isl_ast_build *build) { isl_aff *aff; isl_set *set; isl_val *stride; int pos; if (!build) return NULL; pos = build->depth; if (!isl_ast_build_has_stride(build, pos)) return isl_set_universe(isl_ast_build_get_space(build, 1)); stride = isl_ast_build_get_stride(build, pos); aff = isl_ast_build_get_offset(build, pos); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, pos, -1); aff = isl_aff_mod_val(aff, stride); set = isl_set_from_basic_set(isl_aff_zero_basic_set(aff)); return set; } /* Return the expansion implied by the stride and offset at the current * depth. * * That is, return the mapping * * [i_0, ..., i_{d-1}, i_d, i_{d+1}, ...] * -> [i_0, ..., i_{d-1}, s * i_d + offset(i), i_{d+1}, ...] * * where s is the stride at the current depth d and offset(i) is * the corresponding offset. */ __isl_give isl_multi_aff *isl_ast_build_get_stride_expansion( __isl_keep isl_ast_build *build) { isl_space *space; isl_multi_aff *ma; int pos; isl_aff *aff, *offset; isl_val *stride; if (!build) return NULL; pos = isl_ast_build_get_depth(build); space = isl_ast_build_get_space(build, 1); space = isl_space_map_from_set(space); ma = isl_multi_aff_identity(space); if (!isl_ast_build_has_stride(build, pos)) return ma; offset = isl_ast_build_get_offset(build, pos); stride = isl_ast_build_get_stride(build, pos); aff = isl_multi_aff_get_aff(ma, pos); aff = isl_aff_scale_val(aff, stride); aff = isl_aff_add(aff, offset); ma = isl_multi_aff_set_aff(ma, pos, aff); return ma; } /* Add constraints corresponding to any previously detected * stride on the current dimension to build->domain. */ __isl_give isl_ast_build *isl_ast_build_include_stride( __isl_take isl_ast_build *build) { isl_set *set; if (!build) return NULL; if (!isl_ast_build_has_stride(build, build->depth)) return build; build = isl_ast_build_cow(build); if (!build) return NULL; set = isl_ast_build_get_stride_constraint(build); build->domain = isl_set_intersect(build->domain, isl_set_copy(set)); build->generated = isl_set_intersect(build->generated, set); if (!build->domain || !build->generated) return isl_ast_build_free(build); return build; } /* Information used inside detect_stride. * * "build" may be updated by detect_stride to include stride information. * "pos" is equal to build->depth. */ struct isl_detect_stride_data { isl_ast_build *build; int pos; }; /* Check if constraint "c" imposes any stride on dimension data->pos * and, if so, update the stride information in data->build. * * In order to impose a stride on the dimension, "c" needs to be an equality * and it needs to involve the dimension. Note that "c" may also be * a div constraint and thus an inequality that we cannot use. * * Let c be of the form * * h(p) + g * v * i + g * stride * f(alpha) = 0 * * with h(p) an expression in terms of the parameters and outer dimensions * and f(alpha) an expression in terms of the existentially quantified * variables. Note that the inner dimensions have been eliminated so * they do not appear in "c". * * If "stride" is not zero and not one, then it represents a non-trivial stride * on "i". We compute a and b such that * * a v + b stride = 1 * * We have * * g v i = -h(p) + g stride f(alpha) * * a g v i = -a h(p) + g stride f(alpha) * * a g v i + b g stride i = -a h(p) + g stride * (...) * * g i = -a h(p) + g stride * (...) * * i = -a h(p)/g + stride * (...) * * The expression "-a h(p)/g" can therefore be used as offset. */ static int detect_stride(__isl_take isl_constraint *c, void *user) { struct isl_detect_stride_data *data = user; int i, n_div; isl_ctx *ctx; isl_val *v, *stride, *m; if (!isl_constraint_is_equality(c) || !isl_constraint_involves_dims(c, isl_dim_set, data->pos, 1)) { isl_constraint_free(c); return 0; } ctx = isl_constraint_get_ctx(c); stride = isl_val_zero(ctx); n_div = isl_constraint_dim(c, isl_dim_div); for (i = 0; i < n_div; ++i) { v = isl_constraint_get_coefficient_val(c, isl_dim_div, i); v = isl_val_gcd(stride, v); } v = isl_constraint_get_coefficient_val(c, isl_dim_set, data->pos); m = isl_val_gcd(isl_val_copy(stride), isl_val_copy(v)); stride = isl_val_div(stride, isl_val_copy(m)); v = isl_val_div(v, isl_val_copy(m)); if (!isl_val_is_zero(stride) && !isl_val_is_one(stride)) { isl_aff *aff; isl_val *gcd, *a, *b; gcd = isl_val_gcdext(v, isl_val_copy(stride), &a, &b); isl_val_free(gcd); isl_val_free(b); aff = isl_constraint_get_aff(c); for (i = 0; i < n_div; ++i) aff = isl_aff_set_coefficient_si(aff, isl_dim_div, i, 0); aff = isl_aff_set_coefficient_si(aff, isl_dim_in, data->pos, 0); a = isl_val_neg(a); aff = isl_aff_scale_val(aff, a); aff = isl_aff_scale_down_val(aff, m); data->build = set_stride(data->build, stride, aff); } else { isl_val_free(stride); isl_val_free(m); isl_val_free(v); } isl_constraint_free(c); return 0; } /* Check if the constraints in "set" imply any stride on the current * dimension and, if so, record the stride information in "build" * and return the updated "build". * * We compute the affine hull and then check if any of the constraints * in the hull imposes any stride on the current dimension. * * We assume that inner dimensions have been eliminated from "set" * by the caller. This is needed because the common stride * may be imposed by different inner dimensions on different parts of * the domain. */ __isl_give isl_ast_build *isl_ast_build_detect_strides( __isl_take isl_ast_build *build, __isl_take isl_set *set) { isl_basic_set *hull; struct isl_detect_stride_data data; if (!build) goto error; data.build = build; data.pos = isl_ast_build_get_depth(build); hull = isl_set_affine_hull(set); if (isl_basic_set_foreach_constraint(hull, &detect_stride, &data) < 0) data.build = isl_ast_build_free(data.build); isl_basic_set_free(hull); return data.build; error: isl_set_free(set); return NULL; } struct isl_ast_build_involves_data { int depth; int involves; }; /* Check if "map" involves the input dimension data->depth. */ static int involves_depth(__isl_take isl_map *map, void *user) { struct isl_ast_build_involves_data *data = user; data->involves = isl_map_involves_dims(map, isl_dim_in, data->depth, 1); isl_map_free(map); if (data->involves < 0 || data->involves) return -1; return 0; } /* Do any options depend on the value of the dimension at the current depth? */ int isl_ast_build_options_involve_depth(__isl_keep isl_ast_build *build) { struct isl_ast_build_involves_data data; if (!build) return -1; data.depth = build->depth; data.involves = 0; if (isl_union_map_foreach_map(build->options, &involves_depth, &data) < 0) { if (data.involves < 0 || !data.involves) return -1; } return data.involves; } /* Construct the map * * { [i] -> [i] : i < pos; [i] -> [i + 1] : i >= pos } * * with "space" the parameter space of the constructed map. */ static __isl_give isl_map *construct_insertion_map(__isl_take isl_space *space, int pos) { isl_constraint *c; isl_basic_map *bmap1, *bmap2; space = isl_space_set_from_params(space); space = isl_space_add_dims(space, isl_dim_set, 1); space = isl_space_map_from_set(space); c = isl_equality_alloc(isl_local_space_from_space(space)); c = isl_constraint_set_coefficient_si(c, isl_dim_in, 0, 1); c = isl_constraint_set_coefficient_si(c, isl_dim_out, 0, -1); bmap1 = isl_basic_map_from_constraint(isl_constraint_copy(c)); c = isl_constraint_set_constant_si(c, 1); bmap2 = isl_basic_map_from_constraint(c); bmap1 = isl_basic_map_upper_bound_si(bmap1, isl_dim_in, 0, pos - 1); bmap2 = isl_basic_map_lower_bound_si(bmap2, isl_dim_in, 0, pos); return isl_basic_map_union(bmap1, bmap2); } static const char *option_str[] = { [atomic] = "atomic", [unroll] = "unroll", [separate] = "separate" }; /* Update the "options" to reflect the insertion of a dimension * at position "pos" in the schedule domain space. * "space" is the original domain space before the insertion and * may be named and/or structured. * * The (relevant) input options all have "space" as domain, which * has to be mapped to the extended space. * The values of the ranges also refer to the schedule domain positions * and they therefore also need to be adjusted. In particular, values * smaller than pos do not need to change, while values greater than or * equal to pos need to be incremented. * That is, we need to apply the following map. * * { atomic[i] -> atomic[i] : i < pos; [i] -> [i + 1] : i >= pos; * unroll[i] -> unroll[i] : i < pos; [i] -> [i + 1] : i >= pos; * separate[i] -> separate[i] : i < pos; [i] -> [i + 1] : i >= pos; * separation_class[[i] -> [c]] * -> separation_class[[i] -> [c]] : i < pos; * separation_class[[i] -> [c]] * -> separation_class[[i + 1] -> [c]] : i >= pos } */ static __isl_give isl_union_map *options_insert_dim( __isl_take isl_union_map *options, __isl_take isl_space *space, int pos) { isl_map *map; isl_union_map *insertion; enum isl_ast_build_domain_type type; const char *name = "separation_class"; space = isl_space_map_from_set(space); map = isl_map_identity(space); map = isl_map_insert_dims(map, isl_dim_out, pos, 1); options = isl_union_map_apply_domain(options, isl_union_map_from_map(map)); if (!options) return NULL; map = construct_insertion_map(isl_union_map_get_space(options), pos); insertion = isl_union_map_empty(isl_union_map_get_space(options)); for (type = atomic; type <= separate; ++type) { isl_map *map_type = isl_map_copy(map); const char *name = option_str[type]; map_type = isl_map_set_tuple_name(map_type, isl_dim_in, name); map_type = isl_map_set_tuple_name(map_type, isl_dim_out, name); insertion = isl_union_map_add_map(insertion, map_type); } map = isl_map_product(map, isl_map_identity(isl_map_get_space(map))); map = isl_map_set_tuple_name(map, isl_dim_in, name); map = isl_map_set_tuple_name(map, isl_dim_out, name); insertion = isl_union_map_add_map(insertion, map); options = isl_union_map_apply_range(options, insertion); return options; } /* Insert a single dimension in the schedule domain at position "pos". * The new dimension is given an isl_id with the empty string as name. * * The main difficulty is updating build->options to reflect the * extra dimension. This is handled in options_insert_dim. * * Note that because of the dimension manipulations, the resulting * schedule domain space will always be unnamed and unstructured. * However, the original schedule domain space may be named and/or * structured, so we have to take this possibility into account * while performing the transformations. */ __isl_give isl_ast_build *isl_ast_build_insert_dim( __isl_take isl_ast_build *build, int pos) { isl_ctx *ctx; isl_space *space, *ma_space; isl_id *id; isl_multi_aff *ma; build = isl_ast_build_cow(build); if (!build) return NULL; ctx = isl_ast_build_get_ctx(build); id = isl_id_alloc(ctx, "", NULL); space = isl_ast_build_get_space(build, 1); build->iterators = isl_id_list_insert(build->iterators, pos, id); build->domain = isl_set_insert_dims(build->domain, isl_dim_set, pos, 1); build->generated = isl_set_insert_dims(build->generated, isl_dim_set, pos, 1); build->pending = isl_set_insert_dims(build->pending, isl_dim_set, pos, 1); build->strides = isl_vec_insert_els(build->strides, pos, 1); build->strides = isl_vec_set_element_si(build->strides, pos, 1); ma_space = isl_space_params(isl_multi_aff_get_space(build->offsets)); ma_space = isl_space_set_from_params(ma_space); ma_space = isl_space_add_dims(ma_space, isl_dim_set, 1); ma_space = isl_space_map_from_set(ma_space); ma = isl_multi_aff_zero(isl_space_copy(ma_space)); build->offsets = isl_multi_aff_splice(build->offsets, pos, pos, ma); ma = isl_multi_aff_identity(ma_space); build->values = isl_multi_aff_splice(build->values, pos, pos, ma); build->options = options_insert_dim(build->options, space, pos); if (!build->iterators || !build->domain || !build->generated || !build->pending || !build->values || !build->strides || !build->offsets || !build->options) return isl_ast_build_free(build); return build; } /* Scale down the current dimension by a factor of "m". * "umap" is an isl_union_map that implements the scaling down. * That is, it is of the form * * { [.... i ....] -> [.... i' ....] : i = m i' } * * This function is called right after the strides have been * detected, but before any constraints on the current dimension * have been included in build->domain. * We therefore only need to update stride, offset and the options. */ __isl_give isl_ast_build *isl_ast_build_scale_down( __isl_take isl_ast_build *build, __isl_take isl_val *m, __isl_take isl_union_map *umap) { isl_aff *aff; isl_val *v; int depth; build = isl_ast_build_cow(build); if (!build || !umap || !m) goto error; depth = build->depth; v = isl_vec_get_element_val(build->strides, depth); v = isl_val_div(v, isl_val_copy(m)); build->strides = isl_vec_set_element_val(build->strides, depth, v); aff = isl_multi_aff_get_aff(build->offsets, depth); aff = isl_aff_scale_down_val(aff, m); build->offsets = isl_multi_aff_set_aff(build->offsets, depth, aff); build->options = isl_union_map_apply_domain(build->options, umap); if (!build->strides || !build->offsets || !build->options) return isl_ast_build_free(build); return build; error: isl_val_free(m); isl_union_map_free(umap); return isl_ast_build_free(build); } /* Return a list of "n" isl_ids called "c%d", with "%d" starting at "first". * If an isl_id with such a name already appears among the parameters * in build->domain, then adjust the name to "c%d_%d". */ static __isl_give isl_id_list *generate_names(isl_ctx *ctx, int n, int first, __isl_keep isl_ast_build *build) { int i; isl_id_list *names; names = isl_id_list_alloc(ctx, n); for (i = 0; i < n; ++i) { isl_id *id; id = generate_name(ctx, first + i, build); names = isl_id_list_add(names, id); } return names; } /* Embed "options" into the given isl_ast_build space. * * This function is called from within a nested call to * isl_ast_build_ast_from_schedule. * "options" refers to the additional schedule, * while space refers to both the space of the outer isl_ast_build and * that of the additional schedule. * Specifically, space is of the form * * [I -> S] * * while options lives in the space(s) * * S -> * * * We compute * * [I -> S] -> S * * and compose this with options, to obtain the new options * living in the space(s) * * [I -> S] -> * */ static __isl_give isl_union_map *embed_options( __isl_take isl_union_map *options, __isl_take isl_space *space) { isl_map *map; map = isl_map_universe(isl_space_unwrap(space)); map = isl_map_range_map(map); options = isl_union_map_apply_range( isl_union_map_from_map(map), options); return options; } /* Update "build" for use in a (possibly nested) code generation. That is, * extend "build" from an AST build on some domain O to an AST build * on domain [O -> S], with S corresponding to "space". * If the original domain is a parameter domain, then the new domain is * simply S. * "iterators" is a list of iterators for S, but the number of elements * may be smaller or greater than the number of set dimensions of S. * If "keep_iterators" is set, then any extra ids in build->iterators * are reused for S. Otherwise, these extra ids are dropped. * * We first update build->outer_pos to the current depth. * This depth is zero in case this is the outermost code generation. * * We then add additional ids such that the number of iterators is at least * equal to the dimension of the new build domain. * * If the original domain is parametric, then we are constructing * an isl_ast_build for the outer code generation and we pass control * to isl_ast_build_init. * * Otherwise, we adjust the fields of "build" to include "space". */ __isl_give isl_ast_build *isl_ast_build_product( __isl_take isl_ast_build *build, __isl_take isl_space *space) { isl_ctx *ctx; isl_vec *strides; isl_set *set; isl_multi_aff *embedding; int dim, n_it; build = isl_ast_build_cow(build); if (!build) goto error; build->outer_pos = build->depth; ctx = isl_ast_build_get_ctx(build); dim = isl_set_dim(build->domain, isl_dim_set); dim += isl_space_dim(space, isl_dim_set); n_it = isl_id_list_n_id(build->iterators); if (n_it < dim) { isl_id_list *l; l = generate_names(ctx, dim - n_it, n_it, build); build->iterators = isl_id_list_concat(build->iterators, l); } if (isl_set_is_params(build->domain)) return isl_ast_build_init(build, space); set = isl_set_universe(isl_space_copy(space)); build->domain = isl_set_product(build->domain, isl_set_copy(set)); build->pending = isl_set_product(build->pending, isl_set_copy(set)); build->generated = isl_set_product(build->generated, set); strides = isl_vec_alloc(ctx, isl_space_dim(space, isl_dim_set)); strides = isl_vec_set_si(strides, 1); build->strides = isl_vec_concat(build->strides, strides); space = isl_space_map_from_set(space); build->offsets = isl_multi_aff_align_params(build->offsets, isl_space_copy(space)); build->offsets = isl_multi_aff_product(build->offsets, isl_multi_aff_zero(isl_space_copy(space))); build->values = isl_multi_aff_align_params(build->values, isl_space_copy(space)); embedding = isl_multi_aff_identity(space); build->values = isl_multi_aff_product(build->values, embedding); space = isl_ast_build_get_space(build, 1); build->options = embed_options(build->options, space); if (!build->iterators || !build->domain || !build->generated || !build->pending || !build->values || !build->strides || !build->offsets || !build->options) return isl_ast_build_free(build); return build; error: isl_ast_build_free(build); isl_space_free(space); return NULL; } /* Does "aff" only attain non-negative values over build->domain? * That is, does it not attain any negative values? */ int isl_ast_build_aff_is_nonneg(__isl_keep isl_ast_build *build, __isl_keep isl_aff *aff) { isl_set *test; int empty; if (!build) return -1; aff = isl_aff_copy(aff); test = isl_set_from_basic_set(isl_aff_neg_basic_set(aff)); test = isl_set_intersect(test, isl_set_copy(build->domain)); empty = isl_set_is_empty(test); isl_set_free(test); return empty; } /* Does the dimension at (internal) position "pos" have a non-trivial stride? */ int isl_ast_build_has_stride(__isl_keep isl_ast_build *build, int pos) { isl_val *v; int has_stride; if (!build) return -1; v = isl_vec_get_element_val(build->strides, pos); if (!v) return -1; has_stride = !isl_val_is_one(v); isl_val_free(v); return has_stride; } /* Given that the dimension at position "pos" takes on values * * f + s a * * with a an integer, return s through *stride. */ __isl_give isl_val *isl_ast_build_get_stride(__isl_keep isl_ast_build *build, int pos) { if (!build) return NULL; return isl_vec_get_element_val(build->strides, pos); } /* Given that the dimension at position "pos" takes on values * * f + s a * * with a an integer, return f. */ __isl_give isl_aff *isl_ast_build_get_offset( __isl_keep isl_ast_build *build, int pos) { if (!build) return NULL; return isl_multi_aff_get_aff(build->offsets, pos); } /* Is the dimension at position "pos" known to attain only a single * value that, moreover, can be described by a single affine expression * in terms of the outer dimensions and parameters? * * If not, then the correponding affine expression in build->values * is set to be equal to the same input dimension. * Otherwise, it is set to the requested expression in terms of * outer dimensions and parameters. */ int isl_ast_build_has_affine_value(__isl_keep isl_ast_build *build, int pos) { isl_aff *aff; int involves; if (!build) return -1; aff = isl_multi_aff_get_aff(build->values, pos); involves = isl_aff_involves_dims(aff, isl_dim_in, pos, 1); isl_aff_free(aff); if (involves < 0) return -1; return !involves; } /* Plug in the known values (fixed affine expressions in terms of * parameters and outer loop iterators) of all loop iterators * in the domain of "umap". * * We simply precompose "umap" with build->values. */ __isl_give isl_union_map *isl_ast_build_substitute_values_union_map_domain( __isl_keep isl_ast_build *build, __isl_take isl_union_map *umap) { isl_multi_aff *values; if (!build) return isl_union_map_free(umap); values = isl_multi_aff_copy(build->values); umap = isl_union_map_preimage_domain_multi_aff(umap, values); return umap; } /* Is the current dimension known to attain only a single value? */ int isl_ast_build_has_value(__isl_keep isl_ast_build *build) { if (!build) return -1; return build->value != NULL; } /* Simplify the basic set "bset" based on what we know about * the iterators of already generated loops. * * "bset" is assumed to live in the (internal) schedule domain. */ __isl_give isl_basic_set *isl_ast_build_compute_gist_basic_set( __isl_keep isl_ast_build *build, __isl_take isl_basic_set *bset) { if (!build) goto error; bset = isl_basic_set_preimage_multi_aff(bset, isl_multi_aff_copy(build->values)); bset = isl_basic_set_gist(bset, isl_set_simple_hull(isl_set_copy(build->domain))); return bset; error: isl_basic_set_free(bset); return NULL; } /* Simplify the set "set" based on what we know about * the iterators of already generated loops. * * "set" is assumed to live in the (internal) schedule domain. */ __isl_give isl_set *isl_ast_build_compute_gist( __isl_keep isl_ast_build *build, __isl_take isl_set *set) { if (!build) goto error; set = isl_set_preimage_multi_aff(set, isl_multi_aff_copy(build->values)); set = isl_set_gist(set, isl_set_copy(build->domain)); return set; error: isl_set_free(set); return NULL; } /* Simplify the map "map" based on what we know about * the iterators of already generated loops. * * The domain of "map" is assumed to live in the (internal) schedule domain. */ __isl_give isl_map *isl_ast_build_compute_gist_map_domain( __isl_keep isl_ast_build *build, __isl_take isl_map *map) { if (!build) goto error; map = isl_map_gist_domain(map, isl_set_copy(build->domain)); return map; error: isl_map_free(map); return NULL; } /* Simplify the affine expression "aff" based on what we know about * the iterators of already generated loops. * * The domain of "aff" is assumed to live in the (internal) schedule domain. */ __isl_give isl_aff *isl_ast_build_compute_gist_aff( __isl_keep isl_ast_build *build, __isl_take isl_aff *aff) { if (!build) goto error; aff = isl_aff_gist(aff, isl_set_copy(build->domain)); return aff; error: isl_aff_free(aff); return NULL; } /* Simplify the piecewise affine expression "aff" based on what we know about * the iterators of already generated loops. * * The domain of "pa" is assumed to live in the (internal) schedule domain. */ __isl_give isl_pw_aff *isl_ast_build_compute_gist_pw_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_aff *pa) { if (!build) goto error; if (!isl_set_is_params(build->domain)) pa = isl_pw_aff_pullback_multi_aff(pa, isl_multi_aff_copy(build->values)); pa = isl_pw_aff_gist(pa, isl_set_copy(build->domain)); return pa; error: isl_pw_aff_free(pa); return NULL; } /* Simplify the piecewise multi-affine expression "aff" based on what * we know about the iterators of already generated loops. * * The domain of "pma" is assumed to live in the (internal) schedule domain. */ __isl_give isl_pw_multi_aff *isl_ast_build_compute_gist_pw_multi_aff( __isl_keep isl_ast_build *build, __isl_take isl_pw_multi_aff *pma) { if (!build) goto error; pma = isl_pw_multi_aff_pullback_multi_aff(pma, isl_multi_aff_copy(build->values)); pma = isl_pw_multi_aff_gist(pma, isl_set_copy(build->domain)); return pma; error: isl_pw_multi_aff_free(pma); return NULL; } /* Extract the schedule domain of the given type from build->options * at the current depth. * * In particular, find the subset of build->options that is of * the following form * * schedule_domain -> type[depth] * * and return the corresponding domain, after eliminating inner dimensions * and divs that depend on the current dimension. * * Note that the domain of build->options has been reformulated * in terms of the internal build space in embed_options, * but the position is still that within the current code generation. */ __isl_give isl_set *isl_ast_build_get_option_domain( __isl_keep isl_ast_build *build, enum isl_ast_build_domain_type type) { const char *name; isl_space *space; isl_map *option; isl_set *domain; int local_pos; if (!build) return NULL; name = option_str[type]; local_pos = build->depth - build->outer_pos; space = isl_ast_build_get_space(build, 1); space = isl_space_from_domain(space); space = isl_space_add_dims(space, isl_dim_out, 1); space = isl_space_set_tuple_name(space, isl_dim_out, name); option = isl_union_map_extract_map(build->options, space); option = isl_map_fix_si(option, isl_dim_out, 0, local_pos); domain = isl_map_domain(option); domain = isl_ast_build_eliminate(build, domain); return domain; } /* Extract the separation class mapping at the current depth. * * In particular, find and return the subset of build->options that is of * the following form * * schedule_domain -> separation_class[[depth] -> [class]] * * The caller is expected to eliminate inner dimensions from the domain. * * Note that the domain of build->options has been reformulated * in terms of the internal build space in embed_options, * but the position is still that within the current code generation. */ __isl_give isl_map *isl_ast_build_get_separation_class( __isl_keep isl_ast_build *build) { isl_ctx *ctx; isl_space *space_sep, *space; isl_map *res; int local_pos; if (!build) return NULL; local_pos = build->depth - build->outer_pos; ctx = isl_ast_build_get_ctx(build); space_sep = isl_space_alloc(ctx, 0, 1, 1); space_sep = isl_space_wrap(space_sep); space_sep = isl_space_set_tuple_name(space_sep, isl_dim_set, "separation_class"); space = isl_ast_build_get_space(build, 1); space_sep = isl_space_align_params(space_sep, isl_space_copy(space)); space = isl_space_map_from_domain_and_range(space, space_sep); res = isl_union_map_extract_map(build->options, space); res = isl_map_fix_si(res, isl_dim_out, 0, local_pos); res = isl_map_coalesce(res); return res; } /* Eliminate dimensions inner to the current dimension. */ __isl_give isl_set *isl_ast_build_eliminate_inner( __isl_keep isl_ast_build *build, __isl_take isl_set *set) { int dim; int depth; if (!build) return isl_set_free(set); dim = isl_set_dim(set, isl_dim_set); depth = build->depth; set = isl_set_detect_equalities(set); set = isl_set_eliminate(set, isl_dim_set, depth + 1, dim - (depth + 1)); return set; } /* Eliminate unknown divs and divs that depend on the current dimension. * * Note that during the elimination of unknown divs, we may discover * an explicit representation of some other unknown divs, which may * depend on the current dimension. We therefore need to eliminate * unknown divs first. */ __isl_give isl_set *isl_ast_build_eliminate_divs( __isl_keep isl_ast_build *build, __isl_take isl_set *set) { int depth; if (!build) return isl_set_free(set); set = isl_set_remove_unknown_divs(set); depth = build->depth; set = isl_set_remove_divs_involving_dims(set, isl_dim_set, depth, 1); return set; } /* Eliminate dimensions inner to the current dimension as well as * unknown divs and divs that depend on the current dimension. * The result then consists only of constraints that are independent * of the current dimension and upper and lower bounds on the current * dimension. */ __isl_give isl_set *isl_ast_build_eliminate( __isl_keep isl_ast_build *build, __isl_take isl_set *domain) { domain = isl_ast_build_eliminate_inner(build, domain); domain = isl_ast_build_eliminate_divs(build, domain); return domain; } /* Replace build->single_valued by "sv". */ __isl_give isl_ast_build *isl_ast_build_set_single_valued( __isl_take isl_ast_build *build, int sv) { if (!build) return build; if (build->single_valued == sv) return build; build = isl_ast_build_cow(build); if (!build) return build; build->single_valued = sv; return build; } cloog-0.18.2/isl/isl_test.c0000664000175000017500000040344112254313240012413 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define ARRAY_SIZE(array) (sizeof(array)/sizeof(*array)) static char *srcdir; static char *get_filename(isl_ctx *ctx, const char *name, const char *suffix) { char *filename; int length; char *pattern = "%s/test_inputs/%s.%s"; length = strlen(pattern) - 6 + strlen(srcdir) + strlen(name) + strlen(suffix) + 1; filename = isl_alloc_array(ctx, char, length); if (!filename) return NULL; sprintf(filename, pattern, srcdir, name, suffix); return filename; } void test_parse_map(isl_ctx *ctx, const char *str) { isl_map *map; map = isl_map_read_from_str(ctx, str); assert(map); isl_map_free(map); } int test_parse_map_equal(isl_ctx *ctx, const char *str, const char *str2) { isl_map *map, *map2; int equal; map = isl_map_read_from_str(ctx, str); map2 = isl_map_read_from_str(ctx, str2); equal = isl_map_is_equal(map, map2); isl_map_free(map); isl_map_free(map2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "maps not equal", return -1); return 0; } void test_parse_pwqp(isl_ctx *ctx, const char *str) { isl_pw_qpolynomial *pwqp; pwqp = isl_pw_qpolynomial_read_from_str(ctx, str); assert(pwqp); isl_pw_qpolynomial_free(pwqp); } static void test_parse_pwaff(isl_ctx *ctx, const char *str) { isl_pw_aff *pwaff; pwaff = isl_pw_aff_read_from_str(ctx, str); assert(pwaff); isl_pw_aff_free(pwaff); } int test_parse(struct isl_ctx *ctx) { isl_map *map, *map2; const char *str, *str2; str = "{ [i] -> [-i] }"; map = isl_map_read_from_str(ctx, str); assert(map); isl_map_free(map); str = "{ A[i] -> L[([i/3])] }"; map = isl_map_read_from_str(ctx, str); assert(map); isl_map_free(map); test_parse_map(ctx, "{[[s] -> A[i]] -> [[s+1] -> A[i]]}"); test_parse_map(ctx, "{ [p1, y1, y2] -> [2, y1, y2] : " "p1 = 1 && (y1 <= y2 || y2 = 0) }"); str = "{ [x,y] : [([x/2]+y)/3] >= 1 }"; str2 = "{ [x, y] : 2y >= 6 - x }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; if (test_parse_map_equal(ctx, "{ [x,y] : x <= min(y, 2*y+3) }", "{ [x,y] : x <= y, 2*y + 3 }") < 0) return -1; str = "{ [x, y] : (y <= x and y >= -3) or (2y <= -3 + x and y <= -4) }"; if (test_parse_map_equal(ctx, "{ [x,y] : x >= min(y, 2*y+3) }", str) < 0) return -1; str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}"; map = isl_map_read_from_str(ctx, str); str = "{ [new, old] -> [o0, o1] : " "exists (e0 = [(-1 - new + o0)/2], e1 = [(-1 - old + o1)/2]: " "2e0 = -1 - new + o0 and 2e1 = -1 - old + o1 and o0 >= 0 and " "o0 <= 1 and o1 >= 0 and o1 <= 1) }"; map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "{[new,old] -> [new+1-2*[(new+1)/2],old+1-2*[(old+1)/2]]}"; map = isl_map_read_from_str(ctx, str); str = "{[new,old] -> [(new+1)%2,(old+1)%2]}"; map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "[n] -> { [c1] : c1>=0 and c1<=floord(n-4,3) }"; str2 = "[n] -> { [c1] : c1 >= 0 and 3c1 <= -4 + n }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "{ [i,j] -> [i] : i < j; [i,j] -> [j] : j <= i }"; str2 = "{ [i,j] -> [min(i,j)] }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "{ [i,j] : i != j }"; str2 = "{ [i,j] : i < j or i > j }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "{ [i,j] : (i+1)*2 >= j }"; str2 = "{ [i, j] : j <= 2 + 2i }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "{ [i] -> [i > 0 ? 4 : 5] }"; str2 = "{ [i] -> [5] : i <= 0; [i] -> [4] : i >= 1 }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "[N=2,M] -> { [i=[(M+N)/4]] }"; str2 = "[N, M] -> { [i] : N = 2 and 4i <= 2 + M and 4i >= -1 + M }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "{ [x] : x >= 0 }"; str2 = "{ [x] : x-0 >= 0 }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "{ [i] : ((i > 10)) }"; str2 = "{ [i] : i >= 11 }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; str = "{ [i] -> [0] }"; str2 = "{ [i] -> [0 * i] }"; if (test_parse_map_equal(ctx, str, str2) < 0) return -1; test_parse_pwqp(ctx, "{ [i] -> i + [ (i + [i/3])/2 ] }"); test_parse_map(ctx, "{ S1[i] -> [([i/10]),i%10] : 0 <= i <= 45 }"); test_parse_pwaff(ctx, "{ [i] -> [i + 1] : i > 0; [a] -> [a] : a < 0 }"); test_parse_pwqp(ctx, "{ [x] -> ([(x)/2] * [(x)/3]) }"); if (test_parse_map_equal(ctx, "{ [a] -> [b] : (not false) }", "{ [a] -> [b] : true }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [i] : i/2 <= 5 }", "{ [i] : i <= 10 }") < 0) return -1; if (test_parse_map_equal(ctx, "{Sym=[n] [i] : i <= n }", "[n] -> { [i] : i <= n }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [*] }", "{ [a] }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [i] : 2*floor(i/2) = i }", "{ [i] : exists a : i = 2 a }") < 0) return -1; if (test_parse_map_equal(ctx, "{ [a] -> [b] : a = 5 implies b = 5 }", "{ [a] -> [b] : a != 5 or b = 5 }") < 0) return -1; return 0; } void test_read(struct isl_ctx *ctx) { char *filename; FILE *input; struct isl_basic_set *bset1, *bset2; const char *str = "{[y]: Exists ( alpha : 2alpha = y)}"; filename = get_filename(ctx, "set", "omega"); assert(filename); input = fopen(filename, "r"); assert(input); bset1 = isl_basic_set_read_from_file(ctx, input); bset2 = isl_basic_set_read_from_str(ctx, str); assert(isl_basic_set_is_equal(bset1, bset2) == 1); isl_basic_set_free(bset1); isl_basic_set_free(bset2); free(filename); fclose(input); } void test_bounded(struct isl_ctx *ctx) { isl_set *set; int bounded; set = isl_set_read_from_str(ctx, "[n] -> {[i] : 0 <= i <= n }"); bounded = isl_set_is_bounded(set); assert(bounded); isl_set_free(set); set = isl_set_read_from_str(ctx, "{[n, i] : 0 <= i <= n }"); bounded = isl_set_is_bounded(set); assert(!bounded); isl_set_free(set); set = isl_set_read_from_str(ctx, "[n] -> {[i] : i <= n }"); bounded = isl_set_is_bounded(set); assert(!bounded); isl_set_free(set); } /* Construct the basic set { [i] : 5 <= i <= N } */ void test_construction(struct isl_ctx *ctx) { isl_int v; isl_space *dim; isl_local_space *ls; struct isl_basic_set *bset; struct isl_constraint *c; isl_int_init(v); dim = isl_space_set_alloc(ctx, 1, 1); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_inequality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_param, 0, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_inequality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -5); isl_constraint_set_constant(c, v); bset = isl_basic_set_add_constraint(bset, c); isl_local_space_free(ls); isl_basic_set_free(bset); isl_int_clear(v); } void test_dim(struct isl_ctx *ctx) { const char *str; isl_map *map1, *map2; map1 = isl_map_read_from_str(ctx, "[n] -> { [i] -> [j] : exists (a = [i/10] : i - 10a <= n ) }"); map1 = isl_map_add_dims(map1, isl_dim_in, 1); map2 = isl_map_read_from_str(ctx, "[n] -> { [i,k] -> [j] : exists (a = [i/10] : i - 10a <= n ) }"); assert(isl_map_is_equal(map1, map2)); isl_map_free(map2); map1 = isl_map_project_out(map1, isl_dim_in, 0, 1); map2 = isl_map_read_from_str(ctx, "[n] -> { [i] -> [j] : n >= 0 }"); assert(isl_map_is_equal(map1, map2)); isl_map_free(map1); isl_map_free(map2); str = "[n] -> { [i] -> [] : exists a : 0 <= i <= n and i = 2 a }"; map1 = isl_map_read_from_str(ctx, str); str = "{ [i] -> [j] : exists a : 0 <= i <= j and i = 2 a }"; map2 = isl_map_read_from_str(ctx, str); map1 = isl_map_move_dims(map1, isl_dim_out, 0, isl_dim_param, 0, 1); assert(isl_map_is_equal(map1, map2)); isl_map_free(map1); isl_map_free(map2); } struct { __isl_give isl_val *(*op)(__isl_take isl_val *v); const char *arg; const char *res; } val_un_tests[] = { { &isl_val_neg, "0", "0" }, { &isl_val_abs, "0", "0" }, { &isl_val_2exp, "0", "1" }, { &isl_val_floor, "0", "0" }, { &isl_val_ceil, "0", "0" }, { &isl_val_neg, "1", "-1" }, { &isl_val_neg, "-1", "1" }, { &isl_val_neg, "1/2", "-1/2" }, { &isl_val_neg, "-1/2", "1/2" }, { &isl_val_neg, "infty", "-infty" }, { &isl_val_neg, "-infty", "infty" }, { &isl_val_neg, "NaN", "NaN" }, { &isl_val_abs, "1", "1" }, { &isl_val_abs, "-1", "1" }, { &isl_val_abs, "1/2", "1/2" }, { &isl_val_abs, "-1/2", "1/2" }, { &isl_val_abs, "infty", "infty" }, { &isl_val_abs, "-infty", "infty" }, { &isl_val_abs, "NaN", "NaN" }, { &isl_val_floor, "1", "1" }, { &isl_val_floor, "-1", "-1" }, { &isl_val_floor, "1/2", "0" }, { &isl_val_floor, "-1/2", "-1" }, { &isl_val_floor, "infty", "infty" }, { &isl_val_floor, "-infty", "-infty" }, { &isl_val_floor, "NaN", "NaN" }, { &isl_val_ceil, "1", "1" }, { &isl_val_ceil, "-1", "-1" }, { &isl_val_ceil, "1/2", "1" }, { &isl_val_ceil, "-1/2", "0" }, { &isl_val_ceil, "infty", "infty" }, { &isl_val_ceil, "-infty", "-infty" }, { &isl_val_ceil, "NaN", "NaN" }, { &isl_val_2exp, "-3", "1/8" }, { &isl_val_2exp, "-1", "1/2" }, { &isl_val_2exp, "1", "2" }, { &isl_val_2exp, "2", "4" }, { &isl_val_2exp, "3", "8" }, }; /* Perform some basic tests of unary operations on isl_val objects. */ static int test_un_val(isl_ctx *ctx) { int i; isl_val *v, *res; __isl_give isl_val *(*fn)(__isl_take isl_val *v); int ok; for (i = 0; i < ARRAY_SIZE(val_un_tests); ++i) { v = isl_val_read_from_str(ctx, val_un_tests[i].arg); res = isl_val_read_from_str(ctx, val_un_tests[i].res); fn = val_un_tests[i].op; v = fn(v); if (isl_val_is_nan(res)) ok = isl_val_is_nan(v); else ok = isl_val_eq(v, res); isl_val_free(v); isl_val_free(res); if (ok < 0) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); } return 0; } struct { __isl_give isl_val *(*fn)(__isl_take isl_val *v1, __isl_take isl_val *v2); } val_bin_op[] = { ['+'] = { &isl_val_add }, ['-'] = { &isl_val_sub }, ['*'] = { &isl_val_mul }, ['/'] = { &isl_val_div }, ['g'] = { &isl_val_gcd }, ['m'] = { &isl_val_min }, ['M'] = { &isl_val_max }, }; struct { const char *arg1; unsigned char op; const char *arg2; const char *res; } val_bin_tests[] = { { "0", '+', "0", "0" }, { "1", '+', "0", "1" }, { "1", '+', "1", "2" }, { "1", '-', "1", "0" }, { "1", '*', "1", "1" }, { "1", '/', "1", "1" }, { "2", '*', "3", "6" }, { "2", '*', "1/2", "1" }, { "2", '*', "1/3", "2/3" }, { "2/3", '*', "3/5", "2/5" }, { "2/3", '*', "7/5", "14/15" }, { "2", '/', "1/2", "4" }, { "-2", '/', "-1/2", "4" }, { "-2", '/', "1/2", "-4" }, { "2", '/', "-1/2", "-4" }, { "2", '/', "2", "1" }, { "2", '/', "3", "2/3" }, { "2/3", '/', "5/3", "2/5" }, { "2/3", '/', "5/7", "14/15" }, { "0", '/', "0", "NaN" }, { "42", '/', "0", "NaN" }, { "-42", '/', "0", "NaN" }, { "infty", '/', "0", "NaN" }, { "-infty", '/', "0", "NaN" }, { "NaN", '/', "0", "NaN" }, { "0", '/', "NaN", "NaN" }, { "42", '/', "NaN", "NaN" }, { "-42", '/', "NaN", "NaN" }, { "infty", '/', "NaN", "NaN" }, { "-infty", '/', "NaN", "NaN" }, { "NaN", '/', "NaN", "NaN" }, { "0", '/', "infty", "0" }, { "42", '/', "infty", "0" }, { "-42", '/', "infty", "0" }, { "infty", '/', "infty", "NaN" }, { "-infty", '/', "infty", "NaN" }, { "NaN", '/', "infty", "NaN" }, { "0", '/', "-infty", "0" }, { "42", '/', "-infty", "0" }, { "-42", '/', "-infty", "0" }, { "infty", '/', "-infty", "NaN" }, { "-infty", '/', "-infty", "NaN" }, { "NaN", '/', "-infty", "NaN" }, { "1", '-', "1/3", "2/3" }, { "1/3", '+', "1/2", "5/6" }, { "1/2", '+', "1/2", "1" }, { "3/4", '-', "1/4", "1/2" }, { "1/2", '-', "1/3", "1/6" }, { "infty", '+', "42", "infty" }, { "infty", '+', "infty", "infty" }, { "42", '+', "infty", "infty" }, { "infty", '-', "infty", "NaN" }, { "infty", '*', "infty", "infty" }, { "infty", '*', "-infty", "-infty" }, { "-infty", '*', "infty", "-infty" }, { "-infty", '*', "-infty", "infty" }, { "0", '*', "infty", "NaN" }, { "1", '*', "infty", "infty" }, { "infty", '*', "0", "NaN" }, { "infty", '*', "42", "infty" }, { "42", '-', "infty", "-infty" }, { "infty", '+', "-infty", "NaN" }, { "4", 'g', "6", "2" }, { "5", 'g', "6", "1" }, { "42", 'm', "3", "3" }, { "42", 'M', "3", "42" }, { "3", 'm', "42", "3" }, { "3", 'M', "42", "42" }, { "42", 'm', "infty", "42" }, { "42", 'M', "infty", "infty" }, { "42", 'm', "-infty", "-infty" }, { "42", 'M', "-infty", "42" }, { "42", 'm', "NaN", "NaN" }, { "42", 'M', "NaN", "NaN" }, { "infty", 'm', "-infty", "-infty" }, { "infty", 'M', "-infty", "infty" }, }; /* Perform some basic tests of binary operations on isl_val objects. */ static int test_bin_val(isl_ctx *ctx) { int i; isl_val *v1, *v2, *res; __isl_give isl_val *(*fn)(__isl_take isl_val *v1, __isl_take isl_val *v2); int ok; for (i = 0; i < ARRAY_SIZE(val_bin_tests); ++i) { v1 = isl_val_read_from_str(ctx, val_bin_tests[i].arg1); v2 = isl_val_read_from_str(ctx, val_bin_tests[i].arg2); res = isl_val_read_from_str(ctx, val_bin_tests[i].res); fn = val_bin_op[val_bin_tests[i].op].fn; v1 = fn(v1, v2); if (isl_val_is_nan(res)) ok = isl_val_is_nan(v1); else ok = isl_val_eq(v1, res); isl_val_free(v1); isl_val_free(res); if (ok < 0) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); } return 0; } /* Perform some basic tests on isl_val objects. */ static int test_val(isl_ctx *ctx) { if (test_un_val(ctx) < 0) return -1; if (test_bin_val(ctx) < 0) return -1; return 0; } static int test_div(isl_ctx *ctx) { unsigned n; const char *str; int empty; isl_int v; isl_space *dim; isl_set *set; isl_local_space *ls; struct isl_basic_set *bset; struct isl_constraint *c; isl_int_init(v); /* test 1 */ dim = isl_space_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); assert(bset && bset->n_div == 1); isl_local_space_free(ls); isl_basic_set_free(bset); /* test 2 */ dim = isl_space_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); assert(bset && bset->n_div == 1); isl_local_space_free(ls); isl_basic_set_free(bset); /* test 3 */ dim = isl_space_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -3); isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 4); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); assert(bset && bset->n_div == 1); isl_local_space_free(ls); isl_basic_set_free(bset); /* test 4 */ dim = isl_space_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 2); isl_constraint_set_constant(c, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_constant(c, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 6); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 1, 2); assert(isl_basic_set_is_empty(bset)); isl_local_space_free(ls); isl_basic_set_free(bset); /* test 5 */ dim = isl_space_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1); assert(bset && bset->n_div == 0); isl_basic_set_free(bset); isl_local_space_free(ls); /* test 6 */ dim = isl_space_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 6); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1); assert(bset && bset->n_div == 1); isl_basic_set_free(bset); isl_local_space_free(ls); /* test 7 */ /* This test is a bit tricky. We set up an equality * a + 3b + 3c = 6 e0 * Normalization of divs creates _two_ divs * a = 3 e0 * c - b - e0 = 2 e1 * Afterwards e0 is removed again because it has coefficient -1 * and we end up with the original equality and div again. * Perhaps we can avoid the introduction of this temporary div. */ dim = isl_space_set_alloc(ctx, 0, 4); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); isl_int_set_si(v, 6); isl_constraint_set_coefficient(c, isl_dim_set, 3, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1); /* Test disabled for now */ /* assert(bset && bset->n_div == 1); */ isl_local_space_free(ls); isl_basic_set_free(bset); /* test 8 */ dim = isl_space_set_alloc(ctx, 0, 5); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); isl_int_set_si(v, -3); isl_constraint_set_coefficient(c, isl_dim_set, 3, v); isl_int_set_si(v, 6); isl_constraint_set_coefficient(c, isl_dim_set, 4, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); isl_int_set_si(v, 1); isl_constraint_set_constant(c, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 4, 1); /* Test disabled for now */ /* assert(bset && bset->n_div == 1); */ isl_local_space_free(ls); isl_basic_set_free(bset); /* test 9 */ dim = isl_space_set_alloc(ctx, 0, 4); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 1, v); isl_int_set_si(v, -2); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, -1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, 3); isl_constraint_set_coefficient(c, isl_dim_set, 3, v); isl_int_set_si(v, 2); isl_constraint_set_constant(c, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 2); bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2); assert(!isl_basic_set_is_empty(bset)); isl_local_space_free(ls); isl_basic_set_free(bset); /* test 10 */ dim = isl_space_set_alloc(ctx, 0, 3); bset = isl_basic_set_universe(isl_space_copy(dim)); ls = isl_local_space_from_space(dim); c = isl_equality_alloc(isl_local_space_copy(ls)); isl_int_set_si(v, 1); isl_constraint_set_coefficient(c, isl_dim_set, 0, v); isl_int_set_si(v, -2); isl_constraint_set_coefficient(c, isl_dim_set, 2, v); bset = isl_basic_set_add_constraint(bset, c); bset = isl_basic_set_project_out(bset, isl_dim_set, 2, 1); bset = isl_basic_set_fix_si(bset, isl_dim_set, 0, 2); isl_local_space_free(ls); isl_basic_set_free(bset); isl_int_clear(v); str = "{ [i] : exists (e0, e1: 3e1 >= 1 + 2e0 and " "8e1 <= -1 + 5i - 5e0 and 2e1 >= 1 + 2i - 5e0) }"; set = isl_set_read_from_str(ctx, str); set = isl_set_compute_divs(set); isl_set_free(set); if (!set) return -1; str = "{ [i,j] : 2*[i/2] + 3 * [j/4] <= 10 and 2 i = j }"; bset = isl_basic_set_read_from_str(ctx, str); n = isl_basic_set_dim(bset, isl_dim_div); isl_basic_set_free(bset); if (!bset) return -1; if (n != 0) isl_die(ctx, isl_error_unknown, "expecting no existentials", return -1); str = "{ [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }"; set = isl_set_read_from_str(ctx, str); set = isl_set_remove_divs_involving_dims(set, isl_dim_set, 0, 2); set = isl_set_fix_si(set, isl_dim_set, 2, -3); empty = isl_set_is_empty(set); isl_set_free(set); if (empty < 0) return -1; if (!empty) isl_die(ctx, isl_error_unknown, "result not as accurate as expected", return -1); return 0; } void test_application_case(struct isl_ctx *ctx, const char *name) { char *filename; FILE *input; struct isl_basic_set *bset1, *bset2; struct isl_basic_map *bmap; filename = get_filename(ctx, name, "omega"); assert(filename); input = fopen(filename, "r"); assert(input); bset1 = isl_basic_set_read_from_file(ctx, input); bmap = isl_basic_map_read_from_file(ctx, input); bset1 = isl_basic_set_apply(bset1, bmap); bset2 = isl_basic_set_read_from_file(ctx, input); assert(isl_basic_set_is_equal(bset1, bset2) == 1); isl_basic_set_free(bset1); isl_basic_set_free(bset2); free(filename); fclose(input); } void test_application(struct isl_ctx *ctx) { test_application_case(ctx, "application"); test_application_case(ctx, "application2"); } void test_affine_hull_case(struct isl_ctx *ctx, const char *name) { char *filename; FILE *input; struct isl_basic_set *bset1, *bset2; filename = get_filename(ctx, name, "polylib"); assert(filename); input = fopen(filename, "r"); assert(input); bset1 = isl_basic_set_read_from_file(ctx, input); bset2 = isl_basic_set_read_from_file(ctx, input); bset1 = isl_basic_set_affine_hull(bset1); assert(isl_basic_set_is_equal(bset1, bset2) == 1); isl_basic_set_free(bset1); isl_basic_set_free(bset2); free(filename); fclose(input); } int test_affine_hull(struct isl_ctx *ctx) { const char *str; isl_set *set; isl_basic_set *bset, *bset2; int n; int subset; test_affine_hull_case(ctx, "affine2"); test_affine_hull_case(ctx, "affine"); test_affine_hull_case(ctx, "affine3"); str = "[m] -> { [i0] : exists (e0, e1: e1 <= 1 + i0 and " "m >= 3 and 4i0 <= 2 + m and e1 >= i0 and " "e1 >= 0 and e1 <= 2 and e1 >= 1 + 2e0 and " "2e1 <= 1 + m + 4e0 and 2e1 >= 2 - m + 4i0 - 4e0) }"; set = isl_set_read_from_str(ctx, str); bset = isl_set_affine_hull(set); n = isl_basic_set_dim(bset, isl_dim_div); isl_basic_set_free(bset); if (n != 0) isl_die(ctx, isl_error_unknown, "not expecting any divs", return -1); /* Check that isl_map_affine_hull is not confused by * the reordering of divs in isl_map_align_divs. */ str = "{ [a, b, c, 0] : exists (e0 = [(b)/32], e1 = [(c)/32]: " "32e0 = b and 32e1 = c); " "[a, 0, c, 0] : exists (e0 = [(c)/32]: 32e0 = c) }"; set = isl_set_read_from_str(ctx, str); bset = isl_set_affine_hull(set); isl_basic_set_free(bset); if (!bset) return -1; str = "{ [a] : exists e0, e1, e2: 32e1 = 31 + 31a + 31e0 and " "32e2 = 31 + 31e0 }"; set = isl_set_read_from_str(ctx, str); bset = isl_set_affine_hull(set); str = "{ [a] : exists e : a = 32 e }"; bset2 = isl_basic_set_read_from_str(ctx, str); subset = isl_basic_set_is_subset(bset, bset2); isl_basic_set_free(bset); isl_basic_set_free(bset2); if (subset < 0) return -1; if (!subset) isl_die(ctx, isl_error_unknown, "not as accurate as expected", return -1); return 0; } void test_convex_hull_case(struct isl_ctx *ctx, const char *name) { char *filename; FILE *input; struct isl_basic_set *bset1, *bset2; struct isl_set *set; filename = get_filename(ctx, name, "polylib"); assert(filename); input = fopen(filename, "r"); assert(input); bset1 = isl_basic_set_read_from_file(ctx, input); bset2 = isl_basic_set_read_from_file(ctx, input); set = isl_basic_set_union(bset1, bset2); bset1 = isl_set_convex_hull(set); bset2 = isl_basic_set_read_from_file(ctx, input); assert(isl_basic_set_is_equal(bset1, bset2) == 1); isl_basic_set_free(bset1); isl_basic_set_free(bset2); free(filename); fclose(input); } void test_convex_hull_algo(struct isl_ctx *ctx, int convex) { const char *str1, *str2; isl_set *set1, *set2; int orig_convex = ctx->opt->convex; ctx->opt->convex = convex; test_convex_hull_case(ctx, "convex0"); test_convex_hull_case(ctx, "convex1"); test_convex_hull_case(ctx, "convex2"); test_convex_hull_case(ctx, "convex3"); test_convex_hull_case(ctx, "convex4"); test_convex_hull_case(ctx, "convex5"); test_convex_hull_case(ctx, "convex6"); test_convex_hull_case(ctx, "convex7"); test_convex_hull_case(ctx, "convex8"); test_convex_hull_case(ctx, "convex9"); test_convex_hull_case(ctx, "convex10"); test_convex_hull_case(ctx, "convex11"); test_convex_hull_case(ctx, "convex12"); test_convex_hull_case(ctx, "convex13"); test_convex_hull_case(ctx, "convex14"); test_convex_hull_case(ctx, "convex15"); str1 = "{ [i0, i1, i2] : (i2 = 1 and i0 = 0 and i1 >= 0) or " "(i0 = 1 and i1 = 0 and i2 = 1) or " "(i0 = 0 and i1 = 0 and i2 = 0) }"; str2 = "{ [i0, i1, i2] : i0 >= 0 and i2 >= i0 and i2 <= 1 and i1 >= 0 }"; set1 = isl_set_read_from_str(ctx, str1); set2 = isl_set_read_from_str(ctx, str2); set1 = isl_set_from_basic_set(isl_set_convex_hull(set1)); assert(isl_set_is_equal(set1, set2)); isl_set_free(set1); isl_set_free(set2); ctx->opt->convex = orig_convex; } void test_convex_hull(struct isl_ctx *ctx) { test_convex_hull_algo(ctx, ISL_CONVEX_HULL_FM); test_convex_hull_algo(ctx, ISL_CONVEX_HULL_WRAP); } void test_gist_case(struct isl_ctx *ctx, const char *name) { char *filename; FILE *input; struct isl_basic_set *bset1, *bset2; filename = get_filename(ctx, name, "polylib"); assert(filename); input = fopen(filename, "r"); assert(input); bset1 = isl_basic_set_read_from_file(ctx, input); bset2 = isl_basic_set_read_from_file(ctx, input); bset1 = isl_basic_set_gist(bset1, bset2); bset2 = isl_basic_set_read_from_file(ctx, input); assert(isl_basic_set_is_equal(bset1, bset2) == 1); isl_basic_set_free(bset1); isl_basic_set_free(bset2); free(filename); fclose(input); } static int test_gist(struct isl_ctx *ctx) { const char *str; isl_basic_set *bset1, *bset2; isl_map *map1, *map2; test_gist_case(ctx, "gist1"); str = "[p0, p2, p3, p5, p6, p10] -> { [] : " "exists (e0 = [(15 + p0 + 15p6 + 15p10)/16], e1 = [(p5)/8], " "e2 = [(p6)/128], e3 = [(8p2 - p5)/128], " "e4 = [(128p3 - p6)/4096]: 8e1 = p5 and 128e2 = p6 and " "128e3 = 8p2 - p5 and 4096e4 = 128p3 - p6 and p2 >= 0 and " "16e0 >= 16 + 16p6 + 15p10 and p2 <= 15 and p3 >= 0 and " "p3 <= 31 and p6 >= 128p3 and p5 >= 8p2 and p10 >= 0 and " "16e0 <= 15 + p0 + 15p6 + 15p10 and 16e0 >= p0 + 15p6 + 15p10 and " "p10 <= 15 and p10 <= -1 + p0 - p6) }"; bset1 = isl_basic_set_read_from_str(ctx, str); str = "[p0, p2, p3, p5, p6, p10] -> { [] : exists (e0 = [(p5)/8], " "e1 = [(p6)/128], e2 = [(8p2 - p5)/128], " "e3 = [(128p3 - p6)/4096]: 8e0 = p5 and 128e1 = p6 and " "128e2 = 8p2 - p5 and 4096e3 = 128p3 - p6 and p5 >= -7 and " "p2 >= 0 and 8p2 <= -1 + p0 and p2 <= 15 and p3 >= 0 and " "p3 <= 31 and 128p3 <= -1 + p0 and p6 >= -127 and " "p5 <= -1 + p0 and p6 <= -1 + p0 and p6 >= 128p3 and " "p0 >= 1 and p5 >= 8p2 and p10 >= 0 and p10 <= 15 ) }"; bset2 = isl_basic_set_read_from_str(ctx, str); bset1 = isl_basic_set_gist(bset1, bset2); assert(bset1 && bset1->n_div == 0); isl_basic_set_free(bset1); /* Check that the integer divisions of the second disjunct * do not spread to the first disjunct. */ str = "[t1] -> { S_0[] -> A[o0] : (exists (e0 = [(-t1 + o0)/16]: " "16e0 = -t1 + o0 and o0 >= 0 and o0 <= 15 and t1 >= 0)) or " "(exists (e0 = [(-1 + t1)/16], " "e1 = [(-16 + t1 - 16e0)/4294967296]: " "4294967296e1 = -16 + t1 - o0 - 16e0 and " "16e0 <= -1 + t1 and 16e0 >= -16 + t1 and o0 >= 0 and " "o0 <= 4294967295 and t1 <= -1)) }"; map1 = isl_map_read_from_str(ctx, str); str = "[t1] -> { S_0[] -> A[o0] : t1 >= 0 and t1 <= 4294967295 }"; map2 = isl_map_read_from_str(ctx, str); map1 = isl_map_gist(map1, map2); if (!map1) return -1; if (map1->n != 1) isl_die(ctx, isl_error_unknown, "expecting single disjunct", isl_map_free(map1); return -1); if (isl_basic_map_dim(map1->p[0], isl_dim_div) != 1) isl_die(ctx, isl_error_unknown, "expecting single div", isl_map_free(map1); return -1); isl_map_free(map1); return 0; } int test_coalesce_set(isl_ctx *ctx, const char *str, int check_one) { isl_set *set, *set2; int equal; int one; set = isl_set_read_from_str(ctx, str); set = isl_set_coalesce(set); set2 = isl_set_read_from_str(ctx, str); equal = isl_set_is_equal(set, set2); one = set && set->n == 1; isl_set_free(set); isl_set_free(set2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "coalesced set not equal to input", return -1); if (check_one && !one) isl_die(ctx, isl_error_unknown, "coalesced set should not be a union", return -1); return 0; } int test_coalesce_unbounded_wrapping(isl_ctx *ctx) { int r = 0; int bounded; bounded = isl_options_get_coalesce_bounded_wrapping(ctx); isl_options_set_coalesce_bounded_wrapping(ctx, 0); if (test_coalesce_set(ctx, "{[x,y,z] : y + 2 >= 0 and x - y + 1 >= 0 and " "-x - y + 1 >= 0 and -3 <= z <= 3;" "[x,y,z] : -x+z + 20 >= 0 and -x-z + 20 >= 0 and " "x-z + 20 >= 0 and x+z + 20 >= 0 and " "-10 <= y <= 0}", 1) < 0) goto error; if (test_coalesce_set(ctx, "{[x,y] : 0 <= x,y <= 10; [5,y]: 4 <=y <= 11}", 1) < 0) goto error; if (test_coalesce_set(ctx, "{[x,0,0] : -5 <= x <= 5; [0,y,1] : -5 <= y <= 5 }", 1) < 0) goto error; if (0) { error: r = -1; } isl_options_set_coalesce_bounded_wrapping(ctx, bounded); return r; } /* Inputs for coalescing tests. * "str" is a string representation of the input set. * "single_disjunct" is set if we expect the result to consist of * a single disjunct. */ struct { int single_disjunct; const char *str; } coalesce_tests[] = { { 1, "{[x,y]: x >= 0 & x <= 10 & y >= 0 & y <= 10 or " "y >= x & x >= 2 & 5 >= y }" }, { 1, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or " "x + y >= 10 & y <= x & x + y <= 20 & y >= 0}" }, { 0, "{[x,y]: y >= 0 & 2x + y <= 30 & y <= 10 & x >= 0 or " "x + y >= 10 & y <= x & x + y <= 19 & y >= 0}" }, { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or " "y >= 0 & x >= 6 & x <= 10 & y <= x}" }, { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or " "y >= 0 & x >= 7 & x <= 10 & y <= x}" }, { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or " "y >= 0 & x >= 6 & x <= 10 & y + 1 <= x}" }, { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 6}" }, { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 7 & y <= 6}" }, { 1, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 5}" }, { 0, "{[x,y]: y >= 0 & x <= 5 & y <= x or y >= 0 & x = 6 & y <= 7}" }, { 1, "[n] -> { [i] : i = 1 and n >= 2 or 2 <= i and i <= n }" }, { 0, "{[x,y] : x >= 0 and y >= 0 or 0 <= y and y <= 5 and x = -1}" }, { 1, "[n] -> { [i] : 1 <= i and i <= n - 1 or 2 <= i and i <= n }" }, { 0, "[n] -> { [[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], " "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], " "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and " "4e4 = -2 + o0 and i0 >= 8 + 2n and o0 >= 2 + i0 and " "o0 <= 56 + 2n and o0 <= -12 + 4n and i0 <= 57 + 2n and " "i0 <= -11 + 4n and o0 >= 6 + 2n and 4e0 <= i0 and " "4e0 >= -3 + i0 and 4e1 <= o0 and 4e1 >= -3 + o0 and " "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0);" "[[i0] -> [o0]] : exists (e0 = [(i0)/4], e1 = [(o0)/4], " "e2 = [(n)/2], e3 = [(-2 + i0)/4], e4 = [(-2 + o0)/4], " "e5 = [(-2n + i0)/4]: 2e2 = n and 4e3 = -2 + i0 and " "4e4 = -2 + o0 and 2e0 >= 3 + n and e0 <= -4 + n and " "2e0 <= 27 + n and e1 <= -4 + n and 2e1 <= 27 + n and " "2e1 >= 2 + n and e1 >= 1 + e0 and i0 >= 7 + 2n and " "i0 <= -11 + 4n and i0 <= 57 + 2n and 4e0 <= -2 + i0 and " "4e0 >= -3 + i0 and o0 >= 6 + 2n and o0 <= -11 + 4n and " "o0 <= 57 + 2n and 4e1 <= -2 + o0 and 4e1 >= -3 + o0 and " "4e5 <= -2n + i0 and 4e5 >= -3 - 2n + i0 ) }" }, { 0, "[n, m] -> { [o0, o2, o3] : (o3 = 1 and o0 >= 1 + m and " "o0 <= n + m and o2 <= m and o0 >= 2 + n and o2 >= 3) or " "(o0 >= 2 + n and o0 >= 1 + m and o0 <= n + m and n >= 1 and " "o3 <= -1 + o2 and o3 >= 1 - m + o2 and o3 >= 2 and o3 <= n) }" }, { 0, "[M, N] -> { [[i0, i1, i2, i3, i4, i5, i6] -> " "[o0, o1, o2, o3, o4, o5, o6]] : " "(o6 <= -4 + 2M - 2N + i0 + i1 - i2 + i6 - o0 - o1 + o2 and " "o3 <= -2 + i3 and o6 >= 2 + i0 + i3 + i6 - o0 - o3 and " "o6 >= 2 - M + N + i3 + i4 + i6 - o3 - o4 and o0 <= -1 + i0 and " "o4 >= 4 - 3M + 3N - i0 - i1 + i2 + 2i3 + i4 + o0 + o1 - o2 - 2o3 " "and o6 <= -3 + 2M - 2N + i3 + i4 - i5 + i6 - o3 - o4 + o5 and " "2o6 <= -5 + 5M - 5N + 2i0 + i1 - i2 - i5 + 2i6 - 2o0 - o1 + o2 + o5 " "and o6 >= 2i0 + i1 + i6 - 2o0 - o1 and " "3o6 <= -5 + 4M - 4N + 2i0 + i1 - i2 + 2i3 + i4 - i5 + 3i6 " "- 2o0 - o1 + o2 - 2o3 - o4 + o5) or " "(N >= 2 and o3 <= -1 + i3 and o0 <= -1 + i0 and " "o6 >= i3 + i6 - o3 and M >= 0 and " "2o6 >= 1 + i0 + i3 + 2i6 - o0 - o3 and " "o6 >= 1 - M + i0 + i6 - o0 and N >= 2M and o6 >= i0 + i6 - o0) }" }, { 0, "[M, N] -> { [o0] : (o0 = 0 and M >= 1 and N >= 2) or " "(o0 = 0 and M >= 1 and N >= 2M and N >= 2 + M) or " "(o0 = 0 and M >= 2 and N >= 3) or " "(M = 0 and o0 = 0 and N >= 3) }" }, { 0, "{ [i0, i1, i2, i3] : (i1 = 10i0 and i0 >= 1 and 10i0 <= 100 and " "i3 <= 9 + 10 i2 and i3 >= 1 + 10i2 and i3 >= 0) or " "(i1 <= 9 + 10i0 and i1 >= 1 + 10i0 and i2 >= 0 and " "i0 >= 0 and i1 <= 100 and i3 <= 9 + 10i2 and i3 >= 1 + 10i2) }" }, { 0, "[M] -> { [i1] : (i1 >= 2 and i1 <= M) or (i1 = M and M >= 1) }" }, { 0, "{[x,y] : x,y >= 0; [x,y] : 10 <= x <= 20 and y >= -1 }" }, { 1, "{ [x, y] : (x >= 1 and y >= 1 and x <= 2 and y <= 2) or " "(y = 3 and x = 1) }" }, { 1, "[M] -> { [i0, i1, i2, i3, i4] : (i1 >= 3 and i4 >= 2 + i2 and " "i2 >= 2 and i0 >= 2 and i3 >= 1 + i2 and i0 <= M and " "i1 <= M and i3 <= M and i4 <= M) or " "(i1 >= 2 and i4 >= 1 + i2 and i2 >= 2 and i0 >= 2 and " "i3 >= 1 + i2 and i0 <= M and i1 <= -1 + M and i3 <= M and " "i4 <= -1 + M) }" }, { 1, "{ [x, y] : (x >= 0 and y >= 0 and x <= 10 and y <= 10) or " "(x >= 1 and y >= 1 and x <= 11 and y <= 11) }" }, { 0, "{[x,0] : x >= 0; [x,1] : x <= 20}" }, { 1, "{ [x, 1 - x] : 0 <= x <= 1; [0,0] }" }, { 1, "{ [0,0]; [i,i] : 1 <= i <= 10 }" }, { 0, "{ [0,0]; [i,j] : 1 <= i,j <= 10 }" }, { 1, "{ [0,0]; [i,2i] : 1 <= i <= 10 }" }, { 0, "{ [0,0]; [i,2i] : 2 <= i <= 10 }" }, { 0, "{ [1,0]; [i,2i] : 1 <= i <= 10 }" }, { 0, "{ [0,1]; [i,2i] : 1 <= i <= 10 }" }, { 0, "{ [a, b] : exists e : 2e = a and " "a >= 0 and (a <= 3 or (b <= 0 and b >= -4 + a)) }" }, { 0, "{ [i, j, i', j'] : i <= 2 and j <= 2 and " "j' >= -1 + 2i + j - 2i' and i' <= -1 + i and " "j >= 1 and j' <= i + j - i' and i >= 1; " "[1, 1, 1, 1] }" }, { 1, "{ [i,j] : exists a,b : i = 2a and j = 3b; " "[i,j] : exists a : j = 3a }" }, { 1, "{ [a, b, c] : (c <= 7 - b and b <= 1 and b >= 0 and " "c >= 3 + b and b <= 3 + 8a and b >= -26 + 8a and " "a >= 3) or " "(b <= 1 and c <= 7 and b >= 0 and c >= 4 + b and " "b <= 3 + 8a and b >= -26 + 8a and a >= 3) }" }, { 1, "{ [a, 0, c] : c >= 1 and c <= 29 and c >= -1 + 8a and " "c <= 6 + 8a and a >= 3; " "[a, -1, c] : c >= 1 and c <= 30 and c >= 8a and " "c <= 7 + 8a and a >= 3 and a <= 4 }" }, { 1, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; " "[x,0] : 3 <= x <= 4 }" }, { 1, "{ [x,y] : 0 <= x <= 3 and y >= 0 and x + 3y <= 6; " "[x,0] : 4 <= x <= 5 }" }, { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + 2y <= 4; " "[x,0] : 3 <= x <= 5 }" }, { 0, "{ [x,y] : 0 <= x <= 2 and y >= 0 and x + y <= 4; " "[x,0] : 3 <= x <= 4 }" }, { 1 , "{ [i0, i1] : i0 <= 122 and i0 >= 1 and 128i1 >= -249 + i0 and " "i1 <= 0; " "[i0, 0] : i0 >= 123 and i0 <= 124 }" }, }; /* Test the functionality of isl_set_coalesce. * That is, check that the output is always equal to the input * and in some cases that the result consists of a single disjunct. */ static int test_coalesce(struct isl_ctx *ctx) { int i; for (i = 0; i < ARRAY_SIZE(coalesce_tests); ++i) { const char *str = coalesce_tests[i].str; int check_one = coalesce_tests[i].single_disjunct; if (test_coalesce_set(ctx, str, check_one) < 0) return -1; } if (test_coalesce_unbounded_wrapping(ctx) < 0) return -1; return 0; } void test_closure(struct isl_ctx *ctx) { const char *str; isl_set *dom; isl_map *up, *right; isl_map *map, *map2; int exact; /* COCOA example 1 */ map = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and " "1 <= i and i < n and 1 <= j and j < n or " "i2 = i + 1 and j2 = j - 1 and " "1 <= i and i < n and 2 <= j and j <= n }"); map = isl_map_power(map, &exact); assert(exact); isl_map_free(map); /* COCOA example 1 */ map = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : i2 = i + 1 and j2 = j + 1 and " "1 <= i and i < n and 1 <= j and j < n or " "i2 = i + 1 and j2 = j - 1 and " "1 <= i and i < n and 2 <= j and j <= n }"); map = isl_map_transitive_closure(map, &exact); assert(exact); map2 = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : " "1 <= i and i < n and 1 <= j and j <= n and " "2 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and " "i2 = i + k1 + k2 and j2 = j + k1 - k2 and " "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1 )}"); assert(isl_map_is_equal(map, map2)); isl_map_free(map2); isl_map_free(map); map = isl_map_read_from_str(ctx, "[n] -> { [x] -> [y] : y = x + 1 and 0 <= x and x <= n and " " 0 <= y and y <= n }"); map = isl_map_transitive_closure(map, &exact); map2 = isl_map_read_from_str(ctx, "[n] -> { [x] -> [y] : y > x and 0 <= x and x <= n and " " 0 <= y and y <= n }"); assert(isl_map_is_equal(map, map2)); isl_map_free(map2); isl_map_free(map); /* COCOA example 2 */ map = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j + 2 and " "1 <= i and i < n - 1 and 1 <= j and j < n - 1 or " "i2 = i + 2 and j2 = j - 2 and " "1 <= i and i < n - 1 and 3 <= j and j <= n }"); map = isl_map_transitive_closure(map, &exact); assert(exact); map2 = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k : " "1 <= i and i < n - 1 and 1 <= j and j <= n and " "3 <= i2 and i2 <= n and 1 <= j2 and j2 <= n and " "i2 = i + 2 k1 + 2 k2 and j2 = j + 2 k1 - 2 k2 and " "k1 >= 0 and k2 >= 0 and k1 + k2 = k and k >= 1) }"); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); /* COCOA Fig.2 left */ map = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : i2 = i + 2 and j2 = j and " "i <= 2 j - 3 and i <= n - 2 and j <= 2 i - 1 and " "j <= n or " "i2 = i and j2 = j + 2 and i <= 2 j - 1 and i <= n and " "j <= 2 i - 3 and j <= n - 2 or " "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and " "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }"); map = isl_map_transitive_closure(map, &exact); assert(exact); isl_map_free(map); /* COCOA Fig.2 right */ map = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and " "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and " "j <= n or " "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and " "j <= 2 i - 4 and j <= n - 3 or " "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and " "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }"); map = isl_map_power(map, &exact); assert(exact); isl_map_free(map); /* COCOA Fig.2 right */ map = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : i2 = i + 3 and j2 = j and " "i <= 2 j - 4 and i <= n - 3 and j <= 2 i - 1 and " "j <= n or " "i2 = i and j2 = j + 3 and i <= 2 j - 1 and i <= n and " "j <= 2 i - 4 and j <= n - 3 or " "i2 = i + 1 and j2 = j + 1 and i <= 2 j - 1 and " "i <= n - 1 and j <= 2 i - 1 and j <= n - 1 }"); map = isl_map_transitive_closure(map, &exact); assert(exact); map2 = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : exists (k1,k2,k3,k : " "i <= 2 j - 1 and i <= n and j <= 2 i - 1 and " "j <= n and 3 + i + 2 j <= 3 n and " "3 + 2 i + j <= 3n and i2 <= 2 j2 -1 and i2 <= n and " "i2 <= 3 j2 - 4 and j2 <= 2 i2 -1 and j2 <= n and " "13 + 4 j2 <= 11 i2 and i2 = i + 3 k1 + k3 and " "j2 = j + 3 k2 + k3 and k1 >= 0 and k2 >= 0 and " "k3 >= 0 and k1 + k2 + k3 = k and k > 0) }"); assert(isl_map_is_equal(map, map2)); isl_map_free(map2); isl_map_free(map); /* COCOA Fig.1 right */ dom = isl_set_read_from_str(ctx, "{ [x,y] : x >= 0 and -2 x + 3 y >= 0 and x <= 3 and " "2 x - 3 y + 3 >= 0 }"); right = isl_map_read_from_str(ctx, "{ [x,y] -> [x2,y2] : x2 = x + 1 and y2 = y }"); up = isl_map_read_from_str(ctx, "{ [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 }"); right = isl_map_intersect_domain(right, isl_set_copy(dom)); right = isl_map_intersect_range(right, isl_set_copy(dom)); up = isl_map_intersect_domain(up, isl_set_copy(dom)); up = isl_map_intersect_range(up, dom); map = isl_map_union(up, right); map = isl_map_transitive_closure(map, &exact); assert(exact); map2 = isl_map_read_from_str(ctx, "{ [0,0] -> [0,1]; [0,0] -> [1,1]; [0,1] -> [1,1]; " " [2,2] -> [3,2]; [2,2] -> [3,3]; [3,2] -> [3,3] }"); assert(isl_map_is_equal(map, map2)); isl_map_free(map2); isl_map_free(map); /* COCOA Theorem 1 counter example */ map = isl_map_read_from_str(ctx, "{ [i,j] -> [i2,j2] : i = 0 and 0 <= j and j <= 1 and " "i2 = 1 and j2 = j or " "i = 0 and j = 0 and i2 = 0 and j2 = 1 }"); map = isl_map_transitive_closure(map, &exact); assert(exact); isl_map_free(map); map = isl_map_read_from_str(ctx, "[m,n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 2 and " "1 <= i,i2 <= n and 1 <= j,j2 <= m or " "i2 = i + 1 and 3 <= j2 - j <= 4 and " "1 <= i,i2 <= n and 1 <= j,j2 <= m }"); map = isl_map_transitive_closure(map, &exact); assert(exact); isl_map_free(map); /* Kelly et al 1996, fig 12 */ map = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : i2 = i and j2 = j + 1 and " "1 <= i,j,j+1 <= n or " "j = n and j2 = 1 and i2 = i + 1 and " "1 <= i,i+1 <= n }"); map = isl_map_transitive_closure(map, &exact); assert(exact); map2 = isl_map_read_from_str(ctx, "[n] -> { [i,j] -> [i2,j2] : 1 <= j < j2 <= n and " "1 <= i <= n and i = i2 or " "1 <= i < i2 <= n and 1 <= j <= n and " "1 <= j2 <= n }"); assert(isl_map_is_equal(map, map2)); isl_map_free(map2); isl_map_free(map); /* Omega's closure4 */ map = isl_map_read_from_str(ctx, "[m,n] -> { [x,y] -> [x2,y2] : x2 = x and y2 = y + 1 and " "1 <= x,y <= 10 or " "x2 = x + 1 and y2 = y and " "1 <= x <= 20 && 5 <= y <= 15 }"); map = isl_map_transitive_closure(map, &exact); assert(exact); isl_map_free(map); map = isl_map_read_from_str(ctx, "[n] -> { [x] -> [y]: 1 <= n <= y - x <= 10 }"); map = isl_map_transitive_closure(map, &exact); assert(!exact); map2 = isl_map_read_from_str(ctx, "[n] -> { [x] -> [y] : 1 <= n <= 10 and y >= n + x }"); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "[n, m] -> { [i0, i1, i2, i3] -> [o0, o1, o2, o3] : " "i3 = 1 and o0 = i0 and o1 = -1 + i1 and o2 = -1 + i2 and " "o3 = -2 + i2 and i1 <= -1 + i0 and i1 >= 1 - m + i0 and " "i1 >= 2 and i1 <= n and i2 >= 3 and i2 <= 1 + n and i2 <= m }"; map = isl_map_read_from_str(ctx, str); map = isl_map_transitive_closure(map, &exact); assert(exact); map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "{[0] -> [1]; [2] -> [3]}"; map = isl_map_read_from_str(ctx, str); map = isl_map_transitive_closure(map, &exact); assert(exact); map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "[n] -> { [[i0, i1, 1, 0, i0] -> [i5, 1]] -> " "[[i0, -1 + i1, 2, 0, i0] -> [-1 + i5, 2]] : " "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 2 and " "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and " "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); " "[[i0, i1, 2, 0, i0] -> [i5, 1]] -> " "[[i0, i1, 1, 0, i0] -> [-1 + i5, 2]] : " "exists (e0 = [(3 - n)/3]: i5 >= 2 and i1 >= 1 and " "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and " "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); " "[[i0, i1, 1, 0, i0] -> [i5, 2]] -> " "[[i0, -1 + i1, 2, 0, i0] -> [i5, 1]] : " "exists (e0 = [(3 - n)/3]: i1 >= 2 and i5 >= 1 and " "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and " "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n); " "[[i0, i1, 2, 0, i0] -> [i5, 2]] -> " "[[i0, i1, 1, 0, i0] -> [i5, 1]] : " "exists (e0 = [(3 - n)/3]: i5 >= 1 and i1 >= 1 and " "3i0 <= -1 + n and i1 <= -1 + n and i5 <= -1 + n and " "3e0 >= 1 - n and 3e0 <= 2 - n and 3i0 >= -2 + n) }"; map = isl_map_read_from_str(ctx, str); map = isl_map_transitive_closure(map, NULL); assert(map); isl_map_free(map); } void test_lex(struct isl_ctx *ctx) { isl_space *dim; isl_map *map; dim = isl_space_set_alloc(ctx, 0, 0); map = isl_map_lex_le(dim); assert(!isl_map_is_empty(map)); isl_map_free(map); } static int test_lexmin(struct isl_ctx *ctx) { int equal; const char *str; isl_basic_map *bmap; isl_map *map, *map2; isl_set *set; isl_set *set2; isl_pw_multi_aff *pma; str = "[p0, p1] -> { [] -> [] : " "exists (e0 = [(2p1)/3], e1, e2, e3 = [(3 - p1 + 3e0)/3], " "e4 = [(p1)/3], e5 = [(p1 + 3e4)/3]: " "3e0 >= -2 + 2p1 and 3e0 >= p1 and 3e3 >= 1 - p1 + 3e0 and " "3e0 <= 2p1 and 3e3 >= -2 + p1 and 3e3 <= -1 + p1 and p1 >= 3 and " "3e5 >= -2 + 2p1 and 3e5 >= p1 and 3e5 <= -1 + p1 + 3e4 and " "3e4 <= p1 and 3e4 >= -2 + p1 and e3 <= -1 + e0 and " "3e4 >= 6 - p1 + 3e1 and 3e1 >= p1 and 3e5 >= -2 + p1 + 3e4 and " "2e4 >= 3 - p1 + 2e1 and e4 <= e1 and 3e3 <= 2 - p1 + 3e0 and " "e5 >= 1 + e1 and 3e4 >= 6 - 2p1 + 3e1 and " "p0 >= 2 and p1 >= p0 and 3e2 >= p1 and 3e4 >= 6 - p1 + 3e2 and " "e2 <= e1 and e3 >= 1 and e4 <= e2) }"; map = isl_map_read_from_str(ctx, str); map = isl_map_lexmin(map); isl_map_free(map); str = "[C] -> { [obj,a,b,c] : obj <= 38 a + 7 b + 10 c and " "a + b <= 1 and c <= 10 b and c <= C and a,b,c,C >= 0 }"; set = isl_set_read_from_str(ctx, str); set = isl_set_lexmax(set); str = "[C] -> { [obj,a,b,c] : C = 8 }"; set2 = isl_set_read_from_str(ctx, str); set = isl_set_intersect(set, set2); assert(!isl_set_is_empty(set)); isl_set_free(set); str = "{ [x] -> [y] : x <= y <= 10; [x] -> [5] : -8 <= x <= 8 }"; map = isl_map_read_from_str(ctx, str); map = isl_map_lexmin(map); str = "{ [x] -> [5] : 6 <= x <= 8; " "[x] -> [x] : x <= 5 or (9 <= x <= 10) }"; map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "{ [x] -> [y] : 4y = x or 4y = -1 + x or 4y = -2 + x }"; map = isl_map_read_from_str(ctx, str); map2 = isl_map_copy(map); map = isl_map_lexmin(map); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "{ [x] -> [y] : x = 4y; [x] -> [y] : x = 2y }"; map = isl_map_read_from_str(ctx, str); map = isl_map_lexmin(map); str = "{ [x] -> [y] : (4y = x and x >= 0) or " "(exists (e0 = [(x)/4], e1 = [(-2 + x)/4]: 2y = x and " "4e1 = -2 + x and 4e0 <= -1 + x and 4e0 >= -3 + x)) or " "(exists (e0 = [(x)/4]: 2y = x and 4e0 = x and x <= -4)) }"; map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "{ [i] -> [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and " " 8i' <= i and 8i' >= -7 + i }"; bmap = isl_basic_map_read_from_str(ctx, str); pma = isl_basic_map_lexmin_pw_multi_aff(isl_basic_map_copy(bmap)); map2 = isl_map_from_pw_multi_aff(pma); map = isl_map_from_basic_map(bmap); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "{ T[a] -> S[b, c] : a = 4b-2c and c >= b }"; map = isl_map_read_from_str(ctx, str); map = isl_map_lexmin(map); str = "{ T[a] -> S[b, c] : 2b = a and 2c = a }"; map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); /* Check that empty pieces are properly combined. */ str = "[K, N] -> { [x, y] -> [a, b] : K+2<=N<=K+4 and x>=4 and " "2N-6<=x=N and a>=x+1 }"; map = isl_map_read_from_str(ctx, str); map = isl_map_lexmin(map); str = "[K, N] -> { [x, y] -> [1 + x, N] : x >= -6 + 2N and " "x <= -5 + 2N and x >= -1 + 3K - N and x <= -2 + K + N and " "x >= 4 }"; map2 = isl_map_read_from_str(ctx, str); assert(isl_map_is_equal(map, map2)); isl_map_free(map); isl_map_free(map2); str = "[i] -> { [i', j] : j = i - 8i' and i' >= 0 and i' <= 7 and " " 8i' <= i and 8i' >= -7 + i }"; set = isl_set_read_from_str(ctx, str); pma = isl_set_lexmin_pw_multi_aff(isl_set_copy(set)); set2 = isl_set_from_pw_multi_aff(pma); equal = isl_set_is_equal(set, set2); isl_set_free(set); isl_set_free(set2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected difference between set and " "piecewise affine expression", return -1); return 0; } struct must_may { isl_map *must; isl_map *may; }; static int collect_must_may(__isl_take isl_map *dep, int must, void *dep_user, void *user) { struct must_may *mm = (struct must_may *)user; if (must) mm->must = isl_map_union(mm->must, dep); else mm->may = isl_map_union(mm->may, dep); return 0; } static int common_space(void *first, void *second) { int depth = *(int *)first; return 2 * depth; } static int map_is_equal(__isl_keep isl_map *map, const char *str) { isl_map *map2; int equal; if (!map) return -1; map2 = isl_map_read_from_str(map->ctx, str); equal = isl_map_is_equal(map, map2); isl_map_free(map2); return equal; } static int map_check_equal(__isl_keep isl_map *map, const char *str) { int equal; equal = map_is_equal(map, str); if (equal < 0) return -1; if (!equal) isl_die(isl_map_get_ctx(map), isl_error_unknown, "result not as expected", return -1); return 0; } void test_dep(struct isl_ctx *ctx) { const char *str; isl_space *dim; isl_map *map; isl_access_info *ai; isl_flow *flow; int depth; struct must_may mm; depth = 3; str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_alloc(map, &depth, &common_space, 2); str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 1, &depth); str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 1, &depth); flow = isl_access_info_compute_flow(ai); dim = isl_space_alloc(ctx, 0, 3, 3); mm.must = isl_map_empty(isl_space_copy(dim)); mm.may = isl_map_empty(dim); isl_flow_foreach(flow, collect_must_may, &mm); str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10); " " [1,10,0] -> [2,5,0] }"; assert(map_is_equal(mm.must, str)); str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }"; assert(map_is_equal(mm.may, str)); isl_map_free(mm.must); isl_map_free(mm.may); isl_flow_free(flow); str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_alloc(map, &depth, &common_space, 2); str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 1, &depth); str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 0, &depth); flow = isl_access_info_compute_flow(ai); dim = isl_space_alloc(ctx, 0, 3, 3); mm.must = isl_map_empty(isl_space_copy(dim)); mm.may = isl_map_empty(dim); isl_flow_foreach(flow, collect_must_may, &mm); str = "{ [0,i,0] -> [2,i,0] : (0 <= i <= 4) or (6 <= i <= 10) }"; assert(map_is_equal(mm.must, str)); str = "{ [0,5,0] -> [2,5,0]; [1,i,0] -> [2,5,0] : 0 <= i <= 10 }"; assert(map_is_equal(mm.may, str)); isl_map_free(mm.must); isl_map_free(mm.may); isl_flow_free(flow); str = "{ [2,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_alloc(map, &depth, &common_space, 2); str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 0, &depth); str = "{ [1,i,0] -> [5] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 0, &depth); flow = isl_access_info_compute_flow(ai); dim = isl_space_alloc(ctx, 0, 3, 3); mm.must = isl_map_empty(isl_space_copy(dim)); mm.may = isl_map_empty(dim); isl_flow_foreach(flow, collect_must_may, &mm); str = "{ [0,i,0] -> [2,i,0] : 0 <= i <= 10; " " [1,i,0] -> [2,5,0] : 0 <= i <= 10 }"; assert(map_is_equal(mm.may, str)); str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }"; assert(map_is_equal(mm.must, str)); isl_map_free(mm.must); isl_map_free(mm.may); isl_flow_free(flow); str = "{ [0,i,2] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_alloc(map, &depth, &common_space, 2); str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 0, &depth); str = "{ [0,i,1] -> [5] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 0, &depth); flow = isl_access_info_compute_flow(ai); dim = isl_space_alloc(ctx, 0, 3, 3); mm.must = isl_map_empty(isl_space_copy(dim)); mm.may = isl_map_empty(dim); isl_flow_foreach(flow, collect_must_may, &mm); str = "{ [0,i,0] -> [0,i,2] : 0 <= i <= 10; " " [0,i,1] -> [0,5,2] : 0 <= i <= 5 }"; assert(map_is_equal(mm.may, str)); str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }"; assert(map_is_equal(mm.must, str)); isl_map_free(mm.must); isl_map_free(mm.may); isl_flow_free(flow); str = "{ [0,i,1] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_alloc(map, &depth, &common_space, 2); str = "{ [0,i,0] -> [i] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 0, &depth); str = "{ [0,i,2] -> [5] : 0 <= i <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 0, &depth); flow = isl_access_info_compute_flow(ai); dim = isl_space_alloc(ctx, 0, 3, 3); mm.must = isl_map_empty(isl_space_copy(dim)); mm.may = isl_map_empty(dim); isl_flow_foreach(flow, collect_must_may, &mm); str = "{ [0,i,0] -> [0,i,1] : 0 <= i <= 10; " " [0,i,2] -> [0,5,1] : 0 <= i <= 4 }"; assert(map_is_equal(mm.may, str)); str = "{ [i,j,k] -> [l,m,n] : 1 = 0 }"; assert(map_is_equal(mm.must, str)); isl_map_free(mm.must); isl_map_free(mm.may); isl_flow_free(flow); depth = 5; str = "{ [1,i,0,0,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_alloc(map, &depth, &common_space, 1); str = "{ [0,i,0,j,0] -> [i,j] : 0 <= i <= 10 and 0 <= j <= 10 }"; map = isl_map_read_from_str(ctx, str); ai = isl_access_info_add_source(ai, map, 1, &depth); flow = isl_access_info_compute_flow(ai); dim = isl_space_alloc(ctx, 0, 5, 5); mm.must = isl_map_empty(isl_space_copy(dim)); mm.may = isl_map_empty(dim); isl_flow_foreach(flow, collect_must_may, &mm); str = "{ [0,i,0,j,0] -> [1,i,0,0,0] : 0 <= i,j <= 10 }"; assert(map_is_equal(mm.must, str)); str = "{ [0,0,0,0,0] -> [0,0,0,0,0] : 1 = 0 }"; assert(map_is_equal(mm.may, str)); isl_map_free(mm.must); isl_map_free(mm.may); isl_flow_free(flow); } int test_sv(isl_ctx *ctx) { const char *str; isl_map *map; isl_union_map *umap; int sv; str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 9 }"; map = isl_map_read_from_str(ctx, str); sv = isl_map_is_single_valued(map); isl_map_free(map); if (sv < 0) return -1; if (!sv) isl_die(ctx, isl_error_internal, "map not detected as single valued", return -1); str = "[N] -> { [i] -> [f] : 0 <= i <= N and 0 <= i - 10 f <= 10 }"; map = isl_map_read_from_str(ctx, str); sv = isl_map_is_single_valued(map); isl_map_free(map); if (sv < 0) return -1; if (sv) isl_die(ctx, isl_error_internal, "map detected as single valued", return -1); str = "{ S1[i] -> [i] : 0 <= i <= 9; S2[i] -> [i] : 0 <= i <= 9 }"; umap = isl_union_map_read_from_str(ctx, str); sv = isl_union_map_is_single_valued(umap); isl_union_map_free(umap); if (sv < 0) return -1; if (!sv) isl_die(ctx, isl_error_internal, "map not detected as single valued", return -1); str = "{ [i] -> S1[i] : 0 <= i <= 9; [i] -> S2[i] : 0 <= i <= 9 }"; umap = isl_union_map_read_from_str(ctx, str); sv = isl_union_map_is_single_valued(umap); isl_union_map_free(umap); if (sv < 0) return -1; if (sv) isl_die(ctx, isl_error_internal, "map detected as single valued", return -1); return 0; } void test_bijective_case(struct isl_ctx *ctx, const char *str, int bijective) { isl_map *map; map = isl_map_read_from_str(ctx, str); if (bijective) assert(isl_map_is_bijective(map)); else assert(!isl_map_is_bijective(map)); isl_map_free(map); } void test_bijective(struct isl_ctx *ctx) { test_bijective_case(ctx, "[N,M]->{[i,j] -> [i]}", 0); test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=i}", 1); test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=0}", 1); test_bijective_case(ctx, "[N,M]->{[i,j] -> [i] : j=N}", 1); test_bijective_case(ctx, "[N,M]->{[i,j] -> [j,i]}", 1); test_bijective_case(ctx, "[N,M]->{[i,j] -> [i+j]}", 0); test_bijective_case(ctx, "[N,M]->{[i,j] -> []}", 0); test_bijective_case(ctx, "[N,M]->{[i,j] -> [i,j,N]}", 1); test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i]}", 0); test_bijective_case(ctx, "[N,M]->{[i,j] -> [i,i]}", 0); test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i,i]}", 0); test_bijective_case(ctx, "[N,M]->{[i,j] -> [2i,j]}", 1); test_bijective_case(ctx, "[N,M]->{[i,j] -> [x,y] : 2x=i & y =j}", 1); } static int test_pwqp(struct isl_ctx *ctx) { const char *str; isl_set *set; isl_pw_qpolynomial *pwqp1, *pwqp2; int equal; str = "{ [i,j,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_move_dims(pwqp1, isl_dim_param, 0, isl_dim_in, 1, 1); str = "[j] -> { [i,k] -> 1 + 9 * [i/5] + 7 * [j/11] + 4 * [k/13] }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); str = "{ [i] -> i }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); str = "{ [k] : exists a : k = 2a }"; set = isl_set_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set); str = "{ [i] -> i }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); str = "{ [i] -> i + [ (i + [i/3])/2 ] }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); str = "{ [10] }"; set = isl_set_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set); str = "{ [i] -> 16 }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); str = "{ [i] -> ([(i)/2]) }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); str = "{ [k] : exists a : k = 2a+1 }"; set = isl_set_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_gist(pwqp1, set); str = "{ [i] -> -1/2 + 1/2 * i }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); str = "{ [i] -> ([([i/2] + [i/2])/5]) }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); str = "{ [i] -> ([(2 * [i/2])/5]) }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); str = "{ [x] -> ([x/2] + [(x+1)/2]) }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); str = "{ [x] -> x }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); str = "{ [i] -> ([i/2]) : i >= 0; [i] -> ([i/3]) : i < 0 }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_coalesce(pwqp1); pwqp1 = isl_pw_qpolynomial_sub(pwqp1, pwqp2); assert(isl_pw_qpolynomial_is_zero(pwqp1)); isl_pw_qpolynomial_free(pwqp1); str = "{ [a,b,a] -> (([(2*[a/3]+b)/5]) * ([(2*[a/3]+b)/5])) }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); str = "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); set = isl_set_read_from_str(ctx, "{ [a,b,a] }"); pwqp1 = isl_pw_qpolynomial_intersect_domain(pwqp1, set); equal = isl_pw_qpolynomial_plain_is_equal(pwqp1, pwqp2); isl_pw_qpolynomial_free(pwqp1); isl_pw_qpolynomial_free(pwqp2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); str = "{ [a,b,c] -> (([(2*[a/3]+1)/5]) * ([(2*[c/3]+1)/5])) : b = 1 }"; pwqp2 = isl_pw_qpolynomial_read_from_str(ctx, str); str = "{ [a,b,c] -> (([(2*[a/3]+b)/5]) * ([(2*[c/3]+b)/5])) }"; pwqp1 = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp1 = isl_pw_qpolynomial_fix_val(pwqp1, isl_dim_set, 1, isl_val_one(ctx)); equal = isl_pw_qpolynomial_plain_is_equal(pwqp1, pwqp2); isl_pw_qpolynomial_free(pwqp1); isl_pw_qpolynomial_free(pwqp2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); return 0; } void test_split_periods(isl_ctx *ctx) { const char *str; isl_pw_qpolynomial *pwqp; str = "{ [U,V] -> 1/3 * U + 2/3 * V - [(U + 2V)/3] + [U/2] : " "U + 2V + 3 >= 0 and - U -2V >= 0 and - U + 10 >= 0 and " "U >= 0; [U,V] -> U^2 : U >= 100 }"; pwqp = isl_pw_qpolynomial_read_from_str(ctx, str); pwqp = isl_pw_qpolynomial_split_periods(pwqp, 2); assert(pwqp); isl_pw_qpolynomial_free(pwqp); } void test_union(isl_ctx *ctx) { const char *str; isl_union_set *uset1, *uset2; isl_union_map *umap1, *umap2; str = "{ [i] : 0 <= i <= 1 }"; uset1 = isl_union_set_read_from_str(ctx, str); str = "{ [1] -> [0] }"; umap1 = isl_union_map_read_from_str(ctx, str); umap2 = isl_union_set_lex_gt_union_set(isl_union_set_copy(uset1), uset1); assert(isl_union_map_is_equal(umap1, umap2)); isl_union_map_free(umap1); isl_union_map_free(umap2); str = "{ A[i] -> B[i]; B[i] -> C[i]; A[0] -> C[1] }"; umap1 = isl_union_map_read_from_str(ctx, str); str = "{ A[i]; B[i] }"; uset1 = isl_union_set_read_from_str(ctx, str); uset2 = isl_union_map_domain(umap1); assert(isl_union_set_is_equal(uset1, uset2)); isl_union_set_free(uset1); isl_union_set_free(uset2); } void test_bound(isl_ctx *ctx) { const char *str; isl_pw_qpolynomial *pwqp; isl_pw_qpolynomial_fold *pwf; str = "{ [[a, b, c, d] -> [e]] -> 0 }"; pwqp = isl_pw_qpolynomial_read_from_str(ctx, str); pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL); assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in) == 4); isl_pw_qpolynomial_fold_free(pwf); str = "{ [[x]->[x]] -> 1 : exists a : x = 2 a }"; pwqp = isl_pw_qpolynomial_read_from_str(ctx, str); pwf = isl_pw_qpolynomial_bound(pwqp, isl_fold_max, NULL); assert(isl_pw_qpolynomial_fold_dim(pwf, isl_dim_in) == 1); isl_pw_qpolynomial_fold_free(pwf); } void test_lift(isl_ctx *ctx) { const char *str; isl_basic_map *bmap; isl_basic_set *bset; str = "{ [i0] : exists e0 : i0 = 4e0 }"; bset = isl_basic_set_read_from_str(ctx, str); bset = isl_basic_set_lift(bset); bmap = isl_basic_map_from_range(bset); bset = isl_basic_map_domain(bmap); isl_basic_set_free(bset); } struct { const char *set1; const char *set2; int subset; } subset_tests[] = { { "{ [112, 0] }", "{ [i0, i1] : exists (e0 = [(i0 - i1)/16], e1: " "16e0 <= i0 - i1 and 16e0 >= -15 + i0 - i1 and " "16e1 <= i1 and 16e0 >= -i1 and 16e1 >= -i0 + i1) }", 1 }, { "{ [65] }", "{ [i] : exists (e0 = [(255i)/256], e1 = [(127i + 65e0)/191], " "e2 = [(3i + 61e1)/65], e3 = [(52i + 12e2)/61], " "e4 = [(2i + e3)/3], e5 = [(4i + e3)/4], e6 = [(8i + e3)/12]: " "3e4 = 2i + e3 and 4e5 = 4i + e3 and 12e6 = 8i + e3 and " "i <= 255 and 64e3 >= -45 + 67i and i >= 0 and " "256e0 <= 255i and 256e0 >= -255 + 255i and " "191e1 <= 127i + 65e0 and 191e1 >= -190 + 127i + 65e0 and " "65e2 <= 3i + 61e1 and 65e2 >= -64 + 3i + 61e1 and " "61e3 <= 52i + 12e2 and 61e3 >= -60 + 52i + 12e2) }", 1 }, { "{ [i] : 0 <= i <= 10 }", "{ rat: [i] : 0 <= i <= 10 }", 1 }, { "{ rat: [i] : 0 <= i <= 10 }", "{ [i] : 0 <= i <= 10 }", 0 }, { "{ rat: [0] }", "{ [i] : 0 <= i <= 10 }", 1 }, { "{ rat: [(1)/2] }", "{ [i] : 0 <= i <= 10 }", 0 }, }; static int test_subset(isl_ctx *ctx) { int i; isl_set *set1, *set2; int subset; for (i = 0; i < ARRAY_SIZE(subset_tests); ++i) { set1 = isl_set_read_from_str(ctx, subset_tests[i].set1); set2 = isl_set_read_from_str(ctx, subset_tests[i].set2); subset = isl_set_is_subset(set1, set2); isl_set_free(set1); isl_set_free(set2); if (subset < 0) return -1; if (subset != subset_tests[i].subset) isl_die(ctx, isl_error_unknown, "incorrect subset result", return -1); } return 0; } struct { const char *minuend; const char *subtrahend; const char *difference; } subtract_domain_tests[] = { { "{ A[i] -> B[i] }", "{ A[i] }", "{ }" }, { "{ A[i] -> B[i] }", "{ B[i] }", "{ A[i] -> B[i] }" }, { "{ A[i] -> B[i] }", "{ A[i] : i > 0 }", "{ A[i] -> B[i] : i <= 0 }" }, }; static int test_subtract(isl_ctx *ctx) { int i; isl_union_map *umap1, *umap2; isl_union_set *uset; int equal; for (i = 0; i < ARRAY_SIZE(subtract_domain_tests); ++i) { umap1 = isl_union_map_read_from_str(ctx, subtract_domain_tests[i].minuend); uset = isl_union_set_read_from_str(ctx, subtract_domain_tests[i].subtrahend); umap2 = isl_union_map_read_from_str(ctx, subtract_domain_tests[i].difference); umap1 = isl_union_map_subtract_domain(umap1, uset); equal = isl_union_map_is_equal(umap1, umap2); isl_union_map_free(umap1); isl_union_map_free(umap2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "incorrect subtract domain result", return -1); } return 0; } int test_factorize(isl_ctx *ctx) { const char *str; isl_basic_set *bset; isl_factorizer *f; str = "{ [i0, i1, i2, i3, i4, i5, i6, i7] : 3i5 <= 2 - 2i0 and " "i0 >= -2 and i6 >= 1 + i3 and i7 >= 0 and 3i5 >= -2i0 and " "2i4 <= i2 and i6 >= 1 + 2i0 + 3i1 and i4 <= -1 and " "i6 >= 1 + 2i0 + 3i5 and i6 <= 2 + 2i0 + 3i5 and " "3i5 <= 2 - 2i0 - i2 + 3i4 and i6 <= 2 + 2i0 + 3i1 and " "i0 <= -1 and i7 <= i2 + i3 - 3i4 - i6 and " "3i5 >= -2i0 - i2 + 3i4 }"; bset = isl_basic_set_read_from_str(ctx, str); f = isl_basic_set_factorizer(bset); isl_basic_set_free(bset); isl_factorizer_free(f); if (!f) isl_die(ctx, isl_error_unknown, "failed to construct factorizer", return -1); str = "{ [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12] : " "i12 <= 2 + i0 - i11 and 2i8 >= -i4 and i11 >= i1 and " "3i5 <= -i2 and 2i11 >= -i4 - 2i7 and i11 <= 3 + i0 + 3i9 and " "i11 <= -i4 - 2i7 and i12 >= -i10 and i2 >= -2 and " "i11 >= i1 + 3i10 and i11 >= 1 + i0 + 3i9 and " "i11 <= 1 - i4 - 2i8 and 6i6 <= 6 - i2 and 3i6 >= 1 - i2 and " "i11 <= 2 + i1 and i12 <= i4 + i11 and i12 >= i0 - i11 and " "3i5 >= -2 - i2 and i12 >= -1 + i4 + i11 and 3i3 <= 3 - i2 and " "9i6 <= 11 - i2 + 6i5 and 3i3 >= 1 - i2 and " "9i6 <= 5 - i2 + 6i3 and i12 <= -1 and i2 <= 0 }"; bset = isl_basic_set_read_from_str(ctx, str); f = isl_basic_set_factorizer(bset); isl_basic_set_free(bset); isl_factorizer_free(f); if (!f) isl_die(ctx, isl_error_unknown, "failed to construct factorizer", return -1); return 0; } static int check_injective(__isl_take isl_map *map, void *user) { int *injective = user; *injective = isl_map_is_injective(map); isl_map_free(map); if (*injective < 0 || !*injective) return -1; return 0; } int test_one_schedule(isl_ctx *ctx, const char *d, const char *w, const char *r, const char *s, int tilable, int parallel) { int i; isl_union_set *D; isl_union_map *W, *R, *S; isl_union_map *empty; isl_union_map *dep_raw, *dep_war, *dep_waw, *dep; isl_union_map *validity, *proximity; isl_union_map *schedule; isl_union_map *test; isl_union_set *delta; isl_union_set *domain; isl_set *delta_set; isl_set *slice; isl_set *origin; isl_schedule *sched; int is_nonneg, is_parallel, is_tilable, is_injection, is_complete; D = isl_union_set_read_from_str(ctx, d); W = isl_union_map_read_from_str(ctx, w); R = isl_union_map_read_from_str(ctx, r); S = isl_union_map_read_from_str(ctx, s); W = isl_union_map_intersect_domain(W, isl_union_set_copy(D)); R = isl_union_map_intersect_domain(R, isl_union_set_copy(D)); empty = isl_union_map_empty(isl_union_map_get_space(S)); isl_union_map_compute_flow(isl_union_map_copy(R), isl_union_map_copy(W), empty, isl_union_map_copy(S), &dep_raw, NULL, NULL, NULL); isl_union_map_compute_flow(isl_union_map_copy(W), isl_union_map_copy(W), isl_union_map_copy(R), isl_union_map_copy(S), &dep_waw, &dep_war, NULL, NULL); dep = isl_union_map_union(dep_waw, dep_war); dep = isl_union_map_union(dep, dep_raw); validity = isl_union_map_copy(dep); proximity = isl_union_map_copy(dep); sched = isl_union_set_compute_schedule(isl_union_set_copy(D), validity, proximity); schedule = isl_schedule_get_map(sched); isl_schedule_free(sched); isl_union_map_free(W); isl_union_map_free(R); isl_union_map_free(S); is_injection = 1; isl_union_map_foreach_map(schedule, &check_injective, &is_injection); domain = isl_union_map_domain(isl_union_map_copy(schedule)); is_complete = isl_union_set_is_subset(D, domain); isl_union_set_free(D); isl_union_set_free(domain); test = isl_union_map_reverse(isl_union_map_copy(schedule)); test = isl_union_map_apply_range(test, dep); test = isl_union_map_apply_range(test, schedule); delta = isl_union_map_deltas(test); if (isl_union_set_n_set(delta) == 0) { is_tilable = 1; is_parallel = 1; is_nonneg = 1; isl_union_set_free(delta); } else { delta_set = isl_set_from_union_set(delta); slice = isl_set_universe(isl_set_get_space(delta_set)); for (i = 0; i < tilable; ++i) slice = isl_set_lower_bound_si(slice, isl_dim_set, i, 0); is_tilable = isl_set_is_subset(delta_set, slice); isl_set_free(slice); slice = isl_set_universe(isl_set_get_space(delta_set)); for (i = 0; i < parallel; ++i) slice = isl_set_fix_si(slice, isl_dim_set, i, 0); is_parallel = isl_set_is_subset(delta_set, slice); isl_set_free(slice); origin = isl_set_universe(isl_set_get_space(delta_set)); for (i = 0; i < isl_set_dim(origin, isl_dim_set); ++i) origin = isl_set_fix_si(origin, isl_dim_set, i, 0); delta_set = isl_set_union(delta_set, isl_set_copy(origin)); delta_set = isl_set_lexmin(delta_set); is_nonneg = isl_set_is_equal(delta_set, origin); isl_set_free(origin); isl_set_free(delta_set); } if (is_nonneg < 0 || is_parallel < 0 || is_tilable < 0 || is_injection < 0 || is_complete < 0) return -1; if (!is_complete) isl_die(ctx, isl_error_unknown, "generated schedule incomplete", return -1); if (!is_injection) isl_die(ctx, isl_error_unknown, "generated schedule not injective on each statement", return -1); if (!is_nonneg) isl_die(ctx, isl_error_unknown, "negative dependences in generated schedule", return -1); if (!is_tilable) isl_die(ctx, isl_error_unknown, "generated schedule not as tilable as expected", return -1); if (!is_parallel) isl_die(ctx, isl_error_unknown, "generated schedule not as parallel as expected", return -1); return 0; } static __isl_give isl_union_map *compute_schedule(isl_ctx *ctx, const char *domain, const char *validity, const char *proximity) { isl_union_set *dom; isl_union_map *dep; isl_union_map *prox; isl_schedule *schedule; isl_union_map *sched; dom = isl_union_set_read_from_str(ctx, domain); dep = isl_union_map_read_from_str(ctx, validity); prox = isl_union_map_read_from_str(ctx, proximity); schedule = isl_union_set_compute_schedule(dom, dep, prox); sched = isl_schedule_get_map(schedule); isl_schedule_free(schedule); return sched; } /* Check that a schedule can be constructed on the given domain * with the given validity and proximity constraints. */ static int test_has_schedule(isl_ctx *ctx, const char *domain, const char *validity, const char *proximity) { isl_union_map *sched; sched = compute_schedule(ctx, domain, validity, proximity); if (!sched) return -1; isl_union_map_free(sched); return 0; } int test_special_schedule(isl_ctx *ctx, const char *domain, const char *validity, const char *proximity, const char *expected_sched) { isl_union_map *sched1, *sched2; int equal; sched1 = compute_schedule(ctx, domain, validity, proximity); sched2 = isl_union_map_read_from_str(ctx, expected_sched); equal = isl_union_map_is_equal(sched1, sched2); isl_union_map_free(sched1); isl_union_map_free(sched2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected schedule", return -1); return 0; } /* Check that the schedule map is properly padded, even after being * reconstructed from the band forest. */ static int test_padded_schedule(isl_ctx *ctx) { const char *str; isl_union_set *D; isl_union_map *validity, *proximity; isl_schedule *sched; isl_union_map *map1, *map2; isl_band_list *list; int equal; str = "[N] -> { S0[i] : 0 <= i <= N; S1[i, j] : 0 <= i, j <= N }"; D = isl_union_set_read_from_str(ctx, str); validity = isl_union_map_empty(isl_union_set_get_space(D)); proximity = isl_union_map_copy(validity); sched = isl_union_set_compute_schedule(D, validity, proximity); map1 = isl_schedule_get_map(sched); list = isl_schedule_get_band_forest(sched); isl_band_list_free(list); map2 = isl_schedule_get_map(sched); isl_schedule_free(sched); equal = isl_union_map_is_equal(map1, map2); isl_union_map_free(map1); isl_union_map_free(map2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "reconstructed schedule map not the same as original", return -1); return 0; } int test_schedule(isl_ctx *ctx) { const char *D, *W, *R, *V, *P, *S; /* Handle resulting schedule with zero bands. */ if (test_one_schedule(ctx, "{[]}", "{}", "{}", "{[] -> []}", 0, 0) < 0) return -1; /* Jacobi */ D = "[T,N] -> { S1[t,i] : 1 <= t <= T and 2 <= i <= N - 1 }"; W = "{ S1[t,i] -> a[t,i] }"; R = "{ S1[t,i] -> a[t-1,i]; S1[t,i] -> a[t-1,i-1]; " "S1[t,i] -> a[t-1,i+1] }"; S = "{ S1[t,i] -> [t,i] }"; if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0) return -1; /* Fig. 5 of CC2008 */ D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and j >= 2 and " "j <= -1 + N }"; W = "[N] -> { S_0[i, j] -> a[i, j] : i >= 0 and i <= -1 + N and " "j >= 2 and j <= -1 + N }"; R = "[N] -> { S_0[i, j] -> a[j, i] : i >= 0 and i <= -1 + N and " "j >= 2 and j <= -1 + N; " "S_0[i, j] -> a[i, -1 + j] : i >= 0 and i <= -1 + N and " "j >= 2 and j <= -1 + N }"; S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }"; if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0) return -1; D = "{ S1[i] : 0 <= i <= 10; S2[i] : 0 <= i <= 9 }"; W = "{ S1[i] -> a[i] }"; R = "{ S2[i] -> a[i+1] }"; S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }"; if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0) return -1; D = "{ S1[i] : 0 <= i < 10; S2[i] : 0 <= i < 10 }"; W = "{ S1[i] -> a[i] }"; R = "{ S2[i] -> a[9-i] }"; S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }"; if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0) return -1; D = "[N] -> { S1[i] : 0 <= i < N; S2[i] : 0 <= i < N }"; W = "{ S1[i] -> a[i] }"; R = "[N] -> { S2[i] -> a[N-1-i] }"; S = "{ S1[i] -> [0,i]; S2[i] -> [1,i] }"; if (test_one_schedule(ctx, D, W, R, S, 1, 1) < 0) return -1; D = "{ S1[i] : 0 < i < 10; S2[i] : 0 <= i < 10 }"; W = "{ S1[i] -> a[i]; S2[i] -> b[i] }"; R = "{ S2[i] -> a[i]; S1[i] -> b[i-1] }"; S = "{ S1[i] -> [i,0]; S2[i] -> [i,1] }"; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }"; W = "{ S1[i] -> a[0,i]; S2[i,j] -> a[i,j] }"; R = "{ S2[i,j] -> a[i-1,j] }"; S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }"; if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0) return -1; D = "[N] -> { S1[i] : 1 <= i <= N; S2[i,j] : 1 <= i,j <= N }"; W = "{ S1[i] -> a[i,0]; S2[i,j] -> a[i,j] }"; R = "{ S2[i,j] -> a[i,j-1] }"; S = "{ S1[i] -> [0,i,0]; S2[i,j] -> [1,i,j] }"; if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0) return -1; D = "[N] -> { S_0[]; S_1[i] : i >= 0 and i <= -1 + N; S_2[] }"; W = "[N] -> { S_0[] -> a[0]; S_2[] -> b[0]; " "S_1[i] -> a[1 + i] : i >= 0 and i <= -1 + N }"; R = "[N] -> { S_2[] -> a[N]; S_1[i] -> a[i] : i >= 0 and i <= -1 + N }"; S = "[N] -> { S_1[i] -> [1, i, 0]; S_2[] -> [2, 0, 1]; " "S_0[] -> [0, 0, 0] }"; if (test_one_schedule(ctx, D, W, R, S, 1, 0) < 0) return -1; ctx->opt->schedule_parametric = 0; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; ctx->opt->schedule_parametric = 1; D = "[N] -> { S1[i] : 1 <= i <= N; S2[i] : 1 <= i <= N; " "S3[i,j] : 1 <= i,j <= N; S4[i] : 1 <= i <= N }"; W = "{ S1[i] -> a[i,0]; S2[i] -> a[0,i]; S3[i,j] -> a[i,j] }"; R = "[N] -> { S3[i,j] -> a[i-1,j]; S3[i,j] -> a[i,j-1]; " "S4[i] -> a[i,N] }"; S = "{ S1[i] -> [0,i,0]; S2[i] -> [1,i,0]; S3[i,j] -> [2,i,j]; " "S4[i] -> [4,i,0] }"; if (test_one_schedule(ctx, D, W, R, S, 2, 0) < 0) return -1; D = "[N] -> { S_0[i, j] : i >= 1 and i <= N and j >= 1 and j <= N }"; W = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and " "j <= N }"; R = "[N] -> { S_0[i, j] -> s[0] : i >= 1 and i <= N and j >= 1 and " "j <= N; " "S_0[i, j] -> a[i, j] : i >= 1 and i <= N and j >= 1 and " "j <= N }"; S = "[N] -> { S_0[i, j] -> [0, i, 0, j, 0] }"; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; D = "[N] -> { S_0[t] : t >= 0 and t <= -1 + N; " " S_2[t] : t >= 0 and t <= -1 + N; " " S_1[t, i] : t >= 0 and t <= -1 + N and i >= 0 and " "i <= -1 + N }"; W = "[N] -> { S_0[t] -> a[t, 0] : t >= 0 and t <= -1 + N; " " S_2[t] -> b[t] : t >= 0 and t <= -1 + N; " " S_1[t, i] -> a[t, 1 + i] : t >= 0 and t <= -1 + N and " "i >= 0 and i <= -1 + N }"; R = "[N] -> { S_1[t, i] -> a[t, i] : t >= 0 and t <= -1 + N and " "i >= 0 and i <= -1 + N; " " S_2[t] -> a[t, N] : t >= 0 and t <= -1 + N }"; S = "[N] -> { S_2[t] -> [0, t, 2]; S_1[t, i] -> [0, t, 1, i, 0]; " " S_0[t] -> [0, t, 0] }"; if (test_one_schedule(ctx, D, W, R, S, 2, 1) < 0) return -1; ctx->opt->schedule_parametric = 0; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; ctx->opt->schedule_parametric = 1; D = "[N] -> { S1[i,j] : 0 <= i,j < N; S2[i,j] : 0 <= i,j < N }"; S = "{ S1[i,j] -> [0,i,j]; S2[i,j] -> [1,i,j] }"; if (test_one_schedule(ctx, D, "{}", "{}", S, 2, 2) < 0) return -1; D = "[M, N] -> { S_1[i] : i >= 0 and i <= -1 + M; " "S_0[i, j] : i >= 0 and i <= -1 + M and j >= 0 and j <= -1 + N }"; W = "[M, N] -> { S_0[i, j] -> a[j] : i >= 0 and i <= -1 + M and " "j >= 0 and j <= -1 + N; " "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }"; R = "[M, N] -> { S_0[i, j] -> a[0] : i >= 0 and i <= -1 + M and " "j >= 0 and j <= -1 + N; " "S_1[i] -> b[0] : i >= 0 and i <= -1 + M }"; S = "[M, N] -> { S_1[i] -> [1, i, 0]; S_0[i, j] -> [0, i, 0, j, 0] }"; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; D = "{ S_0[i] : i >= 0 }"; W = "{ S_0[i] -> a[i] : i >= 0 }"; R = "{ S_0[i] -> a[0] : i >= 0 }"; S = "{ S_0[i] -> [0, i, 0] }"; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; D = "{ S_0[i] : i >= 0; S_1[i] : i >= 0 }"; W = "{ S_0[i] -> a[i] : i >= 0; S_1[i] -> b[i] : i >= 0 }"; R = "{ S_0[i] -> b[0] : i >= 0; S_1[i] -> a[i] : i >= 0 }"; S = "{ S_1[i] -> [0, i, 1]; S_0[i] -> [0, i, 0] }"; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; D = "[n] -> { S_0[j, k] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }"; W = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }"; R = "[n] -> { S_0[j, k] -> B[j] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0; " "S_0[j, k] -> B[k] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0; " "S_0[j, k] -> A[k] : j <= -1 + n and j >= 0 and " "k <= -1 + n and k >= 0 }"; S = "[n] -> { S_0[j, k] -> [2, j, k] }"; ctx->opt->schedule_outer_zero_distance = 1; if (test_one_schedule(ctx, D, W, R, S, 0, 0) < 0) return -1; ctx->opt->schedule_outer_zero_distance = 0; D = "{Stmt_for_body24[i0, i1, i2, i3]:" "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 6 and i2 >= 2 and " "i2 <= 6 - i1 and i3 >= 0 and i3 <= -1 + i2;" "Stmt_for_body24[i0, i1, 1, 0]:" "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 5;" "Stmt_for_body7[i0, i1, i2]:" "i0 >= 0 and i0 <= 1 and i1 >= 0 and i1 <= 7 and i2 >= 0 and " "i2 <= 7 }"; V = "{Stmt_for_body24[0, i1, i2, i3] -> " "Stmt_for_body24[1, i1, i2, i3]:" "i3 >= 0 and i3 <= -1 + i2 and i1 >= 0 and i2 <= 6 - i1 and " "i2 >= 1;" "Stmt_for_body24[0, i1, i2, i3] -> " "Stmt_for_body7[1, 1 + i1 + i3, 1 + i1 + i2]:" "i3 <= -1 + i2 and i2 <= 6 - i1 and i2 >= 1 and i1 >= 0 and " "i3 >= 0;" "Stmt_for_body24[0, i1, i2, i3] ->" "Stmt_for_body7[1, i1, 1 + i1 + i3]:" "i3 >= 0 and i2 <= 6 - i1 and i1 >= 0 and i3 <= -1 + i2;" "Stmt_for_body7[0, i1, i2] -> Stmt_for_body7[1, i1, i2]:" "(i2 >= 1 + i1 and i2 <= 6 and i1 >= 0 and i1 <= 4) or " "(i2 >= 3 and i2 <= 7 and i1 >= 1 and i2 >= 1 + i1) or " "(i2 >= 0 and i2 <= i1 and i2 >= -7 + i1 and i1 <= 7);" "Stmt_for_body7[0, i1, 1 + i1] -> Stmt_for_body7[1, i1, 1 + i1]:" "i1 <= 6 and i1 >= 0;" "Stmt_for_body7[0, 0, 7] -> Stmt_for_body7[1, 0, 7];" "Stmt_for_body7[i0, i1, i2] -> " "Stmt_for_body24[i0, o1, -1 + i2 - o1, -1 + i1 - o1]:" "i0 >= 0 and i0 <= 1 and o1 >= 0 and i2 >= 1 + i1 and " "o1 <= -2 + i2 and i2 <= 7 and o1 <= -1 + i1;" "Stmt_for_body7[i0, i1, i2] -> " "Stmt_for_body24[i0, i1, o2, -1 - i1 + i2]:" "i0 >= 0 and i0 <= 1 and i1 >= 0 and o2 >= -i1 + i2 and " "o2 >= 1 and o2 <= 6 - i1 and i2 >= 1 + i1 }"; P = V; S = "{ Stmt_for_body24[i0, i1, i2, i3] -> " "[i0, 5i0 + i1, 6i0 + i1 + i2, 1 + 6i0 + i1 + i2 + i3, 1];" "Stmt_for_body7[i0, i1, i2] -> [0, 5i0, 6i0 + i1, 6i0 + i2, 0] }"; if (test_special_schedule(ctx, D, V, P, S) < 0) return -1; D = "{ S_0[i, j] : i >= 1 and i <= 10 and j >= 1 and j <= 8 }"; V = "{ S_0[i, j] -> S_0[i, 1 + j] : i >= 1 and i <= 10 and " "j >= 1 and j <= 7;" "S_0[i, j] -> S_0[1 + i, j] : i >= 1 and i <= 9 and " "j >= 1 and j <= 8 }"; P = "{ }"; S = "{ S_0[i, j] -> [i + j, j] }"; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER; if (test_special_schedule(ctx, D, V, P, S) < 0) return -1; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL; /* Fig. 1 from Feautrier's "Some Efficient Solutions..." pt. 2, 1992 */ D = "[N] -> { S_0[i, j] : i >= 0 and i <= -1 + N and " "j >= 0 and j <= -1 + i }"; V = "[N] -> { S_0[i, j] -> S_0[i, 1 + j] : j <= -2 + i and " "i <= -1 + N and j >= 0;" "S_0[i, -1 + i] -> S_0[1 + i, 0] : i >= 1 and " "i <= -2 + N }"; P = "{ }"; S = "{ S_0[i, j] -> [i, j] }"; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER; if (test_special_schedule(ctx, D, V, P, S) < 0) return -1; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL; /* Test both algorithms on a case with only proximity dependences. */ D = "{ S[i,j] : 0 <= i <= 10 }"; V = "{ }"; P = "{ S[i,j] -> S[i+1,j] : 0 <= i,j <= 10 }"; S = "{ S[i, j] -> [j, i] }"; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER; if (test_special_schedule(ctx, D, V, P, S) < 0) return -1; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL; if (test_special_schedule(ctx, D, V, P, S) < 0) return -1; D = "{ A[a]; B[] }"; V = "{}"; P = "{ A[a] -> B[] }"; if (test_has_schedule(ctx, D, V, P) < 0) return -1; if (test_padded_schedule(ctx) < 0) return -1; /* Check that check for progress is not confused by rational * solution. */ D = "[N] -> { S0[i, j] : i >= 0 and i <= N and j >= 0 and j <= N }"; V = "[N] -> { S0[i0, -1 + N] -> S0[2 + i0, 0] : i0 >= 0 and " "i0 <= -2 + N; " "S0[i0, i1] -> S0[i0, 1 + i1] : i0 >= 0 and " "i0 <= N and i1 >= 0 and i1 <= -1 + N }"; P = "{}"; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_FEAUTRIER; if (test_has_schedule(ctx, D, V, P) < 0) return -1; ctx->opt->schedule_algorithm = ISL_SCHEDULE_ALGORITHM_ISL; return 0; } int test_plain_injective(isl_ctx *ctx, const char *str, int injective) { isl_union_map *umap; int test; umap = isl_union_map_read_from_str(ctx, str); test = isl_union_map_plain_is_injective(umap); isl_union_map_free(umap); if (test < 0) return -1; if (test == injective) return 0; if (injective) isl_die(ctx, isl_error_unknown, "map not detected as injective", return -1); else isl_die(ctx, isl_error_unknown, "map detected as injective", return -1); } int test_injective(isl_ctx *ctx) { const char *str; if (test_plain_injective(ctx, "{S[i,j] -> A[0]; T[i,j] -> B[1]}", 0)) return -1; if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> B[0]}", 1)) return -1; if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[1]}", 1)) return -1; if (test_plain_injective(ctx, "{S[] -> A[0]; T[] -> A[0]}", 0)) return -1; if (test_plain_injective(ctx, "{S[i] -> A[i,0]; T[i] -> A[i,1]}", 1)) return -1; if (test_plain_injective(ctx, "{S[i] -> A[i]; T[i] -> A[i]}", 0)) return -1; if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[0,1]}", 1)) return -1; if (test_plain_injective(ctx, "{S[] -> A[0,0]; T[] -> A[1,0]}", 1)) return -1; str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[1,0]}"; if (test_plain_injective(ctx, str, 1)) return -1; str = "{S[] -> A[0,0]; T[] -> A[0,1]; U[] -> A[0,0]}"; if (test_plain_injective(ctx, str, 0)) return -1; return 0; } static int aff_plain_is_equal(__isl_keep isl_aff *aff, const char *str) { isl_aff *aff2; int equal; if (!aff) return -1; aff2 = isl_aff_read_from_str(isl_aff_get_ctx(aff), str); equal = isl_aff_plain_is_equal(aff, aff2); isl_aff_free(aff2); return equal; } static int aff_check_plain_equal(__isl_keep isl_aff *aff, const char *str) { int equal; equal = aff_plain_is_equal(aff, str); if (equal < 0) return -1; if (!equal) isl_die(isl_aff_get_ctx(aff), isl_error_unknown, "result not as expected", return -1); return 0; } int test_aff(isl_ctx *ctx) { const char *str; isl_set *set; isl_space *space; isl_local_space *ls; isl_aff *aff; int zero, equal; space = isl_space_set_alloc(ctx, 0, 1); ls = isl_local_space_from_space(space); aff = isl_aff_zero_on_domain(ls); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1); aff = isl_aff_scale_down_ui(aff, 3); aff = isl_aff_floor(aff); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1); aff = isl_aff_scale_down_ui(aff, 2); aff = isl_aff_floor(aff); aff = isl_aff_add_coefficient_si(aff, isl_dim_in, 0, 1); str = "{ [10] }"; set = isl_set_read_from_str(ctx, str); aff = isl_aff_gist(aff, set); aff = isl_aff_add_constant_si(aff, -16); zero = isl_aff_plain_is_zero(aff); isl_aff_free(aff); if (zero < 0) return -1; if (!zero) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); aff = isl_aff_read_from_str(ctx, "{ [-1] }"); aff = isl_aff_scale_down_ui(aff, 64); aff = isl_aff_floor(aff); equal = aff_check_plain_equal(aff, "{ [-1] }"); isl_aff_free(aff); if (equal < 0) return -1; return 0; } int test_dim_max(isl_ctx *ctx) { int equal; const char *str; isl_set *set1, *set2; isl_set *set; isl_map *map; isl_pw_aff *pwaff; str = "[N] -> { [i] : 0 <= i <= min(N,10) }"; set = isl_set_read_from_str(ctx, str); pwaff = isl_set_dim_max(set, 0); set1 = isl_set_from_pw_aff(pwaff); str = "[N] -> { [10] : N >= 10; [N] : N <= 9 and N >= 0 }"; set2 = isl_set_read_from_str(ctx, str); equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); str = "[N] -> { [i] : 0 <= i <= max(2N,N+6) }"; set = isl_set_read_from_str(ctx, str); pwaff = isl_set_dim_max(set, 0); set1 = isl_set_from_pw_aff(pwaff); str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }"; set2 = isl_set_read_from_str(ctx, str); equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); str = "[N] -> { [i] : 0 <= i <= 2N or 0 <= i <= N+6 }"; set = isl_set_read_from_str(ctx, str); pwaff = isl_set_dim_max(set, 0); set1 = isl_set_from_pw_aff(pwaff); str = "[N] -> { [6 + N] : -6 <= N <= 5; [2N] : N >= 6 }"; set2 = isl_set_read_from_str(ctx, str); equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); str = "[N,M] -> { [i,j] -> [([i/16]), i%16, ([j/16]), j%16] : " "0 <= i < N and 0 <= j < M }"; map = isl_map_read_from_str(ctx, str); set = isl_map_range(map); pwaff = isl_set_dim_max(isl_set_copy(set), 0); set1 = isl_set_from_pw_aff(pwaff); str = "[N,M] -> { [([(N-1)/16])] : M,N > 0 }"; set2 = isl_set_read_from_str(ctx, str); equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); pwaff = isl_set_dim_max(isl_set_copy(set), 3); set1 = isl_set_from_pw_aff(pwaff); str = "[N,M] -> { [t] : t = min(M-1,15) and M,N > 0 }"; set2 = isl_set_read_from_str(ctx, str); if (equal >= 0 && equal) equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); isl_set_free(set); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); /* Check that solutions are properly merged. */ str = "[n] -> { [a, b, c] : c >= -4a - 2b and " "c <= -1 + n - 4a - 2b and c >= -2b and " "4a >= -4 + n and c >= 0 }"; set = isl_set_read_from_str(ctx, str); pwaff = isl_set_dim_min(set, 2); set1 = isl_set_from_pw_aff(pwaff); str = "[n] -> { [(0)] : n >= 1 }"; set2 = isl_set_read_from_str(ctx, str); equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); return 0; } /* Is "pma" obviously equal to the isl_pw_multi_aff represented by "str"? */ static int pw_multi_aff_plain_is_equal(__isl_keep isl_pw_multi_aff *pma, const char *str) { isl_ctx *ctx; isl_pw_multi_aff *pma2; int equal; if (!pma) return -1; ctx = isl_pw_multi_aff_get_ctx(pma); pma2 = isl_pw_multi_aff_read_from_str(ctx, str); equal = isl_pw_multi_aff_plain_is_equal(pma, pma2); isl_pw_multi_aff_free(pma2); return equal; } /* Check that "pma" is obviously equal to the isl_pw_multi_aff * represented by "str". */ static int pw_multi_aff_check_plain_equal(__isl_keep isl_pw_multi_aff *pma, const char *str) { int equal; equal = pw_multi_aff_plain_is_equal(pma, str); if (equal < 0) return -1; if (!equal) isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_unknown, "result not as expected", return -1); return 0; } /* Basic test for isl_pw_multi_aff_product. * * Check that multiple pieces are properly handled. */ static int test_product_pma(isl_ctx *ctx) { int equal; const char *str; isl_pw_multi_aff *pma1, *pma2; str = "{ A[i] -> B[1] : i < 0; A[i] -> B[2] : i >= 0 }"; pma1 = isl_pw_multi_aff_read_from_str(ctx, str); str = "{ C[] -> D[] }"; pma2 = isl_pw_multi_aff_read_from_str(ctx, str); pma1 = isl_pw_multi_aff_product(pma1, pma2); str = "{ [A[i] -> C[]] -> [B[(1)] -> D[]] : i < 0;" "[A[i] -> C[]] -> [B[(2)] -> D[]] : i >= 0 }"; equal = pw_multi_aff_check_plain_equal(pma1, str); isl_pw_multi_aff_free(pma1); if (equal < 0) return -1; return 0; } int test_product(isl_ctx *ctx) { const char *str; isl_set *set; isl_union_set *uset1, *uset2; int ok; str = "{ A[i] }"; set = isl_set_read_from_str(ctx, str); set = isl_set_product(set, isl_set_copy(set)); ok = isl_set_is_wrapping(set); isl_set_free(set); if (ok < 0) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); str = "{ [] }"; uset1 = isl_union_set_read_from_str(ctx, str); uset1 = isl_union_set_product(uset1, isl_union_set_copy(uset1)); str = "{ [[] -> []] }"; uset2 = isl_union_set_read_from_str(ctx, str); ok = isl_union_set_is_equal(uset1, uset2); isl_union_set_free(uset1); isl_union_set_free(uset2); if (ok < 0) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); if (test_product_pma(ctx) < 0) return -1; return 0; } int test_equal(isl_ctx *ctx) { const char *str; isl_set *set, *set2; int equal; str = "{ S_6[i] }"; set = isl_set_read_from_str(ctx, str); str = "{ S_7[i] }"; set2 = isl_set_read_from_str(ctx, str); equal = isl_set_is_equal(set, set2); isl_set_free(set); isl_set_free(set2); if (equal < 0) return -1; if (equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); return 0; } static int test_plain_fixed(isl_ctx *ctx, __isl_take isl_map *map, enum isl_dim_type type, unsigned pos, int fixed) { int test; test = isl_map_plain_is_fixed(map, type, pos, NULL); isl_map_free(map); if (test < 0) return -1; if (test == fixed) return 0; if (fixed) isl_die(ctx, isl_error_unknown, "map not detected as fixed", return -1); else isl_die(ctx, isl_error_unknown, "map detected as fixed", return -1); } int test_fixed(isl_ctx *ctx) { const char *str; isl_map *map; str = "{ [i] -> [i] }"; map = isl_map_read_from_str(ctx, str); if (test_plain_fixed(ctx, map, isl_dim_out, 0, 0)) return -1; str = "{ [i] -> [1] }"; map = isl_map_read_from_str(ctx, str); if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1)) return -1; str = "{ S_1[p1] -> [o0] : o0 = -2 and p1 >= 1 and p1 <= 7 }"; map = isl_map_read_from_str(ctx, str); if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1)) return -1; map = isl_map_read_from_str(ctx, str); map = isl_map_neg(map); if (test_plain_fixed(ctx, map, isl_dim_out, 0, 1)) return -1; return 0; } int test_vertices(isl_ctx *ctx) { const char *str; isl_basic_set *bset; isl_vertices *vertices; str = "{ A[t, i] : t = 12 and i >= 4 and i <= 12 }"; bset = isl_basic_set_read_from_str(ctx, str); vertices = isl_basic_set_compute_vertices(bset); isl_basic_set_free(bset); isl_vertices_free(vertices); if (!vertices) return -1; str = "{ A[t, i] : t = 14 and i = 1 }"; bset = isl_basic_set_read_from_str(ctx, str); vertices = isl_basic_set_compute_vertices(bset); isl_basic_set_free(bset); isl_vertices_free(vertices); if (!vertices) return -1; return 0; } int test_union_pw(isl_ctx *ctx) { int equal; const char *str; isl_union_set *uset; isl_union_pw_qpolynomial *upwqp1, *upwqp2; str = "{ [x] -> x^2 }"; upwqp1 = isl_union_pw_qpolynomial_read_from_str(ctx, str); upwqp2 = isl_union_pw_qpolynomial_copy(upwqp1); uset = isl_union_pw_qpolynomial_domain(upwqp1); upwqp1 = isl_union_pw_qpolynomial_copy(upwqp2); upwqp1 = isl_union_pw_qpolynomial_intersect_domain(upwqp1, uset); equal = isl_union_pw_qpolynomial_plain_is_equal(upwqp1, upwqp2); isl_union_pw_qpolynomial_free(upwqp1); isl_union_pw_qpolynomial_free(upwqp2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); return 0; } int test_output(isl_ctx *ctx) { char *s; const char *str; isl_pw_aff *pa; isl_printer *p; int equal; str = "[x] -> { [1] : x % 4 <= 2; [2] : x = 3 }"; pa = isl_pw_aff_read_from_str(ctx, str); p = isl_printer_to_str(ctx); p = isl_printer_set_output_format(p, ISL_FORMAT_C); p = isl_printer_print_pw_aff(p, pa); s = isl_printer_get_str(p); isl_printer_free(p); isl_pw_aff_free(pa); if (!s) equal = -1; else equal = !strcmp(s, "(2 - x + 4*floord(x, 4) >= 0) ? (1) : 2"); free(s); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "unexpected result", return -1); return 0; } int test_sample(isl_ctx *ctx) { const char *str; isl_basic_set *bset1, *bset2; int empty, subset; str = "{ [a, b, c, d, e, f, g, h, i, j, k] : " "3i >= 1073741823b - c - 1073741823e + f and c >= 0 and " "3i >= -1 + 3221225466b + c + d - 3221225466e - f and " "2e >= a - b and 3e <= 2a and 3k <= -a and f <= -1 + a and " "3i <= 4 - a + 4b + 2c - e - 2f and 3k <= -a + c - f and " "3h >= -2 + a and 3g >= -3 - a and 3k >= -2 - a and " "3i >= -2 - a - 2c + 3e + 2f and 3h <= a + c - f and " "3h >= a + 2147483646b + 2c - 2147483646e - 2f and " "3g <= -1 - a and 3i <= 1 + c + d - f and a <= 1073741823 and " "f >= 1 - a + 1073741822b + c + d - 1073741822e and " "3i >= 1 + 2b - 2c + e + 2f + 3g and " "1073741822f <= 1073741822 - a + 1073741821b + 1073741822c +" "d - 1073741821e and " "3j <= 3 - a + 3b and 3g <= -2 - 2b + c + d - e - f and " "3j >= 1 - a + b + 2e and " "3f >= -3 + a + 3221225462b + 3c + d - 3221225465e and " "3i <= 4 - a + 4b - e and " "f <= 1073741822 + 1073741822b - 1073741822e and 3h <= a and " "f >= 0 and 2e <= 4 - a + 5b - d and 2e <= a - b + d and " "c <= -1 + a and 3i >= -2 - a + 3e and " "1073741822e <= 1073741823 - a + 1073741822b + c and " "3g >= -4 + 3221225464b + 3c + d - 3221225467e - 3f and " "3i >= -1 + 3221225466b + 3c + d - 3221225466e - 3f and " "1073741823e >= 1 + 1073741823b - d and " "3i >= 1073741823b + c - 1073741823e - f and " "3i >= 1 + 2b + e + 3g }"; bset1 = isl_basic_set_read_from_str(ctx, str); bset2 = isl_basic_set_sample(isl_basic_set_copy(bset1)); empty = isl_basic_set_is_empty(bset2); subset = isl_basic_set_is_subset(bset2, bset1); isl_basic_set_free(bset1); isl_basic_set_free(bset2); if (empty < 0 || subset < 0) return -1; if (empty) isl_die(ctx, isl_error_unknown, "point not found", return -1); if (!subset) isl_die(ctx, isl_error_unknown, "bad point found", return -1); return 0; } int test_fixed_power(isl_ctx *ctx) { const char *str; isl_map *map; isl_int exp; int equal; isl_int_init(exp); str = "{ [i] -> [i + 1] }"; map = isl_map_read_from_str(ctx, str); isl_int_set_si(exp, 23); map = isl_map_fixed_power(map, exp); equal = map_check_equal(map, "{ [i] -> [i + 23] }"); isl_int_clear(exp); isl_map_free(map); if (equal < 0) return -1; return 0; } int test_slice(isl_ctx *ctx) { const char *str; isl_map *map; int equal; str = "{ [i] -> [j] }"; map = isl_map_read_from_str(ctx, str); map = isl_map_equate(map, isl_dim_in, 0, isl_dim_out, 0); equal = map_check_equal(map, "{ [i] -> [i] }"); isl_map_free(map); if (equal < 0) return -1; str = "{ [i] -> [j] }"; map = isl_map_read_from_str(ctx, str); map = isl_map_equate(map, isl_dim_in, 0, isl_dim_in, 0); equal = map_check_equal(map, "{ [i] -> [j] }"); isl_map_free(map); if (equal < 0) return -1; str = "{ [i] -> [j] }"; map = isl_map_read_from_str(ctx, str); map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_out, 0); equal = map_check_equal(map, "{ [i] -> [-i] }"); isl_map_free(map); if (equal < 0) return -1; str = "{ [i] -> [j] }"; map = isl_map_read_from_str(ctx, str); map = isl_map_oppose(map, isl_dim_in, 0, isl_dim_in, 0); equal = map_check_equal(map, "{ [0] -> [j] }"); isl_map_free(map); if (equal < 0) return -1; str = "{ [i] -> [j] }"; map = isl_map_read_from_str(ctx, str); map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_out, 0); equal = map_check_equal(map, "{ [i] -> [j] : i > j }"); isl_map_free(map); if (equal < 0) return -1; str = "{ [i] -> [j] }"; map = isl_map_read_from_str(ctx, str); map = isl_map_order_gt(map, isl_dim_in, 0, isl_dim_in, 0); equal = map_check_equal(map, "{ [i] -> [j] : false }"); isl_map_free(map); if (equal < 0) return -1; return 0; } int test_eliminate(isl_ctx *ctx) { const char *str; isl_map *map; int equal; str = "{ [i] -> [j] : i = 2j }"; map = isl_map_read_from_str(ctx, str); map = isl_map_eliminate(map, isl_dim_out, 0, 1); equal = map_check_equal(map, "{ [i] -> [j] : exists a : i = 2a }"); isl_map_free(map); if (equal < 0) return -1; return 0; } /* Check that isl_set_dim_residue_class detects that the values of j * in the set below are all odd and that it does not detect any spurious * strides. */ static int test_residue_class(isl_ctx *ctx) { const char *str; isl_set *set; isl_int m, r; int res; str = "{ [i,j] : j = 4 i + 1 and 0 <= i <= 100; " "[i,j] : j = 4 i + 3 and 500 <= i <= 600 }"; set = isl_set_read_from_str(ctx, str); isl_int_init(m); isl_int_init(r); res = isl_set_dim_residue_class(set, 1, &m, &r); if (res >= 0 && (isl_int_cmp_si(m, 2) != 0 || isl_int_cmp_si(r, 1) != 0)) isl_die(ctx, isl_error_unknown, "incorrect residue class", res = -1); isl_int_clear(r); isl_int_clear(m); isl_set_free(set); return res; } int test_align_parameters(isl_ctx *ctx) { const char *str; isl_space *space; isl_multi_aff *ma1, *ma2; int equal; str = "{ A[B[] -> C[]] -> D[E[] -> F[]] }"; ma1 = isl_multi_aff_read_from_str(ctx, str); space = isl_space_params_alloc(ctx, 1); space = isl_space_set_dim_name(space, isl_dim_param, 0, "N"); ma1 = isl_multi_aff_align_params(ma1, space); str = "[N] -> { A[B[] -> C[]] -> D[E[] -> F[]] }"; ma2 = isl_multi_aff_read_from_str(ctx, str); equal = isl_multi_aff_plain_is_equal(ma1, ma2); isl_multi_aff_free(ma1); isl_multi_aff_free(ma2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "result not as expected", return -1); return 0; } static int test_list(isl_ctx *ctx) { isl_id *a, *b, *c, *d, *id; isl_id_list *list; int ok; a = isl_id_alloc(ctx, "a", NULL); b = isl_id_alloc(ctx, "b", NULL); c = isl_id_alloc(ctx, "c", NULL); d = isl_id_alloc(ctx, "d", NULL); list = isl_id_list_alloc(ctx, 4); list = isl_id_list_add(list, a); list = isl_id_list_add(list, b); list = isl_id_list_add(list, c); list = isl_id_list_add(list, d); list = isl_id_list_drop(list, 1, 1); if (isl_id_list_n_id(list) != 3) { isl_id_list_free(list); isl_die(ctx, isl_error_unknown, "unexpected number of elements in list", return -1); } id = isl_id_list_get_id(list, 0); ok = id == a; isl_id_free(id); id = isl_id_list_get_id(list, 1); ok = ok && id == c; isl_id_free(id); id = isl_id_list_get_id(list, 2); ok = ok && id == d; isl_id_free(id); isl_id_list_free(list); if (!ok) isl_die(ctx, isl_error_unknown, "unexpected elements in list", return -1); return 0; } const char *set_conversion_tests[] = { "[N] -> { [i] : N - 1 <= 2 i <= N }", "[N] -> { [i] : exists a : i = 4 a and N - 1 <= i <= N }", "[N] -> { [i,j] : exists a : i = 4 a and N - 1 <= i, 2j <= N }", "[N] -> { [[i]->[j]] : exists a : i = 4 a and N - 1 <= i, 2j <= N }", }; /* Check that converting from isl_set to isl_pw_multi_aff and back * to isl_set produces the original isl_set. */ static int test_set_conversion(isl_ctx *ctx) { int i; const char *str; isl_set *set1, *set2; isl_pw_multi_aff *pma; int equal; for (i = 0; i < ARRAY_SIZE(set_conversion_tests); ++i) { str = set_conversion_tests[i]; set1 = isl_set_read_from_str(ctx, str); pma = isl_pw_multi_aff_from_set(isl_set_copy(set1)); set2 = isl_set_from_pw_multi_aff(pma); equal = isl_set_is_equal(set1, set2); isl_set_free(set1); isl_set_free(set2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "bad conversion", return -1); } return 0; } /* Check that converting from isl_map to isl_pw_multi_aff and back * to isl_map produces the original isl_map. */ static int test_map_conversion(isl_ctx *ctx) { const char *str; isl_map *map1, *map2; isl_pw_multi_aff *pma; int equal; str = "{ [a, b, c, d] -> s0[a, b, e, f] : " "exists (e0 = [(a - 2c)/3], e1 = [(-4 + b - 5d)/9], " "e2 = [(-d + f)/9]: 3e0 = a - 2c and 9e1 = -4 + b - 5d and " "9e2 = -d + f and f >= 0 and f <= 8 and 9e >= -5 - 2a and " "9e <= -2 - 2a) }"; map1 = isl_map_read_from_str(ctx, str); pma = isl_pw_multi_aff_from_map(isl_map_copy(map1)); map2 = isl_map_from_pw_multi_aff(pma); equal = isl_map_is_equal(map1, map2); isl_map_free(map1); isl_map_free(map2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "bad conversion", return -1); return 0; } static int test_conversion(isl_ctx *ctx) { if (test_set_conversion(ctx) < 0) return -1; if (test_map_conversion(ctx) < 0) return -1; return 0; } /* Check that isl_basic_map_curry does not modify input. */ static int test_curry(isl_ctx *ctx) { const char *str; isl_basic_map *bmap1, *bmap2; int equal; str = "{ [A[] -> B[]] -> C[] }"; bmap1 = isl_basic_map_read_from_str(ctx, str); bmap2 = isl_basic_map_curry(isl_basic_map_copy(bmap1)); equal = isl_basic_map_is_equal(bmap1, bmap2); isl_basic_map_free(bmap1); isl_basic_map_free(bmap2); if (equal < 0) return -1; if (equal) isl_die(ctx, isl_error_unknown, "curried map should not be equal to original", return -1); return 0; } struct { const char *set; const char *ma; const char *res; } preimage_tests[] = { { "{ B[i,j] : 0 <= i < 10 and 0 <= j < 100 }", "{ A[j,i] -> B[i,j] }", "{ A[j,i] : 0 <= i < 10 and 0 <= j < 100 }" }, { "{ rat: B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }", "{ A[a,b] -> B[a/2,b/6] }", "{ rat: A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 }" }, { "{ B[i,j] : 0 <= i, j and 3 i + 5 j <= 100 }", "{ A[a,b] -> B[a/2,b/6] }", "{ A[a,b] : 0 <= a, b and 9 a + 5 b <= 600 and " "exists i,j : a = 2 i and b = 6 j }" }, { "[n] -> { S[i] : 0 <= i <= 100 }", "[n] -> { S[n] }", "[n] -> { : 0 <= n <= 100 }" }, { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }", "{ A[a] -> B[2a] }", "{ A[a] : 0 <= a < 50 and exists b : a = 2 b }" }, { "{ B[i] : 0 <= i < 100 and exists a : i = 4 a }", "{ A[a] -> B[([a/2])] }", "{ A[a] : 0 <= a < 200 and exists b : [a/2] = 4 b }" }, { "{ B[i,j,k] : 0 <= i,j,k <= 100 }", "{ A[a] -> B[a,a,a/3] }", "{ A[a] : 0 <= a <= 100 and exists b : a = 3 b }" }, { "{ B[i,j] : j = [(i)/2] } ", "{ A[i,j] -> B[i/3,j] }", "{ A[i,j] : j = [(i)/6] and exists a : i = 3 a }" }, }; static int test_preimage_basic_set(isl_ctx *ctx) { int i; isl_basic_set *bset1, *bset2; isl_multi_aff *ma; int equal; for (i = 0; i < ARRAY_SIZE(preimage_tests); ++i) { bset1 = isl_basic_set_read_from_str(ctx, preimage_tests[i].set); ma = isl_multi_aff_read_from_str(ctx, preimage_tests[i].ma); bset2 = isl_basic_set_read_from_str(ctx, preimage_tests[i].res); bset1 = isl_basic_set_preimage_multi_aff(bset1, ma); equal = isl_basic_set_is_equal(bset1, bset2); isl_basic_set_free(bset1); isl_basic_set_free(bset2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "bad preimage", return -1); } return 0; } struct { const char *map; const char *ma; const char *res; } preimage_domain_tests[] = { { "{ B[i,j] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }", "{ A[j,i] -> B[i,j] }", "{ A[j,i] -> C[2i + 3j] : 0 <= i < 10 and 0 <= j < 100 }" }, { "{ B[i] -> C[i]; D[i] -> E[i] }", "{ A[i] -> B[i + 1] }", "{ A[i] -> C[i + 1] }" }, { "{ B[i] -> C[i]; B[i] -> E[i] }", "{ A[i] -> B[i + 1] }", "{ A[i] -> C[i + 1]; A[i] -> E[i + 1] }" }, { "{ B[i] -> C[([i/2])] }", "{ A[i] -> B[2i] }", "{ A[i] -> C[i] }" }, { "{ B[i,j] -> C[([i/2]), ([(i+j)/3])] }", "{ A[i] -> B[([i/5]), ([i/7])] }", "{ A[i] -> C[([([i/5])/2]), ([(([i/5])+([i/7]))/3])] }" }, { "[N] -> { B[i] -> C[([N/2]), i, ([N/3])] }", "[N] -> { A[] -> B[([N/5])] }", "[N] -> { A[] -> C[([N/2]), ([N/5]), ([N/3])] }" }, { "{ B[i] -> C[i] : exists a : i = 5 a }", "{ A[i] -> B[2i] }", "{ A[i] -> C[2i] : exists a : 2i = 5 a }" }, { "{ B[i] -> C[i] : exists a : i = 2 a; " "B[i] -> D[i] : exists a : i = 2 a + 1 }", "{ A[i] -> B[2i] }", "{ A[i] -> C[2i] }" }, }; static int test_preimage_union_map(isl_ctx *ctx) { int i; isl_union_map *umap1, *umap2; isl_multi_aff *ma; int equal; for (i = 0; i < ARRAY_SIZE(preimage_domain_tests); ++i) { umap1 = isl_union_map_read_from_str(ctx, preimage_domain_tests[i].map); ma = isl_multi_aff_read_from_str(ctx, preimage_domain_tests[i].ma); umap2 = isl_union_map_read_from_str(ctx, preimage_domain_tests[i].res); umap1 = isl_union_map_preimage_domain_multi_aff(umap1, ma); equal = isl_union_map_is_equal(umap1, umap2); isl_union_map_free(umap1); isl_union_map_free(umap2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "bad preimage", return -1); } return 0; } static int test_preimage(isl_ctx *ctx) { if (test_preimage_basic_set(ctx) < 0) return -1; if (test_preimage_union_map(ctx) < 0) return -1; return 0; } struct { const char *ma1; const char *ma; const char *res; } pullback_tests[] = { { "{ B[i,j] -> C[i + 2j] }" , "{ A[a,b] -> B[b,a] }", "{ A[a,b] -> C[b + 2a] }" }, { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/2] }", "{ A[a] -> C[a] }" }, { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[2a] }", "{ A[a] -> C[a] }" }, { "{ B[i] -> C[(i)/2] }", "{ A[a] -> B[(a)/3] }", "{ A[a] -> C[(a)/6] }" }, { "{ B[i] -> C[2i] }", "{ A[a] -> B[5a] }", "{ A[a] -> C[10a] }" }, { "{ B[i] -> C[2i] }", "{ A[a] -> B[(a)/3] }", "{ A[a] -> C[(2a)/3] }" }, { "{ B[i,j] -> C[i + j] }", "{ A[a] -> B[a,a] }", "{ A[a] -> C[2a] }"}, { "{ B[a] -> C[a,a] }", "{ A[i,j] -> B[i + j] }", "{ A[i,j] -> C[i + j, i + j] }"}, { "{ B[i] -> C[([i/2])] }", "{ B[5] }", "{ C[2] }" }, { "[n] -> { B[i,j] -> C[([i/2]) + 2j] }", "[n] -> { B[n,[n/3]] }", "[n] -> { C[([n/2]) + 2*[n/3]] }", }, }; static int test_pullback(isl_ctx *ctx) { int i; isl_multi_aff *ma1, *ma2; isl_multi_aff *ma; int equal; for (i = 0; i < ARRAY_SIZE(pullback_tests); ++i) { ma1 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma1); ma = isl_multi_aff_read_from_str(ctx, pullback_tests[i].ma); ma2 = isl_multi_aff_read_from_str(ctx, pullback_tests[i].res); ma1 = isl_multi_aff_pullback_multi_aff(ma1, ma); equal = isl_multi_aff_plain_is_equal(ma1, ma2); isl_multi_aff_free(ma1); isl_multi_aff_free(ma2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "bad pullback", return -1); } return 0; } /* Check that negation is printed correctly. */ static int test_ast(isl_ctx *ctx) { isl_ast_expr *expr, *expr1, *expr2, *expr3; char *str; int ok; expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL)); expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL)); expr = isl_ast_expr_add(expr1, expr2); expr = isl_ast_expr_neg(expr); str = isl_ast_expr_to_str(expr); ok = str ? !strcmp(str, "-(A + B)") : -1; free(str); isl_ast_expr_free(expr); if (ok < 0) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "isl_ast_expr printed incorrectly", return -1); expr1 = isl_ast_expr_from_id(isl_id_alloc(ctx, "A", NULL)); expr2 = isl_ast_expr_from_id(isl_id_alloc(ctx, "B", NULL)); expr = isl_ast_expr_add(expr1, expr2); expr3 = isl_ast_expr_from_id(isl_id_alloc(ctx, "C", NULL)); expr = isl_ast_expr_sub(expr3, expr); str = isl_ast_expr_to_str(expr); ok = str ? !strcmp(str, "C - (A + B)") : -1; free(str); isl_ast_expr_free(expr); if (ok < 0) return -1; if (!ok) isl_die(ctx, isl_error_unknown, "isl_ast_expr printed incorrectly", return -1); return 0; } /* Internal data structure for before_for and after_for callbacks. * * depth is the current depth * before is the number of times before_for has been called * after is the number of times after_for has been called */ struct isl_test_codegen_data { int depth; int before; int after; }; /* This function is called before each for loop in the AST generated * from test_ast_gen1. * * Increment the number of calls and the depth. * Check that the space returned by isl_ast_build_get_schedule_space * matches the target space of the schedule returned by * isl_ast_build_get_schedule. * Return an isl_id that is checked by the corresponding call * to after_for. */ static __isl_give isl_id *before_for(__isl_keep isl_ast_build *build, void *user) { struct isl_test_codegen_data *data = user; isl_ctx *ctx; isl_space *space; isl_union_map *schedule; isl_union_set *uset; isl_set *set; int empty; char name[] = "d0"; ctx = isl_ast_build_get_ctx(build); if (data->before >= 3) isl_die(ctx, isl_error_unknown, "unexpected number of for nodes", return NULL); if (data->depth >= 2) isl_die(ctx, isl_error_unknown, "unexpected depth", return NULL); snprintf(name, sizeof(name), "d%d", data->depth); data->before++; data->depth++; schedule = isl_ast_build_get_schedule(build); uset = isl_union_map_range(schedule); if (!uset) return NULL; if (isl_union_set_n_set(uset) != 1) { isl_union_set_free(uset); isl_die(ctx, isl_error_unknown, "expecting single range space", return NULL); } space = isl_ast_build_get_schedule_space(build); set = isl_union_set_extract_set(uset, space); isl_union_set_free(uset); empty = isl_set_is_empty(set); isl_set_free(set); if (empty < 0) return NULL; if (empty) isl_die(ctx, isl_error_unknown, "spaces don't match", return NULL); return isl_id_alloc(ctx, name, NULL); } /* This function is called after each for loop in the AST generated * from test_ast_gen1. * * Increment the number of calls and decrement the depth. * Check that the annotation attached to the node matches * the isl_id returned by the corresponding call to before_for. */ static __isl_give isl_ast_node *after_for(__isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user) { struct isl_test_codegen_data *data = user; isl_id *id; const char *name; int valid; data->after++; data->depth--; if (data->after > data->before) isl_die(isl_ast_node_get_ctx(node), isl_error_unknown, "mismatch in number of for nodes", return isl_ast_node_free(node)); id = isl_ast_node_get_annotation(node); if (!id) isl_die(isl_ast_node_get_ctx(node), isl_error_unknown, "missing annotation", return isl_ast_node_free(node)); name = isl_id_get_name(id); valid = name && atoi(name + 1) == data->depth; isl_id_free(id); if (!valid) isl_die(isl_ast_node_get_ctx(node), isl_error_unknown, "wrong annotation", return isl_ast_node_free(node)); return node; } /* Check that the before_each_for and after_each_for callbacks * are called for each for loop in the generated code, * that they are called in the right order and that the isl_id * returned from the before_each_for callback is attached to * the isl_ast_node passed to the corresponding after_each_for call. */ static int test_ast_gen1(isl_ctx *ctx) { const char *str; isl_set *set; isl_union_map *schedule; isl_ast_build *build; isl_ast_node *tree; struct isl_test_codegen_data data; str = "[N] -> { : N >= 10 }"; set = isl_set_read_from_str(ctx, str); str = "[N] -> { A[i,j] -> S[8,i,3,j] : 0 <= i,j <= N; " "B[i,j] -> S[8,j,9,i] : 0 <= i,j <= N }"; schedule = isl_union_map_read_from_str(ctx, str); data.before = 0; data.after = 0; data.depth = 0; build = isl_ast_build_from_context(set); build = isl_ast_build_set_before_each_for(build, &before_for, &data); build = isl_ast_build_set_after_each_for(build, &after_for, &data); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); if (!tree) return -1; isl_ast_node_free(tree); if (data.before != 3 || data.after != 3) isl_die(ctx, isl_error_unknown, "unexpected number of for nodes", return -1); return 0; } /* Check that the AST generator handles domains that are integrally disjoint * but not ratinoally disjoint. */ static int test_ast_gen2(isl_ctx *ctx) { const char *str; isl_set *set; isl_union_map *schedule; isl_union_map *options; isl_ast_build *build; isl_ast_node *tree; str = "{ A[i,j] -> [i,j] : 0 <= i,j <= 1 }"; schedule = isl_union_map_read_from_str(ctx, str); set = isl_set_universe(isl_space_params_alloc(ctx, 0)); build = isl_ast_build_from_context(set); str = "{ [i,j] -> atomic[1] : i + j = 1; [i,j] -> unroll[1] : i = j }"; options = isl_union_map_read_from_str(ctx, str); build = isl_ast_build_set_options(build, options); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); if (!tree) return -1; isl_ast_node_free(tree); return 0; } /* Increment *user on each call. */ static __isl_give isl_ast_node *count_domains(__isl_take isl_ast_node *node, __isl_keep isl_ast_build *build, void *user) { int *n = user; (*n)++; return node; } /* Test that unrolling tries to minimize the number of instances. * In particular, for the schedule given below, make sure it generates * 3 nodes (rather than 101). */ static int test_ast_gen3(isl_ctx *ctx) { const char *str; isl_set *set; isl_union_map *schedule; isl_union_map *options; isl_ast_build *build; isl_ast_node *tree; int n_domain = 0; str = "[n] -> { A[i] -> [i] : 0 <= i <= 100 and n <= i <= n + 2 }"; schedule = isl_union_map_read_from_str(ctx, str); set = isl_set_universe(isl_space_params_alloc(ctx, 0)); str = "{ [i] -> unroll[0] }"; options = isl_union_map_read_from_str(ctx, str); build = isl_ast_build_from_context(set); build = isl_ast_build_set_options(build, options); build = isl_ast_build_set_at_each_domain(build, &count_domains, &n_domain); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); if (!tree) return -1; isl_ast_node_free(tree); if (n_domain != 3) isl_die(ctx, isl_error_unknown, "unexpected number of for nodes", return -1); return 0; } /* Check that if the ast_build_exploit_nested_bounds options is set, * we do not get an outer if node in the generated AST, * while we do get such an outer if node if the options is not set. */ static int test_ast_gen4(isl_ctx *ctx) { const char *str; isl_set *set; isl_union_map *schedule; isl_ast_build *build; isl_ast_node *tree; enum isl_ast_node_type type; int enb; enb = isl_options_get_ast_build_exploit_nested_bounds(ctx); str = "[N,M] -> { A[i,j] -> [i,j] : 0 <= i <= N and 0 <= j <= M }"; isl_options_set_ast_build_exploit_nested_bounds(ctx, 1); schedule = isl_union_map_read_from_str(ctx, str); set = isl_set_universe(isl_space_params_alloc(ctx, 0)); build = isl_ast_build_from_context(set); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); if (!tree) return -1; type = isl_ast_node_get_type(tree); isl_ast_node_free(tree); if (type == isl_ast_node_if) isl_die(ctx, isl_error_unknown, "not expecting if node", return -1); isl_options_set_ast_build_exploit_nested_bounds(ctx, 0); schedule = isl_union_map_read_from_str(ctx, str); set = isl_set_universe(isl_space_params_alloc(ctx, 0)); build = isl_ast_build_from_context(set); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); if (!tree) return -1; type = isl_ast_node_get_type(tree); isl_ast_node_free(tree); if (type != isl_ast_node_if) isl_die(ctx, isl_error_unknown, "expecting if node", return -1); isl_options_set_ast_build_exploit_nested_bounds(ctx, enb); return 0; } /* This function is called for each leaf in the AST generated * from test_ast_gen5. * * We finalize the AST generation by extending the outer schedule * with a zero-dimensional schedule. If this results in any for loops, * then this means that we did not pass along enough information * about the outer schedule to the inner AST generation. */ static __isl_give isl_ast_node *create_leaf(__isl_take isl_ast_build *build, void *user) { isl_union_map *schedule, *extra; isl_ast_node *tree; schedule = isl_ast_build_get_schedule(build); extra = isl_union_map_copy(schedule); extra = isl_union_map_from_domain(isl_union_map_domain(extra)); schedule = isl_union_map_range_product(schedule, extra); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); if (!tree) return NULL; if (isl_ast_node_get_type(tree) == isl_ast_node_for) isl_die(isl_ast_node_get_ctx(tree), isl_error_unknown, "code should not contain any for loop", return isl_ast_node_free(tree)); return tree; } /* Check that we do not lose any information when going back and * forth between internal and external schedule. * * In particular, we create an AST where we unroll the only * non-constant dimension in the schedule. We therefore do * not expect any for loops in the AST. However, older versions * of isl would not pass along enough information about the outer * schedule when performing an inner code generation from a create_leaf * callback, resulting in the inner code generation producing a for loop. */ static int test_ast_gen5(isl_ctx *ctx) { const char *str; isl_set *set; isl_union_map *schedule, *options; isl_ast_build *build; isl_ast_node *tree; str = "{ A[] -> [1, 1, 2]; B[i] -> [1, i, 0] : i >= 1 and i <= 2 }"; schedule = isl_union_map_read_from_str(ctx, str); str = "{ [a, b, c] -> unroll[1] : exists (e0 = [(a)/4]: " "4e0 >= -1 + a - b and 4e0 <= -2 + a + b) }"; options = isl_union_map_read_from_str(ctx, str); set = isl_set_universe(isl_space_params_alloc(ctx, 0)); build = isl_ast_build_from_context(set); build = isl_ast_build_set_options(build, options); build = isl_ast_build_set_create_leaf(build, &create_leaf, NULL); tree = isl_ast_build_ast_from_schedule(build, schedule); isl_ast_build_free(build); isl_ast_node_free(tree); if (!tree) return -1; return 0; } static int test_ast_gen(isl_ctx *ctx) { if (test_ast_gen1(ctx) < 0) return -1; if (test_ast_gen2(ctx) < 0) return -1; if (test_ast_gen3(ctx) < 0) return -1; if (test_ast_gen4(ctx) < 0) return -1; if (test_ast_gen5(ctx) < 0) return -1; return 0; } /* Check if dropping output dimensions from an isl_pw_multi_aff * works properly. */ static int test_pw_multi_aff(isl_ctx *ctx) { const char *str; isl_pw_multi_aff *pma1, *pma2; int equal; str = "{ [i,j] -> [i+j, 4i-j] }"; pma1 = isl_pw_multi_aff_read_from_str(ctx, str); str = "{ [i,j] -> [4i-j] }"; pma2 = isl_pw_multi_aff_read_from_str(ctx, str); pma1 = isl_pw_multi_aff_drop_dims(pma1, isl_dim_out, 0, 1); equal = isl_pw_multi_aff_plain_is_equal(pma1, pma2); isl_pw_multi_aff_free(pma1); isl_pw_multi_aff_free(pma2); if (equal < 0) return -1; if (!equal) isl_die(ctx, isl_error_unknown, "expressions not equal", return -1); return 0; } /* This is a regression test for a bug where isl_basic_map_simplify * would end up in an infinite loop. In particular, we construct * an empty basic set that is not obviously empty. * isl_basic_set_is_empty marks the basic set as empty. * After projecting out i3, the variable can be dropped completely, * but isl_basic_map_simplify refrains from doing so if the basic set * is empty and would end up in an infinite loop if it didn't test * explicitly for empty basic maps in the outer loop. */ static int test_simplify(isl_ctx *ctx) { const char *str; isl_basic_set *bset; int empty; str = "{ [i0, i1, i2, i3] : i0 >= -2 and 6i2 <= 4 + i0 + 5i1 and " "i2 <= 22 and 75i2 <= 111 + 13i0 + 60i1 and " "25i2 >= 38 + 6i0 + 20i1 and i0 <= -1 and i2 >= 20 and " "i3 >= i2 }"; bset = isl_basic_set_read_from_str(ctx, str); empty = isl_basic_set_is_empty(bset); bset = isl_basic_set_project_out(bset, isl_dim_set, 3, 1); isl_basic_set_free(bset); if (!bset) return -1; if (!empty) isl_die(ctx, isl_error_unknown, "basic set should be empty", return -1); return 0; } /* This is a regression test for a bug where isl_tab_basic_map_partial_lexopt * with gbr context would fail to disable the use of the shifted tableau * when transferring equalities for the input to the context, resulting * in invalid sample values. */ static int test_partial_lexmin(isl_ctx *ctx) { const char *str; isl_basic_set *bset; isl_basic_map *bmap; isl_map *map; str = "{ [1, b, c, 1 - c] -> [e] : 2e <= -c and 2e >= -3 + c }"; bmap = isl_basic_map_read_from_str(ctx, str); str = "{ [a, b, c, d] : c <= 1 and 2d >= 6 - 4b - c }"; bset = isl_basic_set_read_from_str(ctx, str); map = isl_basic_map_partial_lexmin(bmap, bset, NULL); isl_map_free(map); if (!map) return -1; return 0; } /* Check that the variable compression performed on the existentially * quantified variables inside isl_basic_set_compute_divs is not confused * by the implicit equalities among the parameters. */ static int test_compute_divs(isl_ctx *ctx) { const char *str; isl_basic_set *bset; isl_set *set; str = "[a, b, c, d, e] -> { [] : exists (e0: 2d = b and a <= 124 and " "b <= 2046 and b >= 0 and b <= 60 + 64a and 2e >= b + 2c and " "2e >= b and 2e <= 1 + b and 2e <= 1 + b + 2c and " "32768e0 >= -124 + a and 2097152e0 <= 60 + 64a - b) }"; bset = isl_basic_set_read_from_str(ctx, str); set = isl_basic_set_compute_divs(bset); isl_set_free(set); if (!set) return -1; return 0; } struct { const char *name; int (*fn)(isl_ctx *ctx); } tests [] = { { "val", &test_val }, { "compute divs", &test_compute_divs }, { "partial lexmin", &test_partial_lexmin }, { "simplify", &test_simplify }, { "curry", &test_curry }, { "piecewise multi affine expressions", &test_pw_multi_aff }, { "conversion", &test_conversion }, { "list", &test_list }, { "align parameters", &test_align_parameters }, { "preimage", &test_preimage }, { "pullback", &test_pullback }, { "AST", &test_ast }, { "AST generation", &test_ast_gen }, { "eliminate", &test_eliminate }, { "residue class", &test_residue_class }, { "div", &test_div }, { "slice", &test_slice }, { "fixed power", &test_fixed_power }, { "sample", &test_sample }, { "output", &test_output }, { "vertices", &test_vertices }, { "fixed", &test_fixed }, { "equal", &test_equal }, { "product", &test_product }, { "dim_max", &test_dim_max }, { "affine", &test_aff }, { "injective", &test_injective }, { "schedule", &test_schedule }, { "union_pw", &test_union_pw }, { "parse", &test_parse }, { "single-valued", &test_sv }, { "affine hull", &test_affine_hull }, { "coalesce", &test_coalesce }, { "factorize", &test_factorize }, { "subset", &test_subset }, { "subtract", &test_subtract }, { "lexmin", &test_lexmin }, { "gist", &test_gist }, { "piecewise quasi-polynomials", &test_pwqp }, }; int main() { int i; struct isl_ctx *ctx; srcdir = getenv("srcdir"); assert(srcdir); ctx = isl_ctx_alloc(); for (i = 0; i < ARRAY_SIZE(tests); ++i) { printf("%s\n", tests[i].name); if (tests[i].fn(ctx) < 0) goto error; } test_lift(ctx); test_bound(ctx); test_union(ctx); test_split_periods(ctx); test_lex(ctx); test_bijective(ctx); test_dep(ctx); test_read(ctx); test_bounded(ctx); test_construction(ctx); test_dim(ctx); test_application(ctx); test_convex_hull(ctx); test_closure(ctx); isl_ctx_free(ctx); return 0; error: isl_ctx_free(ctx); return -1; } cloog-0.18.2/isl/isl_list_templ.h0000664000175000017500000000044312254313240013610 00000000000000#define xFN(TYPE,NAME) TYPE ## _ ## NAME #define FN(TYPE,NAME) xFN(TYPE,NAME) #define xLIST(EL) EL ## _list #define LIST(EL) xLIST(EL) struct LIST(EL) { int ref; isl_ctx *ctx; int n; size_t size; struct EL *p[1]; }; __isl_give LIST(EL) *FN(LIST(EL),dup)(__isl_keep LIST(EL) *list); cloog-0.18.2/isl/isl_piplib.c0000664000175000017500000000105212254313240012703 00000000000000/* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include "isl_piplib.h" void isl_seq_cpy_to_pip(Entier *dst, isl_int *src, unsigned len) { int i; for (i = 0; i < len; ++i) entier_assign(dst[i], src[i]); } void isl_seq_cpy_from_pip(isl_int *dst, Entier *src, unsigned len) { int i; for (i = 0; i < len; ++i) entier_assign(dst[i], src[i]); } cloog-0.18.2/isl/isl_gmp.c0000664000175000017500000000264312254313240012216 00000000000000#include /* * Copyright 2008-2009 Katholieke Universiteit Leuven * * Use of this software is governed by the MIT license * * Written by Sven Verdoolaege, K.U.Leuven, Departement * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium */ #include uint32_t isl_gmp_hash(mpz_t v, uint32_t hash) { int sa = v[0]._mp_size; int abs_sa = sa < 0 ? -sa : sa; unsigned char *data = (unsigned char *)v[0]._mp_d; unsigned char *end = data + abs_sa * sizeof(v[0]._mp_d[0]); if (sa < 0) isl_hash_byte(hash, 0xFF); for (; data < end; ++data) isl_hash_byte(hash, *data); return hash; } /* This function tries to produce outputs that do not depend on * the version of GMP that is being used. * * In particular, when computing the extended gcd of -1 and 9, * some versions will produce * * 1 = -1 * -1 + 0 * 9 * * while other versions will produce * * 1 = 8 * -1 + 1 * 9 * * If configure detects that we are in the former case, then * mpz_gcdext will be called directly. Otherwise, this function * is called and then we try to mimic the behavior of the other versions. */ void isl_gmp_gcdext(mpz_t G, mpz_t S, mpz_t T, mpz_t A, mpz_t B) { if (mpz_divisible_p(B, A)) { mpz_set_si(S, mpz_sgn(A)); mpz_set_si(T, 0); mpz_abs(G, A); return; } if (mpz_divisible_p(A, B)) { mpz_set_si(S, 0); mpz_set_si(T, mpz_sgn(B)); mpz_abs(G, B); return; } mpz_gcdext(G, S, T, A, B); } cloog-0.18.2/configure0000775000175000017500000164263112254313267011561 00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.68 for cloog 0.18.2. # # Report bugs to . # # # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, # 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free Software # Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test -n \"\${ZSH_VERSION+set}\${BASH_VERSION+set}\" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test \"X\`printf %s \$ECHO\`\" = \"X\$ECHO\" \\ || test \"X\`print -r -- \$ECHO\`\" = \"X\$ECHO\" ) || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV export CONFIG_SHELL case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec "$CONFIG_SHELL" $as_opts "$as_myself" ${1+"$@"} fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org and $0: cloog-development@googlegroups.com about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" SHELL=${CONFIG_SHELL-/bin/sh} test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='cloog' PACKAGE_TARNAME='cloog' PACKAGE_VERSION='0.18.2' PACKAGE_STRING='cloog 0.18.2' PACKAGE_BUGREPORT='cloog-development@googlegroups.com' PACKAGE_URL='' ac_unique_file="source/cloog.c" # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" enable_option_checking=no ac_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS LIBOBJS subdirs pkgconfig_libfile pkgconfig_libdir VERSION_REVISION VERSION_MINOR VERSION_MAJOR BITS INSTALL GIT_INDEX NO_OSL_FALSE NO_OSL_TRUE BUNDLED_OSL_FALSE BUNDLED_OSL_TRUE OSL_LIBS OSL_LDFLAGS OSL_CPPFLAGS NO_ISL_FALSE NO_ISL_TRUE BUNDLED_ISL_FALSE BUNDLED_ISL_TRUE ISL_LIBS ISL_LDFLAGS ISL_CPPFLAGS NEED_GET_MEMORY_FUNCTIONS_FALSE NEED_GET_MEMORY_FUNCTIONS_TRUE CFLAGS_WARN PRTDIAG HAVE_TEXI2DVI_FALSE HAVE_TEXI2DVI_TRUE TEXI2DVI CPP OTOOL64 OTOOL LIPO NMEDIT DSYMUTIL MANIFEST_TOOL RANLIB ac_ct_AR AR DLLTOOL OBJDUMP NM ac_ct_DUMPBIN DUMPBIN LD FGREP EGREP GREP SED host_os host_vendor host_cpu host build_os build_vendor build_cpu build LIBTOOL CD LN_S am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE am__nodep AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC AM_BACKSLASH AM_DEFAULT_VERBOSITY AM_DEFAULT_V AM_V am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM versioninfo target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_silent_rules enable_dependency_tracking enable_shared enable_static with_pic enable_fast_install with_gnu_ld with_sysroot enable_libtool_lock enable_portable_binary with_gcc_arch with_isl with_isl_prefix with_isl_exec_prefix with_isl_builddir with_gmp with_gmp_prefix with_gmp_exec_prefix with_gmp_builddir with_osl with_osl_prefix with_osl_exec_prefix with_osl_builddir ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP' ac_subdirs_all='isl osl' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe $as_echo "$as_me: WARNING: if you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used" >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures cloog 0.18.2 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/cloog] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of cloog 0.18.2:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-silent-rules less verbose build output (undo: `make V=1') --disable-silent-rules verbose build output (undo: `make V=0') --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) --enable-portable-binary disable compiler optimizations that would produce unportable binaries Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-pic[=PKGS] try to use only PIC/non-PIC objects [default=use both] --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-sysroot[=DIR] Search for dependent libraries within DIR (or the compiler's sysroot if not specified). --with-gcc-arch= use architecture for gcc -march/-mtune, instead of guessing --with-isl=no|system|build|bundled Which isl to use --with-isl-prefix=DIR Prefix of isl installation --with-isl-exec-prefix=DIR Exec prefix of isl installation --with-isl-builddir=DIR Location of isl builddir --with-gmp=system|build Which gmp to use --with-gmp-prefix=DIR Prefix of gmp installation --with-gmp-exec-prefix=DIR Exec prefix of gmp installation --with-gmp-builddir=DIR Location of gmp builddir --with-osl=no|system|build|bundled Which osl to use --with-osl-prefix=DIR Prefix of osl installation --with-osl-exec-prefix=DIR Exec prefix of osl installation --with-osl-builddir=DIR Location of osl builddir Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CPP C preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to . _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF cloog configure 0.18.2 generated by GNU Autoconf 2.68 Copyright (C) 2010 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || $as_test_x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_compile # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_check_func LINENO FUNC VAR # ---------------------------------- # Tests whether FUNC exists, setting the cache variable VAR accordingly ac_fn_c_check_func () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_func # ac_fn_c_check_type LINENO TYPE VAR INCLUDES # ------------------------------------------- # Tests whether TYPE exists after having included INCLUDES, setting cache # variable VAR accordingly. ac_fn_c_check_type () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=no" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof ($2)) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof (($2))) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else eval "$3=yes" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_type # ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists, giving a warning if it cannot be compiled using # the include files in INCLUDES and setting the cache variable VAR # accordingly. ac_fn_c_check_header_mongrel () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if eval \${$3+:} false; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.i conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ( $as_echo "## ------------------------------------------------- ## ## Report this to cloog-development@googlegroups.com ## ## ------------------------------------------------- ##" ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_mongrel # ac_fn_c_check_decl LINENO SYMBOL VAR INCLUDES # --------------------------------------------- # Tests whether SYMBOL is declared in INCLUDES, setting cache variable VAR # accordingly. ac_fn_c_check_decl () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack as_decl_name=`echo $2|sed 's/ *(.*//'` as_decl_use=`echo $2|sed -e 's/(/((/' -e 's/)/) 0&/' -e 's/,/) 0& (/g'` { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $as_decl_name is declared" >&5 $as_echo_n "checking whether $as_decl_name is declared... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { #ifndef $as_decl_name #ifdef __cplusplus (void) $as_decl_use; #else (void) $as_decl_name; #endif #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_decl cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by cloog $as_me 0.18.2, which was generated by GNU Autoconf 2.68. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_aux_dir= for ac_dir in autoconf "$srcdir"/autoconf; do if test -f "$ac_dir/install-sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f "$ac_dir/install.sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f "$ac_dir/shtool"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then as_fn_error $? "cannot find install-sh, install.sh, or shtool in autoconf \"$srcdir\"/autoconf" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. VERSION_MAJOR=0 VERSION_MINOR=18 VERSION_REVISION=2 versioninfo=4:0:0 am__api_version='1.11' # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if ${ac_cv_path_install+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error $? "unsafe srcdir value: \`$srcdir'" "$LINENO" 5;; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error $? "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi test "$2" = conftest.file ) then # Ok. : else as_fn_error $? "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if ${ac_cv_path_mkdir+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } mkdir_p="$MKDIR_P" case $mkdir_p in [\\/$]* | ?:[\\/]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AWK+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering ...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='cloog' VERSION='0.18.2' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AMTAR='$${TAR-tar}' am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -' # Check whether --enable-silent-rules was given. if test "${enable_silent_rules+set}" = set; then : enableval=$enable_silent_rules; fi case $enable_silent_rules in yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=0;; esac am_make=${MAKE-make} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5 $as_echo_n "checking whether $am_make supports nested variables... " >&6; } if ${am_cv_make_support_nested_variables+:} false; then : $as_echo_n "(cached) " >&6 else if $as_echo 'TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5 $as_echo "$am_cv_make_support_nested_variables" >&6; } if test $am_cv_make_support_nested_variables = yes; then AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AM_BACKSLASH='\' ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "C compiler cannot create executables See \`config.log' for more details" "$LINENO" 5; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details" "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if ${ac_cv_objext+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of object files: cannot compile See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CC_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5 $as_echo_n "checking whether ln -s works... " >&6; } LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5 $as_echo "no, using $LN_S" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering ...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi # Extract the first word of "cd", so it can be a program name with args. set dummy cd; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CD+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CD"; then ac_cv_prog_CD="$CD" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CD="" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CD=$ac_cv_prog_CD if test -n "$CD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CD" >&5 $as_echo "$CD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi case `pwd` in *\ * | *\ *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5 $as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;; esac macro_version='2.4.2.418' macro_revision='2.4.2.418' ltmain=$ac_aux_dir/ltmain.sh # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if ${ac_cv_build+:} false; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if ${ac_cv_host+:} false; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac # Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\(["`$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to print strings" >&5 $as_echo_n "checking how to print strings... " >&6; } # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "" } case $ECHO in printf*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: printf" >&5 $as_echo "printf" >&6; } ;; print*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: print -r" >&5 $as_echo "print -r" >&6; } ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: cat" >&5 $as_echo "cat" >&6; } ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5 $as_echo_n "checking for a sed that does not truncate output... " >&6; } if ${ac_cv_path_SED+:} false; then : $as_echo_n "(cached) " >&6 else ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/ for ac_i in 1 2 3 4 5 6 7; do ac_script="$ac_script$as_nl$ac_script" done echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed { ac_script=; unset ac_script;} if test -z "$SED"; then ac_path_SED_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_SED="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_SED" && $as_test_x "$ac_path_SED"; } || continue # Check for GNU ac_path_SED and select it if it is found. # Check for GNU $ac_path_SED case `"$ac_path_SED" --version 2>&1` in *GNU*) ac_cv_path_SED="$ac_path_SED" ac_path_SED_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo '' >> "conftest.nl" "$ac_path_SED" -f conftest.sed < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_SED_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_SED="$ac_path_SED" ac_path_SED_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_SED_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_SED"; then as_fn_error $? "no acceptable sed could be found in \$PATH" "$LINENO" 5 fi else ac_cv_path_SED=$SED fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5 $as_echo "$ac_cv_path_SED" >&6; } SED="$ac_cv_path_SED" rm -f conftest.sed test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if ${ac_cv_path_EGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for fgrep" >&5 $as_echo_n "checking for fgrep... " >&6; } if ${ac_cv_path_FGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1 then ac_cv_path_FGREP="$GREP -F" else if test -z "$FGREP"; then ac_path_FGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in fgrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_FGREP" && $as_test_x "$ac_path_FGREP"; } || continue # Check for GNU ac_path_FGREP and select it if it is found. # Check for GNU $ac_path_FGREP case `"$ac_path_FGREP" --version 2>&1` in *GNU*) ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'FGREP' >> "conftest.nl" "$ac_path_FGREP" FGREP < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_FGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_FGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_FGREP"; then as_fn_error $? "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_FGREP=$FGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5 $as_echo "$ac_cv_path_FGREP" >&6; } FGREP="$ac_cv_path_FGREP" test -z "$GREP" && GREP=grep # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test no = "$withval" || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test yes = "$GCC"; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return, which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD=$ac_prog ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test yes = "$with_gnu_ld"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${lt_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD=$ac_dir/$ac_prog # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${lt_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5 $as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; } if ${lt_cv_path_NM+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM=$NM else lt_nm_to_check=${ac_tool_prefix}nm if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. tmp_nm=$ac_dir/$lt_tmp_nm if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext"; then # Check to see if the nm accepts a BSD-compat flag. # Adding the 'sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break 2 ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break 2 ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS=$lt_save_ifs done : ${lt_cv_path_NM=no} fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5 $as_echo "$lt_cv_path_NM" >&6; } if test no != "$lt_cv_path_NM"; then NM=$lt_cv_path_NM else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else if test -n "$ac_tool_prefix"; then for ac_prog in dumpbin "link -dump" do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DUMPBIN"; then ac_cv_prog_DUMPBIN="$DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DUMPBIN="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DUMPBIN=$ac_cv_prog_DUMPBIN if test -n "$DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5 $as_echo "$DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DUMPBIN" && break done fi if test -z "$DUMPBIN"; then ac_ct_DUMPBIN=$DUMPBIN for ac_prog in dumpbin "link -dump" do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DUMPBIN"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DUMPBIN="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN if test -n "$ac_ct_DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5 $as_echo "$ac_ct_DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_DUMPBIN" && break done if test "x$ac_ct_DUMPBIN" = x; then DUMPBIN=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DUMPBIN=$ac_ct_DUMPBIN fi fi case `$DUMPBIN -symbols -headers /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols -headers" ;; *) DUMPBIN=: ;; esac fi if test : != "$DUMPBIN"; then NM=$DUMPBIN fi fi test -z "$NM" && NM=nm { $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5 $as_echo_n "checking the name lister ($NM) interface... " >&6; } if ${lt_cv_nm_interface+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&5) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&5) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: output\"" >&5) cat conftest.out >&5 if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5 $as_echo "$lt_cv_nm_interface" >&6; } # find the maximum length of command line arguments { $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5 $as_echo_n "checking the maximum length of command line arguments... " >&6; } if ${lt_cv_sys_max_cmd_len+:} false; then : $as_echo_n "(cached) " >&6 else i=0 teststring=ABCD case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; bitrig* | darwin* | dragonfly* | freebsd* | netbsd* | openbsd*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test X`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test 17 != "$i" # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac fi if test -n "$lt_cv_sys_max_cmd_len"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5 $as_echo "$lt_cv_sys_max_cmd_len" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5 $as_echo "none" >&6; } fi max_cmd_len=$lt_cv_sys_max_cmd_len : ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to $host format" >&5 $as_echo_n "checking how to convert $build file names to $host format... " >&6; } if ${lt_cv_to_host_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac fi to_host_file_cmd=$lt_cv_to_host_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_host_file_cmd" >&5 $as_echo "$lt_cv_to_host_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to toolchain format" >&5 $as_echo_n "checking how to convert $build file names to toolchain format... " >&6; } if ${lt_cv_to_tool_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else #assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac fi to_tool_file_cmd=$lt_cv_to_tool_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_tool_file_cmd" >&5 $as_echo "$lt_cv_to_tool_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5 $as_echo_n "checking for $LD option to reload object files... " >&6; } if ${lt_cv_ld_reload_flag+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_reload_flag='-r' fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5 $as_echo "$lt_cv_ld_reload_flag" >&6; } reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in cygwin* | mingw* | pw32* | cegcc*) if test yes != "$GCC"; then reload_cmds=false fi ;; darwin*) if test yes = "$GCC"; then reload_cmds='$LTCC $LTCFLAGS -nostdlib $wl-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args. set dummy ${ac_tool_prefix}objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OBJDUMP"; then ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OBJDUMP=$ac_cv_prog_OBJDUMP if test -n "$OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5 $as_echo "$OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OBJDUMP"; then ac_ct_OBJDUMP=$OBJDUMP # Extract the first word of "objdump", so it can be a program name with args. set dummy objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OBJDUMP"; then ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OBJDUMP="objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP if test -n "$ac_ct_OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5 $as_echo "$ac_ct_OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OBJDUMP" = x; then OBJDUMP="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OBJDUMP=$ac_ct_OBJDUMP fi else OBJDUMP="$ac_cv_prog_OBJDUMP" fi test -z "$OBJDUMP" && OBJDUMP=objdump { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5 $as_echo_n "checking how to recognize dependent libraries... " >&6; } if ${lt_cv_deplibs_check_method+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # 'unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # that responds to the $file_magic_cmd with a given extended regex. # If you have 'file' or equivalent on your system and you're not sure # whether 'pass_all' will *always* work, you probably want this one. case $host_os in aix[4-9]*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump', # unless we find 'file', for example because we are cross-compiling. if ( file / ) >/dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9]\.[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[3-9]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd* | bitrig*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5 $as_echo "$lt_cv_deplibs_check_method" >&6; } file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[\1]\/[\1]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dlltool", so it can be a program name with args. set dummy ${ac_tool_prefix}dlltool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DLLTOOL"; then ac_cv_prog_DLLTOOL="$DLLTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DLLTOOL="${ac_tool_prefix}dlltool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DLLTOOL=$ac_cv_prog_DLLTOOL if test -n "$DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DLLTOOL" >&5 $as_echo "$DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DLLTOOL"; then ac_ct_DLLTOOL=$DLLTOOL # Extract the first word of "dlltool", so it can be a program name with args. set dummy dlltool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DLLTOOL"; then ac_cv_prog_ac_ct_DLLTOOL="$ac_ct_DLLTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DLLTOOL="dlltool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL if test -n "$ac_ct_DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL" >&5 $as_echo "$ac_ct_DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DLLTOOL" = x; then DLLTOOL="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DLLTOOL=$ac_ct_DLLTOOL fi else DLLTOOL="$ac_cv_prog_DLLTOOL" fi test -z "$DLLTOOL" && DLLTOOL=dlltool { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to associate runtime and link libraries" >&5 $as_echo_n "checking how to associate runtime and link libraries... " >&6; } if ${lt_cv_sharedlib_from_linklib_cmd+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh; # decide which one to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd=$ECHO ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sharedlib_from_linklib_cmd" >&5 $as_echo "$lt_cv_sharedlib_from_linklib_cmd" >&6; } sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO if test -n "$ac_tool_prefix"; then for ac_prog in ar do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AR="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AR" && break done fi if test -z "$AR"; then ac_ct_AR=$AR for ac_prog in ar do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_AR="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_AR" && break done if test "x$ac_ct_AR" = x; then AR="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac AR=$ac_ct_AR fi fi : ${AR=ar} : ${AR_FLAGS=cru} { $as_echo "$as_me:${as_lineno-$LINENO}: checking for archiver @FILE support" >&5 $as_echo_n "checking for archiver @FILE support... " >&6; } if ${lt_cv_ar_at_file+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ar_at_file=no cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&5' { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test 0 -eq "$ac_status"; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test 0 -ne "$ac_status"; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ar_at_file" >&5 $as_echo "$lt_cv_ar_at_file" >&6; } if test no = "$lt_cv_ar_at_file"; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi test -z "$STRIP" && STRIP=: if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi test -z "$RANLIB" && RANLIB=: # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in bitrig* | openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check for command to grab the raw symbol name followed by C symbol from nm. { $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5 $as_echo_n "checking command to parse $NM output from $compiler object... " >&6; } if ${lt_cv_sys_global_symbol_pipe+:} false; then : $as_echo_n "(cached) " >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[ABCDGISTW]' ;; hpux*) if test ia64 = "$host_cpu"; then symcode='[ABCDEGRST]' fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Gets list of data symbols to import. lt_cv_sys_global_symbol_to_import="sed -n -e 's/^I .* \(.*\)$/\1/p'" # Adjust the below global symbol transforms to fixup imported variables. lt_cdecl_hook=" -e 's/^I .* \(.*\)$/extern __declspec(dllimport) char \1;/p'" lt_c_name_hook=" -e 's/^I .* \(.*\)$/ {\"\1\", (void *) 0},/p'" lt_c_name_lib_hook="\ -e 's/^I .* \(lib.*\)$/ {\"\1\", (void *) 0},/p'\ -e 's/^I .* \(.*\)$/ {\"lib\1\", (void *) 0},/p'" else # Disable hooks by default. lt_cv_sys_global_symbol_to_import= lt_cdecl_hook= lt_c_name_hook= lt_c_name_lib_hook= fi # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n"\ $lt_cdecl_hook\ " -e 's/^T .* \(.*\)$/extern int \1();/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n"\ $lt_c_name_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/p'" # Transform an extracted symbol line into symbol name with lib prefix and # symbol address. lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n"\ $lt_c_name_lib_hook\ " -e 's/^: \(.*\) .*$/ {\"\1\", (void *) 0},/p'"\ " -e 's/^$symcode$symcode* .* \(lib.*\)$/ {\"\1\", (void *) \&\1},/p'"\ " -e 's/^$symcode$symcode* .* \(.*\)$/ {\"lib\1\", (void *) \&\1},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function, # D for any global variable and I for any imported variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK '"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " /^ *Symbol name *: /{split(\$ 0,sn,\":\"); si=substr(sn[2],2)};"\ " /^ *Type *: code/{print \"T\",si,substr(si,length(prfx))};"\ " /^ *Type *: data/{print \"I\",si,substr(si,length(prfx))};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=\"D\"}; \$ 0~/\(\).*\|/{f=\"T\"};"\ " {split(\$ 0,a,/\||\r/); split(a[2],s)};"\ " s[1]~/^[@?]/{print f,s[1],s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print f,t[1],substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Now try to grab the symbols. nlist=conftest.nm if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist\""; } >&5 (eval $NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined _WIN32 || defined __CYGWIN__ || defined _WIN32_WCE /* DATA imports from DLLs on WIN32 can't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined __osf__ /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* .* \(.*\)$/ {\"\1\", (void *) \&\1},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS=conftstm.$ac_objext CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest$ac_exeext; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test yes = "$pipe_works"; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[@]FILE' >/dev/null; then nm_file_list_spec='@' fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for sysroot" >&5 $as_echo_n "checking for sysroot... " >&6; } # Check whether --with-sysroot was given. if test "${with_sysroot+set}" = set; then : withval=$with_sysroot; else with_sysroot=no fi lt_sysroot= case $with_sysroot in #( yes) if test yes = "$GCC"; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_sysroot" >&5 $as_echo "$with_sysroot" >&6; } as_fn_error $? "The sysroot must be an absolute path." "$LINENO" 5 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${lt_sysroot:-no}" >&5 $as_echo "${lt_sysroot:-no}" >&6; } # Check whether --enable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then : enableval=$enable_libtool_lock; fi test no = "$enable_libtool_lock" || enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out what ABI is being produced by ac_compile, and set mode # options accordingly. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE=32 ;; *ELF-64*) HPUX_IA64_MODE=64 ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '#line '$LINENO' "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then if test yes = "$lt_cv_prog_gnu_ld"; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; mips64*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo '#line '$LINENO' "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then emul=elf case `/usr/bin/file conftest.$ac_objext` in *32-bit*) emul="${emul}32" ;; *64-bit*) emul="${emul}64" ;; esac case `/usr/bin/file conftest.$ac_objext` in *MSB*) emul="${emul}btsmip" ;; *LSB*) emul="${emul}ltsmip" ;; esac case `/usr/bin/file conftest.$ac_objext` in *N32*) emul="${emul}n32" ;; esac LD="${LD-ld} -m $emul" fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. Note that the listed cases only cover the # situations where additional linker options are needed (such as when # doing 32-bit compilation for a host where ld defaults to 64-bit, or # vice versa); the common cases where no linker options are needed do # not appear in the list. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*linux*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*linux*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*linux*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*linux*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS=$CFLAGS CFLAGS="$CFLAGS -belf" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5 $as_echo_n "checking whether the C compiler needs -belf... " >&6; } if ${lt_cv_cc_needs_belf+:} false; then : $as_echo_n "(cached) " >&6 else ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_cc_needs_belf=yes else lt_cv_cc_needs_belf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5 $as_echo "$lt_cv_cc_needs_belf" >&6; } if test yes != "$lt_cv_cc_needs_belf"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS=$SAVE_CFLAGS fi ;; *-*solaris*) # Find out what ABI is being produced by ac_compile, and set linker # options accordingly. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*|x86_64-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD=${LD-ld}_sol2 fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks=$enable_libtool_lock if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}mt", so it can be a program name with args. set dummy ${ac_tool_prefix}mt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$MANIFEST_TOOL"; then ac_cv_prog_MANIFEST_TOOL="$MANIFEST_TOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_MANIFEST_TOOL="${ac_tool_prefix}mt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi MANIFEST_TOOL=$ac_cv_prog_MANIFEST_TOOL if test -n "$MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MANIFEST_TOOL" >&5 $as_echo "$MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_MANIFEST_TOOL"; then ac_ct_MANIFEST_TOOL=$MANIFEST_TOOL # Extract the first word of "mt", so it can be a program name with args. set dummy mt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_MANIFEST_TOOL"; then ac_cv_prog_ac_ct_MANIFEST_TOOL="$ac_ct_MANIFEST_TOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_MANIFEST_TOOL="mt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_MANIFEST_TOOL=$ac_cv_prog_ac_ct_MANIFEST_TOOL if test -n "$ac_ct_MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_MANIFEST_TOOL" >&5 $as_echo "$ac_ct_MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_MANIFEST_TOOL" = x; then MANIFEST_TOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac MANIFEST_TOOL=$ac_ct_MANIFEST_TOOL fi else MANIFEST_TOOL="$ac_cv_prog_MANIFEST_TOOL" fi test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $MANIFEST_TOOL is a manifest tool" >&5 $as_echo_n "checking if $MANIFEST_TOOL is a manifest tool... " >&6; } if ${lt_cv_path_mainfest_tool+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&5 $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&5 if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_mainfest_tool" >&5 $as_echo "$lt_cv_path_mainfest_tool" >&6; } if test yes != "$lt_cv_path_mainfest_tool"; then MANIFEST_TOOL=: fi case $host_os in rhapsody* | darwin*) if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args. set dummy ${ac_tool_prefix}dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DSYMUTIL"; then ac_cv_prog_DSYMUTIL="$DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_DSYMUTIL="${ac_tool_prefix}dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DSYMUTIL=$ac_cv_prog_DSYMUTIL if test -n "$DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5 $as_echo "$DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DSYMUTIL"; then ac_ct_DSYMUTIL=$DSYMUTIL # Extract the first word of "dsymutil", so it can be a program name with args. set dummy dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DSYMUTIL"; then ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_DSYMUTIL="dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL if test -n "$ac_ct_DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5 $as_echo "$ac_ct_DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DSYMUTIL" = x; then DSYMUTIL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DSYMUTIL=$ac_ct_DSYMUTIL fi else DSYMUTIL="$ac_cv_prog_DSYMUTIL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args. set dummy ${ac_tool_prefix}nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NMEDIT"; then ac_cv_prog_NMEDIT="$NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_NMEDIT="${ac_tool_prefix}nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi NMEDIT=$ac_cv_prog_NMEDIT if test -n "$NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5 $as_echo "$NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_NMEDIT"; then ac_ct_NMEDIT=$NMEDIT # Extract the first word of "nmedit", so it can be a program name with args. set dummy nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_NMEDIT"; then ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_NMEDIT="nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT if test -n "$ac_ct_NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5 $as_echo "$ac_ct_NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_NMEDIT" = x; then NMEDIT=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac NMEDIT=$ac_ct_NMEDIT fi else NMEDIT="$ac_cv_prog_NMEDIT" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args. set dummy ${ac_tool_prefix}lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$LIPO"; then ac_cv_prog_LIPO="$LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_LIPO="${ac_tool_prefix}lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LIPO=$ac_cv_prog_LIPO if test -n "$LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5 $as_echo "$LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_LIPO"; then ac_ct_LIPO=$LIPO # Extract the first word of "lipo", so it can be a program name with args. set dummy lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_LIPO"; then ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_LIPO="lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO if test -n "$ac_ct_LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5 $as_echo "$ac_ct_LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_LIPO" = x; then LIPO=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac LIPO=$ac_ct_LIPO fi else LIPO="$ac_cv_prog_LIPO" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args. set dummy ${ac_tool_prefix}otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL"; then ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL="${ac_tool_prefix}otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL=$ac_cv_prog_OTOOL if test -n "$OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5 $as_echo "$OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL"; then ac_ct_OTOOL=$OTOOL # Extract the first word of "otool", so it can be a program name with args. set dummy otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL"; then ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL="otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL if test -n "$ac_ct_OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5 $as_echo "$ac_ct_OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL" = x; then OTOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL=$ac_ct_OTOOL fi else OTOOL="$ac_cv_prog_OTOOL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args. set dummy ${ac_tool_prefix}otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL64"; then ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL64=$ac_cv_prog_OTOOL64 if test -n "$OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5 $as_echo "$OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL64"; then ac_ct_OTOOL64=$OTOOL64 # Extract the first word of "otool64", so it can be a program name with args. set dummy otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL64"; then ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_OTOOL64="otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64 if test -n "$ac_ct_OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5 $as_echo "$ac_ct_OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL64" = x; then OTOOL64=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL64=$ac_ct_OTOOL64 fi else OTOOL64="$ac_cv_prog_OTOOL64" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5 $as_echo_n "checking for -single_module linker flag... " >&6; } if ${lt_cv_apple_cc_single_mod+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_apple_cc_single_mod=no if test -z "$LT_MULTI_MODULE"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&5 $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&5 # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test 0 = "$_lt_result"; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&5 fi rm -rf libconftest.dylib* rm -f conftest.* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5 $as_echo "$lt_cv_apple_cc_single_mod" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5 $as_echo_n "checking for -exported_symbols_list linker flag... " >&6; } if ${lt_cv_ld_exported_symbols_list+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_ld_exported_symbols_list=yes else lt_cv_ld_exported_symbols_list=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5 $as_echo "$lt_cv_ld_exported_symbols_list" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -force_load linker flag" >&5 $as_echo_n "checking for -force_load linker flag... " >&6; } if ${lt_cv_ld_force_load+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&5 $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&5 echo "$AR cru libconftest.a conftest.o" >&5 $AR cru libconftest.a conftest.o 2>&5 echo "$RANLIB libconftest.a" >&5 $RANLIB libconftest.a 2>&5 cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&5 $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&5 elif test -f conftest && test 0 = "$_lt_result" && $GREP forced_load conftest >/dev/null 2>&1; then lt_cv_ld_force_load=yes else cat conftest.err >&5 fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_force_load" >&5 $as_echo "$lt_cv_ld_force_load" >&6; } case $host_os in rhapsody* | darwin1.[012]) _lt_dar_allow_undefined='$wl-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[91]*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; 10.[012]*) _lt_dar_allow_undefined='$wl-flat_namespace $wl-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='$wl-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test yes = "$lt_cv_apple_cc_single_mod"; then _lt_dar_single_mod='$single_module' fi if test yes = "$lt_cv_ld_exported_symbols_list"; then _lt_dar_export_syms=' $wl-exported_symbols_list,$output_objdir/$libname-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/$libname-symbols.expsym $lib' fi if test : != "$DSYMUTIL" && test no = "$lt_cv_ld_force_load"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if ${ac_cv_prog_CPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do : ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default " if test "x$ac_cv_header_dlfcn_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_DLFCN_H 1 _ACEOF fi done # Set options enable_dlopen=no enable_win32_dll=no # Check whether --enable-shared was given. if test "${enable_shared+set}" = set; then : enableval=$enable_shared; p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS=$lt_save_ifs ;; esac else enable_shared=yes fi # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS=$lt_save_ifs ;; esac else enable_static=yes fi # Check whether --with-pic was given. if test "${with_pic+set}" = set; then : withval=$with_pic; lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for lt_pkg in $withval; do IFS=$lt_save_ifs if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS=$lt_save_ifs ;; esac else pic_mode=default fi # Check whether --enable-fast-install was given. if test "${enable_fast_install+set}" = set; then : enableval=$enable_fast_install; p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs=$IFS; IFS=$IFS$PATH_SEPARATOR, for pkg in $enableval; do IFS=$lt_save_ifs if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS=$lt_save_ifs ;; esac else enable_fast_install=yes fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS=$ltmain # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' test -z "$LN_S" && LN_S="ln -s" if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5 $as_echo_n "checking for objdir... " >&6; } if ${lt_cv_objdir+:} false; then : $as_echo_n "(cached) " >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5 $as_echo "$lt_cv_objdir" >&6; } objdir=$lt_cv_objdir cat >>confdefs.h <<_ACEOF #define LT_OBJDIR "$lt_cv_objdir/" _ACEOF case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a '.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld=$lt_cv_prog_gnu_ld old_CC=$CC old_CFLAGS=$CFLAGS # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5 $as_echo_n "checking for ${ac_tool_prefix}file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD=$MAGIC_CMD lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/${ac_tool_prefix}file"; then lt_cv_path_MAGIC_CMD=$ac_dir/"${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD=$lt_cv_path_MAGIC_CMD if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS=$lt_save_ifs MAGIC_CMD=$lt_save_MAGIC_CMD ;; esac fi MAGIC_CMD=$lt_cv_path_MAGIC_CMD if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5 $as_echo_n "checking for file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD=$MAGIC_CMD # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD=$MAGIC_CMD lt_save_ifs=$IFS; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS=$lt_save_ifs test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/file"; then lt_cv_path_MAGIC_CMD=$ac_dir/"file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD=$lt_cv_path_MAGIC_CMD if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS=$lt_save_ifs MAGIC_CMD=$lt_save_MAGIC_CMD ;; esac fi MAGIC_CMD=$lt_cv_path_MAGIC_CMD if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi else MAGIC_CMD=: fi fi fi ;; esac # Use C for the default configuration in the libtool script lt_save_CC=$CC ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then lt_prog_compiler_no_builtin_flag= if test yes = "$GCC"; then case $cc_basename in nvcc*) lt_prog_compiler_no_builtin_flag=' -Xcompiler -fno-builtin' ;; *) lt_prog_compiler_no_builtin_flag=' -fno-builtin' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 $as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; } if ${lt_cv_prog_compiler_rtti_exceptions+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" ## exclude from sc_useless_quotes_in_assignment # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 $as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; } if test yes = "$lt_cv_prog_compiler_rtti_exceptions"; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= if test yes = "$GCC"; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi lt_prog_compiler_pic='-fPIC' ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the '-m68020' flag to GCC prevents building anything better, # like '-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. lt_prog_compiler_static= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; *) lt_prog_compiler_pic='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 lt_prog_compiler_wl='-Xlinker ' if test -n "$lt_prog_compiler_pic"; then lt_prog_compiler_pic="-Xcompiler $lt_prog_compiler_pic" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test ia64 = "$host_cpu"; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' case $cc_basename in nagfor*) # NAG Fortran compiler lt_prog_compiler_wl='-Wl,-Wl,,' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; esac ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='$wl-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64, which still supported -KPIC. ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; # Lahey Fortran 8.1. lf95*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='--shared' lt_prog_compiler_static='--static' ;; nagfor*) # NAG Fortran compiler lt_prog_compiler_wl='-Wl,-Wl,,' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; tcc*) # Fabrice Bellard et al's Tiny C Compiler lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-qpic' lt_prog_compiler_static='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [1-7].* | *Sun*Fortran*\ 8.[0-3]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='' ;; *Sun\ F* | *Sun*Fortran*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Wl,' ;; *Intel*\ [CF]*Compiler*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; *Portland\ Group*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; esac ;; esac ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; rdos*) lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi case $host_os in # For platforms that do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if ${lt_cv_prog_compiler_pic+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic=$lt_prog_compiler_pic fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic" >&5 $as_echo "$lt_cv_prog_compiler_pic" >&6; } lt_prog_compiler_pic=$lt_cv_prog_compiler_pic # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; } if ${lt_cv_prog_compiler_pic_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" ## exclude from sc_useless_quotes_in_assignment # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5 $as_echo "$lt_cv_prog_compiler_pic_works" >&6; } if test yes = "$lt_cv_prog_compiler_pic_works"; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if ${lt_cv_prog_compiler_static_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works=yes fi else lt_cv_prog_compiler_static_works=yes fi fi $RM -r conftest* LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5 $as_echo "$lt_cv_prog_compiler_static_works" >&6; } if test yes = "$lt_cv_prog_compiler_static_works"; then : else lt_prog_compiler_static= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } hard_links=nottested if test no = "$lt_cv_prog_compiler_c_o" && test no != "$need_locks"; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test no = "$hard_links"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: '$CC' does not support '-c -o', so 'make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } runpath_var= allow_undefined_flag= always_export_symbols=no archive_cmds= archive_expsym_cmds= compiler_needs_object=no enable_shared_with_static_runtimes=no export_dynamic_flag_spec= export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' hardcode_automatic=no hardcode_direct=no hardcode_direct_absolute=no hardcode_libdir_flag_spec= hardcode_libdir_separator= hardcode_minus_L=no hardcode_shlibpath_var=unsupported inherit_rpath=no link_all_deplibs=unknown module_cmds= module_expsym_cmds= old_archive_from_new_cmds= old_archive_from_expsyms_cmds= thread_safe_flag_spec= whole_archive_flag_spec= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ' (' and ')$', so one must not match beginning or # end of line. Example: 'a|bc|.*d.*' will exclude the symbols 'a' and 'bc', # as well as any symbol that contains 'd'. exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test yes != "$GCC"; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd* | bitrig*) with_gnu_ld=no ;; esac ld_shlibs=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test yes = "$with_gnu_ld"; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[2-9]*) ;; *\ \(GNU\ Binutils\)\ [3-9]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test yes = "$lt_use_gnu_ld_interface"; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='$wl' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' export_dynamic_flag_spec='$wl--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec=$wlarc'--whole-archive$convenience '$wlarc'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v | $SED -e 's/(^)\+)\s\+//' 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[3-9]*) # On AIX/PPC, the GNU linker is very broken if test ia64 != "$host_cpu"; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' export_dynamic_flag_spec='$wl--export-all-symbols' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file, use it as # is; otherwise, prepend EXPORTS... archive_expsym_cmds='if test DEF = "`$SED -n -e '\''s/^[ ]*//'\'' -e '\''/^\(;.*\)*$/d'\'' -e '\''s/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p'\'' -e q $export_symbols`" ; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname $wl--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; haiku*) archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' link_all_deplibs=yes ;; interix[3-9]*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='$wl-rpath,$libdir' export_dynamic_flag_spec='$wl-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s|^|_|" $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-h,$soname $wl--retain-symbols-file,$output_objdir/$soname.expsym $wl--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test linux-dietlibc = "$host_os"; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test no = "$tmp_diet" then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 whole_archive_flag_spec= tmp_sharedflag='--shared' ;; nagfor*) # NAGFOR 5.3 tmp_sharedflag='-Wl,-shared' ;; xl[cC]* | bgxl[cC]* | mpixl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 whole_archive_flag_spec='$wl--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' compiler_needs_object=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 whole_archive_flag_spec='$wl--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` $wl--no-whole-archive' compiler_needs_object=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' if test yes = "$supports_anon_versioning"; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-version-script $wl$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test yes = "$supports_anon_versioning"; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else ld_shlibs=no fi ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 cannot *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname $wl-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test no = "$ld_shlibs"; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test yes = "$GCC" && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix[4-9]*) if test ia64 = "$host_cpu"; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag= else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do if (test x-brtl = "x$ld_flag" || test x-Wl,-brtl = "x$ld_flag"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_direct_absolute=yes hardcode_libdir_separator=':' link_all_deplibs=yes file_list_spec='$wl-f,' if test yes = "$GCC"; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`$CC -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test yes = "$aix_use_runtimelinking"; then shared_flag="$shared_flag "'$wl-G' fi else # not using gcc if test ia64 = "$host_cpu"; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test yes = "$aix_use_runtimelinking"; then shared_flag='$wl-G' else shared_flag='$wl-bM:SRE' fi fi fi export_dynamic_flag_spec='$wl-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test yes = "$aix_use_runtimelinking"; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an # empty executable. if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=/usr/lib:/lib fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='$wl-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs $wl'$no_entry_flag' $compiler_flags `if test -n "$allow_undefined_flag"; then func_echo_all "$wl$allow_undefined_flag"; else :; fi` $wl'$exp_sym_flag:\$export_symbols' '$shared_flag else if test ia64 = "$host_cpu"; then hardcode_libdir_flag_spec='$wl-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\$wl$no_entry_flag"' $compiler_flags $wl$allow_undefined_flag '"\$wl$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. if test set = "${lt_cv_aix_libpath+set}"; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=/usr/lib:/lib fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='$wl-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' $wl-bernotok' allow_undefined_flag=' $wl-berok' if test yes = "$with_gnu_ld"; then # We only use this code for GNU lds that support --whole-archive. whole_archive_flag_spec='$wl--whole-archive$convenience $wl--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' fi archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $wl-bnoentry $compiler_flags $wl-bE:$export_symbols$allow_undefined_flag~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags $wl-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported always_export_symbols=yes file_list_spec='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~linknames=' archive_expsym_cmds='if test DEF = "`$SED -n -e '\''s/^[ ]*//'\'' -e '\''/^\(;.*\)*$/d'\'' -e '\''s/^\(EXPORTS\|LIBRARY\)\([ ].*\)*$/DEF/p'\'' -e q $export_symbols`" ; then cp "$export_symbols" "$output_objdir/$soname.def"; echo "$tool_output_objdir$soname.def" > "$output_objdir/$soname.exp"; else $SED -e '\''s/^/-link -EXPORT:/'\'' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, )='true' enable_shared_with_static_runtimes=yes exclude_expsyms='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1,DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib old_postinstall_cmds='chmod 644 $oldlib' postlink_cmds='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile=$lt_outputfile.exe lt_tool_outputfile=$lt_tool_outputfile.exe ;; esac~ if test : != "$MANIFEST_TOOL" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=.dll # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_from_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs' enable_shared_with_static_runtimes=yes ;; esac ;; darwin* | rhapsody*) archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported if test yes = "$lt_cv_ld_force_load"; then whole_archive_flag_spec='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience $wl-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' else whole_archive_flag_spec='' fi link_all_deplibs=yes allow_undefined_flag=$_lt_dar_allow_undefined case $cc_basename in ifort*|nagfor*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test yes = "$_lt_dar_can_shared"; then output_verbose_link_cmd=func_echo_all archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dsymutil" module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dsymutil" archive_expsym_cmds="sed 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod$_lt_dar_export_syms$_lt_dsymutil" module_expsym_cmds="sed -e 's|^|_|' < \$export_symbols > \$output_objdir/\$libname-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags$_lt_dar_export_syms$_lt_dsymutil" else ld_shlibs=no fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test yes = "$GCC"; then archive_cmds='$RM $output_objdir/$soname~$CC -shared $pic_flag $wl+b $wl$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' else archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test "x$output_objdir/$soname" = "x$lib" || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='$wl+b $wl$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='$wl-E' ;; hpux10*) if test yes,no = "$GCC,$with_gnu_ld"; then archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test no = "$with_gnu_ld"; then hardcode_libdir_flag_spec='$wl+b $wl$libdir' hardcode_libdir_separator=: hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test yes,no = "$GCC,$with_gnu_ld"; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared $pic_flag $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b $wl+h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b $wl+h $wl$soname $wl+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $CC understands -b" >&5 $as_echo_n "checking if $CC understands -b... " >&6; } if ${lt_cv_prog_compiler__b+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler__b=no save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS -b" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler__b=yes fi else lt_cv_prog_compiler__b=yes fi fi $RM -r conftest* LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler__b" >&5 $as_echo "$lt_cv_prog_compiler__b" >&6; } if test yes = "$lt_cv_prog_compiler__b"; then archive_cmds='$CC -b $wl+h $wl$soname $wl+b $wl$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi ;; esac fi if test no = "$with_gnu_ld"; then hardcode_libdir_flag_spec='$wl+b $wl$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='$wl-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test yes = "$GCC"; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $host_os linker accepts -exported_symbol" >&5 $as_echo_n "checking whether the $host_os linker accepts -exported_symbol... " >&6; } if ${lt_cv_irix_exported_symbol+:} false; then : $as_echo_n "(cached) " >&6 else save_LDFLAGS=$LDFLAGS LDFLAGS="$LDFLAGS -shared $wl-exported_symbol ${wl}foo $wl-update_registry $wl/dev/null" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int foo (void) { return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_irix_exported_symbol=yes else lt_cv_irix_exported_symbol=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_irix_exported_symbol" >&5 $as_echo "$lt_cv_irix_exported_symbol" >&6; } if test yes = "$lt_cv_irix_exported_symbol"; then archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations $wl-exports_file $wl$export_symbols -o $lib' fi else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -exports_file $export_symbols -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' hardcode_libdir_separator=: inherit_rpath=yes link_all_deplibs=yes ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; *nto* | *qnx*) ;; openbsd* | bitrig*) if test -f /usr/libexec/ld.so; then hardcode_direct=yes hardcode_shlibpath_var=no hardcode_direct_absolute=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags $wl-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='$wl-rpath,$libdir' export_dynamic_flag_spec='$wl-E' else archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='$wl-rpath,$libdir' fi else ld_shlibs=no fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test yes = "$GCC"; then allow_undefined_flag=' $wl-expect_unresolved $wl\*' archive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test yes = "$GCC"; then allow_undefined_flag=' $wl-expect_unresolved $wl\*' archive_cmds='$CC -shared$allow_undefined_flag $pic_flag $libobjs $deplibs $compiler_flags $wl-msym $wl-soname $wl$soname `test -n "$verstring" && func_echo_all "$wl-set_version $wl$verstring"` $wl-update_registry $wl$output_objdir/so_locations -o $lib' hardcode_libdir_flag_spec='$wl-rpath $wl$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared$allow_undefined_flag $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $wl-input $wl$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry $output_objdir/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi archive_cmds_need_lc='no' hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z defs' if test yes = "$GCC"; then wlarc='$wl' archive_cmds='$CC -shared $pic_flag $wl-z ${wl}text $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag $wl-z ${wl}text $wl-M $wl$lib.exp $wl-h $wl$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' archive_cmds='$LD -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='$wl' archive_cmds='$CC -G$allow_undefined_flag -h $soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G$allow_undefined_flag -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands '-z linker_flag'. GCC discards it without '$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test yes = "$GCC"; then whole_archive_flag_spec='$wl-z ${wl}allextract$convenience $wl-z ${wl}defaultextract' else whole_archive_flag_spec='-z allextract$convenience -z defaultextract' fi ;; esac link_all_deplibs=yes ;; sunos4*) if test sequent = "$host_vendor"; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G $wl-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag='$wl-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then archive_cmds='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We CANNOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='$wl-z,text' allow_undefined_flag='$wl-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='$wl-R,$libdir' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='$wl-Bexport' runpath_var='LD_RUN_PATH' if test yes = "$GCC"; then archive_cmds='$CC -shared $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G $wl-Bexport:$export_symbols $wl-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac if test sni = "$host_vendor"; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) export_dynamic_flag_spec='$wl-Blargedynsym' ;; esac fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5 $as_echo "$ld_shlibs" >&6; } test no = "$ld_shlibs" && can_build_shared=no with_gnu_ld=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test yes,yes = "$GCC,$enable_shared"; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } if ${lt_cv_archive_cmds_need_lc+:} false; then : $as_echo_n "(cached) " >&6 else $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then lt_cv_archive_cmds_need_lc=no else lt_cv_archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc" >&5 $as_echo "$lt_cv_archive_cmds_need_lc" >&6; } archive_cmds_need_lc=$lt_cv_archive_cmds_need_lc ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } if test yes = "$GCC"; then case $host_os in darwin*) lt_awk_arg='/^libraries:/,/LR/' ;; *) lt_awk_arg='/^libraries:/' ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq='s|=\([A-Za-z]:\)|\1|g' ;; *) lt_sed_strip_eq='s|=/|/|g' ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary... lt_tmp_lt_search_path_spec= lt_multi_os_dir=/`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` # ...but if some path component already ends with the multilib dir we assume # that all is fine and trust -print-search-dirs as is (GCC 4.2? or newer). case "$lt_multi_os_dir; $lt_search_path_spec " in "/; "* | "/.; "* | "/./; "* | *"$lt_multi_os_dir "* | *"$lt_multi_os_dir/ "*) lt_multi_os_dir= ;; esac for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path$lt_multi_os_dir" elif test -n "$lt_multi_os_dir"; then test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS = " "; FS = "/|\n";} { lt_foo = ""; lt_count = 0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo = "/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[lt_foo]++; } if (lt_freq[lt_foo] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's|/\([A-Za-z]:\)|\1|g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=.so postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='$libname$release$shared_ext$major' ;; aix[4-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test ia64 = "$host_cpu"; then # AIX 5 supports IA64 library_names_spec='$libname$release$shared_ext$major $libname$release$shared_ext$versuffix $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line '#! .'. This would cause the generated library to # depend on '.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | $CC -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we cannot hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test yes = "$aix_use_runtimelinking"; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='$libname$release.a $libname.a' soname_spec='$libname$release$shared_ext$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='$libname$shared_ext' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=.dll need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo $libname | sed -e 's/^lib/cyg/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo $libname | sed -e 's/^lib/pw/'``echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext' library_names_spec='$libname.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec=$LIB if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \$file`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\$base_file'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='$libname`echo $release | $SED -e 's/[.]/-/g'`$versuffix$shared_ext $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='$libname$release$major$shared_ext $libname$shared_ext' soname_spec='$libname$release$major$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib" sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[23].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=no sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' if test 32 = "$HPUX_IA64_MODE"; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[3-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test yes = "$lt_cv_prog_gnu_ld"; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$release$shared_ext $libname$shared_ext' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib$libsuff /lib$libsuff /usr/local/lib$libsuff" sys_lib_dlsearch_path_spec="/usr/lib$libsuff /lib$libsuff" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; linux*android*) version_type=none # Android doesn't support versioned libraries. need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext' soname_spec='$libname$release$shared_ext' finish_cmds= shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes dynamic_linker='Android linker' # Don't embed -rpath directories since the linker doesn't support them. hardcode_libdir_flag_spec='-L$libdir' ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH if ${lt_cv_shlibpath_overrides_runpath+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : lt_cv_shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir fi shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd* | bitrig*) version_type=sunos sys_lib_dlsearch_path_spec=/usr/lib need_lib_prefix=no if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`"; then need_version=no else need_version=yes fi library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; os2*) libname_spec='$name' shrext_cmds=.dll need_lib_prefix=no library_names_spec='$libname$shared_ext $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='$libname$release$shared_ext$major' library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='$libname$release$shared_ext$versuffix $libname$shared_ext$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test yes = "$with_gnu_ld"; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec; then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$shared_ext.$versuffix $libname$shared_ext.$major $libname$shared_ext' soname_spec='$libname$shared_ext.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test yes = "$with_gnu_ld"; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname$release$shared_ext$versuffix $libname$release$shared_ext$major $libname$shared_ext' soname_spec='$libname$release$shared_ext$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test no = "$dynamic_linker" && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test yes = "$GCC"; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test set = "${lt_cv_sys_lib_search_path_spec+set}"; then sys_lib_search_path_spec=$lt_cv_sys_lib_search_path_spec fi if test set = "${lt_cv_sys_lib_dlsearch_path_spec+set}"; then sys_lib_dlsearch_path_spec=$lt_cv_sys_lib_dlsearch_path_spec fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action= if test -n "$hardcode_libdir_flag_spec" || test -n "$runpath_var" || test yes = "$hardcode_automatic"; then # We can hardcode non-existent directories. if test no != "$hardcode_direct" && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test no != "$_LT_TAGVAR(hardcode_shlibpath_var, )" && test no != "$hardcode_minus_L"; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5 $as_echo "$hardcode_action" >&6; } if test relink = "$hardcode_action" || test yes = "$inherit_rpath"; then # Fast installation is not supported enable_fast_install=no elif test yes = "$shlibpath_overrides_runpath" || test no = "$enable_shared"; then # Fast installation is not necessary enable_fast_install=needless fi if test yes != "$enable_dlopen"; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen=load_add_on lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen=LoadLibrary lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen=dlopen lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl else lt_cv_dlopen=dyld lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; tpf*) # Don't try to run any link tests for TPF. We know it's impossible # because TPF is a cross-compiler, and we know how we open DSOs. lt_cv_dlopen=dlopen lt_cv_dlopen_libs= lt_cv_dlopen_self=no ;; *) ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load" if test "x$ac_cv_func_shl_load" = xyes; then : lt_cv_dlopen=shl_load else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5 $as_echo_n "checking for shl_load in -ldld... " >&6; } if ${ac_cv_lib_dld_shl_load+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char shl_load (); int main () { return shl_load (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_shl_load=yes else ac_cv_lib_dld_shl_load=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load" >&5 $as_echo "$ac_cv_lib_dld_shl_load" >&6; } if test "x$ac_cv_lib_dld_shl_load" = xyes; then : lt_cv_dlopen=shl_load lt_cv_dlopen_libs=-ldld else ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen" if test "x$ac_cv_func_dlopen" = xyes; then : lt_cv_dlopen=dlopen else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-ldl else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5 $as_echo_n "checking for dlopen in -lsvld... " >&6; } if ${ac_cv_lib_svld_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_svld_dlopen=yes else ac_cv_lib_svld_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen" >&5 $as_echo "$ac_cv_lib_svld_dlopen" >&6; } if test "x$ac_cv_lib_svld_dlopen" = xyes; then : lt_cv_dlopen=dlopen lt_cv_dlopen_libs=-lsvld else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5 $as_echo_n "checking for dld_link in -ldld... " >&6; } if ${ac_cv_lib_dld_dld_link+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dld_link (); int main () { return dld_link (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_dld_link=yes else ac_cv_lib_dld_dld_link=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link" >&5 $as_echo "$ac_cv_lib_dld_dld_link" >&6; } if test "x$ac_cv_lib_dld_dld_link" = xyes; then : lt_cv_dlopen=dld_link lt_cv_dlopen_libs=-ldld fi fi fi fi fi fi ;; esac if test no = "$lt_cv_dlopen"; then enable_dlopen=no else enable_dlopen=yes fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS=$CPPFLAGS test yes = "$ac_cv_header_dlfcn_h" && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS=$LDFLAGS wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS=$LIBS LIBS="$lt_cv_dlopen_libs $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5 $as_echo_n "checking whether a program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self+:} false; then : $as_echo_n "(cached) " >&6 else if test yes = "$cross_compiling"; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "conftest$ac_exeext" 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5 $as_echo "$lt_cv_dlopen_self" >&6; } if test yes = "$lt_cv_dlopen_self"; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5 $as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self_static+:} false; then : $as_echo_n "(cached) " >&6 else if test yes = "$cross_compiling"; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined __GNUC__ && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "conftest$ac_exeext" 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5 $as_echo "$lt_cv_dlopen_self_static" >&6; } fi CPPFLAGS=$save_CPPFLAGS LDFLAGS=$save_LDFLAGS LIBS=$save_LIBS ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi striplib= old_striplib= { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5 $as_echo_n "checking whether stripping libraries is possible... " >&6; } if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP"; then striplib="$STRIP -x" old_striplib="$STRIP -S" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } ;; esac fi # Report what library types will actually be built { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5 $as_echo_n "checking if libtool supports shared libraries... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5 $as_echo "$can_build_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5 $as_echo_n "checking whether to build shared libraries... " >&6; } test no = "$can_build_shared" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test yes = "$enable_shared" && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test ia64 != "$host_cpu" && test no = "$aix_use_runtimelinking"; then test yes = "$enable_shared" && enable_static=no fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5 $as_echo "$enable_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5 $as_echo_n "checking whether to build static libraries... " >&6; } # Make sure either enable_shared or enable_static is yes. test yes = "$enable_shared" || enable_static=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5 $as_echo "$enable_static" >&6; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu CC=$lt_save_CC ac_config_commands="$ac_config_commands libtool" # Only expand once: # Extract the first word of "texi2dvi", so it can be a program name with args. set dummy texi2dvi; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_TEXI2DVI+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$TEXI2DVI"; then ac_cv_prog_TEXI2DVI="$TEXI2DVI" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_TEXI2DVI="texi2dvi" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi TEXI2DVI=$ac_cv_prog_TEXI2DVI if test -n "$TEXI2DVI"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $TEXI2DVI" >&5 $as_echo "$TEXI2DVI" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -n "$TEXI2DVI"; then HAVE_TEXI2DVI_TRUE= HAVE_TEXI2DVI_FALSE='#' else HAVE_TEXI2DVI_TRUE='#' HAVE_TEXI2DVI_FALSE= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler vendor" >&5 $as_echo_n "checking for C compiler vendor... " >&6; } if ${ax_cv_c_compiler_vendor+:} false; then : $as_echo_n "(cached) " >&6 else ax_cv_c_compiler_vendor=unknown # note: don't check for gcc first since some other compilers define __GNUC__ for ventest in intel:__ICC,__ECC,__INTEL_COMPILER ibm:__xlc__,__xlC__,__IBMC__,__IBMCPP__ pathscale:__PATHCC__,__PATHSCALE__ gnu:__GNUC__ sun:__SUNPRO_C,__SUNPRO_CC hp:__HP_cc,__HP_aCC dec:__DECC,__DECCXX,__DECC_VER,__DECCXX_VER borland:__BORLANDC__,__TURBOC__ comeau:__COMO__ cray:_CRAYC kai:__KCC lcc:__LCC__ metrowerks:__MWERKS__ sgi:__sgi,sgi microsoft:_MSC_VER watcom:__WATCOMC__ portland:__PGI; do vencpp="defined("`echo $ventest | cut -d: -f2 | sed 's/,/) || defined(/g'`")" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #if !($vencpp) thisisanerror; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_compiler_vendor=`echo $ventest | cut -d: -f1`; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_c_compiler_vendor" >&5 $as_echo "$ax_cv_c_compiler_vendor" >&6; } # Check whether --enable-portable-binary was given. if test "${enable_portable_binary+set}" = set; then : enableval=$enable_portable_binary; acx_maxopt_portable=$withval else acx_maxopt_portable=no fi # Try to determine "good" native compiler flags if none specified via CFLAGS if test "$ac_test_CFLAGS" != "set"; then CFLAGS="" case $ax_cv_c_compiler_vendor in dec) CFLAGS="-newc -w0 -O5 -ansi_alias -ansi_args -fp_reorder -tune host" if test "x$acx_maxopt_portable" = xno; then CFLAGS="$CFLAGS -arch host" fi;; sun) CFLAGS="-native -fast -xO5 -dalign" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS -xarch=generic" fi;; hp) CFLAGS="+Oall +Optrs_ansi +DSnative" if test "x$acx_maxopt_portable" = xyes; then CFLAGS="$CFLAGS +DAportable" fi;; ibm) if test "x$acx_maxopt_portable" = xno; then xlc_opt="-qarch=auto -qtune=auto" else xlc_opt="-qtune=auto" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $xlc_opt" >&5 $as_echo_n "checking whether C compiler accepts $xlc_opt... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$xlc_opt" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$xlc_opt" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$xlc_opt" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$xlc_opt" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="-O3 -qansialias -w $xlc_opt" else CFLAGS="-O3 -qansialias -w" echo "******************************************************" echo "* You seem to have the IBM C compiler. It is *" echo "* recommended for best performance that you use: *" echo "* *" echo "* CFLAGS=-O3 -qarch=xxx -qtune=xxx -qansialias -w *" echo "* ^^^ ^^^ *" echo "* where xxx is pwr2, pwr3, 604, or whatever kind of *" echo "* CPU you have. (Set the CFLAGS environment var. *" echo "* and re-run configure.) For more info, man cc. *" echo "******************************************************" fi ;; intel) CFLAGS="-O3 -ansi_alias" if test "x$acx_maxopt_portable" = xno; then icc_archflag=unknown icc_flags="" case $host_cpu in i686*|x86_64*) # icc accepts gcc assembly syntax, so these should work: ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 0 output" >&5 $as_echo_n "checking for x86 cpuid 0 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_0+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_0=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 0, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_0=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_0=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_0" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_0" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 1 output" >&5 $as_echo_n "checking for x86 cpuid 1 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_1+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_1=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 1, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_1=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_1=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_1" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_1" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu case $ax_cv_gcc_x86_cpuid_0 in # see AX_GCC_ARCHFLAG *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *6a?:*[234]:*:*|*6[789b]?:*:*:*) icc_flags="-xK";; *f3[347]:*:*:*|*f41347:*:*:*) icc_flags="-xP -xN -xW -xK";; *f??:*:*:*) icc_flags="-xN -xW -xK";; esac ;; esac ;; esac if test "x$icc_flags" != x; then for flag in $icc_flags; do { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $flag" >&5 $as_echo_n "checking whether C compiler accepts $flag... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$flag" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then icc_archflag=$flag; break else : fi done fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for icc architecture flag" >&5 $as_echo_n "checking for icc architecture flag... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $icc_archflag" >&5 $as_echo "$icc_archflag" >&6; } if test "x$icc_archflag" != xunknown; then CFLAGS="$CFLAGS $icc_archflag" fi fi ;; gnu) # default optimization flags for gcc on all systems CFLAGS="-O3 -fomit-frame-pointer" # -malign-double for x86 systems { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -malign-double" >&5 $as_echo_n "checking whether C compiler accepts -malign-double... " >&6; } if ${ax_cv_c_flags__malign_double+:} false; then : $as_echo_n "(cached) " >&6 else ax_save_FLAGS=$CFLAGS CFLAGS="-malign-double" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_flags__malign_double=yes else ax_cv_c_flags__malign_double=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS fi eval ax_check_compiler_flags=$ax_cv_c_flags__malign_double { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="$CFLAGS -malign-double" else : fi # -fstrict-aliasing for gcc-2.95+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fstrict-aliasing" >&5 $as_echo_n "checking whether C compiler accepts -fstrict-aliasing... " >&6; } if ${ax_cv_c_flags__fstrict_aliasing+:} false; then : $as_echo_n "(cached) " >&6 else ax_save_FLAGS=$CFLAGS CFLAGS="-fstrict-aliasing" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_flags__fstrict_aliasing=yes else ax_cv_c_flags__fstrict_aliasing=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS fi eval ax_check_compiler_flags=$ax_cv_c_flags__fstrict_aliasing { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="$CFLAGS -fstrict-aliasing" else : fi # note that we enable "unsafe" fp optimization with other compilers, too { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -ffast-math" >&5 $as_echo_n "checking whether C compiler accepts -ffast-math... " >&6; } if ${ax_cv_c_flags__ffast_math+:} false; then : $as_echo_n "(cached) " >&6 else ax_save_FLAGS=$CFLAGS CFLAGS="-ffast-math" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_c_flags__ffast_math=yes else ax_cv_c_flags__ffast_math=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS fi eval ax_check_compiler_flags=$ax_cv_c_flags__ffast_math { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then CFLAGS="$CFLAGS -ffast-math" else : fi # Check whether --with-gcc-arch was given. if test "${with_gcc_arch+set}" = set; then : withval=$with_gcc_arch; ax_gcc_arch=$withval else ax_gcc_arch=yes fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for gcc architecture flag" >&5 $as_echo_n "checking for gcc architecture flag... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: " >&5 $as_echo "" >&6; } if ${ax_cv_gcc_archflag+:} false; then : $as_echo_n "(cached) " >&6 else ax_cv_gcc_archflag="unknown" if test "$GCC" = yes; then if test "x$ax_gcc_arch" = xyes; then ax_gcc_arch="" if test "$cross_compiling" = no; then case $host_cpu in i[3456]86*|x86_64*) # use cpuid codes, in part from x86info-1.7 by D. Jones ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 0 output" >&5 $as_echo_n "checking for x86 cpuid 0 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_0+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_0=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 0, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_0=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_0=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_0" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_0" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 1 output" >&5 $as_echo_n "checking for x86 cpuid 1 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_1+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_1=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 1, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_1=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_1=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_1" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_1" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu case $ax_cv_gcc_x86_cpuid_0 in *:756e6547:*:*) # Intel case $ax_cv_gcc_x86_cpuid_1 in *5[48]?:*:*:*) ax_gcc_arch="pentium-mmx pentium" ;; *5??:*:*:*) ax_gcc_arch=pentium ;; *6[3456]?:*:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[01]:*:*) ax_gcc_arch="pentium2 pentiumpro" ;; *6a?:*[234]:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6[9d]?:*:*:*) ax_gcc_arch="pentium-m pentium3 pentiumpro" ;; *6[78b]?:*:*:*) ax_gcc_arch="pentium3 pentiumpro" ;; *6??:*:*:*) ax_gcc_arch=pentiumpro ;; *f3[347]:*:*:*|*f41347:*:*:*) case $host_cpu in x86_64*) ax_gcc_arch="nocona pentium4 pentiumpro" ;; *) ax_gcc_arch="prescott pentium4 pentiumpro" ;; esac ;; *f??:*:*:*) ax_gcc_arch="pentium4 pentiumpro";; esac ;; *:68747541:*:*) # AMD case $ax_cv_gcc_x86_cpuid_1 in *5[67]?:*:*:*) ax_gcc_arch=k6 ;; *5[8d]?:*:*:*) ax_gcc_arch="k6-2 k6" ;; *5[9]?:*:*:*) ax_gcc_arch="k6-3 k6" ;; *60?:*:*:*) ax_gcc_arch=k7 ;; *6[12]?:*:*:*) ax_gcc_arch="athlon k7" ;; *6[34]?:*:*:*) ax_gcc_arch="athlon-tbird k7" ;; *67?:*:*:*) ax_gcc_arch="athlon-4 athlon k7" ;; *6[68a]?:*:*:*) ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for x86 cpuid 0x80000006 output" >&5 $as_echo_n "checking for x86 cpuid 0x80000006 output... " >&6; } if ${ax_cv_gcc_x86_cpuid_0x80000006+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ax_cv_gcc_x86_cpuid_0x80000006=unknown else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { int op = 0x80000006, eax, ebx, ecx, edx; FILE *f; __asm__("cpuid" : "=a" (eax), "=b" (ebx), "=c" (ecx), "=d" (edx) : "a" (op)); f = fopen("conftest_cpuid", "w"); if (!f) return 1; fprintf(f, "%x:%x:%x:%x\n", eax, ebx, ecx, edx); fclose(f); return 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ax_cv_gcc_x86_cpuid_0x80000006=`cat conftest_cpuid`; rm -f conftest_cpuid else ax_cv_gcc_x86_cpuid_0x80000006=unknown; rm -f conftest_cpuid fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_x86_cpuid_0x80000006" >&5 $as_echo "$ax_cv_gcc_x86_cpuid_0x80000006" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # L2 cache size case $ax_cv_gcc_x86_cpuid_0x80000006 in *:*:*[1-9a-f]??????:*) # (L2 = ecx >> 16) >= 256 ax_gcc_arch="athlon-xp athlon-4 athlon k7" ;; *) ax_gcc_arch="athlon-4 athlon k7" ;; esac ;; *f[4cef8b]?:*:*:*) ax_gcc_arch="athlon64 k8" ;; *f5?:*:*:*) ax_gcc_arch="opteron k8" ;; *f7?:*:*:*) ax_gcc_arch="athlon-fx opteron k8" ;; *f??:*:*:*) ax_gcc_arch="k8" ;; esac ;; *:746e6543:*:*) # IDT case $ax_cv_gcc_x86_cpuid_1 in *54?:*:*:*) ax_gcc_arch=winchip-c6 ;; *58?:*:*:*) ax_gcc_arch=winchip2 ;; *6[78]?:*:*:*) ax_gcc_arch=c3 ;; *69?:*:*:*) ax_gcc_arch="c3-2 c3" ;; esac ;; esac if test x"$ax_gcc_arch" = x; then # fallback case $host_cpu in i586*) ax_gcc_arch=pentium ;; i686*) ax_gcc_arch=pentiumpro ;; esac fi ;; sparc*) # Extract the first word of "prtdiag", so it can be a program name with args. set dummy prtdiag; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_PRTDIAG+:} false; then : $as_echo_n "(cached) " >&6 else case $PRTDIAG in [\\/]* | ?:[\\/]*) ac_cv_path_PRTDIAG="$PRTDIAG" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_dummy="$PATH:/usr/platform/`uname -i`/sbin/:/usr/platform/`uname -m`/sbin/" for as_dir in $as_dummy do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_path_PRTDIAG="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_path_PRTDIAG" && ac_cv_path_PRTDIAG="prtdiag" ;; esac fi PRTDIAG=$ac_cv_path_PRTDIAG if test -n "$PRTDIAG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PRTDIAG" >&5 $as_echo "$PRTDIAG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi cputype=`(((grep cpu /proc/cpuinfo | cut -d: -f2) ; ($PRTDIAG -v |grep -i sparc) ; grep -i cpu /var/run/dmesg.boot ) | head -n 1) 2> /dev/null` cputype=`echo "$cputype" | tr -d ' -' |tr $as_cr_LETTERS $as_cr_letters` case $cputype in *ultrasparciv*) ax_gcc_arch="ultrasparc4 ultrasparc3 ultrasparc v9" ;; *ultrasparciii*) ax_gcc_arch="ultrasparc3 ultrasparc v9" ;; *ultrasparc*) ax_gcc_arch="ultrasparc v9" ;; *supersparc*|*tms390z5[05]*) ax_gcc_arch="supersparc v8" ;; *hypersparc*|*rt62[056]*) ax_gcc_arch="hypersparc v8" ;; *cypress*) ax_gcc_arch=cypress ;; esac ;; alphaev5) ax_gcc_arch=ev5 ;; alphaev56) ax_gcc_arch=ev56 ;; alphapca56) ax_gcc_arch="pca56 ev56" ;; alphapca57) ax_gcc_arch="pca57 pca56 ev56" ;; alphaev6) ax_gcc_arch=ev6 ;; alphaev67) ax_gcc_arch=ev67 ;; alphaev68) ax_gcc_arch="ev68 ev67" ;; alphaev69) ax_gcc_arch="ev69 ev68 ev67" ;; alphaev7) ax_gcc_arch="ev7 ev69 ev68 ev67" ;; alphaev79) ax_gcc_arch="ev79 ev7 ev69 ev68 ev67" ;; powerpc*) cputype=`((grep cpu /proc/cpuinfo | head -n 1 | cut -d: -f2 | cut -d, -f1 | sed 's/ //g') ; /usr/bin/machine ; /bin/machine; grep CPU /var/run/dmesg.boot | head -n 1 | cut -d" " -f2) 2> /dev/null` cputype=`echo $cputype | sed -e 's/ppc//g;s/ *//g'` case $cputype in *750*) ax_gcc_arch="750 G3" ;; *740[0-9]*) ax_gcc_arch="$cputype 7400 G4" ;; *74[4-5][0-9]*) ax_gcc_arch="$cputype 7450 G4" ;; *74[0-9][0-9]*) ax_gcc_arch="$cputype G4" ;; *970*) ax_gcc_arch="970 G5 power4";; *POWER4*|*power4*|*gq*) ax_gcc_arch="power4 970";; *POWER5*|*power5*|*gr*|*gs*) ax_gcc_arch="power5 power4 970";; 603ev|8240) ax_gcc_arch="$cputype 603e 603";; *) ax_gcc_arch=$cputype ;; esac ax_gcc_arch="$ax_gcc_arch powerpc" ;; esac fi # not cross-compiling fi # guess arch if test "x$ax_gcc_arch" != x -a "x$ax_gcc_arch" != xno; then for arch in $ax_gcc_arch; do if test "x$acx_maxopt_portable" = xyes; then # if we require portable code flags="-mtune=$arch" # -mcpu=$arch and m$arch generate nonportable code on every arch except # x86. And some other arches (e.g. Alpha) don't accept -mtune. Grrr. case $host_cpu in i*86|x86_64*) flags="$flags -mcpu=$arch -m$arch";; esac else flags="-march=$arch -mcpu=$arch -m$arch" fi for flag in $flags; do { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $flag" >&5 $as_echo_n "checking whether C compiler accepts $flag... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$flag" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$flag" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then ax_cv_gcc_archflag=$flag; break else : fi done test "x$ax_cv_gcc_archflag" = xunknown || break done fi fi # $GCC=yes fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for gcc architecture flag" >&5 $as_echo_n "checking for gcc architecture flag... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_gcc_archflag" >&5 $as_echo "$ax_cv_gcc_archflag" >&6; } if test "x$ax_cv_gcc_archflag" = xunknown; then : else CFLAGS="$CFLAGS $ax_cv_gcc_archflag" fi ;; esac if test -z "$CFLAGS"; then echo "" echo "********************************************************" echo "* WARNING: Don't know the best CFLAGS for this system *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "* (otherwise, a default of CFLAGS=-O3 will be used) *" echo "********************************************************" echo "" CFLAGS="-O3" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts $CFLAGS" >&5 $as_echo_n "checking whether C compiler accepts $CFLAGS... " >&6; } ax_save_FLAGS=$CFLAGS CFLAGS="$CFLAGS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval `$as_echo "ax_cv_c_flags_$CFLAGS" | $as_tr_sh`=yes else eval `$as_echo "ax_cv_c_flags_$CFLAGS" | $as_tr_sh`=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_save_FLAGS eval ax_check_compiler_flags=$`$as_echo "ax_cv_c_flags_$CFLAGS" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_check_compiler_flags" >&5 $as_echo "$ax_check_compiler_flags" >&6; } if test "x$ax_check_compiler_flags" = xyes; then : else echo "" echo "********************************************************" echo "* WARNING: The guessed CFLAGS don't seem to work with *" echo "* your compiler. *" echo "* Use ./configure CFLAGS=... to specify your own flags *" echo "********************************************************" echo "" CFLAGS="" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking CFLAGS_WARN for maximum warnings" >&5 $as_echo_n "checking CFLAGS_WARN for maximum warnings... " >&6; } if ${ac_cv_cflags_warn_all+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_cflags_warn_all="no, unknown" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_save_CFLAGS="$CFLAGS" for ac_arg in "-pedantic % -Wall" "-xstrconst % -v" "-std1 % -verbose -w0 -warnprotos" "-qlanglvl=ansi % -qsrcmsg -qinfo=all:noppt:noppc:noobs:nocnd" "-ansi -ansiE % -fullwarn" "+ESlit % +w1" "-Xc % -pvctl,fullmsg" "-h conform % -h msglevel 2" # do CFLAGS="$ac_save_CFLAGS "`echo $ac_arg | sed -e 's,%%.*,,' -e 's,%,,'` cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_cflags_warn_all=`echo $ac_arg | sed -e 's,.*% *,,'` ; break fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done CFLAGS="$ac_save_CFLAGS" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cflags_warn_all" >&5 $as_echo "$ac_cv_cflags_warn_all" >&6; } case ".$ac_cv_cflags_warn_all" in .ok|.ok,*) ;; .|.no|.no,*) ;; *) if echo " $CFLAGS_WARN " | grep " $ac_cv_cflags_warn_all " 2>&1 >/dev/null then { { $as_echo "$as_me:${as_lineno-$LINENO}: : CFLAGS_WARN does contain \$ac_cv_cflags_warn_all"; } >&5 (: CFLAGS_WARN does contain $ac_cv_cflags_warn_all) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } else { { $as_echo "$as_me:${as_lineno-$LINENO}: : CFLAGS_WARN=\"\$CFLAGS_WARN \$ac_cv_cflags_warn_all\""; } >&5 (: CFLAGS_WARN="$CFLAGS_WARN $ac_cv_cflags_warn_all") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } CFLAGS_WARN="$CFLAGS_WARN $ac_cv_cflags_warn_all" fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for an ANSI C-conforming const" >&5 $as_echo_n "checking for an ANSI C-conforming const... " >&6; } if ${ac_cv_c_const+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { /* FIXME: Include the comments suggested by Paul. */ #ifndef __cplusplus /* Ultrix mips cc rejects this. */ typedef int charset[2]; const charset cs; /* SunOS 4.1.1 cc rejects this. */ char const *const *pcpcc; char **ppc; /* NEC SVR4.0.2 mips cc rejects this. */ struct point {int x, y;}; static struct point const zero = {0,0}; /* AIX XL C 1.02.0.0 rejects this. It does not let you subtract one const X* pointer from another in an arm of an if-expression whose if-part is not a constant expression */ const char *g = "string"; pcpcc = &g + (g ? g-g : 0); /* HPUX 7.0 cc rejects these. */ ++pcpcc; ppc = (char**) pcpcc; pcpcc = (char const *const *) ppc; { /* SCO 3.2v4 cc rejects this. */ char *t; char const *s = 0 ? (char *) 0 : (char const *) 0; *t++ = 0; if (s) return 0; } { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ int x[] = {25, 17}; const int *foo = &x[0]; ++foo; } { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ typedef const int *iptr; iptr p = 0; ++p; } { /* AIX XL C 1.02.0.0 rejects this saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; }; struct s *b; b->j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; if (!foo) return 0; } return !cs[0] && !zero.x; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_const=yes else ac_cv_c_const=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_const" >&5 $as_echo "$ac_cv_c_const" >&6; } if test $ac_cv_c_const = no; then $as_echo "#define const /**/" >>confdefs.h fi ac_fn_c_check_type "$LINENO" "size_t" "ac_cv_type_size_t" "$ac_includes_default" if test "x$ac_cv_type_size_t" = xyes; then : else cat >>confdefs.h <<_ACEOF #define size_t unsigned int _ACEOF fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi for ac_func in strtol do : ac_fn_c_check_func "$LINENO" "strtol" "ac_cv_func_strtol" if test "x$ac_cv_func_strtol" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_STRTOL 1 _ACEOF fi done for ac_func in getrusage do : ac_fn_c_check_func "$LINENO" "getrusage" "ac_cv_func_getrusage" if test "x$ac_cv_func_getrusage" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_GETRUSAGE 1 _ACEOF $as_echo "#define CLOOG_RUSAGE /**/" >>confdefs.h fi done # Check whether --with-isl was given. if test "${with_isl+set}" = set; then : withval=$with_isl; fi case "system" in no|system|build|bundled) # Check whether --with-isl_prefix was given. if test "${with_isl_prefix+set}" = set; then : withval=$with_isl_prefix; fi # Check whether --with-isl_exec_prefix was given. if test "${with_isl_exec_prefix+set}" = set; then : withval=$with_isl_exec_prefix; fi esac case "build" in no|system|build|bundled) # Check whether --with-isl_builddir was given. if test "${with_isl_builddir+set}" = set; then : withval=$with_isl_builddir; fi esac if test "x$with_isl_prefix" != "x" -a "x$with_isl_exec_prefix" = "x"; then with_isl_exec_prefix=$with_isl_prefix fi if test "x$with_isl_prefix" != "x" -o "x$with_isl_exec_prefix" != "x"; then if test "x$with_isl" != "x" -a "x$with_isl" != "xsystem"; then as_fn_error $? "Setting $with_isl_prefix implies use of system isl" "$LINENO" 5 fi with_isl="system" fi if test "x$with_isl_builddir" != "x"; then if test "x$with_isl" != "x" -a "x$with_isl" != "xbuild"; then as_fn_error $? "Setting $with_isl_builddir implies use of build isl" "$LINENO" 5 fi with_isl="build" isl_srcdir=`echo @abs_srcdir@ | $with_isl_builddir/config.status --file=-` { $as_echo "$as_me:${as_lineno-$LINENO}: isl sources in $isl_srcdir" >&5 $as_echo "$as_me: isl sources in $isl_srcdir" >&6;} fi case "$with_isl" in no|system|build|bundled) ;; *) if test -d $srcdir/.git -a \ -d $srcdir/isl -a \ ! -d $srcdir/isl/.git; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git repo detected, but submodule isl not initialized" >&5 $as_echo "$as_me: WARNING: git repo detected, but submodule isl not initialized" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You may want to run" >&5 $as_echo "$as_me: WARNING: You may want to run" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule init" >&5 $as_echo "$as_me: WARNING: git submodule init" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule update" >&5 $as_echo "$as_me: WARNING: git submodule update" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: sh autogen.sh" >&5 $as_echo "$as_me: WARNING: sh autogen.sh" >&2;} fi if test -f $srcdir/isl/configure -a "bundled" != "no"; then with_isl="bundled" else with_isl="bundled" fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking which isl to use" >&5 $as_echo_n "checking which isl to use... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_isl" >&5 $as_echo "$with_isl" >&6; } BITS="gmp" # Check whether --with-gmp was given. if test "${with_gmp+set}" = set; then : withval=$with_gmp; fi case "system" in system|build) # Check whether --with-gmp_prefix was given. if test "${with_gmp_prefix+set}" = set; then : withval=$with_gmp_prefix; fi # Check whether --with-gmp_exec_prefix was given. if test "${with_gmp_exec_prefix+set}" = set; then : withval=$with_gmp_exec_prefix; fi esac case "build" in system|build) # Check whether --with-gmp_builddir was given. if test "${with_gmp_builddir+set}" = set; then : withval=$with_gmp_builddir; fi esac if test "x$with_gmp_prefix" != "x" -a "x$with_gmp_exec_prefix" = "x"; then with_gmp_exec_prefix=$with_gmp_prefix fi if test "x$with_gmp_prefix" != "x" -o "x$with_gmp_exec_prefix" != "x"; then if test "x$with_gmp" != "x" -a "x$with_gmp" != "xsystem"; then as_fn_error $? "Setting $with_gmp_prefix implies use of system gmp" "$LINENO" 5 fi with_gmp="system" fi if test "x$with_gmp_builddir" != "x"; then if test "x$with_gmp" != "x" -a "x$with_gmp" != "xbuild"; then as_fn_error $? "Setting $with_gmp_builddir implies use of build gmp" "$LINENO" 5 fi with_gmp="build" gmp_srcdir=`echo @abs_srcdir@ | $with_gmp_builddir/config.status --file=-` { $as_echo "$as_me:${as_lineno-$LINENO}: gmp sources in $gmp_srcdir" >&5 $as_echo "$as_me: gmp sources in $gmp_srcdir" >&6;} fi case "$with_gmp" in system|build) ;; *) if test -d $srcdir/.git -a \ -d $srcdir/gmp -a \ ! -d $srcdir/gmp/.git; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git repo detected, but submodule gmp not initialized" >&5 $as_echo "$as_me: WARNING: git repo detected, but submodule gmp not initialized" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You may want to run" >&5 $as_echo "$as_me: WARNING: You may want to run" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule init" >&5 $as_echo "$as_me: WARNING: git submodule init" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule update" >&5 $as_echo "$as_me: WARNING: git submodule update" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: sh autogen.sh" >&5 $as_echo "$as_me: WARNING: sh autogen.sh" >&2;} fi if test -f $srcdir/gmp/configure -a "system" != "no"; then with_gmp="bundled" else with_gmp="system" fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking which gmp to use" >&5 $as_echo_n "checking which gmp to use... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_gmp" >&5 $as_echo "$with_gmp" >&6; } need_get_memory_functions=false case "$with_gmp" in build) CPPFLAGS="-I$with_gmp_builddir $CPPFLAGS" LDFLAGS="-L$with_gmp_builddir/$lt_cv_objdir $LDFLAGS" ;; system) if test "x$with_gmp_prefix" != "x"; then CPPFLAGS="-I$with_gmp_prefix/include $CPPFLAGS" fi if test "$with_gmp_exec_prefix" != "yes" ; then LDFLAGS="-L$with_gmp_exec_prefix/lib $LDFLAGS" fi ;; esac case "$with_gmp" in build|system) ac_fn_c_check_header_mongrel "$LINENO" "gmp.h" "ac_cv_header_gmp_h" "$ac_includes_default" if test "x$ac_cv_header_gmp_h" = xyes; then : else as_fn_error $? "Can't find gmp headers." "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for __gmpz_init in -lgmp" >&5 $as_echo_n "checking for __gmpz_init in -lgmp... " >&6; } if ${ac_cv_lib_gmp___gmpz_init+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lgmp $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char __gmpz_init (); int main () { return __gmpz_init (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_gmp___gmpz_init=yes else ac_cv_lib_gmp___gmpz_init=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_gmp___gmpz_init" >&5 $as_echo "$ac_cv_lib_gmp___gmpz_init" >&6; } if test "x$ac_cv_lib_gmp___gmpz_init" = xyes; then : LIBS="$LIBS -lgmp" else as_fn_error $? "Can't find gmp library." "$LINENO" 5 fi ac_fn_c_check_decl "$LINENO" "mp_get_memory_functions" "ac_cv_have_decl_mp_get_memory_functions" "#include " if test "x$ac_cv_have_decl_mp_get_memory_functions" = xyes; then : ac_have_decl=1 else ac_have_decl=0 fi cat >>confdefs.h <<_ACEOF #define HAVE_DECL_MP_GET_MEMORY_FUNCTIONS $ac_have_decl _ACEOF if test $ac_have_decl = 1; then : else need_get_memory_functions=true fi ;; esac if test x$need_get_memory_functions = xtrue; then NEED_GET_MEMORY_FUNCTIONS_TRUE= NEED_GET_MEMORY_FUNCTIONS_FALSE='#' else NEED_GET_MEMORY_FUNCTIONS_TRUE='#' NEED_GET_MEMORY_FUNCTIONS_FALSE= fi case "$with_isl" in bundled) ISL_CPPFLAGS="-I$srcdir/isl/include -Iisl/include" ;; build) ISL_CPPFLAGS="-I$isl_srcdir/include -I$with_isl_builddir/include" ISL_LIBS="$with_isl_builddir/libisl.la" ;; system) if test "x$with_isl_prefix" != "x"; then ISL_CPPFLAGS="-I$with_isl_prefix/include" fi if test "x$with_isl_exec_prefix" != "x"; then ISL_LDFLAGS="-L$with_isl_exec_prefix/lib" fi ISL_LIBS="-lisl" esac if test $with_isl = bundled; then BUNDLED_ISL_TRUE= BUNDLED_ISL_FALSE='#' else BUNDLED_ISL_TRUE='#' BUNDLED_ISL_FALSE= fi if test $with_isl = no; then NO_ISL_TRUE= NO_ISL_FALSE='#' else NO_ISL_TRUE='#' NO_ISL_FALSE= fi # Check whether --with-osl was given. if test "${with_osl+set}" = set; then : withval=$with_osl; fi case "system" in no|system|build|bundled) # Check whether --with-osl_prefix was given. if test "${with_osl_prefix+set}" = set; then : withval=$with_osl_prefix; fi # Check whether --with-osl_exec_prefix was given. if test "${with_osl_exec_prefix+set}" = set; then : withval=$with_osl_exec_prefix; fi esac case "build" in no|system|build|bundled) # Check whether --with-osl_builddir was given. if test "${with_osl_builddir+set}" = set; then : withval=$with_osl_builddir; fi esac if test "x$with_osl_prefix" != "x" -a "x$with_osl_exec_prefix" = "x"; then with_osl_exec_prefix=$with_osl_prefix fi if test "x$with_osl_prefix" != "x" -o "x$with_osl_exec_prefix" != "x"; then if test "x$with_osl" != "x" -a "x$with_osl" != "xsystem"; then as_fn_error $? "Setting $with_osl_prefix implies use of system osl" "$LINENO" 5 fi with_osl="system" fi if test "x$with_osl_builddir" != "x"; then if test "x$with_osl" != "x" -a "x$with_osl" != "xbuild"; then as_fn_error $? "Setting $with_osl_builddir implies use of build osl" "$LINENO" 5 fi with_osl="build" osl_srcdir=`echo @abs_srcdir@ | $with_osl_builddir/config.status --file=-` { $as_echo "$as_me:${as_lineno-$LINENO}: osl sources in $osl_srcdir" >&5 $as_echo "$as_me: osl sources in $osl_srcdir" >&6;} fi case "$with_osl" in no|system|build|bundled) ;; *) if test -d $srcdir/.git -a \ -d $srcdir/osl -a \ ! -d $srcdir/osl/.git; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git repo detected, but submodule osl not initialized" >&5 $as_echo "$as_me: WARNING: git repo detected, but submodule osl not initialized" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You may want to run" >&5 $as_echo "$as_me: WARNING: You may want to run" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule init" >&5 $as_echo "$as_me: WARNING: git submodule init" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: git submodule update" >&5 $as_echo "$as_me: WARNING: git submodule update" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: sh autogen.sh" >&5 $as_echo "$as_me: WARNING: sh autogen.sh" >&2;} fi if test -f $srcdir/osl/configure -a "no" != "no"; then with_osl="bundled" else with_osl="no" fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking which osl to use" >&5 $as_echo_n "checking which osl to use... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $with_osl" >&5 $as_echo "$with_osl" >&6; } osl_flag="OSL_SUPPORT" case "$with_osl" in bundled) OSL_CPPFLAGS="-D$osl_flag -I$srcdir/osl/include -Iosl/include" ;; build) OSL_CPPFLAGS="-D$osl_flag -I$osl_srcdir/include -I$with_osl_builddir/include" OSL_LIBS="$with_osl_builddir/libosl.la" ;; system) if test "x$with_osl_prefix" != "x"; then OSL_CPPFLAGS="-D$osl_flag -I$with_osl_prefix/include" fi if test "x$with_osl_exec_prefix" != "x"; then OSL_LDFLAGS="-L$with_osl_exec_prefix/lib" fi OSL_LIBS="-losl" esac if test $with_osl = bundled; then BUNDLED_OSL_TRUE= BUNDLED_OSL_FALSE='#' else BUNDLED_OSL_TRUE='#' BUNDLED_OSL_FALSE= fi if test $with_osl = no; then NO_OSL_TRUE= NO_OSL_FALSE='#' else NO_OSL_TRUE='#' NO_OSL_FALSE= fi $as_echo "#define CLOOG_INT_GMP 1" >>confdefs.h if test -f $srcdir/.git/HEAD; then GIT_INDEX="\$(top_srcdir)/.git/index" fi PACKAGE_NAME="cloog-isl" PACKAGE_CFLAGS="-DCLOOG_INT_GMP=1" # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig libname" >&5 $as_echo_n "checking our pkgconfig libname... " >&6; } test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="${PACKAGE_NAME}" test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="$PACKAGE" ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libname" >&5 $as_echo "$ax_create_pkgconfig_libname" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig version" >&5 $as_echo_n "checking our pkgconfig version... " >&6; } test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="${PACKAGE_VERSION}" test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="$VERSION" ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_version" >&5 $as_echo "$ax_create_pkgconfig_version" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libdir" >&5 $as_echo_n "checking our pkgconfig_libdir... " >&6; } test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' ax_create_pkgconfig_libdir=`eval echo "$pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libdir" >&5 $as_echo "$pkgconfig_libdir" >&6; } test "$pkgconfig_libdir" != "$ax_create_pkgconfig_libdir" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&5 $as_echo "expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libfile" >&5 $as_echo_n "checking our pkgconfig_libfile... " >&6; } test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_libfile=`eval echo "$pkgconfig_libfile"` ax_create_pkgconfig_libfile=`eval echo "$ax_create_pkgconfig_libfile"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libfile" >&5 $as_echo "$pkgconfig_libfile" >&6; } test "$pkgconfig_libfile" != "$ax_create_pkgconfig_libfile" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&5 $as_echo "expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our package / suffix" >&5 $as_echo_n "checking our package / suffix... " >&6; } ax_create_pkgconfig_suffix="$program_suffix" test ".$ax_create_pkgconfig_suffix" != .NONE || ax_create_pkgconfig_suffix="" { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&5 $as_echo "${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig description" >&5 $as_echo_n "checking our pkgconfig description... " >&6; } ax_create_pkgconfig_description="$PACKAGE_SUMMARY" test ".$ax_create_pkgconfig_description" != "." || \ ax_create_pkgconfig_description="$ax_create_pkgconfig_libname Library" ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_description" >&5 $as_echo "$ax_create_pkgconfig_description" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig requires" >&5 $as_echo_n "checking our pkgconfig requires... " >&6; } ax_create_pkgconfig_requires="$PACKAGE_REQUIRES" ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_requires" >&5 $as_echo "$ax_create_pkgconfig_requires" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ext libs" >&5 $as_echo_n "checking our pkgconfig ext libs... " >&6; } ax_create_pkgconfig_pkglibs="$PACKAGE_LIBS" test ".$ax_create_pkgconfig_pkglibs" != "." || ax_create_pkgconfig_pkglibs="-l$ax_create_pkgconfig_libname" ax_create_pkgconfig_libs="$ax_create_pkgconfig_pkglibs $LIBS" ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libs" >&5 $as_echo "$ax_create_pkgconfig_libs" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig cppflags" >&5 $as_echo_n "checking our pkgconfig cppflags... " >&6; } ax_create_pkgconfig_cppflags="$CPPFLAGS $PACKAGE_CFLAGS" ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_cppflags" >&5 $as_echo "$ax_create_pkgconfig_cppflags" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ldflags" >&5 $as_echo_n "checking our pkgconfig ldflags... " >&6; } ax_create_pkgconfig_ldflags="$LDFLAGS $PACKAGE_LDFLAGS" ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_ldflags" >&5 $as_echo "$ax_create_pkgconfig_ldflags" >&6; } test ".$ax_create_pkgconfig_generate" != "." || \ ax_create_pkgconfig_generate="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` test "$pkgconfig_libfile" != "$ax_create_pkgconfig_generate" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: generate the pkgconfig later... $ax_create_pkgconfig_generate" >&5 $as_echo "generate the pkgconfig later... $ax_create_pkgconfig_generate" >&6; }) if test ".$ax_create_pkgconfig_src_libdir" = "." ; then ax_create_pkgconfig_src_libdir=`pwd` ax_create_pkgconfig_src_libdir=`$as_dirname -- "$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" || $as_expr X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_libdir/src || \ ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/src" case ".$objdir" in *libs) ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/$objdir" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&5 $as_echo "noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&6; } fi if test ".$ax_create_pkgconfig_src_headers" = "." ; then ax_create_pkgconfig_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) ax_create_pkgconfig_src_headers="" ;; esac ax_create_pkgconfig_src_headers=`$as_dirname -- "$ax_create_pkgconfig_src_headers/$v/x" || $as_expr X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_headers/$v/x" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_headers/include || \ ax_create_pkgconfig_src_headers="$ax_create_pkgconfig_src_headers/include" { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&5 $as_echo "noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&6; } fi ac_config_commands="$ac_config_commands $ax_create_pkgconfig_generate" ac_config_files="$ac_config_files Makefile test/Makefile" ac_config_files="$ac_config_files autoconf/Doxyfile" ac_config_files="$ac_config_files doc/Makefile" ac_config_files="$ac_config_files source/version.c" ac_config_files="$ac_config_files include/cloog/version.h" ac_config_files="$ac_config_files genversion.sh" ac_config_commands="$ac_config_commands version.h" ac_config_commands="$ac_config_commands doc/gitversion.texi" if test $with_isl = bundled; then subdirs="$subdirs isl" fi if test $with_osl = bundled; then subdirs="$subdirs osl" fi cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # Transform confdefs.h into DEFS. # Protect against shell expansion while executing Makefile rules. # Protect against Makefile macro expansion. # # If the first sed substitution is executed (which looks for macros that # take arguments), then branch to the quote section. Otherwise, # look for a macro that doesn't take arguments. ac_script=' :mline /\\$/{ N s,\\\n,, b mline } t clear :clear s/^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*([^)]*)\)[ ]*\(.*\)/-D\1=\2/g t quote s/^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\)/-D\1=\2/g t quote b any :quote s/[ `~#$^&*(){}\\|;'\''"<>?]/\\&/g s/\[/\\&/g s/\]/\\&/g s/\$/$$/g H :any ${ g s/^\n// s/\n/ /g p } ' DEFS=`sed -n "$ac_script" confdefs.h` ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error $? "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_TEXI2DVI_TRUE}" && test -z "${HAVE_TEXI2DVI_FALSE}"; then as_fn_error $? "conditional \"HAVE_TEXI2DVI\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${NEED_GET_MEMORY_FUNCTIONS_TRUE}" && test -z "${NEED_GET_MEMORY_FUNCTIONS_FALSE}"; then as_fn_error $? "conditional \"NEED_GET_MEMORY_FUNCTIONS\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${BUNDLED_ISL_TRUE}" && test -z "${BUNDLED_ISL_FALSE}"; then as_fn_error $? "conditional \"BUNDLED_ISL\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${NO_ISL_TRUE}" && test -z "${NO_ISL_FALSE}"; then as_fn_error $? "conditional \"NO_ISL\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${BUNDLED_OSL_TRUE}" && test -z "${BUNDLED_OSL_FALSE}"; then as_fn_error $? "conditional \"BUNDLED_OSL\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${NO_OSL_TRUE}" && test -z "${NO_OSL_FALSE}"; then as_fn_error $? "conditional \"NO_OSL\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in #( -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #(( ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by cloog $as_me 0.18.2, which was generated by GNU Autoconf 2.68. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE Configuration files: $config_files Configuration commands: $config_commands Report bugs to ." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ cloog config.status 0.18.2 configured by $0, generated by GNU Autoconf 2.68, with options \\"\$ac_cs_config\\" Copyright (C) 2010 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --he | --h | --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X '$SHELL' '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' macro_version='`$ECHO "$macro_version" | $SED "$delay_single_quote_subst"`' macro_revision='`$ECHO "$macro_revision" | $SED "$delay_single_quote_subst"`' enable_shared='`$ECHO "$enable_shared" | $SED "$delay_single_quote_subst"`' enable_static='`$ECHO "$enable_static" | $SED "$delay_single_quote_subst"`' pic_mode='`$ECHO "$pic_mode" | $SED "$delay_single_quote_subst"`' enable_fast_install='`$ECHO "$enable_fast_install" | $SED "$delay_single_quote_subst"`' SHELL='`$ECHO "$SHELL" | $SED "$delay_single_quote_subst"`' ECHO='`$ECHO "$ECHO" | $SED "$delay_single_quote_subst"`' PATH_SEPARATOR='`$ECHO "$PATH_SEPARATOR" | $SED "$delay_single_quote_subst"`' host_alias='`$ECHO "$host_alias" | $SED "$delay_single_quote_subst"`' host='`$ECHO "$host" | $SED "$delay_single_quote_subst"`' host_os='`$ECHO "$host_os" | $SED "$delay_single_quote_subst"`' build_alias='`$ECHO "$build_alias" | $SED "$delay_single_quote_subst"`' build='`$ECHO "$build" | $SED "$delay_single_quote_subst"`' build_os='`$ECHO "$build_os" | $SED "$delay_single_quote_subst"`' SED='`$ECHO "$SED" | $SED "$delay_single_quote_subst"`' Xsed='`$ECHO "$Xsed" | $SED "$delay_single_quote_subst"`' GREP='`$ECHO "$GREP" | $SED "$delay_single_quote_subst"`' EGREP='`$ECHO "$EGREP" | $SED "$delay_single_quote_subst"`' FGREP='`$ECHO "$FGREP" | $SED "$delay_single_quote_subst"`' LD='`$ECHO "$LD" | $SED "$delay_single_quote_subst"`' NM='`$ECHO "$NM" | $SED "$delay_single_quote_subst"`' LN_S='`$ECHO "$LN_S" | $SED "$delay_single_quote_subst"`' max_cmd_len='`$ECHO "$max_cmd_len" | $SED "$delay_single_quote_subst"`' ac_objext='`$ECHO "$ac_objext" | $SED "$delay_single_quote_subst"`' exeext='`$ECHO "$exeext" | $SED "$delay_single_quote_subst"`' lt_unset='`$ECHO "$lt_unset" | $SED "$delay_single_quote_subst"`' lt_SP2NL='`$ECHO "$lt_SP2NL" | $SED "$delay_single_quote_subst"`' lt_NL2SP='`$ECHO "$lt_NL2SP" | $SED "$delay_single_quote_subst"`' lt_cv_to_host_file_cmd='`$ECHO "$lt_cv_to_host_file_cmd" | $SED "$delay_single_quote_subst"`' lt_cv_to_tool_file_cmd='`$ECHO "$lt_cv_to_tool_file_cmd" | $SED "$delay_single_quote_subst"`' reload_flag='`$ECHO "$reload_flag" | $SED "$delay_single_quote_subst"`' reload_cmds='`$ECHO "$reload_cmds" | $SED "$delay_single_quote_subst"`' OBJDUMP='`$ECHO "$OBJDUMP" | $SED "$delay_single_quote_subst"`' deplibs_check_method='`$ECHO "$deplibs_check_method" | $SED "$delay_single_quote_subst"`' file_magic_cmd='`$ECHO "$file_magic_cmd" | $SED "$delay_single_quote_subst"`' file_magic_glob='`$ECHO "$file_magic_glob" | $SED "$delay_single_quote_subst"`' want_nocaseglob='`$ECHO "$want_nocaseglob" | $SED "$delay_single_quote_subst"`' DLLTOOL='`$ECHO "$DLLTOOL" | $SED "$delay_single_quote_subst"`' sharedlib_from_linklib_cmd='`$ECHO "$sharedlib_from_linklib_cmd" | $SED "$delay_single_quote_subst"`' AR='`$ECHO "$AR" | $SED "$delay_single_quote_subst"`' AR_FLAGS='`$ECHO "$AR_FLAGS" | $SED "$delay_single_quote_subst"`' archiver_list_spec='`$ECHO "$archiver_list_spec" | $SED "$delay_single_quote_subst"`' STRIP='`$ECHO "$STRIP" | $SED "$delay_single_quote_subst"`' RANLIB='`$ECHO "$RANLIB" | $SED "$delay_single_quote_subst"`' old_postinstall_cmds='`$ECHO "$old_postinstall_cmds" | $SED "$delay_single_quote_subst"`' old_postuninstall_cmds='`$ECHO "$old_postuninstall_cmds" | $SED "$delay_single_quote_subst"`' old_archive_cmds='`$ECHO "$old_archive_cmds" | $SED "$delay_single_quote_subst"`' lock_old_archive_extraction='`$ECHO "$lock_old_archive_extraction" | $SED "$delay_single_quote_subst"`' CC='`$ECHO "$CC" | $SED "$delay_single_quote_subst"`' CFLAGS='`$ECHO "$CFLAGS" | $SED "$delay_single_quote_subst"`' compiler='`$ECHO "$compiler" | $SED "$delay_single_quote_subst"`' GCC='`$ECHO "$GCC" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_pipe='`$ECHO "$lt_cv_sys_global_symbol_pipe" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_cdecl='`$ECHO "$lt_cv_sys_global_symbol_to_cdecl" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_import='`$ECHO "$lt_cv_sys_global_symbol_to_import" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $SED "$delay_single_quote_subst"`' lt_cv_nm_interface='`$ECHO "$lt_cv_nm_interface" | $SED "$delay_single_quote_subst"`' nm_file_list_spec='`$ECHO "$nm_file_list_spec" | $SED "$delay_single_quote_subst"`' lt_sysroot='`$ECHO "$lt_sysroot" | $SED "$delay_single_quote_subst"`' objdir='`$ECHO "$objdir" | $SED "$delay_single_quote_subst"`' MAGIC_CMD='`$ECHO "$MAGIC_CMD" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag='`$ECHO "$lt_prog_compiler_no_builtin_flag" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_pic='`$ECHO "$lt_prog_compiler_pic" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_wl='`$ECHO "$lt_prog_compiler_wl" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_static='`$ECHO "$lt_prog_compiler_static" | $SED "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o='`$ECHO "$lt_cv_prog_compiler_c_o" | $SED "$delay_single_quote_subst"`' need_locks='`$ECHO "$need_locks" | $SED "$delay_single_quote_subst"`' MANIFEST_TOOL='`$ECHO "$MANIFEST_TOOL" | $SED "$delay_single_quote_subst"`' DSYMUTIL='`$ECHO "$DSYMUTIL" | $SED "$delay_single_quote_subst"`' NMEDIT='`$ECHO "$NMEDIT" | $SED "$delay_single_quote_subst"`' LIPO='`$ECHO "$LIPO" | $SED "$delay_single_quote_subst"`' OTOOL='`$ECHO "$OTOOL" | $SED "$delay_single_quote_subst"`' OTOOL64='`$ECHO "$OTOOL64" | $SED "$delay_single_quote_subst"`' libext='`$ECHO "$libext" | $SED "$delay_single_quote_subst"`' shrext_cmds='`$ECHO "$shrext_cmds" | $SED "$delay_single_quote_subst"`' extract_expsyms_cmds='`$ECHO "$extract_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds_need_lc='`$ECHO "$archive_cmds_need_lc" | $SED "$delay_single_quote_subst"`' enable_shared_with_static_runtimes='`$ECHO "$enable_shared_with_static_runtimes" | $SED "$delay_single_quote_subst"`' export_dynamic_flag_spec='`$ECHO "$export_dynamic_flag_spec" | $SED "$delay_single_quote_subst"`' whole_archive_flag_spec='`$ECHO "$whole_archive_flag_spec" | $SED "$delay_single_quote_subst"`' compiler_needs_object='`$ECHO "$compiler_needs_object" | $SED "$delay_single_quote_subst"`' old_archive_from_new_cmds='`$ECHO "$old_archive_from_new_cmds" | $SED "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds='`$ECHO "$old_archive_from_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds='`$ECHO "$archive_cmds" | $SED "$delay_single_quote_subst"`' archive_expsym_cmds='`$ECHO "$archive_expsym_cmds" | $SED "$delay_single_quote_subst"`' module_cmds='`$ECHO "$module_cmds" | $SED "$delay_single_quote_subst"`' module_expsym_cmds='`$ECHO "$module_expsym_cmds" | $SED "$delay_single_quote_subst"`' with_gnu_ld='`$ECHO "$with_gnu_ld" | $SED "$delay_single_quote_subst"`' allow_undefined_flag='`$ECHO "$allow_undefined_flag" | $SED "$delay_single_quote_subst"`' no_undefined_flag='`$ECHO "$no_undefined_flag" | $SED "$delay_single_quote_subst"`' hardcode_libdir_flag_spec='`$ECHO "$hardcode_libdir_flag_spec" | $SED "$delay_single_quote_subst"`' hardcode_libdir_separator='`$ECHO "$hardcode_libdir_separator" | $SED "$delay_single_quote_subst"`' hardcode_direct='`$ECHO "$hardcode_direct" | $SED "$delay_single_quote_subst"`' hardcode_direct_absolute='`$ECHO "$hardcode_direct_absolute" | $SED "$delay_single_quote_subst"`' hardcode_minus_L='`$ECHO "$hardcode_minus_L" | $SED "$delay_single_quote_subst"`' hardcode_shlibpath_var='`$ECHO "$hardcode_shlibpath_var" | $SED "$delay_single_quote_subst"`' hardcode_automatic='`$ECHO "$hardcode_automatic" | $SED "$delay_single_quote_subst"`' inherit_rpath='`$ECHO "$inherit_rpath" | $SED "$delay_single_quote_subst"`' link_all_deplibs='`$ECHO "$link_all_deplibs" | $SED "$delay_single_quote_subst"`' always_export_symbols='`$ECHO "$always_export_symbols" | $SED "$delay_single_quote_subst"`' export_symbols_cmds='`$ECHO "$export_symbols_cmds" | $SED "$delay_single_quote_subst"`' exclude_expsyms='`$ECHO "$exclude_expsyms" | $SED "$delay_single_quote_subst"`' include_expsyms='`$ECHO "$include_expsyms" | $SED "$delay_single_quote_subst"`' prelink_cmds='`$ECHO "$prelink_cmds" | $SED "$delay_single_quote_subst"`' postlink_cmds='`$ECHO "$postlink_cmds" | $SED "$delay_single_quote_subst"`' file_list_spec='`$ECHO "$file_list_spec" | $SED "$delay_single_quote_subst"`' variables_saved_for_relink='`$ECHO "$variables_saved_for_relink" | $SED "$delay_single_quote_subst"`' need_lib_prefix='`$ECHO "$need_lib_prefix" | $SED "$delay_single_quote_subst"`' need_version='`$ECHO "$need_version" | $SED "$delay_single_quote_subst"`' version_type='`$ECHO "$version_type" | $SED "$delay_single_quote_subst"`' runpath_var='`$ECHO "$runpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_var='`$ECHO "$shlibpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_overrides_runpath='`$ECHO "$shlibpath_overrides_runpath" | $SED "$delay_single_quote_subst"`' libname_spec='`$ECHO "$libname_spec" | $SED "$delay_single_quote_subst"`' library_names_spec='`$ECHO "$library_names_spec" | $SED "$delay_single_quote_subst"`' soname_spec='`$ECHO "$soname_spec" | $SED "$delay_single_quote_subst"`' install_override_mode='`$ECHO "$install_override_mode" | $SED "$delay_single_quote_subst"`' postinstall_cmds='`$ECHO "$postinstall_cmds" | $SED "$delay_single_quote_subst"`' postuninstall_cmds='`$ECHO "$postuninstall_cmds" | $SED "$delay_single_quote_subst"`' finish_cmds='`$ECHO "$finish_cmds" | $SED "$delay_single_quote_subst"`' finish_eval='`$ECHO "$finish_eval" | $SED "$delay_single_quote_subst"`' hardcode_into_libs='`$ECHO "$hardcode_into_libs" | $SED "$delay_single_quote_subst"`' sys_lib_search_path_spec='`$ECHO "$sys_lib_search_path_spec" | $SED "$delay_single_quote_subst"`' sys_lib_dlsearch_path_spec='`$ECHO "$sys_lib_dlsearch_path_spec" | $SED "$delay_single_quote_subst"`' hardcode_action='`$ECHO "$hardcode_action" | $SED "$delay_single_quote_subst"`' enable_dlopen='`$ECHO "$enable_dlopen" | $SED "$delay_single_quote_subst"`' enable_dlopen_self='`$ECHO "$enable_dlopen_self" | $SED "$delay_single_quote_subst"`' enable_dlopen_self_static='`$ECHO "$enable_dlopen_self_static" | $SED "$delay_single_quote_subst"`' old_striplib='`$ECHO "$old_striplib" | $SED "$delay_single_quote_subst"`' striplib='`$ECHO "$striplib" | $SED "$delay_single_quote_subst"`' LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } # Quote evaled strings. for var in SHELL \ ECHO \ PATH_SEPARATOR \ SED \ GREP \ EGREP \ FGREP \ LD \ NM \ LN_S \ lt_SP2NL \ lt_NL2SP \ reload_flag \ OBJDUMP \ deplibs_check_method \ file_magic_cmd \ file_magic_glob \ want_nocaseglob \ DLLTOOL \ sharedlib_from_linklib_cmd \ AR \ AR_FLAGS \ archiver_list_spec \ STRIP \ RANLIB \ CC \ CFLAGS \ compiler \ lt_cv_sys_global_symbol_pipe \ lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_import \ lt_cv_sys_global_symbol_to_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ lt_cv_nm_interface \ nm_file_list_spec \ lt_prog_compiler_no_builtin_flag \ lt_prog_compiler_pic \ lt_prog_compiler_wl \ lt_prog_compiler_static \ lt_cv_prog_compiler_c_o \ need_locks \ MANIFEST_TOOL \ DSYMUTIL \ NMEDIT \ LIPO \ OTOOL \ OTOOL64 \ shrext_cmds \ export_dynamic_flag_spec \ whole_archive_flag_spec \ compiler_needs_object \ with_gnu_ld \ allow_undefined_flag \ no_undefined_flag \ hardcode_libdir_flag_spec \ hardcode_libdir_separator \ exclude_expsyms \ include_expsyms \ file_list_spec \ variables_saved_for_relink \ libname_spec \ library_names_spec \ soname_spec \ install_override_mode \ finish_eval \ old_striplib \ striplib; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in reload_cmds \ old_postinstall_cmds \ old_postuninstall_cmds \ old_archive_cmds \ extract_expsyms_cmds \ old_archive_from_new_cmds \ old_archive_from_expsyms_cmds \ archive_cmds \ archive_expsym_cmds \ module_cmds \ module_expsym_cmds \ export_symbols_cmds \ prelink_cmds \ postlink_cmds \ postinstall_cmds \ postuninstall_cmds \ finish_cmds \ sys_lib_search_path_spec \ sys_lib_dlsearch_path_spec; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ## exclude from sc_prohibit_nested_quotes ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done ac_aux_dir='$ac_aux_dir' # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi PACKAGE='$PACKAGE' VERSION='$VERSION' RM='$RM' ofile='$ofile' ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;; "$ax_create_pkgconfig_generate") CONFIG_COMMANDS="$CONFIG_COMMANDS $ax_create_pkgconfig_generate" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "test/Makefile") CONFIG_FILES="$CONFIG_FILES test/Makefile" ;; "autoconf/Doxyfile") CONFIG_FILES="$CONFIG_FILES autoconf/Doxyfile" ;; "doc/Makefile") CONFIG_FILES="$CONFIG_FILES doc/Makefile" ;; "source/version.c") CONFIG_FILES="$CONFIG_FILES source/version.c" ;; "include/cloog/version.h") CONFIG_FILES="$CONFIG_FILES include/cloog/version.h" ;; "genversion.sh") CONFIG_FILES="$CONFIG_FILES genversion.sh" ;; "version.h") CONFIG_COMMANDS="$CONFIG_COMMANDS version.h" ;; "doc/gitversion.texi") CONFIG_COMMANDS="$CONFIG_COMMANDS doc/gitversion.texi" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" eval set X " :F $CONFIG_FILES :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; "libtool":C) # See if we are running on zsh, and set the options that allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}"; then setopt NO_GLOB_SUBST fi cfgfile=${ofile}T trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License as # published by the Free Software Foundation; either version 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # The names of the tagged configurations supported by this script. available_tags='' # ### BEGIN LIBTOOL CONFIG # Which release of libtool.m4 was used? macro_version=$macro_version macro_revision=$macro_revision # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # What type of objects to build. pic_mode=$pic_mode # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # An echo program that protects backslashes. ECHO=$lt_ECHO # The PATH separator for the build system. PATH_SEPARATOR=$lt_PATH_SEPARATOR # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="\$SED -e 1s/^X//" # A grep program that handles long lines. GREP=$lt_GREP # An ERE matcher. EGREP=$lt_EGREP # A literal string matcher. FGREP=$lt_FGREP # A BSD- or MS-compatible name lister. NM=$lt_NM # Whether we need soft or hard links. LN_S=$lt_LN_S # What is the maximum length of a command? max_cmd_len=$max_cmd_len # Object file suffix (normally "o"). objext=$ac_objext # Executable file suffix (normally ""). exeext=$exeext # whether the shell understands "unset". lt_unset=$lt_unset # turn spaces into newlines. SP2NL=$lt_lt_SP2NL # turn newlines into spaces. NL2SP=$lt_lt_NL2SP # convert \$build file names to \$host format. to_host_file_cmd=$lt_cv_to_host_file_cmd # convert \$build files to toolchain format. to_tool_file_cmd=$lt_cv_to_tool_file_cmd # An object symbol dumper. OBJDUMP=$lt_OBJDUMP # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method = "file_magic". file_magic_cmd=$lt_file_magic_cmd # How to find potential files when deplibs_check_method = "file_magic". file_magic_glob=$lt_file_magic_glob # Find potential files using nocaseglob when deplibs_check_method = "file_magic". want_nocaseglob=$lt_want_nocaseglob # DLL creation program. DLLTOOL=$lt_DLLTOOL # Command to associate shared and link libraries. sharedlib_from_linklib_cmd=$lt_sharedlib_from_linklib_cmd # The archiver. AR=$lt_AR # Flags to create an archive. AR_FLAGS=$lt_AR_FLAGS # How to feed a file listing to the archiver. archiver_list_spec=$lt_archiver_list_spec # A symbol stripping program. STRIP=$lt_STRIP # Commands used to install an old-style archive. RANLIB=$lt_RANLIB old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Whether to use a lock for old archive extraction. lock_old_archive_extraction=$lock_old_archive_extraction # A C compiler. LTCC=$lt_CC # LTCC compiler flags. LTCFLAGS=$lt_CFLAGS # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration. global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm into a list of symbols to manually relocate. global_symbol_to_import=$lt_lt_cv_sys_global_symbol_to_import # Transform the output of nm in a C name address pair. global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # Transform the output of nm in a C name address pair when lib prefix is needed. global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix # The name lister interface. nm_interface=$lt_lt_cv_nm_interface # Specify filename containing input files for \$NM. nm_file_list_spec=$lt_nm_file_list_spec # The root where to search for dependent libraries,and where our libraries should be installed. lt_sysroot=$lt_sysroot # The name of the directory that contains temporary libtool files. objdir=$objdir # Used to examine libraries when file_magic_cmd begins with "file". MAGIC_CMD=$MAGIC_CMD # Must we lock files when doing compilation? need_locks=$lt_need_locks # Manifest tool. MANIFEST_TOOL=$lt_MANIFEST_TOOL # Tool to manipulate archived DWARF debug symbol files on Mac OS X. DSYMUTIL=$lt_DSYMUTIL # Tool to change global to local symbols on Mac OS X. NMEDIT=$lt_NMEDIT # Tool to manipulate fat objects and archives on Mac OS X. LIPO=$lt_LIPO # ldd/readelf like tool for Mach-O binaries on Mac OS X. OTOOL=$lt_OTOOL # ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4. OTOOL64=$lt_OTOOL64 # Old archive suffix (normally "a"). libext=$libext # Shared library suffix (normally ".so"). shrext_cmds=$lt_shrext_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Variables whose values should be saved in libtool wrapper scripts and # restored at link time. variables_saved_for_relink=$lt_variables_saved_for_relink # Do we need the "lib" prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Library versioning type. version_type=$version_type # Shared library runtime path variable. runpath_var=$runpath_var # Shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Permission mode override for installation of shared libraries. install_override_mode=$lt_install_override_mode # Command to use after installation of a shared archive. postinstall_cmds=$lt_postinstall_cmds # Command to use after uninstallation of a shared archive. postuninstall_cmds=$lt_postuninstall_cmds # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # As "finish_cmds", except a single script fragment to be evaled but # not shown. finish_eval=$lt_finish_eval # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Compile-time system search path for libraries. sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries. sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # The linker used to build libraries. LD=$lt_LD # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds # A language specific compiler. CC=$lt_compiler # Is the compiler the GNU compiler? with_gcc=$GCC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to "yes" if using DIR/libNAME\$shared_ext during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct # Set to "yes" if using DIR/libNAME\$shared_ext during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \$shlibpath_var if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds # Commands necessary for finishing linking programs. postlink_cmds=$lt_postlink_cmds # Specify filename containing input files. file_list_spec=$lt_file_list_spec # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test set != "${COLLECT_NAMES+set}"; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac ltmain=$ac_aux_dir/ltmain.sh # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ;; "$ax_create_pkgconfig_generate":C) pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_generate.in" >&5 $as_echo "$as_me: creating $pkgconfig_generate.in" >&6;} cat > $pkgconfig_generate.in <&5 $as_echo "$as_me: creating $pkgconfig_generate" >&6;} cat >conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then as_fn_error $? "$pkgconfig_generate is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error $? "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error $? "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ;; "genversion.sh":F) chmod +x genversion.sh ;; "version.h":C) echo '#define CLOOG_HEAD "'`./genversion.sh`'"' > version.h ;; "doc/gitversion.texi":C) echo '@set VERSION '`./genversion.sh`'' > doc/gitversion.texi ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 ac_configure_args="$ac_configure_args $cloog_configure_args" # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi # # CONFIG_SUBDIRS section. # if test "$no_recursion" != yes; then # Remove --cache-file, --srcdir, and --disable-option-checking arguments # so they do not pile up. ac_sub_configure_args= ac_prev= eval "set x $ac_configure_args" shift for ac_arg do if test -n "$ac_prev"; then ac_prev= continue fi case $ac_arg in -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* \ | --c=*) ;; --config-cache | -C) ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) ;; --disable-option-checking) ;; *) case $ac_arg in *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append ac_sub_configure_args " '$ac_arg'" ;; esac done # Always prepend --prefix to ensure using the same prefix # in subdir configurations. ac_arg="--prefix=$prefix" case $ac_arg in *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac ac_sub_configure_args="'$ac_arg' $ac_sub_configure_args" # Pass --silent if test "$silent" = yes; then ac_sub_configure_args="--silent $ac_sub_configure_args" fi # Always prepend --disable-option-checking to silence warnings, since # different subdirs can have different --enable and --with options. ac_sub_configure_args="--disable-option-checking $ac_sub_configure_args" ac_popdir=`pwd` for ac_dir in : $subdirs; do test "x$ac_dir" = x: && continue # Do not complain, so a configure script can configure whichever # parts of a large source tree are present. test -d "$srcdir/$ac_dir" || continue ac_msg="=== configuring in $ac_dir (`pwd`/$ac_dir)" $as_echo "$as_me:${as_lineno-$LINENO}: $ac_msg" >&5 $as_echo "$ac_msg" >&6 as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" # Check for guested configure; otherwise get Cygnus style configure. if test -f "$ac_srcdir/configure.gnu"; then ac_sub_configure=$ac_srcdir/configure.gnu elif test -f "$ac_srcdir/configure"; then ac_sub_configure=$ac_srcdir/configure elif test -f "$ac_srcdir/configure.in"; then # This should be Cygnus configure. ac_sub_configure=$ac_aux_dir/configure else { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: no configuration information is in $ac_dir" >&5 $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2;} ac_sub_configure= fi # The recursion is here. if test -n "$ac_sub_configure"; then # Make the cache file name correct relative to the subdirectory. case $cache_file in [\\/]* | ?:[\\/]* ) ac_sub_cache_file=$cache_file ;; *) # Relative name. ac_sub_cache_file=$ac_top_build_prefix$cache_file ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: running $SHELL $ac_sub_configure $ac_sub_configure_args --cache-file=$ac_sub_cache_file --srcdir=$ac_srcdir" >&5 $as_echo "$as_me: running $SHELL $ac_sub_configure $ac_sub_configure_args --cache-file=$ac_sub_cache_file --srcdir=$ac_srcdir" >&6;} # The eval makes quoting arguments work. eval "\$SHELL \"\$ac_sub_configure\" $ac_sub_configure_args \ --cache-file=\"\$ac_sub_cache_file\" --srcdir=\"\$ac_srcdir\"" || as_fn_error $? "$ac_sub_configure failed for $ac_dir" "$LINENO" 5 fi cd "$ac_popdir" done fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi echo " /*-----------------------------------------------*" echo " * CLooG configuration is OK *" echo " *-----------------------------------------------*/" echo "It appears that your system is OK to start CLooG compilation. You need" echo "now to type \"make\". After compilation, you should check CLooG by typing" echo "\"make check\". If no problem occur, you can type \"make uninstall\" if" echo "you are upgrading an old version. Lastly type \"make install\" to install" echo "CLooG on your system (log as root if necessary)." cloog-0.18.2/aclocal.m40000664000175000017500000011050412254313267011476 00000000000000# generated automatically by aclocal 1.11.3 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, # Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.68],, [m4_warning([this file was generated for autoconf 2.68. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically `autoreconf'.])]) # Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008, 2011 Free Software # Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.11' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.11.3], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.11.3])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to # `$srcdir', `$srcdir/..', or `$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is `.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 9 # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ(2.52)dnl ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009, # 2010, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 12 # There are a few dirty hacks below to avoid letting `AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "GCJ", or "OBJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl ifelse([$1], CC, [depcc="$CC" am_compiler_list=], [$1], CXX, [depcc="$CXX" am_compiler_list=], [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], UPC, [depcc="$UPC" am_compiler_list=], [$1], GCJ, [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok `-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE(dependency-tracking, [ --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl AC_SUBST([am__nodep])dnl _AM_SUBST_NOTMAKE([am__nodep])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. #serial 5 # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Autoconf 2.62 quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each `.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2008, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 16 # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.62])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package]) AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}) AM_MISSING_PROG(AUTOCONF, autoconf) AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}) AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AM_PROG_MKDIR_P])dnl # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES(CC)], [define([AC_PROG_CC], defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES(CXX)], [define([AC_PROG_CXX], defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES(OBJC)], [define([AC_PROG_OBJC], defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl ]) _AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl dnl The `parallel-tests' driver may need to know about EXEEXT, so add the dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro dnl is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl ]) dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001, 2003, 2005, 2008, 2011 Free Software Foundation, # Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST(install_sh)]) # Copyright (C) 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2009 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from `make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 6 # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it supports --run. # If it does, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= AC_MSG_WARN([`missing' script is too old or missing]) fi ]) # Copyright (C) 2003, 2004, 2005, 2006, 2011 Free Software Foundation, # Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_PROG_MKDIR_P # --------------- # Check for `mkdir -p'. AC_DEFUN([AM_PROG_MKDIR_P], [AC_PREREQ([2.60])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P, dnl while keeping a definition of mkdir_p for backward compatibility. dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile. dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of dnl Makefile.ins that do not define MKDIR_P, so we do our own dnl adjustment using top_builddir (which is defined more often than dnl MKDIR_P). AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl case $mkdir_p in [[\\/$]]* | ?:[[\\/]]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005, 2008, 2010 Free Software # Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # -------------------- # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), 1)]) # _AM_SET_OPTIONS(OPTIONS) # ------------------------ # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Just in case sleep 1 echo timestamp > conftest.file # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);; esac # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi rm -f conftest.file if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT(yes)]) # Copyright (C) 2009, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # AM_SILENT_RULES([DEFAULT]) # -------------------------- # Enable less verbose build rules; with the default set to DEFAULT # (`yes' being less verbose, `no' or empty being verbose). AC_DEFUN([AM_SILENT_RULES], [AC_ARG_ENABLE([silent-rules], [ --enable-silent-rules less verbose build output (undo: `make V=1') --disable-silent-rules verbose build output (undo: `make V=0')]) case $enable_silent_rules in yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);; esac dnl dnl A few `make' implementations (e.g., NonStop OS and NextStep) dnl do not support nested variable expansions. dnl See automake bug#9928 and bug#10237. am_make=${MAKE-make} AC_CACHE_CHECK([whether $am_make supports nested variables], [am_cv_make_support_nested_variables], [if AS_ECHO([['TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi]) if test $am_cv_make_support_nested_variables = yes; then dnl Using `$V' instead of `$(V)' breaks IRIX make. AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AC_SUBST([AM_V])dnl AM_SUBST_NOTMAKE([AM_V])dnl AC_SUBST([AM_DEFAULT_V])dnl AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl AC_SUBST([AM_DEFAULT_VERBOSITY])dnl AM_BACKSLASH='\' AC_SUBST([AM_BACKSLASH])dnl _AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl ]) # Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 1 # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in `make install-strip', and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be `maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006, 2008, 2010 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 3 # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # -------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004, 2005, 2012 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of `v7', `ustar', or `pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AC_SUBST([AMTAR], ['$${TAR-tar}']) m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar],, [pax],, [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' _am_tools=${am_cv_prog_tar_$1-$_am_tools} # Do not fold the above two line into one, because Tru64 sh and # Solaris sh will not grok spaces in the rhs of `-'. for _am_tool in $_am_tools do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR m4_include([m4/ax_cc_maxopt.m4]) m4_include([m4/ax_cflags_warn_all.m4]) m4_include([m4/ax_check_compiler_flags.m4]) m4_include([m4/ax_compiler_vendor.m4]) m4_include([m4/ax_create_pkgconfig_info.m4]) m4_include([m4/ax_gcc_archflag.m4]) m4_include([m4/ax_gcc_x86_cpuid.m4]) m4_include([m4/ax_submodule.m4]) m4_include([m4/libtool.m4]) m4_include([m4/ltoptions.m4]) m4_include([m4/ltsugar.m4]) m4_include([m4/ltversion.m4]) m4_include([m4/lt~obsolete.m4])